reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
2825 for (i = 0; i < pwaff->n; ++i) { 3183 if (pwaff->n == 0) 3186 for (i = 0; i < pwaff->n; ++i) { 3202 if (pwaff->n == 0) 3205 for (i = 0; i < pwaff->n; ++i) { 3221 if (pwaff->n == 0) 3224 for (i = 0; i < pwaff->n; ++i) { 3319 for (i = 0; i < pwaff->n; ++i) { 3724 if (pwaff->n == 0) 3727 for (i = 0; i < pwaff->n; ++i) { 5363 n = pma->n * subs->n; 5367 for (j = 0; j < subs->n; ++j) { 6040 n = pma->n * pa->n; 6044 for (j = 0; j < pa->n; ++j) { 6299 pma = isl_pw_multi_aff_alloc_size(space, pa->n); 6301 for (i = 0; i < pa->n; ++i) { 6815 for (i = 0; i < pa->n; ++i) { 7188 if (pa1->n != pa2->n) 7188 if (pa1->n != pa2->n) 7189 return pa1->n - pa2->n; 7189 return pa1->n - pa2->n; 7191 for (i = 0; i < pa1->n; ++i) { 8934 for (i = 0; i < pa->n; ++i) {tools/polly/lib/External/isl/isl_aff_map.c
290 for (i = 0; i < pwaff->n; ++i) {
tools/polly/lib/External/isl/isl_input.c970 if (pa->n != 1) 3511 if (pa->n != 1)tools/polly/lib/External/isl/isl_output.c
2667 for (i = 0; i < pa->n; ++i) { 2810 if (pwaff->n < 1) 3187 if (pa->n == 0) 3190 need_parens = pa->n != 1 || !isl_set_plain_is_universe(pa->p[0].set); 3194 for (i = 0; i < pa->n; ++i) {tools/polly/lib/External/isl/isl_polynomial.c
3393 pwaff->n); 3395 for (i = 0; i < pwaff->n; ++i) {tools/polly/lib/External/isl/isl_pw_eval.c
64 for (i = 0; i < pw->n; ++i) {
tools/polly/lib/External/isl/isl_pw_hash.c 23 for (i = 0; i < pw->n; ++i) {
tools/polly/lib/External/isl/isl_pw_templ.c45 pw->n = 0; 88 isl_assert(ctx, pw->n < pw->size, goto error); 90 pw->p[pw->n].set = set; 91 pw->p[pw->n].FIELD = el; 92 pw->n++; 175 dup = FN(PW,alloc_size)(isl_space_copy(pw->dim), pw->n); 180 for (i = 0; i < pw->n; ++i) 216 for (i = 0; i < pw->n; ++i) { 269 return pw->n == 0; 282 for (i = 0; i < pw->n; ++i) { 431 n = (pw1->n + 1) * (pw2->n + 1); 431 n = (pw1->n + 1) * (pw2->n + 1); 438 for (i = 0; i < pw1->n; ++i) { 440 for (j = 0; j < pw2->n; ++j) { 461 for (j = 0; j < pw2->n; ++j) { 463 for (i = 0; i < pw1->n; ++i) 501 if (pw->n + n <= pw->size) 504 n += pw->n; 520 for (i = 0; i < pw->n; ++i) 536 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n) 536 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n) 536 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n) 536 if (pw1->size < pw1->n + pw2->n && pw1->n < pw2->n) 557 pw1 = FN(PW,grow)(pw1, pw2->n); 561 for (i = 0; i < pw2->n; ++i) 601 n = pw1->n * pw2->n; 601 n = pw1->n * pw2->n; 608 for (i = 0; i < pw1->n; ++i) { 609 for (j = 0; j < pw2->n; ++j) { 687 for (i = 0; i < pw->n; ++i) { 720 for (i = 0; i < pw->n; ++i) 744 if (i != pw->n - 1) 745 pw->p[i] = pw->p[pw->n - 1]; 746 pw->n--; 794 if (pw->n == 0) 804 for (i = pw->n - 1; i >= 0; --i) { 827 if (pw->n == 0) { 836 for (i = pw->n - 1; i >= 0; --i) { 911 for (i = 0; i < pw->n - 1; ++i) { 915 pw->p[0].FIELD = pw->p[pw->n - 1].FIELD; 916 pw->p[0].set = pw->p[pw->n - 1].set; 917 pw->n = 1; 953 if (pw->n == 0) { 978 if (pw->n == 1) { 991 for (i = pw->n - 1; i >= 0; --i) { 995 if (i == pw->n - 1) { 1015 if (i != pw->n - 1) 1016 pw->p[i] = pw->p[pw->n - 1]; 1017 pw->n--; 1089 if (pw->n <= 1) 1091 if (isl_sort(pw->p, pw->n, sizeof(pw->p[0]), 1094 for (i = pw->n - 1; i >= 1; --i) { 1105 for (j = i + 1; j < pw->n; ++j) 1107 pw->n--; 1128 for (i = 0; i < pw->n; ++i) { 1153 if (pw->n == 0 || n == 0) 1158 for (i = 0; i < pw->n; ++i) { 1187 for (i = 0; i < pw->n; ++i) { 1222 for (i = 0; i < pw->n; ++i) { 1263 for (i = 0; i < pw->n; ++i) { 1338 for (i = 0; i < pw->n; ++i) { 1370 for (i = 0; i < pw->n; ++i) { 1423 for (i = 0; i < pw->n; ++i) { 1525 for (i = 0; i < pw->n; ++i) { 1685 return pw ? pw->n : 0; 1697 for (i = 0; i < pw->n; ++i) 1801 for (i = 0; i < pw->n; ++i) { 1813 for (i = 0; i < pw->n; ++i) { 1848 if (pw->n == 0) 1855 for (i = 0; i < pw->n; ++i) { 1892 if (pw->n == 0) { 1904 for (i = 0; i < pw->n; ++i) { 1940 if (pw->n == 0) { 1952 for (i = 0; i < pw->n; ++i) { 1989 for (i = 0; i < pw->n; ++i) { 2034 equal = pw1->n == pw2->n; 2034 equal = pw1->n == pw2->n; 2035 for (i = 0; equal && i < pw1->n; ++i) { 2063 if (pw->n == 0) 2066 for (i = 0; i < pw->n; ++i) { 2158 for (i = 0; i < pw->n; ++i) {tools/polly/lib/External/isl/isl_pw_union_opt.c
35 list = isl_set_list_alloc(ctx, pw->n); 36 for (i = 0; i < pw->n; ++i) 96 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n); 96 res = FN(PW,alloc_size)(isl_space_copy(pw1->dim), pw1->n + pw2->n); 99 while (i < pw1->n || j < pw2->n) { 99 while (i < pw1->n || j < pw2->n) { 104 if (i < pw1->n && j < pw2->n) 104 if (i < pw1->n && j < pw2->n) 108 cmp = i < pw1->n ? -1 : 1; 218 for (i = 0; i < pw1->n; ++i) { 219 for (j = 0; j < pw2->n; ++j) {