OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 5429 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5440 HBasicBlock* loop_exit = CreateLoop(stmt, | 5440 HBasicBlock* loop_exit = CreateLoop(stmt, |
5441 loop_entry, | 5441 loop_entry, |
5442 body_exit, | 5442 body_exit, |
5443 loop_successor, | 5443 loop_successor, |
5444 break_info.break_block()); | 5444 break_info.break_block()); |
5445 | 5445 |
5446 set_current_block(loop_exit); | 5446 set_current_block(loop_exit); |
5447 } | 5447 } |
5448 | 5448 |
5449 | 5449 |
| 5450 void HOptimizedGraphBuilder::VisitForOfStatement(ForOfStatement* stmt) { |
| 5451 ASSERT(!HasStackOverflow()); |
| 5452 ASSERT(current_block() != NULL); |
| 5453 ASSERT(current_block()->HasPredecessor()); |
| 5454 return Bailout("ForOfStatement"); |
| 5455 } |
| 5456 |
| 5457 |
5450 void HOptimizedGraphBuilder::VisitTryCatchStatement(TryCatchStatement* stmt) { | 5458 void HOptimizedGraphBuilder::VisitTryCatchStatement(TryCatchStatement* stmt) { |
5451 ASSERT(!HasStackOverflow()); | 5459 ASSERT(!HasStackOverflow()); |
5452 ASSERT(current_block() != NULL); | 5460 ASSERT(current_block() != NULL); |
5453 ASSERT(current_block()->HasPredecessor()); | 5461 ASSERT(current_block()->HasPredecessor()); |
5454 return Bailout("TryCatchStatement"); | 5462 return Bailout("TryCatchStatement"); |
5455 } | 5463 } |
5456 | 5464 |
5457 | 5465 |
5458 void HOptimizedGraphBuilder::VisitTryFinallyStatement( | 5466 void HOptimizedGraphBuilder::VisitTryFinallyStatement( |
5459 TryFinallyStatement* stmt) { | 5467 TryFinallyStatement* stmt) { |
(...skipping 6139 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
11599 } | 11607 } |
11600 } | 11608 } |
11601 | 11609 |
11602 #ifdef DEBUG | 11610 #ifdef DEBUG |
11603 if (graph_ != NULL) graph_->Verify(false); // No full verify. | 11611 if (graph_ != NULL) graph_->Verify(false); // No full verify. |
11604 if (allocator_ != NULL) allocator_->Verify(); | 11612 if (allocator_ != NULL) allocator_->Verify(); |
11605 #endif | 11613 #endif |
11606 } | 11614 } |
11607 | 11615 |
11608 } } // namespace v8::internal | 11616 } } // namespace v8::internal |
OLD | NEW |