| /haiku-buildtools/isl/ |
| H A D | isl_bound.c | 206 __isl_take isl_pw_qpolynomial_fold *pwf, int *tight)
226 if (tight)
227 *tight = 1;
234 if (tight)
235 *tight = 1;
243 bound.check_tight = !!tight;
253 if (tight)
254 *tight = covers;
276 __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight)
281 return isl_pw_qpolynomial_fold_bound(pwf, tight);
205 isl_pw_qpolynomial_fold_bound( __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) argument
275 isl_pw_qpolynomial_bound( __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight) argument
286 int tight; member in struct:isl_union_bound_data
303 isl_union_pw_qpolynomial_bound( __isl_take isl_union_pw_qpolynomial *upwqp, enum isl_fold type, int *tight) argument
[all...] |
| H A D | isl_bernstein.c | 91 /* Check whether the bound associated to the selection "k" is tight,
335 __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight)
350 if (tight)
351 *tight = 1;
362 if (tight)
363 *tight = 1;
387 if (tight)
388 *tight = covers;
409 int n_group, int *len, struct bernstein_data *data, int *tight)
424 pwf = isl_pw_qpolynomial_bound(pwqp, data->type, tight);
333 bernstein_coefficients_base( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) argument
407 bernstein_coefficients_recursive( __isl_take isl_pw_qpolynomial *pwqp, int n_group, int *len, struct bernstein_data *data, int *tight) argument
438 bernstein_coefficients_factors( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) argument
471 bernstein_coefficients_full_recursive( __isl_take isl_basic_set *bset, __isl_take isl_qpolynomial *poly, struct bernstein_data *data, int *tight) argument
525 int tight = 0; local
[all...] |
| H A D | isl_range.c | 14 int tight; member in struct:range_data
60 data_m.tight = 0;
250 * depending on whether the result has been determined to be tight.
266 if (data->tight)
280 * If the current polynomial is tight and if this bound is integer,
281 * then the result is still tight. In all other cases, the results
282 * may not be tight.
295 int save_tight = data->tight;
306 if (data->tight)
307 data->tight
[all...] |
| H A D | isl_fold.c | 1433 int *tight)
1463 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
1474 int *tight)
1476 return isl_map_apply_pw_qpolynomial_fold(set, pwf, tight);
1483 int tight; member in struct:isl_apply_fold_data
1502 pwf, data->tight ? &data->tight : NULL);
1526 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight)
1538 data.tight = tight
1431 isl_map_apply_pw_qpolynomial_fold( __isl_take isl_map *map, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) argument
1472 isl_set_apply_pw_qpolynomial_fold( __isl_take isl_set *set, __isl_take isl_pw_qpolynomial_fold *pwf, int *tight) argument
1524 isl_union_map_apply_union_pw_qpolynomial_fold( __isl_take isl_union_map *umap, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight) argument
1559 isl_union_set_apply_union_pw_qpolynomial_fold( __isl_take isl_union_set *uset, __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight) argument
[all...] |
| /haiku-buildtools/isl/include/isl/ |
| H A D | polynomial.h | 438 __isl_take isl_pw_qpolynomial *pwqp, enum isl_fold type, int *tight);
440 __isl_take isl_pw_qpolynomial_fold *pwf, int *tight);
443 int *tight);
446 int *tight);
599 enum isl_fold type, int *tight);
602 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight);
605 __isl_take isl_union_pw_qpolynomial_fold *upwf, int *tight);
|
| /haiku-buildtools/gcc/gmp/mpn/x86/k6/ |
| H A D | mod_34lsub1.asm | 42 C Perhaps a tight loop like this needs short decode instructions at the
|
| /haiku-buildtools/gcc/gmp/mpn/x86/k7/ |
| H A D | mul_basecase.asm | 502 C Extra fetch of VAR_JMP is bad, but registers are tight
|
| /haiku-buildtools/gcc/libgcc/config/sh/ |
| H A D | crt1.S | 468 ! the following tight loop. This avoids executing any data that might follow.
1150 ! the following tight loop
|