124 	isl_bool tight;  in add_fold()  local
128 	tight = isl_bool_false;  in add_fold()
130 		tight = is_tight(k, n, d, data->cell);  in add_fold()
131 	if (tight < 0)  in add_fold()
133 	if (tight)  in add_fold()
359 	isl_bool *tight)  in bernstein_coefficients_base()  argument
376 		if (tight)  in bernstein_coefficients_base()
377 			*tight = isl_bool_true;  in bernstein_coefficients_base()
388 		if (tight)  in bernstein_coefficients_base()
389 			*tight = isl_bool_true;  in bernstein_coefficients_base()
415 	if (tight)  in bernstein_coefficients_base()
416 		*tight = covers;  in bernstein_coefficients_base()
437 	int n_group, int *len, struct bernstein_data *data, isl_bool *tight)  in bernstein_coefficients_recursive()  argument
451 	pwf = isl_pw_qpolynomial_bound(pwqp, data->type, tight);  in bernstein_coefficients_recursive()
459 		if (tight && !*tight)  in bernstein_coefficients_recursive()
460 			tight = NULL;  in bernstein_coefficients_recursive()
461 		pwf = isl_pw_qpolynomial_fold_bound(pwf, tight);  in bernstein_coefficients_recursive()
473 	isl_bool *tight)  in bernstein_coefficients_factors()  argument
485 		return  bernstein_coefficients_base(bset, poly, data, tight);  in bernstein_coefficients_factors()
493 						tight);  in bernstein_coefficients_factors()
507 	isl_bool *tight)  in bernstein_coefficients_full_recursive()  argument
530 	pwf = bernstein_coefficients_recursive(pwqp, nvar, len, data, tight);  in bernstein_coefficients_full_recursive()
559 	isl_bool tight = isl_bool_false;  in isl_qpolynomial_bound_on_domain_bernstein()  local
560 	isl_bool *tp = bound->check_tight ? &tight : NULL;  in isl_qpolynomial_bound_on_domain_bernstein()
577 	if (tight)  in isl_qpolynomial_bound_on_domain_bernstein()