| 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/ast-numbering.h" |    5 #include "src/ast/ast-numbering.h" | 
|    6  |    6  | 
|    7 #include "src/ast/ast.h" |    7 #include "src/ast/ast.h" | 
|    8 #include "src/ast/scopes.h" |    8 #include "src/ast/scopes.h" | 
|    9 #include "src/compiler.h" |    9 #include "src/compiler.h" | 
|   10 #include "src/objects-inl.h" |   10 #include "src/objects-inl.h" | 
| (...skipping 385 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  396 void AstNumberingVisitor::VisitCompareOperation(CompareOperation* node) { |  396 void AstNumberingVisitor::VisitCompareOperation(CompareOperation* node) { | 
|  397   IncrementNodeCount(); |  397   IncrementNodeCount(); | 
|  398   node->set_base_id(ReserveIdRange(CompareOperation::num_ids())); |  398   node->set_base_id(ReserveIdRange(CompareOperation::num_ids())); | 
|  399   Visit(node->left()); |  399   Visit(node->left()); | 
|  400   Visit(node->right()); |  400   Visit(node->right()); | 
|  401   ReserveFeedbackSlots(node); |  401   ReserveFeedbackSlots(node); | 
|  402 } |  402 } | 
|  403  |  403  | 
|  404 void AstNumberingVisitor::VisitSpread(Spread* node) { |  404 void AstNumberingVisitor::VisitSpread(Spread* node) { | 
|  405   IncrementNodeCount(); |  405   IncrementNodeCount(); | 
|  406   // We can only get here from super calls currently. |  406   // We can only get here from spread calls currently. | 
|  407   DisableFullCodegenAndCrankshaft(kSuperReference); |  407   DisableFullCodegenAndCrankshaft(kSpreadCall); | 
|  408   node->set_base_id(ReserveIdRange(Spread::num_ids())); |  408   node->set_base_id(ReserveIdRange(Spread::num_ids())); | 
|  409   Visit(node->expression()); |  409   Visit(node->expression()); | 
|  410 } |  410 } | 
|  411  |  411  | 
|  412 void AstNumberingVisitor::VisitEmptyParentheses(EmptyParentheses* node) { |  412 void AstNumberingVisitor::VisitEmptyParentheses(EmptyParentheses* node) { | 
|  413   UNREACHABLE(); |  413   UNREACHABLE(); | 
|  414 } |  414 } | 
|  415  |  415  | 
|  416 void AstNumberingVisitor::VisitGetIterator(GetIterator* node) { |  416 void AstNumberingVisitor::VisitGetIterator(GetIterator* node) { | 
|  417   IncrementNodeCount(); |  417   IncrementNodeCount(); | 
| (...skipping 239 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  657     Compiler::EagerInnerFunctionLiterals* eager_literals) { |  657     Compiler::EagerInnerFunctionLiterals* eager_literals) { | 
|  658   DisallowHeapAllocation no_allocation; |  658   DisallowHeapAllocation no_allocation; | 
|  659   DisallowHandleAllocation no_handles; |  659   DisallowHandleAllocation no_handles; | 
|  660   DisallowHandleDereference no_deref; |  660   DisallowHandleDereference no_deref; | 
|  661  |  661  | 
|  662   AstNumberingVisitor visitor(stack_limit, zone, eager_literals); |  662   AstNumberingVisitor visitor(stack_limit, zone, eager_literals); | 
|  663   return visitor.Renumber(function); |  663   return visitor.Renumber(function); | 
|  664 } |  664 } | 
|  665 }  // namespace internal |  665 }  // namespace internal | 
|  666 }  // namespace v8 |  666 }  // namespace v8 | 
| OLD | NEW |