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 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 DisableOptimization(kTryCatchStatement); |
309 node->set_base_id(ReserveIdRange(TryCatchStatement::num_ids())); | |
310 Visit(node->try_block()); | 309 Visit(node->try_block()); |
311 Visit(node->catch_block()); | 310 Visit(node->catch_block()); |
312 } | 311 } |
313 | 312 |
314 | 313 |
315 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { | 314 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { |
316 IncrementNodeCount(); | 315 IncrementNodeCount(); |
317 DisableOptimization(kTryFinallyStatement); | 316 DisableOptimization(kTryFinallyStatement); |
318 node->set_base_id(ReserveIdRange(TryFinallyStatement::num_ids())); | |
319 Visit(node->try_block()); | 317 Visit(node->try_block()); |
320 Visit(node->finally_block()); | 318 Visit(node->finally_block()); |
321 } | 319 } |
322 | 320 |
323 | 321 |
324 void AstNumberingVisitor::VisitPropertyReference(Property* node) { | 322 void AstNumberingVisitor::VisitPropertyReference(Property* node) { |
325 IncrementNodeCount(); | 323 IncrementNodeCount(); |
326 node->set_base_id(ReserveIdRange(Property::num_ids())); | 324 node->set_base_id(ReserveIdRange(Property::num_ids())); |
327 Visit(node->key()); | 325 Visit(node->key()); |
328 Visit(node->obj()); | 326 Visit(node->obj()); |
(...skipping 268 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
597 } | 595 } |
598 | 596 |
599 | 597 |
600 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, | 598 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, |
601 FunctionLiteral* function) { | 599 FunctionLiteral* function) { |
602 AstNumberingVisitor visitor(isolate, zone); | 600 AstNumberingVisitor visitor(isolate, zone); |
603 return visitor.Renumber(function); | 601 return visitor.Renumber(function); |
604 } | 602 } |
605 } // namespace internal | 603 } // namespace internal |
606 } // namespace v8 | 604 } // namespace v8 |
OLD | NEW |