Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(785)

Side by Side Diff: src/compiler/ast-loop-assignment-analyzer.cc

Issue 2108193003: [modules] AST and parser rework. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@anonymous-declarations
Patch Set: Rebase. Created 4 years, 5 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « src/compiler/ast-graph-builder.cc ('k') | src/contexts.cc » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2014 the V8 project authors. All rights reserved. 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 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "src/compiler/ast-loop-assignment-analyzer.h" 5 #include "src/compiler/ast-loop-assignment-analyzer.h"
6 #include "src/compiler.h" 6 #include "src/compiler.h"
7 #include "src/parsing/parser.h" 7 #include "src/parsing/parser.h"
8 8
9 namespace v8 { 9 namespace v8 {
10 namespace internal { 10 namespace internal {
(...skipping 37 matching lines...) Expand 10 before | Expand all | Expand 10 after
48 std::pair<IterationStatement*, BitVector*>(loop, bits)); 48 std::pair<IterationStatement*, BitVector*>(loop, bits));
49 } 49 }
50 50
51 51
52 // --------------------------------------------------------------------------- 52 // ---------------------------------------------------------------------------
53 // -- Leaf nodes ------------------------------------------------------------- 53 // -- Leaf nodes -------------------------------------------------------------
54 // --------------------------------------------------------------------------- 54 // ---------------------------------------------------------------------------
55 55
56 void ALAA::VisitVariableDeclaration(VariableDeclaration* leaf) {} 56 void ALAA::VisitVariableDeclaration(VariableDeclaration* leaf) {}
57 void ALAA::VisitFunctionDeclaration(FunctionDeclaration* leaf) {} 57 void ALAA::VisitFunctionDeclaration(FunctionDeclaration* leaf) {}
58 void ALAA::VisitImportDeclaration(ImportDeclaration* leaf) {}
59 void ALAA::VisitEmptyStatement(EmptyStatement* leaf) {} 58 void ALAA::VisitEmptyStatement(EmptyStatement* leaf) {}
60 void ALAA::VisitContinueStatement(ContinueStatement* leaf) {} 59 void ALAA::VisitContinueStatement(ContinueStatement* leaf) {}
61 void ALAA::VisitBreakStatement(BreakStatement* leaf) {} 60 void ALAA::VisitBreakStatement(BreakStatement* leaf) {}
62 void ALAA::VisitDebuggerStatement(DebuggerStatement* leaf) {} 61 void ALAA::VisitDebuggerStatement(DebuggerStatement* leaf) {}
63 void ALAA::VisitFunctionLiteral(FunctionLiteral* leaf) {} 62 void ALAA::VisitFunctionLiteral(FunctionLiteral* leaf) {}
64 void ALAA::VisitNativeFunctionLiteral(NativeFunctionLiteral* leaf) {} 63 void ALAA::VisitNativeFunctionLiteral(NativeFunctionLiteral* leaf) {}
65 void ALAA::VisitVariableProxy(VariableProxy* leaf) {} 64 void ALAA::VisitVariableProxy(VariableProxy* leaf) {}
66 void ALAA::VisitLiteral(Literal* leaf) {} 65 void ALAA::VisitLiteral(Literal* leaf) {}
67 void ALAA::VisitRegExpLiteral(RegExpLiteral* leaf) {} 66 void ALAA::VisitRegExpLiteral(RegExpLiteral* leaf) {}
68 void ALAA::VisitThisFunction(ThisFunction* leaf) {} 67 void ALAA::VisitThisFunction(ThisFunction* leaf) {}
(...skipping 243 matching lines...) Expand 10 before | Expand all | Expand 10 after
312 int count = 0; 311 int count = 0;
313 int var_index = AstLoopAssignmentAnalyzer::GetVariableIndex(scope, var); 312 int var_index = AstLoopAssignmentAnalyzer::GetVariableIndex(scope, var);
314 for (size_t i = 0; i < list_.size(); i++) { 313 for (size_t i = 0; i < list_.size(); i++) {
315 if (list_[i].second->Contains(var_index)) count++; 314 if (list_[i].second->Contains(var_index)) count++;
316 } 315 }
317 return count; 316 return count;
318 } 317 }
319 } // namespace compiler 318 } // namespace compiler
320 } // namespace internal 319 } // namespace internal
321 } // namespace v8 320 } // namespace v8
OLDNEW
« no previous file with comments | « src/compiler/ast-graph-builder.cc ('k') | src/contexts.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698