| 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 391 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 402 void AstNumberingVisitor::VisitCompareOperation(CompareOperation* node) { | 402 void AstNumberingVisitor::VisitCompareOperation(CompareOperation* node) { |
| 403 IncrementNodeCount(); | 403 IncrementNodeCount(); |
| 404 node->set_base_id(ReserveIdRange(CompareOperation::num_ids())); | 404 node->set_base_id(ReserveIdRange(CompareOperation::num_ids())); |
| 405 Visit(node->left()); | 405 Visit(node->left()); |
| 406 Visit(node->right()); | 406 Visit(node->right()); |
| 407 ReserveFeedbackSlots(node); | 407 ReserveFeedbackSlots(node); |
| 408 } | 408 } |
| 409 | 409 |
| 410 void AstNumberingVisitor::VisitSpread(Spread* node) { | 410 void AstNumberingVisitor::VisitSpread(Spread* node) { |
| 411 IncrementNodeCount(); | 411 IncrementNodeCount(); |
| 412 // We can only get here from spread calls currently. | 412 // We can only get here from super calls currently. |
| 413 DisableFullCodegenAndCrankshaft(kSpreadCall); | 413 DisableFullCodegenAndCrankshaft(kSuperReference); |
| 414 node->set_base_id(ReserveIdRange(Spread::num_ids())); | 414 node->set_base_id(ReserveIdRange(Spread::num_ids())); |
| 415 Visit(node->expression()); | 415 Visit(node->expression()); |
| 416 } | 416 } |
| 417 | 417 |
| 418 void AstNumberingVisitor::VisitEmptyParentheses(EmptyParentheses* node) { | 418 void AstNumberingVisitor::VisitEmptyParentheses(EmptyParentheses* node) { |
| 419 UNREACHABLE(); | 419 UNREACHABLE(); |
| 420 } | 420 } |
| 421 | 421 |
| 422 void AstNumberingVisitor::VisitGetIterator(GetIterator* node) { | 422 void AstNumberingVisitor::VisitGetIterator(GetIterator* node) { |
| 423 IncrementNodeCount(); | 423 IncrementNodeCount(); |
| (...skipping 239 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 663 Compiler::EagerInnerFunctionLiterals* eager_literals) { | 663 Compiler::EagerInnerFunctionLiterals* eager_literals) { |
| 664 DisallowHeapAllocation no_allocation; | 664 DisallowHeapAllocation no_allocation; |
| 665 DisallowHandleAllocation no_handles; | 665 DisallowHandleAllocation no_handles; |
| 666 DisallowHandleDereference no_deref; | 666 DisallowHandleDereference no_deref; |
| 667 | 667 |
| 668 AstNumberingVisitor visitor(stack_limit, zone, eager_literals); | 668 AstNumberingVisitor visitor(stack_limit, zone, eager_literals); |
| 669 return visitor.Renumber(function); | 669 return visitor.Renumber(function); |
| 670 } | 670 } |
| 671 } // namespace internal | 671 } // namespace internal |
| 672 } // namespace v8 | 672 } // namespace v8 |
| OLD | NEW |