Lines Matching refs:LRG
46 void LRG::dump( ) const {
103 double LRG::score() const {
262 gather_lrg_masks( false ); // Collect LRG masks
328 _maxlrg = Split(_maxlrg, &split_arena); // Split spilling LRG everywhere
394 _maxlrg = Split(_maxlrg, &split_arena); // Split spilling LRG everywhere
486 LRG &lrg = lrgs(_names[i]);
570 LRG &lrg = lrgs(vreg);
577 LRG ©_src = lrgs(clidx);
607 // Check for a single def LRG; these can spill nicely
791 LRG &lrg = lrgs(vreg);
843 // if the LRG is an unaligned pair, we will have to spill
844 // so clear the LRG's register mask if it is not already spilled
861 LRG &lrg = lrgs(i2);
868 lrg.set_reg(OptoReg::Name(LRG::SPILL_REG));
917 LRG &lrg = lrgs(i);
981 LRG *n = &lrgs(neighbor);
1039 LRG *n = &lrgs(neighbor);
1111 LRG *lo_lrg = &lrgs(lo_score);
1136 static bool is_legal_reg(LRG &lrg, OptoReg::Name reg, int chunk) {
1163 OptoReg::Name PhaseChaitin::bias_color( LRG &lrg, int chunk ) {
1165 // Check for "at_risk" LRG's
1176 // If this LRG's register is legal for us, choose it
1225 OptoReg::Name PhaseChaitin::choose_color( LRG &lrg, int chunk ) {
1249 // hi-degree LRG cannot get a color then we record that we must spill.
1251 uint spill_reg = LRG::SPILL_REG;
1254 // Pull next LRG from the simplified list - in reverse order of removal
1256 LRG *lrg = &lrgs(lidx);
1296 LRG &nlrg = lrgs(neighbor);
1417 return spill_reg-LRG::SPILL_REG; // Return number of spills
1443 // Stores. Use-def chains are NOT preserved, but Node->LRG->reg maps are.
1474 LRG &lrg_cisc = lrgs( Find_const(src) );
1557 assert (n2lidx(base) == 0, "should not have LRG yet");
1747 // Extend the node to LRG mapping
1864 // Dump LRG array
1869 else tty->print_cr("new LRG");
1939 // Post allocation, use direct mappings, no LRG info available
1942 uint lidx = Find_const(n); // Grab LRG number
1972 if( lrgs(bidx).alive() && lrgs(bidx).reg() >= LRG::SPILL_REG ) {
2109 else tty->print_cr("new LRG");