| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 case DOUBLE_REGISTER: | 88 case DOUBLE_REGISTER: |
| 89 stream->Add("[%s|R]", DoubleRegister::AllocationIndexToString(index())); | 89 stream->Add("[%s|R]", DoubleRegister::AllocationIndexToString(index())); |
| 90 break; | 90 break; |
| 91 case ARGUMENT: | 91 case ARGUMENT: |
| 92 stream->Add("[arg:%d]", index()); | 92 stream->Add("[arg:%d]", index()); |
| 93 break; | 93 break; |
| 94 } | 94 } |
| 95 } | 95 } |
| 96 | 96 |
| 97 | 97 |
| 98 int LOperand::VirtualRegister() { | |
| 99 LUnallocated* unalloc = LUnallocated::cast(this); | |
| 100 return unalloc->virtual_register(); | |
| 101 } | |
| 102 | |
| 103 | |
| 104 bool LParallelMove::IsRedundant() const { | 98 bool LParallelMove::IsRedundant() const { |
| 105 for (int i = 0; i < move_operands_.length(); ++i) { | 99 for (int i = 0; i < move_operands_.length(); ++i) { |
| 106 if (!move_operands_[i].IsRedundant()) return false; | 100 if (!move_operands_[i].IsRedundant()) return false; |
| 107 } | 101 } |
| 108 return true; | 102 return true; |
| 109 } | 103 } |
| 110 | 104 |
| 111 | 105 |
| 112 void LParallelMove::PrintDataTo(StringStream* stream) const { | 106 void LParallelMove::PrintDataTo(StringStream* stream) const { |
| 113 bool first = true; | 107 bool first = true; |
| (...skipping 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 206 case DICTIONARY_ELEMENTS: | 200 case DICTIONARY_ELEMENTS: |
| 207 case NON_STRICT_ARGUMENTS_ELEMENTS: | 201 case NON_STRICT_ARGUMENTS_ELEMENTS: |
| 208 return kPointerSizeLog2; | 202 return kPointerSizeLog2; |
| 209 } | 203 } |
| 210 UNREACHABLE(); | 204 UNREACHABLE(); |
| 211 return 0; | 205 return 0; |
| 212 } | 206 } |
| 213 | 207 |
| 214 | 208 |
| 215 } } // namespace v8::internal | 209 } } // namespace v8::internal |
| OLD | NEW |