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/v8.h" | 5 #include "src/v8.h" |
6 | 6 |
7 #include "src/ast.h" | 7 #include "src/ast.h" |
8 #include "src/ast-numbering.h" | 8 #include "src/ast-numbering.h" |
9 #include "src/scopes.h" | 9 #include "src/scopes.h" |
10 | 10 |
(...skipping 278 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
289 DisableSelfOptimization(); | 289 DisableSelfOptimization(); |
290 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); | 290 node->set_base_id(ReserveIdRange(WhileStatement::num_ids())); |
291 Visit(node->cond()); | 291 Visit(node->cond()); |
292 Visit(node->body()); | 292 Visit(node->body()); |
293 } | 293 } |
294 | 294 |
295 | 295 |
296 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { | 296 void AstNumberingVisitor::VisitTryCatchStatement(TryCatchStatement* node) { |
297 IncrementNodeCount(); | 297 IncrementNodeCount(); |
298 DisableOptimization(kTryCatchStatement); | 298 DisableOptimization(kTryCatchStatement); |
| 299 node->set_base_id(ReserveIdRange(TryCatchStatement::num_ids())); |
299 Visit(node->try_block()); | 300 Visit(node->try_block()); |
300 Visit(node->catch_block()); | 301 Visit(node->catch_block()); |
301 } | 302 } |
302 | 303 |
303 | 304 |
304 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { | 305 void AstNumberingVisitor::VisitTryFinallyStatement(TryFinallyStatement* node) { |
305 IncrementNodeCount(); | 306 IncrementNodeCount(); |
306 DisableOptimization(kTryFinallyStatement); | 307 DisableOptimization(kTryFinallyStatement); |
| 308 node->set_base_id(ReserveIdRange(TryFinallyStatement::num_ids())); |
307 Visit(node->try_block()); | 309 Visit(node->try_block()); |
308 Visit(node->finally_block()); | 310 Visit(node->finally_block()); |
309 } | 311 } |
310 | 312 |
311 | 313 |
312 void AstNumberingVisitor::VisitProperty(Property* node) { | 314 void AstNumberingVisitor::VisitProperty(Property* node) { |
313 IncrementNodeCount(); | 315 IncrementNodeCount(); |
314 ReserveFeedbackSlots(node); | 316 ReserveFeedbackSlots(node); |
315 node->set_base_id(ReserveIdRange(Property::num_ids())); | 317 node->set_base_id(ReserveIdRange(Property::num_ids())); |
316 Visit(node->key()); | 318 Visit(node->key()); |
(...skipping 236 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
553 } | 555 } |
554 | 556 |
555 | 557 |
556 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, | 558 bool AstNumbering::Renumber(Isolate* isolate, Zone* zone, |
557 FunctionLiteral* function) { | 559 FunctionLiteral* function) { |
558 AstNumberingVisitor visitor(isolate, zone); | 560 AstNumberingVisitor visitor(isolate, zone); |
559 return visitor.Renumber(function); | 561 return visitor.Renumber(function); |
560 } | 562 } |
561 } // namespace internal | 563 } // namespace internal |
562 } // namespace v8 | 564 } // namespace v8 |
OLD | NEW |