reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
59 fold->n = 0; 101 for (i = 0; i < fold->n; ++i) { 137 if (fold->n == 0 || n == 0) 140 for (i = 0; i < fold->n; ++i) { 162 for (i = 0; i < fold->n; ++i) { 206 for (i = 0; i < fold->n; ++i) { 237 for (i = 0; i < fold->n; ++i) { 462 fold1->n + fold2->n); 462 fold1->n + fold2->n); 466 for (i = 0; i < fold1->n; ++i) { 467 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]); 468 if (!res->qp[res->n]) 470 res->n++; 472 n1 = res->n; 474 for (i = 0; i < fold2->n; ++i) { 497 if (n1 != res->n - 1) 498 res->qp[n1] = res->qp[res->n - 1]; 499 res->n--; 503 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); 504 if (!res->qp[res->n]) 506 res->n++; 537 for (i = 0; i < fold->n; ++i) { 573 if (fold1->n == 1 && fold2->n != 1) 573 if (fold1->n == 1 && fold2->n != 1) 576 if (fold2->n == 1) { 587 for (i = 1; i < fold2->n; ++i) { 617 for (i = 0; i < fold->n; ++i) { 644 for (i = 0; i < fold->n; ++i) { 721 fold->n++; 749 isl_space_copy(fold->dim), fold->n); 753 dup->n = fold->n; 753 dup->n = fold->n; 754 for (i = 0; i < fold->n; ++i) { 787 for (i = 0; i < fold->n; ++i) 798 return fold->n == 0; 807 if (fold->n != 1) 837 fold1->n + fold2->n); 837 fold1->n + fold2->n); 841 for (i = 0; i < fold1->n; ++i) { 842 res->qp[res->n] = isl_qpolynomial_copy(fold1->qp[i]); 843 if (!res->qp[res->n]) 845 res->n++; 848 for (i = 0; i < fold2->n; ++i) { 849 res->qp[res->n] = isl_qpolynomial_copy(fold2->qp[i]); 850 if (!res->qp[res->n]) 852 res->n++; 1052 if (fold1->n != fold2->n) 1052 if (fold1->n != fold2->n) 1053 return fold1->n - fold2->n; 1053 return fold1->n - fold2->n; 1055 for (i = 0; i < fold1->n; ++i) { 1074 if (fold1->n != fold2->n) 1074 if (fold1->n != fold2->n) 1078 for (i = 0; i < fold1->n; ++i) { 1101 if (fold->n == 0) 1107 for (i = 1; i < fold->n; ++i) { 1134 n += pwf->p[i].fold->n; 1148 if (fold->n == 0) { 1157 for (i = 1; i < fold->n; ++i) { 1193 for (i = 0; i < fold2->n; ++i) { 1194 for (j = 0; j < fold1->n; ++j) { 1206 if (j >= fold1->n) 1288 for (i = 0; i < fold->n; ++i) { 1341 for (i = 0; i < fold->n; ++i) { 1366 for (i = 0; i < fold->n; ++i) 1396 for (i = 0; i < fold->n; ++i) { 1426 for (i = 0; i < fold->n; ++i) { 1667 for (i = 0; i < fold->n; ++i) { 1707 for (i = 0; i < fold->n; ++i) { 1757 for (i = 0; i < fold->n; ++i) {tools/polly/lib/External/isl/isl_output.c
1929 for (i = 0; i < fold->n; ++i) { 2342 for (i = 0; i < fold->n - 1; ++i) 2348 for (i = 0; i < fold->n; ++i) {