1/* 2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25#include "precompiled.hpp" 26#include "opto/regalloc.hpp" 27 28static const int NodeRegsOverflowSize = 200; 29 30void (*PhaseRegAlloc::_alloc_statistics[MAX_REG_ALLOCATORS])(); 31int PhaseRegAlloc::_num_allocators = 0; 32#ifndef PRODUCT 33int PhaseRegAlloc::_total_framesize = 0; 34int PhaseRegAlloc::_max_framesize = 0; 35#endif 36 37PhaseRegAlloc::PhaseRegAlloc( uint unique, PhaseCFG &cfg, 38 Matcher &matcher, 39 void (*pr_stats)() ): 40 Phase(Register_Allocation), _cfg(cfg), _matcher(matcher), 41 _node_oops(Thread::current()->resource_area()), 42 _node_regs(0), 43 _node_regs_max_index(0), 44 _framesize(0xdeadbeef) 45{ 46 int i; 47 48 for (i=0; i < _num_allocators; i++) { 49 if (_alloc_statistics[i] == pr_stats) 50 return; 51 } 52 assert((_num_allocators + 1) < MAX_REG_ALLOCATORS, "too many register allocators"); 53 _alloc_statistics[_num_allocators++] = pr_stats; 54} 55 56 57//------------------------------reg2offset------------------------------------- 58int PhaseRegAlloc::reg2offset_unchecked( OptoReg::Name reg ) const { 59 // Slots below _max_in_arg_stack_reg are offset by the entire frame. 60 // Slots above _max_in_arg_stack_reg are frame_slots and are not offset. 61 int slot = (reg < _matcher._new_SP) 62 ? reg - OptoReg::stack0() + _framesize 63 : reg - _matcher._new_SP; 64 // Note: We use the direct formula (reg - SharedInfo::stack0) instead of 65 // OptoReg::reg2stack(reg), in order to avoid asserts in the latter 66 // function. This routine must remain unchecked, so that dump_frame() 67 // can do its work undisturbed. 68 // %%% not really clear why reg2stack would assert here 69 70 return slot*VMRegImpl::stack_slot_size; 71} 72 73int PhaseRegAlloc::reg2offset( OptoReg::Name reg ) const { 74 75 // Not allowed in the out-preserve area. 76 // In-preserve area is allowed so Intel can fetch the return pc out. 77 assert( reg < _matcher._old_SP || 78 (reg >= OptoReg::add(_matcher._old_SP,C->out_preserve_stack_slots()) && 79 reg < _matcher._in_arg_limit) || 80 reg >= OptoReg::add(_matcher._new_SP, C->out_preserve_stack_slots()) || 81 // Allow return_addr in the out-preserve area. 82 reg == _matcher.return_addr(), 83 "register allocated in a preserve area" ); 84 return reg2offset_unchecked( reg ); 85} 86 87//------------------------------offset2reg------------------------------------- 88OptoReg::Name PhaseRegAlloc::offset2reg(int stk_offset) const { 89 int slot = stk_offset / jintSize; 90 int reg = (slot < (int) _framesize) 91 ? slot + _matcher._new_SP 92 : OptoReg::stack2reg(slot) - _framesize; 93 assert(stk_offset == reg2offset((OptoReg::Name) reg), 94 "offset2reg does not invert properly"); 95 return (OptoReg::Name) reg; 96} 97 98//------------------------------set_oop---------------------------------------- 99void PhaseRegAlloc::set_oop( const Node *n, bool is_an_oop ) { 100 if( is_an_oop ) { 101 _node_oops.set(n->_idx); 102 } 103} 104 105//------------------------------is_oop----------------------------------------- 106bool PhaseRegAlloc::is_oop( const Node *n ) const { 107 return _node_oops.test(n->_idx) != 0; 108} 109 110// Allocate _node_regs table with at least "size" elements 111void PhaseRegAlloc::alloc_node_regs(int size) { 112 _node_regs_max_index = size + (size >> 1) + NodeRegsOverflowSize; 113 _node_regs = NEW_RESOURCE_ARRAY( OptoRegPair, _node_regs_max_index ); 114 // We assume our caller will fill in all elements up to size-1, so 115 // only the extra space we allocate is initialized here. 116 for( uint i = size; i < _node_regs_max_index; ++i ) 117 _node_regs[i].set_bad(); 118} 119 120#ifndef PRODUCT 121void 122PhaseRegAlloc::print_statistics() { 123 tty->print_cr("Total frameslots = %d, Max frameslots = %d", _total_framesize, _max_framesize); 124 int i; 125 126 for (i=0; i < _num_allocators; i++) { 127 _alloc_statistics[i](); 128 } 129} 130#endif 131