| 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 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| (...skipping 288 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 299 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); | 299 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); |
| 300 node->set_first_yield_id(yield_count_); | 300 node->set_first_yield_id(yield_count_); |
| 301 Visit(node->cond()); | 301 Visit(node->cond()); |
| 302 Visit(node->body()); | 302 Visit(node->body()); |
| 303 node->set_yield_count(yield_count_ - node->first_yield_id()); | 303 node->set_yield_count(yield_count_ - node->first_yield_id()); |
| 304 } | 304 } |
| 305 | 305 |
| 306 | 306 |
| 307 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { | 307 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { |
| 308 IncrementNodeCount(); | 308 IncrementNodeCount(); |
| 309 DisableCrankshaft(kTryCatchStatement); | 309 DisableOptimization(kTryCatchStatement); |
| 310 Visit(node->try_block()); | 310 Visit(node->try_block()); |
| 311 Visit(node->catch_block()); | 311 Visit(node->catch_block()); |
| 312 } | 312 } |
| 313 | 313 |
| 314 | 314 |
| 315 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { | 315 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { |
| 316 IncrementNodeCount(); | 316 IncrementNodeCount(); |
| 317 DisableCrankshaft(kTryFinallyStatement); | 317 DisableOptimization(kTryFinallyStatement); |
| 318 Visit(node->try_block()); | 318 Visit(node->try_block()); |
| 319 Visit(node->finally_block()); | 319 Visit(node->finally_block()); |
| 320 } | 320 } |
| 321 | 321 |
| 322 | 322 |
| 323 void AstNumberingVisitor::VisitPropertyReference(Property* node) { | 323 void AstNumberingVisitor::VisitPropertyReference(Property* node) { |
| 324 IncrementNodeCount(); | 324 IncrementNodeCount(); |
| 325 node->set_base_id(ReserveIdRange(Property::num_ids())); | 325 node->set_base_id(ReserveIdRange(Property::num_ids())); |
| 326 Visit(node->key()); | 326 Visit(node->key()); |
| 327 Visit(node->obj()); | 327 Visit(node->obj()); |
| (...skipping 261 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 589 } | 589 } |
| 590 | 590 |
| 591 | 591 |
| 592 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, | 592 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, |
| 593 FunctionLiteral* function) { | 593 FunctionLiteral* function) { |
| 594 AstNumberingVisitor visitor(isolate, zone); | 594 AstNumberingVisitor visitor(isolate, zone); |
| 595 return visitor.Renumber(function); | 595 return visitor.Renumber(function); |
| 596 } | 596 } |
| 597 } // namespace internal | 597 } // namespace internal |
| 598 } // namespace v8 | 598 } // namespace v8 |
| OLD | NEW |