| 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 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 103 // Try to generate code for the entire chunk, but it may fail if the | 103 // Try to generate code for the entire chunk, but it may fail if the |
| 104 // chunk contains constructs we cannot handle. Returns true if the | 104 // chunk contains constructs we cannot handle. Returns true if the |
| 105 // code generation attempt succeeded. | 105 // code generation attempt succeeded. |
| 106 bool GenerateCode(); | 106 bool GenerateCode(); |
| 107 | 107 |
| 108 // Finish the code by setting stack height, safepoint, and bailout | 108 // Finish the code by setting stack height, safepoint, and bailout |
| 109 // information on it. | 109 // information on it. |
| 110 void FinishCode(Handle<Code> code); | 110 void FinishCode(Handle<Code> code); |
| 111 | 111 |
| 112 void DoDeferredNumberTagD(LNumberTagD* instr); | 112 void DoDeferredNumberTagD(LNumberTagD* instr); |
| 113 void DoDeferredNumberTagI(LNumberTagI* instr); | 113 |
| 114 enum IntegerSignedness { SIGNED_INT32, UNSIGNED_INT32 }; |
| 115 void DoDeferredNumberTagI(LInstruction* instr, IntegerSignedness signedness); |
| 116 |
| 114 void DoDeferredTaggedToI(LTaggedToI* instr); | 117 void DoDeferredTaggedToI(LTaggedToI* instr); |
| 115 void DoDeferredMathAbsTaggedHeapNumber(LUnaryMathOperation* instr); | 118 void DoDeferredMathAbsTaggedHeapNumber(LUnaryMathOperation* instr); |
| 116 void DoDeferredStackCheck(LStackCheck* instr); | 119 void DoDeferredStackCheck(LStackCheck* instr); |
| 117 void DoDeferredRandom(LRandom* instr); | 120 void DoDeferredRandom(LRandom* instr); |
| 118 void DoDeferredStringCharCodeAt(LStringCharCodeAt* instr); | 121 void DoDeferredStringCharCodeAt(LStringCharCodeAt* instr); |
| 119 void DoDeferredStringCharFromCode(LStringCharFromCode* instr); | 122 void DoDeferredStringCharFromCode(LStringCharFromCode* instr); |
| 120 void DoDeferredAllocateObject(LAllocateObject* instr); | 123 void DoDeferredAllocateObject(LAllocateObject* instr); |
| 121 void DoDeferredInstanceOfKnownGlobal(LInstanceOfKnownGlobal* instr, | 124 void DoDeferredInstanceOfKnownGlobal(LInstanceOfKnownGlobal* instr, |
| 122 Label* map_check); | 125 Label* map_check); |
| 123 | 126 |
| (...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 245 | 248 |
| 246 void RegisterEnvironmentForDeoptimization(LEnvironment* environment, | 249 void RegisterEnvironmentForDeoptimization(LEnvironment* environment, |
| 247 Safepoint::DeoptMode mode); | 250 Safepoint::DeoptMode mode); |
| 248 void DeoptimizeIf(Condition cc, | 251 void DeoptimizeIf(Condition cc, |
| 249 LEnvironment* environment, | 252 LEnvironment* environment, |
| 250 Register src1 = zero_reg, | 253 Register src1 = zero_reg, |
| 251 const Operand& src2 = Operand(zero_reg)); | 254 const Operand& src2 = Operand(zero_reg)); |
| 252 | 255 |
| 253 void AddToTranslation(Translation* translation, | 256 void AddToTranslation(Translation* translation, |
| 254 LOperand* op, | 257 LOperand* op, |
| 255 bool is_tagged); | 258 bool is_tagged, |
| 259 bool is_uint32); |
| 256 void PopulateDeoptimizationData(Handle<Code> code); | 260 void PopulateDeoptimizationData(Handle<Code> code); |
| 257 int DefineDeoptimizationLiteral(Handle<Object> literal); | 261 int DefineDeoptimizationLiteral(Handle<Object> literal); |
| 258 | 262 |
| 259 void PopulateDeoptimizationLiteralsWithInlinedFunctions(); | 263 void PopulateDeoptimizationLiteralsWithInlinedFunctions(); |
| 260 | 264 |
| 261 Register ToRegister(int index) const; | 265 Register ToRegister(int index) const; |
| 262 DoubleRegister ToDoubleRegister(int index) const; | 266 DoubleRegister ToDoubleRegister(int index) const; |
| 263 | 267 |
| 264 // Specific math operations - used from DoUnaryMathOperation. | 268 // Specific math operations - used from DoUnaryMathOperation. |
| 265 void EmitIntegerMathAbs(LUnaryMathOperation* instr); | 269 void EmitIntegerMathAbs(LUnaryMathOperation* instr); |
| (...skipping 201 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 467 LCodeGen* codegen_; | 471 LCodeGen* codegen_; |
| 468 Label entry_; | 472 Label entry_; |
| 469 Label exit_; | 473 Label exit_; |
| 470 Label* external_exit_; | 474 Label* external_exit_; |
| 471 int instruction_index_; | 475 int instruction_index_; |
| 472 }; | 476 }; |
| 473 | 477 |
| 474 } } // namespace v8::internal | 478 } } // namespace v8::internal |
| 475 | 479 |
| 476 #endif // V8_MIPS_LITHIUM_CODEGEN_MIPS_H_ | 480 #endif // V8_MIPS_LITHIUM_CODEGEN_MIPS_H_ |
| OLD | NEW |