Searched refs:bounded (Results 1 - 9 of 9) sorted by relevance
| /haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/ |
| H A D | issue4448.go | 8 // to be bounded make 5g and 8g generate a dangling branch.
|
| /haiku-buildtools/isl/ |
| H A D | bound.c | 72 int bounded; local
105 bounded = isl_set_is_bounded(dom);
107 if (bounded < 0)
110 if (!bounded)
121 if (vpb->exact && bounded)
142 p = isl_printer_print_str(p, bounded ? "opt" : "sample");
|
| H A D | isl_bound.c | 22 * Since bernstein expansion requires bounded domains, we apply
30 int bounded; local
38 bounded = isl_basic_set_is_bounded(bset);
39 if (bounded < 0)
41 if (bounded)
|
| H A D | isl_sample.c | 322 /* Compute and return an initial basis for the bounded tableau "tab".
386 * then we may have only found integer values for the bounded dimensions
398 * - we have exhausted all bounded dimensions, meaning that we have
432 "expecting bounded rational solution",
439 "expecting bounded rational solution",
471 * the bounded directions have an integer value, then we can safely
568 "expecting bounded rational solution",
577 "expecting bounded rational solution",
728 /* Given a basic set that is known to be bounded, find and return
1023 * transform bset such that the bounded direction
1062 struct isl_basic_set *bounded; local
1278 basic_set_sample(struct isl_basic_set *bset, int bounded) argument
[all...] |
| H A D | isl_convex_hull.c | 396 * This means that the facet is unbounded, but has a bounded intersection
894 /* Is the set bounded for each value of the parameters?
899 int bounded; local
907 bounded = isl_tab_cone_is_bounded(tab);
909 return bounded;
912 /* Is the image bounded for each value of the parameters and
919 int bounded; local
925 bounded = isl_basic_set_is_bounded((isl_basic_set *)bmap);
928 return bounded;
931 /* Is the set bounded fo
941 int bounded = isl_basic_set_is_bounded(set->p[i]); local
[all...] |
| H A D | isl_test.c | 251 int bounded; local
254 bounded = isl_set_is_bounded(set);
255 assert(bounded);
259 bounded = isl_set_is_bounded(set);
260 assert(!bounded);
264 bounded = isl_set_is_bounded(set);
265 assert(!bounded);
1184 int bounded; local
1186 bounded = isl_options_get_coalesce_bounded_wrapping(ctx);
1208 isl_options_set_coalesce_bounded_wrapping(ctx, bounded);
[all...] |
| H A D | isl_map.c | 9762 int bounded; local
9763 bounded = isl_basic_map_dim_is_bounded(map->p[i], type, pos);
9764 if (bounded < 0 || !bounded)
9765 return bounded;
9793 int bounded; local
9794 bounded = fn(map->p[i], type, pos);
9795 if (bounded < 0 || bounded)
9796 return bounded;
9833 int bounded; local
[all...] |
| H A D | isl_polynomial.c | 4562 int bounded; local
4575 bounded = isl_basic_set_is_bounded(bset);
4576 if (bounded < 0)
4578 if (!bounded)
|
| /haiku-buildtools/isl/doc/ |
| H A D | implementation.tex | 321 If the original problem has a bounded optimum, then the final sample
655 A restriction of the algorithm is that it only works on bounded sets.
|
Completed in 78 milliseconds