1 #include "simple_API.h" 11 Edge* var_2_1_inEdges)
13 unsigned localCounter = 0;
15 var_3 = var_2_1_inEdges[i_var_3].
property;
17 var_1 = var_2_1_inEdges[i_var_3].
node;
18 int cond_level_2 = (var_3 == p_var_3);
24 for(i_var_5 = 0; i_var_5 < out_degree_var_1; i_var_5++)
27 var_5 = var_1_3_outEdges[i_var_5].
property;
29 var_4 = var_1_3_outEdges[i_var_5].
node;
30 int cond_level_4 = ((var_5 == p_var_5) & (var_4 == p_var_4));
45 #pragma omp parallel for 46 for(i_var_3 = 0; i_var_3 < in_degree_var_2; i_var_3++)
48 kernel(i_var_3, graph, var_2, p_var_3, p_var_4, p_var_5, in_degree_var_2, var_2_1_inEdges);
57 printf(
"In degree %d\n", in_degree_var_2);
60 parallel(graph, var_2, p_var_3, p_var_4, p_var_5, in_degree_var_2, var_2_1_inEdges);
69 #if defined(DATASETInVertexFile) && defined(DATASETOutVertexFile) && defined(DATASETInEdgeFile) && \ 70 defined(DATASETOutEdgeFile) 71 loadGraph(DATASETInVertexFile, DATASETOutVertexFile, DATASETInEdgeFile, DATASETOutEdgeFile);
75 loadGraph(
"dataset/1-InVertexFile.bin",
"dataset/1-OutVertexFile.bin",
"dataset/1-InEdgeFile.bin",
76 "dataset/1-OutEdgeFile.bin");
83 int ret_value = search(&
TheGraph, var_2, p_var_3, p_var_4, p_var_5);
85 printf(
"%d\n", ret_value);
93 return test(8204, 14, 15362, 10) != 10;
static Edge * getInEdges(Graph *graph, NodeId node)
static size_t getInDegree(Graph *graph, NodeId node)
static Edge * getOutEdges(Graph *graph, NodeId node)
__attribute__((noinline))
Convert the given fixedpt number to a decimal string.
void kernel(unsigned vertex, unsigned *p_Qnext, unsigned *Qnext_N, unsigned *map)
General class used to describe a graph in PandA.
static size_t getOutDegree(Graph *graph, NodeId node)
int test(NodeId var_2, PropertyId p_var_3, PropertyId p_var_4, PropertyId p_var_5)
void loadGraph(char *InVertexFileName, char *OutVertexFileName, char *InEdgeFileName, char *OutEdgeFileName)
unsigned counter[N_THREADS]