Use the iOS ABI when running SIMARM on Mac or targeting iOS.

runtime/vm/intrinsifier_arm.cc

 // Copyright (c) 2013, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/globals.h"  // Needed here to get TARGET_ARCH_ARM.
 #if defined(TARGET_ARCH_ARM)
 
 #include "vm/intrinsifier.h"
 
 #include "vm/assembler.h"
@@ skipping 513 matching lines @@
 
   // Arguments are Smi but the shift produced an overflow to Mint.
   __ CompareImmediate(R1, 0);
   __ b(&fall_through, LT);
   __ SmiUntag(R1);
 
   // Pull off high bits that will be shifted off of R1 by making a mask
   // ((1 << R0) - 1), shifting it to the left, masking R1, then shifting back.
   // high bits = (((1 << R0) - 1) << (32 - R0)) & R1) >> (32 - R0)
   // lo bits = R1 << R0
-  __ LoadImmediate(R7, 1);
-  __ mov(R7, Operand(R7, LSL, R0));  // R7 <- 1 << R0
-  __ sub(R7, R7, Operand(1));  // R7 <- R7 - 1
+  __ LoadImmediate(R711, 1);
+  __ mov(R711, Operand(R711, LSL, R0));  // R711 <- 1 << R0
+  __ sub(R711, R711, Operand(1));  // R711 <- R711 - 1
   __ rsb(R6, R0, Operand(32));  // R6 <- 32 - R0
-  __ mov(R7, Operand(R7, LSL, R6));  // R7 <- R7 << R6
-  __ and_(R7, R1, Operand(R7));  // R7 <- R7 & R1
-  __ mov(R7, Operand(R7, LSR, R6));  // R7 <- R7 >> R6
-  // Now R7 has the bits that fall off of R1 on a left shift.
+  __ mov(R711, Operand(R711, LSL, R6));  // R711 <- R711 << R6
+  __ and_(R711, R1, Operand(R711));  // R711 <- R711 & R1
+  __ mov(R711, Operand(R711, LSR, R6));  // R711 <- R711 >> R6
+  // Now R711 has the bits that fall off of R1 on a left shift.
   __ mov(R1, Operand(R1, LSL, R0));  // R1 gets the low bits.
 
   const Class& mint_class = Class::Handle(
       Isolate::Current()->object_store()->mint_class());
   __ TryAllocate(mint_class, &fall_through, R0, R2);
 
 
   __ str(R1, FieldAddress(R0, Mint::value_offset()));
-  __ str(R7, FieldAddress(R0, Mint::value_offset() + kWordSize));
+  __ str(R711, FieldAddress(R0, Mint::value_offset() + kWordSize));
   __ Pop(R6);
   __ Ret();
   __ Bind(&fall_through);
   ASSERT(CODE_REG == R6);
   __ Pop(R6);
 }
 
 
 static void Get64SmiOrMint(Assembler* assembler,
                            Register res_hi,
@@ skipping 53 matching lines @@
       break;
     default:
       UNREACHABLE();
       hi_true_cond = hi_false_cond = lo_false_cond = VS;
   }
 
   __ Bind(&try_mint_smi);
   // Get left as 64 bit integer.
   Get64SmiOrMint(assembler, R3, R2, R1, &fall_through);
   // Get right as 64 bit integer.
-  Get64SmiOrMint(assembler, R7, R8, R0, &fall_through);
+  Get64SmiOrMint(assembler, R711, R8, R0, &fall_through);
   // R3: left high.
   // R2: left low.
-  // R7: right high.
+  // R711: right high.
   // R8: right low.
 
-  __ cmp(R3, Operand(R7));  // Compare left hi, right high.
+  __ cmp(R3, Operand(R711));  // Compare left hi, right high.
   __ b(&is_false, hi_false_cond);
   __ b(&is_true, hi_true_cond);
   __ cmp(R2, Operand(R8));  // Compare left lo, right lo.
   __ b(&is_false, lo_false_cond);
   // Else is true.
   __ b(&is_true);
 
   __ Bind(&fall_through);
 }
 
@@ skipping 128 matching lines @@
 
   // R0 = x_used, R1 = x_digits, x_used > 0, x_used is Smi.
   __ ldrd(R0, R1, SP, 2 * kWordSize);
   // R2 = r_digits, R3 = n, n is Smi, n % _DIGIT_BITS != 0.
   __ ldrd(R2, R3, SP, 0 * kWordSize);
   __ SmiUntag(R3);
   // R4 = n ~/ _DIGIT_BITS
   __ Asr(R4, R3, Operand(5));
   // R8 = &x_digits[0]
   __ add(R8, R1, Operand(TypedData::data_offset() - kHeapObjectTag));
-  // R7 = &x_digits[x_used]
-  __ add(R7, R8, Operand(R0, LSL, 1));
+  // R711 = &x_digits[x_used]
+  __ add(R711, R8, Operand(R0, LSL, 1));
   // R6 = &r_digits[1]
   __ add(R6, R2, Operand(TypedData::data_offset() - kHeapObjectTag +
                          Bigint::kBytesPerDigit));
   // R6 = &r_digits[x_used + n ~/ _DIGIT_BITS + 1]
   __ add(R4, R4, Operand(R0, ASR, 1));
   __ add(R6, R6, Operand(R4, LSL, 2));
   // R1 = n % _DIGIT_BITS
   __ and_(R1, R3, Operand(31));
   // R0 = 32 - R1
   __ rsb(R0, R1, Operand(32));
   __ mov(R9, Operand(0));
   Label loop;
   __ Bind(&loop);
-  __ ldr(R4, Address(R7, -Bigint::kBytesPerDigit, Address::PreIndex));
+  __ ldr(R4, Address(R711, -Bigint::kBytesPerDigit, Address::PreIndex));
   __ orr(R9, R9, Operand(R4, LSR, R0));
   __ str(R9, Address(R6, -Bigint::kBytesPerDigit, Address::PreIndex));
   __ mov(R9, Operand(R4, LSL, R1));
-  __ teq(R7, Operand(R8));
+  __ teq(R711, Operand(R8));
   __ b(&loop, NE);
   __ str(R9, Address(R6, -Bigint::kBytesPerDigit, Address::PreIndex));
   // Returning Object::null() is not required, since this method is private.
   __ Ret();
 }
 
 
 void Intrinsifier::Bigint_rsh(Assembler* assembler) {
   // static void _lsh(Uint32List x_digits, int x_used, int n,
   //                  Uint32List r_digits)
 
   // R0 = x_used, R1 = x_digits, x_used > 0, x_used is Smi.
   __ ldrd(R0, R1, SP, 2 * kWordSize);
   // R2 = r_digits, R3 = n, n is Smi, n % _DIGIT_BITS != 0.
   __ ldrd(R2, R3, SP, 0 * kWordSize);
   __ SmiUntag(R3);
   // R4 = n ~/ _DIGIT_BITS
   __ Asr(R4, R3, Operand(5));
   // R6 = &r_digits[0]
   __ add(R6, R2, Operand(TypedData::data_offset() - kHeapObjectTag));
-  // R7 = &x_digits[n ~/ _DIGIT_BITS]
-  __ add(R7, R1, Operand(TypedData::data_offset() - kHeapObjectTag));
-  __ add(R7, R7, Operand(R4, LSL, 2));
+  // R711 = &x_digits[n ~/ _DIGIT_BITS]
+  __ add(R711, R1, Operand(TypedData::data_offset() - kHeapObjectTag));
+  __ add(R711, R711, Operand(R4, LSL, 2));
   // R8 = &r_digits[x_used - n ~/ _DIGIT_BITS - 1]
   __ add(R4, R4, Operand(1));
   __ rsb(R4, R4, Operand(R0, ASR, 1));
   __ add(R8, R6, Operand(R4, LSL, 2));
   // R1 = n % _DIGIT_BITS
   __ and_(R1, R3, Operand(31));
   // R0 = 32 - R1
   __ rsb(R0, R1, Operand(32));
   // R9 = x_digits[n ~/ _DIGIT_BITS] >> (n % _DIGIT_BITS)
-  __ ldr(R9, Address(R7, Bigint::kBytesPerDigit, Address::PostIndex));
+  __ ldr(R9, Address(R711, Bigint::kBytesPerDigit, Address::PostIndex));
   __ mov(R9, Operand(R9, LSR, R1));
   Label loop_entry;
   __ b(&loop_entry);
   Label loop;
   __ Bind(&loop);
-  __ ldr(R4, Address(R7, Bigint::kBytesPerDigit, Address::PostIndex));
+  __ ldr(R4, Address(R711, Bigint::kBytesPerDigit, Address::PostIndex));
   __ orr(R9, R9, Operand(R4, LSL, R0));
   __ str(R9, Address(R6, Bigint::kBytesPerDigit, Address::PostIndex));
   __ mov(R9, Operand(R4, LSR, R1));
   __ Bind(&loop_entry);
   __ teq(R6, Operand(R8));
   __ b(&loop, NE);
   __ str(R9, Address(R6, 0));
   // Returning Object::null() is not required, since this method is private.
   __ Ret();
 }
@@ skipping 12 matching lines @@
   // R2 = a_used, R3 = a_digits
   __ ldrd(R2, R3, SP, 1 * kWordSize);
   // R3 = &a_digits[0]
   __ add(R3, R3, Operand(TypedData::data_offset() - kHeapObjectTag));
 
   // R8 = r_digits
   __ ldr(R8, Address(SP, 0 * kWordSize));
   // R8 = &r_digits[0]
   __ add(R8, R8, Operand(TypedData::data_offset() - kHeapObjectTag));
 
-  // R7 = &digits[a_used >> 1], a_used is Smi.
-  __ add(R7, R1, Operand(R2, LSL, 1));
+  // R711 = &digits[a_used >> 1], a_used is Smi.
+  __ add(R711, R1, Operand(R2, LSL, 1));
 
   // R6 = &digits[used >> 1], used is Smi.
   __ add(R6, R1, Operand(R0, LSL, 1));
 
   __ adds(R4, R4, Operand(0));  // carry flag = 0
   Label add_loop;
   __ Bind(&add_loop);
   // Loop a_used times, a_used > 0.
   __ ldr(R4, Address(R1, Bigint::kBytesPerDigit, Address::PostIndex));
   __ ldr(R9, Address(R3, Bigint::kBytesPerDigit, Address::PostIndex));
   __ adcs(R4, R4, Operand(R9));
-  __ teq(R1, Operand(R7));  // Does not affect carry flag.
+  __ teq(R1, Operand(R711));  // Does not affect carry flag.
   __ str(R4, Address(R8, Bigint::kBytesPerDigit, Address::PostIndex));
   __ b(&add_loop, NE);
 
   Label last_carry;
   __ teq(R1, Operand(R6));  // Does not affect carry flag.
   __ b(&last_carry, EQ);  // If used - a_used == 0.
 
   Label carry_loop;
   __ Bind(&carry_loop);
   // Loop used - a_used times, used - a_used > 0.
@@ skipping 26 matching lines @@
   // R2 = a_used, R3 = a_digits
   __ ldrd(R2, R3, SP, 1 * kWordSize);
   // R3 = &a_digits[0]
   __ add(R3, R3, Operand(TypedData::data_offset() - kHeapObjectTag));
 
   // R8 = r_digits
   __ ldr(R8, Address(SP, 0 * kWordSize));
   // R8 = &r_digits[0]
   __ add(R8, R8, Operand(TypedData::data_offset() - kHeapObjectTag));
 
-  // R7 = &digits[a_used >> 1], a_used is Smi.
-  __ add(R7, R1, Operand(R2, LSL, 1));
+  // R711 = &digits[a_used >> 1], a_used is Smi.
+  __ add(R711, R1, Operand(R2, LSL, 1));
 
   // R6 = &digits[used >> 1], used is Smi.
   __ add(R6, R1, Operand(R0, LSL, 1));
 
   __ subs(R4, R4, Operand(0));  // carry flag = 1
   Label sub_loop;
   __ Bind(&sub_loop);
   // Loop a_used times, a_used > 0.
   __ ldr(R4, Address(R1, Bigint::kBytesPerDigit, Address::PostIndex));
   __ ldr(R9, Address(R3, Bigint::kBytesPerDigit, Address::PostIndex));
   __ sbcs(R4, R4, Operand(R9));
-  __ teq(R1, Operand(R7));  // Does not affect carry flag.
+  __ teq(R1, Operand(R711));  // Does not affect carry flag.
   __ str(R4, Address(R8, Bigint::kBytesPerDigit, Address::PostIndex));
   __ b(&sub_loop, NE);
 
   Label done;
   __ teq(R1, Operand(R6));  // Does not affect carry flag.
   __ b(&done, EQ);  // If used - a_used == 0.
 
   Label carry_loop;
   __ Bind(&carry_loop);
   // Loop used - a_used times, used - a_used > 0.
@@ skipping 142 matching lines @@
   __ ldrd(R2, R3, SP, 2 * kWordSize);  // R2 = i as Smi, R3 = x_digits
   __ add(R3, R3, Operand(R2, LSL, 1));
   __ add(R4, R3, Operand(TypedData::data_offset() - kHeapObjectTag));
 
   // R3 = x = *xip++, return if x == 0
   Label x_zero;
   __ ldr(R3, Address(R4, Bigint::kBytesPerDigit, Address::PostIndex));
   __ tst(R3, Operand(R3));
   __ b(&x_zero, EQ);
 
-  // R7 = ajp = &a_digits[i]
+  // R711 = ajp = &a_digits[i]
   __ ldr(R1, Address(SP, 1 * kWordSize));  // a_digits
   __ add(R1, R1, Operand(R2, LSL, 2));  // j == 2*i, i is Smi.
-  __ add(R7, R1, Operand(TypedData::data_offset() - kHeapObjectTag));
+  __ add(R711, R1, Operand(TypedData::data_offset() - kHeapObjectTag));
 
   // R8:R0 = t = x*x + *ajp
-  __ ldr(R0, Address(R7, 0));
+  __ ldr(R0, Address(R711, 0));
   __ mov(R8, Operand(0));
   __ umaal(R0, R8, R3, R3);  // R8:R0 = R3*R3 + R8 + R0.
 
   // *ajp++ = low32(t) = R0
-  __ str(R0, Address(R7, Bigint::kBytesPerDigit, Address::PostIndex));
+  __ str(R0, Address(R711, Bigint::kBytesPerDigit, Address::PostIndex));
 
   // R8 = low32(c) = high32(t)
   // R9 = high32(c) = 0
   __ mov(R9, Operand(0));
 
   // int n = used - i - 1; while (--n >= 0) ...
   __ ldr(R0, Address(SP, 0 * kWordSize));  // used is Smi
   __ sub(R6, R0, Operand(R2));
   __ mov(R0, Operand(2));  // n = used - i - 2; if (n >= 0) ... while (--n >= 0)
   __ rsbs(R6, R0, Operand(R6, ASR, kSmiTagSize));
 
   Label loop, done;
   __ b(&done, MI);
 
   __ Bind(&loop);
   // x:   R3
   // xip: R4
-  // ajp: R7
+  // ajp: R711
   // c:   R9:R8
   // t:   R2:R1:R0 (not live at loop entry)
   // n:   R6
 
   // uint32_t xi = *xip++
   __ ldr(R2, Address(R4, Bigint::kBytesPerDigit, Address::PostIndex));
 
   // uint96_t t = R9:R8:R0 = 2*x*xi + aj + c
   __ umull(R0, R1, R2, R3);  // R1:R0 = R2*R3.
   __ adds(R0, R0, Operand(R0));
   __ adcs(R1, R1, Operand(R1));
   __ mov(R2, Operand(0));
   __ adc(R2, R2, Operand(0));  // R2:R1:R0 = 2*x*xi.
   __ adds(R0, R0, Operand(R8));
   __ adcs(R1, R1, Operand(R9));
   __ adc(R2, R2, Operand(0));  // R2:R1:R0 = 2*x*xi + c.
-  __ ldr(R8, Address(R7, 0));  // R8 = aj = *ajp.
+  __ ldr(R8, Address(R711, 0));  // R8 = aj = *ajp.
   __ adds(R0, R0, Operand(R8));
   __ adcs(R8, R1, Operand(0));
   __ adc(R9, R2, Operand(0));  // R9:R8:R0 = 2*x*xi + c + aj.
 
   // *ajp++ = low32(t) = R0
-  __ str(R0, Address(R7, Bigint::kBytesPerDigit, Address::PostIndex));
+  __ str(R0, Address(R711, Bigint::kBytesPerDigit, Address::PostIndex));
 
   // while (--n >= 0)
   __ subs(R6, R6, Operand(1));  // --n
   __ b(&loop, PL);
 
   __ Bind(&done);
   // uint32_t aj = *ajp
-  __ ldr(R0, Address(R7, 0));
+  __ ldr(R0, Address(R711, 0));
 
   // uint64_t t = aj + c
   __ adds(R8, R8, Operand(R0));
   __ adc(R9, R9, Operand(0));
 
   // *ajp = low32(t) = R8
   // *(ajp + 1) = high32(t) = R9
-  __ strd(R8, R9, R7, 0);
+  __ strd(R8, R9, R711, 0);
 
   __ Bind(&x_zero);
   __ mov(R0, Operand(Smi::RawValue(1)));  // One digit processed.
   __ Ret();
 }
 
 
 void Intrinsifier::Bigint_estQuotientDigit(Assembler* assembler) {
   // No unsigned 64-bit / 32-bit divide instruction.
 }
@@ skipping 485 matching lines @@
   // R8: String data.
   // R0: Hash code, untagged integer.
 
   Label loop;
   // Add to hash code: (hash_ is uint32)
   // hash_ += ch;
   // hash_ += hash_ << 10;
   // hash_ ^= hash_ >> 6;
   // Get one characters (ch).
   __ Bind(&loop);
-  __ ldrb(R7, Address(R8, 0));
-  // R7: ch.
+  __ ldrb(R711, Address(R8, 0));
+  // R711: ch.
   __ add(R3, R3, Operand(1));
   __ add(R8, R8, Operand(1));
-  __ add(R0, R0, Operand(R7));
+  __ add(R0, R0, Operand(R711));
   __ add(R0, R0, Operand(R0, LSL, 10));
   __ eor(R0, R0, Operand(R0, LSR, 6));
   __ cmp(R3, Operand(R2));
   __ b(&loop, NE);
 
   // Finalize.
   // hash_ += hash_ << 3;
   // hash_ ^= hash_ >> 11;
   // hash_ += hash_ << 15;
   __ add(R0, R0, Operand(R0, LSL, 3));
@@ skipping 37 matching lines @@
 
   // length_reg: allocation size.
   __ adds(R1, R0, Operand(length_reg));
   __ b(&fail, CS);  // Fail on unsigned overflow.
 
   // Check if the allocation fits into the remaining space.
   // R0: potential new object start.
   // R1: potential next object start.
   // R2: allocation size.
   // R3: heap.
-  __ ldr(R7, Address(R3, Heap::EndOffset(space)));
-  __ cmp(R1, Operand(R7));
+  __ ldr(R711, Address(R3, Heap::EndOffset(space)));
+  __ cmp(R1, Operand(R711));
   __ b(&fail, CS);
 
   // Successfully allocated the object(s), now update top to point to
   // next object start and initialize the object.
   __ LoadAllocationStatsAddress(R4, cid, /* inline_isolate = */ false);
   __ str(R1, Address(R3, Heap::TopOffset(space)));
   __ AddImmediate(R0, kHeapObjectTag);
 
   // Initialize the tags.
   // R0: new object start as a tagged pointer.
@@ skipping 63 matching lines @@
   // R3: Start address to copy from (untagged).
   // R1: Untagged start index.
   __ ldr(R2, Address(SP, kEndIndexOffset));
   __ SmiUntag(R2);
   __ sub(R2, R2, Operand(R1));
 
   // R3: Start address to copy from (untagged).
   // R2: Untagged number of bytes to copy.
   // R0: Tagged result string.
   // R8: Pointer into R3.
-  // R7: Pointer into R0.
+  // R711: Pointer into R0.
   // R1: Scratch register.
   Label loop, done;
   __ cmp(R2, Operand(0));
   __ b(&done, LE);
   __ mov(R8, Operand(R3));
-  __ mov(R7, Operand(R0));
+  __ mov(R711, Operand(R0));
   __ Bind(&loop);
   __ ldrb(R1, Address(R8, 0));
   __ AddImmediate(R8, 1);
   __ sub(R2, R2, Operand(1));
   __ cmp(R2, Operand(0));
-  __ strb(R1, FieldAddress(R7, OneByteString::data_offset()));
-  __ AddImmediate(R7, 1);
+  __ strb(R1, FieldAddress(R711, OneByteString::data_offset()));
+  __ AddImmediate(R711, 1);
   __ b(&loop, GT);
 
   __ Bind(&done);
   __ Ret();
   __ Bind(&fall_through);
 }
 
 
 void Intrinsifier::OneByteStringSetAt(Assembler* assembler) {
   __ ldr(R2, Address(SP, 0 * kWordSize));  // Value.
@@ skipping 152 matching lines @@
 
 void Intrinsifier::Profiler_getCurrentTag(Assembler* assembler) {
   __ LoadIsolate(R0);
   __ ldr(R0, Address(R0, Isolate::current_tag_offset()));
   __ Ret();
 }
 
 }  // namespace dart
 
 #endif  // defined TARGET_ARCH_ARM