/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#include "precompiled.hpp"
#include "opto/regalloc.hpp"
#ifndef PRODUCT
#endif
void (*pr_stats)() ):
_node_regs(0),
_framesize(0xdeadbeef)
{
int i;
for (i=0; i < _num_allocators; i++) {
if (_alloc_statistics[i] == pr_stats)
return;
}
}
//------------------------------reg2offset-------------------------------------
// Slots below _max_in_arg_stack_reg are offset by the entire frame.
// Slots above _max_in_arg_stack_reg are frame_slots and are not offset.
// Note: We use the direct formula (reg - SharedInfo::stack0) instead of
// OptoReg::reg2stack(reg), in order to avoid asserts in the latter
// function. This routine must remain unchecked, so that dump_frame()
// can do its work undisturbed.
// %%% not really clear why reg2stack would assert here
}
// Not allowed in the out-preserve area.
// In-preserve area is allowed so Intel can fetch the return pc out.
"register allocated in a preserve area" );
return reg2offset_unchecked( reg );
}
//------------------------------offset2reg-------------------------------------
"offset2reg does not invert properly");
}
//------------------------------set_oop----------------------------------------
if( is_an_oop ) {
}
}
//------------------------------is_oop-----------------------------------------
}
// Allocate _node_regs table with at least "size" elements
// We assume our caller will fill in all elements up to size-1, so
// only the extra space we allocate is initialized here.
_node_regs[i].set_bad();
}
#ifndef PRODUCT
void
int i;
for (i=0; i < _num_allocators; i++) {
_alloc_statistics[i]();
}
}
#endif