HomeSort by: relevance | last modified time | path
    Searched refs:rational (Results 1 - 20 of 20) sorted by relevancy

  /src/external/mit/isl/dist/
isl_output_private.h 26 __isl_take isl_printer *p, int rational,
isl_aff_map.c 60 * If "rational" is set, then construct a rational basic map.
65 __isl_take isl_aff *aff, int rational)
96 if (rational)
129 * If "rational" is set, then construct a rational basic map.
132 __isl_take isl_multi_aff *maff, int rational)
149 if (rational)
157 bmap_i = isl_basic_map_from_aff2(aff, rational);
358 * If the domain of "pma" is rational, then so is the constructed "map"
372 isl_bool rational; local
    [all...]
isl_input.c 721 struct vars *v, __isl_take isl_map *map, int rational);
723 __isl_take isl_space *space, struct vars *v, int rational);
728 __isl_take isl_map *cond, struct vars *v, int rational)
740 pwaff1 = accept_extended_affine(s, space, v, rational);
748 pwaff2 = accept_extended_affine(s, space, v, rational);
821 __isl_take isl_space *space, struct vars *v, int rational)
830 if (rational)
845 cond = read_formula(s, v, cond, rational);
847 return accept_ternary(s, cond, v, rational);
852 int rational)
1709 isl_bool rational; local
2798 int rational; local
    [all...]
isl_multi_read_no_explicit_domain_templ.c 20 struct vars *v, __isl_take isl_space *space, int rational, void *user)
pip.c 36 * Rational compute rational optimum instead of integer optimum
347 int rational = 0; local
367 if (strncasecmp(s, "Rational", 8) == 0) {
368 rational = 1;
407 assert(!rational);
isl_tab.c 81 tab->rational = 0;
289 dup->rational = tab->rational;
445 isl_assert(tab1->mat->ctx, tab1->rational == tab2->rational, return NULL);
542 prod->rational = tab1->rational;
980 /* Mark "tab" as a rational tableau.
981 * If it wasn't marked as a rational tableau already and if we may
989 if (!tab->rational && tab->need_undo
    [all...]
isl_tab.h 177 unsigned rational : 1; member in struct:isl_tab
isl_output.c 463 __isl_take isl_printer *p, int rational,
466 if (rational && !data->latex)
783 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); local
840 strict = !rational && isl_int_is_negone(bmap->ineq[i][0]);
1111 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); local
1115 p = isl_print_space(bmap->dim, p, rational, &data);
1465 int rational; local
1471 rational = split[i].map->n > 0 &&
1476 p = isl_print_space(space, p, rational, &data);
1488 int rational; local
    [all...]
isl_ast_build_expr.c 1119 * "rat" collects the rational part.
2222 /* Is "aff" a rational expression, i.e., does it have a denominator
2227 isl_bool rational; local
2231 rational = isl_bool_not(isl_val_is_one(den));
2234 return rational;
2237 /* Does "list" consist of a single rational affine expression?
2242 isl_bool rational; local
2251 rational = aff_is_rational(aff);
2254 return rational;
2271 * Rational affine expressions are not considered for min/max expression
    [all...]
isl_map.c 1141 /* Has "map" been marked as a rational map?
1143 * An empty map is not considered to be rational.
1144 * Maps where only some of the basic maps are marked rational
1150 isl_bool rational; local
1156 rational = isl_basic_map_is_rational(map->p[0]);
1157 if (rational < 0)
1158 return rational;
1165 if (rational != rational_i)
1167 "mixed rational and integer basic maps "
1171 return rational;
4105 isl_bool rational, is_empty; local
10903 isl_bool rational; local
13850 isl_bool rational; local
    [all...]
isl_aff.c 174 /* Return a copy of the rational affine expression of "aff".
183 /* Return the rational affine expression of "aff".
205 /* Set the rational affine expression of "aff" to "v",
206 * where the rational affine expression of "aff" may be missing
340 "expecting rational value or NaN", goto error);
931 "expecting rational value", goto error);
995 * in case "aff" is a rational expression.
1076 "expecting rational value or NaN", goto error);
1269 "expecting rational value", goto error);
1376 "expecting rational value", goto error)
2990 isl_bool rational; local
    [all...]
isl_map_private.h 402 __isl_take isl_multi_aff *maff, int rational);
isl_tab_pip.c 165 * If "rational" is set, then a rational optimization is being performed.
184 int rational; member in struct:isl_sol
841 bmap = isl_basic_map_from_multi_aff2(ma, sol->sol.rational);
2343 tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
2901 * context. Any rational point in "shifted" can therefore be rounded
2940 * that any rational point in the shifted tableau can
3708 sol->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL);
4066 * found a (rational) feasible point. If we only wanted a rational poin
    [all...]
isl_vertices.c 1193 tab->rational = ISL_F_ISSET(bset, ISL_BASIC_SET_RATIONAL);
  /src/distrib/mac68k/miniroot/
install.md 134 simple and rational way. You'll be asked several questions, and it would
  /src/external/gpl2/gettext/dist/gettext-tools/src/
x-librep.c 215 bool rational = false; local
340 rational = true;
352 if (exact && radix == 10 && !rational)
358 if (exact && !rational)
359 rational = true;
366 if (!rational && !exponent)
  /src/distrib/hp300/miniroot/
install.md 482 simple and rational way. You'll be asked several questions, and it would
  /src/external/mit/isl/dist/doc/
implementation.tex 109 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.
650 that it is beneficial to add cuts for \emph{all} rational coordinates
664 and if (rationally) non-empty, any rational point
1112 rational relaxation of $\Delta_i(\vec s)$, i.e.,
1116 generate the rational con
    [all...]
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 5642 # rational function U/V where #
5648 # a rational function U/V where #
6277 #--ATAN(X) DIRECTLY WILL NEED TO USE A RATIONAL APPROXIMATION
fpsp.s 5748 # rational function U/V where #
5754 # a rational function U/V where #
6383 #--ATAN(X) DIRECTLY WILL NEED TO USE A RATIONAL APPROXIMATION

Completed in 81 milliseconds