2012-02-08 13:53:24 +00:00
|
|
|
// Copyright 2012 the V8 project authors. All rights reserved.
|
2014-04-29 06:42:26 +00:00
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
2008-07-03 15:10:15 +00:00
|
|
|
|
2015-08-14 09:41:32 +00:00
|
|
|
#include "src/codegen.h"
|
2014-06-03 08:12:43 +00:00
|
|
|
|
2015-01-30 08:01:53 +00:00
|
|
|
#if defined(V8_OS_AIX)
|
2015-09-07 14:24:05 +00:00
|
|
|
#include <fenv.h> // NOLINT(build/c++11)
|
2015-01-30 08:01:53 +00:00
|
|
|
#endif
|
2015-11-26 16:22:34 +00:00
|
|
|
#include "src/ast/prettyprinter.h"
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/bootstrapper.h"
|
|
|
|
#include "src/compiler.h"
|
2015-07-31 11:07:50 +00:00
|
|
|
#include "src/debug/debug.h"
|
2015-11-26 16:22:34 +00:00
|
|
|
#include "src/parsing/parser.h"
|
2015-09-28 19:34:08 +00:00
|
|
|
#include "src/profiler/cpu-profiler.h"
|
2014-09-25 07:16:15 +00:00
|
|
|
#include "src/runtime/runtime.h"
|
2008-07-03 15:10:15 +00:00
|
|
|
|
2009-05-25 10:05:56 +00:00
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
2008-07-03 15:10:15 +00:00
|
|
|
|
2014-05-06 11:14:37 +00:00
|
|
|
|
2015-11-26 10:11:42 +00:00
|
|
|
#if defined(V8_OS_WIN)
|
2014-05-06 11:14:37 +00:00
|
|
|
double modulo(double x, double y) {
|
|
|
|
// Workaround MS fmod bugs. ECMA-262 says:
|
|
|
|
// dividend is finite and divisor is an infinity => result equals dividend
|
|
|
|
// dividend is a zero and divisor is nonzero finite => result equals dividend
|
|
|
|
if (!(std::isfinite(x) && (!std::isfinite(y) && !std::isnan(y))) &&
|
|
|
|
!(x == 0 && (y != 0 && std::isfinite(y)))) {
|
|
|
|
x = fmod(x, y);
|
|
|
|
}
|
|
|
|
return x;
|
|
|
|
}
|
|
|
|
#else // POSIX
|
|
|
|
|
|
|
|
double modulo(double x, double y) {
|
2015-01-30 08:01:53 +00:00
|
|
|
#if defined(V8_OS_AIX)
|
|
|
|
// AIX raises an underflow exception for (Number.MIN_VALUE % Number.MAX_VALUE)
|
|
|
|
feclearexcept(FE_ALL_EXCEPT);
|
|
|
|
double result = std::fmod(x, y);
|
|
|
|
int exception = fetestexcept(FE_UNDERFLOW);
|
|
|
|
return (exception ? x : result);
|
|
|
|
#else
|
2014-05-06 11:14:37 +00:00
|
|
|
return std::fmod(x, y);
|
2015-01-30 08:01:53 +00:00
|
|
|
#endif
|
2014-05-06 11:14:37 +00:00
|
|
|
}
|
2015-11-26 10:11:42 +00:00
|
|
|
#endif // defined(V8_OS_WIN)
|
2014-05-06 11:14:37 +00:00
|
|
|
|
|
|
|
|
2015-11-25 16:37:11 +00:00
|
|
|
#define UNARY_MATH_FUNCTION(name, generator) \
|
|
|
|
static UnaryMathFunctionWithIsolate fast_##name##_function = nullptr; \
|
|
|
|
double std_##name(double x, Isolate* isolate) { return std::name(x); } \
|
|
|
|
void init_fast_##name##_function(Isolate* isolate) { \
|
|
|
|
if (FLAG_fast_math) fast_##name##_function = generator(isolate); \
|
|
|
|
if (!fast_##name##_function) fast_##name##_function = std_##name; \
|
|
|
|
} \
|
|
|
|
void lazily_initialize_fast_##name(Isolate* isolate) { \
|
|
|
|
if (!fast_##name##_function) init_fast_##name##_function(isolate); \
|
|
|
|
} \
|
|
|
|
double fast_##name(double x, Isolate* isolate) { \
|
|
|
|
return (*fast_##name##_function)(x, isolate); \
|
|
|
|
}
|
2014-05-06 11:14:37 +00:00
|
|
|
|
2015-11-25 16:37:11 +00:00
|
|
|
UNARY_MATH_FUNCTION(sqrt, CreateSqrtFunction)
|
|
|
|
UNARY_MATH_FUNCTION(exp, CreateExpFunction)
|
2014-05-06 11:14:37 +00:00
|
|
|
|
|
|
|
#undef UNARY_MATH_FUNCTION
|
|
|
|
|
|
|
|
|
2010-02-08 08:54:27 +00:00
|
|
|
#define __ ACCESS_MASM(masm_)
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
|
|
|
Comment::Comment(MacroAssembler* masm, const char* msg)
|
|
|
|
: masm_(masm), msg_(msg) {
|
|
|
|
__ RecordComment(msg);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
Comment::~Comment() {
|
|
|
|
if (msg_[0] == '[') __ RecordComment("]");
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif // DEBUG
|
|
|
|
|
|
|
|
#undef __
|
|
|
|
|
2009-05-15 11:09:51 +00:00
|
|
|
|
2013-05-24 10:57:59 +00:00
|
|
|
void CodeGenerator::MakeCodePrologue(CompilationInfo* info, const char* kind) {
|
2008-10-10 00:00:52 +00:00
|
|
|
bool print_source = false;
|
|
|
|
bool print_ast = false;
|
|
|
|
const char* ftype;
|
|
|
|
|
2013-05-24 10:57:59 +00:00
|
|
|
if (info->isolate()->bootstrapper()->IsActive()) {
|
2008-10-10 00:00:52 +00:00
|
|
|
print_source = FLAG_print_builtin_source;
|
|
|
|
print_ast = FLAG_print_builtin_ast;
|
|
|
|
ftype = "builtin";
|
|
|
|
} else {
|
|
|
|
print_source = FLAG_print_source;
|
|
|
|
print_ast = FLAG_print_ast;
|
|
|
|
ftype = "user-defined";
|
|
|
|
}
|
|
|
|
|
|
|
|
if (FLAG_trace_codegen || print_source || print_ast) {
|
2015-08-24 10:23:39 +00:00
|
|
|
base::SmartArrayPointer<char> name = info->GetDebugName();
|
2015-10-26 13:41:04 +00:00
|
|
|
PrintF("[generating %s code for %s function: %s]\n", kind, ftype,
|
|
|
|
name.get());
|
2008-10-10 00:00:52 +00:00
|
|
|
}
|
|
|
|
|
2013-05-24 10:57:59 +00:00
|
|
|
#ifdef DEBUG
|
2015-03-09 14:51:13 +00:00
|
|
|
if (info->parse_info() && print_source) {
|
2010-02-03 16:12:55 +00:00
|
|
|
PrintF("--- Source from AST ---\n%s\n",
|
2015-10-15 10:34:10 +00:00
|
|
|
PrettyPrinter(info->isolate()).PrintProgram(info->literal()));
|
2008-10-10 00:00:52 +00:00
|
|
|
}
|
|
|
|
|
2015-03-09 14:51:13 +00:00
|
|
|
if (info->parse_info() && print_ast) {
|
2015-10-15 10:34:10 +00:00
|
|
|
PrintF("--- AST ---\n%s\n",
|
|
|
|
AstPrinter(info->isolate()).PrintProgram(info->literal()));
|
2008-10-10 00:00:52 +00:00
|
|
|
}
|
|
|
|
#endif // DEBUG
|
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
|
|
|
}
|
2008-10-10 00:00:52 +00:00
|
|
|
|
|
|
|
|
2010-02-03 16:12:55 +00:00
|
|
|
Handle<Code> CodeGenerator::MakeCodeEpilogue(MacroAssembler* masm,
|
|
|
|
CompilationInfo* info) {
|
2011-03-23 11:13:07 +00:00
|
|
|
Isolate* isolate = info->isolate();
|
|
|
|
|
2015-09-23 14:00:23 +00:00
|
|
|
Code::Flags flags;
|
|
|
|
if (info->IsStub() && info->code_stub()) {
|
|
|
|
DCHECK_EQ(info->output_code_kind(), info->code_stub()->GetCodeKind());
|
|
|
|
flags = Code::ComputeFlags(
|
|
|
|
info->output_code_kind(), info->code_stub()->GetICState(),
|
|
|
|
info->code_stub()->GetExtraICState(), info->code_stub()->GetStubType());
|
|
|
|
} else {
|
|
|
|
flags = Code::ComputeFlags(info->output_code_kind());
|
|
|
|
}
|
2015-08-21 15:10:38 +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
|
|
|
// Allocate and install the code.
|
2008-10-10 00:00:52 +00:00
|
|
|
CodeDesc desc;
|
2013-04-18 09:50:46 +00:00
|
|
|
bool is_crankshafted =
|
|
|
|
Code::ExtractKindFromFlags(flags) == Code::OPTIMIZED_FUNCTION ||
|
|
|
|
info->IsStub();
|
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
|
|
|
masm->GetCode(&desc);
|
2011-03-23 11:13:07 +00:00
|
|
|
Handle<Code> code =
|
2013-04-18 09:50:46 +00:00
|
|
|
isolate->factory()->NewCode(desc, flags, masm->CodeObject(),
|
2013-10-23 13:48:04 +00:00
|
|
|
false, is_crankshafted,
|
2014-05-12 13:47:01 +00:00
|
|
|
info->prologue_offset(),
|
2014-06-26 06:32:51 +00:00
|
|
|
info->is_debug() && !is_crankshafted);
|
2013-08-16 19:52:29 +00:00
|
|
|
isolate->counters()->total_compiled_code_size()->Increment(
|
|
|
|
code->instruction_size());
|
2013-10-14 14:00:28 +00:00
|
|
|
isolate->heap()->IncrementCodeGeneratedBytes(is_crankshafted,
|
|
|
|
code->instruction_size());
|
2010-12-07 11:31:57 +00:00
|
|
|
return code;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void CodeGenerator::PrintCode(Handle<Code> code, CompilationInfo* info) {
|
2008-10-10 00:00:52 +00:00
|
|
|
#ifdef ENABLE_DISASSEMBLER
|
2013-07-24 14:28:56 +00:00
|
|
|
AllowDeferredHandleDereference allow_deference_for_print_code;
|
2013-09-03 06:57:16 +00:00
|
|
|
bool print_code = info->isolate()->bootstrapper()->IsActive()
|
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
|
|
|
? FLAG_print_builtin_code
|
2013-02-05 18:00:42 +00:00
|
|
|
: (FLAG_print_code ||
|
|
|
|
(info->IsStub() && FLAG_print_code_stubs) ||
|
|
|
|
(info->IsOptimizing() && FLAG_print_opt_code));
|
2012-03-14 09:45:17 +00:00
|
|
|
if (print_code) {
|
2015-08-24 10:23:39 +00:00
|
|
|
base::SmartArrayPointer<char> debug_name = info->GetDebugName();
|
2013-11-07 16:35:27 +00:00
|
|
|
CodeTracer::Scope tracing_scope(info->isolate()->GetCodeTracer());
|
2014-07-07 09:57:29 +00:00
|
|
|
OFStream os(tracing_scope.file());
|
2015-03-09 14:51:13 +00:00
|
|
|
|
|
|
|
// Print the source code if available.
|
|
|
|
bool print_source =
|
|
|
|
info->parse_info() && (code->kind() == Code::OPTIMIZED_FUNCTION ||
|
|
|
|
code->kind() == Code::FUNCTION);
|
2013-10-21 13:35:48 +00:00
|
|
|
if (print_source) {
|
2015-08-19 16:51:37 +00:00
|
|
|
FunctionLiteral* literal = info->literal();
|
2012-12-18 16:25:45 +00:00
|
|
|
Handle<Script> script = info->script();
|
|
|
|
if (!script->IsUndefined() && !script->source()->IsUndefined()) {
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "--- Raw source ---\n";
|
2012-12-31 11:13:50 +00:00
|
|
|
StringCharacterStream stream(String::cast(script->source()),
|
2015-08-19 16:51:37 +00:00
|
|
|
literal->start_position());
|
2012-12-18 16:25:45 +00:00
|
|
|
// fun->end_position() points to the last character in the stream. We
|
|
|
|
// need to compensate by adding one to calculate the length.
|
|
|
|
int source_len =
|
2015-08-19 16:51:37 +00:00
|
|
|
literal->end_position() - literal->start_position() + 1;
|
2012-12-18 16:25:45 +00:00
|
|
|
for (int i = 0; i < source_len; i++) {
|
2013-11-07 16:35:27 +00:00
|
|
|
if (stream.HasMore()) {
|
2014-09-09 10:33:33 +00:00
|
|
|
os << AsReversiblyEscapedUC16(stream.GetNext());
|
2013-11-07 16:35:27 +00:00
|
|
|
}
|
2012-12-18 16:25:45 +00:00
|
|
|
}
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "\n\n";
|
2008-10-10 00:00:52 +00:00
|
|
|
}
|
|
|
|
}
|
2010-12-17 14:16:00 +00:00
|
|
|
if (info->IsOptimizing()) {
|
2015-03-09 14:51:13 +00:00
|
|
|
if (FLAG_print_unopt_code && info->parse_info()) {
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "--- Unoptimized code ---\n";
|
2015-08-24 10:23:39 +00:00
|
|
|
info->closure()->shared()->code()->Disassemble(debug_name.get(), os);
|
2010-12-17 14:16:00 +00:00
|
|
|
}
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "--- Optimized code ---\n"
|
|
|
|
<< "optimization_id = " << info->optimization_id() << "\n";
|
2010-12-17 14:16:00 +00:00
|
|
|
} else {
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "--- Code ---\n";
|
2010-12-17 14:16:00 +00:00
|
|
|
}
|
2013-10-21 13:35:48 +00:00
|
|
|
if (print_source) {
|
2015-08-19 16:51:37 +00:00
|
|
|
FunctionLiteral* literal = info->literal();
|
|
|
|
os << "source_position = " << literal->start_position() << "\n";
|
2013-10-21 13:35:48 +00:00
|
|
|
}
|
2015-08-24 10:23:39 +00:00
|
|
|
code->Disassemble(debug_name.get(), os);
|
2014-07-07 09:57:29 +00:00
|
|
|
os << "--- End code ---\n";
|
2008-10-10 00:00:52 +00:00
|
|
|
}
|
|
|
|
#endif // ENABLE_DISASSEMBLER
|
|
|
|
}
|
|
|
|
|
2015-06-01 22:46:54 +00:00
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|