Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +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"
|
2009-11-04 17:59:24 +00:00
|
|
|
#include "compiler.h"
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
#include "fast-codegen.h"
|
2009-10-22 10:07:45 +00:00
|
|
|
#include "parser.h"
|
2009-11-04 14:33:37 +00:00
|
|
|
#include "debug.h"
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +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, with the
|
|
|
|
|
// return address on top of them. The actual argument count matches the
|
|
|
|
|
// formal parameter count expected by the function.
|
|
|
|
|
//
|
|
|
|
|
// The live registers are:
|
|
|
|
|
// o edi: the JS function object being called (ie, ourselves)
|
|
|
|
|
// o esi: our context
|
|
|
|
|
// o ebp: our caller's frame pointer
|
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
|
|
|
// o esp: stack pointer (pointing to return address)
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
//
|
|
|
|
|
// The function builds a JS frame. Please see JavaScriptFrameConstants in
|
|
|
|
|
// frames-ia32.h for its layout.
|
|
|
|
|
void FastCodeGenerator::Generate(FunctionLiteral* fun) {
|
|
|
|
|
function_ = fun;
|
2009-10-15 15:27:37 +00:00
|
|
|
SetFunctionPosition(fun);
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
|
|
|
|
|
__ push(ebp); // Caller's frame pointer.
|
|
|
|
|
__ mov(ebp, esp);
|
|
|
|
|
__ push(esi); // Callee's context.
|
|
|
|
|
__ push(edi); // Callee's JS Function.
|
|
|
|
|
|
|
|
|
|
{ Comment cmnt(masm_, "[ Allocate locals");
|
|
|
|
|
int locals_count = fun->scope()->num_stack_slots();
|
|
|
|
|
for (int i = 0; i < locals_count; i++) {
|
|
|
|
|
__ push(Immediate(Factory::undefined_value()));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-12 11:38:01 +00:00
|
|
|
bool function_in_register = true;
|
|
|
|
|
|
|
|
|
|
Variable* arguments = fun->scope()->arguments()->AsVariable();
|
|
|
|
|
if (arguments != NULL) {
|
|
|
|
|
// Function uses arguments object.
|
|
|
|
|
Comment cmnt(masm_, "[ Allocate arguments object");
|
|
|
|
|
__ push(edi);
|
|
|
|
|
// Receiver is just before the parameters on the caller's stack.
|
|
|
|
|
__ lea(edx, Operand(ebp, StandardFrameConstants::kCallerSPOffset +
|
|
|
|
|
fun->num_parameters() * kPointerSize));
|
|
|
|
|
__ push(edx);
|
|
|
|
|
__ push(Immediate(Smi::FromInt(fun->num_parameters())));
|
|
|
|
|
// Arguments to ArgumentsAccessStub:
|
|
|
|
|
// function, receiver address, parameter count.
|
|
|
|
|
// The stub will rewrite receiever and parameter count if the previous
|
|
|
|
|
// stack frame was an arguments adapter frame.
|
|
|
|
|
ArgumentsAccessStub stub(ArgumentsAccessStub::NEW_OBJECT);
|
|
|
|
|
__ CallStub(&stub);
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(arguments->slot())), eax);
|
|
|
|
|
Slot* dot_arguments_slot =
|
|
|
|
|
fun->scope()->arguments_shadow()->AsVariable()->slot();
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(dot_arguments_slot)), eax);
|
|
|
|
|
|
|
|
|
|
function_in_register = false;
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-05 10:38:26 +00:00
|
|
|
// Possibly allocate a local context.
|
|
|
|
|
if (fun->scope()->num_heap_slots() > 0) {
|
|
|
|
|
Comment cmnt(masm_, "[ Allocate local context");
|
2009-11-12 11:38:01 +00:00
|
|
|
if (function_in_register) {
|
|
|
|
|
// Argument to NewContext is the function, still in edi.
|
|
|
|
|
__ push(edi);
|
|
|
|
|
} else {
|
|
|
|
|
// Argument to NewContext is the function, no longer in edi.
|
|
|
|
|
__ push(Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
}
|
2009-11-05 10:38:26 +00:00
|
|
|
__ CallRuntime(Runtime::kNewContext, 1);
|
|
|
|
|
// Context is returned in both eax and esi. It replaces the context
|
|
|
|
|
// passed to us. It's saved in the stack and kept live in esi.
|
|
|
|
|
__ mov(Operand(ebp, StandardFrameConstants::kContextOffset), esi);
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
// Assert we do not have to copy any parameters into the context.
|
|
|
|
|
for (int i = 0, len = fun->scope()->num_parameters(); i < len; i++) {
|
|
|
|
|
Slot* slot = fun->scope()->parameter(i)->slot();
|
|
|
|
|
ASSERT(slot != NULL && slot->type() != Slot::CONTEXT);
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-30 10:22:31 +00:00
|
|
|
{ Comment cmnt(masm_, "[ Declarations");
|
|
|
|
|
VisitDeclarations(fun->scope()->declarations());
|
|
|
|
|
}
|
|
|
|
|
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
{ Comment cmnt(masm_, "[ Stack check");
|
|
|
|
|
Label ok;
|
2009-11-05 13:59:40 +00:00
|
|
|
ExternalReference stack_limit =
|
|
|
|
|
ExternalReference::address_of_stack_limit();
|
|
|
|
|
__ cmp(esp, Operand::StaticVariable(stack_limit));
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
__ j(above_equal, &ok, taken);
|
|
|
|
|
StackCheckStub stub;
|
|
|
|
|
__ CallStub(&stub);
|
|
|
|
|
__ bind(&ok);
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-22 11:21:29 +00:00
|
|
|
if (FLAG_trace) {
|
|
|
|
|
__ CallRuntime(Runtime::kTraceEnter, 0);
|
|
|
|
|
}
|
|
|
|
|
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
{ Comment cmnt(masm_, "[ Body");
|
2009-11-03 14:48:59 +00:00
|
|
|
ASSERT(loop_depth() == 0);
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
VisitStatements(fun->body());
|
2009-11-03 14:48:59 +00:00
|
|
|
ASSERT(loop_depth() == 0);
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
{ Comment cmnt(masm_, "[ return <undefined>;");
|
2009-11-04 14:11:39 +00:00
|
|
|
// Emit a 'return undefined' in case control fell off the end of the body.
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
__ mov(eax, Factory::undefined_value());
|
2009-11-04 14:11:39 +00:00
|
|
|
EmitReturnSequence(function_->end_position());
|
2009-10-30 10:22:31 +00:00
|
|
|
}
|
2009-11-04 14:11:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::EmitReturnSequence(int position) {
|
|
|
|
|
Comment cmnt(masm_, "[ Return sequence");
|
|
|
|
|
if (return_label_.is_bound()) {
|
|
|
|
|
__ jmp(&return_label_);
|
|
|
|
|
} else {
|
|
|
|
|
// Common return label
|
|
|
|
|
__ bind(&return_label_);
|
|
|
|
|
if (FLAG_trace) {
|
|
|
|
|
__ push(eax);
|
|
|
|
|
__ CallRuntime(Runtime::kTraceExit, 1);
|
2009-10-22 11:21:29 +00:00
|
|
|
}
|
2009-11-04 14:11:39 +00:00
|
|
|
#ifdef DEBUG
|
|
|
|
|
// Add a label for checking the size of the code used for returning.
|
|
|
|
|
Label check_exit_codesize;
|
|
|
|
|
masm_->bind(&check_exit_codesize);
|
|
|
|
|
#endif
|
|
|
|
|
CodeGenerator::RecordPositions(masm_, position);
|
|
|
|
|
__ RecordJSReturn();
|
|
|
|
|
// Do not use the leave instruction here because it is too short to
|
|
|
|
|
// patch with the code required by the debugger.
|
|
|
|
|
__ mov(esp, ebp);
|
|
|
|
|
__ pop(ebp);
|
|
|
|
|
__ ret((function_->scope()->num_parameters() + 1) * kPointerSize);
|
|
|
|
|
#ifdef ENABLE_DEBUGGER_SUPPORT
|
|
|
|
|
// Check that the size of the code used for returning matches what is
|
|
|
|
|
// expected by the debugger.
|
|
|
|
|
ASSERT_EQ(Debug::kIa32JSReturnSequenceLength,
|
|
|
|
|
masm_->SizeOfCodeGeneratedSince(&check_exit_codesize));
|
|
|
|
|
#endif
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
void FastCodeGenerator::Move(Expression::Context context, Register source) {
|
|
|
|
|
switch (context) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
__ push(source);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
TestAndBranch(source, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ push(source);
|
|
|
|
|
TestAndBranch(source, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ push(source);
|
|
|
|
|
TestAndBranch(source, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
void FastCodeGenerator::Move(Expression::Context context, Slot* source) {
|
|
|
|
|
switch (context) {
|
|
|
|
|
case Expression::kUninitialized:
|
2009-10-29 10:35:29 +00:00
|
|
|
UNREACHABLE();
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kEffect:
|
2009-10-27 13:38:57 +00:00
|
|
|
break;
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kValue:
|
2009-10-27 13:38:57 +00:00
|
|
|
__ push(Operand(ebp, SlotOffset(source)));
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTest: // Fall through.
|
|
|
|
|
case Expression::kValueTest: // Fall through.
|
|
|
|
|
case Expression::kTestValue:
|
|
|
|
|
__ mov(eax, Operand(ebp, SlotOffset(source)));
|
|
|
|
|
Move(context, eax);
|
|
|
|
|
break;
|
2009-10-27 13:38:57 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
void FastCodeGenerator::Move(Expression::Context context, Literal* expr) {
|
|
|
|
|
switch (context) {
|
|
|
|
|
case Expression::kUninitialized:
|
2009-10-29 10:35:29 +00:00
|
|
|
UNREACHABLE();
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kEffect:
|
2009-10-27 13:38:57 +00:00
|
|
|
break;
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kValue:
|
2009-10-27 13:38:57 +00:00
|
|
|
__ push(Immediate(expr->handle()));
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTest: // Fall through.
|
|
|
|
|
case Expression::kValueTest: // Fall through.
|
|
|
|
|
case Expression::kTestValue:
|
|
|
|
|
__ mov(eax, expr->handle());
|
|
|
|
|
Move(context, eax);
|
|
|
|
|
break;
|
2009-10-27 13:38:57 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
void FastCodeGenerator::DropAndMove(Expression::Context context,
|
|
|
|
|
Register source) {
|
|
|
|
|
switch (context) {
|
|
|
|
|
case Expression::kUninitialized:
|
2009-10-27 13:38:57 +00:00
|
|
|
UNREACHABLE();
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kEffect:
|
2009-10-28 09:56:14 +00:00
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
break;
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kValue:
|
2009-10-28 09:56:14 +00:00
|
|
|
__ mov(Operand(esp, 0), source);
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTest:
|
|
|
|
|
ASSERT(!source.is(esp));
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
TestAndBranch(source, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(Operand(esp, 0), source);
|
|
|
|
|
TestAndBranch(source, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(Operand(esp, 0), source);
|
|
|
|
|
TestAndBranch(source, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
2009-10-28 09:56:14 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
void FastCodeGenerator::TestAndBranch(Register source,
|
|
|
|
|
Label* true_label,
|
|
|
|
|
Label* false_label) {
|
|
|
|
|
ASSERT_NE(NULL, true_label);
|
|
|
|
|
ASSERT_NE(NULL, false_label);
|
|
|
|
|
// Use the shared ToBoolean stub to compile the value in the register into
|
|
|
|
|
// control flow to the code generator's true and false labels. Perform
|
|
|
|
|
// the fast checks assumed by the stub.
|
|
|
|
|
__ cmp(source, Factory::undefined_value()); // The undefined value is false.
|
|
|
|
|
__ j(equal, false_label);
|
|
|
|
|
__ cmp(source, Factory::true_value()); // True is true.
|
|
|
|
|
__ j(equal, true_label);
|
|
|
|
|
__ cmp(source, Factory::false_value()); // False is false.
|
|
|
|
|
__ j(equal, false_label);
|
|
|
|
|
ASSERT_EQ(0, kSmiTag);
|
|
|
|
|
__ test(source, Operand(source)); // The smi zero is false.
|
|
|
|
|
__ j(zero, false_label);
|
|
|
|
|
__ test(source, Immediate(kSmiTagMask)); // All other smis are true.
|
|
|
|
|
__ j(zero, true_label);
|
|
|
|
|
|
|
|
|
|
// Call the stub for all other cases.
|
|
|
|
|
__ push(source);
|
|
|
|
|
ToBooleanStub stub;
|
|
|
|
|
__ CallStub(&stub);
|
|
|
|
|
__ test(eax, Operand(eax)); // The stub returns nonzero for true.
|
|
|
|
|
__ j(not_zero, true_label);
|
|
|
|
|
__ jmp(false_label);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-05 17:33:50 +00:00
|
|
|
void FastCodeGenerator::VisitDeclaration(Declaration* decl) {
|
2009-11-13 09:42:18 +00:00
|
|
|
Comment cmnt(masm_, "[ Declaration");
|
2009-11-05 17:33:50 +00:00
|
|
|
Variable* var = decl->proxy()->var();
|
|
|
|
|
ASSERT(var != NULL); // Must have been resolved.
|
|
|
|
|
Slot* slot = var->slot();
|
|
|
|
|
ASSERT(slot != NULL); // No global declarations here.
|
|
|
|
|
|
|
|
|
|
// We have 3 cases for slots: LOOKUP, LOCAL, CONTEXT.
|
|
|
|
|
switch (slot->type()) {
|
|
|
|
|
case Slot::LOOKUP: {
|
|
|
|
|
__ push(esi);
|
|
|
|
|
__ push(Immediate(var->name()));
|
|
|
|
|
// Declaration nodes are always introduced in one of two modes.
|
|
|
|
|
ASSERT(decl->mode() == Variable::VAR || decl->mode() == Variable::CONST);
|
|
|
|
|
PropertyAttributes attr =
|
|
|
|
|
(decl->mode() == Variable::VAR) ? NONE : READ_ONLY;
|
|
|
|
|
__ push(Immediate(Smi::FromInt(attr)));
|
|
|
|
|
// Push initial value, if any.
|
|
|
|
|
// Note: For variables we must not push an initial value (such as
|
|
|
|
|
// 'undefined') because we may have a (legal) redeclaration and we
|
|
|
|
|
// must not destroy the current value.
|
|
|
|
|
if (decl->mode() == Variable::CONST) {
|
|
|
|
|
__ push(Immediate(Factory::the_hole_value()));
|
|
|
|
|
} else if (decl->fun() != NULL) {
|
|
|
|
|
Visit(decl->fun());
|
|
|
|
|
} else {
|
|
|
|
|
__ push(Immediate(Smi::FromInt(0))); // No initial value!
|
|
|
|
|
}
|
|
|
|
|
__ CallRuntime(Runtime::kDeclareContextSlot, 4);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Slot::LOCAL:
|
|
|
|
|
if (decl->mode() == Variable::CONST) {
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(var->slot())),
|
|
|
|
|
Immediate(Factory::the_hole_value()));
|
|
|
|
|
} else if (decl->fun() != NULL) {
|
|
|
|
|
Visit(decl->fun());
|
|
|
|
|
__ pop(Operand(ebp, SlotOffset(var->slot())));
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case Slot::CONTEXT:
|
|
|
|
|
// The variable in the decl always resides in the current context.
|
|
|
|
|
ASSERT(function_->scope()->ContextChainLength(slot->var()->scope()) == 0);
|
|
|
|
|
if (decl->mode() == Variable::CONST) {
|
|
|
|
|
__ mov(eax, Immediate(Factory::the_hole_value()));
|
|
|
|
|
if (FLAG_debug_code) {
|
|
|
|
|
// Check if we have the correct context pointer.
|
|
|
|
|
__ mov(ebx,
|
|
|
|
|
CodeGenerator::ContextOperand(esi, Context::FCONTEXT_INDEX));
|
|
|
|
|
__ cmp(ebx, Operand(esi));
|
|
|
|
|
__ Check(equal, "Unexpected declaration in current context.");
|
|
|
|
|
}
|
|
|
|
|
__ mov(CodeGenerator::ContextOperand(esi, slot->index()), eax);
|
|
|
|
|
// No write barrier since the_hole_value is in old space.
|
|
|
|
|
} else if (decl->fun() != NULL) {
|
|
|
|
|
Visit(decl->fun());
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
if (FLAG_debug_code) {
|
|
|
|
|
// Check if we have the correct context pointer.
|
|
|
|
|
__ mov(ebx,
|
|
|
|
|
CodeGenerator::ContextOperand(esi, Context::FCONTEXT_INDEX));
|
|
|
|
|
__ cmp(ebx, Operand(esi));
|
|
|
|
|
__ Check(equal, "Unexpected declaration in current context.");
|
|
|
|
|
}
|
|
|
|
|
__ mov(CodeGenerator::ContextOperand(esi, slot->index()), eax);
|
|
|
|
|
int offset = FixedArray::kHeaderSize + slot->index() * kPointerSize;
|
|
|
|
|
__ RecordWrite(esi, offset, eax, ecx);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
__ push(esi); // The context is the first argument.
|
2009-10-21 09:17:39 +00:00
|
|
|
__ push(Immediate(pairs));
|
|
|
|
|
__ push(Immediate(Smi::FromInt(is_eval_ ? 1 : 0)));
|
|
|
|
|
__ CallRuntime(Runtime::kDeclareGlobals, 3);
|
|
|
|
|
// Return value is ignored.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
void FastCodeGenerator::VisitReturnStatement(ReturnStatement* stmt) {
|
|
|
|
|
Comment cmnt(masm_, "[ ReturnStatement");
|
2009-10-19 10:36:42 +00:00
|
|
|
Expression* expr = stmt->expression();
|
2009-10-27 08:48:01 +00:00
|
|
|
if (expr->AsLiteral() != NULL) {
|
2009-10-19 10:36:42 +00:00
|
|
|
__ mov(eax, expr->AsLiteral()->handle());
|
2009-10-27 08:48:01 +00:00
|
|
|
} else {
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, expr->context());
|
2009-10-27 08:48:01 +00:00
|
|
|
Visit(expr);
|
2009-10-30 08:36:46 +00:00
|
|
|
__ pop(eax);
|
2009-10-19 10:36:42 +00:00
|
|
|
}
|
2009-11-04 14:11:39 +00:00
|
|
|
EmitReturnSequence(stmt->statement_pos());
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
void FastCodeGenerator::VisitFunctionLiteral(FunctionLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ FunctionLiteral");
|
|
|
|
|
|
|
|
|
|
// Build the function boilerplate and instantiate it.
|
2009-11-04 17:59:24 +00:00
|
|
|
Handle<JSFunction> boilerplate =
|
|
|
|
|
Compiler::BuildBoilerplate(expr, script_, this);
|
2009-10-21 09:17:39 +00:00
|
|
|
if (HasStackOverflow()) return;
|
|
|
|
|
|
|
|
|
|
ASSERT(boilerplate->IsBoilerplate());
|
|
|
|
|
|
|
|
|
|
// Create a new closure.
|
|
|
|
|
__ push(esi);
|
2009-10-22 10:07:45 +00:00
|
|
|
__ push(Immediate(boilerplate));
|
2009-10-21 09:17:39 +00:00
|
|
|
__ CallRuntime(Runtime::kNewClosure, 2);
|
2009-10-30 08:36:46 +00:00
|
|
|
Move(expr->context(), eax);
|
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) {
|
2009-11-09 09:56:57 +00:00
|
|
|
ASSERT(expr->var()->is_global());
|
2009-10-21 09:38:21 +00:00
|
|
|
Comment cmnt(masm_, "Global variable");
|
|
|
|
|
// Use inline caching. Variable name is passed in ecx and the global
|
|
|
|
|
// object on the stack.
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
__ mov(ecx, expr->name());
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::LoadIC_Initialize));
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET_CONTEXT);
|
2009-10-27 16:11:12 +00:00
|
|
|
// 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
|
|
|
|
|
// Remember that the assembler may choose to do peephole optimization
|
|
|
|
|
// (eg, push/pop elimination).
|
|
|
|
|
__ nop();
|
2009-10-21 09:38:21 +00:00
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
DropAndMove(expr->context(), eax);
|
2009-11-12 11:38:01 +00:00
|
|
|
} else if (rewrite->AsSlot() != NULL) {
|
2009-11-09 09:56:57 +00:00
|
|
|
Slot* slot = rewrite->AsSlot();
|
|
|
|
|
switch (slot->type()) {
|
|
|
|
|
case Slot::LOCAL:
|
|
|
|
|
case Slot::PARAMETER: {
|
|
|
|
|
Comment cmnt(masm_, "Stack slot");
|
|
|
|
|
Move(expr->context(), slot);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
case Slot::CONTEXT: {
|
|
|
|
|
Comment cmnt(masm_, "Context slot");
|
|
|
|
|
int chain_length =
|
|
|
|
|
function_->scope()->ContextChainLength(slot->var()->scope());
|
|
|
|
|
if (chain_length > 0) {
|
|
|
|
|
// Move up the chain of contexts to the context containing the slot.
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(esi, Context::SlotOffset(Context::CLOSURE_INDEX)));
|
|
|
|
|
// Load the function context (which is the incoming, outer context).
|
|
|
|
|
__ mov(eax, FieldOperand(eax, JSFunction::kContextOffset));
|
|
|
|
|
for (int i = 1; i < chain_length; i++) {
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(eax, Context::SlotOffset(Context::CLOSURE_INDEX)));
|
|
|
|
|
__ mov(eax, FieldOperand(eax, JSFunction::kContextOffset));
|
|
|
|
|
}
|
|
|
|
|
// The context may be an intermediate context, not a function context.
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(eax, Context::SlotOffset(Context::FCONTEXT_INDEX)));
|
|
|
|
|
} else { // Slot is in the current function context.
|
|
|
|
|
// The context may be an intermediate context, not a function context.
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(esi, Context::SlotOffset(Context::FCONTEXT_INDEX)));
|
|
|
|
|
}
|
|
|
|
|
__ mov(eax, Operand(eax, Context::SlotOffset(slot->index())));
|
|
|
|
|
Move(expr->context(), eax);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
case Slot::LOOKUP:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
|
|
|
|
}
|
2009-11-12 11:38:01 +00:00
|
|
|
} else {
|
|
|
|
|
// The parameter variable has been rewritten into an explict access to
|
|
|
|
|
// the arguments object.
|
|
|
|
|
Property* property = rewrite->AsProperty();
|
|
|
|
|
ASSERT_NOT_NULL(property);
|
|
|
|
|
ASSERT_EQ(expr->context(), property->context());
|
|
|
|
|
Visit(property);
|
2009-10-27 08:48:01 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-29 10:35:29 +00:00
|
|
|
void FastCodeGenerator::VisitRegExpLiteral(RegExpLiteral* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ RegExpLiteral");
|
2009-10-29 10:35:29 +00:00
|
|
|
Label done;
|
|
|
|
|
// Registers will be used as follows:
|
|
|
|
|
// edi = JS function.
|
|
|
|
|
// ebx = literals array.
|
|
|
|
|
// eax = regexp literal.
|
|
|
|
|
__ mov(edi, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
__ mov(ebx, FieldOperand(edi, JSFunction::kLiteralsOffset));
|
|
|
|
|
int literal_offset =
|
|
|
|
|
FixedArray::kHeaderSize + expr->literal_index() * kPointerSize;
|
|
|
|
|
__ mov(eax, FieldOperand(ebx, literal_offset));
|
|
|
|
|
__ cmp(eax, Factory::undefined_value());
|
|
|
|
|
__ j(not_equal, &done);
|
|
|
|
|
// Create regexp literal using runtime function
|
|
|
|
|
// Result will be in eax.
|
|
|
|
|
__ push(ebx);
|
|
|
|
|
__ push(Immediate(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
__ push(Immediate(expr->pattern()));
|
|
|
|
|
__ push(Immediate(expr->flags()));
|
|
|
|
|
__ CallRuntime(Runtime::kMaterializeRegExpLiteral, 4);
|
|
|
|
|
// Label done:
|
|
|
|
|
__ bind(&done);
|
2009-10-30 08:36:46 +00:00
|
|
|
Move(expr->context(), eax);
|
2009-10-29 10:35:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-26 13:21:48 +00:00
|
|
|
void FastCodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
|
|
|
|
|
Comment cmnt(masm_, "[ ObjectLiteral");
|
|
|
|
|
Label exists;
|
|
|
|
|
// Registers will be used as follows:
|
|
|
|
|
// edi = JS function.
|
|
|
|
|
// ebx = literals array.
|
|
|
|
|
// eax = boilerplate
|
|
|
|
|
|
|
|
|
|
__ mov(edi, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
__ mov(ebx, FieldOperand(edi, JSFunction::kLiteralsOffset));
|
|
|
|
|
int literal_offset =
|
|
|
|
|
FixedArray::kHeaderSize + expr->literal_index() * kPointerSize;
|
|
|
|
|
__ mov(eax, FieldOperand(ebx, literal_offset));
|
|
|
|
|
__ cmp(eax, Factory::undefined_value());
|
|
|
|
|
__ j(not_equal, &exists);
|
|
|
|
|
// Create boilerplate if it does not exist.
|
|
|
|
|
// Literal array (0).
|
|
|
|
|
__ push(ebx);
|
|
|
|
|
// Literal index (1).
|
|
|
|
|
__ push(Immediate(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
// Constant properties (2).
|
|
|
|
|
__ push(Immediate(expr->constant_properties()));
|
|
|
|
|
__ CallRuntime(Runtime::kCreateObjectLiteralBoilerplate, 3);
|
|
|
|
|
__ bind(&exists);
|
|
|
|
|
// eax contains boilerplate.
|
|
|
|
|
// Clone boilerplate.
|
|
|
|
|
__ push(eax);
|
|
|
|
|
if (expr->depth() == 1) {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneShallowLiteralBoilerplate, 1);
|
|
|
|
|
} else {
|
|
|
|
|
__ CallRuntime(Runtime::kCloneLiteralBoilerplate, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If result_saved == true: the result is saved on top of the stack.
|
|
|
|
|
// If result_saved == false: the result not on the stack, just 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(eax); // Save result on the stack
|
|
|
|
|
result_saved = true;
|
|
|
|
|
}
|
|
|
|
|
switch (property->kind()) {
|
|
|
|
|
case ObjectLiteral::Property::MATERIALIZED_LITERAL: // fall through
|
|
|
|
|
ASSERT(!CompileTimeValue::IsCompileTimeValue(value));
|
|
|
|
|
case ObjectLiteral::Property::COMPUTED:
|
|
|
|
|
if (key->handle()->IsSymbol()) {
|
|
|
|
|
Visit(value);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, value->context());
|
|
|
|
|
__ pop(eax);
|
2009-10-26 13:21:48 +00:00
|
|
|
__ mov(ecx, Immediate(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
|
|
|
|
|
case ObjectLiteral::Property::PROTOTYPE:
|
|
|
|
|
__ push(eax);
|
|
|
|
|
Visit(key);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, key->context());
|
2009-10-26 13:21:48 +00:00
|
|
|
Visit(value);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, value->context());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ CallRuntime(Runtime::kSetProperty, 3);
|
|
|
|
|
__ mov(eax, Operand(esp, 0)); // Restore result into eax.
|
|
|
|
|
break;
|
|
|
|
|
case ObjectLiteral::Property::SETTER: // fall through
|
|
|
|
|
case ObjectLiteral::Property::GETTER:
|
|
|
|
|
__ push(eax);
|
|
|
|
|
Visit(key);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, key->context());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ push(Immediate(property->kind() == ObjectLiteral::Property::SETTER ?
|
|
|
|
|
Smi::FromInt(1) :
|
|
|
|
|
Smi::FromInt(0)));
|
|
|
|
|
Visit(value);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, value->context());
|
2009-10-26 13:21:48 +00:00
|
|
|
__ CallRuntime(Runtime::kDefineAccessor, 4);
|
|
|
|
|
__ mov(eax, Operand(esp, 0)); // Restore result into eax.
|
|
|
|
|
break;
|
|
|
|
|
default: UNREACHABLE();
|
|
|
|
|
}
|
|
|
|
|
}
|
2009-10-30 08:36:46 +00:00
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
2009-10-29 10:35:29 +00:00
|
|
|
UNREACHABLE();
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kEffect:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (result_saved) __ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
break;
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kValue:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTest:
|
|
|
|
|
if (result_saved) __ pop(eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
TestAndBranch(eax, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
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.
|
|
|
|
|
__ mov(ebx, Operand(ebp, JavaScriptFrameConstants::kFunctionOffset));
|
|
|
|
|
__ mov(ebx, FieldOperand(ebx, JSFunction::kLiteralsOffset));
|
|
|
|
|
// Check if the literal's boilerplate has been instantiated.
|
|
|
|
|
int offset =
|
|
|
|
|
FixedArray::kHeaderSize + (expr->literal_index() * kPointerSize);
|
|
|
|
|
__ mov(eax, FieldOperand(ebx, offset));
|
|
|
|
|
__ cmp(eax, Factory::undefined_value());
|
|
|
|
|
__ j(not_equal, &make_clone);
|
|
|
|
|
|
|
|
|
|
// Instantiate the boilerplate.
|
|
|
|
|
__ push(ebx);
|
|
|
|
|
__ push(Immediate(Smi::FromInt(expr->literal_index())));
|
|
|
|
|
__ push(Immediate(expr->literals()));
|
|
|
|
|
__ CallRuntime(Runtime::kCreateArrayLiteralBoilerplate, 3);
|
|
|
|
|
|
|
|
|
|
__ bind(&make_clone);
|
|
|
|
|
// Clone the boilerplate.
|
|
|
|
|
__ push(eax);
|
|
|
|
|
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(eax);
|
|
|
|
|
result_saved = true;
|
|
|
|
|
}
|
|
|
|
|
Visit(subexpr);
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, subexpr->context());
|
2009-10-22 10:07:45 +00:00
|
|
|
|
|
|
|
|
// Store the subexpression value in the array's elements.
|
|
|
|
|
__ pop(eax); // Subexpression value.
|
|
|
|
|
__ mov(ebx, Operand(esp, 0)); // Copy of array literal.
|
|
|
|
|
__ mov(ebx, FieldOperand(ebx, JSObject::kElementsOffset));
|
|
|
|
|
int offset = FixedArray::kHeaderSize + (i * kPointerSize);
|
|
|
|
|
__ mov(FieldOperand(ebx, offset), eax);
|
|
|
|
|
|
|
|
|
|
// Update the write barrier for the array store.
|
|
|
|
|
__ RecordWrite(ebx, offset, eax, ecx);
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
2009-10-29 10:35:29 +00:00
|
|
|
UNREACHABLE();
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kEffect:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (result_saved) __ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
break;
|
2009-10-30 08:36:46 +00:00
|
|
|
case Expression::kValue:
|
2009-10-27 13:38:57 +00:00
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTest:
|
|
|
|
|
if (result_saved) __ pop(eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
if (!result_saved) __ push(eax);
|
|
|
|
|
TestAndBranch(eax, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
2009-10-22 10:07:45 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-02 13:30:24 +00:00
|
|
|
void FastCodeGenerator::EmitVariableAssignment(Assignment* expr) {
|
|
|
|
|
Variable* var = expr->target()->AsVariableProxy()->AsVariable();
|
|
|
|
|
ASSERT(var != NULL);
|
|
|
|
|
|
2009-11-02 11:01:47 +00:00
|
|
|
if (var->is_global()) {
|
2009-11-02 13:30:24 +00:00
|
|
|
// Assignment to a global variable. Use inline caching for the
|
|
|
|
|
// assignment. Right-hand-side value is passed in eax, variable name in
|
|
|
|
|
// ecx, and the global object on the stack.
|
2009-11-02 11:01:47 +00:00
|
|
|
__ pop(eax);
|
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(ecx, var->name());
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::StoreIC_Initialize));
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET);
|
2009-11-02 13:30:24 +00:00
|
|
|
// Overwrite the receiver on the stack with the result if needed.
|
|
|
|
|
DropAndMove(expr->context(), eax);
|
|
|
|
|
|
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-11-09 09:56:57 +00:00
|
|
|
Slot* slot = var->slot();
|
|
|
|
|
ASSERT_NOT_NULL(slot); // Variables rewritten as properties not handled.
|
|
|
|
|
switch (slot->type()) {
|
|
|
|
|
case Slot::LOCAL:
|
|
|
|
|
case Slot::PARAMETER: {
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
// Perform assignment and discard value.
|
|
|
|
|
__ pop(Operand(ebp, SlotOffset(var->slot())));
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
// Perform assignment and preserve value.
|
|
|
|
|
__ mov(eax, Operand(esp, 0));
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(var->slot())), eax);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
// Perform assignment and test (and discard) value.
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(var->slot())), eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(eax, Operand(esp, 0));
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(var->slot())), eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(eax, Operand(esp, 0));
|
|
|
|
|
__ mov(Operand(ebp, SlotOffset(var->slot())), eax);
|
|
|
|
|
TestAndBranch(eax, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
2009-11-02 11:01:47 +00:00
|
|
|
break;
|
|
|
|
|
}
|
2009-11-09 09:56:57 +00:00
|
|
|
|
|
|
|
|
case Slot::CONTEXT: {
|
|
|
|
|
int chain_length =
|
|
|
|
|
function_->scope()->ContextChainLength(slot->var()->scope());
|
|
|
|
|
if (chain_length > 0) {
|
|
|
|
|
// Move up the context chain to the context containing the slot.
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(esi, Context::SlotOffset(Context::CLOSURE_INDEX)));
|
|
|
|
|
// Load the function context (which is the incoming, outer context).
|
|
|
|
|
__ mov(eax, FieldOperand(eax, JSFunction::kContextOffset));
|
|
|
|
|
for (int i = 1; i < chain_length; i++) {
|
|
|
|
|
__ mov(eax,
|
|
|
|
|
Operand(eax, Context::SlotOffset(Context::CLOSURE_INDEX)));
|
|
|
|
|
__ mov(eax, FieldOperand(eax, JSFunction::kContextOffset));
|
|
|
|
|
}
|
|
|
|
|
} else { // Slot is in the current context. Generate optimized code.
|
|
|
|
|
__ mov(eax, esi); // RecordWrite destroys the object register.
|
|
|
|
|
}
|
|
|
|
|
if (FLAG_debug_code) {
|
|
|
|
|
__ cmp(eax,
|
|
|
|
|
Operand(eax, Context::SlotOffset(Context::FCONTEXT_INDEX)));
|
|
|
|
|
__ Check(equal, "Context Slot chain length wrong.");
|
|
|
|
|
}
|
|
|
|
|
__ pop(ecx);
|
|
|
|
|
__ mov(Operand(eax, Context::SlotOffset(slot->index())), ecx);
|
|
|
|
|
|
|
|
|
|
// RecordWrite may destroy all its register arguments.
|
|
|
|
|
if (expr->context() == Expression::kValue) {
|
|
|
|
|
__ push(ecx);
|
|
|
|
|
} else if (expr->context() != Expression::kEffect) {
|
|
|
|
|
__ mov(edx, ecx);
|
|
|
|
|
}
|
|
|
|
|
int offset = FixedArray::kHeaderSize + slot->index() * kPointerSize;
|
|
|
|
|
__ RecordWrite(eax, offset, ecx, ebx);
|
|
|
|
|
if (expr->context() != Expression::kEffect &&
|
|
|
|
|
expr->context() != Expression::kValue) {
|
|
|
|
|
Move(expr->context(), edx);
|
|
|
|
|
}
|
2009-11-02 11:01:47 +00:00
|
|
|
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-11-09 09:56:57 +00:00
|
|
|
|
|
|
|
|
case Slot::LOOKUP:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
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 infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-02 13:30:24 +00:00
|
|
|
void FastCodeGenerator::EmitNamedPropertyAssignment(Assignment* expr) {
|
|
|
|
|
// Assignment to a property, using a named store IC.
|
|
|
|
|
Property* prop = expr->target()->AsProperty();
|
|
|
|
|
ASSERT(prop != NULL);
|
|
|
|
|
ASSERT(prop->key()->AsLiteral() != NULL);
|
|
|
|
|
|
|
|
|
|
// If the assignment starts a block of assignments to the same object,
|
|
|
|
|
// change to slow case to avoid the quadratic behavior of repeatedly
|
|
|
|
|
// adding fast properties.
|
|
|
|
|
if (expr->starts_initialization_block()) {
|
|
|
|
|
__ push(Operand(esp, kPointerSize)); // Receiver is under value.
|
|
|
|
|
__ CallRuntime(Runtime::kToSlowProperties, 1);
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-02 11:01:47 +00:00
|
|
|
__ pop(eax);
|
2009-11-02 13:30:24 +00:00
|
|
|
__ mov(ecx, prop->key()->AsLiteral()->handle());
|
2009-11-02 11:01:47 +00:00
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::StoreIC_Initialize));
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET);
|
2009-11-02 13:30:24 +00:00
|
|
|
|
|
|
|
|
// If the assignment ends an initialization block, revert to fast case.
|
|
|
|
|
if (expr->ends_initialization_block()) {
|
|
|
|
|
__ push(eax); // Result of assignment, saved even if not needed.
|
|
|
|
|
__ push(Operand(esp, kPointerSize)); // Receiver is under value.
|
|
|
|
|
__ CallRuntime(Runtime::kToFastProperties, 1);
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
DropAndMove(expr->context(), eax);
|
2009-11-02 11:01:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-02 13:30:24 +00:00
|
|
|
void FastCodeGenerator::EmitKeyedPropertyAssignment(Assignment* expr) {
|
|
|
|
|
// Assignment to a property, using a keyed store IC.
|
|
|
|
|
|
|
|
|
|
// If the assignment starts a block of assignments to the same object,
|
|
|
|
|
// change to slow case to avoid the quadratic behavior of repeatedly
|
|
|
|
|
// adding fast properties.
|
|
|
|
|
if (expr->starts_initialization_block()) {
|
|
|
|
|
// Reciever is under the key and value.
|
|
|
|
|
__ push(Operand(esp, 2 * kPointerSize));
|
|
|
|
|
__ CallRuntime(Runtime::kToSlowProperties, 1);
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-02 11:01:47 +00:00
|
|
|
__ pop(eax);
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::KeyedStoreIC_Initialize));
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// This nop signals to the IC that there is no inlined code at the call
|
|
|
|
|
// site for it to patch.
|
|
|
|
|
__ nop();
|
2009-11-02 13:30:24 +00:00
|
|
|
|
|
|
|
|
// If the assignment ends an initialization block, revert to fast case.
|
|
|
|
|
if (expr->ends_initialization_block()) {
|
|
|
|
|
__ push(eax); // Result of assignment, saved even if not needed.
|
|
|
|
|
// Reciever is under the key and value.
|
|
|
|
|
__ push(Operand(esp, 2 * kPointerSize));
|
|
|
|
|
__ CallRuntime(Runtime::kToFastProperties, 1);
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-02 11:01:47 +00:00
|
|
|
// Receiver and key are still on stack.
|
|
|
|
|
__ add(Operand(esp), Immediate(2 * kPointerSize));
|
2009-11-02 13:30:24 +00:00
|
|
|
Move(expr->context(), eax);
|
2009-11-02 11:01:47 +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());
|
2009-10-30 10:22:31 +00:00
|
|
|
|
2009-10-27 16:11:12 +00:00
|
|
|
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(ecx, Immediate(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 left on the stack by IC.
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
}
|
2009-10-30 08:36:46 +00:00
|
|
|
DropAndMove(expr->context(), eax);
|
2009-10-27 16:11:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 10:22:31 +00:00
|
|
|
void FastCodeGenerator::EmitCallWithIC(Call* expr, RelocInfo::Mode reloc_info) {
|
|
|
|
|
// Code common for calls using the IC.
|
2009-10-21 09:17:39 +00:00
|
|
|
ZoneList<Expression*>* args = expr->arguments();
|
|
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, args->at(i)->context());
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
2009-10-30 10:22:31 +00:00
|
|
|
// Record source position for debugger.
|
2009-10-21 09:17:39 +00:00
|
|
|
SetSourcePosition(expr->position());
|
|
|
|
|
// Call the IC initialization code.
|
|
|
|
|
Handle<Code> ic = CodeGenerator::ComputeCallInitialize(arg_count,
|
|
|
|
|
NOT_IN_LOOP);
|
2009-10-30 10:22:31 +00:00
|
|
|
__ call(ic, reloc_info);
|
|
|
|
|
// Restore context register.
|
|
|
|
|
__ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
|
|
|
|
|
// Discard the function left on TOS.
|
|
|
|
|
DropAndMove(expr->context(), eax);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::EmitCallWithStub(Call* expr) {
|
|
|
|
|
// Code common for calls using the call stub.
|
|
|
|
|
ZoneList<Expression*>* args = expr->arguments();
|
|
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
|
|
|
|
}
|
|
|
|
|
// Record source position for debugger.
|
|
|
|
|
SetSourcePosition(expr->position());
|
|
|
|
|
CallFunctionStub stub(arg_count, NOT_IN_LOOP);
|
|
|
|
|
__ CallStub(&stub);
|
2009-10-21 09:17:39 +00:00
|
|
|
// Restore context register.
|
|
|
|
|
__ mov(esi, Operand(ebp, StandardFrameConstants::kContextOffset));
|
|
|
|
|
// Discard the function left on TOS.
|
2009-10-30 08:36:46 +00:00
|
|
|
DropAndMove(expr->context(), eax);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
2009-10-27 14:52:55 +00:00
|
|
|
|
2009-10-30 10:22:31 +00:00
|
|
|
void FastCodeGenerator::VisitCall(Call* expr) {
|
2009-11-03 12:47:19 +00:00
|
|
|
Comment cmnt(masm_, "[ Call");
|
2009-10-30 10:22:31 +00:00
|
|
|
Expression* fun = expr->expression();
|
2009-11-02 12:04:35 +00:00
|
|
|
Variable* var = fun->AsVariableProxy()->AsVariable();
|
2009-10-30 10:22:31 +00:00
|
|
|
|
2009-11-03 12:47:19 +00:00
|
|
|
if (var != NULL && var->is_possibly_eval()) {
|
|
|
|
|
// Call to the identifier 'eval'.
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
} else if (var != NULL && !var->is_this() && var->is_global()) {
|
|
|
|
|
// Call to a global variable.
|
|
|
|
|
__ push(Immediate(var->name()));
|
|
|
|
|
// Push global object as receiver for the call IC lookup.
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
EmitCallWithIC(expr, RelocInfo::CODE_TARGET_CONTEXT);
|
|
|
|
|
} else if (var != NULL && var->slot() != NULL &&
|
|
|
|
|
var->slot()->type() == Slot::LOOKUP) {
|
|
|
|
|
// Call to a lookup slot.
|
2009-11-02 12:04:35 +00:00
|
|
|
UNREACHABLE();
|
|
|
|
|
} else if (fun->AsProperty() != NULL) {
|
2009-11-03 12:47:19 +00:00
|
|
|
// Call to an object property.
|
2009-10-30 10:22:31 +00:00
|
|
|
Property* prop = fun->AsProperty();
|
|
|
|
|
Literal* key = prop->key()->AsLiteral();
|
|
|
|
|
if (key != NULL && key->handle()->IsSymbol()) {
|
2009-11-03 12:47:19 +00:00
|
|
|
// Call to a named property, use call IC.
|
2009-10-30 10:22:31 +00:00
|
|
|
__ push(Immediate(key->handle()));
|
|
|
|
|
Visit(prop->obj());
|
|
|
|
|
EmitCallWithIC(expr, RelocInfo::CODE_TARGET);
|
|
|
|
|
} else {
|
2009-11-03 12:47:19 +00:00
|
|
|
// Call to a keyed property, use keyed load IC followed by function
|
|
|
|
|
// call.
|
2009-10-30 10:22:31 +00:00
|
|
|
Visit(prop->obj());
|
|
|
|
|
Visit(prop->key());
|
2009-11-03 12:47:19 +00:00
|
|
|
// Record source code position for IC call.
|
2009-10-30 10:22:31 +00:00
|
|
|
SetSourcePosition(prop->position());
|
|
|
|
|
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 left on the stack by IC.
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
// Pop receiver.
|
|
|
|
|
__ pop(ebx);
|
|
|
|
|
// Push result (function).
|
|
|
|
|
__ push(eax);
|
|
|
|
|
// Push receiver object on stack.
|
|
|
|
|
if (prop->is_synthetic()) {
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
} else {
|
|
|
|
|
__ push(ebx);
|
|
|
|
|
}
|
|
|
|
|
EmitCallWithStub(expr);
|
|
|
|
|
}
|
2009-11-02 12:04:35 +00:00
|
|
|
} else {
|
2009-11-03 14:48:59 +00:00
|
|
|
// Call to some other expression. If the expression is an anonymous
|
|
|
|
|
// function literal not called in a loop, mark it as one that should
|
|
|
|
|
// also use the fast code generator.
|
|
|
|
|
FunctionLiteral* lit = fun->AsFunctionLiteral();
|
|
|
|
|
if (lit != NULL &&
|
|
|
|
|
lit->name()->Equals(Heap::empty_string()) &&
|
|
|
|
|
loop_depth() == 0) {
|
|
|
|
|
lit->set_try_fast_codegen(true);
|
|
|
|
|
}
|
|
|
|
|
Visit(fun);
|
2009-11-02 12:04:35 +00:00
|
|
|
// Load global receiver object.
|
|
|
|
|
__ mov(ebx, CodeGenerator::GlobalObject());
|
|
|
|
|
__ push(FieldOperand(ebx, GlobalObject::kGlobalReceiverOffset));
|
|
|
|
|
// Emit function call.
|
|
|
|
|
EmitCallWithStub(expr);
|
2009-10-30 10:22:31 +00:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-03 14:48:59 +00:00
|
|
|
|
2009-10-30 08:36:46 +00:00
|
|
|
void FastCodeGenerator::VisitCallNew(CallNew* expr) {
|
2009-10-27 14:52:55 +00:00
|
|
|
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.
|
2009-10-30 08:36:46 +00:00
|
|
|
Visit(expr->expression());
|
|
|
|
|
ASSERT_EQ(Expression::kValue, expr->expression()->context());
|
2009-10-27 14:52:55 +00:00
|
|
|
|
|
|
|
|
// Push global object (receiver).
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
|
|
|
|
|
// Push the arguments ("left-to-right") on the stack.
|
2009-10-30 08:36:46 +00:00
|
|
|
ZoneList<Expression*>* args = expr->arguments();
|
2009-10-27 14:52:55 +00:00
|
|
|
int arg_count = args->length();
|
|
|
|
|
for (int i = 0; i < arg_count; i++) {
|
|
|
|
|
Visit(args->at(i));
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, args->at(i)->context());
|
2009-10-29 11:55:03 +00:00
|
|
|
// If location is value, it is already on the stack,
|
2009-10-27 14:52:55 +00:00
|
|
|
// so nothing to do here.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Call the construct call builtin that handles allocation and
|
|
|
|
|
// constructor invocation.
|
2009-10-30 08:36:46 +00:00
|
|
|
SetSourcePosition(expr->position());
|
2009-10-27 14:52:55 +00:00
|
|
|
|
|
|
|
|
// Load function, arg_count into edi and eax.
|
|
|
|
|
__ Set(eax, Immediate(arg_count));
|
|
|
|
|
// Function is in esp[arg_count + 1].
|
|
|
|
|
__ mov(edi, Operand(esp, eax, times_pointer_size, kPointerSize));
|
|
|
|
|
|
|
|
|
|
Handle<Code> construct_builtin(Builtins::builtin(Builtins::JSConstructCall));
|
|
|
|
|
__ call(construct_builtin, RelocInfo::CONSTRUCT_CALL);
|
|
|
|
|
|
|
|
|
|
// Replace function on TOS with result in eax, or pop it.
|
2009-10-30 08:36:46 +00:00
|
|
|
DropAndMove(expr->context(), eax);
|
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-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, args->at(i)->context());
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
__ CallRuntime(function, arg_count);
|
2009-10-30 08:36:46 +00:00
|
|
|
Move(expr->context(), eax);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-30 11:32:42 +00:00
|
|
|
void FastCodeGenerator::VisitUnaryOperation(UnaryOperation* expr) {
|
|
|
|
|
switch (expr->op()) {
|
2009-11-05 10:15:25 +00:00
|
|
|
case Token::VOID: {
|
|
|
|
|
Comment cmnt(masm_, "[ UnaryOperation (VOID)");
|
2009-10-30 11:32:42 +00:00
|
|
|
Visit(expr->expression());
|
|
|
|
|
ASSERT_EQ(Expression::kEffect, expr->expression()->context());
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kEffect:
|
|
|
|
|
break;
|
2009-10-30 11:32:42 +00:00
|
|
|
case Expression::kValue:
|
|
|
|
|
__ push(Immediate(Factory::undefined_value()));
|
|
|
|
|
break;
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
case Expression::kTestValue:
|
|
|
|
|
// Value is false so it's needed.
|
|
|
|
|
__ push(Immediate(Factory::undefined_value()));
|
|
|
|
|
// Fall through.
|
|
|
|
|
case Expression::kTest: // Fall through.
|
|
|
|
|
case Expression::kValueTest:
|
|
|
|
|
__ jmp(false_label_);
|
2009-10-30 11:32:42 +00:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
break;
|
2009-11-05 10:15:25 +00:00
|
|
|
}
|
2009-10-30 11:32:42 +00:00
|
|
|
|
2009-11-02 10:17:12 +00:00
|
|
|
case Token::NOT: {
|
2009-11-05 10:15:25 +00:00
|
|
|
Comment cmnt(masm_, "[ UnaryOperation (NOT)");
|
2009-11-02 10:17:12 +00:00
|
|
|
ASSERT_EQ(Expression::kTest, expr->expression()->context());
|
|
|
|
|
|
|
|
|
|
Label push_true;
|
|
|
|
|
Label push_false;
|
|
|
|
|
Label done;
|
|
|
|
|
Label* saved_true = true_label_;
|
|
|
|
|
Label* saved_false = false_label_;
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
true_label_ = &push_false;
|
|
|
|
|
false_label_ = &push_true;
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
__ bind(&push_true);
|
|
|
|
|
__ push(Immediate(Factory::true_value()));
|
|
|
|
|
__ jmp(&done);
|
|
|
|
|
__ bind(&push_false);
|
|
|
|
|
__ push(Immediate(Factory::false_value()));
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
true_label_ = &done;
|
|
|
|
|
false_label_ = &done;
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
true_label_ = saved_false;
|
|
|
|
|
false_label_ = saved_true;
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValueTest:
|
|
|
|
|
true_label_ = saved_false;
|
|
|
|
|
false_label_ = &push_true;
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
__ bind(&push_true);
|
|
|
|
|
__ push(Immediate(Factory::true_value()));
|
|
|
|
|
__ jmp(saved_true);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTestValue:
|
|
|
|
|
true_label_ = &push_false;
|
|
|
|
|
false_label_ = saved_true;
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
__ bind(&push_false);
|
|
|
|
|
__ push(Immediate(Factory::false_value()));
|
|
|
|
|
__ jmp(saved_false);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
true_label_ = saved_true;
|
|
|
|
|
false_label_ = saved_false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-05 10:15:25 +00:00
|
|
|
case Token::TYPEOF: {
|
|
|
|
|
Comment cmnt(masm_, "[ UnaryOperation (TYPEOF)");
|
|
|
|
|
ASSERT_EQ(Expression::kValue, expr->expression()->context());
|
|
|
|
|
|
|
|
|
|
VariableProxy* proxy = expr->expression()->AsVariableProxy();
|
2009-11-05 12:45:53 +00:00
|
|
|
if (proxy != NULL &&
|
|
|
|
|
!proxy->var()->is_this() &&
|
|
|
|
|
proxy->var()->is_global()) {
|
2009-11-05 10:15:25 +00:00
|
|
|
Comment cmnt(masm_, "Global variable");
|
|
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
__ mov(ecx, Immediate(proxy->name()));
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::LoadIC_Initialize));
|
|
|
|
|
// Use a regular load, not a contextual load, to avoid a reference
|
|
|
|
|
// error.
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
__ mov(Operand(esp, 0), eax);
|
|
|
|
|
} else if (proxy != NULL &&
|
|
|
|
|
proxy->var()->slot() != NULL &&
|
|
|
|
|
proxy->var()->slot()->type() == Slot::LOOKUP) {
|
|
|
|
|
__ push(esi);
|
|
|
|
|
__ push(Immediate(proxy->name()));
|
|
|
|
|
__ CallRuntime(Runtime::kLoadContextSlotNoReferenceError, 2);
|
|
|
|
|
__ push(eax);
|
|
|
|
|
} else {
|
|
|
|
|
// This expression cannot throw a reference error at the top level.
|
|
|
|
|
Visit(expr->expression());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
__ CallRuntime(Runtime::kTypeof, 1);
|
|
|
|
|
Move(expr->context(), eax);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2009-10-30 11:32:42 +00:00
|
|
|
default:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-02 10:22:22 +00:00
|
|
|
void FastCodeGenerator::VisitCountOperation(CountOperation* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ CountOperation");
|
|
|
|
|
VariableProxy* proxy = expr->expression()->AsVariableProxy();
|
|
|
|
|
ASSERT(proxy->AsVariable() != NULL);
|
|
|
|
|
ASSERT(proxy->AsVariable()->is_global());
|
2009-11-02 10:22:22 +00:00
|
|
|
|
2009-11-03 14:48:59 +00:00
|
|
|
Visit(proxy);
|
2009-11-02 10:22:22 +00:00
|
|
|
__ InvokeBuiltin(Builtins::TO_NUMBER, CALL_FUNCTION);
|
|
|
|
|
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Expression::kValue: // Fall through
|
|
|
|
|
case Expression::kTest: // Fall through
|
|
|
|
|
case Expression::kTestValue: // Fall through
|
|
|
|
|
case Expression::kValueTest:
|
|
|
|
|
// Duplicate the result on the stack.
|
|
|
|
|
__ push(eax);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
// Do not save result.
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
// Call runtime for +1/-1.
|
|
|
|
|
__ push(eax);
|
|
|
|
|
__ push(Immediate(Smi::FromInt(1)));
|
|
|
|
|
if (expr->op() == Token::INC) {
|
|
|
|
|
__ CallRuntime(Runtime::kNumberAdd, 2);
|
|
|
|
|
} else {
|
|
|
|
|
__ CallRuntime(Runtime::kNumberSub, 2);
|
|
|
|
|
}
|
|
|
|
|
// Call Store IC.
|
2009-11-03 14:48:59 +00:00
|
|
|
__ mov(ecx, proxy->AsVariable()->name());
|
2009-11-02 10:22:22 +00:00
|
|
|
__ push(CodeGenerator::GlobalObject());
|
|
|
|
|
Handle<Code> ic(Builtins::builtin(Builtins::StoreIC_Initialize));
|
|
|
|
|
__ call(ic, RelocInfo::CODE_TARGET);
|
|
|
|
|
// Restore up stack after store IC.
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
case Expression::kEffect: // Fall through
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
// Do nothing. Result in either on the stack for value context
|
|
|
|
|
// or discarded for effect context.
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
TestAndBranch(eax, true_label_, false_label_);
|
|
|
|
|
break;
|
|
|
|
|
case Expression::kValueTest: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(eax, Operand(esp, 0));
|
|
|
|
|
TestAndBranch(eax, true_label_, &discard);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
case Expression::kTestValue: {
|
|
|
|
|
Label discard;
|
|
|
|
|
__ mov(eax, Operand(esp, 0));
|
|
|
|
|
TestAndBranch(eax, &discard, false_label_);
|
|
|
|
|
__ bind(&discard);
|
|
|
|
|
__ add(Operand(esp), Immediate(kPointerSize));
|
|
|
|
|
__ jmp(true_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-10-23 10:42:14 +00:00
|
|
|
void FastCodeGenerator::VisitBinaryOperation(BinaryOperation* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ BinaryOperation");
|
2009-10-29 11:55:03 +00:00
|
|
|
switch (expr->op()) {
|
|
|
|
|
case Token::COMMA:
|
2009-10-30 09:57:08 +00:00
|
|
|
ASSERT_EQ(Expression::kEffect, expr->left()->context());
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(expr->context(), expr->right()->context());
|
2009-10-29 11:55:03 +00:00
|
|
|
Visit(expr->left());
|
|
|
|
|
Visit(expr->right());
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Token::OR:
|
|
|
|
|
case Token::AND:
|
|
|
|
|
EmitLogicalOperation(expr);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Token::ADD:
|
|
|
|
|
case Token::SUB:
|
|
|
|
|
case Token::DIV:
|
|
|
|
|
case Token::MOD:
|
|
|
|
|
case Token::MUL:
|
|
|
|
|
case Token::BIT_OR:
|
|
|
|
|
case Token::BIT_AND:
|
|
|
|
|
case Token::BIT_XOR:
|
|
|
|
|
case Token::SHL:
|
|
|
|
|
case Token::SHR:
|
|
|
|
|
case Token::SAR: {
|
2009-10-30 08:36:46 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, expr->left()->context());
|
|
|
|
|
ASSERT_EQ(Expression::kValue, expr->right()->context());
|
2009-10-29 11:55:03 +00:00
|
|
|
|
|
|
|
|
Visit(expr->left());
|
|
|
|
|
Visit(expr->right());
|
|
|
|
|
GenericBinaryOpStub stub(expr->op(),
|
|
|
|
|
NO_OVERWRITE,
|
|
|
|
|
NO_GENERIC_BINARY_FLAGS);
|
|
|
|
|
__ CallStub(&stub);
|
2009-10-30 08:36:46 +00:00
|
|
|
Move(expr->context(), eax);
|
2009-10-29 11:55:03 +00:00
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
default:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2009-11-02 15:01:06 +00:00
|
|
|
void FastCodeGenerator::VisitCompareOperation(CompareOperation* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ CompareOperation");
|
2009-11-02 15:01:06 +00:00
|
|
|
ASSERT_EQ(Expression::kValue, expr->left()->context());
|
|
|
|
|
ASSERT_EQ(Expression::kValue, expr->right()->context());
|
|
|
|
|
Visit(expr->left());
|
|
|
|
|
Visit(expr->right());
|
|
|
|
|
|
|
|
|
|
// Convert current context to test context: Pre-test code.
|
|
|
|
|
Label push_true;
|
|
|
|
|
Label push_false;
|
|
|
|
|
Label done;
|
|
|
|
|
Label* saved_true = true_label_;
|
|
|
|
|
Label* saved_false = false_label_;
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
true_label_ = &push_true;
|
|
|
|
|
false_label_ = &push_false;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
true_label_ = &done;
|
|
|
|
|
false_label_ = &done;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValueTest:
|
|
|
|
|
true_label_ = &push_true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTestValue:
|
|
|
|
|
false_label_ = &push_false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
// Convert current context to test context: End pre-test code.
|
|
|
|
|
|
|
|
|
|
switch (expr->op()) {
|
|
|
|
|
case Token::IN: {
|
|
|
|
|
__ InvokeBuiltin(Builtins::IN, CALL_FUNCTION);
|
|
|
|
|
__ cmp(eax, Factory::true_value());
|
|
|
|
|
__ j(equal, true_label_);
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
case Token::INSTANCEOF: {
|
|
|
|
|
InstanceofStub stub;
|
|
|
|
|
__ CallStub(&stub);
|
|
|
|
|
__ test(eax, Operand(eax));
|
|
|
|
|
__ j(zero, true_label_); // The stub returns 0 for true.
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
default: {
|
|
|
|
|
Condition cc = no_condition;
|
|
|
|
|
bool strict = false;
|
|
|
|
|
switch (expr->op()) {
|
|
|
|
|
case Token::EQ_STRICT:
|
|
|
|
|
strict = true;
|
|
|
|
|
// Fall through
|
|
|
|
|
case Token::EQ:
|
|
|
|
|
cc = equal;
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
__ pop(edx);
|
|
|
|
|
break;
|
|
|
|
|
case Token::LT:
|
|
|
|
|
cc = less;
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
__ pop(edx);
|
|
|
|
|
break;
|
|
|
|
|
case Token::GT:
|
|
|
|
|
// Reverse left and right sizes to obtain ECMA-262 conversion order.
|
|
|
|
|
cc = less;
|
|
|
|
|
__ pop(edx);
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
break;
|
|
|
|
|
case Token::LTE:
|
|
|
|
|
// Reverse left and right sizes to obtain ECMA-262 conversion order.
|
|
|
|
|
cc = greater_equal;
|
|
|
|
|
__ pop(edx);
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
break;
|
|
|
|
|
case Token::GTE:
|
|
|
|
|
cc = greater_equal;
|
|
|
|
|
__ pop(eax);
|
|
|
|
|
__ pop(edx);
|
|
|
|
|
break;
|
|
|
|
|
case Token::IN:
|
|
|
|
|
case Token::INSTANCEOF:
|
|
|
|
|
default:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// The comparison stub expects the smi vs. smi case to be handled
|
|
|
|
|
// before it is called.
|
|
|
|
|
Label slow_case;
|
|
|
|
|
__ mov(ecx, Operand(edx));
|
|
|
|
|
__ or_(ecx, Operand(eax));
|
|
|
|
|
__ test(ecx, Immediate(kSmiTagMask));
|
|
|
|
|
__ j(not_zero, &slow_case, not_taken);
|
|
|
|
|
__ cmp(edx, Operand(eax));
|
|
|
|
|
__ j(cc, true_label_);
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
|
|
|
|
|
__ bind(&slow_case);
|
|
|
|
|
CompareStub stub(cc, strict);
|
|
|
|
|
__ CallStub(&stub);
|
|
|
|
|
__ test(eax, Operand(eax));
|
|
|
|
|
__ j(cc, true_label_);
|
|
|
|
|
__ jmp(false_label_);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Convert current context to test context: Post-test code.
|
|
|
|
|
switch (expr->context()) {
|
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
|
UNREACHABLE();
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValue:
|
|
|
|
|
__ bind(&push_true);
|
|
|
|
|
__ push(Immediate(Factory::true_value()));
|
|
|
|
|
__ jmp(&done);
|
|
|
|
|
__ bind(&push_false);
|
|
|
|
|
__ push(Immediate(Factory::false_value()));
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kEffect:
|
|
|
|
|
__ bind(&done);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTest:
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kValueTest:
|
|
|
|
|
__ bind(&push_true);
|
|
|
|
|
__ push(Immediate(Factory::true_value()));
|
|
|
|
|
__ jmp(saved_true);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case Expression::kTestValue:
|
|
|
|
|
__ bind(&push_false);
|
|
|
|
|
__ push(Immediate(Factory::false_value()));
|
|
|
|
|
__ jmp(saved_false);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
true_label_ = saved_true;
|
|
|
|
|
false_label_ = saved_false;
|
|
|
|
|
// Convert current context to test context: End post-test code.
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
Initial implementation of top-level compilation of expressions in test
context. Test contexts are used for the left subexpressions of
short-circuited boolean operators. The right subexpressions inherit
their expression context from the binary op expression.
Compilation of short-circuited operations in effect and test context
is straightforward:
effect(e0 || e1) =
test(e0, L0, L1)
L1: effect(e1)
L0:
test(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test(e1, L0, L1)
Because the value of the first subexpression may be needed as the
value of the whole expression in a value context, we introduce a
hybrid value/test contest (the value is needed if true, but not if
false).
value(e0 || e1) =
value/test(e0, L0, L1)
L1: value(e1)
L0:
The compilation of value/test and test/value (introduced by boolean
AND) is:
value/test(e0 || e1, L0, L1) =
value/test(e0, L0, L2)
L2: value/test(e1, L0, L1)
test/value(e0 || e1, L0, L1) =
test(e0, L0, L2)
L2: test/value(e1, L0, L1)
Boolean AND is the dual. The AST nodes themselves (not their parents)
are responsible for producing the proper result (effect, value, or
control flow) depending on their context.
Review URL: http://codereview.chromium.org/339082
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3187 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-30 14:06:48 +00:00
|
|
|
#undef __
|
2009-10-23 10:42:14 +00:00
|
|
|
|
|
|
|
|
|
Initial infrastructure for fast compilation of top-level code. The
fast code generator is optimized for compilation time and code size.
Currently it is only implemented on IA32. It is potentially triggered
for any code in the global scope (including code eval'd in the global
scope). It performs a syntactic check and chooses to compile in fast
mode if the AST contains only supported constructs and matches some
other constraints.
Initially supported constructs are
* ExpressionStatement,
* ReturnStatement,
* VariableProxy (variable references) to parameters and
stack-allocated locals,
* Assignment with lhs a parameter or stack-allocated local, and
* Literal
This allows compilation of literals at the top level and not much
else.
All intermediate values are allocated to temporaries and the stack is
used for all temporaries. The extra memory traffic is a known issue.
The code generated for 'true' is:
0 push ebp
1 mov ebp,esp
3 push esi
4 push edi
5 push 0xf5cca135 ;; object: 0xf5cca135 <undefined>
10 cmp esp,[0x8277efc]
16 jnc 27 (0xf5cbbb1b)
22 call 0xf5cac960 ;; code: STUB, StackCheck, minor: 0
27 push 0xf5cca161 ;; object: 0xf5cca161 <true>
32 mov eax,[esp]
35 mov [ebp+0xf4],eax
38 pop eax
39 mov eax,[ebp+0xf4]
42 mov esp,ebp ;; js return
44 pop ebp
45 ret 0x4
48 mov eax,0xf5cca135 ;; object: 0xf5cca135 <undefined>
53 mov esp,ebp ;; js return
55 pop ebp
56 ret 0x4
Review URL: http://codereview.chromium.org/273050
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3067 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-14 19:30:50 +00:00
|
|
|
} } // namespace v8::internal
|
