| OLD | NEW | 
|    1 // Copyright 2012 the V8 project authors. All rights reserved. |    1 // Copyright 2012 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/ast-numbering.h" |    5 #include "src/ast-numbering.h" | 
|    6  |    6  | 
|    7 #include "src/ast.h" |    7 #include "src/ast.h" | 
|    8 #include "src/scopes.h" |    8 #include "src/scopes.h" | 
|    9  |    9  | 
|   10 namespace v8 { |   10 namespace v8 { | 
| (...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  106   DisableOptimization(kExportDeclaration); |  106   DisableOptimization(kExportDeclaration); | 
|  107   VisitVariableProxy(node->proxy()); |  107   VisitVariableProxy(node->proxy()); | 
|  108 } |  108 } | 
|  109  |  109  | 
|  110  |  110  | 
|  111 void AstNumberingVisitor::VisitEmptyStatement(EmptyStatement* node) { |  111 void AstNumberingVisitor::VisitEmptyStatement(EmptyStatement* node) { | 
|  112   IncrementNodeCount(); |  112   IncrementNodeCount(); | 
|  113 } |  113 } | 
|  114  |  114  | 
|  115  |  115  | 
 |  116 void AstNumberingVisitor::VisitSloppyBlockFunctionStatement( | 
 |  117     SloppyBlockFunctionStatement* node) { | 
 |  118   IncrementNodeCount(); | 
 |  119   Visit(node->statement()); | 
 |  120 } | 
 |  121  | 
 |  122  | 
|  116 void AstNumberingVisitor::VisitContinueStatement(ContinueStatement* node) { |  123 void AstNumberingVisitor::VisitContinueStatement(ContinueStatement* node) { | 
|  117   IncrementNodeCount(); |  124   IncrementNodeCount(); | 
|  118 } |  125 } | 
|  119  |  126  | 
|  120  |  127  | 
|  121 void AstNumberingVisitor::VisitBreakStatement(BreakStatement* node) { |  128 void AstNumberingVisitor::VisitBreakStatement(BreakStatement* node) { | 
|  122   IncrementNodeCount(); |  129   IncrementNodeCount(); | 
|  123 } |  130 } | 
|  124  |  131  | 
|  125  |  132  | 
| (...skipping 450 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  576 } |  583 } | 
|  577  |  584  | 
|  578  |  585  | 
|  579 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, |  586 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, | 
|  580                             FunctionLiteral* function) { |  587                             FunctionLiteral* function) { | 
|  581   AstNumberingVisitor visitor(isolate, zone); |  588   AstNumberingVisitor visitor(isolate, zone); | 
|  582   return visitor.Renumber(function); |  589   return visitor.Renumber(function); | 
|  583 } |  590 } | 
|  584 }  // namespace internal |  591 }  // namespace internal | 
|  585 }  // namespace v8 |  592 }  // namespace v8 | 
| OLD | NEW |