Home
last modified time | relevance | path

Searched refs:edge_table (Results 1 – 1 of 1) sorted by relevance

/external/llvm-project/polly/lib/External/isl/
Disl_scheduler.c382 struct isl_hash_table *edge_table[isl_edge_last + 1]; member
475 entry = isl_hash_table_find(ctx, graph->edge_table[type], hash, in graph_edge_table_add()
510 graph->edge_table[i] = isl_hash_table_alloc(ctx, in graph_init_edge_tables()
512 if (!graph->edge_table[i]) in graph_init_edge_tables()
535 return isl_hash_table_find(ctx, graph->edge_table[type], hash, in graph_find_edge_entry()
631 isl_hash_table_remove(ctx, graph->edge_table[i], entry); in graph_remove_edge()
755 isl_hash_table_free(ctx, graph->edge_table[i]); in graph_free()