Lines Matching refs:right
190 // which we would need to shift right the high part of the mantissa.
371 // For equal we already have the right value in r0: Return zero (equal)
596 CompareICStub_CheckInputType(masm, rhs, r3, right(), &miss);
1714 // We loop from right to left.
2949 // Arithmetic shift right by one un-smi-tags. In this case we rotate right
3150 MacroAssembler* masm, Register left, Register right, Register scratch1,
3157 __ ldr(scratch2, FieldMemOperand(right, String::kLengthOffset));
3175 GenerateOneByteCharsCompareLoop(masm, left, right, length, scratch2, scratch3,
3185 MacroAssembler* masm, Register left, Register right, Register scratch1,
3190 __ ldr(scratch2, FieldMemOperand(right, String::kLengthOffset));
3200 GenerateOneByteCharsCompareLoop(masm, left, right, min_length, scratch2,
3218 MacroAssembler* masm, Register left, Register right, Register length,
3227 __ add(right, right, Operand(scratch1));
3235 __ ldrb(scratch2, MemOperand(right, index));
3249 // sp[0]: right string
3251 __ Ldrd(r0 , r1, MemOperand(sp)); // Load right in r0, left in r1.
3283 // -- r0 : right
3342 if (right() == CompareICState::SMI) {
3348 // Load left and right operand.
3413 // Registers containing left and right operands respectively.
3415 Register right = r0;
3420 __ JumpIfEitherSmi(left, right, &miss);
3424 __ ldr(tmp2, FieldMemOperand(right, HeapObject::kMapOffset));
3433 __ cmp(left, right);
3436 DCHECK(right.is(r0));
3452 // Registers containing left and right operands respectively.
3454 Register right = r0;
3459 __ JumpIfEitherSmi(left, right, &miss);
3464 __ ldr(tmp2, FieldMemOperand(right, HeapObject::kMapOffset));
3472 __ cmp(left, right);
3475 DCHECK(right.is(r0));
3492 // Registers containing left and right operands respectively.
3494 Register right = r0;
3501 __ JumpIfEitherSmi(left, right, &miss);
3506 __ ldr(tmp2, FieldMemOperand(right, HeapObject::kMapOffset));
3515 __ cmp(left, right);
3533 DCHECK(right.is(r0));
3544 StringHelper::GenerateFlatOneByteStringEquals(masm, left, right, tmp1, tmp2,
3547 StringHelper::GenerateCompareFlatOneByteStrings(masm, left, right, tmp1,
3553 __ Push(left, right);
3756 // Add the probe offset (i + i * i) left shifted to avoid right shifting
3757 // the hash in a separate instruction. The value hash + i + i * i is right
3838 // Add the probe offset (i + i * i) left shifted to avoid right shifting
3839 // the hash in a separate instruction. The value hash + i + i * i is right
4509 // Figure out the right elements kind