fbefa72f81
stack for now. Next step is probably fixing the binary op stubs so they can take swapped registers and fixing the deferred code so it doesn't insist that all registers except the two operands are flushed. Generates slightly worse code sometimes because the peephole push-pop elimination gets confused when we don't use the same register all the time (the old code used r0 always). Review URL: http://codereview.chromium.org/1604002 git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@4368 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
503 lines
15 KiB
C++
503 lines
15 KiB
C++
// Copyright 2009 the V8 project authors. All rights reserved.
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are
|
|
// met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright
|
|
// notice, this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above
|
|
// copyright notice, this list of conditions and the following
|
|
// disclaimer in the documentation and/or other materials provided
|
|
// with the distribution.
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
// contributors may be used to endorse or promote products derived
|
|
// from this software without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#include "v8.h"
|
|
|
|
#include "codegen-inl.h"
|
|
#include "register-allocator-inl.h"
|
|
#include "scopes.h"
|
|
#include "virtual-frame-inl.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
#define __ ACCESS_MASM(masm())
|
|
|
|
void VirtualFrame::PopToR1R0() {
|
|
VirtualFrame where_to_go = *this;
|
|
// Shuffle things around so the top of stack is in r0 and r1.
|
|
where_to_go.top_of_stack_state_ = R0_R1_TOS;
|
|
MergeTo(&where_to_go);
|
|
// Pop the two registers off the stack so they are detached from the frame.
|
|
element_count_ -= 2;
|
|
top_of_stack_state_ = NO_TOS_REGISTERS;
|
|
}
|
|
|
|
|
|
void VirtualFrame::PopToR1() {
|
|
VirtualFrame where_to_go = *this;
|
|
// Shuffle things around so the top of stack is only in r1.
|
|
where_to_go.top_of_stack_state_ = R1_TOS;
|
|
MergeTo(&where_to_go);
|
|
// Pop the register off the stack so it is detached from the frame.
|
|
element_count_ -= 1;
|
|
top_of_stack_state_ = NO_TOS_REGISTERS;
|
|
}
|
|
|
|
|
|
void VirtualFrame::PopToR0() {
|
|
VirtualFrame where_to_go = *this;
|
|
// Shuffle things around so the top of stack only in r0.
|
|
where_to_go.top_of_stack_state_ = R0_TOS;
|
|
MergeTo(&where_to_go);
|
|
// Pop the register off the stack so it is detached from the frame.
|
|
element_count_ -= 1;
|
|
top_of_stack_state_ = NO_TOS_REGISTERS;
|
|
}
|
|
|
|
|
|
void VirtualFrame::MergeTo(VirtualFrame* expected) {
|
|
if (Equals(expected)) return;
|
|
#define CASE_NUMBER(a, b) ((a) * TOS_STATES + (b))
|
|
switch (CASE_NUMBER(top_of_stack_state_, expected->top_of_stack_state_)) {
|
|
case CASE_NUMBER(NO_TOS_REGISTERS, NO_TOS_REGISTERS):
|
|
break;
|
|
case CASE_NUMBER(NO_TOS_REGISTERS, R0_TOS):
|
|
__ pop(r0);
|
|
break;
|
|
case CASE_NUMBER(NO_TOS_REGISTERS, R1_TOS):
|
|
__ pop(r1);
|
|
break;
|
|
case CASE_NUMBER(NO_TOS_REGISTERS, R0_R1_TOS):
|
|
__ pop(r0);
|
|
__ pop(r1);
|
|
break;
|
|
case CASE_NUMBER(NO_TOS_REGISTERS, R1_R0_TOS):
|
|
__ pop(r1);
|
|
__ pop(r1);
|
|
break;
|
|
case CASE_NUMBER(R0_TOS, NO_TOS_REGISTERS):
|
|
__ push(r0);
|
|
break;
|
|
case CASE_NUMBER(R0_TOS, R0_TOS):
|
|
break;
|
|
case CASE_NUMBER(R0_TOS, R1_TOS):
|
|
__ mov(r1, r0);
|
|
break;
|
|
case CASE_NUMBER(R0_TOS, R0_R1_TOS):
|
|
__ pop(r1);
|
|
break;
|
|
case CASE_NUMBER(R0_TOS, R1_R0_TOS):
|
|
__ mov(r1, r0);
|
|
__ pop(r0);
|
|
break;
|
|
case CASE_NUMBER(R1_TOS, NO_TOS_REGISTERS):
|
|
__ push(r1);
|
|
break;
|
|
case CASE_NUMBER(R1_TOS, R0_TOS):
|
|
__ mov(r0, r1);
|
|
break;
|
|
case CASE_NUMBER(R1_TOS, R1_TOS):
|
|
break;
|
|
case CASE_NUMBER(R1_TOS, R0_R1_TOS):
|
|
__ mov(r0, r1);
|
|
__ pop(r1);
|
|
break;
|
|
case CASE_NUMBER(R1_TOS, R1_R0_TOS):
|
|
__ pop(r0);
|
|
break;
|
|
case CASE_NUMBER(R0_R1_TOS, NO_TOS_REGISTERS):
|
|
__ push(r1);
|
|
__ push(r0);
|
|
break;
|
|
case CASE_NUMBER(R0_R1_TOS, R0_TOS):
|
|
__ push(r1);
|
|
break;
|
|
case CASE_NUMBER(R0_R1_TOS, R1_TOS):
|
|
__ push(r1);
|
|
__ mov(r1, r0);
|
|
break;
|
|
case CASE_NUMBER(R0_R1_TOS, R0_R1_TOS):
|
|
break;
|
|
case CASE_NUMBER(R0_R1_TOS, R1_R0_TOS):
|
|
__ Swap(r0, r1, ip);
|
|
break;
|
|
case CASE_NUMBER(R1_R0_TOS, NO_TOS_REGISTERS):
|
|
__ push(r0);
|
|
__ push(r1);
|
|
break;
|
|
case CASE_NUMBER(R1_R0_TOS, R0_TOS):
|
|
__ push(r0);
|
|
__ mov(r0, r1);
|
|
break;
|
|
case CASE_NUMBER(R1_R0_TOS, R1_TOS):
|
|
__ push(r0);
|
|
break;
|
|
case CASE_NUMBER(R1_R0_TOS, R0_R1_TOS):
|
|
__ Swap(r0, r1, ip);
|
|
break;
|
|
case CASE_NUMBER(R1_R0_TOS, R1_R0_TOS):
|
|
break;
|
|
default:
|
|
UNREACHABLE();
|
|
#undef CASE_NUMBER
|
|
}
|
|
ASSERT(register_allocation_map_ == expected->register_allocation_map_);
|
|
}
|
|
|
|
|
|
void VirtualFrame::Enter() {
|
|
Comment cmnt(masm(), "[ Enter JS frame");
|
|
|
|
#ifdef DEBUG
|
|
// Verify that r1 contains a JS function. The following code relies
|
|
// on r2 being available for use.
|
|
if (FLAG_debug_code) {
|
|
Label map_check, done;
|
|
__ tst(r1, Operand(kSmiTagMask));
|
|
__ b(ne, &map_check);
|
|
__ stop("VirtualFrame::Enter - r1 is not a function (smi check).");
|
|
__ bind(&map_check);
|
|
__ CompareObjectType(r1, r2, r2, JS_FUNCTION_TYPE);
|
|
__ b(eq, &done);
|
|
__ stop("VirtualFrame::Enter - r1 is not a function (map check).");
|
|
__ bind(&done);
|
|
}
|
|
#endif // DEBUG
|
|
|
|
// We are about to push four values to the frame.
|
|
Adjust(4);
|
|
__ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit());
|
|
// Adjust FP to point to saved FP.
|
|
__ add(fp, sp, Operand(2 * kPointerSize));
|
|
}
|
|
|
|
|
|
void VirtualFrame::Exit() {
|
|
Comment cmnt(masm(), "[ Exit JS frame");
|
|
// Record the location of the JS exit code for patching when setting
|
|
// break point.
|
|
__ RecordJSReturn();
|
|
|
|
// Drop the execution stack down to the frame pointer and restore the caller
|
|
// frame pointer and return address.
|
|
__ mov(sp, fp);
|
|
__ ldm(ia_w, sp, fp.bit() | lr.bit());
|
|
}
|
|
|
|
|
|
void VirtualFrame::AllocateStackSlots() {
|
|
int count = local_count();
|
|
if (count > 0) {
|
|
Comment cmnt(masm(), "[ Allocate space for locals");
|
|
Adjust(count);
|
|
// Initialize stack slots with 'undefined' value.
|
|
__ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
|
|
__ LoadRoot(r2, Heap::kStackLimitRootIndex);
|
|
if (count < kLocalVarBound) {
|
|
// For less locals the unrolled loop is more compact.
|
|
for (int i = 0; i < count; i++) {
|
|
__ push(ip);
|
|
}
|
|
} else {
|
|
// For more locals a loop in generated code is more compact.
|
|
Label alloc_locals_loop;
|
|
__ mov(r1, Operand(count));
|
|
__ bind(&alloc_locals_loop);
|
|
__ push(ip);
|
|
__ sub(r1, r1, Operand(1), SetCC);
|
|
__ b(ne, &alloc_locals_loop);
|
|
}
|
|
} else {
|
|
__ LoadRoot(r2, Heap::kStackLimitRootIndex);
|
|
}
|
|
// Check the stack for overflow or a break request.
|
|
// Put the lr setup instruction in the delay slot. The kInstrSize is added
|
|
// to the implicit 8 byte offset that always applies to operations with pc
|
|
// and gives a return address 12 bytes down.
|
|
masm()->add(lr, pc, Operand(Assembler::kInstrSize));
|
|
masm()->cmp(sp, Operand(r2));
|
|
StackCheckStub stub;
|
|
// Call the stub if lower.
|
|
masm()->mov(pc,
|
|
Operand(reinterpret_cast<intptr_t>(stub.GetCode().location()),
|
|
RelocInfo::CODE_TARGET),
|
|
LeaveCC,
|
|
lo);
|
|
}
|
|
|
|
|
|
|
|
void VirtualFrame::PushReceiverSlotAddress() {
|
|
UNIMPLEMENTED();
|
|
}
|
|
|
|
|
|
void VirtualFrame::PushTryHandler(HandlerType type) {
|
|
// Grow the expression stack by handler size less one (the return
|
|
// address in lr is already counted by a call instruction).
|
|
Adjust(kHandlerSize - 1);
|
|
__ PushTryHandler(IN_JAVASCRIPT, type);
|
|
}
|
|
|
|
|
|
void VirtualFrame::CallRuntime(Runtime::Function* f, int arg_count) {
|
|
Forget(arg_count);
|
|
ASSERT(cgen()->HasValidEntryRegisters());
|
|
__ CallRuntime(f, arg_count);
|
|
}
|
|
|
|
|
|
void VirtualFrame::CallRuntime(Runtime::FunctionId id, int arg_count) {
|
|
Forget(arg_count);
|
|
ASSERT(cgen()->HasValidEntryRegisters());
|
|
__ CallRuntime(id, arg_count);
|
|
}
|
|
|
|
|
|
#ifdef ENABLE_DEBUGGER_SUPPORT
|
|
void VirtualFrame::DebugBreak() {
|
|
ASSERT(cgen()->HasValidEntryRegisters());
|
|
__ DebugBreak();
|
|
}
|
|
#endif
|
|
|
|
|
|
void VirtualFrame::InvokeBuiltin(Builtins::JavaScript id,
|
|
InvokeJSFlags flags,
|
|
int arg_count) {
|
|
Forget(arg_count);
|
|
__ InvokeBuiltin(id, flags);
|
|
}
|
|
|
|
|
|
void VirtualFrame::CallCodeObject(Handle<Code> code,
|
|
RelocInfo::Mode rmode,
|
|
int dropped_args) {
|
|
switch (code->kind()) {
|
|
case Code::CALL_IC:
|
|
case Code::FUNCTION:
|
|
break;
|
|
case Code::KEYED_LOAD_IC:
|
|
case Code::LOAD_IC:
|
|
case Code::KEYED_STORE_IC:
|
|
case Code::STORE_IC:
|
|
ASSERT(dropped_args == 0);
|
|
break;
|
|
case Code::BUILTIN:
|
|
ASSERT(*code == Builtins::builtin(Builtins::JSConstructCall));
|
|
break;
|
|
default:
|
|
UNREACHABLE();
|
|
break;
|
|
}
|
|
Forget(dropped_args);
|
|
ASSERT(cgen()->HasValidEntryRegisters());
|
|
__ Call(code, rmode);
|
|
}
|
|
|
|
|
|
// NO_TOS_REGISTERS, R0_TOS, R1_TOS, R1_R0_TOS, R0_R1_TOS.
|
|
const bool VirtualFrame::kR0InUse[TOS_STATES] =
|
|
{ false, true, false, true, true };
|
|
const bool VirtualFrame::kR1InUse[TOS_STATES] =
|
|
{ false, false, true, true, true };
|
|
const int VirtualFrame::kVirtualElements[TOS_STATES] =
|
|
{ 0, 1, 1, 2, 2 };
|
|
const Register VirtualFrame::kTopRegister[TOS_STATES] =
|
|
{ r0, r0, r1, r1, r0 };
|
|
const Register VirtualFrame::kBottomRegister[TOS_STATES] =
|
|
{ r0, r0, r1, r0, r1 };
|
|
const Register VirtualFrame::kAllocatedRegisters[
|
|
VirtualFrame::kNumberOfAllocatedRegisters] = { r2, r3, r4, r5, r6 };
|
|
// Popping is done by the transition implied by kStateAfterPop. Of course if
|
|
// there were no stack slots allocated to registers then the physical SP must
|
|
// be adjusted.
|
|
const VirtualFrame::TopOfStack VirtualFrame::kStateAfterPop[TOS_STATES] =
|
|
{ NO_TOS_REGISTERS, NO_TOS_REGISTERS, NO_TOS_REGISTERS, R0_TOS, R1_TOS };
|
|
// Pushing is done by the transition implied by kStateAfterPush. Of course if
|
|
// the maximum number of registers was already allocated to the top of stack
|
|
// slots then one register must be physically pushed onto the stack.
|
|
const VirtualFrame::TopOfStack VirtualFrame::kStateAfterPush[TOS_STATES] =
|
|
{ R0_TOS, R1_R0_TOS, R0_R1_TOS, R0_R1_TOS, R1_R0_TOS };
|
|
|
|
|
|
bool VirtualFrame::SpilledScope::is_spilled_ = false;
|
|
|
|
|
|
void VirtualFrame::Drop(int count) {
|
|
ASSERT(count >= 0);
|
|
ASSERT(height() >= count);
|
|
// Discard elements from the virtual frame and free any registers.
|
|
int num_virtual_elements = kVirtualElements[top_of_stack_state_];
|
|
while (num_virtual_elements > 0) {
|
|
Pop();
|
|
num_virtual_elements--;
|
|
count--;
|
|
if (count == 0) return;
|
|
}
|
|
if (count == 0) return;
|
|
__ add(sp, sp, Operand(count * kPointerSize));
|
|
element_count_ -= count;
|
|
}
|
|
|
|
|
|
void VirtualFrame::Pop() {
|
|
if (top_of_stack_state_ == NO_TOS_REGISTERS) {
|
|
__ add(sp, sp, Operand(kPointerSize));
|
|
} else {
|
|
top_of_stack_state_ = kStateAfterPop[top_of_stack_state_];
|
|
}
|
|
element_count_--;
|
|
}
|
|
|
|
|
|
void VirtualFrame::EmitPop(Register reg) {
|
|
ASSERT(!is_used(reg));
|
|
if (top_of_stack_state_ == NO_TOS_REGISTERS) {
|
|
__ pop(reg);
|
|
} else {
|
|
__ mov(reg, kTopRegister[top_of_stack_state_]);
|
|
top_of_stack_state_ = kStateAfterPop[top_of_stack_state_];
|
|
}
|
|
element_count_--;
|
|
}
|
|
|
|
|
|
Register VirtualFrame::Peek() {
|
|
AssertIsNotSpilled();
|
|
if (top_of_stack_state_ == NO_TOS_REGISTERS) {
|
|
top_of_stack_state_ = kStateAfterPush[top_of_stack_state_];
|
|
Register answer = kTopRegister[top_of_stack_state_];
|
|
__ pop(answer);
|
|
return answer;
|
|
} else {
|
|
return kTopRegister[top_of_stack_state_];
|
|
}
|
|
}
|
|
|
|
|
|
Register VirtualFrame::PopToRegister(Register but_not_to_this_one) {
|
|
ASSERT(but_not_to_this_one.is(r0) ||
|
|
but_not_to_this_one.is(r1) ||
|
|
but_not_to_this_one.is(no_reg));
|
|
AssertIsNotSpilled();
|
|
element_count_--;
|
|
if (top_of_stack_state_ == NO_TOS_REGISTERS) {
|
|
if (but_not_to_this_one.is(r0)) {
|
|
__ pop(r1);
|
|
return r1;
|
|
} else {
|
|
__ pop(r0);
|
|
return r0;
|
|
}
|
|
} else {
|
|
Register answer = kTopRegister[top_of_stack_state_];
|
|
ASSERT(!answer.is(but_not_to_this_one));
|
|
top_of_stack_state_ = kStateAfterPop[top_of_stack_state_];
|
|
return answer;
|
|
}
|
|
}
|
|
|
|
|
|
void VirtualFrame::EnsureOneFreeTOSRegister() {
|
|
if (kVirtualElements[top_of_stack_state_] == kMaxTOSRegisters) {
|
|
__ push(kBottomRegister[top_of_stack_state_]);
|
|
top_of_stack_state_ = kStateAfterPush[top_of_stack_state_];
|
|
top_of_stack_state_ = kStateAfterPop[top_of_stack_state_];
|
|
}
|
|
ASSERT(kVirtualElements[top_of_stack_state_] != kMaxTOSRegisters);
|
|
}
|
|
|
|
|
|
void VirtualFrame::EmitPush(Register reg) {
|
|
element_count_++;
|
|
if (SpilledScope::is_spilled()) {
|
|
__ push(reg);
|
|
return;
|
|
}
|
|
if (top_of_stack_state_ == NO_TOS_REGISTERS) {
|
|
if (reg.is(r0)) {
|
|
top_of_stack_state_ = R0_TOS;
|
|
return;
|
|
}
|
|
if (reg.is(r1)) {
|
|
top_of_stack_state_ = R1_TOS;
|
|
return;
|
|
}
|
|
}
|
|
EnsureOneFreeTOSRegister();
|
|
top_of_stack_state_ = kStateAfterPush[top_of_stack_state_];
|
|
Register dest = kTopRegister[top_of_stack_state_];
|
|
__ Move(dest, reg);
|
|
}
|
|
|
|
|
|
Register VirtualFrame::GetTOSRegister() {
|
|
if (SpilledScope::is_spilled()) return r0;
|
|
|
|
EnsureOneFreeTOSRegister();
|
|
return kTopRegister[kStateAfterPush[top_of_stack_state_]];
|
|
}
|
|
|
|
|
|
void VirtualFrame::EmitPush(MemOperand operand) {
|
|
element_count_++;
|
|
if (SpilledScope::is_spilled()) {
|
|
__ ldr(r0, operand);
|
|
__ push(r0);
|
|
return;
|
|
}
|
|
EnsureOneFreeTOSRegister();
|
|
top_of_stack_state_ = kStateAfterPush[top_of_stack_state_];
|
|
__ ldr(kTopRegister[top_of_stack_state_], operand);
|
|
}
|
|
|
|
|
|
void VirtualFrame::EmitPushMultiple(int count, int src_regs) {
|
|
ASSERT(SpilledScope::is_spilled());
|
|
Adjust(count);
|
|
__ stm(db_w, sp, src_regs);
|
|
}
|
|
|
|
|
|
void VirtualFrame::SpillAll() {
|
|
switch (top_of_stack_state_) {
|
|
case R1_R0_TOS:
|
|
masm()->push(r0);
|
|
// Fall through.
|
|
case R1_TOS:
|
|
masm()->push(r1);
|
|
top_of_stack_state_ = NO_TOS_REGISTERS;
|
|
break;
|
|
case R0_R1_TOS:
|
|
masm()->push(r1);
|
|
// Fall through.
|
|
case R0_TOS:
|
|
masm()->push(r0);
|
|
top_of_stack_state_ = NO_TOS_REGISTERS;
|
|
// Fall through.
|
|
case NO_TOS_REGISTERS:
|
|
break;
|
|
}
|
|
ASSERT(register_allocation_map_ == 0); // Not yet implemented.
|
|
}
|
|
|
|
#undef __
|
|
|
|
} } // namespace v8::internal
|