1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
5 #include "src/compiler/ast-loop-assignment-analyzer.h"
6 #include "src/compiler.h"
7 #include "src/parser.h"
13 typedef class AstLoopAssignmentAnalyzer ALAA; // for code shortitude.
15 ALAA::AstLoopAssignmentAnalyzer(Zone* zone, CompilationInfo* info)
16 : info_(info), loop_stack_(zone) {
17 InitializeAstVisitor(info->isolate(), zone);
21 LoopAssignmentAnalysis* ALAA::Analyze() {
22 LoopAssignmentAnalysis* a = new (zone()) LoopAssignmentAnalysis(zone());
24 VisitStatements(info()->function()->body());
30 void ALAA::Enter(IterationStatement* loop) {
31 int num_variables = 1 + info()->scope()->num_parameters() +
32 info()->scope()->num_stack_slots();
33 BitVector* bits = new (zone()) BitVector(num_variables, zone());
34 if (info()->is_osr() && info()->osr_ast_id() == loop->OsrEntryId())
36 loop_stack_.push_back(bits);
40 void ALAA::Exit(IterationStatement* loop) {
41 DCHECK(loop_stack_.size() > 0);
42 BitVector* bits = loop_stack_.back();
43 loop_stack_.pop_back();
44 if (!loop_stack_.empty()) {
45 loop_stack_.back()->Union(*bits);
47 result_->list_.push_back(
48 std::pair<IterationStatement*, BitVector*>(loop, bits));
52 // ---------------------------------------------------------------------------
53 // -- Leaf nodes -------------------------------------------------------------
54 // ---------------------------------------------------------------------------
56 void ALAA::VisitVariableDeclaration(VariableDeclaration* leaf) {}
57 void ALAA::VisitFunctionDeclaration(FunctionDeclaration* leaf) {}
58 void ALAA::VisitModuleDeclaration(ModuleDeclaration* leaf) {}
59 void ALAA::VisitImportDeclaration(ImportDeclaration* leaf) {}
60 void ALAA::VisitExportDeclaration(ExportDeclaration* leaf) {}
61 void ALAA::VisitModulePath(ModulePath* leaf) {}
62 void ALAA::VisitModuleUrl(ModuleUrl* leaf) {}
63 void ALAA::VisitEmptyStatement(EmptyStatement* leaf) {}
64 void ALAA::VisitContinueStatement(ContinueStatement* leaf) {}
65 void ALAA::VisitBreakStatement(BreakStatement* leaf) {}
66 void ALAA::VisitDebuggerStatement(DebuggerStatement* leaf) {}
67 void ALAA::VisitFunctionLiteral(FunctionLiteral* leaf) {}
68 void ALAA::VisitNativeFunctionLiteral(NativeFunctionLiteral* leaf) {}
69 void ALAA::VisitVariableProxy(VariableProxy* leaf) {}
70 void ALAA::VisitLiteral(Literal* leaf) {}
71 void ALAA::VisitRegExpLiteral(RegExpLiteral* leaf) {}
72 void ALAA::VisitThisFunction(ThisFunction* leaf) {}
73 void ALAA::VisitSuperReference(SuperReference* leaf) {}
76 // ---------------------------------------------------------------------------
77 // -- Pass-through nodes------------------------------------------------------
78 // ---------------------------------------------------------------------------
79 void ALAA::VisitModuleLiteral(ModuleLiteral* e) { Visit(e->body()); }
82 void ALAA::VisitBlock(Block* stmt) { VisitStatements(stmt->statements()); }
85 void ALAA::VisitExpressionStatement(ExpressionStatement* stmt) {
86 Visit(stmt->expression());
90 void ALAA::VisitIfStatement(IfStatement* stmt) {
91 Visit(stmt->condition());
92 Visit(stmt->then_statement());
93 Visit(stmt->else_statement());
97 void ALAA::VisitReturnStatement(ReturnStatement* stmt) {
98 Visit(stmt->expression());
102 void ALAA::VisitWithStatement(WithStatement* stmt) {
103 Visit(stmt->expression());
104 Visit(stmt->statement());
108 void ALAA::VisitSwitchStatement(SwitchStatement* stmt) {
110 ZoneList<CaseClause*>* clauses = stmt->cases();
111 for (int i = 0; i < clauses->length(); i++) {
112 Visit(clauses->at(i));
117 void ALAA::VisitTryFinallyStatement(TryFinallyStatement* stmt) {
118 Visit(stmt->try_block());
119 Visit(stmt->finally_block());
123 void ALAA::VisitClassLiteral(ClassLiteral* e) {
124 VisitIfNotNull(e->extends());
125 VisitIfNotNull(e->constructor());
126 ZoneList<ObjectLiteralProperty*>* properties = e->properties();
127 for (int i = 0; i < properties->length(); i++) {
128 Visit(properties->at(i)->value());
133 void ALAA::VisitConditional(Conditional* e) {
134 Visit(e->condition());
135 Visit(e->then_expression());
136 Visit(e->else_expression());
140 void ALAA::VisitObjectLiteral(ObjectLiteral* e) {
141 ZoneList<ObjectLiteralProperty*>* properties = e->properties();
142 for (int i = 0; i < properties->length(); i++) {
143 Visit(properties->at(i)->value());
148 void ALAA::VisitArrayLiteral(ArrayLiteral* e) { VisitExpressions(e->values()); }
151 void ALAA::VisitYield(Yield* stmt) {
152 Visit(stmt->generator_object());
153 Visit(stmt->expression());
157 void ALAA::VisitThrow(Throw* stmt) { Visit(stmt->exception()); }
160 void ALAA::VisitProperty(Property* e) {
166 void ALAA::VisitCall(Call* e) {
167 Visit(e->expression());
168 VisitExpressions(e->arguments());
172 void ALAA::VisitCallNew(CallNew* e) {
173 Visit(e->expression());
174 VisitExpressions(e->arguments());
178 void ALAA::VisitCallRuntime(CallRuntime* e) {
179 VisitExpressions(e->arguments());
183 void ALAA::VisitUnaryOperation(UnaryOperation* e) { Visit(e->expression()); }
186 void ALAA::VisitBinaryOperation(BinaryOperation* e) {
192 void ALAA::VisitCompareOperation(CompareOperation* e) {
198 void ALAA::VisitCaseClause(CaseClause* cc) {
199 if (!cc->is_default()) Visit(cc->label());
200 VisitStatements(cc->statements());
204 // ---------------------------------------------------------------------------
205 // -- Interesting nodes-------------------------------------------------------
206 // ---------------------------------------------------------------------------
207 void ALAA::VisitModuleStatement(ModuleStatement* stmt) {
208 // TODO(turbofan): can a module appear in a loop?
213 void ALAA::VisitTryCatchStatement(TryCatchStatement* stmt) {
214 Visit(stmt->try_block());
215 Visit(stmt->catch_block());
216 // TODO(turbofan): are catch variables well-scoped?
217 AnalyzeAssignment(stmt->variable());
221 void ALAA::VisitDoWhileStatement(DoWhileStatement* loop) {
229 void ALAA::VisitWhileStatement(WhileStatement* loop) {
237 void ALAA::VisitForStatement(ForStatement* loop) {
238 VisitIfNotNull(loop->init());
240 VisitIfNotNull(loop->cond());
242 VisitIfNotNull(loop->next());
247 void ALAA::VisitForInStatement(ForInStatement* loop) {
250 Visit(loop->subject());
256 void ALAA::VisitForOfStatement(ForOfStatement* loop) {
259 Visit(loop->subject());
265 void ALAA::VisitAssignment(Assignment* stmt) {
266 Expression* l = stmt->target();
268 Visit(stmt->value());
269 if (l->IsVariableProxy()) AnalyzeAssignment(l->AsVariableProxy()->var());
273 void ALAA::VisitCountOperation(CountOperation* e) {
274 Expression* l = e->expression();
276 if (l->IsVariableProxy()) AnalyzeAssignment(l->AsVariableProxy()->var());
280 void ALAA::AnalyzeAssignment(Variable* var) {
281 if (!loop_stack_.empty() && var->IsStackAllocated()) {
282 loop_stack_.back()->Add(GetVariableIndex(info()->scope(), var));
287 int ALAA::GetVariableIndex(Scope* scope, Variable* var) {
288 CHECK(var->IsStackAllocated());
289 if (var->is_this()) return 0;
290 if (var->IsParameter()) return 1 + var->index();
291 return 1 + scope->num_parameters() + var->index();
295 int LoopAssignmentAnalysis::GetAssignmentCountForTesting(Scope* scope,
298 int var_index = AstLoopAssignmentAnalyzer::GetVariableIndex(scope, var);
299 for (size_t i = 0; i < list_.size(); i++) {
300 if (list_[i].second->Contains(var_index)) count++;
306 } // namespace v8::internal::compiler