contrib/gcc/cse.c

413    that chain.  The chain is in order of increasing cost.
414    Each element's cost value is in its `cost' field.
429    The `cost' field stores the cost of this element's expression.
453   int cost;
493 /* Compute cost of X, as stored in the `cost' field of a table_elt.  Fixed
494    hard registers and pointers into the frame are the cheapest with a cost
495    of 0.  Next come pseudos with a cost of one and other hard registers with
496    a cost of 2.  Aside from these special cases, call `rtx_cost'.  */
540 /* Set to the cost of a constant pool reference if one was found for a
725 /* Return an estimate of the cost of the registers used in an rtx.
727    however for some exceptions like fixed registers we use a cost of
733   int cost = 0;
735   if (for_each_rtx (&x, approx_reg_cost_1, (void *) &cost))
738   return cost;
827 /* Internal function, to compute cost when X is not a register; called
1362 	   rarely, so the cost is acceptable.  */
1511  (preferable ((X)->cost, (X)->regcost, (Y)->cost, (Y)->regcost) < 0)
1543   elt->cost = COST (x);
2859    is a good approximation for that cost.  However, most RISC machines have
2863    addresses.  For two addresses of equal cost, choose the one with the
2955 	  int best_rtx_cost = (elt->cost + 1) >> 1;
2967 			    && ((p->cost + 1) >> 1) > best_rtx_cost)))
2971 		    best_rtx_cost = (p->cost + 1) >> 1;
4080 			  int cost;
4096 			  cost = COST (simp_result);
4097 			  if (cost < cheapest_cost)
4099 			      cheapest_cost = cost;
5511 	     then give it a negative cost.  */
5518          that are when they are equal cost.  Note that we can never
5603 	      src_elt_cost = elt->cost;
5608 	     of equal cost, use this order: