| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/hydrogen-sce.h" | 5 #include "src/hydrogen-sce.h" |
| 6 #include "src/v8.h" | |
| 7 | 6 |
| 8 namespace v8 { | 7 namespace v8 { |
| 9 namespace internal { | 8 namespace internal { |
| 10 | 9 |
| 11 void HStackCheckEliminationPhase::Run() { | 10 void HStackCheckEliminationPhase::Run() { |
| 12 // For each loop block walk the dominator tree from the backwards branch to | 11 // For each loop block walk the dominator tree from the backwards branch to |
| 13 // the loop header. If a call instruction is encountered the backwards branch | 12 // the loop header. If a call instruction is encountered the backwards branch |
| 14 // is dominated by a call and the stack check in the backwards branch can be | 13 // is dominated by a call and the stack check in the backwards branch can be |
| 15 // removed. | 14 // removed. |
| 16 for (int i = 0; i < graph()->blocks()->length(); i++) { | 15 for (int i = 0; i < graph()->blocks()->length(); i++) { |
| (...skipping 14 matching lines...) Expand all Loading... |
| 31 | 30 |
| 32 // Move up the dominator tree. | 31 // Move up the dominator tree. |
| 33 dominator = dominator->dominator(); | 32 dominator = dominator->dominator(); |
| 34 } | 33 } |
| 35 } | 34 } |
| 36 } | 35 } |
| 37 } | 36 } |
| 38 | 37 |
| 39 } // namespace internal | 38 } // namespace internal |
| 40 } // namespace v8 | 39 } // namespace v8 |
| OLD | NEW |