| /src/external/mit/isl/dist/ |
| isl_hash.c | 56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
88 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry,
|
| isl_transitive_closure.c | 1333 dom = isl_calloc_array(map->ctx, isl_set *, map->n);
1334 ran = isl_calloc_array(map->ctx, isl_set *, map->n);
1335 left = isl_calloc_array(map->ctx, int, map->n);
1336 right = isl_calloc_array(map->ctx, int, map->n);
1614 grid = isl_calloc_array(map->ctx, isl_map **, n);
1618 grid[i] = isl_calloc_array(map->ctx, isl_map *, n);
1687 *set = isl_calloc_array(ctx, isl_set *, 2 * n);
2642 grid = isl_calloc_array(ctx, isl_map **, n_group);
2646 grid[i] = isl_calloc_array(ctx, isl_map *, n_group);
2722 list = isl_calloc_array(ctx, isl_basic_map *, n)
[all...] |
| isl_scheduler_clustering.c | 35 c->scc = isl_calloc_array(ctx, struct isl_sched_graph, c->n);
36 c->cluster = isl_calloc_array(ctx, struct isl_sched_graph, c->n);
37 c->scc_cluster = isl_calloc_array(ctx, int, c->n);
38 c->scc_node = isl_calloc_array(ctx, int, c->n);
39 c->scc_in_merge = isl_calloc_array(ctx, int, c->n);
|
| isl_schedule_band.c | 66 band->coincident = isl_calloc_array(ctx, int, band->n);
409 band->loop_type = isl_calloc_array(ctx,
467 band->isolate_loop_type = isl_calloc_array(ctx,
|
| isl_map_subtract.c | 341 index = isl_calloc_array(map->ctx, int *, map->n);
342 div_map = isl_calloc_array(map->ctx, int *, map->n);
|
| isl_scheduler_scc.c | 544 isl_calloc_array(ctx, struct isl_hash_table *, n);
546 isl_calloc_array(ctx, struct isl_hash_table *, n);
|
| isl_flow.c | 445 dep->dep = isl_calloc_array(ctx, struct isl_labeled_map, n);
1181 must_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must);
1182 may_rel = isl_calloc_array(ctx, struct isl_map *, acc->n_must);
2521 data->source_info = isl_calloc_array(ctx, struct isl_sched_info *,
3157 data.sink = isl_calloc_array(ctx, struct isl_scheduled_access, n);
|
| isl_vertices.c | 207 vertices->v = isl_calloc_array(bset->ctx, struct isl_vertex, 1);
216 vertices->c = isl_calloc_array(bset->ctx, struct isl_chamber, 1);
221 vertices->c[0].vertices = isl_calloc_array(bset->ctx, int, 1);
|
| isl_bernstein.c | 179 c = isl_calloc_array(ctx, isl_qpolynomial *, n);
|
| isl_coalesce.c | 78 eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq);
106 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq);
2185 relax = isl_calloc_array(ctx, int, 1 + n_cut);
3234 expanded = isl_calloc_array(ctx, struct isl_expanded, extra_var);
4214 info = isl_calloc_array(map->ctx, struct isl_coalesce_info, n);
|
| isl_space.c | 259 space->ids = isl_calloc_array(space->ctx, isl_id *, dim);
1217 ids = isl_calloc_array(space->ctx, isl_id *, n);
1356 ids = isl_calloc_array(ctx, isl_id *,
1435 ids = isl_calloc_array(space->ctx, isl_id *,
1926 ids = isl_calloc_array(space->ctx, isl_id *, n_id);
|
| isl_map_simplify.c | 719 ci->index = isl_calloc_array(ctx, isl_int **, ci->size);
848 elim_for = isl_calloc_array(ctx, int, bmap->n_div);
850 index = isl_calloc_array(ctx, int, size);
2267 return isl_calloc_array(ctx, int, dim);
2550 row = isl_calloc_array(ctx, int, bset->n_ineq);
5022 pairs = isl_calloc_array(bmap->ctx, int, bmap->n_div);
|
| isl_farkas.c | 388 data->factors = isl_calloc_array(ctx,
|
| isl_polynomial.c | 2886 active = isl_calloc_array(qp->dim->ctx, int, d);
2934 active = isl_calloc_array(ctx, int, len);
4498 active = isl_calloc_array(set->ctx, int, d);
4620 subs = isl_calloc_array(ctx, struct isl_poly *, n_sub);
|
| isl_scheduler.c | 468 graph->node = isl_calloc_array(ctx, struct isl_sched_node, graph->n);
469 graph->sorted = isl_calloc_array(ctx, int, graph->n);
472 graph->edge = isl_calloc_array(ctx,
1000 coincident = isl_calloc_array(ctx, int, graph->max_row);
|
| isl_tab_pip.c | 2351 tab->row_sign = isl_calloc_array(bmap->ctx,
4526 occurrences = isl_calloc_array(ctx, int, n);
5276 data->local = isl_calloc_array(ctx, struct isl_local_region,
|
| isl_local_space.c | 1473 active = isl_calloc_array(ctx, int, total);
|
| isl_ast_build_expr.c | 1894 data->p = isl_calloc_array(ctx, struct isl_from_pw_aff_piece, n);
|
| isl_mat.c | 67 mat->row = isl_calloc_array(ctx, isl_int *, n_row);
|
| isl_convex_hull.c | 1649 constraints = isl_calloc_array(hull->ctx, struct max_constraint,
|
| isl_output.c | 1343 split = isl_calloc_array(ctx, struct isl_aff_split, map->n);
|
| isl_union_map.c | 3202 v = isl_calloc_array(ctx, struct isl_fixed_map, n);
|
| isl_ast_codegen.c | 4782 data.domain = isl_calloc_array(ctx, struct isl_set_map_pair, n);
|
| isl_map.c | 4551 groups = isl_calloc_array(isl_basic_map_get_ctx(bmap), int, dim);
|
| /src/external/mit/isl/dist/include/isl/ |
| ctx.h | 132 #define isl_calloc_array(ctx,type,n) ((type *)isl_calloc_or_die(ctx,\ macro
|
