Home
last modified time | relevance | path

Searched refs:rational (Results 1 – 25 of 39) sorted by relevance

12

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_input.c844 if (rational) in accept_extended_affine()
866 int rational) in read_var_def() argument
1265 if (rational) in update_piecewise_affine_colon()
1625 int rational) in map_from_tuple() argument
1661 if (rational) in map_from_tuple()
1669 if (rational) in map_from_tuple()
1687 if (rational) in map_from_tuple()
1800 int rational) in construct_constraints() argument
1806 if (rational) { in construct_constraints()
2670 int rational; in obj_read_body() local
[all …]
H A Disl_aff_map.c65 __isl_take isl_aff *aff, int rational) in isl_basic_map_from_aff2() argument
96 if (rational) in isl_basic_map_from_aff2()
132 __isl_take isl_multi_aff *maff, int rational) in isl_basic_map_from_multi_aff2() argument
149 if (rational) in isl_basic_map_from_multi_aff2()
157 bmap_i = isl_basic_map_from_aff2(aff, rational); in isl_basic_map_from_multi_aff2()
372 isl_bool rational; in isl_map_from_pw_multi_aff_internal() local
377 rational = isl_set_is_rational(pma->p[i].set); in isl_map_from_pw_multi_aff_internal()
378 if (rational < 0) in isl_map_from_pw_multi_aff_internal()
381 bmap = isl_basic_map_from_multi_aff2(maff, rational); in isl_map_from_pw_multi_aff_internal()
H A Disl_output_private.h26 __isl_take isl_printer *p, int rational,
H A Dpip.c348 int rational = 0; in main() local
369 rational = 1; in main()
408 assert(!rational); in main()
H A Disl_tab.c81 tab->rational = 0; in isl_tab_alloc()
289 dup->rational = tab->rational; in isl_tab_dup()
445 isl_assert(tab1->mat->ctx, tab1->rational == tab2->rational, return NULL); in isl_tab_product()
542 prod->rational = tab1->rational; in isl_tab_product()
992 tab->rational = 1; in isl_tab_mark_rational()
1603 if (tab->rational) in tab_is_manifestly_empty()
3642 if (tab->rational) in isl_tab_is_constant()
3660 if (tab->rational) in isl_tab_detect_constants()
3972 tab->rational = 0; in perform_undo()
4056 if (tab->rational) in separation_type()
[all …]
H A Disl_multi_read_no_explicit_domain_templ.c20 struct vars *v, __isl_take isl_space *space, int rational, void *user) in FN()
H A Disl_output.c463 __isl_take isl_printer *p, int rational, in isl_print_space() argument
466 if (rational && !data->latex) in isl_print_space()
783 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); in print_constraints() local
1111 int rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); in isl_basic_map_print_isl() local
1115 p = isl_print_space(bmap->dim, p, rational, &data); in isl_basic_map_print_isl()
1441 int rational; in print_split_map() local
1447 rational = split[i].map->n > 0 && in print_split_map()
1452 p = isl_print_space(space, p, rational, &data); in print_split_map()
1464 int rational; in isl_map_print_isl_body() local
1473 rational = map->n > 0 && in isl_map_print_isl_body()
[all …]
H A Disl_ast_build_expr.c2066 isl_bool rational; in aff_is_rational() local
2070 rational = isl_bool_not(isl_val_is_one(den)); in aff_is_rational()
2073 return rational; in aff_is_rational()
2081 isl_bool rational; in is_single_rational_aff() local
2090 rational = aff_is_rational(aff); in is_single_rational_aff()
2093 return rational; in is_single_rational_aff()
H A Disl_tab.h176 unsigned rational : 1; member
H A Disl_map.c1151 isl_bool rational; in isl_map_is_rational() local
1158 if (rational < 0) in isl_map_is_rational()
1159 return rational; in isl_map_is_rational()
1172 return rational; in isl_map_is_rational()
4113 if (rational < 0) in isl_basic_map_insert_dims()
4115 if (rational) in isl_basic_map_insert_dims()
10798 isl_bool rational; in isl_basic_map_range_product() local
10806 if (rational >= 0 && rational) in isl_basic_map_range_product()
10839 if (rational) in isl_basic_map_range_product()
13785 isl_bool rational; in isl_basic_map_preimage_multi_aff() local
[all …]
H A Disl_aff.c2281 int rational, void *user) in aff_pos_basic_set() argument
2294 if (rational) in aff_pos_basic_set()
2318 __isl_take isl_aff *aff, int rational, void *user) in aff_nonneg_basic_set() argument
2334 if (rational) in aff_nonneg_basic_set()
2373 int rational, void *user) in aff_zero_basic_set() argument
2389 if (rational) in aff_zero_basic_set()
2901 isl_bool rational; in pw_aff_locus() local
2906 rational = isl_set_has_rational(pwaff->p[i].set); in pw_aff_locus()
2907 bset = fn(isl_aff_copy(pwaff->p[i].aff), rational, user); in pw_aff_locus()
2977 int rational, void *user) in aff_bind_id() argument
[all …]
H A Disl_tab_pip.c184 int rational; member
815 bmap = isl_basic_map_from_multi_aff2(ma, sol->sol.rational); in sol_map_add()
2317 tab->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); in tab_for_lexmin()
3682 sol->rational = ISL_F_ISSET(bmap, ISL_BASIC_MAP_RATIONAL); in sol_init()
4154 if (tab->rational) in find_solutions()
/llvm-project-15.0.7/libclc/generic/lib/math/
H A Dasin.cl36 // where R(x^2) is a rational minimax approximation to
40 // together with the above rational approximation, and
61 // Use a rational approximation for [0.0, 0.5]
102 // where R(x^2) is a rational minimax approximation to
106 // together with the above rational approximation, and
124 // Use a rational approximation for [0.0, 0.5]
H A Dasinpi.cl36 // where R(x^2) is a rational minimax approximation to
40 // together with the above rational approximation, and
64 // Use a rational approximation for [0.0, 0.5]
105 // where R(x^2) is a rational minimax approximation to
109 // together with the above rational approximation, and
127 // Use a rational approximation for [0.0, 0.5]
H A Dacos.cl36 // where R(x^2) is a rational minimax approximation to
40 // together with the above rational approximation, and
63 // Use a rational approximation for [0.0, 0.5]
105 // where R(x^2) is a rational minimax approximation to
109 // together with the above rational approximation, and
128 // Use a rational approximation for [0.0, 0.5]
H A Dacospi.cl37 // where R(x^2) is a rational minimax approximation to
41 // together with the above rational approximation, and
64 // Use a rational approximation for [0.0, 0.5]
105 // where R(x^2) is a rational minimax approximation to
109 // together with the above rational approximation, and
129 // Use a rational approximation for [0.0, 0.5]
H A Derf.cl228 * That is, we use rational approximation to approximate
263 * We use rational approximation to approximate
353 // Evaluate rational poly
377 // Compute rational approximation
H A Derfc.cl229 * That is, we use rational approximation to approximate
264 * We use rational approximation to approximate
356 // Evaluate rational poly
/llvm-project-15.0.7/polly/lib/External/isl/imath/
H A DREADME.md4 Arbitrary precision integer and rational arithmetic library.
6 IMath is an open-source ANSI C arbitrary precision integer and rational
34 arithmetic on integers and rational numbers of arbitrary precision. While many
104 The IMath API also supports operations on arbitrary precision rational numbers.
105 The functions for creating and manipulating rational values (type `mpq_t`) are
H A Ddoc.md.in27 to use rational arithmetic, you will also need to include "imrat.h".
32 precision signed integer, and `mpq_t`, an arbitrary precision signed rational
305 with the convention that the sign of the numerator is the sign of the rational
306 value, and that the result of any rational operation is always represented in
307 lowest terms. The canonical representation for rational zero is 0/1. See
H A DChangeLog128 Added imrat.h and imrat.c, containing routines for rational number
153 Added mixed rational/integer operations:
155 Added rational exponentiation (with integer exponents):
203 Changed the API for rational rounding. Removed the two functions
/llvm-project-15.0.7/polly/lib/External/isl/imath/tests/
H A Dqmisc.tc1 ## Miscellaneous rational arithmetic tests
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/
H A Dseparate2.in1 # Check that rational affine expressions are printer properly.
/llvm-project-15.0.7/polly/lib/External/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.
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 cone
H A Disl.bib192 title = {{Short rational generating functions for lattice point

12