| Index: src/mips/stub-cache-mips.cc
|
| diff --git a/src/mips/stub-cache-mips.cc b/src/mips/stub-cache-mips.cc
|
| index b7948b14d63f0b666f9d8c032bd8043a0d87c350..23ef6ece97ea53c6463a48e40c07286fb37b250e 100644
|
| --- a/src/mips/stub-cache-mips.cc
|
| +++ b/src/mips/stub-cache-mips.cc
|
| @@ -1107,7 +1107,7 @@ void StubCompiler::GenerateTailCall(MacroAssembler* masm, Handle<Code> code) {
|
| #define __ ACCESS_MASM(masm())
|
|
|
|
|
| -Register StubCompiler::CheckPrototypes(Handle<Type> type,
|
| +Register StubCompiler::CheckPrototypes(Handle<HeapType> type,
|
| Register object_reg,
|
| Handle<JSObject> holder,
|
| Register holder_reg,
|
| @@ -1253,7 +1253,7 @@ void StoreStubCompiler::HandlerFrontendFooter(Handle<Name> name, Label* miss) {
|
|
|
|
|
| Register LoadStubCompiler::CallbackHandlerFrontend(
|
| - Handle<Type> type,
|
| + Handle<HeapType> type,
|
| Register object_reg,
|
| Handle<JSObject> holder,
|
| Handle<Name> name,
|
| @@ -1556,723 +1556,6 @@ Handle<Code> CallStubCompiler::CompileCallField(Handle<JSObject> object,
|
| }
|
|
|
|
|
| -Handle<Code> CallStubCompiler::CompileArrayCodeCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - Label miss;
|
| -
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| - if (!cell.is_null()) {
|
| - ASSERT(cell->value() == *function);
|
| - GenerateLoadFunctionFromCell(cell, function, &miss);
|
| - }
|
| -
|
| - Handle<AllocationSite> site = isolate()->factory()->NewAllocationSite();
|
| - site->SetElementsKind(GetInitialFastElementsKind());
|
| - Handle<Cell> site_feedback_cell = isolate()->factory()->NewCell(site);
|
| - const int argc = arguments().immediate();
|
| - __ li(a0, Operand(argc));
|
| - __ li(a2, Operand(site_feedback_cell));
|
| - __ li(a1, Operand(function));
|
| -
|
| - ArrayConstructorStub stub(isolate());
|
| - __ TailCallStub(&stub);
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileArrayPushCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - // If object is not an array or is observed or sealed, bail out to regular
|
| - // call.
|
| - if (!object->IsJSArray() ||
|
| - !cell.is_null() ||
|
| - Handle<JSArray>::cast(object)->map()->is_observed() ||
|
| - !Handle<JSArray>::cast(object)->map()->is_extensible()) {
|
| - return Handle<Code>::null();
|
| - }
|
| -
|
| - Label miss;
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| - Register receiver = a0;
|
| - Register scratch = a1;
|
| -
|
| - const int argc = arguments().immediate();
|
| -
|
| - if (argc == 0) {
|
| - // Nothing to do, just return the length.
|
| - __ lw(v0, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - __ DropAndRet(argc + 1);
|
| - } else {
|
| - Label call_builtin;
|
| - if (argc == 1) { // Otherwise fall through to call the builtin.
|
| - Label attempt_to_grow_elements, with_write_barrier, check_double;
|
| -
|
| - Register elements = t2;
|
| - Register end_elements = t1;
|
| - // Get the elements array of the object.
|
| - __ lw(elements, FieldMemOperand(receiver, JSArray::kElementsOffset));
|
| -
|
| - // Check that the elements are in fast mode and writable.
|
| - __ CheckMap(elements,
|
| - scratch,
|
| - Heap::kFixedArrayMapRootIndex,
|
| - &check_double,
|
| - DONT_DO_SMI_CHECK);
|
| -
|
| - // Get the array's length into scratch and calculate new length.
|
| - __ lw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - STATIC_ASSERT(kSmiTagSize == 1);
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ Addu(scratch, scratch, Operand(Smi::FromInt(argc)));
|
| -
|
| - // Get the elements' length.
|
| - __ lw(t0, FieldMemOperand(elements, FixedArray::kLengthOffset));
|
| -
|
| - // Check if we could survive without allocation.
|
| - __ Branch(&attempt_to_grow_elements, gt, scratch, Operand(t0));
|
| -
|
| - // Check if value is a smi.
|
| - __ lw(t0, MemOperand(sp, (argc - 1) * kPointerSize));
|
| - __ JumpIfNotSmi(t0, &with_write_barrier);
|
| -
|
| - // Save new length.
|
| - __ sw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| -
|
| - // Store the value.
|
| - // We may need a register containing the address end_elements below,
|
| - // so write back the value in end_elements.
|
| - __ sll(end_elements, scratch, kPointerSizeLog2 - kSmiTagSize);
|
| - __ Addu(end_elements, elements, end_elements);
|
| - const int kEndElementsOffset =
|
| - FixedArray::kHeaderSize - kHeapObjectTag - argc * kPointerSize;
|
| - __ Addu(end_elements, end_elements, kEndElementsOffset);
|
| - __ sw(t0, MemOperand(end_elements));
|
| -
|
| - // Check for a smi.
|
| - __ mov(v0, scratch);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&check_double);
|
| -
|
| - // Check that the elements are in fast mode and writable.
|
| - __ CheckMap(elements,
|
| - scratch,
|
| - Heap::kFixedDoubleArrayMapRootIndex,
|
| - &call_builtin,
|
| - DONT_DO_SMI_CHECK);
|
| -
|
| - // Get the array's length into scratch and calculate new length.
|
| - __ lw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - STATIC_ASSERT(kSmiTagSize == 1);
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ Addu(scratch, scratch, Operand(Smi::FromInt(argc)));
|
| -
|
| - // Get the elements' length.
|
| - __ lw(t0, FieldMemOperand(elements, FixedArray::kLengthOffset));
|
| -
|
| - // Check if we could survive without allocation.
|
| - __ Branch(&call_builtin, gt, scratch, Operand(t0));
|
| -
|
| - __ lw(t0, MemOperand(sp, (argc - 1) * kPointerSize));
|
| - __ StoreNumberToDoubleElements(
|
| - t0, scratch, elements, a3, t1, a2,
|
| - &call_builtin, argc * kDoubleSize);
|
| -
|
| - // Save new length.
|
| - __ sw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| -
|
| - __ mov(v0, scratch);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&with_write_barrier);
|
| -
|
| - __ lw(a3, FieldMemOperand(receiver, HeapObject::kMapOffset));
|
| -
|
| - if (FLAG_smi_only_arrays && !FLAG_trace_elements_transitions) {
|
| - Label fast_object, not_fast_object;
|
| - __ CheckFastObjectElements(a3, t3, ¬_fast_object);
|
| - __ jmp(&fast_object);
|
| - // In case of fast smi-only, convert to fast object, otherwise bail out.
|
| - __ bind(¬_fast_object);
|
| - __ CheckFastSmiElements(a3, t3, &call_builtin);
|
| -
|
| - __ lw(t3, FieldMemOperand(t0, HeapObject::kMapOffset));
|
| - __ LoadRoot(at, Heap::kHeapNumberMapRootIndex);
|
| - __ Branch(&call_builtin, eq, t3, Operand(at));
|
| - // edx: receiver
|
| - // a3: map
|
| - Label try_holey_map;
|
| - __ LoadTransitionedArrayMapConditional(FAST_SMI_ELEMENTS,
|
| - FAST_ELEMENTS,
|
| - a3,
|
| - t3,
|
| - &try_holey_map);
|
| - __ mov(a2, receiver);
|
| - ElementsTransitionGenerator::
|
| - GenerateMapChangeElementsTransition(masm(),
|
| - DONT_TRACK_ALLOCATION_SITE,
|
| - NULL);
|
| - __ jmp(&fast_object);
|
| -
|
| - __ bind(&try_holey_map);
|
| - __ LoadTransitionedArrayMapConditional(FAST_HOLEY_SMI_ELEMENTS,
|
| - FAST_HOLEY_ELEMENTS,
|
| - a3,
|
| - t3,
|
| - &call_builtin);
|
| - __ mov(a2, receiver);
|
| - ElementsTransitionGenerator::
|
| - GenerateMapChangeElementsTransition(masm(),
|
| - DONT_TRACK_ALLOCATION_SITE,
|
| - NULL);
|
| - __ bind(&fast_object);
|
| - } else {
|
| - __ CheckFastObjectElements(a3, a3, &call_builtin);
|
| - }
|
| -
|
| - // Save new length.
|
| - __ sw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| -
|
| - // Store the value.
|
| - // We may need a register containing the address end_elements below,
|
| - // so write back the value in end_elements.
|
| - __ sll(end_elements, scratch, kPointerSizeLog2 - kSmiTagSize);
|
| - __ Addu(end_elements, elements, end_elements);
|
| - __ Addu(end_elements, end_elements, kEndElementsOffset);
|
| - __ sw(t0, MemOperand(end_elements));
|
| -
|
| - __ RecordWrite(elements,
|
| - end_elements,
|
| - t0,
|
| - kRAHasNotBeenSaved,
|
| - kDontSaveFPRegs,
|
| - EMIT_REMEMBERED_SET,
|
| - OMIT_SMI_CHECK);
|
| - __ mov(v0, scratch);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&attempt_to_grow_elements);
|
| - // scratch: array's length + 1.
|
| - // t0: elements' length.
|
| -
|
| - if (!FLAG_inline_new) {
|
| - __ Branch(&call_builtin);
|
| - }
|
| -
|
| - __ lw(a2, MemOperand(sp, (argc - 1) * kPointerSize));
|
| - // Growing elements that are SMI-only requires special handling in case
|
| - // the new element is non-Smi. For now, delegate to the builtin.
|
| - Label no_fast_elements_check;
|
| - __ JumpIfSmi(a2, &no_fast_elements_check);
|
| - __ lw(t3, FieldMemOperand(receiver, HeapObject::kMapOffset));
|
| - __ CheckFastObjectElements(t3, t3, &call_builtin);
|
| - __ bind(&no_fast_elements_check);
|
| -
|
| - ExternalReference new_space_allocation_top =
|
| - ExternalReference::new_space_allocation_top_address(isolate());
|
| - ExternalReference new_space_allocation_limit =
|
| - ExternalReference::new_space_allocation_limit_address(isolate());
|
| -
|
| - const int kAllocationDelta = 4;
|
| - // Load top and check if it is the end of elements.
|
| - __ sll(end_elements, scratch, kPointerSizeLog2 - kSmiTagSize);
|
| - __ Addu(end_elements, elements, end_elements);
|
| - __ Addu(end_elements, end_elements, Operand(kEndElementsOffset));
|
| - __ li(t3, Operand(new_space_allocation_top));
|
| - __ lw(a3, MemOperand(t3));
|
| - __ Branch(&call_builtin, ne, end_elements, Operand(a3));
|
| -
|
| - __ li(t5, Operand(new_space_allocation_limit));
|
| - __ lw(t5, MemOperand(t5));
|
| - __ Addu(a3, a3, Operand(kAllocationDelta * kPointerSize));
|
| - __ Branch(&call_builtin, hi, a3, Operand(t5));
|
| -
|
| - // We fit and could grow elements.
|
| - // Update new_space_allocation_top.
|
| - __ sw(a3, MemOperand(t3));
|
| - // Push the argument.
|
| - __ sw(a2, MemOperand(end_elements));
|
| - // Fill the rest with holes.
|
| - __ LoadRoot(a3, Heap::kTheHoleValueRootIndex);
|
| - for (int i = 1; i < kAllocationDelta; i++) {
|
| - __ sw(a3, MemOperand(end_elements, i * kPointerSize));
|
| - }
|
| -
|
| - // Update elements' and array's sizes.
|
| - __ sw(scratch, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - __ Addu(t0, t0, Operand(Smi::FromInt(kAllocationDelta)));
|
| - __ sw(t0, FieldMemOperand(elements, FixedArray::kLengthOffset));
|
| -
|
| - // Elements are in new space, so write barrier is not required.
|
| - __ mov(v0, scratch);
|
| - __ DropAndRet(argc + 1);
|
| - }
|
| - __ bind(&call_builtin);
|
| - __ TailCallExternalReference(
|
| - ExternalReference(Builtins::c_ArrayPush, isolate()), argc + 1, 1);
|
| - }
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileArrayPopCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - // If object is not an array or is observed or sealed, bail out to regular
|
| - // call.
|
| - if (!object->IsJSArray() ||
|
| - !cell.is_null() ||
|
| - Handle<JSArray>::cast(object)->map()->is_observed() ||
|
| - !Handle<JSArray>::cast(object)->map()->is_extensible()) {
|
| - return Handle<Code>::null();
|
| - }
|
| -
|
| - Label miss, return_undefined, call_builtin;
|
| - Register receiver = a0;
|
| - Register scratch = a1;
|
| - Register elements = a3;
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| -
|
| - // Get the elements array of the object.
|
| - __ lw(elements, FieldMemOperand(receiver, JSArray::kElementsOffset));
|
| -
|
| - // Check that the elements are in fast mode and writable.
|
| - __ CheckMap(elements,
|
| - scratch,
|
| - Heap::kFixedArrayMapRootIndex,
|
| - &call_builtin,
|
| - DONT_DO_SMI_CHECK);
|
| -
|
| - // Get the array's length into t0 and calculate new length.
|
| - __ lw(t0, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| - __ Subu(t0, t0, Operand(Smi::FromInt(1)));
|
| - __ Branch(&return_undefined, lt, t0, Operand(zero_reg));
|
| -
|
| - // Get the last element.
|
| - __ LoadRoot(t2, Heap::kTheHoleValueRootIndex);
|
| - STATIC_ASSERT(kSmiTagSize == 1);
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - // We can't address the last element in one operation. Compute the more
|
| - // expensive shift first, and use an offset later on.
|
| - __ sll(t1, t0, kPointerSizeLog2 - kSmiTagSize);
|
| - __ Addu(elements, elements, t1);
|
| - __ lw(scratch, FieldMemOperand(elements, FixedArray::kHeaderSize));
|
| - __ Branch(&call_builtin, eq, scratch, Operand(t2));
|
| -
|
| - // Set the array's length.
|
| - __ sw(t0, FieldMemOperand(receiver, JSArray::kLengthOffset));
|
| -
|
| - // Fill with the hole.
|
| - __ sw(t2, FieldMemOperand(elements, FixedArray::kHeaderSize));
|
| - const int argc = arguments().immediate();
|
| - __ mov(v0, scratch);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&return_undefined);
|
| - __ LoadRoot(v0, Heap::kUndefinedValueRootIndex);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&call_builtin);
|
| - __ TailCallExternalReference(
|
| - ExternalReference(Builtins::c_ArrayPop, isolate()), argc + 1, 1);
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileStringCharCodeAtCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - // If object is not a string, bail out to regular call.
|
| - if (!object->IsString() || !cell.is_null()) return Handle<Code>::null();
|
| -
|
| - Label miss;
|
| - Label name_miss;
|
| - Label index_out_of_range;
|
| -
|
| - Label* index_out_of_range_label = &index_out_of_range;
|
| -
|
| - if (kind_ == Code::CALL_IC &&
|
| - (CallICBase::StringStubState::decode(extra_state()) ==
|
| - DEFAULT_STRING_STUB)) {
|
| - index_out_of_range_label = &miss;
|
| - }
|
| -
|
| - HandlerFrontendHeader(object, holder, name, STRING_CHECK, &name_miss);
|
| -
|
| - Register receiver = a0;
|
| - Register index = t1;
|
| - Register result = a1;
|
| - const int argc = arguments().immediate();
|
| - __ lw(receiver, MemOperand(sp, argc * kPointerSize));
|
| - if (argc > 0) {
|
| - __ lw(index, MemOperand(sp, (argc - 1) * kPointerSize));
|
| - } else {
|
| - __ LoadRoot(index, Heap::kUndefinedValueRootIndex);
|
| - }
|
| -
|
| - StringCharCodeAtGenerator generator(receiver,
|
| - index,
|
| - result,
|
| - &miss, // When not a string.
|
| - &miss, // When not a number.
|
| - index_out_of_range_label,
|
| - STRING_INDEX_IS_NUMBER);
|
| - generator.GenerateFast(masm());
|
| - __ mov(v0, result);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - StubRuntimeCallHelper call_helper;
|
| - generator.GenerateSlow(masm(), call_helper);
|
| -
|
| - if (index_out_of_range.is_linked()) {
|
| - __ bind(&index_out_of_range);
|
| - __ LoadRoot(v0, Heap::kNanValueRootIndex);
|
| - __ DropAndRet(argc + 1);
|
| - }
|
| -
|
| - __ bind(&miss);
|
| - // Restore function name in a2.
|
| - __ li(a2, name);
|
| - HandlerFrontendFooter(&name_miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileStringCharAtCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - // If object is not a string, bail out to regular call.
|
| - if (!object->IsString() || !cell.is_null()) return Handle<Code>::null();
|
| -
|
| - const int argc = arguments().immediate();
|
| - Label miss;
|
| - Label name_miss;
|
| - Label index_out_of_range;
|
| - Label* index_out_of_range_label = &index_out_of_range;
|
| - if (kind_ == Code::CALL_IC &&
|
| - (CallICBase::StringStubState::decode(extra_state()) ==
|
| - DEFAULT_STRING_STUB)) {
|
| - index_out_of_range_label = &miss;
|
| - }
|
| -
|
| - HandlerFrontendHeader(object, holder, name, STRING_CHECK, &name_miss);
|
| -
|
| - Register receiver = a0;
|
| - Register index = t1;
|
| - Register scratch = a3;
|
| - Register result = a1;
|
| - if (argc > 0) {
|
| - __ lw(index, MemOperand(sp, (argc - 1) * kPointerSize));
|
| - } else {
|
| - __ LoadRoot(index, Heap::kUndefinedValueRootIndex);
|
| - }
|
| -
|
| - StringCharAtGenerator generator(receiver,
|
| - index,
|
| - scratch,
|
| - result,
|
| - &miss, // When not a string.
|
| - &miss, // When not a number.
|
| - index_out_of_range_label,
|
| - STRING_INDEX_IS_NUMBER);
|
| - generator.GenerateFast(masm());
|
| - __ mov(v0, result);
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - StubRuntimeCallHelper call_helper;
|
| - generator.GenerateSlow(masm(), call_helper);
|
| -
|
| - if (index_out_of_range.is_linked()) {
|
| - __ bind(&index_out_of_range);
|
| - __ LoadRoot(v0, Heap::kempty_stringRootIndex);
|
| - __ DropAndRet(argc + 1);
|
| - }
|
| -
|
| - __ bind(&miss);
|
| - // Restore function name in a2.
|
| - __ li(a2, name);
|
| - HandlerFrontendFooter(&name_miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileStringFromCharCodeCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - 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 Handle<Code>::null();
|
| -
|
| - Label miss;
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| - if (!cell.is_null()) {
|
| - ASSERT(cell->value() == *function);
|
| - GenerateLoadFunctionFromCell(cell, function, &miss);
|
| - }
|
| -
|
| - // Load the char code argument.
|
| - Register code = a1;
|
| - __ lw(code, MemOperand(sp, 0 * kPointerSize));
|
| -
|
| - // Check the code is a smi.
|
| - Label slow;
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ JumpIfNotSmi(code, &slow);
|
| -
|
| - // Convert the smi code to uint16.
|
| - __ And(code, code, Operand(Smi::FromInt(0xffff)));
|
| -
|
| - StringCharFromCodeGenerator generator(code, v0);
|
| - generator.GenerateFast(masm());
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - StubRuntimeCallHelper call_helper;
|
| - generator.GenerateSlow(masm(), call_helper);
|
| -
|
| - __ bind(&slow);
|
| - // We do not have to patch the receiver because the function makes no use of
|
| - // it.
|
| - GenerateJumpFunctionIgnoreReceiver(function);
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileMathFloorCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - 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 Handle<Code>::null();
|
| -
|
| - Label miss, slow;
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| - if (!cell.is_null()) {
|
| - ASSERT(cell->value() == *function);
|
| - GenerateLoadFunctionFromCell(cell, function, &miss);
|
| - }
|
| -
|
| - // Load the (only) argument into v0.
|
| - __ lw(v0, MemOperand(sp, 0 * kPointerSize));
|
| -
|
| - // If the argument is a smi, just return.
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ SmiTst(v0, t0);
|
| - __ DropAndRet(argc + 1, eq, t0, Operand(zero_reg));
|
| -
|
| - __ CheckMap(v0, a1, Heap::kHeapNumberMapRootIndex, &slow, DONT_DO_SMI_CHECK);
|
| -
|
| - Label wont_fit_smi, no_fpu_error, restore_fcsr_and_return;
|
| -
|
| - // If fpu is enabled, we use the floor instruction.
|
| -
|
| - // Load the HeapNumber value.
|
| - __ ldc1(f0, FieldMemOperand(v0, HeapNumber::kValueOffset));
|
| -
|
| - // Backup FCSR.
|
| - __ cfc1(a3, FCSR);
|
| - // Clearing FCSR clears the exception mask with no side-effects.
|
| - __ ctc1(zero_reg, FCSR);
|
| - // Convert the argument to an integer.
|
| - __ floor_w_d(f0, f0);
|
| -
|
| - // Start checking for special cases.
|
| - // Get the argument exponent and clear the sign bit.
|
| - __ lw(t1, FieldMemOperand(v0, HeapNumber::kValueOffset + kPointerSize));
|
| - __ And(t2, t1, Operand(~HeapNumber::kSignMask));
|
| - __ srl(t2, t2, HeapNumber::kMantissaBitsInTopWord);
|
| -
|
| - // Retrieve FCSR and check for fpu errors.
|
| - __ cfc1(t5, FCSR);
|
| - __ And(t5, t5, Operand(kFCSRExceptionFlagMask));
|
| - __ Branch(&no_fpu_error, eq, t5, Operand(zero_reg));
|
| -
|
| - // Check for NaN, Infinity, and -Infinity.
|
| - // They are invariant through a Math.Floor call, so just
|
| - // return the original argument.
|
| - __ Subu(t3, t2, Operand(HeapNumber::kExponentMask
|
| - >> HeapNumber::kMantissaBitsInTopWord));
|
| - __ Branch(&restore_fcsr_and_return, eq, t3, Operand(zero_reg));
|
| - // We had an overflow or underflow in the conversion. Check if we
|
| - // have a big exponent.
|
| - // If greater or equal, the argument is already round and in v0.
|
| - __ Branch(&restore_fcsr_and_return, ge, t3,
|
| - Operand(HeapNumber::kMantissaBits));
|
| - __ Branch(&wont_fit_smi);
|
| -
|
| - __ bind(&no_fpu_error);
|
| - // Move the result back to v0.
|
| - __ mfc1(v0, f0);
|
| - // Check if the result fits into a smi.
|
| - __ Addu(a1, v0, Operand(0x40000000));
|
| - __ Branch(&wont_fit_smi, lt, a1, Operand(zero_reg));
|
| - // Tag the result.
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ sll(v0, v0, kSmiTagSize);
|
| -
|
| - // Check for -0.
|
| - __ Branch(&restore_fcsr_and_return, ne, v0, Operand(zero_reg));
|
| - // t1 already holds the HeapNumber exponent.
|
| - __ And(t0, t1, Operand(HeapNumber::kSignMask));
|
| - // If our HeapNumber is negative it was -0, so load its address and return.
|
| - // Else v0 is loaded with 0, so we can also just return.
|
| - __ Branch(&restore_fcsr_and_return, eq, t0, Operand(zero_reg));
|
| - __ lw(v0, MemOperand(sp, 0 * kPointerSize));
|
| -
|
| - __ bind(&restore_fcsr_and_return);
|
| - // Restore FCSR and return.
|
| - __ ctc1(a3, FCSR);
|
| -
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&wont_fit_smi);
|
| - // Restore FCSR and fall to slow case.
|
| - __ ctc1(a3, FCSR);
|
| -
|
| - __ bind(&slow);
|
| - // We do not have to patch the receiver because the function makes no use of
|
| - // it.
|
| - GenerateJumpFunctionIgnoreReceiver(function);
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| -Handle<Code> CallStubCompiler::CompileMathAbsCall(
|
| - Handle<Object> object,
|
| - Handle<JSObject> holder,
|
| - Handle<Cell> cell,
|
| - Handle<JSFunction> function,
|
| - Handle<String> name,
|
| - Code::StubType type) {
|
| - 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 Handle<Code>::null();
|
| -
|
| - Label miss;
|
| -
|
| - HandlerFrontendHeader(object, holder, name, RECEIVER_MAP_CHECK, &miss);
|
| - if (!cell.is_null()) {
|
| - ASSERT(cell->value() == *function);
|
| - GenerateLoadFunctionFromCell(cell, function, &miss);
|
| - }
|
| -
|
| - // Load the (only) argument into v0.
|
| - __ lw(v0, MemOperand(sp, 0 * kPointerSize));
|
| -
|
| - // Check if the argument is a smi.
|
| - Label not_smi;
|
| - STATIC_ASSERT(kSmiTag == 0);
|
| - __ JumpIfNotSmi(v0, ¬_smi);
|
| -
|
| - // Do bitwise not or do nothing depending on the sign of the
|
| - // argument.
|
| - __ sra(t0, v0, kBitsPerInt - 1);
|
| - __ Xor(a1, v0, t0);
|
| -
|
| - // Add 1 or do nothing depending on the sign of the argument.
|
| - __ Subu(v0, a1, t0);
|
| -
|
| - // If the result is still negative, go to the slow case.
|
| - // This only happens for the most negative smi.
|
| - Label slow;
|
| - __ Branch(&slow, lt, v0, Operand(zero_reg));
|
| -
|
| - // Smi case done.
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - // Check if the argument is a heap number and load its exponent and
|
| - // sign.
|
| - __ bind(¬_smi);
|
| - __ CheckMap(v0, a1, Heap::kHeapNumberMapRootIndex, &slow, DONT_DO_SMI_CHECK);
|
| - __ lw(a1, FieldMemOperand(v0, HeapNumber::kExponentOffset));
|
| -
|
| - // Check the sign of the argument. If the argument is positive,
|
| - // just return it.
|
| - Label negative_sign;
|
| - __ And(t0, a1, Operand(HeapNumber::kSignMask));
|
| - __ Branch(&negative_sign, ne, t0, Operand(zero_reg));
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - // If the argument is negative, clear the sign, and return a new
|
| - // number.
|
| - __ bind(&negative_sign);
|
| - __ Xor(a1, a1, Operand(HeapNumber::kSignMask));
|
| - __ lw(a3, FieldMemOperand(v0, HeapNumber::kMantissaOffset));
|
| - __ LoadRoot(t2, Heap::kHeapNumberMapRootIndex);
|
| - __ AllocateHeapNumber(v0, t0, t1, t2, &slow);
|
| - __ sw(a1, FieldMemOperand(v0, HeapNumber::kExponentOffset));
|
| - __ sw(a3, FieldMemOperand(v0, HeapNumber::kMantissaOffset));
|
| - __ DropAndRet(argc + 1);
|
| -
|
| - __ bind(&slow);
|
| - // We do not have to patch the receiver because the function makes no use of
|
| - // it.
|
| - GenerateJumpFunctionIgnoreReceiver(function);
|
| -
|
| - HandlerFrontendFooter(&miss);
|
| -
|
| - // Return the generated code.
|
| - return GetCode(type, name);
|
| -}
|
| -
|
| -
|
| Handle<Code> CallStubCompiler::CompileFastApiCall(
|
| const CallOptimization& optimization,
|
| Handle<Object> object,
|
| @@ -2514,14 +1797,15 @@ Handle<Code> StoreStubCompiler::CompileStoreCallback(
|
| Handle<JSObject> holder,
|
| Handle<Name> name,
|
| Handle<ExecutableAccessorInfo> callback) {
|
| - HandlerFrontend(IC::CurrentTypeOf(object, isolate()),
|
| - receiver(), holder, name);
|
| + Register holder_reg = HandlerFrontend(
|
| + IC::CurrentTypeOf(object, isolate()), receiver(), holder, name);
|
|
|
| // Stub never generated for non-global objects that require access
|
| // checks.
|
| ASSERT(holder->IsJSGlobalProxy() || !holder->IsAccessCheckNeeded());
|
|
|
| __ push(receiver()); // Receiver.
|
| + __ push(holder_reg);
|
| __ li(at, Operand(callback)); // Callback info.
|
| __ push(at);
|
| __ li(at, Operand(name));
|
| @@ -2530,7 +1814,7 @@ Handle<Code> StoreStubCompiler::CompileStoreCallback(
|
| // Do tail-call to the runtime system.
|
| ExternalReference store_callback_property =
|
| ExternalReference(IC_Utility(IC::kStoreCallbackProperty), isolate());
|
| - __ TailCallExternalReference(store_callback_property, 4, 1);
|
| + __ TailCallExternalReference(store_callback_property, 5, 1);
|
|
|
| // Return the generated code.
|
| return GetCode(kind(), Code::FAST, name);
|
| @@ -2635,7 +1919,7 @@ Handle<Code> StoreStubCompiler::CompileStoreInterceptor(
|
| }
|
|
|
|
|
| -Handle<Code> LoadStubCompiler::CompileLoadNonexistent(Handle<Type> type,
|
| +Handle<Code> LoadStubCompiler::CompileLoadNonexistent(Handle<HeapType> type,
|
| Handle<JSObject> last,
|
| Handle<Name> name) {
|
| NonexistentHandlerFrontend(type, last, name);
|
| @@ -2677,20 +1961,6 @@ Register* KeyedStoreStubCompiler::registers() {
|
| }
|
|
|
|
|
| -void KeyedLoadStubCompiler::GenerateNameCheck(Handle<Name> name,
|
| - Register name_reg,
|
| - Label* miss) {
|
| - __ Branch(miss, ne, name_reg, Operand(name));
|
| -}
|
| -
|
| -
|
| -void KeyedStoreStubCompiler::GenerateNameCheck(Handle<Name> name,
|
| - Register name_reg,
|
| - Label* miss) {
|
| - __ Branch(miss, ne, name_reg, Operand(name));
|
| -}
|
| -
|
| -
|
| #undef __
|
| #define __ ACCESS_MASM(masm)
|
|
|
| @@ -2731,7 +2001,7 @@ void LoadStubCompiler::GenerateLoadViaGetter(MacroAssembler* masm,
|
|
|
|
|
| Handle<Code> LoadStubCompiler::CompileLoadGlobal(
|
| - Handle<Type> type,
|
| + Handle<HeapType> type,
|
| Handle<GlobalObject> global,
|
| Handle<PropertyCell> cell,
|
| Handle<Name> name,
|
| @@ -2770,8 +2040,9 @@ Handle<Code> BaseLoadStoreStubCompiler::CompilePolymorphicIC(
|
| IcCheckType check) {
|
| Label miss;
|
|
|
| - if (check == PROPERTY) {
|
| - GenerateNameCheck(name, this->name(), &miss);
|
| + if (check == PROPERTY &&
|
| + (kind() == Code::KEYED_LOAD_IC || kind() == Code::KEYED_STORE_IC)) {
|
| + __ Branch(&miss, ne, this->name(), Operand(name));
|
| }
|
|
|
| Label number_case;
|
| @@ -2784,11 +2055,11 @@ Handle<Code> BaseLoadStoreStubCompiler::CompilePolymorphicIC(
|
| int number_of_handled_maps = 0;
|
| __ lw(map_reg, FieldMemOperand(receiver(), HeapObject::kMapOffset));
|
| for (int current = 0; current < receiver_count; ++current) {
|
| - Handle<Type> type = types->at(current);
|
| + Handle<HeapType> type = types->at(current);
|
| Handle<Map> map = IC::TypeToMap(*type, isolate());
|
| if (!map->is_deprecated()) {
|
| number_of_handled_maps++;
|
| - if (type->Is(Type::Number())) {
|
| + if (type->Is(HeapType::Number())) {
|
| ASSERT(!number_case.is_unused());
|
| __ bind(&number_case);
|
| }
|
|
|