/* 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 <iostream>
#include <stdint.h>
#include <stdio.h>

#include "host.hpp"
#include "h_barabasi_game.hpp"

#include <utility>                   // for std::pair
  #include <algorithm>                 // for std::for_each
  #include <boost/graph/graph_traits.hpp>
  #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/dijkstra_shortest_paths.hpp>

 using namespace boost;

 template <class Graph>
 struct print_edges {
   print_edges(Graph& g) : G(g) { }

   typedef typename boost::graph_traits<Graph>::edge_descriptor Edge;
   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
   void operator()(Edge e) const
   {
     typename boost::property_map<Graph, vertex_index_t>::type
       id = get(vertex_index, G);

     Vertex src = source(e, G);
     Vertex targ = target(e, G);

     cout << "(" << id[src] << "," << id[targ] << ") ";
   }

   Graph& G;
 };

 template <class Graph>
 struct print_index {
   print_index(Graph& g) : G(g){ }

   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
   void operator()(Vertex c) const
   {
     typename boost::property_map<Graph,vertex_index_t>::type
       id = get(vertex_index, G);
     cout << id[c] << " ";
   }

   Graph& G;
 };


 template <class Graph>
 struct stampa {
   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;

   stampa(Graph& _g) : g(_g) { }

   void operator()(Vertex v) const
   {
     typename boost::property_map<Graph, vertex_index_t>::type
       id = get(vertex_index, g);

     cout << "vertex id: " << id[v] << endl;

     cout << "out-edges: ";
     for_each(out_edges(v, g).first, out_edges(v,g).second,
              print_edges<Graph>(g));

     cout << endl;

   }

   Graph& g;
 };



int main(){


    // writing out the edges in the graph
    typedef std::pair<int, int> Edge;


Graph g = h_barabasi_game(3,1,100);
h_average_links_number = 5;
h_max_nodes_number= 100;
//calcParameters(g);

//Allocate memory for Host Compact List (Supplementary Link array size, max nodes number, average links number)
h_allocateDataStructures(200);
printf("Numero nodi :%d\n",h_max_nodes_number);
printf("Numero average_edges :%d\n",h_average_links_number);
Link p;
p.target = -1;


//Initialize Nodes Array and Links Array
h_initArray<bool>(false,h_nodes_array,100);
h_initArray<Link>(p,h_links_target_array,h_average_links_number*100);
//Convert Boost adjacency list to Compact List
adjlistToCompactList(g);

int j = 0;
for(j=0; j<h_max_nodes_number; j++){
printf("Scorro L'array dei nodi[%d]= %d\n",j,h_nodes_array[j]);
}

for(j=0; j<h_average_links_number*100; j++){
printf("Scorro L'array dei link[%d]= %d\n",j,h_links_target_array[j].target);
}

//Convert CompactList to AdjacencyList

CompactListToAdjList(&g);

 boost::property_map<Graph, vertex_index_t>::type
    id = get(vertex_index, g);

 // cout << "vertices(g) = ";
 // boost::graph_traits<Graph>::vertex_iterator vi;
  //for (vi = vertices(g).first; vi != vertices(g).second; ++vi)
   // std::cout << id[*vi] <<  " ";
  //std::cout << std::endl;

  for_each(vertices(g).first, vertices(g).second,
           stampa<Graph>(g));



return 1;
}

*/

	.file	"tmpxft_002ff75c_00000000-6_host_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 <iostream>
#include <stdint.h>
#include <stdio.h>

#include "host.hpp"
#include "h_barabasi_game.hpp"

#include <utility>                   // for std::pair
  #include <algorithm>                 // for std::for_each
  #include <boost/graph/graph_traits.hpp>
  #include <boost/graph/adjacency_list.hpp>
 #include <boost/graph/dijkstra_shortest_paths.hpp>

 using namespace boost;

 template <class Graph>
 struct print_edges {
   print_edges(Graph& g) : G(g) { }

   typedef typename boost::graph_traits<Graph>::edge_descriptor Edge;
   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
   void operator()(Edge e) const
   {
     typename boost::property_map<Graph, vertex_index_t>::type
       id = get(vertex_index, G);

     Vertex src = source(e, G);
     Vertex targ = target(e, G);

     cout << "(" << id[src] << "," << id[targ] << ") ";
   }

   Graph& G;
 };

 template <class Graph>
 struct print_index {
   print_index(Graph& g) : G(g){ }

   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;
   void operator()(Vertex c) const
   {
     typename boost::property_map<Graph,vertex_index_t>::type
       id = get(vertex_index, G);
     cout << id[c] << " ";
   }

   Graph& G;
 };


 template <class Graph>
 struct stampa {
   typedef typename boost::graph_traits<Graph>::vertex_descriptor Vertex;

   stampa(Graph& _g) : g(_g) { }

   void operator()(Vertex v) const
   {
     typename boost::property_map<Graph, vertex_index_t>::type
       id = get(vertex_index, g);

     cout << "vertex id: " << id[v] << endl;

     cout << "out-edges: ";
     for_each(out_edges(v, g).first, out_edges(v,g).second,
              print_edges<Graph>(g));

     cout << endl;

   }

   Graph& g;
 };



int main(){


    // writing out the edges in the graph
    typedef std::pair<int, int> Edge;


Graph g = h_barabasi_game(3,1,100);
h_average_links_number = 5;
h_max_nodes_number= 100;
//calcParameters(g);

//Allocate memory for Host Compact List (Supplementary Link array size, max nodes number, average links number)
h_allocateDataStructures(200);
printf("Numero nodi :%d\n",h_max_nodes_number);
printf("Numero average_edges :%d\n",h_average_links_number);
Link p;
p.target = -1;


//Initialize Nodes Array and Links Array
h_initArray<bool>(false,h_nodes_array,100);
h_initArray<Link>(p,h_links_target_array,h_average_links_number*100);
//Convert Boost adjacency list to Compact List
adjlistToCompactList(g);

int j = 0;
for(j=0; j<h_max_nodes_number; j++){
printf("Scorro L'array dei nodi[%d]= %d\n",j,h_nodes_array[j]);
}

for(j=0; j<h_average_links_number*100; j++){
printf("Scorro L'array dei link[%d]= %d\n",j,h_links_target_array[j].target);
}

//Convert CompactList to AdjacencyList

CompactListToAdjList(&g);

 boost::property_map<Graph, vertex_index_t>::type
    id = get(vertex_index, g);

 // cout << "vertices(g) = ";
 // boost::graph_traits<Graph>::vertex_iterator vi;
  //for (vi = vertices(g).first; vi != vertices(g).second; ++vi)
   // std::cout << id[*vi] <<  " ";
  //std::cout << std::endl;

  for_each(vertices(g).first, vertices(g).second,
           stampa<Graph>(g));



return 1;
}

*/

	.text
	.file	"host_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
