| /src/external/mit/isl/dist/ |
| bound.c | 75 isl_bool bounded; local
108 bounded = isl_set_is_bounded(dom);
110 if (bounded < 0)
113 if (!bounded)
122 if (vpb->exact && bounded)
144 p = isl_printer_print_str(p, bounded ? "opt" : "sample");
|
| isl_bound.c | 77 * Since bernstein expansion requires bounded domains, we apply
90 int bounded; local
106 bounded = isl_basic_set_is_bounded(bset);
107 if (bounded < 0)
109 if (bounded)
|
| isl_sample.c | 193 /* Compute and return an initial basis for the bounded tableau "tab".
263 * then we may have only found integer values for the bounded dimensions
275 * - we have exhausted all bounded dimensions, meaning that we have
309 "expecting bounded rational solution",
316 "expecting bounded rational solution",
348 * the bounded directions have an integer value, then we can safely
445 "expecting bounded rational solution",
454 "expecting bounded rational solution",
620 /* Given a basic set that is known to be bounded, find and return
916 * transform bset such that the bounded directions appear a
955 struct isl_basic_set *bounded; local
[all...] |
| isl_scheduler_clustering.c | 741 /* Give a set of distances "set", are they bounded by a small constant
743 * In practice, check if they are bounded by 2 by checking that there
749 isl_bool bounded; local
757 bounded = isl_set_is_empty(test);
760 if (bounded < 0 || !bounded)
761 return bounded;
765 bounded = isl_set_is_empty(test);
768 return bounded;
813 /* Does the edge "edge" from "graph" have bounded dependence distance
845 isl_bool bounded; local
915 isl_bool bounded; local
[all...] |
| isl_convex_hull.c | 305 * This means that the facet is unbounded, but has a bounded intersection
808 /* Is the set bounded for each value of the parameters?
813 isl_bool bounded; local
821 bounded = isl_tab_cone_is_bounded(tab);
823 return bounded;
826 /* Is the image bounded for each value of the parameters and
833 isl_bool bounded; local
842 bounded = isl_basic_set_is_bounded(bset_from_bmap(bmap));
845 return bounded;
848 /* Is the set bounded for each value of the parameters
858 isl_bool bounded = isl_basic_set_is_bounded(set->p[i]); local
1794 isl_bool bounded; local
[all...] |
| isl_polynomial.c | 5093 isl_bool bounded; local
5110 bounded = isl_basic_set_is_bounded(bset);
5111 if (bounded < 0)
5113 if (!bounded)
|
| isl_test.c | 582 isl_bool bounded; local
585 bounded = isl_set_is_bounded(set);
588 if (bounded < 0)
590 if (!bounded)
592 "set not considered bounded", return -1);
595 bounded = isl_set_is_bounded(set);
596 assert(!bounded);
599 if (bounded < 0)
601 if (bounded)
603 "set considered bounded", return -1)
2125 int bounded; local
[all...] |
| isl_map.c | 11575 isl_bool bounded; local
11576 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
11577 if (bounded < 0 || !bounded)
11578 return bounded;
11606 isl_bool bounded; local
11607 bounded = fn(map->p[i], type, pos);
11608 if (bounded < 0 || bounded)
11609 return bounded;
11646 isl_bool bounded; local
[all...] |
