Home
last modified time | relevance | path

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

12

/netbsd-src/external/mit/isl/dist/
H A Disl_tarjan.c37 g->node = isl_alloc_array(ctx, struct isl_tarjan_node, len); in isl_tarjan_graph_alloc()
42 g->stack = isl_alloc_array(ctx, int, len); in isl_tarjan_graph_alloc()
45 g->order = isl_alloc_array(ctx, int, 2 * len); in isl_tarjan_graph_alloc()
H A Disl_factorization.c41 len = isl_alloc_array(morph->dom->ctx, int, n_group); in isl_factorizer_alloc()
153 g->pos = isl_alloc_array(H->ctx, int, H->n_col); in init_groups()
154 g->group = isl_alloc_array(H->ctx, int, H->n_col); in init_groups()
155 g->cnt = isl_alloc_array(H->ctx, int, H->n_col); in init_groups()
156 g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row); in init_groups()
H A Disl_vertices.c97 vertices->v = isl_alloc_array(bset->ctx, struct isl_vertex, n_vertices); in vertices_from_list()
481 selection = isl_alloc_array(copy->ctx, int, copy->n_ineq); in isl_basic_set_compute_vertices()
482 snap = isl_alloc_array(copy->ctx, struct isl_tab_undo *, copy->n_ineq); in isl_basic_set_compute_vertices()
601 vertices->c = isl_alloc_array(ctx, struct isl_chamber, n_chambers); in vertices_add_chambers()
687 c->c.vertices = isl_alloc_array(tab->mat->ctx, int, n_vertices); in add_chamber()
934 selection = isl_alloc_array(ctx, int, vertices->n_vertices); in compute_chambers()
1146 cell->ids = isl_alloc_array(dom->ctx, int, cell->n_vertices); in isl_cell_alloc()
1470 simplex->ids = isl_alloc_array(ctx, int, simplex->n_vertices); in call_on_simplex()
1550 ids = isl_alloc_array(ctx, int, n_other - 1); in triangulate()
1604 simplex_ids = isl_alloc_array(ctx, int, d + 1); in isl_cell_foreach_simplex()
H A Dbasis_reduction_templ.c110 F = isl_alloc_array(ctx, GBR_type, n_bounded); in isl_tab_compute_reduced_basis()
111 alpha_buffer[0] = isl_alloc_array(ctx, GBR_type, n_bounded); in isl_tab_compute_reduced_basis()
112 alpha_buffer[1] = isl_alloc_array(ctx, GBR_type, n_bounded); in isl_tab_compute_reduced_basis()
H A Disl_scheduler_scc.c290 next = isl_alloc_array(scc_graph->ctx, int, n_next); in next_nodes()
538 scc_graph->graph_scc = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
539 scc_graph->component = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
540 scc_graph->size = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
541 scc_graph->pos = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
542 scc_graph->sorted = isl_alloc_array(ctx, int, n); in isl_scc_graph_alloc()
H A Disl_bernstein.c180 k = isl_alloc_array(ctx, int, n); in extract_coefficients()
181 left = isl_alloc_array(ctx, int, n); in extract_coefficients()
294 subs = isl_alloc_array(ctx, isl_qpolynomial *, 1 + nvar); in bernstein_coefficients_cell()
518 len = isl_alloc_array(bset->ctx, int, nvar); in bernstein_coefficients_full_recursive()
H A Disl_map_subtract.c184 *div_map = isl_alloc_array(bmap->ctx, int, bmap->n_div); in tab_add_divs()
253 *index = isl_alloc_array(ctx, int, n_test); in n_non_redundant()
338 snap = isl_alloc_array(map->ctx, struct isl_tab_undo *, map->n); in basic_map_collect_diff()
339 k = isl_alloc_array(map->ctx, int, map->n); in basic_map_collect_diff()
340 n = isl_alloc_array(map->ctx, int, map->n); in basic_map_collect_diff()
H A Disl_schedule_band.c99 dup->coincident = isl_alloc_array(ctx, int, band->n); in isl_schedule_band_dup()
113 dup->loop_type = isl_alloc_array(ctx, in isl_schedule_band_dup()
121 dup->isolate_loop_type = isl_alloc_array(ctx, in isl_schedule_band_dup()
756 band->loop_type = isl_alloc_array(ctx, in extract_loop_types()
782 band->isolate_loop_type = isl_alloc_array(ctx, in extract_isolate_loop_types()
H A Disl_lp.c286 exp1 = isl_alloc_array(ctx, int, bset_n_div); in isl_basic_set_opt_lp_val_aligned()
287 exp2 = isl_alloc_array(ctx, int, obj_n_div); in isl_basic_set_opt_lp_val_aligned()
H A Disl_tab.c46 tab->var = isl_alloc_array(ctx, struct isl_tab_var, n_var); in isl_tab_alloc()
49 tab->con = isl_alloc_array(ctx, struct isl_tab_var, n_row); in isl_tab_alloc()
52 tab->col_var = isl_alloc_array(ctx, int, n_var); in isl_tab_alloc()
55 tab->row_var = isl_alloc_array(ctx, int, n_row); in isl_tab_alloc()
239 dup->var = isl_alloc_array(tab->mat->ctx, struct isl_tab_var, tab->max_var); in isl_tab_dup()
244 dup->con = isl_alloc_array(tab->mat->ctx, struct isl_tab_var, tab->max_con); in isl_tab_dup()
249 dup->col_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_col - off); in isl_tab_dup()
254 dup->row_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_row); in isl_tab_dup()
260 dup->row_sign = isl_alloc_array(tab->mat->ctx, enum isl_tab_row_sign, in isl_tab_dup()
271 dup->sample_index = isl_alloc_array(tab->mat->ctx, int, in isl_tab_dup()
[all …]
H A Disl_tab_lexopt_templ.c74 list = isl_alloc_array(ctx, int, bmap->n_ineq); in SF()
H A Disl_polynomial.c1685 array = isl_alloc_array(qp->div->ctx, struct isl_div_sort_info, in sort_divs()
1687 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row); in sort_divs()
1688 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row); in sort_divs()
1690 reordering = isl_alloc_array(qp->div->ctx, int, len); in sort_divs()
1814 exp1 = isl_alloc_array(qp1->div->ctx, int, n_div1); in with_merged_divs()
1815 exp2 = isl_alloc_array(qp2->div->ctx, int, n_div2); in with_merged_divs()
2555 reordering = isl_alloc_array(ctx, int, div_pos + qp->div->n_row); in substitute_div()
2741 s = isl_alloc_array(ctx, struct isl_poly *, n_div); in reduce_divs()
2959 reordering = isl_alloc_array(qp->div->ctx, int, len); in remove_redundant_divs()
3509 exp = isl_alloc_array(qp->div->ctx, int, total - g_pos); in isl_qpolynomial_insert_dims()
[all …]
H A Disl_ilp.c394 exp1 = isl_alloc_array(ctx, int, bset_n_div); in isl_basic_set_opt()
395 exp2 = isl_alloc_array(ctx, int, obj_n_div); in isl_basic_set_opt()
H A Disl_scan.c126 snap = isl_alloc_array(bset->ctx, struct isl_tab_undo *, dim); in isl_basic_set_scan()
H A Dbasis_reduction_tab.c156 lp->stack = isl_alloc_array(lp->ctx, struct isl_tab_undo *, lp->dim); in init_lp()
H A Disl_range.c488 data->signs = isl_alloc_array(ctx, int, total); in basic_guarded_poly_bound()
H A Disl_local_space.c904 exp1 = isl_alloc_array(ctx, int, ls1->div->n_row); in isl_local_space_intersect()
905 exp2 = isl_alloc_array(ctx, int, ls2->div->n_row); in isl_local_space_intersect()
H A Disl_farkas.c93 prefix_name = isl_alloc_array(ctx, char, in isl_space_prefix()
H A Disl_printer.c249 p->buf = isl_alloc_array(ctx, char, 256); in isl_printer_to_str()
H A Disl_ast_build.c230 dup->loop_type = isl_alloc_array(ctx, in isl_ast_build_dup()
1091 build->loop_type = isl_alloc_array(ctx, in extract_loop_types()
H A Disl_coalesce.c996 affected = isl_alloc_array(ctx, int, total); in tighten_on_relaxed_facet()
3451 exp1 = isl_alloc_array(ctx, int, div_i->n_row); in coalesce_after_aligning_divs()
3452 exp2 = isl_alloc_array(ctx, int, div_j->n_row); in coalesce_after_aligning_divs()
H A Disl_stream.c210 s->buffer = isl_alloc_array(ctx, char, s->size); in isl_stream_new()
H A Disl_sample.c427 snap = isl_alloc_array(ctx, struct isl_tab_undo *, dim); in isl_tab_sample()
H A Disl_transitive_closure.c406 div_purity = isl_alloc_array(bset->ctx, int, n_div); in get_div_purity()
1688 group = isl_alloc_array(ctx, int, 2 * n); in setup_groups()
/netbsd-src/external/mit/isl/dist/include/isl/
H A Dctx.h131 #define isl_alloc_array(ctx,type,n) isl_alloc(ctx,type,(n)*sizeof(type)) macro

12