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-21 09:17:39 +00:00
|
|
|
#include "stub-cache.h"
|
|
|
|
#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 {
|
|
|
|
|
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
|
|
|
#define __ ACCESS_MASM(masm_)
|
|
|
|
|
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
|
|
|
Handle<Code> FastCodeGenerator::MakeCode(FunctionLiteral* fun,
|
2009-10-21 09:17:39 +00:00
|
|
|
Handle<Script> script,
|
|
|
|
bool is_eval) {
|
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
|
|
|
CodeGenerator::MakeCodePrologue(fun);
|
|
|
|
const int kInitialBufferSize = 4 * KB;
|
|
|
|
MacroAssembler masm(NULL, kInitialBufferSize);
|
2009-10-21 09:17:39 +00:00
|
|
|
FastCodeGenerator cgen(&masm, script, is_eval);
|
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
|
|
|
cgen.Generate(fun);
|
|
|
|
if (cgen.HasStackOverflow()) {
|
|
|
|
ASSERT(!Top::has_pending_exception());
|
|
|
|
return Handle<Code>::null();
|
|
|
|
}
|
|
|
|
Code::Flags flags = Code::ComputeFlags(Code::FUNCTION, NOT_IN_LOOP);
|
|
|
|
return CodeGenerator::MakeCodeEpilogue(fun, &masm, flags, script);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int FastCodeGenerator::SlotOffset(Slot* slot) {
|
2009-10-27 13:38:57 +00:00
|
|
|
ASSERT(slot != NULL);
|
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
|
|
|
// Offset is negative because higher indexes are at lower addresses.
|
|
|
|
int offset = -slot->index() * kPointerSize;
|
|
|
|
// Adjust by a (parameter or local) base offset.
|
|
|
|
switch (slot->type()) {
|
|
|
|
case Slot::PARAMETER:
|
|
|
|
offset += (function_->scope()->num_parameters() + 1) * kPointerSize;
|
|
|
|
break;
|
|
|
|
case Slot::LOCAL:
|
|
|
|
offset += JavaScriptFrameConstants::kLocal0Offset;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
2009-10-21 09:17:39 +00:00
|
|
|
|
|
|
|
void FastCodeGenerator::VisitDeclarations(
|
|
|
|
ZoneList<Declaration*>* declarations) {
|
|
|
|
int length = declarations->length();
|
|
|
|
int globals = 0;
|
|
|
|
for (int i = 0; i < length; i++) {
|
2009-11-04 17:59:24 +00:00
|
|
|
Declaration* decl = declarations->at(i);
|
|
|
|
Variable* var = decl->proxy()->var();
|
2009-10-21 09:17:39 +00:00
|
|
|
Slot* slot = var->slot();
|
|
|
|
|
|
|
|
// If it was not possible to allocate the variable at compile
|
|
|
|
// time, we need to "declare" it at runtime to make sure it
|
|
|
|
// actually exists in the local context.
|
|
|
|
if ((slot != NULL && slot->type() == Slot::LOOKUP) || !var->is_global()) {
|
2009-11-05 17:33:50 +00:00
|
|
|
VisitDeclaration(decl);
|
2009-10-21 09:17:39 +00:00
|
|
|
} else {
|
|
|
|
// Count global variables and functions for later processing
|
|
|
|
globals++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Compute array of global variable and function declarations.
|
2009-11-05 17:33:50 +00:00
|
|
|
// Do nothing in case of no declared global functions or variables.
|
|
|
|
if (globals > 0) {
|
|
|
|
Handle<FixedArray> array = Factory::NewFixedArray(2 * globals, TENURED);
|
|
|
|
for (int j = 0, i = 0; i < length; i++) {
|
|
|
|
Declaration* decl = declarations->at(i);
|
|
|
|
Variable* var = decl->proxy()->var();
|
|
|
|
Slot* slot = var->slot();
|
|
|
|
|
|
|
|
if ((slot == NULL || slot->type() != Slot::LOOKUP) && var->is_global()) {
|
|
|
|
array->set(j++, *(var->name()));
|
|
|
|
if (decl->fun() == NULL) {
|
|
|
|
if (var->mode() == Variable::CONST) {
|
|
|
|
// In case this is const property use the hole.
|
|
|
|
array->set_the_hole(j++);
|
|
|
|
} else {
|
|
|
|
array->set_undefined(j++);
|
|
|
|
}
|
2009-10-21 09:17:39 +00:00
|
|
|
} else {
|
2009-11-05 17:33:50 +00:00
|
|
|
Handle<JSFunction> function =
|
|
|
|
Compiler::BuildBoilerplate(decl->fun(), script_, this);
|
|
|
|
// Check for stack-overflow exception.
|
|
|
|
if (HasStackOverflow()) return;
|
|
|
|
array->set(j++, *function);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-11-05 17:33:50 +00:00
|
|
|
// Invoke the platform-dependent code generator to do the actual
|
|
|
|
// declaration the global variables and functions.
|
|
|
|
DeclareGlobals(array);
|
2009-10-21 09:17:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-15 15:27:37 +00:00
|
|
|
void FastCodeGenerator::SetFunctionPosition(FunctionLiteral* fun) {
|
|
|
|
if (FLAG_debug_info) {
|
|
|
|
CodeGenerator::RecordPositions(masm_, fun->start_position());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::SetReturnPosition(FunctionLiteral* fun) {
|
|
|
|
if (FLAG_debug_info) {
|
|
|
|
CodeGenerator::RecordPositions(masm_, fun->end_position());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::SetStatementPosition(Statement* stmt) {
|
|
|
|
if (FLAG_debug_info) {
|
|
|
|
CodeGenerator::RecordPositions(masm_, stmt->statement_pos());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::SetSourcePosition(int pos) {
|
|
|
|
if (FLAG_debug_info && pos != RelocInfo::kNoPosition) {
|
|
|
|
masm_->RecordPosition(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
|
|
|
|
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::EmitLogicalOperation(BinaryOperation* expr) {
|
|
|
|
#ifdef DEBUG
|
|
|
|
Expression::Context expected = Expression::kUninitialized;
|
|
|
|
switch (expr->context()) {
|
|
|
|
case Expression::kUninitialized:
|
|
|
|
UNREACHABLE();
|
|
|
|
case Expression::kEffect: // Fall through.
|
|
|
|
case Expression::kTest:
|
|
|
|
// The value of the left subexpression is not needed.
|
|
|
|
expected = Expression::kTest;
|
|
|
|
break;
|
|
|
|
case Expression::kValue:
|
|
|
|
// The value of the left subexpression is needed and its specific
|
|
|
|
// context depends on the operator.
|
|
|
|
expected = (expr->op() == Token::OR)
|
|
|
|
? Expression::kValueTest
|
|
|
|
: Expression::kTestValue;
|
|
|
|
break;
|
|
|
|
case Expression::kValueTest:
|
|
|
|
// The value of the left subexpression is needed for OR.
|
|
|
|
expected = (expr->op() == Token::OR)
|
|
|
|
? Expression::kValueTest
|
|
|
|
: Expression::kTest;
|
|
|
|
break;
|
|
|
|
case Expression::kTestValue:
|
|
|
|
// The value of the left subexpression is needed for AND.
|
|
|
|
expected = (expr->op() == Token::OR)
|
|
|
|
? Expression::kTest
|
|
|
|
: Expression::kTestValue;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ASSERT_EQ(expected, expr->left()->context());
|
|
|
|
ASSERT_EQ(expr->context(), expr->right()->context());
|
|
|
|
#endif
|
|
|
|
|
|
|
|
Label eval_right, done;
|
|
|
|
Label* saved_true = true_label_;
|
|
|
|
Label* saved_false = false_label_;
|
|
|
|
|
|
|
|
// Set up the appropriate context for the left subexpression based on the
|
|
|
|
// operation and our own context.
|
|
|
|
if (expr->op() == Token::OR) {
|
|
|
|
// If there is no usable true label in the OR expression's context, use
|
|
|
|
// the end of this expression, otherwise inherit the same true label.
|
|
|
|
if (expr->context() == Expression::kEffect ||
|
|
|
|
expr->context() == Expression::kValue) {
|
|
|
|
true_label_ = &done;
|
|
|
|
}
|
|
|
|
// The false label is the label of the second subexpression.
|
|
|
|
false_label_ = &eval_right;
|
|
|
|
} else {
|
|
|
|
ASSERT_EQ(Token::AND, expr->op());
|
|
|
|
// The true label is the label of the second subexpression.
|
|
|
|
true_label_ = &eval_right;
|
|
|
|
// If there is no usable false label in the AND expression's context,
|
|
|
|
// use the end of the expression, otherwise inherit the same false
|
|
|
|
// label.
|
|
|
|
if (expr->context() == Expression::kEffect ||
|
|
|
|
expr->context() == Expression::kValue) {
|
|
|
|
false_label_ = &done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Visit(expr->left());
|
|
|
|
true_label_ = saved_true;
|
|
|
|
false_label_ = saved_false;
|
|
|
|
|
|
|
|
__ bind(&eval_right);
|
|
|
|
Visit(expr->right());
|
|
|
|
|
|
|
|
__ bind(&done);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-27 13:38:57 +00:00
|
|
|
void FastCodeGenerator::VisitBlock(Block* stmt) {
|
|
|
|
Comment cmnt(masm_, "[ Block");
|
|
|
|
SetStatementPosition(stmt);
|
|
|
|
VisitStatements(stmt->statements());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitExpressionStatement(ExpressionStatement* stmt) {
|
|
|
|
Comment cmnt(masm_, "[ ExpressionStatement");
|
|
|
|
SetStatementPosition(stmt);
|
|
|
|
Visit(stmt->expression());
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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::VisitEmptyStatement(EmptyStatement* stmt) {
|
2009-10-21 11:56:05 +00:00
|
|
|
Comment cmnt(masm_, "[ EmptyStatement");
|
|
|
|
SetStatementPosition(stmt);
|
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::VisitIfStatement(IfStatement* stmt) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ IfStatement");
|
2009-10-30 15:34:09 +00:00
|
|
|
// Expressions cannot recursively enter statements, there are no labels in
|
|
|
|
// the state.
|
|
|
|
ASSERT_EQ(NULL, true_label_);
|
|
|
|
ASSERT_EQ(NULL, false_label_);
|
|
|
|
Label then_part, else_part, done;
|
|
|
|
|
|
|
|
// Do not worry about optimizing for empty then or else bodies.
|
|
|
|
true_label_ = &then_part;
|
|
|
|
false_label_ = &else_part;
|
2009-11-02 14:12:48 +00:00
|
|
|
ASSERT(stmt->condition()->context() == Expression::kTest);
|
2009-10-30 15:34:09 +00:00
|
|
|
Visit(stmt->condition());
|
|
|
|
true_label_ = NULL;
|
|
|
|
false_label_ = NULL;
|
|
|
|
|
|
|
|
__ bind(&then_part);
|
|
|
|
Visit(stmt->then_statement());
|
|
|
|
__ jmp(&done);
|
|
|
|
|
|
|
|
__ bind(&else_part);
|
|
|
|
Visit(stmt->else_statement());
|
|
|
|
|
|
|
|
__ bind(&done);
|
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::VisitContinueStatement(ContinueStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitBreakStatement(BreakStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitWithEnterStatement(WithEnterStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitWithExitStatement(WithExitStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) {
|
2009-11-09 13:22:38 +00:00
|
|
|
Comment cmnt(masm_, "[ DoWhileStatement");
|
|
|
|
increment_loop_depth();
|
2009-11-25 09:05:30 +00:00
|
|
|
Label body, exit, stack_limit_hit, stack_check_success;
|
2009-11-09 13:22:38 +00:00
|
|
|
|
|
|
|
__ bind(&body);
|
|
|
|
Visit(stmt->body());
|
|
|
|
|
2009-11-25 09:05:30 +00:00
|
|
|
// Check stack before looping.
|
|
|
|
__ StackLimitCheck(&stack_limit_hit);
|
|
|
|
__ bind(&stack_check_success);
|
|
|
|
|
2009-11-09 13:22:38 +00:00
|
|
|
// We are not in an expression context because we have been compiling
|
|
|
|
// statements. Set up a test expression context for the condition.
|
|
|
|
ASSERT_EQ(NULL, true_label_);
|
|
|
|
ASSERT_EQ(NULL, false_label_);
|
|
|
|
true_label_ = &body;
|
|
|
|
false_label_ = &exit;
|
|
|
|
ASSERT(stmt->cond()->context() == Expression::kTest);
|
|
|
|
Visit(stmt->cond());
|
2009-11-10 09:57:13 +00:00
|
|
|
true_label_ = NULL;
|
|
|
|
false_label_ = NULL;
|
2009-11-09 13:22:38 +00:00
|
|
|
|
2009-11-25 09:05:30 +00:00
|
|
|
__ bind(&stack_limit_hit);
|
|
|
|
StackCheckStub stack_stub;
|
|
|
|
__ CallStub(&stack_stub);
|
|
|
|
__ jmp(&stack_check_success);
|
|
|
|
|
2009-11-09 13:22:38 +00:00
|
|
|
__ bind(&exit);
|
|
|
|
|
|
|
|
decrement_loop_depth();
|
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::VisitWhileStatement(WhileStatement* stmt) {
|
2009-11-09 13:22:38 +00:00
|
|
|
Comment cmnt(masm_, "[ WhileStatement");
|
|
|
|
increment_loop_depth();
|
2009-11-25 09:05:30 +00:00
|
|
|
Label test, body, exit, stack_limit_hit, stack_check_success;
|
2009-11-09 13:22:38 +00:00
|
|
|
|
|
|
|
// Emit the test at the bottom of the loop.
|
|
|
|
__ jmp(&test);
|
|
|
|
|
|
|
|
__ bind(&body);
|
|
|
|
Visit(stmt->body());
|
|
|
|
|
|
|
|
__ bind(&test);
|
2009-11-25 09:05:30 +00:00
|
|
|
// Check stack before looping.
|
|
|
|
__ StackLimitCheck(&stack_limit_hit);
|
|
|
|
__ bind(&stack_check_success);
|
|
|
|
|
2009-11-09 13:22:38 +00:00
|
|
|
// We are not in an expression context because we have been compiling
|
|
|
|
// statements. Set up a test expression context for the condition.
|
|
|
|
ASSERT_EQ(NULL, true_label_);
|
|
|
|
ASSERT_EQ(NULL, false_label_);
|
|
|
|
true_label_ = &body;
|
|
|
|
false_label_ = &exit;
|
|
|
|
ASSERT(stmt->cond()->context() == Expression::kTest);
|
|
|
|
Visit(stmt->cond());
|
2009-11-10 09:57:13 +00:00
|
|
|
true_label_ = NULL;
|
|
|
|
false_label_ = NULL;
|
2009-11-09 13:22:38 +00:00
|
|
|
|
2009-11-25 09:05:30 +00:00
|
|
|
__ bind(&stack_limit_hit);
|
|
|
|
StackCheckStub stack_stub;
|
|
|
|
__ CallStub(&stack_stub);
|
|
|
|
__ jmp(&stack_check_success);
|
|
|
|
|
2009-11-09 13:22:38 +00:00
|
|
|
__ bind(&exit);
|
|
|
|
|
|
|
|
decrement_loop_depth();
|
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::VisitForStatement(ForStatement* stmt) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ ForStatement");
|
2009-11-25 09:05:30 +00:00
|
|
|
Label test, body, exit, stack_limit_hit, stack_check_success;
|
2009-11-02 14:12:48 +00:00
|
|
|
if (stmt->init() != NULL) Visit(stmt->init());
|
|
|
|
|
2009-11-03 14:48:59 +00:00
|
|
|
increment_loop_depth();
|
2009-11-02 14:12:48 +00:00
|
|
|
// Emit the test at the bottom of the loop (even if empty).
|
|
|
|
__ jmp(&test);
|
|
|
|
__ bind(&body);
|
|
|
|
Visit(stmt->body());
|
2009-11-25 09:05:30 +00:00
|
|
|
|
|
|
|
// Check stack before looping.
|
|
|
|
__ StackLimitCheck(&stack_limit_hit);
|
|
|
|
__ bind(&stack_check_success);
|
|
|
|
|
2009-11-02 14:12:48 +00:00
|
|
|
if (stmt->next() != NULL) Visit(stmt->next());
|
|
|
|
|
|
|
|
__ bind(&test);
|
2009-11-25 09:05:30 +00:00
|
|
|
|
2009-11-02 14:12:48 +00:00
|
|
|
if (stmt->cond() == NULL) {
|
|
|
|
// For an empty test jump to the top of the loop.
|
|
|
|
__ jmp(&body);
|
|
|
|
} else {
|
|
|
|
// We are not in an expression context because we have been compiling
|
|
|
|
// statements. Set up a test expression context for the condition.
|
|
|
|
ASSERT_EQ(NULL, true_label_);
|
|
|
|
ASSERT_EQ(NULL, false_label_);
|
2009-11-25 09:05:30 +00:00
|
|
|
|
2009-11-02 14:12:48 +00:00
|
|
|
true_label_ = &body;
|
|
|
|
false_label_ = &exit;
|
|
|
|
ASSERT(stmt->cond()->context() == Expression::kTest);
|
|
|
|
Visit(stmt->cond());
|
|
|
|
true_label_ = NULL;
|
|
|
|
false_label_ = NULL;
|
|
|
|
}
|
|
|
|
|
2009-11-25 09:05:30 +00:00
|
|
|
__ bind(&stack_limit_hit);
|
|
|
|
StackCheckStub stack_stub;
|
|
|
|
__ CallStub(&stack_stub);
|
|
|
|
__ jmp(&stack_check_success);
|
|
|
|
|
2009-11-02 14:12:48 +00:00
|
|
|
__ bind(&exit);
|
2009-11-03 14:48:59 +00:00
|
|
|
decrement_loop_depth();
|
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::VisitForInStatement(ForInStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitTryCatchStatement(TryCatchStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitTryFinallyStatement(TryFinallyStatement* stmt) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitDebuggerStatement(DebuggerStatement* stmt) {
|
2009-11-04 19:04:29 +00:00
|
|
|
#ifdef ENABLE_DEBUGGER_SUPPORT
|
|
|
|
Comment cmnt(masm_, "[ DebuggerStatement");
|
|
|
|
SetStatementPosition(stmt);
|
|
|
|
__ CallRuntime(Runtime::kDebugBreak, 0);
|
|
|
|
// Ignore the return value.
|
|
|
|
#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
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitFunctionBoilerplateLiteral(
|
|
|
|
FunctionBoilerplateLiteral* expr) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitConditional(Conditional* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ Conditional");
|
2009-11-02 08:44:19 +00:00
|
|
|
ASSERT_EQ(Expression::kTest, expr->condition()->context());
|
|
|
|
ASSERT_EQ(expr->context(), expr->then_expression()->context());
|
|
|
|
ASSERT_EQ(expr->context(), expr->else_expression()->context());
|
|
|
|
|
|
|
|
|
|
|
|
Label true_case, false_case, done;
|
|
|
|
Label* saved_true = true_label_;
|
|
|
|
Label* saved_false = false_label_;
|
|
|
|
|
|
|
|
true_label_ = &true_case;
|
|
|
|
false_label_ = &false_case;
|
|
|
|
Visit(expr->condition());
|
|
|
|
true_label_ = saved_true;
|
|
|
|
false_label_ = saved_false;
|
|
|
|
|
|
|
|
__ bind(&true_case);
|
|
|
|
Visit(expr->then_expression());
|
|
|
|
// If control flow falls through Visit, jump to done.
|
|
|
|
if (expr->context() == Expression::kEffect ||
|
|
|
|
expr->context() == Expression::kValue) {
|
|
|
|
__ jmp(&done);
|
|
|
|
}
|
|
|
|
|
|
|
|
__ bind(&false_case);
|
|
|
|
Visit(expr->else_expression());
|
|
|
|
// If control flow falls through Visit, merge it with true case here.
|
|
|
|
if (expr->context() == Expression::kEffect ||
|
|
|
|
expr->context() == Expression::kValue) {
|
|
|
|
__ bind(&done);
|
|
|
|
}
|
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-16 09:46:09 +00:00
|
|
|
void FastCodeGenerator::VisitSlot(Slot* expr) {
|
|
|
|
// Slots do not appear directly in the AST.
|
|
|
|
UNREACHABLE();
|
Port the initial fast code generator to x64. For the constant true in
top-level code we generate:
0 push rbp
1 movq rbp,rsp
4 push rsi
5 push rdi
6 push [r13+0x8]
10 cmpq rsp,[r13+0x0]
14 jnc 25 (0x7ff2c378ff19)
20 call 0x7ff2c377d260 ;; code: STUB, StackCheck, minor: 0
25 movq r10,0x7ff2e8608199 ;; object: 0x7ff2e8608199 <true>
35 push r10
37 movq rax,[rsp]
41 movq [rbp-0x18],rax
45 pop rax
46 push [rbp-0x18]
50 pop rax
51 movq rsp,rbp ;; js return
54 pop rbp
55 ret 0x8
58 int3
59 int3
60 int3
61 int3
62 int3
63 int3
64 movq rax,[r13+0x8]
68 movq rsp,rbp ;; js return
71 pop rbp
72 ret 0x8
75 int3
76 int3
77 int3
78 int3
79 int3
80 int3
Review URL: http://codereview.chromium.org/264066
git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@3071 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
2009-10-15 11:21:26 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-27 13:38:57 +00:00
|
|
|
void FastCodeGenerator::VisitLiteral(Literal* expr) {
|
2009-11-03 14:48:59 +00:00
|
|
|
Comment cmnt(masm_, "[ Literal");
|
2009-10-30 08:36:46 +00:00
|
|
|
Move(expr->context(), expr);
|
2009-10-27 13:38:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-11-02 11:01:47 +00:00
|
|
|
void FastCodeGenerator::VisitAssignment(Assignment* expr) {
|
|
|
|
Comment cmnt(masm_, "[ Assignment");
|
|
|
|
ASSERT(expr->op() == Token::ASSIGN || expr->op() == Token::INIT_VAR);
|
|
|
|
|
|
|
|
// Record source code position of the (possible) IC call.
|
|
|
|
SetSourcePosition(expr->position());
|
|
|
|
|
2009-12-04 14:30:27 +00:00
|
|
|
// Left-hand side can only be a property, a global or a (parameter or local)
|
|
|
|
// slot. Variables with rewrite to .arguments are treated as KEYED_PROPERTY.
|
|
|
|
enum LhsKind { VARIABLE, NAMED_PROPERTY, KEYED_PROPERTY };
|
|
|
|
LhsKind assign_type = VARIABLE;
|
2009-11-02 11:01:47 +00:00
|
|
|
Property* prop = expr->target()->AsProperty();
|
2009-12-04 14:30:27 +00:00
|
|
|
// In case of a property we use the uninitialized expression context
|
|
|
|
// of the key to detect a named property.
|
|
|
|
if (prop != NULL) {
|
|
|
|
assign_type = (prop->key()->context() == Expression::kUninitialized)
|
|
|
|
? NAMED_PROPERTY
|
|
|
|
: KEYED_PROPERTY;
|
|
|
|
}
|
|
|
|
|
|
|
|
Expression* rhs = expr->value();
|
|
|
|
ASSERT_EQ(Expression::kValue, rhs->context());
|
|
|
|
|
|
|
|
switch (assign_type) {
|
|
|
|
case VARIABLE:
|
|
|
|
Visit(rhs);
|
|
|
|
EmitVariableAssignment(expr);
|
|
|
|
break;
|
|
|
|
case NAMED_PROPERTY:
|
|
|
|
Visit(prop->obj());
|
|
|
|
ASSERT_EQ(Expression::kValue, prop->obj()->context());
|
2009-11-02 11:01:47 +00:00
|
|
|
Visit(rhs);
|
2009-11-02 13:30:24 +00:00
|
|
|
EmitNamedPropertyAssignment(expr);
|
2009-12-04 14:30:27 +00:00
|
|
|
break;
|
|
|
|
case KEYED_PROPERTY:
|
|
|
|
Visit(prop->obj());
|
|
|
|
ASSERT_EQ(Expression::kValue, prop->obj()->context());
|
2009-11-02 11:01:47 +00:00
|
|
|
Visit(prop->key());
|
|
|
|
ASSERT_EQ(Expression::kValue, prop->key()->context());
|
|
|
|
Visit(rhs);
|
2009-11-02 13:30:24 +00:00
|
|
|
EmitKeyedPropertyAssignment(expr);
|
2009-12-04 14:30:27 +00:00
|
|
|
break;
|
2009-11-02 11:01:47 +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
|
|
|
void FastCodeGenerator::VisitCatchExtensionObject(CatchExtensionObject* expr) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void FastCodeGenerator::VisitThrow(Throw* expr) {
|
|
|
|
UNREACHABLE();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
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 __
|
|
|
|
|
|
|
|
|
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
|