OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "x64/lithium-x64.h" | 28 #include "x64/lithium-x64.h" |
29 #include "x64/lithium-codegen-x64.h" | 29 #include "x64/lithium-codegen-x64.h" |
30 | 30 |
31 namespace v8 { | 31 namespace v8 { |
32 namespace internal { | 32 namespace internal { |
33 | 33 |
| 34 bool LGap::IsRedundant() const { |
| 35 for (int i = 0; i < 4; i++) { |
| 36 if (parallel_moves_[i] != NULL && !parallel_moves_[i]->IsRedundant()) { |
| 37 return false; |
| 38 } |
| 39 } |
| 40 |
| 41 return true; |
| 42 } |
| 43 |
| 44 |
| 45 void LGap::PrintDataTo(StringStream* stream) const { |
| 46 for (int i = 0; i < 4; i++) { |
| 47 stream->Add("("); |
| 48 if (parallel_moves_[i] != NULL) { |
| 49 parallel_moves_[i]->PrintDataTo(stream); |
| 50 } |
| 51 stream->Add(") "); |
| 52 } |
| 53 } |
| 54 |
| 55 |
34 LChunk* LChunkBuilder::Build() { | 56 LChunk* LChunkBuilder::Build() { |
35 ASSERT(is_unused()); | 57 ASSERT(is_unused()); |
36 chunk_ = new LChunk(graph()); | 58 chunk_ = new LChunk(graph()); |
37 HPhase phase("Building chunk", chunk_); | 59 HPhase phase("Building chunk", chunk_); |
38 status_ = BUILDING; | 60 status_ = BUILDING; |
39 const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); | 61 const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); |
40 for (int i = 0; i < blocks->length(); i++) { | 62 for (int i = 0; i < blocks->length(); i++) { |
41 HBasicBlock* next = NULL; | 63 HBasicBlock* next = NULL; |
42 if (i < blocks->length() - 1) next = blocks->at(i + 1); | 64 if (i < blocks->length() - 1) next = blocks->at(i + 1); |
43 DoBasicBlock(blocks->at(i), next); | 65 DoBasicBlock(blocks->at(i), next); |
(...skipping 18 matching lines...) Expand all Loading... |
62 } | 84 } |
63 | 85 |
64 | 86 |
65 void LChunkBuilder::DoBasicBlock(HBasicBlock* block, HBasicBlock* next_block) { | 87 void LChunkBuilder::DoBasicBlock(HBasicBlock* block, HBasicBlock* next_block) { |
66 ASSERT(is_building()); | 88 ASSERT(is_building()); |
67 Abort("Lithium not implemented on x64."); | 89 Abort("Lithium not implemented on x64."); |
68 } | 90 } |
69 | 91 |
70 | 92 |
71 } } // namespace v8::internal | 93 } } // namespace v8::internal |
OLD | NEW |