|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
tools/polly/lib/External/isl/basis_reduction_templ.c 336 if (bset->n_eq == 0)
341 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq,
345 tab->n_zero = bset->n_eq;
tools/polly/lib/External/isl/isl_aff.c 2032 if (eq->n_eq == 0) {
2049 for (i = 0; i < eq->n_eq; ++i) {
4572 if (eq >= bmap->n_eq)
5105 for (j = 0; j < hull->n_eq; ++j) {
tools/polly/lib/External/isl/isl_affine_hull.c 102 bset->n_eq--;
103 for (r = row; r < bset->n_eq; ++r)
105 bset->eq[bset->n_eq] = t;
209 int is_zero1 = row >= bset1->n_eq ||
211 int is_zero2 = row >= bset2->n_eq ||
225 isl_assert(bset1->ctx, row == bset1->n_eq, goto error);
310 for (i = 0; i < bset->n_eq; ++i)
419 for (j = 0; j < hull->n_eq; ++j) {
436 if (j == hull->n_eq)
659 if (hull->n_eq > tab->n_zero) {
660 for (j = 0; j < hull->n_eq; ++j) {
719 cone_dim = total - cone->n_eq;
721 M = isl_mat_sub_alloc6(bset->ctx, cone->eq, 0, cone->n_eq, 1, total);
795 if (cone->n_eq == 0) {
803 if (cone->n_eq < isl_basic_set_total_dim(cone))
837 if (bset->n_eq)
900 hull->n_eq, 0);
901 for (i = 0; i < hull->n_eq; ++i) {
1085 for (n = 0; n < bmap->n_eq; ++n)
tools/polly/lib/External/isl/isl_bound.c 66 if (bset->n_eq == 0)
tools/polly/lib/External/isl/isl_coalesce.c 69 int *eq = isl_calloc_array(bmap_i->ctx, int, 2 * bmap_i->n_eq);
76 for (k = 0; k < bmap_i->n_eq; ++k) {
99 unsigned n_eq = bmap_i->n_eq;
282 for (i = 0; i < 2 * info->bmap->n_eq; ++i) {
419 for (k = 0; k < info->bmap->n_eq; ++k) {
461 n_old = 2 * info[i].bmap->n_eq + info[i].bmap->n_ineq;
462 n_old += 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
464 n_new = 2 * bmap->n_eq;
466 if (!isl_tab_is_redundant(tab, bmap->n_eq + k))
502 n_eq = info[i].bmap->n_eq + info[j].bmap->n_eq;
502 n_eq = info[i].bmap->n_eq + info[j].bmap->n_eq;
602 unsigned n_eq = info[i].bmap->n_eq;
651 for (k = 0; k < bmap->n_eq; ++k) {
725 unsigned n_eq = info[i].bmap->n_eq;
1132 unsigned n_eq = info[i].bmap->n_eq;
1198 for (k = 0; k < info->bmap->n_eq; ++k) {
1342 if (isl_tab_is_redundant(info->tab, bmap->n_eq + l))
1352 for (l = 0; l < bmap->n_eq; ++l) {
1447 if (isl_tab_select_facet(info->tab, info->bmap->n_eq + k) < 0)
1502 mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) +
1502 mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) +
1623 for (k = 0; k < info[i].bmap->n_eq; ++k) {
1683 max_wrap = 1 + 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
1795 for (k = 0; k < info[i].bmap->n_eq; ++k) {
2041 mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) +
2041 mat = isl_mat_alloc(ctx, 2 * (info[i].bmap->n_eq + info[j].bmap->n_eq) +
2173 if (all(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_VALID) &&
2290 if (info[i].bmap->n_eq && !info[i].eq)
2296 if (info[j].bmap->n_eq && !info[j].eq)
2306 if (all(info[i].eq, 2 * info[i].bmap->n_eq, STATUS_VALID) &&
2310 } else if (all(info[j].eq, 2 * info[j].bmap->n_eq, STATUS_VALID) &&
2856 if (info->bmap->n_eq + info->bmap->n_ineq != info->tab->n_con)
2900 n_eq = info->bmap->n_eq;
3082 if (bmap->n_eq && !info_i->eq)
3097 if (all(info_i->eq, 2 * bmap->n_eq, STATUS_VALID) &&
3215 if (info[j].bmap->n_eq == 0)
3602 if (info[j].bmap->n_eq == 0)
tools/polly/lib/External/isl/isl_constraint.c 205 return bmap->n_eq + bmap->n_ineq;
229 for (i = 0; i < bmap->n_eq; ++i) {
825 for (i = 0; i < bmap->n_eq; ++i) {
1205 for (i = 0; i < bset->n_eq; ++i) {
tools/polly/lib/External/isl/isl_convex_hull.c 238 n_eq += set->p[i]->n_eq;
258 for (j = 0; j < set->p[i]->n_eq; ++j) {
441 if (face->n_eq == 1) {
445 for (i = 0; i < face->n_eq; ++i)
450 isl_assert(set->ctx, i < face->n_eq, goto error);
527 if (facet && facet->n_eq != 0)
643 if (set->p[0]->n_eq > 0) {
644 isl_assert(set->ctx, set->p[0]->n_eq == 1, goto error);
673 for (j = 0; j < bset->n_eq; ++j) {
778 1 + dim + bset1->n_eq + bset2->n_eq,
778 1 + dim + bset1->n_eq + bset2->n_eq,
783 for (j = 0; j < bset[i]->n_eq; ++j) {
901 bset1->n_eq + bset2->n_eq,
901 bset1->n_eq + bset2->n_eq,
906 for (i = 0; i < bset1->n_eq; ++i) {
920 for (i = 0; i < bset2->n_eq; ++i) {
977 lin_dim = total - lin->n_eq;
978 M = isl_mat_sub_alloc6(set->ctx, lin->eq, 0, lin->n_eq, 1, total);
1024 2 * bset1->n_eq + bset1->n_ineq + 2 * bset2->n_eq + bset2->n_ineq;
1024 2 * bset1->n_eq + bset1->n_ineq + 2 * bset2->n_eq + bset2->n_ineq;
1045 for (j = 0; j < bset1->n_eq; ++j) {
1054 for (j = 0; j < bset2->n_eq; ++j) {
1121 for (i = 0; i < bset1->n_eq; ++i) {
1307 if (aff->n_eq != 0)
1332 if (lin->n_eq < isl_basic_set_total_dim(lin)) {
1374 for (i = 0; i < bset->n_eq; ++i) {
1384 for (i = 0; i < bset->n_ineq && lin->n_eq < dim; ++i) {
1472 if (t->n_eq < isl_basic_set_total_dim(t)) {
1604 if (set->p[i]->n_eq == 0)
1611 if (set->p[i]->n_eq != 0)
1651 for (i = 0; i < set->p[s]->n_eq; ++i) {
1662 set->p[s]->n_eq == 0);
1679 if (set->p[s]->n_eq)
1721 n_ineq += set->p[i]->n_eq;
1788 if (lin->n_eq < isl_basic_set_total_dim(lin))
1909 if (affine_hull->n_eq != 0)
2024 for (i = 0; i < bset->n_eq; ++i) {
2055 2 * set->p[i]->n_eq + set->p[i]->n_ineq);
2256 for (j = 0; j < set->p[i]->n_eq; ++j) {
2287 n_ineq += 2 * set->p[i]->n_eq + set->p[i]->n_ineq;
2513 i1 = bmap1->n_eq - 1;
2514 i2 = bmap2->n_eq - 1;
2768 for (j = 0; j < bset->n_eq; ++j) {
2831 n_eq += bset->n_eq;
2832 n_ineq += 2 * bset->n_eq + bset->n_ineq;
3016 for (j = 0; j < hull->n_eq; ++j) {
3023 if (j < hull->n_eq)
tools/polly/lib/External/isl/isl_dim_map.c 143 for (i = 0; i < src->n_eq; ++i) {
tools/polly/lib/External/isl/isl_equalities.c 678 isl_assert(bset->ctx, bset->n_eq <= dim, goto error);
679 if (bset->n_eq == 0)
682 B = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq, 0, 1 + dim);
758 H = isl_mat_sub_alloc6(ctx, bset->eq, 0, bset->n_eq, 1, total);
763 isl_seq_gcd(U->row[nparam + pos]+bset->n_eq,
764 total-bset->n_eq, modulo);
774 C = isl_mat_alloc(ctx, 1 + bset->n_eq, 1);
778 isl_mat_sub_neg(ctx, C->row + 1, bset->eq, bset->n_eq, 0, 0, 1);
783 U1 = isl_mat_sub_alloc(U, nparam+pos, 1, 0, bset->n_eq);
tools/polly/lib/External/isl/isl_factorization.c 275 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
278 isl_mat_sub_copy(bset->ctx, H->row, bset->eq, bset->n_eq,
280 isl_mat_sub_copy(bset->ctx, H->row + bset->n_eq, bset->ineq, bset->n_ineq,
tools/polly/lib/External/isl/isl_farkas.c 235 dual = isl_basic_set_alloc_space(space, bset->n_eq + bset->n_ineq,
239 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) {
252 for (j = 0; j < bset->n_eq; ++j)
256 isl_int_set(dual->eq[k][1 + shift + total + bset->n_eq + j],
265 1 + shift + total + bset->n_eq + bset->n_ineq);
266 isl_int_set_si(dual->ineq[k][1 + shift + total + bset->n_eq + i], 1);
275 for (j = 0; j < bset->n_eq; ++j)
279 isl_int_neg(dual->ineq[k][2 + total + bset->n_eq + j],
tools/polly/lib/External/isl/isl_ilp.c 44 if (bset->n_eq != 0) {
322 if (bset->n_eq)
tools/polly/lib/External/isl/isl_local_space.c 985 for (i = 0; i < eq->n_eq; ++i) {
tools/polly/lib/External/isl/isl_map.c 218 return bmap->n_eq;
1032 if (bmap->n_eq == total) {
1034 for (i = 0; i < bmap->n_eq; ++i) {
1046 if (i == bmap->n_eq)
1149 bmap->n_eq = 0;
1228 for (i = 0; i < src->n_eq; ++i) {
1252 bmap->n_div, bmap->n_eq, bmap->n_ineq);
1341 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
1430 isl_assert(ctx, (bmap->eq - bmap->ineq) + bmap->n_eq <= bmap->c_size,
1437 if ((bmap->eq - bmap->ineq) + bmap->n_eq == bmap->c_size) {
1446 bmap->n_eq++;
1451 isl_seq_clr(bmap->eq[bmap->n_eq] + 1 + isl_basic_map_total_dim(bmap),
1453 return bmap->n_eq++;
1465 isl_assert(bmap->ctx, n <= bmap->n_eq, return -1);
1466 bmap->n_eq -= n;
1480 isl_assert(bmap->ctx, pos < bmap->n_eq, return -1);
1482 if (pos != bmap->n_eq - 1) {
1484 bmap->eq[pos] = bmap->eq[bmap->n_eq - 1];
1485 bmap->eq[bmap->n_eq - 1] = t;
1487 bmap->n_eq--;
1507 bmap->n_eq++;
1770 for (i = 0; i < bmap2->n_eq; ++i) {
1838 n_eq += base->n_eq;
2009 for (i = 0; i < bmap->n_eq; ++i)
2042 if (bmap->n_eq > 0)
2043 isl_basic_map_free_equality(bmap, bmap->n_eq-1);
2151 for (i = 0; i < bmap->n_eq; ++i)
2261 for (i = 0; i < bmap->n_eq; ++i)
2358 for (i = 0; i < bmap->n_eq; ++i)
2813 for (i = 0; i < bmap->n_eq; ++i)
2875 for (i = bmap->n_eq - 1; i >= 0; --i) {
2923 for (i = bmap->n_eq - 1; i >= 0; --i) {
3297 dump_constraints(bmap, bmap->eq, bmap->n_eq, "=", out, indent);
3490 bset->n_div, bset->n_eq, bset->n_ineq);
3540 bset->n_div, bset->n_eq, bset->n_ineq);
3568 for (i = 0; i < bmap->n_eq; ++i) {
3635 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3681 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 1)
3692 if (map2->p[0]->n_eq == 1)
3748 (map1->p[0]->n_eq + map1->p[0]->n_ineq == 1 ||
3749 map2->p[0]->n_eq + map2->p[0]->n_ineq == 1))
3913 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4098 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4225 bmap->n_div, bmap->n_eq, bmap->n_ineq);
4520 bmap1->n_eq + bmap2->n_eq,
4520 bmap1->n_eq + bmap2->n_eq,
4605 bmap1->n_eq + bmap2->n_eq + n_out,
4605 bmap1->n_eq + bmap2->n_eq + n_out,
4688 for (i = 0; i < bmap->n_eq; ++i)
4760 bmap->n_eq, bmap->n_ineq + 2 * n_out);
7220 for (i = 0, j = n_div - 1; i < bset->n_eq && j >= 0; --j) {
7250 if (bset->n_eq == 0)
7298 if (bset->n_eq == 0)
7308 if (i == bset->n_eq)
7312 eq = isl_mat_sub_alloc6(bset->ctx, bset->eq, i, bset->n_eq - i,
7328 else if (i == bset->n_eq)
8621 return bmap->n_eq == 0 && bmap->n_ineq == 0;
9346 for (i = 0, d = total-1; i < bmap->n_eq && d+1 > pos; ++i) {
9619 if (bmap1->n_eq != bmap2->n_eq)
9619 if (bmap1->n_eq != bmap2->n_eq)
9620 return bmap1->n_eq - bmap2->n_eq;
9620 return bmap1->n_eq - bmap2->n_eq;
9626 for (i = 0; i < bmap1->n_eq; ++i) {
9989 bmap1->n_eq + bmap2->n_eq,
9989 bmap1->n_eq + bmap2->n_eq,
10050 bmap1->n_eq + bmap2->n_eq,
10050 bmap1->n_eq + bmap2->n_eq,
10102 bmap1->n_eq + bmap2->n_eq,
10102 bmap1->n_eq + bmap2->n_eq,
10442 isl_hash_byte(hash, bmap->n_eq & 0xFF);
10443 for (i = 0; i < bmap->n_eq; ++i) {
10637 size += bset->n_eq * (1 + dim);
10678 for (i = 0; i < bmap->n_eq; ++i)
11071 for (j = 0; j < bmap->n_eq; ++j) {
11100 return bmap->n_eq;
11125 if (eq >= bmap->n_eq)
11316 for (i = 0; i < bset->n_eq; ++i) {
11323 if (i < bset->n_eq)
11686 res = isl_basic_map_alloc_space(space, n_div, bmap->n_eq, bmap->n_ineq);
11943 mat = isl_mat_alloc(bmap->ctx, bmap->n_eq,
11947 for (i = 0; i < bmap->n_eq; ++i)
12658 for (i = 0; i < bset->n_eq; ++i) {
12991 bmap->n_eq + strides, bmap->n_ineq + 2 * n_div_ma);
13002 for (i = 0; i < bmap->n_eq; ++i) {
13429 return isl_mat_sub_alloc6(ctx, bset->eq, 0, bset->n_eq, 0, total);
13586 if (isl_mat_sub_transform(bmap->eq, bmap->n_eq, pos,
tools/polly/lib/External/isl/isl_map_simplify.c 58 for (i = bmap->n_eq - 1; i >= 0; --i) {
298 for (k = 0; k < bmap->n_eq; ++k) {
400 for (i = 0; i < bmap->n_eq; ++i) {
441 for (i = 0; i < bmap->n_eq; ++i)
444 if (i < bmap->n_eq)
562 for (done = 0; done < bmap->n_eq; ++done) {
564 for (k = done; k < bmap->n_eq; ++k)
567 if (k < bmap->n_eq)
586 if (done == bmap->n_eq)
588 for (k = done; k < bmap->n_eq; ++k) {
593 isl_basic_map_free_equality(bmap, bmap->n_eq-done);
829 for (i = 0, j = bmap->n_div-1; i < bmap->n_eq; ++i) {
909 if (bmap->n_eq == 0)
920 if (div_eq < bmap->n_eq) {
922 bmap->n_eq - div_eq, 0, 1 + total);
972 for (i = 0; i < bmap->n_eq; ++i)
975 if (i < bmap->n_eq) {
1433 for (i = 0; i < bmap->n_eq; ++i)
1565 for (i = 0; i < bmap->n_eq; ++i) {
1573 if (i < bmap->n_eq)
1773 for (i = 0; i < bmap->n_eq; ++i) {
1827 if (context->n_eq == 0) {
1840 for (i = 0; i < bset->n_eq; ++i)
2006 for (i = bmap->n_eq - 1; i >= 0; --i)
2110 for (i = 0; i < bmap->n_eq; ++i)
2155 for (j = 0; j < bset->n_eq; ++j)
2158 if (j < bset->n_eq) {
2364 n_eq = context->n_eq;
2617 if (aff->n_eq == 0) {
2622 eq = isl_mat_sub_alloc6(bset->ctx, aff->eq, 0, aff->n_eq, 0, 1 + total);
2662 if (bmap->n_eq == 0)
2669 for (i = 0; i < bmap->n_eq; ++i)
2674 return bmap->n_eq;
2741 if (bmap1->n_eq == n1) {
2743 n2, bmap2->n_eq - n2, 0, 1 + total);
2746 if (bmap2->n_eq == n2) {
2748 n1, bmap1->n_eq - n1, 0, 1 + total);
2752 n1, bmap1->n_eq - n1, 0, 1 + total);
2754 n2, bmap2->n_eq - n2, 0, 1 + total);
2760 E1 = isl_mat_sub_alloc6(ctx, bmap->eq, 0, bmap->n_eq, 0, 1 + total);
3074 if (!bset || bset->n_eq == 0 || n_div == 0 ||
3080 n_eq = bset->n_eq;
3230 i1 = bmap->n_eq - 1;
3231 i2 = context->n_eq - 1;
3595 if (!bmap1->n_eq && !bmap2->n_eq)
3595 if (!bmap1->n_eq && !bmap2->n_eq)
3608 for (i = 0; i < bmap2->n_eq; ++i) {
4735 for (j = 0; j < bmap->n_eq; ++j)
4738 if (j < bmap->n_eq)
4879 for (i = 0; i < bmap->n_eq; ++i)
4955 if (bmap->n_eq == 0)
4968 for (i = 0; i < bmap->n_eq; ++i) {
4979 if (i >= bmap->n_eq)
5009 for (i = 0; i < bmap->n_eq; ++i) {
5107 if (bmap->n_eq == 0)
5118 eq = isl_mat_sub_alloc6(ctx, bmap->eq, 0, bmap->n_eq, 0, 1 + total);
5197 for (i = 0; i < bmap->n_eq; ++i) {
tools/polly/lib/External/isl/isl_map_subtract.c 65 if (isl_tab_extend_cons(tab, 2 * bmap->n_eq + bmap->n_ineq) < 0)
72 for (i = 0; i < bmap->n_eq; ++i) {
129 if (c < 2 * bmap->n_eq) {
143 c -= 2 * bmap->n_eq;
727 return bmap->n_eq == isl_basic_map_total_dim(bmap);
757 isl_assert(bmap->ctx, bmap->n_eq == dim, return NULL);
765 for (j = 0; j < bmap->n_eq; ++j) {
tools/polly/lib/External/isl/isl_mat.c 1381 if (preimage(ctx, bset->eq, bset->n_eq, bset->n_div, 0,
tools/polly/lib/External/isl/isl_morph.c 439 for (f_eq = 0; f_eq < bset->n_eq; ++f_eq)
442 for (n_eq = 0; f_eq + n_eq < bset->n_eq; ++n_eq)
514 if (bset->n_eq == 0)
517 n_eq = bset->n_eq;
522 if (isl_seq_first_non_zero(bset->eq[bset->n_eq - 1] + 1 + nparam,
630 bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq);
636 mat = isl_mat_sub_alloc6(bset->ctx, bset->eq, 0, bset->n_eq,
641 for (i = 0; i < bset->n_eq; ++i) {
tools/polly/lib/External/isl/isl_output.c 99 for (i = 0; i < bmap->n_eq; ++i)
118 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq);
760 for (i = bmap->n_eq - 1; i >= 0; --i) {
763 if (i != bmap->n_eq - 1)
1086 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1089 if (map->n > 1 && map->p[i]->n_eq + map->p[i]->n_ineq > 1)
1227 for (i = bmap->n_eq - 1; i >= 0; --i) {
1265 for (i = bmap->n_eq - 1; i >= 0; --i) {
1269 for (j = 0; j < aff->n_eq; ++j) {
1344 for (i = 0; i < eq->n_eq; ++i) {
2191 for (i = 0; i < bset->n_eq; ++i) {
tools/polly/lib/External/isl/isl_polynomial.c 2791 if (eq->n_eq == 0) {
2806 for (i = 0; i < eq->n_eq; ++i) {
4639 if (bset->n_eq == 0)
tools/polly/lib/External/isl/isl_sample.c 66 if (bset->n_eq == 0 && bset->n_ineq == 0)
76 if (bset->n_eq > 0) {
77 isl_assert(bset->ctx, bset->n_eq == 1, goto error);
171 if (i < bset->n_eq)
175 bset->ineq[i - bset->n_eq] + 1, tab->n_var);
622 if (bset->n_eq > 0)
772 isl_assert(cone->ctx, cone->n_eq == 0, goto error);
936 cone_dim = total - cone->n_eq;
938 M = isl_mat_sub_alloc6(ctx, cone->eq, 0, cone->n_eq, 1, total);
1115 if (cone->n_eq < dim)
1154 if (bset->n_eq > 0)
tools/polly/lib/External/isl/isl_scheduler.c 2812 con -= graph->lp->n_eq;
tools/polly/lib/External/isl/isl_tab.c 1918 isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq,
1921 tab->n_con == bmap->n_eq + bmap->n_ineq,
2410 for (i = 0; i < bmap->n_eq; ++i) {
2450 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq,
2459 for (i = 0; i < bset->n_eq; ++i) {
2649 if (bmap->n_eq != n_eq)
3106 if (!isl_tab_is_equality(tab, bmap->n_eq + i))
4039 isl_assert(tab->mat->ctx, tab->n_eq == bmap->n_eq, goto error);
4041 tab->n_con == bmap->n_eq + bmap->n_ineq, goto error);
tools/polly/lib/External/isl/isl_tab_pip.c 2287 tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1,
2313 for (i = 0; i < bmap->n_eq; ++i) {
2324 if (bmap->n_eq && restore_lexmin(tab) < 0)
2946 for (i = 0; i < bset->n_eq; ++i)
2959 return cgbr->tab->bmap->n_eq == 0 && cgbr->tab->bmap->n_div == 0;
4700 for (i = 0; i < bmap->n_eq; ++i)
tools/polly/lib/External/isl/isl_transitive_closure.c 461 int n = eq ? delta->n_eq : delta->n_ineq;
585 d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1);
585 d + 1 + delta->n_eq, delta->n_eq + delta->n_ineq + 1);
621 path = isl_basic_map_extend_constraints(path, delta->n_eq,
2183 for (i = 0; i < aff->n_eq; ++i) {
tools/polly/lib/External/isl/isl_vertices.c 144 isl_assert(bset->ctx, v->v.vertex->n_eq >= nvar, goto error);
150 if (v->v.dom->n_eq > 0) {
396 if (bset->n_eq != 0)
572 if (bset->n_eq > 0)
1114 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq + 1,
1130 for (i = 0; i < bset->n_eq; ++i) {
1431 for (i = 0; i < vertex->n_eq; ++i) {