Lines Matching defs:area
98 // Compute score from cost and area. Low score is best to spill.
99 static double raw_score( double cost, double area ) {
100 return cost - (area*RegisterCostAreaRatio) * 1.52588e-5;
105 // Bigger area lowers score, encourages spilling this live range.
111 // Account for area. Basically, LRGs covering large areas are better
113 if( _area == 0.0 ) // No area? Then no progress to spill
119 if( _cost >= _area*3.0 ) // Tiny area relative to cost
122 if( (_cost+_cost) >= _area*3.0 ) // Small area relative to cost
213 // slots in this area are called "arg_slots". Above the NEW FP (and in
214 // registers) is the outgoing argument area; above that is the spill/temp
215 // area. These are all "frame_slots". Arg_slots start at the zero
218 // slots to actual offsets. Stack-slots in the arg_slot area are biased
219 // by the frame_size; stack-slots in the frame_slot area are biased by 0.
913 // Compute cost/area ratio, in case we spill. Build the lo-degree list.
1068 double area = lrgs(lo_score)._area;
1091 // Compare cost/area of i vs cost/area of lo_score. Smaller cost/area
1095 // evils; in this case pick largest area to spill.
1097 // one block. In which case their area is 0 and score set to max.
1101 (iscore == score && iarea > area && lrgs(lo_score)._was_spilled2) ||
1102 (iscore == score && iarea == area &&
1106 area = iarea;
1226 assert( C->in_preserve_stack_slots() == 0 || chunk != 0 || lrg._is_bound || lrg.mask().is_bound1() || !lrg.mask().Member(OptoReg::Name(_matcher._old_SP-1)), "must not allocate stack0 (inside preserve area)");
1227 assert(C->out_preserve_stack_slots() == 0 || chunk != 0 || lrg._is_bound || lrg.mask().is_bound1() || !lrg.mask().Member(OptoReg::Name(_matcher._old_SP+0)), "must not allocate stack0 (inside preserve area)");
2011 // Incoming argument area dump
2030 // Old outgoing preserve area
2040 // Preserve area dump
2067 // Spill area dump
2074 // Outgoing argument area dump
2080 // Outgoing new preserve area