Commit 88e0c38c authored by wingo@igalia.com's avatar wingo@igalia.com

Move AST node counting to post-pass

R=mstarzinger@chromium.org, svenpanne@chromium.org
BUG=

Review URL: https://codereview.chromium.org/675493002

Cr-Commit-Position: refs/heads/master@{#24909}
git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@24909 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent abefd291
This diff is collapsed.
...@@ -998,36 +998,30 @@ CaseClause::CaseClause(Zone* zone, Expression* label, ...@@ -998,36 +998,30 @@ CaseClause::CaseClause(Zone* zone, Expression* label,
#define REGULAR_NODE(NodeType) \ #define REGULAR_NODE(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
} }
#define REGULAR_NODE_WITH_FEEDBACK_SLOTS(NodeType) \ #define REGULAR_NODE_WITH_FEEDBACK_SLOTS(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \ add_slot_node(node); \
} }
#define DONT_OPTIMIZE_NODE(NodeType) \ #define DONT_OPTIMIZE_NODE(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \ set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
} }
#define DONT_OPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) \ #define DONT_OPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \ add_slot_node(node); \
set_dont_crankshaft_reason(k##NodeType); \ set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
} }
#define DONT_TURBOFAN_NODE(NodeType) \ #define DONT_TURBOFAN_NODE(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \ set_dont_crankshaft_reason(k##NodeType); \
set_dont_turbofan_reason(k##NodeType); \ set_dont_turbofan_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
} }
#define DONT_TURBOFAN_NODE_WITH_FEEDBACK_SLOTS(NodeType) \ #define DONT_TURBOFAN_NODE_WITH_FEEDBACK_SLOTS(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \ add_slot_node(node); \
set_dont_crankshaft_reason(k##NodeType); \ set_dont_crankshaft_reason(k##NodeType); \
set_dont_turbofan_reason(k##NodeType); \ set_dont_turbofan_reason(k##NodeType); \
...@@ -1035,18 +1029,15 @@ CaseClause::CaseClause(Zone* zone, Expression* label, ...@@ -1035,18 +1029,15 @@ CaseClause::CaseClause(Zone* zone, Expression* label,
} }
#define DONT_SELFOPTIMIZE_NODE(NodeType) \ #define DONT_SELFOPTIMIZE_NODE(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
} }
#define DONT_SELFOPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) \ #define DONT_SELFOPTIMIZE_NODE_WITH_FEEDBACK_SLOTS(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
add_slot_node(node); \ add_slot_node(node); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
} }
#define DONT_CACHE_NODE(NodeType) \ #define DONT_CACHE_NODE(NodeType) \
void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \ void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
increase_node_count(); \
set_dont_crankshaft_reason(k##NodeType); \ set_dont_crankshaft_reason(k##NodeType); \
add_flag(kDontSelfOptimize); \ add_flag(kDontSelfOptimize); \
add_flag(kDontCache); \ add_flag(kDontCache); \
...@@ -1120,7 +1111,6 @@ DONT_CACHE_NODE(ModuleLiteral) ...@@ -1120,7 +1111,6 @@ DONT_CACHE_NODE(ModuleLiteral)
void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) { void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) {
increase_node_count();
add_slot_node(node); add_slot_node(node);
if (node->is_jsruntime()) { if (node->is_jsruntime()) {
// Don't try to optimize JS runtime calls because we bailout on them. // Don't try to optimize JS runtime calls because we bailout on them.
......
...@@ -3144,7 +3144,6 @@ class AstConstructionVisitor BASE_EMBEDDED { ...@@ -3144,7 +3144,6 @@ class AstConstructionVisitor BASE_EMBEDDED {
AST_NODE_LIST(DEF_VISIT) AST_NODE_LIST(DEF_VISIT)
#undef DEF_VISIT #undef DEF_VISIT
void increase_node_count() { properties_.add_node_count(1); }
void add_flag(AstPropertiesFlag flag) { properties_.flags()->Add(flag); } void add_flag(AstPropertiesFlag flag) { properties_.flags()->Add(flag); }
void set_dont_crankshaft_reason(BailoutReason reason) { void set_dont_crankshaft_reason(BailoutReason reason) {
dont_crankshaft_reason_ = reason; dont_crankshaft_reason_ = reason;
......
...@@ -647,11 +647,7 @@ static void RecordFunctionCompilation(Logger::LogEventsAndTags tag, ...@@ -647,11 +647,7 @@ static void RecordFunctionCompilation(Logger::LogEventsAndTags tag,
static bool CompileUnoptimizedCode(CompilationInfo* info) { static bool CompileUnoptimizedCode(CompilationInfo* info) {
DCHECK(AllowCompilation::IsAllowed(info->isolate())); DCHECK(AllowCompilation::IsAllowed(info->isolate()));
DCHECK(info->function() != NULL); if (!Compiler::Analyze(info)) return false;
if (!Rewriter::Rewrite(info)) return false;
if (!Scope::Analyze(info)) return false;
DCHECK(info->scope() != NULL);
if (!FullCodeGenerator::MakeCode(info)) { if (!FullCodeGenerator::MakeCode(info)) {
Isolate* isolate = info->isolate(); Isolate* isolate = info->isolate();
if (!isolate->has_pending_exception()) isolate->StackOverflow(); if (!isolate->has_pending_exception()) isolate->StackOverflow();
...@@ -673,7 +669,6 @@ MUST_USE_RESULT static MaybeHandle<Code> GetUnoptimizedCodeCommon( ...@@ -673,7 +669,6 @@ MUST_USE_RESULT static MaybeHandle<Code> GetUnoptimizedCodeCommon(
shared->set_strict_mode(lit->strict_mode()); shared->set_strict_mode(lit->strict_mode());
SetExpectedNofPropertiesFromEstimate(shared, lit->expected_property_count()); SetExpectedNofPropertiesFromEstimate(shared, lit->expected_property_count());
shared->set_bailout_reason(lit->dont_optimize_reason()); shared->set_bailout_reason(lit->dont_optimize_reason());
shared->set_ast_node_count(lit->ast_node_count());
// Compile unoptimized code. // Compile unoptimized code.
if (!CompileUnoptimizedCode(info)) return MaybeHandle<Code>(); if (!CompileUnoptimizedCode(info)) return MaybeHandle<Code>();
...@@ -743,18 +738,33 @@ static void InsertCodeIntoOptimizedCodeMap(CompilationInfo* info) { ...@@ -743,18 +738,33 @@ static void InsertCodeIntoOptimizedCodeMap(CompilationInfo* info) {
} }
static bool CompileOptimizedPrologue(CompilationInfo* info) { static bool Renumber(CompilationInfo* info) {
if (!Parser::Parse(info)) return false; if (!AstNumbering::Renumber(info->function(), info->zone())) return false;
if (!info->shared_info().is_null()) {
info->shared_info()->set_ast_node_count(info->function()->ast_node_count());
}
return true;
}
bool Compiler::Analyze(CompilationInfo* info) {
DCHECK(info->function() != NULL);
if (!Rewriter::Rewrite(info)) return false; if (!Rewriter::Rewrite(info)) return false;
if (!Scope::Analyze(info)) return false; if (!Scope::Analyze(info)) return false;
if (!AstNumbering::Renumber(info->function(), info->zone())) return false; if (!Renumber(info)) return false;
DCHECK(info->scope() != NULL); DCHECK(info->scope() != NULL);
return true; return true;
} }
bool Compiler::ParseAndAnalyze(CompilationInfo* info) {
if (!Parser::Parse(info)) return false;
return Compiler::Analyze(info);
}
static bool GetOptimizedCodeNow(CompilationInfo* info) { static bool GetOptimizedCodeNow(CompilationInfo* info) {
if (!CompileOptimizedPrologue(info)) return false; if (!Compiler::ParseAndAnalyze(info)) return false;
TimerEventScope<TimerEventRecompileSynchronous> timer(info->isolate()); TimerEventScope<TimerEventRecompileSynchronous> timer(info->isolate());
...@@ -796,7 +806,7 @@ static bool GetOptimizedCodeLater(CompilationInfo* info) { ...@@ -796,7 +806,7 @@ static bool GetOptimizedCodeLater(CompilationInfo* info) {
} }
CompilationHandleScope handle_scope(info); CompilationHandleScope handle_scope(info);
if (!CompileOptimizedPrologue(info)) return false; if (!Compiler::ParseAndAnalyze(info)) return false;
info->SaveHandles(); // Copy handles to the compilation handle scope. info->SaveHandles(); // Copy handles to the compilation handle scope.
TimerEventScope<TimerEventRecompileSynchronous> timer(info->isolate()); TimerEventScope<TimerEventRecompileSynchronous> timer(info->isolate());
...@@ -910,6 +920,8 @@ bool Compiler::EnsureCompiled(Handle<JSFunction> function, ...@@ -910,6 +920,8 @@ bool Compiler::EnsureCompiled(Handle<JSFunction> function,
// TODO(turbofan): In the future, unoptimized code with deopt support could // TODO(turbofan): In the future, unoptimized code with deopt support could
// be generated lazily once deopt is triggered. // be generated lazily once deopt is triggered.
bool Compiler::EnsureDeoptimizationSupport(CompilationInfo* info) { bool Compiler::EnsureDeoptimizationSupport(CompilationInfo* info) {
DCHECK(info->function() != NULL);
DCHECK(info->scope() != NULL);
if (!info->shared_info()->has_deoptimization_support()) { if (!info->shared_info()->has_deoptimization_support()) {
CompilationInfoWithZone unoptimized(info->shared_info()); CompilationInfoWithZone unoptimized(info->shared_info());
// Note that we use the same AST that we will use for generating the // Note that we use the same AST that we will use for generating the
...@@ -1304,7 +1316,7 @@ Handle<SharedFunctionInfo> Compiler::BuildFunctionInfo( ...@@ -1304,7 +1316,7 @@ Handle<SharedFunctionInfo> Compiler::BuildFunctionInfo(
Handle<Code> code = isolate->builtins()->CompileLazy(); Handle<Code> code = isolate->builtins()->CompileLazy();
info.SetCode(code); info.SetCode(code);
scope_info = Handle<ScopeInfo>(ScopeInfo::Empty(isolate)); scope_info = Handle<ScopeInfo>(ScopeInfo::Empty(isolate));
} else if (FullCodeGenerator::MakeCode(&info)) { } else if (Renumber(&info) && FullCodeGenerator::MakeCode(&info)) {
DCHECK(!info.code().is_null()); DCHECK(!info.code().is_null());
scope_info = ScopeInfo::Create(info.scope(), info.zone()); scope_info = ScopeInfo::Create(info.scope(), info.zone());
} else { } else {
......
...@@ -675,11 +675,16 @@ class Compiler : public AllStatic { ...@@ -675,11 +675,16 @@ class Compiler : public AllStatic {
MUST_USE_RESULT static MaybeHandle<Code> GetDebugCode( MUST_USE_RESULT static MaybeHandle<Code> GetDebugCode(
Handle<JSFunction> function); Handle<JSFunction> function);
// Parser::Parse, then Compiler::Analyze.
static bool ParseAndAnalyze(CompilationInfo* info);
// Rewrite, analyze scopes, and renumber.
static bool Analyze(CompilationInfo* info);
// Adds deoptimization support, requires ParseAndAnalyze.
static bool EnsureDeoptimizationSupport(CompilationInfo* info);
static bool EnsureCompiled(Handle<JSFunction> function, static bool EnsureCompiled(Handle<JSFunction> function,
ClearExceptionFlag flag); ClearExceptionFlag flag);
static bool EnsureDeoptimizationSupport(CompilationInfo* info);
static void CompileForLiveEdit(Handle<Script> script); static void CompileForLiveEdit(Handle<Script> script);
// Compile a String source within a context for eval. // Compile a String source within a context for eval.
......
...@@ -59,17 +59,6 @@ void JSInliner::Inline() { ...@@ -59,17 +59,6 @@ void JSInliner::Inline() {
} }
// TODO(sigurds) Find a home for this function and reuse it everywhere (esp. in
// test cases, where similar code is currently duplicated).
static void Parse(Handle<JSFunction> function, CompilationInfoWithZone* info) {
CHECK(Parser::Parse(info));
CHECK(Rewriter::Rewrite(info));
CHECK(Scope::Analyze(info));
CHECK(AstNumbering::Renumber(info->function(), info->zone()));
CHECK(Compiler::EnsureDeoptimizationSupport(info));
}
// A facade on a JSFunction's graph to facilitate inlining. It assumes the // A facade on a JSFunction's graph to facilitate inlining. It assumes the
// that the function graph has only one return statement, and provides // that the function graph has only one return statement, and provides
// {UnifyReturn} to convert a function graph to that end. // {UnifyReturn} to convert a function graph to that end.
...@@ -385,7 +374,8 @@ void JSInliner::TryInlineJSCall(Node* call_node) { ...@@ -385,7 +374,8 @@ void JSInliner::TryInlineJSCall(Node* call_node) {
} }
CompilationInfoWithZone info(function); CompilationInfoWithZone info(function);
Parse(function, &info); CHECK(Compiler::ParseAndAnalyze(&info));
CHECK(Compiler::EnsureDeoptimizationSupport(&info));
if (info.scope()->arguments() != NULL && info.strict_mode() != STRICT) { if (info.scope()->arguments() != NULL && info.strict_mode() != STRICT) {
// For now do not inline functions that use their arguments array. // For now do not inline functions that use their arguments array.
......
...@@ -308,11 +308,6 @@ bool FullCodeGenerator::MakeCode(CompilationInfo* info) { ...@@ -308,11 +308,6 @@ bool FullCodeGenerator::MakeCode(CompilationInfo* info) {
TimerEventScope<TimerEventCompileFullCode> timer(info->isolate()); TimerEventScope<TimerEventCompileFullCode> timer(info->isolate());
if (!AstNumbering::Renumber(info->function(), info->zone())) {
DCHECK(!isolate->has_pending_exception());
return false;
}
Handle<Script> script = info->script(); Handle<Script> script = info->script();
if (!script->IsUndefined() && !script->source()->IsUndefined()) { if (!script->IsUndefined() && !script->source()->IsUndefined()) {
int len = String::cast(script->source())->length(); int len = String::cast(script->source())->length();
......
...@@ -7845,8 +7845,7 @@ bool HOptimizedGraphBuilder::TryInline(Handle<JSFunction> target, ...@@ -7845,8 +7845,7 @@ bool HOptimizedGraphBuilder::TryInline(Handle<JSFunction> target,
// step, but don't transfer ownership to target_info. // step, but don't transfer ownership to target_info.
target_info.SetAstValueFactory(top_info()->ast_value_factory(), false); target_info.SetAstValueFactory(top_info()->ast_value_factory(), false);
Handle<SharedFunctionInfo> target_shared(target->shared()); Handle<SharedFunctionInfo> target_shared(target->shared());
if (!Parser::Parse(&target_info) || !Scope::Analyze(&target_info) || if (!Compiler::ParseAndAnalyze(&target_info)) {
!AstNumbering::Renumber(target_info.function(), target_info.zone())) {
if (target_info.isolate()->has_pending_exception()) { if (target_info.isolate()->has_pending_exception()) {
// Parse or scope error, never optimize this function. // Parse or scope error, never optimize this function.
SetStackOverflow(); SetStackOverflow();
......
...@@ -165,9 +165,7 @@ class FunctionTester : public InitializedHandleScope { ...@@ -165,9 +165,7 @@ class FunctionTester : public InitializedHandleScope {
if (flags_ & CompilationInfo::kTypingEnabled) { if (flags_ & CompilationInfo::kTypingEnabled) {
info.MarkAsTypingEnabled(); info.MarkAsTypingEnabled();
} }
CHECK(Rewriter::Rewrite(&info)); CHECK(Compiler::Analyze(&info));
CHECK(Scope::Analyze(&info));
CHECK(AstNumbering::Renumber(info.function(), info.zone()));
CHECK(Compiler::EnsureDeoptimizationSupport(&info)); CHECK(Compiler::EnsureDeoptimizationSupport(&info));
Pipeline pipeline(&info); Pipeline pipeline(&info);
...@@ -215,9 +213,7 @@ class FunctionTester : public InitializedHandleScope { ...@@ -215,9 +213,7 @@ class FunctionTester : public InitializedHandleScope {
CHECK(Parser::Parse(&info)); CHECK(Parser::Parse(&info));
info.SetOptimizing(BailoutId::None(), info.SetOptimizing(BailoutId::None(),
Handle<Code>(function->shared()->code())); Handle<Code>(function->shared()->code()));
CHECK(Rewriter::Rewrite(&info)); CHECK(Compiler::Analyze(&info));
CHECK(Scope::Analyze(&info));
CHECK(AstNumbering::Renumber(info.function(), info.zone()));
CHECK(Compiler::EnsureDeoptimizationSupport(&info)); CHECK(Compiler::EnsureDeoptimizationSupport(&info));
Pipeline pipeline(&info); Pipeline pipeline(&info);
......
...@@ -47,9 +47,7 @@ class DeoptCodegenTester { ...@@ -47,9 +47,7 @@ class DeoptCodegenTester {
bailout_id(-1) { bailout_id(-1) {
CHECK(Parser::Parse(&info)); CHECK(Parser::Parse(&info));
info.SetOptimizing(BailoutId::None(), Handle<Code>(function->code())); info.SetOptimizing(BailoutId::None(), Handle<Code>(function->code()));
CHECK(Rewriter::Rewrite(&info)); CHECK(Compiler::Analyze(&info));
CHECK(Scope::Analyze(&info));
CHECK(AstNumbering::Renumber(info.function(), info.zone()));
CHECK(Compiler::EnsureDeoptimizationSupport(&info)); CHECK(Compiler::EnsureDeoptimizationSupport(&info));
DCHECK(info.shared_info()->has_deoptimization_support()); DCHECK(info.shared_info()->has_deoptimization_support());
......
...@@ -23,11 +23,7 @@ TEST(PipelineAdd) { ...@@ -23,11 +23,7 @@ TEST(PipelineAdd) {
*v8::Handle<v8::Function>::Cast(CompileRun(source))); *v8::Handle<v8::Function>::Cast(CompileRun(source)));
CompilationInfoWithZone info(function); CompilationInfoWithZone info(function);
CHECK(Parser::Parse(&info)); CHECK(Compiler::ParseAndAnalyze(&info));
CHECK(Rewriter::Rewrite(&info));
CHECK(Scope::Analyze(&info));
CHECK(AstNumbering::Renumber(info.function(), info.zone()));
CHECK_NE(NULL, info.scope());
Pipeline pipeline(&info); Pipeline pipeline(&info);
#if V8_TURBOFAN_TARGET #if V8_TURBOFAN_TARGET
......
...@@ -3273,9 +3273,7 @@ TEST(InnerAssignment) { ...@@ -3273,9 +3273,7 @@ TEST(InnerAssignment) {
i::Parser parser(&info, &parse_info); i::Parser parser(&info, &parse_info);
parser.set_allow_harmony_scoping(true); parser.set_allow_harmony_scoping(true);
CHECK(parser.Parse()); CHECK(parser.Parse());
CHECK(i::Rewriter::Rewrite(&info)); CHECK(i::Compiler::Analyze(&info));
CHECK(i::Scope::Analyze(&info));
CHECK(i::AstNumbering::Renumber(info.function(), info.zone()));
CHECK(info.function() != NULL); CHECK(info.function() != NULL);
i::Scope* scope = info.function()->scope(); i::Scope* scope = info.function()->scope();
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment