gcc/gcc/gimple-ssa-strength-reduction.c

353   widest_int incr;
363      an initializer T_0 = stride * incr to be found or introduced in the
1899 	  print_decs (incr_vec[i].incr, dump_file);
2169   for (i = 0; i < incr_vec_len && increment != incr_vec[i].incr; i++)
2296 	    widest_int incr = -basis->index;
2297 	    feeding_def = create_add_on_incoming_edge (c, basis_name, incr,
2516       if (incr_vec[i].incr == increment)
2543       incr_vec[incr_vec_len].incr = increment;
2665 phi_incr_cost (slsr_cand_t c, const widest_int &incr, gimple phi, int *savings)
2683 	      cost += phi_incr_cost (c, incr, arg_def, &feeding_savings);
2692 	      if (incr == diff)
2755 		  const widest_int &incr, bool count_phis)
2762   else if (incr == cand_incr)
2772       local_cost += phi_incr_cost (c, incr, phi, &savings);
2780 				   lookup_cand (c->dependent), incr,
2786 				   lookup_cand (c->sibling), incr,
2801 total_savings (int repl_savings, slsr_cand_t c, const widest_int &incr,
2807   if (incr == cand_incr && !cand_already_replaced (c))
2816       savings -= phi_incr_cost (c, incr, phi, &phi_savings);
2823     savings += total_savings (repl_savings, lookup_cand (c->dependent), incr,
2827     savings += total_savings (repl_savings, lookup_cand (c->sibling), incr,
2850       HOST_WIDE_INT incr = incr_vec[i].incr.to_shwi ();
2855       if (!wi::fits_shwi_p (incr_vec[i].incr) || !incr_vec[i].count)
2863       else if (incr == 0
2864 	       || incr == 1
2865 	       || (incr == -1
2916 	  int cost = mult_by_coeff_cost (incr, mode, speed);
2920 				     incr_vec[i].incr, COUNT_PHIS);
2922 	    cost -= total_savings (repl_savings, first_dep, incr_vec[i].incr,
2937 	    cost = mult_by_coeff_cost (incr, mode, speed);
2940 	    cost = lowest_cost_path (cost, 0, first_dep, incr_vec[i].incr,
2943 	    cost -= total_savings (0, first_dep, incr_vec[i].incr,
3009 ncd_with_phi (slsr_cand_t c, const widest_int &incr, gphi *phi,
3025 	    ncd = ncd_with_phi (c, incr, as_a <gphi *> (arg_def), ncd,
3033 	      if ((incr == diff) || (!address_arithmetic_p && incr == -diff))
3049 ncd_of_cand_and_phis (slsr_cand_t c, const widest_int &incr, slsr_cand_t *where)
3053   if (cand_abs_increment (c) == incr)
3060     ncd = ncd_with_phi (c, incr,
3075 nearest_common_dominator_for_cands (slsr_cand_t c, const widest_int &incr,
3084 						  incr, &sib_where);
3087 						  incr, &dep_where);
3110   this_ncd = ncd_of_cand_and_phis (c, incr, &this_where);
3151       widest_int incr = incr_vec[i].incr;
3154 	  || incr == 1
3155 	  || (incr == -1
3157 	  || incr == 0)
3177       bb = nearest_common_dominator_for_cands (c, incr, &where);
3186       incr_tree = wide_int_to_tree (stride_type, incr);
3382       if (incr_vec[i].incr != cand_incr)