contrib/gcc/tree-ssa-loop-ivopts.c

3035   tree ubase = use->iv->base;
3039   tree utype = TREE_TYPE (ubase), ctype = TREE_TYPE (cbase);
3069       ubase = fold_convert (uutype, ubase);
3121   common_type = determine_common_wider_type (&ubase, &cbase);
3131   /* use = ubase - ratio * cbase + ratio * var.
3133      In general case ubase + ratio * (var - cbase) could be better (one less
3135      of computations from (ubase - ratio * cbase) term, and if it does not
3147 	  delta = fold_build2 (MINUS_EXPR, common_type, ubase, cbase);
3154 	  delta = fold_build2 (PLUS_EXPR, common_type, ubase, cbase);
3162 	  delta = fold_build2 (MINUS_EXPR, common_type, ubase, delta);
3181   tree_to_aff_combination (ubase, common_type, aff);
3850   tree ubase = use->iv->base, ustep = use->iv->step;
3852   tree utype = TREE_TYPE (ubase), ctype;
3925   /* use = ubase + ratio * (var - cbase).  If either cbase is a constant
3928      ubase - ratio * cbase + ratio * var
3936 			       ubase, integer_zero_node,
3943 			       ubase, cbase,
3952 			       ubase, integer_zero_node,