blob: 0f5f3a77681335055f74a9dab3e2684025134956 [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);
Ben Murdochc5610432016-08-08 18:44:38 +01001793 DCHECK((flags & ALLOCATION_FOLDED) == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001794 if (!FLAG_inline_new) {
1795 if (emit_debug_code()) {
1796 // Trash the registers to simulate an allocation failure.
1797 li(result, Operand(0x7091));
1798 li(scratch1, Operand(0x7191));
1799 li(scratch2, Operand(0x7291));
1800 }
1801 b(gc_required);
1802 return;
1803 }
1804
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001805 DCHECK(!AreAliased(result, scratch1, scratch2, ip));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001806
1807 // Make object size into bytes.
1808 if ((flags & SIZE_IN_WORDS) != 0) {
1809 object_size *= kPointerSize;
1810 }
1811 DCHECK_EQ(0, static_cast<int>(object_size & kObjectAlignmentMask));
1812
1813 // Check relative positions of allocation top and limit addresses.
1814 ExternalReference allocation_top =
1815 AllocationUtils::GetAllocationTopReference(isolate(), flags);
1816 ExternalReference allocation_limit =
1817 AllocationUtils::GetAllocationLimitReference(isolate(), flags);
1818
1819 intptr_t top = reinterpret_cast<intptr_t>(allocation_top.address());
1820 intptr_t limit = reinterpret_cast<intptr_t>(allocation_limit.address());
1821 DCHECK((limit - top) == kPointerSize);
1822
1823 // Set up allocation top address register.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001824 Register top_address = scratch1;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001825 // This code stores a temporary value in ip. This is OK, as the code below
1826 // does not need ip for implicit literal generation.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001827 Register alloc_limit = ip;
1828 Register result_end = scratch2;
1829 mov(top_address, Operand(allocation_top));
1830
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001831 if ((flags & RESULT_CONTAINS_TOP) == 0) {
1832 // Load allocation top into result and allocation limit into ip.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001833 LoadP(result, MemOperand(top_address));
1834 LoadP(alloc_limit, MemOperand(top_address, kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001835 } else {
1836 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001837 // Assert that result actually contains top on entry.
1838 LoadP(alloc_limit, MemOperand(top_address));
1839 cmp(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001840 Check(eq, kUnexpectedAllocationTop);
1841 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001842 // Load allocation limit. Result already contains allocation top.
1843 LoadP(alloc_limit, MemOperand(top_address, limit - top));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001844 }
1845
1846 if ((flags & DOUBLE_ALIGNMENT) != 0) {
1847 // Align the next allocation. Storing the filler map without checking top is
1848 // safe in new-space because the limit of the heap is aligned there.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001849#if V8_TARGET_ARCH_PPC64
1850 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
1851#else
1852 STATIC_ASSERT(kPointerAlignment * 2 == kDoubleAlignment);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001853 andi(result_end, result, Operand(kDoubleAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001854 Label aligned;
1855 beq(&aligned, cr0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001856 if ((flags & PRETENURE) != 0) {
1857 cmpl(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001858 bge(gc_required);
1859 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001860 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
1861 stw(result_end, MemOperand(result));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001862 addi(result, result, Operand(kDoubleSize / 2));
1863 bind(&aligned);
1864#endif
1865 }
1866
1867 // Calculate new top and bail out if new space is exhausted. Use result
1868 // to calculate the new top.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001869 sub(r0, alloc_limit, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001870 if (is_int16(object_size)) {
1871 cmpi(r0, Operand(object_size));
1872 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001873 addi(result_end, result, Operand(object_size));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001874 } else {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001875 Cmpi(r0, Operand(object_size), result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001876 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001877 add(result_end, result, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001878 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001879
Ben Murdochc5610432016-08-08 18:44:38 +01001880 if ((flags & ALLOCATION_FOLDING_DOMINATOR) == 0) {
1881 // The top pointer is not updated for allocation folding dominators.
1882 StoreP(result_end, MemOperand(top_address));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001883 }
Ben Murdochc5610432016-08-08 18:44:38 +01001884
1885 // Tag object.
1886 addi(result, result, Operand(kHeapObjectTag));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001887}
1888
1889
1890void MacroAssembler::Allocate(Register object_size, Register result,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001891 Register result_end, Register scratch,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001892 Label* gc_required, AllocationFlags flags) {
Ben Murdochc5610432016-08-08 18:44:38 +01001893 DCHECK((flags & ALLOCATION_FOLDED) == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001894 if (!FLAG_inline_new) {
1895 if (emit_debug_code()) {
1896 // Trash the registers to simulate an allocation failure.
1897 li(result, Operand(0x7091));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001898 li(scratch, Operand(0x7191));
1899 li(result_end, Operand(0x7291));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001900 }
1901 b(gc_required);
1902 return;
1903 }
1904
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001905 // |object_size| and |result_end| may overlap if the DOUBLE_ALIGNMENT flag
1906 // is not specified. Other registers must not overlap.
1907 DCHECK(!AreAliased(object_size, result, scratch, ip));
1908 DCHECK(!AreAliased(result_end, result, scratch, ip));
1909 DCHECK((flags & DOUBLE_ALIGNMENT) == 0 || !object_size.is(result_end));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001910
1911 // Check relative positions of allocation top and limit addresses.
1912 ExternalReference allocation_top =
1913 AllocationUtils::GetAllocationTopReference(isolate(), flags);
1914 ExternalReference allocation_limit =
1915 AllocationUtils::GetAllocationLimitReference(isolate(), flags);
1916 intptr_t top = reinterpret_cast<intptr_t>(allocation_top.address());
1917 intptr_t limit = reinterpret_cast<intptr_t>(allocation_limit.address());
1918 DCHECK((limit - top) == kPointerSize);
1919
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001920 // Set up allocation top address and allocation limit registers.
1921 Register top_address = scratch;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001922 // This code stores a temporary value in ip. This is OK, as the code below
1923 // does not need ip for implicit literal generation.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001924 Register alloc_limit = ip;
1925 mov(top_address, Operand(allocation_top));
1926
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001927 if ((flags & RESULT_CONTAINS_TOP) == 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001928 // Load allocation top into result and allocation limit into alloc_limit..
1929 LoadP(result, MemOperand(top_address));
1930 LoadP(alloc_limit, MemOperand(top_address, kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001931 } else {
1932 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001933 // Assert that result actually contains top on entry.
1934 LoadP(alloc_limit, MemOperand(top_address));
1935 cmp(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001936 Check(eq, kUnexpectedAllocationTop);
1937 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001938 // Load allocation limit. Result already contains allocation top.
1939 LoadP(alloc_limit, MemOperand(top_address, limit - top));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001940 }
1941
1942 if ((flags & DOUBLE_ALIGNMENT) != 0) {
1943 // Align the next allocation. Storing the filler map without checking top is
1944 // safe in new-space because the limit of the heap is aligned there.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001945#if V8_TARGET_ARCH_PPC64
1946 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
1947#else
1948 STATIC_ASSERT(kPointerAlignment * 2 == kDoubleAlignment);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001949 andi(result_end, result, Operand(kDoubleAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001950 Label aligned;
1951 beq(&aligned, cr0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001952 if ((flags & PRETENURE) != 0) {
1953 cmpl(result, alloc_limit);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001954 bge(gc_required);
1955 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001956 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
1957 stw(result_end, MemOperand(result));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001958 addi(result, result, Operand(kDoubleSize / 2));
1959 bind(&aligned);
1960#endif
1961 }
1962
1963 // Calculate new top and bail out if new space is exhausted. Use result
1964 // to calculate the new top. Object size may be in words so a shift is
1965 // required to get the number of bytes.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001966 sub(r0, alloc_limit, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001967 if ((flags & SIZE_IN_WORDS) != 0) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001968 ShiftLeftImm(result_end, object_size, Operand(kPointerSizeLog2));
1969 cmp(r0, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001970 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001971 add(result_end, result, result_end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001972 } else {
1973 cmp(r0, object_size);
1974 blt(gc_required);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001975 add(result_end, result, object_size);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001976 }
1977
1978 // Update allocation top. result temporarily holds the new top.
1979 if (emit_debug_code()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00001980 andi(r0, result_end, Operand(kObjectAlignmentMask));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04001981 Check(eq, kUnalignedAllocationInNewSpace, cr0);
1982 }
Ben Murdochc5610432016-08-08 18:44:38 +01001983 if ((flags & ALLOCATION_FOLDING_DOMINATOR) == 0) {
1984 // The top pointer is not updated for allocation folding dominators.
1985 StoreP(result_end, MemOperand(top_address));
1986 }
1987
1988 // Tag object.
1989 addi(result, result, Operand(kHeapObjectTag));
1990}
1991
1992void MacroAssembler::FastAllocate(Register object_size, Register result,
1993 Register result_end, Register scratch,
1994 AllocationFlags flags) {
1995 // |object_size| and |result_end| may overlap if the DOUBLE_ALIGNMENT flag
1996 // is not specified. Other registers must not overlap.
1997 DCHECK(!AreAliased(object_size, result, scratch, ip));
1998 DCHECK(!AreAliased(result_end, result, scratch, ip));
1999 DCHECK((flags & DOUBLE_ALIGNMENT) == 0 || !object_size.is(result_end));
2000
2001 ExternalReference allocation_top =
2002 AllocationUtils::GetAllocationTopReference(isolate(), flags);
2003
2004 Register top_address = scratch;
2005 mov(top_address, Operand(allocation_top));
2006 LoadP(result, MemOperand(top_address));
2007
2008 if ((flags & DOUBLE_ALIGNMENT) != 0) {
2009 // Align the next allocation. Storing the filler map without checking top is
2010 // safe in new-space because the limit of the heap is aligned there.
2011#if V8_TARGET_ARCH_PPC64
2012 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
2013#else
2014 DCHECK(kPointerAlignment * 2 == kDoubleAlignment);
2015 andi(result_end, result, Operand(kDoubleAlignmentMask));
2016 Label aligned;
2017 beq(&aligned);
2018 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
2019 stw(result_end, MemOperand(result));
2020 addi(result, result, Operand(kDoubleSize / 2));
2021 bind(&aligned);
2022#endif
2023 }
2024
2025 // Calculate new top using result. Object size may be in words so a shift is
2026 // required to get the number of bytes.
2027 if ((flags & SIZE_IN_WORDS) != 0) {
2028 ShiftLeftImm(result_end, object_size, Operand(kPointerSizeLog2));
2029 add(result_end, result, result_end);
2030 } else {
2031 add(result_end, result, object_size);
2032 }
2033
2034 // Update allocation top. result temporarily holds the new top.
2035 if (emit_debug_code()) {
2036 andi(r0, result_end, Operand(kObjectAlignmentMask));
2037 Check(eq, kUnalignedAllocationInNewSpace, cr0);
2038 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002039 StoreP(result_end, MemOperand(top_address));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002040
Ben Murdochc5610432016-08-08 18:44:38 +01002041 // Tag object.
2042 addi(result, result, Operand(kHeapObjectTag));
2043}
2044
2045void MacroAssembler::FastAllocate(int object_size, Register result,
2046 Register scratch1, Register scratch2,
2047 AllocationFlags flags) {
2048 DCHECK(object_size <= Page::kMaxRegularHeapObjectSize);
2049 DCHECK(!AreAliased(result, scratch1, scratch2, ip));
2050
2051 // Make object size into bytes.
2052 if ((flags & SIZE_IN_WORDS) != 0) {
2053 object_size *= kPointerSize;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002054 }
Ben Murdochc5610432016-08-08 18:44:38 +01002055 DCHECK_EQ(0, object_size & kObjectAlignmentMask);
2056
2057 ExternalReference allocation_top =
2058 AllocationUtils::GetAllocationTopReference(isolate(), flags);
2059
2060 // Set up allocation top address register.
2061 Register top_address = scratch1;
2062 Register result_end = scratch2;
2063 mov(top_address, Operand(allocation_top));
2064 LoadP(result, MemOperand(top_address));
2065
2066 if ((flags & DOUBLE_ALIGNMENT) != 0) {
2067 // Align the next allocation. Storing the filler map without checking top is
2068 // safe in new-space because the limit of the heap is aligned there.
2069#if V8_TARGET_ARCH_PPC64
2070 STATIC_ASSERT(kPointerAlignment == kDoubleAlignment);
2071#else
2072 DCHECK(kPointerAlignment * 2 == kDoubleAlignment);
2073 andi(result_end, result, Operand(kDoubleAlignmentMask));
2074 Label aligned;
2075 beq(&aligned);
2076 mov(result_end, Operand(isolate()->factory()->one_pointer_filler_map()));
2077 stw(result_end, MemOperand(result));
2078 addi(result, result, Operand(kDoubleSize / 2));
2079 bind(&aligned);
2080#endif
2081 }
2082
2083 // Calculate new top using result.
2084 Add(result_end, result, object_size, r0);
2085
2086 // The top pointer is not updated for allocation folding dominators.
2087 StoreP(result_end, MemOperand(top_address));
2088
2089 // Tag object.
2090 addi(result, result, Operand(kHeapObjectTag));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002091}
2092
2093
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002094void MacroAssembler::AllocateTwoByteString(Register result, Register length,
2095 Register scratch1, Register scratch2,
2096 Register scratch3,
2097 Label* gc_required) {
2098 // Calculate the number of bytes needed for the characters in the string while
2099 // observing object alignment.
2100 DCHECK((SeqTwoByteString::kHeaderSize & kObjectAlignmentMask) == 0);
2101 slwi(scratch1, length, Operand(1)); // Length in bytes, not chars.
2102 addi(scratch1, scratch1,
2103 Operand(kObjectAlignmentMask + SeqTwoByteString::kHeaderSize));
2104 mov(r0, Operand(~kObjectAlignmentMask));
2105 and_(scratch1, scratch1, r0);
2106
2107 // Allocate two-byte string in new space.
Ben Murdochc5610432016-08-08 18:44:38 +01002108 Allocate(scratch1, result, scratch2, scratch3, gc_required,
2109 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002110
2111 // Set the map, length and hash field.
2112 InitializeNewString(result, length, Heap::kStringMapRootIndex, scratch1,
2113 scratch2);
2114}
2115
2116
2117void MacroAssembler::AllocateOneByteString(Register result, Register length,
2118 Register scratch1, Register scratch2,
2119 Register scratch3,
2120 Label* gc_required) {
2121 // Calculate the number of bytes needed for the characters in the string while
2122 // observing object alignment.
2123 DCHECK((SeqOneByteString::kHeaderSize & kObjectAlignmentMask) == 0);
2124 DCHECK(kCharSize == 1);
2125 addi(scratch1, length,
2126 Operand(kObjectAlignmentMask + SeqOneByteString::kHeaderSize));
2127 li(r0, Operand(~kObjectAlignmentMask));
2128 and_(scratch1, scratch1, r0);
2129
2130 // Allocate one-byte string in new space.
Ben Murdochc5610432016-08-08 18:44:38 +01002131 Allocate(scratch1, result, scratch2, scratch3, gc_required,
2132 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002133
2134 // Set the map, length and hash field.
2135 InitializeNewString(result, length, Heap::kOneByteStringMapRootIndex,
2136 scratch1, scratch2);
2137}
2138
2139
2140void MacroAssembler::AllocateTwoByteConsString(Register result, Register length,
2141 Register scratch1,
2142 Register scratch2,
2143 Label* gc_required) {
2144 Allocate(ConsString::kSize, result, scratch1, scratch2, gc_required,
Ben Murdochc5610432016-08-08 18:44:38 +01002145 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002146
2147 InitializeNewString(result, length, Heap::kConsStringMapRootIndex, scratch1,
2148 scratch2);
2149}
2150
2151
2152void MacroAssembler::AllocateOneByteConsString(Register result, Register length,
2153 Register scratch1,
2154 Register scratch2,
2155 Label* gc_required) {
2156 Allocate(ConsString::kSize, result, scratch1, scratch2, gc_required,
Ben Murdochc5610432016-08-08 18:44:38 +01002157 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002158
2159 InitializeNewString(result, length, Heap::kConsOneByteStringMapRootIndex,
2160 scratch1, scratch2);
2161}
2162
2163
2164void MacroAssembler::AllocateTwoByteSlicedString(Register result,
2165 Register length,
2166 Register scratch1,
2167 Register scratch2,
2168 Label* gc_required) {
2169 Allocate(SlicedString::kSize, result, scratch1, scratch2, gc_required,
Ben Murdochc5610432016-08-08 18:44:38 +01002170 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002171
2172 InitializeNewString(result, length, Heap::kSlicedStringMapRootIndex, scratch1,
2173 scratch2);
2174}
2175
2176
2177void MacroAssembler::AllocateOneByteSlicedString(Register result,
2178 Register length,
2179 Register scratch1,
2180 Register scratch2,
2181 Label* gc_required) {
2182 Allocate(SlicedString::kSize, result, scratch1, scratch2, gc_required,
Ben Murdochc5610432016-08-08 18:44:38 +01002183 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002184
2185 InitializeNewString(result, length, Heap::kSlicedOneByteStringMapRootIndex,
2186 scratch1, scratch2);
2187}
2188
2189
2190void MacroAssembler::CompareObjectType(Register object, Register map,
2191 Register type_reg, InstanceType type) {
2192 const Register temp = type_reg.is(no_reg) ? r0 : type_reg;
2193
2194 LoadP(map, FieldMemOperand(object, HeapObject::kMapOffset));
2195 CompareInstanceType(map, temp, type);
2196}
2197
2198
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002199void MacroAssembler::CompareInstanceType(Register map, Register type_reg,
2200 InstanceType type) {
2201 STATIC_ASSERT(Map::kInstanceTypeOffset < 4096);
2202 STATIC_ASSERT(LAST_TYPE < 256);
2203 lbz(type_reg, FieldMemOperand(map, Map::kInstanceTypeOffset));
2204 cmpi(type_reg, Operand(type));
2205}
2206
2207
2208void MacroAssembler::CompareRoot(Register obj, Heap::RootListIndex index) {
2209 DCHECK(!obj.is(r0));
2210 LoadRoot(r0, index);
2211 cmp(obj, r0);
2212}
2213
2214
2215void MacroAssembler::CheckFastElements(Register map, Register scratch,
2216 Label* fail) {
2217 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2218 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2219 STATIC_ASSERT(FAST_ELEMENTS == 2);
2220 STATIC_ASSERT(FAST_HOLEY_ELEMENTS == 3);
2221 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2222 STATIC_ASSERT(Map::kMaximumBitField2FastHoleyElementValue < 0x8000);
2223 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleyElementValue));
2224 bgt(fail);
2225}
2226
2227
2228void MacroAssembler::CheckFastObjectElements(Register map, Register scratch,
2229 Label* fail) {
2230 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2231 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2232 STATIC_ASSERT(FAST_ELEMENTS == 2);
2233 STATIC_ASSERT(FAST_HOLEY_ELEMENTS == 3);
2234 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2235 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleySmiElementValue));
2236 ble(fail);
2237 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleyElementValue));
2238 bgt(fail);
2239}
2240
2241
2242void MacroAssembler::CheckFastSmiElements(Register map, Register scratch,
2243 Label* fail) {
2244 STATIC_ASSERT(FAST_SMI_ELEMENTS == 0);
2245 STATIC_ASSERT(FAST_HOLEY_SMI_ELEMENTS == 1);
2246 lbz(scratch, FieldMemOperand(map, Map::kBitField2Offset));
2247 cmpli(scratch, Operand(Map::kMaximumBitField2FastHoleySmiElementValue));
2248 bgt(fail);
2249}
2250
2251
2252void MacroAssembler::StoreNumberToDoubleElements(
2253 Register value_reg, Register key_reg, Register elements_reg,
2254 Register scratch1, DoubleRegister double_scratch, Label* fail,
2255 int elements_offset) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002256 DCHECK(!AreAliased(value_reg, key_reg, elements_reg, scratch1));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002257 Label smi_value, store;
2258
2259 // Handle smi values specially.
2260 JumpIfSmi(value_reg, &smi_value);
2261
2262 // Ensure that the object is a heap number
2263 CheckMap(value_reg, scratch1, isolate()->factory()->heap_number_map(), fail,
2264 DONT_DO_SMI_CHECK);
2265
2266 lfd(double_scratch, FieldMemOperand(value_reg, HeapNumber::kValueOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002267 // Double value, turn potential sNaN into qNaN.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002268 CanonicalizeNaN(double_scratch);
2269 b(&store);
2270
2271 bind(&smi_value);
2272 SmiToDouble(double_scratch, value_reg);
2273
2274 bind(&store);
2275 SmiToDoubleArrayOffset(scratch1, key_reg);
2276 add(scratch1, elements_reg, scratch1);
2277 stfd(double_scratch, FieldMemOperand(scratch1, FixedDoubleArray::kHeaderSize -
2278 elements_offset));
2279}
2280
2281
2282void MacroAssembler::AddAndCheckForOverflow(Register dst, Register left,
2283 Register right,
2284 Register overflow_dst,
2285 Register scratch) {
2286 DCHECK(!dst.is(overflow_dst));
2287 DCHECK(!dst.is(scratch));
2288 DCHECK(!overflow_dst.is(scratch));
2289 DCHECK(!overflow_dst.is(left));
2290 DCHECK(!overflow_dst.is(right));
2291
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002292 bool left_is_right = left.is(right);
2293 RCBit xorRC = left_is_right ? SetRC : LeaveRC;
2294
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002295 // C = A+B; C overflows if A/B have same sign and C has diff sign than A
2296 if (dst.is(left)) {
2297 mr(scratch, left); // Preserve left.
2298 add(dst, left, right); // Left is overwritten.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002299 xor_(overflow_dst, dst, scratch, xorRC); // Original left.
2300 if (!left_is_right) xor_(scratch, dst, right);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002301 } else if (dst.is(right)) {
2302 mr(scratch, right); // Preserve right.
2303 add(dst, left, right); // Right is overwritten.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002304 xor_(overflow_dst, dst, left, xorRC);
2305 if (!left_is_right) xor_(scratch, dst, scratch); // Original right.
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002306 } else {
2307 add(dst, left, right);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002308 xor_(overflow_dst, dst, left, xorRC);
2309 if (!left_is_right) xor_(scratch, dst, right);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002310 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002311 if (!left_is_right) and_(overflow_dst, scratch, overflow_dst, SetRC);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002312}
2313
2314
2315void MacroAssembler::AddAndCheckForOverflow(Register dst, Register left,
2316 intptr_t right,
2317 Register overflow_dst,
2318 Register scratch) {
2319 Register original_left = left;
2320 DCHECK(!dst.is(overflow_dst));
2321 DCHECK(!dst.is(scratch));
2322 DCHECK(!overflow_dst.is(scratch));
2323 DCHECK(!overflow_dst.is(left));
2324
2325 // C = A+B; C overflows if A/B have same sign and C has diff sign than A
2326 if (dst.is(left)) {
2327 // Preserve left.
2328 original_left = overflow_dst;
2329 mr(original_left, left);
2330 }
2331 Add(dst, left, right, scratch);
2332 xor_(overflow_dst, dst, original_left);
2333 if (right >= 0) {
2334 and_(overflow_dst, overflow_dst, dst, SetRC);
2335 } else {
2336 andc(overflow_dst, overflow_dst, dst, SetRC);
2337 }
2338}
2339
2340
2341void MacroAssembler::SubAndCheckForOverflow(Register dst, Register left,
2342 Register right,
2343 Register overflow_dst,
2344 Register scratch) {
2345 DCHECK(!dst.is(overflow_dst));
2346 DCHECK(!dst.is(scratch));
2347 DCHECK(!overflow_dst.is(scratch));
2348 DCHECK(!overflow_dst.is(left));
2349 DCHECK(!overflow_dst.is(right));
2350
2351 // C = A-B; C overflows if A/B have diff signs and C has diff sign than A
2352 if (dst.is(left)) {
2353 mr(scratch, left); // Preserve left.
2354 sub(dst, left, right); // Left is overwritten.
2355 xor_(overflow_dst, dst, scratch);
2356 xor_(scratch, scratch, right);
2357 and_(overflow_dst, overflow_dst, scratch, SetRC);
2358 } else if (dst.is(right)) {
2359 mr(scratch, right); // Preserve right.
2360 sub(dst, left, right); // Right is overwritten.
2361 xor_(overflow_dst, dst, left);
2362 xor_(scratch, left, scratch);
2363 and_(overflow_dst, overflow_dst, scratch, SetRC);
2364 } else {
2365 sub(dst, left, right);
2366 xor_(overflow_dst, dst, left);
2367 xor_(scratch, left, right);
2368 and_(overflow_dst, scratch, overflow_dst, SetRC);
2369 }
2370}
2371
2372
2373void MacroAssembler::CompareMap(Register obj, Register scratch, Handle<Map> map,
2374 Label* early_success) {
2375 LoadP(scratch, FieldMemOperand(obj, HeapObject::kMapOffset));
2376 CompareMap(scratch, map, early_success);
2377}
2378
2379
2380void MacroAssembler::CompareMap(Register obj_map, Handle<Map> map,
2381 Label* early_success) {
2382 mov(r0, Operand(map));
2383 cmp(obj_map, r0);
2384}
2385
2386
2387void MacroAssembler::CheckMap(Register obj, Register scratch, Handle<Map> map,
2388 Label* fail, SmiCheckType smi_check_type) {
2389 if (smi_check_type == DO_SMI_CHECK) {
2390 JumpIfSmi(obj, fail);
2391 }
2392
2393 Label success;
2394 CompareMap(obj, scratch, map, &success);
2395 bne(fail);
2396 bind(&success);
2397}
2398
2399
2400void MacroAssembler::CheckMap(Register obj, Register scratch,
2401 Heap::RootListIndex index, Label* fail,
2402 SmiCheckType smi_check_type) {
2403 if (smi_check_type == DO_SMI_CHECK) {
2404 JumpIfSmi(obj, fail);
2405 }
2406 LoadP(scratch, FieldMemOperand(obj, HeapObject::kMapOffset));
2407 LoadRoot(r0, index);
2408 cmp(scratch, r0);
2409 bne(fail);
2410}
2411
2412
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002413void MacroAssembler::DispatchWeakMap(Register obj, Register scratch1,
2414 Register scratch2, Handle<WeakCell> cell,
2415 Handle<Code> success,
2416 SmiCheckType smi_check_type) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002417 Label fail;
2418 if (smi_check_type == DO_SMI_CHECK) {
2419 JumpIfSmi(obj, &fail);
2420 }
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002421 LoadP(scratch1, FieldMemOperand(obj, HeapObject::kMapOffset));
2422 CmpWeakValue(scratch1, cell, scratch2);
2423 Jump(success, RelocInfo::CODE_TARGET, eq);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002424 bind(&fail);
2425}
2426
2427
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002428void MacroAssembler::CmpWeakValue(Register value, Handle<WeakCell> cell,
2429 Register scratch, CRegister cr) {
2430 mov(scratch, Operand(cell));
2431 LoadP(scratch, FieldMemOperand(scratch, WeakCell::kValueOffset));
2432 cmp(value, scratch, cr);
2433}
2434
2435
2436void MacroAssembler::GetWeakValue(Register value, Handle<WeakCell> cell) {
2437 mov(value, Operand(cell));
2438 LoadP(value, FieldMemOperand(value, WeakCell::kValueOffset));
2439}
2440
2441
2442void MacroAssembler::LoadWeakValue(Register value, Handle<WeakCell> cell,
2443 Label* miss) {
2444 GetWeakValue(value, cell);
2445 JumpIfSmi(value, miss);
2446}
2447
2448
2449void MacroAssembler::GetMapConstructor(Register result, Register map,
2450 Register temp, Register temp2) {
2451 Label done, loop;
2452 LoadP(result, FieldMemOperand(map, Map::kConstructorOrBackPointerOffset));
2453 bind(&loop);
2454 JumpIfSmi(result, &done);
2455 CompareObjectType(result, temp, temp2, MAP_TYPE);
2456 bne(&done);
2457 LoadP(result, FieldMemOperand(result, Map::kConstructorOrBackPointerOffset));
2458 b(&loop);
2459 bind(&done);
2460}
2461
2462
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002463void MacroAssembler::TryGetFunctionPrototype(Register function, Register result,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002464 Register scratch, Label* miss) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002465 // Get the prototype or initial map from the function.
2466 LoadP(result,
2467 FieldMemOperand(function, JSFunction::kPrototypeOrInitialMapOffset));
2468
2469 // If the prototype or initial map is the hole, don't return it and
2470 // simply miss the cache instead. This will allow us to allocate a
2471 // prototype object on-demand in the runtime system.
2472 LoadRoot(r0, Heap::kTheHoleValueRootIndex);
2473 cmp(result, r0);
2474 beq(miss);
2475
2476 // If the function does not have an initial map, we're done.
2477 Label done;
2478 CompareObjectType(result, scratch, scratch, MAP_TYPE);
2479 bne(&done);
2480
2481 // Get the prototype from the initial map.
2482 LoadP(result, FieldMemOperand(result, Map::kPrototypeOffset));
2483
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002484 // All done.
2485 bind(&done);
2486}
2487
2488
2489void MacroAssembler::CallStub(CodeStub* stub, TypeFeedbackId ast_id,
2490 Condition cond) {
2491 DCHECK(AllowThisStubCall(stub)); // Stub calls are not allowed in some stubs.
2492 Call(stub->GetCode(), RelocInfo::CODE_TARGET, ast_id, cond);
2493}
2494
2495
2496void MacroAssembler::TailCallStub(CodeStub* stub, Condition cond) {
2497 Jump(stub->GetCode(), RelocInfo::CODE_TARGET, cond);
2498}
2499
2500
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002501bool MacroAssembler::AllowThisStubCall(CodeStub* stub) {
2502 return has_frame_ || !stub->SometimesSetsUpAFrame();
2503}
2504
2505
2506void MacroAssembler::IndexFromHash(Register hash, Register index) {
2507 // If the hash field contains an array index pick it out. The assert checks
2508 // that the constants for the maximum number of digits for an array index
2509 // cached in the hash field and the number of bits reserved for it does not
2510 // conflict.
2511 DCHECK(TenToThe(String::kMaxCachedArrayIndexLength) <
2512 (1 << String::kArrayIndexValueBits));
2513 DecodeFieldToSmi<String::ArrayIndexValueBits>(index, hash);
2514}
2515
2516
2517void MacroAssembler::SmiToDouble(DoubleRegister value, Register smi) {
2518 SmiUntag(ip, smi);
2519 ConvertIntToDouble(ip, value);
2520}
2521
2522
2523void MacroAssembler::TestDoubleIsInt32(DoubleRegister double_input,
2524 Register scratch1, Register scratch2,
2525 DoubleRegister double_scratch) {
2526 TryDoubleToInt32Exact(scratch1, double_input, scratch2, double_scratch);
2527}
2528
Ben Murdoch097c5b22016-05-18 11:27:45 +01002529void MacroAssembler::TestDoubleIsMinusZero(DoubleRegister input,
2530 Register scratch1,
2531 Register scratch2) {
2532#if V8_TARGET_ARCH_PPC64
2533 MovDoubleToInt64(scratch1, input);
2534 rotldi(scratch1, scratch1, 1);
2535 cmpi(scratch1, Operand(1));
2536#else
2537 MovDoubleToInt64(scratch1, scratch2, input);
2538 Label done;
2539 cmpi(scratch2, Operand::Zero());
2540 bne(&done);
2541 lis(scratch2, Operand(SIGN_EXT_IMM16(0x8000)));
2542 cmp(scratch1, scratch2);
2543 bind(&done);
2544#endif
2545}
2546
2547void MacroAssembler::TestDoubleSign(DoubleRegister input, Register scratch) {
2548#if V8_TARGET_ARCH_PPC64
2549 MovDoubleToInt64(scratch, input);
2550#else
2551 MovDoubleHighToInt(scratch, input);
2552#endif
2553 cmpi(scratch, Operand::Zero());
2554}
2555
2556void MacroAssembler::TestHeapNumberSign(Register input, Register scratch) {
2557#if V8_TARGET_ARCH_PPC64
2558 LoadP(scratch, FieldMemOperand(input, HeapNumber::kValueOffset));
2559#else
2560 lwz(scratch, FieldMemOperand(input, HeapNumber::kExponentOffset));
2561#endif
2562 cmpi(scratch, Operand::Zero());
2563}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002564
2565void MacroAssembler::TryDoubleToInt32Exact(Register result,
2566 DoubleRegister double_input,
2567 Register scratch,
2568 DoubleRegister double_scratch) {
2569 Label done;
2570 DCHECK(!double_input.is(double_scratch));
2571
2572 ConvertDoubleToInt64(double_input,
2573#if !V8_TARGET_ARCH_PPC64
2574 scratch,
2575#endif
2576 result, double_scratch);
2577
2578#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002579 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002580#else
2581 TestIfInt32(scratch, result, r0);
2582#endif
2583 bne(&done);
2584
2585 // convert back and compare
2586 fcfid(double_scratch, double_scratch);
2587 fcmpu(double_scratch, double_input);
2588 bind(&done);
2589}
2590
2591
2592void MacroAssembler::TryInt32Floor(Register result, DoubleRegister double_input,
2593 Register input_high, Register scratch,
2594 DoubleRegister double_scratch, Label* done,
2595 Label* exact) {
2596 DCHECK(!result.is(input_high));
2597 DCHECK(!double_input.is(double_scratch));
2598 Label exception;
2599
2600 MovDoubleHighToInt(input_high, double_input);
2601
2602 // Test for NaN/Inf
2603 ExtractBitMask(result, input_high, HeapNumber::kExponentMask);
2604 cmpli(result, Operand(0x7ff));
2605 beq(&exception);
2606
2607 // Convert (rounding to -Inf)
2608 ConvertDoubleToInt64(double_input,
2609#if !V8_TARGET_ARCH_PPC64
2610 scratch,
2611#endif
2612 result, double_scratch, kRoundToMinusInf);
2613
2614// Test for overflow
2615#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002616 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002617#else
2618 TestIfInt32(scratch, result, r0);
2619#endif
2620 bne(&exception);
2621
2622 // Test for exactness
2623 fcfid(double_scratch, double_scratch);
2624 fcmpu(double_scratch, double_input);
2625 beq(exact);
2626 b(done);
2627
2628 bind(&exception);
2629}
2630
2631
2632void MacroAssembler::TryInlineTruncateDoubleToI(Register result,
2633 DoubleRegister double_input,
2634 Label* done) {
2635 DoubleRegister double_scratch = kScratchDoubleReg;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002636#if !V8_TARGET_ARCH_PPC64
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002637 Register scratch = ip;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002638#endif
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002639
2640 ConvertDoubleToInt64(double_input,
2641#if !V8_TARGET_ARCH_PPC64
2642 scratch,
2643#endif
2644 result, double_scratch);
2645
2646// Test for overflow
2647#if V8_TARGET_ARCH_PPC64
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002648 TestIfInt32(result, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002649#else
2650 TestIfInt32(scratch, result, r0);
2651#endif
2652 beq(done);
2653}
2654
2655
2656void MacroAssembler::TruncateDoubleToI(Register result,
2657 DoubleRegister double_input) {
2658 Label done;
2659
2660 TryInlineTruncateDoubleToI(result, double_input, &done);
2661
2662 // If we fell through then inline version didn't succeed - call stub instead.
2663 mflr(r0);
2664 push(r0);
2665 // Put input on stack.
2666 stfdu(double_input, MemOperand(sp, -kDoubleSize));
2667
2668 DoubleToIStub stub(isolate(), sp, result, 0, true, true);
2669 CallStub(&stub);
2670
2671 addi(sp, sp, Operand(kDoubleSize));
2672 pop(r0);
2673 mtlr(r0);
2674
2675 bind(&done);
2676}
2677
2678
2679void MacroAssembler::TruncateHeapNumberToI(Register result, Register object) {
2680 Label done;
2681 DoubleRegister double_scratch = kScratchDoubleReg;
2682 DCHECK(!result.is(object));
2683
2684 lfd(double_scratch, FieldMemOperand(object, HeapNumber::kValueOffset));
2685 TryInlineTruncateDoubleToI(result, double_scratch, &done);
2686
2687 // If we fell through then inline version didn't succeed - call stub instead.
2688 mflr(r0);
2689 push(r0);
2690 DoubleToIStub stub(isolate(), object, result,
2691 HeapNumber::kValueOffset - kHeapObjectTag, true, true);
2692 CallStub(&stub);
2693 pop(r0);
2694 mtlr(r0);
2695
2696 bind(&done);
2697}
2698
2699
2700void MacroAssembler::TruncateNumberToI(Register object, Register result,
2701 Register heap_number_map,
2702 Register scratch1, Label* not_number) {
2703 Label done;
2704 DCHECK(!result.is(object));
2705
2706 UntagAndJumpIfSmi(result, object, &done);
2707 JumpIfNotHeapNumber(object, heap_number_map, scratch1, not_number);
2708 TruncateHeapNumberToI(result, object);
2709
2710 bind(&done);
2711}
2712
2713
2714void MacroAssembler::GetLeastBitsFromSmi(Register dst, Register src,
2715 int num_least_bits) {
2716#if V8_TARGET_ARCH_PPC64
2717 rldicl(dst, src, kBitsPerPointer - kSmiShift,
2718 kBitsPerPointer - num_least_bits);
2719#else
2720 rlwinm(dst, src, kBitsPerPointer - kSmiShift,
2721 kBitsPerPointer - num_least_bits, 31);
2722#endif
2723}
2724
2725
2726void MacroAssembler::GetLeastBitsFromInt32(Register dst, Register src,
2727 int num_least_bits) {
2728 rlwinm(dst, src, 0, 32 - num_least_bits, 31);
2729}
2730
2731
2732void MacroAssembler::CallRuntime(const Runtime::Function* f, int num_arguments,
2733 SaveFPRegsMode save_doubles) {
2734 // All parameters are on the stack. r3 has the return value after call.
2735
2736 // If the expected number of arguments of the runtime function is
2737 // constant, we check that the actual number of arguments match the
2738 // expectation.
2739 CHECK(f->nargs < 0 || f->nargs == num_arguments);
2740
2741 // TODO(1236192): Most runtime routines don't need the number of
2742 // arguments passed in because it is constant. At some point we
2743 // should remove this need and make the runtime routine entry code
2744 // smarter.
2745 mov(r3, Operand(num_arguments));
2746 mov(r4, Operand(ExternalReference(f, isolate())));
2747 CEntryStub stub(isolate(),
2748#if V8_TARGET_ARCH_PPC64
2749 f->result_size,
2750#else
2751 1,
2752#endif
2753 save_doubles);
2754 CallStub(&stub);
2755}
2756
2757
2758void MacroAssembler::CallExternalReference(const ExternalReference& ext,
2759 int num_arguments) {
2760 mov(r3, Operand(num_arguments));
2761 mov(r4, Operand(ext));
2762
2763 CEntryStub stub(isolate(), 1);
2764 CallStub(&stub);
2765}
2766
2767
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002768void MacroAssembler::TailCallRuntime(Runtime::FunctionId fid) {
2769 const Runtime::Function* function = Runtime::FunctionForId(fid);
2770 DCHECK_EQ(1, function->result_size);
2771 if (function->nargs >= 0) {
2772 mov(r3, Operand(function->nargs));
2773 }
2774 JumpToExternalReference(ExternalReference(fid, isolate()));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002775}
2776
2777
2778void MacroAssembler::JumpToExternalReference(const ExternalReference& builtin) {
2779 mov(r4, Operand(builtin));
2780 CEntryStub stub(isolate(), 1);
2781 Jump(stub.GetCode(), RelocInfo::CODE_TARGET);
2782}
2783
2784
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002785void MacroAssembler::SetCounter(StatsCounter* counter, int value,
2786 Register scratch1, Register scratch2) {
2787 if (FLAG_native_code_counters && counter->Enabled()) {
2788 mov(scratch1, Operand(value));
2789 mov(scratch2, Operand(ExternalReference(counter)));
2790 stw(scratch1, MemOperand(scratch2));
2791 }
2792}
2793
2794
2795void MacroAssembler::IncrementCounter(StatsCounter* counter, int value,
2796 Register scratch1, Register scratch2) {
2797 DCHECK(value > 0);
2798 if (FLAG_native_code_counters && counter->Enabled()) {
2799 mov(scratch2, Operand(ExternalReference(counter)));
2800 lwz(scratch1, MemOperand(scratch2));
2801 addi(scratch1, scratch1, Operand(value));
2802 stw(scratch1, MemOperand(scratch2));
2803 }
2804}
2805
2806
2807void MacroAssembler::DecrementCounter(StatsCounter* counter, int value,
2808 Register scratch1, Register scratch2) {
2809 DCHECK(value > 0);
2810 if (FLAG_native_code_counters && counter->Enabled()) {
2811 mov(scratch2, Operand(ExternalReference(counter)));
2812 lwz(scratch1, MemOperand(scratch2));
2813 subi(scratch1, scratch1, Operand(value));
2814 stw(scratch1, MemOperand(scratch2));
2815 }
2816}
2817
2818
2819void MacroAssembler::Assert(Condition cond, BailoutReason reason,
2820 CRegister cr) {
2821 if (emit_debug_code()) Check(cond, reason, cr);
2822}
2823
2824
2825void MacroAssembler::AssertFastElements(Register elements) {
2826 if (emit_debug_code()) {
2827 DCHECK(!elements.is(r0));
2828 Label ok;
2829 push(elements);
2830 LoadP(elements, FieldMemOperand(elements, HeapObject::kMapOffset));
2831 LoadRoot(r0, Heap::kFixedArrayMapRootIndex);
2832 cmp(elements, r0);
2833 beq(&ok);
2834 LoadRoot(r0, Heap::kFixedDoubleArrayMapRootIndex);
2835 cmp(elements, r0);
2836 beq(&ok);
2837 LoadRoot(r0, Heap::kFixedCOWArrayMapRootIndex);
2838 cmp(elements, r0);
2839 beq(&ok);
2840 Abort(kJSObjectWithFastElementsMapHasSlowElements);
2841 bind(&ok);
2842 pop(elements);
2843 }
2844}
2845
2846
2847void MacroAssembler::Check(Condition cond, BailoutReason reason, CRegister cr) {
2848 Label L;
2849 b(cond, &L, cr);
2850 Abort(reason);
2851 // will not return here
2852 bind(&L);
2853}
2854
2855
2856void MacroAssembler::Abort(BailoutReason reason) {
2857 Label abort_start;
2858 bind(&abort_start);
2859#ifdef DEBUG
2860 const char* msg = GetBailoutReason(reason);
2861 if (msg != NULL) {
2862 RecordComment("Abort message: ");
2863 RecordComment(msg);
2864 }
2865
2866 if (FLAG_trap_on_abort) {
2867 stop(msg);
2868 return;
2869 }
2870#endif
2871
2872 LoadSmiLiteral(r0, Smi::FromInt(reason));
2873 push(r0);
2874 // Disable stub call restrictions to always allow calls to abort.
2875 if (!has_frame_) {
2876 // We don't actually want to generate a pile of code for this, so just
2877 // claim there is a stack frame, without generating one.
2878 FrameScope scope(this, StackFrame::NONE);
Ben Murdoch097c5b22016-05-18 11:27:45 +01002879 CallRuntime(Runtime::kAbort);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002880 } else {
Ben Murdoch097c5b22016-05-18 11:27:45 +01002881 CallRuntime(Runtime::kAbort);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002882 }
2883 // will not return here
2884}
2885
2886
2887void MacroAssembler::LoadContext(Register dst, int context_chain_length) {
2888 if (context_chain_length > 0) {
2889 // Move up the chain of contexts to the context containing the slot.
2890 LoadP(dst, MemOperand(cp, Context::SlotOffset(Context::PREVIOUS_INDEX)));
2891 for (int i = 1; i < context_chain_length; i++) {
2892 LoadP(dst, MemOperand(dst, Context::SlotOffset(Context::PREVIOUS_INDEX)));
2893 }
2894 } else {
2895 // Slot is in the current function context. Move it into the
2896 // destination register in case we store into it (the write barrier
2897 // cannot be allowed to destroy the context in esi).
2898 mr(dst, cp);
2899 }
2900}
2901
2902
2903void MacroAssembler::LoadTransitionedArrayMapConditional(
2904 ElementsKind expected_kind, ElementsKind transitioned_kind,
2905 Register map_in_out, Register scratch, Label* no_map_match) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002906 DCHECK(IsFastElementsKind(expected_kind));
2907 DCHECK(IsFastElementsKind(transitioned_kind));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002908
2909 // Check that the function's map is the same as the expected cached map.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002910 LoadP(scratch, NativeContextMemOperand());
2911 LoadP(ip, ContextMemOperand(scratch, Context::ArrayMapIndex(expected_kind)));
2912 cmp(map_in_out, ip);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002913 bne(no_map_match);
2914
2915 // Use the transitioned cached map.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002916 LoadP(map_in_out,
2917 ContextMemOperand(scratch, Context::ArrayMapIndex(transitioned_kind)));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002918}
2919
2920
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00002921void MacroAssembler::LoadNativeContextSlot(int index, Register dst) {
2922 LoadP(dst, NativeContextMemOperand());
2923 LoadP(dst, ContextMemOperand(dst, index));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002924}
2925
2926
2927void MacroAssembler::LoadGlobalFunctionInitialMap(Register function,
2928 Register map,
2929 Register scratch) {
2930 // Load the initial map. The global functions all have initial maps.
2931 LoadP(map,
2932 FieldMemOperand(function, JSFunction::kPrototypeOrInitialMapOffset));
2933 if (emit_debug_code()) {
2934 Label ok, fail;
2935 CheckMap(map, scratch, Heap::kMetaMapRootIndex, &fail, DO_SMI_CHECK);
2936 b(&ok);
2937 bind(&fail);
2938 Abort(kGlobalFunctionsMustHaveInitialMap);
2939 bind(&ok);
2940 }
2941}
2942
2943
2944void MacroAssembler::JumpIfNotPowerOfTwoOrZero(
2945 Register reg, Register scratch, Label* not_power_of_two_or_zero) {
2946 subi(scratch, reg, Operand(1));
2947 cmpi(scratch, Operand::Zero());
2948 blt(not_power_of_two_or_zero);
2949 and_(r0, scratch, reg, SetRC);
2950 bne(not_power_of_two_or_zero, cr0);
2951}
2952
2953
2954void MacroAssembler::JumpIfNotPowerOfTwoOrZeroAndNeg(Register reg,
2955 Register scratch,
2956 Label* zero_and_neg,
2957 Label* not_power_of_two) {
2958 subi(scratch, reg, Operand(1));
2959 cmpi(scratch, Operand::Zero());
2960 blt(zero_and_neg);
2961 and_(r0, scratch, reg, SetRC);
2962 bne(not_power_of_two, cr0);
2963}
2964
2965#if !V8_TARGET_ARCH_PPC64
2966void MacroAssembler::SmiTagCheckOverflow(Register reg, Register overflow) {
2967 DCHECK(!reg.is(overflow));
2968 mr(overflow, reg); // Save original value.
2969 SmiTag(reg);
2970 xor_(overflow, overflow, reg, SetRC); // Overflow if (value ^ 2 * value) < 0.
2971}
2972
2973
2974void MacroAssembler::SmiTagCheckOverflow(Register dst, Register src,
2975 Register overflow) {
2976 if (dst.is(src)) {
2977 // Fall back to slower case.
2978 SmiTagCheckOverflow(dst, overflow);
2979 } else {
2980 DCHECK(!dst.is(src));
2981 DCHECK(!dst.is(overflow));
2982 DCHECK(!src.is(overflow));
2983 SmiTag(dst, src);
2984 xor_(overflow, dst, src, SetRC); // Overflow if (value ^ 2 * value) < 0.
2985 }
2986}
2987#endif
2988
2989void MacroAssembler::JumpIfNotBothSmi(Register reg1, Register reg2,
2990 Label* on_not_both_smi) {
2991 STATIC_ASSERT(kSmiTag == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04002992 orx(r0, reg1, reg2, LeaveRC);
2993 JumpIfNotSmi(r0, on_not_both_smi);
2994}
2995
2996
2997void MacroAssembler::UntagAndJumpIfSmi(Register dst, Register src,
2998 Label* smi_case) {
2999 STATIC_ASSERT(kSmiTag == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003000 TestBitRange(src, kSmiTagSize - 1, 0, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003001 SmiUntag(dst, src);
3002 beq(smi_case, cr0);
3003}
3004
3005
3006void MacroAssembler::UntagAndJumpIfNotSmi(Register dst, Register src,
3007 Label* non_smi_case) {
3008 STATIC_ASSERT(kSmiTag == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003009 TestBitRange(src, kSmiTagSize - 1, 0, r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003010 SmiUntag(dst, src);
3011 bne(non_smi_case, cr0);
3012}
3013
3014
3015void MacroAssembler::JumpIfEitherSmi(Register reg1, Register reg2,
3016 Label* on_either_smi) {
3017 STATIC_ASSERT(kSmiTag == 0);
3018 JumpIfSmi(reg1, on_either_smi);
3019 JumpIfSmi(reg2, on_either_smi);
3020}
3021
Ben Murdochda12d292016-06-02 14:46:10 +01003022void MacroAssembler::AssertNotNumber(Register object) {
3023 if (emit_debug_code()) {
3024 STATIC_ASSERT(kSmiTag == 0);
3025 TestIfSmi(object, r0);
3026 Check(ne, kOperandIsANumber, cr0);
3027 push(object);
3028 CompareObjectType(object, object, object, HEAP_NUMBER_TYPE);
3029 pop(object);
3030 Check(ne, kOperandIsANumber);
3031 }
3032}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003033
3034void MacroAssembler::AssertNotSmi(Register object) {
3035 if (emit_debug_code()) {
3036 STATIC_ASSERT(kSmiTag == 0);
3037 TestIfSmi(object, r0);
3038 Check(ne, kOperandIsASmi, cr0);
3039 }
3040}
3041
3042
3043void MacroAssembler::AssertSmi(Register object) {
3044 if (emit_debug_code()) {
3045 STATIC_ASSERT(kSmiTag == 0);
3046 TestIfSmi(object, r0);
3047 Check(eq, kOperandIsNotSmi, cr0);
3048 }
3049}
3050
3051
3052void MacroAssembler::AssertString(Register object) {
3053 if (emit_debug_code()) {
3054 STATIC_ASSERT(kSmiTag == 0);
3055 TestIfSmi(object, r0);
3056 Check(ne, kOperandIsASmiAndNotAString, cr0);
3057 push(object);
3058 LoadP(object, FieldMemOperand(object, HeapObject::kMapOffset));
3059 CompareInstanceType(object, object, FIRST_NONSTRING_TYPE);
3060 pop(object);
3061 Check(lt, kOperandIsNotAString);
3062 }
3063}
3064
3065
3066void MacroAssembler::AssertName(Register object) {
3067 if (emit_debug_code()) {
3068 STATIC_ASSERT(kSmiTag == 0);
3069 TestIfSmi(object, r0);
3070 Check(ne, kOperandIsASmiAndNotAName, cr0);
3071 push(object);
3072 LoadP(object, FieldMemOperand(object, HeapObject::kMapOffset));
3073 CompareInstanceType(object, object, LAST_NAME_TYPE);
3074 pop(object);
3075 Check(le, kOperandIsNotAName);
3076 }
3077}
3078
3079
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003080void MacroAssembler::AssertFunction(Register object) {
3081 if (emit_debug_code()) {
3082 STATIC_ASSERT(kSmiTag == 0);
3083 TestIfSmi(object, r0);
3084 Check(ne, kOperandIsASmiAndNotAFunction, cr0);
3085 push(object);
3086 CompareObjectType(object, object, object, JS_FUNCTION_TYPE);
3087 pop(object);
3088 Check(eq, kOperandIsNotAFunction);
3089 }
3090}
3091
3092
3093void MacroAssembler::AssertBoundFunction(Register object) {
3094 if (emit_debug_code()) {
3095 STATIC_ASSERT(kSmiTag == 0);
3096 TestIfSmi(object, r0);
3097 Check(ne, kOperandIsASmiAndNotABoundFunction, cr0);
3098 push(object);
3099 CompareObjectType(object, object, object, JS_BOUND_FUNCTION_TYPE);
3100 pop(object);
3101 Check(eq, kOperandIsNotABoundFunction);
3102 }
3103}
3104
Ben Murdochc5610432016-08-08 18:44:38 +01003105void MacroAssembler::AssertGeneratorObject(Register object) {
3106 if (emit_debug_code()) {
3107 STATIC_ASSERT(kSmiTag == 0);
3108 TestIfSmi(object, r0);
3109 Check(ne, kOperandIsASmiAndNotAGeneratorObject, cr0);
3110 push(object);
3111 CompareObjectType(object, object, object, JS_GENERATOR_OBJECT_TYPE);
3112 pop(object);
3113 Check(eq, kOperandIsNotAGeneratorObject);
3114 }
3115}
3116
Ben Murdoch097c5b22016-05-18 11:27:45 +01003117void MacroAssembler::AssertReceiver(Register object) {
3118 if (emit_debug_code()) {
3119 STATIC_ASSERT(kSmiTag == 0);
3120 TestIfSmi(object, r0);
3121 Check(ne, kOperandIsASmiAndNotAReceiver, cr0);
3122 push(object);
3123 STATIC_ASSERT(LAST_TYPE == LAST_JS_RECEIVER_TYPE);
3124 CompareObjectType(object, object, object, FIRST_JS_RECEIVER_TYPE);
3125 pop(object);
3126 Check(ge, kOperandIsNotAReceiver);
3127 }
3128}
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003129
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003130void MacroAssembler::AssertUndefinedOrAllocationSite(Register object,
3131 Register scratch) {
3132 if (emit_debug_code()) {
3133 Label done_checking;
3134 AssertNotSmi(object);
3135 CompareRoot(object, Heap::kUndefinedValueRootIndex);
3136 beq(&done_checking);
3137 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
3138 CompareRoot(scratch, Heap::kAllocationSiteMapRootIndex);
3139 Assert(eq, kExpectedUndefinedOrCell);
3140 bind(&done_checking);
3141 }
3142}
3143
3144
3145void MacroAssembler::AssertIsRoot(Register reg, Heap::RootListIndex index) {
3146 if (emit_debug_code()) {
3147 CompareRoot(reg, index);
3148 Check(eq, kHeapNumberMapRegisterClobbered);
3149 }
3150}
3151
3152
3153void MacroAssembler::JumpIfNotHeapNumber(Register object,
3154 Register heap_number_map,
3155 Register scratch,
3156 Label* on_not_heap_number) {
3157 LoadP(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
3158 AssertIsRoot(heap_number_map, Heap::kHeapNumberMapRootIndex);
3159 cmp(scratch, heap_number_map);
3160 bne(on_not_heap_number);
3161}
3162
3163
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003164void MacroAssembler::JumpIfNonSmisNotBothSequentialOneByteStrings(
3165 Register first, Register second, Register scratch1, Register scratch2,
3166 Label* failure) {
3167 // Test that both first and second are sequential one-byte strings.
3168 // Assume that they are non-smis.
3169 LoadP(scratch1, FieldMemOperand(first, HeapObject::kMapOffset));
3170 LoadP(scratch2, FieldMemOperand(second, HeapObject::kMapOffset));
3171 lbz(scratch1, FieldMemOperand(scratch1, Map::kInstanceTypeOffset));
3172 lbz(scratch2, FieldMemOperand(scratch2, Map::kInstanceTypeOffset));
3173
3174 JumpIfBothInstanceTypesAreNotSequentialOneByte(scratch1, scratch2, scratch1,
3175 scratch2, failure);
3176}
3177
3178void MacroAssembler::JumpIfNotBothSequentialOneByteStrings(Register first,
3179 Register second,
3180 Register scratch1,
3181 Register scratch2,
3182 Label* failure) {
3183 // Check that neither is a smi.
3184 and_(scratch1, first, second);
3185 JumpIfSmi(scratch1, failure);
3186 JumpIfNonSmisNotBothSequentialOneByteStrings(first, second, scratch1,
3187 scratch2, failure);
3188}
3189
3190
3191void MacroAssembler::JumpIfNotUniqueNameInstanceType(Register reg,
3192 Label* not_unique_name) {
3193 STATIC_ASSERT(kInternalizedTag == 0 && kStringTag == 0);
3194 Label succeed;
3195 andi(r0, reg, Operand(kIsNotStringMask | kIsNotInternalizedMask));
3196 beq(&succeed, cr0);
3197 cmpi(reg, Operand(SYMBOL_TYPE));
3198 bne(not_unique_name);
3199
3200 bind(&succeed);
3201}
3202
3203
3204// Allocates a heap number or jumps to the need_gc label if the young space
3205// is full and a scavenge is needed.
3206void MacroAssembler::AllocateHeapNumber(Register result, Register scratch1,
3207 Register scratch2,
3208 Register heap_number_map,
3209 Label* gc_required,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003210 MutableMode mode) {
3211 // Allocate an object in the heap for the heap number and tag it as a heap
3212 // object.
3213 Allocate(HeapNumber::kSize, result, scratch1, scratch2, gc_required,
Ben Murdochc5610432016-08-08 18:44:38 +01003214 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003215
3216 Heap::RootListIndex map_index = mode == MUTABLE
3217 ? Heap::kMutableHeapNumberMapRootIndex
3218 : Heap::kHeapNumberMapRootIndex;
3219 AssertIsRoot(heap_number_map, map_index);
3220
3221 // Store heap number map in the allocated object.
Ben Murdochc5610432016-08-08 18:44:38 +01003222 StoreP(heap_number_map, FieldMemOperand(result, HeapObject::kMapOffset),
3223 r0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003224}
3225
3226
3227void MacroAssembler::AllocateHeapNumberWithValue(
3228 Register result, DoubleRegister value, Register scratch1, Register scratch2,
3229 Register heap_number_map, Label* gc_required) {
3230 AllocateHeapNumber(result, scratch1, scratch2, heap_number_map, gc_required);
3231 stfd(value, FieldMemOperand(result, HeapNumber::kValueOffset));
3232}
3233
3234
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003235void MacroAssembler::AllocateJSValue(Register result, Register constructor,
3236 Register value, Register scratch1,
3237 Register scratch2, Label* gc_required) {
3238 DCHECK(!result.is(constructor));
3239 DCHECK(!result.is(scratch1));
3240 DCHECK(!result.is(scratch2));
3241 DCHECK(!result.is(value));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003242
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003243 // Allocate JSValue in new space.
Ben Murdochc5610432016-08-08 18:44:38 +01003244 Allocate(JSValue::kSize, result, scratch1, scratch2, gc_required,
3245 NO_ALLOCATION_FLAGS);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003246
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003247 // Initialize the JSValue.
3248 LoadGlobalFunctionInitialMap(constructor, scratch1, scratch2);
3249 StoreP(scratch1, FieldMemOperand(result, HeapObject::kMapOffset), r0);
3250 LoadRoot(scratch1, Heap::kEmptyFixedArrayRootIndex);
3251 StoreP(scratch1, FieldMemOperand(result, JSObject::kPropertiesOffset), r0);
3252 StoreP(scratch1, FieldMemOperand(result, JSObject::kElementsOffset), r0);
3253 StoreP(value, FieldMemOperand(result, JSValue::kValueOffset), r0);
3254 STATIC_ASSERT(JSValue::kSize == 4 * kPointerSize);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003255}
3256
3257
3258void MacroAssembler::CopyBytes(Register src, Register dst, Register length,
3259 Register scratch) {
3260 Label align_loop, aligned, word_loop, byte_loop, byte_loop_1, done;
3261
3262 DCHECK(!scratch.is(r0));
3263
3264 cmpi(length, Operand::Zero());
3265 beq(&done);
3266
3267 // Check src alignment and length to see whether word_loop is possible
3268 andi(scratch, src, Operand(kPointerSize - 1));
3269 beq(&aligned, cr0);
3270 subfic(scratch, scratch, Operand(kPointerSize * 2));
3271 cmp(length, scratch);
3272 blt(&byte_loop);
3273
3274 // Align src before copying in word size chunks.
3275 subi(scratch, scratch, Operand(kPointerSize));
3276 mtctr(scratch);
3277 bind(&align_loop);
3278 lbz(scratch, MemOperand(src));
3279 addi(src, src, Operand(1));
3280 subi(length, length, Operand(1));
3281 stb(scratch, MemOperand(dst));
3282 addi(dst, dst, Operand(1));
3283 bdnz(&align_loop);
3284
3285 bind(&aligned);
3286
3287 // Copy bytes in word size chunks.
3288 if (emit_debug_code()) {
3289 andi(r0, src, Operand(kPointerSize - 1));
3290 Assert(eq, kExpectingAlignmentForCopyBytes, cr0);
3291 }
3292
3293 ShiftRightImm(scratch, length, Operand(kPointerSizeLog2));
3294 cmpi(scratch, Operand::Zero());
3295 beq(&byte_loop);
3296
3297 mtctr(scratch);
3298 bind(&word_loop);
3299 LoadP(scratch, MemOperand(src));
3300 addi(src, src, Operand(kPointerSize));
3301 subi(length, length, Operand(kPointerSize));
3302 if (CpuFeatures::IsSupported(UNALIGNED_ACCESSES)) {
3303 // currently false for PPC - but possible future opt
3304 StoreP(scratch, MemOperand(dst));
3305 addi(dst, dst, Operand(kPointerSize));
3306 } else {
3307#if V8_TARGET_LITTLE_ENDIAN
3308 stb(scratch, MemOperand(dst, 0));
3309 ShiftRightImm(scratch, scratch, Operand(8));
3310 stb(scratch, MemOperand(dst, 1));
3311 ShiftRightImm(scratch, scratch, Operand(8));
3312 stb(scratch, MemOperand(dst, 2));
3313 ShiftRightImm(scratch, scratch, Operand(8));
3314 stb(scratch, MemOperand(dst, 3));
3315#if V8_TARGET_ARCH_PPC64
3316 ShiftRightImm(scratch, scratch, Operand(8));
3317 stb(scratch, MemOperand(dst, 4));
3318 ShiftRightImm(scratch, scratch, Operand(8));
3319 stb(scratch, MemOperand(dst, 5));
3320 ShiftRightImm(scratch, scratch, Operand(8));
3321 stb(scratch, MemOperand(dst, 6));
3322 ShiftRightImm(scratch, scratch, Operand(8));
3323 stb(scratch, MemOperand(dst, 7));
3324#endif
3325#else
3326#if V8_TARGET_ARCH_PPC64
3327 stb(scratch, MemOperand(dst, 7));
3328 ShiftRightImm(scratch, scratch, Operand(8));
3329 stb(scratch, MemOperand(dst, 6));
3330 ShiftRightImm(scratch, scratch, Operand(8));
3331 stb(scratch, MemOperand(dst, 5));
3332 ShiftRightImm(scratch, scratch, Operand(8));
3333 stb(scratch, MemOperand(dst, 4));
3334 ShiftRightImm(scratch, scratch, Operand(8));
3335#endif
3336 stb(scratch, MemOperand(dst, 3));
3337 ShiftRightImm(scratch, scratch, Operand(8));
3338 stb(scratch, MemOperand(dst, 2));
3339 ShiftRightImm(scratch, scratch, Operand(8));
3340 stb(scratch, MemOperand(dst, 1));
3341 ShiftRightImm(scratch, scratch, Operand(8));
3342 stb(scratch, MemOperand(dst, 0));
3343#endif
3344 addi(dst, dst, Operand(kPointerSize));
3345 }
3346 bdnz(&word_loop);
3347
3348 // Copy the last bytes if any left.
3349 cmpi(length, Operand::Zero());
3350 beq(&done);
3351
3352 bind(&byte_loop);
3353 mtctr(length);
3354 bind(&byte_loop_1);
3355 lbz(scratch, MemOperand(src));
3356 addi(src, src, Operand(1));
3357 stb(scratch, MemOperand(dst));
3358 addi(dst, dst, Operand(1));
3359 bdnz(&byte_loop_1);
3360
3361 bind(&done);
3362}
3363
3364
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003365void MacroAssembler::InitializeNFieldsWithFiller(Register current_address,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003366 Register count,
3367 Register filler) {
3368 Label loop;
3369 mtctr(count);
3370 bind(&loop);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003371 StoreP(filler, MemOperand(current_address));
3372 addi(current_address, current_address, Operand(kPointerSize));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003373 bdnz(&loop);
3374}
3375
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003376void MacroAssembler::InitializeFieldsWithFiller(Register current_address,
3377 Register end_address,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003378 Register filler) {
3379 Label done;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003380 sub(r0, end_address, current_address, LeaveOE, SetRC);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003381 beq(&done, cr0);
3382 ShiftRightImm(r0, r0, Operand(kPointerSizeLog2));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003383 InitializeNFieldsWithFiller(current_address, r0, filler);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003384 bind(&done);
3385}
3386
3387
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003388void MacroAssembler::JumpIfBothInstanceTypesAreNotSequentialOneByte(
3389 Register first, Register second, Register scratch1, Register scratch2,
3390 Label* failure) {
3391 const int kFlatOneByteStringMask =
3392 kIsNotStringMask | kStringEncodingMask | kStringRepresentationMask;
3393 const int kFlatOneByteStringTag =
3394 kStringTag | kOneByteStringTag | kSeqStringTag;
3395 andi(scratch1, first, Operand(kFlatOneByteStringMask));
3396 andi(scratch2, second, Operand(kFlatOneByteStringMask));
3397 cmpi(scratch1, Operand(kFlatOneByteStringTag));
3398 bne(failure);
3399 cmpi(scratch2, Operand(kFlatOneByteStringTag));
3400 bne(failure);
3401}
3402
3403
3404void MacroAssembler::JumpIfInstanceTypeIsNotSequentialOneByte(Register type,
3405 Register scratch,
3406 Label* failure) {
3407 const int kFlatOneByteStringMask =
3408 kIsNotStringMask | kStringEncodingMask | kStringRepresentationMask;
3409 const int kFlatOneByteStringTag =
3410 kStringTag | kOneByteStringTag | kSeqStringTag;
3411 andi(scratch, type, Operand(kFlatOneByteStringMask));
3412 cmpi(scratch, Operand(kFlatOneByteStringTag));
3413 bne(failure);
3414}
3415
3416static const int kRegisterPassedArguments = 8;
3417
3418
3419int MacroAssembler::CalculateStackPassedWords(int num_reg_arguments,
3420 int num_double_arguments) {
3421 int stack_passed_words = 0;
3422 if (num_double_arguments > DoubleRegister::kNumRegisters) {
3423 stack_passed_words +=
3424 2 * (num_double_arguments - DoubleRegister::kNumRegisters);
3425 }
3426 // Up to 8 simple arguments are passed in registers r3..r10.
3427 if (num_reg_arguments > kRegisterPassedArguments) {
3428 stack_passed_words += num_reg_arguments - kRegisterPassedArguments;
3429 }
3430 return stack_passed_words;
3431}
3432
3433
3434void MacroAssembler::EmitSeqStringSetCharCheck(Register string, Register index,
3435 Register value,
3436 uint32_t encoding_mask) {
3437 Label is_object;
3438 TestIfSmi(string, r0);
3439 Check(ne, kNonObject, cr0);
3440
3441 LoadP(ip, FieldMemOperand(string, HeapObject::kMapOffset));
3442 lbz(ip, FieldMemOperand(ip, Map::kInstanceTypeOffset));
3443
3444 andi(ip, ip, Operand(kStringRepresentationMask | kStringEncodingMask));
3445 cmpi(ip, Operand(encoding_mask));
3446 Check(eq, kUnexpectedStringType);
3447
3448// The index is assumed to be untagged coming in, tag it to compare with the
3449// string length without using a temp register, it is restored at the end of
3450// this function.
3451#if !V8_TARGET_ARCH_PPC64
3452 Label index_tag_ok, index_tag_bad;
3453 JumpIfNotSmiCandidate(index, r0, &index_tag_bad);
3454#endif
3455 SmiTag(index, index);
3456#if !V8_TARGET_ARCH_PPC64
3457 b(&index_tag_ok);
3458 bind(&index_tag_bad);
3459 Abort(kIndexIsTooLarge);
3460 bind(&index_tag_ok);
3461#endif
3462
3463 LoadP(ip, FieldMemOperand(string, String::kLengthOffset));
3464 cmp(index, ip);
3465 Check(lt, kIndexIsTooLarge);
3466
3467 DCHECK(Smi::FromInt(0) == 0);
3468 cmpi(index, Operand::Zero());
3469 Check(ge, kIndexIsNegative);
3470
3471 SmiUntag(index, index);
3472}
3473
3474
3475void MacroAssembler::PrepareCallCFunction(int num_reg_arguments,
3476 int num_double_arguments,
3477 Register scratch) {
3478 int frame_alignment = ActivationFrameAlignment();
3479 int stack_passed_arguments =
3480 CalculateStackPassedWords(num_reg_arguments, num_double_arguments);
3481 int stack_space = kNumRequiredStackFrameSlots;
3482
3483 if (frame_alignment > kPointerSize) {
3484 // Make stack end at alignment and make room for stack arguments
3485 // -- preserving original value of sp.
3486 mr(scratch, sp);
3487 addi(sp, sp, Operand(-(stack_passed_arguments + 1) * kPointerSize));
3488 DCHECK(base::bits::IsPowerOfTwo32(frame_alignment));
3489 ClearRightImm(sp, sp, Operand(WhichPowerOf2(frame_alignment)));
3490 StoreP(scratch, MemOperand(sp, stack_passed_arguments * kPointerSize));
3491 } else {
3492 // Make room for stack arguments
3493 stack_space += stack_passed_arguments;
3494 }
3495
3496 // Allocate frame with required slots to make ABI work.
3497 li(r0, Operand::Zero());
3498 StorePU(r0, MemOperand(sp, -stack_space * kPointerSize));
3499}
3500
3501
3502void MacroAssembler::PrepareCallCFunction(int num_reg_arguments,
3503 Register scratch) {
3504 PrepareCallCFunction(num_reg_arguments, 0, scratch);
3505}
3506
3507
3508void MacroAssembler::MovToFloatParameter(DoubleRegister src) { Move(d1, src); }
3509
3510
3511void MacroAssembler::MovToFloatResult(DoubleRegister src) { Move(d1, src); }
3512
3513
3514void MacroAssembler::MovToFloatParameters(DoubleRegister src1,
3515 DoubleRegister src2) {
3516 if (src2.is(d1)) {
3517 DCHECK(!src1.is(d2));
3518 Move(d2, src2);
3519 Move(d1, src1);
3520 } else {
3521 Move(d1, src1);
3522 Move(d2, src2);
3523 }
3524}
3525
3526
3527void MacroAssembler::CallCFunction(ExternalReference function,
3528 int num_reg_arguments,
3529 int num_double_arguments) {
3530 mov(ip, Operand(function));
3531 CallCFunctionHelper(ip, num_reg_arguments, num_double_arguments);
3532}
3533
3534
3535void MacroAssembler::CallCFunction(Register function, int num_reg_arguments,
3536 int num_double_arguments) {
3537 CallCFunctionHelper(function, num_reg_arguments, num_double_arguments);
3538}
3539
3540
3541void MacroAssembler::CallCFunction(ExternalReference function,
3542 int num_arguments) {
3543 CallCFunction(function, num_arguments, 0);
3544}
3545
3546
3547void MacroAssembler::CallCFunction(Register function, int num_arguments) {
3548 CallCFunction(function, num_arguments, 0);
3549}
3550
3551
3552void MacroAssembler::CallCFunctionHelper(Register function,
3553 int num_reg_arguments,
3554 int num_double_arguments) {
3555 DCHECK(has_frame());
Ben Murdoch097c5b22016-05-18 11:27:45 +01003556
3557 // Just call directly. The function called cannot cause a GC, or
3558 // allow preemption, so the return address in the link register
3559 // stays correct.
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003560 Register dest = function;
Ben Murdoch097c5b22016-05-18 11:27:45 +01003561 if (ABI_USES_FUNCTION_DESCRIPTORS) {
3562 // AIX/PPC64BE Linux uses a function descriptor. When calling C code be
3563 // aware of this descriptor and pick up values from it
3564 LoadP(ToRegister(ABI_TOC_REGISTER), MemOperand(function, kPointerSize));
3565 LoadP(ip, MemOperand(function, 0));
3566 dest = ip;
3567 } else if (ABI_CALL_VIA_IP) {
3568 Move(ip, function);
3569 dest = ip;
3570 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003571
3572 Call(dest);
3573
3574 // Remove frame bought in PrepareCallCFunction
3575 int stack_passed_arguments =
3576 CalculateStackPassedWords(num_reg_arguments, num_double_arguments);
3577 int stack_space = kNumRequiredStackFrameSlots + stack_passed_arguments;
3578 if (ActivationFrameAlignment() > kPointerSize) {
3579 LoadP(sp, MemOperand(sp, stack_space * kPointerSize));
3580 } else {
3581 addi(sp, sp, Operand(stack_space * kPointerSize));
3582 }
3583}
3584
3585
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003586void MacroAssembler::DecodeConstantPoolOffset(Register result,
3587 Register location) {
3588 Label overflow_access, done;
3589 DCHECK(!AreAliased(result, location, r0));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003590
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003591 // Determine constant pool access type
3592 // Caller has already placed the instruction word at location in result.
3593 ExtractBitRange(r0, result, 31, 26);
3594 cmpi(r0, Operand(ADDIS >> 26));
3595 beq(&overflow_access);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003596
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003597 // Regular constant pool access
3598 // extract the load offset
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003599 andi(result, result, Operand(kImm16Mask));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003600 b(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003601
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003602 bind(&overflow_access);
3603 // Overflow constant pool access
3604 // shift addis immediate
3605 slwi(r0, result, Operand(16));
3606 // sign-extend and add the load offset
3607 lwz(result, MemOperand(location, kInstrSize));
3608 extsh(result, result);
3609 add(result, r0, result);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003610
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003611 bind(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003612}
3613
3614
3615void MacroAssembler::CheckPageFlag(
3616 Register object,
3617 Register scratch, // scratch may be same register as object
3618 int mask, Condition cc, Label* condition_met) {
3619 DCHECK(cc == ne || cc == eq);
3620 ClearRightImm(scratch, object, Operand(kPageSizeBits));
3621 LoadP(scratch, MemOperand(scratch, MemoryChunk::kFlagsOffset));
3622
3623 And(r0, scratch, Operand(mask), SetRC);
3624
3625 if (cc == ne) {
3626 bne(condition_met, cr0);
3627 }
3628 if (cc == eq) {
3629 beq(condition_met, cr0);
3630 }
3631}
3632
3633
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003634void MacroAssembler::JumpIfBlack(Register object, Register scratch0,
3635 Register scratch1, Label* on_black) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003636 HasColor(object, scratch0, scratch1, on_black, 1, 1); // kBlackBitPattern.
3637 DCHECK(strcmp(Marking::kBlackBitPattern, "11") == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003638}
3639
3640
3641void MacroAssembler::HasColor(Register object, Register bitmap_scratch,
3642 Register mask_scratch, Label* has_color,
3643 int first_bit, int second_bit) {
3644 DCHECK(!AreAliased(object, bitmap_scratch, mask_scratch, no_reg));
3645
3646 GetMarkBits(object, bitmap_scratch, mask_scratch);
3647
3648 Label other_color, word_boundary;
3649 lwz(ip, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize));
3650 // Test the first bit
3651 and_(r0, ip, mask_scratch, SetRC);
3652 b(first_bit == 1 ? eq : ne, &other_color, cr0);
3653 // Shift left 1
3654 // May need to load the next cell
3655 slwi(mask_scratch, mask_scratch, Operand(1), SetRC);
3656 beq(&word_boundary, cr0);
3657 // Test the second bit
3658 and_(r0, ip, mask_scratch, SetRC);
3659 b(second_bit == 1 ? ne : eq, has_color, cr0);
3660 b(&other_color);
3661
3662 bind(&word_boundary);
3663 lwz(ip, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize + kIntSize));
3664 andi(r0, ip, Operand(1));
3665 b(second_bit == 1 ? ne : eq, has_color, cr0);
3666 bind(&other_color);
3667}
3668
3669
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003670void MacroAssembler::GetMarkBits(Register addr_reg, Register bitmap_reg,
3671 Register mask_reg) {
3672 DCHECK(!AreAliased(addr_reg, bitmap_reg, mask_reg, no_reg));
3673 DCHECK((~Page::kPageAlignmentMask & 0xffff) == 0);
3674 lis(r0, Operand((~Page::kPageAlignmentMask >> 16)));
3675 and_(bitmap_reg, addr_reg, r0);
3676 const int kLowBits = kPointerSizeLog2 + Bitmap::kBitsPerCellLog2;
3677 ExtractBitRange(mask_reg, addr_reg, kLowBits - 1, kPointerSizeLog2);
3678 ExtractBitRange(ip, addr_reg, kPageSizeBits - 1, kLowBits);
3679 ShiftLeftImm(ip, ip, Operand(Bitmap::kBytesPerCellLog2));
3680 add(bitmap_reg, bitmap_reg, ip);
3681 li(ip, Operand(1));
3682 slw(mask_reg, ip, mask_reg);
3683}
3684
3685
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003686void MacroAssembler::JumpIfWhite(Register value, Register bitmap_scratch,
3687 Register mask_scratch, Register load_scratch,
3688 Label* value_is_white) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003689 DCHECK(!AreAliased(value, bitmap_scratch, mask_scratch, ip));
3690 GetMarkBits(value, bitmap_scratch, mask_scratch);
3691
3692 // If the value is black or grey we don't need to do anything.
3693 DCHECK(strcmp(Marking::kWhiteBitPattern, "00") == 0);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003694 DCHECK(strcmp(Marking::kBlackBitPattern, "11") == 0);
3695 DCHECK(strcmp(Marking::kGreyBitPattern, "10") == 0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003696 DCHECK(strcmp(Marking::kImpossibleBitPattern, "01") == 0);
3697
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003698 // Since both black and grey have a 1 in the first position and white does
3699 // not have a 1 there we only need to check one bit.
3700 lwz(load_scratch, MemOperand(bitmap_scratch, MemoryChunk::kHeaderSize));
3701 and_(r0, mask_scratch, load_scratch, SetRC);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003702 beq(value_is_white, cr0);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003703}
3704
3705
3706// Saturate a value into 8-bit unsigned integer
3707// if input_value < 0, output_value is 0
3708// if input_value > 255, output_value is 255
3709// otherwise output_value is the input_value
3710void MacroAssembler::ClampUint8(Register output_reg, Register input_reg) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003711 int satval = (1 << 8) - 1;
3712
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003713 if (CpuFeatures::IsSupported(ISELECT)) {
3714 // set to 0 if negative
3715 cmpi(input_reg, Operand::Zero());
3716 isel(lt, output_reg, r0, input_reg);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003717
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003718 // set to satval if > satval
3719 li(r0, Operand(satval));
3720 cmpi(output_reg, Operand(satval));
3721 isel(lt, output_reg, output_reg, r0);
3722 } else {
3723 Label done, negative_label, overflow_label;
3724 cmpi(input_reg, Operand::Zero());
3725 blt(&negative_label);
3726
3727 cmpi(input_reg, Operand(satval));
3728 bgt(&overflow_label);
3729 if (!output_reg.is(input_reg)) {
3730 mr(output_reg, input_reg);
3731 }
3732 b(&done);
3733
3734 bind(&negative_label);
3735 li(output_reg, Operand::Zero()); // set to 0 if negative
3736 b(&done);
3737
3738 bind(&overflow_label); // set to satval if > satval
3739 li(output_reg, Operand(satval));
3740
3741 bind(&done);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003742 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003743}
3744
3745
3746void MacroAssembler::SetRoundingMode(FPRoundingMode RN) { mtfsfi(7, RN); }
3747
3748
3749void MacroAssembler::ResetRoundingMode() {
3750 mtfsfi(7, kRoundToNearest); // reset (default is kRoundToNearest)
3751}
3752
3753
3754void MacroAssembler::ClampDoubleToUint8(Register result_reg,
3755 DoubleRegister input_reg,
3756 DoubleRegister double_scratch) {
3757 Label above_zero;
3758 Label done;
3759 Label in_bounds;
3760
3761 LoadDoubleLiteral(double_scratch, 0.0, result_reg);
3762 fcmpu(input_reg, double_scratch);
3763 bgt(&above_zero);
3764
3765 // Double value is less than zero, NaN or Inf, return 0.
3766 LoadIntLiteral(result_reg, 0);
3767 b(&done);
3768
3769 // Double value is >= 255, return 255.
3770 bind(&above_zero);
3771 LoadDoubleLiteral(double_scratch, 255.0, result_reg);
3772 fcmpu(input_reg, double_scratch);
3773 ble(&in_bounds);
3774 LoadIntLiteral(result_reg, 255);
3775 b(&done);
3776
3777 // In 0-255 range, round and truncate.
3778 bind(&in_bounds);
3779
3780 // round to nearest (default rounding mode)
3781 fctiw(double_scratch, input_reg);
3782 MovDoubleLowToInt(result_reg, double_scratch);
3783 bind(&done);
3784}
3785
3786
3787void MacroAssembler::LoadInstanceDescriptors(Register map,
3788 Register descriptors) {
3789 LoadP(descriptors, FieldMemOperand(map, Map::kDescriptorsOffset));
3790}
3791
3792
3793void MacroAssembler::NumberOfOwnDescriptors(Register dst, Register map) {
3794 lwz(dst, FieldMemOperand(map, Map::kBitField3Offset));
3795 DecodeField<Map::NumberOfOwnDescriptorsBits>(dst);
3796}
3797
3798
3799void MacroAssembler::EnumLength(Register dst, Register map) {
3800 STATIC_ASSERT(Map::EnumLengthBits::kShift == 0);
3801 lwz(dst, FieldMemOperand(map, Map::kBitField3Offset));
3802 ExtractBitMask(dst, dst, Map::EnumLengthBits::kMask);
3803 SmiTag(dst);
3804}
3805
3806
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003807void MacroAssembler::LoadAccessor(Register dst, Register holder,
3808 int accessor_index,
3809 AccessorComponent accessor) {
3810 LoadP(dst, FieldMemOperand(holder, HeapObject::kMapOffset));
3811 LoadInstanceDescriptors(dst, dst);
3812 LoadP(dst,
3813 FieldMemOperand(dst, DescriptorArray::GetValueOffset(accessor_index)));
3814 const int getterOffset = AccessorPair::kGetterOffset;
3815 const int setterOffset = AccessorPair::kSetterOffset;
3816 int offset = ((accessor == ACCESSOR_GETTER) ? getterOffset : setterOffset);
3817 LoadP(dst, FieldMemOperand(dst, offset));
3818}
3819
3820
Ben Murdoch097c5b22016-05-18 11:27:45 +01003821void MacroAssembler::CheckEnumCache(Label* call_runtime) {
3822 Register null_value = r8;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003823 Register empty_fixed_array_value = r9;
3824 LoadRoot(empty_fixed_array_value, Heap::kEmptyFixedArrayRootIndex);
3825 Label next, start;
3826 mr(r5, r3);
3827
3828 // Check if the enum length field is properly initialized, indicating that
3829 // there is an enum cache.
3830 LoadP(r4, FieldMemOperand(r5, HeapObject::kMapOffset));
3831
3832 EnumLength(r6, r4);
3833 CmpSmiLiteral(r6, Smi::FromInt(kInvalidEnumCacheSentinel), r0);
3834 beq(call_runtime);
3835
Ben Murdoch097c5b22016-05-18 11:27:45 +01003836 LoadRoot(null_value, Heap::kNullValueRootIndex);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003837 b(&start);
3838
3839 bind(&next);
3840 LoadP(r4, FieldMemOperand(r5, HeapObject::kMapOffset));
3841
3842 // For all objects but the receiver, check that the cache is empty.
3843 EnumLength(r6, r4);
3844 CmpSmiLiteral(r6, Smi::FromInt(0), r0);
3845 bne(call_runtime);
3846
3847 bind(&start);
3848
3849 // Check that there are no elements. Register r5 contains the current JS
3850 // object we've reached through the prototype chain.
3851 Label no_elements;
3852 LoadP(r5, FieldMemOperand(r5, JSObject::kElementsOffset));
3853 cmp(r5, empty_fixed_array_value);
3854 beq(&no_elements);
3855
3856 // Second chance, the object may be using the empty slow element dictionary.
3857 CompareRoot(r5, Heap::kEmptySlowElementDictionaryRootIndex);
3858 bne(call_runtime);
3859
3860 bind(&no_elements);
3861 LoadP(r5, FieldMemOperand(r4, Map::kPrototypeOffset));
3862 cmp(r5, null_value);
3863 bne(&next);
3864}
3865
3866
3867////////////////////////////////////////////////////////////////////////////////
3868//
3869// New MacroAssembler Interfaces added for PPC
3870//
3871////////////////////////////////////////////////////////////////////////////////
3872void MacroAssembler::LoadIntLiteral(Register dst, int value) {
3873 mov(dst, Operand(value));
3874}
3875
3876
3877void MacroAssembler::LoadSmiLiteral(Register dst, Smi* smi) {
3878 mov(dst, Operand(smi));
3879}
3880
3881
3882void MacroAssembler::LoadDoubleLiteral(DoubleRegister result, double value,
3883 Register scratch) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00003884 if (FLAG_enable_embedded_constant_pool && is_constant_pool_available() &&
3885 !(scratch.is(r0) && ConstantPoolAccessIsInOverflow())) {
3886 ConstantPoolEntry::Access access = ConstantPoolAddEntry(value);
3887 if (access == ConstantPoolEntry::OVERFLOWED) {
3888 addis(scratch, kConstantPoolRegister, Operand::Zero());
3889 lfd(result, MemOperand(scratch, 0));
3890 } else {
3891 lfd(result, MemOperand(kConstantPoolRegister, 0));
3892 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003893 return;
3894 }
Emily Bernierd0a1eb72015-03-24 16:35:39 -04003895
3896 // avoid gcc strict aliasing error using union cast
3897 union {
3898 double dval;
3899#if V8_TARGET_ARCH_PPC64
3900 intptr_t ival;
3901#else
3902 intptr_t ival[2];
3903#endif
3904 } litVal;
3905
3906 litVal.dval = value;
3907
3908#if V8_TARGET_ARCH_PPC64
3909 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3910 mov(scratch, Operand(litVal.ival));
3911 mtfprd(result, scratch);
3912 return;
3913 }
3914#endif
3915
3916 addi(sp, sp, Operand(-kDoubleSize));
3917#if V8_TARGET_ARCH_PPC64
3918 mov(scratch, Operand(litVal.ival));
3919 std(scratch, MemOperand(sp));
3920#else
3921 LoadIntLiteral(scratch, litVal.ival[0]);
3922 stw(scratch, MemOperand(sp, 0));
3923 LoadIntLiteral(scratch, litVal.ival[1]);
3924 stw(scratch, MemOperand(sp, 4));
3925#endif
3926 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3927 lfd(result, MemOperand(sp, 0));
3928 addi(sp, sp, Operand(kDoubleSize));
3929}
3930
3931
3932void MacroAssembler::MovIntToDouble(DoubleRegister dst, Register src,
3933 Register scratch) {
3934// sign-extend src to 64-bit
3935#if V8_TARGET_ARCH_PPC64
3936 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3937 mtfprwa(dst, src);
3938 return;
3939 }
3940#endif
3941
3942 DCHECK(!src.is(scratch));
3943 subi(sp, sp, Operand(kDoubleSize));
3944#if V8_TARGET_ARCH_PPC64
3945 extsw(scratch, src);
3946 std(scratch, MemOperand(sp, 0));
3947#else
3948 srawi(scratch, src, 31);
3949 stw(scratch, MemOperand(sp, Register::kExponentOffset));
3950 stw(src, MemOperand(sp, Register::kMantissaOffset));
3951#endif
3952 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3953 lfd(dst, MemOperand(sp, 0));
3954 addi(sp, sp, Operand(kDoubleSize));
3955}
3956
3957
3958void MacroAssembler::MovUnsignedIntToDouble(DoubleRegister dst, Register src,
3959 Register scratch) {
3960// zero-extend src to 64-bit
3961#if V8_TARGET_ARCH_PPC64
3962 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3963 mtfprwz(dst, src);
3964 return;
3965 }
3966#endif
3967
3968 DCHECK(!src.is(scratch));
3969 subi(sp, sp, Operand(kDoubleSize));
3970#if V8_TARGET_ARCH_PPC64
3971 clrldi(scratch, src, Operand(32));
3972 std(scratch, MemOperand(sp, 0));
3973#else
3974 li(scratch, Operand::Zero());
3975 stw(scratch, MemOperand(sp, Register::kExponentOffset));
3976 stw(src, MemOperand(sp, Register::kMantissaOffset));
3977#endif
3978 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
3979 lfd(dst, MemOperand(sp, 0));
3980 addi(sp, sp, Operand(kDoubleSize));
3981}
3982
3983
3984void MacroAssembler::MovInt64ToDouble(DoubleRegister dst,
3985#if !V8_TARGET_ARCH_PPC64
3986 Register src_hi,
3987#endif
3988 Register src) {
3989#if V8_TARGET_ARCH_PPC64
3990 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
3991 mtfprd(dst, src);
3992 return;
3993 }
3994#endif
3995
3996 subi(sp, sp, Operand(kDoubleSize));
3997#if V8_TARGET_ARCH_PPC64
3998 std(src, MemOperand(sp, 0));
3999#else
4000 stw(src_hi, MemOperand(sp, Register::kExponentOffset));
4001 stw(src, MemOperand(sp, Register::kMantissaOffset));
4002#endif
4003 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4004 lfd(dst, MemOperand(sp, 0));
4005 addi(sp, sp, Operand(kDoubleSize));
4006}
4007
4008
4009#if V8_TARGET_ARCH_PPC64
4010void MacroAssembler::MovInt64ComponentsToDouble(DoubleRegister dst,
4011 Register src_hi,
4012 Register src_lo,
4013 Register scratch) {
4014 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4015 sldi(scratch, src_hi, Operand(32));
4016 rldimi(scratch, src_lo, 0, 32);
4017 mtfprd(dst, scratch);
4018 return;
4019 }
4020
4021 subi(sp, sp, Operand(kDoubleSize));
4022 stw(src_hi, MemOperand(sp, Register::kExponentOffset));
4023 stw(src_lo, MemOperand(sp, Register::kMantissaOffset));
4024 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4025 lfd(dst, MemOperand(sp));
4026 addi(sp, sp, Operand(kDoubleSize));
4027}
4028#endif
4029
4030
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004031void MacroAssembler::InsertDoubleLow(DoubleRegister dst, Register src,
4032 Register scratch) {
4033#if V8_TARGET_ARCH_PPC64
4034 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4035 mffprd(scratch, dst);
4036 rldimi(scratch, src, 0, 32);
4037 mtfprd(dst, scratch);
4038 return;
4039 }
4040#endif
4041
4042 subi(sp, sp, Operand(kDoubleSize));
4043 stfd(dst, MemOperand(sp));
4044 stw(src, MemOperand(sp, Register::kMantissaOffset));
4045 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4046 lfd(dst, MemOperand(sp));
4047 addi(sp, sp, Operand(kDoubleSize));
4048}
4049
4050
4051void MacroAssembler::InsertDoubleHigh(DoubleRegister dst, Register src,
4052 Register scratch) {
4053#if V8_TARGET_ARCH_PPC64
4054 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4055 mffprd(scratch, dst);
4056 rldimi(scratch, src, 32, 0);
4057 mtfprd(dst, scratch);
4058 return;
4059 }
4060#endif
4061
4062 subi(sp, sp, Operand(kDoubleSize));
4063 stfd(dst, MemOperand(sp));
4064 stw(src, MemOperand(sp, Register::kExponentOffset));
4065 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4066 lfd(dst, MemOperand(sp));
4067 addi(sp, sp, Operand(kDoubleSize));
4068}
4069
4070
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004071void MacroAssembler::MovDoubleLowToInt(Register dst, DoubleRegister src) {
4072#if V8_TARGET_ARCH_PPC64
4073 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4074 mffprwz(dst, src);
4075 return;
4076 }
4077#endif
4078
4079 subi(sp, sp, Operand(kDoubleSize));
4080 stfd(src, MemOperand(sp));
4081 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4082 lwz(dst, MemOperand(sp, Register::kMantissaOffset));
4083 addi(sp, sp, Operand(kDoubleSize));
4084}
4085
4086
4087void MacroAssembler::MovDoubleHighToInt(Register dst, DoubleRegister src) {
4088#if V8_TARGET_ARCH_PPC64
4089 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4090 mffprd(dst, src);
4091 srdi(dst, dst, Operand(32));
4092 return;
4093 }
4094#endif
4095
4096 subi(sp, sp, Operand(kDoubleSize));
4097 stfd(src, MemOperand(sp));
4098 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4099 lwz(dst, MemOperand(sp, Register::kExponentOffset));
4100 addi(sp, sp, Operand(kDoubleSize));
4101}
4102
4103
4104void MacroAssembler::MovDoubleToInt64(
4105#if !V8_TARGET_ARCH_PPC64
4106 Register dst_hi,
4107#endif
4108 Register dst, DoubleRegister src) {
4109#if V8_TARGET_ARCH_PPC64
4110 if (CpuFeatures::IsSupported(FPR_GPR_MOV)) {
4111 mffprd(dst, src);
4112 return;
4113 }
4114#endif
4115
4116 subi(sp, sp, Operand(kDoubleSize));
4117 stfd(src, MemOperand(sp));
4118 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4119#if V8_TARGET_ARCH_PPC64
4120 ld(dst, MemOperand(sp, 0));
4121#else
4122 lwz(dst_hi, MemOperand(sp, Register::kExponentOffset));
4123 lwz(dst, MemOperand(sp, Register::kMantissaOffset));
4124#endif
4125 addi(sp, sp, Operand(kDoubleSize));
4126}
4127
4128
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004129void MacroAssembler::MovIntToFloat(DoubleRegister dst, Register src) {
4130 subi(sp, sp, Operand(kFloatSize));
4131 stw(src, MemOperand(sp, 0));
4132 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4133 lfs(dst, MemOperand(sp, 0));
4134 addi(sp, sp, Operand(kFloatSize));
4135}
4136
4137
4138void MacroAssembler::MovFloatToInt(Register dst, DoubleRegister src) {
4139 subi(sp, sp, Operand(kFloatSize));
4140 frsp(src, src);
4141 stfs(src, MemOperand(sp, 0));
4142 nop(GROUP_ENDING_NOP); // LHS/RAW optimization
4143 lwz(dst, MemOperand(sp, 0));
4144 addi(sp, sp, Operand(kFloatSize));
4145}
4146
4147
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004148void MacroAssembler::Add(Register dst, Register src, intptr_t value,
4149 Register scratch) {
4150 if (is_int16(value)) {
4151 addi(dst, src, Operand(value));
4152 } else {
4153 mov(scratch, Operand(value));
4154 add(dst, src, scratch);
4155 }
4156}
4157
4158
4159void MacroAssembler::Cmpi(Register src1, const Operand& src2, Register scratch,
4160 CRegister cr) {
4161 intptr_t value = src2.immediate();
4162 if (is_int16(value)) {
4163 cmpi(src1, src2, cr);
4164 } else {
4165 mov(scratch, src2);
4166 cmp(src1, scratch, cr);
4167 }
4168}
4169
4170
4171void MacroAssembler::Cmpli(Register src1, const Operand& src2, Register scratch,
4172 CRegister cr) {
4173 intptr_t value = src2.immediate();
4174 if (is_uint16(value)) {
4175 cmpli(src1, src2, cr);
4176 } else {
4177 mov(scratch, src2);
4178 cmpl(src1, scratch, cr);
4179 }
4180}
4181
4182
4183void MacroAssembler::Cmpwi(Register src1, const Operand& src2, Register scratch,
4184 CRegister cr) {
4185 intptr_t value = src2.immediate();
4186 if (is_int16(value)) {
4187 cmpwi(src1, src2, cr);
4188 } else {
4189 mov(scratch, src2);
4190 cmpw(src1, scratch, cr);
4191 }
4192}
4193
4194
4195void MacroAssembler::Cmplwi(Register src1, const Operand& src2,
4196 Register scratch, CRegister cr) {
4197 intptr_t value = src2.immediate();
4198 if (is_uint16(value)) {
4199 cmplwi(src1, src2, cr);
4200 } else {
4201 mov(scratch, src2);
4202 cmplw(src1, scratch, cr);
4203 }
4204}
4205
4206
4207void MacroAssembler::And(Register ra, Register rs, const Operand& rb,
4208 RCBit rc) {
4209 if (rb.is_reg()) {
4210 and_(ra, rs, rb.rm(), rc);
4211 } else {
4212 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == SetRC) {
4213 andi(ra, rs, rb);
4214 } else {
4215 // mov handles the relocation.
4216 DCHECK(!rs.is(r0));
4217 mov(r0, rb);
4218 and_(ra, rs, r0, rc);
4219 }
4220 }
4221}
4222
4223
4224void MacroAssembler::Or(Register ra, Register rs, const Operand& rb, RCBit rc) {
4225 if (rb.is_reg()) {
4226 orx(ra, rs, rb.rm(), rc);
4227 } else {
4228 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == LeaveRC) {
4229 ori(ra, rs, rb);
4230 } else {
4231 // mov handles the relocation.
4232 DCHECK(!rs.is(r0));
4233 mov(r0, rb);
4234 orx(ra, rs, r0, rc);
4235 }
4236 }
4237}
4238
4239
4240void MacroAssembler::Xor(Register ra, Register rs, const Operand& rb,
4241 RCBit rc) {
4242 if (rb.is_reg()) {
4243 xor_(ra, rs, rb.rm(), rc);
4244 } else {
4245 if (is_uint16(rb.imm_) && RelocInfo::IsNone(rb.rmode_) && rc == LeaveRC) {
4246 xori(ra, rs, rb);
4247 } else {
4248 // mov handles the relocation.
4249 DCHECK(!rs.is(r0));
4250 mov(r0, rb);
4251 xor_(ra, rs, r0, rc);
4252 }
4253 }
4254}
4255
4256
4257void MacroAssembler::CmpSmiLiteral(Register src1, Smi* smi, Register scratch,
4258 CRegister cr) {
4259#if V8_TARGET_ARCH_PPC64
4260 LoadSmiLiteral(scratch, smi);
4261 cmp(src1, scratch, cr);
4262#else
4263 Cmpi(src1, Operand(smi), scratch, cr);
4264#endif
4265}
4266
4267
4268void MacroAssembler::CmplSmiLiteral(Register src1, Smi* smi, Register scratch,
4269 CRegister cr) {
4270#if V8_TARGET_ARCH_PPC64
4271 LoadSmiLiteral(scratch, smi);
4272 cmpl(src1, scratch, cr);
4273#else
4274 Cmpli(src1, Operand(smi), scratch, cr);
4275#endif
4276}
4277
4278
4279void MacroAssembler::AddSmiLiteral(Register dst, Register src, Smi* smi,
4280 Register scratch) {
4281#if V8_TARGET_ARCH_PPC64
4282 LoadSmiLiteral(scratch, smi);
4283 add(dst, src, scratch);
4284#else
4285 Add(dst, src, reinterpret_cast<intptr_t>(smi), scratch);
4286#endif
4287}
4288
4289
4290void MacroAssembler::SubSmiLiteral(Register dst, Register src, Smi* smi,
4291 Register scratch) {
4292#if V8_TARGET_ARCH_PPC64
4293 LoadSmiLiteral(scratch, smi);
4294 sub(dst, src, scratch);
4295#else
4296 Add(dst, src, -(reinterpret_cast<intptr_t>(smi)), scratch);
4297#endif
4298}
4299
4300
4301void MacroAssembler::AndSmiLiteral(Register dst, Register src, Smi* smi,
4302 Register scratch, RCBit rc) {
4303#if V8_TARGET_ARCH_PPC64
4304 LoadSmiLiteral(scratch, smi);
4305 and_(dst, src, scratch, rc);
4306#else
4307 And(dst, src, Operand(smi), rc);
4308#endif
4309}
4310
4311
4312// Load a "pointer" sized value from the memory location
4313void MacroAssembler::LoadP(Register dst, const MemOperand& mem,
4314 Register scratch) {
4315 int offset = mem.offset();
4316
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004317 if (!is_int16(offset)) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004318 /* cannot use d-form */
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004319 DCHECK(!scratch.is(no_reg));
4320 mov(scratch, Operand(offset));
Ben Murdochc5610432016-08-08 18:44:38 +01004321 LoadPX(dst, MemOperand(mem.ra(), scratch));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004322 } else {
4323#if V8_TARGET_ARCH_PPC64
4324 int misaligned = (offset & 3);
4325 if (misaligned) {
4326 // adjust base to conform to offset alignment requirements
4327 // Todo: enhance to use scratch if dst is unsuitable
4328 DCHECK(!dst.is(r0));
4329 addi(dst, mem.ra(), Operand((offset & 3) - 4));
4330 ld(dst, MemOperand(dst, (offset & ~3) + 4));
4331 } else {
4332 ld(dst, mem);
4333 }
4334#else
4335 lwz(dst, mem);
4336#endif
4337 }
4338}
4339
Ben Murdochc5610432016-08-08 18:44:38 +01004340void MacroAssembler::LoadPU(Register dst, const MemOperand& mem,
4341 Register scratch) {
4342 int offset = mem.offset();
4343
4344 if (!is_int16(offset)) {
4345 /* cannot use d-form */
4346 DCHECK(!scratch.is(no_reg));
4347 mov(scratch, Operand(offset));
4348 LoadPUX(dst, MemOperand(mem.ra(), scratch));
4349 } else {
4350#if V8_TARGET_ARCH_PPC64
4351 ldu(dst, mem);
4352#else
4353 lwzu(dst, mem);
4354#endif
4355 }
4356}
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004357
4358// Store a "pointer" sized value to the memory location
4359void MacroAssembler::StoreP(Register src, const MemOperand& mem,
4360 Register scratch) {
4361 int offset = mem.offset();
4362
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004363 if (!is_int16(offset)) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004364 /* cannot use d-form */
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004365 DCHECK(!scratch.is(no_reg));
4366 mov(scratch, Operand(offset));
Ben Murdochc5610432016-08-08 18:44:38 +01004367 StorePX(src, MemOperand(mem.ra(), scratch));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004368 } else {
4369#if V8_TARGET_ARCH_PPC64
4370 int misaligned = (offset & 3);
4371 if (misaligned) {
4372 // adjust base to conform to offset alignment requirements
4373 // a suitable scratch is required here
4374 DCHECK(!scratch.is(no_reg));
4375 if (scratch.is(r0)) {
4376 LoadIntLiteral(scratch, offset);
4377 stdx(src, MemOperand(mem.ra(), scratch));
4378 } else {
4379 addi(scratch, mem.ra(), Operand((offset & 3) - 4));
4380 std(src, MemOperand(scratch, (offset & ~3) + 4));
4381 }
4382 } else {
4383 std(src, mem);
4384 }
4385#else
4386 stw(src, mem);
4387#endif
4388 }
4389}
4390
Ben Murdochc5610432016-08-08 18:44:38 +01004391void MacroAssembler::StorePU(Register src, const MemOperand& mem,
4392 Register scratch) {
4393 int offset = mem.offset();
4394
4395 if (!is_int16(offset)) {
4396 /* cannot use d-form */
4397 DCHECK(!scratch.is(no_reg));
4398 mov(scratch, Operand(offset));
4399 StorePUX(src, MemOperand(mem.ra(), scratch));
4400 } else {
4401#if V8_TARGET_ARCH_PPC64
4402 stdu(src, mem);
4403#else
4404 stwu(src, mem);
4405#endif
4406 }
4407}
4408
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004409void MacroAssembler::LoadWordArith(Register dst, const MemOperand& mem,
4410 Register scratch) {
4411 int offset = mem.offset();
4412
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004413 if (!is_int16(offset)) {
4414 DCHECK(!scratch.is(no_reg));
4415 mov(scratch, Operand(offset));
4416 lwax(dst, MemOperand(mem.ra(), scratch));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004417 } else {
4418#if V8_TARGET_ARCH_PPC64
4419 int misaligned = (offset & 3);
4420 if (misaligned) {
4421 // adjust base to conform to offset alignment requirements
4422 // Todo: enhance to use scratch if dst is unsuitable
4423 DCHECK(!dst.is(r0));
4424 addi(dst, mem.ra(), Operand((offset & 3) - 4));
4425 lwa(dst, MemOperand(dst, (offset & ~3) + 4));
4426 } else {
4427 lwa(dst, mem);
4428 }
4429#else
4430 lwz(dst, mem);
4431#endif
4432 }
4433}
4434
4435
4436// Variable length depending on whether offset fits into immediate field
4437// MemOperand currently only supports d-form
4438void MacroAssembler::LoadWord(Register dst, const MemOperand& mem,
4439 Register scratch) {
4440 Register base = mem.ra();
4441 int offset = mem.offset();
4442
4443 if (!is_int16(offset)) {
4444 LoadIntLiteral(scratch, offset);
4445 lwzx(dst, MemOperand(base, scratch));
4446 } else {
4447 lwz(dst, mem);
4448 }
4449}
4450
4451
4452// Variable length depending on whether offset fits into immediate field
4453// MemOperand current only supports d-form
4454void MacroAssembler::StoreWord(Register src, const MemOperand& mem,
4455 Register scratch) {
4456 Register base = mem.ra();
4457 int offset = mem.offset();
4458
4459 if (!is_int16(offset)) {
4460 LoadIntLiteral(scratch, offset);
4461 stwx(src, MemOperand(base, scratch));
4462 } else {
4463 stw(src, mem);
4464 }
4465}
4466
4467
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004468void MacroAssembler::LoadHalfWordArith(Register dst, const MemOperand& mem,
4469 Register scratch) {
4470 int offset = mem.offset();
4471
4472 if (!is_int16(offset)) {
4473 DCHECK(!scratch.is(no_reg));
4474 mov(scratch, Operand(offset));
4475 lhax(dst, MemOperand(mem.ra(), scratch));
4476 } else {
4477 lha(dst, mem);
4478 }
4479}
4480
4481
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004482// Variable length depending on whether offset fits into immediate field
4483// MemOperand currently only supports d-form
4484void MacroAssembler::LoadHalfWord(Register dst, const MemOperand& mem,
4485 Register scratch) {
4486 Register base = mem.ra();
4487 int offset = mem.offset();
4488
4489 if (!is_int16(offset)) {
4490 LoadIntLiteral(scratch, offset);
4491 lhzx(dst, MemOperand(base, scratch));
4492 } else {
4493 lhz(dst, mem);
4494 }
4495}
4496
4497
4498// Variable length depending on whether offset fits into immediate field
4499// MemOperand current only supports d-form
4500void MacroAssembler::StoreHalfWord(Register src, const MemOperand& mem,
4501 Register scratch) {
4502 Register base = mem.ra();
4503 int offset = mem.offset();
4504
4505 if (!is_int16(offset)) {
4506 LoadIntLiteral(scratch, offset);
4507 sthx(src, MemOperand(base, scratch));
4508 } else {
4509 sth(src, mem);
4510 }
4511}
4512
4513
4514// Variable length depending on whether offset fits into immediate field
4515// MemOperand currently only supports d-form
4516void MacroAssembler::LoadByte(Register dst, const MemOperand& mem,
4517 Register scratch) {
4518 Register base = mem.ra();
4519 int offset = mem.offset();
4520
4521 if (!is_int16(offset)) {
4522 LoadIntLiteral(scratch, offset);
4523 lbzx(dst, MemOperand(base, scratch));
4524 } else {
4525 lbz(dst, mem);
4526 }
4527}
4528
4529
4530// Variable length depending on whether offset fits into immediate field
4531// MemOperand current only supports d-form
4532void MacroAssembler::StoreByte(Register src, const MemOperand& mem,
4533 Register scratch) {
4534 Register base = mem.ra();
4535 int offset = mem.offset();
4536
4537 if (!is_int16(offset)) {
4538 LoadIntLiteral(scratch, offset);
4539 stbx(src, MemOperand(base, scratch));
4540 } else {
4541 stb(src, mem);
4542 }
4543}
4544
4545
4546void MacroAssembler::LoadRepresentation(Register dst, const MemOperand& mem,
4547 Representation r, Register scratch) {
4548 DCHECK(!r.IsDouble());
4549 if (r.IsInteger8()) {
4550 LoadByte(dst, mem, scratch);
4551 extsb(dst, dst);
4552 } else if (r.IsUInteger8()) {
4553 LoadByte(dst, mem, scratch);
4554 } else if (r.IsInteger16()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004555 LoadHalfWordArith(dst, mem, scratch);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004556 } else if (r.IsUInteger16()) {
4557 LoadHalfWord(dst, mem, scratch);
4558#if V8_TARGET_ARCH_PPC64
4559 } else if (r.IsInteger32()) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004560 LoadWordArith(dst, mem, scratch);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004561#endif
4562 } else {
4563 LoadP(dst, mem, scratch);
4564 }
4565}
4566
4567
4568void MacroAssembler::StoreRepresentation(Register src, const MemOperand& mem,
4569 Representation r, Register scratch) {
4570 DCHECK(!r.IsDouble());
4571 if (r.IsInteger8() || r.IsUInteger8()) {
4572 StoreByte(src, mem, scratch);
4573 } else if (r.IsInteger16() || r.IsUInteger16()) {
4574 StoreHalfWord(src, mem, scratch);
4575#if V8_TARGET_ARCH_PPC64
4576 } else if (r.IsInteger32()) {
4577 StoreWord(src, mem, scratch);
4578#endif
4579 } else {
4580 if (r.IsHeapObject()) {
4581 AssertNotSmi(src);
4582 } else if (r.IsSmi()) {
4583 AssertSmi(src);
4584 }
4585 StoreP(src, mem, scratch);
4586 }
4587}
4588
4589
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004590void MacroAssembler::LoadDouble(DoubleRegister dst, const MemOperand& mem,
4591 Register scratch) {
4592 Register base = mem.ra();
4593 int offset = mem.offset();
4594
4595 if (!is_int16(offset)) {
4596 mov(scratch, Operand(offset));
4597 lfdx(dst, MemOperand(base, scratch));
4598 } else {
4599 lfd(dst, mem);
4600 }
4601}
4602
Ben Murdochc5610432016-08-08 18:44:38 +01004603void MacroAssembler::LoadDoubleU(DoubleRegister dst, const MemOperand& mem,
4604 Register scratch) {
4605 Register base = mem.ra();
4606 int offset = mem.offset();
4607
4608 if (!is_int16(offset)) {
4609 mov(scratch, Operand(offset));
4610 lfdux(dst, MemOperand(base, scratch));
4611 } else {
4612 lfdu(dst, mem);
4613 }
4614}
4615
4616void MacroAssembler::LoadSingle(DoubleRegister dst, const MemOperand& mem,
4617 Register scratch) {
4618 Register base = mem.ra();
4619 int offset = mem.offset();
4620
4621 if (!is_int16(offset)) {
4622 mov(scratch, Operand(offset));
4623 lfsx(dst, MemOperand(base, scratch));
4624 } else {
4625 lfs(dst, mem);
4626 }
4627}
4628
4629void MacroAssembler::LoadSingleU(DoubleRegister dst, const MemOperand& mem,
4630 Register scratch) {
4631 Register base = mem.ra();
4632 int offset = mem.offset();
4633
4634 if (!is_int16(offset)) {
4635 mov(scratch, Operand(offset));
4636 lfsux(dst, MemOperand(base, scratch));
4637 } else {
4638 lfsu(dst, mem);
4639 }
4640}
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004641
4642void MacroAssembler::StoreDouble(DoubleRegister src, const MemOperand& mem,
4643 Register scratch) {
4644 Register base = mem.ra();
4645 int offset = mem.offset();
4646
4647 if (!is_int16(offset)) {
4648 mov(scratch, Operand(offset));
4649 stfdx(src, MemOperand(base, scratch));
4650 } else {
4651 stfd(src, mem);
4652 }
4653}
4654
Ben Murdochc5610432016-08-08 18:44:38 +01004655void MacroAssembler::StoreDoubleU(DoubleRegister src, const MemOperand& mem,
4656 Register scratch) {
4657 Register base = mem.ra();
4658 int offset = mem.offset();
4659
4660 if (!is_int16(offset)) {
4661 mov(scratch, Operand(offset));
4662 stfdux(src, MemOperand(base, scratch));
4663 } else {
4664 stfdu(src, mem);
4665 }
4666}
4667
4668void MacroAssembler::StoreSingle(DoubleRegister src, const MemOperand& mem,
4669 Register scratch) {
4670 Register base = mem.ra();
4671 int offset = mem.offset();
4672
4673 if (!is_int16(offset)) {
4674 mov(scratch, Operand(offset));
4675 stfsx(src, MemOperand(base, scratch));
4676 } else {
4677 stfs(src, mem);
4678 }
4679}
4680
4681void MacroAssembler::StoreSingleU(DoubleRegister src, const MemOperand& mem,
4682 Register scratch) {
4683 Register base = mem.ra();
4684 int offset = mem.offset();
4685
4686 if (!is_int16(offset)) {
4687 mov(scratch, Operand(offset));
4688 stfsux(src, MemOperand(base, scratch));
4689 } else {
4690 stfsu(src, mem);
4691 }
4692}
4693
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004694void MacroAssembler::TestJSArrayForAllocationMemento(Register receiver_reg,
4695 Register scratch_reg,
Ben Murdochda12d292016-06-02 14:46:10 +01004696 Register scratch2_reg,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004697 Label* no_memento_found) {
Ben Murdochda12d292016-06-02 14:46:10 +01004698 Label map_check;
4699 Label top_check;
Ben Murdochc5610432016-08-08 18:44:38 +01004700 ExternalReference new_space_allocation_top_adr =
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004701 ExternalReference::new_space_allocation_top_address(isolate());
Ben Murdochda12d292016-06-02 14:46:10 +01004702 const int kMementoMapOffset = JSArray::kSize - kHeapObjectTag;
4703 const int kMementoEndOffset = kMementoMapOffset + AllocationMemento::kSize;
4704 Register mask = scratch2_reg;
4705
4706 DCHECK(!AreAliased(receiver_reg, scratch_reg, mask));
4707
4708 // Bail out if the object is not in new space.
4709 JumpIfNotInNewSpace(receiver_reg, scratch_reg, no_memento_found);
4710
4711 DCHECK((~Page::kPageAlignmentMask & 0xffff) == 0);
4712 lis(mask, Operand((~Page::kPageAlignmentMask >> 16)));
4713 addi(scratch_reg, receiver_reg, Operand(kMementoEndOffset));
4714
4715 // If the object is in new space, we need to check whether it is on the same
4716 // page as the current top.
Ben Murdochc5610432016-08-08 18:44:38 +01004717 mov(ip, Operand(new_space_allocation_top_adr));
4718 LoadP(ip, MemOperand(ip));
4719 Xor(r0, scratch_reg, Operand(ip));
Ben Murdochda12d292016-06-02 14:46:10 +01004720 and_(r0, r0, mask, SetRC);
4721 beq(&top_check, cr0);
4722 // The object is on a different page than allocation top. Bail out if the
4723 // object sits on the page boundary as no memento can follow and we cannot
4724 // touch the memory following it.
4725 xor_(r0, scratch_reg, receiver_reg);
4726 and_(r0, r0, mask, SetRC);
4727 bne(no_memento_found, cr0);
4728 // Continue with the actual map check.
4729 b(&map_check);
4730 // If top is on the same page as the current object, we need to check whether
4731 // we are below top.
4732 bind(&top_check);
Ben Murdochc5610432016-08-08 18:44:38 +01004733 cmp(scratch_reg, ip);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004734 bgt(no_memento_found);
Ben Murdochda12d292016-06-02 14:46:10 +01004735 // Memento map check.
4736 bind(&map_check);
4737 LoadP(scratch_reg, MemOperand(receiver_reg, kMementoMapOffset));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004738 Cmpi(scratch_reg, Operand(isolate()->factory()->allocation_memento_map()),
4739 r0);
4740}
4741
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004742Register GetRegisterThatIsNotOneOf(Register reg1, Register reg2, Register reg3,
4743 Register reg4, Register reg5,
4744 Register reg6) {
4745 RegList regs = 0;
4746 if (reg1.is_valid()) regs |= reg1.bit();
4747 if (reg2.is_valid()) regs |= reg2.bit();
4748 if (reg3.is_valid()) regs |= reg3.bit();
4749 if (reg4.is_valid()) regs |= reg4.bit();
4750 if (reg5.is_valid()) regs |= reg5.bit();
4751 if (reg6.is_valid()) regs |= reg6.bit();
4752
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004753 const RegisterConfiguration* config =
4754 RegisterConfiguration::ArchDefault(RegisterConfiguration::CRANKSHAFT);
4755 for (int i = 0; i < config->num_allocatable_general_registers(); ++i) {
4756 int code = config->GetAllocatableGeneralCode(i);
4757 Register candidate = Register::from_code(code);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004758 if (regs & candidate.bit()) continue;
4759 return candidate;
4760 }
4761 UNREACHABLE();
4762 return no_reg;
4763}
4764
4765
4766void MacroAssembler::JumpIfDictionaryInPrototypeChain(Register object,
4767 Register scratch0,
4768 Register scratch1,
4769 Label* found) {
4770 DCHECK(!scratch1.is(scratch0));
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004771 Register current = scratch0;
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004772 Label loop_again, end;
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004773
4774 // scratch contained elements pointer.
4775 mr(current, object);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004776 LoadP(current, FieldMemOperand(current, HeapObject::kMapOffset));
4777 LoadP(current, FieldMemOperand(current, Map::kPrototypeOffset));
4778 CompareRoot(current, Heap::kNullValueRootIndex);
4779 beq(&end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004780
4781 // Loop based on the map going up the prototype chain.
4782 bind(&loop_again);
4783 LoadP(current, FieldMemOperand(current, HeapObject::kMapOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004784
4785 STATIC_ASSERT(JS_PROXY_TYPE < JS_OBJECT_TYPE);
4786 STATIC_ASSERT(JS_VALUE_TYPE < JS_OBJECT_TYPE);
4787 lbz(scratch1, FieldMemOperand(current, Map::kInstanceTypeOffset));
4788 cmpi(scratch1, Operand(JS_OBJECT_TYPE));
4789 blt(found);
4790
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004791 lbz(scratch1, FieldMemOperand(current, Map::kBitField2Offset));
4792 DecodeField<Map::ElementsKindBits>(scratch1);
4793 cmpi(scratch1, Operand(DICTIONARY_ELEMENTS));
4794 beq(found);
4795 LoadP(current, FieldMemOperand(current, Map::kPrototypeOffset));
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004796 CompareRoot(current, Heap::kNullValueRootIndex);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004797 bne(&loop_again);
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004798
4799 bind(&end);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004800}
4801
4802
4803#ifdef DEBUG
4804bool AreAliased(Register reg1, Register reg2, Register reg3, Register reg4,
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004805 Register reg5, Register reg6, Register reg7, Register reg8,
4806 Register reg9, Register reg10) {
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004807 int n_of_valid_regs = reg1.is_valid() + reg2.is_valid() + reg3.is_valid() +
4808 reg4.is_valid() + reg5.is_valid() + reg6.is_valid() +
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004809 reg7.is_valid() + reg8.is_valid() + reg9.is_valid() +
4810 reg10.is_valid();
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004811
4812 RegList regs = 0;
4813 if (reg1.is_valid()) regs |= reg1.bit();
4814 if (reg2.is_valid()) regs |= reg2.bit();
4815 if (reg3.is_valid()) regs |= reg3.bit();
4816 if (reg4.is_valid()) regs |= reg4.bit();
4817 if (reg5.is_valid()) regs |= reg5.bit();
4818 if (reg6.is_valid()) regs |= reg6.bit();
4819 if (reg7.is_valid()) regs |= reg7.bit();
4820 if (reg8.is_valid()) regs |= reg8.bit();
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004821 if (reg9.is_valid()) regs |= reg9.bit();
4822 if (reg10.is_valid()) regs |= reg10.bit();
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004823 int n_of_non_aliasing_regs = NumRegs(regs);
4824
4825 return n_of_valid_regs != n_of_non_aliasing_regs;
4826}
4827#endif
4828
4829
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004830CodePatcher::CodePatcher(Isolate* isolate, byte* address, int instructions,
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004831 FlushICache flush_cache)
4832 : address_(address),
4833 size_(instructions * Assembler::kInstrSize),
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004834 masm_(isolate, address, size_ + Assembler::kGap, CodeObjectRequired::kNo),
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004835 flush_cache_(flush_cache) {
4836 // Create a new macro assembler pointing to the address of the code to patch.
4837 // The size is adjusted with kGap on order for the assembler to generate size
4838 // bytes of instructions without failing with buffer size constraints.
4839 DCHECK(masm_.reloc_info_writer.pos() == address_ + size_ + Assembler::kGap);
4840}
4841
4842
4843CodePatcher::~CodePatcher() {
4844 // Indicate that code has changed.
4845 if (flush_cache_ == FLUSH) {
Ben Murdoch4a90d5f2016-03-22 12:00:34 +00004846 Assembler::FlushICache(masm_.isolate(), address_, size_);
Emily Bernierd0a1eb72015-03-24 16:35:39 -04004847 }
4848
4849 // Check that the code was patched as expected.
4850 DCHECK(masm_.pc_ == address_ + size_);
4851 DCHECK(masm_.reloc_info_writer.pos() == address_ + size_ + Assembler::kGap);
4852}
4853
4854
4855void CodePatcher::Emit(Instr instr) { masm()->emit(instr); }
4856
4857
4858void CodePatcher::EmitCondition(Condition cond) {
4859 Instr instr = Assembler::instr_at(masm_.pc_);
4860 switch (cond) {
4861 case eq:
4862 instr = (instr & ~kCondMask) | BT;
4863 break;
4864 case ne:
4865 instr = (instr & ~kCondMask) | BF;
4866 break;
4867 default:
4868 UNIMPLEMENTED();
4869 }
4870 masm_.emit(instr);
4871}
4872
4873
4874void MacroAssembler::TruncatingDiv(Register result, Register dividend,
4875 int32_t divisor) {
4876 DCHECK(!dividend.is(result));
4877 DCHECK(!dividend.is(r0));
4878 DCHECK(!result.is(r0));
4879 base::MagicNumbersForDivision<uint32_t> mag =
4880 base::SignedDivisionByConstant(static_cast<uint32_t>(divisor));
4881 mov(r0, Operand(mag.multiplier));
4882 mulhw(result, dividend, r0);
4883 bool neg = (mag.multiplier & (static_cast<uint32_t>(1) << 31)) != 0;
4884 if (divisor > 0 && neg) {
4885 add(result, result, dividend);
4886 }
4887 if (divisor < 0 && !neg && mag.multiplier > 0) {
4888 sub(result, result, dividend);
4889 }
4890 if (mag.shift > 0) srawi(result, result, mag.shift);
4891 ExtractBit(r0, dividend, 31);
4892 add(result, result, r0);
4893}
4894
4895} // namespace internal
4896} // namespace v8
4897
4898#endif // V8_TARGET_ARCH_PPC