Chromium Code Reviews| 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 287 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 298 IncrementNodeCount(); | 298 IncrementNodeCount(); |
| 299 DisableSelfOptimization(); | 299 DisableSelfOptimization(); |
| 300 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); | 300 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); |
| 301 Visit(node->cond()); | 301 Visit(node->cond()); |
| 302 Visit(node->body()); | 302 Visit(node->body()); |
| 303 } | 303 } |
| 304 | 304 |
| 305 | 305 |
| 306 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { | 306 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { |
| 307 IncrementNodeCount(); | 307 IncrementNodeCount(); |
| 308 DisableOptimization(kTryCatchStatement); | 308 DisableCrankshaft(kTryCatchStatement); |
|
Michael Starzinger
2016/02/12 09:32:40
nit: Should we land this as a separate CL, so that
Jarin
2016/02/12 09:58:32
Done.
| |
| 309 node->set_base_id(ReserveIdRange(TryCatchStatement::num_ids())); | 309 node->set_base_id(ReserveIdRange(TryCatchStatement::num_ids())); |
| 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 DisableOptimization(kTryFinallyStatement); | 317 DisableOptimization(kTryFinallyStatement); |
| 318 node->set_base_id(ReserveIdRange(TryFinallyStatement::num_ids())); | 318 node->set_base_id(ReserveIdRange(TryFinallyStatement::num_ids())); |
| (...skipping 275 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 594 } | 594 } |
| 595 | 595 |
| 596 | 596 |
| 597 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, | 597 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, |
| 598 FunctionLiteral* function) { | 598 FunctionLiteral* function) { |
| 599 AstNumberingVisitor visitor(isolate, zone); | 599 AstNumberingVisitor visitor(isolate, zone); |
| 600 return visitor.Renumber(function); | 600 return visitor.Renumber(function); |
| 601 } | 601 } |
| 602 } // namespace internal | 602 } // namespace internal |
| 603 } // namespace v8 | 603 } // namespace v8 |
| OLD | NEW |