2010-02-01 17:01:58 +00:00
|
|
|
// Copyright 2010 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 "fast-codegen.h"
|
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
#define __ ACCESS_MASM(masm())
|
|
|
|
|
2010-02-09 10:18:51 +00:00
|
|
|
Register FastCodeGenerator::accumulator0() { return r0; }
|
|
|
|
Register FastCodeGenerator::accumulator1() { return r1; }
|
|
|
|
Register FastCodeGenerator::scratch0() { return r3; }
|
|
|
|
Register FastCodeGenerator::scratch1() { return r4; }
|
|
|
|
Register FastCodeGenerator::receiver_reg() { return r2; }
|
|
|
|
Register FastCodeGenerator::context_reg() { return cp; }
|
2010-02-01 17:01:58 +00:00
|
|
|
|
|
|
|
|
2010-02-09 10:18:51 +00:00
|
|
|
void FastCodeGenerator::EmitLoadReceiver() {
|
|
|
|
// Offset 2 is due to return address and saved frame pointer.
|
|
|
|
int index = 2 + scope()->num_parameters();
|
|
|
|
__ ldr(receiver_reg(), MemOperand(sp, index * kPointerSize));
|
2010-02-01 17:01:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-05 13:57:18 +00:00
|
|
|
void FastCodeGenerator::EmitGlobalVariableLoad(Handle<Object> cell) {
|
2010-02-09 13:44:43 +00:00
|
|
|
ASSERT(!destination().is(no_reg));
|
2010-02-05 13:57:18 +00:00
|
|
|
ASSERT(cell->IsJSGlobalPropertyCell());
|
2010-02-09 13:44:43 +00:00
|
|
|
|
|
|
|
__ mov(destination(), Operand(cell));
|
|
|
|
__ ldr(destination(),
|
|
|
|
FieldMemOperand(destination(), JSGlobalPropertyCell::kValueOffset));
|
2010-02-05 13:57:18 +00:00
|
|
|
if (FLAG_debug_code) {
|
|
|
|
__ mov(ip, Operand(Factory::the_hole_value()));
|
2010-02-09 13:44:43 +00:00
|
|
|
__ cmp(destination(), ip);
|
2010-02-05 13:57:18 +00:00
|
|
|
__ Check(ne, "DontDelete cells can't contain the hole");
|
2010-02-01 17:01:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::EmitThisPropertyStore(Handle<String> name) {
|
|
|
|
LookupResult lookup;
|
2010-02-05 13:57:18 +00:00
|
|
|
info()->receiver()->Lookup(*name, &lookup);
|
2010-02-01 17:01:58 +00:00
|
|
|
|
2010-02-05 13:57:18 +00:00
|
|
|
ASSERT(lookup.holder() == *info()->receiver());
|
2010-02-01 17:01:58 +00:00
|
|
|
ASSERT(lookup.type() == FIELD);
|
2010-02-05 13:57:18 +00:00
|
|
|
Handle<Map> map(Handle<HeapObject>::cast(info()->receiver())->map());
|
2010-02-01 17:01:58 +00:00
|
|
|
int index = lookup.GetFieldIndex() - map->inobject_properties();
|
|
|
|
int offset = index * kPointerSize;
|
|
|
|
|
|
|
|
// Negative offsets are inobject properties.
|
|
|
|
if (offset < 0) {
|
|
|
|
offset += map->instance_size();
|
2010-02-09 10:18:51 +00:00
|
|
|
__ mov(scratch0(), receiver_reg()); // Copy receiver for write barrier.
|
2010-02-01 17:01:58 +00:00
|
|
|
} else {
|
|
|
|
offset += FixedArray::kHeaderSize;
|
2010-02-09 10:18:51 +00:00
|
|
|
__ ldr(scratch0(),
|
|
|
|
FieldMemOperand(receiver_reg(), JSObject::kPropertiesOffset));
|
2010-02-01 17:01:58 +00:00
|
|
|
}
|
|
|
|
// Perform the store.
|
2010-02-09 10:18:51 +00:00
|
|
|
__ str(accumulator0(), FieldMemOperand(scratch0(), offset));
|
|
|
|
__ mov(scratch1(), Operand(offset));
|
|
|
|
__ RecordWrite(scratch0(), scratch1(), ip);
|
2010-02-09 13:44:43 +00:00
|
|
|
if (destination().is(accumulator1())) {
|
|
|
|
__ mov(accumulator1(), accumulator0());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::EmitThisPropertyLoad(Handle<String> name) {
|
|
|
|
ASSERT(!destination().is(no_reg));
|
|
|
|
LookupResult lookup;
|
|
|
|
info()->receiver()->Lookup(*name, &lookup);
|
|
|
|
|
|
|
|
ASSERT(lookup.holder() == *info()->receiver());
|
|
|
|
ASSERT(lookup.type() == FIELD);
|
|
|
|
Handle<Map> map(Handle<HeapObject>::cast(info()->receiver())->map());
|
|
|
|
int index = lookup.GetFieldIndex() - map->inobject_properties();
|
|
|
|
int offset = index * kPointerSize;
|
|
|
|
|
|
|
|
// Perform the load. Negative offsets are inobject properties.
|
|
|
|
if (offset < 0) {
|
|
|
|
offset += map->instance_size();
|
|
|
|
__ ldr(destination(), FieldMemOperand(receiver_reg(), offset));
|
|
|
|
} else {
|
|
|
|
offset += FixedArray::kHeaderSize;
|
|
|
|
__ ldr(scratch0(),
|
|
|
|
FieldMemOperand(receiver_reg(), JSObject::kPropertiesOffset));
|
|
|
|
__ ldr(destination(), FieldMemOperand(scratch0(), offset));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::EmitBitOr() {
|
|
|
|
Register check; // A register is used for the smi check/operation.
|
|
|
|
if (destination().is(no_reg)) {
|
|
|
|
check = scratch0(); // Do not clobber either operand register.
|
|
|
|
} else {
|
|
|
|
// Preserve whichever operand shares the destination register in case we
|
|
|
|
// have to bail out.
|
|
|
|
__ mov(scratch0(), destination());
|
|
|
|
check = destination();
|
|
|
|
}
|
|
|
|
__ orr(check, accumulator1(), Operand(accumulator0()));
|
|
|
|
// Restore the clobbered operand if necessary.
|
|
|
|
if (destination().is(no_reg)) {
|
|
|
|
__ BranchOnNotSmi(check, bailout());
|
|
|
|
} else {
|
|
|
|
Label done;
|
|
|
|
__ BranchOnSmi(check, &done);
|
|
|
|
__ mov(destination(), scratch0());
|
|
|
|
__ jmp(bailout());
|
|
|
|
__ bind(&done);
|
|
|
|
}
|
2010-02-01 17:01:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-02-05 13:57:18 +00:00
|
|
|
void FastCodeGenerator::Generate(CompilationInfo* compilation_info) {
|
2010-02-01 17:01:58 +00:00
|
|
|
ASSERT(info_ == NULL);
|
2010-02-05 13:57:18 +00:00
|
|
|
info_ = compilation_info;
|
2010-02-01 17:01:58 +00:00
|
|
|
|
|
|
|
// Save the caller's frame pointer and set up our own.
|
|
|
|
Comment prologue_cmnt(masm(), ";; Prologue");
|
|
|
|
__ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit());
|
2010-02-03 07:58:47 +00:00
|
|
|
__ add(fp, sp, Operand(2 * kPointerSize));
|
2010-02-01 17:01:58 +00:00
|
|
|
// Note that we keep a live register reference to cp (context) at
|
|
|
|
// this point.
|
|
|
|
|
2010-02-09 10:18:51 +00:00
|
|
|
// Receiver (this) is allocated to a fixed register.
|
|
|
|
if (info()->has_this_properties()) {
|
|
|
|
Comment cmnt(masm(), ";; MapCheck(this)");
|
|
|
|
if (FLAG_print_ir) {
|
|
|
|
PrintF("MapCheck(this)\n");
|
|
|
|
}
|
|
|
|
ASSERT(info()->has_receiver() && info()->receiver()->IsHeapObject());
|
|
|
|
Handle<HeapObject> object = Handle<HeapObject>::cast(info()->receiver());
|
|
|
|
Handle<Map> map(object->map());
|
|
|
|
EmitLoadReceiver();
|
|
|
|
__ CheckMap(receiver_reg(), scratch0(), map, bailout(), false);
|
|
|
|
}
|
2010-02-05 13:57:18 +00:00
|
|
|
|
2010-02-09 10:18:51 +00:00
|
|
|
// If there is a global variable access check if the global object is the
|
|
|
|
// same as at lazy-compilation time.
|
|
|
|
if (info()->has_globals()) {
|
|
|
|
Comment cmnt(masm(), ";; MapCheck(GLOBAL)");
|
|
|
|
if (FLAG_print_ir) {
|
|
|
|
PrintF("MapCheck(GLOBAL)\n");
|
|
|
|
}
|
|
|
|
ASSERT(info()->has_global_object());
|
|
|
|
Handle<Map> map(info()->global_object()->map());
|
|
|
|
__ ldr(scratch0(), CodeGenerator::GlobalObject());
|
|
|
|
__ CheckMap(scratch0(), scratch1(), map, bailout(), true);
|
|
|
|
}
|
2010-02-01 17:01:58 +00:00
|
|
|
|
2010-02-03 16:12:55 +00:00
|
|
|
VisitStatements(function()->body());
|
2010-02-01 17:01:58 +00:00
|
|
|
|
|
|
|
Comment return_cmnt(masm(), ";; Return(<undefined>)");
|
2010-02-09 10:18:51 +00:00
|
|
|
if (FLAG_print_ir) {
|
|
|
|
PrintF("Return(<undefined>)\n");
|
|
|
|
}
|
2010-02-01 17:01:58 +00:00
|
|
|
__ LoadRoot(r0, Heap::kUndefinedValueRootIndex);
|
|
|
|
__ mov(sp, fp);
|
|
|
|
__ ldm(ia_w, sp, fp.bit() | lr.bit());
|
2010-02-03 16:12:55 +00:00
|
|
|
int32_t sp_delta = (scope()->num_parameters() + 1) * kPointerSize;
|
2010-02-01 17:01:58 +00:00
|
|
|
__ add(sp, sp, Operand(sp_delta));
|
|
|
|
__ Jump(lr);
|
|
|
|
|
|
|
|
__ bind(&bailout_);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#undef __
|
|
|
|
|
|
|
|
|
|
|
|
} } // namespace v8::internal
|