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 89 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
100 continue; | 100 continue; |
101 } | 101 } |
102 HDummyUse* dummy = new(graph()->zone()) HDummyUse(operand); | 102 HDummyUse* dummy = new(graph()->zone()) HDummyUse(operand); |
103 dummy->InsertBefore(instr); | 103 dummy->InsertBefore(instr); |
104 last_dummy = dummy; | 104 last_dummy = dummy; |
105 } | 105 } |
106 if (last_dummy == NULL) last_dummy = graph()->GetConstant1(); | 106 if (last_dummy == NULL) last_dummy = graph()->GetConstant1(); |
107 instr->DeleteAndReplaceWith(last_dummy); | 107 instr->DeleteAndReplaceWith(last_dummy); |
108 continue; | 108 continue; |
109 } | 109 } |
110 if (instr->IsSoftDeoptimize()) { | 110 if (instr->IsDeoptimize()) { |
111 ASSERT(block->IsDeoptimizing()); | 111 ASSERT(block->IsDeoptimizing()); |
112 nullify = true; | 112 nullify = true; |
113 } | 113 } |
114 } | 114 } |
115 } | 115 } |
116 } | 116 } |
117 | 117 |
118 | 118 |
119 void HPropagateDeoptimizingMarkPhase::Run() { | 119 void HPropagateDeoptimizingMarkPhase::Run() { |
120 // Skip this phase if there is nothing to be done anyway. | 120 // Skip this phase if there is nothing to be done anyway. |
121 if (!graph()->has_soft_deoptimize()) return; | 121 if (!graph()->has_soft_deoptimize()) return; |
122 MarkAsDeoptimizing(); | 122 MarkAsDeoptimizing(); |
123 NullifyUnreachableInstructions(); | 123 NullifyUnreachableInstructions(); |
124 } | 124 } |
125 | 125 |
126 } } // namespace v8::internal | 126 } } // namespace v8::internal |
OLD | NEW |