OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 25 matching lines...) Expand all Loading... |
36 // the loop header. If a call instruction is encountered the backwards branch | 36 // the loop header. If a call instruction is encountered the backwards branch |
37 // is dominated by a call and the stack check in the backwards branch can be | 37 // is dominated by a call and the stack check in the backwards branch can be |
38 // removed. | 38 // removed. |
39 for (int i = 0; i < graph()->blocks()->length(); i++) { | 39 for (int i = 0; i < graph()->blocks()->length(); i++) { |
40 HBasicBlock* block = graph()->blocks()->at(i); | 40 HBasicBlock* block = graph()->blocks()->at(i); |
41 if (block->IsLoopHeader()) { | 41 if (block->IsLoopHeader()) { |
42 HBasicBlock* back_edge = block->loop_information()->GetLastBackEdge(); | 42 HBasicBlock* back_edge = block->loop_information()->GetLastBackEdge(); |
43 HBasicBlock* dominator = back_edge; | 43 HBasicBlock* dominator = back_edge; |
44 while (true) { | 44 while (true) { |
45 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) { | 45 for (HInstructionIterator it(dominator); !it.Done(); it.Advance()) { |
46 if (it.Current()->IsCall()) { | 46 if (it.Current()->HasStackCheck()) { |
47 block->loop_information()->stack_check()->Eliminate(); | 47 block->loop_information()->stack_check()->Eliminate(); |
48 break; | 48 break; |
49 } | 49 } |
50 } | 50 } |
51 | 51 |
52 // Done when the loop header is processed. | 52 // Done when the loop header is processed. |
53 if (dominator == block) break; | 53 if (dominator == block) break; |
54 | 54 |
55 // Move up the dominator tree. | 55 // Move up the dominator tree. |
56 dominator = dominator->dominator(); | 56 dominator = dominator->dominator(); |
57 } | 57 } |
58 } | 58 } |
59 } | 59 } |
60 } | 60 } |
61 | 61 |
62 } } // namespace v8::internal | 62 } } // namespace v8::internal |
OLD | NEW |