contrib/gcc/rtl-factoring.c

68    gain computation
69      This part computes the gain of abstraction which could be archived when
74      RECOMPUTE_GAIN does the gain computation. The sequences with the maximum
75      gain is on the top of PATTERN_SEQS.
193   /* The gain of transforming the pattern sequence into a pseudo-function and
195   int gain;
388      if it is too small to produce any gain.  */
402       pseq->gain = 0;                 /* Set to zero to force recomputing.  */
576 /* Computes the gain of turning PSEQ into a pseudo-function and its matching
594   pseq->gain = -(seq_call_cost - seq_jump_cost + seq_return_cost);
640   /* No gain if COST is too small.  */
643     pseq->gain = -1;
655       /* Once the length is stabilizing the gain can be calculated.  */
657         pseq->gain += mseq->cost - seq_call_cost;
660   /* No need to do further work if there is no gain.  */
661   if (pseq->gain <= 0)
710      gain to 0.  */
712     pseq->gain = 0;
730 /* Computes the gain for pattern sequences. Pattern sequences producing no gain
731    are deleted. The pattern sequence with the biggest gain is moved to the first
743       if ((*pseq)->gain <= 0)
746       if ((*pseq)->gain > 0)
748           if ((*pseq)->gain > maxgain)
754               maxgain = pattern_seqs->gain;
822                       /* Set to 0 to force gain recomputation.  */
823                       (*pseq)->gain = 0;
831                           /* Set to 0 to force gain recomputation.  */
832                           (*pseq)->gain = 0;
848    the pattern sequence with the biggest gain and its matching sequences.  */
1183            "Best pattern sequence with %d gain is at insn %d (length %d).\n",
1184            pattern_seqs->gain, INSN_UID (pattern_seqs->insn),
1378       /* Recompute gain for sequences if necessary and select sequence with
1379          biggest gain.  */
1384       /* Update the cached info of the other sequences and force gain