/* Copyright (C) 2012  Fabrizio Gueli
 *
 * This file is part of Cuda-complex-sim
 *
 * Cuda-complex-sim is free software: you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation, either
 * version 3 of the License, or (at your option) any later version.
 *
 * Cuda-complex-sim is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with Cuda-complex-sim.  If not, see <http://www.gnu.org/licenses/>.
 */

/*
#include "device.cuh"
#include "host.hpp"
#include "graph_transf.hpp"
#include "h_barabasi_game.hpp"
#include "hygra.cuh"


int main(int argc, char** argv)
{

		bool* nodes_dev;
		Link* links_target_dev;
		bool* flagw_array;
		bool* flagr_array;
		uint32_t* counter;
		task_t* task_dev;
		task_arguments* task_args_dev;
		message_t* inbox_dev;
		n_attribute *prog;
		curandState *d_state;

//		if (argc!=3)
	//		{
//				perror("\nErrore");
//				exit(1);
//			}


//	uint32_t max_nodes=atoi(argv[1]);
//	uint8_t average_links=atoi(argv[2]);
	uint16_t supplementary_size= 10;




	uint32_t max_nodes = 1000000;
	uint8_t average_links= 2;
	uint16_t barabasi_initial_nodes=average_links+1;

	allocateDataStructures(&prog,&nodes_dev, &task_dev, &task_args_dev, &links_target_dev, &inbox_dev,max_nodes,average_links,supplementary_size,&d_state,&flagw_array,&flagr_array,&counter);
	h_allocateDataStructures(supplementary_size,max_nodes,average_links);

	Graph g = h_barabasi_game(barabasi_initial_nodes, 1, max_nodes);
	startSimulation(links_target_dev,nodes_dev,supplementary_size,g);




	srand(time(NULL));
//	Link init;
//	init.target=-1;
//	init_data<<<BLOCKS,THREADS_PER_BLOCK>>>();
//	h_initArray<bool>(false,h_nodes_array,h_max_nodes_number);
//	h_initArray<Link>(init, h_links_target_array, h_max_nodes_number*h_average_links_number);

//	adjlistToCompactList(g);

//	copyToDevice(nodes_dev,h_nodes_array , 0, h_max_nodes_number );
//	copyToDevice(links_target_dev,h_links_target_array ,0, h_max_nodes_number*h_average_links_number );

  	size_t avail;
  	size_t total;
  	cudaMemGetInfo( &avail, &total );

  	size_t used = total - avail;
  	printf("\nMemoria: totale %d, in uso %d, disponibile: %d", total, used, avail);

  	cudaEvent_t start, stop;
  	cudaEventCreate(&start);
  	cudaEventCreate(&stop);
  	// Start record
  	cudaEventRecord(start, 0);

  		message_test<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		message_test2nd<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		message_test2nd<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		cudaEventRecord(stop, 0);
  		cudaEventSynchronize(stop);
  		float elapsedTime;
  		cudaEventElapsedTime(&elapsedTime, start, stop); // that's our time!
  		// Clean up:
  		cudaEventDestroy(start);
  		cudaEventDestroy(stop);
  		FILE *file;
  		file=fopen("times.txt","a");
  		fprintf(file, "%f\n",elapsedTime);
  		fflush(file);
  		fclose(file);
  		cudaThreadExit();


  return 0;
}

*/

	.file	"tmpxft_0036536b_00000000-6_scalefree_test.cudafe1.cpp"
	.text
#APP

#NO_APP
	.type	_ZL26__cudaUnregisterBinaryUtilv, @function
_ZL26__cudaUnregisterBinaryUtilv:
.LFB2010:
	.cfi_startproc
	endbr64
	movq	_ZL20__cudaFatCubinHandle(%rip), %rdi
	jmp	__cudaUnregisterFatBinary@PLT
	.cfi_endproc
.LFE2010:
	.size	_ZL26__cudaUnregisterBinaryUtilv, .-_ZL26__cudaUnregisterBinaryUtilv
	.section	.text.startup,"ax",@progbits
	.type	_ZL24__sti____cudaRegisterAllv, @function
_ZL24__sti____cudaRegisterAllv:
.LFB2033:
	.cfi_startproc
	endbr64
	pushq	%rax
	.cfi_def_cfa_offset 16
	leaq	_ZL15__fatDeviceText(%rip), %rdi
	call	__cudaRegisterFatBinary@PLT
	movq	%rax, %rdi
	movq	%rax, _ZL20__cudaFatCubinHandle(%rip)
	call	__cudaRegisterFatBinaryEnd@PLT
	leaq	_ZL26__cudaUnregisterBinaryUtilv(%rip), %rdi
	popq	%rdx
	.cfi_def_cfa_offset 8
	jmp	atexit@PLT
	.cfi_endproc
.LFE2033:
	.size	_ZL24__sti____cudaRegisterAllv, .-_ZL24__sti____cudaRegisterAllv
	.section	.init_array,"aw"
	.align 8
	.quad	_ZL24__sti____cudaRegisterAllv
	.section	.nvFatBinSegment,"aw"
	.align 8
	.type	_ZL15__fatDeviceText, @object
	.size	_ZL15__fatDeviceText, 24
_ZL15__fatDeviceText:
	.long	1180844977
	.long	1
	.quad	fatbinData
	.quad	0
	.local	_ZL20__cudaFatCubinHandle
	.comm	_ZL20__cudaFatCubinHandle,8,8
	.ident	"GCC: (Ubuntu 13.3.0-6ubuntu2~24.04) 13.3.0"
	.section	.note.GNU-stack,"",@progbits
	.section	.note.gnu.property,"a"
	.align 8
	.long	1f - 0f
	.long	4f - 1f
	.long	5
0:
	.string	"GNU"
1:
	.align 8
	.long	0xc0000002
	.long	3f - 2f
2:
	.long	0x3
3:
	.align 8
4:


#include <hip/hip_runtime.h>
/* Copyright (C) 2012  Fabrizio Gueli
 *
 * This file is part of Cuda-complex-sim
 *
 * Cuda-complex-sim is free software: you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation, either
 * version 3 of the License, or (at your option) any later version.
 *
 * Cuda-complex-sim is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with Cuda-complex-sim.  If not, see <http://www.gnu.org/licenses/>.
 */

/*
#include "device.cuh"
#include "host.hpp"
#include "graph_transf.hpp"
#include "h_barabasi_game.hpp"
#include "hygra.cuh"


int main(int argc, char** argv)
{

		bool* nodes_dev;
		Link* links_target_dev;
		bool* flagw_array;
		bool* flagr_array;
		uint32_t* counter;
		task_t* task_dev;
		task_arguments* task_args_dev;
		message_t* inbox_dev;
		n_attribute *prog;
		curandState *d_state;

//		if (argc!=3)
	//		{
//				perror("\nErrore");
//				exit(1);
//			}


//	uint32_t max_nodes=atoi(argv[1]);
//	uint8_t average_links=atoi(argv[2]);
	uint16_t supplementary_size= 10;




	uint32_t max_nodes = 1000000;
	uint8_t average_links= 2;
	uint16_t barabasi_initial_nodes=average_links+1;

	allocateDataStructures(&prog,&nodes_dev, &task_dev, &task_args_dev, &links_target_dev, &inbox_dev,max_nodes,average_links,supplementary_size,&d_state,&flagw_array,&flagr_array,&counter);
	h_allocateDataStructures(supplementary_size,max_nodes,average_links);

	Graph g = h_barabasi_game(barabasi_initial_nodes, 1, max_nodes);
	startSimulation(links_target_dev,nodes_dev,supplementary_size,g);




	srand(time(NULL));
//	Link init;
//	init.target=-1;
//	init_data<<<BLOCKS,THREADS_PER_BLOCK>>>();
//	h_initArray<bool>(false,h_nodes_array,h_max_nodes_number);
//	h_initArray<Link>(init, h_links_target_array, h_max_nodes_number*h_average_links_number);

//	adjlistToCompactList(g);

//	copyToDevice(nodes_dev,h_nodes_array , 0, h_max_nodes_number );
//	copyToDevice(links_target_dev,h_links_target_array ,0, h_max_nodes_number*h_average_links_number );

  	size_t avail;
  	size_t total;
  	cudaMemGetInfo( &avail, &total );

  	size_t used = total - avail;
  	printf("\nMemoria: totale %d, in uso %d, disponibile: %d", total, used, avail);

  	cudaEvent_t start, stop;
  	cudaEventCreate(&start);
  	cudaEventCreate(&stop);
  	// Start record
  	cudaEventRecord(start, 0);

  		message_test<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		message_test2nd<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		message_test2nd<<<BLOCKS,THREADS_PER_BLOCK,h_average_links_number*THREADS_PER_BLOCK*sizeof(Link)>>>();
  		cudaEventRecord(stop, 0);
  		cudaEventSynchronize(stop);
  		float elapsedTime;
  		cudaEventElapsedTime(&elapsedTime, start, stop); // that's our time!
  		// Clean up:
  		cudaEventDestroy(start);
  		cudaEventDestroy(stop);
  		FILE *file;
  		file=fopen("times.txt","a");
  		fprintf(file, "%f\n",elapsedTime);
  		fflush(file);
  		fclose(file);
  		cudaThreadExit();


  return 0;
}

*/

	.text
	.file	"scalefree_test.hip"
	.type	__hip_cuid_,@object             # @__hip_cuid_
	.bss
	.globl	__hip_cuid_
__hip_cuid_:
	.byte	0                               # 0x0
	.size	__hip_cuid_, 1

	.ident	"AMD clang version 18.0.0git (https://github.com/RadeonOpenCompute/llvm-project roc-6.3.2 25012 e5bf7e55c91490b07c49d8960fa7983d864936c4)"
	.section	".note.GNU-stack","",@progbits
	.addrsig
	.addrsig_sym __hip_cuid_

	.text
	.p2alignl 7, 3214868480
	.fill 96, 4, 3214868480
	.type	__hip_cuid_,@object             ; @__hip_cuid_
	.section	.bss,"aw",@nobits
	.globl	__hip_cuid_
__hip_cuid_:
	.byte	0                               ; 0x0
	.size	__hip_cuid_, 1

	.ident	"AMD clang version 18.0.0git (https://github.com/RadeonOpenCompute/llvm-project roc-6.3.2 25012 e5bf7e55c91490b07c49d8960fa7983d864936c4)"
	.section	".note.GNU-stack","",@progbits
	.addrsig
	.addrsig_sym __hip_cuid_
	.amdgcn_target "amdgcn-amd-amdhsa--gfx1100"
	.amdgpu_metadata
---
amdhsa.kernels:  []
amdhsa.target:   amdgcn-amd-amdhsa--gfx1100
amdhsa.version:
  - 1
  - 2
...

	.end_amdgpu_metadata
