Searched refs:edge_table (Results 1 – 5 of 5) sorted by relevance
| /netbsd-src/external/mit/isl/dist/ |
| H A D | isl_scheduler_scc.c | 74 struct isl_hash_table **edge_table; member
122 isl_hash_table_foreach(ctx, scc_graph->edge_table[i], in isl_scc_graph_dump()
144 if (scc_graph->edge_table) { in isl_scc_graph_free()
146 isl_hash_table_free(ctx, scc_graph->edge_table[i]); in isl_scc_graph_free()
159 free(scc_graph->edge_table); in isl_scc_graph_free()
202 struct isl_scc_graph *scc_graph, struct isl_hash_table **edge_table, in isl_scc_graph_find_edge() argument
212 return isl_hash_table_find(ctx, edge_table[src], hash, in isl_scc_graph_find_edge()
230 edge_entry = isl_scc_graph_find_edge(scc_graph, scc_graph->edge_table, in isl_scc_graph_remove_edge()
238 isl_hash_table_remove(ctx, scc_graph->edge_table[src], edge_entry); in isl_scc_graph_remove_edge()
289 n_next = scc_graph->edge_table[i]->n; in next_nodes()
[all …]
|
| H A D | isl_scheduler.h | 242 struct isl_hash_table *edge_table[isl_edge_last + 1]; member
|
| H A D | isl_scheduler.c | 254 entry = isl_hash_table_find(ctx, graph->edge_table[type], hash, in graph_edge_table_add()
289 graph->edge_table[i] = isl_hash_table_alloc(ctx, in graph_init_edge_tables()
291 if (!graph->edge_table[i]) in graph_init_edge_tables()
314 return isl_hash_table_find(ctx, graph->edge_table[type], hash, in graph_find_edge_entry()
410 isl_hash_table_remove(ctx, graph->edge_table[i], entry); in graph_remove_edge()
534 isl_hash_table_free(ctx, graph->edge_table[i]); in isl_sched_graph_free()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | ChangeLog-2004 | 10514 * sched-rgn.c (haifa_edge, edge_table, NEXT_IN, NEXT_OUT, FROM_BLOCK,
10517 (schedule_insns): Remove edge_table/in_edges/out_edges cleanup.
|
| H A D | ChangeLog-2000 | 1705 IS_LOAD_INSN, struct haifa_edge, edge_table, NEXT_IN, NEXT_OUT,
|