|
|
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 4856 n = hull->n_ineq;
tools/polly/lib/External/isl/isl_affine_hull.c 45 if (bmap->n_ineq <= 1)
313 for (i = 0; i < bset->n_ineq; ++i)
883 if (bmap->n_ineq == 0)
946 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
tools/polly/lib/External/isl/isl_coalesce.c 100 int *ineq = isl_calloc_array(bmap_i->ctx, int, bmap_i->n_ineq);
105 for (k = 0; k < bmap_i->n_ineq; ++k) {
292 for (i = 0; i < info->bmap->n_ineq; ++i) {
439 for (k = 0; k < info->bmap->n_ineq; ++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;
465 for (k = 0; k < bmap->n_ineq; ++k)
503 n_ineq = info[i].bmap->n_ineq + info[j].bmap->n_ineq;
503 n_ineq = info[i].bmap->n_ineq + info[j].bmap->n_ineq;
609 for (k = 0; k < info[i].bmap->n_ineq; ++k) {
614 for (l = 0; l < info[j].bmap->n_ineq; ++l) {
626 if (l < info[j].bmap->n_ineq)
630 if (k < info[i].bmap->n_ineq) {
667 for (k = 0; k < bmap->n_ineq; ++k) {
730 if (isl_tab_extend_cons(info[i].tab, 1 + info[j].bmap->n_ineq) < 0)
752 for (k = 0; k < info[j].bmap->n_ineq; ++k) {
1014 for (i = 0; i < info->bmap->n_ineq; ++i) {
1207 for (k = 0; k < info->bmap->n_ineq; ++k) {
1334 for (l = 0; l < bmap->n_ineq; ++l) {
1503 info[i].bmap->n_ineq + info[j].bmap->n_ineq,
1503 info[i].bmap->n_ineq + info[j].bmap->n_ineq,
1642 for (k = 0; k < info[i].bmap->n_ineq; ++k) {
1683 max_wrap = 1 + 2 * info[j].bmap->n_eq + info[j].bmap->n_ineq;
1817 for (k = 0; k < info[i].bmap->n_ineq; ++k) {
1860 for (l = 0; l < info[i].bmap->n_ineq; ++l) {
2042 info[i].bmap->n_ineq + info[j].bmap->n_ineq,
2042 info[i].bmap->n_ineq + info[j].bmap->n_ineq,
2141 for (i = 0; i < info->bmap->n_ineq; ++i) {
2274 if (info[i].bmap->n_ineq && !info[i].ineq)
2282 if (info[j].bmap->n_ineq && !info[j].ineq)
2307 all(info[i].ineq, info[i].bmap->n_ineq, STATUS_VALID)) {
2311 all(info[j].ineq, info[j].bmap->n_ineq, STATUS_VALID)) {
2724 for (i = n_ineq; i < bmap->n_ineq; ++i)
2856 if (info->bmap->n_eq + info->bmap->n_ineq != info->tab->n_con)
3090 if (bmap->n_ineq && !info_i->ineq)
3098 all(info_i->ineq, bmap->n_ineq, STATUS_VALID)) {
tools/polly/lib/External/isl/isl_constraint.c 205 return bmap->n_eq + bmap->n_ineq;
238 for (i = 0; i < bmap->n_ineq; ++i) {
870 for (i = 0; i < bset->n_ineq; ++i) {
880 for (j = i + 1; j < bset->n_ineq; ++j) {
966 for (j = 0; j < bset->n_ineq; ++j) {
996 for (j = 0; j < bset->n_ineq; ++j) {
1022 for (i = 0; i < bset->n_ineq; ++i) {
1042 if (i < bset->n_ineq)
1064 for (i = 0; i < bset->n_ineq; ++i) {
1084 if (i < bset->n_ineq)
1107 for (i = 0; i < bset->n_ineq; ++i) {
1118 for (j = 0; j < bset->n_ineq; ++j) {
1146 if (j < bset->n_ineq)
1152 if (i < bset->n_ineq)
1221 for (i = 0; i < bset->n_ineq; ++i) {
1232 for (i = context->n_ineq - 1; i >= 0; --i)
tools/polly/lib/External/isl/isl_convex_hull.c 64 if (bmap->n_ineq <= 1)
239 n_ineq += set->p[i]->n_ineq;
265 for (j = 0; j < set->p[i]->n_ineq; ++j) {
574 for (i = 0; i < hull->n_ineq; ++i) {
587 isl_space_copy(hull->dim), 0, 0, facet->n_ineq);
590 for (j = 0; j < facet->n_ineq; ++j) {
591 for (f = 0; f < hull_facet->n_ineq; ++f)
595 if (f < hull_facet->n_ineq)
655 for (j = 0; j < set->p[0]->n_ineq; ++j) {
693 for (j = 0; j < bset->n_ineq; ++j) {
779 2 + bset1->n_ineq + bset2->n_ineq);
779 2 + bset1->n_ineq + bset2->n_ineq);
792 for (j = 0; j < bset[i]->n_ineq; ++j) {
902 bset1->n_ineq + bset2->n_ineq);
902 bset1->n_ineq + bset2->n_ineq);
913 for (i = 0; i < bset1->n_ineq; ++i) {
927 for (i = 0; i < bset2->n_ineq; ++i) {
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;
1049 for (j = 0; j < bset1->n_ineq; ++j) {
1058 for (j = 0; j < bset2->n_ineq; ++j) {
1130 for (i = 0; i < bset1->n_ineq; ++i)
1384 for (i = 0; i < bset->n_ineq && lin->n_eq < dim; ++i) {
1608 min_constraints = set->p[i]->n_ineq;
1613 if (set->p[i]->n_ineq >= min_constraints)
1615 min_constraints = set->p[i]->n_ineq;
1627 for (i = 0; i < set->p[best]->n_ineq; ++i) {
1659 for (i = 0; i < set->p[s]->n_ineq; ++i) {
1681 if (set->p[s]->n_ineq != hull->n_ineq)
1681 if (set->p[s]->n_ineq != hull->n_ineq)
1683 for (i = 0; i < set->p[s]->n_ineq; ++i) {
1688 if (i == set->p[s]->n_ineq)
1722 n_ineq += set->p[i]->n_ineq;
1738 if (hull->n_ineq == 0)
2031 for (i = 0; i < bset->n_ineq; ++i) {
2055 2 * set->p[i]->n_eq + set->p[i]->n_ineq);
2263 for (j = 0; j < set->p[i]->n_ineq; ++j)
2287 n_ineq += 2 * set->p[i]->n_eq + set->p[i]->n_ineq;
2464 i1 = bmap1->n_ineq - 1;
2465 i2 = bmap2->n_ineq - 1;
2721 int hull_n_ineq = hull->n_ineq;
2732 last_added = hull->n_ineq > hull_n_ineq;
2773 for (j = 0; j < bset->n_ineq; ++j)
2832 n_ineq += 2 * bset->n_eq + bset->n_ineq;
3026 for (j = 0; j < hull->n_ineq; ++j) {
tools/polly/lib/External/isl/isl_dim_map.c 150 for (i = 0; i < src->n_ineq; ++i) {
tools/polly/lib/External/isl/isl_factorization.c 275 H = isl_mat_alloc(bset->ctx, bset->n_eq + bset->n_ineq, nvar);
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,
236 total, bset->n_ineq + (shift > 0));
239 for (i = 0; i < bset->n_eq + bset->n_ineq; ++i) {
255 for (j = 0; j < bset->n_ineq; ++j)
260 for (i = 0; i < bset->n_ineq; ++i) {
265 1 + shift + total + bset->n_eq + bset->n_ineq);
278 for (j = 0; j < bset->n_ineq; ++j)
tools/polly/lib/External/isl/isl_ilp.c 52 0, 0, bset->n_ineq);
54 for (i = 0; i < bset->n_ineq; ++i) {
tools/polly/lib/External/isl/isl_map.c 236 return bmap->n_ineq;
1150 bmap->n_ineq = 0;
1233 for (i = 0; i < src->n_ineq; ++i) {
1252 bmap->n_div, bmap->n_eq, bmap->n_ineq);
1341 return bmap->n_eq + bmap->n_ineq + n <= bmap->c_size;
1443 bmap->ineq[j] = bmap->ineq[bmap->n_ineq - 1];
1444 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1447 bmap->n_ineq--;
1504 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1505 bmap->ineq[bmap->n_ineq - 1] = bmap->eq[-1];
1508 bmap->n_ineq--;
1518 return bmap->n_ineq + n <= bmap->eq - bmap->ineq;
1532 isl_seq_clr(bmap->ineq[bmap->n_ineq] +
1535 return bmap->n_ineq++;
1547 isl_assert(bmap->ctx, n <= bmap->n_ineq, return -1);
1548 bmap->n_ineq -= n;
1562 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
1564 if (pos != bmap->n_ineq - 1) {
1566 bmap->ineq[pos] = bmap->ineq[bmap->n_ineq - 1];
1567 bmap->ineq[bmap->n_ineq - 1] = t;
1570 bmap->n_ineq--;
1778 for (i = 0; i < bmap2->n_ineq; ++i) {
1839 n_ineq += base->n_ineq;
2013 for (i = 0; i < bmap->n_ineq; ++i)
2041 isl_basic_map_free_inequality(bmap, bmap->n_ineq);
2154 for (i = 0; i < bmap->n_ineq; ++i)
2264 for (i = 0; i < bmap->n_ineq; ++i)
2361 for (i = 0; i < bmap->n_ineq; ++i) {
2701 for (i = 0; (!check_lb || !check_ub) && i < bmap->n_ineq; ++i) {
2714 for (i = 0; bmap && i < bmap->n_ineq; ++i) {
2816 for (i = 0; i < bmap->n_ineq; ++i)
2881 for (i = bmap->n_ineq - 1; i >= 0; --i) {
2929 for (i = bmap->n_ineq - 1; i >= 0; --i) {
3298 dump_constraints(bmap, bmap->ineq, bmap->n_ineq, ">=", out, indent);
3348 isl_assert(bmap->ctx, pos < bmap->n_ineq, return -1);
3490 bset->n_div, bset->n_eq, bset->n_ineq);
3540 bset->n_div, bset->n_eq, bset->n_ineq);
3576 for (i = 0; i < bmap->n_ineq; ++i) {
3635 bmap2->n_div, bmap2->n_eq, bmap2->n_ineq);
3681 if (map2->p[0]->n_eq + map2->p[0]->n_ineq != 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);
4521 bmap1->n_ineq + bmap2->n_ineq);
4521 bmap1->n_ineq + bmap2->n_ineq);
4606 bmap1->n_ineq + bmap2->n_ineq);
4606 bmap1->n_ineq + bmap2->n_ineq);
4691 for (i = 0; i < bmap->n_ineq; ++i)
4760 bmap->n_eq, bmap->n_ineq + 2 * n_out);
8621 return bmap->n_eq == 0 && bmap->n_ineq == 0;
9561 if (bmap->n_ineq == 0)
9566 if (isl_sort(bmap->ineq, bmap->n_ineq, sizeof(isl_int *),
9621 if (bmap1->n_ineq != bmap2->n_ineq)
9621 if (bmap1->n_ineq != bmap2->n_ineq)
9622 return bmap1->n_ineq - bmap2->n_ineq;
9622 return bmap1->n_ineq - bmap2->n_ineq;
9631 for (i = 0; i < bmap1->n_ineq; ++i) {
9990 bmap1->n_ineq + bmap2->n_ineq);
9990 bmap1->n_ineq + bmap2->n_ineq);
10051 bmap1->n_ineq + bmap2->n_ineq);
10051 bmap1->n_ineq + bmap2->n_ineq);
10103 bmap1->n_ineq + bmap2->n_ineq);
10103 bmap1->n_ineq + bmap2->n_ineq);
10448 isl_hash_byte(hash, bmap->n_ineq & 0xFF);
10449 for (i = 0; i < bmap->n_ineq; ++i) {
10638 size += bset->n_ineq * (1 + dim);
10682 for (i = 0; i < bmap->n_ineq; ++i) {
10993 for (i = 0; i < bmap->n_ineq; ++i) {
11002 for (j = i + 1; j < bmap->n_ineq; ++j) {
11011 if (j >= bmap->n_ineq)
11026 return bmap->n_ineq;
11068 *ineq = bmap->n_ineq;
11091 if (l >= bmap->n_ineq)
11325 for (i = 0; i < bset->n_ineq; ++i) {
11686 res = isl_basic_map_alloc_space(space, n_div, bmap->n_eq, bmap->n_ineq);
11972 mat = isl_mat_alloc(bmap->ctx, bmap->n_ineq,
11976 for (i = 0; i < bmap->n_ineq; ++i)
12667 for (i = 0; i < bset->n_ineq; ++i) {
12991 bmap->n_eq + strides, bmap->n_ineq + 2 * n_div_ma);
13010 for (i = 0; i < bmap->n_ineq; ++i) {
13547 for (j = 0; j < bset->n_ineq; ++j) {
13589 if (isl_mat_sub_transform(bmap->ineq, bmap->n_ineq, pos,
tools/polly/lib/External/isl/isl_map_simplify.c 79 for (i = bmap->n_ineq - 1; i >= 0; --i) {
309 for (k = 0; k < bmap->n_ineq; ++k) {
446 for (i = 0; i < bmap->n_ineq; ++i)
449 if (i < bmap->n_ineq)
642 if (bmap->n_ineq == 0)
644 ci->size = round_up(4 * (bmap->n_ineq + 1) / 3 - 1);
707 for (k = 0; k < bset->n_ineq; ++k) {
1168 if (!bmap || bmap->n_ineq <= 1)
1176 for (k = 1; k < bmap->n_ineq; ++k) {
1191 for (k = 0; k < bmap->n_ineq-1; ++k) {
1302 for (j = 0; j < bmap->n_ineq; ++j) {
1437 for (i = 0; i < bmap->n_ineq; ++i) {
1577 for (i = 0; i < bmap->n_ineq; ++i) {
1587 for (i = bmap->n_ineq - 1; i >= 0; --i) {
1843 for (i = 0; i < bset->n_ineq; ++i)
1873 if (context->n_ineq == 0)
1912 if (context->n_ineq == 0)
1917 for (k = 0; k < bset->n_ineq; ++k) {
1952 if (bmap->n_ineq == 0 || context->n_ineq == 0) {
1952 if (bmap->n_ineq == 0 || context->n_ineq == 0) {
2013 for (i = bmap->n_ineq - 1; i >= 0; --i)
2112 for (i = 0; i < bmap->n_ineq; ++i)
2162 for (j = 0; j < bset->n_ineq; ++j)
2165 if (j < bset->n_ineq)
2254 n_ineq = bset->n_ineq;
2342 if (bset->n_ineq == 0 || isl_basic_set_plain_is_universe(context)) {
2349 row = isl_calloc_array(ctx, int, bset->n_ineq);
2355 if (all_neg(row, bset->n_ineq))
2365 context_ineq = context->n_ineq;
2367 combined = isl_basic_set_extend_constraints(combined, 0, bset->n_ineq);
2372 if (isl_tab_extend_cons(tab, bset->n_ineq) < 0)
2375 for (i = 0; i < bset->n_ineq; ++i) {
2387 for (i = bset->n_ineq - 1; i >= 0; --i) {
2438 ineq = isl_mat_sub_alloc6(ctx, bset->ineq, 0, bset->n_ineq,
3081 n_ineq = bset->n_ineq;
3175 i1 = bmap->n_ineq - 1;
3176 i2 = context->n_ineq - 1;
3616 for (i = 0; i < bmap2->n_ineq; ++i) {
3625 for (i = 0; i < bmap1->n_ineq; ++i) {
3949 for (j = 0; j < bmap->n_ineq; ++j) {
3971 if (j < bmap->n_ineq)
4167 for (l = 0; l < bmap->n_ineq; ++l) {
4172 for (u = 0; u < bmap->n_ineq; ++u) {
4186 if (u < bmap->n_ineq)
4193 if (l == bmap->n_ineq) {
4283 for (i = 0; i < bmap->n_ineq; ++i) {
4333 for (l = 0; l < bmap->n_ineq; ++l) {
4336 for (u = 0; u < bmap->n_ineq; ++u) {
4592 for (i = 0; i < bmap->n_ineq && (lower < 0 || upper < 0); ++i) {
4742 for (j = 0; j < bmap->n_ineq; ++j) {
4754 for (j = bmap->n_ineq - 1; j >= 0; --j)
4882 for (i = 0; i < bmap->n_ineq; ++i)
5134 for (i = 0; i < bmap->n_ineq; ++i) {
5203 for (i = 0; i < bmap->n_ineq; ++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)
85 for (i = 0; i < bmap->n_ineq; ++i) {
725 if (bmap->n_ineq)
tools/polly/lib/External/isl/isl_mat.c 1385 if (preimage(ctx, bset->ineq, bset->n_ineq, bset->n_div, 0,
tools/polly/lib/External/isl/isl_morph.c 630 bset->n_div + max_stride, bset->n_eq + max_stride, bset->n_ineq);
651 mat = isl_mat_sub_alloc6(bset->ctx, bset->ineq, 0, bset->n_ineq,
656 for (i = 0; i < bset->n_ineq; ++i) {
tools/polly/lib/External/isl/isl_output.c 101 for (i = 0; i < bmap->n_ineq; ++i)
118 p = isl_printer_print_int(p, bmap->n_eq + bmap->n_ineq);
474 if (i + 1 >= bmap->n_ineq)
777 for (i = 0; i < bmap->n_ineq; ++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)
1220 if (isl_basic_map_free_inequality(bmap, bmap->n_ineq) < 0)
2209 for (i = 0; i < bset->n_ineq; ++i)
tools/polly/lib/External/isl/isl_sample.c 66 if (bset->n_eq == 0 && bset->n_ineq == 0)
78 isl_assert(bset->ctx, bset->n_ineq == 0, goto error);
95 for (i = 1; i < bset->n_ineq; ++i) {
102 if (i < bset->n_ineq) {
777 0, 0, cone->n_ineq);
779 for (i = 0; i < cone->n_ineq; ++i) {
1014 for (i = 0; i < bset->n_ineq; ++i) {
tools/polly/lib/External/isl/isl_scheduler.c 1980 edge->start = graph->lp->n_ineq;
1984 edge->end = graph->lp->n_ineq;
2814 if (con >= graph->lp->n_ineq)
tools/polly/lib/External/isl/isl_tab.c 1921 tab->n_con == bmap->n_eq + bmap->n_ineq,
2399 isl_basic_map_total_dim(bmap) + bmap->n_ineq + 1,
2415 for (i = 0; i < bmap->n_ineq; ++i) {
2450 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq,
2470 for (i = 0; i < bset->n_ineq; ++i) {
2643 for (i = bmap->n_ineq - 1; i >= 0; --i) {
3105 for (i = bmap->n_ineq - 1; i >= 0; --i) {
3112 bmap->n_ineq - i) < 0)
4041 tab->n_con == bmap->n_eq + bmap->n_ineq, goto error);
tools/polly/lib/External/isl/isl_tab_lexopt_templ.c 69 list = isl_alloc_array(ctx, int, bmap->n_ineq);
71 if ((bmap->n_ineq && !list) || (n_out && !var))
77 for (i = second + 1, n = 2; i < bmap->n_ineq; ++i) {
tools/polly/lib/External/isl/isl_tab_pip.c 2287 tab = isl_tab_alloc(bmap->ctx, 2 * bmap->n_eq + bmap->n_ineq + 1,
2326 for (i = 0; i < bmap->n_ineq; ++i) {
2895 cst = isl_vec_alloc(cgbr->tab->mat->ctx, bset->n_ineq);
2899 for (i = 0; i < bset->n_ineq; ++i) {
2911 for (i = 0; i < bset->n_ineq; ++i)
2949 for (i = 0; i < bset->n_ineq; ++i)
3311 if (isl_tab_extend_cons(tab, (cgbr->tab->bmap->n_ineq - first)/2) < 0)
3316 for (i = first; i < cgbr->tab->bmap->n_ineq; i += 2) {
3379 n_ineq = cgbr->tab->bmap->n_ineq;
3383 if (cgbr->tab->bmap->n_ineq > n_ineq &&
4447 for (i = 0; i < bmap->n_ineq; ++i) {
4487 for (j = 0; j < bmap->n_ineq; ++j) {
4543 table = isl_hash_table_alloc(ctx, bmap->n_ineq);
4555 for (i = 0; i < bmap->n_ineq; ++i) {
4576 if (i < bmap->n_ineq) {
4584 return i < bmap->n_ineq;
4704 for (i = 0; i < bmap->n_ineq; ++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);
622 delta->n_ineq + 1);
tools/polly/lib/External/isl/isl_vertices.c 424 selection = isl_alloc_array(bset->ctx, int, bset->n_ineq);
425 snap = isl_alloc_array(bset->ctx, struct isl_tab_undo *, bset->n_ineq);
427 if ((bset->n_ineq && (!selection || !snap)) || !facets)
435 if (level >= bset->n_ineq ||
523 for (i = 0; i < bset->n_ineq; ++i) {
577 if (isl_tab_extend_cons(tab, bset->n_ineq) < 0)
582 for (i = 0; i < bset->n_ineq; ++i) {
880 for (i = 0; i < bset->n_ineq; ++i)
1114 tab = isl_tab_alloc(bset->ctx, bset->n_eq + bset->n_ineq + 1,
1137 for (i = 0; i < bset->n_ineq; ++i) {
1476 for (i = 0; i < bset->n_ineq; ++i) {