blob: 42e5a13157fc54a97743d617f22026d6f6b2d9ca [file] [log] [blame]
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001// Copyright 2014 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#include <assert.h> // For assert
6#include <limits.h> // For LONG_MIN, LONG_MAX.
7
Emily Bernierd0a1eb72015-03-24 16:35:39 -04008#if V8_TARGET_ARCH_PPC
9
10#include "src/base/bits.h"
11#include "src/base/division-by-constant.h"
12#include "src/bootstrapper.h"
13#include "src/codegen.h"
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000014#include "src/debug/debug.h"
15#include "src/register-configuration.h"
Emily Bernierd0a1eb72015-03-24 16:35:39 -040016#include "src/runtime/runtime.h"
17
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000018#include "src/ppc/macro-assembler-ppc.h"
19
Emily Bernierd0a1eb72015-03-24 16:35:39 -040020namespace v8 {
21namespace internal {
22
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000023MacroAssembler::MacroAssembler(Isolate* arg_isolate, void* buffer, int size,
24 CodeObjectRequired create_code_object)
Emily Bernierd0a1eb72015-03-24 16:35:39 -040025 : Assembler(arg_isolate, buffer, size),
26 generating_stub_(false),
27 has_frame_(false) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000028 if (create_code_object == CodeObjectRequired::kYes) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -040029 code_object_ =
Ben Murdoch4a90d5f2016-03-22 12:00:34 +000030 Handle<Object>::New(isolate()->heap()->undefined_value(), isolate());
Emily Bernierd0a1eb72015-03-24 16:35:39 -040031 }
32}
33
34
35void MacroAssembler::Jump(Register target) {
36 mtctr(target);
37 bctr();
38}
39
40
41void MacroAssembler::JumpToJSEntry(Register target) {
42 Move(ip, target);
43 Jump(ip);
44}
45
46
47void MacroAssembler::Jump(intptr_t target, RelocInfo::Mode rmode,
48 Condition cond, CRegister cr) {
49 Label skip;
50
51 if (cond != al) b(NegateCondition(cond), &skip, cr);
52
53 DCHECK(rmode == RelocInfo::CODE_TARGET || rmode == RelocInfo::RUNTIME_ENTRY);
54
55 mov(ip, Operand(target, rmode));
56 mtctr(ip);
57 bctr();
58
59 bind(&skip);
60}
61
62
63void MacroAssembler::Jump(Address target, RelocInfo::Mode rmode, Condition cond,
64 CRegister cr) {
65 DCHECK(!RelocInfo::IsCodeTarget(rmode));
66 Jump(reinterpret_cast<intptr_t>(target), rmode, cond, cr);
67}
68
69
70void MacroAssembler::Jump(Handle<Code> code, RelocInfo::Mode rmode,
71 Condition cond) {
72 DCHECK(RelocInfo::IsCodeTarget(rmode));
73 // 'code' is always generated ppc code, never THUMB code
74 AllowDeferredHandleDereference embedding_raw_address;
75 Jump(reinterpret_cast<intptr_t>(code.location()), rmode, cond);
76}
77
78
79int MacroAssembler::CallSize(Register target) { return 2 * kInstrSize; }
80
81
82void MacroAssembler::Call(Register target) {
83 BlockTrampolinePoolScope block_trampoline_pool(this);
84 Label start;
85 bind(&start);
86
87 // Statement positions are expected to be recorded when the target
88 // address is loaded.
89 positions_recorder()->WriteRecordedPositions();
90
91 // branch via link register and set LK bit for return point
92 mtctr(target);
93 bctrl();
94
95 DCHECK_EQ(CallSize(target), SizeOfCodeGeneratedSince(&start));
96}
97
98
99void MacroAssembler::CallJSEntry(Register target) {
100 DCHECK(target.is(ip));
101 Call(target);
102}
103
104
105int MacroAssembler::CallSize(Address target, RelocInfo::Mode rmode,
106 Condition cond) {
107 Operand mov_operand = Operand(reinterpret_cast<intptr_t>(target), rmode);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000108 return (2 + instructions_required_for_mov(ip, mov_operand)) * kInstrSize;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400109}
110
111
112int MacroAssembler::CallSizeNotPredictableCodeSize(Address target,
113 RelocInfo::Mode rmode,
114 Condition cond) {
115 return (2 + kMovInstructionsNoConstantPool) * kInstrSize;
116}
117
118
119void MacroAssembler::Call(Address target, RelocInfo::Mode rmode,
120 Condition cond) {
121 BlockTrampolinePoolScope block_trampoline_pool(this);
122 DCHECK(cond == al);
123
124#ifdef DEBUG
125 // Check the expected size before generating code to ensure we assume the same
126 // constant pool availability (e.g., whether constant pool is full or not).
127 int expected_size = CallSize(target, rmode, cond);
128 Label start;
129 bind(&start);
130#endif
131
132 // Statement positions are expected to be recorded when the target
133 // address is loaded.
134 positions_recorder()->WriteRecordedPositions();
135
136 // This can likely be optimized to make use of bc() with 24bit relative
137 //
138 // RecordRelocInfo(x.rmode_, x.imm_);
139 // bc( BA, .... offset, LKset);
140 //
141
142 mov(ip, Operand(reinterpret_cast<intptr_t>(target), rmode));
143 mtctr(ip);
144 bctrl();
145
146 DCHECK_EQ(expected_size, SizeOfCodeGeneratedSince(&start));
147}
148
149
150int MacroAssembler::CallSize(Handle<Code> code, RelocInfo::Mode rmode,
151 TypeFeedbackId ast_id, Condition cond) {
152 AllowDeferredHandleDereference using_raw_address;
153 return CallSize(reinterpret_cast<Address>(code.location()), rmode, cond);
154}
155
156
157void MacroAssembler::Call(Handle<Code> code, RelocInfo::Mode rmode,
158 TypeFeedbackId ast_id, Condition cond) {
159 BlockTrampolinePoolScope block_trampoline_pool(this);
160 DCHECK(RelocInfo::IsCodeTarget(rmode));
161
162#ifdef DEBUG
163 // Check the expected size before generating code to ensure we assume the same
164 // constant pool availability (e.g., whether constant pool is full or not).
165 int expected_size = CallSize(code, rmode, ast_id, cond);
166 Label start;
167 bind(&start);
168#endif
169
170 if (rmode == RelocInfo::CODE_TARGET && !ast_id.IsNone()) {
171 SetRecordedAstId(ast_id);
172 rmode = RelocInfo::CODE_TARGET_WITH_ID;
173 }
174 AllowDeferredHandleDereference using_raw_address;
175 Call(reinterpret_cast<Address>(code.location()), rmode, cond);
176 DCHECK_EQ(expected_size, SizeOfCodeGeneratedSince(&start));
177}
178
179
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000180void MacroAssembler::Drop(int count) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400181 if (count > 0) {
182 Add(sp, sp, count * kPointerSize, r0);
183 }
184}
185
Ben Murdoch097c5b22016-05-18 11:27:45 +0100186void MacroAssembler::Drop(Register count, Register scratch) {
187 ShiftLeftImm(scratch, count, Operand(kPointerSizeLog2));
188 add(sp, sp, scratch);
189}
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400190
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400191void MacroAssembler::Call(Label* target) { b(target, SetLK); }
192
193
194void MacroAssembler::Push(Handle<Object> handle) {
195 mov(r0, Operand(handle));
196 push(r0);
197}
198
199
200void MacroAssembler::Move(Register dst, Handle<Object> value) {
201 AllowDeferredHandleDereference smi_check;
202 if (value->IsSmi()) {
203 LoadSmiLiteral(dst, reinterpret_cast<Smi*>(*value));
204 } else {
205 DCHECK(value->IsHeapObject());
206 if (isolate()->heap()->InNewSpace(*value)) {
207 Handle<Cell> cell = isolate()->factory()->NewCell(value);
208 mov(dst, Operand(cell));
209 LoadP(dst, FieldMemOperand(dst, Cell::kValueOffset));
210 } else {
211 mov(dst, Operand(value));
212 }
213 }
214}
215
216
217void MacroAssembler::Move(Register dst, Register src, Condition cond) {
218 DCHECK(cond == al);
219 if (!dst.is(src)) {
220 mr(dst, src);
221 }
222}
223
224
225void MacroAssembler::Move(DoubleRegister dst, DoubleRegister src) {
226 if (!dst.is(src)) {
227 fmr(dst, src);
228 }
229}
230
231
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000232void MacroAssembler::MultiPush(RegList regs, Register location) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400233 int16_t num_to_push = NumberOfBitsSet(regs);
234 int16_t stack_offset = num_to_push * kPointerSize;
235
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000236 subi(location, location, Operand(stack_offset));
237 for (int16_t i = Register::kNumRegisters - 1; i >= 0; i--) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400238 if ((regs & (1 << i)) != 0) {
239 stack_offset -= kPointerSize;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000240 StoreP(ToRegister(i), MemOperand(location, stack_offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400241 }
242 }
243}
244
245
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000246void MacroAssembler::MultiPop(RegList regs, Register location) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400247 int16_t stack_offset = 0;
248
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000249 for (int16_t i = 0; i < Register::kNumRegisters; i++) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400250 if ((regs & (1 << i)) != 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000251 LoadP(ToRegister(i), MemOperand(location, stack_offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400252 stack_offset += kPointerSize;
253 }
254 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000255 addi(location, location, Operand(stack_offset));
256}
257
258
259void MacroAssembler::MultiPushDoubles(RegList dregs, Register location) {
260 int16_t num_to_push = NumberOfBitsSet(dregs);
261 int16_t stack_offset = num_to_push * kDoubleSize;
262
263 subi(location, location, Operand(stack_offset));
264 for (int16_t i = DoubleRegister::kNumRegisters - 1; i >= 0; i--) {
265 if ((dregs & (1 << i)) != 0) {
266 DoubleRegister dreg = DoubleRegister::from_code(i);
267 stack_offset -= kDoubleSize;
268 stfd(dreg, MemOperand(location, stack_offset));
269 }
270 }
271}
272
273
274void MacroAssembler::MultiPopDoubles(RegList dregs, Register location) {
275 int16_t stack_offset = 0;
276
277 for (int16_t i = 0; i < DoubleRegister::kNumRegisters; i++) {
278 if ((dregs & (1 << i)) != 0) {
279 DoubleRegister dreg = DoubleRegister::from_code(i);
280 lfd(dreg, MemOperand(location, stack_offset));
281 stack_offset += kDoubleSize;
282 }
283 }
284 addi(location, location, Operand(stack_offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400285}
286
287
288void MacroAssembler::LoadRoot(Register destination, Heap::RootListIndex index,
289 Condition cond) {
290 DCHECK(cond == al);
291 LoadP(destination, MemOperand(kRootRegister, index << kPointerSizeLog2), r0);
292}
293
294
295void MacroAssembler::StoreRoot(Register source, Heap::RootListIndex index,
296 Condition cond) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000297 DCHECK(Heap::RootCanBeWrittenAfterInitialization(index));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400298 DCHECK(cond == al);
299 StoreP(source, MemOperand(kRootRegister, index << kPointerSizeLog2), r0);
300}
301
302
303void MacroAssembler::InNewSpace(Register object, Register scratch,
304 Condition cond, Label* branch) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400305 DCHECK(cond == eq || cond == ne);
Ben Murdoch097c5b22016-05-18 11:27:45 +0100306 const int mask =
307 (1 << MemoryChunk::IN_FROM_SPACE) | (1 << MemoryChunk::IN_TO_SPACE);
308 CheckPageFlag(object, scratch, mask, cond, branch);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400309}
310
311
312void MacroAssembler::RecordWriteField(
313 Register object, int offset, Register value, Register dst,
314 LinkRegisterStatus lr_status, SaveFPRegsMode save_fp,
315 RememberedSetAction remembered_set_action, SmiCheck smi_check,
316 PointersToHereCheck pointers_to_here_check_for_value) {
317 // First, check if a write barrier is even needed. The tests below
318 // catch stores of Smis.
319 Label done;
320
321 // Skip barrier if writing a smi.
322 if (smi_check == INLINE_SMI_CHECK) {
323 JumpIfSmi(value, &done);
324 }
325
326 // Although the object register is tagged, the offset is relative to the start
327 // of the object, so so offset must be a multiple of kPointerSize.
328 DCHECK(IsAligned(offset, kPointerSize));
329
330 Add(dst, object, offset - kHeapObjectTag, r0);
331 if (emit_debug_code()) {
332 Label ok;
333 andi(r0, dst, Operand((1 << kPointerSizeLog2) - 1));
334 beq(&ok, cr0);
335 stop("Unaligned cell in write barrier");
336 bind(&ok);
337 }
338
339 RecordWrite(object, dst, value, lr_status, save_fp, remembered_set_action,
340 OMIT_SMI_CHECK, pointers_to_here_check_for_value);
341
342 bind(&done);
343
344 // Clobber clobbered input registers when running with the debug-code flag
345 // turned on to provoke errors.
346 if (emit_debug_code()) {
347 mov(value, Operand(bit_cast<intptr_t>(kZapValue + 4)));
348 mov(dst, Operand(bit_cast<intptr_t>(kZapValue + 8)));
349 }
350}
351
352
353// Will clobber 4 registers: object, map, dst, ip. The
354// register 'object' contains a heap object pointer.
355void MacroAssembler::RecordWriteForMap(Register object, Register map,
356 Register dst,
357 LinkRegisterStatus lr_status,
358 SaveFPRegsMode fp_mode) {
359 if (emit_debug_code()) {
360 LoadP(dst, FieldMemOperand(map, HeapObject::kMapOffset));
361 Cmpi(dst, Operand(isolate()->factory()->meta_map()), r0);
362 Check(eq, kWrongAddressOrValuePassedToRecordWrite);
363 }
364
365 if (!FLAG_incremental_marking) {
366 return;
367 }
368
369 if (emit_debug_code()) {
370 LoadP(ip, FieldMemOperand(object, HeapObject::kMapOffset));
371 cmp(ip, map);
372 Check(eq, kWrongAddressOrValuePassedToRecordWrite);
373 }
374
375 Label done;
376
377 // A single check of the map's pages interesting flag suffices, since it is
378 // only set during incremental collection, and then it's also guaranteed that
379 // the from object's page's interesting flag is also set. This optimization
380 // relies on the fact that maps can never be in new space.
381 CheckPageFlag(map,
382 map, // Used as scratch.
383 MemoryChunk::kPointersToHereAreInterestingMask, eq, &done);
384
385 addi(dst, object, Operand(HeapObject::kMapOffset - kHeapObjectTag));
386 if (emit_debug_code()) {
387 Label ok;
388 andi(r0, dst, Operand((1 << kPointerSizeLog2) - 1));
389 beq(&ok, cr0);
390 stop("Unaligned cell in write barrier");
391 bind(&ok);
392 }
393
394 // Record the actual write.
395 if (lr_status == kLRHasNotBeenSaved) {
396 mflr(r0);
397 push(r0);
398 }
399 RecordWriteStub stub(isolate(), object, map, dst, OMIT_REMEMBERED_SET,
400 fp_mode);
401 CallStub(&stub);
402 if (lr_status == kLRHasNotBeenSaved) {
403 pop(r0);
404 mtlr(r0);
405 }
406
407 bind(&done);
408
409 // Count number of write barriers in generated code.
410 isolate()->counters()->write_barriers_static()->Increment();
411 IncrementCounter(isolate()->counters()->write_barriers_dynamic(), 1, ip, dst);
412
413 // Clobber clobbered registers when running with the debug-code flag
414 // turned on to provoke errors.
415 if (emit_debug_code()) {
416 mov(dst, Operand(bit_cast<intptr_t>(kZapValue + 12)));
417 mov(map, Operand(bit_cast<intptr_t>(kZapValue + 16)));
418 }
419}
420
421
422// Will clobber 4 registers: object, address, scratch, ip. The
423// register 'object' contains a heap object pointer. The heap object
424// tag is shifted away.
425void MacroAssembler::RecordWrite(
426 Register object, Register address, Register value,
427 LinkRegisterStatus lr_status, SaveFPRegsMode fp_mode,
428 RememberedSetAction remembered_set_action, SmiCheck smi_check,
429 PointersToHereCheck pointers_to_here_check_for_value) {
430 DCHECK(!object.is(value));
431 if (emit_debug_code()) {
432 LoadP(r0, MemOperand(address));
433 cmp(r0, value);
434 Check(eq, kWrongAddressOrValuePassedToRecordWrite);
435 }
436
437 if (remembered_set_action == OMIT_REMEMBERED_SET &&
438 !FLAG_incremental_marking) {
439 return;
440 }
441
442 // First, check if a write barrier is even needed. The tests below
443 // catch stores of smis and stores into the young generation.
444 Label done;
445
446 if (smi_check == INLINE_SMI_CHECK) {
447 JumpIfSmi(value, &done);
448 }
449
450 if (pointers_to_here_check_for_value != kPointersToHereAreAlwaysInteresting) {
451 CheckPageFlag(value,
452 value, // Used as scratch.
453 MemoryChunk::kPointersToHereAreInterestingMask, eq, &done);
454 }
455 CheckPageFlag(object,
456 value, // Used as scratch.
457 MemoryChunk::kPointersFromHereAreInterestingMask, eq, &done);
458
459 // Record the actual write.
460 if (lr_status == kLRHasNotBeenSaved) {
461 mflr(r0);
462 push(r0);
463 }
464 RecordWriteStub stub(isolate(), object, value, address, remembered_set_action,
465 fp_mode);
466 CallStub(&stub);
467 if (lr_status == kLRHasNotBeenSaved) {
468 pop(r0);
469 mtlr(r0);
470 }
471
472 bind(&done);
473
474 // Count number of write barriers in generated code.
475 isolate()->counters()->write_barriers_static()->Increment();
476 IncrementCounter(isolate()->counters()->write_barriers_dynamic(), 1, ip,
477 value);
478
479 // Clobber clobbered registers when running with the debug-code flag
480 // turned on to provoke errors.
481 if (emit_debug_code()) {
482 mov(address, Operand(bit_cast<intptr_t>(kZapValue + 12)));
483 mov(value, Operand(bit_cast<intptr_t>(kZapValue + 16)));
484 }
485}
486
Ben Murdoch097c5b22016-05-18 11:27:45 +0100487void MacroAssembler::RecordWriteCodeEntryField(Register js_function,
488 Register code_entry,
489 Register scratch) {
490 const int offset = JSFunction::kCodeEntryOffset;
491
492 // Since a code entry (value) is always in old space, we don't need to update
493 // remembered set. If incremental marking is off, there is nothing for us to
494 // do.
495 if (!FLAG_incremental_marking) return;
496
497 DCHECK(js_function.is(r4));
498 DCHECK(code_entry.is(r7));
499 DCHECK(scratch.is(r8));
500 AssertNotSmi(js_function);
501
502 if (emit_debug_code()) {
503 addi(scratch, js_function, Operand(offset - kHeapObjectTag));
504 LoadP(ip, MemOperand(scratch));
505 cmp(ip, code_entry);
506 Check(eq, kWrongAddressOrValuePassedToRecordWrite);
507 }
508
509 // First, check if a write barrier is even needed. The tests below
510 // catch stores of Smis and stores into young gen.
511 Label done;
512
513 CheckPageFlag(code_entry, scratch,
514 MemoryChunk::kPointersToHereAreInterestingMask, eq, &done);
515 CheckPageFlag(js_function, scratch,
516 MemoryChunk::kPointersFromHereAreInterestingMask, eq, &done);
517
518 const Register dst = scratch;
519 addi(dst, js_function, Operand(offset - kHeapObjectTag));
520
521 // Save caller-saved registers. js_function and code_entry are in the
522 // caller-saved register list.
523 DCHECK(kJSCallerSaved & js_function.bit());
524 DCHECK(kJSCallerSaved & code_entry.bit());
525 mflr(r0);
526 MultiPush(kJSCallerSaved | r0.bit());
527
528 int argument_count = 3;
529 PrepareCallCFunction(argument_count, code_entry);
530
531 mr(r3, js_function);
532 mr(r4, dst);
533 mov(r5, Operand(ExternalReference::isolate_address(isolate())));
534
535 {
536 AllowExternalCallThatCantCauseGC scope(this);
537 CallCFunction(
538 ExternalReference::incremental_marking_record_write_code_entry_function(
539 isolate()),
540 argument_count);
541 }
542
543 // Restore caller-saved registers (including js_function and code_entry).
544 MultiPop(kJSCallerSaved | r0.bit());
545 mtlr(r0);
546
547 bind(&done);
548}
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400549
550void MacroAssembler::RememberedSetHelper(Register object, // For debug tests.
551 Register address, Register scratch,
552 SaveFPRegsMode fp_mode,
553 RememberedSetFinalAction and_then) {
554 Label done;
555 if (emit_debug_code()) {
556 Label ok;
557 JumpIfNotInNewSpace(object, scratch, &ok);
558 stop("Remembered set pointer is in new space");
559 bind(&ok);
560 }
561 // Load store buffer top.
562 ExternalReference store_buffer =
563 ExternalReference::store_buffer_top(isolate());
564 mov(ip, Operand(store_buffer));
565 LoadP(scratch, MemOperand(ip));
566 // Store pointer to buffer and increment buffer top.
567 StoreP(address, MemOperand(scratch));
568 addi(scratch, scratch, Operand(kPointerSize));
569 // Write back new top of buffer.
570 StoreP(scratch, MemOperand(ip));
571 // Call stub on end of buffer.
572 // Check for end of buffer.
Ben Murdochda12d292016-06-02 14:46:10 +0100573 TestBitMask(scratch, StoreBuffer::kStoreBufferMask, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400574
575 if (and_then == kFallThroughAtEnd) {
Ben Murdochda12d292016-06-02 14:46:10 +0100576 bne(&done, cr0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400577 } else {
578 DCHECK(and_then == kReturnAtEnd);
Ben Murdochda12d292016-06-02 14:46:10 +0100579 Ret(ne, cr0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400580 }
581 mflr(r0);
582 push(r0);
583 StoreBufferOverflowStub store_buffer_overflow(isolate(), fp_mode);
584 CallStub(&store_buffer_overflow);
585 pop(r0);
586 mtlr(r0);
587 bind(&done);
588 if (and_then == kReturnAtEnd) {
589 Ret();
590 }
591}
592
Ben Murdochda12d292016-06-02 14:46:10 +0100593void MacroAssembler::PushCommonFrame(Register marker_reg) {
594 int fp_delta = 0;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400595 mflr(r0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000596 if (FLAG_enable_embedded_constant_pool) {
597 if (marker_reg.is_valid()) {
Ben Murdochda12d292016-06-02 14:46:10 +0100598 Push(r0, fp, kConstantPoolRegister, marker_reg);
599 fp_delta = 2;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000600 } else {
Ben Murdochda12d292016-06-02 14:46:10 +0100601 Push(r0, fp, kConstantPoolRegister);
602 fp_delta = 1;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000603 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400604 } else {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000605 if (marker_reg.is_valid()) {
Ben Murdochda12d292016-06-02 14:46:10 +0100606 Push(r0, fp, marker_reg);
607 fp_delta = 1;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000608 } else {
Ben Murdochda12d292016-06-02 14:46:10 +0100609 Push(r0, fp);
610 fp_delta = 0;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000611 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400612 }
Ben Murdochda12d292016-06-02 14:46:10 +0100613 addi(fp, sp, Operand(fp_delta * kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400614}
615
Ben Murdochda12d292016-06-02 14:46:10 +0100616void MacroAssembler::PopCommonFrame(Register marker_reg) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000617 if (FLAG_enable_embedded_constant_pool) {
618 if (marker_reg.is_valid()) {
Ben Murdochda12d292016-06-02 14:46:10 +0100619 Pop(r0, fp, kConstantPoolRegister, marker_reg);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000620 } else {
Ben Murdochda12d292016-06-02 14:46:10 +0100621 Pop(r0, fp, kConstantPoolRegister);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000622 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400623 } else {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000624 if (marker_reg.is_valid()) {
Ben Murdochda12d292016-06-02 14:46:10 +0100625 Pop(r0, fp, marker_reg);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000626 } else {
Ben Murdochda12d292016-06-02 14:46:10 +0100627 Pop(r0, fp);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000628 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400629 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400630 mtlr(r0);
631}
632
Ben Murdochda12d292016-06-02 14:46:10 +0100633void MacroAssembler::PushStandardFrame(Register function_reg) {
634 int fp_delta = 0;
635 mflr(r0);
636 if (FLAG_enable_embedded_constant_pool) {
637 if (function_reg.is_valid()) {
638 Push(r0, fp, kConstantPoolRegister, cp, function_reg);
639 fp_delta = 3;
640 } else {
641 Push(r0, fp, kConstantPoolRegister, cp);
642 fp_delta = 2;
643 }
644 } else {
645 if (function_reg.is_valid()) {
646 Push(r0, fp, cp, function_reg);
647 fp_delta = 2;
648 } else {
649 Push(r0, fp, cp);
650 fp_delta = 1;
651 }
652 }
653 addi(fp, sp, Operand(fp_delta * kPointerSize));
654}
655
Ben Murdoch097c5b22016-05-18 11:27:45 +0100656void MacroAssembler::RestoreFrameStateForTailCall() {
657 if (FLAG_enable_embedded_constant_pool) {
658 LoadP(kConstantPoolRegister,
659 MemOperand(fp, StandardFrameConstants::kConstantPoolOffset));
660 set_constant_pool_available(false);
661 }
662 LoadP(r0, MemOperand(fp, StandardFrameConstants::kCallerPCOffset));
663 LoadP(fp, MemOperand(fp, StandardFrameConstants::kCallerFPOffset));
664 mtlr(r0);
665}
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400666
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000667const RegList MacroAssembler::kSafepointSavedRegisters = Register::kAllocatable;
668const int MacroAssembler::kNumSafepointSavedRegisters =
669 Register::kNumAllocatable;
670
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400671// Push and pop all registers that can hold pointers.
672void MacroAssembler::PushSafepointRegisters() {
673 // Safepoints expect a block of kNumSafepointRegisters values on the
674 // stack, so adjust the stack for unsaved registers.
675 const int num_unsaved = kNumSafepointRegisters - kNumSafepointSavedRegisters;
676 DCHECK(num_unsaved >= 0);
677 if (num_unsaved > 0) {
678 subi(sp, sp, Operand(num_unsaved * kPointerSize));
679 }
680 MultiPush(kSafepointSavedRegisters);
681}
682
683
684void MacroAssembler::PopSafepointRegisters() {
685 const int num_unsaved = kNumSafepointRegisters - kNumSafepointSavedRegisters;
686 MultiPop(kSafepointSavedRegisters);
687 if (num_unsaved > 0) {
688 addi(sp, sp, Operand(num_unsaved * kPointerSize));
689 }
690}
691
692
693void MacroAssembler::StoreToSafepointRegisterSlot(Register src, Register dst) {
694 StoreP(src, SafepointRegisterSlot(dst));
695}
696
697
698void MacroAssembler::LoadFromSafepointRegisterSlot(Register dst, Register src) {
699 LoadP(dst, SafepointRegisterSlot(src));
700}
701
702
703int MacroAssembler::SafepointRegisterStackIndex(int reg_code) {
704 // The registers are pushed starting with the highest encoding,
705 // which means that lowest encodings are closest to the stack pointer.
706 RegList regs = kSafepointSavedRegisters;
707 int index = 0;
708
709 DCHECK(reg_code >= 0 && reg_code < kNumRegisters);
710
711 for (int16_t i = 0; i < reg_code; i++) {
712 if ((regs & (1 << i)) != 0) {
713 index++;
714 }
715 }
716
717 return index;
718}
719
720
721MemOperand MacroAssembler::SafepointRegisterSlot(Register reg) {
722 return MemOperand(sp, SafepointRegisterStackIndex(reg.code()) * kPointerSize);
723}
724
725
726MemOperand MacroAssembler::SafepointRegistersAndDoublesSlot(Register reg) {
727 // General purpose registers are pushed last on the stack.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000728 const RegisterConfiguration* config =
729 RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT);
730 int doubles_size = config->num_allocatable_double_registers() * kDoubleSize;
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400731 int register_offset = SafepointRegisterStackIndex(reg.code()) * kPointerSize;
732 return MemOperand(sp, doubles_size + register_offset);
733}
734
735
736void MacroAssembler::CanonicalizeNaN(const DoubleRegister dst,
737 const DoubleRegister src) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000738 // Turn potential sNaN into qNaN.
739 fsub(dst, src, kDoubleRegZero);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400740}
741
Ben Murdoch097c5b22016-05-18 11:27:45 +0100742void MacroAssembler::ConvertIntToDouble(Register src, DoubleRegister dst) {
743 MovIntToDouble(dst, src, r0);
744 fcfid(dst, dst);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400745}
746
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400747void MacroAssembler::ConvertUnsignedIntToDouble(Register src,
Ben Murdoch097c5b22016-05-18 11:27:45 +0100748 DoubleRegister dst) {
749 MovUnsignedIntToDouble(dst, src, r0);
750 fcfid(dst, dst);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400751}
752
Ben Murdoch097c5b22016-05-18 11:27:45 +0100753void MacroAssembler::ConvertIntToFloat(Register src, DoubleRegister dst) {
754 MovIntToDouble(dst, src, r0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000755 fcfids(dst, dst);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400756}
757
Ben Murdoch097c5b22016-05-18 11:27:45 +0100758void MacroAssembler::ConvertUnsignedIntToFloat(Register src,
759 DoubleRegister dst) {
760 MovUnsignedIntToDouble(dst, src, r0);
761 fcfids(dst, dst);
762}
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400763
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000764#if V8_TARGET_ARCH_PPC64
765void MacroAssembler::ConvertInt64ToDouble(Register src,
766 DoubleRegister double_dst) {
767 MovInt64ToDouble(double_dst, src);
768 fcfid(double_dst, double_dst);
769}
770
771
772void MacroAssembler::ConvertUnsignedInt64ToFloat(Register src,
773 DoubleRegister double_dst) {
774 MovInt64ToDouble(double_dst, src);
775 fcfidus(double_dst, double_dst);
776}
777
778
779void MacroAssembler::ConvertUnsignedInt64ToDouble(Register src,
780 DoubleRegister double_dst) {
781 MovInt64ToDouble(double_dst, src);
782 fcfidu(double_dst, double_dst);
783}
784
785
786void MacroAssembler::ConvertInt64ToFloat(Register src,
787 DoubleRegister double_dst) {
788 MovInt64ToDouble(double_dst, src);
789 fcfids(double_dst, double_dst);
790}
791#endif
792
793
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400794void MacroAssembler::ConvertDoubleToInt64(const DoubleRegister double_input,
795#if !V8_TARGET_ARCH_PPC64
796 const Register dst_hi,
797#endif
798 const Register dst,
799 const DoubleRegister double_dst,
800 FPRoundingMode rounding_mode) {
801 if (rounding_mode == kRoundToZero) {
802 fctidz(double_dst, double_input);
803 } else {
804 SetRoundingMode(rounding_mode);
805 fctid(double_dst, double_input);
806 ResetRoundingMode();
807 }
808
809 MovDoubleToInt64(
810#if !V8_TARGET_ARCH_PPC64
811 dst_hi,
812#endif
813 dst, double_dst);
814}
815
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000816#if V8_TARGET_ARCH_PPC64
817void MacroAssembler::ConvertDoubleToUnsignedInt64(
818 const DoubleRegister double_input, const Register dst,
819 const DoubleRegister double_dst, FPRoundingMode rounding_mode) {
820 if (rounding_mode == kRoundToZero) {
821 fctiduz(double_dst, double_input);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400822 } else {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000823 SetRoundingMode(rounding_mode);
824 fctidu(double_dst, double_input);
825 ResetRoundingMode();
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400826 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000827
828 MovDoubleToInt64(dst, double_dst);
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400829}
830#endif
831
Ben Murdochda12d292016-06-02 14:46:10 +0100832#if !V8_TARGET_ARCH_PPC64
833void MacroAssembler::ShiftLeftPair(Register dst_low, Register dst_high,
834 Register src_low, Register src_high,
835 Register scratch, Register shift) {
836 DCHECK(!AreAliased(dst_low, src_high, shift));
837 DCHECK(!AreAliased(dst_high, src_low, shift));
838 Label less_than_32;
839 Label done;
840 cmpi(shift, Operand(32));
841 blt(&less_than_32);
842 // If shift >= 32
843 andi(scratch, shift, Operand(0x1f));
844 slw(dst_high, src_low, scratch);
845 li(dst_low, Operand::Zero());
846 b(&done);
847 bind(&less_than_32);
848 // If shift < 32
849 subfic(scratch, shift, Operand(32));
850 slw(dst_high, src_high, shift);
851 srw(scratch, src_low, scratch);
852 orx(dst_high, dst_high, scratch);
853 slw(dst_low, src_low, shift);
854 bind(&done);
855}
856
857void MacroAssembler::ShiftLeftPair(Register dst_low, Register dst_high,
858 Register src_low, Register src_high,
859 uint32_t shift) {
860 DCHECK(!AreAliased(dst_low, src_high));
861 DCHECK(!AreAliased(dst_high, src_low));
862 if (shift == 32) {
863 Move(dst_high, src_low);
864 li(dst_low, Operand::Zero());
865 } else if (shift > 32) {
866 shift &= 0x1f;
867 slwi(dst_high, src_low, Operand(shift));
868 li(dst_low, Operand::Zero());
869 } else if (shift == 0) {
870 Move(dst_low, src_low);
871 Move(dst_high, src_high);
872 } else {
873 slwi(dst_high, src_high, Operand(shift));
874 rlwimi(dst_high, src_low, shift, 32 - shift, 31);
875 slwi(dst_low, src_low, Operand(shift));
876 }
877}
878
879void MacroAssembler::ShiftRightPair(Register dst_low, Register dst_high,
880 Register src_low, Register src_high,
881 Register scratch, Register shift) {
882 DCHECK(!AreAliased(dst_low, src_high, shift));
883 DCHECK(!AreAliased(dst_high, src_low, shift));
884 Label less_than_32;
885 Label done;
886 cmpi(shift, Operand(32));
887 blt(&less_than_32);
888 // If shift >= 32
889 andi(scratch, shift, Operand(0x1f));
890 srw(dst_low, src_high, scratch);
891 li(dst_high, Operand::Zero());
892 b(&done);
893 bind(&less_than_32);
894 // If shift < 32
895 subfic(scratch, shift, Operand(32));
896 srw(dst_low, src_low, shift);
897 slw(scratch, src_high, scratch);
898 orx(dst_low, dst_low, scratch);
899 srw(dst_high, src_high, shift);
900 bind(&done);
901}
902
903void MacroAssembler::ShiftRightPair(Register dst_low, Register dst_high,
904 Register src_low, Register src_high,
905 uint32_t shift) {
906 DCHECK(!AreAliased(dst_low, src_high));
907 DCHECK(!AreAliased(dst_high, src_low));
908 if (shift == 32) {
909 Move(dst_low, src_high);
910 li(dst_high, Operand::Zero());
911 } else if (shift > 32) {
912 shift &= 0x1f;
913 srwi(dst_low, src_high, Operand(shift));
914 li(dst_high, Operand::Zero());
915 } else if (shift == 0) {
916 Move(dst_low, src_low);
917 Move(dst_high, src_high);
918 } else {
919 srwi(dst_low, src_low, Operand(shift));
920 rlwimi(dst_low, src_high, 32 - shift, 0, shift - 1);
921 srwi(dst_high, src_high, Operand(shift));
922 }
923}
924
925void MacroAssembler::ShiftRightAlgPair(Register dst_low, Register dst_high,
926 Register src_low, Register src_high,
927 Register scratch, Register shift) {
928 DCHECK(!AreAliased(dst_low, src_high, shift));
929 DCHECK(!AreAliased(dst_high, src_low, shift));
930 Label less_than_32;
931 Label done;
932 cmpi(shift, Operand(32));
933 blt(&less_than_32);
934 // If shift >= 32
935 andi(scratch, shift, Operand(0x1f));
936 sraw(dst_low, src_high, scratch);
937 srawi(dst_high, src_high, 31);
938 b(&done);
939 bind(&less_than_32);
940 // If shift < 32
941 subfic(scratch, shift, Operand(32));
942 srw(dst_low, src_low, shift);
943 slw(scratch, src_high, scratch);
944 orx(dst_low, dst_low, scratch);
945 sraw(dst_high, src_high, shift);
946 bind(&done);
947}
948
949void MacroAssembler::ShiftRightAlgPair(Register dst_low, Register dst_high,
950 Register src_low, Register src_high,
951 uint32_t shift) {
952 DCHECK(!AreAliased(dst_low, src_high));
953 DCHECK(!AreAliased(dst_high, src_low));
954 if (shift == 32) {
955 Move(dst_low, src_high);
956 srawi(dst_high, src_high, 31);
957 } else if (shift > 32) {
958 shift &= 0x1f;
959 srawi(dst_low, src_high, shift);
960 srawi(dst_high, src_high, 31);
961 } else if (shift == 0) {
962 Move(dst_low, src_low);
963 Move(dst_high, src_high);
964 } else {
965 srwi(dst_low, src_low, Operand(shift));
966 rlwimi(dst_low, src_high, 32 - shift, 0, shift - 1);
967 srawi(dst_high, src_high, shift);
968 }
969}
970#endif
Emily Bernierd0a1eb72015-03-24 16:35:39 -0400971
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000972void MacroAssembler::LoadConstantPoolPointerRegisterFromCodeTargetAddress(
973 Register code_target_address) {
974 lwz(kConstantPoolRegister,
975 MemOperand(code_target_address,
976 Code::kConstantPoolOffset - Code::kHeaderSize));
977 add(kConstantPoolRegister, kConstantPoolRegister, code_target_address);
978}
979
980
981void MacroAssembler::LoadConstantPoolPointerRegister(Register base,
982 int code_start_delta) {
983 add_label_offset(kConstantPoolRegister, base, ConstantPoolPosition(),
984 code_start_delta);
985}
986
987
988void MacroAssembler::LoadConstantPoolPointerRegister() {
989 mov_label_addr(kConstantPoolRegister, ConstantPoolPosition());
990}
991
Ben Murdochda12d292016-06-02 14:46:10 +0100992void MacroAssembler::StubPrologue(StackFrame::Type type, Register base,
993 int prologue_offset) {
994 {
995 ConstantPoolUnavailableScope constant_pool_unavailable(this);
996 LoadSmiLiteral(r11, Smi::FromInt(type));
997 PushCommonFrame(r11);
998 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +0000999 if (FLAG_enable_embedded_constant_pool) {
1000 if (!base.is(no_reg)) {
1001 // base contains prologue address
1002 LoadConstantPoolPointerRegister(base, -prologue_offset);
1003 } else {
1004 LoadConstantPoolPointerRegister();
1005 }
1006 set_constant_pool_available(true);
1007 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001008}
1009
1010
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001011void MacroAssembler::Prologue(bool code_pre_aging, Register base,
1012 int prologue_offset) {
1013 DCHECK(!base.is(no_reg));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001014 {
1015 PredictableCodeSizeScope predictible_code_size_scope(
1016 this, kNoCodeAgeSequenceLength);
1017 Assembler::BlockTrampolinePoolScope block_trampoline_pool(this);
1018 // The following instructions must remain together and unmodified
1019 // for code aging to work properly.
1020 if (code_pre_aging) {
1021 // Pre-age the code.
1022 // This matches the code found in PatchPlatformCodeAge()
1023 Code* stub = Code::GetPreAgedCodeAgeStub(isolate());
1024 intptr_t target = reinterpret_cast<intptr_t>(stub->instruction_start());
1025 // Don't use Call -- we need to preserve ip and lr
1026 nop(); // marker to detect sequence (see IsOld)
1027 mov(r3, Operand(target));
1028 Jump(r3);
1029 for (int i = 0; i < kCodeAgingSequenceNops; i++) {
1030 nop();
1031 }
1032 } else {
1033 // This matches the code found in GetNoCodeAgeSequence()
Ben Murdochda12d292016-06-02 14:46:10 +01001034 PushStandardFrame(r4);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001035 for (int i = 0; i < kNoCodeAgeSequenceNops; i++) {
1036 nop();
1037 }
1038 }
1039 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001040 if (FLAG_enable_embedded_constant_pool) {
1041 // base contains prologue address
1042 LoadConstantPoolPointerRegister(base, -prologue_offset);
1043 set_constant_pool_available(true);
1044 }
1045}
1046
1047
1048void MacroAssembler::EmitLoadTypeFeedbackVector(Register vector) {
1049 LoadP(vector, MemOperand(fp, JavaScriptFrameConstants::kFunctionOffset));
1050 LoadP(vector, FieldMemOperand(vector, JSFunction::kSharedFunctionInfoOffset));
1051 LoadP(vector,
1052 FieldMemOperand(vector, SharedFunctionInfo::kFeedbackVectorOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001053}
1054
1055
1056void MacroAssembler::EnterFrame(StackFrame::Type type,
1057 bool load_constant_pool_pointer_reg) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001058 if (FLAG_enable_embedded_constant_pool && load_constant_pool_pointer_reg) {
Ben Murdochda12d292016-06-02 14:46:10 +01001059 // Push type explicitly so we can leverage the constant pool.
1060 // This path cannot rely on ip containing code entry.
1061 PushCommonFrame();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001062 LoadConstantPoolPointerRegister();
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001063 LoadSmiLiteral(ip, Smi::FromInt(type));
1064 push(ip);
1065 } else {
1066 LoadSmiLiteral(ip, Smi::FromInt(type));
Ben Murdochda12d292016-06-02 14:46:10 +01001067 PushCommonFrame(ip);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001068 }
Ben Murdochda12d292016-06-02 14:46:10 +01001069 if (type == StackFrame::INTERNAL) {
1070 mov(r0, Operand(CodeObject()));
1071 push(r0);
1072 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001073}
1074
1075
1076int MacroAssembler::LeaveFrame(StackFrame::Type type, int stack_adjustment) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001077 ConstantPoolUnavailableScope constant_pool_unavailable(this);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001078 // r3: preserved
1079 // r4: preserved
1080 // r5: preserved
1081
1082 // Drop the execution stack down to the frame pointer and restore
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001083 // the caller's state.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001084 int frame_ends;
1085 LoadP(r0, MemOperand(fp, StandardFrameConstants::kCallerPCOffset));
1086 LoadP(ip, MemOperand(fp, StandardFrameConstants::kCallerFPOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001087 if (FLAG_enable_embedded_constant_pool) {
Ben Murdochda12d292016-06-02 14:46:10 +01001088 LoadP(kConstantPoolRegister,
1089 MemOperand(fp, StandardFrameConstants::kConstantPoolOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001090 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001091 mtlr(r0);
1092 frame_ends = pc_offset();
1093 Add(sp, fp, StandardFrameConstants::kCallerSPOffset + stack_adjustment, r0);
1094 mr(fp, ip);
1095 return frame_ends;
1096}
1097
1098
1099// ExitFrame layout (probably wrongish.. needs updating)
1100//
1101// SP -> previousSP
1102// LK reserved
1103// code
1104// sp_on_exit (for debug?)
1105// oldSP->prev SP
1106// LK
1107// <parameters on stack>
1108
1109// Prior to calling EnterExitFrame, we've got a bunch of parameters
1110// on the stack that we need to wrap a real frame around.. so first
1111// we reserve a slot for LK and push the previous SP which is captured
1112// in the fp register (r31)
1113// Then - we buy a new frame
1114
1115void MacroAssembler::EnterExitFrame(bool save_doubles, int stack_space) {
1116 // Set up the frame structure on the stack.
1117 DCHECK_EQ(2 * kPointerSize, ExitFrameConstants::kCallerSPDisplacement);
1118 DCHECK_EQ(1 * kPointerSize, ExitFrameConstants::kCallerPCOffset);
1119 DCHECK_EQ(0 * kPointerSize, ExitFrameConstants::kCallerFPOffset);
1120 DCHECK(stack_space > 0);
1121
1122 // This is an opportunity to build a frame to wrap
1123 // all of the pushes that have happened inside of V8
1124 // since we were called from C code
1125
Ben Murdochda12d292016-06-02 14:46:10 +01001126 LoadSmiLiteral(ip, Smi::FromInt(StackFrame::EXIT));
1127 PushCommonFrame(ip);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001128 // Reserve room for saved entry sp and code object.
Ben Murdochda12d292016-06-02 14:46:10 +01001129 subi(sp, fp, Operand(ExitFrameConstants::kFixedFrameSizeFromFp));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001130
1131 if (emit_debug_code()) {
1132 li(r8, Operand::Zero());
1133 StoreP(r8, MemOperand(fp, ExitFrameConstants::kSPOffset));
1134 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001135 if (FLAG_enable_embedded_constant_pool) {
1136 StoreP(kConstantPoolRegister,
1137 MemOperand(fp, ExitFrameConstants::kConstantPoolOffset));
1138 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001139 mov(r8, Operand(CodeObject()));
1140 StoreP(r8, MemOperand(fp, ExitFrameConstants::kCodeOffset));
1141
1142 // Save the frame pointer and the context in top.
1143 mov(r8, Operand(ExternalReference(Isolate::kCEntryFPAddress, isolate())));
1144 StoreP(fp, MemOperand(r8));
1145 mov(r8, Operand(ExternalReference(Isolate::kContextAddress, isolate())));
1146 StoreP(cp, MemOperand(r8));
1147
1148 // Optionally save all volatile double registers.
1149 if (save_doubles) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001150 MultiPushDoubles(kCallerSavedDoubles);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001151 // Note that d0 will be accessible at
1152 // fp - ExitFrameConstants::kFrameSize -
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001153 // kNumCallerSavedDoubles * kDoubleSize,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001154 // since the sp slot and code slot were pushed after the fp.
1155 }
1156
1157 addi(sp, sp, Operand(-stack_space * kPointerSize));
1158
1159 // Allocate and align the frame preparing for calling the runtime
1160 // function.
1161 const int frame_alignment = ActivationFrameAlignment();
1162 if (frame_alignment > kPointerSize) {
1163 DCHECK(base::bits::IsPowerOfTwo32(frame_alignment));
1164 ClearRightImm(sp, sp, Operand(WhichPowerOf2(frame_alignment)));
1165 }
1166 li(r0, Operand::Zero());
1167 StorePU(r0, MemOperand(sp, -kNumRequiredStackFrameSlots * kPointerSize));
1168
1169 // Set the exit frame sp value to point just before the return address
1170 // location.
1171 addi(r8, sp, Operand((kStackFrameExtraParamSlot + 1) * kPointerSize));
1172 StoreP(r8, MemOperand(fp, ExitFrameConstants::kSPOffset));
1173}
1174
1175
1176void MacroAssembler::InitializeNewString(Register string, Register length,
1177 Heap::RootListIndex map_index,
1178 Register scratch1, Register scratch2) {
1179 SmiTag(scratch1, length);
1180 LoadRoot(scratch2, map_index);
1181 StoreP(scratch1, FieldMemOperand(string, String::kLengthOffset), r0);
1182 li(scratch1, Operand(String::kEmptyHashField));
1183 StoreP(scratch2, FieldMemOperand(string, HeapObject::kMapOffset), r0);
1184 StoreP(scratch1, FieldMemOperand(string, String::kHashFieldSlot), r0);
1185}
1186
1187
1188int MacroAssembler::ActivationFrameAlignment() {
1189#if !defined(USE_SIMULATOR)
1190 // Running on the real platform. Use the alignment as mandated by the local
1191 // environment.
1192 // Note: This will break if we ever start generating snapshots on one PPC
1193 // platform for another PPC platform with a different alignment.
1194 return base::OS::ActivationFrameAlignment();
1195#else // Simulated
1196 // If we are using the simulator then we should always align to the expected
1197 // alignment. As the simulator is used to generate snapshots we do not know
1198 // if the target platform will need alignment, so this is controlled from a
1199 // flag.
1200 return FLAG_sim_stack_alignment;
1201#endif
1202}
1203
1204
1205void MacroAssembler::LeaveExitFrame(bool save_doubles, Register argument_count,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001206 bool restore_context,
1207 bool argument_count_is_length) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001208 ConstantPoolUnavailableScope constant_pool_unavailable(this);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001209 // Optionally restore all double registers.
1210 if (save_doubles) {
1211 // Calculate the stack location of the saved doubles and restore them.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001212 const int kNumRegs = kNumCallerSavedDoubles;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001213 const int offset =
Ben Murdochda12d292016-06-02 14:46:10 +01001214 (ExitFrameConstants::kFixedFrameSizeFromFp + kNumRegs * kDoubleSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001215 addi(r6, fp, Operand(-offset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001216 MultiPopDoubles(kCallerSavedDoubles, r6);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001217 }
1218
1219 // Clear top frame.
1220 li(r6, Operand::Zero());
1221 mov(ip, Operand(ExternalReference(Isolate::kCEntryFPAddress, isolate())));
1222 StoreP(r6, MemOperand(ip));
1223
1224 // Restore current context from top and clear it in debug mode.
1225 if (restore_context) {
1226 mov(ip, Operand(ExternalReference(Isolate::kContextAddress, isolate())));
1227 LoadP(cp, MemOperand(ip));
1228 }
1229#ifdef DEBUG
1230 mov(ip, Operand(ExternalReference(Isolate::kContextAddress, isolate())));
1231 StoreP(r6, MemOperand(ip));
1232#endif
1233
1234 // Tear down the exit frame, pop the arguments, and return.
1235 LeaveFrame(StackFrame::EXIT);
1236
1237 if (argument_count.is_valid()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001238 if (!argument_count_is_length) {
1239 ShiftLeftImm(argument_count, argument_count, Operand(kPointerSizeLog2));
1240 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001241 add(sp, sp, argument_count);
1242 }
1243}
1244
1245
1246void MacroAssembler::MovFromFloatResult(const DoubleRegister dst) {
1247 Move(dst, d1);
1248}
1249
1250
1251void MacroAssembler::MovFromFloatParameter(const DoubleRegister dst) {
1252 Move(dst, d1);
1253}
1254
Ben Murdochda12d292016-06-02 14:46:10 +01001255void MacroAssembler::PrepareForTailCall(const ParameterCount& callee_args_count,
1256 Register caller_args_count_reg,
1257 Register scratch0, Register scratch1) {
1258#if DEBUG
1259 if (callee_args_count.is_reg()) {
1260 DCHECK(!AreAliased(callee_args_count.reg(), caller_args_count_reg, scratch0,
1261 scratch1));
1262 } else {
1263 DCHECK(!AreAliased(caller_args_count_reg, scratch0, scratch1));
1264 }
1265#endif
1266
1267 // Calculate the end of destination area where we will put the arguments
1268 // after we drop current frame. We add kPointerSize to count the receiver
1269 // argument which is not included into formal parameters count.
1270 Register dst_reg = scratch0;
1271 ShiftLeftImm(dst_reg, caller_args_count_reg, Operand(kPointerSizeLog2));
1272 add(dst_reg, fp, dst_reg);
1273 addi(dst_reg, dst_reg,
1274 Operand(StandardFrameConstants::kCallerSPOffset + kPointerSize));
1275
1276 Register src_reg = caller_args_count_reg;
1277 // Calculate the end of source area. +kPointerSize is for the receiver.
1278 if (callee_args_count.is_reg()) {
1279 ShiftLeftImm(src_reg, callee_args_count.reg(), Operand(kPointerSizeLog2));
1280 add(src_reg, sp, src_reg);
1281 addi(src_reg, src_reg, Operand(kPointerSize));
1282 } else {
1283 Add(src_reg, sp, (callee_args_count.immediate() + 1) * kPointerSize, r0);
1284 }
1285
1286 if (FLAG_debug_code) {
1287 cmpl(src_reg, dst_reg);
1288 Check(lt, kStackAccessBelowStackPointer);
1289 }
1290
1291 // Restore caller's frame pointer and return address now as they will be
1292 // overwritten by the copying loop.
1293 RestoreFrameStateForTailCall();
1294
1295 // Now copy callee arguments to the caller frame going backwards to avoid
1296 // callee arguments corruption (source and destination areas could overlap).
1297
1298 // Both src_reg and dst_reg are pointing to the word after the one to copy,
1299 // so they must be pre-decremented in the loop.
1300 Register tmp_reg = scratch1;
1301 Label loop;
1302 if (callee_args_count.is_reg()) {
1303 addi(tmp_reg, callee_args_count.reg(), Operand(1)); // +1 for receiver
1304 } else {
1305 mov(tmp_reg, Operand(callee_args_count.immediate() + 1));
1306 }
1307 mtctr(tmp_reg);
1308 bind(&loop);
1309 LoadPU(tmp_reg, MemOperand(src_reg, -kPointerSize));
1310 StorePU(tmp_reg, MemOperand(dst_reg, -kPointerSize));
1311 bdnz(&loop);
1312
1313 // Leave current frame.
1314 mr(sp, dst_reg);
1315}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001316
1317void MacroAssembler::InvokePrologue(const ParameterCount& expected,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001318 const ParameterCount& actual, Label* done,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001319 bool* definitely_mismatches,
1320 InvokeFlag flag,
1321 const CallWrapper& call_wrapper) {
1322 bool definitely_matches = false;
1323 *definitely_mismatches = false;
1324 Label regular_invoke;
1325
1326 // Check whether the expected and actual arguments count match. If not,
1327 // setup registers according to contract with ArgumentsAdaptorTrampoline:
1328 // r3: actual arguments count
1329 // r4: function (passed through to callee)
1330 // r5: expected arguments count
1331
1332 // The code below is made a lot easier because the calling code already sets
1333 // up actual and expected registers according to the contract if values are
1334 // passed in registers.
1335
1336 // ARM has some sanity checks as per below, considering add them for PPC
1337 // DCHECK(actual.is_immediate() || actual.reg().is(r3));
1338 // DCHECK(expected.is_immediate() || expected.reg().is(r5));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001339
1340 if (expected.is_immediate()) {
1341 DCHECK(actual.is_immediate());
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001342 mov(r3, Operand(actual.immediate()));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001343 if (expected.immediate() == actual.immediate()) {
1344 definitely_matches = true;
1345 } else {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001346 const int sentinel = SharedFunctionInfo::kDontAdaptArgumentsSentinel;
1347 if (expected.immediate() == sentinel) {
1348 // Don't worry about adapting arguments for builtins that
1349 // don't want that done. Skip adaption code by making it look
1350 // like we have a match between expected and actual number of
1351 // arguments.
1352 definitely_matches = true;
1353 } else {
1354 *definitely_mismatches = true;
1355 mov(r5, Operand(expected.immediate()));
1356 }
1357 }
1358 } else {
1359 if (actual.is_immediate()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001360 mov(r3, Operand(actual.immediate()));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001361 cmpi(expected.reg(), Operand(actual.immediate()));
1362 beq(&regular_invoke);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001363 } else {
1364 cmp(expected.reg(), actual.reg());
1365 beq(&regular_invoke);
1366 }
1367 }
1368
1369 if (!definitely_matches) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001370 Handle<Code> adaptor = isolate()->builtins()->ArgumentsAdaptorTrampoline();
1371 if (flag == CALL_FUNCTION) {
1372 call_wrapper.BeforeCall(CallSize(adaptor));
1373 Call(adaptor);
1374 call_wrapper.AfterCall();
1375 if (!*definitely_mismatches) {
1376 b(done);
1377 }
1378 } else {
1379 Jump(adaptor, RelocInfo::CODE_TARGET);
1380 }
1381 bind(&regular_invoke);
1382 }
1383}
1384
1385
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001386void MacroAssembler::FloodFunctionIfStepping(Register fun, Register new_target,
1387 const ParameterCount& expected,
1388 const ParameterCount& actual) {
1389 Label skip_flooding;
1390 ExternalReference step_in_enabled =
1391 ExternalReference::debug_step_in_enabled_address(isolate());
1392 mov(r7, Operand(step_in_enabled));
1393 lbz(r7, MemOperand(r7));
1394 cmpi(r7, Operand::Zero());
1395 beq(&skip_flooding);
1396 {
1397 FrameScope frame(this,
1398 has_frame() ? StackFrame::NONE : StackFrame::INTERNAL);
1399 if (expected.is_reg()) {
1400 SmiTag(expected.reg());
1401 Push(expected.reg());
1402 }
1403 if (actual.is_reg()) {
1404 SmiTag(actual.reg());
1405 Push(actual.reg());
1406 }
1407 if (new_target.is_valid()) {
1408 Push(new_target);
1409 }
1410 Push(fun, fun);
Ben Murdoch097c5b22016-05-18 11:27:45 +01001411 CallRuntime(Runtime::kDebugPrepareStepInIfStepping);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001412 Pop(fun);
1413 if (new_target.is_valid()) {
1414 Pop(new_target);
1415 }
1416 if (actual.is_reg()) {
1417 Pop(actual.reg());
1418 SmiUntag(actual.reg());
1419 }
1420 if (expected.is_reg()) {
1421 Pop(expected.reg());
1422 SmiUntag(expected.reg());
1423 }
1424 }
1425 bind(&skip_flooding);
1426}
1427
1428
1429void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
1430 const ParameterCount& expected,
1431 const ParameterCount& actual,
1432 InvokeFlag flag,
1433 const CallWrapper& call_wrapper) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001434 // You can't call a function without a valid frame.
1435 DCHECK(flag == JUMP_FUNCTION || has_frame());
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001436 DCHECK(function.is(r4));
1437 DCHECK_IMPLIES(new_target.is_valid(), new_target.is(r6));
1438
1439 if (call_wrapper.NeedsDebugStepCheck()) {
1440 FloodFunctionIfStepping(function, new_target, expected, actual);
1441 }
1442
1443 // Clear the new.target register if not given.
1444 if (!new_target.is_valid()) {
1445 LoadRoot(r6, Heap::kUndefinedValueRootIndex);
1446 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001447
1448 Label done;
1449 bool definitely_mismatches = false;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001450 InvokePrologue(expected, actual, &done, &definitely_mismatches, flag,
1451 call_wrapper);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001452 if (!definitely_mismatches) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001453 // We call indirectly through the code field in the function to
1454 // allow recompilation to take effect without changing any of the
1455 // call sites.
1456 Register code = ip;
1457 LoadP(code, FieldMemOperand(function, JSFunction::kCodeEntryOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001458 if (flag == CALL_FUNCTION) {
1459 call_wrapper.BeforeCall(CallSize(code));
1460 CallJSEntry(code);
1461 call_wrapper.AfterCall();
1462 } else {
1463 DCHECK(flag == JUMP_FUNCTION);
1464 JumpToJSEntry(code);
1465 }
1466
1467 // Continue here if InvokePrologue does handle the invocation due to
1468 // mismatched parameter counts.
1469 bind(&done);
1470 }
1471}
1472
1473
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001474void MacroAssembler::InvokeFunction(Register fun, Register new_target,
1475 const ParameterCount& actual,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001476 InvokeFlag flag,
1477 const CallWrapper& call_wrapper) {
1478 // You can't call a function without a valid frame.
1479 DCHECK(flag == JUMP_FUNCTION || has_frame());
1480
1481 // Contract with called JS functions requires that function is passed in r4.
1482 DCHECK(fun.is(r4));
1483
1484 Register expected_reg = r5;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001485 Register temp_reg = r7;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001486
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001487 LoadP(temp_reg, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001488 LoadP(cp, FieldMemOperand(r4, JSFunction::kContextOffset));
1489 LoadWordArith(expected_reg,
1490 FieldMemOperand(
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001491 temp_reg, SharedFunctionInfo::kFormalParameterCountOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001492#if !defined(V8_TARGET_ARCH_PPC64)
1493 SmiUntag(expected_reg);
1494#endif
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001495
1496 ParameterCount expected(expected_reg);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001497 InvokeFunctionCode(fun, new_target, expected, actual, flag, call_wrapper);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001498}
1499
1500
1501void MacroAssembler::InvokeFunction(Register function,
1502 const ParameterCount& expected,
1503 const ParameterCount& actual,
1504 InvokeFlag flag,
1505 const CallWrapper& call_wrapper) {
1506 // You can't call a function without a valid frame.
1507 DCHECK(flag == JUMP_FUNCTION || has_frame());
1508
1509 // Contract with called JS functions requires that function is passed in r4.
1510 DCHECK(function.is(r4));
1511
1512 // Get the function and setup the context.
1513 LoadP(cp, FieldMemOperand(r4, JSFunction::kContextOffset));
1514
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001515 InvokeFunctionCode(r4, no_reg, expected, actual, flag, call_wrapper);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001516}
1517
1518
1519void MacroAssembler::InvokeFunction(Handle<JSFunction> function,
1520 const ParameterCount& expected,
1521 const ParameterCount& actual,
1522 InvokeFlag flag,
1523 const CallWrapper& call_wrapper) {
1524 Move(r4, function);
1525 InvokeFunction(r4, expected, actual, flag, call_wrapper);
1526}
1527
1528
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001529void MacroAssembler::IsObjectJSStringType(Register object, Register scratch,
1530 Label* fail) {
1531 DCHECK(kNotStringTag != 0);
1532
1533 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
1534 lbz(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset));
1535 andi(r0, scratch, Operand(kIsNotStringMask));
1536 bne(fail, cr0);
1537}
1538
1539
1540void MacroAssembler::IsObjectNameType(Register object, Register scratch,
1541 Label* fail) {
1542 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
1543 lbz(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset));
1544 cmpi(scratch, Operand(LAST_NAME_TYPE));
1545 bgt(fail);
1546}
1547
1548
1549void MacroAssembler::DebugBreak() {
1550 li(r3, Operand::Zero());
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001551 mov(r4,
1552 Operand(ExternalReference(Runtime::kHandleDebuggerStatement, isolate())));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001553 CEntryStub ces(isolate(), 1);
1554 DCHECK(AllowThisStubCall(&ces));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001555 Call(ces.GetCode(), RelocInfo::DEBUGGER_STATEMENT);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001556}
1557
1558
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001559void MacroAssembler::PushStackHandler() {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001560 // Adjust this code if not the case.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001561 STATIC_ASSERT(StackHandlerConstants::kSize == 1 * kPointerSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001562 STATIC_ASSERT(StackHandlerConstants::kNextOffset == 0 * kPointerSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001563
1564 // Link the current handler as the next handler.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001565 // Preserve r3-r7.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001566 mov(r8, Operand(ExternalReference(Isolate::kHandlerAddress, isolate())));
1567 LoadP(r0, MemOperand(r8));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001568 push(r0);
1569
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001570 // Set this new handler as the current one.
1571 StoreP(sp, MemOperand(r8));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001572}
1573
1574
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001575void MacroAssembler::PopStackHandler() {
1576 STATIC_ASSERT(StackHandlerConstants::kSize == 1 * kPointerSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001577 STATIC_ASSERT(StackHandlerConstants::kNextOffset == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001578
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001579 pop(r4);
1580 mov(ip, Operand(ExternalReference(Isolate::kHandlerAddress, isolate())));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001581 StoreP(r4, MemOperand(ip));
1582}
1583
1584
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001585void MacroAssembler::CheckAccessGlobalProxy(Register holder_reg,
1586 Register scratch, Label* miss) {
1587 Label same_contexts;
1588
1589 DCHECK(!holder_reg.is(scratch));
1590 DCHECK(!holder_reg.is(ip));
1591 DCHECK(!scratch.is(ip));
1592
Ben Murdochda12d292016-06-02 14:46:10 +01001593 // Load current lexical context from the active StandardFrame, which
1594 // may require crawling past STUB frames.
1595 Label load_context;
1596 Label has_context;
1597 DCHECK(!ip.is(scratch));
1598 mr(ip, fp);
1599 bind(&load_context);
1600 LoadP(scratch,
1601 MemOperand(ip, CommonFrameConstants::kContextOrFrameTypeOffset));
1602 JumpIfNotSmi(scratch, &has_context);
1603 LoadP(ip, MemOperand(ip, CommonFrameConstants::kCallerFPOffset));
1604 b(&load_context);
1605 bind(&has_context);
1606
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001607// In debug mode, make sure the lexical context is set.
1608#ifdef DEBUG
1609 cmpi(scratch, Operand::Zero());
1610 Check(ne, kWeShouldNotHaveAnEmptyLexicalContext);
1611#endif
1612
1613 // Load the native context of the current context.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001614 LoadP(scratch, ContextMemOperand(scratch, Context::NATIVE_CONTEXT_INDEX));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001615
1616 // Check the context is a native context.
1617 if (emit_debug_code()) {
1618 // Cannot use ip as a temporary in this verification code. Due to the fact
1619 // that ip is clobbered as part of cmp with an object Operand.
1620 push(holder_reg); // Temporarily save holder on the stack.
1621 // Read the first word and compare to the native_context_map.
1622 LoadP(holder_reg, FieldMemOperand(scratch, HeapObject::kMapOffset));
1623 LoadRoot(ip, Heap::kNativeContextMapRootIndex);
1624 cmp(holder_reg, ip);
1625 Check(eq, kJSGlobalObjectNativeContextShouldBeANativeContext);
1626 pop(holder_reg); // Restore holder.
1627 }
1628
1629 // Check if both contexts are the same.
1630 LoadP(ip, FieldMemOperand(holder_reg, JSGlobalProxy::kNativeContextOffset));
1631 cmp(scratch, ip);
1632 beq(&same_contexts);
1633
1634 // Check the context is a native context.
1635 if (emit_debug_code()) {
1636 // Cannot use ip as a temporary in this verification code. Due to the fact
1637 // that ip is clobbered as part of cmp with an object Operand.
1638 push(holder_reg); // Temporarily save holder on the stack.
1639 mr(holder_reg, ip); // Move ip to its holding place.
1640 LoadRoot(ip, Heap::kNullValueRootIndex);
1641 cmp(holder_reg, ip);
1642 Check(ne, kJSGlobalProxyContextShouldNotBeNull);
1643
1644 LoadP(holder_reg, FieldMemOperand(holder_reg, HeapObject::kMapOffset));
1645 LoadRoot(ip, Heap::kNativeContextMapRootIndex);
1646 cmp(holder_reg, ip);
1647 Check(eq, kJSGlobalObjectNativeContextShouldBeANativeContext);
1648 // Restore ip is not needed. ip is reloaded below.
1649 pop(holder_reg); // Restore holder.
1650 // Restore ip to holder's context.
1651 LoadP(ip, FieldMemOperand(holder_reg, JSGlobalProxy::kNativeContextOffset));
1652 }
1653
1654 // Check that the security token in the calling global object is
1655 // compatible with the security token in the receiving global
1656 // object.
1657 int token_offset =
1658 Context::kHeaderSize + Context::SECURITY_TOKEN_INDEX * kPointerSize;
1659
1660 LoadP(scratch, FieldMemOperand(scratch, token_offset));
1661 LoadP(ip, FieldMemOperand(ip, token_offset));
1662 cmp(scratch, ip);
1663 bne(miss);
1664
1665 bind(&same_contexts);
1666}
1667
1668
1669// Compute the hash code from the untagged key. This must be kept in sync with
1670// ComputeIntegerHash in utils.h and KeyedLoadGenericStub in
1671// code-stub-hydrogen.cc
1672void MacroAssembler::GetNumberHash(Register t0, Register scratch) {
1673 // First of all we assign the hash seed to scratch.
1674 LoadRoot(scratch, Heap::kHashSeedRootIndex);
1675 SmiUntag(scratch);
1676
1677 // Xor original key with a seed.
1678 xor_(t0, t0, scratch);
1679
1680 // Compute the hash code from the untagged key. This must be kept in sync
1681 // with ComputeIntegerHash in utils.h.
1682 //
1683 // hash = ~hash + (hash << 15);
1684 notx(scratch, t0);
1685 slwi(t0, t0, Operand(15));
1686 add(t0, scratch, t0);
1687 // hash = hash ^ (hash >> 12);
1688 srwi(scratch, t0, Operand(12));
1689 xor_(t0, t0, scratch);
1690 // hash = hash + (hash << 2);
1691 slwi(scratch, t0, Operand(2));
1692 add(t0, t0, scratch);
1693 // hash = hash ^ (hash >> 4);
1694 srwi(scratch, t0, Operand(4));
1695 xor_(t0, t0, scratch);
1696 // hash = hash * 2057;
1697 mr(r0, t0);
1698 slwi(scratch, t0, Operand(3));
1699 add(t0, t0, scratch);
1700 slwi(scratch, r0, Operand(11));
1701 add(t0, t0, scratch);
1702 // hash = hash ^ (hash >> 16);
1703 srwi(scratch, t0, Operand(16));
1704 xor_(t0, t0, scratch);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001705 // hash & 0x3fffffff
1706 ExtractBitRange(t0, t0, 29, 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001707}
1708
1709
1710void MacroAssembler::LoadFromNumberDictionary(Label* miss, Register elements,
1711 Register key, Register result,
1712 Register t0, Register t1,
1713 Register t2) {
1714 // Register use:
1715 //
1716 // elements - holds the slow-case elements of the receiver on entry.
1717 // Unchanged unless 'result' is the same register.
1718 //
1719 // key - holds the smi key on entry.
1720 // Unchanged unless 'result' is the same register.
1721 //
1722 // result - holds the result on exit if the load succeeded.
1723 // Allowed to be the same as 'key' or 'result'.
1724 // Unchanged on bailout so 'key' or 'result' can be used
1725 // in further computation.
1726 //
1727 // Scratch registers:
1728 //
1729 // t0 - holds the untagged key on entry and holds the hash once computed.
1730 //
1731 // t1 - used to hold the capacity mask of the dictionary
1732 //
1733 // t2 - used for the index into the dictionary.
1734 Label done;
1735
1736 GetNumberHash(t0, t1);
1737
1738 // Compute the capacity mask.
1739 LoadP(t1, FieldMemOperand(elements, SeededNumberDictionary::kCapacityOffset));
1740 SmiUntag(t1);
1741 subi(t1, t1, Operand(1));
1742
1743 // Generate an unrolled loop that performs a few probes before giving up.
1744 for (int i = 0; i < kNumberDictionaryProbes; i++) {
1745 // Use t2 for index calculations and keep the hash intact in t0.
1746 mr(t2, t0);
1747 // Compute the masked index: (hash + i + i * i) & mask.
1748 if (i > 0) {
1749 addi(t2, t2, Operand(SeededNumberDictionary::GetProbeOffset(i)));
1750 }
1751 and_(t2, t2, t1);
1752
1753 // Scale the index by multiplying by the element size.
1754 DCHECK(SeededNumberDictionary::kEntrySize == 3);
1755 slwi(ip, t2, Operand(1));
1756 add(t2, t2, ip); // t2 = t2 * 3
1757
1758 // Check if the key is identical to the name.
1759 slwi(t2, t2, Operand(kPointerSizeLog2));
1760 add(t2, elements, t2);
1761 LoadP(ip,
1762 FieldMemOperand(t2, SeededNumberDictionary::kElementsStartOffset));
1763 cmp(key, ip);
1764 if (i != kNumberDictionaryProbes - 1) {
1765 beq(&done);
1766 } else {
1767 bne(miss);
1768 }
1769 }
1770
1771 bind(&done);
1772 // Check that the value is a field property.
1773 // t2: elements + (index * kPointerSize)
1774 const int kDetailsOffset =
1775 SeededNumberDictionary::kElementsStartOffset + 2 * kPointerSize;
1776 LoadP(t1, FieldMemOperand(t2, kDetailsOffset));
1777 LoadSmiLiteral(ip, Smi::FromInt(PropertyDetails::TypeField::kMask));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001778 DCHECK_EQ(DATA, 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001779 and_(r0, t1, ip, SetRC);
1780 bne(miss, cr0);
1781
1782 // Get the value at the masked, scaled index and return.
1783 const int kValueOffset =
1784 SeededNumberDictionary::kElementsStartOffset + kPointerSize;
1785 LoadP(result, FieldMemOperand(t2, kValueOffset));
1786}
1787
1788
1789void MacroAssembler::Allocate(int object_size, Register result,
1790 Register scratch1, Register scratch2,
1791 Label* gc_required, AllocationFlags flags) {
1792 DCHECK(object_size <= Page::kMaxRegularHeapObjectSize);
1793 if (!FLAG_inline_new) {
1794 if (emit_debug_code()) {
1795 // Trash the registers to simulate an allocation failure.
1796 li(result, Operand(0x7091));
1797 li(scratch1, Operand(0x7191));
1798 li(scratch2, Operand(0x7291));
1799 }
1800 b(gc_required);
1801 return;
1802 }
1803
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001804 DCHECK(!AreAliased(result, scratch1, scratch2, ip));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001805
1806 // Make object size into bytes.
1807 if ((flags & SIZE_IN_WORDS) != 0) {
1808 object_size *= kPointerSize;
1809 }
1810 DCHECK_EQ(0, static_cast<int>(object_size & kObjectAlignmentMask));
1811
1812 // Check relative positions of allocation top and limit addresses.
1813 ExternalReference allocation_top =
1814 AllocationUtils::GetAllocationTopReference(isolate(), flags);
1815 ExternalReference allocation_limit =
1816 AllocationUtils::GetAllocationLimitReference(isolate(), flags);
1817
1818 intptr_t top = reinterpret_cast<intptr_t>(allocation_top.address());
1819 intptr_t limit = reinterpret_cast<intptr_t>(allocation_limit.address());
1820 DCHECK((limit - top) == kPointerSize);
1821
1822 // Set up allocation top address register.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001823 Register top_address = scratch1;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001824 // This code stores a temporary value in ip. This is OK, as the code below
1825 // does not need ip for implicit literal generation.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001826 Register alloc_limit = ip;
1827 Register result_end = scratch2;
1828 mov(top_address, Operand(allocation_top));
1829
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001830 if ((flags & RESULT_CONTAINS_TOP) == 0) {
1831 // Load allocation top into result and allocation limit into ip.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001832 LoadP(result, MemOperand(top_address));
1833 LoadP(alloc_limit, MemOperand(top_address, kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001834 } else {
1835 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001836 // Assert that result actually contains top on entry.
1837 LoadP(alloc_limit, MemOperand(top_address));
1838 cmp(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001839 Check(eq, kUnexpectedAllocationTop);
1840 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001841 // Load allocation limit. Result already contains allocation top.
1842 LoadP(alloc_limit, MemOperand(top_address, limit - top));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001843 }
1844
1845 if ((flags & DOUBLE_ALIGNMENT) != 0) {
1846 // Align the next allocation. Storing the filler map without checking top is
1847 // safe in new-space because the limit of the heap is aligned there.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001848#if V8_TARGET_ARCH_PPC64
1849 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
1850#else
1851 STATIC_ASSERT(kPointerAlignment * 2 == kDoubleAlignment);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001852 andi(result_end, result, Operand(kDoubleAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001853 Label aligned;
1854 beq(&aligned, cr0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001855 if ((flags & PRETENURE) != 0) {
1856 cmpl(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001857 bge(gc_required);
1858 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001859 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
1860 stw(result_end, MemOperand(result));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001861 addi(result, result, Operand(kDoubleSize / 2));
1862 bind(&aligned);
1863#endif
1864 }
1865
1866 // Calculate new top and bail out if new space is exhausted. Use result
1867 // to calculate the new top.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001868 sub(r0, alloc_limit, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001869 if (is_int16(object_size)) {
1870 cmpi(r0, Operand(object_size));
1871 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001872 addi(result_end, result, Operand(object_size));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001873 } else {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001874 Cmpi(r0, Operand(object_size), result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001875 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001876 add(result_end, result, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001877 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001878 StoreP(result_end, MemOperand(top_address));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001879
1880 // Tag object if requested.
1881 if ((flags & TAG_OBJECT) != 0) {
1882 addi(result, result, Operand(kHeapObjectTag));
1883 }
1884}
1885
1886
1887void MacroAssembler::Allocate(Register object_size, Register result,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001888 Register result_end, Register scratch,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001889 Label* gc_required, AllocationFlags flags) {
1890 if (!FLAG_inline_new) {
1891 if (emit_debug_code()) {
1892 // Trash the registers to simulate an allocation failure.
1893 li(result, Operand(0x7091));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001894 li(scratch, Operand(0x7191));
1895 li(result_end, Operand(0x7291));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001896 }
1897 b(gc_required);
1898 return;
1899 }
1900
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001901 // |object_size| and |result_end| may overlap if the DOUBLE_ALIGNMENT flag
1902 // is not specified. Other registers must not overlap.
1903 DCHECK(!AreAliased(object_size, result, scratch, ip));
1904 DCHECK(!AreAliased(result_end, result, scratch, ip));
1905 DCHECK((flags & DOUBLE_ALIGNMENT) == 0 || !object_size.is(result_end));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001906
1907 // Check relative positions of allocation top and limit addresses.
1908 ExternalReference allocation_top =
1909 AllocationUtils::GetAllocationTopReference(isolate(), flags);
1910 ExternalReference allocation_limit =
1911 AllocationUtils::GetAllocationLimitReference(isolate(), flags);
1912 intptr_t top = reinterpret_cast<intptr_t>(allocation_top.address());
1913 intptr_t limit = reinterpret_cast<intptr_t>(allocation_limit.address());
1914 DCHECK((limit - top) == kPointerSize);
1915
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001916 // Set up allocation top address and allocation limit registers.
1917 Register top_address = scratch;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001918 // This code stores a temporary value in ip. This is OK, as the code below
1919 // does not need ip for implicit literal generation.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001920 Register alloc_limit = ip;
1921 mov(top_address, Operand(allocation_top));
1922
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001923 if ((flags & RESULT_CONTAINS_TOP) == 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001924 // Load allocation top into result and allocation limit into alloc_limit..
1925 LoadP(result, MemOperand(top_address));
1926 LoadP(alloc_limit, MemOperand(top_address, kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001927 } else {
1928 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001929 // Assert that result actually contains top on entry.
1930 LoadP(alloc_limit, MemOperand(top_address));
1931 cmp(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001932 Check(eq, kUnexpectedAllocationTop);
1933 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001934 // Load allocation limit. Result already contains allocation top.
1935 LoadP(alloc_limit, MemOperand(top_address, limit - top));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001936 }
1937
1938 if ((flags & DOUBLE_ALIGNMENT) != 0) {
1939 // Align the next allocation. Storing the filler map without checking top is
1940 // safe in new-space because the limit of the heap is aligned there.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001941#if V8_TARGET_ARCH_PPC64
1942 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
1943#else
1944 STATIC_ASSERT(kPointerAlignment * 2 == kDoubleAlignment);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001945 andi(result_end, result, Operand(kDoubleAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001946 Label aligned;
1947 beq(&aligned, cr0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001948 if ((flags & PRETENURE) != 0) {
1949 cmpl(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001950 bge(gc_required);
1951 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001952 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
1953 stw(result_end, MemOperand(result));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001954 addi(result, result, Operand(kDoubleSize / 2));
1955 bind(&aligned);
1956#endif
1957 }
1958
1959 // Calculate new top and bail out if new space is exhausted. Use result
1960 // to calculate the new top. Object size may be in words so a shift is
1961 // required to get the number of bytes.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001962 sub(r0, alloc_limit, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001963 if ((flags & SIZE_IN_WORDS) != 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001964 ShiftLeftImm(result_end, object_size, Operand(kPointerSizeLog2));
1965 cmp(r0, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001966 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001967 add(result_end, result, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001968 } else {
1969 cmp(r0, object_size);
1970 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001971 add(result_end, result, object_size);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001972 }
1973
1974 // Update allocation top. result temporarily holds the new top.
1975 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001976 andi(r0, result_end, Operand(kObjectAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001977 Check(eq, kUnalignedAllocationInNewSpace, cr0);
1978 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001979 StoreP(result_end, MemOperand(top_address));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001980
1981 // Tag object if requested.
1982 if ((flags & TAG_OBJECT) != 0) {
1983 addi(result, result, Operand(kHeapObjectTag));
1984 }
1985}
1986
1987
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001988void MacroAssembler::AllocateTwoByteString(Register result, Register length,
1989 Register scratch1, Register scratch2,
1990 Register scratch3,
1991 Label* gc_required) {
1992 // Calculate the number of bytes needed for the characters in the string while
1993 // observing object alignment.
1994 DCHECK((SeqTwoByteString::kHeaderSize & kObjectAlignmentMask) == 0);
1995 slwi(scratch1, length, Operand(1)); // Length in bytes, not chars.
1996 addi(scratch1, scratch1,
1997 Operand(kObjectAlignmentMask + SeqTwoByteString::kHeaderSize));
1998 mov(r0, Operand(~kObjectAlignmentMask));
1999 and_(scratch1, scratch1, r0);
2000
2001 // Allocate two-byte string in new space.
2002 Allocate(scratch1, result, scratch2, scratch3, gc_required, TAG_OBJECT);
2003
2004 // Set the map, length and hash field.
2005 InitializeNewString(result, length, Heap::kStringMapRootIndex, scratch1,
2006 scratch2);
2007}
2008
2009
2010void MacroAssembler::AllocateOneByteString(Register result, Register length,
2011 Register scratch1, Register scratch2,
2012 Register scratch3,
2013 Label* gc_required) {
2014 // Calculate the number of bytes needed for the characters in the string while
2015 // observing object alignment.
2016 DCHECK((SeqOneByteString::kHeaderSize & kObjectAlignmentMask) == 0);
2017 DCHECK(kCharSize == 1);
2018 addi(scratch1, length,
2019 Operand(kObjectAlignmentMask + SeqOneByteString::kHeaderSize));
2020 li(r0, Operand(~kObjectAlignmentMask));
2021 and_(scratch1, scratch1, r0);
2022
2023 // Allocate one-byte string in new space.
2024 Allocate(scratch1, result, scratch2, scratch3, gc_required, TAG_OBJECT);
2025
2026 // Set the map, length and hash field.
2027 InitializeNewString(result, length, Heap::kOneByteStringMapRootIndex,
2028 scratch1, scratch2);
2029}
2030
2031
2032void MacroAssembler::AllocateTwoByteConsString(Register result, Register length,
2033 Register scratch1,
2034 Register scratch2,
2035 Label* gc_required) {
2036 Allocate(ConsString::kSize, result, scratch1, scratch2, gc_required,
2037 TAG_OBJECT);
2038
2039 InitializeNewString(result, length, Heap::kConsStringMapRootIndex, scratch1,
2040 scratch2);
2041}
2042
2043
2044void MacroAssembler::AllocateOneByteConsString(Register result, Register length,
2045 Register scratch1,
2046 Register scratch2,
2047 Label* gc_required) {
2048 Allocate(ConsString::kSize, result, scratch1, scratch2, gc_required,
2049 TAG_OBJECT);
2050
2051 InitializeNewString(result, length, Heap::kConsOneByteStringMapRootIndex,
2052 scratch1, scratch2);
2053}
2054
2055
2056void MacroAssembler::AllocateTwoByteSlicedString(Register result,
2057 Register length,
2058 Register scratch1,
2059 Register scratch2,
2060 Label* gc_required) {
2061 Allocate(SlicedString::kSize, result, scratch1, scratch2, gc_required,
2062 TAG_OBJECT);
2063
2064 InitializeNewString(result, length, Heap::kSlicedStringMapRootIndex, scratch1,
2065 scratch2);
2066}
2067
2068
2069void MacroAssembler::AllocateOneByteSlicedString(Register result,
2070 Register length,
2071 Register scratch1,
2072 Register scratch2,
2073 Label* gc_required) {
2074 Allocate(SlicedString::kSize, result, scratch1, scratch2, gc_required,
2075 TAG_OBJECT);
2076
2077 InitializeNewString(result, length, Heap::kSlicedOneByteStringMapRootIndex,
2078 scratch1, scratch2);
2079}
2080
2081
2082void MacroAssembler::CompareObjectType(Register object, Register map,
2083 Register type_reg, InstanceType type) {
2084 const Register temp = type_reg.is(no_reg) ? r0 : type_reg;
2085
2086 LoadP(map, FieldMemOperand(object, HeapObject::kMapOffset));
2087 CompareInstanceType(map, temp, type);
2088}
2089
2090
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002091void MacroAssembler::CompareInstanceType(Register map, Register type_reg,
2092 InstanceType type) {
2093 STATIC_ASSERT(Map::kInstanceTypeOffset < 4096);
2094 STATIC_ASSERT(LAST_TYPE < 256);
2095 lbz(type_reg, FieldMemOperand(map, Map::kInstanceTypeOffset));
2096 cmpi(type_reg, Operand(type));
2097}
2098
2099
2100void MacroAssembler::CompareRoot(Register obj, Heap::RootListIndex index) {
2101 DCHECK(!obj.is(r0));
2102 LoadRoot(r0, index);
2103 cmp(obj, r0);
2104}
2105
2106
2107void MacroAssembler::CheckFastElements(Register map, Register scratch,
2108 Label* fail) {
2109 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2110 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2111 STATIC_ASSERT(FAST_ELEMENTS == 2);
2112 STATIC_ASSERT(FAST_HOLEY_ELEMENTS == 3);
2113 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2114 STATIC_ASSERT(Map::kMaximumBitField2FastHoleyElementValue < 0x8000);
2115 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleyElementValue));
2116 bgt(fail);
2117}
2118
2119
2120void MacroAssembler::CheckFastObjectElements(Register map, Register scratch,
2121 Label* fail) {
2122 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2123 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2124 STATIC_ASSERT(FAST_ELEMENTS == 2);
2125 STATIC_ASSERT(FAST_HOLEY_ELEMENTS == 3);
2126 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2127 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleySmiElementValue));
2128 ble(fail);
2129 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleyElementValue));
2130 bgt(fail);
2131}
2132
2133
2134void MacroAssembler::CheckFastSmiElements(Register map, Register scratch,
2135 Label* fail) {
2136 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2137 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2138 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2139 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleySmiElementValue));
2140 bgt(fail);
2141}
2142
2143
2144void MacroAssembler::StoreNumberToDoubleElements(
2145 Register value_reg, Register key_reg, Register elements_reg,
2146 Register scratch1, DoubleRegister double_scratch, Label* fail,
2147 int elements_offset) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002148 DCHECK(!AreAliased(value_reg, key_reg, elements_reg, scratch1));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002149 Label smi_value, store;
2150
2151 // Handle smi values specially.
2152 JumpIfSmi(value_reg, &smi_value);
2153
2154 // Ensure that the object is a heap number
2155 CheckMap(value_reg, scratch1, isolate()->factory()->heap_number_map(), fail,
2156 DONT_DO_SMI_CHECK);
2157
2158 lfd(double_scratch, FieldMemOperand(value_reg, HeapNumber::kValueOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002159 // Double value, turn potential sNaN into qNaN.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002160 CanonicalizeNaN(double_scratch);
2161 b(&store);
2162
2163 bind(&smi_value);
2164 SmiToDouble(double_scratch, value_reg);
2165
2166 bind(&store);
2167 SmiToDoubleArrayOffset(scratch1, key_reg);
2168 add(scratch1, elements_reg, scratch1);
2169 stfd(double_scratch, FieldMemOperand(scratch1, FixedDoubleArray::kHeaderSize -
2170 elements_offset));
2171}
2172
2173
2174void MacroAssembler::AddAndCheckForOverflow(Register dst, Register left,
2175 Register right,
2176 Register overflow_dst,
2177 Register scratch) {
2178 DCHECK(!dst.is(overflow_dst));
2179 DCHECK(!dst.is(scratch));
2180 DCHECK(!overflow_dst.is(scratch));
2181 DCHECK(!overflow_dst.is(left));
2182 DCHECK(!overflow_dst.is(right));
2183
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002184 bool left_is_right = left.is(right);
2185 RCBit xorRC = left_is_right ? SetRC : LeaveRC;
2186
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002187 // C = A+B; C overflows if A/B have same sign and C has diff sign than A
2188 if (dst.is(left)) {
2189 mr(scratch, left); // Preserve left.
2190 add(dst, left, right); // Left is overwritten.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002191 xor_(overflow_dst, dst, scratch, xorRC); // Original left.
2192 if (!left_is_right) xor_(scratch, dst, right);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002193 } else if (dst.is(right)) {
2194 mr(scratch, right); // Preserve right.
2195 add(dst, left, right); // Right is overwritten.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002196 xor_(overflow_dst, dst, left, xorRC);
2197 if (!left_is_right) xor_(scratch, dst, scratch); // Original right.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002198 } else {
2199 add(dst, left, right);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002200 xor_(overflow_dst, dst, left, xorRC);
2201 if (!left_is_right) xor_(scratch, dst, right);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002202 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002203 if (!left_is_right) and_(overflow_dst, scratch, overflow_dst, SetRC);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002204}
2205
2206
2207void MacroAssembler::AddAndCheckForOverflow(Register dst, Register left,
2208 intptr_t right,
2209 Register overflow_dst,
2210 Register scratch) {
2211 Register original_left = left;
2212 DCHECK(!dst.is(overflow_dst));
2213 DCHECK(!dst.is(scratch));
2214 DCHECK(!overflow_dst.is(scratch));
2215 DCHECK(!overflow_dst.is(left));
2216
2217 // C = A+B; C overflows if A/B have same sign and C has diff sign than A
2218 if (dst.is(left)) {
2219 // Preserve left.
2220 original_left = overflow_dst;
2221 mr(original_left, left);
2222 }
2223 Add(dst, left, right, scratch);
2224 xor_(overflow_dst, dst, original_left);
2225 if (right >= 0) {
2226 and_(overflow_dst, overflow_dst, dst, SetRC);
2227 } else {
2228 andc(overflow_dst, overflow_dst, dst, SetRC);
2229 }
2230}
2231
2232
2233void MacroAssembler::SubAndCheckForOverflow(Register dst, Register left,
2234 Register right,
2235 Register overflow_dst,
2236 Register scratch) {
2237 DCHECK(!dst.is(overflow_dst));
2238 DCHECK(!dst.is(scratch));
2239 DCHECK(!overflow_dst.is(scratch));
2240 DCHECK(!overflow_dst.is(left));
2241 DCHECK(!overflow_dst.is(right));
2242
2243 // C = A-B; C overflows if A/B have diff signs and C has diff sign than A
2244 if (dst.is(left)) {
2245 mr(scratch, left); // Preserve left.
2246 sub(dst, left, right); // Left is overwritten.
2247 xor_(overflow_dst, dst, scratch);
2248 xor_(scratch, scratch, right);
2249 and_(overflow_dst, overflow_dst, scratch, SetRC);
2250 } else if (dst.is(right)) {
2251 mr(scratch, right); // Preserve right.
2252 sub(dst, left, right); // Right is overwritten.
2253 xor_(overflow_dst, dst, left);
2254 xor_(scratch, left, scratch);
2255 and_(overflow_dst, overflow_dst, scratch, SetRC);
2256 } else {
2257 sub(dst, left, right);
2258 xor_(overflow_dst, dst, left);
2259 xor_(scratch, left, right);
2260 and_(overflow_dst, scratch, overflow_dst, SetRC);
2261 }
2262}
2263
2264
2265void MacroAssembler::CompareMap(Register obj, Register scratch, Handle<Map> map,
2266 Label* early_success) {
2267 LoadP(scratch, FieldMemOperand(obj, HeapObject::kMapOffset));
2268 CompareMap(scratch, map, early_success);
2269}
2270
2271
2272void MacroAssembler::CompareMap(Register obj_map, Handle<Map> map,
2273 Label* early_success) {
2274 mov(r0, Operand(map));
2275 cmp(obj_map, r0);
2276}
2277
2278
2279void MacroAssembler::CheckMap(Register obj, Register scratch, Handle<Map> map,
2280 Label* fail, SmiCheckType smi_check_type) {
2281 if (smi_check_type == DO_SMI_CHECK) {
2282 JumpIfSmi(obj, fail);
2283 }
2284
2285 Label success;
2286 CompareMap(obj, scratch, map, &success);
2287 bne(fail);
2288 bind(&success);
2289}
2290
2291
2292void MacroAssembler::CheckMap(Register obj, Register scratch,
2293 Heap::RootListIndex index, Label* fail,
2294 SmiCheckType smi_check_type) {
2295 if (smi_check_type == DO_SMI_CHECK) {
2296 JumpIfSmi(obj, fail);
2297 }
2298 LoadP(scratch, FieldMemOperand(obj, HeapObject::kMapOffset));
2299 LoadRoot(r0, index);
2300 cmp(scratch, r0);
2301 bne(fail);
2302}
2303
2304
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002305void MacroAssembler::DispatchWeakMap(Register obj, Register scratch1,
2306 Register scratch2, Handle<WeakCell> cell,
2307 Handle<Code> success,
2308 SmiCheckType smi_check_type) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002309 Label fail;
2310 if (smi_check_type == DO_SMI_CHECK) {
2311 JumpIfSmi(obj, &fail);
2312 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002313 LoadP(scratch1, FieldMemOperand(obj, HeapObject::kMapOffset));
2314 CmpWeakValue(scratch1, cell, scratch2);
2315 Jump(success, RelocInfo::CODE_TARGET, eq);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002316 bind(&fail);
2317}
2318
2319
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002320void MacroAssembler::CmpWeakValue(Register value, Handle<WeakCell> cell,
2321 Register scratch, CRegister cr) {
2322 mov(scratch, Operand(cell));
2323 LoadP(scratch, FieldMemOperand(scratch, WeakCell::kValueOffset));
2324 cmp(value, scratch, cr);
2325}
2326
2327
2328void MacroAssembler::GetWeakValue(Register value, Handle<WeakCell> cell) {
2329 mov(value, Operand(cell));
2330 LoadP(value, FieldMemOperand(value, WeakCell::kValueOffset));
2331}
2332
2333
2334void MacroAssembler::LoadWeakValue(Register value, Handle<WeakCell> cell,
2335 Label* miss) {
2336 GetWeakValue(value, cell);
2337 JumpIfSmi(value, miss);
2338}
2339
2340
2341void MacroAssembler::GetMapConstructor(Register result, Register map,
2342 Register temp, Register temp2) {
2343 Label done, loop;
2344 LoadP(result, FieldMemOperand(map, Map::kConstructorOrBackPointerOffset));
2345 bind(&loop);
2346 JumpIfSmi(result, &done);
2347 CompareObjectType(result, temp, temp2, MAP_TYPE);
2348 bne(&done);
2349 LoadP(result, FieldMemOperand(result, Map::kConstructorOrBackPointerOffset));
2350 b(&loop);
2351 bind(&done);
2352}
2353
2354
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002355void MacroAssembler::TryGetFunctionPrototype(Register function, Register result,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002356 Register scratch, Label* miss) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002357 // Get the prototype or initial map from the function.
2358 LoadP(result,
2359 FieldMemOperand(function, JSFunction::kPrototypeOrInitialMapOffset));
2360
2361 // If the prototype or initial map is the hole, don't return it and
2362 // simply miss the cache instead. This will allow us to allocate a
2363 // prototype object on-demand in the runtime system.
2364 LoadRoot(r0, Heap::kTheHoleValueRootIndex);
2365 cmp(result, r0);
2366 beq(miss);
2367
2368 // If the function does not have an initial map, we're done.
2369 Label done;
2370 CompareObjectType(result, scratch, scratch, MAP_TYPE);
2371 bne(&done);
2372
2373 // Get the prototype from the initial map.
2374 LoadP(result, FieldMemOperand(result, Map::kPrototypeOffset));
2375
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002376 // All done.
2377 bind(&done);
2378}
2379
2380
2381void MacroAssembler::CallStub(CodeStub* stub, TypeFeedbackId ast_id,
2382 Condition cond) {
2383 DCHECK(AllowThisStubCall(stub)); // Stub calls are not allowed in some stubs.
2384 Call(stub->GetCode(), RelocInfo::CODE_TARGET, ast_id, cond);
2385}
2386
2387
2388void MacroAssembler::TailCallStub(CodeStub* stub, Condition cond) {
2389 Jump(stub->GetCode(), RelocInfo::CODE_TARGET, cond);
2390}
2391
2392
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002393bool MacroAssembler::AllowThisStubCall(CodeStub* stub) {
2394 return has_frame_ || !stub->SometimesSetsUpAFrame();
2395}
2396
2397
2398void MacroAssembler::IndexFromHash(Register hash, Register index) {
2399 // If the hash field contains an array index pick it out. The assert checks
2400 // that the constants for the maximum number of digits for an array index
2401 // cached in the hash field and the number of bits reserved for it does not
2402 // conflict.
2403 DCHECK(TenToThe(String::kMaxCachedArrayIndexLength) <
2404 (1 << String::kArrayIndexValueBits));
2405 DecodeFieldToSmi<String::ArrayIndexValueBits>(index, hash);
2406}
2407
2408
2409void MacroAssembler::SmiToDouble(DoubleRegister value, Register smi) {
2410 SmiUntag(ip, smi);
2411 ConvertIntToDouble(ip, value);
2412}
2413
2414
2415void MacroAssembler::TestDoubleIsInt32(DoubleRegister double_input,
2416 Register scratch1, Register scratch2,
2417 DoubleRegister double_scratch) {
2418 TryDoubleToInt32Exact(scratch1, double_input, scratch2, double_scratch);
2419}
2420
Ben Murdoch097c5b22016-05-18 11:27:45 +01002421void MacroAssembler::TestDoubleIsMinusZero(DoubleRegister input,
2422 Register scratch1,
2423 Register scratch2) {
2424#if V8_TARGET_ARCH_PPC64
2425 MovDoubleToInt64(scratch1, input);
2426 rotldi(scratch1, scratch1, 1);
2427 cmpi(scratch1, Operand(1));
2428#else
2429 MovDoubleToInt64(scratch1, scratch2, input);
2430 Label done;
2431 cmpi(scratch2, Operand::Zero());
2432 bne(&done);
2433 lis(scratch2, Operand(SIGN_EXT_IMM16(0x8000)));
2434 cmp(scratch1, scratch2);
2435 bind(&done);
2436#endif
2437}
2438
2439void MacroAssembler::TestDoubleSign(DoubleRegister input, Register scratch) {
2440#if V8_TARGET_ARCH_PPC64
2441 MovDoubleToInt64(scratch, input);
2442#else
2443 MovDoubleHighToInt(scratch, input);
2444#endif
2445 cmpi(scratch, Operand::Zero());
2446}
2447
2448void MacroAssembler::TestHeapNumberSign(Register input, Register scratch) {
2449#if V8_TARGET_ARCH_PPC64
2450 LoadP(scratch, FieldMemOperand(input, HeapNumber::kValueOffset));
2451#else
2452 lwz(scratch, FieldMemOperand(input, HeapNumber::kExponentOffset));
2453#endif
2454 cmpi(scratch, Operand::Zero());
2455}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002456
2457void MacroAssembler::TryDoubleToInt32Exact(Register result,
2458 DoubleRegister double_input,
2459 Register scratch,
2460 DoubleRegister double_scratch) {
2461 Label done;
2462 DCHECK(!double_input.is(double_scratch));
2463
2464 ConvertDoubleToInt64(double_input,
2465#if !V8_TARGET_ARCH_PPC64
2466 scratch,
2467#endif
2468 result, double_scratch);
2469
2470#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002471 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002472#else
2473 TestIfInt32(scratch, result, r0);
2474#endif
2475 bne(&done);
2476
2477 // convert back and compare
2478 fcfid(double_scratch, double_scratch);
2479 fcmpu(double_scratch, double_input);
2480 bind(&done);
2481}
2482
2483
2484void MacroAssembler::TryInt32Floor(Register result, DoubleRegister double_input,
2485 Register input_high, Register scratch,
2486 DoubleRegister double_scratch, Label* done,
2487 Label* exact) {
2488 DCHECK(!result.is(input_high));
2489 DCHECK(!double_input.is(double_scratch));
2490 Label exception;
2491
2492 MovDoubleHighToInt(input_high, double_input);
2493
2494 // Test for NaN/Inf
2495 ExtractBitMask(result, input_high, HeapNumber::kExponentMask);
2496 cmpli(result, Operand(0x7ff));
2497 beq(&exception);
2498
2499 // Convert (rounding to -Inf)
2500 ConvertDoubleToInt64(double_input,
2501#if !V8_TARGET_ARCH_PPC64
2502 scratch,
2503#endif
2504 result, double_scratch, kRoundToMinusInf);
2505
2506// Test for overflow
2507#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002508 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002509#else
2510 TestIfInt32(scratch, result, r0);
2511#endif
2512 bne(&exception);
2513
2514 // Test for exactness
2515 fcfid(double_scratch, double_scratch);
2516 fcmpu(double_scratch, double_input);
2517 beq(exact);
2518 b(done);
2519
2520 bind(&exception);
2521}
2522
2523
2524void MacroAssembler::TryInlineTruncateDoubleToI(Register result,
2525 DoubleRegister double_input,
2526 Label* done) {
2527 DoubleRegister double_scratch = kScratchDoubleReg;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002528#if !V8_TARGET_ARCH_PPC64
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002529 Register scratch = ip;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002530#endif
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002531
2532 ConvertDoubleToInt64(double_input,
2533#if !V8_TARGET_ARCH_PPC64
2534 scratch,
2535#endif
2536 result, double_scratch);
2537
2538// Test for overflow
2539#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002540 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002541#else
2542 TestIfInt32(scratch, result, r0);
2543#endif
2544 beq(done);
2545}
2546
2547
2548void MacroAssembler::TruncateDoubleToI(Register result,
2549 DoubleRegister double_input) {
2550 Label done;
2551
2552 TryInlineTruncateDoubleToI(result, double_input, &done);
2553
2554 // If we fell through then inline version didn't succeed - call stub instead.
2555 mflr(r0);
2556 push(r0);
2557 // Put input on stack.
2558 stfdu(double_input, MemOperand(sp, -kDoubleSize));
2559
2560 DoubleToIStub stub(isolate(), sp, result, 0, true, true);
2561 CallStub(&stub);
2562
2563 addi(sp, sp, Operand(kDoubleSize));
2564 pop(r0);
2565 mtlr(r0);
2566
2567 bind(&done);
2568}
2569
2570
2571void MacroAssembler::TruncateHeapNumberToI(Register result, Register object) {
2572 Label done;
2573 DoubleRegister double_scratch = kScratchDoubleReg;
2574 DCHECK(!result.is(object));
2575
2576 lfd(double_scratch, FieldMemOperand(object, HeapNumber::kValueOffset));
2577 TryInlineTruncateDoubleToI(result, double_scratch, &done);
2578
2579 // If we fell through then inline version didn't succeed - call stub instead.
2580 mflr(r0);
2581 push(r0);
2582 DoubleToIStub stub(isolate(), object, result,
2583 HeapNumber::kValueOffset - kHeapObjectTag, true, true);
2584 CallStub(&stub);
2585 pop(r0);
2586 mtlr(r0);
2587
2588 bind(&done);
2589}
2590
2591
2592void MacroAssembler::TruncateNumberToI(Register object, Register result,
2593 Register heap_number_map,
2594 Register scratch1, Label* not_number) {
2595 Label done;
2596 DCHECK(!result.is(object));
2597
2598 UntagAndJumpIfSmi(result, object, &done);
2599 JumpIfNotHeapNumber(object, heap_number_map, scratch1, not_number);
2600 TruncateHeapNumberToI(result, object);
2601
2602 bind(&done);
2603}
2604
2605
2606void MacroAssembler::GetLeastBitsFromSmi(Register dst, Register src,
2607 int num_least_bits) {
2608#if V8_TARGET_ARCH_PPC64
2609 rldicl(dst, src, kBitsPerPointer - kSmiShift,
2610 kBitsPerPointer - num_least_bits);
2611#else
2612 rlwinm(dst, src, kBitsPerPointer - kSmiShift,
2613 kBitsPerPointer - num_least_bits, 31);
2614#endif
2615}
2616
2617
2618void MacroAssembler::GetLeastBitsFromInt32(Register dst, Register src,
2619 int num_least_bits) {
2620 rlwinm(dst, src, 0, 32 - num_least_bits, 31);
2621}
2622
2623
2624void MacroAssembler::CallRuntime(const Runtime::Function* f, int num_arguments,
2625 SaveFPRegsMode save_doubles) {
2626 // All parameters are on the stack. r3 has the return value after call.
2627
2628 // If the expected number of arguments of the runtime function is
2629 // constant, we check that the actual number of arguments match the
2630 // expectation.
2631 CHECK(f->nargs < 0 || f->nargs == num_arguments);
2632
2633 // TODO(1236192): Most runtime routines don't need the number of
2634 // arguments passed in because it is constant. At some point we
2635 // should remove this need and make the runtime routine entry code
2636 // smarter.
2637 mov(r3, Operand(num_arguments));
2638 mov(r4, Operand(ExternalReference(f, isolate())));
2639 CEntryStub stub(isolate(),
2640#if V8_TARGET_ARCH_PPC64
2641 f->result_size,
2642#else
2643 1,
2644#endif
2645 save_doubles);
2646 CallStub(&stub);
2647}
2648
2649
2650void MacroAssembler::CallExternalReference(const ExternalReference& ext,
2651 int num_arguments) {
2652 mov(r3, Operand(num_arguments));
2653 mov(r4, Operand(ext));
2654
2655 CEntryStub stub(isolate(), 1);
2656 CallStub(&stub);
2657}
2658
2659
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002660void MacroAssembler::TailCallRuntime(Runtime::FunctionId fid) {
2661 const Runtime::Function* function = Runtime::FunctionForId(fid);
2662 DCHECK_EQ(1, function->result_size);
2663 if (function->nargs >= 0) {
2664 mov(r3, Operand(function->nargs));
2665 }
2666 JumpToExternalReference(ExternalReference(fid, isolate()));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002667}
2668
2669
2670void MacroAssembler::JumpToExternalReference(const ExternalReference& builtin) {
2671 mov(r4, Operand(builtin));
2672 CEntryStub stub(isolate(), 1);
2673 Jump(stub.GetCode(), RelocInfo::CODE_TARGET);
2674}
2675
2676
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002677void MacroAssembler::SetCounter(StatsCounter* counter, int value,
2678 Register scratch1, Register scratch2) {
2679 if (FLAG_native_code_counters && counter->Enabled()) {
2680 mov(scratch1, Operand(value));
2681 mov(scratch2, Operand(ExternalReference(counter)));
2682 stw(scratch1, MemOperand(scratch2));
2683 }
2684}
2685
2686
2687void MacroAssembler::IncrementCounter(StatsCounter* counter, int value,
2688 Register scratch1, Register scratch2) {
2689 DCHECK(value > 0);
2690 if (FLAG_native_code_counters && counter->Enabled()) {
2691 mov(scratch2, Operand(ExternalReference(counter)));
2692 lwz(scratch1, MemOperand(scratch2));
2693 addi(scratch1, scratch1, Operand(value));
2694 stw(scratch1, MemOperand(scratch2));
2695 }
2696}
2697
2698
2699void MacroAssembler::DecrementCounter(StatsCounter* counter, int value,
2700 Register scratch1, Register scratch2) {
2701 DCHECK(value > 0);
2702 if (FLAG_native_code_counters && counter->Enabled()) {
2703 mov(scratch2, Operand(ExternalReference(counter)));
2704 lwz(scratch1, MemOperand(scratch2));
2705 subi(scratch1, scratch1, Operand(value));
2706 stw(scratch1, MemOperand(scratch2));
2707 }
2708}
2709
2710
2711void MacroAssembler::Assert(Condition cond, BailoutReason reason,
2712 CRegister cr) {
2713 if (emit_debug_code()) Check(cond, reason, cr);
2714}
2715
2716
2717void MacroAssembler::AssertFastElements(Register elements) {
2718 if (emit_debug_code()) {
2719 DCHECK(!elements.is(r0));
2720 Label ok;
2721 push(elements);
2722 LoadP(elements, FieldMemOperand(elements, HeapObject::kMapOffset));
2723 LoadRoot(r0, Heap::kFixedArrayMapRootIndex);
2724 cmp(elements, r0);
2725 beq(&ok);
2726 LoadRoot(r0, Heap::kFixedDoubleArrayMapRootIndex);
2727 cmp(elements, r0);
2728 beq(&ok);
2729 LoadRoot(r0, Heap::kFixedCOWArrayMapRootIndex);
2730 cmp(elements, r0);
2731 beq(&ok);
2732 Abort(kJSObjectWithFastElementsMapHasSlowElements);
2733 bind(&ok);
2734 pop(elements);
2735 }
2736}
2737
2738
2739void MacroAssembler::Check(Condition cond, BailoutReason reason, CRegister cr) {
2740 Label L;
2741 b(cond, &L, cr);
2742 Abort(reason);
2743 // will not return here
2744 bind(&L);
2745}
2746
2747
2748void MacroAssembler::Abort(BailoutReason reason) {
2749 Label abort_start;
2750 bind(&abort_start);
2751#ifdef DEBUG
2752 const char* msg = GetBailoutReason(reason);
2753 if (msg != NULL) {
2754 RecordComment("Abort message: ");
2755 RecordComment(msg);
2756 }
2757
2758 if (FLAG_trap_on_abort) {
2759 stop(msg);
2760 return;
2761 }
2762#endif
2763
2764 LoadSmiLiteral(r0, Smi::FromInt(reason));
2765 push(r0);
2766 // Disable stub call restrictions to always allow calls to abort.
2767 if (!has_frame_) {
2768 // We don't actually want to generate a pile of code for this, so just
2769 // claim there is a stack frame, without generating one.
2770 FrameScope scope(this, StackFrame::NONE);
Ben Murdoch097c5b22016-05-18 11:27:45 +01002771 CallRuntime(Runtime::kAbort);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002772 } else {
Ben Murdoch097c5b22016-05-18 11:27:45 +01002773 CallRuntime(Runtime::kAbort);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002774 }
2775 // will not return here
2776}
2777
2778
2779void MacroAssembler::LoadContext(Register dst, int context_chain_length) {
2780 if (context_chain_length > 0) {
2781 // Move up the chain of contexts to the context containing the slot.
2782 LoadP(dst, MemOperand(cp, Context::SlotOffset(Context::PREVIOUS_INDEX)));
2783 for (int i = 1; i < context_chain_length; i++) {
2784 LoadP(dst, MemOperand(dst, Context::SlotOffset(Context::PREVIOUS_INDEX)));
2785 }
2786 } else {
2787 // Slot is in the current function context. Move it into the
2788 // destination register in case we store into it (the write barrier
2789 // cannot be allowed to destroy the context in esi).
2790 mr(dst, cp);
2791 }
2792}
2793
2794
2795void MacroAssembler::LoadTransitionedArrayMapConditional(
2796 ElementsKind expected_kind, ElementsKind transitioned_kind,
2797 Register map_in_out, Register scratch, Label* no_map_match) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002798 DCHECK(IsFastElementsKind(expected_kind));
2799 DCHECK(IsFastElementsKind(transitioned_kind));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002800
2801 // Check that the function's map is the same as the expected cached map.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002802 LoadP(scratch, NativeContextMemOperand());
2803 LoadP(ip, ContextMemOperand(scratch, Context::ArrayMapIndex(expected_kind)));
2804 cmp(map_in_out, ip);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002805 bne(no_map_match);
2806
2807 // Use the transitioned cached map.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002808 LoadP(map_in_out,
2809 ContextMemOperand(scratch, Context::ArrayMapIndex(transitioned_kind)));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002810}
2811
2812
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002813void MacroAssembler::LoadNativeContextSlot(int index, Register dst) {
2814 LoadP(dst, NativeContextMemOperand());
2815 LoadP(dst, ContextMemOperand(dst, index));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002816}
2817
2818
2819void MacroAssembler::LoadGlobalFunctionInitialMap(Register function,
2820 Register map,
2821 Register scratch) {
2822 // Load the initial map. The global functions all have initial maps.
2823 LoadP(map,
2824 FieldMemOperand(function, JSFunction::kPrototypeOrInitialMapOffset));
2825 if (emit_debug_code()) {
2826 Label ok, fail;
2827 CheckMap(map, scratch, Heap::kMetaMapRootIndex, &fail, DO_SMI_CHECK);
2828 b(&ok);
2829 bind(&fail);
2830 Abort(kGlobalFunctionsMustHaveInitialMap);
2831 bind(&ok);
2832 }
2833}
2834
2835
2836void MacroAssembler::JumpIfNotPowerOfTwoOrZero(
2837 Register reg, Register scratch, Label* not_power_of_two_or_zero) {
2838 subi(scratch, reg, Operand(1));
2839 cmpi(scratch, Operand::Zero());
2840 blt(not_power_of_two_or_zero);
2841 and_(r0, scratch, reg, SetRC);
2842 bne(not_power_of_two_or_zero, cr0);
2843}
2844
2845
2846void MacroAssembler::JumpIfNotPowerOfTwoOrZeroAndNeg(Register reg,
2847 Register scratch,
2848 Label* zero_and_neg,
2849 Label* not_power_of_two) {
2850 subi(scratch, reg, Operand(1));
2851 cmpi(scratch, Operand::Zero());
2852 blt(zero_and_neg);
2853 and_(r0, scratch, reg, SetRC);
2854 bne(not_power_of_two, cr0);
2855}
2856
2857#if !V8_TARGET_ARCH_PPC64
2858void MacroAssembler::SmiTagCheckOverflow(Register reg, Register overflow) {
2859 DCHECK(!reg.is(overflow));
2860 mr(overflow, reg); // Save original value.
2861 SmiTag(reg);
2862 xor_(overflow, overflow, reg, SetRC); // Overflow if (value ^ 2 * value) < 0.
2863}
2864
2865
2866void MacroAssembler::SmiTagCheckOverflow(Register dst, Register src,
2867 Register overflow) {
2868 if (dst.is(src)) {
2869 // Fall back to slower case.
2870 SmiTagCheckOverflow(dst, overflow);
2871 } else {
2872 DCHECK(!dst.is(src));
2873 DCHECK(!dst.is(overflow));
2874 DCHECK(!src.is(overflow));
2875 SmiTag(dst, src);
2876 xor_(overflow, dst, src, SetRC); // Overflow if (value ^ 2 * value) < 0.
2877 }
2878}
2879#endif
2880
2881void MacroAssembler::JumpIfNotBothSmi(Register reg1, Register reg2,
2882 Label* on_not_both_smi) {
2883 STATIC_ASSERT(kSmiTag == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002884 orx(r0, reg1, reg2, LeaveRC);
2885 JumpIfNotSmi(r0, on_not_both_smi);
2886}
2887
2888
2889void MacroAssembler::UntagAndJumpIfSmi(Register dst, Register src,
2890 Label* smi_case) {
2891 STATIC_ASSERT(kSmiTag == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002892 TestBitRange(src, kSmiTagSize - 1, 0, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002893 SmiUntag(dst, src);
2894 beq(smi_case, cr0);
2895}
2896
2897
2898void MacroAssembler::UntagAndJumpIfNotSmi(Register dst, Register src,
2899 Label* non_smi_case) {
2900 STATIC_ASSERT(kSmiTag == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002901 TestBitRange(src, kSmiTagSize - 1, 0, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002902 SmiUntag(dst, src);
2903 bne(non_smi_case, cr0);
2904}
2905
2906
2907void MacroAssembler::JumpIfEitherSmi(Register reg1, Register reg2,
2908 Label* on_either_smi) {
2909 STATIC_ASSERT(kSmiTag == 0);
2910 JumpIfSmi(reg1, on_either_smi);
2911 JumpIfSmi(reg2, on_either_smi);
2912}
2913
Ben Murdochda12d292016-06-02 14:46:10 +01002914void MacroAssembler::AssertNotNumber(Register object) {
2915 if (emit_debug_code()) {
2916 STATIC_ASSERT(kSmiTag == 0);
2917 TestIfSmi(object, r0);
2918 Check(ne, kOperandIsANumber, cr0);
2919 push(object);
2920 CompareObjectType(object, object, object, HEAP_NUMBER_TYPE);
2921 pop(object);
2922 Check(ne, kOperandIsANumber);
2923 }
2924}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002925
2926void MacroAssembler::AssertNotSmi(Register object) {
2927 if (emit_debug_code()) {
2928 STATIC_ASSERT(kSmiTag == 0);
2929 TestIfSmi(object, r0);
2930 Check(ne, kOperandIsASmi, cr0);
2931 }
2932}
2933
2934
2935void MacroAssembler::AssertSmi(Register object) {
2936 if (emit_debug_code()) {
2937 STATIC_ASSERT(kSmiTag == 0);
2938 TestIfSmi(object, r0);
2939 Check(eq, kOperandIsNotSmi, cr0);
2940 }
2941}
2942
2943
2944void MacroAssembler::AssertString(Register object) {
2945 if (emit_debug_code()) {
2946 STATIC_ASSERT(kSmiTag == 0);
2947 TestIfSmi(object, r0);
2948 Check(ne, kOperandIsASmiAndNotAString, cr0);
2949 push(object);
2950 LoadP(object, FieldMemOperand(object, HeapObject::kMapOffset));
2951 CompareInstanceType(object, object, FIRST_NONSTRING_TYPE);
2952 pop(object);
2953 Check(lt, kOperandIsNotAString);
2954 }
2955}
2956
2957
2958void MacroAssembler::AssertName(Register object) {
2959 if (emit_debug_code()) {
2960 STATIC_ASSERT(kSmiTag == 0);
2961 TestIfSmi(object, r0);
2962 Check(ne, kOperandIsASmiAndNotAName, cr0);
2963 push(object);
2964 LoadP(object, FieldMemOperand(object, HeapObject::kMapOffset));
2965 CompareInstanceType(object, object, LAST_NAME_TYPE);
2966 pop(object);
2967 Check(le, kOperandIsNotAName);
2968 }
2969}
2970
2971
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002972void MacroAssembler::AssertFunction(Register object) {
2973 if (emit_debug_code()) {
2974 STATIC_ASSERT(kSmiTag == 0);
2975 TestIfSmi(object, r0);
2976 Check(ne, kOperandIsASmiAndNotAFunction, cr0);
2977 push(object);
2978 CompareObjectType(object, object, object, JS_FUNCTION_TYPE);
2979 pop(object);
2980 Check(eq, kOperandIsNotAFunction);
2981 }
2982}
2983
2984
2985void MacroAssembler::AssertBoundFunction(Register object) {
2986 if (emit_debug_code()) {
2987 STATIC_ASSERT(kSmiTag == 0);
2988 TestIfSmi(object, r0);
2989 Check(ne, kOperandIsASmiAndNotABoundFunction, cr0);
2990 push(object);
2991 CompareObjectType(object, object, object, JS_BOUND_FUNCTION_TYPE);
2992 pop(object);
2993 Check(eq, kOperandIsNotABoundFunction);
2994 }
2995}
2996
Ben Murdoch097c5b22016-05-18 11:27:45 +01002997void MacroAssembler::AssertReceiver(Register object) {
2998 if (emit_debug_code()) {
2999 STATIC_ASSERT(kSmiTag == 0);
3000 TestIfSmi(object, r0);
3001 Check(ne, kOperandIsASmiAndNotAReceiver, cr0);
3002 push(object);
3003 STATIC_ASSERT(LAST_TYPE == LAST_JS_RECEIVER_TYPE);
3004 CompareObjectType(object, object, object, FIRST_JS_RECEIVER_TYPE);
3005 pop(object);
3006 Check(ge, kOperandIsNotAReceiver);
3007 }
3008}
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003009
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003010void MacroAssembler::AssertUndefinedOrAllocationSite(Register object,
3011 Register scratch) {
3012 if (emit_debug_code()) {
3013 Label done_checking;
3014 AssertNotSmi(object);
3015 CompareRoot(object, Heap::kUndefinedValueRootIndex);
3016 beq(&done_checking);
3017 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
3018 CompareRoot(scratch, Heap::kAllocationSiteMapRootIndex);
3019 Assert(eq, kExpectedUndefinedOrCell);
3020 bind(&done_checking);
3021 }
3022}
3023
3024
3025void MacroAssembler::AssertIsRoot(Register reg, Heap::RootListIndex index) {
3026 if (emit_debug_code()) {
3027 CompareRoot(reg, index);
3028 Check(eq, kHeapNumberMapRegisterClobbered);
3029 }
3030}
3031
3032
3033void MacroAssembler::JumpIfNotHeapNumber(Register object,
3034 Register heap_number_map,
3035 Register scratch,
3036 Label* on_not_heap_number) {
3037 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
3038 AssertIsRoot(heap_number_map, Heap::kHeapNumberMapRootIndex);
3039 cmp(scratch, heap_number_map);
3040 bne(on_not_heap_number);
3041}
3042
3043
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003044void MacroAssembler::JumpIfNonSmisNotBothSequentialOneByteStrings(
3045 Register first, Register second, Register scratch1, Register scratch2,
3046 Label* failure) {
3047 // Test that both first and second are sequential one-byte strings.
3048 // Assume that they are non-smis.
3049 LoadP(scratch1, FieldMemOperand(first, HeapObject::kMapOffset));
3050 LoadP(scratch2, FieldMemOperand(second, HeapObject::kMapOffset));
3051 lbz(scratch1, FieldMemOperand(scratch1, Map::kInstanceTypeOffset));
3052 lbz(scratch2, FieldMemOperand(scratch2, Map::kInstanceTypeOffset));
3053
3054 JumpIfBothInstanceTypesAreNotSequentialOneByte(scratch1, scratch2, scratch1,
3055 scratch2, failure);
3056}
3057
3058void MacroAssembler::JumpIfNotBothSequentialOneByteStrings(Register first,
3059 Register second,
3060 Register scratch1,
3061 Register scratch2,
3062 Label* failure) {
3063 // Check that neither is a smi.
3064 and_(scratch1, first, second);
3065 JumpIfSmi(scratch1, failure);
3066 JumpIfNonSmisNotBothSequentialOneByteStrings(first, second, scratch1,
3067 scratch2, failure);
3068}
3069
3070
3071void MacroAssembler::JumpIfNotUniqueNameInstanceType(Register reg,
3072 Label* not_unique_name) {
3073 STATIC_ASSERT(kInternalizedTag == 0 && kStringTag == 0);
3074 Label succeed;
3075 andi(r0, reg, Operand(kIsNotStringMask | kIsNotInternalizedMask));
3076 beq(&succeed, cr0);
3077 cmpi(reg, Operand(SYMBOL_TYPE));
3078 bne(not_unique_name);
3079
3080 bind(&succeed);
3081}
3082
3083
3084// Allocates a heap number or jumps to the need_gc label if the young space
3085// is full and a scavenge is needed.
3086void MacroAssembler::AllocateHeapNumber(Register result, Register scratch1,
3087 Register scratch2,
3088 Register heap_number_map,
3089 Label* gc_required,
3090 TaggingMode tagging_mode,
3091 MutableMode mode) {
3092 // Allocate an object in the heap for the heap number and tag it as a heap
3093 // object.
3094 Allocate(HeapNumber::kSize, result, scratch1, scratch2, gc_required,
3095 tagging_mode == TAG_RESULT ? TAG_OBJECT : NO_ALLOCATION_FLAGS);
3096
3097 Heap::RootListIndex map_index = mode == MUTABLE
3098 ? Heap::kMutableHeapNumberMapRootIndex
3099 : Heap::kHeapNumberMapRootIndex;
3100 AssertIsRoot(heap_number_map, map_index);
3101
3102 // Store heap number map in the allocated object.
3103 if (tagging_mode == TAG_RESULT) {
3104 StoreP(heap_number_map, FieldMemOperand(result, HeapObject::kMapOffset),
3105 r0);
3106 } else {
3107 StoreP(heap_number_map, MemOperand(result, HeapObject::kMapOffset));
3108 }
3109}
3110
3111
3112void MacroAssembler::AllocateHeapNumberWithValue(
3113 Register result, DoubleRegister value, Register scratch1, Register scratch2,
3114 Register heap_number_map, Label* gc_required) {
3115 AllocateHeapNumber(result, scratch1, scratch2, heap_number_map, gc_required);
3116 stfd(value, FieldMemOperand(result, HeapNumber::kValueOffset));
3117}
3118
3119
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003120void MacroAssembler::AllocateJSValue(Register result, Register constructor,
3121 Register value, Register scratch1,
3122 Register scratch2, Label* gc_required) {
3123 DCHECK(!result.is(constructor));
3124 DCHECK(!result.is(scratch1));
3125 DCHECK(!result.is(scratch2));
3126 DCHECK(!result.is(value));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003127
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003128 // Allocate JSValue in new space.
3129 Allocate(JSValue::kSize, result, scratch1, scratch2, gc_required, TAG_OBJECT);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003130
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003131 // Initialize the JSValue.
3132 LoadGlobalFunctionInitialMap(constructor, scratch1, scratch2);
3133 StoreP(scratch1, FieldMemOperand(result, HeapObject::kMapOffset), r0);
3134 LoadRoot(scratch1, Heap::kEmptyFixedArrayRootIndex);
3135 StoreP(scratch1, FieldMemOperand(result, JSObject::kPropertiesOffset), r0);
3136 StoreP(scratch1, FieldMemOperand(result, JSObject::kElementsOffset), r0);
3137 StoreP(value, FieldMemOperand(result, JSValue::kValueOffset), r0);
3138 STATIC_ASSERT(JSValue::kSize == 4 * kPointerSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003139}
3140
3141
3142void MacroAssembler::CopyBytes(Register src, Register dst, Register length,
3143 Register scratch) {
3144 Label align_loop, aligned, word_loop, byte_loop, byte_loop_1, done;
3145
3146 DCHECK(!scratch.is(r0));
3147
3148 cmpi(length, Operand::Zero());
3149 beq(&done);
3150
3151 // Check src alignment and length to see whether word_loop is possible
3152 andi(scratch, src, Operand(kPointerSize - 1));
3153 beq(&aligned, cr0);
3154 subfic(scratch, scratch, Operand(kPointerSize * 2));
3155 cmp(length, scratch);
3156 blt(&byte_loop);
3157
3158 // Align src before copying in word size chunks.
3159 subi(scratch, scratch, Operand(kPointerSize));
3160 mtctr(scratch);
3161 bind(&align_loop);
3162 lbz(scratch, MemOperand(src));
3163 addi(src, src, Operand(1));
3164 subi(length, length, Operand(1));
3165 stb(scratch, MemOperand(dst));
3166 addi(dst, dst, Operand(1));
3167 bdnz(&align_loop);
3168
3169 bind(&aligned);
3170
3171 // Copy bytes in word size chunks.
3172 if (emit_debug_code()) {
3173 andi(r0, src, Operand(kPointerSize - 1));
3174 Assert(eq, kExpectingAlignmentForCopyBytes, cr0);
3175 }
3176
3177 ShiftRightImm(scratch, length, Operand(kPointerSizeLog2));
3178 cmpi(scratch, Operand::Zero());
3179 beq(&byte_loop);
3180
3181 mtctr(scratch);
3182 bind(&word_loop);
3183 LoadP(scratch, MemOperand(src));
3184 addi(src, src, Operand(kPointerSize));
3185 subi(length, length, Operand(kPointerSize));
3186 if (CpuFeatures::IsSupported(UNALIGNED_ACCESSES)) {
3187 // currently false for PPC - but possible future opt
3188 StoreP(scratch, MemOperand(dst));
3189 addi(dst, dst, Operand(kPointerSize));
3190 } else {
3191#if V8_TARGET_LITTLE_ENDIAN
3192 stb(scratch, MemOperand(dst, 0));
3193 ShiftRightImm(scratch, scratch, Operand(8));
3194 stb(scratch, MemOperand(dst, 1));
3195 ShiftRightImm(scratch, scratch, Operand(8));
3196 stb(scratch, MemOperand(dst, 2));
3197 ShiftRightImm(scratch, scratch, Operand(8));
3198 stb(scratch, MemOperand(dst, 3));
3199#if V8_TARGET_ARCH_PPC64
3200 ShiftRightImm(scratch, scratch, Operand(8));
3201 stb(scratch, MemOperand(dst, 4));
3202 ShiftRightImm(scratch, scratch, Operand(8));
3203 stb(scratch, MemOperand(dst, 5));
3204 ShiftRightImm(scratch, scratch, Operand(8));
3205 stb(scratch, MemOperand(dst, 6));
3206 ShiftRightImm(scratch, scratch, Operand(8));
3207 stb(scratch, MemOperand(dst, 7));
3208#endif
3209#else
3210#if V8_TARGET_ARCH_PPC64
3211 stb(scratch, MemOperand(dst, 7));
3212 ShiftRightImm(scratch, scratch, Operand(8));
3213 stb(scratch, MemOperand(dst, 6));
3214 ShiftRightImm(scratch, scratch, Operand(8));
3215 stb(scratch, MemOperand(dst, 5));
3216 ShiftRightImm(scratch, scratch, Operand(8));
3217 stb(scratch, MemOperand(dst, 4));
3218 ShiftRightImm(scratch, scratch, Operand(8));
3219#endif
3220 stb(scratch, MemOperand(dst, 3));
3221 ShiftRightImm(scratch, scratch, Operand(8));
3222 stb(scratch, MemOperand(dst, 2));
3223 ShiftRightImm(scratch, scratch, Operand(8));
3224 stb(scratch, MemOperand(dst, 1));
3225 ShiftRightImm(scratch, scratch, Operand(8));
3226 stb(scratch, MemOperand(dst, 0));
3227#endif
3228 addi(dst, dst, Operand(kPointerSize));
3229 }
3230 bdnz(&word_loop);
3231
3232 // Copy the last bytes if any left.
3233 cmpi(length, Operand::Zero());
3234 beq(&done);
3235
3236 bind(&byte_loop);
3237 mtctr(length);
3238 bind(&byte_loop_1);
3239 lbz(scratch, MemOperand(src));
3240 addi(src, src, Operand(1));
3241 stb(scratch, MemOperand(dst));
3242 addi(dst, dst, Operand(1));
3243 bdnz(&byte_loop_1);
3244
3245 bind(&done);
3246}
3247
3248
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003249void MacroAssembler::InitializeNFieldsWithFiller(Register current_address,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003250 Register count,
3251 Register filler) {
3252 Label loop;
3253 mtctr(count);
3254 bind(&loop);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003255 StoreP(filler, MemOperand(current_address));
3256 addi(current_address, current_address, Operand(kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003257 bdnz(&loop);
3258}
3259
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003260void MacroAssembler::InitializeFieldsWithFiller(Register current_address,
3261 Register end_address,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003262 Register filler) {
3263 Label done;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003264 sub(r0, end_address, current_address, LeaveOE, SetRC);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003265 beq(&done, cr0);
3266 ShiftRightImm(r0, r0, Operand(kPointerSizeLog2));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003267 InitializeNFieldsWithFiller(current_address, r0, filler);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003268 bind(&done);
3269}
3270
3271
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003272void MacroAssembler::JumpIfBothInstanceTypesAreNotSequentialOneByte(
3273 Register first, Register second, Register scratch1, Register scratch2,
3274 Label* failure) {
3275 const int kFlatOneByteStringMask =
3276 kIsNotStringMask | kStringEncodingMask | kStringRepresentationMask;
3277 const int kFlatOneByteStringTag =
3278 kStringTag | kOneByteStringTag | kSeqStringTag;
3279 andi(scratch1, first, Operand(kFlatOneByteStringMask));
3280 andi(scratch2, second, Operand(kFlatOneByteStringMask));
3281 cmpi(scratch1, Operand(kFlatOneByteStringTag));
3282 bne(failure);
3283 cmpi(scratch2, Operand(kFlatOneByteStringTag));
3284 bne(failure);
3285}
3286
3287
3288void MacroAssembler::JumpIfInstanceTypeIsNotSequentialOneByte(Register type,
3289 Register scratch,
3290 Label* failure) {
3291 const int kFlatOneByteStringMask =
3292 kIsNotStringMask | kStringEncodingMask | kStringRepresentationMask;
3293 const int kFlatOneByteStringTag =
3294 kStringTag | kOneByteStringTag | kSeqStringTag;
3295 andi(scratch, type, Operand(kFlatOneByteStringMask));
3296 cmpi(scratch, Operand(kFlatOneByteStringTag));
3297 bne(failure);
3298}
3299
3300static const int kRegisterPassedArguments = 8;
3301
3302
3303int MacroAssembler::CalculateStackPassedWords(int num_reg_arguments,
3304 int num_double_arguments) {
3305 int stack_passed_words = 0;
3306 if (num_double_arguments > DoubleRegister::kNumRegisters) {
3307 stack_passed_words +=
3308 2 * (num_double_arguments - DoubleRegister::kNumRegisters);
3309 }
3310 // Up to 8 simple arguments are passed in registers r3..r10.
3311 if (num_reg_arguments > kRegisterPassedArguments) {
3312 stack_passed_words += num_reg_arguments - kRegisterPassedArguments;
3313 }
3314 return stack_passed_words;
3315}
3316
3317
3318void MacroAssembler::EmitSeqStringSetCharCheck(Register string, Register index,
3319 Register value,
3320 uint32_t encoding_mask) {
3321 Label is_object;
3322 TestIfSmi(string, r0);
3323 Check(ne, kNonObject, cr0);
3324
3325 LoadP(ip, FieldMemOperand(string, HeapObject::kMapOffset));
3326 lbz(ip, FieldMemOperand(ip, Map::kInstanceTypeOffset));
3327
3328 andi(ip, ip, Operand(kStringRepresentationMask | kStringEncodingMask));
3329 cmpi(ip, Operand(encoding_mask));
3330 Check(eq, kUnexpectedStringType);
3331
3332// The index is assumed to be untagged coming in, tag it to compare with the
3333// string length without using a temp register, it is restored at the end of
3334// this function.
3335#if !V8_TARGET_ARCH_PPC64
3336 Label index_tag_ok, index_tag_bad;
3337 JumpIfNotSmiCandidate(index, r0, &index_tag_bad);
3338#endif
3339 SmiTag(index, index);
3340#if !V8_TARGET_ARCH_PPC64
3341 b(&index_tag_ok);
3342 bind(&index_tag_bad);
3343 Abort(kIndexIsTooLarge);
3344 bind(&index_tag_ok);
3345#endif
3346
3347 LoadP(ip, FieldMemOperand(string, String::kLengthOffset));
3348 cmp(index, ip);
3349 Check(lt, kIndexIsTooLarge);
3350
3351 DCHECK(Smi::FromInt(0) == 0);
3352 cmpi(index, Operand::Zero());
3353 Check(ge, kIndexIsNegative);
3354
3355 SmiUntag(index, index);
3356}
3357
3358
3359void MacroAssembler::PrepareCallCFunction(int num_reg_arguments,
3360 int num_double_arguments,
3361 Register scratch) {
3362 int frame_alignment = ActivationFrameAlignment();
3363 int stack_passed_arguments =
3364 CalculateStackPassedWords(num_reg_arguments, num_double_arguments);
3365 int stack_space = kNumRequiredStackFrameSlots;
3366
3367 if (frame_alignment > kPointerSize) {
3368 // Make stack end at alignment and make room for stack arguments
3369 // -- preserving original value of sp.
3370 mr(scratch, sp);
3371 addi(sp, sp, Operand(-(stack_passed_arguments + 1) * kPointerSize));
3372 DCHECK(base::bits::IsPowerOfTwo32(frame_alignment));
3373 ClearRightImm(sp, sp, Operand(WhichPowerOf2(frame_alignment)));
3374 StoreP(scratch, MemOperand(sp, stack_passed_arguments * kPointerSize));
3375 } else {
3376 // Make room for stack arguments
3377 stack_space += stack_passed_arguments;
3378 }
3379
3380 // Allocate frame with required slots to make ABI work.
3381 li(r0, Operand::Zero());
3382 StorePU(r0, MemOperand(sp, -stack_space * kPointerSize));
3383}
3384
3385
3386void MacroAssembler::PrepareCallCFunction(int num_reg_arguments,
3387 Register scratch) {
3388 PrepareCallCFunction(num_reg_arguments, 0, scratch);
3389}
3390
3391
3392void MacroAssembler::MovToFloatParameter(DoubleRegister src) { Move(d1, src); }
3393
3394
3395void MacroAssembler::MovToFloatResult(DoubleRegister src) { Move(d1, src); }
3396
3397
3398void MacroAssembler::MovToFloatParameters(DoubleRegister src1,
3399 DoubleRegister src2) {
3400 if (src2.is(d1)) {
3401 DCHECK(!src1.is(d2));
3402 Move(d2, src2);
3403 Move(d1, src1);
3404 } else {
3405 Move(d1, src1);
3406 Move(d2, src2);
3407 }
3408}
3409
3410
3411void MacroAssembler::CallCFunction(ExternalReference function,
3412 int num_reg_arguments,
3413 int num_double_arguments) {
3414 mov(ip, Operand(function));
3415 CallCFunctionHelper(ip, num_reg_arguments, num_double_arguments);
3416}
3417
3418
3419void MacroAssembler::CallCFunction(Register function, int num_reg_arguments,
3420 int num_double_arguments) {
3421 CallCFunctionHelper(function, num_reg_arguments, num_double_arguments);
3422}
3423
3424
3425void MacroAssembler::CallCFunction(ExternalReference function,
3426 int num_arguments) {
3427 CallCFunction(function, num_arguments, 0);
3428}
3429
3430
3431void MacroAssembler::CallCFunction(Register function, int num_arguments) {
3432 CallCFunction(function, num_arguments, 0);
3433}
3434
3435
3436void MacroAssembler::CallCFunctionHelper(Register function,
3437 int num_reg_arguments,
3438 int num_double_arguments) {
3439 DCHECK(has_frame());
Ben Murdoch097c5b22016-05-18 11:27:45 +01003440
3441 // Just call directly. The function called cannot cause a GC, or
3442 // allow preemption, so the return address in the link register
3443 // stays correct.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003444 Register dest = function;
Ben Murdoch097c5b22016-05-18 11:27:45 +01003445 if (ABI_USES_FUNCTION_DESCRIPTORS) {
3446 // AIX/PPC64BE Linux uses a function descriptor. When calling C code be
3447 // aware of this descriptor and pick up values from it
3448 LoadP(ToRegister(ABI_TOC_REGISTER), MemOperand(function, kPointerSize));
3449 LoadP(ip, MemOperand(function, 0));
3450 dest = ip;
3451 } else if (ABI_CALL_VIA_IP) {
3452 Move(ip, function);
3453 dest = ip;
3454 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003455
3456 Call(dest);
3457
3458 // Remove frame bought in PrepareCallCFunction
3459 int stack_passed_arguments =
3460 CalculateStackPassedWords(num_reg_arguments, num_double_arguments);
3461 int stack_space = kNumRequiredStackFrameSlots + stack_passed_arguments;
3462 if (ActivationFrameAlignment() > kPointerSize) {
3463 LoadP(sp, MemOperand(sp, stack_space * kPointerSize));
3464 } else {
3465 addi(sp, sp, Operand(stack_space * kPointerSize));
3466 }
3467}
3468
3469
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003470void MacroAssembler::DecodeConstantPoolOffset(Register result,
3471 Register location) {
3472 Label overflow_access, done;
3473 DCHECK(!AreAliased(result, location, r0));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003474
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003475 // Determine constant pool access type
3476 // Caller has already placed the instruction word at location in result.
3477 ExtractBitRange(r0, result, 31, 26);
3478 cmpi(r0, Operand(ADDIS >> 26));
3479 beq(&overflow_access);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003480
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003481 // Regular constant pool access
3482 // extract the load offset
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003483 andi(result, result, Operand(kImm16Mask));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003484 b(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003485
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003486 bind(&overflow_access);
3487 // Overflow constant pool access
3488 // shift addis immediate
3489 slwi(r0, result, Operand(16));
3490 // sign-extend and add the load offset
3491 lwz(result, MemOperand(location, kInstrSize));
3492 extsh(result, result);
3493 add(result, r0, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003494
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003495 bind(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003496}
3497
3498
3499void MacroAssembler::CheckPageFlag(
3500 Register object,
3501 Register scratch, // scratch may be same register as object
3502 int mask, Condition cc, Label* condition_met) {
3503 DCHECK(cc == ne || cc == eq);
3504 ClearRightImm(scratch, object, Operand(kPageSizeBits));
3505 LoadP(scratch, MemOperand(scratch, MemoryChunk::kFlagsOffset));
3506
3507 And(r0, scratch, Operand(mask), SetRC);
3508
3509 if (cc == ne) {
3510 bne(condition_met, cr0);
3511 }
3512 if (cc == eq) {
3513 beq(condition_met, cr0);
3514 }
3515}
3516
3517
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003518void MacroAssembler::JumpIfBlack(Register object, Register scratch0,
3519 Register scratch1, Label* on_black) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003520 HasColor(object, scratch0, scratch1, on_black, 1, 1); // kBlackBitPattern.
3521 DCHECK(strcmp(Marking::kBlackBitPattern, "11") == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003522}
3523
3524
3525void MacroAssembler::HasColor(Register object, Register bitmap_scratch,
3526 Register mask_scratch, Label* has_color,
3527 int first_bit, int second_bit) {
3528 DCHECK(!AreAliased(object, bitmap_scratch, mask_scratch, no_reg));
3529
3530 GetMarkBits(object, bitmap_scratch, mask_scratch);
3531
3532 Label other_color, word_boundary;
3533 lwz(ip, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize));
3534 // Test the first bit
3535 and_(r0, ip, mask_scratch, SetRC);
3536 b(first_bit == 1 ? eq : ne, &other_color, cr0);
3537 // Shift left 1
3538 // May need to load the next cell
3539 slwi(mask_scratch, mask_scratch, Operand(1), SetRC);
3540 beq(&word_boundary, cr0);
3541 // Test the second bit
3542 and_(r0, ip, mask_scratch, SetRC);
3543 b(second_bit == 1 ? ne : eq, has_color, cr0);
3544 b(&other_color);
3545
3546 bind(&word_boundary);
3547 lwz(ip, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize + kIntSize));
3548 andi(r0, ip, Operand(1));
3549 b(second_bit == 1 ? ne : eq, has_color, cr0);
3550 bind(&other_color);
3551}
3552
3553
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003554void MacroAssembler::GetMarkBits(Register addr_reg, Register bitmap_reg,
3555 Register mask_reg) {
3556 DCHECK(!AreAliased(addr_reg, bitmap_reg, mask_reg, no_reg));
3557 DCHECK((~Page::kPageAlignmentMask & 0xffff) == 0);
3558 lis(r0, Operand((~Page::kPageAlignmentMask >> 16)));
3559 and_(bitmap_reg, addr_reg, r0);
3560 const int kLowBits = kPointerSizeLog2 + Bitmap::kBitsPerCellLog2;
3561 ExtractBitRange(mask_reg, addr_reg, kLowBits - 1, kPointerSizeLog2);
3562 ExtractBitRange(ip, addr_reg, kPageSizeBits - 1, kLowBits);
3563 ShiftLeftImm(ip, ip, Operand(Bitmap::kBytesPerCellLog2));
3564 add(bitmap_reg, bitmap_reg, ip);
3565 li(ip, Operand(1));
3566 slw(mask_reg, ip, mask_reg);
3567}
3568
3569
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003570void MacroAssembler::JumpIfWhite(Register value, Register bitmap_scratch,
3571 Register mask_scratch, Register load_scratch,
3572 Label* value_is_white) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003573 DCHECK(!AreAliased(value, bitmap_scratch, mask_scratch, ip));
3574 GetMarkBits(value, bitmap_scratch, mask_scratch);
3575
3576 // If the value is black or grey we don't need to do anything.
3577 DCHECK(strcmp(Marking::kWhiteBitPattern, "00") == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003578 DCHECK(strcmp(Marking::kBlackBitPattern, "11") == 0);
3579 DCHECK(strcmp(Marking::kGreyBitPattern, "10") == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003580 DCHECK(strcmp(Marking::kImpossibleBitPattern, "01") == 0);
3581
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003582 // Since both black and grey have a 1 in the first position and white does
3583 // not have a 1 there we only need to check one bit.
3584 lwz(load_scratch, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize));
3585 and_(r0, mask_scratch, load_scratch, SetRC);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003586 beq(value_is_white, cr0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003587}
3588
3589
3590// Saturate a value into 8-bit unsigned integer
3591// if input_value < 0, output_value is 0
3592// if input_value > 255, output_value is 255
3593// otherwise output_value is the input_value
3594void MacroAssembler::ClampUint8(Register output_reg, Register input_reg) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003595 int satval = (1 << 8) - 1;
3596
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003597 if (CpuFeatures::IsSupported(ISELECT)) {
3598 // set to 0 if negative
3599 cmpi(input_reg, Operand::Zero());
3600 isel(lt, output_reg, r0, input_reg);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003601
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003602 // set to satval if > satval
3603 li(r0, Operand(satval));
3604 cmpi(output_reg, Operand(satval));
3605 isel(lt, output_reg, output_reg, r0);
3606 } else {
3607 Label done, negative_label, overflow_label;
3608 cmpi(input_reg, Operand::Zero());
3609 blt(&negative_label);
3610
3611 cmpi(input_reg, Operand(satval));
3612 bgt(&overflow_label);
3613 if (!output_reg.is(input_reg)) {
3614 mr(output_reg, input_reg);
3615 }
3616 b(&done);
3617
3618 bind(&negative_label);
3619 li(output_reg, Operand::Zero()); // set to 0 if negative
3620 b(&done);
3621
3622 bind(&overflow_label); // set to satval if > satval
3623 li(output_reg, Operand(satval));
3624
3625 bind(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003626 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003627}
3628
3629
3630void MacroAssembler::SetRoundingMode(FPRoundingMode RN) { mtfsfi(7, RN); }
3631
3632
3633void MacroAssembler::ResetRoundingMode() {
3634 mtfsfi(7, kRoundToNearest); // reset (default is kRoundToNearest)
3635}
3636
3637
3638void MacroAssembler::ClampDoubleToUint8(Register result_reg,
3639 DoubleRegister input_reg,
3640 DoubleRegister double_scratch) {
3641 Label above_zero;
3642 Label done;
3643 Label in_bounds;
3644
3645 LoadDoubleLiteral(double_scratch, 0.0, result_reg);
3646 fcmpu(input_reg, double_scratch);
3647 bgt(&above_zero);
3648
3649 // Double value is less than zero, NaN or Inf, return 0.
3650 LoadIntLiteral(result_reg, 0);
3651 b(&done);
3652
3653 // Double value is >= 255, return 255.
3654 bind(&above_zero);
3655 LoadDoubleLiteral(double_scratch, 255.0, result_reg);
3656 fcmpu(input_reg, double_scratch);
3657 ble(&in_bounds);
3658 LoadIntLiteral(result_reg, 255);
3659 b(&done);
3660
3661 // In 0-255 range, round and truncate.
3662 bind(&in_bounds);
3663
3664 // round to nearest (default rounding mode)
3665 fctiw(double_scratch, input_reg);
3666 MovDoubleLowToInt(result_reg, double_scratch);
3667 bind(&done);
3668}
3669
3670
3671void MacroAssembler::LoadInstanceDescriptors(Register map,
3672 Register descriptors) {
3673 LoadP(descriptors, FieldMemOperand(map, Map::kDescriptorsOffset));
3674}
3675
3676
3677void MacroAssembler::NumberOfOwnDescriptors(Register dst, Register map) {
3678 lwz(dst, FieldMemOperand(map, Map::kBitField3Offset));
3679 DecodeField<Map::NumberOfOwnDescriptorsBits>(dst);
3680}
3681
3682
3683void MacroAssembler::EnumLength(Register dst, Register map) {
3684 STATIC_ASSERT(Map::EnumLengthBits::kShift == 0);
3685 lwz(dst, FieldMemOperand(map, Map::kBitField3Offset));
3686 ExtractBitMask(dst, dst, Map::EnumLengthBits::kMask);
3687 SmiTag(dst);
3688}
3689
3690
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003691void MacroAssembler::LoadAccessor(Register dst, Register holder,
3692 int accessor_index,
3693 AccessorComponent accessor) {
3694 LoadP(dst, FieldMemOperand(holder, HeapObject::kMapOffset));
3695 LoadInstanceDescriptors(dst, dst);
3696 LoadP(dst,
3697 FieldMemOperand(dst, DescriptorArray::GetValueOffset(accessor_index)));
3698 const int getterOffset = AccessorPair::kGetterOffset;
3699 const int setterOffset = AccessorPair::kSetterOffset;
3700 int offset = ((accessor == ACCESSOR_GETTER) ? getterOffset : setterOffset);
3701 LoadP(dst, FieldMemOperand(dst, offset));
3702}
3703
3704
Ben Murdoch097c5b22016-05-18 11:27:45 +01003705void MacroAssembler::CheckEnumCache(Label* call_runtime) {
3706 Register null_value = r8;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003707 Register empty_fixed_array_value = r9;
3708 LoadRoot(empty_fixed_array_value, Heap::kEmptyFixedArrayRootIndex);
3709 Label next, start;
3710 mr(r5, r3);
3711
3712 // Check if the enum length field is properly initialized, indicating that
3713 // there is an enum cache.
3714 LoadP(r4, FieldMemOperand(r5, HeapObject::kMapOffset));
3715
3716 EnumLength(r6, r4);
3717 CmpSmiLiteral(r6, Smi::FromInt(kInvalidEnumCacheSentinel), r0);
3718 beq(call_runtime);
3719
Ben Murdoch097c5b22016-05-18 11:27:45 +01003720 LoadRoot(null_value, Heap::kNullValueRootIndex);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003721 b(&start);
3722
3723 bind(&next);
3724 LoadP(r4, FieldMemOperand(r5, HeapObject::kMapOffset));
3725
3726 // For all objects but the receiver, check that the cache is empty.
3727 EnumLength(r6, r4);
3728 CmpSmiLiteral(r6, Smi::FromInt(0), r0);
3729 bne(call_runtime);
3730
3731 bind(&start);
3732
3733 // Check that there are no elements. Register r5 contains the current JS
3734 // object we've reached through the prototype chain.
3735 Label no_elements;
3736 LoadP(r5, FieldMemOperand(r5, JSObject::kElementsOffset));
3737 cmp(r5, empty_fixed_array_value);
3738 beq(&no_elements);
3739
3740 // Second chance, the object may be using the empty slow element dictionary.
3741 CompareRoot(r5, Heap::kEmptySlowElementDictionaryRootIndex);
3742 bne(call_runtime);
3743
3744 bind(&no_elements);
3745 LoadP(r5, FieldMemOperand(r4, Map::kPrototypeOffset));
3746 cmp(r5, null_value);
3747 bne(&next);
3748}
3749
3750
3751////////////////////////////////////////////////////////////////////////////////
3752//
3753// New MacroAssembler Interfaces added for PPC
3754//
3755////////////////////////////////////////////////////////////////////////////////
3756void MacroAssembler::LoadIntLiteral(Register dst, int value) {
3757 mov(dst, Operand(value));
3758}
3759
3760
3761void MacroAssembler::LoadSmiLiteral(Register dst, Smi* smi) {
3762 mov(dst, Operand(smi));
3763}
3764
3765
3766void MacroAssembler::LoadDoubleLiteral(DoubleRegister result, double value,
3767 Register scratch) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003768 if (FLAG_enable_embedded_constant_pool && is_constant_pool_available() &&
3769 !(scratch.is(r0) && ConstantPoolAccessIsInOverflow())) {
3770 ConstantPoolEntry::Access access = ConstantPoolAddEntry(value);
3771 if (access == ConstantPoolEntry::OVERFLOWED) {
3772 addis(scratch, kConstantPoolRegister, Operand::Zero());
3773 lfd(result, MemOperand(scratch, 0));
3774 } else {
3775 lfd(result, MemOperand(kConstantPoolRegister, 0));
3776 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003777 return;
3778 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003779
3780 // avoid gcc strict aliasing error using union cast
3781 union {
3782 double dval;
3783#if V8_TARGET_ARCH_PPC64
3784 intptr_t ival;
3785#else
3786 intptr_t ival[2];
3787#endif
3788 } litVal;
3789
3790 litVal.dval = value;
3791
3792#if V8_TARGET_ARCH_PPC64
3793 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3794 mov(scratch, Operand(litVal.ival));
3795 mtfprd(result, scratch);
3796 return;
3797 }
3798#endif
3799
3800 addi(sp, sp, Operand(-kDoubleSize));
3801#if V8_TARGET_ARCH_PPC64
3802 mov(scratch, Operand(litVal.ival));
3803 std(scratch, MemOperand(sp));
3804#else
3805 LoadIntLiteral(scratch, litVal.ival[0]);
3806 stw(scratch, MemOperand(sp, 0));
3807 LoadIntLiteral(scratch, litVal.ival[1]);
3808 stw(scratch, MemOperand(sp, 4));
3809#endif
3810 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3811 lfd(result, MemOperand(sp, 0));
3812 addi(sp, sp, Operand(kDoubleSize));
3813}
3814
3815
3816void MacroAssembler::MovIntToDouble(DoubleRegister dst, Register src,
3817 Register scratch) {
3818// sign-extend src to 64-bit
3819#if V8_TARGET_ARCH_PPC64
3820 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3821 mtfprwa(dst, src);
3822 return;
3823 }
3824#endif
3825
3826 DCHECK(!src.is(scratch));
3827 subi(sp, sp, Operand(kDoubleSize));
3828#if V8_TARGET_ARCH_PPC64
3829 extsw(scratch, src);
3830 std(scratch, MemOperand(sp, 0));
3831#else
3832 srawi(scratch, src, 31);
3833 stw(scratch, MemOperand(sp, Register::kExponentOffset));
3834 stw(src, MemOperand(sp, Register::kMantissaOffset));
3835#endif
3836 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3837 lfd(dst, MemOperand(sp, 0));
3838 addi(sp, sp, Operand(kDoubleSize));
3839}
3840
3841
3842void MacroAssembler::MovUnsignedIntToDouble(DoubleRegister dst, Register src,
3843 Register scratch) {
3844// zero-extend src to 64-bit
3845#if V8_TARGET_ARCH_PPC64
3846 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3847 mtfprwz(dst, src);
3848 return;
3849 }
3850#endif
3851
3852 DCHECK(!src.is(scratch));
3853 subi(sp, sp, Operand(kDoubleSize));
3854#if V8_TARGET_ARCH_PPC64
3855 clrldi(scratch, src, Operand(32));
3856 std(scratch, MemOperand(sp, 0));
3857#else
3858 li(scratch, Operand::Zero());
3859 stw(scratch, MemOperand(sp, Register::kExponentOffset));
3860 stw(src, MemOperand(sp, Register::kMantissaOffset));
3861#endif
3862 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3863 lfd(dst, MemOperand(sp, 0));
3864 addi(sp, sp, Operand(kDoubleSize));
3865}
3866
3867
3868void MacroAssembler::MovInt64ToDouble(DoubleRegister dst,
3869#if !V8_TARGET_ARCH_PPC64
3870 Register src_hi,
3871#endif
3872 Register src) {
3873#if V8_TARGET_ARCH_PPC64
3874 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3875 mtfprd(dst, src);
3876 return;
3877 }
3878#endif
3879
3880 subi(sp, sp, Operand(kDoubleSize));
3881#if V8_TARGET_ARCH_PPC64
3882 std(src, MemOperand(sp, 0));
3883#else
3884 stw(src_hi, MemOperand(sp, Register::kExponentOffset));
3885 stw(src, MemOperand(sp, Register::kMantissaOffset));
3886#endif
3887 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3888 lfd(dst, MemOperand(sp, 0));
3889 addi(sp, sp, Operand(kDoubleSize));
3890}
3891
3892
3893#if V8_TARGET_ARCH_PPC64
3894void MacroAssembler::MovInt64ComponentsToDouble(DoubleRegister dst,
3895 Register src_hi,
3896 Register src_lo,
3897 Register scratch) {
3898 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3899 sldi(scratch, src_hi, Operand(32));
3900 rldimi(scratch, src_lo, 0, 32);
3901 mtfprd(dst, scratch);
3902 return;
3903 }
3904
3905 subi(sp, sp, Operand(kDoubleSize));
3906 stw(src_hi, MemOperand(sp, Register::kExponentOffset));
3907 stw(src_lo, MemOperand(sp, Register::kMantissaOffset));
3908 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3909 lfd(dst, MemOperand(sp));
3910 addi(sp, sp, Operand(kDoubleSize));
3911}
3912#endif
3913
3914
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003915void MacroAssembler::InsertDoubleLow(DoubleRegister dst, Register src,
3916 Register scratch) {
3917#if V8_TARGET_ARCH_PPC64
3918 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3919 mffprd(scratch, dst);
3920 rldimi(scratch, src, 0, 32);
3921 mtfprd(dst, scratch);
3922 return;
3923 }
3924#endif
3925
3926 subi(sp, sp, Operand(kDoubleSize));
3927 stfd(dst, MemOperand(sp));
3928 stw(src, MemOperand(sp, Register::kMantissaOffset));
3929 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3930 lfd(dst, MemOperand(sp));
3931 addi(sp, sp, Operand(kDoubleSize));
3932}
3933
3934
3935void MacroAssembler::InsertDoubleHigh(DoubleRegister dst, Register src,
3936 Register scratch) {
3937#if V8_TARGET_ARCH_PPC64
3938 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3939 mffprd(scratch, dst);
3940 rldimi(scratch, src, 32, 0);
3941 mtfprd(dst, scratch);
3942 return;
3943 }
3944#endif
3945
3946 subi(sp, sp, Operand(kDoubleSize));
3947 stfd(dst, MemOperand(sp));
3948 stw(src, MemOperand(sp, Register::kExponentOffset));
3949 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3950 lfd(dst, MemOperand(sp));
3951 addi(sp, sp, Operand(kDoubleSize));
3952}
3953
3954
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003955void MacroAssembler::MovDoubleLowToInt(Register dst, DoubleRegister src) {
3956#if V8_TARGET_ARCH_PPC64
3957 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3958 mffprwz(dst, src);
3959 return;
3960 }
3961#endif
3962
3963 subi(sp, sp, Operand(kDoubleSize));
3964 stfd(src, MemOperand(sp));
3965 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3966 lwz(dst, MemOperand(sp, Register::kMantissaOffset));
3967 addi(sp, sp, Operand(kDoubleSize));
3968}
3969
3970
3971void MacroAssembler::MovDoubleHighToInt(Register dst, DoubleRegister src) {
3972#if V8_TARGET_ARCH_PPC64
3973 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3974 mffprd(dst, src);
3975 srdi(dst, dst, Operand(32));
3976 return;
3977 }
3978#endif
3979
3980 subi(sp, sp, Operand(kDoubleSize));
3981 stfd(src, MemOperand(sp));
3982 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3983 lwz(dst, MemOperand(sp, Register::kExponentOffset));
3984 addi(sp, sp, Operand(kDoubleSize));
3985}
3986
3987
3988void MacroAssembler::MovDoubleToInt64(
3989#if !V8_TARGET_ARCH_PPC64
3990 Register dst_hi,
3991#endif
3992 Register dst, DoubleRegister src) {
3993#if V8_TARGET_ARCH_PPC64
3994 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3995 mffprd(dst, src);
3996 return;
3997 }
3998#endif
3999
4000 subi(sp, sp, Operand(kDoubleSize));
4001 stfd(src, MemOperand(sp));
4002 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4003#if V8_TARGET_ARCH_PPC64
4004 ld(dst, MemOperand(sp, 0));
4005#else
4006 lwz(dst_hi, MemOperand(sp, Register::kExponentOffset));
4007 lwz(dst, MemOperand(sp, Register::kMantissaOffset));
4008#endif
4009 addi(sp, sp, Operand(kDoubleSize));
4010}
4011
4012
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004013void MacroAssembler::MovIntToFloat(DoubleRegister dst, Register src) {
4014 subi(sp, sp, Operand(kFloatSize));
4015 stw(src, MemOperand(sp, 0));
4016 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4017 lfs(dst, MemOperand(sp, 0));
4018 addi(sp, sp, Operand(kFloatSize));
4019}
4020
4021
4022void MacroAssembler::MovFloatToInt(Register dst, DoubleRegister src) {
4023 subi(sp, sp, Operand(kFloatSize));
4024 frsp(src, src);
4025 stfs(src, MemOperand(sp, 0));
4026 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4027 lwz(dst, MemOperand(sp, 0));
4028 addi(sp, sp, Operand(kFloatSize));
4029}
4030
4031
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004032void MacroAssembler::Add(Register dst, Register src, intptr_t value,
4033 Register scratch) {
4034 if (is_int16(value)) {
4035 addi(dst, src, Operand(value));
4036 } else {
4037 mov(scratch, Operand(value));
4038 add(dst, src, scratch);
4039 }
4040}
4041
4042
4043void MacroAssembler::Cmpi(Register src1, const Operand& src2, Register scratch,
4044 CRegister cr) {
4045 intptr_t value = src2.immediate();
4046 if (is_int16(value)) {
4047 cmpi(src1, src2, cr);
4048 } else {
4049 mov(scratch, src2);
4050 cmp(src1, scratch, cr);
4051 }
4052}
4053
4054
4055void MacroAssembler::Cmpli(Register src1, const Operand& src2, Register scratch,
4056 CRegister cr) {
4057 intptr_t value = src2.immediate();
4058 if (is_uint16(value)) {
4059 cmpli(src1, src2, cr);
4060 } else {
4061 mov(scratch, src2);
4062 cmpl(src1, scratch, cr);
4063 }
4064}
4065
4066
4067void MacroAssembler::Cmpwi(Register src1, const Operand& src2, Register scratch,
4068 CRegister cr) {
4069 intptr_t value = src2.immediate();
4070 if (is_int16(value)) {
4071 cmpwi(src1, src2, cr);
4072 } else {
4073 mov(scratch, src2);
4074 cmpw(src1, scratch, cr);
4075 }
4076}
4077
4078
4079void MacroAssembler::Cmplwi(Register src1, const Operand& src2,
4080 Register scratch, CRegister cr) {
4081 intptr_t value = src2.immediate();
4082 if (is_uint16(value)) {
4083 cmplwi(src1, src2, cr);
4084 } else {
4085 mov(scratch, src2);
4086 cmplw(src1, scratch, cr);
4087 }
4088}
4089
4090
4091void MacroAssembler::And(Register ra, Register rs, const Operand& rb,
4092 RCBit rc) {
4093 if (rb.is_reg()) {
4094 and_(ra, rs, rb.rm(), rc);
4095 } else {
4096 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == SetRC) {
4097 andi(ra, rs, rb);
4098 } else {
4099 // mov handles the relocation.
4100 DCHECK(!rs.is(r0));
4101 mov(r0, rb);
4102 and_(ra, rs, r0, rc);
4103 }
4104 }
4105}
4106
4107
4108void MacroAssembler::Or(Register ra, Register rs, const Operand& rb, RCBit rc) {
4109 if (rb.is_reg()) {
4110 orx(ra, rs, rb.rm(), rc);
4111 } else {
4112 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == LeaveRC) {
4113 ori(ra, rs, rb);
4114 } else {
4115 // mov handles the relocation.
4116 DCHECK(!rs.is(r0));
4117 mov(r0, rb);
4118 orx(ra, rs, r0, rc);
4119 }
4120 }
4121}
4122
4123
4124void MacroAssembler::Xor(Register ra, Register rs, const Operand& rb,
4125 RCBit rc) {
4126 if (rb.is_reg()) {
4127 xor_(ra, rs, rb.rm(), rc);
4128 } else {
4129 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == LeaveRC) {
4130 xori(ra, rs, rb);
4131 } else {
4132 // mov handles the relocation.
4133 DCHECK(!rs.is(r0));
4134 mov(r0, rb);
4135 xor_(ra, rs, r0, rc);
4136 }
4137 }
4138}
4139
4140
4141void MacroAssembler::CmpSmiLiteral(Register src1, Smi* smi, Register scratch,
4142 CRegister cr) {
4143#if V8_TARGET_ARCH_PPC64
4144 LoadSmiLiteral(scratch, smi);
4145 cmp(src1, scratch, cr);
4146#else
4147 Cmpi(src1, Operand(smi), scratch, cr);
4148#endif
4149}
4150
4151
4152void MacroAssembler::CmplSmiLiteral(Register src1, Smi* smi, Register scratch,
4153 CRegister cr) {
4154#if V8_TARGET_ARCH_PPC64
4155 LoadSmiLiteral(scratch, smi);
4156 cmpl(src1, scratch, cr);
4157#else
4158 Cmpli(src1, Operand(smi), scratch, cr);
4159#endif
4160}
4161
4162
4163void MacroAssembler::AddSmiLiteral(Register dst, Register src, Smi* smi,
4164 Register scratch) {
4165#if V8_TARGET_ARCH_PPC64
4166 LoadSmiLiteral(scratch, smi);
4167 add(dst, src, scratch);
4168#else
4169 Add(dst, src, reinterpret_cast<intptr_t>(smi), scratch);
4170#endif
4171}
4172
4173
4174void MacroAssembler::SubSmiLiteral(Register dst, Register src, Smi* smi,
4175 Register scratch) {
4176#if V8_TARGET_ARCH_PPC64
4177 LoadSmiLiteral(scratch, smi);
4178 sub(dst, src, scratch);
4179#else
4180 Add(dst, src, -(reinterpret_cast<intptr_t>(smi)), scratch);
4181#endif
4182}
4183
4184
4185void MacroAssembler::AndSmiLiteral(Register dst, Register src, Smi* smi,
4186 Register scratch, RCBit rc) {
4187#if V8_TARGET_ARCH_PPC64
4188 LoadSmiLiteral(scratch, smi);
4189 and_(dst, src, scratch, rc);
4190#else
4191 And(dst, src, Operand(smi), rc);
4192#endif
4193}
4194
4195
4196// Load a "pointer" sized value from the memory location
4197void MacroAssembler::LoadP(Register dst, const MemOperand& mem,
4198 Register scratch) {
4199 int offset = mem.offset();
4200
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004201 if (!is_int16(offset)) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004202 /* cannot use d-form */
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004203 DCHECK(!scratch.is(no_reg));
4204 mov(scratch, Operand(offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004205#if V8_TARGET_ARCH_PPC64
4206 ldx(dst, MemOperand(mem.ra(), scratch));
4207#else
4208 lwzx(dst, MemOperand(mem.ra(), scratch));
4209#endif
4210 } else {
4211#if V8_TARGET_ARCH_PPC64
4212 int misaligned = (offset & 3);
4213 if (misaligned) {
4214 // adjust base to conform to offset alignment requirements
4215 // Todo: enhance to use scratch if dst is unsuitable
4216 DCHECK(!dst.is(r0));
4217 addi(dst, mem.ra(), Operand((offset & 3) - 4));
4218 ld(dst, MemOperand(dst, (offset & ~3) + 4));
4219 } else {
4220 ld(dst, mem);
4221 }
4222#else
4223 lwz(dst, mem);
4224#endif
4225 }
4226}
4227
4228
4229// Store a "pointer" sized value to the memory location
4230void MacroAssembler::StoreP(Register src, const MemOperand& mem,
4231 Register scratch) {
4232 int offset = mem.offset();
4233
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004234 if (!is_int16(offset)) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004235 /* cannot use d-form */
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004236 DCHECK(!scratch.is(no_reg));
4237 mov(scratch, Operand(offset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004238#if V8_TARGET_ARCH_PPC64
4239 stdx(src, MemOperand(mem.ra(), scratch));
4240#else
4241 stwx(src, MemOperand(mem.ra(), scratch));
4242#endif
4243 } else {
4244#if V8_TARGET_ARCH_PPC64
4245 int misaligned = (offset & 3);
4246 if (misaligned) {
4247 // adjust base to conform to offset alignment requirements
4248 // a suitable scratch is required here
4249 DCHECK(!scratch.is(no_reg));
4250 if (scratch.is(r0)) {
4251 LoadIntLiteral(scratch, offset);
4252 stdx(src, MemOperand(mem.ra(), scratch));
4253 } else {
4254 addi(scratch, mem.ra(), Operand((offset & 3) - 4));
4255 std(src, MemOperand(scratch, (offset & ~3) + 4));
4256 }
4257 } else {
4258 std(src, mem);
4259 }
4260#else
4261 stw(src, mem);
4262#endif
4263 }
4264}
4265
4266void MacroAssembler::LoadWordArith(Register dst, const MemOperand& mem,
4267 Register scratch) {
4268 int offset = mem.offset();
4269
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004270 if (!is_int16(offset)) {
4271 DCHECK(!scratch.is(no_reg));
4272 mov(scratch, Operand(offset));
4273 lwax(dst, MemOperand(mem.ra(), scratch));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004274 } else {
4275#if V8_TARGET_ARCH_PPC64
4276 int misaligned = (offset & 3);
4277 if (misaligned) {
4278 // adjust base to conform to offset alignment requirements
4279 // Todo: enhance to use scratch if dst is unsuitable
4280 DCHECK(!dst.is(r0));
4281 addi(dst, mem.ra(), Operand((offset & 3) - 4));
4282 lwa(dst, MemOperand(dst, (offset & ~3) + 4));
4283 } else {
4284 lwa(dst, mem);
4285 }
4286#else
4287 lwz(dst, mem);
4288#endif
4289 }
4290}
4291
4292
4293// Variable length depending on whether offset fits into immediate field
4294// MemOperand currently only supports d-form
4295void MacroAssembler::LoadWord(Register dst, const MemOperand& mem,
4296 Register scratch) {
4297 Register base = mem.ra();
4298 int offset = mem.offset();
4299
4300 if (!is_int16(offset)) {
4301 LoadIntLiteral(scratch, offset);
4302 lwzx(dst, MemOperand(base, scratch));
4303 } else {
4304 lwz(dst, mem);
4305 }
4306}
4307
4308
4309// Variable length depending on whether offset fits into immediate field
4310// MemOperand current only supports d-form
4311void MacroAssembler::StoreWord(Register src, const MemOperand& mem,
4312 Register scratch) {
4313 Register base = mem.ra();
4314 int offset = mem.offset();
4315
4316 if (!is_int16(offset)) {
4317 LoadIntLiteral(scratch, offset);
4318 stwx(src, MemOperand(base, scratch));
4319 } else {
4320 stw(src, mem);
4321 }
4322}
4323
4324
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004325void MacroAssembler::LoadHalfWordArith(Register dst, const MemOperand& mem,
4326 Register scratch) {
4327 int offset = mem.offset();
4328
4329 if (!is_int16(offset)) {
4330 DCHECK(!scratch.is(no_reg));
4331 mov(scratch, Operand(offset));
4332 lhax(dst, MemOperand(mem.ra(), scratch));
4333 } else {
4334 lha(dst, mem);
4335 }
4336}
4337
4338
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004339// Variable length depending on whether offset fits into immediate field
4340// MemOperand currently only supports d-form
4341void MacroAssembler::LoadHalfWord(Register dst, const MemOperand& mem,
4342 Register scratch) {
4343 Register base = mem.ra();
4344 int offset = mem.offset();
4345
4346 if (!is_int16(offset)) {
4347 LoadIntLiteral(scratch, offset);
4348 lhzx(dst, MemOperand(base, scratch));
4349 } else {
4350 lhz(dst, mem);
4351 }
4352}
4353
4354
4355// Variable length depending on whether offset fits into immediate field
4356// MemOperand current only supports d-form
4357void MacroAssembler::StoreHalfWord(Register src, const MemOperand& mem,
4358 Register scratch) {
4359 Register base = mem.ra();
4360 int offset = mem.offset();
4361
4362 if (!is_int16(offset)) {
4363 LoadIntLiteral(scratch, offset);
4364 sthx(src, MemOperand(base, scratch));
4365 } else {
4366 sth(src, mem);
4367 }
4368}
4369
4370
4371// Variable length depending on whether offset fits into immediate field
4372// MemOperand currently only supports d-form
4373void MacroAssembler::LoadByte(Register dst, const MemOperand& mem,
4374 Register scratch) {
4375 Register base = mem.ra();
4376 int offset = mem.offset();
4377
4378 if (!is_int16(offset)) {
4379 LoadIntLiteral(scratch, offset);
4380 lbzx(dst, MemOperand(base, scratch));
4381 } else {
4382 lbz(dst, mem);
4383 }
4384}
4385
4386
4387// Variable length depending on whether offset fits into immediate field
4388// MemOperand current only supports d-form
4389void MacroAssembler::StoreByte(Register src, const MemOperand& mem,
4390 Register scratch) {
4391 Register base = mem.ra();
4392 int offset = mem.offset();
4393
4394 if (!is_int16(offset)) {
4395 LoadIntLiteral(scratch, offset);
4396 stbx(src, MemOperand(base, scratch));
4397 } else {
4398 stb(src, mem);
4399 }
4400}
4401
4402
4403void MacroAssembler::LoadRepresentation(Register dst, const MemOperand& mem,
4404 Representation r, Register scratch) {
4405 DCHECK(!r.IsDouble());
4406 if (r.IsInteger8()) {
4407 LoadByte(dst, mem, scratch);
4408 extsb(dst, dst);
4409 } else if (r.IsUInteger8()) {
4410 LoadByte(dst, mem, scratch);
4411 } else if (r.IsInteger16()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004412 LoadHalfWordArith(dst, mem, scratch);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004413 } else if (r.IsUInteger16()) {
4414 LoadHalfWord(dst, mem, scratch);
4415#if V8_TARGET_ARCH_PPC64
4416 } else if (r.IsInteger32()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004417 LoadWordArith(dst, mem, scratch);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004418#endif
4419 } else {
4420 LoadP(dst, mem, scratch);
4421 }
4422}
4423
4424
4425void MacroAssembler::StoreRepresentation(Register src, const MemOperand& mem,
4426 Representation r, Register scratch) {
4427 DCHECK(!r.IsDouble());
4428 if (r.IsInteger8() || r.IsUInteger8()) {
4429 StoreByte(src, mem, scratch);
4430 } else if (r.IsInteger16() || r.IsUInteger16()) {
4431 StoreHalfWord(src, mem, scratch);
4432#if V8_TARGET_ARCH_PPC64
4433 } else if (r.IsInteger32()) {
4434 StoreWord(src, mem, scratch);
4435#endif
4436 } else {
4437 if (r.IsHeapObject()) {
4438 AssertNotSmi(src);
4439 } else if (r.IsSmi()) {
4440 AssertSmi(src);
4441 }
4442 StoreP(src, mem, scratch);
4443 }
4444}
4445
4446
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004447void MacroAssembler::LoadDouble(DoubleRegister dst, const MemOperand& mem,
4448 Register scratch) {
4449 Register base = mem.ra();
4450 int offset = mem.offset();
4451
4452 if (!is_int16(offset)) {
4453 mov(scratch, Operand(offset));
4454 lfdx(dst, MemOperand(base, scratch));
4455 } else {
4456 lfd(dst, mem);
4457 }
4458}
4459
4460
4461void MacroAssembler::StoreDouble(DoubleRegister src, const MemOperand& mem,
4462 Register scratch) {
4463 Register base = mem.ra();
4464 int offset = mem.offset();
4465
4466 if (!is_int16(offset)) {
4467 mov(scratch, Operand(offset));
4468 stfdx(src, MemOperand(base, scratch));
4469 } else {
4470 stfd(src, mem);
4471 }
4472}
4473
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004474void MacroAssembler::TestJSArrayForAllocationMemento(Register receiver_reg,
4475 Register scratch_reg,
Ben Murdochda12d292016-06-02 14:46:10 +01004476 Register scratch2_reg,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004477 Label* no_memento_found) {
Ben Murdochda12d292016-06-02 14:46:10 +01004478 Label map_check;
4479 Label top_check;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004480 ExternalReference new_space_allocation_top =
4481 ExternalReference::new_space_allocation_top_address(isolate());
Ben Murdochda12d292016-06-02 14:46:10 +01004482 const int kMementoMapOffset = JSArray::kSize - kHeapObjectTag;
4483 const int kMementoEndOffset = kMementoMapOffset + AllocationMemento::kSize;
4484 Register mask = scratch2_reg;
4485
4486 DCHECK(!AreAliased(receiver_reg, scratch_reg, mask));
4487
4488 // Bail out if the object is not in new space.
4489 JumpIfNotInNewSpace(receiver_reg, scratch_reg, no_memento_found);
4490
4491 DCHECK((~Page::kPageAlignmentMask & 0xffff) == 0);
4492 lis(mask, Operand((~Page::kPageAlignmentMask >> 16)));
4493 addi(scratch_reg, receiver_reg, Operand(kMementoEndOffset));
4494
4495 // If the object is in new space, we need to check whether it is on the same
4496 // page as the current top.
4497 Xor(r0, scratch_reg, Operand(new_space_allocation_top));
4498 and_(r0, r0, mask, SetRC);
4499 beq(&top_check, cr0);
4500 // The object is on a different page than allocation top. Bail out if the
4501 // object sits on the page boundary as no memento can follow and we cannot
4502 // touch the memory following it.
4503 xor_(r0, scratch_reg, receiver_reg);
4504 and_(r0, r0, mask, SetRC);
4505 bne(no_memento_found, cr0);
4506 // Continue with the actual map check.
4507 b(&map_check);
4508 // If top is on the same page as the current object, we need to check whether
4509 // we are below top.
4510 bind(&top_check);
4511 Cmpi(scratch_reg, Operand(new_space_allocation_top), r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004512 bgt(no_memento_found);
Ben Murdochda12d292016-06-02 14:46:10 +01004513 // Memento map check.
4514 bind(&map_check);
4515 LoadP(scratch_reg, MemOperand(receiver_reg, kMementoMapOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004516 Cmpi(scratch_reg, Operand(isolate()->factory()->allocation_memento_map()),
4517 r0);
4518}
4519
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004520Register GetRegisterThatIsNotOneOf(Register reg1, Register reg2, Register reg3,
4521 Register reg4, Register reg5,
4522 Register reg6) {
4523 RegList regs = 0;
4524 if (reg1.is_valid()) regs |= reg1.bit();
4525 if (reg2.is_valid()) regs |= reg2.bit();
4526 if (reg3.is_valid()) regs |= reg3.bit();
4527 if (reg4.is_valid()) regs |= reg4.bit();
4528 if (reg5.is_valid()) regs |= reg5.bit();
4529 if (reg6.is_valid()) regs |= reg6.bit();
4530
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004531 const RegisterConfiguration* config =
4532 RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT);
4533 for (int i = 0; i < config->num_allocatable_general_registers(); ++i) {
4534 int code = config->GetAllocatableGeneralCode(i);
4535 Register candidate = Register::from_code(code);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004536 if (regs & candidate.bit()) continue;
4537 return candidate;
4538 }
4539 UNREACHABLE();
4540 return no_reg;
4541}
4542
4543
4544void MacroAssembler::JumpIfDictionaryInPrototypeChain(Register object,
4545 Register scratch0,
4546 Register scratch1,
4547 Label* found) {
4548 DCHECK(!scratch1.is(scratch0));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004549 Register current = scratch0;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004550 Label loop_again, end;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004551
4552 // scratch contained elements pointer.
4553 mr(current, object);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004554 LoadP(current, FieldMemOperand(current, HeapObject::kMapOffset));
4555 LoadP(current, FieldMemOperand(current, Map::kPrototypeOffset));
4556 CompareRoot(current, Heap::kNullValueRootIndex);
4557 beq(&end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004558
4559 // Loop based on the map going up the prototype chain.
4560 bind(&loop_again);
4561 LoadP(current, FieldMemOperand(current, HeapObject::kMapOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004562
4563 STATIC_ASSERT(JS_PROXY_TYPE < JS_OBJECT_TYPE);
4564 STATIC_ASSERT(JS_VALUE_TYPE < JS_OBJECT_TYPE);
4565 lbz(scratch1, FieldMemOperand(current, Map::kInstanceTypeOffset));
4566 cmpi(scratch1, Operand(JS_OBJECT_TYPE));
4567 blt(found);
4568
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004569 lbz(scratch1, FieldMemOperand(current, Map::kBitField2Offset));
4570 DecodeField<Map::ElementsKindBits>(scratch1);
4571 cmpi(scratch1, Operand(DICTIONARY_ELEMENTS));
4572 beq(found);
4573 LoadP(current, FieldMemOperand(current, Map::kPrototypeOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004574 CompareRoot(current, Heap::kNullValueRootIndex);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004575 bne(&loop_again);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004576
4577 bind(&end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004578}
4579
4580
4581#ifdef DEBUG
4582bool AreAliased(Register reg1, Register reg2, Register reg3, Register reg4,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004583 Register reg5, Register reg6, Register reg7, Register reg8,
4584 Register reg9, Register reg10) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004585 int n_of_valid_regs = reg1.is_valid() + reg2.is_valid() + reg3.is_valid() +
4586 reg4.is_valid() + reg5.is_valid() + reg6.is_valid() +
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004587 reg7.is_valid() + reg8.is_valid() + reg9.is_valid() +
4588 reg10.is_valid();
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004589
4590 RegList regs = 0;
4591 if (reg1.is_valid()) regs |= reg1.bit();
4592 if (reg2.is_valid()) regs |= reg2.bit();
4593 if (reg3.is_valid()) regs |= reg3.bit();
4594 if (reg4.is_valid()) regs |= reg4.bit();
4595 if (reg5.is_valid()) regs |= reg5.bit();
4596 if (reg6.is_valid()) regs |= reg6.bit();
4597 if (reg7.is_valid()) regs |= reg7.bit();
4598 if (reg8.is_valid()) regs |= reg8.bit();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004599 if (reg9.is_valid()) regs |= reg9.bit();
4600 if (reg10.is_valid()) regs |= reg10.bit();
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004601 int n_of_non_aliasing_regs = NumRegs(regs);
4602
4603 return n_of_valid_regs != n_of_non_aliasing_regs;
4604}
4605#endif
4606
4607
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004608CodePatcher::CodePatcher(Isolate* isolate, byte* address, int instructions,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004609 FlushICache flush_cache)
4610 : address_(address),
4611 size_(instructions * Assembler::kInstrSize),
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004612 masm_(isolate, address, size_ + Assembler::kGap, CodeObjectRequired::kNo),
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004613 flush_cache_(flush_cache) {
4614 // Create a new macro assembler pointing to the address of the code to patch.
4615 // The size is adjusted with kGap on order for the assembler to generate size
4616 // bytes of instructions without failing with buffer size constraints.
4617 DCHECK(masm_.reloc_info_writer.pos() == address_ + size_ + Assembler::kGap);
4618}
4619
4620
4621CodePatcher::~CodePatcher() {
4622 // Indicate that code has changed.
4623 if (flush_cache_ == FLUSH) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004624 Assembler::FlushICache(masm_.isolate(), address_, size_);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004625 }
4626
4627 // Check that the code was patched as expected.
4628 DCHECK(masm_.pc_ == address_ + size_);
4629 DCHECK(masm_.reloc_info_writer.pos() == address_ + size_ + Assembler::kGap);
4630}
4631
4632
4633void CodePatcher::Emit(Instr instr) { masm()->emit(instr); }
4634
4635
4636void CodePatcher::EmitCondition(Condition cond) {
4637 Instr instr = Assembler::instr_at(masm_.pc_);
4638 switch (cond) {
4639 case eq:
4640 instr = (instr & ~kCondMask) | BT;
4641 break;
4642 case ne:
4643 instr = (instr & ~kCondMask) | BF;
4644 break;
4645 default:
4646 UNIMPLEMENTED();
4647 }
4648 masm_.emit(instr);
4649}
4650
4651
4652void MacroAssembler::TruncatingDiv(Register result, Register dividend,
4653 int32_t divisor) {
4654 DCHECK(!dividend.is(result));
4655 DCHECK(!dividend.is(r0));
4656 DCHECK(!result.is(r0));
4657 base::MagicNumbersForDivision<uint32_t> mag =
4658 base::SignedDivisionByConstant(static_cast<uint32_t>(divisor));
4659 mov(r0, Operand(mag.multiplier));
4660 mulhw(result, dividend, r0);
4661 bool neg = (mag.multiplier & (static_cast<uint32_t>(1) << 31)) != 0;
4662 if (divisor > 0 && neg) {
4663 add(result, result, dividend);
4664 }
4665 if (divisor < 0 && !neg && mag.multiplier > 0) {
4666 sub(result, result, dividend);
4667 }
4668 if (mag.shift > 0) srawi(result, result, mag.shift);
4669 ExtractBit(r0, dividend, 31);
4670 add(result, result, r0);
4671}
4672
4673} // namespace internal
4674} // namespace v8
4675
4676#endif // V8_TARGET_ARCH_PPC