blob: d2b0d2dcaefc5f9fb4b0cb545070e9cc3fd28862 [file] [log] [blame]
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001// Copyright 2012 the V8 project authors. All rights reserved.
2// Use of this source code is governed by a BSD-style license that can be
3// found in the LICENSE file.
4
5#ifndef V8_CRANKSHAFT_MIPS_LITHIUM_CODEGEN_MIPS_H_
6#define V8_CRANKSHAFT_MIPS_LITHIUM_CODEGEN_MIPS_H_
7
8#include "src/ast/scopes.h"
9#include "src/crankshaft/lithium-codegen.h"
10#include "src/crankshaft/mips/lithium-gap-resolver-mips.h"
11#include "src/crankshaft/mips/lithium-mips.h"
12#include "src/deoptimizer.h"
13#include "src/safepoint-table.h"
14#include "src/utils.h"
15
16namespace v8 {
17namespace internal {
18
19// Forward declarations.
20class LDeferredCode;
21class SafepointGenerator;
22
23class LCodeGen: public LCodeGenBase {
24 public:
25 LCodeGen(LChunk* chunk, MacroAssembler* assembler, CompilationInfo* info)
26 : LCodeGenBase(chunk, assembler, info),
27 jump_table_(4, info->zone()),
28 scope_(info->scope()),
29 deferred_(8, info->zone()),
30 frame_is_built_(false),
31 safepoints_(info->zone()),
32 resolver_(this),
33 expected_safepoint_kind_(Safepoint::kSimple) {
34 PopulateDeoptimizationLiteralsWithInlinedFunctions();
35 }
36
37
38 int LookupDestination(int block_id) const {
39 return chunk()->LookupDestination(block_id);
40 }
41
42 bool IsNextEmittedBlock(int block_id) const {
43 return LookupDestination(block_id) == GetNextEmittedBlock();
44 }
45
46 bool NeedsEagerFrame() const {
Ben Murdoch097c5b22016-05-18 11:27:45 +010047 return HasAllocatedStackSlots() || info()->is_non_deferred_calling() ||
48 !info()->IsStub() || info()->requires_frame();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000049 }
50 bool NeedsDeferredFrame() const {
51 return !NeedsEagerFrame() && info()->is_deferred_calling();
52 }
53
54 RAStatus GetRAState() const {
55 return frame_is_built_ ? kRAHasBeenSaved : kRAHasNotBeenSaved;
56 }
57
58 // Support for converting LOperands to assembler types.
59 // LOperand must be a register.
60 Register ToRegister(LOperand* op) const;
61
62 // LOperand is loaded into scratch, unless already a register.
63 Register EmitLoadRegister(LOperand* op, Register scratch);
64
65 // LOperand must be a double register.
66 DoubleRegister ToDoubleRegister(LOperand* op) const;
67
68 // LOperand is loaded into dbl_scratch, unless already a double register.
69 DoubleRegister EmitLoadDoubleRegister(LOperand* op,
70 FloatRegister flt_scratch,
71 DoubleRegister dbl_scratch);
72 int32_t ToRepresentation(LConstantOperand* op, const Representation& r) const;
73 int32_t ToInteger32(LConstantOperand* op) const;
74 Smi* ToSmi(LConstantOperand* op) const;
75 double ToDouble(LConstantOperand* op) const;
76 Operand ToOperand(LOperand* op);
77 MemOperand ToMemOperand(LOperand* op) const;
78 // Returns a MemOperand pointing to the high word of a DoubleStackSlot.
79 MemOperand ToHighMemOperand(LOperand* op) const;
80
81 bool IsInteger32(LConstantOperand* op) const;
82 bool IsSmi(LConstantOperand* op) const;
83 Handle<Object> ToHandle(LConstantOperand* op) const;
84
85 // Try to generate code for the entire chunk, but it may fail if the
86 // chunk contains constructs we cannot handle. Returns true if the
87 // code generation attempt succeeded.
88 bool GenerateCode();
89
90 // Finish the code by setting stack height, safepoint, and bailout
91 // information on it.
92 void FinishCode(Handle<Code> code);
93
94 void DoDeferredNumberTagD(LNumberTagD* instr);
95
96 enum IntegerSignedness { SIGNED_INT32, UNSIGNED_INT32 };
97 void DoDeferredNumberTagIU(LInstruction* instr,
98 LOperand* value,
99 LOperand* temp1,
100 LOperand* temp2,
101 IntegerSignedness signedness);
102
103 void DoDeferredTaggedToI(LTaggedToI* instr);
104 void DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr);
105 void DoDeferredStackCheck(LStackCheck* instr);
106 void DoDeferredMaybeGrowElements(LMaybeGrowElements* instr);
107 void DoDeferredStringCharCodeAt(LStringCharCodeAt* instr);
108 void DoDeferredStringCharFromCode(LStringCharFromCode* instr);
109 void DoDeferredAllocate(LAllocate* instr);
110 void DoDeferredInstanceMigration(LCheckMaps* instr, Register object);
111 void DoDeferredLoadMutableDouble(LLoadFieldByIndex* instr,
112 Register result,
113 Register object,
114 Register index);
115
116 // Parallel move support.
117 void DoParallelMove(LParallelMove* move);
118 void DoGap(LGap* instr);
119
120 MemOperand PrepareKeyedOperand(Register key,
121 Register base,
122 bool key_is_constant,
123 int constant_key,
124 int element_size,
125 int shift_size,
126 int base_offset);
127
128 // Emit frame translation commands for an environment.
129 void WriteTranslation(LEnvironment* environment, Translation* translation);
130
131 // Declare methods that deal with the individual node types.
132#define DECLARE_DO(type) void Do##type(L##type* node);
133 LITHIUM_CONCRETE_INSTRUCTION_LIST(DECLARE_DO)
134#undef DECLARE_DO
135
136 private:
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000137 Scope* scope() const { return scope_; }
138
139 Register scratch0() { return kLithiumScratchReg; }
140 Register scratch1() { return kLithiumScratchReg2; }
141 DoubleRegister double_scratch0() { return kLithiumScratchDouble; }
142
143 LInstruction* GetNextInstruction();
144
145 void EmitClassOfTest(Label* if_true,
146 Label* if_false,
147 Handle<String> class_name,
148 Register input,
149 Register temporary,
150 Register temporary2);
151
Ben Murdoch097c5b22016-05-18 11:27:45 +0100152 bool HasAllocatedStackSlots() const {
153 return chunk()->HasAllocatedStackSlots();
154 }
155 int GetStackSlotCount() const { return chunk()->GetSpillSlotCount(); }
156 int GetTotalFrameSlotCount() const {
157 return chunk()->GetTotalFrameSlotCount();
158 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000159
160 void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code, zone()); }
161
162 void SaveCallerDoubles();
163 void RestoreCallerDoubles();
164
165 // Code generation passes. Returns true if code generation should
166 // continue.
167 void GenerateBodyInstructionPre(LInstruction* instr) override;
168 bool GeneratePrologue();
169 bool GenerateDeferredCode();
170 bool GenerateJumpTable();
171 bool GenerateSafepointTable();
172
173 // Generates the custom OSR entrypoint and sets the osr_pc_offset.
174 void GenerateOsrPrologue();
175
176 enum SafepointMode {
177 RECORD_SIMPLE_SAFEPOINT,
178 RECORD_SAFEPOINT_WITH_REGISTERS_AND_NO_ARGUMENTS
179 };
180
181 void CallCode(Handle<Code> code,
182 RelocInfo::Mode mode,
183 LInstruction* instr);
184
185 void CallCodeGeneric(Handle<Code> code,
186 RelocInfo::Mode mode,
187 LInstruction* instr,
188 SafepointMode safepoint_mode);
189
190 void CallRuntime(const Runtime::Function* function,
191 int num_arguments,
192 LInstruction* instr,
193 SaveFPRegsMode save_doubles = kDontSaveFPRegs);
194
195 void CallRuntime(Runtime::FunctionId id,
196 int num_arguments,
197 LInstruction* instr) {
198 const Runtime::Function* function = Runtime::FunctionForId(id);
199 CallRuntime(function, num_arguments, instr);
200 }
201
202 void CallRuntime(Runtime::FunctionId id, LInstruction* instr) {
203 const Runtime::Function* function = Runtime::FunctionForId(id);
204 CallRuntime(function, function->nargs, instr);
205 }
206
207 void LoadContextFromDeferred(LOperand* context);
208 void CallRuntimeFromDeferred(Runtime::FunctionId id,
209 int argc,
210 LInstruction* instr,
211 LOperand* context);
212
Ben Murdochda12d292016-06-02 14:46:10 +0100213 void PrepareForTailCall(const ParameterCount& actual, Register scratch1,
214 Register scratch2, Register scratch3);
215
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000216 // Generate a direct call to a known function. Expects the function
217 // to be in a1.
218 void CallKnownFunction(Handle<JSFunction> function,
219 int formal_parameter_count, int arity,
Ben Murdochda12d292016-06-02 14:46:10 +0100220 bool is_tail_call, LInstruction* instr);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000221
222 void RecordSafepointWithLazyDeopt(LInstruction* instr,
223 SafepointMode safepoint_mode);
224
225 void RegisterEnvironmentForDeoptimization(LEnvironment* environment,
226 Safepoint::DeoptMode mode);
227 void DeoptimizeIf(Condition condition, LInstruction* instr,
228 Deoptimizer::DeoptReason deopt_reason,
229 Deoptimizer::BailoutType bailout_type,
230 Register src1 = zero_reg,
231 const Operand& src2 = Operand(zero_reg));
232 void DeoptimizeIf(
233 Condition condition, LInstruction* instr,
234 Deoptimizer::DeoptReason deopt_reason = Deoptimizer::kNoReason,
235 Register src1 = zero_reg, const Operand& src2 = Operand(zero_reg));
236
237 void AddToTranslation(LEnvironment* environment,
238 Translation* translation,
239 LOperand* op,
240 bool is_tagged,
241 bool is_uint32,
242 int* object_index_pointer,
243 int* dematerialized_index_pointer);
244
245 Register ToRegister(int index) const;
246 DoubleRegister ToDoubleRegister(int index) const;
247
248 MemOperand BuildSeqStringOperand(Register string,
249 LOperand* index,
250 String::Encoding encoding);
251
252 void EmitIntegerMathAbs(LMathAbs* instr);
253
254 // Support for recording safepoint and position information.
255 void RecordSafepoint(LPointerMap* pointers,
256 Safepoint::Kind kind,
257 int arguments,
258 Safepoint::DeoptMode mode);
259 void RecordSafepoint(LPointerMap* pointers, Safepoint::DeoptMode mode);
260 void RecordSafepoint(Safepoint::DeoptMode mode);
261 void RecordSafepointWithRegisters(LPointerMap* pointers,
262 int arguments,
263 Safepoint::DeoptMode mode);
264
265 void RecordAndWritePosition(int position) override;
266
267 static Condition TokenToCondition(Token::Value op, bool is_unsigned);
268 void EmitGoto(int block);
269
270 // EmitBranch expects to be the last instruction of a block.
271 template<class InstrType>
272 void EmitBranch(InstrType instr,
273 Condition condition,
274 Register src1,
275 const Operand& src2);
276 template<class InstrType>
277 void EmitBranchF(InstrType instr,
278 Condition condition,
279 FPURegister src1,
280 FPURegister src2);
281 template <class InstrType>
282 void EmitTrueBranch(InstrType instr, Condition condition, Register src1,
283 const Operand& src2);
284 template <class InstrType>
285 void EmitFalseBranch(InstrType instr, Condition condition, Register src1,
286 const Operand& src2);
287 template<class InstrType>
288 void EmitFalseBranchF(InstrType instr,
289 Condition condition,
290 FPURegister src1,
291 FPURegister src2);
292 void EmitCmpI(LOperand* left, LOperand* right);
293 void EmitNumberUntagD(LNumberUntagD* instr, Register input,
294 DoubleRegister result, NumberUntagDMode mode);
295
296 // Emits optimized code for typeof x == "y". Modifies input register.
297 // Returns the condition on which a final split to
298 // true and false label should be made, to optimize fallthrough.
299 // Returns two registers in cmp1 and cmp2 that can be used in the
300 // Branch instruction after EmitTypeofIs.
301 Condition EmitTypeofIs(Label* true_label,
302 Label* false_label,
303 Register input,
304 Handle<String> type_name,
305 Register* cmp1,
306 Operand* cmp2);
307
308 // Emits optimized code for %_IsString(x). Preserves input register.
309 // Returns the condition on which a final split to
310 // true and false label should be made, to optimize fallthrough.
311 Condition EmitIsString(Register input,
312 Register temp1,
313 Label* is_not_string,
314 SmiCheck check_needed);
315
316 // Emits optimized code to deep-copy the contents of statically known
317 // object graphs (e.g. object literal boilerplate).
318 void EmitDeepCopy(Handle<JSObject> object,
319 Register result,
320 Register source,
321 int* offset,
322 AllocationSiteMode mode);
323 // Emit optimized code for integer division.
324 // Inputs are signed.
325 // All registers are clobbered.
326 // If 'remainder' is no_reg, it is not computed.
327 void EmitSignedIntegerDivisionByConstant(Register result,
328 Register dividend,
329 int32_t divisor,
330 Register remainder,
331 Register scratch,
332 LEnvironment* environment);
333
334
335 void EnsureSpaceForLazyDeopt(int space_needed) override;
336 void DoLoadKeyedExternalArray(LLoadKeyed* instr);
337 void DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr);
338 void DoLoadKeyedFixedArray(LLoadKeyed* instr);
339 void DoStoreKeyedExternalArray(LStoreKeyed* instr);
340 void DoStoreKeyedFixedDoubleArray(LStoreKeyed* instr);
341 void DoStoreKeyedFixedArray(LStoreKeyed* instr);
342
343 template <class T>
344 void EmitVectorLoadICRegisters(T* instr);
345 template <class T>
346 void EmitVectorStoreICRegisters(T* instr);
347
348 ZoneList<Deoptimizer::JumpTableEntry> jump_table_;
349 Scope* const scope_;
350 ZoneList<LDeferredCode*> deferred_;
351 bool frame_is_built_;
352
353 // Builder that keeps track of safepoints in the code. The table
354 // itself is emitted at the end of the generated code.
355 SafepointTableBuilder safepoints_;
356
357 // Compiler from a set of parallel moves to a sequential list of moves.
358 LGapResolver resolver_;
359
360 Safepoint::Kind expected_safepoint_kind_;
361
362 class PushSafepointRegistersScope final BASE_EMBEDDED {
363 public:
364 explicit PushSafepointRegistersScope(LCodeGen* codegen)
365 : codegen_(codegen) {
366 DCHECK(codegen_->info()->is_calling());
367 DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kSimple);
368 codegen_->expected_safepoint_kind_ = Safepoint::kWithRegisters;
369
370 StoreRegistersStateStub stub(codegen_->isolate());
371 codegen_->masm_->push(ra);
372 codegen_->masm_->CallStub(&stub);
373 }
374
375 ~PushSafepointRegistersScope() {
376 DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kWithRegisters);
377 RestoreRegistersStateStub stub(codegen_->isolate());
378 codegen_->masm_->push(ra);
379 codegen_->masm_->CallStub(&stub);
380 codegen_->expected_safepoint_kind_ = Safepoint::kSimple;
381 }
382
383 private:
384 LCodeGen* codegen_;
385 };
386
387 friend class LDeferredCode;
388 friend class LEnvironment;
389 friend class SafepointGenerator;
390 DISALLOW_COPY_AND_ASSIGN(LCodeGen);
391};
392
393
394class LDeferredCode : public ZoneObject {
395 public:
396 explicit LDeferredCode(LCodeGen* codegen)
397 : codegen_(codegen),
398 external_exit_(NULL),
399 instruction_index_(codegen->current_instruction_) {
400 codegen->AddDeferredCode(this);
401 }
402
403 virtual ~LDeferredCode() {}
404 virtual void Generate() = 0;
405 virtual LInstruction* instr() = 0;
406
407 void SetExit(Label* exit) { external_exit_ = exit; }
408 Label* entry() { return &entry_; }
409 Label* exit() { return external_exit_ != NULL ? external_exit_ : &exit_; }
410 int instruction_index() const { return instruction_index_; }
411
412 protected:
413 LCodeGen* codegen() const { return codegen_; }
414 MacroAssembler* masm() const { return codegen_->masm(); }
415
416 private:
417 LCodeGen* codegen_;
418 Label entry_;
419 Label exit_;
420 Label* external_exit_;
421 int instruction_index_;
422};
423
424} // namespace internal
425} // namespace v8
426
427#endif // V8_CRANKSHAFT_MIPS_LITHIUM_CODEGEN_MIPS_H_