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 291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
302 } | 302 } |
303 return cur->block_id(); | 303 return cur->block_id(); |
304 } | 304 } |
305 | 305 |
306 Label* LChunk::GetAssemblyLabel(int block_id) const { | 306 Label* LChunk::GetAssemblyLabel(int block_id) const { |
307 LLabel* label = GetLabel(block_id); | 307 LLabel* label = GetLabel(block_id); |
308 ASSERT(!label->HasReplacement()); | 308 ASSERT(!label->HasReplacement()); |
309 return label->label(); | 309 return label->label(); |
310 } | 310 } |
311 | 311 |
| 312 |
312 void LChunk::MarkEmptyBlocks() { | 313 void LChunk::MarkEmptyBlocks() { |
313 LPhase phase("L_Mark empty blocks", this); | 314 LPhase phase("L_Mark empty blocks", this); |
314 for (int i = 0; i < graph()->blocks()->length(); ++i) { | 315 for (int i = 0; i < graph()->blocks()->length(); ++i) { |
315 HBasicBlock* block = graph()->blocks()->at(i); | 316 HBasicBlock* block = graph()->blocks()->at(i); |
316 int first = block->first_instruction_index(); | 317 int first = block->first_instruction_index(); |
317 int last = block->last_instruction_index(); | 318 int last = block->last_instruction_index(); |
318 LInstruction* first_instr = instructions()->at(first); | 319 LInstruction* first_instr = instructions()->at(first); |
319 LInstruction* last_instr = instructions()->at(last); | 320 LInstruction* last_instr = instructions()->at(last); |
320 | 321 |
321 LLabel* label = LLabel::cast(first_instr); | 322 LLabel* label = LLabel::cast(first_instr); |
(...skipping 173 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
495 | 496 |
496 | 497 |
497 LPhase::~LPhase() { | 498 LPhase::~LPhase() { |
498 if (ShouldProduceTraceOutput()) { | 499 if (ShouldProduceTraceOutput()) { |
499 isolate()->GetHTracer()->TraceLithium(name(), chunk_); | 500 isolate()->GetHTracer()->TraceLithium(name(), chunk_); |
500 } | 501 } |
501 } | 502 } |
502 | 503 |
503 | 504 |
504 } } // namespace v8::internal | 505 } } // namespace v8::internal |
OLD | NEW |