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