| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 2519 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2530 | 2530 |
| 2531 | 2531 |
| 2532 void HGraphBuilder::VisitWithEnterStatement(WithEnterStatement* stmt) { | 2532 void HGraphBuilder::VisitWithEnterStatement(WithEnterStatement* stmt) { |
| 2533 ASSERT(!HasStackOverflow()); | 2533 ASSERT(!HasStackOverflow()); |
| 2534 ASSERT(current_block() != NULL); | 2534 ASSERT(current_block() != NULL); |
| 2535 ASSERT(current_block()->HasPredecessor()); | 2535 ASSERT(current_block()->HasPredecessor()); |
| 2536 return Bailout("WithEnterStatement"); | 2536 return Bailout("WithEnterStatement"); |
| 2537 } | 2537 } |
| 2538 | 2538 |
| 2539 | 2539 |
| 2540 void HGraphBuilder::VisitWithExitStatement(WithExitStatement* stmt) { | 2540 void HGraphBuilder::VisitContextExitStatement(ContextExitStatement* stmt) { |
| 2541 ASSERT(!HasStackOverflow()); | 2541 ASSERT(!HasStackOverflow()); |
| 2542 ASSERT(current_block() != NULL); | 2542 ASSERT(current_block() != NULL); |
| 2543 ASSERT(current_block()->HasPredecessor()); | 2543 ASSERT(current_block()->HasPredecessor()); |
| 2544 return Bailout("WithExitStatement"); | 2544 return Bailout("ContextExitStatement"); |
| 2545 } | 2545 } |
| 2546 | 2546 |
| 2547 | 2547 |
| 2548 void HGraphBuilder::VisitSwitchStatement(SwitchStatement* stmt) { | 2548 void HGraphBuilder::VisitSwitchStatement(SwitchStatement* stmt) { |
| 2549 ASSERT(!HasStackOverflow()); | 2549 ASSERT(!HasStackOverflow()); |
| 2550 ASSERT(current_block() != NULL); | 2550 ASSERT(current_block() != NULL); |
| 2551 ASSERT(current_block()->HasPredecessor()); | 2551 ASSERT(current_block()->HasPredecessor()); |
| 2552 // We only optimize switch statements with smi-literal smi comparisons, | 2552 // We only optimize switch statements with smi-literal smi comparisons, |
| 2553 // with a bounded number of clauses. | 2553 // with a bounded number of clauses. |
| 2554 const int kCaseClauseLimit = 128; | 2554 const int kCaseClauseLimit = 128; |
| (...skipping 3784 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6339 } | 6339 } |
| 6340 } | 6340 } |
| 6341 | 6341 |
| 6342 #ifdef DEBUG | 6342 #ifdef DEBUG |
| 6343 if (graph_ != NULL) graph_->Verify(); | 6343 if (graph_ != NULL) graph_->Verify(); |
| 6344 if (allocator_ != NULL) allocator_->Verify(); | 6344 if (allocator_ != NULL) allocator_->Verify(); |
| 6345 #endif | 6345 #endif |
| 6346 } | 6346 } |
| 6347 | 6347 |
| 6348 } } // namespace v8::internal | 6348 } } // namespace v8::internal |
| OLD | NEW |