Chromium Code Reviews| Index: src/arm/stub-cache-arm.cc |
| diff --git a/src/arm/stub-cache-arm.cc b/src/arm/stub-cache-arm.cc |
| index 659f29c3647cbd9634af24c5e4eaceb22550fff9..97f94952d7dc30d44b911d13f57c59fa07b22e42 100644 |
| --- a/src/arm/stub-cache-arm.cc |
| +++ b/src/arm/stub-cache-arm.cc |
| @@ -1643,6 +1643,108 @@ Object* CallStubCompiler::CompileMathFloorCall(Object* object, |
| } |
| +Object* CallStubCompiler::CompileMathAbsCall(Object* object, |
| + JSObject* holder, |
| + JSGlobalPropertyCell* cell, |
| + JSFunction* function, |
| + String* name) { |
| + // ----------- S t a t e ------------- |
| + // -- r2 : function name |
| + // -- lr : return address |
| + // -- sp[(argc - n - 1) * 4] : arg[n] (zero-based) |
| + // -- ... |
| + // -- sp[argc * 4] : receiver |
| + // ----------------------------------- |
| + |
| + const int argc = arguments().immediate(); |
| + |
| + // If the object is not a JSObject or we got an unexpected number of |
| + // arguments, bail out to the regular call. |
| + if (!object->IsJSObject() || argc != 1) return Heap::undefined_value(); |
| + |
| + Label miss; |
| + GenerateNameCheck(name, &miss); |
| + |
| + if (cell == NULL) { |
| + __ ldr(r1, MemOperand(sp, 1 * kPointerSize)); |
| + |
| + STATIC_ASSERT(kSmiTag == 0); |
|
antonm
2010/09/28 12:04:17
BranchOnSmi(r1, miss)?
|
| + __ tst(r1, Operand(kSmiTagMask)); |
| + __ b(eq, &miss); |
| + |
| + CheckPrototypes(JSObject::cast(object), r1, holder, r0, r3, r4, name, |
| + &miss); |
| + } else { |
| + ASSERT(cell->value() == function); |
| + GenerateGlobalReceiverCheck(JSObject::cast(object), holder, name, &miss); |
| + GenerateLoadFunctionFromCell(cell, function, &miss); |
| + } |
| + |
| + // Load the (only) argument into r0. |
| + __ ldr(r0, MemOperand(sp, 0 * kPointerSize)); |
| + |
| + // Check if the argument is a smi. |
| + Label not_smi; |
| + STATIC_ASSERT(kSmiTag == 0); |
| + __ BranchOnNotSmi(r0, ¬_smi); |
| + |
| + // Do bitwise not or do nothing depending on the sign of the |
| + // argument. |
| + __ eor(r1, r0, Operand(r0, ASR, kBitsPerInt - 1)); |
| + |
| + // Add 1 or do nothing depending on the sign of the argument. |
| + __ sub(r0, r1, Operand(r0, ASR, kBitsPerInt - 1), SetCC); |
| + |
| + // If the result is still negative, go to the slow case. |
| + // This only happens for the most negative smi. |
| + Label slow; |
| + __ b(mi, &slow); |
| + |
| + // Smi case done. |
| + __ Drop(argc + 1); |
| + __ Ret(); |
| + |
| + // Check if the argument is a heap number and load its exponent and |
| + // sign. |
| + __ bind(¬_smi); |
| + __ CheckMap(r0, r1, Heap::kHeapNumberMapRootIndex, &slow, true); |
| + __ ldr(r1, FieldMemOperand(r0, HeapNumber::kExponentOffset)); |
| + |
| + // Check the sign of the argument. If the argument is positive, |
| + // just return it. |
| + Label negative_sign; |
| + __ tst(r1, Operand(HeapNumber::kSignMask)); |
| + __ b(ne, &negative_sign); |
| + __ Drop(argc + 1); |
| + __ Ret(); |
| + |
| + // If the argument is negative, clear the sign, and return a new |
| + // number. |
| + __ bind(&negative_sign); |
| + __ eor(r1, r1, Operand(HeapNumber::kSignMask)); |
| + __ ldr(r3, FieldMemOperand(r0, HeapNumber::kMantissaOffset)); |
| + __ LoadRoot(r6, Heap::kHeapNumberMapRootIndex); |
| + __ AllocateHeapNumber(r0, r4, r5, r6, &slow); |
| + __ str(r1, FieldMemOperand(r0, HeapNumber::kExponentOffset)); |
| + __ str(r3, FieldMemOperand(r0, HeapNumber::kMantissaOffset)); |
| + __ Drop(argc + 1); |
| + __ Ret(); |
| + |
| + // Tail call the full function. We do not have to patch the receiver |
| + // because the function makes no use of it. |
| + __ bind(&slow); |
| + __ InvokeFunction(function, arguments(), JUMP_FUNCTION); |
| + |
| + __ bind(&miss); |
| + // r2: function name. |
| + Object* obj = GenerateMissBranch(); |
| + if (obj->IsFailure()) return obj; |
| + |
| + // Return the generated code. |
| + return (cell == NULL) ? GetCode(function) : GetCode(NORMAL, name); |
| +} |
| + |
| + |
| Object* CallStubCompiler::CompileCallConstant(Object* object, |
| JSObject* holder, |
| JSFunction* function, |