| OLD | NEW |
| (Empty) | |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are |
| 4 // met: |
| 5 // |
| 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. |
| 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 |
| 28 #ifndef V8_X64_LITHIUM_X64_H_ |
| 29 #define V8_X64_LITHIUM_X64_H_ |
| 30 |
| 31 #include "hydrogen.h" |
| 32 #include "lithium-allocator.h" |
| 33 #include "safepoint-table.h" |
| 34 |
| 35 namespace v8 { |
| 36 namespace internal { |
| 37 |
| 38 // Forward declarations. |
| 39 class LCodeGen; |
| 40 class LEnvironment; |
| 41 class Translation; |
| 42 |
| 43 class LInstruction: public ZoneObject { |
| 44 public: |
| 45 LInstruction() { } |
| 46 virtual ~LInstruction() { } |
| 47 |
| 48 // Predicates should be generated by macro as in lithium-ia32.h. |
| 49 virtual bool IsLabel() const { |
| 50 UNIMPLEMENTED(); |
| 51 return false; |
| 52 } |
| 53 virtual bool IsOsrEntry() const { |
| 54 UNIMPLEMENTED(); |
| 55 return false; |
| 56 } |
| 57 |
| 58 LPointerMap* pointer_map() const { |
| 59 UNIMPLEMENTED(); |
| 60 return NULL; |
| 61 } |
| 62 |
| 63 bool HasPointerMap() const { |
| 64 UNIMPLEMENTED(); |
| 65 return false; |
| 66 } |
| 67 |
| 68 virtual void PrintTo(StringStream* stream) const { UNIMPLEMENTED(); } |
| 69 }; |
| 70 |
| 71 |
| 72 class LParallelMove : public ZoneObject { |
| 73 public: |
| 74 LParallelMove() { } |
| 75 |
| 76 void AddMove(LOperand* from, LOperand* to) { |
| 77 UNIMPLEMENTED(); |
| 78 } |
| 79 |
| 80 const ZoneList<LMoveOperands>* move_operands() const { |
| 81 UNIMPLEMENTED(); |
| 82 return NULL; |
| 83 } |
| 84 }; |
| 85 |
| 86 |
| 87 class LGap: public LInstruction { |
| 88 public: |
| 89 explicit LGap(HBasicBlock* block) { } |
| 90 |
| 91 HBasicBlock* block() const { |
| 92 UNIMPLEMENTED(); |
| 93 return NULL; |
| 94 } |
| 95 |
| 96 enum InnerPosition { |
| 97 BEFORE, |
| 98 START, |
| 99 END, |
| 100 AFTER, |
| 101 FIRST_INNER_POSITION = BEFORE, |
| 102 LAST_INNER_POSITION = AFTER |
| 103 }; |
| 104 |
| 105 LParallelMove* GetOrCreateParallelMove(InnerPosition pos) { |
| 106 UNIMPLEMENTED(); |
| 107 return NULL; |
| 108 } |
| 109 |
| 110 LParallelMove* GetParallelMove(InnerPosition pos) { |
| 111 UNIMPLEMENTED(); |
| 112 return NULL; |
| 113 } |
| 114 }; |
| 115 |
| 116 |
| 117 class LLabel: public LGap { |
| 118 public: |
| 119 explicit LLabel(HBasicBlock* block) : LGap(block) { } |
| 120 }; |
| 121 |
| 122 |
| 123 class LOsrEntry: public LInstruction { |
| 124 public: |
| 125 // Function could be generated by a macro as in lithium-ia32.h. |
| 126 static LOsrEntry* cast(LInstruction* instr) { |
| 127 UNIMPLEMENTED(); |
| 128 return NULL; |
| 129 } |
| 130 |
| 131 LOperand** SpilledRegisterArray() { |
| 132 UNIMPLEMENTED(); |
| 133 return NULL; |
| 134 } |
| 135 LOperand** SpilledDoubleRegisterArray() { |
| 136 UNIMPLEMENTED(); |
| 137 return NULL; |
| 138 } |
| 139 |
| 140 void MarkSpilledRegister(int allocation_index, LOperand* spill_operand) { |
| 141 UNIMPLEMENTED(); |
| 142 } |
| 143 void MarkSpilledDoubleRegister(int allocation_index, |
| 144 LOperand* spill_operand) { |
| 145 UNIMPLEMENTED(); |
| 146 } |
| 147 }; |
| 148 |
| 149 |
| 150 class LPointerMap: public ZoneObject { |
| 151 public: |
| 152 explicit LPointerMap(int position) { } |
| 153 |
| 154 int lithium_position() const { |
| 155 UNIMPLEMENTED(); |
| 156 return 0; |
| 157 } |
| 158 |
| 159 void RecordPointer(LOperand* op) { UNIMPLEMENTED(); } |
| 160 }; |
| 161 |
| 162 |
| 163 class LChunk: public ZoneObject { |
| 164 public: |
| 165 explicit LChunk(HGraph* graph) { } |
| 166 |
| 167 HGraph* graph() const { |
| 168 UNIMPLEMENTED(); |
| 169 return NULL; |
| 170 } |
| 171 |
| 172 const ZoneList<LPointerMap*>* pointer_maps() const { |
| 173 UNIMPLEMENTED(); |
| 174 return NULL; |
| 175 } |
| 176 |
| 177 LOperand* GetNextSpillSlot(bool double_slot) { |
| 178 UNIMPLEMENTED(); |
| 179 return NULL; |
| 180 } |
| 181 |
| 182 LConstantOperand* DefineConstantOperand(HConstant* constant) { |
| 183 UNIMPLEMENTED(); |
| 184 return NULL; |
| 185 } |
| 186 |
| 187 LLabel* GetLabel(int block_id) const { |
| 188 UNIMPLEMENTED(); |
| 189 return NULL; |
| 190 } |
| 191 |
| 192 const ZoneList<LInstruction*>* instructions() const { |
| 193 UNIMPLEMENTED(); |
| 194 return NULL; |
| 195 } |
| 196 |
| 197 int GetParameterStackSlot(int index) const { |
| 198 UNIMPLEMENTED(); |
| 199 return 0; |
| 200 } |
| 201 |
| 202 void AddGapMove(int index, LOperand* from, LOperand* to) { UNIMPLEMENTED(); } |
| 203 |
| 204 LGap* GetGapAt(int index) const { |
| 205 UNIMPLEMENTED(); |
| 206 return NULL; |
| 207 } |
| 208 |
| 209 bool IsGapAt(int index) const { |
| 210 UNIMPLEMENTED(); |
| 211 return false; |
| 212 } |
| 213 |
| 214 int NearestGapPos(int index) const { |
| 215 UNIMPLEMENTED(); |
| 216 return 0; |
| 217 } |
| 218 |
| 219 int NearestNextGapPos(int index) const { |
| 220 UNIMPLEMENTED(); |
| 221 return 0; |
| 222 } |
| 223 |
| 224 void MarkEmptyBlocks() { UNIMPLEMENTED(); } |
| 225 |
| 226 #ifdef DEBUG |
| 227 void Verify() { UNIMPLEMENTED(); } |
| 228 #endif |
| 229 }; |
| 230 |
| 231 |
| 232 class LChunkBuilder BASE_EMBEDDED { |
| 233 public: |
| 234 LChunkBuilder(HGraph* graph, LAllocator* allocator) { } |
| 235 |
| 236 // Build the sequence for the graph. |
| 237 LChunk* Build() { |
| 238 UNIMPLEMENTED(); |
| 239 return NULL; |
| 240 }; |
| 241 |
| 242 // Declare methods that deal with the individual node types. |
| 243 #define DECLARE_DO(type) LInstruction* Do##type(H##type* node) { \ |
| 244 UNIMPLEMENTED(); \ |
| 245 return NULL; \ |
| 246 } |
| 247 HYDROGEN_CONCRETE_INSTRUCTION_LIST(DECLARE_DO) |
| 248 #undef DECLARE_DO |
| 249 |
| 250 DISALLOW_COPY_AND_ASSIGN(LChunkBuilder); |
| 251 }; |
| 252 |
| 253 |
| 254 } } // namespace v8::internal |
| 255 |
| 256 #endif // V8_X64_LITHIUM_X64_H_ |
| OLD | NEW |