Searched refs:edge_table (Results 1 - 2 of 2) sorted by relevance
/haiku-buildtools/isl/ |
H A D | isl_schedule.c | 156 * edge_table contains pointers into the edge array, hashed on the source 194 struct isl_hash_table *edge_table[isl_edge_last + 1]; member in struct:isl_sched_graph 257 /* Add the given edge to graph->edge_table[type]. 268 entry = isl_hash_table_find(ctx, graph->edge_table[type], hash, 285 graph->edge_table[i] = isl_hash_table_alloc(ctx, 287 if (!graph->edge_table[i]) 294 /* If graph->edge_table[type] contains an edge from the given source 310 return isl_hash_table_find(ctx, graph->edge_table[type], hash, 315 /* If graph->edge_table[type] contains an edge from the given source 388 isl_hash_table_remove(ctx, graph->edge_table[ [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | haifa-sched.c | 480 static haifa_edge *edge_table; 482 #define NEXT_IN(edge) (edge_table[edge].next_in) 483 #define NEXT_OUT(edge) (edge_table[edge].next_out) 484 #define FROM_BLOCK(edge) (edge_table[edge].from_block) 485 #define TO_BLOCK(edge) (edge_table[edge].to_block) 1179 edge_table = (haifa_edge *) xmalloc ((nr_edges) * sizeof (haifa_edge)); 1180 bzero ((char *) edge_table, ((nr_edges) * sizeof (haifa_edge))); 8820 if (edge_table) 8822 free (edge_table); 8823 edge_table 479 static haifa_edge *edge_table; variable [all...] |
Completed in 106 milliseconds