OLD | NEW |
1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 #include "vm/flow_graph.h" | 5 #include "vm/flow_graph.h" |
6 | 6 |
7 #include "vm/bit_vector.h" | 7 #include "vm/bit_vector.h" |
8 #include "vm/flow_graph_builder.h" | 8 #include "vm/flow_graph_builder.h" |
9 #include "vm/intermediate_language.h" | 9 #include "vm/intermediate_language.h" |
10 #include "vm/growable_array.h" | 10 #include "vm/growable_array.h" |
(...skipping 175 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
186 return count; | 186 return count; |
187 } | 187 } |
188 | 188 |
189 | 189 |
190 static void VerifyUseListsInInstruction(Instruction* instr) { | 190 static void VerifyUseListsInInstruction(Instruction* instr) { |
191 ASSERT(instr != NULL); | 191 ASSERT(instr != NULL); |
192 ASSERT(!instr->IsJoinEntry()); | 192 ASSERT(!instr->IsJoinEntry()); |
193 for (intptr_t i = 0; i < instr->InputCount(); ++i) { | 193 for (intptr_t i = 0; i < instr->InputCount(); ++i) { |
194 Value* use = instr->InputAt(i); | 194 Value* use = instr->InputAt(i); |
195 ASSERT(use->definition() != NULL); | 195 ASSERT(use->definition() != NULL); |
196 ASSERT((use->definition() != instr) || use->definition()->IsPhi()); | 196 ASSERT((use->definition() != instr) || |
| 197 use->definition()->IsPhi() || |
| 198 use->definition()->IsMaterializeObject()); |
197 ASSERT(use->instruction() == instr); | 199 ASSERT(use->instruction() == instr); |
198 ASSERT(use->use_index() == i); | 200 ASSERT(use->use_index() == i); |
199 ASSERT(!FLAG_verify_compiler || | 201 ASSERT(!FLAG_verify_compiler || |
200 (1 == MembershipCount(use, use->definition()->input_use_list()))); | 202 (1 == MembershipCount(use, use->definition()->input_use_list()))); |
201 } | 203 } |
202 if (instr->env() != NULL) { | 204 if (instr->env() != NULL) { |
203 intptr_t use_index = 0; | 205 intptr_t use_index = 0; |
204 for (Environment::DeepIterator it(instr->env()); !it.Done(); it.Advance()) { | 206 for (Environment::DeepIterator it(instr->env()); !it.Done(); it.Advance()) { |
205 Value* use = it.CurrentValue(); | 207 Value* use = it.CurrentValue(); |
206 ASSERT(use->definition() != NULL); | 208 ASSERT(use->definition() != NULL); |
(...skipping 1046 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1253 } | 1255 } |
1254 | 1256 |
1255 | 1257 |
1256 bool BlockEffects::IsSideEffectFreePath(BlockEntryInstr* from, | 1258 bool BlockEffects::IsSideEffectFreePath(BlockEntryInstr* from, |
1257 BlockEntryInstr* to) const { | 1259 BlockEntryInstr* to) const { |
1258 return available_at_[to->postorder_number()]->Contains( | 1260 return available_at_[to->postorder_number()]->Contains( |
1259 from->postorder_number()); | 1261 from->postorder_number()); |
1260 } | 1262 } |
1261 | 1263 |
1262 } // namespace dart | 1264 } // namespace dart |
OLD | NEW |