| Index: src/arm/full-codegen-arm.cc
|
| diff --git a/src/arm/full-codegen-arm.cc b/src/arm/full-codegen-arm.cc
|
| index 0f182f8475493c4c997fcd28a227629579973a80..aaeb0eee9acdcc9cf6b78ded2d562229f292f90e 100644
|
| --- a/src/arm/full-codegen-arm.cc
|
| +++ b/src/arm/full-codegen-arm.cc
|
| @@ -149,7 +149,7 @@ void FullCodeGenerator::Generate() {
|
| // function calls.
|
| if (!info->is_classic_mode() || info->is_native()) {
|
| Label ok;
|
| - __ cmp(r5, Operand(0));
|
| + __ cmp(r5, Operand::Zero());
|
| __ b(eq, &ok);
|
| int receiver_offset = info->scope()->num_parameters() * kPointerSize;
|
| __ LoadRoot(r2, Heap::kUndefinedValueRootIndex);
|
| @@ -1039,7 +1039,7 @@ void FullCodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
|
| CallIC(ic, RelocInfo::CODE_TARGET, clause->CompareId());
|
| patch_site.EmitPatchInfo();
|
|
|
| - __ cmp(r0, Operand(0));
|
| + __ cmp(r0, Operand::Zero());
|
| __ b(ne, &next_test);
|
| __ Drop(1); // Switch value is no longer needed.
|
| __ b(clause->body_target());
|
| @@ -1991,7 +1991,7 @@ void FullCodeGenerator::EmitInlineSmiBinaryOp(BinaryOperation* expr,
|
| __ mov(ip, Operand(scratch1, ASR, 31));
|
| __ cmp(ip, Operand(scratch2));
|
| __ b(ne, &stub_call);
|
| - __ cmp(scratch1, Operand(0));
|
| + __ cmp(scratch1, Operand::Zero());
|
| __ mov(right, Operand(scratch1), LeaveCC, ne);
|
| __ b(ne, &done);
|
| __ add(scratch2, right, Operand(left), SetCC);
|
| @@ -2687,7 +2687,7 @@ void FullCodeGenerator::EmitIsStringWrapperSafeForDefaultValueOf(
|
|
|
| // Skip loop if no descriptors are valid.
|
| __ NumberOfOwnDescriptors(r3, r1);
|
| - __ cmp(r3, Operand(0));
|
| + __ cmp(r3, Operand::Zero());
|
| __ b(eq, &done);
|
|
|
| __ LoadInstanceDescriptors(r1, r4);
|
| @@ -3018,7 +3018,7 @@ void FullCodeGenerator::EmitRandomHeapNumber(CallRuntime* expr) {
|
| // Move 0x41300000xxxxxxxx (x = random bits) to VFP.
|
| __ vmov(d7, r0, r1);
|
| // Move 0x4130000000000000 to VFP.
|
| - __ mov(r0, Operand(0, RelocInfo::NONE32));
|
| + __ mov(r0, Operand::Zero());
|
| __ vmov(d8, r0, r1);
|
| // Subtract and store the result in the heap number.
|
| __ vsub(d7, d7, d8);
|
| @@ -3634,7 +3634,7 @@ void FullCodeGenerator::EmitFastAsciiArrayJoin(CallRuntime* expr) {
|
|
|
| // Check that all array elements are sequential ASCII strings, and
|
| // accumulate the sum of their lengths, as a smi-encoded value.
|
| - __ mov(string_length, Operand(0));
|
| + __ mov(string_length, Operand::Zero());
|
| __ add(element,
|
| elements, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
|
| __ add(elements_end, element, Operand(array_length, LSL, kPointerSizeLog2));
|
| @@ -3647,7 +3647,7 @@ void FullCodeGenerator::EmitFastAsciiArrayJoin(CallRuntime* expr) {
|
| // element: Current array element.
|
| // elements_end: Array end.
|
| if (generate_debug_code_) {
|
| - __ cmp(array_length, Operand(0));
|
| + __ cmp(array_length, Operand::Zero());
|
| __ Assert(gt, "No empty arrays here in EmitFastAsciiArrayJoin");
|
| }
|
| __ bind(&loop);
|
| @@ -3690,7 +3690,7 @@ void FullCodeGenerator::EmitFastAsciiArrayJoin(CallRuntime* expr) {
|
| __ smull(scratch2, ip, array_length, scratch1);
|
| // Check for smi overflow. No overflow if higher 33 bits of 64-bit result are
|
| // zero.
|
| - __ cmp(ip, Operand(0));
|
| + __ cmp(ip, Operand::Zero());
|
| __ b(ne, &bailout);
|
| __ tst(scratch2, Operand(0x80000000));
|
| __ b(ne, &bailout);
|
| @@ -4357,7 +4357,7 @@ void FullCodeGenerator::VisitCompareOperation(CompareOperation* expr) {
|
| CallIC(ic, RelocInfo::CODE_TARGET, expr->CompareOperationFeedbackId());
|
| patch_site.EmitPatchInfo();
|
| PrepareForBailoutBeforeSplit(expr, true, if_true, if_false);
|
| - __ cmp(r0, Operand(0));
|
| + __ cmp(r0, Operand::Zero());
|
| Split(cond, if_true, if_false, fall_through);
|
| }
|
| }
|
|
|