Home
last modified time | relevance | path

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

/netbsd-src/external/mit/isl/dist/include/isl/
H A Dhash.h56 struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size);
/netbsd-src/external/mit/isl/dist/
H A Disl_hash.c123 struct isl_hash_table *isl_hash_table_alloc(struct isl_ctx *ctx, int min_size) in isl_hash_table_alloc() function
H A Disl_scheduler_scc.c553 scc_graph->edge_table[i] = isl_hash_table_alloc(ctx, 2); in isl_scc_graph_alloc()
554 scc_graph->reverse_edge_table[i] = isl_hash_table_alloc(ctx, 2); in isl_scc_graph_alloc()
H A Disl_stream.c39 s->keywords = isl_hash_table_alloc(s->ctx, 10); in isl_stream_register_keyword()
H A Disl_convex_hull.c2097 data->hull_table = isl_hash_table_alloc(set->ctx, n_ineq); in sh_data_alloc()
2101 data->p[i].table = isl_hash_table_alloc(set->ctx, in sh_data_alloc()
H A Disl_scheduler.c183 graph->node_table = isl_hash_table_alloc(ctx, graph->n); in graph_init_table()
289 graph->edge_table[i] = isl_hash_table_alloc(ctx, in graph_init_edge_tables()
H A Disl_tab_pip.c4627 table = isl_hash_table_alloc(ctx, bmap->n_ineq); in parallel_constraints()