Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
// 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 "fast-codegen.h"
|
2009-10-22 10:07:45 +00:00
|
|
|
#include "parser.h"
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
|
|
#define __ ACCESS_MASM(masm_)
|
|
|
|
|
|
|
|
|
|
// Generate code for a JS function. On entry to the function the receiver
|
|
|
|
|
// and arguments have been pushed on the stack left to right. The actual
|
|
|
|
|
// argument count matches the formal parameter count expected by the
|
|
|
|
|
// function.
|
|
|
|
|
//
|
|
|
|
|
// The live registers are:
|
|
|
|
|
// o r1: the JS function object being called (ie, ourselves)
|
|
|
|
|
// o cp: our context
|
|
|
|
|
// o fp: our caller's frame pointer
|
|
|
|
|
// o sp: stack pointer
|
|
|
|
|
// o lr: return address
|
|
|
|
|
//
|
|
|
|
|
// The function builds a JS frame. Please see JavaScriptFrameConstants in
|
|
|
|
|
// frames-arm.h for its layout.
|
|
|
|
|
void FastCodeGenerator::Generate(FunctionLiteral* fun) {
|
|
|
|
|
function_ = fun;
|
2009-10-15 15:27:37 +00:00
|
|
|
// ARM does NOT call SetFunctionPosition.
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
|
|
|
|
|
__ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit());
|
|
|
|
|
// Adjust fp to point to caller's fp.
|
|
|
|
|
__ add(fp, sp, Operand(2 * kPointerSize));
|
|
|
|
|
|
|
|
|
|
{ Comment cmnt(masm_, "[ Allocate locals");
|
|
|
|
|
int locals_count = fun->scope()->num_stack_slots();
|
|
|
|
|
if (locals_count > 0) {
|
|
|
|
|
__ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
|
|
|
|
|
}
|
2009-10-27 14:56:50 +00:00
|
|
|
__ LoadRoot(r2, Heap::kStackLimitRootIndex);
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
for (int i = 0; i < locals_count; i++) {
|
|
|
|
|
__ push(ip);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-27 14:56:50 +00:00
|
|
|
// Check the stack for overflow or 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.
|
|
|
|
|
Comment cmnt(masm_, "[ Stack check");
|
|
|
|
|
__ add(lr, pc, Operand(Assembler::kInstrSize));
|
|
|
|
|
__ cmp(sp, Operand(r2));
|
|
|
|
|
StackCheckStub stub;
|
|
|
|
|
__ mov(pc,
|
|
|
|
|
Operand(reinterpret_cast<intptr_t>(stub.GetCode().location()),
|
|
|
|
|
RelocInfo::CODE_TARGET),
|
|
|
|
|
LeaveCC,
|
|
|
|
|
lo);
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
{ Comment cmnt(masm_, "[ Declarations");
|
|
|
|
|
VisitDeclarations(fun->scope()->declarations());
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-22 11:21:29 +00:00
|
|
|
if (FLAG_trace) {
|
|
|
|
|
__ CallRuntime(Runtime::kTraceEnter, 0);
|
|
|
|
|
}
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
{ Comment cmnt(masm_, "[ Body");
|
|
|
|
|
VisitStatements(fun->body());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
{ Comment cmnt(masm_, "[ return <undefined>;");
|
|
|
|
|
// Emit a 'return undefined' in case control fell off the end of the
|
|
|
|
|
// body.
|
|
|
|
|
__ LoadRoot(r0, Heap::kUndefinedValueRootIndex);
|
2009-10-15 15:27:37 +00:00
|
|
|
SetReturnPosition(fun);
|
2009-10-22 11:21:29 +00:00
|
|
|
if (FLAG_trace) {
|
|
|
|
|
// Push the return value on the stack as the parameter.
|
|
|
|
|
// Runtime::TraceExit returns its parameter in r0.
|
|
|
|
|
__ push(r0);
|
|
|
|
|
__ CallRuntime(Runtime::kTraceExit, 1);
|
|
|
|
|
}
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
__ RecordJSReturn();
|
|
|
|
|
__ mov(sp, fp);
|
|
|
|
|
__ ldm(ia_w, sp, fp.bit() | lr.bit());
|
|
|
|
|
int num_parameters = function_->scope()->num_parameters();
|
|
|
|
|
__ add(sp, sp, Operand((num_parameters + 1) * kPointerSize));
|
|
|
|
|
__ Jump(lr);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-27 13:38:57 +00:00
|
|
|
void FastCodeGenerator::Move(Location destination, Slot* source) {
|
|
|
|
|
switch (destination.type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
__ ldr(ip, MemOperand(fp, SlotOffset(source)));
|
|
|
|
|
__ push(ip);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::Move(Location destination, Literal* expr) {
|
|
|
|
|
switch (destination.type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
__ mov(ip, Operand(expr->handle()));
|
|
|
|
|
__ push(ip);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::Move(Slot* destination, Location source) {
|
|
|
|
|
switch (source.type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED: // Fall through.
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
UNREACHABLE();
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
__ pop(ip);
|
|
|
|
|
__ str(ip, MemOperand(fp, SlotOffset(destination)));
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-28 09:56:14 +00:00
|
|
|
void FastCodeGenerator::DropAndMove(Location destination, Register source) {
|
|
|
|
|
switch (destination.type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-28 09:56:14 +00:00
|
|
|
__ pop();
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-28 09:56:14 +00:00
|
|
|
__ str(source, MemOperand(sp));
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
void FastCodeGenerator::DeclareGlobals(Handle<FixedArray> pairs) {
|
|
|
|
|
// Call the runtime to declare the globals.
|
2009-10-22 10:07:45 +00:00
|
|
|
// The context is the first argument.
|
|
|
|
|
__ mov(r1, Operand(pairs));
|
2009-10-21 09:17:39 +00:00
|
|
|
__ mov(r0, Operand(Smi::FromInt(is_eval_ ? 1 : 0)));
|
2009-10-22 10:07:45 +00:00
|
|
|
__ stm(db_w, sp, cp.bit() | r1.bit() | r0.bit());
|
2009-10-21 09:17:39 +00:00
|
|
|
__ CallRuntime(Runtime::kDeclareGlobals, 3);
|
|
|
|
|
// Return value is ignored.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
void FastCodeGenerator::VisitReturnStatement(ReturnStatement* stmt) {
|
|
|
|
|
Comment cmnt(masm_, "[ ReturnStatement");
|
2009-10-15 15:27:37 +00:00
|
|
|
SetStatementPosition(stmt);
|
2009-10-19 10:36:42 +00:00
|
|
|
Expression* expr = stmt->expression();
|
2009-10-27 08:48:01 +00:00
|
|
|
// Complete the statement based on the type of the subexpression.
|
|
|
|
|
if (expr->AsLiteral() != NULL) {
|
2009-10-19 10:36:42 +00:00
|
|
|
__ mov(r0, Operand(expr->AsLiteral()->handle()));
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
|
|
|
|
Visit(expr);
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(r0, expr->location());
|
2009-10-19 10:36:42 +00:00
|
|
|
}
|
2009-10-22 11:21:29 +00:00
|
|
|
|
|
|
|
|
if (FLAG_trace) {
|
|
|
|
|
__ push(r0);
|
|
|
|
|
__ CallRuntime(Runtime::kTraceExit, 1);
|
|
|
|
|
}
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
__ RecordJSReturn();
|
|
|
|
|
__ mov(sp, fp);
|
|
|
|
|
__ ldm(ia_w, sp, fp.bit() | lr.bit());
|
2009-10-22 10:07:45 +00:00
|
|
|
int num_parameters = function_->scope()->num_parameters();
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
__ add(sp, sp, Operand((num_parameters + 1) * kPointerSize));
|
|
|
|
|
__ Jump(lr);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
void FastCodeGenerator::VisitFunctionLiteral(FunctionLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ FunctionLiteral");
|
|
|
|
|
|
|
|
|
|
// Build the function boilerplate and instantiate it.
|
|
|
|
|
Handle<JSFunction> boilerplate = BuildBoilerplate(expr);
|
|
|
|
|
if (HasStackOverflow()) return;
|
|
|
|
|
|
|
|
|
|
ASSERT(boilerplate->IsBoilerplate());
|
|
|
|
|
|
|
|
|
|
// Create a new closure.
|
|
|
|
|
__ mov(r0, Operand(boilerplate));
|
2009-10-22 10:07:45 +00:00
|
|
|
__ stm(db_w, sp, cp.bit() | r0.bit());
|
2009-10-21 09:17:39 +00:00
|
|
|
__ CallRuntime(Runtime::kNewClosure, 2);
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(expr->location(), r0);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-16 09:46:09 +00:00
|
|
|
void FastCodeGenerator::VisitVariableProxy(VariableProxy* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ VariableProxy");
|
|
|
|
|
Expression* rewrite = expr->var()->rewrite();
|
2009-10-21 09:38:21 +00:00
|
|
|
if (rewrite == NULL) {
|
|
|
|
|
Comment cmnt(masm_, "Global variable");
|
|
|
|
|
// Use inline caching. Variable name is passed in r2 and the global
|
|
|
|
|
// object on the stack.
|
|
|
|
|
__ ldr(ip, CodeGenerator::GlobalObject());
|
|
|
|
|
__ push(ip);
|
|
|
|
|
__ mov(r2, Operand(expr->name()));
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::LoadIC_Initialize));
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET_CONTEXT);
|
2009-10-28 09:56:14 +00:00
|
|
|
DropAndMove(expr->location(), r0);
|
2009-10-21 09:38:21 +00:00
|
|
|
} else {
|
|
|
|
|
Comment cmnt(masm_, "Stack slot");
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(expr->location(), rewrite->AsSlot());
|
2009-10-27 08:48:01 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-29 10:35:29 +00:00
|
|
|
void FastCodeGenerator::VisitRegExpLiteral(RegExpLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ RegExp Literal");
|
|
|
|
|
Label done;
|
|
|
|
|
// Registers will be used as follows:
|
|
|
|
|
// r4 = JS function, literals array
|
|
|
|
|
// r3 = literal index
|
|
|
|
|
// r2 = RegExp pattern
|
|
|
|
|
// r1 = RegExp flags
|
|
|
|
|
// r0 = temp + return value (RegExp literal)
|
|
|
|
|
__ ldr(r0, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
__ ldr(r4, FieldMemOperand(r0, JSFunction::kLiteralsOffset));
|
|
|
|
|
int literal_offset =
|
|
|
|
|
FixedArray::kHeaderSize + expr->literal_index() * kPointerSize;
|
|
|
|
|
__ ldr(r0, FieldMemOperand(r4, literal_offset));
|
|
|
|
|
__ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
|
|
|
|
|
__ cmp(r0, ip);
|
|
|
|
|
__ b(ne, &done);
|
|
|
|
|
__ mov(r3, Operand(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
__ mov(r2, Operand(expr->pattern()));
|
|
|
|
|
__ mov(r1, Operand(expr->flags()));
|
|
|
|
|
__ stm(db_w, sp, r4.bit() | r3.bit() | r2.bit() | r1.bit());
|
|
|
|
|
__ CallRuntime(Runtime::kMaterializeRegExpLiteral, 4);
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
Move(expr->location(), r0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-26 13:21:48 +00:00
|
|
|
void FastCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ ObjectLiteral");
|
|
|
|
|
Label boilerplate_exists;
|
|
|
|
|
__ ldr(r2, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
// r2 = literal array (0).
|
|
|
|
|
__ ldr(r2, FieldMemOperand(r2, JSFunction::kLiteralsOffset));
|
|
|
|
|
int literal_offset =
|
|
|
|
|
FixedArray::kHeaderSize + expr->literal_index() * kPointerSize;
|
|
|
|
|
__ ldr(r0, FieldMemOperand(r2, literal_offset));
|
|
|
|
|
// Check whether we need to materialize the object literal boilerplate.
|
|
|
|
|
__ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
|
|
|
|
|
__ cmp(r0, Operand(ip));
|
|
|
|
|
__ b(ne, &boilerplate_exists);
|
|
|
|
|
// Create boilerplate if it does not exist.
|
|
|
|
|
// r1 = literal index (1).
|
|
|
|
|
__ mov(r1, Operand(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
// r0 = constant properties (2).
|
|
|
|
|
__ mov(r0, Operand(expr->constant_properties()));
|
|
|
|
|
__ stm(db_w, sp, r2.bit() | r1.bit() | r0.bit());
|
|
|
|
|
__ CallRuntime(Runtime::kCreateObjectLiteralBoilerplate, 3);
|
|
|
|
|
__ bind(&boilerplate_exists);
|
|
|
|
|
// r0 contains boilerplate.
|
|
|
|
|
// Clone boilerplate.
|
|
|
|
|
__ push(r0);
|
|
|
|
|
if (expr->depth() > 1) {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneLiteralBoilerplate, 1);
|
|
|
|
|
} else {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneShallowLiteralBoilerplate, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If result_saved == true: the result is saved on top of the stack.
|
|
|
|
|
// If result_saved == false: the result is in eax.
|
|
|
|
|
bool result_saved = false;
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < expr->properties()->length(); i++) {
|
|
|
|
|
ObjectLiteral::Property* property = expr->properties()->at(i);
|
2009-10-28 13:25:40 +00:00
|
|
|
if (property->IsCompileTimeValue()) continue;
|
|
|
|
|
|
2009-10-26 13:21:48 +00:00
|
|
|
Literal* key = property->key();
|
|
|
|
|
Expression* value = property->value();
|
|
|
|
|
if (!result_saved) {
|
|
|
|
|
__ push(r0); // Save result on stack
|
|
|
|
|
result_saved = true;
|
|
|
|
|
}
|
|
|
|
|
switch (property->kind()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case ObjectLiteral::Property::CONSTANT:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
|
|
|
|
|
case ObjectLiteral::Property::MATERIALIZED_LITERAL: // Fall through.
|
2009-10-26 13:21:48 +00:00
|
|
|
ASSERT(!CompileTimeValue::IsCompileTimeValue(property->value()));
|
2009-10-29 10:35:29 +00:00
|
|
|
case ObjectLiteral::Property::COMPUTED:
|
|
|
|
|
if (key->handle()->IsSymbol()) {
|
|
|
|
|
Visit(value);
|
|
|
|
|
Move(r0, value->location());
|
|
|
|
|
__ mov(r2, Operand(key->handle()));
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::StoreIC_Initialize));
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// StoreIC leaves the receiver on the stack.
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
// Fall through.
|
|
|
|
|
|
2009-10-26 13:21:48 +00:00
|
|
|
case ObjectLiteral::Property::PROTOTYPE:
|
|
|
|
|
__ push(r0);
|
|
|
|
|
Visit(key);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(key->location().is_value());
|
2009-10-26 13:21:48 +00:00
|
|
|
Visit(value);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(value->location().is_value());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ CallRuntime(Runtime::kSetProperty, 3);
|
|
|
|
|
__ ldr(r0, MemOperand(sp)); // Restore result into r0
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
|
|
|
|
|
case ObjectLiteral::Property::GETTER: // Fall through.
|
|
|
|
|
case ObjectLiteral::Property::SETTER:
|
2009-10-26 13:21:48 +00:00
|
|
|
__ push(r0);
|
|
|
|
|
Visit(key);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(key->location().is_value());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ mov(r1, Operand(property->kind() == ObjectLiteral::Property::SETTER ?
|
|
|
|
|
Smi::FromInt(1) :
|
|
|
|
|
Smi::FromInt(0)));
|
|
|
|
|
__ push(r1);
|
|
|
|
|
Visit(value);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(value->location().is_value());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ CallRuntime(Runtime::kDefineAccessor, 4);
|
|
|
|
|
__ ldr(r0, MemOperand(sp)); // Restore result into r0
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2009-10-27 13:38:57 +00:00
|
|
|
switch (expr->location().type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (result_saved) __ pop();
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (!result_saved) __ push(r0);
|
|
|
|
|
break;
|
2009-10-26 13:21:48 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-22 10:07:45 +00:00
|
|
|
void FastCodeGenerator::VisitArrayLiteral(ArrayLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ ArrayLiteral");
|
|
|
|
|
Label make_clone;
|
|
|
|
|
|
|
|
|
|
// Fetch the function's literals array.
|
|
|
|
|
__ ldr(r3, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
__ ldr(r3, FieldMemOperand(r3, JSFunction::kLiteralsOffset));
|
|
|
|
|
// Check if the literal's boilerplate has been instantiated.
|
|
|
|
|
int offset =
|
|
|
|
|
FixedArray::kHeaderSize + (expr->literal_index() * kPointerSize);
|
|
|
|
|
__ ldr(r0, FieldMemOperand(r3, offset));
|
|
|
|
|
__ LoadRoot(ip, Heap::kUndefinedValueRootIndex);
|
|
|
|
|
__ cmp(r0, ip);
|
|
|
|
|
__ b(&make_clone, ne);
|
|
|
|
|
|
|
|
|
|
// Instantiate the boilerplate.
|
|
|
|
|
__ mov(r2, Operand(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
__ mov(r1, Operand(expr->literals()));
|
|
|
|
|
__ stm(db_w, sp, r3.bit() | r2.bit() | r1.bit());
|
|
|
|
|
__ CallRuntime(Runtime::kCreateArrayLiteralBoilerplate, 3);
|
|
|
|
|
|
|
|
|
|
__ bind(&make_clone);
|
|
|
|
|
// Clone the boilerplate.
|
|
|
|
|
__ push(r0);
|
|
|
|
|
if (expr->depth() > 1) {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneLiteralBoilerplate, 1);
|
|
|
|
|
} else {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneShallowLiteralBoilerplate, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool result_saved = false; // Is the result saved to the stack?
|
|
|
|
|
|
|
|
|
|
// Emit code to evaluate all the non-constant subexpressions and to store
|
|
|
|
|
// them into the newly cloned array.
|
|
|
|
|
ZoneList<Expression*>* subexprs = expr->values();
|
|
|
|
|
for (int i = 0, len = subexprs->length(); i < len; i++) {
|
|
|
|
|
Expression* subexpr = subexprs->at(i);
|
|
|
|
|
// If the subexpression is a literal or a simple materialized literal it
|
|
|
|
|
// is already set in the cloned array.
|
|
|
|
|
if (subexpr->AsLiteral() != NULL ||
|
|
|
|
|
CompileTimeValue::IsCompileTimeValue(subexpr)) {
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!result_saved) {
|
|
|
|
|
__ push(r0);
|
|
|
|
|
result_saved = true;
|
|
|
|
|
}
|
|
|
|
|
Visit(subexpr);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(subexpr->location().is_value());
|
2009-10-22 10:07:45 +00:00
|
|
|
|
|
|
|
|
// Store the subexpression value in the array's elements.
|
|
|
|
|
__ pop(r0); // Subexpression value.
|
|
|
|
|
__ ldr(r1, MemOperand(sp)); // Copy of array literal.
|
|
|
|
|
__ ldr(r1, FieldMemOperand(r1, JSObject::kElementsOffset));
|
|
|
|
|
int offset = FixedArray::kHeaderSize + (i * kPointerSize);
|
|
|
|
|
__ str(r0, FieldMemOperand(r1, offset));
|
|
|
|
|
|
|
|
|
|
// Update the write barrier for the array store with r0 as the scratch
|
|
|
|
|
// register.
|
|
|
|
|
__ mov(r2, Operand(offset));
|
|
|
|
|
__ RecordWrite(r1, r2, r0);
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-27 13:38:57 +00:00
|
|
|
switch (expr->location().type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (result_saved) __ pop();
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (!result_saved) __ push(r0);
|
|
|
|
|
break;
|
2009-10-22 10:07:45 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
void FastCodeGenerator::VisitAssignment(Assignment* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ Assignment");
|
|
|
|
|
ASSERT(expr->op() == Token::ASSIGN || expr->op() == Token::INIT_VAR);
|
|
|
|
|
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
// Left-hand side can only be a global or a (parameter or local) slot.
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
Variable* var = expr->target()->AsVariableProxy()->AsVariable();
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
ASSERT(var != NULL);
|
|
|
|
|
ASSERT(var->is_global() || var->slot() != NULL);
|
Added first support for tracking locations of expressions in the
fast-mode code generator.
AST expression nodes are annotated with a location when doing the
initial syntactic check of the AST. In the current implementation,
expression locations are 'temporary' (ie, allocated to the stack) or
'nowhere' (ie, the expression's value is not needed though it must be
evaluated for side effects).
For the assignment '.result = true' on IA32, we had before (with the
true value already on top of the stack):
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
Now:
32 pop [ebp+0xf4]
======== On x64, before:
37 movq rax,[rsp]
41 movq [rbp-0x18],rax
45 pop rax
Now:
37 pop [rbp-0x18]
======== On ARM, before (with the true value in register ip):
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
Now:
36 str ip, [fp, #-12]
Review URL: http://codereview.chromium.org/267118
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3076 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 16:42:22 +00:00
|
|
|
|
2009-10-27 08:48:01 +00:00
|
|
|
Expression* rhs = expr->value();
|
2009-10-19 10:36:42 +00:00
|
|
|
Location destination = expr->location();
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
if (var->is_global()) {
|
|
|
|
|
// Assignment to a global variable, use inline caching. Right-hand-side
|
|
|
|
|
// value is passed in r0, variable name in r2, and the global object on
|
|
|
|
|
// the stack.
|
2009-10-27 08:48:01 +00:00
|
|
|
|
|
|
|
|
// Code for the right-hand-side expression depends on its type.
|
|
|
|
|
if (rhs->AsLiteral() != NULL) {
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
__ mov(r0, Operand(rhs->AsLiteral()->handle()));
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(rhs->location().is_value());
|
2009-10-27 08:48:01 +00:00
|
|
|
Visit(rhs);
|
|
|
|
|
__ pop(r0);
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
}
|
|
|
|
|
__ mov(r2, Operand(var->name()));
|
|
|
|
|
__ ldr(ip, CodeGenerator::GlobalObject());
|
|
|
|
|
__ push(ip);
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::StoreIC_Initialize));
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// Overwrite the global object on the stack with the result if needed.
|
2009-10-28 09:56:14 +00:00
|
|
|
DropAndMove(expr->location(), r0);
|
Added first support for tracking locations of expressions in the
fast-mode code generator.
AST expression nodes are annotated with a location when doing the
initial syntactic check of the AST. In the current implementation,
expression locations are 'temporary' (ie, allocated to the stack) or
'nowhere' (ie, the expression's value is not needed though it must be
evaluated for side effects).
For the assignment '.result = true' on IA32, we had before (with the
true value already on top of the stack):
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
Now:
32 pop [ebp+0xf4]
======== On x64, before:
37 movq rax,[rsp]
41 movq [rbp-0x18],rax
45 pop rax
Now:
37 pop [rbp-0x18]
======== On ARM, before (with the true value in register ip):
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
Now:
36 str ip, [fp, #-12]
Review URL: http://codereview.chromium.org/267118
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3076 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 16:42:22 +00:00
|
|
|
} else {
|
2009-10-27 08:48:01 +00:00
|
|
|
// Local or parameter assignment.
|
|
|
|
|
|
|
|
|
|
// Code for the right-hand side expression depends on its type.
|
|
|
|
|
if (rhs->AsLiteral() != NULL) {
|
|
|
|
|
// Two cases: 'temp <- (var = constant)', or 'var = constant' with a
|
|
|
|
|
// discarded result. Always perform the assignment.
|
|
|
|
|
__ mov(ip, Operand(rhs->AsLiteral()->handle()));
|
|
|
|
|
__ str(ip, MemOperand(fp, SlotOffset(var->slot())));
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(expr->location(), ip);
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(rhs->location().is_value());
|
2009-10-27 08:48:01 +00:00
|
|
|
Visit(rhs);
|
2009-10-27 13:38:57 +00:00
|
|
|
// Load right-hand side into ip.
|
|
|
|
|
switch (expr->location().type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::EFFECT:
|
2009-10-27 13:38:57 +00:00
|
|
|
// Case 'var = temp'. Discard right-hand-side temporary.
|
|
|
|
|
__ pop(ip);
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::VALUE:
|
2009-10-27 13:38:57 +00:00
|
|
|
// Case 'temp1 <- (var = temp0)'. Preserve right-hand-side
|
|
|
|
|
// temporary on the stack.
|
|
|
|
|
__ ldr(ip, MemOperand(sp));
|
|
|
|
|
break;
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
}
|
2009-10-27 13:38:57 +00:00
|
|
|
// Do the slot assignment.
|
Added support for assignments to global variables in the toplevel code
generator. We use the normal store IC mechanism with the global
object as the receiver. The following code is generated for 'x=true'
at toplevel.
======== IA32:
27 mov eax,0xf5d06161 ;; object: 0xf5d06161 <true>
32 mov ecx,0xf5d09c35 ;; object: 0xf5d09c35 <String[1]: x>
37 push [esi+0x17]
40 call StoreIC_Initialize (0xf5ce75c0) ;; code: STORE_IC, UNINITIALIZED
45 mov [esp],eax
======== X64:
25 movq rax,0x7f867a7b6199 ;; object: 0x7f867a7b6199 <true>
35 movq rcx,0x7f867a7bae71 ;; object: 0x7f867a7bae71 <String[1]: x>
45 push [rsi+0x2f]
49 call StoreIC_Initialize (0x7f8655929ac0) ;; code: STORE_IC, UNINITIALIZED
54 movq [rsp],rax
======== ARM:
32 e59f0054 ldr r0, [pc, #+84] ;; object: 0xf5b78161 <true>
36 e59f2054 ldr r2, [pc, #+84] ;; object: 0xf5b7bc35 <String[1]: x>
40 e598c017 ldr ip, [r8, #+23]
44 e52dc004 str ip, [sp, #-4]!
48 e1a0e00f mov lr, pc
52 e59ff048 ldr pc, [pc, #+72] ;; debug: statement 0
;; code: STORE_IC, UNINITIALIZED
56 e58d0000 str r0, [sp, #+0]
Review URL: http://codereview.chromium.org/305005
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3095 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-20 13:37:26 +00:00
|
|
|
__ str(ip, MemOperand(fp, SlotOffset(var->slot())));
|
2009-10-19 10:36:42 +00:00
|
|
|
}
|
Added first support for tracking locations of expressions in the
fast-mode code generator.
AST expression nodes are annotated with a location when doing the
initial syntactic check of the AST. In the current implementation,
expression locations are 'temporary' (ie, allocated to the stack) or
'nowhere' (ie, the expression's value is not needed though it must be
evaluated for side effects).
For the assignment '.result = true' on IA32, we had before (with the
true value already on top of the stack):
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
Now:
32 pop [ebp+0xf4]
======== On x64, before:
37 movq rax,[rsp]
41 movq [rbp-0x18],rax
45 pop rax
Now:
37 pop [rbp-0x18]
======== On ARM, before (with the true value in register ip):
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
Now:
36 str ip, [fp, #-12]
Review URL: http://codereview.chromium.org/267118
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3076 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 16:42:22 +00:00
|
|
|
}
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-27 16:11:12 +00:00
|
|
|
void FastCodeGenerator::VisitProperty(Property* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ Property");
|
|
|
|
|
Expression* key = expr->key();
|
|
|
|
|
uint32_t dummy;
|
|
|
|
|
|
2009-10-28 10:14:32 +00:00
|
|
|
// Record the source position for the property load.
|
|
|
|
|
SetSourcePosition(expr->position());
|
|
|
|
|
|
2009-10-27 16:11:12 +00:00
|
|
|
// Evaluate receiver.
|
|
|
|
|
Visit(expr->obj());
|
|
|
|
|
|
|
|
|
|
if (key->AsLiteral() != NULL && key->AsLiteral()->handle()->IsSymbol() &&
|
|
|
|
|
!String::cast(*(key->AsLiteral()->handle()))->AsArrayIndex(&dummy)) {
|
|
|
|
|
// Do a NAMED property load.
|
|
|
|
|
// The IC expects the property name in ecx and the receiver on the stack.
|
|
|
|
|
__ mov(r2, Operand(key->AsLiteral()->handle()));
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::LoadIC_Initialize));
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// By emitting a nop we make sure that we do not have a "test eax,..."
|
|
|
|
|
// instruction after the call it is treated specially by the LoadIC code.
|
|
|
|
|
__ nop();
|
|
|
|
|
} else {
|
|
|
|
|
// Do a KEYED property load.
|
|
|
|
|
Visit(expr->key());
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::KeyedLoadIC_Initialize));
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// By emitting a nop we make sure that we do not have a "test eax,..."
|
|
|
|
|
// instruction after the call it is treated specially by the LoadIC code.
|
|
|
|
|
__ nop();
|
|
|
|
|
// Drop key and receiver left on the stack by IC.
|
|
|
|
|
__ pop();
|
|
|
|
|
}
|
|
|
|
|
switch (expr->location().type()) {
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::UNINITIALIZED:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Location::VALUE:
|
2009-10-27 16:11:12 +00:00
|
|
|
__ str(r0, MemOperand(sp));
|
|
|
|
|
break;
|
2009-10-29 10:35:29 +00:00
|
|
|
case Location::EFFECT:
|
2009-10-27 16:11:12 +00:00
|
|
|
__ pop();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
void FastCodeGenerator::VisitCall(Call* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ Call");
|
|
|
|
|
Expression* fun = expr->expression();
|
|
|
|
|
ZoneList<Expression*>* args = expr->arguments();
|
|
|
|
|
Variable* var = fun->AsVariableProxy()->AsVariable();
|
|
|
|
|
ASSERT(var != NULL && !var->is_this() && var->is_global());
|
|
|
|
|
ASSERT(!var->is_possibly_eval());
|
|
|
|
|
|
2009-10-22 10:07:45 +00:00
|
|
|
__ mov(r1, Operand(var->name()));
|
|
|
|
|
// Push global object as receiver.
|
2009-10-21 09:17:39 +00:00
|
|
|
__ ldr(r0, CodeGenerator::GlobalObject());
|
2009-10-22 10:07:45 +00:00
|
|
|
__ stm(db_w, sp, r1.bit() | r0.bit());
|
2009-10-21 09:17:39 +00:00
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(args->at(i)->location().is_value());
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
// Record source position for debugger
|
|
|
|
|
SetSourcePosition(expr->position());
|
|
|
|
|
// Call the IC initialization code.
|
|
|
|
|
Handle<Code> ic = CodeGenerator::ComputeCallInitialize(arg_count,
|
|
|
|
|
NOT_IN_LOOP);
|
|
|
|
|
__ Call(ic, RelocInfo::CODE_TARGET_CONTEXT);
|
|
|
|
|
// Restore context register.
|
|
|
|
|
__ ldr(cp, MemOperand(fp, StandardFrameConstants::kContextOffset));
|
2009-10-28 09:56:14 +00:00
|
|
|
DropAndMove(expr->location(), r0);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-27 14:52:55 +00:00
|
|
|
void FastCodeGenerator::VisitCallNew(CallNew* node) {
|
|
|
|
|
Comment cmnt(masm_, "[ CallNew");
|
|
|
|
|
// According to ECMA-262, section 11.2.2, page 44, the function
|
|
|
|
|
// expression in new calls must be evaluated before the
|
|
|
|
|
// arguments.
|
|
|
|
|
// Push function on the stack.
|
|
|
|
|
Visit(node->expression());
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(node->expression()->location().is_value());
|
2009-10-27 14:52:55 +00:00
|
|
|
|
|
|
|
|
// Push global object (receiver).
|
|
|
|
|
__ ldr(r0, CodeGenerator::GlobalObject());
|
|
|
|
|
__ push(r0);
|
|
|
|
|
// Push the arguments ("left-to-right") on the stack.
|
|
|
|
|
ZoneList<Expression*>* args = node->arguments();
|
|
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(args->at(i)->location().is_value());
|
2009-10-27 14:52:55 +00:00
|
|
|
// If location is temporary, it is already on the stack,
|
|
|
|
|
// so nothing to do here.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Call the construct call builtin that handles allocation and
|
|
|
|
|
// constructor invocation.
|
|
|
|
|
SetSourcePosition(node->position());
|
|
|
|
|
|
|
|
|
|
// Load function, arg_count into r1 and r0.
|
|
|
|
|
__ mov(r0, Operand(arg_count));
|
|
|
|
|
// Function is in esp[arg_count + 1].
|
|
|
|
|
__ ldr(r1, MemOperand(sp, (arg_count + 1) * kPointerSize));
|
|
|
|
|
|
|
|
|
|
Handle<Code> construct_builtin(Builtins::builtin(Builtins::JSConstructCall));
|
|
|
|
|
__ Call(construct_builtin, RelocInfo::CONSTRUCT_CALL);
|
|
|
|
|
|
|
|
|
|
// Replace function on TOS with result in r0, or pop it.
|
2009-10-28 09:56:14 +00:00
|
|
|
DropAndMove(node->location(), r0);
|
2009-10-27 14:52:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
void FastCodeGenerator::VisitCallRuntime(CallRuntime* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ CallRuntime");
|
|
|
|
|
ZoneList<Expression*>* args = expr->arguments();
|
|
|
|
|
Runtime::Function* function = expr->function();
|
|
|
|
|
|
|
|
|
|
ASSERT(function != NULL);
|
|
|
|
|
|
|
|
|
|
// Push the arguments ("left-to-right").
|
|
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(args->at(i)->location().is_value());
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
__ CallRuntime(function, arg_count);
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(expr->location(), r0);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-23 10:42:14 +00:00
|
|
|
void FastCodeGenerator::VisitBinaryOperation(BinaryOperation* expr) {
|
|
|
|
|
// Compile a short-circuited boolean or operation in a non-test
|
|
|
|
|
// context.
|
|
|
|
|
ASSERT(expr->op() == Token::OR);
|
|
|
|
|
// Compile (e0 || e1) as if it were
|
|
|
|
|
// (let (temp = e0) temp ? temp : e1).
|
|
|
|
|
|
|
|
|
|
Label done;
|
|
|
|
|
Location destination = expr->location();
|
|
|
|
|
Expression* left = expr->left();
|
|
|
|
|
Expression* right = expr->right();
|
|
|
|
|
|
|
|
|
|
// Call the runtime to find the boolean value of the left-hand
|
|
|
|
|
// subexpression. Duplicate the value if it may be needed as the final
|
|
|
|
|
// result.
|
2009-10-27 08:48:01 +00:00
|
|
|
if (left->AsLiteral() != NULL) {
|
|
|
|
|
__ mov(r0, Operand(left->AsLiteral()->handle()));
|
|
|
|
|
__ push(r0);
|
2009-10-29 10:35:29 +00:00
|
|
|
if (destination.is_value()) __ push(r0);
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
|
|
|
|
Visit(left);
|
2009-10-29 10:35:29 +00:00
|
|
|
ASSERT(left->location().is_value());
|
|
|
|
|
if (destination.is_value()) {
|
2009-10-23 10:42:14 +00:00
|
|
|
__ ldr(r0, MemOperand(sp));
|
|
|
|
|
__ push(r0);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// The left-hand value is in on top of the stack. It is duplicated on the
|
|
|
|
|
// stack iff the destination location is temporary.
|
|
|
|
|
__ CallRuntime(Runtime::kToBool, 1);
|
|
|
|
|
__ LoadRoot(ip, Heap::kTrueValueRootIndex);
|
|
|
|
|
__ cmp(r0, ip);
|
|
|
|
|
__ b(eq, &done);
|
|
|
|
|
|
|
|
|
|
// Discard the left-hand value if present on the stack.
|
2009-10-29 10:35:29 +00:00
|
|
|
if (destination.is_value()) __ pop();
|
2009-10-23 10:42:14 +00:00
|
|
|
// Save or discard the right-hand value as needed.
|
2009-10-27 08:48:01 +00:00
|
|
|
if (right->AsLiteral() != NULL) {
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(destination, right->AsLiteral());
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
|
|
|
|
Visit(right);
|
2009-10-27 13:38:57 +00:00
|
|
|
Move(destination, right->location());
|
2009-10-23 10:42:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
}
|
|
|
|
|
|
Initial port of top-level code generator to ARM. For the constant
true at the top level we generate:
0 stmdb sp!, {r1, r8, fp, lr}
4 add fp, sp, #8
8 ldr ip, [r10, #+4]
12 ldr r2, [r10, #+0]
16 str ip, [sp, #-4]!
20 add lr, pc, #4
24 cmp sp, r2
28 ldrcc pc, [pc, #+68] ;; code: STUB, StackCheck, minor: 0
32 ldr ip, [pc, #+68] ;; object: 0xf5bc4161 <true>
36 str ip, [sp, #-4]!
40 ldr ip, [sp, #+0]
44 str ip, [fp, #-12]
48 add sp, sp, #4
52 ldr ip, [fp, #-12]
56 str ip, [sp, #-4]!
60 ldr r0, [sp], #+4
64 mov sp, fp ;; js return
68 ldmia sp!, {fp, lr}
72 add sp, sp, #4
76 bx lr
80 ldr r0, [r10, #+4]
84 mov sp, fp ;; js return
88 ldmia sp!, {fp, lr}
92 add sp, sp, #4
96 bx lr
100 constant pool begin
104 constant
108 constant
Review URL: http://codereview.chromium.org/264067
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3073 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 12:42:16 +00:00
|
|
|
} } // namespace v8::internal
|
