153       c = fold_build2 (MINUS_EXPR, niter_type,  in number_of_iterations_ne()
160       c = fold_build2 (MINUS_EXPR, niter_type,  in number_of_iterations_ne()
188       assumption = fold_build2 (FLOOR_MOD_EXPR, niter_type, c, d);  in number_of_iterations_ne()
189       assumption = fold_build2 (EQ_EXPR, boolean_type_node,  in number_of_iterations_ne()
192 	niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,  in number_of_iterations_ne()
196   c = fold_build2 (EXACT_DIV_EXPR, niter_type, c, d);  in number_of_iterations_ne()
197   tmp = fold_build2 (MULT_EXPR, niter_type, c, inverse (s, bound));  in number_of_iterations_ne()
198   niter->niter = fold_build2 (BIT_AND_EXPR, niter_type, tmp, bound);  in number_of_iterations_ne()
216   tree mod = fold_build2 (FLOOR_MOD_EXPR, niter_type, *delta, step);  in number_of_iterations_lt_to_ne()
223     mod = fold_build2 (MINUS_EXPR, niter_type, step, mod);  in number_of_iterations_lt_to_ne()
233 	  bound = fold_build2 (MINUS_EXPR, type,  in number_of_iterations_lt_to_ne()
235 	  assumption = fold_build2 (LE_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
240       noloop = fold_build2 (GT_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
242 			    fold_build2 (PLUS_EXPR, type,  in number_of_iterations_lt_to_ne()
252 	  bound = fold_build2 (PLUS_EXPR, type,  in number_of_iterations_lt_to_ne()
254 	  assumption = fold_build2 (GE_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
259       noloop = fold_build2 (GT_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
260 			    fold_build2 (MINUS_EXPR, type,  in number_of_iterations_lt_to_ne()
266     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
270     niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,  in number_of_iterations_lt_to_ne()
273   *delta = fold_build2 (PLUS_EXPR, niter_type, *delta, mod);  in number_of_iterations_lt_to_ne()
301 	  d = fold_build2 (MINUS_EXPR, niter_type,  in assert_no_overflow_lt()
304 	  diff = fold_build2 (FLOOR_MOD_EXPR, niter_type, d, step);  in assert_no_overflow_lt()
307 	diff = fold_build2 (MINUS_EXPR, niter_type, step,  in assert_no_overflow_lt()
309       bound = fold_build2 (MINUS_EXPR, type,  in assert_no_overflow_lt()
311       assumption = fold_build2 (LE_EXPR, boolean_type_node,  in assert_no_overflow_lt()
322 	  d = fold_build2 (MINUS_EXPR, niter_type,  in assert_no_overflow_lt()
325 	  diff = fold_build2 (FLOOR_MOD_EXPR, niter_type, d, step);  in assert_no_overflow_lt()
328 	diff = fold_build2 (MINUS_EXPR, niter_type, step,  in assert_no_overflow_lt()
330       bound = fold_build2 (PLUS_EXPR, type,  in assert_no_overflow_lt()
332       assumption = fold_build2 (GE_EXPR, boolean_type_node,  in assert_no_overflow_lt()
339     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,  in assert_no_overflow_lt()
359       diff = fold_build2 (MINUS_EXPR, type,  in assert_loop_rolls_lt()
367 	  bound = fold_build2 (PLUS_EXPR, type,  in assert_loop_rolls_lt()
369 	  assumption = fold_build2 (GE_EXPR, boolean_type_node,  in assert_loop_rolls_lt()
375       mbzl = fold_build2 (MINUS_EXPR, type, iv0->base, diff);  in assert_loop_rolls_lt()
380       diff = fold_build2 (PLUS_EXPR, type,  in assert_loop_rolls_lt()
385 	  bound = fold_build2 (PLUS_EXPR, type,  in assert_loop_rolls_lt()
387 	  assumption = fold_build2 (LE_EXPR, boolean_type_node,  in assert_loop_rolls_lt()
392       mbzr = fold_build2 (MINUS_EXPR, type, iv1->base, diff);  in assert_loop_rolls_lt()
395   mbz = fold_build2 (GT_EXPR, boolean_type_node, mbzl, mbzr);  in assert_loop_rolls_lt()
398     niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,  in assert_loop_rolls_lt()
401     niter->may_be_zero = fold_build2 (TRUTH_OR_EXPR, boolean_type_node,  in assert_loop_rolls_lt()
430   delta = fold_build2 (MINUS_EXPR, niter_type,  in number_of_iterations_lt()
448       niter->may_be_zero = fold_build2 (LT_EXPR, boolean_type_node,  in number_of_iterations_lt()
485   s = fold_build2 (MINUS_EXPR, niter_type,  in number_of_iterations_lt()
487   delta = fold_build2 (PLUS_EXPR, niter_type, delta, s);  in number_of_iterations_lt()
488   niter->niter = fold_build2 (FLOOR_DIV_EXPR, niter_type, delta, step);  in number_of_iterations_lt()
513 	assumption = fold_build2 (NE_EXPR, boolean_type_node,  in number_of_iterations_le()
516 	assumption = fold_build2 (NE_EXPR, boolean_type_node,  in number_of_iterations_le()
522 	niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node,  in number_of_iterations_le()
527     iv1->base = fold_build2 (PLUS_EXPR, type,  in number_of_iterations_le()
530     iv0->base = fold_build2 (MINUS_EXPR, type,  in number_of_iterations_le()
650   if (zero_p (fold_build2 (code, boolean_type_node, iv0->base, iv1->base)))  in number_of_iterations_cond()
814 	    expr = fold_build2 (code, boolean_type_node, e0, e1);  in tree_simplify_using_condition_1()
938 	*conds_used = fold_build2 (TRUTH_AND_EXPR,  in simplify_using_initial_conditions()
992 	    expr = fold_build2 (code, boolean_type_node, e0, e1);  in simplify_using_outer_evolutions()
1521   compare = fold_build2 (GE_EXPR,  in implies_nonnegative_p()
1533   tree compare = fold_build2 (GE_EXPR, boolean_type_node, a, b);  in implies_ge_p()
1807 			  diff = fold_build2 (MINUS_EXPR, type, init,  in infer_loop_bounds_from_undefined()
1810 			  diff = fold_build2 (MINUS_EXPR, type,  in infer_loop_bounds_from_undefined()
1814 			estimation = fold_build2 (CEIL_DIV_EXPR, type, diff,  in infer_loop_bounds_from_undefined()
2051       delta = fold_build2 (MINUS_EXPR, unsigned_type, base, extreme);  in scev_probably_wraps_p()
2059       delta = fold_build2 (MINUS_EXPR, unsigned_type, extreme, base);  in scev_probably_wraps_p()
2063   valid_niter = fold_build2 (FLOOR_DIV_EXPR, unsigned_type, delta, step_abs);  in scev_probably_wraps_p()