|
|
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 4677 for (i = 0; i < map->n; ++i) {
tools/polly/lib/External/isl/isl_affine_hull.c 1130 for (i = 0; i < map->n; ++i) {
1193 if (map->n == 0)
1203 while (set->n > 1)
1204 set->p[0] = affine_hull(set->p[0], set->p[--set->n]);
tools/polly/lib/External/isl/isl_coalesce.c 3828 if (i != map->n - 1)
3829 map->p[i] = map->p[map->n - 1];
3830 map->n--;
3882 if (map->n <= 1)
3892 n = map->n;
3898 for (i = 0; i < map->n; ++i) {
3919 for (i = map->n - 1; i >= 0; --i)
tools/polly/lib/External/isl/isl_convex_hull.c 126 for (j = 0; j < set->n; ++j) {
153 return j >= set->n;
195 for (i = 0; i < set->n; ++i) {
236 n_ineq = set->n;
237 for (i = 0; i < set->n; ++i) {
241 lp = isl_basic_set_alloc(set->ctx, 0, dim * set->n, 0, n_eq, n_ineq);
248 for (i = 0; i < set->n; ++i) {
253 for (i = 0; i < set->n; ++i) {
262 isl_seq_clr(lp->eq[k]+1+dim*(i+1), dim*(set->n-i-1));
269 isl_seq_clr(lp->ineq[k]+1+dim*(i+1), dim*(set->n-i-1));
364 obj = isl_vec_alloc(ctx, 1 + dim*set->n);
368 for (i = 0; i < set->n; ++i) {
421 isl_assert(set->ctx, set->n > 0, goto error);
570 isl_assert(set->ctx, set->n > 0, goto error);
630 for (i = 0; i < set->n; ++i) {
638 isl_assert(set->ctx, set->n > 0, goto error);
668 for (i = 0; i < set->n; ++i) {
875 for (i = 0; i < set->n; ++i) {
1413 if (set->n == 0) {
1419 lin = isl_set_alloc_space(isl_set_get_space(set), set->n, 0);
1420 for (i = 0; i < set->n; ++i)
1603 for (i = 0; i < set->n; ++i)
1606 if (i >= set->n)
1610 for (i = best + 1; i < set->n; ++i) {
1647 for (s = 0; s < set->n; ++s) {
1678 for (s = 0; s < set->n; ++s) {
1720 for (i = 0; i < set->n; ++i) {
1767 if (set->n == 1) {
1822 if (set->n == 1) {
1898 if (map->n == 0)
2045 (set->n - 1) * sizeof(struct sh_data_entry));
2049 data->n = set->n;
2053 for (i = 0; i < set->n; ++i) {
2127 for (j = i + 1; j < set->n; ++j) {
2217 for (j = i + 1; j < set->n; ++j) {
2229 if (j < set->n) {
2284 for (i = 0; i < set->n; ++i) {
2298 for (i = 0; i < set->n; ++i)
2323 if (map->n == 0)
2375 if (!map || map->n <= 1)
2382 if (!map || map->n <= 1)
2594 if (map->n <= 1)
2598 for (i = 1; i < map->n; ++i) {
2646 for (i = 0; i < set->n; ++i) {
2673 if (i < set->n)
tools/polly/lib/External/isl/isl_equalities.c 826 if (set->n == 0) {
835 if (set->n == 1)
844 for (i = 1; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_farkas.c 354 if (set->n == 0) {
363 for (i = 1; i < set->n; ++i) {
403 if (set->n == 0) {
412 for (i = 1; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_ilp.c 448 if (set->n == 0)
454 if (set->n == 1)
460 for (i = 1; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_input.c 2844 if (map->n > 1)
2849 if (map->n == 0)
tools/polly/lib/External/isl/isl_lp.c 102 if (map->n == 0)
106 for (i = 0; i < map->n; ++i)
119 if (!opt && map->n > 1 && sol) {
123 if (map->n > 0)
125 if (map->n > 0 && opt_denom) {
138 for (i = 1; i < map->n; ++i) {
184 if (map->n > 0 && opt_denom) {
188 if (map->n > 0)
tools/polly/lib/External/isl/isl_map.c 548 for (i = 0; i < map->n; ++i) {
759 for (i = 0; i < map->n; ++i) {
974 if (map->n == 0)
979 for (i = 1; i < map->n; ++i) {
1063 for (i = 0; i < map->n; ++i) {
2115 for (i = 0; i < map->n; ++i) {
2323 for (i = 0; i < map->n; ++i) {
2411 for (i = 0; i < map->n; ++i) {
2467 if (map->n == 0)
2474 for (i = 0; i < map->n; ++i) {
2772 if (map->n == 0)
2779 for (i = 0; i < map->n; ++i) {
2837 for (i = 0; i < map->n; ++i) {
2997 for (i = 0; i < map->n; ++i) {
3003 if (map->n > 1)
3123 if (map->n == 0)
3130 for (i = 0; i < map->n; ++i) {
3167 for (i = 0; i < map->n; ++i) {
3379 if (map->n + n <= map->size)
3381 grown = isl_map_alloc_space(isl_map_get_space(map), map->n + n, map->flags);
3384 for (i = 0; i < map->n; ++i) {
3388 grown->n++;
3444 set->ref, set->n, set->dim->nparam, set->dim->n_out,
3446 for (i = 0; i < set->n; ++i) {
3465 map->ref, map->n, map->dim->nparam, map->dim->n_in,
3467 for (i = 0; i < map->n; ++i) {
3676 isl_assert(map1->ctx, map1->n == 1, goto error);
3677 isl_assert(map2->ctx, map1->n == 1, goto error);
3705 map1->n = 0;
3745 if (map1->n == 1 && map2->n == 1 &&
3745 if (map1->n == 1 && map2->n == 1 &&
3770 map1->n * map2->n, flags);
3770 map1->n * map2->n, flags);
3773 for (i = 0; i < map1->n; ++i)
3774 for (j = 0; j < map2->n; ++j) {
3986 for (i = 0; i < map->n; ++i) {
4170 for (i = 0; i < map->n; ++i) {
4397 for (i = 0; i < map->n; ++i) {
4644 map1->n * map2->n, 0);
4644 map1->n * map2->n, 0);
4647 for (i = 0; i < map1->n; ++i)
4648 for (j = 0; j < map2->n; ++j) {
4716 for (i = 0; i < map->n; ++i) {
4799 for (i = 0; i < map->n; ++i) {
5479 for (i = 1; i < map->n; ++i)
5482 for (i = 0; i < map->n; ++i) {
5488 if (map->n == 0)
5572 for (i = 0; i < map->n; ++i) {
5845 for (i = 0; i < map->n; ++i) {
5869 for (i = 0; i < map->n; ++i) {
5897 for (i = 0; i < map->n; ++i) {
6004 map->n = 0;
6117 dup = isl_map_alloc_space(isl_space_copy(map->dim), map->n, map->flags);
6118 for (i = 0; i < map->n; ++i)
6133 isl_assert(map->ctx, map->n < map->size, goto error);
6134 map->p[map->n] = bmap;
6135 map->n++;
6158 for (i = 0; i < map->n; ++i)
6300 map->n--;
6301 if (i != map->n) {
6302 map->p[i] = map->p[map->n];
6326 for (i = map->n - 1; i >= 0; --i) {
6354 for (i = map->n - 1; i >= 0; --i) {
6383 for (i = 0; i < map->n; ++i) {
6419 for (i = map->n - 1; i >= 0; --i) {
6511 for (i = 0; i < map->n; ++i) {
6596 for (i = map->n - 1; i >= 0; --i) {
6734 for (i = 0; i < map->n; ++i) {
6800 for (i = 1; i < map->n; ++i) {
6884 if (map->n == 1) {
7009 if (map->n == 0) {
7016 for (i = 1; i < map->n; ++i) {
7188 for (i = 0; i < set->n; ++i) {
7415 for (i = 0; i < map->n; ++i) {
7590 for (i = 0; i < map->n; ++i) {
7638 if (map->n == 0)
7650 for (i = 1 ; i < map->n; ++i) {
7689 for (i = 0; i < map->n; ++i) {
7727 if (map1->n == 0) {
7731 if (map2->n == 0) {
7757 map1->n + map2->n, flags);
7757 map1->n + map2->n, flags);
7760 for (i = 0; i < map1->n; ++i) {
7766 for (i = 0; i < map2->n; ++i) {
7826 if (map1->n > 1)
7880 map->n * set->n, flags);
7880 map->n * set->n, flags);
7881 for (i = 0; result && i < map->n; ++i)
7882 for (j = 0; j < set->n; ++j) {
8036 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
8036 result = isl_map_alloc_space(dim_result, map1->n * map2->n, 0);
8039 for (i = 0; i < map1->n; ++i)
8040 for (j = 0; j < map2->n; ++j) {
8050 if (result && result->n <= 1)
8123 result = isl_set_alloc_space(dim, map->n, 0);
8126 for (i = 0; i < map->n; ++i)
8207 for (i = 0; i < map->n; ++i) {
8504 for (i = 0; i < map->n; ++i) {
8516 return map ? map->n == 0 : isl_bool_error;
8521 return set ? set->n == 0 : isl_bool_error;
8691 for (i = 0; i < map->n; ++i) {
8857 for (i = 0; i < map->n; ++i) {
9033 if (map->n == 0)
9040 for (i = 1; i < map->n; ++i)
9042 for (i = 1; i < map->n; ++i) {
9075 if (map->n == 0)
9151 for (i = map->n - 1; i >= 0; --i)
9323 for (i = 0; i < set1->n; ++i)
9324 for (j = 0; j < set2->n; ++j) {
9375 if (map->n == 0)
9377 if (map->n == 1)
9382 for (i = 1; fixed == isl_bool_true && i < map->n; ++i) {
9656 if (set1->n != set2->n)
9656 if (set1->n != set2->n)
9657 return set1->n - set2->n;
9657 return set1->n - set2->n;
9659 for (i = 0; i < set1->n; ++i) {
9704 qsort(map->p, map->n, sizeof(struct isl_basic_map *), qsort_bmap_cmp);
9705 for (i = map->n - 1; i >= 1; --i) {
9709 for (j = i; j < map->n; ++j)
9711 map->n--;
9734 if (map->n <= 1)
9738 for (i = 0; i < map->n; ++i) {
9764 for (i = 0; i < map->n; ++i) {
9806 equal = map1->n == map2->n;
9806 equal = map1->n == map2->n;
9807 for (i = 0; equal && i < map1->n; ++i) {
9839 list = isl_basic_map_list_alloc(ctx, map->n);
9841 for (i = 0; i < map->n; ++i) {
10161 map1->n * map2->n, flags);
10161 map1->n * map2->n, flags);
10164 for (i = 0; i < map1->n; ++i)
10165 for (j = 0; j < map2->n; ++j) {
10485 for (i = 0; i < map->n; ++i) {
10505 return map ? map->n : 0;
10510 return set ? set->n : 0;
10521 for (i = 0; i < map->n; ++i)
10536 for (i = 0; i < set->n; ++i)
10554 list = isl_basic_set_list_alloc(isl_set_get_ctx(set), set->n);
10555 for (i = 0; i < set->n; ++i) {
10616 for (i = 0; i < set->n; ++i) {
10652 for (i = 0; i < set->n; ++i)
10719 for (i = 0; i < map->n; ++i) {
10750 for (i = 0; i < map->n; ++i) {
10790 for (i = 0; i < map->n; ++i) {
11171 if (map->n == 0)
11173 if (map->n >= 2)
11346 if (set->n != 1)
11516 for (i = 0; i < map->n; ++i) {
11713 for (i = 0; i < map->n; ++i) {
12162 for (i = 0; i < map->n; ++i) {
12710 for (i = set->n - 1; i >= 0; --i) {
13128 for (i = 0; i < map->n; ++i) {
13144 if (map->n > 1)
tools/polly/lib/External/isl/isl_map_lexopt_templ.c 117 for (i = 1; i < dom->n; ++i) {
tools/polly/lib/External/isl/isl_map_simplify.c 1748 for (i = 0; i < map->n; ++i) {
1756 if (map->n > 1)
3129 for (i = map->n - 1; i >= 0; --i) {
3136 if (i != map->n - 1)
3137 map->p[i] = map->p[map->n - 1];
3138 map->n--;
3353 for (i = 0; i < map->n; ++i) {
3359 if (univ && map->n > 1)
3365 if (map->n > 1)
3664 for (i = 0; i < map1->n; ++i) {
3665 for (j = 0; j < map2->n; ++j) {
tools/polly/lib/External/isl/isl_map_subtract.c 328 snap = isl_alloc_array(map->ctx, struct isl_tab_undo *, map->n);
329 k = isl_alloc_array(map->ctx, int, map->n);
330 n = isl_alloc_array(map->ctx, int, map->n);
331 index = isl_calloc_array(map->ctx, int *, map->n);
332 div_map = isl_calloc_array(map->ctx, int *, map->n);
348 if (level >= map->n) {
438 for (i = 0; index && i < map->n; ++i)
441 for (i = 0; div_map && i < map->n; ++i)
454 for (i = 0; index && i < map->n; ++i)
457 for (i = 0; div_map && i < map->n; ++i)
558 for (i = 0; i < map1->n; ++i) {
708 for (i = 0; i < map1->n; ++i) {
736 if (map->n != 1)
808 if (map1->n != 1)
817 for (i = 0; i < map2->n; ++i) {
898 if (map->n <= 1)
904 if (!map || map->n <= 1)
909 for (i = 1; i < map->n; ++i) {
tools/polly/lib/External/isl/isl_mat.c 1418 for (i = 0; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_morph.c 724 for (i = 0; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_output.c 151 p = isl_printer_print_int(p, map->n);
153 for (i = 0; i < map->n; ++i) {
1018 for (i = 0; i < map->n; ++i) {
1031 for (i = 0; i < set->n; ++i) {
1081 if (map->n == 0)
1083 for (i = 0; i < map->n; ++i) {
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)
1148 if (!p->dump && map->n >= 2) {
1292 split = isl_calloc_array(ctx, struct isl_aff_split, map->n);
1296 for (i = 0; i < map->n; ++i) {
1307 if (isl_sort(split, map->n, sizeof(struct isl_aff_split),
1311 n = map->n;
1328 free_split(split, map->n);
1396 rational = split[i].map->n > 0 &&
1417 if (!p->dump && map->n > 0)
1420 p = print_split_map(p, split, map->n, map->dim);
1422 rational = map->n > 0 &&
1427 free_split(split, map->n);
1466 if (map->n > 0)
1472 for (i = 0; i < map->n; ++i) {
1480 free_split(split, map->n);
2223 if (set->n == 0)
2226 for (i = 0; i < set->n; ++i) {
2229 if (set->n > 1)
2232 if (set->n > 1)
tools/polly/lib/External/isl/isl_point.c 424 for (i = 0; i < set->n; ++i)
492 for (i = 0; i < map->n; ++i) {
tools/polly/lib/External/isl/isl_pw_templ.c 1713 for (i = 0; i < set->n; ++i)
1730 for (i = 0; i < set->n; ++i) {
tools/polly/lib/External/isl/isl_sample.c 1250 for (i = 0; i < map->n; ++i) {
1258 if (i == map->n)
1292 for (i = 0; i < set->n; ++i) {
1300 if (i == set->n)
tools/polly/lib/External/isl/isl_scan.c 237 for (i = 0; i < set->n; ++i)
tools/polly/lib/External/isl/isl_tab_pip.c 4745 for (i = 0; i < set->n; ++i) {
4785 for (i = 0; i < empty->n; ++i) {
4835 for (i = 0; i < opt->n; ++i) {
tools/polly/lib/External/isl/isl_test.c 1814 if (map1->n != 1)
1838 one = set && set->n == 1;
tools/polly/lib/External/isl/isl_transitive_closure.c 769 steps = isl_mat_alloc(map->ctx, map->n, d);
774 for (i = 0; i < map->n; ++i) {
1043 for (j = 0; j < map->n && ok; ++j) {
1116 for (j = 0; j < map->n; ++j) {
1230 if (C->n != 1) {
1237 for (i = 0; i < map->n; ++i) {
1263 for (j = 0; j < map->n; ++j)
1268 if (qc->n >= map->n) {
1268 if (qc->n >= map->n) {
1315 if (map->n <= 1)
1320 dom = isl_calloc_array(map->ctx, isl_set *, map->n);
1321 ran = isl_calloc_array(map->ctx, isl_set *, map->n);
1322 left = isl_calloc_array(map->ctx, int, map->n);
1323 right = isl_calloc_array(map->ctx, int, map->n);
1330 for (i = 0; !res && i < map->n; ++i) {
1350 if (C->n != 1) {
1382 if (qc->n >= map->n) {
1382 if (qc->n >= map->n) {
1397 for (i = 0; i < map->n; ++i) {
1414 for (i = 0; i < map->n; ++i)
1418 for (i = 0; i < map->n; ++i)
1600 for (k = 0; k < map->n; ++k) {
1723 if (map->n <= 1)
1726 group = setup_groups(map->ctx, map->p, map->n, &set, &n);
1730 for (i = 0; i < 2 * map->n; ++i)
1866 if (map->n <= 1)
1871 g = isl_tarjan_graph_init(map->ctx, map->n, &basic_map_follows, &data);
1881 n = map->n;
2403 if (id->n != 1 || (*qc)->n != 1)
2403 if (id->n != 1 || (*qc)->n != 1)
2406 for (j = 0; j < map->n; ++j) {
2428 if (j == map->n)
2486 if (map->n == 1)
2489 for (i = 0; i < map->n; ++i) {
2498 app = isl_map_alloc_space(isl_map_get_space(map), map->n - 1, 0);
2500 for (j = 0; j < map->n; ++j) {
2572 *n += map->n;
2584 for (i = 0; i < map->n; ++i) {