blob: 873a3dd1acc51be9df77178fdd9c9b823309927c [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_X64_LITHIUM_CODEGEN_X64_H_
6#define V8_CRANKSHAFT_X64_LITHIUM_CODEGEN_X64_H_
7
8
9#include "src/ast/scopes.h"
10#include "src/base/logging.h"
11#include "src/crankshaft/lithium-codegen.h"
12#include "src/crankshaft/x64/lithium-gap-resolver-x64.h"
13#include "src/crankshaft/x64/lithium-x64.h"
14#include "src/deoptimizer.h"
15#include "src/safepoint-table.h"
16#include "src/utils.h"
17
18namespace v8 {
19namespace internal {
20
21// Forward declarations.
22class LDeferredCode;
23class SafepointGenerator;
24
25class LCodeGen: public LCodeGenBase {
26 public:
27 LCodeGen(LChunk* chunk, MacroAssembler* assembler, CompilationInfo* info)
28 : LCodeGenBase(chunk, assembler, info),
29 jump_table_(4, info->zone()),
30 scope_(info->scope()),
31 deferred_(8, info->zone()),
32 frame_is_built_(false),
33 safepoints_(info->zone()),
34 resolver_(this),
35 expected_safepoint_kind_(Safepoint::kSimple) {
36 PopulateDeoptimizationLiteralsWithInlinedFunctions();
37 }
38
39 int LookupDestination(int block_id) const {
40 return chunk()->LookupDestination(block_id);
41 }
42
43 bool IsNextEmittedBlock(int block_id) const {
44 return LookupDestination(block_id) == GetNextEmittedBlock();
45 }
46
47 bool NeedsEagerFrame() const {
Ben Murdoch097c5b22016-05-18 11:27:45 +010048 return HasAllocatedStackSlots() || info()->is_non_deferred_calling() ||
49 !info()->IsStub() || info()->requires_frame();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000050 }
51 bool NeedsDeferredFrame() const {
52 return !NeedsEagerFrame() && info()->is_deferred_calling();
53 }
54
55 // Support for converting LOperands to assembler types.
56 Register ToRegister(LOperand* op) const;
57 XMMRegister ToDoubleRegister(LOperand* op) const;
58 bool IsInteger32Constant(LConstantOperand* op) const;
59 bool IsExternalConstant(LConstantOperand* op) const;
60 bool IsDehoistedKeyConstant(LConstantOperand* op) const;
61 bool IsSmiConstant(LConstantOperand* op) const;
62 int32_t ToRepresentation(LConstantOperand* op, const Representation& r) const;
63 int32_t ToInteger32(LConstantOperand* op) const;
64 Smi* ToSmi(LConstantOperand* op) const;
65 double ToDouble(LConstantOperand* op) const;
66 ExternalReference ToExternalReference(LConstantOperand* op) const;
67 Handle<Object> ToHandle(LConstantOperand* op) const;
68 Operand ToOperand(LOperand* op) const;
69
70 // Try to generate code for the entire chunk, but it may fail if the
71 // chunk contains constructs we cannot handle. Returns true if the
72 // code generation attempt succeeded.
73 bool GenerateCode();
74
75 // Finish the code by setting stack height, safepoint, and bailout
76 // information on it.
77 void FinishCode(Handle<Code> code);
78
79 // Deferred code support.
80 void DoDeferredNumberTagD(LNumberTagD* instr);
81
82 enum IntegerSignedness { SIGNED_INT32, UNSIGNED_INT32 };
83 void DoDeferredNumberTagIU(LInstruction* instr,
84 LOperand* value,
85 LOperand* temp1,
86 LOperand* temp2,
87 IntegerSignedness signedness);
88
89 void DoDeferredTaggedToI(LTaggedToI* instr, Label* done);
90 void DoDeferredMathAbsTaggedHeapNumber(LMathAbs* instr);
91 void DoDeferredStackCheck(LStackCheck* instr);
92 void DoDeferredMaybeGrowElements(LMaybeGrowElements* instr);
93 void DoDeferredStringCharCodeAt(LStringCharCodeAt* instr);
94 void DoDeferredStringCharFromCode(LStringCharFromCode* instr);
95 void DoDeferredAllocate(LAllocate* instr);
96 void DoDeferredInstanceMigration(LCheckMaps* instr, Register object);
97 void DoDeferredLoadMutableDouble(LLoadFieldByIndex* instr,
98 Register object,
99 Register index);
100
101// Parallel move support.
102 void DoParallelMove(LParallelMove* move);
103 void DoGap(LGap* instr);
104
105 // Emit frame translation commands for an environment.
106 void WriteTranslation(LEnvironment* environment, Translation* translation);
107
108 // Declare methods that deal with the individual node types.
109#define DECLARE_DO(type) void Do##type(L##type* node);
110 LITHIUM_CONCRETE_INSTRUCTION_LIST(DECLARE_DO)
111#undef DECLARE_DO
112
113 private:
114 LanguageMode language_mode() const { return info()->language_mode(); }
115
116 LPlatformChunk* chunk() const { return chunk_; }
117 Scope* scope() const { return scope_; }
118 HGraph* graph() const { return chunk()->graph(); }
119
120 XMMRegister double_scratch0() const { return xmm0; }
121
122 void EmitClassOfTest(Label* if_true,
123 Label* if_false,
124 Handle<String> class_name,
125 Register input,
126 Register temporary,
127 Register scratch);
128
Ben Murdoch097c5b22016-05-18 11:27:45 +0100129 bool HasAllocatedStackSlots() const {
130 return chunk()->HasAllocatedStackSlots();
131 }
132 int GetStackSlotCount() const { return chunk()->GetSpillSlotCount(); }
133 int GetTotalFrameSlotCount() const {
134 return chunk()->GetTotalFrameSlotCount();
135 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000136
137 void AddDeferredCode(LDeferredCode* code) { deferred_.Add(code, zone()); }
138
139
140 void SaveCallerDoubles();
141 void RestoreCallerDoubles();
142
143 // Code generation passes. Returns true if code generation should
144 // continue.
145 void GenerateBodyInstructionPre(LInstruction* instr) override;
146 void GenerateBodyInstructionPost(LInstruction* instr) override;
147 bool GeneratePrologue();
148 bool GenerateDeferredCode();
149 bool GenerateJumpTable();
150 bool GenerateSafepointTable();
151
152 // Generates the custom OSR entrypoint and sets the osr_pc_offset.
153 void GenerateOsrPrologue();
154
155 enum SafepointMode {
156 RECORD_SIMPLE_SAFEPOINT,
157 RECORD_SAFEPOINT_WITH_REGISTERS
158 };
159
160 void CallCodeGeneric(Handle<Code> code,
161 RelocInfo::Mode mode,
162 LInstruction* instr,
163 SafepointMode safepoint_mode,
164 int argc);
165
166
167 void CallCode(Handle<Code> code,
168 RelocInfo::Mode mode,
169 LInstruction* instr);
170
171 void CallRuntime(const Runtime::Function* function,
172 int num_arguments,
173 LInstruction* instr,
174 SaveFPRegsMode save_doubles = kDontSaveFPRegs);
175
176 void CallRuntime(Runtime::FunctionId id,
177 int num_arguments,
178 LInstruction* instr) {
179 const Runtime::Function* function = Runtime::FunctionForId(id);
180 CallRuntime(function, num_arguments, instr);
181 }
182
183 void CallRuntime(Runtime::FunctionId id, LInstruction* instr) {
184 const Runtime::Function* function = Runtime::FunctionForId(id);
185 CallRuntime(function, function->nargs, instr);
186 }
187
188 void CallRuntimeFromDeferred(Runtime::FunctionId id,
189 int argc,
190 LInstruction* instr,
191 LOperand* context);
192
193 void LoadContextFromDeferred(LOperand* context);
194
195 // Generate a direct call to a known function. Expects the function
196 // to be in rdi.
197 void CallKnownFunction(Handle<JSFunction> function,
198 int formal_parameter_count, int arity,
199 LInstruction* instr);
200
201 void RecordSafepointWithLazyDeopt(LInstruction* instr,
202 SafepointMode safepoint_mode,
203 int argc);
204 void RegisterEnvironmentForDeoptimization(LEnvironment* environment,
205 Safepoint::DeoptMode mode);
206 void DeoptimizeIf(Condition cc, LInstruction* instr,
207 Deoptimizer::DeoptReason deopt_reason,
208 Deoptimizer::BailoutType bailout_type);
209 void DeoptimizeIf(Condition cc, LInstruction* instr,
210 Deoptimizer::DeoptReason deopt_reason);
211
212 bool DeoptEveryNTimes() {
213 return FLAG_deopt_every_n_times != 0 && !info()->IsStub();
214 }
215
216 void AddToTranslation(LEnvironment* environment,
217 Translation* translation,
218 LOperand* op,
219 bool is_tagged,
220 bool is_uint32,
221 int* object_index_pointer,
222 int* dematerialized_index_pointer);
223
224 Register ToRegister(int index) const;
225 XMMRegister ToDoubleRegister(int index) const;
226 Operand BuildFastArrayOperand(
227 LOperand* elements_pointer,
228 LOperand* key,
229 Representation key_representation,
230 ElementsKind elements_kind,
231 uint32_t base_offset);
232
233 Operand BuildSeqStringOperand(Register string,
234 LOperand* index,
235 String::Encoding encoding);
236
237 void EmitIntegerMathAbs(LMathAbs* instr);
238 void EmitSmiMathAbs(LMathAbs* instr);
239
240 // Support for recording safepoint and position information.
241 void RecordSafepoint(LPointerMap* pointers,
242 Safepoint::Kind kind,
243 int arguments,
244 Safepoint::DeoptMode mode);
245 void RecordSafepoint(LPointerMap* pointers, Safepoint::DeoptMode mode);
246 void RecordSafepoint(Safepoint::DeoptMode mode);
247 void RecordSafepointWithRegisters(LPointerMap* pointers,
248 int arguments,
249 Safepoint::DeoptMode mode);
250 void RecordAndWritePosition(int position) override;
251
252 static Condition TokenToCondition(Token::Value op, bool is_unsigned);
253 void EmitGoto(int block);
254
255 // EmitBranch expects to be the last instruction of a block.
256 template<class InstrType>
257 void EmitBranch(InstrType instr, Condition cc);
258 template <class InstrType>
259 void EmitTrueBranch(InstrType instr, Condition cc);
260 template <class InstrType>
261 void EmitFalseBranch(InstrType instr, Condition cc);
262 void EmitNumberUntagD(LNumberUntagD* instr, Register input,
263 XMMRegister result, NumberUntagDMode mode);
264
265 // Emits optimized code for typeof x == "y". Modifies input register.
266 // Returns the condition on which a final split to
267 // true and false label should be made, to optimize fallthrough.
268 Condition EmitTypeofIs(LTypeofIsAndBranch* instr, Register input);
269
270 // Emits optimized code for %_IsString(x). Preserves input register.
271 // Returns the condition on which a final split to
272 // true and false label should be made, to optimize fallthrough.
273 Condition EmitIsString(Register input,
274 Register temp1,
275 Label* is_not_string,
276 SmiCheck check_needed);
277
278 // Emits code for pushing either a tagged constant, a (non-double)
279 // register, or a stack slot operand.
280 void EmitPushTaggedOperand(LOperand* operand);
281
282 // Emits optimized code to deep-copy the contents of statically known
283 // object graphs (e.g. object literal boilerplate).
284 void EmitDeepCopy(Handle<JSObject> object,
285 Register result,
286 Register source,
287 int* offset,
288 AllocationSiteMode mode);
289
290 void EnsureSpaceForLazyDeopt(int space_needed) override;
291 void DoLoadKeyedExternalArray(LLoadKeyed* instr);
292 void DoLoadKeyedFixedDoubleArray(LLoadKeyed* instr);
293 void DoLoadKeyedFixedArray(LLoadKeyed* instr);
294 void DoStoreKeyedExternalArray(LStoreKeyed* instr);
295 void DoStoreKeyedFixedDoubleArray(LStoreKeyed* instr);
296 void DoStoreKeyedFixedArray(LStoreKeyed* instr);
297
298 template <class T>
299 void EmitVectorLoadICRegisters(T* instr);
300 template <class T>
301 void EmitVectorStoreICRegisters(T* instr);
302
303#ifdef _MSC_VER
304 // On windows, you may not access the stack more than one page below
305 // the most recently mapped page. To make the allocated area randomly
306 // accessible, we write an arbitrary value to each page in range
307 // rsp + offset - page_size .. rsp in turn.
308 void MakeSureStackPagesMapped(int offset);
309#endif
310
311 ZoneList<Deoptimizer::JumpTableEntry> jump_table_;
312 Scope* const scope_;
313 ZoneList<LDeferredCode*> deferred_;
314 bool frame_is_built_;
315
316 // Builder that keeps track of safepoints in the code. The table
317 // itself is emitted at the end of the generated code.
318 SafepointTableBuilder safepoints_;
319
320 // Compiler from a set of parallel moves to a sequential list of moves.
321 LGapResolver resolver_;
322
323 Safepoint::Kind expected_safepoint_kind_;
324
325 class PushSafepointRegistersScope final BASE_EMBEDDED {
326 public:
327 explicit PushSafepointRegistersScope(LCodeGen* codegen)
328 : codegen_(codegen) {
329 DCHECK(codegen_->info()->is_calling());
330 DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kSimple);
331 codegen_->masm_->PushSafepointRegisters();
332 codegen_->expected_safepoint_kind_ = Safepoint::kWithRegisters;
333 }
334
335 ~PushSafepointRegistersScope() {
336 DCHECK(codegen_->expected_safepoint_kind_ == Safepoint::kWithRegisters);
337 codegen_->masm_->PopSafepointRegisters();
338 codegen_->expected_safepoint_kind_ = Safepoint::kSimple;
339 }
340
341 private:
342 LCodeGen* codegen_;
343 };
344
345 friend class LDeferredCode;
346 friend class LEnvironment;
347 friend class SafepointGenerator;
348 DISALLOW_COPY_AND_ASSIGN(LCodeGen);
349};
350
351
352class LDeferredCode: public ZoneObject {
353 public:
354 explicit LDeferredCode(LCodeGen* codegen)
355 : codegen_(codegen),
356 external_exit_(NULL),
357 instruction_index_(codegen->current_instruction_) {
358 codegen->AddDeferredCode(this);
359 }
360
361 virtual ~LDeferredCode() {}
362 virtual void Generate() = 0;
363 virtual LInstruction* instr() = 0;
364
365 void SetExit(Label* exit) { external_exit_ = exit; }
366 Label* entry() { return &entry_; }
367 Label* exit() { return external_exit_ != NULL ? external_exit_ : &exit_; }
368 Label* done() { return codegen_->NeedsDeferredFrame() ? &done_ : exit(); }
369 int instruction_index() const { return instruction_index_; }
370
371 protected:
372 LCodeGen* codegen() const { return codegen_; }
373 MacroAssembler* masm() const { return codegen_->masm(); }
374
375 private:
376 LCodeGen* codegen_;
377 Label entry_;
378 Label exit_;
379 Label done_;
380 Label* external_exit_;
381 int instruction_index_;
382};
383
384} // namespace internal
385} // namespace v8
386
387#endif // V8_CRANKSHAFT_X64_LITHIUM_CODEGEN_X64_H_