Searched refs:rational (Results 1 - 12 of 12) sorted by relevance

/haiku-buildtools/isl/
H A Disl_input.c664 struct vars *v, __isl_take isl_map *map, int rational);
666 __isl_take isl_space *dim, struct vars *v, int rational);
671 __isl_take isl_map *cond, struct vars *v, int rational)
683 pwaff1 = accept_extended_affine(s, dim, v, rational);
691 pwaff2 = accept_extended_affine(s, dim, v, rational);
711 __isl_take isl_space *dim, struct vars *v, int rational)
728 if (rational)
753 cond = read_formula(s, v, cond, rational);
755 return accept_ternary(s, cond, v, rational);
760 int rational)
670 accept_ternary(struct isl_stream *s, __isl_take isl_map *cond, struct vars *v, int rational) argument
710 accept_extended_affine(struct isl_stream *s, __isl_take isl_space *dim, struct vars *v, int rational) argument
758 read_var_def(struct isl_stream *s, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational) argument
826 read_defined_var_list(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1010 read_tuple_var_def(struct isl_stream *s, __isl_take isl_multi_pw_aff *tuple, int pos, struct vars *v, int rational) argument
1031 read_tuple_var_list(struct isl_stream *s, struct vars *v, int rational, int comma) argument
1096 read_tuple(struct isl_stream *s, struct vars *v, int rational, int comma) argument
1148 read_map_tuple(struct isl_stream *s, __isl_take isl_map *map, enum isl_dim_type type, struct vars *v, int rational, int comma) argument
1230 construct_constraints( __isl_take isl_set *set, int type, __isl_keep isl_pw_aff_list *left, __isl_keep isl_pw_aff_list *right, int rational) argument
1259 add_constraint(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1308 read_exists(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1348 resolve_paren_expr(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1420 read_conjunct(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1456 read_conjuncts(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1482 read_disjuncts(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1526 read_formula(struct isl_stream *s, struct vars *v, __isl_take isl_map *map, int rational) argument
1969 read_optional_formula(struct isl_stream *s, __isl_take isl_map *map, struct vars *v, int rational) argument
2076 int rational; local
[all...]
H A Dpip.c36 * Rational compute rational optimum instead of integer optimum
290 int rational = 0; local
312 rational = 1;
356 assert(!rational);
H A Disl_tab.c73 tab->rational = 0;
290 dup->rational = tab->rational;
446 isl_assert(tab1->mat->ctx, tab1->rational == tab2->rational, return NULL);
543 prod->rational = tab1->rational;
1576 if (tab->rational)
2230 tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
2280 tab->rational
[all...]
H A Disl_tab.h174 unsigned rational : 1; member in struct:isl_tab
H A Disl_output.c430 __isl_take isl_printer *p, int latex, int rational,
433 if (rational && !latex)
639 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); local
645 p = print_space(bmap->dim, p, latex, rational, NULL, NULL);
833 int rational; local
841 rational = split[i].map->n > 0 &&
845 p = print_space(dim, p, 0, rational, split[i].aff, NULL);
856 int rational; local
863 rational = map->n > 0 &&
865 p = print_space(map->dim, p, 0, rational, NUL
429 print_space(__isl_keep isl_space *dim, __isl_take isl_printer *p, int latex, int rational, __isl_keep isl_basic_map *eq, __isl_keep isl_multi_aff *maff) argument
[all...]
H A Disl_aff.c540 "expecting rational value", goto error);
610 "expecting rational value", goto error);
793 "expecting rational value", goto error);
889 "expecting rational value", goto error);
1591 "expecting rational factor", goto error);
1649 "expecting rational factor", goto error);
1835 * If "rational" is set, then return a rational basic set.
1838 __isl_take isl_aff *aff, int rational)
1846 if (rational)
1837 aff_nonneg_basic_set( __isl_take isl_aff *aff, int rational) argument
1874 aff_zero_basic_set(__isl_take isl_aff *aff, int rational) argument
2351 int rational; local
2384 int rational; local
[all...]
H A Disl_tab_pip.c162 int rational; member in struct:isl_sol
628 if (sol->sol.rational)
2084 tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
2622 * context. Any rational point in "shifted" can therefore be rounded
2661 * that any rational point in the shifted tableau can
3394 sol_map->sol.rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
3711 * found a (rational) feasible point. If we only wanted a rational point
3743 * If, on the other hand, one or more of the other columns have rational
3748 * If at least one other column has a rational coefficien
[all...]
H A Disl_vertices.c1131 tab->rational = ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL);
H A Disl_map.c701 /* Does "bmap" contain any rational points?
704 * to an integer constant, then it has no rational points, even if it
705 * is marked as rational.
745 /* Does "map" contain any rational points?
764 /* Does "set" contain any rational points?
1717 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1750 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
1760 * If the set is rational, the dimensions are eliminated using Fourier-Motzkin.
11476 * Handling rational expressions may require us to add stride constraints
11771 * If bmap is not a rational ma
11795 int rational, strides; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/
H A Dpowser1.go10 // A power series is a channel, along which flow rational
201 // Integer gcd; needed for rational arithmetic
209 // Make a rational from two ints and from one int
H A Dpowser2.go14 // A power series is a channel, along which flow rational
211 // Integer gcd; needed for rational arithmetic
219 // Make a rational from two ints and from one int
/haiku-buildtools/isl/doc/
H A Dimplementation.tex109 For rational sets, the obvious choice would be to compute the
110 (rational) convex hull. For integer sets, the obvious choice
170 This method is not based on Feautrier's algorithm, but on rational
204 During this process, some coefficients may become rational.
271 non-integral coordinates. If so, some rational solutions
375 i.e., problems with rational solutions, but no integer solutions.
638 that it is beneficial to add cuts for \emph{all} rational coordinates
652 and if (rationally) non-empty, any rational point
1099 rational relaxation of $\Delta_i(\vec s)$, i.e.,
1103 generate the rational con
[all...]

Completed in 569 milliseconds