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