OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 1249 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1260 void HGraph::MarkAsDeoptimizingRecursively(HBasicBlock* block) { | 1260 void HGraph::MarkAsDeoptimizingRecursively(HBasicBlock* block) { |
1261 for (int i = 0; i < block->dominated_blocks()->length(); ++i) { | 1261 for (int i = 0; i < block->dominated_blocks()->length(); ++i) { |
1262 HBasicBlock* dominated = block->dominated_blocks()->at(i); | 1262 HBasicBlock* dominated = block->dominated_blocks()->at(i); |
1263 if (block->IsDeoptimizing()) dominated->MarkAsDeoptimizing(); | 1263 if (block->IsDeoptimizing()) dominated->MarkAsDeoptimizing(); |
1264 MarkAsDeoptimizingRecursively(dominated); | 1264 MarkAsDeoptimizingRecursively(dominated); |
1265 } | 1265 } |
1266 } | 1266 } |
1267 | 1267 |
1268 | 1268 |
1269 void HGraph::NullifyUnreachableInstructions() { | 1269 void HGraph::NullifyUnreachableInstructions() { |
| 1270 if (!FLAG_unreachable_code_elimination) return; |
1270 int block_count = blocks_.length(); | 1271 int block_count = blocks_.length(); |
1271 for (int i = 0; i < block_count; ++i) { | 1272 for (int i = 0; i < block_count; ++i) { |
1272 HBasicBlock* block = blocks_.at(i); | 1273 HBasicBlock* block = blocks_.at(i); |
1273 bool nullify = false; | 1274 bool nullify = false; |
1274 const ZoneList<HBasicBlock*>* predecessors = block->predecessors(); | 1275 const ZoneList<HBasicBlock*>* predecessors = block->predecessors(); |
1275 int predecessors_length = predecessors->length(); | 1276 int predecessors_length = predecessors->length(); |
1276 bool all_predecessors_deoptimizing = (predecessors_length > 0); | 1277 bool all_predecessors_deoptimizing = (predecessors_length > 0); |
1277 for (int j = 0; j < predecessors_length; ++j) { | 1278 for (int j = 0; j < predecessors_length; ++j) { |
1278 if (!predecessors->at(j)->IsDeoptimizing()) { | 1279 if (!predecessors->at(j)->IsDeoptimizing()) { |
1279 all_predecessors_deoptimizing = false; | 1280 all_predecessors_deoptimizing = false; |
(...skipping 9006 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
10286 } | 10287 } |
10287 } | 10288 } |
10288 | 10289 |
10289 #ifdef DEBUG | 10290 #ifdef DEBUG |
10290 if (graph_ != NULL) graph_->Verify(false); // No full verify. | 10291 if (graph_ != NULL) graph_->Verify(false); // No full verify. |
10291 if (allocator_ != NULL) allocator_->Verify(); | 10292 if (allocator_ != NULL) allocator_->Verify(); |
10292 #endif | 10293 #endif |
10293 } | 10294 } |
10294 | 10295 |
10295 } } // namespace v8::internal | 10296 } } // namespace v8::internal |
OLD | NEW |