duke@435: /* stefank@2314: * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "opto/regalloc.hpp" duke@435: duke@435: static const int NodeRegsOverflowSize = 200; duke@435: duke@435: void (*PhaseRegAlloc::_alloc_statistics[MAX_REG_ALLOCATORS])(); duke@435: int PhaseRegAlloc::_num_allocators = 0; duke@435: #ifndef PRODUCT duke@435: int PhaseRegAlloc::_total_framesize = 0; duke@435: int PhaseRegAlloc::_max_framesize = 0; duke@435: #endif duke@435: duke@435: PhaseRegAlloc::PhaseRegAlloc( uint unique, PhaseCFG &cfg, duke@435: Matcher &matcher, duke@435: void (*pr_stats)() ): duke@435: Phase(Register_Allocation), _cfg(cfg), _matcher(matcher), duke@435: _node_oops(Thread::current()->resource_area()), duke@435: _node_regs(0), duke@435: _framesize(0xdeadbeef) duke@435: { duke@435: int i; duke@435: duke@435: for (i=0; i < _num_allocators; i++) { duke@435: if (_alloc_statistics[i] == pr_stats) duke@435: return; duke@435: } duke@435: assert((_num_allocators + 1) < MAX_REG_ALLOCATORS, "too many register allocators"); duke@435: _alloc_statistics[_num_allocators++] = pr_stats; duke@435: } duke@435: duke@435: duke@435: //------------------------------reg2offset------------------------------------- duke@435: int PhaseRegAlloc::reg2offset_unchecked( OptoReg::Name reg ) const { duke@435: // Slots below _max_in_arg_stack_reg are offset by the entire frame. duke@435: // Slots above _max_in_arg_stack_reg are frame_slots and are not offset. duke@435: int slot = (reg < _matcher._new_SP) duke@435: ? reg - OptoReg::stack0() + _framesize duke@435: : reg - _matcher._new_SP; duke@435: // Note: We use the direct formula (reg - SharedInfo::stack0) instead of duke@435: // OptoReg::reg2stack(reg), in order to avoid asserts in the latter duke@435: // function. This routine must remain unchecked, so that dump_frame() duke@435: // can do its work undisturbed. duke@435: // %%% not really clear why reg2stack would assert here duke@435: duke@435: return slot*VMRegImpl::stack_slot_size; duke@435: } duke@435: duke@435: int PhaseRegAlloc::reg2offset( OptoReg::Name reg ) const { duke@435: duke@435: // Not allowed in the out-preserve area. duke@435: // In-preserve area is allowed so Intel can fetch the return pc out. duke@435: assert( reg < _matcher._old_SP || duke@435: (reg >= OptoReg::add(_matcher._old_SP,C->out_preserve_stack_slots()) && duke@435: reg < _matcher._in_arg_limit) || duke@435: reg >= OptoReg::add(_matcher._new_SP,C->out_preserve_stack_slots()), duke@435: "register allocated in a preserve area" ); duke@435: return reg2offset_unchecked( reg ); duke@435: } duke@435: duke@435: //------------------------------offset2reg------------------------------------- duke@435: OptoReg::Name PhaseRegAlloc::offset2reg(int stk_offset) const { duke@435: int slot = stk_offset / jintSize; duke@435: int reg = (slot < (int) _framesize) duke@435: ? slot + _matcher._new_SP duke@435: : OptoReg::stack2reg(slot) - _framesize; duke@435: assert(stk_offset == reg2offset((OptoReg::Name) reg), duke@435: "offset2reg does not invert properly"); duke@435: return (OptoReg::Name) reg; duke@435: } duke@435: duke@435: //------------------------------set_oop---------------------------------------- duke@435: void PhaseRegAlloc::set_oop( const Node *n, bool is_an_oop ) { duke@435: if( is_an_oop ) { duke@435: _node_oops.set(n->_idx); duke@435: } duke@435: } duke@435: duke@435: //------------------------------is_oop----------------------------------------- duke@435: bool PhaseRegAlloc::is_oop( const Node *n ) const { duke@435: return _node_oops.test(n->_idx) != 0; duke@435: } duke@435: duke@435: // Allocate _node_regs table with at least "size" elements duke@435: void PhaseRegAlloc::alloc_node_regs(int size) { duke@435: _node_regs_max_index = size + (size >> 1) + NodeRegsOverflowSize; duke@435: _node_regs = NEW_RESOURCE_ARRAY( OptoRegPair, _node_regs_max_index ); duke@435: // We assume our caller will fill in all elements up to size-1, so duke@435: // only the extra space we allocate is initialized here. duke@435: for( uint i = size; i < _node_regs_max_index; ++i ) duke@435: _node_regs[i].set_bad(); duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: void duke@435: PhaseRegAlloc::print_statistics() { duke@435: tty->print_cr("Total frameslots = %d, Max frameslots = %d", _total_framesize, _max_framesize); duke@435: int i; duke@435: duke@435: for (i=0; i < _num_allocators; i++) { duke@435: _alloc_statistics[i](); duke@435: } duke@435: } duke@435: #endif