Home
last modified time | relevance | path

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

/netbsd-src/external/mit/isl/dist/
H A Disl_hash.c56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in isl_hash_table_init()
88 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in grow_table()
H A Disl_transitive_closure.c1333 dom = isl_calloc_array(map->ctx, isl_set *, map->n); in incremental_closure()
1334 ran = isl_calloc_array(map->ctx, isl_set *, map->n); in incremental_closure()
1335 left = isl_calloc_array(map->ctx, int, map->n); in incremental_closure()
1336 right = isl_calloc_array(map->ctx, int, map->n); in incremental_closure()
1614 grid = isl_calloc_array(map->ctx, isl_map **, n); in floyd_warshall_with_groups()
1618 grid[i] = isl_calloc_array(map->ctx, isl_map *, n); in floyd_warshall_with_groups()
1687 *set = isl_calloc_array(ctx, isl_set *, 2 * n); in setup_groups()
2642 grid = isl_calloc_array(ctx, isl_map **, n_group); in union_floyd_warshall_on_list()
2646 grid[i] = isl_calloc_array(ctx, isl_map *, n_group); in union_floyd_warshall_on_list()
2722 list = isl_calloc_array(ctx, isl_basic_map *, n); in union_floyd_warshall()
[all …]
H A Disl_scheduler_clustering.c35 c->scc = isl_calloc_array(ctx, struct isl_sched_graph, c->n); in clustering_init()
36 c->cluster = isl_calloc_array(ctx, struct isl_sched_graph, c->n); in clustering_init()
37 c->scc_cluster = isl_calloc_array(ctx, int, c->n); in clustering_init()
38 c->scc_node = isl_calloc_array(ctx, int, c->n); in clustering_init()
39 c->scc_in_merge = isl_calloc_array(ctx, int, c->n); in clustering_init()
H A Disl_schedule_band.c66 band->coincident = isl_calloc_array(ctx, int, band->n); in isl_schedule_band_from_multi_union_pw_aff()
409 band->loop_type = isl_calloc_array(ctx, in isl_schedule_band_member_set_ast_loop_type()
467 band->isolate_loop_type = isl_calloc_array(ctx, in isl_schedule_band_member_set_isolate_ast_loop_type()
H A Disl_scheduler_scc.c544 isl_calloc_array(ctx, struct isl_hash_table *, n); in isl_scc_graph_alloc()
546 isl_calloc_array(ctx, struct isl_hash_table *, n); in isl_scc_graph_alloc()
H A Disl_map_subtract.c341 index = isl_calloc_array(map->ctx, int *, map->n); in basic_map_collect_diff()
342 div_map = isl_calloc_array(map->ctx, int *, map->n); in basic_map_collect_diff()
H A Disl_vertices.c207 vertices->v = isl_calloc_array(bset->ctx, struct isl_vertex, 1); in vertices_0D()
216 vertices->c = isl_calloc_array(bset->ctx, struct isl_chamber, 1); in vertices_0D()
221 vertices->c[0].vertices = isl_calloc_array(bset->ctx, int, 1); in vertices_0D()
H A Disl_flow.c445 dep->dep = isl_calloc_array(ctx, struct isl_labeled_map, n); in isl_flow_alloc()
1181 must_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must); in compute_val_based_dependences()
1182 may_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must); in compute_val_based_dependences()
2521 data->source_info = isl_calloc_array(ctx, struct isl_sched_info *, in compute_flow()
3157 data.sink = isl_calloc_array(ctx, struct isl_scheduled_access, n); in compute_flow_schedule()
H A Disl_space.c259 space->ids = isl_calloc_array(space->ctx, isl_id *, dim); in extend_ids()
1217 ids = isl_calloc_array(space->ctx, isl_id *, n); in space_extend()
1356 ids = isl_calloc_array(ctx, isl_id *, in isl_space_insert_dims()
1435 ids = isl_calloc_array(space->ctx, isl_id *, in isl_space_move_dims()
1926 ids = isl_calloc_array(space->ctx, isl_id *, n_id); in isl_space_map_from_set()
H A Disl_coalesce.c78 eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq); in eq_status_in()
106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq); in ineq_status_in()
2185 relax = isl_calloc_array(ctx, int, 1 + n_cut); in check_single_adj_eq()
3234 expanded = isl_calloc_array(ctx, struct isl_expanded, extra_var); in expand_tab()
4214 info = isl_calloc_array(map->ctx, struct isl_coalesce_info, n); in isl_map_coalesce()
H A Disl_bernstein.c179 c = isl_calloc_array(ctx, isl_qpolynomial *, n); in extract_coefficients()
H A Disl_map_simplify.c719 ci->index = isl_calloc_array(ctx, isl_int **, ci->size); in create_constraint_index()
848 elim_for = isl_calloc_array(ctx, int, bmap->n_div); in remove_duplicate_divs()
850 index = isl_calloc_array(ctx, int, size); in remove_duplicate_divs()
2267 return isl_calloc_array(ctx, int, dim); in alloc_groups()
2550 row = isl_calloc_array(ctx, int, bset->n_ineq); in uset_gist_full()
5022 pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div); in isl_basic_map_drop_redundant_divs_ineq()
H A Disl_farkas.c388 data->factors = isl_calloc_array(ctx, in isl_coefficients_product_data_init()
H A Disl_scheduler.c468 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n); in graph_alloc()
469 graph->sorted = isl_calloc_array(ctx, int, graph->n); in graph_alloc()
472 graph->edge = isl_calloc_array(ctx, in graph_alloc()
1000 coincident = isl_calloc_array(ctx, int, graph->max_row); in add_node()
H A Disl_polynomial.c2886 active = isl_calloc_array(qp->dim->ctx, int, d); in isl_qpolynomial_involves_dims()
2934 active = isl_calloc_array(ctx, int, len); in remove_redundant_divs()
4498 active = isl_calloc_array(set->ctx, int, d); in fix_inactive()
4620 subs = isl_calloc_array(ctx, struct isl_poly *, n_sub); in isl_qpolynomial_morph_domain()
H A Disl_local_space.c1473 active = isl_calloc_array(ctx, int, total); in isl_local_space_get_active()
H A Disl_tab_pip.c2351 tab->row_sign = isl_calloc_array(bmap->ctx, in tab_for_lexmin()
4526 occurrences = isl_calloc_array(ctx, int, n); in count_occurrences()
5276 data->local = isl_calloc_array(ctx, struct isl_local_region, in init_lexmin_data()
H A Disl_ast_build_expr.c1894 data->p = isl_calloc_array(ctx, struct isl_from_pw_aff_piece, n); in isl_from_pw_aff_data_init()
H A Disl_mat.c67 mat->row = isl_calloc_array(ctx, isl_int *, n_row); in isl_mat_alloc()
H A Disl_convex_hull.c1649 constraints = isl_calloc_array(hull->ctx, struct max_constraint, in common_constraints()
H A Disl_union_map.c3202 v = isl_calloc_array(ctx, struct isl_fixed_map, n); in alloc_isl_fixed_map_array()
H A Disl_output.c1343 split = isl_calloc_array(ctx, struct isl_aff_split, map->n); in split_aff()
H A Disl_ast_codegen.c4782 data.domain = isl_calloc_array(ctx, struct isl_set_map_pair, n); in generate_components()
H A Disl_map.c4551 groups = isl_calloc_array(isl_basic_map_get_ctx(bmap), int, dim); in drop_irrelevant_constraints()
/netbsd-src/external/mit/isl/dist/include/isl/
H A Dctx.h132 #define isl_calloc_array(ctx,type,n) ((type *)isl_calloc_or_die(ctx,\ macro