|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
tools/polly/lib/External/isl/isl_aff.c 536 r = isl_reordering_extend(r, aff->ls->div->n_row);
538 aff->ls->div->n_row);
tools/polly/lib/External/isl/isl_affine_hull.c 1005 M->n_row - 1, M->n_row - 1, 0);
1005 M->n_row - 1, M->n_row - 1, 0);
1008 for (i = 1; i < M->n_row; ++i) {
tools/polly/lib/External/isl/isl_coalesce.c 495 unsigned extra_rows = extra ? extra->n_row : 0;
856 for (j = 1; j < T->n_row; ++j) {
1332 w = wraps->mat->n_row;
1371 wraps->mat->n_row = w;
1374 wraps->mat->n_row = 0;
1387 for (i = first; i < wraps->n_row; ++i) {
1394 wraps->n_row = 0;
1454 n = wraps->mat->n_row;
1516 wraps.mat->n_row = 1;
1520 if (!wraps.mat->n_row)
1527 if (!wraps.mat->n_row)
1621 wraps->mat->n_row = 0;
1627 w = wraps->mat->n_row++;
1637 if (!wraps->mat->n_row)
1645 w = wraps->mat->n_row++;
1651 if (!wraps->mat->n_row)
2057 wraps.mat->n_row = 1;
2061 if (!wraps.mat->n_row)
2067 isl_seq_cpy(wraps.mat->row[wraps.mat->n_row], bound->el, 1 + total);
2068 wraps.mat->n_row++;
2072 if (!wraps.mat->n_row)
3159 exp1 = isl_alloc_array(ctx, int, div_i->n_row);
3160 exp2 = isl_alloc_array(ctx, int, div_j->n_row);
3161 if ((div_i->n_row && !exp1) || (div_j->n_row && !exp2))
3161 if ((div_i->n_row && !exp1) || (div_j->n_row && !exp2))
3168 if (div->n_row == div_j->n_row)
3168 if (div->n_row == div_j->n_row)
tools/polly/lib/External/isl/isl_convex_hull.c 433 bounds->n_row = 1;
985 Q = isl_mat_drop_rows(Q, Q->n_row - lin_dim, lin_dim);
tools/polly/lib/External/isl/isl_equalities.c 76 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1);
76 M = isl_mat_alloc(B->ctx, B->n_row, B->n_row + B->n_col - 1);
77 C = isl_mat_alloc(B->ctx, 1 + B->n_row, 1);
81 for (i = 0; i < B->n_row; ++i) {
82 isl_seq_clr(M->row[i], B->n_row);
87 isl_int_fdiv_r(M->row[i][B->n_row + j],
93 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row);
93 H = isl_mat_sub_alloc(M, 0, B->n_row, 0, B->n_row);
98 for (i = 0; i < B->n_row; ++i) {
103 if (i < B->n_row)
104 cst = isl_mat_alloc(B->ctx, B->n_row, 0);
106 cst = isl_mat_sub_alloc(C, 1, B->n_row, 0, 1);
107 T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row);
107 T = isl_mat_sub_alloc(U, B->n_row, B->n_col - 1, 0, B->n_row);
173 A = isl_mat_alloc(B->ctx, size, B->n_row * size);
177 for (i = 0; i < B->n_row; ++i) {
186 for (j = 1; j < U->n_row; ++j)
192 T = isl_mat_sub_alloc(A, 0, A->n_row, 0, A->n_row);
192 T = isl_mat_sub_alloc(A, 0, A->n_row, 0, A->n_row);
318 isl_assert(B->ctx, B->n_row == d->size, goto error);
331 for (i = 0; i < B->n_row; ++i) {
357 if (B->n_row == 0)
359 else if (B->n_row == 1)
366 isl_mat_sub_copy(T->ctx, T->row + 1, cst->row, cst->n_row, 0, 0, 1);
417 n_row = A->n_row;
545 if (n < B->n_row)
548 H = isl_mat_sub_alloc(B, 0, B->n_row, 1 + first, n);
553 *T2 = isl_mat_drop_rows(*T2, 0, B->n_row);
558 C = isl_mat_alloc(ctx, 1 + B->n_row, 1 + first);
563 isl_mat_sub_neg(ctx, C->row + 1, B->row, B->n_row, 0, 0, 1 + first);
564 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row);
564 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row);
574 for (i = 0; i < B->n_row; ++i) {
582 if (i < B->n_row)
586 U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, B->n_row);
586 U1 = isl_mat_sub_alloc(U, 0, U->n_row, 0, B->n_row);
588 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row);
588 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row);
588 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row);
588 U2 = isl_mat_sub_alloc(U, 0, U->n_row, B->n_row, U->n_row - B->n_row);
779 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row);
779 H1 = isl_mat_sub_alloc(H, 0, H->n_row, 0, H->n_row);
tools/polly/lib/External/isl/isl_factorization.c 144 g->rowgroup = isl_alloc_array(H->ctx, int, H->n_row);
149 for (i = 0; i < H->n_row; ++i)
152 for ( ; j < H->n_row; ++j)
219 if (g->pos[i] == H->n_row)
223 for (j = g->pos[i] + 1; j < H->n_row; ++j) {
tools/polly/lib/External/isl/isl_fold.c 353 if (qp->div->n_row > 0)
tools/polly/lib/External/isl/isl_local.c 183 if (mat1->n_row != mat2->n_row)
183 if (mat1->n_row != mat2->n_row)
184 return mat1->n_row - mat2->n_row;
184 return mat1->n_row - mat2->n_row;
187 for (i = 0; i < mat1->n_row; ++i) {
225 extra = isl_space_dim(space, isl_dim_all) + div->n_row - r->len;
226 mat = isl_mat_alloc(div->ctx, div->n_row, div->n_col + extra);
230 for (i = 0; i < div->n_row; ++i) {
tools/polly/lib/External/isl/isl_local_space.c 244 return ls->div->n_row;
246 return isl_space_dim(ls->dim, isl_dim_all) + ls->div->n_row;
369 if (pos < 0 || pos >= ls->div->n_row)
586 isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size);
587 isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0);
621 unsigned c = src->n_col - src->n_row;
667 return cmp_row(div->row[i], div->row[j], i, j, div->n_row, div->n_col);
733 d = div1->n_col - div1->n_row;
734 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
734 div = isl_mat_alloc(div1->ctx, 1 + div1->n_row + div2->n_row,
735 d + div1->n_row + div2->n_row);
735 d + div1->n_row + div2->n_row);
739 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
739 for (i = 0, j = 0, k = 0; i < div1->n_row && j < div2->n_row; ++k) {
756 for (; i < div1->n_row; ++i, ++k) {
760 for (; j < div2->n_row; ++j, ++k) {
765 div->n_row = k;
781 if (a < 0 || a >= ls->div->n_row || b < 0 || b >= ls->div->n_row)
781 if (a < 0 || a >= ls->div->n_row || b < 0 || b >= ls->div->n_row)
784 offset = ls->div->n_col - ls->div->n_row;
812 if (ls2->div->n_row == 0) {
817 if (ls1->div->n_row == 0) {
822 exp1 = isl_alloc_array(ctx, int, ls1->div->n_row);
823 exp2 = isl_alloc_array(ctx, int, ls2->div->n_row);
990 for (k = 0; k < ls->div->n_row; ++k) {
1046 if (first + n > ls->div->n_row)
1097 subs->v->size, 0, ls->div->n_row);
1218 ls->div->n_row - div - 1) != -1)
1314 for (i = ls->div->n_row - 1; i >= 0; --i) {
1336 ls->dim = isl_space_lift(ls->dim, ls->div->n_row);
1337 ls->div = isl_mat_drop_rows(ls->div, 0, ls->div->n_row);
1427 for (i = 0; i < ls->div->n_row; ++i) {
tools/polly/lib/External/isl/isl_map.c 7089 isl_assert(bset->ctx, mat->n_row == 1 + nparam, goto error);
7119 if (mat->n_row != 1 + nparam)
7153 eq->n_row, 0);
7158 for (i = 0; i < eq->n_row; ++i) {
8897 if (div->n_row < bmap->n_div)
8903 div->n_row - n_div, 0,
8904 2 * (div->n_row - n_div));
8906 for (i = n_div; i < div->n_row; ++i)
8916 for (i = 0; i < div->n_row; ++i) {
12019 eq->n_row, ineq->n_row);
12019 eq->n_row, ineq->n_row);
12028 for (i = 0; i < eq->n_row; ++i) {
12041 for (i = 0; i < ineq->n_row; ++i) {
13577 if (trans->n_row != trans->n_col)
13580 if (first + trans->n_row > isl_basic_map_dim(bmap, type))
tools/polly/lib/External/isl/isl_map_simplify.c 959 for (i = 0; i < T->n_row - 1; ++i) {
966 pos = isl_alloc_array(bmap->ctx, int, T->n_row);
983 for (i = 1; i < T->n_row; ++i) {
995 for (i = 1; i < T->n_row; ++i) {
1009 if (pos[j] < T->n_row && C2)
2694 0, eq->n_row, 0);
2695 for (i = 0; i < eq->n_row; ++i) {
tools/polly/lib/External/isl/isl_mat.c 41 isl_hash_byte(hash, mat->n_row & 0xFF);
43 for (i = 0; i < mat->n_row; ++i) {
77 mat->n_row = n_row;
99 if (mat->max_col >= n_col && mat->n_row >= n_row) {
108 if (n_row < mat->n_row)
109 n_row = mat->n_row;
113 for (i = 0; i < mat->n_row; ++i)
132 for (i = 0; i < mat->n_row; ++i)
134 for (i = mat->n_row; i < n_row; ++i)
136 mat->n_row = n_row;
163 mat->n_row = n_row;
216 mat2 = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col);
219 for (i = 0; i < mat->n_row; ++i)
257 return mat ? mat->n_row : -1;
283 if (row < 0 || row >= mat->n_row)
310 if (first + n > mat->n_row || first + n < first)
432 if (mat->n_row != mat->n_col)
435 for (i = 0; i < mat->n_row; ++i) {
459 prod = isl_vec_alloc(mat->ctx, mat->n_row);
492 vec = isl_vec_alloc(vec_mat->ctx, vec_mat->n_row);
513 isl_assert(mat->ctx, mat->n_row == vec->size, goto error);
542 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
542 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
543 isl_assert(left->ctx, left->n_row >= 1, goto error);
553 sum = isl_mat_alloc(left->ctx, left->n_row, left->n_col + right->n_col - 1);
561 for (i = 1; i < sum->n_row; ++i) {
587 for (r = row; r < M->n_row; ++r)
590 for (r = 0; r < (*U)->n_row; ++r)
601 for (r = row; r < M->n_row; ++r)
604 for (r = 0; r < (*U)->n_row; ++r)
617 for (r = row; r < M->n_row; ++r)
620 for (r = 0; r < (*U)->n_row; ++r)
667 for (row = 0; row < M->n_row; ++row) {
856 rank = hermite_first_zero_col(H, 0, H->n_row);
872 rank = hermite_first_zero_col(mat, 0, mat->n_row);
873 K = isl_mat_alloc(U->ctx, U->n_row, U->n_col - rank);
876 isl_mat_sub_copy(K->ctx, K->row, U->row, U->n_row, 0, rank, U->n_col-rank);
893 mat2 = isl_mat_alloc(mat->ctx, 1+mat->n_row, 1+mat->n_col);
898 for (i = 0; i < mat->n_row; ++i) {
923 mat = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row,
923 mat = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row,
927 for (i = 0; i < mat1->n_row; ++i) {
931 for (i = 0; i < mat2->n_row; ++i) {
932 isl_seq_clr(mat->row[mat1->n_row + i], mat1->n_col);
933 isl_seq_cpy(mat->row[mat1->n_row + i] + mat1->n_col,
1010 isl_assert(left->ctx, left->n_row == left->n_col, goto error);
1011 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
1011 isl_assert(left->ctx, left->n_row == right->n_row, goto error);
1013 if (left->n_row == 0) {
1025 for (row = 0; row < left->n_row; ++row) {
1027 pivot = row_abs_min_non_zero(left->row+row, left->n_row-row, row);
1041 left->n_row-first, row)) != -1) {
1071 for (row = 1; row < left->n_row; ++row)
1077 for (row = 0; row < left->n_row; ++row) {
1098 for (i = 0; i < mat->n_row; ++i)
1109 for (i = 0; i < mat->n_row; ++i) {
1134 for (row = 0; row < mat->n_row; ++row) {
1173 for (row = 1; row < mat->n_row; ++row)
1179 for (row = 0; row < mat->n_row; ++row) {
1204 if (mat->n_col == mat->n_row) {
1208 for (i = 0; i < mat->n_row; ++i)
1213 transpose = isl_mat_alloc(mat->ctx, mat->n_col, mat->n_row);
1216 for (i = 0; i < mat->n_row; ++i)
1236 for (r = 0; r < mat->n_row; ++r)
1272 isl_assert(left->ctx, left->n_col == right->n_row, goto error);
1273 prod = isl_mat_alloc(left->ctx, left->n_row, right->n_col);
1277 for (i = 0; i < prod->n_row; ++i)
1283 for (i = 0; i < prod->n_row; ++i) {
1322 if (mat->n_col >= mat->n_row)
1325 e = mat->n_row - mat->n_col;
1329 t = isl_mat_sub_alloc6(mat->ctx, q, 0, n, has_div, mat->n_row);
1367 isl_assert(ctx, 1+bset->dim->n_out == mat->n_row, goto error);
1370 if (mat->n_col > mat->n_row) {
1374 } else if (mat->n_col < mat->n_row) {
1378 bset->dim->n_out -= mat->n_row - mat->n_col;
1424 if (mat->n_col != mat->n_row) {
1429 set->dim->n_out -= mat->n_row;
1454 t = isl_mat_sub_alloc6(ctx, row, 0, n_row, first_col, mat->n_row);
1473 if (mat->n_row == 0)
1476 for (i = 0; i < mat->n_row; ++i) {
1486 if (i == mat->n_row-1)
1511 for (r = 0; r < mat->n_row; ++r)
1528 for (r = row; r+n < mat->n_row; ++r)
1531 mat->n_row -= n;
1545 ext = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col + n);
1549 isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row, 0, 0, col);
1550 isl_mat_sub_copy(mat->ctx, ext->row, mat->row, mat->n_row,
1571 for (i = 0; i < mat->n_row; ++i)
1595 ext = isl_mat_alloc(mat->ctx, mat->n_row + n, mat->n_col);
1601 mat->n_row - row, 0, 0, mat->n_col);
1615 return isl_mat_insert_rows(mat, mat->n_row, n);
1638 return isl_mat_insert_zero_rows(mat, mat->n_row, n);
1646 for (i = 0; i < mat->n_row; ++i)
1657 for (i = 0; i < mat->n_row; ++i)
1666 for (i = 0; i < mat->n_row; ++i)
1681 for (i = 0; i < mat->n_row; ++i) {
1702 for (i = 0; i < mat->n_row; ++i) {
1737 isl_assert(M->ctx, M->n_row == M->n_col, goto error);
1738 M->n_row = row;
1740 M->n_row = M->n_col;
1745 for (r = row; r < M->n_row; ++r)
1766 if (top->n_row == 0) {
1770 if (bot->n_row == 0) {
1775 mat = isl_mat_alloc(top->ctx, top->n_row + bot->n_row, top->n_col);
1775 mat = isl_mat_alloc(top->ctx, top->n_row + bot->n_row, top->n_col);
1778 isl_mat_sub_copy(mat->ctx, mat->row, top->row, top->n_row,
1780 isl_mat_sub_copy(mat->ctx, mat->row + top->n_row, bot->row, bot->n_row,
1780 isl_mat_sub_copy(mat->ctx, mat->row + top->n_row, bot->row, bot->n_row,
1798 if (mat1->n_row != mat2->n_row)
1798 if (mat1->n_row != mat2->n_row)
1804 for (i = 0; i < mat1->n_row; ++i)
1838 if (row >= mat->n_row)
1866 res = isl_mat_alloc(mat->ctx, mat->n_row, mat->n_col);
1871 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1873 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1875 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1877 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1881 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1883 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1885 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1887 isl_mat_sub_copy(res->ctx, res->row, mat->row, mat->n_row,
1922 for (i = 0; i < mat->n_row; ++i) {
1942 for (i = 0; i < mat->n_row; ++i)
1959 for (i = 0; i < mat->n_row; ++i)
2016 if (row_first_non_zero(mat->row, mat->n_row, i) < 0)
2057 r = hermite_first_zero_col(H, r1, H->n_row);
tools/polly/lib/External/isl/isl_morph.c 580 for (i = 0; 1 + i < morph->inv->n_row; ++i) {
626 max_stride = morph->inv->n_row - 1;
637 0, morph->inv->n_row);
652 0, morph->inv->n_row);
668 1, morph->inv->n_row);
tools/polly/lib/External/isl/isl_polynomial.c 463 return qp->div->n_row;
1181 dup = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row,
1290 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1290 isl_assert(div1->ctx, div1->n_row >= div2->n_row &&
1294 if (div1->n_row == div2->n_row)
1294 if (div1->n_row == div2->n_row)
1297 n_row = div1->n_row;
1299 div1->n_row = div2->n_row;
1299 div1->n_row = div2->n_row;
1304 div1->n_row = n_row;
1351 if (qp->div->n_row <= 1)
1357 qp->div->n_row);
1358 pos = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1359 at = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
1365 for (i = 0; i < qp->div->n_row; ++i) {
1372 qsort(array, qp->div->n_row, sizeof(struct isl_div_sort_info),
1378 for (i = 0; i < qp->div->n_row; ++i) {
1476 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1476 isl_assert(qp1->div->ctx, qp1->div->n_row >= qp2->div->n_row &&
1479 n_div1 = qp1->div->n_row;
1480 n_div2 = qp2->div->n_row;
1495 qp1->upoly = expand(qp1->upoly, exp1, div->n_col - div->n_row - 2);
1496 qp2->upoly = expand(qp2->upoly, exp2, div->n_col - div->n_row - 2);
1525 if (qp1->div->n_row < qp2->div->n_row)
1525 if (qp1->div->n_row < qp2->div->n_row)
1700 if (qp1->div->n_row < qp2->div->n_row)
1700 if (qp1->div->n_row < qp2->div->n_row)
1915 if (qp->div->n_row > 0)
1983 aff = isl_vec_alloc(qp->div->ctx, 2 + d + qp->div->n_row);
1987 isl_seq_clr(aff->el + 1, 1 + d + qp->div->n_row);
2228 reordering = isl_alloc_array(qp->dim->ctx, int, total + qp->div->n_row);
2233 for (i = total + div + 1; i < total + qp->div->n_row; ++i)
2265 for (i = 0; qp && i < qp->div->n_row; ++i) {
2268 for (j = i + 1; j < qp->div->n_row; ++j) {
2301 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2312 for (j = div + 1; j < qp->div->n_row; ++j) {
2357 unsigned total = qp->div->n_col - qp->div->n_row - 2;
2403 for (i = 0; i < qp->div->n_row; ++i) {
2521 for (j = 0; j < qp->div->n_row; ++j) {
2588 if (qp->div->n_row == 0)
2601 for (i = qp->div->n_row - 1; i >= 0; --i) {
2627 n_div = qp->div->n_row;
2811 for (k = 0; k < qp->div->n_row; ++k) {
2853 if (qp->div->n_row > 0)
2854 eq = isl_basic_set_add_dims(eq, isl_dim_set, qp->div->n_row);
2871 bset = isl_basic_set_extend_constraints(bset, 0, 2 * div->n_row);
2875 for (i = 0; i < div->n_row; ++i)
2877 total - div->n_row + i, div->row[i]) < 0)
2900 if (qp->div->n_row > 0) {
2903 qp->div->n_row);
3364 aff->ls->div->n_row, up);
3454 isl_assert(qp->dim->ctx, qp->div->n_row == 0, goto error);
3456 isl_assert(qp->dim->ctx, subs[i]->div->n_row == 0, goto error);
3495 if (qp->div->n_row == 0)
3501 dim = isl_space_add_dims(dim, isl_dim_set, qp->div->n_row);
3504 bset = isl_basic_set_add_dims(bset, isl_dim_set, qp->div->n_row);
3633 c = isl_qpolynomial_alloc(isl_space_copy(qp->dim), qp->div->n_row, up);
3736 n = isl_space_dim(dim, isl_dim_all) + div->n_row;
3774 total = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3824 case isl_dim_div: return term->div->n_row;
3826 term->div->n_row;
3975 n = isl_space_dim(term->dim, isl_dim_all) + term->div->n_row;
3985 qp = isl_qpolynomial_alloc(isl_space_copy(term->dim), term->div->n_row, up);
4023 if (qp->div->n_row) {
4026 exp = isl_alloc_array(qp->div->ctx, int, qp->div->n_row);
4029 for (i = 0; i < qp->div->n_row; ++i)
4039 for (i = 0; i < qp->div->n_row; ++i)
4180 n_sub = morph->inv->n_row - 1;
4181 if (morph->inv->n_row != morph->inv->n_col)
4182 n_sub += qp->div->n_row;
4187 for (i = 0; 1 + i < morph->inv->n_row; ++i)
4190 if (morph->inv->n_row != morph->inv->n_col)
4191 for (i = 0; i < qp->div->n_row; ++i)
4192 subs[morph->inv->n_row - 1 + i] =
4203 diag = isl_mat_diag(ctx, qp->div->n_row, morph->inv->row[0][0]);
4240 r = isl_reordering_extend(r, qp->div->n_row);
4365 for (i = div + 1; i < qp->div->n_row; ++i) {
4428 if (qp->div->n_row == 0) {
4437 for (i = 0; i < qp->div->n_row; ++i) {
4441 qp->div->n_row) != -1)
4467 if (i < qp->div->n_row) {
4671 if (qp->div->n_row == 0)
4678 for (i = qp->div->n_row - 1; i >= 0; --i) {
4758 for (i = 0; i < qp->div->n_row; ++i) {
4785 for (j = i + 1; j < qp->div->n_row; ++j) {
4875 if (pwqp->p[i].qp->div->n_row == 0) {
4933 n_div = qp->div->n_row;
tools/polly/lib/External/isl/isl_sample.c 396 isl_assert(tab->mat->ctx, tab->basis->n_row == tab->n_var + 1,
1080 tab->n_zero = eq->n_row;
1085 tab->n_unbounded = tab->n_var - (eq->n_row - tab->n_zero);
tools/polly/lib/External/isl/isl_tab.c 124 if (tab->mat->n_row < tab->n_row + n_new) {
132 int, tab->mat->n_row);
139 enum isl_tab_row_sign, tab->mat->n_row);
169 tab->mat->n_row, off + tab->n_col + n_new);
254 dup->row_var = isl_alloc_array(tab->mat->ctx, int, tab->mat->n_row);
255 if (tab->mat->n_row && !dup->row_var)
261 tab->mat->n_row);
262 if (tab->mat->n_row && !dup->row_sign)
272 tab->samples->n_row);
273 if (tab->samples->n_row && !dup->sample_index)
332 prod = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row,
332 prod = isl_mat_alloc(mat1->ctx, mat1->n_row + mat2->n_row,
513 tab1->mat->n_row + tab2->mat->n_row);
513 tab1->mat->n_row + tab2->mat->n_row);
514 if ((tab1->mat->n_row + tab2->mat->n_row) && !prod->row_var)
514 if ((tab1->mat->n_row + tab2->mat->n_row) && !prod->row_var)
889 if (tab->n_sample + 1 > tab->samples->n_row) {
1681 isl_assert(tab->mat->ctx, tab->n_row < tab->mat->n_row, return -1);
4130 r = tab->mat->n_row;
4131 tab->mat->n_row = tab->n_row;
4135 tab->mat->n_row = r;
tools/polly/lib/External/isl/isl_tab_pip.c 286 for (i = 1; i < M->n_row; ++i) {
2055 for (i = tab->n_outside; i < samples->n_row; ++i) {
2297 enum isl_tab_row_sign, tab->mat->n_row);
2298 if (tab->mat->n_row && !tab->row_sign)
4607 for (j = 0; j < var->n_row; ++j) {
4652 var->n_row, ISL_SET_DISJOINT);
4654 for (i = 0; i < var->n_row; ++i) {
4656 1, var->n_row - 1);
4713 for (j = 0; j < cst->n_row; ++j)
4716 if (j >= cst->n_row)
5808 paff = isl_pw_aff_alloc_size(pw_space, var->n_row);
5810 for (i = 0; i < var->n_row; ++i) {
5815 0, var->n_row - 1);
tools/polly/lib/External/isl/isl_transitive_closure.c 231 n = steps->n_row;
804 steps->n_row = n;
tools/polly/lib/External/isl/isl_vertices.c 243 facets->n_row = n + 1;