HomeSort by: relevance | last modified time | path
    Searched refs:edge_table (Results 1 - 3 of 3) sorted by relevancy

  /src/external/mit/isl/dist/
isl_scheduler_scc.c 56 * "edge_table" contains "n" edge tables, one for each SCC
74 struct isl_hash_table **edge_table; member in struct:isl_scc_graph
122 isl_hash_table_foreach(ctx, scc_graph->edge_table[i],
144 if (scc_graph->edge_table) {
146 isl_hash_table_free(ctx, scc_graph->edge_table[i]);
159 free(scc_graph->edge_table);
194 * in "edge_table" of "scc_graph", creating one if "reserve" is set.
202 struct isl_scc_graph *scc_graph, struct isl_hash_table **edge_table,
212 return isl_hash_table_find(ctx, edge_table[src], hash,
220 * The edge is only removed from scc_graph->edge_table
352 struct isl_hash_table **edge_table = data->scc_graph->edge_table; local
    [all...]
isl_scheduler.h 198 * edge_table contains pointers into the edge array, hashed on the source
242 struct isl_hash_table *edge_table[isl_edge_last + 1]; member in struct:isl_sched_graph
isl_scheduler.c 242 /* Add the given edge to graph->edge_table[type].
254 entry = isl_hash_table_find(ctx, graph->edge_table[type], hash,
289 graph->edge_table[i] = isl_hash_table_alloc(ctx,
291 if (!graph->edge_table[i])
298 /* If graph->edge_table[type] contains an edge from the given source
314 return isl_hash_table_find(ctx, graph->edge_table[type], hash,
319 /* If graph->edge_table[type] contains an edge from the given source
410 isl_hash_table_remove(ctx, graph->edge_table[i], entry);
534 isl_hash_table_free(ctx, graph->edge_table[i]);
1238 * and add it to data->graph->edge_table[data->type]
    [all...]

Completed in 24 milliseconds