Lines Matching defs:tight
98 /* Check whether the bound associated to the selection "k" is tight,
105 * the bound is necessarily tight.
131 isl_bool tight;
135 tight = isl_bool_false;
137 tight = is_tight(k, n, d, data->cell);
138 if (tight < 0)
140 if (tight)
371 isl_bool *tight)
383 return isl_qpolynomial_cst_bound(bset, poly, data->type, tight);
389 return isl_qpolynomial_cst_bound(bset, poly, data->type, tight);
413 if (tight)
414 *tight = covers;
435 int n_group, int *len, struct bernstein_data *data, isl_bool *tight)
449 pwf = isl_pw_qpolynomial_bound(pwqp, data->type, tight);
457 if (tight && !*tight)
458 tight = NULL;
459 pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);
471 isl_bool *tight)
483 return bernstein_coefficients_base(bset, poly, data, tight);
491 tight);
505 isl_bool *tight)
528 pwf = bernstein_coefficients_recursive(pwqp, nvar, len, data, tight);
557 isl_bool tight = isl_bool_false;
558 isl_bool *tp = bound->check_tight ? &tight : NULL;
575 if (tight)