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

21 /* This pass tries to find the optimal set of induction variables for the loop.
40    3) The optimal (w.r. to a cost function) set of variables is chosen.  The
45 	 variable in the set and adds its cost to the sum.  The cost reflects
51       -- The set cost.  Depending on the size of the set, extra cost may be
72 #include "hard-reg-set.h"
152   bitmap related_cands;	/* The set of "related" iv candidates, plus the common
245   /* Number of uses that cannot be expressed by the candidates in the set.  */
257   /* The number of candidates in the set.  */
304 /* If there are at most this number of ivs in the set, try removing unnecessary
305    ivs from the set always.  */
1970 /* Adds a candidate BASE + STEP * i.  Important field is set to IMPORTANT and
1971    position to POS.  If USE is not NULL, the candidate is set as related to
2102 /* Adds a candidate BASE + STEP * i.  Important field is set to IMPORTANT and
2103    position to POS.  If USE is not NULL, the candidate is set as related to
2415   rtx set;
2419       set = single_set (seq);
2420       if (set)
2421 	cost += rtx_cost (set, SET);
3109 	 set it to 0.  */
3689 /* Estimates cost of forcing EXPR into a variable.  DEPENDS_ON is a set of the
3706    value of offset is added to OFFSET, SYMBOL_PRESENT and VAR_PRESENT are set
3707    to false if the corresponding part is missing.  DEPENDS_ON is a set of the
3752    SYMBOL_PRESENT and VAR_PRESENT are set to false if the corresponding
3753    part is missing.  DEPENDS_ON is a set of the invariants the computation
3790    SYMBOL_PRESENT and VAR_PRESENT are set to false if the corresponding
3791    part is missing.  DEPENDS_ON is a set of the invariants the computation
3842    register.  A set of invariants we depend on is stored in
4007    register.  A set of invariants we depend on is stored in
4407 /* For each size of the induction variable set determine the penalty.  */
4426      We set a reserve R (free regs that are used for temporary computations,
4521 /* Remove invariants in set INVS to set IVS.  */
4576 /* Add invariants in set INVS to set IVS.  */
4595 /* Set cost pair for USE in set IVS to CP.  */
4634 /* Extend set IVS by expressing USE by some of the candidates in it
4793 /* Returns number of induction variable candidates in the set IVS.  */
4839 /* Free memory occupied by the set IVS.  */
4873    new set, and store differences in DELTA.  Number of induction variables
4874    in the new set is stored to N_IVS.  */
4917 /* Try narrowing set IVS by removing CAND.  Return the cost of
4918    the new set and store the differences in DELTA.  */
5001 /* Try optimizing the set of candidates IVS by removing candidates different
5002    from to EXCEPT_CAND from it.  Return cost of the new set, and store
5169 /* Tries to improve set of induction variables IVS.  */
5178   /* Try extending the set of induction variables by one.  */
5190       /* If we successfully added the candidate and the set is small enough,
5212       /* Try removing the candidates from the set instead.  */
5226 /* Attempts to find the optimal set of induction variables.  We do simple
5234   struct iv_ca *set;
5238   set = get_initial_solution (data);
5239   if (!set)
5248       fprintf (dump_file, "Initial set of candidates:\n");
5249       iv_ca_dump (data, dump_file, set);
5252   while (try_improve_iv_set (data, set))
5257 	  iv_ca_dump (data, dump_file, set);
5262     fprintf (dump_file, "Final cost %d\n\n", iv_ca_cost (set));
5267       use->selected = iv_ca_cand_for_use (set, use)->cand;
5270   return set;
5320 create_new_ivs (struct ivopts_data *data, struct iv_ca *set)
5326   EXECUTE_IF_SET_IN_BITMAP (set->cands, 0, i, bi)
5511    somewhere hidden one _DECL node that is used to determine the set of
5845   /* Find the optimal set of induction variables (item 3, part 2).  */