Searched refs:n_unbounded (Results 1 - 6 of 6) sorted by relevance

/haiku-buildtools/isl/
H A Disl_sample.c335 tab->n_unbounded = 0;
385 * Return 1 if we have found an integer point (if tab->n_unbounded > 0
422 if (++level >= tab->n_var - tab->n_unbounded)
461 * unbounded directions last and with tab->n_unbounded set
475 * negative values in the last n_unbounded entries of "a T".
481 * by a basis reduction, but the last n_unbounded rows of B remain
536 if (tab->n_unbounded == tab->n_var) {
623 if (level + tab->n_unbounded < dim - 1) {
635 if (tab->n_unbounded && !isl_int_is_one(sample->el[0])) {
1121 * For any rational value of the last tab->n_unbounded coordinate
[all...]
H A Disl_tab.h165 int n_unbounded; member in struct:isl_tab
H A Dbasis_reduction_templ.c34 * The final tab->n_unbounded rows of the basis are assumed to correspond
89 n_bounded = dim - tab->n_unbounded;
H A Disl_affine_hull.c261 * that tab->basis and tab->n_unbounded have been set appropriately.
434 * that tab->basis and tab->n_unbounded have been set appropriately.
777 dim = isl_basic_set_n_dim(bset) - tab->n_unbounded;
841 if (tab->n_unbounded == 0)
858 if (tab->n_unbounded == 0) {
H A Disl_tab.c83 tab->n_unbounded = 0;
302 dup->n_unbounded = tab->n_unbounded;
555 prod->n_unbounded = 0;
H A Disl_tab_pip.c2777 cgbr->tab->n_unbounded = 0;

Completed in 54 milliseconds