1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
* vim: set ts=8 sts=4 et sw=4 tw=99:
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef jit_shared_CodeGenerator_shared_inl_h
#define jit_shared_CodeGenerator_shared_inl_h
#include "jit/shared/CodeGenerator-shared.h"
#include "jit/Disassembler.h"
#include "jit/MacroAssembler-inl.h"
namespace js {
namespace jit {
static inline bool
IsConstant(const LInt64Allocation& a)
{
#if JS_BITS_PER_WORD == 32
if (a.high().isConstantValue())
return true;
if (a.high().isConstantIndex())
return true;
#else
if (a.value().isConstantValue())
return true;
if (a.value().isConstantIndex())
return true;
#endif
return false;
}
static inline int32_t
ToInt32(const LAllocation* a)
{
if (a->isConstantValue())
return a->toConstant()->toInt32();
if (a->isConstantIndex())
return a->toConstantIndex()->index();
MOZ_CRASH("this is not a constant!");
}
static inline int64_t
ToInt64(const LAllocation* a)
{
if (a->isConstantValue())
return a->toConstant()->toInt64();
if (a->isConstantIndex())
return a->toConstantIndex()->index();
MOZ_CRASH("this is not a constant!");
}
static inline int64_t
ToInt64(const LInt64Allocation& a)
{
#if JS_BITS_PER_WORD == 32
if (a.high().isConstantValue())
return a.high().toConstant()->toInt64();
if (a.high().isConstantIndex())
return a.high().toConstantIndex()->index();
#else
if (a.value().isConstantValue())
return a.value().toConstant()->toInt64();
if (a.value().isConstantIndex())
return a.value().toConstantIndex()->index();
#endif
MOZ_CRASH("this is not a constant!");
}
static inline double
ToDouble(const LAllocation* a)
{
return a->toConstant()->numberToDouble();
}
static inline Register
ToRegister(const LAllocation& a)
{
MOZ_ASSERT(a.isGeneralReg());
return a.toGeneralReg()->reg();
}
static inline Register
ToRegister(const LAllocation* a)
{
return ToRegister(*a);
}
static inline Register
ToRegister(const LDefinition* def)
{
return ToRegister(*def->output());
}
static inline Register64
ToOutRegister64(LInstruction* ins)
{
#if JS_BITS_PER_WORD == 32
Register loReg = ToRegister(ins->getDef(INT64LOW_INDEX));
Register hiReg = ToRegister(ins->getDef(INT64HIGH_INDEX));
return Register64(hiReg, loReg);
#else
return Register64(ToRegister(ins->getDef(0)));
#endif
}
static inline Register64
ToRegister64(const LInt64Allocation& a)
{
#if JS_BITS_PER_WORD == 32
return Register64(ToRegister(a.high()), ToRegister(a.low()));
#else
return Register64(ToRegister(a.value()));
#endif
}
static inline Register
ToTempRegisterOrInvalid(const LDefinition* def)
{
if (def->isBogusTemp())
return InvalidReg;
return ToRegister(def);
}
static inline Register
ToTempUnboxRegister(const LDefinition* def)
{
return ToTempRegisterOrInvalid(def);
}
static inline Register
ToRegisterOrInvalid(const LDefinition* a)
{
return a ? ToRegister(a) : InvalidReg;
}
static inline FloatRegister
ToFloatRegister(const LAllocation& a)
{
MOZ_ASSERT(a.isFloatReg());
return a.toFloatReg()->reg();
}
static inline FloatRegister
ToFloatRegister(const LAllocation* a)
{
return ToFloatRegister(*a);
}
static inline FloatRegister
ToFloatRegister(const LDefinition* def)
{
return ToFloatRegister(*def->output());
}
static inline FloatRegister
ToTempFloatRegisterOrInvalid(const LDefinition* def)
{
if (def->isBogusTemp())
return InvalidFloatReg;
return ToFloatRegister(def);
}
static inline AnyRegister
ToAnyRegister(const LAllocation& a)
{
MOZ_ASSERT(a.isGeneralReg() || a.isFloatReg());
if (a.isGeneralReg())
return AnyRegister(ToRegister(a));
return AnyRegister(ToFloatRegister(a));
}
static inline AnyRegister
ToAnyRegister(const LAllocation* a)
{
return ToAnyRegister(*a);
}
static inline AnyRegister
ToAnyRegister(const LDefinition* def)
{
return ToAnyRegister(def->output());
}
static inline RegisterOrInt32Constant
ToRegisterOrInt32Constant(const LAllocation* a)
{
if (a->isConstant())
return RegisterOrInt32Constant(ToInt32(a));
return RegisterOrInt32Constant(ToRegister(a));
}
static inline ValueOperand
GetValueOutput(LInstruction* ins)
{
#if defined(JS_NUNBOX32)
return ValueOperand(ToRegister(ins->getDef(TYPE_INDEX)),
ToRegister(ins->getDef(PAYLOAD_INDEX)));
#elif defined(JS_PUNBOX64)
return ValueOperand(ToRegister(ins->getDef(0)));
#else
#error "Unknown"
#endif
}
static inline ValueOperand
GetTempValue(Register type, Register payload)
{
#if defined(JS_NUNBOX32)
return ValueOperand(type, payload);
#elif defined(JS_PUNBOX64)
(void)type;
return ValueOperand(payload);
#else
#error "Unknown"
#endif
}
int32_t
CodeGeneratorShared::ArgToStackOffset(int32_t slot) const
{
return masm.framePushed() +
(gen->compilingWasm() ? sizeof(wasm::Frame) : sizeof(JitFrameLayout)) +
slot;
}
int32_t
CodeGeneratorShared::CalleeStackOffset() const
{
return masm.framePushed() + JitFrameLayout::offsetOfCalleeToken();
}
int32_t
CodeGeneratorShared::SlotToStackOffset(int32_t slot) const
{
MOZ_ASSERT(slot > 0 && slot <= int32_t(graph.localSlotCount()));
int32_t offset = masm.framePushed() - frameInitialAdjustment_ - slot;
MOZ_ASSERT(offset >= 0);
return offset;
}
int32_t
CodeGeneratorShared::StackOffsetToSlot(int32_t offset) const
{
// See: SlotToStackOffset. This is used to convert pushed arguments
// to a slot index that safepoints can use.
//
// offset = framePushed - frameInitialAdjustment - slot
// offset + slot = framePushed - frameInitialAdjustment
// slot = framePushed - frameInitialAdjustement - offset
return masm.framePushed() - frameInitialAdjustment_ - offset;
}
// For argument construction for calls. Argslots are Value-sized.
int32_t
CodeGeneratorShared::StackOffsetOfPassedArg(int32_t slot) const
{
// A slot of 0 is permitted only to calculate %esp offset for calls.
MOZ_ASSERT(slot >= 0 && slot <= int32_t(graph.argumentSlotCount()));
int32_t offset = masm.framePushed() -
graph.paddedLocalSlotsSize() -
(slot * sizeof(Value));
// Passed arguments go below A function's local stack storage.
// When arguments are being pushed, there is nothing important on the stack.
// Therefore, It is safe to push the arguments down arbitrarily. Pushing
// by sizeof(Value) is desirable since everything on the stack is a Value.
// Note that paddedLocalSlotCount() aligns to at least a Value boundary
// specifically to support this.
MOZ_ASSERT(offset >= 0);
MOZ_ASSERT(offset % sizeof(Value) == 0);
return offset;
}
int32_t
CodeGeneratorShared::ToStackOffset(LAllocation a) const
{
if (a.isArgument())
return ArgToStackOffset(a.toArgument()->index());
return SlotToStackOffset(a.toStackSlot()->slot());
}
int32_t
CodeGeneratorShared::ToStackOffset(const LAllocation* a) const
{
return ToStackOffset(*a);
}
Address
CodeGeneratorShared::ToAddress(const LAllocation& a)
{
MOZ_ASSERT(a.isMemory());
return Address(masm.getStackPointer(), ToStackOffset(&a));
}
Address
CodeGeneratorShared::ToAddress(const LAllocation* a)
{
return ToAddress(*a);
}
void
CodeGeneratorShared::saveLive(LInstruction* ins)
{
MOZ_ASSERT(!ins->isCall());
LSafepoint* safepoint = ins->safepoint();
masm.PushRegsInMask(safepoint->liveRegs());
}
void
CodeGeneratorShared::restoreLive(LInstruction* ins)
{
MOZ_ASSERT(!ins->isCall());
LSafepoint* safepoint = ins->safepoint();
masm.PopRegsInMask(safepoint->liveRegs());
}
void
CodeGeneratorShared::restoreLiveIgnore(LInstruction* ins, LiveRegisterSet ignore)
{
MOZ_ASSERT(!ins->isCall());
LSafepoint* safepoint = ins->safepoint();
masm.PopRegsInMaskIgnore(safepoint->liveRegs(), ignore);
}
void
CodeGeneratorShared::saveLiveVolatile(LInstruction* ins)
{
MOZ_ASSERT(!ins->isCall());
LSafepoint* safepoint = ins->safepoint();
LiveRegisterSet regs;
regs.set() = RegisterSet::Intersect(safepoint->liveRegs().set(), RegisterSet::Volatile());
masm.PushRegsInMask(regs);
}
void
CodeGeneratorShared::restoreLiveVolatile(LInstruction* ins)
{
MOZ_ASSERT(!ins->isCall());
LSafepoint* safepoint = ins->safepoint();
LiveRegisterSet regs;
regs.set() = RegisterSet::Intersect(safepoint->liveRegs().set(), RegisterSet::Volatile());
masm.PopRegsInMask(regs);
}
void
CodeGeneratorShared::verifyHeapAccessDisassembly(uint32_t begin, uint32_t end, bool isLoad,
Scalar::Type type, Operand mem, LAllocation alloc)
{
#ifdef DEBUG
using namespace Disassembler;
Disassembler::HeapAccess::Kind kind = isLoad ? HeapAccess::Load : HeapAccess::Store;
switch (type) {
case Scalar::Int8:
case Scalar::Int16:
if (kind == HeapAccess::Load)
kind = HeapAccess::LoadSext32;
break;
default:
break;
}
OtherOperand op;
switch (type) {
case Scalar::Int8:
case Scalar::Uint8:
case Scalar::Int16:
case Scalar::Uint16:
case Scalar::Int32:
case Scalar::Uint32:
if (!alloc.isConstant()) {
op = OtherOperand(ToRegister(alloc).encoding());
} else {
// x86 doesn't allow encoding an imm64 to memory move; the value
// is wrapped anyways.
int32_t i = ToInt32(&alloc);
// Sign-extend the immediate value out to 32 bits. We do this even
// for unsigned element types so that we match what the disassembly
// code does, as it doesn't know about signedness of stores.
unsigned shift = 32 - TypedArrayElemSize(type) * 8;
i = i << shift >> shift;
op = OtherOperand(i);
}
break;
case Scalar::Int64:
// Can't encode an imm64-to-memory move.
op = OtherOperand(ToRegister(alloc).encoding());
break;
case Scalar::Float32:
case Scalar::Float64:
case Scalar::Float32x4:
case Scalar::Int8x16:
case Scalar::Int16x8:
case Scalar::Int32x4:
op = OtherOperand(ToFloatRegister(alloc).encoding());
break;
case Scalar::Uint8Clamped:
case Scalar::MaxTypedArrayViewType:
MOZ_CRASH("Unexpected array type");
}
HeapAccess access(kind, TypedArrayElemSize(type), ComplexAddress(mem), op);
masm.verifyHeapAccessDisassembly(begin, end, access);
#endif
}
void
CodeGeneratorShared::verifyLoadDisassembly(uint32_t begin, uint32_t end, Scalar::Type type,
Operand mem, LAllocation alloc)
{
verifyHeapAccessDisassembly(begin, end, true, type, mem, alloc);
}
void
CodeGeneratorShared::verifyStoreDisassembly(uint32_t begin, uint32_t end, Scalar::Type type,
Operand mem, LAllocation alloc)
{
verifyHeapAccessDisassembly(begin, end, false, type, mem, alloc);
}
inline bool
CodeGeneratorShared::isGlobalObject(JSObject* object)
{
// Calling object->is<GlobalObject>() is racy because this relies on
// checking the group and this can be changed while we are compiling off the
// main thread.
return object == gen->compartment->maybeGlobal();
}
} // namespace jit
} // namespace js
#endif /* jit_shared_CodeGenerator_shared_inl_h */
|