Lines Matching refs:assumptions
134 NITER->assumptions to make sure this is the case). */
187 assumptions for divisibility of c. */
192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
193 niter->assumptions, assumption);
205 of the step. The assumptions necessary to ensure that the computation
266 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
267 niter->assumptions,
339 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
340 niter->assumptions, assumption);
398 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
399 niter->assumptions, assumption);
469 /* number_of_iterations_lt_to_ne will add assumptions that ensure that
496 earlier, and possibly set NITER->assumptions to make sure this
522 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
523 niter->assumptions, assumption);
547 The results (number of iterations and assumptions as described in
550 was determined (possibly with some assumptions). */
559 /* The meaning of these assumptions is this:
560 if !assumptions
564 niter->assumptions = boolean_true_node;
603 ensure that using the no-overflow assumptions is correct in this
1042 potentially unsafe assumptions. */
1057 niter->assumptions = boolean_false_node;
1109 niter->assumptions = simplify_using_outer_evolutions (loop,
1110 niter->assumptions);
1117 niter->assumptions
1119 niter->assumptions,
1128 if (integer_onep (niter->assumptions))
1134 if (integer_zerop (niter->assumptions))
1138 niter->assumptions = boolean_true_node;