Searched refs:unbounded (Results 1 - 4 of 4) sorted by relevance

/haiku-buildtools/isl/
H A Dbasis_reduction_templ.c35 * to unbounded directions and are also left untouched.
53 int unbounded; local
135 unbounded = GBR_lp_solve(lp);
136 isl_assert(ctx, !unbounded, goto error);
153 unbounded = GBR_lp_solve(lp);
154 isl_assert(ctx, !unbounded, goto error);
168 unbounded = GBR_lp_solve(lp);
169 isl_assert(ctx, !unbounded, goto error);
198 unbounded = GBR_lp_solve(lp);
199 isl_assert(ctx, !unbounded, got
[all...]
H A Disl_coalesce.c640 * identical to "bound", then this means that "set" is unbounded in such
668 goto unbounded;
670 goto unbounded;
685 goto unbounded;
687 goto unbounded;
694 goto unbounded;
696 goto unbounded;
702 unbounded:
809 goto unbounded;
829 goto unbounded;
[all...]
/haiku-buildtools/gcc/gcc/cp/
H A Dtypeck2.c1233 bool unbounded = false;
1249 unbounded = true; /* Take as many as there are. */
1256 if (!unbounded && vec_safe_length (v) > len)
1287 /* No more initializers. If the array is unbounded, we are done. Otherwise,
1289 if (!unbounded)
1229 bool unbounded = false; local
/haiku-buildtools/isl/doc/
H A Dimplementation.tex151 If any LP problem is unbounded, then the corresponding constraint
327 When the optimum is unbounded, the optimal value computed for
336 $\fract {\alpha M } = 0$. It should be noted, though, that an unbounded
363 produce an error if the problem turns out to be unbounded.

Completed in 57 milliseconds