Searched refs:n_ineq (Results 1 - 25 of 25) sorted by relevance

/haiku-buildtools/isl/
H A Disl_coalesce.c85 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq);
87 for (k = 0; k < bmap_i->n_ineq; ++k) {
169 map->p[i]->n_ineq + map->p[j]->n_ineq + extra_rows);
193 for (k = 0; k < map->p[i]->n_ineq; ++k) {
202 for (k = 0; k < map->p[j]->n_ineq; ++k) {
276 for (k = 0; k < map->p[i]->n_ineq; ++k) {
281 for (l = 0; l < map->p[j]->n_ineq; ++l) {
291 if (l < map->p[j]->n_ineq)
295 if (k < map->p[i]->n_ineq)
[all...]
H A Disl_convex_hull.c44 for (j = 0; j < (*bmap)->n_ineq; ++j)
47 if (j == (*bmap)->n_ineq)
94 if (bmap->n_ineq <= 1)
294 unsigned n_ineq; local
303 n_ineq = set->n;
306 n_ineq += set->p[i]->n_ineq;
308 lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq);
332 for (j = 0; j < set->p[i]->n_ineq; ++j) {
639 for (i = 0; i < hull->n_ineq;
1763 unsigned n_ineq; local
2077 sh_data_alloc(struct isl_set *set, unsigned n_ineq) argument
2281 unsigned n_ineq; local
[all...]
H A Disl_farkas.c213 dual = isl_basic_set_alloc_space(dim, bset->n_eq + bset->n_ineq,
214 total, bset->n_ineq + (shift > 0));
217 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) {
233 for (j = 0; j < bset->n_ineq; ++j)
238 for (i = 0; i < bset->n_ineq; ++i) {
243 1 + shift + total + bset->n_eq + bset->n_ineq);
256 for (j = 0; j < bset->n_ineq; ++j)
H A Disl_constraint.c199 return bset->n_eq + bset->n_ineq;
223 for (i = 0; i < bmap->n_ineq; ++i) {
638 n = bset->n_ineq;
807 for (i = 0; i < bset->n_ineq; ++i) {
817 for (j = i + 1; j < bset->n_ineq; ++j) {
903 for (j = 0; j < bset->n_ineq; ++j) {
933 for (j = 0; j < bset->n_ineq; ++j) {
959 for (i = 0; i < bset->n_ineq; ++i) {
979 if (i < bset->n_ineq)
1001 for (i = 0; i < bset->n_ineq;
[all...]
H A Disl_map_simplify.c72 for (i = 0; i < bset->n_ineq; ++i)
184 for (i = 0; i < bmap->n_ineq; ++i)
284 for (i = 0; i < bmap->n_ineq; ++i) {
346 for (i = bmap->n_ineq - 1; i >= 0; --i) {
460 for (k = 0; k < bmap->n_ineq; ++k) {
589 for (i = 0; i < bmap->n_ineq; ++i)
592 if (i < bmap->n_ineq)
1123 if (!bmap || bmap->n_ineq <= 1)
1126 size = round_up(4 * (bmap->n_ineq+1) / 3 - 1);
1134 for (k = 1; k < bmap->n_ineq;
[all...]
H A Disl_vertices.c438 selection = isl_alloc_array(bset->ctx, int, bset->n_ineq);
439 snap = isl_alloc_array(bset->ctx, struct isl_tab_undo *, bset->n_ineq);
441 if ((bset->n_ineq && (!selection || !snap)) || !facets)
449 if (level >= bset->n_ineq ||
534 for (i = 0; i < bset->n_ineq; ++i) {
581 if (isl_tab_extend_cons(tab, bset->n_ineq) < 0)
586 for (i = 0; i < bset->n_ineq; ++i) {
884 for (i = 0; i < bset->n_ineq; ++i)
1127 tab = isl_tab_alloc(bset->ctx, bset->n_ineq + 1,
1150 for (i = 0; i < bset->n_ineq;
[all...]
H A Disl_map_private.h61 unsigned n_ineq; member in struct:isl_basic_map
142 unsigned n_eq, unsigned n_ineq);
145 unsigned n_eq, unsigned n_ineq);
156 unsigned extra, unsigned n_eq, unsigned n_ineq);
160 unsigned extra, unsigned n_eq, unsigned n_ineq);
H A Disl_sample.c63 if (bset->n_eq == 0 && bset->n_ineq == 0)
75 isl_assert(bset->ctx, bset->n_ineq == 0, goto error);
92 for (i = 1; i < bset->n_ineq; ++i) {
99 if (i < bset->n_ineq) {
131 if (bset->n_ineq == 0)
141 for (j = 1, n = 1; n < dim && j < bset->n_ineq; ++j) {
220 for (i = 0, j = 0; i < bset->n_ineq; ++i) {
911 0, 0, cone->n_ineq);
913 for (i = 0; i < cone->n_ineq; ++i) {
1147 for (i = 0; i < bset->n_ineq;
[all...]
H A Disl_map.c802 unsigned n_eq, unsigned n_ineq)
810 bmap->block = isl_blk_alloc(ctx, (n_ineq + n_eq) * row_size);
814 bmap->ineq = isl_alloc_array(ctx, isl_int *, n_ineq + n_eq);
815 if ((n_ineq + n_eq) && !bmap->ineq)
831 for (i = 0; i < n_ineq + n_eq; ++i)
839 bmap->c_size = n_eq + n_ineq;
840 bmap->eq = bmap->ineq + n_ineq;
843 bmap->n_ineq = 0;
855 unsigned n_eq, unsigned n_ineq)
864 bmap = isl_basic_map_alloc_space(space, extra, n_eq, n_ineq);
800 basic_map_init(struct isl_ctx *ctx, struct isl_basic_map *bmap, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
853 isl_basic_set_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
868 isl_basic_set_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
882 isl_basic_map_alloc_space(__isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
900 isl_basic_map_alloc(struct isl_ctx *ctx, unsigned nparam, unsigned in, unsigned out, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
1430 isl_basic_map_extend_space(struct isl_basic_map *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
1482 isl_basic_set_extend_space(struct isl_basic_set *base, __isl_take isl_space *dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
1491 isl_basic_map_extend_constraints( struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq) argument
1500 isl_basic_map_extend(struct isl_basic_map *base, unsigned nparam, unsigned n_in, unsigned n_out, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
1520 isl_basic_set_extend(struct isl_basic_set *base, unsigned nparam, unsigned dim, unsigned extra, unsigned n_eq, unsigned n_ineq) argument
1529 isl_basic_set_extend_constraints( struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq) argument
9049 unsigned n_ineq; local
[all...]
H A Disl_schedule.c814 coef->n_eq, coef->n_ineq);
890 edge->start = graph->lp->n_ineq;
892 coef->n_eq, coef->n_ineq);
898 edge->end = graph->lp->n_ineq;
969 coef->n_eq, coef->n_ineq);
1069 coef->n_eq, coef->n_ineq);
1194 int *n_eq, int *n_ineq, int carry)
1211 *n_ineq += f * coef->n_ineq;
1225 int *n_eq, int *n_ineq)
1192 count_map_constraints(struct isl_sched_graph *graph, struct isl_sched_edge *edge, __isl_take isl_map *map, int *n_eq, int *n_ineq, int carry) argument
1224 count_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument
1323 int n_eq, n_ineq; local
2331 count_all_constraints(struct isl_sched_graph *graph, int *n_eq, int *n_ineq) argument
2393 int n_eq, n_ineq; local
[all...]
H A Disl_tab_pip.c609 unsigned n_ineq; local
620 n_ineq = dom->n_ineq;
625 n_div, n_eq, 2 * n_div + n_ineq);
648 for (i = 0; i < dom->n_ineq; ++i) {
2079 tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1,
2118 for (i = 0; i < bmap->n_ineq; ++i) {
2671 cst = isl_vec_alloc(cgbr->tab->mat->ctx, bset->n_ineq);
2675 for (i = 0; i < bset->n_ineq; ++i) {
2687 for (i = 0; i < bset->n_ineq;
3128 unsigned n_ineq; local
[all...]
H A Disl_affine_hull.c39 if (bmap->n_ineq <= 1)
325 for (i = 0; i < bset->n_ineq; ++i)
517 for (i = bmap->n_ineq - 1; i >= 0; --i) {
564 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1090 if (bmap->n_ineq == 0)
1154 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
H A Disl_factorization.c275 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
280 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
H A Disl_dim_map.c151 for (i = 0; i < src->n_ineq; ++i) {
H A Disl_ilp.c47 0, 0, bset->n_ineq);
49 for (i = 0; i < bset->n_ineq; ++i) {
H A Disl_map_piplib.c380 nrow = extra_front + bmap->n_eq + bmap->n_ineq;
393 for (i = 0; i < bmap->n_ineq; ++i) {
H A Disl_map_subtract.c61 if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0)
81 for (i = 0; i < bmap->n_ineq; ++i) {
679 if (bmap->n_ineq)
H A Disl_morph.c620 bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq);
641 mat = isl_mat_sub_alloc6(bset->ctx, bset->ineq, 0, bset->n_ineq,
646 for (i = 0; i < bset->n_ineq; ++i) {
H A Disl_tab.c1792 tab->n_con == bmap->n_eq + bmap->n_ineq, return -1);
2225 isl_basic_map_total_dim(bmap) + bmap->n_ineq + 1,
2241 for (i = 0; i < bmap->n_ineq; ++i) {
2276 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq,
2295 for (i = 0; i < bset->n_ineq; ++i) {
2452 for (i = bmap->n_ineq - 1; i >= 0; --i) {
2817 for (i = bmap->n_ineq - 1; i >= 0; --i) {
2824 bmap->n_ineq - i) < 0)
3416 tab->n_con == bmap->n_eq + bmap->n_ineq, goto error);
H A Disl_output.c89 for (i = 0; i < bmap->n_ineq; ++i)
106 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq);
509 for (i = 0; i < bmap->n_ineq; ++i) {
537 if (bmap->n_eq + bmap->n_ineq == 0)
666 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
669 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
717 if (isl_basic_map_free_inequality(bmap, bmap->n_ineq) < 0)
1677 for (i = 0; i < bset->n_ineq; ++i)
H A Disl_transitive_closure.c457 int n = eq ? delta->n_eq : delta->n_ineq;
579 d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1);
616 delta->n_ineq + 1);
H A Disl_mat.c1128 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0,
1233 if (transform(ctx, bset->ineq, bset->n_ineq, pos,
H A Disl_aff.c3952 n = hull->n_ineq;
/haiku-buildtools/isl/include/isl/
H A Dset.h90 unsigned n_eq, unsigned n_ineq);
93 unsigned n_eq, unsigned n_ineq);
95 struct isl_basic_set *base, unsigned n_eq, unsigned n_ineq);
H A Dmap.h116 unsigned n_eq, unsigned n_ineq);
124 unsigned n_eq, unsigned n_ineq);
126 struct isl_basic_map *base, unsigned n_eq, unsigned n_ineq);

Completed in 263 milliseconds