contrib/gcc/rtl-factoring.c

140 /* Multiplier for cost of sequence call to avoid abstracting short
146 /* Recomputes the cost of MSEQ pattern/matching sequence.  */
151   SEQ->cost = 0;                                            \
154       SEQ->cost += compute_rtx_cost (x);                    \
176   /* The cost of the sequence.  */
177   int cost;
200   /* The cost of the sequence.  */
201   int cost;
309 /* Compute the cost of INSN rtx for abstraction.  */
318   int cost = -1;
333     /* If INSN is parsed the cost will be the cached length.  */
335       cost = elem->length;
338   /* If we can't parse the INSN cost will be the instruction length.  */
339   if (cost == -1)
341     cost = get_attr_length (insn);
345       elem->length = cost;
349      assume that it has the same cost as a single fast instruction.  */
350   return cost != 0 ? cost : COSTS_N_INSNS (1);
354    INSN2. Returns with LEN number of common insns and COST cost of sequence.
358 matching_length (rtx insn1, rtx insn2, int* len, int* cost)
366   *cost = 0;
371       (*cost) += compute_rtx_cost (x1);
384   int cost;
387   /* Determines the cost of the sequence and return without doing anything
389   matching_length (e0->insn, e1->insn, &len, &cost);
390   if (cost <= seq_call_cost)
404       pseq->cost = 0;
427   mseq->cost = cost;
612       /* Compute the cost of sequence.  */
618       if (mseq->cost > seq_call_cost)
637   /* Compute the cost of pattern sequence.  */
641   if (pseq->cost <= seq_call_cost)
656       if (mseq->cost > seq_call_cost)
657         pseq->gain += mseq->cost - seq_call_cost;
829                           (*mseq)->cost = mcost;
860     if (mseq->cost > seq_call_cost)
886       if ((*mseq)->cost <= seq_call_cost)
1317 /* Computes the cost of calling sequence and the cost of return.  */
1341   /* The cost of jump.  */
1344   /* The cost of calling sequence.  */
1347   /* The cost of return.  */
1350   /* Simple heuristic for minimal sequence cost.  */
1368   /* Compute the common cost of abstraction.  */