Lines Matching refs:n_ineq
80 for (i = bmap->n_ineq - 1; i >= 0; --i) {
326 for (k = 0; k < bmap->n_ineq; ++k) {
477 for (i = 0; i < bmap->n_ineq; ++i)
480 if (i < bmap->n_ineq)
714 if (bmap->n_ineq == 0)
716 ci->size = round_up(4 * (bmap->n_ineq + 1) / 3 - 1);
779 for (k = 0; k < bset->n_ineq; ++k) {
1247 if (total < 0 || bmap->n_ineq <= 1)
1255 for (k = 1; k < bmap->n_ineq; ++k) {
1270 for (k = 0; bmap && k < bmap->n_ineq-1; ++k) {
1374 for (j = 0; j < bmap->n_ineq; ++j) {
1479 isl_size v_div, n_ineq;
1482 n_ineq = isl_basic_map_n_inequality(bmap);
1483 if (v_div < 0 || n_ineq < 0)
1486 for (i = 0; i < n_ineq; ++i) {
1612 for (i = 0; i < bmap->n_ineq; ++i) {
1759 for (i = 0; i < bmap->n_ineq; ++i) {
1769 for (i = bmap->n_ineq - 1; i >= 0; --i) {
2035 for (i = 0; i < bset->n_ineq; ++i)
2059 isl_size n_ineq, cols;
2065 if (context->n_ineq == 0)
2070 n_ineq = isl_mat_rows(ineq);
2072 if (n_ineq < 0 || cols < 0)
2075 for (k = 0; k < n_ineq; ++k) {
2107 if (context->n_ineq == 0)
2112 for (k = 0; k < bset->n_ineq; ++k) {
2147 if (bmap->n_ineq == 0 || context->n_ineq == 0) {
2212 for (i = bmap->n_ineq - 1; i >= 0; --i)
2312 for (i = 0; i < bmap->n_ineq; ++i)
2362 for (j = 0; j < bset->n_ineq; ++j)
2365 if (j < bset->n_ineq)
2446 unsigned n_ineq;
2455 n_ineq = bset->n_ineq;
2456 for (i = n_ineq - 1; i >= 0; --i) {
2543 if (bset->n_ineq == 0 || isl_basic_set_plain_is_universe(context)) {
2550 row = isl_calloc_array(ctx, int, bset->n_ineq);
2556 if (all_neg(row, bset->n_ineq))
2566 context_ineq = context->n_ineq;
2568 combined = isl_basic_set_extend_constraints(combined, 0, bset->n_ineq);
2573 if (isl_tab_extend_cons(tab, bset->n_ineq) < 0)
2576 for (i = 0; i < bset->n_ineq; ++i) {
2588 for (i = bset->n_ineq - 1; i >= 0; --i) {
2638 ineq = isl_mat_sub_alloc6(ctx, bset->ineq, 0, bset->n_ineq,
3266 unsigned extra, n_eq, n_ineq;
3311 n_ineq = bset->n_ineq;
3314 eq = isl_basic_set_free_inequality(eq, n_ineq);
3404 i1 = bmap->n_ineq - 1;
3405 i2 = context->n_ineq - 1;
3845 for (i = 0; i < bmap2->n_ineq; ++i) {
3854 for (i = 0; i < bmap1->n_ineq; ++i) {
4205 for (j = 0; j < bmap->n_ineq; ++j) {
4227 if (j < bmap->n_ineq)
4428 for (l = 0; l < bmap->n_ineq; ++l) {
4433 for (u = 0; u < bmap->n_ineq; ++u) {
4447 if (u < bmap->n_ineq)
4454 if (l == bmap->n_ineq) {
4547 for (i = 0; i < bmap->n_ineq; ++i) {
4601 for (l = 0; l < bmap->n_ineq; ++l) {
4604 for (u = 0; u < bmap->n_ineq; ++u) {
4842 * Otherwise, return bmap->n_ineq.
4854 for (i = 0; i < bmap->n_ineq && (lower < 0 || upper < 0); ++i) {
4880 return bmap->n_ineq;
4893 return equal ? lower : bmap->n_ineq;
5012 isl_size n_ineq;
5026 n_ineq = isl_basic_map_n_inequality(bmap);
5027 if (n_ineq < 0)
5049 for (j = 0; j < bmap->n_ineq; ++j) {
5061 for (j = bmap->n_ineq - 1; j >= 0; --j)
5093 if (lower < n_ineq)
5190 for (i = 0; i < bmap->n_ineq; ++i)
5458 for (i = 0; i < bmap->n_ineq; ++i) {
5528 for (i = 0; i < bmap->n_ineq; ++i) {
Indexes created Fri Jun 26 00:24:39 UTC 2026