| // Copyright 2021 the V8 project authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| #if V8_TARGET_ARCH_LOONG64 |
| |
| #include "src/api/api-arguments.h" |
| #include "src/builtins/builtins-descriptors.h" |
| #include "src/builtins/builtins-inl.h" |
| #include "src/codegen/code-factory.h" |
| #include "src/codegen/interface-descriptors-inl.h" |
| #include "src/debug/debug.h" |
| #include "src/deoptimizer/deoptimizer.h" |
| #include "src/execution/frame-constants.h" |
| #include "src/execution/frames.h" |
| #include "src/logging/counters.h" |
| // For interpreter_entry_return_pc_offset. TODO(jkummerow): Drop. |
| #include "src/codegen/loong64/constants-loong64.h" |
| #include "src/codegen/macro-assembler-inl.h" |
| #include "src/codegen/register-configuration.h" |
| #include "src/heap/heap-inl.h" |
| #include "src/objects/cell.h" |
| #include "src/objects/foreign.h" |
| #include "src/objects/heap-number.h" |
| #include "src/objects/js-generator.h" |
| #include "src/objects/objects-inl.h" |
| #include "src/objects/smi.h" |
| #include "src/runtime/runtime.h" |
| |
| #if V8_ENABLE_WEBASSEMBLY |
| #include "src/wasm/baseline/liftoff-assembler-defs.h" |
| #include "src/wasm/object-access.h" |
| #include "src/wasm/wasm-linkage.h" |
| #include "src/wasm/wasm-objects.h" |
| #endif // V8_ENABLE_WEBASSEMBLY |
| |
| namespace v8 { |
| namespace internal { |
| |
| #define __ ACCESS_MASM(masm) |
| |
| void Builtins::Generate_Adaptor(MacroAssembler* masm, |
| int formal_parameter_count, Address address) { |
| __ li(kJavaScriptCallExtraArg1Register, ExternalReference::Create(address)); |
| __ TailCallBuiltin( |
| Builtins::AdaptorWithBuiltinExitFrame(formal_parameter_count)); |
| } |
| |
| namespace { |
| |
| enum class ArgumentsElementType { |
| kRaw, // Push arguments as they are. |
| kHandle // Dereference arguments before pushing. |
| }; |
| |
| void Generate_PushArguments(MacroAssembler* masm, Register array, Register argc, |
| Register scratch, Register scratch2, |
| ArgumentsElementType element_type) { |
| DCHECK(!AreAliased(array, argc, scratch)); |
| Label loop, entry; |
| __ Sub_d(scratch, argc, Operand(kJSArgcReceiverSlots)); |
| __ Branch(&entry); |
| __ bind(&loop); |
| __ Alsl_d(scratch2, scratch, array, kSystemPointerSizeLog2); |
| __ Ld_d(scratch2, MemOperand(scratch2, 0)); |
| if (element_type == ArgumentsElementType::kHandle) { |
| __ Ld_d(scratch2, MemOperand(scratch2, 0)); |
| } |
| __ Push(scratch2); |
| __ bind(&entry); |
| __ Add_d(scratch, scratch, Operand(-1)); |
| __ Branch(&loop, greater_equal, scratch, Operand(zero_reg)); |
| } |
| |
| void Generate_JSBuiltinsConstructStubHelper(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : number of arguments |
| // -- a1 : constructor function |
| // -- a3 : new target |
| // -- cp : context |
| // -- ra : return address |
| // -- sp[...]: constructor arguments |
| // ----------------------------------- |
| |
| // Enter a construct frame. |
| { |
| FrameScope scope(masm, StackFrame::CONSTRUCT); |
| |
| // Preserve the incoming parameters on the stack. |
| __ Push(cp, a0); |
| |
| // Set up pointer to first argument (skip receiver). |
| __ Add_d( |
| t2, fp, |
| Operand(StandardFrameConstants::kCallerSPOffset + kSystemPointerSize)); |
| // Copy arguments and receiver to the expression stack. |
| // t2: Pointer to start of arguments. |
| // a0: Number of arguments. |
| Generate_PushArguments(masm, t2, a0, t3, t0, ArgumentsElementType::kRaw); |
| // The receiver for the builtin/api call. |
| __ PushRoot(RootIndex::kTheHoleValue); |
| |
| // Call the function. |
| // a0: number of arguments (untagged) |
| // a1: constructor function |
| // a3: new target |
| __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall); |
| |
| // Restore context from the frame. |
| __ Ld_d(cp, MemOperand(fp, ConstructFrameConstants::kContextOffset)); |
| // Restore arguments count from the frame. |
| __ Ld_d(t3, MemOperand(fp, ConstructFrameConstants::kLengthOffset)); |
| // Leave construct frame. |
| } |
| |
| // Remove caller arguments from the stack and return. |
| __ DropArguments(t3); |
| __ Ret(); |
| } |
| |
| } // namespace |
| |
| // The construct stub for ES5 constructor functions and ES6 class constructors. |
| void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0: number of arguments (untagged) |
| // -- a1: constructor function |
| // -- a3: new target |
| // -- cp: context |
| // -- ra: return address |
| // -- sp[...]: constructor arguments |
| // ----------------------------------- |
| |
| // Enter a construct frame. |
| FrameScope scope(masm, StackFrame::MANUAL); |
| Label post_instantiation_deopt_entry, not_create_implicit_receiver; |
| __ EnterFrame(StackFrame::CONSTRUCT); |
| |
| // Preserve the incoming parameters on the stack. |
| __ Push(cp, a0, a1); |
| __ PushRoot(RootIndex::kUndefinedValue); |
| __ Push(a3); |
| |
| // ----------- S t a t e ------------- |
| // -- sp[0*kSystemPointerSize]: new target |
| // -- sp[1*kSystemPointerSize]: padding |
| // -- a1 and sp[2*kSystemPointerSize]: constructor function |
| // -- sp[3*kSystemPointerSize]: number of arguments |
| // -- sp[4*kSystemPointerSize]: context |
| // ----------------------------------- |
| |
| __ LoadTaggedField( |
| t2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset)); |
| __ Ld_wu(t2, FieldMemOperand(t2, SharedFunctionInfo::kFlagsOffset)); |
| __ DecodeField<SharedFunctionInfo::FunctionKindBits>(t2); |
| __ JumpIfIsInRange( |
| t2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor), |
| static_cast<uint32_t>(FunctionKind::kDerivedConstructor), |
| ¬_create_implicit_receiver); |
| |
| // If not derived class constructor: Allocate the new receiver object. |
| __ CallBuiltin(Builtin::kFastNewObject); |
| __ Branch(&post_instantiation_deopt_entry); |
| |
| // Else: use TheHoleValue as receiver for constructor call |
| __ bind(¬_create_implicit_receiver); |
| __ LoadRoot(a0, RootIndex::kTheHoleValue); |
| |
| // ----------- S t a t e ------------- |
| // -- a0: receiver |
| // -- Slot 4 / sp[0*kSystemPointerSize]: new target |
| // -- Slot 3 / sp[1*kSystemPointerSize]: padding |
| // -- Slot 2 / sp[2*kSystemPointerSize]: constructor function |
| // -- Slot 1 / sp[3*kSystemPointerSize]: number of arguments |
| // -- Slot 0 / sp[4*kSystemPointerSize]: context |
| // ----------------------------------- |
| // Deoptimizer enters here. |
| masm->isolate()->heap()->SetConstructStubCreateDeoptPCOffset( |
| masm->pc_offset()); |
| __ bind(&post_instantiation_deopt_entry); |
| |
| // Restore new target. |
| __ Pop(a3); |
| |
| // Push the allocated receiver to the stack. |
| __ Push(a0); |
| |
| // We need two copies because we may have to return the original one |
| // and the calling conventions dictate that the called function pops the |
| // receiver. The second copy is pushed after the arguments, we saved in a6 |
| // since a0 will store the return value of callRuntime. |
| __ mov(a6, a0); |
| |
| // Set up pointer to last argument. |
| __ Add_d( |
| t2, fp, |
| Operand(StandardFrameConstants::kCallerSPOffset + kSystemPointerSize)); |
| |
| // ----------- S t a t e ------------- |
| // -- r3: new target |
| // -- sp[0*kSystemPointerSize]: implicit receiver |
| // -- sp[1*kSystemPointerSize]: implicit receiver |
| // -- sp[2*kSystemPointerSize]: padding |
| // -- sp[3*kSystemPointerSize]: constructor function |
| // -- sp[4*kSystemPointerSize]: number of arguments |
| // -- sp[5*kSystemPointerSize]: context |
| // ----------------------------------- |
| |
| // Restore constructor function and argument count. |
| __ Ld_d(a1, MemOperand(fp, ConstructFrameConstants::kConstructorOffset)); |
| __ Ld_d(a0, MemOperand(fp, ConstructFrameConstants::kLengthOffset)); |
| |
| Label stack_overflow; |
| __ StackOverflowCheck(a0, t0, t1, &stack_overflow); |
| |
| // TODO(victorgomes): When the arguments adaptor is completely removed, we |
| // should get the formal parameter count and copy the arguments in its |
| // correct position (including any undefined), instead of delaying this to |
| // InvokeFunction. |
| |
| // Copy arguments and receiver to the expression stack. |
| // t2: Pointer to start of argument. |
| // a0: Number of arguments. |
| Generate_PushArguments(masm, t2, a0, t0, t1, ArgumentsElementType::kRaw); |
| // We need two copies because we may have to return the original one |
| // and the calling conventions dictate that the called function pops the |
| // receiver. The second copy is pushed after the arguments, |
| __ Push(a6); |
| |
| // Call the function. |
| __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall); |
| |
| // If the result is an object (in the ECMA sense), we should get rid |
| // of the receiver and use the result; see ECMA-262 section 13.2.2-7 |
| // on page 74. |
| Label use_receiver, do_throw, leave_and_return, check_receiver; |
| |
| // If the result is undefined, we jump out to using the implicit receiver. |
| __ JumpIfNotRoot(a0, RootIndex::kUndefinedValue, &check_receiver); |
| |
| // Otherwise we do a smi check and fall through to check if the return value |
| // is a valid receiver. |
| |
| // Throw away the result of the constructor invocation and use the |
| // on-stack receiver as the result. |
| __ bind(&use_receiver); |
| __ Ld_d(a0, MemOperand(sp, 0 * kSystemPointerSize)); |
| __ JumpIfRoot(a0, RootIndex::kTheHoleValue, &do_throw); |
| |
| __ bind(&leave_and_return); |
| // Restore arguments count from the frame. |
| __ Ld_d(a1, MemOperand(fp, ConstructFrameConstants::kLengthOffset)); |
| // Leave construct frame. |
| __ LeaveFrame(StackFrame::CONSTRUCT); |
| |
| // Remove caller arguments from the stack and return. |
| __ DropArguments(a1); |
| __ Ret(); |
| |
| __ bind(&check_receiver); |
| __ JumpIfSmi(a0, &use_receiver); |
| |
| // Check if the type of the result is not an object in the ECMA sense. |
| __ JumpIfJSAnyIsNotPrimitive(a0, t2, &leave_and_return); |
| __ Branch(&use_receiver); |
| |
| __ bind(&do_throw); |
| // Restore the context from the frame. |
| __ Ld_d(cp, MemOperand(fp, ConstructFrameConstants::kContextOffset)); |
| __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject); |
| __ break_(0xCC); |
| |
| __ bind(&stack_overflow); |
| // Restore the context from the frame. |
| __ Ld_d(cp, MemOperand(fp, ConstructFrameConstants::kContextOffset)); |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| __ break_(0xCC); |
| } |
| |
| void Builtins::Generate_JSBuiltinsConstructStub(MacroAssembler* masm) { |
| Generate_JSBuiltinsConstructStubHelper(masm); |
| } |
| |
| static void AssertCodeIsBaseline(MacroAssembler* masm, Register code, |
| Register scratch) { |
| DCHECK(!AreAliased(code, scratch)); |
| // Verify that the code kind is baseline code via the CodeKind. |
| __ Ld_d(scratch, FieldMemOperand(code, Code::kFlagsOffset)); |
| __ DecodeField<Code::KindField>(scratch); |
| __ Assert(eq, AbortReason::kExpectedBaselineData, scratch, |
| Operand(static_cast<int>(CodeKind::BASELINE))); |
| } |
| |
| // TODO(v8:11429): Add a path for "not_compiled" and unify the two uses under |
| // the more general dispatch. |
| static void GetSharedFunctionInfoBytecodeOrBaseline( |
| MacroAssembler* masm, Register sfi, Register bytecode, Register scratch1, |
| Label* is_baseline, Label* is_unavailable) { |
| DCHECK(!AreAliased(bytecode, scratch1)); |
| ASM_CODE_COMMENT(masm); |
| Label done; |
| |
| Register data = bytecode; |
| __ LoadTrustedPointerField( |
| data, |
| FieldMemOperand(sfi, SharedFunctionInfo::kTrustedFunctionDataOffset), |
| kUnknownIndirectPointerTag); |
| |
| __ GetObjectType(data, scratch1, scratch1); |
| |
| #ifndef V8_JITLESS |
| if (v8_flags.debug_code) { |
| Label not_baseline; |
| __ Branch(¬_baseline, ne, scratch1, Operand(CODE_TYPE)); |
| AssertCodeIsBaseline(masm, data, scratch1); |
| __ Branch(is_baseline); |
| __ bind(¬_baseline); |
| } else { |
| __ Branch(is_baseline, eq, scratch1, Operand(CODE_TYPE)); |
| } |
| #endif // !V8_JITLESS |
| |
| __ Branch(&done, ne, scratch1, Operand(INTERPRETER_DATA_TYPE)); |
| __ LoadProtectedPointerField( |
| bytecode, FieldMemOperand(data, InterpreterData::kBytecodeArrayOffset)); |
| |
| __ bind(&done); |
| |
| __ GetObjectType(bytecode, scratch1, scratch1); |
| __ Branch(is_unavailable, ne, scratch1, Operand(BYTECODE_ARRAY_TYPE)); |
| } |
| |
| // static |
| void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the value to pass to the generator |
| // -- a1 : the JSGeneratorObject to resume |
| // -- ra : return address |
| // ----------------------------------- |
| // Store input value into generator object. |
| __ StoreTaggedField( |
| a0, FieldMemOperand(a1, JSGeneratorObject::kInputOrDebugPosOffset)); |
| __ RecordWriteField(a1, JSGeneratorObject::kInputOrDebugPosOffset, a0, |
| kRAHasNotBeenSaved, SaveFPRegsMode::kIgnore); |
| // Check that a1 is still valid, RecordWrite might have clobbered it. |
| __ AssertGeneratorObject(a1); |
| |
| // Load suspended function and context. |
| __ LoadTaggedField(a5, |
| FieldMemOperand(a1, JSGeneratorObject::kFunctionOffset)); |
| __ LoadTaggedField(cp, FieldMemOperand(a5, JSFunction::kContextOffset)); |
| |
| // Flood function if we are stepping. |
| Label prepare_step_in_if_stepping, prepare_step_in_suspended_generator; |
| Label stepping_prepared; |
| ExternalReference debug_hook = |
| ExternalReference::debug_hook_on_function_call_address(masm->isolate()); |
| __ li(a6, debug_hook); |
| __ Ld_b(a6, MemOperand(a6, 0)); |
| __ Branch(&prepare_step_in_if_stepping, ne, a6, Operand(zero_reg)); |
| |
| // Flood function if we need to continue stepping in the suspended generator. |
| ExternalReference debug_suspended_generator = |
| ExternalReference::debug_suspended_generator_address(masm->isolate()); |
| __ li(a6, debug_suspended_generator); |
| __ Ld_d(a6, MemOperand(a6, 0)); |
| __ Branch(&prepare_step_in_suspended_generator, eq, a1, Operand(a6)); |
| __ bind(&stepping_prepared); |
| |
| // Check the stack for overflow. We are not trying to catch interruptions |
| // (i.e. debug break and preemption) here, so check the "real stack limit". |
| Label stack_overflow; |
| __ LoadStackLimit(kScratchReg, |
| MacroAssembler::StackLimitKind::kRealStackLimit); |
| __ Branch(&stack_overflow, lo, sp, Operand(kScratchReg)); |
| |
| Register argc = kJavaScriptCallArgCountRegister; |
| |
| // Compute actual arguments count value as a formal parameter count without |
| // receiver, loaded from the dispatch table entry or shared function info. |
| #if V8_ENABLE_LEAPTIERING |
| Register dispatch_handle = kJavaScriptCallDispatchHandleRegister; |
| Register code = kJavaScriptCallCodeStartRegister; |
| Register scratch = t5; |
| __ Ld_w(dispatch_handle, |
| FieldMemOperand(a5, JSFunction::kDispatchHandleOffset)); |
| __ LoadEntrypointAndParameterCountFromJSDispatchTable( |
| code, argc, dispatch_handle, scratch); |
| |
| // In case the formal parameter count is kDontAdaptArgumentsSentinel the |
| // actual arguments count should be set accordingly. |
| static_assert(kDontAdaptArgumentsSentinel < JSParameterCount(0)); |
| Label is_bigger; |
| __ BranchShort(&is_bigger, kGreaterThan, argc, Operand(JSParameterCount(0))); |
| __ li(argc, Operand(JSParameterCount(0))); |
| __ bind(&is_bigger); |
| #else |
| __ LoadTaggedField( |
| argc, FieldMemOperand(a5, JSFunction::kSharedFunctionInfoOffset)); |
| __ Ld_hu(argc, FieldMemOperand( |
| argc, SharedFunctionInfo::kFormalParameterCountOffset)); |
| |
| // Generator functions are always created from user code and thus the |
| // formal parameter count is never equal to kDontAdaptArgumentsSentinel, |
| // which is used only for certain non-generator builtin functions. |
| #endif // V8_ENABLE_LEAPTIERING |
| |
| // ----------- S t a t e ------------- |
| // -- a0 : actual arguments count |
| // -- a1 : the JSGeneratorObject to resume |
| // -- a2 : target code object (leaptiering only) |
| // -- a4 : dispatch handle (leaptiering only) |
| // -- a5 : generator function |
| // -- cp : generator context |
| // -- ra : return address |
| // ----------------------------------- |
| |
| // Copy the function arguments from the generator object's register file. |
| { |
| Label done_loop, loop; |
| __ Sub_d(a3, argc, Operand(kJSArgcReceiverSlots)); |
| __ LoadTaggedField( |
| t1, |
| FieldMemOperand(a1, JSGeneratorObject::kParametersAndRegistersOffset)); |
| __ bind(&loop); |
| __ Sub_d(a3, a3, Operand(1)); |
| __ Branch(&done_loop, lt, a3, Operand(zero_reg)); |
| __ Alsl_d(kScratchReg, a3, t1, kTaggedSizeLog2); |
| __ LoadTaggedField( |
| kScratchReg, |
| FieldMemOperand(kScratchReg, OFFSET_OF_DATA_START(FixedArray))); |
| __ Push(kScratchReg); |
| __ Branch(&loop); |
| __ bind(&done_loop); |
| // Push receiver. |
| __ LoadTaggedField(kScratchReg, |
| FieldMemOperand(a1, JSGeneratorObject::kReceiverOffset)); |
| __ Push(kScratchReg); |
| } |
| |
| // Underlying function needs to have bytecode available. |
| if (v8_flags.debug_code) { |
| Label ok, is_baseline, is_unavailable; |
| Register sfi = a3; |
| Register bytecode = a3; |
| __ LoadTaggedField( |
| sfi, FieldMemOperand(a5, JSFunction::kSharedFunctionInfoOffset)); |
| GetSharedFunctionInfoBytecodeOrBaseline(masm, sfi, bytecode, t5, |
| &is_baseline, &is_unavailable); |
| __ Branch(&ok); |
| |
| __ bind(&is_unavailable); |
| __ Abort(AbortReason::kMissingBytecodeArray); |
| |
| __ bind(&is_baseline); |
| __ GetObjectType(a3, a3, bytecode); |
| __ Assert(eq, AbortReason::kMissingBytecodeArray, bytecode, |
| Operand(CODE_TYPE)); |
| __ bind(&ok); |
| } |
| |
| // Resume (Ignition/TurboFan) generator object. |
| { |
| // We abuse new.target both to indicate that this is a resume call and to |
| // pass in the generator object. In ordinary calls, new.target is always |
| // undefined because generator functions are non-constructable. |
| __ Move(a3, a1); // new.target |
| __ Move(a1, a5); // target |
| #if V8_ENABLE_LEAPTIERING |
| // Actual arguments count and code start are already initialized above. |
| __ Jump(code); |
| #else |
| // Actual arguments count is already initialized above. |
| __ JumpJSFunction(a1); |
| #endif // V8_ENABLE_LEAPTIERING |
| } |
| |
| __ bind(&prepare_step_in_if_stepping); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(a1, a5); |
| // Push hole as receiver since we do not use it for stepping. |
| __ PushRoot(RootIndex::kTheHoleValue); |
| __ CallRuntime(Runtime::kDebugOnFunctionCall); |
| __ Pop(a1); |
| } |
| __ LoadTaggedField(a5, |
| FieldMemOperand(a1, JSGeneratorObject::kFunctionOffset)); |
| __ Branch(&stepping_prepared); |
| |
| __ bind(&prepare_step_in_suspended_generator); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(a1); |
| __ CallRuntime(Runtime::kDebugPrepareStepInSuspendedGenerator); |
| __ Pop(a1); |
| } |
| __ LoadTaggedField(a5, |
| FieldMemOperand(a1, JSGeneratorObject::kFunctionOffset)); |
| __ Branch(&stepping_prepared); |
| |
| __ bind(&stack_overflow); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| __ break_(0xCC); // This should be unreachable. |
| } |
| } |
| |
| void Builtins::Generate_ConstructedNonConstructable(MacroAssembler* masm) { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(a1); |
| __ CallRuntime(Runtime::kThrowConstructedNonConstructable); |
| } |
| |
| // Clobbers scratch1 and scratch2; preserves all other registers. |
| static void Generate_CheckStackOverflow(MacroAssembler* masm, Register argc, |
| Register scratch1, Register scratch2) { |
| // Check the stack for overflow. We are not trying to catch |
| // interruptions (e.g. debug break and preemption) here, so the "real stack |
| // limit" is checked. |
| Label okay; |
| __ LoadStackLimit(scratch1, MacroAssembler::StackLimitKind::kRealStackLimit); |
| // Make a2 the space we have left. The stack might already be overflowed |
| // here which will cause r2 to become negative. |
| __ sub_d(scratch1, sp, scratch1); |
| // Check if the arguments will overflow the stack. |
| __ slli_d(scratch2, argc, kSystemPointerSizeLog2); |
| __ Branch(&okay, gt, scratch1, Operand(scratch2)); // Signed comparison. |
| |
| // Out of stack space. |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| |
| __ bind(&okay); |
| } |
| |
| namespace { |
| |
| // Called with the native C calling convention. The corresponding function |
| // signature is either: |
| // |
| // using JSEntryFunction = GeneratedCode<Address( |
| // Address root_register_value, Address new_target, Address target, |
| // Address receiver, intptr_t argc, Address** args)>; |
| // or |
| // using JSEntryFunction = GeneratedCode<Address( |
| // Address root_register_value, MicrotaskQueue* microtask_queue)>; |
| void Generate_JSEntryVariant(MacroAssembler* masm, StackFrame::Type type, |
| Builtin entry_trampoline) { |
| Label invoke, handler_entry, exit; |
| |
| { |
| NoRootArrayScope no_root_array(masm); |
| |
| // Registers: |
| // either |
| // a0: root register value |
| // a1: entry address |
| // a2: function |
| // a3: receiver |
| // a4: argc |
| // a5: argv |
| // or |
| // a0: root register value |
| // a1: microtask_queue |
| |
| // Save callee saved registers on the stack. |
| __ MultiPush(kCalleeSaved | ra); |
| |
| // Save callee-saved FPU registers. |
| __ MultiPushFPU(kCalleeSavedFPU); |
| // Set up the reserved register for 0.0. |
| __ Move(kDoubleRegZero, 0.0); |
| |
| // Initialize the root register. |
| // C calling convention. The first argument is passed in a0. |
| __ mov(kRootRegister, a0); |
| |
| #ifdef V8_COMPRESS_POINTERS |
| // Initialize the pointer cage base register. |
| __ LoadRootRelative(kPtrComprCageBaseRegister, |
| IsolateData::cage_base_offset()); |
| #endif |
| } |
| |
| // a1: entry address |
| // a2: function |
| // a3: receiver |
| // a4: argc |
| // a5: argv |
| |
| // We build an EntryFrame. |
| __ li(s1, Operand(-1)); // Push a bad frame pointer to fail if it is used. |
| __ li(s2, Operand(StackFrame::TypeToMarker(type))); |
| __ li(s3, Operand(StackFrame::TypeToMarker(type))); |
| ExternalReference c_entry_fp = ExternalReference::Create( |
| IsolateAddressId::kCEntryFPAddress, masm->isolate()); |
| __ li(s5, c_entry_fp); |
| __ Ld_d(s4, MemOperand(s5, 0)); |
| __ Push(s1, s2, s3, s4); |
| |
| // Clear c_entry_fp, now we've pushed its previous value to the stack. |
| // If the c_entry_fp is not already zero and we don't clear it, the |
| // StackFrameIteratorForProfiler will assume we are executing C++ and miss the |
| // JS frames on top. |
| __ St_d(zero_reg, MemOperand(s5, 0)); |
| |
| __ LoadIsolateField(s1, IsolateFieldId::kFastCCallCallerFP); |
| __ Ld_d(s2, MemOperand(s1, 0)); |
| __ St_d(zero_reg, MemOperand(s1, 0)); |
| __ LoadIsolateField(s1, IsolateFieldId::kFastCCallCallerPC); |
| __ Ld_d(s3, MemOperand(s1, 0)); |
| __ St_d(zero_reg, MemOperand(s1, 0)); |
| __ Push(s2, s3); |
| |
| // Set up frame pointer for the frame to be pushed. |
| __ addi_d(fp, sp, -EntryFrameConstants::kNextFastCallFramePCOffset); |
| |
| // Registers: |
| // either |
| // a1: entry address |
| // a2: function |
| // a3: receiver |
| // a4: argc |
| // a5: argv |
| // or |
| // a1: microtask_queue |
| // |
| // Stack: |
| // fast api call pc | |
| // fast api call fp | |
| // C entry FP | |
| // function slot | entry frame |
| // context slot | |
| // bad fp (0xFF...F) | |
| // callee saved registers + ra |
| |
| // If this is the outermost JS call, set js_entry_sp value. |
| Label non_outermost_js; |
| ExternalReference js_entry_sp = ExternalReference::Create( |
| IsolateAddressId::kJSEntrySPAddress, masm->isolate()); |
| __ li(s1, js_entry_sp); |
| __ Ld_d(s2, MemOperand(s1, 0)); |
| __ Branch(&non_outermost_js, ne, s2, Operand(zero_reg)); |
| __ St_d(fp, MemOperand(s1, 0)); |
| __ li(s3, Operand(StackFrame::OUTERMOST_JSENTRY_FRAME)); |
| Label cont; |
| __ b(&cont); |
| __ nop(); // Branch delay slot nop. |
| __ bind(&non_outermost_js); |
| __ li(s3, Operand(StackFrame::INNER_JSENTRY_FRAME)); |
| __ bind(&cont); |
| __ Push(s3); |
| |
| // Jump to a faked try block that does the invoke, with a faked catch |
| // block that sets the exception. |
| __ jmp(&invoke); |
| __ bind(&handler_entry); |
| |
| // Store the current pc as the handler offset. It's used later to create the |
| // handler table. |
| masm->isolate()->builtins()->SetJSEntryHandlerOffset(handler_entry.pos()); |
| |
| // Caught exception: Store result (exception) in the exception |
| // field in the JSEnv and return a failure sentinel. Coming in here the |
| // fp will be invalid because the PushStackHandler below sets it to 0 to |
| // signal the existence of the JSEntry frame. |
| __ li(s1, ExternalReference::Create(IsolateAddressId::kExceptionAddress, |
| masm->isolate())); |
| __ St_d(a0, |
| MemOperand(s1, 0)); // We come back from 'invoke'. result is in a0. |
| __ LoadRoot(a0, RootIndex::kException); |
| __ b(&exit); // b exposes branch delay slot. |
| __ nop(); // Branch delay slot nop. |
| |
| // Invoke: Link this frame into the handler chain. |
| __ bind(&invoke); |
| __ PushStackHandler(); |
| // If an exception not caught by another handler occurs, this handler |
| // returns control to the code after the bal(&invoke) above, which |
| // restores all kCalleeSaved registers (including cp and fp) to their |
| // saved values before returning a failure to C. |
| // |
| // Registers: |
| // either |
| // a0: root register value |
| // a1: entry address |
| // a2: function |
| // a3: receiver |
| // a4: argc |
| // a5: argv |
| // or |
| // a0: root register value |
| // a1: microtask_queue |
| // |
| // Stack: |
| // handler frame |
| // entry frame |
| // fast api call pc |
| // fast api call fp |
| // C entry FP |
| // function slot |
| // context slot |
| // bad fp (0xFF...F) |
| // callee saved registers + ra |
| |
| // Invoke the function by calling through JS entry trampoline builtin and |
| // pop the faked function when we return. |
| __ CallBuiltin(entry_trampoline); |
| |
| // Unlink this frame from the handler chain. |
| __ PopStackHandler(); |
| |
| __ bind(&exit); // a0 holds result |
| // Check if the current stack frame is marked as the outermost JS frame. |
| Label non_outermost_js_2; |
| __ Pop(a5); |
| __ Branch(&non_outermost_js_2, ne, a5, |
| Operand(StackFrame::OUTERMOST_JSENTRY_FRAME)); |
| __ li(a5, js_entry_sp); |
| __ St_d(zero_reg, MemOperand(a5, 0)); |
| __ bind(&non_outermost_js_2); |
| |
| // Restore the top frame descriptors from the stack. |
| __ Pop(a4, a5); |
| __ LoadIsolateField(a6, IsolateFieldId::kFastCCallCallerFP); |
| __ St_d(a4, MemOperand(a6, 0)); |
| __ LoadIsolateField(a6, IsolateFieldId::kFastCCallCallerPC); |
| __ St_d(a5, MemOperand(a6, 0)); |
| |
| __ Pop(a5); |
| __ li(a4, ExternalReference::Create(IsolateAddressId::kCEntryFPAddress, |
| masm->isolate())); |
| __ St_d(a5, MemOperand(a4, 0)); |
| |
| // Reset the stack to the callee saved registers. |
| __ addi_d(sp, sp, -EntryFrameConstants::kNextExitFrameFPOffset); |
| |
| // Restore callee-saved fpu registers. |
| __ MultiPopFPU(kCalleeSavedFPU); |
| |
| // Restore callee saved registers from the stack. |
| __ MultiPop(kCalleeSaved | ra); |
| // Return. |
| __ Jump(ra); |
| } |
| |
| } // namespace |
| |
| void Builtins::Generate_JSEntry(MacroAssembler* masm) { |
| Generate_JSEntryVariant(masm, StackFrame::ENTRY, Builtin::kJSEntryTrampoline); |
| } |
| |
| void Builtins::Generate_JSConstructEntry(MacroAssembler* masm) { |
| Generate_JSEntryVariant(masm, StackFrame::CONSTRUCT_ENTRY, |
| Builtin::kJSConstructEntryTrampoline); |
| } |
| |
| void Builtins::Generate_JSRunMicrotasksEntry(MacroAssembler* masm) { |
| Generate_JSEntryVariant(masm, StackFrame::ENTRY, |
| Builtin::kRunMicrotasksTrampoline); |
| } |
| |
| static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm, |
| bool is_construct) { |
| // ----------- S t a t e ------------- |
| // -- a1: new.target |
| // -- a2: function |
| // -- a3: receiver_pointer |
| // -- a4: argc |
| // -- a5: argv |
| // ----------------------------------- |
| |
| // Enter an internal frame. |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| |
| // Setup the context (we need to use the caller context from the isolate). |
| ExternalReference context_address = ExternalReference::Create( |
| IsolateAddressId::kContextAddress, masm->isolate()); |
| __ li(cp, context_address); |
| __ Ld_d(cp, MemOperand(cp, 0)); |
| |
| // Push the function and the receiver onto the stack. |
| __ Push(a2); |
| |
| // Check if we have enough stack space to push all arguments. |
| __ mov(a6, a4); |
| Generate_CheckStackOverflow(masm, a6, a0, s2); |
| |
| // Copy arguments to the stack. |
| // a4: argc |
| // a5: argv, i.e. points to first arg |
| Generate_PushArguments(masm, a5, a4, s1, s2, ArgumentsElementType::kHandle); |
| |
| // Push the receive. |
| __ Push(a3); |
| |
| // a0: argc |
| // a1: function |
| // a3: new.target |
| __ mov(a3, a1); |
| __ mov(a1, a2); |
| __ mov(a0, a4); |
| |
| // Initialize all JavaScript callee-saved registers, since they will be seen |
| // by the garbage collector as part of handlers. |
| __ LoadRoot(a4, RootIndex::kUndefinedValue); |
| __ mov(a5, a4); |
| __ mov(s1, a4); |
| __ mov(s2, a4); |
| __ mov(s3, a4); |
| __ mov(s4, a4); |
| __ mov(s5, a4); |
| #ifndef V8_COMPRESS_POINTERS |
| __ mov(s8, a4); |
| #endif |
| // s6 holds the root address. Do not clobber. |
| // s7 is cp. Do not init. |
| // s8 is pointer cage base register (kPointerCageBaseRegister). |
| |
| // Invoke the code. |
| Builtin builtin = is_construct ? Builtin::kConstruct : Builtins::Call(); |
| __ CallBuiltin(builtin); |
| |
| // Leave internal frame. |
| } |
| __ Jump(ra); |
| } |
| |
| void Builtins::Generate_JSEntryTrampoline(MacroAssembler* masm) { |
| Generate_JSEntryTrampolineHelper(masm, false); |
| } |
| |
| void Builtins::Generate_JSConstructEntryTrampoline(MacroAssembler* masm) { |
| Generate_JSEntryTrampolineHelper(masm, true); |
| } |
| |
| void Builtins::Generate_RunMicrotasksTrampoline(MacroAssembler* masm) { |
| // a1: microtask_queue |
| __ mov(RunMicrotasksDescriptor::MicrotaskQueueRegister(), a1); |
| __ TailCallBuiltin(Builtin::kRunMicrotasks); |
| } |
| |
| static void LeaveInterpreterFrame(MacroAssembler* masm, Register scratch1, |
| Register scratch2) { |
| Register params_size = scratch1; |
| |
| // Get the size of the formal parameters + receiver (in bytes). |
| __ Ld_d(params_size, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| __ Ld_hu(params_size, |
| FieldMemOperand(params_size, BytecodeArray::kParameterSizeOffset)); |
| |
| Register actual_params_size = scratch2; |
| // Compute the size of the actual parameters + receiver (in bytes). |
| __ Ld_d(actual_params_size, |
| MemOperand(fp, StandardFrameConstants::kArgCOffset)); |
| |
| // If actual is bigger than formal, then we should use it to free up the stack |
| // arguments. |
| __ slt(t2, params_size, actual_params_size); |
| __ Movn(params_size, actual_params_size, t2); |
| |
| // Leave the frame (also dropping the register file). |
| __ LeaveFrame(StackFrame::INTERPRETED); |
| |
| // Drop arguments. |
| __ DropArguments(params_size); |
| } |
| |
| // Advance the current bytecode offset. This simulates what all bytecode |
| // handlers do upon completion of the underlying operation. Will bail out to a |
| // label if the bytecode (without prefix) is a return bytecode. Will not advance |
| // the bytecode offset if the current bytecode is a JumpLoop, instead just |
| // re-executing the JumpLoop to jump to the correct bytecode. |
| static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm, |
| Register bytecode_array, |
| Register bytecode_offset, |
| Register bytecode, Register scratch1, |
| Register scratch2, Register scratch3, |
| Label* if_return) { |
| Register bytecode_size_table = scratch1; |
| |
| // The bytecode offset value will be increased by one in wide and extra wide |
| // cases. In the case of having a wide or extra wide JumpLoop bytecode, we |
| // will restore the original bytecode. In order to simplify the code, we have |
| // a backup of it. |
| Register original_bytecode_offset = scratch3; |
| DCHECK(!AreAliased(bytecode_array, bytecode_offset, bytecode, |
| bytecode_size_table, original_bytecode_offset)); |
| __ Move(original_bytecode_offset, bytecode_offset); |
| __ li(bytecode_size_table, ExternalReference::bytecode_size_table_address()); |
| |
| // Check if the bytecode is a Wide or ExtraWide prefix bytecode. |
| Label process_bytecode, extra_wide; |
| static_assert(0 == static_cast<int>(interpreter::Bytecode::kWide)); |
| static_assert(1 == static_cast<int>(interpreter::Bytecode::kExtraWide)); |
| static_assert(2 == static_cast<int>(interpreter::Bytecode::kDebugBreakWide)); |
| static_assert(3 == |
| static_cast<int>(interpreter::Bytecode::kDebugBreakExtraWide)); |
| __ Branch(&process_bytecode, hi, bytecode, Operand(3)); |
| __ And(scratch2, bytecode, Operand(1)); |
| __ Branch(&extra_wide, ne, scratch2, Operand(zero_reg)); |
| |
| // Load the next bytecode and update table to the wide scaled table. |
| __ Add_d(bytecode_offset, bytecode_offset, Operand(1)); |
| __ Add_d(scratch2, bytecode_array, bytecode_offset); |
| __ Ld_bu(bytecode, MemOperand(scratch2, 0)); |
| __ Add_d(bytecode_size_table, bytecode_size_table, |
| Operand(kByteSize * interpreter::Bytecodes::kBytecodeCount)); |
| __ jmp(&process_bytecode); |
| |
| __ bind(&extra_wide); |
| // Load the next bytecode and update table to the extra wide scaled table. |
| __ Add_d(bytecode_offset, bytecode_offset, Operand(1)); |
| __ Add_d(scratch2, bytecode_array, bytecode_offset); |
| __ Ld_bu(bytecode, MemOperand(scratch2, 0)); |
| __ Add_d(bytecode_size_table, bytecode_size_table, |
| Operand(2 * kByteSize * interpreter::Bytecodes::kBytecodeCount)); |
| |
| __ bind(&process_bytecode); |
| |
| // Bailout to the return label if this is a return bytecode. |
| #define JUMP_IF_EQUAL(NAME) \ |
| __ Branch(if_return, eq, bytecode, \ |
| Operand(static_cast<int>(interpreter::Bytecode::k##NAME))); |
| RETURN_BYTECODE_LIST(JUMP_IF_EQUAL) |
| #undef JUMP_IF_EQUAL |
| |
| // If this is a JumpLoop, re-execute it to perform the jump to the beginning |
| // of the loop. |
| Label end, not_jump_loop; |
| __ Branch(¬_jump_loop, ne, bytecode, |
| Operand(static_cast<int>(interpreter::Bytecode::kJumpLoop))); |
| // We need to restore the original bytecode_offset since we might have |
| // increased it to skip the wide / extra-wide prefix bytecode. |
| __ Move(bytecode_offset, original_bytecode_offset); |
| __ jmp(&end); |
| |
| __ bind(¬_jump_loop); |
| // Otherwise, load the size of the current bytecode and advance the offset. |
| __ Add_d(scratch2, bytecode_size_table, bytecode); |
| __ Ld_b(scratch2, MemOperand(scratch2, 0)); |
| __ Add_d(bytecode_offset, bytecode_offset, scratch2); |
| |
| __ bind(&end); |
| } |
| |
| namespace { |
| |
| void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) { |
| __ St_h(zero_reg, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset)); |
| } |
| |
| void ResetJSFunctionAge(MacroAssembler* masm, Register js_function, |
| Register scratch) { |
| __ LoadTaggedField( |
| scratch, |
| FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset)); |
| ResetSharedFunctionInfoAge(masm, scratch); |
| } |
| |
| void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm, |
| Register feedback_vector, Register scratch) { |
| DCHECK(!AreAliased(feedback_vector, scratch)); |
| __ Ld_bu(scratch, |
| FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset)); |
| __ And(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask)); |
| __ St_b(scratch, |
| FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset)); |
| } |
| |
| } // namespace |
| |
| // static |
| void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) { |
| UseScratchRegisterScope temps(masm); |
| temps.Include({s1, s2, s3}); |
| auto descriptor = |
| Builtins::CallInterfaceDescriptorFor(Builtin::kBaselineOutOfLinePrologue); |
| Register closure = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kClosure); |
| // Load the feedback cell and vector from the closure. |
| Register feedback_cell = temps.Acquire(); |
| Register feedback_vector = temps.Acquire(); |
| __ LoadTaggedField(feedback_cell, |
| FieldMemOperand(closure, JSFunction::kFeedbackCellOffset)); |
| __ LoadTaggedField( |
| feedback_vector, |
| FieldMemOperand(feedback_cell, FeedbackCell::kValueOffset)); |
| { |
| UseScratchRegisterScope temps(masm); |
| Register scratch = temps.Acquire(); |
| __ AssertFeedbackVector(feedback_vector, scratch); |
| } |
| |
| #ifndef V8_ENABLE_LEAPTIERING |
| // Check for an tiering state. |
| Label flags_need_processing; |
| Register flags = no_reg; |
| { |
| UseScratchRegisterScope temps(masm); |
| flags = temps.Acquire(); |
| // flags will be used only in |flags_need_processing| |
| // and outside it can be reused. |
| __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing( |
| flags, feedback_vector, CodeKind::BASELINE, &flags_need_processing); |
| } |
| #endif // !V8_ENABLE_LEAPTIERING |
| |
| { |
| UseScratchRegisterScope temps(masm); |
| ResetFeedbackVectorOsrUrgency(masm, feedback_vector, temps.Acquire()); |
| } |
| // Increment invocation count for the function. |
| { |
| UseScratchRegisterScope temps(masm); |
| Register invocation_count = temps.Acquire(); |
| __ Ld_w(invocation_count, |
| FieldMemOperand(feedback_vector, |
| FeedbackVector::kInvocationCountOffset)); |
| __ Add_w(invocation_count, invocation_count, Operand(1)); |
| __ St_w(invocation_count, |
| FieldMemOperand(feedback_vector, |
| FeedbackVector::kInvocationCountOffset)); |
| } |
| |
| FrameScope frame_scope(masm, StackFrame::MANUAL); |
| { |
| ASM_CODE_COMMENT_STRING(masm, "Frame Setup"); |
| // Normally the first thing we'd do here is Push(ra, fp), but we already |
| // entered the frame in BaselineCompiler::Prologue, as we had to use the |
| // value ra before the call to this BaselineOutOfLinePrologue builtin. |
| Register callee_context = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kCalleeContext); |
| Register callee_js_function = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kClosure); |
| { |
| UseScratchRegisterScope temps(masm); |
| ResetJSFunctionAge(masm, callee_js_function, temps.Acquire()); |
| } |
| __ Push(callee_context, callee_js_function); |
| DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister); |
| DCHECK_EQ(callee_js_function, kJSFunctionRegister); |
| |
| Register argc = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kJavaScriptCallArgCount); |
| // We'll use the bytecode for both code age/OSR resetting, and pushing onto |
| // the frame, so load it into a register. |
| Register bytecode_array = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray); |
| __ Push(argc, bytecode_array, feedback_cell, feedback_vector); |
| |
| { |
| UseScratchRegisterScope temps(masm); |
| Register invocation_count = temps.Acquire(); |
| __ AssertFeedbackVector(feedback_vector, invocation_count); |
| } |
| } |
| |
| Label call_stack_guard; |
| Register frame_size = descriptor.GetRegisterParameter( |
| BaselineOutOfLinePrologueDescriptor::kStackFrameSize); |
| { |
| ASM_CODE_COMMENT_STRING(masm, "Stack/interrupt check"); |
| // Stack check. This folds the checks for both the interrupt stack limit |
| // check and the real stack limit into one by just checking for the |
| // interrupt limit. The interrupt limit is either equal to the real stack |
| // limit or tighter. By ensuring we have space until that limit after |
| // building the frame we can quickly precheck both at once. |
| UseScratchRegisterScope temps(masm); |
| Register sp_minus_frame_size = temps.Acquire(); |
| __ Sub_d(sp_minus_frame_size, sp, frame_size); |
| Register interrupt_limit = temps.Acquire(); |
| __ LoadStackLimit(interrupt_limit, |
| MacroAssembler::StackLimitKind::kInterruptStackLimit); |
| __ Branch(&call_stack_guard, Uless, sp_minus_frame_size, |
| Operand(interrupt_limit)); |
| } |
| |
| // Do "fast" return to the caller pc in ra. |
| // TODO(v8:11429): Document this frame setup better. |
| __ Ret(); |
| |
| #ifndef V8_ENABLE_LEAPTIERING |
| __ bind(&flags_need_processing); |
| { |
| ASM_CODE_COMMENT_STRING(masm, "Optimized marker check"); |
| UseScratchRegisterScope temps(masm); |
| temps.Exclude(flags); |
| // Ensure the flags is not allocated again. |
| // Drop the frame created by the baseline call. |
| __ Pop(ra, fp); |
| __ OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector); |
| __ Trap(); |
| } |
| #endif // !V8_ENABLE_LEAPTIERING |
| |
| __ bind(&call_stack_guard); |
| { |
| ASM_CODE_COMMENT_STRING(masm, "Stack/interrupt call"); |
| FrameScope frame_scope(masm, StackFrame::INTERNAL); |
| // Save incoming new target or generator |
| __ Push(kJavaScriptCallNewTargetRegister); |
| #ifdef V8_ENABLE_LEAPTIERING |
| // No need to SmiTag as dispatch handles always look like Smis. |
| static_assert(kJSDispatchHandleShift > 0); |
| __ Push(kJavaScriptCallDispatchHandleRegister); |
| #endif |
| __ SmiTag(frame_size); |
| __ Push(frame_size); |
| __ CallRuntime(Runtime::kStackGuardWithGap); |
| #ifdef V8_ENABLE_LEAPTIERING |
| __ Pop(kJavaScriptCallDispatchHandleRegister); |
| #endif |
| __ Pop(kJavaScriptCallNewTargetRegister); |
| } |
| __ Ret(); |
| temps.Exclude({s1, s2, s3}); |
| } |
| |
| // static |
| void Builtins::Generate_BaselineOutOfLinePrologueDeopt(MacroAssembler* masm) { |
| // We're here because we got deopted during BaselineOutOfLinePrologue's stack |
| // check. Undo all its frame creation and call into the interpreter instead. |
| |
| // Drop the feedback vector, the bytecode offset (was the feedback vector |
| // but got replaced during deopt) and bytecode array. |
| __ Drop(3); |
| |
| // Context, closure, argc. |
| __ Pop(kContextRegister, kJavaScriptCallTargetRegister, |
| kJavaScriptCallArgCountRegister); |
| |
| // Drop frame pointer |
| __ LeaveFrame(StackFrame::BASELINE); |
| |
| // Enter the interpreter. |
| __ TailCallBuiltin(Builtin::kInterpreterEntryTrampoline); |
| } |
| |
| // Generate code for entering a JS function with the interpreter. |
| // On entry to the function the receiver and arguments have been pushed on the |
| // stack left to right. |
| // |
| // The live registers are: |
| // o a0 : actual argument count |
| // o a1: the JS function object being called. |
| // o a3: the incoming new target or generator object |
| // o a4: the dispatch handle through which we were called |
| // o cp: our context |
| // o fp: the caller's frame pointer |
| // o sp: stack pointer |
| // o ra: return address |
| // |
| // The function builds an interpreter frame. See InterpreterFrameConstants in |
| // frame-constants.h for its layout. |
| void Builtins::Generate_InterpreterEntryTrampoline( |
| MacroAssembler* masm, InterpreterEntryTrampolineMode mode) { |
| Register closure = a1; |
| |
| // Get the bytecode array from the function object and load it into |
| // kInterpreterBytecodeArrayRegister. |
| Register sfi = a5; |
| __ LoadTaggedField( |
| sfi, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset)); |
| ResetSharedFunctionInfoAge(masm, sfi); |
| |
| |
| // The bytecode array could have been flushed from the shared function info, |
| // if so, call into CompileLazy. |
| Label is_baseline, compile_lazy; |
| GetSharedFunctionInfoBytecodeOrBaseline( |
| masm, sfi, kInterpreterBytecodeArrayRegister, kScratchReg, &is_baseline, |
| &compile_lazy); |
| |
| #ifdef V8_ENABLE_SANDBOX |
| // Validate the parameter count. This protects against an attacker swapping |
| // the bytecode (or the dispatch handle) such that the parameter count of the |
| // dispatch entry doesn't match the one of the BytecodeArray. |
| // TODO(saelo): instead of this validation step, it would probably be nicer |
| // if we could store the BytecodeArray directly in the dispatch entry and |
| // load it from there. Then we can easily guarantee that the parameter count |
| // of the entry matches the parameter count of the bytecode. |
| static_assert(V8_JS_LINKAGE_INCLUDES_DISPATCH_HANDLE_BOOL); |
| Register dispatch_handle = kJavaScriptCallDispatchHandleRegister; |
| __ LoadParameterCountFromJSDispatchTable(a6, dispatch_handle, a7); |
| __ Ld_hu(a7, FieldMemOperand(kInterpreterBytecodeArrayRegister, |
| BytecodeArray::kParameterSizeOffset)); |
| __ SbxCheck(eq, AbortReason::kJSSignatureMismatch, a6, Operand(a7)); |
| #endif // V8_ENABLE_SANDBOX |
| |
| Label push_stack_frame; |
| Register feedback_vector = a2; |
| __ LoadFeedbackVector(feedback_vector, closure, a5, &push_stack_frame); |
| |
| #ifndef V8_JITLESS |
| #ifndef V8_ENABLE_LEAPTIERING |
| // If feedback vector is valid, check for optimized code and update invocation |
| // count. |
| |
| // Check the tiering state. |
| Label flags_need_processing; |
| Register flags = t0; |
| __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing( |
| flags, feedback_vector, CodeKind::INTERPRETED_FUNCTION, |
| &flags_need_processing); |
| #endif // !V8_ENABLE_LEAPTIERING |
| |
| ResetFeedbackVectorOsrUrgency(masm, feedback_vector, a5); |
| |
| // Increment invocation count for the function. |
| __ Ld_w(a5, FieldMemOperand(feedback_vector, |
| FeedbackVector::kInvocationCountOffset)); |
| __ Add_w(a5, a5, Operand(1)); |
| __ St_w(a5, FieldMemOperand(feedback_vector, |
| FeedbackVector::kInvocationCountOffset)); |
| |
| // Open a frame scope to indicate that there is a frame on the stack. The |
| // MANUAL indicates that the scope shouldn't actually generate code to set up |
| // the frame (that is done below). |
| #else |
| // Note: By omitting the above code in jitless mode we also disable: |
| // - kFlagsLogNextExecution: only used for logging/profiling; and |
| // - kInvocationCountOffset: only used for tiering heuristics and code |
| // coverage. |
| #endif // !V8_JITLESS |
| |
| __ bind(&push_stack_frame); |
| FrameScope frame_scope(masm, StackFrame::MANUAL); |
| __ PushStandardFrame(closure); |
| |
| // Load initial bytecode offset. |
| __ li(kInterpreterBytecodeOffsetRegister, |
| Operand(BytecodeArray::kHeaderSize - kHeapObjectTag)); |
| |
| // Push bytecode array, Smi tagged bytecode array offset and the feedback |
| // vector. |
| __ SmiTag(a5, kInterpreterBytecodeOffsetRegister); |
| __ Push(kInterpreterBytecodeArrayRegister, a5, feedback_vector); |
| |
| // Allocate the local and temporary register file on the stack. |
| Label stack_overflow; |
| { |
| // Load frame size (word) from the BytecodeArray object. |
| __ Ld_w(a5, FieldMemOperand(kInterpreterBytecodeArrayRegister, |
| BytecodeArray::kFrameSizeOffset)); |
| |
| // Do a stack check to ensure we don't go over the limit. |
| __ Sub_d(a6, sp, Operand(a5)); |
| __ LoadStackLimit(a2, MacroAssembler::StackLimitKind::kRealStackLimit); |
| __ Branch(&stack_overflow, lo, a6, Operand(a2)); |
| |
| // If ok, push undefined as the initial value for all register file entries. |
| Label loop_header; |
| Label loop_check; |
| __ LoadRoot(kInterpreterAccumulatorRegister, RootIndex::kUndefinedValue); |
| __ Branch(&loop_check); |
| __ bind(&loop_header); |
| // TODO(rmcilroy): Consider doing more than one push per loop iteration. |
| __ Push(kInterpreterAccumulatorRegister); |
| // Continue loop if not done. |
| __ bind(&loop_check); |
| __ Sub_d(a5, a5, Operand(kSystemPointerSize)); |
| __ Branch(&loop_header, ge, a5, Operand(zero_reg)); |
| } |
| |
| // If the bytecode array has a valid incoming new target or generator object |
| // register, initialize it with incoming value which was passed in a3. |
| Label no_incoming_new_target_or_generator_register; |
| __ Ld_w(a5, FieldMemOperand( |
| kInterpreterBytecodeArrayRegister, |
| BytecodeArray::kIncomingNewTargetOrGeneratorRegisterOffset)); |
| __ Branch(&no_incoming_new_target_or_generator_register, eq, a5, |
| Operand(zero_reg)); |
| __ Alsl_d(a5, a5, fp, kSystemPointerSizeLog2); |
| __ St_d(a3, MemOperand(a5, 0)); |
| __ bind(&no_incoming_new_target_or_generator_register); |
| |
| // Perform interrupt stack check. |
| // TODO(solanes): Merge with the real stack limit check above. |
| Label stack_check_interrupt, after_stack_check_interrupt; |
| __ LoadStackLimit(a5, MacroAssembler::StackLimitKind::kInterruptStackLimit); |
| __ Branch(&stack_check_interrupt, lo, sp, Operand(a5)); |
| __ bind(&after_stack_check_interrupt); |
| |
| // The accumulator is already loaded with undefined. |
| |
| // Load the dispatch table into a register and dispatch to the bytecode |
| // handler at the current bytecode offset. |
| Label do_dispatch; |
| __ bind(&do_dispatch); |
| __ li(kInterpreterDispatchTableRegister, |
| ExternalReference::interpreter_dispatch_table_address(masm->isolate())); |
| __ Add_d(t5, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister); |
| __ Ld_bu(a7, MemOperand(t5, 0)); |
| __ Alsl_d(kScratchReg, a7, kInterpreterDispatchTableRegister, |
| kSystemPointerSizeLog2); |
| __ Ld_d(kJavaScriptCallCodeStartRegister, MemOperand(kScratchReg, 0)); |
| __ Call(kJavaScriptCallCodeStartRegister); |
| |
| __ RecordComment("--- InterpreterEntryReturnPC point ---"); |
| if (mode == InterpreterEntryTrampolineMode::kDefault) { |
| masm->isolate()->heap()->SetInterpreterEntryReturnPCOffset( |
| masm->pc_offset()); |
| } else { |
| DCHECK_EQ(mode, InterpreterEntryTrampolineMode::kForProfiling); |
| // Both versions must be the same up to this point otherwise the builtins |
| // will not be interchangable. |
| CHECK_EQ( |
| masm->isolate()->heap()->interpreter_entry_return_pc_offset().value(), |
| masm->pc_offset()); |
| } |
| |
| // Any returns to the entry trampoline are either due to the return bytecode |
| // or the interpreter tail calling a builtin and then a dispatch. |
| |
| // Get bytecode array and bytecode offset from the stack frame. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| __ Ld_d(kInterpreterBytecodeOffsetRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| __ SmiUntag(kInterpreterBytecodeOffsetRegister); |
| |
| // Either return, or advance to the next bytecode and dispatch. |
| Label do_return; |
| __ Add_d(a1, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister); |
| __ Ld_bu(a1, MemOperand(a1, 0)); |
| AdvanceBytecodeOffsetOrReturn(masm, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister, a1, a2, a3, |
| a5, &do_return); |
| __ jmp(&do_dispatch); |
| |
| __ bind(&do_return); |
| // The return value is in a0. |
| LeaveInterpreterFrame(masm, t0, t1); |
| __ Jump(ra); |
| |
| __ bind(&stack_check_interrupt); |
| // Modify the bytecode offset in the stack to be kFunctionEntryBytecodeOffset |
| // for the call to the StackGuard. |
| __ li(kInterpreterBytecodeOffsetRegister, |
| Operand(Smi::FromInt(BytecodeArray::kHeaderSize - kHeapObjectTag + |
| kFunctionEntryBytecodeOffset))); |
| __ St_d(kInterpreterBytecodeOffsetRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| __ CallRuntime(Runtime::kStackGuard); |
| |
| // After the call, restore the bytecode array, bytecode offset and accumulator |
| // registers again. Also, restore the bytecode offset in the stack to its |
| // previous value. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| __ li(kInterpreterBytecodeOffsetRegister, |
| Operand(BytecodeArray::kHeaderSize - kHeapObjectTag)); |
| __ LoadRoot(kInterpreterAccumulatorRegister, RootIndex::kUndefinedValue); |
| |
| __ SmiTag(a5, kInterpreterBytecodeOffsetRegister); |
| __ St_d(a5, MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| |
| __ jmp(&after_stack_check_interrupt); |
| |
| #ifndef V8_JITLESS |
| #ifndef V8_ENABLE_LEAPTIERING |
| __ bind(&flags_need_processing); |
| __ OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector); |
| #endif // !V8_ENABLE_LEAPTIERING |
| |
| __ bind(&is_baseline); |
| { |
| #ifndef V8_ENABLE_LEAPTIERING |
| // Load the feedback vector from the closure. |
| __ LoadTaggedField( |
| feedback_vector, |
| FieldMemOperand(closure, JSFunction::kFeedbackCellOffset)); |
| __ LoadTaggedField( |
| feedback_vector, |
| FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset)); |
| |
| Label install_baseline_code; |
| // Check if feedback vector is valid. If not, call prepare for baseline to |
| // allocate it. |
| __ LoadTaggedField( |
| t0, FieldMemOperand(feedback_vector, HeapObject::kMapOffset)); |
| __ Ld_hu(t0, FieldMemOperand(t0, Map::kInstanceTypeOffset)); |
| __ Branch(&install_baseline_code, ne, t0, Operand(FEEDBACK_VECTOR_TYPE)); |
| |
| // Check for an tiering state. |
| __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing( |
| flags, feedback_vector, CodeKind::BASELINE, &flags_need_processing); |
| |
| // TODO(loong64, 42204201): This fastcase is difficult to support with the |
| // sandbox as it requires getting write access to the dispatch table. See |
| // `JSFunction::UpdateCode`. We might want to remove it for all |
| // configurations as it does not seem to be performance sensitive. |
| |
| // Load the baseline code into the closure. |
| __ Move(a2, kInterpreterBytecodeArrayRegister); |
| static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch"); |
| __ ReplaceClosureCodeWithOptimizedCode(a2, closure); |
| __ JumpCodeObject(a2, kJSEntrypointTag); |
| |
| __ bind(&install_baseline_code); |
| #endif // !V8_ENABLE_LEAPTIERING |
| |
| __ GenerateTailCallToReturnedCode(Runtime::kInstallBaselineCode); |
| } |
| #endif // !V8_JITLESS |
| |
| __ bind(&compile_lazy); |
| __ GenerateTailCallToReturnedCode(Runtime::kCompileLazy); |
| // Unreachable code. |
| __ break_(0xCC); |
| |
| __ bind(&stack_overflow); |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| // Unreachable code. |
| __ break_(0xCC); |
| } |
| |
| static void GenerateInterpreterPushArgs(MacroAssembler* masm, Register num_args, |
| Register start_address, |
| Register scratch, Register scratch2) { |
| // Find the address of the last argument. |
| __ Sub_d(scratch, num_args, Operand(1)); |
| __ slli_d(scratch, scratch, kSystemPointerSizeLog2); |
| __ Sub_d(start_address, start_address, scratch); |
| |
| // Push the arguments. |
| __ PushArray(start_address, num_args, scratch, scratch2, |
| MacroAssembler::PushArrayOrder::kReverse); |
| } |
| |
| // static |
| void Builtins::Generate_InterpreterPushArgsThenCallImpl( |
| MacroAssembler* masm, ConvertReceiverMode receiver_mode, |
| InterpreterPushArgsMode mode) { |
| DCHECK(mode != InterpreterPushArgsMode::kArrayFunction); |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a2 : the address of the first argument to be pushed. Subsequent |
| // arguments should be consecutive above this, in the same order as |
| // they are to be pushed onto the stack. |
| // -- a1 : the target to call (can be any Object). |
| // ----------------------------------- |
| Label stack_overflow; |
| if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| // The spread argument should not be pushed. |
| __ Sub_d(a0, a0, Operand(1)); |
| } |
| |
| if (receiver_mode == ConvertReceiverMode::kNullOrUndefined) { |
| __ Sub_d(a3, a0, Operand(kJSArgcReceiverSlots)); |
| } else { |
| __ mov(a3, a0); |
| } |
| |
| __ StackOverflowCheck(a3, a4, t0, &stack_overflow); |
| |
| // This function modifies a2, t0 and a4. |
| GenerateInterpreterPushArgs(masm, a3, a2, a4, t0); |
| |
| if (receiver_mode == ConvertReceiverMode::kNullOrUndefined) { |
| __ PushRoot(RootIndex::kUndefinedValue); |
| } |
| |
| if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| // Pass the spread in the register a2. |
| // a2 already points to the penultime argument, the spread |
| // is below that. |
| __ Ld_d(a2, MemOperand(a2, -kSystemPointerSize)); |
| } |
| |
| // Call the target. |
| if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| __ TailCallBuiltin(Builtin::kCallWithSpread); |
| } else { |
| __ TailCallBuiltin(Builtins::Call(receiver_mode)); |
| } |
| |
| __ bind(&stack_overflow); |
| { |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| // Unreachable code. |
| __ break_(0xCC); |
| } |
| } |
| |
| // static |
| void Builtins::Generate_InterpreterPushArgsThenConstructImpl( |
| MacroAssembler* masm, InterpreterPushArgsMode mode) { |
| // ----------- S t a t e ------------- |
| // -- a0 : argument count |
| // -- a3 : new target |
| // -- a1 : constructor to call |
| // -- a2 : allocation site feedback if available, undefined otherwise. |
| // -- a4 : address of the first argument |
| // ----------------------------------- |
| Label stack_overflow; |
| __ StackOverflowCheck(a0, a5, t0, &stack_overflow); |
| |
| if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| // The spread argument should not be pushed. |
| __ Sub_d(a0, a0, Operand(1)); |
| } |
| |
| Register argc_without_receiver = a6; |
| __ Sub_d(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots)); |
| |
| // Push the arguments, This function modifies t0, a4 and a5. |
| GenerateInterpreterPushArgs(masm, argc_without_receiver, a4, a5, t0); |
| |
| // Push a slot for the receiver. |
| __ Push(zero_reg); |
| |
| if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| // Pass the spread in the register a2. |
| // a4 already points to the penultimate argument, the spread |
| // lies in the next interpreter register. |
| __ Ld_d(a2, MemOperand(a4, -kSystemPointerSize)); |
| } else { |
| __ AssertUndefinedOrAllocationSite(a2, t0); |
| } |
| |
| if (mode == InterpreterPushArgsMode::kArrayFunction) { |
| __ AssertFunction(a1); |
| |
| // Tail call to the function-specific construct stub (still in the caller |
| // context at this point). |
| __ TailCallBuiltin(Builtin::kArrayConstructorImpl); |
| } else if (mode == InterpreterPushArgsMode::kWithFinalSpread) { |
| // Call the constructor with a0, a1, and a3 unmodified. |
| __ TailCallBuiltin(Builtin::kConstructWithSpread); |
| } else { |
| DCHECK_EQ(InterpreterPushArgsMode::kOther, mode); |
| // Call the constructor with a0, a1, and a3 unmodified. |
| __ TailCallBuiltin(Builtin::kConstruct); |
| } |
| |
| __ bind(&stack_overflow); |
| { |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| // Unreachable code. |
| __ break_(0xCC); |
| } |
| } |
| |
| // static |
| void Builtins::Generate_ConstructForwardAllArgsImpl( |
| MacroAssembler* masm, ForwardWhichFrame which_frame) { |
| // ----------- S t a t e ------------- |
| // -- a3 : new target |
| // -- a1 : constructor to call |
| // ----------------------------------- |
| Label stack_overflow; |
| |
| // Load the frame pointer into a4. |
| switch (which_frame) { |
| case ForwardWhichFrame::kCurrentFrame: |
| __ Move(a4, fp); |
| break; |
| case ForwardWhichFrame::kParentFrame: |
| __ Ld_d(a4, MemOperand(fp, StandardFrameConstants::kCallerFPOffset)); |
| break; |
| } |
| |
| // Load the argument count into a0. |
| __ Ld_d(a0, MemOperand(a4, StandardFrameConstants::kArgCOffset)); |
| __ StackOverflowCheck(a0, a5, t0, &stack_overflow); |
| |
| // Point a4 to the base of the argument list to forward, excluding the |
| // receiver. |
| __ Add_d(a4, a4, |
| Operand((StandardFrameConstants::kFixedSlotCountAboveFp + 1) * |
| kSystemPointerSize)); |
| |
| // Copy arguments on the stack. a5 and t0 are scratch registers. |
| Register argc_without_receiver = a6; |
| __ Sub_d(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots)); |
| __ PushArray(a4, argc_without_receiver, a5, t0); |
| |
| // Push a slot for the receiver. |
| __ Push(zero_reg); |
| |
| // Call the constructor with a0, a1, and a3 unmodified. |
| __ TailCallBuiltin(Builtin::kConstruct); |
| |
| __ bind(&stack_overflow); |
| { |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| __ break_(0xCC); |
| } |
| } |
| |
| namespace { |
| |
| void NewImplicitReceiver(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : constructor to call (checked to be a JSFunction) |
| // -- a3 : new target |
| // |
| // Stack: |
| // -- Implicit Receiver |
| // -- [arguments without receiver] |
| // -- Implicit Receiver |
| // -- Context |
| // -- FastConstructMarker |
| // -- FramePointer |
| // ----------------------------------- |
| Register implicit_receiver = a4; |
| |
| // Save live registers. |
| __ SmiTag(a0); |
| __ Push(a0, a1, a3); |
| __ CallBuiltin(Builtin::kFastNewObject); |
| // Save result. |
| __ Move(implicit_receiver, a0); |
| // Restore live registers. |
| __ Pop(a0, a1, a3); |
| __ SmiUntag(a0); |
| |
| // Patch implicit receiver (in arguments) |
| __ StoreReceiver(implicit_receiver); |
| // Patch second implicit (in construct frame) |
| __ St_d(implicit_receiver, |
| MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset)); |
| |
| // Restore context. |
| __ Ld_d(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset)); |
| } |
| |
| } // namespace |
| |
| // static |
| void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction( |
| MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : argument count |
| // -- a1 : constructor to call (checked to be a JSFunction) |
| // -- a3 : new target |
| // -- a4 : address of the first argument |
| // -- cp : context pointer |
| // ----------------------------------- |
| __ AssertFunction(a1); |
| |
| // Check if target has a [[Construct]] internal method. |
| Label non_constructor; |
| __ LoadMap(a2, a1); |
| __ Ld_bu(a2, FieldMemOperand(a2, Map::kBitFieldOffset)); |
| __ And(a2, a2, Operand(Map::Bits1::IsConstructorBit::kMask)); |
| __ Branch(&non_constructor, eq, a2, Operand(zero_reg)); |
| |
| // Add a stack check before pushing arguments. |
| Label stack_overflow; |
| __ StackOverflowCheck(a0, a2, a5, &stack_overflow); |
| |
| // Enter a construct frame. |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterFrame(StackFrame::FAST_CONSTRUCT); |
| |
| // Implicit receiver stored in the construct frame. |
| __ LoadRoot(a2, RootIndex::kTheHoleValue); |
| __ Push(cp, a2); |
| |
| // Push arguments + implicit receiver. |
| Register argc_without_receiver = a7; |
| __ Sub_d(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots)); |
| GenerateInterpreterPushArgs(masm, argc_without_receiver, a4, a5, a6); |
| __ Push(a2); |
| |
| // Check if it is a builtin call. |
| Label builtin_call; |
| __ LoadTaggedField( |
| a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset)); |
| __ Ld_wu(a2, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset)); |
| __ And(a5, a2, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask)); |
| __ Branch(&builtin_call, ne, a5, Operand(zero_reg)); |
| |
| // Check if we need to create an implicit receiver. |
| Label not_create_implicit_receiver; |
| __ DecodeField<SharedFunctionInfo::FunctionKindBits>(a2); |
| __ JumpIfIsInRange( |
| a2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor), |
| static_cast<uint32_t>(FunctionKind::kDerivedConstructor), |
| ¬_create_implicit_receiver); |
| NewImplicitReceiver(masm); |
| __ bind(¬_create_implicit_receiver); |
| |
| // Call the function. |
| __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall); |
| |
| // ----------- S t a t e ------------- |
| // -- a0 constructor result |
| // |
| // Stack: |
| // -- Implicit Receiver |
| // -- Context |
| // -- FastConstructMarker |
| // -- FramePointer |
| // ----------------------------------- |
| |
| // Store offset of return address for deoptimizer. |
| masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset( |
| masm->pc_offset()); |
| |
| // If the result is an object (in the ECMA sense), we should get rid |
| // of the receiver and use the result; see ECMA-262 section 13.2.2-7 |
| // on page 74. |
| Label use_receiver, do_throw, leave_and_return, check_receiver; |
| |
| // If the result is undefined, we jump out to using the implicit receiver. |
| __ JumpIfNotRoot(a0, RootIndex::kUndefinedValue, &check_receiver); |
| |
| // Throw away the result of the constructor invocation and use the |
| // on-stack receiver as the result. |
| __ bind(&use_receiver); |
| __ Ld_d(a0, |
| MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset)); |
| __ JumpIfRoot(a0, RootIndex::kTheHoleValue, &do_throw); |
| |
| __ bind(&leave_and_return); |
| // Leave construct frame. |
| __ LeaveFrame(StackFrame::FAST_CONSTRUCT); |
| __ Ret(); |
| |
| // Otherwise we do a smi check and fall through to check if the return value |
| // is a valid receiver. |
| __ bind(&check_receiver); |
| |
| // If the result is a smi, it is *not* an object in the ECMA sense. |
| __ JumpIfSmi(a0, &use_receiver); |
| |
| // Check if the type of the result is not an object in the ECMA sense. |
| __ JumpIfJSAnyIsNotPrimitive(a0, a4, &leave_and_return); |
| __ Branch(&use_receiver); |
| |
| __ bind(&builtin_call); |
| // TODO(victorgomes): Check the possibility to turn this into a tailcall. |
| __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall); |
| __ LeaveFrame(StackFrame::FAST_CONSTRUCT); |
| __ Ret(); |
| |
| __ bind(&do_throw); |
| // Restore the context from the frame. |
| __ Ld_d(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset)); |
| __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject); |
| // Unreachable code. |
| __ break_(0xCC); |
| |
| __ bind(&stack_overflow); |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| // Unreachable code. |
| __ break_(0xCC); |
| |
| // Called Construct on an Object that doesn't have a [[Construct]] internal |
| // method. |
| __ bind(&non_constructor); |
| __ TailCallBuiltin(Builtin::kConstructedNonConstructable); |
| } |
| |
| static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) { |
| // Set the return address to the correct point in the interpreter entry |
| // trampoline. |
| Label builtin_trampoline, trampoline_loaded; |
| Tagged<Smi> interpreter_entry_return_pc_offset( |
| masm->isolate()->heap()->interpreter_entry_return_pc_offset()); |
| DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero()); |
| |
| // If the SFI function_data is an InterpreterData, the function will have a |
| // custom copy of the interpreter entry trampoline for profiling. If so, |
| // get the custom trampoline, otherwise grab the entry address of the global |
| // trampoline. |
| __ Ld_d(t0, MemOperand(fp, StandardFrameConstants::kFunctionOffset)); |
| __ LoadTaggedField( |
| t0, FieldMemOperand(t0, JSFunction::kSharedFunctionInfoOffset)); |
| __ LoadTrustedPointerField( |
| t0, FieldMemOperand(t0, SharedFunctionInfo::kTrustedFunctionDataOffset), |
| kUnknownIndirectPointerTag); |
| __ JumpIfObjectType(&builtin_trampoline, ne, t0, INTERPRETER_DATA_TYPE, |
| kInterpreterDispatchTableRegister); |
| |
| __ LoadProtectedPointerField( |
| t0, FieldMemOperand(t0, InterpreterData::kInterpreterTrampolineOffset)); |
| __ LoadCodeInstructionStart(t0, t0, kJSEntrypointTag); |
| __ Branch(&trampoline_loaded); |
| |
| __ bind(&builtin_trampoline); |
| __ li(t0, ExternalReference:: |
| address_of_interpreter_entry_trampoline_instruction_start( |
| masm->isolate())); |
| __ Ld_d(t0, MemOperand(t0, 0)); |
| |
| __ bind(&trampoline_loaded); |
| __ Add_d(ra, t0, Operand(interpreter_entry_return_pc_offset.value())); |
| |
| // Initialize the dispatch table register. |
| __ li(kInterpreterDispatchTableRegister, |
| ExternalReference::interpreter_dispatch_table_address(masm->isolate())); |
| |
| // Get the bytecode array pointer from the frame. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| |
| if (v8_flags.debug_code) { |
| // Check function data field is actually a BytecodeArray object. |
| __ SmiTst(kInterpreterBytecodeArrayRegister, kScratchReg); |
| __ Assert(ne, |
| AbortReason::kFunctionDataShouldBeBytecodeArrayOnInterpreterEntry, |
| kScratchReg, Operand(zero_reg)); |
| __ GetObjectType(kInterpreterBytecodeArrayRegister, a1, a1); |
| __ Assert(eq, |
| AbortReason::kFunctionDataShouldBeBytecodeArrayOnInterpreterEntry, |
| a1, Operand(BYTECODE_ARRAY_TYPE)); |
| } |
| |
| // Get the target bytecode offset from the frame. |
| __ SmiUntag(kInterpreterBytecodeOffsetRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| |
| if (v8_flags.debug_code) { |
| Label okay; |
| __ Branch(&okay, ge, kInterpreterBytecodeOffsetRegister, |
| Operand(BytecodeArray::kHeaderSize - kHeapObjectTag)); |
| // Unreachable code. |
| __ break_(0xCC); |
| __ bind(&okay); |
| } |
| |
| // Dispatch to the target bytecode. |
| __ Add_d(a1, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister); |
| __ Ld_bu(a7, MemOperand(a1, 0)); |
| __ Alsl_d(a1, a7, kInterpreterDispatchTableRegister, kSystemPointerSizeLog2); |
| __ Ld_d(kJavaScriptCallCodeStartRegister, MemOperand(a1, 0)); |
| __ Jump(kJavaScriptCallCodeStartRegister); |
| } |
| |
| void Builtins::Generate_InterpreterEnterAtNextBytecode(MacroAssembler* masm) { |
| // Advance the current bytecode offset stored within the given interpreter |
| // stack frame. This simulates what all bytecode handlers do upon completion |
| // of the underlying operation. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| __ Ld_d(kInterpreterBytecodeOffsetRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| __ SmiUntag(kInterpreterBytecodeOffsetRegister); |
| |
| Label enter_bytecode, function_entry_bytecode; |
| __ Branch(&function_entry_bytecode, eq, kInterpreterBytecodeOffsetRegister, |
| Operand(BytecodeArray::kHeaderSize - kHeapObjectTag + |
| kFunctionEntryBytecodeOffset)); |
| |
| // Load the current bytecode. |
| __ Add_d(a1, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister); |
| __ Ld_bu(a1, MemOperand(a1, 0)); |
| |
| // Advance to the next bytecode. |
| Label if_return; |
| AdvanceBytecodeOffsetOrReturn(masm, kInterpreterBytecodeArrayRegister, |
| kInterpreterBytecodeOffsetRegister, a1, a2, a3, |
| a4, &if_return); |
| |
| __ bind(&enter_bytecode); |
| // Convert new bytecode offset to a Smi and save in the stackframe. |
| __ SmiTag(a2, kInterpreterBytecodeOffsetRegister); |
| __ St_d(a2, MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| |
| Generate_InterpreterEnterBytecode(masm); |
| |
| __ bind(&function_entry_bytecode); |
| // If the code deoptimizes during the implicit function entry stack interrupt |
| // check, it will have a bailout ID of kFunctionEntryBytecodeOffset, which is |
| // not a valid bytecode offset. Detect this case and advance to the first |
| // actual bytecode. |
| __ li(kInterpreterBytecodeOffsetRegister, |
| Operand(BytecodeArray::kHeaderSize - kHeapObjectTag)); |
| __ Branch(&enter_bytecode); |
| |
| // We should never take the if_return path. |
| __ bind(&if_return); |
| __ Abort(AbortReason::kInvalidBytecodeAdvance); |
| } |
| |
| void Builtins::Generate_InterpreterEnterAtBytecode(MacroAssembler* masm) { |
| Generate_InterpreterEnterBytecode(masm); |
| } |
| |
| namespace { |
| void Generate_ContinueToBuiltinHelper(MacroAssembler* masm, |
| bool javascript_builtin, |
| bool with_result) { |
| const RegisterConfiguration* config(RegisterConfiguration::Default()); |
| int allocatable_register_count = config->num_allocatable_general_registers(); |
| UseScratchRegisterScope temps(masm); |
| Register scratch = temps.Acquire(); |
| if (with_result) { |
| if (javascript_builtin) { |
| __ mov(scratch, a0); |
| } else { |
| // Overwrite the hole inserted by the deoptimizer with the return value |
| // from the LAZY deopt point. |
| __ St_d(a0, |
| MemOperand( |
| sp, config->num_allocatable_general_registers() * |
| kSystemPointerSize + |
| BuiltinContinuationFrameConstants::kFixedFrameSize)); |
| } |
| } |
| for (int i = allocatable_register_count - 1; i >= 0; --i) { |
| int code = config->GetAllocatableGeneralCode(i); |
| __ Pop(Register::from_code(code)); |
| if (javascript_builtin && code == kJavaScriptCallArgCountRegister.code()) { |
| __ SmiUntag(Register::from_code(code)); |
| } |
| } |
| |
| if (with_result && javascript_builtin) { |
| // Overwrite the hole inserted by the deoptimizer with the return value from |
| // the LAZY deopt point. t0 contains the arguments count, the return value |
| // from LAZY is always the last argument. |
| constexpr int return_value_offset = |
| BuiltinContinuationFrameConstants::kFixedSlotCount - |
| kJSArgcReceiverSlots; |
| __ Add_d(a0, a0, Operand(return_value_offset)); |
| __ Alsl_d(t0, a0, sp, kSystemPointerSizeLog2); |
| __ St_d(scratch, MemOperand(t0, 0)); |
| // Recover arguments count. |
| __ Sub_d(a0, a0, Operand(return_value_offset)); |
| } |
| |
| __ Ld_d( |
| fp, |
| MemOperand(sp, BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp)); |
| // Load builtin index (stored as a Smi) and use it to get the builtin start |
| // address from the builtins table. |
| __ Pop(t0); |
| __ Add_d(sp, sp, |
| Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp)); |
| __ Pop(ra); |
| __ LoadEntryFromBuiltinIndex(t0, t0); |
| __ Jump(t0); |
| } |
| } // namespace |
| |
| void Builtins::Generate_ContinueToCodeStubBuiltin(MacroAssembler* masm) { |
| Generate_ContinueToBuiltinHelper(masm, false, false); |
| } |
| |
| void Builtins::Generate_ContinueToCodeStubBuiltinWithResult( |
| MacroAssembler* masm) { |
| Generate_ContinueToBuiltinHelper(masm, false, true); |
| } |
| |
| void Builtins::Generate_ContinueToJavaScriptBuiltin(MacroAssembler* masm) { |
| Generate_ContinueToBuiltinHelper(masm, true, false); |
| } |
| |
| void Builtins::Generate_ContinueToJavaScriptBuiltinWithResult( |
| MacroAssembler* masm) { |
| Generate_ContinueToBuiltinHelper(masm, true, true); |
| } |
| |
| void Builtins::Generate_NotifyDeoptimized(MacroAssembler* masm) { |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ CallRuntime(Runtime::kNotifyDeoptimized); |
| } |
| |
| DCHECK_EQ(kInterpreterAccumulatorRegister.code(), a0.code()); |
| __ Ld_d(a0, MemOperand(sp, 0 * kSystemPointerSize)); |
| __ Add_d(sp, sp, Operand(1 * kSystemPointerSize)); // Remove state. |
| __ Ret(); |
| } |
| |
| namespace { |
| |
| void Generate_OSREntry(MacroAssembler* masm, Register entry_address, |
| Operand offset = Operand(zero_reg)) { |
| __ Add_d(ra, entry_address, offset); |
| // And "return" to the OSR entry point of the function. |
| __ Ret(); |
| } |
| |
| enum class OsrSourceTier { |
| kInterpreter, |
| kBaseline, |
| }; |
| |
| void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source, |
| Register maybe_target_code, |
| Register expected_param_count) { |
| Label jump_to_optimized_code; |
| { |
| // If maybe_target_code is not null, no need to call into runtime. A |
| // precondition here is: if maybe_target_code is an InstructionStream |
| // object, it must NOT be marked_for_deoptimization (callers must ensure |
| // this). |
| __ CompareTaggedAndBranch(&jump_to_optimized_code, ne, maybe_target_code, |
| Operand(Smi::zero())); |
| } |
| |
| ASM_CODE_COMMENT(masm); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(expected_param_count); |
| __ CallRuntime(Runtime::kCompileOptimizedOSR); |
| __ Pop(expected_param_count); |
| } |
| |
| // If the code object is null, just return to the caller. |
| __ CompareTaggedAndBranch(&jump_to_optimized_code, ne, maybe_target_code, |
| Operand(Smi::zero())); |
| __ Ret(); |
| |
| __ bind(&jump_to_optimized_code); |
| |
| const Register scratch(a2); |
| CHECK(!AreAliased(maybe_target_code, expected_param_count, scratch)); |
| |
| // OSR entry tracing. |
| { |
| Label next; |
| __ li(scratch, ExternalReference::address_of_log_or_trace_osr()); |
| __ Ld_bu(scratch, MemOperand(scratch, 0)); |
| __ Branch(&next, eq, scratch, Operand(zero_reg)); |
| |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| // Preserve arguments. |
| __ Push(maybe_target_code, expected_param_count); |
| __ CallRuntime(Runtime::kLogOrTraceOptimizedOSREntry, 0); |
| __ Pop(maybe_target_code, expected_param_count); |
| } |
| |
| __ bind(&next); |
| } |
| |
| if (source == OsrSourceTier::kInterpreter) { |
| // Drop the handler frame that is be sitting on top of the actual |
| // JavaScript frame. This is the case then OSR is triggered from bytecode. |
| __ LeaveFrame(StackFrame::STUB); |
| } |
| |
| // Check we are actually jumping to an OSR code object. This among other |
| // things ensures that the object contains deoptimization data below. |
| __ Ld_wu(scratch, FieldMemOperand(maybe_target_code, Code::kOsrOffsetOffset)); |
| __ Check(Condition::kNotEqual, AbortReason::kExpectedOsrCode, scratch, |
| Operand(BytecodeOffset::None().ToInt())); |
| |
| // Check the target has a matching parameter count. This ensures that the OSR |
| // code will correctly tear down our frame when leaving. |
| __ Ld_hu(scratch, |
| FieldMemOperand(maybe_target_code, Code::kParameterCountOffset)); |
| __ SmiUntag(expected_param_count); |
| __ SbxCheck(Condition::kEqual, AbortReason::kOsrUnexpectedStackSize, scratch, |
| Operand(expected_param_count)); |
| |
| // Load deoptimization data from the code object. |
| // <deopt_data> = <code>[#deoptimization_data_offset] |
| __ LoadProtectedPointerField( |
| scratch, MemOperand(maybe_target_code, |
| Code::kDeoptimizationDataOrInterpreterDataOffset - |
| kHeapObjectTag)); |
| |
| // Load the OSR entrypoint offset from the deoptimization data. |
| // <osr_offset> = <deopt_data>[#header_size + #osr_pc_offset] |
| __ SmiUntagField( |
| scratch, MemOperand(scratch, TrustedFixedArray::OffsetOfElementAt( |
| DeoptimizationData::kOsrPcOffsetIndex) - |
| kHeapObjectTag)); |
| |
| __ LoadCodeInstructionStart(maybe_target_code, maybe_target_code, |
| kJSEntrypointTag); |
| |
| // Compute the target address = code_entry + osr_offset |
| // <entry_addr> = <code_entry> + <osr_offset> |
| Generate_OSREntry(masm, maybe_target_code, Operand(scratch)); |
| } |
| } // namespace |
| |
| void Builtins::Generate_InterpreterOnStackReplacement(MacroAssembler* masm) { |
| using D = OnStackReplacementDescriptor; |
| static_assert(D::kParameterCount == 2); |
| OnStackReplacement(masm, OsrSourceTier::kInterpreter, |
| D::MaybeTargetCodeRegister(), |
| D::ExpectedParameterCountRegister()); |
| } |
| |
| void Builtins::Generate_BaselineOnStackReplacement(MacroAssembler* masm) { |
| using D = OnStackReplacementDescriptor; |
| static_assert(D::kParameterCount == 2); |
| |
| __ Ld_d(kContextRegister, |
| MemOperand(fp, BaselineFrameConstants::kContextOffset)); |
| OnStackReplacement(masm, OsrSourceTier::kBaseline, |
| D::MaybeTargetCodeRegister(), |
| D::ExpectedParameterCountRegister()); |
| } |
| |
| // static |
| void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : argc |
| // -- sp[0] : receiver |
| // -- sp[4] : thisArg |
| // -- sp[8] : argArray |
| // ----------------------------------- |
| |
| Register argc = a0; |
| Register arg_array = a2; |
| Register receiver = a1; |
| Register this_arg = a5; |
| Register undefined_value = a3; |
| Register scratch = a4; |
| |
| __ LoadRoot(undefined_value, RootIndex::kUndefinedValue); |
| |
| // 1. Load receiver into a1, argArray into a2 (if present), remove all |
| // arguments from the stack (including the receiver), and push thisArg (if |
| // present) instead. |
| { |
| __ Sub_d(scratch, argc, JSParameterCount(0)); |
| __ Ld_d(this_arg, MemOperand(sp, kSystemPointerSize)); |
| __ Ld_d(arg_array, MemOperand(sp, 2 * kSystemPointerSize)); |
| __ Movz(arg_array, undefined_value, scratch); // if argc == 0 |
| __ Movz(this_arg, undefined_value, scratch); // if argc == 0 |
| __ Sub_d(scratch, scratch, Operand(1)); |
| __ Movz(arg_array, undefined_value, scratch); // if argc == 1 |
| __ Ld_d(receiver, MemOperand(sp, 0)); |
| __ DropArgumentsAndPushNewReceiver(argc, this_arg); |
| } |
| |
| // ----------- S t a t e ------------- |
| // -- a2 : argArray |
| // -- a1 : receiver |
| // -- a3 : undefined root value |
| // -- sp[0] : thisArg |
| // ----------------------------------- |
| |
| // 2. We don't need to check explicitly for callable receiver here, |
| // since that's the first thing the Call/CallWithArrayLike builtins |
| // will do. |
| |
| // 3. Tail call with no arguments if argArray is null or undefined. |
| Label no_arguments; |
| __ LoadRoot(scratch, RootIndex::kNullValue); |
| __ CompareTaggedAndBranch(&no_arguments, eq, arg_array, Operand(scratch)); |
| __ CompareTaggedAndBranch(&no_arguments, eq, arg_array, |
| Operand(undefined_value)); |
| |
| // 4a. Apply the receiver to the given argArray. |
| __ TailCallBuiltin(Builtin::kCallWithArrayLike); |
| |
| // 4b. The argArray is either null or undefined, so we tail call without any |
| // arguments to the receiver. |
| __ bind(&no_arguments); |
| { |
| __ li(a0, JSParameterCount(0)); |
| DCHECK(receiver == a1); |
| __ TailCallBuiltin(Builtins::Call()); |
| } |
| } |
| |
| // static |
| void Builtins::Generate_FunctionPrototypeCall(MacroAssembler* masm) { |
| // 1. Get the callable to call (passed as receiver) from the stack. |
| { __ Pop(a1); } |
| |
| // 2. Make sure we have at least one argument. |
| // a0: actual number of arguments |
| { |
| Label done; |
| __ Branch(&done, ne, a0, Operand(JSParameterCount(0))); |
| __ PushRoot(RootIndex::kUndefinedValue); |
| __ Add_d(a0, a0, Operand(1)); |
| __ bind(&done); |
| } |
| |
| // 3. Adjust the actual number of arguments. |
| __ addi_d(a0, a0, -1); |
| |
| // 4. Call the callable. |
| __ TailCallBuiltin(Builtins::Call()); |
| } |
| |
| void Builtins::Generate_ReflectApply(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : argc |
| // -- sp[0] : receiver |
| // -- sp[8] : target (if argc >= 1) |
| // -- sp[16] : thisArgument (if argc >= 2) |
| // -- sp[24] : argumentsList (if argc == 3) |
| // ----------------------------------- |
| |
| Register argc = a0; |
| Register arguments_list = a2; |
| Register target = a1; |
| Register this_argument = a5; |
| Register undefined_value = a3; |
| Register scratch = a4; |
| |
| __ LoadRoot(undefined_value, RootIndex::kUndefinedValue); |
| |
| // 1. Load target into a1 (if present), argumentsList into a2 (if present), |
| // remove all arguments from the stack (including the receiver), and push |
| // thisArgument (if present) instead. |
| { |
| // Claim (3 - argc) dummy arguments form the stack, to put the stack in a |
| // consistent state for a simple pop operation. |
| |
| __ Sub_d(scratch, argc, Operand(JSParameterCount(0))); |
| __ Ld_d(target, MemOperand(sp, kSystemPointerSize)); |
| __ Ld_d(this_argument, MemOperand(sp, 2 * kSystemPointerSize)); |
| __ Ld_d(arguments_list, MemOperand(sp, 3 * kSystemPointerSize)); |
| __ Movz(arguments_list, undefined_value, scratch); // if argc == 0 |
| __ Movz(this_argument, undefined_value, scratch); // if argc == 0 |
| __ Movz(target, undefined_value, scratch); // if argc == 0 |
| __ Sub_d(scratch, scratch, Operand(1)); |
| __ Movz(arguments_list, undefined_value, scratch); // if argc == 1 |
| __ Movz(this_argument, undefined_value, scratch); // if argc == 1 |
| __ Sub_d(scratch, scratch, Operand(1)); |
| __ Movz(arguments_list, undefined_value, scratch); // if argc == 2 |
| |
| __ DropArgumentsAndPushNewReceiver(argc, this_argument); |
| } |
| |
| // ----------- S t a t e ------------- |
| // -- a2 : argumentsList |
| // -- a1 : target |
| // -- a3 : undefined root value |
| // -- sp[0] : thisArgument |
| // ----------------------------------- |
| |
| // 2. We don't need to check explicitly for callable target here, |
| // since that's the first thing the Call/CallWithArrayLike builtins |
| // will do. |
| |
| // 3. Apply the target to the given argumentsList. |
| __ TailCallBuiltin(Builtin::kCallWithArrayLike); |
| } |
| |
| void Builtins::Generate_ReflectConstruct(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : argc |
| // -- sp[0] : receiver |
| // -- sp[8] : target |
| // -- sp[16] : argumentsList |
| // -- sp[24] : new.target (optional) |
| // ----------------------------------- |
| |
| Register argc = a0; |
| Register arguments_list = a2; |
| Register target = a1; |
| Register new_target = a3; |
| Register undefined_value = a4; |
| Register scratch = a5; |
| |
| __ LoadRoot(undefined_value, RootIndex::kUndefinedValue); |
| |
| // 1. Load target into a1 (if present), argumentsList into a2 (if present), |
| // new.target into a3 (if present, otherwise use target), remove all |
| // arguments from the stack (including the receiver), and push thisArgument |
| // (if present) instead. |
| { |
| // Claim (3 - argc) dummy arguments form the stack, to put the stack in a |
| // consistent state for a simple pop operation. |
| |
| __ Sub_d(scratch, argc, Operand(JSParameterCount(0))); |
| __ Ld_d(target, MemOperand(sp, kSystemPointerSize)); |
| __ Ld_d(arguments_list, MemOperand(sp, 2 * kSystemPointerSize)); |
| __ Ld_d(new_target, MemOperand(sp, 3 * kSystemPointerSize)); |
| __ Movz(arguments_list, undefined_value, scratch); // if argc == 0 |
| __ Movz(new_target, undefined_value, scratch); // if argc == 0 |
| __ Movz(target, undefined_value, scratch); // if argc == 0 |
| __ Sub_d(scratch, scratch, Operand(1)); |
| __ Movz(arguments_list, undefined_value, scratch); // if argc == 1 |
| __ Movz(new_target, target, scratch); // if argc == 1 |
| __ Sub_d(scratch, scratch, Operand(1)); |
| __ Movz(new_target, target, scratch); // if argc == 2 |
| |
| __ DropArgumentsAndPushNewReceiver(argc, undefined_value); |
| } |
| |
| // ----------- S t a t e ------------- |
| // -- a2 : argumentsList |
| // -- a1 : target |
| // -- a3 : new.target |
| // -- sp[0] : receiver (undefined) |
| // ----------------------------------- |
| |
| // 2. We don't need to check explicitly for constructor target here, |
| // since that's the first thing the Construct/ConstructWithArrayLike |
| // builtins will do. |
| |
| // 3. We don't need to check explicitly for constructor new.target here, |
| // since that's the second thing the Construct/ConstructWithArrayLike |
| // builtins will do. |
| |
| // 4. Construct the target with the given new.target and argumentsList. |
| __ TailCallBuiltin(Builtin::kConstructWithArrayLike); |
| } |
| |
| namespace { |
| |
| // Allocate new stack space for |count| arguments and shift all existing |
| // arguments already on the stack. |pointer_to_new_space_out| points to the |
| // first free slot on the stack to copy additional arguments to and |
| // |argc_in_out| is updated to include |count|. |
| void Generate_AllocateSpaceAndShiftExistingArguments( |
| MacroAssembler* masm, Register count, Register argc_in_out, |
| Register pointer_to_new_space_out, Register scratch1, Register scratch2, |
| Register scratch3) { |
| DCHECK(!AreAliased(count, argc_in_out, pointer_to_new_space_out, scratch1, |
| scratch2)); |
| Register old_sp = scratch1; |
| Register new_space = scratch2; |
| __ mov(old_sp, sp); |
| __ slli_d(new_space, count, kSystemPointerSizeLog2); |
| __ Sub_d(sp, sp, Operand(new_space)); |
| |
| Register end = scratch2; |
| Register value = scratch3; |
| Register dest = pointer_to_new_space_out; |
| __ mov(dest, sp); |
| __ Alsl_d(end, argc_in_out, old_sp, kSystemPointerSizeLog2); |
| Label loop, done; |
| __ Branch(&done, ge, old_sp, Operand(end)); |
| __ bind(&loop); |
| __ Ld_d(value, MemOperand(old_sp, 0)); |
| __ St_d(value, MemOperand(dest, 0)); |
| __ Add_d(old_sp, old_sp, Operand(kSystemPointerSize)); |
| __ Add_d(dest, dest, Operand(kSystemPointerSize)); |
| __ Branch(&loop, lt, old_sp, Operand(end)); |
| __ bind(&done); |
| |
| // Update total number of arguments. |
| __ Add_d(argc_in_out, argc_in_out, count); |
| } |
| |
| } // namespace |
| |
| // static |
| void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm, |
| Builtin target_builtin) { |
| // ----------- S t a t e ------------- |
| // -- a1 : target |
| // -- a0 : number of parameters on the stack |
| // -- a2 : arguments list (a FixedArray) |
| // -- a4 : len (number of elements to push from args) |
| // -- a3 : new.target (for [[Construct]]) |
| // ----------------------------------- |
| if (v8_flags.debug_code) { |
| // Allow a2 to be a FixedArray, or a FixedDoubleArray if a4 == 0. |
| Label ok, fail; |
| __ AssertNotSmi(a2); |
| __ GetObjectType(a2, a5, a5); |
| __ Branch(&ok, eq, a5, Operand(FIXED_ARRAY_TYPE)); |
| __ Branch(&fail, ne, a5, Operand(FIXED_DOUBLE_ARRAY_TYPE)); |
| __ Branch(&ok, eq, a4, Operand(zero_reg)); |
| // Fall through. |
| __ bind(&fail); |
| __ Abort(AbortReason::kOperandIsNotAFixedArray); |
| |
| __ bind(&ok); |
| } |
| |
| Register args = a2; |
| Register len = a4; |
| |
| // Check for stack overflow. |
| Label stack_overflow; |
| __ StackOverflowCheck(len, kScratchReg, a5, &stack_overflow); |
| |
| // Move the arguments already in the stack, |
| // including the receiver and the return address. |
| // a4: Number of arguments to make room for. |
| // a0: Number of arguments already on the stack. |
| // a7: Points to first free slot on the stack after arguments were shifted. |
| Generate_AllocateSpaceAndShiftExistingArguments(masm, a4, a0, a7, a6, t0, t1); |
| |
| // Push arguments onto the stack (thisArgument is already on the stack). |
| { |
| Label done, push, loop; |
| Register src = a6; |
| Register scratch = len; |
| |
| __ addi_d(src, args, OFFSET_OF_DATA_START(FixedArray) - kHeapObjectTag); |
| __ Branch(&done, eq, len, Operand(zero_reg)); |
| __ slli_d(scratch, len, kSystemPointerSizeLog2); |
| __ Sub_d(scratch, sp, Operand(scratch)); |
| #if !V8_STATIC_ROOTS_BOOL |
| // We do not use the Branch(reg, RootIndex) macro without static roots, |
| // as it would do a LoadRoot behind the scenes and we want to avoid that |
| // in a loop. |
| __ LoadTaggedRoot(t1, RootIndex::kTheHoleValue); |
| #endif // !V8_STATIC_ROOTS_BOOL |
| __ bind(&loop); |
| __ LoadTaggedField(a5, MemOperand(src, 0)); |
| __ addi_d(src, src, kTaggedSize); |
| #if V8_STATIC_ROOTS_BOOL |
| __ Branch(&push, ne, a5, RootIndex::kTheHoleValue); |
| #else |
| __ slli_w(t0, a5, 0); |
| __ Branch(&push, ne, t0, Operand(t1)); |
| #endif |
| __ LoadRoot(a5, RootIndex::kUndefinedValue); |
| __ bind(&push); |
| __ St_d(a5, MemOperand(a7, 0)); |
| __ Add_d(a7, a7, Operand(kSystemPointerSize)); |
| __ Add_d(scratch, scratch, Operand(kSystemPointerSize)); |
| __ Branch(&loop, ne, scratch, Operand(sp)); |
| __ bind(&done); |
| } |
| |
| // Tail-call to the actual Call or Construct builtin. |
| __ TailCallBuiltin(target_builtin); |
| |
| __ bind(&stack_overflow); |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| } |
| |
| // static |
| void Builtins::Generate_CallOrConstructForwardVarargs(MacroAssembler* masm, |
| CallOrConstructMode mode, |
| Builtin target_builtin) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a3 : the new.target (for [[Construct]] calls) |
| // -- a1 : the target to call (can be any Object) |
| // -- a2 : start index (to support rest parameters) |
| // ----------------------------------- |
| |
| // Check if new.target has a [[Construct]] internal method. |
| if (mode == CallOrConstructMode::kConstruct) { |
| Label new_target_constructor, new_target_not_constructor; |
| __ JumpIfSmi(a3, &new_target_not_constructor); |
| __ LoadTaggedField(t1, FieldMemOperand(a3, HeapObject::kMapOffset)); |
| __ Ld_bu(t1, FieldMemOperand(t1, Map::kBitFieldOffset)); |
| __ And(t1, t1, Operand(Map::Bits1::IsConstructorBit::kMask)); |
| __ Branch(&new_target_constructor, ne, t1, Operand(zero_reg)); |
| __ bind(&new_target_not_constructor); |
| { |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterFrame(StackFrame::INTERNAL); |
| __ Push(a3); |
| __ CallRuntime(Runtime::kThrowNotConstructor); |
| } |
| __ bind(&new_target_constructor); |
| } |
| |
| Label stack_done, stack_overflow; |
| __ Ld_d(a7, MemOperand(fp, StandardFrameConstants::kArgCOffset)); |
| __ Sub_d(a7, a7, Operand(kJSArgcReceiverSlots)); |
| __ Sub_d(a7, a7, a2); |
| __ Branch(&stack_done, le, a7, Operand(zero_reg)); |
| { |
| // Check for stack overflow. |
| __ StackOverflowCheck(a7, a4, a5, &stack_overflow); |
| |
| // Forward the arguments from the caller frame. |
| |
| // Point to the first argument to copy (skipping the receiver). |
| __ Add_d(a6, fp, |
| Operand(CommonFrameConstants::kFixedFrameSizeAboveFp + |
| kSystemPointerSize)); |
| __ Alsl_d(a6, a2, a6, kSystemPointerSizeLog2); |
| |
| // Move the arguments already in the stack, |
| // including the receiver and the return address. |
| // a7: Number of arguments to make room for. |
| // a0: Number of arguments already on the stack. |
| // a2: Points to first free slot on the stack after arguments were shifted. |
| Generate_AllocateSpaceAndShiftExistingArguments(masm, a7, a0, a2, t0, t1, |
| t2); |
| |
| // Copy arguments from the caller frame. |
| // TODO(victorgomes): Consider using forward order as potentially more cache |
| // friendly. |
| { |
| Label loop; |
| __ bind(&loop); |
| { |
| __ Sub_w(a7, a7, Operand(1)); |
| __ Alsl_d(t0, a7, a6, kSystemPointerSizeLog2); |
| __ Ld_d(kScratchReg, MemOperand(t0, 0)); |
| __ Alsl_d(t0, a7, a2, kSystemPointerSizeLog2); |
| __ St_d(kScratchReg, MemOperand(t0, 0)); |
| __ Branch(&loop, ne, a7, Operand(zero_reg)); |
| } |
| } |
| } |
| __ bind(&stack_done); |
| // Tail-call to the actual Call or Construct builtin. |
| __ TailCallBuiltin(target_builtin); |
| |
| __ bind(&stack_overflow); |
| __ TailCallRuntime(Runtime::kThrowStackOverflow); |
| } |
| |
| // static |
| void Builtins::Generate_CallFunction(MacroAssembler* masm, |
| ConvertReceiverMode mode) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSFunction) |
| // ----------------------------------- |
| __ AssertFunction(a1); |
| |
| __ LoadTaggedField( |
| a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset)); |
| |
| // Enter the context of the function; ToObject has to run in the function |
| // context, and we also need to take the global proxy from the function |
| // context in case of conversion. |
| __ LoadTaggedField(cp, FieldMemOperand(a1, JSFunction::kContextOffset)); |
| // We need to convert the receiver for non-native sloppy mode functions. |
| Label done_convert; |
| __ Ld_wu(a3, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset)); |
| __ And(kScratchReg, a3, |
| Operand(SharedFunctionInfo::IsNativeBit::kMask | |
| SharedFunctionInfo::IsStrictBit::kMask)); |
| __ Branch(&done_convert, ne, kScratchReg, Operand(zero_reg)); |
| { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSFunction) |
| // -- a2 : the shared function info. |
| // -- cp : the function context. |
| // ----------------------------------- |
| |
| if (mode == ConvertReceiverMode::kNullOrUndefined) { |
| // Patch receiver to global proxy. |
| __ LoadGlobalProxy(a3); |
| } else { |
| Label convert_to_object, convert_receiver; |
| __ LoadReceiver(a3); |
| __ JumpIfSmi(a3, &convert_to_object); |
| __ JumpIfJSAnyIsNotPrimitive(a3, a4, &done_convert); |
| if (mode != ConvertReceiverMode::kNotNullOrUndefined) { |
| Label convert_global_proxy; |
| __ JumpIfRoot(a3, RootIndex::kUndefinedValue, &convert_global_proxy); |
| __ JumpIfNotRoot(a3, RootIndex::kNullValue, &convert_to_object); |
| __ bind(&convert_global_proxy); |
| { |
| // Patch receiver to global proxy. |
| __ LoadGlobalProxy(a3); |
| } |
| __ Branch(&convert_receiver); |
| } |
| __ bind(&convert_to_object); |
| { |
| // Convert receiver using ToObject. |
| // TODO(bmeurer): Inline the allocation here to avoid building the frame |
| // in the fast case? (fall back to AllocateInNewSpace?) |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ SmiTag(a0); |
| __ Push(a0, a1); |
| __ mov(a0, a3); |
| __ Push(cp); |
| __ CallBuiltin(Builtin::kToObject); |
| __ Pop(cp); |
| __ mov(a3, a0); |
| __ Pop(a0, a1); |
| __ SmiUntag(a0); |
| } |
| __ LoadTaggedField( |
| a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset)); |
| __ bind(&convert_receiver); |
| } |
| __ StoreReceiver(a3); |
| } |
| __ bind(&done_convert); |
| |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSFunction) |
| // -- a2 : the shared function info. |
| // -- cp : the function context. |
| // ----------------------------------- |
| |
| #ifdef V8_ENABLE_LEAPTIERING |
| __ InvokeFunctionCode(a1, no_reg, a0, InvokeType::kJump); |
| #else |
| __ Ld_hu( |
| a2, FieldMemOperand(a2, SharedFunctionInfo::kFormalParameterCountOffset)); |
| __ InvokeFunctionCode(a1, no_reg, a2, a0, InvokeType::kJump); |
| #endif // V8_ENABLE_LEAPTIERING |
| } |
| |
| // static |
| void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSBoundFunction) |
| // ----------------------------------- |
| __ AssertBoundFunction(a1); |
| |
| // Patch the receiver to [[BoundThis]]. |
| { |
| __ LoadTaggedField(t0, |
| FieldMemOperand(a1, JSBoundFunction::kBoundThisOffset)); |
| __ StoreReceiver(t0); |
| } |
| |
| // Load [[BoundArguments]] into a2 and length of that into a4. |
| __ LoadTaggedField( |
| a2, FieldMemOperand(a1, JSBoundFunction::kBoundArgumentsOffset)); |
| __ SmiUntagField(a4, FieldMemOperand(a2, offsetof(FixedArray, length_))); |
| |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSBoundFunction) |
| // -- a2 : the [[BoundArguments]] (implemented as FixedArray) |
| // -- a4 : the number of [[BoundArguments]] |
| // ----------------------------------- |
| |
| // Reserve stack space for the [[BoundArguments]]. |
| { |
| Label done; |
| __ slli_d(a5, a4, kSystemPointerSizeLog2); |
| __ Sub_d(t0, sp, Operand(a5)); |
| // Check the stack for overflow. We are not trying to catch interruptions |
| // (i.e. debug break and preemption) here, so check the "real stack limit". |
| __ LoadStackLimit(kScratchReg, |
| MacroAssembler::StackLimitKind::kRealStackLimit); |
| __ Branch(&done, hs, t0, Operand(kScratchReg)); |
| { |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterFrame(StackFrame::INTERNAL); |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| } |
| __ bind(&done); |
| } |
| |
| // Pop receiver. |
| __ Pop(t0); |
| |
| // Push [[BoundArguments]]. |
| { |
| Label loop, done_loop; |
| __ SmiUntagField(a4, FieldMemOperand(a2, offsetof(FixedArray, length_))); |
| __ Add_d(a0, a0, Operand(a4)); |
| __ Add_d(a2, a2, |
| Operand(OFFSET_OF_DATA_START(FixedArray) - kHeapObjectTag)); |
| __ bind(&loop); |
| __ Sub_d(a4, a4, Operand(1)); |
| __ Branch(&done_loop, lt, a4, Operand(zero_reg)); |
| __ Alsl_d(a5, a4, a2, kTaggedSizeLog2); |
| __ LoadTaggedField(kScratchReg, MemOperand(a5, 0)); |
| __ Push(kScratchReg); |
| __ Branch(&loop); |
| __ bind(&done_loop); |
| } |
| |
| // Push receiver. |
| __ Push(t0); |
| |
| // Call the [[BoundTargetFunction]] via the Call builtin. |
| __ LoadTaggedField( |
| a1, FieldMemOperand(a1, JSBoundFunction::kBoundTargetFunctionOffset)); |
| __ TailCallBuiltin(Builtins::Call()); |
| } |
| |
| // static |
| void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the target to call (can be any Object). |
| // ----------------------------------- |
| |
| Register target = a1; |
| Register map = t1; |
| Register instance_type = t2; |
| Register scratch = t3; |
| DCHECK(!AreAliased(a0, target, map, instance_type, scratch)); |
| |
| Label non_callable, class_constructor; |
| __ JumpIfSmi(target, &non_callable); |
| __ LoadMap(map, target); |
| __ GetInstanceTypeRange(map, instance_type, FIRST_CALLABLE_JS_FUNCTION_TYPE, |
| scratch); |
| __ TailCallBuiltin(Builtins::CallFunction(mode), ls, scratch, |
| Operand(LAST_CALLABLE_JS_FUNCTION_TYPE - |
| FIRST_CALLABLE_JS_FUNCTION_TYPE)); |
| __ TailCallBuiltin(Builtin::kCallBoundFunction, eq, instance_type, |
| Operand(JS_BOUND_FUNCTION_TYPE)); |
| |
| // Check if target has a [[Call]] internal method. |
| { |
| Register flags = t1; |
| __ Ld_bu(flags, FieldMemOperand(map, Map::kBitFieldOffset)); |
| map = no_reg; |
| __ And(flags, flags, Operand(Map::Bits1::IsCallableBit::kMask)); |
| __ Branch(&non_callable, eq, flags, Operand(zero_reg)); |
| } |
| |
| __ TailCallBuiltin(Builtin::kCallProxy, eq, instance_type, |
| Operand(JS_PROXY_TYPE)); |
| |
| // Check if target is a wrapped function and call CallWrappedFunction external |
| // builtin |
| __ TailCallBuiltin(Builtin::kCallWrappedFunction, eq, instance_type, |
| Operand(JS_WRAPPED_FUNCTION_TYPE)); |
| |
| // ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList) |
| // Check that the function is not a "classConstructor". |
| __ Branch(&class_constructor, eq, instance_type, |
| Operand(JS_CLASS_CONSTRUCTOR_TYPE)); |
| |
| // 2. Call to something else, which might have a [[Call]] internal method (if |
| // not we raise an exception). |
| // Overwrite the original receiver with the (original) target. |
| __ StoreReceiver(target); |
| // Let the "call_as_function_delegate" take care of the rest. |
| __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX); |
| __ TailCallBuiltin( |
| Builtins::CallFunction(ConvertReceiverMode::kNotNullOrUndefined)); |
| |
| // 3. Call to something that is not callable. |
| __ bind(&non_callable); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(target); |
| __ CallRuntime(Runtime::kThrowCalledNonCallable); |
| } |
| |
| // 4. The function is a "classConstructor", need to raise an exception. |
| __ bind(&class_constructor); |
| { |
| FrameScope frame(masm, StackFrame::INTERNAL); |
| __ Push(target); |
| __ CallRuntime(Runtime::kThrowConstructorNonCallableError); |
| } |
| } |
| |
| void Builtins::Generate_ConstructFunction(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the constructor to call (checked to be a JSFunction) |
| // -- a3 : the new target (checked to be a constructor) |
| // ----------------------------------- |
| __ AssertConstructor(a1); |
| __ AssertFunction(a1); |
| |
| // Calling convention for function specific ConstructStubs require |
| // a2 to contain either an AllocationSite or undefined. |
| __ LoadRoot(a2, RootIndex::kUndefinedValue); |
| |
| Label call_generic_stub; |
| |
| // Jump to JSBuiltinsConstructStub or JSConstructStubGeneric. |
| __ LoadTaggedField( |
| a4, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset)); |
| __ Ld_wu(a4, FieldMemOperand(a4, SharedFunctionInfo::kFlagsOffset)); |
| __ And(a4, a4, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask)); |
| __ Branch(&call_generic_stub, eq, a4, Operand(zero_reg)); |
| |
| __ TailCallBuiltin(Builtin::kJSBuiltinsConstructStub); |
| |
| __ bind(&call_generic_stub); |
| __ TailCallBuiltin(Builtin::kJSConstructStubGeneric); |
| } |
| |
| // static |
| void Builtins::Generate_ConstructBoundFunction(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSBoundFunction) |
| // -- a3 : the new target (checked to be a constructor) |
| // ----------------------------------- |
| __ AssertConstructor(a1); |
| __ AssertBoundFunction(a1); |
| |
| // Load [[BoundArguments]] into a2 and length of that into a4. |
| __ LoadTaggedField( |
| a2, FieldMemOperand(a1, JSBoundFunction::kBoundArgumentsOffset)); |
| __ SmiUntagField(a4, FieldMemOperand(a2, offsetof(FixedArray, length_))); |
| |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the function to call (checked to be a JSBoundFunction) |
| // -- a2 : the [[BoundArguments]] (implemented as FixedArray) |
| // -- a3 : the new target (checked to be a constructor) |
| // -- a4 : the number of [[BoundArguments]] |
| // ----------------------------------- |
| |
| // Reserve stack space for the [[BoundArguments]]. |
| { |
| Label done; |
| __ slli_d(a5, a4, kSystemPointerSizeLog2); |
| __ Sub_d(t0, sp, Operand(a5)); |
| // Check the stack for overflow. We are not trying to catch interruptions |
| // (i.e. debug break and preemption) here, so check the "real stack limit". |
| __ LoadStackLimit(kScratchReg, |
| MacroAssembler::StackLimitKind::kRealStackLimit); |
| __ Branch(&done, hs, t0, Operand(kScratchReg)); |
| { |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterFrame(StackFrame::INTERNAL); |
| __ CallRuntime(Runtime::kThrowStackOverflow); |
| } |
| __ bind(&done); |
| } |
| |
| // Pop receiver. |
| __ Pop(t0); |
| |
| // Push [[BoundArguments]]. |
| { |
| Label loop, done_loop; |
| __ SmiUntagField(a4, FieldMemOperand(a2, offsetof(FixedArray, length_))); |
| __ Add_d(a0, a0, Operand(a4)); |
| __ Add_d(a2, a2, |
| Operand(OFFSET_OF_DATA_START(FixedArray) - kHeapObjectTag)); |
| __ bind(&loop); |
| __ Sub_d(a4, a4, Operand(1)); |
| __ Branch(&done_loop, lt, a4, Operand(zero_reg)); |
| __ Alsl_d(a5, a4, a2, kTaggedSizeLog2); |
| __ LoadTaggedField(kScratchReg, MemOperand(a5, 0)); |
| __ Push(kScratchReg); |
| __ Branch(&loop); |
| __ bind(&done_loop); |
| } |
| |
| // Push receiver. |
| __ Push(t0); |
| |
| // Patch new.target to [[BoundTargetFunction]] if new.target equals target. |
| { |
| Label skip_load; |
| __ CompareTaggedAndBranch(&skip_load, ne, a1, Operand(a3)); |
| __ LoadTaggedField( |
| a3, FieldMemOperand(a1, JSBoundFunction::kBoundTargetFunctionOffset)); |
| __ bind(&skip_load); |
| } |
| |
| // Construct the [[BoundTargetFunction]] via the Construct builtin. |
| __ LoadTaggedField( |
| a1, FieldMemOperand(a1, JSBoundFunction::kBoundTargetFunctionOffset)); |
| __ TailCallBuiltin(Builtin::kConstruct); |
| } |
| |
| // static |
| void Builtins::Generate_Construct(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- a0 : the number of arguments |
| // -- a1 : the constructor to call (can be any Object) |
| // -- a3 : the new target (either the same as the constructor or |
| // the JSFunction on which new was invoked initially) |
| // ----------------------------------- |
| |
| Register target = a1; |
| Register map = t1; |
| Register instance_type = t2; |
| Register scratch = t3; |
| DCHECK(!AreAliased(a0, target, map, instance_type, scratch)); |
| |
| // Check if target is a Smi. |
| Label non_constructor, non_proxy; |
| __ JumpIfSmi(target, &non_constructor); |
| |
| // Check if target has a [[Construct]] internal method. |
| __ LoadTaggedField(map, FieldMemOperand(target, HeapObject::kMapOffset)); |
| { |
| Register flags = t3; |
| __ Ld_bu(flags, FieldMemOperand(map, Map::kBitFieldOffset)); |
| __ And(flags, flags, Operand(Map::Bits1::IsConstructorBit::kMask)); |
| __ Branch(&non_constructor, eq, flags, Operand(zero_reg)); |
| } |
| |
| // Dispatch based on instance type. |
| __ GetInstanceTypeRange(map, instance_type, FIRST_JS_FUNCTION_TYPE, scratch); |
| __ TailCallBuiltin(Builtin::kConstructFunction, ls, scratch, |
| Operand(LAST_JS_FUNCTION_TYPE - FIRST_JS_FUNCTION_TYPE)); |
| |
| // Only dispatch to bound functions after checking whether they are |
| // constructors. |
| __ TailCallBuiltin(Builtin::kConstructBoundFunction, eq, instance_type, |
| Operand(JS_BOUND_FUNCTION_TYPE)); |
| |
| // Only dispatch to proxies after checking whether they are constructors. |
| __ Branch(&non_proxy, ne, instance_type, Operand(JS_PROXY_TYPE)); |
| __ TailCallBuiltin(Builtin::kConstructProxy); |
| |
| // Called Construct on an exotic Object with a [[Construct]] internal method. |
| __ bind(&non_proxy); |
| { |
| // Overwrite the original receiver with the (original) target. |
| __ StoreReceiver(target); |
| // Let the "call_as_constructor_delegate" take care of the rest. |
| __ LoadNativeContextSlot(target, |
| Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX); |
| __ TailCallBuiltin(Builtins::CallFunction()); |
| } |
| |
| // Called Construct on an Object that doesn't have a [[Construct]] internal |
| // method. |
| __ bind(&non_constructor); |
| __ TailCallBuiltin(Builtin::kConstructedNonConstructable); |
| } |
| |
| #if V8_ENABLE_WEBASSEMBLY |
| // Compute register lists for parameters to be saved. We save all parameter |
| // registers (see wasm-linkage.h). They might be overwritten in the runtime |
| // call below. We don't have any callee-saved registers in wasm, so no need to |
| // store anything else. |
| constexpr RegList kSavedGpRegs = ([]() constexpr { |
| RegList saved_gp_regs; |
| for (Register gp_param_reg : wasm::kGpParamRegisters) { |
| saved_gp_regs.set(gp_param_reg); |
| } |
| |
| // The instance data has already been stored in the fixed part of the frame. |
| saved_gp_regs.clear(kWasmImplicitArgRegister); |
| // All set registers were unique. |
| CHECK_EQ(saved_gp_regs.Count(), arraysize(wasm::kGpParamRegisters) - 1); |
| CHECK_EQ(WasmLiftoffSetupFrameConstants::kNumberOfSavedGpParamRegs, |
| saved_gp_regs.Count()); |
| return saved_gp_regs; |
| })(); |
| |
| constexpr DoubleRegList kSavedFpRegs = ([]() constexpr { |
| DoubleRegList saved_fp_regs; |
| for (DoubleRegister fp_param_reg : wasm::kFpParamRegisters) { |
| saved_fp_regs.set(fp_param_reg); |
| } |
| |
| CHECK_EQ(saved_fp_regs.Count(), arraysize(wasm::kFpParamRegisters)); |
| CHECK_EQ(WasmLiftoffSetupFrameConstants::kNumberOfSavedFpParamRegs, |
| saved_fp_regs.Count()); |
| return saved_fp_regs; |
| })(); |
| |
| // When entering this builtin, we have just created a Wasm stack frame: |
| // |
| // [ Wasm instance data ] <-- sp |
| // [ WASM frame marker ] |
| // [ saved fp ] <-- fp |
| // |
| // Add the feedback vector to the stack. |
| // |
| // [ feedback vector ] <-- sp |
| // [ Wasm instance data ] |
| // [ WASM frame marker ] |
| // [ saved fp ] <-- fp |
| void Builtins::Generate_WasmLiftoffFrameSetup(MacroAssembler* masm) { |
| Register func_index = wasm::kLiftoffFrameSetupFunctionReg; |
| Register vector = t1; |
| Register scratch = t2; |
| Label allocate_vector, done; |
| |
| __ LoadTaggedField( |
| vector, FieldMemOperand(kWasmImplicitArgRegister, |
| WasmTrustedInstanceData::kFeedbackVectorsOffset)); |
| __ Alsl_d(vector, func_index, vector, kTaggedSizeLog2); |
| __ LoadTaggedField(vector, |
| FieldMemOperand(vector, OFFSET_OF_DATA_START(FixedArray))); |
| __ JumpIfSmi(vector, &allocate_vector); |
| __ bind(&done); |
| __ Push(vector); |
| __ Ret(); |
| |
| __ bind(&allocate_vector); |
| // Feedback vector doesn't exist yet. Call the runtime to allocate it. |
| // We temporarily change the frame type for this, because we need special |
| // handling by the stack walker in case of GC. |
| __ li(scratch, StackFrame::TypeToMarker(StackFrame::WASM_LIFTOFF_SETUP)); |
| __ St_d(scratch, MemOperand(fp, TypedFrameConstants::kFrameTypeOffset)); |
| |
| // Save registers. |
| __ MultiPush(kSavedGpRegs); |
| __ MultiPushFPU(kSavedFpRegs); |
| __ Push(ra); |
| |
| // Arguments to the runtime function: instance data, func_index, and an |
| // additional stack slot for the NativeModule. |
| __ SmiTag(func_index); |
| __ Push(kWasmImplicitArgRegister, func_index, zero_reg); |
| __ Move(cp, Smi::zero()); |
| __ CallRuntime(Runtime::kWasmAllocateFeedbackVector, 3); |
| __ mov(vector, kReturnRegister0); |
| |
| // Restore registers and frame type. |
| __ Pop(ra); |
| __ MultiPopFPU(kSavedFpRegs); |
| __ MultiPop(kSavedGpRegs); |
| __ Ld_d(kWasmImplicitArgRegister, |
| MemOperand(fp, WasmFrameConstants::kWasmInstanceDataOffset)); |
| __ li(scratch, StackFrame::TypeToMarker(StackFrame::WASM)); |
| __ St_d(scratch, MemOperand(fp, TypedFrameConstants::kFrameTypeOffset)); |
| __ Branch(&done); |
| } |
| |
| void Builtins::Generate_WasmCompileLazy(MacroAssembler* masm) { |
| // The function index was put in t0 by the jump table trampoline. |
| // Convert to Smi for the runtime call |
| __ SmiTag(kWasmCompileLazyFuncIndexRegister); |
| |
| { |
| HardAbortScope hard_abort(masm); // Avoid calls to Abort. |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| |
| // Save registers that we need to keep alive across the runtime call. |
| __ Push(kWasmImplicitArgRegister); |
| __ MultiPush(kSavedGpRegs); |
| __ MultiPushFPU(kSavedFpRegs); |
| |
| // kFixedFrameSizeFromFp is hard coded to include space for Simd |
| // registers, so we still need to allocate extra (unused) space on the stack |
| // as if they were saved. |
| __ Sub_d(sp, sp, kSavedFpRegs.Count() * kDoubleSize); |
| |
| __ Push(kWasmImplicitArgRegister, kWasmCompileLazyFuncIndexRegister); |
| |
| // Initialize the JavaScript context with 0. CEntry will use it to |
| // set the current context on the isolate. |
| __ Move(kContextRegister, Smi::zero()); |
| __ CallRuntime(Runtime::kWasmCompileLazy, 2); |
| |
| // Untag the returned Smi into into t0, for later use. |
| static_assert(!kSavedGpRegs.has(t0)); |
| __ SmiUntag(t0, a0); |
| |
| __ Add_d(sp, sp, kSavedFpRegs.Count() * kDoubleSize); |
| // Restore registers. |
| __ MultiPopFPU(kSavedFpRegs); |
| __ MultiPop(kSavedGpRegs); |
| __ Pop(kWasmImplicitArgRegister); |
| } |
| |
| // The runtime function returned the jump table slot offset as a Smi (now in |
| // t0). Use that to compute the jump target. |
| static_assert(!kSavedGpRegs.has(t1)); |
| __ Ld_d(t1, FieldMemOperand(kWasmImplicitArgRegister, |
| WasmTrustedInstanceData::kJumpTableStartOffset)); |
| __ Add_d(t0, t1, Operand(t0)); |
| |
| // Finally, jump to the jump table slot for the function. |
| __ Jump(t0); |
| } |
| |
| void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) { |
| HardAbortScope hard_abort(masm); // Avoid calls to Abort. |
| { |
| FrameScope scope(masm, StackFrame::WASM_DEBUG_BREAK); |
| |
| // Save all parameter registers. They might hold live values, we restore |
| // them after the runtime call. |
| __ MultiPush(WasmDebugBreakFrameConstants::kPushedGpRegs); |
| __ MultiPushFPU(WasmDebugBreakFrameConstants::kPushedFpRegs); |
| |
| // Initialize the JavaScript context with 0. CEntry will use it to |
| // set the current context on the isolate. |
| __ Move(cp, Smi::zero()); |
| __ CallRuntime(Runtime::kWasmDebugBreak, 0); |
| |
| // Restore registers. |
| __ MultiPopFPU(WasmDebugBreakFrameConstants::kPushedFpRegs); |
| __ MultiPop(WasmDebugBreakFrameConstants::kPushedGpRegs); |
| } |
| __ Ret(); |
| } |
| |
| namespace { |
| // Check that the stack was in the old state (if generated code assertions are |
| // enabled), and switch to the new state. |
| void SwitchStackState(MacroAssembler* masm, Register jmpbuf, Register tmp, |
| wasm::JumpBuffer::StackState old_state, |
| wasm::JumpBuffer::StackState new_state) { |
| #if V8_ENABLE_SANDBOX |
| __ Ld_w(tmp, MemOperand(jmpbuf, wasm::kJmpBufStateOffset)); |
| Label ok; |
| __ JumpIfEqual(tmp, old_state, &ok); |
| __ Trap(); |
| __ bind(&ok); |
| #endif |
| __ li(tmp, Operand(new_state)); |
| __ St_w(tmp, MemOperand(jmpbuf, wasm::kJmpBufStateOffset)); |
| } |
| |
| // Switch the stack pointer. |
| void SwitchStackPointer(MacroAssembler* masm, Register jmpbuf) { |
| __ Ld_d(sp, MemOperand(jmpbuf, wasm::kJmpBufSpOffset)); |
| } |
| |
| void FillJumpBuffer(MacroAssembler* masm, Register jmpbuf, Label* target, |
| Register tmp) { |
| __ mov(tmp, sp); |
| __ St_d(tmp, MemOperand(jmpbuf, wasm::kJmpBufSpOffset)); |
| __ St_d(fp, MemOperand(jmpbuf, wasm::kJmpBufFpOffset)); |
| __ LoadStackLimit(tmp, __ StackLimitKind::kRealStackLimit); |
| __ St_d(tmp, MemOperand(jmpbuf, wasm::kJmpBufStackLimitOffset)); |
| |
| __ LoadLabelRelative(tmp, target); |
| // Stash the address in the jump buffer. |
| __ St_d(tmp, MemOperand(jmpbuf, wasm::kJmpBufPcOffset)); |
| } |
| |
| void LoadJumpBuffer(MacroAssembler* masm, Register jmpbuf, bool load_pc, |
| Register tmp, wasm::JumpBuffer::StackState expected_state) { |
| SwitchStackPointer(masm, jmpbuf); |
| __ Ld_d(fp, MemOperand(jmpbuf, wasm::kJmpBufFpOffset)); |
| SwitchStackState(masm, jmpbuf, tmp, expected_state, wasm::JumpBuffer::Active); |
| if (load_pc) { |
| __ Ld_d(tmp, MemOperand(jmpbuf, wasm::kJmpBufPcOffset)); |
| __ Jump(tmp); |
| } |
| // The stack limit in StackGuard is set separately under the ExecutionAccess |
| // lock. |
| } |
| |
| void SaveState(MacroAssembler* masm, Register active_continuation, Register tmp, |
| Label* suspend) { |
| Register jmpbuf = tmp; |
| __ LoadExternalPointerField( |
| jmpbuf, |
| FieldMemOperand(active_continuation, |
| WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(jmpbuf, jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| |
| UseScratchRegisterScope temps(masm); |
| FillJumpBuffer(masm, jmpbuf, suspend, temps.Acquire()); |
| } |
| |
| void LoadTargetJumpBuffer(MacroAssembler* masm, Register target_continuation, |
| Register tmp, |
| wasm::JumpBuffer::StackState expected_state) { |
| Register target_jmpbuf = target_continuation; |
| __ LoadExternalPointerField( |
| target_jmpbuf, |
| FieldMemOperand(target_continuation, |
| WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(target_jmpbuf, target_jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| |
| __ St_d(zero_reg, |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset)); |
| // Switch stack! |
| LoadJumpBuffer(masm, target_jmpbuf, false, tmp, expected_state); |
| } |
| |
| // Updates the stack limit and central stack info, and validates the switch. |
| void SwitchStacks(MacroAssembler* masm, Register old_continuation, |
| bool return_switch, |
| const std::initializer_list<Register> keep) { |
| using ER = ExternalReference; |
| |
| for (auto reg : keep) { |
| __ Push(reg); |
| } |
| |
| { |
| __ PrepareCallCFunction(2, a0); |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ li(kCArgRegs[0], ExternalReference::isolate_address(masm->isolate())); |
| __ mov(kCArgRegs[1], old_continuation); |
| __ CallCFunction( |
| return_switch ? ER::wasm_return_switch() : ER::wasm_switch_stacks(), 2); |
| } |
| |
| for (auto it = std::rbegin(keep); it != std::rend(keep); ++it) { |
| __ Pop(*it); |
| } |
| } |
| |
| void ReloadParentContinuation(MacroAssembler* masm, Register return_reg, |
| Register return_value, Register context, |
| Register tmp1, Register tmp2, Register tmp3) { |
| Register active_continuation = tmp1; |
| __ LoadRoot(active_continuation, RootIndex::kActiveContinuation); |
| |
| // Set a null pointer in the jump buffer's SP slot to indicate to the stack |
| // frame iterator that this stack is empty. |
| Register jmpbuf = tmp2; |
| __ LoadExternalPointerField( |
| jmpbuf, |
| FieldMemOperand(active_continuation, |
| WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(jmpbuf, jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| __ St_d(zero_reg, MemOperand(jmpbuf, wasm::kJmpBufSpOffset)); |
| { |
| UseScratchRegisterScope temps(masm); |
| Register scratch = temps.Acquire(); |
| SwitchStackState(masm, jmpbuf, scratch, wasm::JumpBuffer::Active, |
| wasm::JumpBuffer::Retired); |
| } |
| Register parent = tmp2; |
| __ LoadTaggedField(parent, |
| FieldMemOperand(active_continuation, |
| WasmContinuationObject::kParentOffset)); |
| |
| // Update active continuation root. |
| int32_t active_continuation_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveContinuation); |
| __ St_d(parent, MemOperand(kRootRegister, active_continuation_offset)); |
| jmpbuf = parent; |
| __ LoadExternalPointerField( |
| jmpbuf, FieldMemOperand(parent, WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(jmpbuf, jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| |
| // Switch stack! |
| SwitchStacks(masm, active_continuation, true, |
| {return_reg, return_value, context, jmpbuf}); |
| LoadJumpBuffer(masm, jmpbuf, false, tmp3, wasm::JumpBuffer::Inactive); |
| } |
| |
| void RestoreParentSuspender(MacroAssembler* masm, Register tmp1, |
| Register tmp2) { |
| Register suspender = tmp1; |
| __ LoadRoot(suspender, RootIndex::kActiveSuspender); |
| __ LoadTaggedField( |
| suspender, |
| FieldMemOperand(suspender, WasmSuspenderObject::kParentOffset)); |
| int32_t active_suspender_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveSuspender); |
| __ St_d(suspender, MemOperand(kRootRegister, active_suspender_offset)); |
| } |
| |
| void ResetStackSwitchFrameStackSlots(MacroAssembler* masm) { |
| __ St_d(zero_reg, |
| MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset)); |
| __ St_d(zero_reg, |
| MemOperand(fp, StackSwitchFrameConstants::kImplicitArgOffset)); |
| } |
| |
| // TODO(irezvov): Consolidate with arm64 RegisterAllocator. |
| class RegisterAllocator { |
| public: |
| class Scoped { |
| public: |
| Scoped(RegisterAllocator* allocator, Register* reg) |
| : allocator_(allocator), reg_(reg) {} |
| ~Scoped() { allocator_->Free(reg_); } |
| |
| private: |
| RegisterAllocator* allocator_; |
| Register* reg_; |
| }; |
| |
| explicit RegisterAllocator(const RegList& registers) |
| : initial_(registers), available_(registers) {} |
| void Ask(Register* reg) { |
| DCHECK_EQ(*reg, no_reg); |
| DCHECK(!available_.is_empty()); |
| *reg = available_.PopFirst(); |
| allocated_registers_.push_back(reg); |
| } |
| |
| bool registerIsAvailable(const Register& reg) { return available_.has(reg); } |
| |
| void Pinned(const Register& requested, Register* reg) { |
| if (!registerIsAvailable(requested)) { |
| printf("%s register is ocupied!", RegisterName(requested)); |
| } |
| DCHECK(registerIsAvailable(requested)); |
| *reg = requested; |
| Reserve(requested); |
| allocated_registers_.push_back(reg); |
| } |
| |
| void Free(Register* reg) { |
| DCHECK_NE(*reg, no_reg); |
| available_.set(*reg); |
| *reg = no_reg; |
| allocated_registers_.erase( |
| find(allocated_registers_.begin(), allocated_registers_.end(), reg)); |
| } |
| |
| void Reserve(const Register& reg) { |
| if (reg == no_reg) { |
| return; |
| } |
| DCHECK(registerIsAvailable(reg)); |
| available_.clear(reg); |
| } |
| |
| void Reserve(const Register& reg1, const Register& reg2, |
| const Register& reg3 = no_reg, const Register& reg4 = no_reg, |
| const Register& reg5 = no_reg, const Register& reg6 = no_reg) { |
| Reserve(reg1); |
| Reserve(reg2); |
| Reserve(reg3); |
| Reserve(reg4); |
| Reserve(reg5); |
| Reserve(reg6); |
| } |
| |
| bool IsUsed(const Register& reg) { |
| return initial_.has(reg) && !registerIsAvailable(reg); |
| } |
| |
| void ResetExcept(const Register& reg1 = no_reg, const Register& reg2 = no_reg, |
| const Register& reg3 = no_reg, const Register& reg4 = no_reg, |
| const Register& reg5 = no_reg, |
| const Register& reg6 = no_reg) { |
| available_ = initial_; |
| available_.clear(reg1); |
| available_.clear(reg2); |
| available_.clear(reg3); |
| available_.clear(reg4); |
| available_.clear(reg5); |
| available_.clear(reg6); |
| |
| auto it = allocated_registers_.begin(); |
| while (it != allocated_registers_.end()) { |
| if (registerIsAvailable(**it)) { |
| **it = no_reg; |
| allocated_registers_.erase(it); |
| } else { |
| it++; |
| } |
| } |
| } |
| |
| static RegisterAllocator WithAllocatableGeneralRegisters() { |
| RegList list; |
| const RegisterConfiguration* config(RegisterConfiguration::Default()); |
| |
| for (int i = 0; i < config->num_allocatable_general_registers(); ++i) { |
| int code = config->GetAllocatableGeneralCode(i); |
| Register candidate = Register::from_code(code); |
| list.set(candidate); |
| } |
| return RegisterAllocator(list); |
| } |
| |
| private: |
| std::vector<Register*> allocated_registers_; |
| const RegList initial_; |
| RegList available_; |
| }; |
| |
| #define DEFINE_REG(Name) \ |
| Register Name = no_reg; \ |
| regs.Ask(&Name); |
| |
| #define DEFINE_REG_W(Name) \ |
| DEFINE_REG(Name); \ |
| Name = Name.W(); |
| |
| #define ASSIGN_REG(Name) regs.Ask(&Name); |
| |
| #define ASSIGN_REG_W(Name) \ |
| ASSIGN_REG(Name); \ |
| Name = Name.W(); |
| |
| #define DEFINE_PINNED(Name, Reg) \ |
| Register Name = no_reg; \ |
| regs.Pinned(Reg, &Name); |
| |
| #define ASSIGN_PINNED(Name, Reg) regs.Pinned(Reg, &Name); |
| |
| #define DEFINE_SCOPED(Name) \ |
| DEFINE_REG(Name) \ |
| RegisterAllocator::Scoped scope_##Name(®s, &Name); |
| |
| #define FREE_REG(Name) regs.Free(&Name); |
| |
| // Loads the context field of the WasmTrustedInstanceData or WasmImportData |
| // depending on the data's type, and places the result in the input register. |
| void GetContextFromImplicitArg(MacroAssembler* masm, Register data, |
| Register scratch) { |
| Label instance; |
| Label end; |
| __ LoadTaggedField(scratch, FieldMemOperand(data, HeapObject::kMapOffset)); |
| __ Ld_hu(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset)); |
| __ Branch(&instance, eq, scratch, Operand(WASM_TRUSTED_INSTANCE_DATA_TYPE)); |
| |
| __ LoadTaggedField( |
| data, FieldMemOperand(data, WasmImportData::kNativeContextOffset)); |
| __ jmp(&end); |
| |
| __ bind(&instance); |
| __ LoadTaggedField( |
| data, |
| FieldMemOperand(data, WasmTrustedInstanceData::kNativeContextOffset)); |
| __ bind(&end); |
| } |
| |
| } // namespace |
| |
| void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { |
| // Push registers in reverse order so that they are on the stack like |
| // in an array, with the first item being at the lowest address. |
| constexpr int cnt_fp = arraysize(wasm::kFpParamRegisters); |
| constexpr int cnt_gp = arraysize(wasm::kGpParamRegisters) - 1; |
| int required_stack_space = cnt_fp * kDoubleSize + cnt_gp * kSystemPointerSize; |
| __ Sub_d(sp, sp, Operand(required_stack_space)); |
| for (int i = cnt_fp - 1; i >= 0; i--) { |
| __ Fst_d(wasm::kFpParamRegisters[i], |
| MemOperand(sp, i * kDoubleSize + cnt_gp * kSystemPointerSize)); |
| } |
| |
| // Without wasm::kGpParamRegisters[0] here. |
| for (int i = cnt_gp; i >= 1; i--) { |
| __ St_d(wasm::kGpParamRegisters[i], |
| MemOperand(sp, (i - 1) * kSystemPointerSize)); |
| } |
| // Reserve a slot for the signature. |
| __ Push(zero_reg); |
| __ TailCallBuiltin(Builtin::kWasmToJsWrapperCSA); |
| } |
| |
| void Builtins::Generate_WasmTrapHandlerLandingPad(MacroAssembler* masm) { |
| // This builtin gets called from the WebAssembly trap handler when an |
| // out-of-bounds memory access happened or when a null reference gets |
| // dereferenced. This builtin then fakes a call from the instruction that |
| // triggered the signal to the runtime. This is done by setting a return |
| // address and then jumping to a builtin which will call further to the |
| // runtime. |
| // As the return address we use the fault address + 1. Using the fault address |
| // itself would cause problems with safepoints and source positions. |
| // |
| // The problem with safepoints is that a safepoint has to be registered at the |
| // return address, and that at most one safepoint should be registered at a |
| // location. However, there could already be a safepoint registered at the |
| // fault address if the fault address is the return address of a call. |
| // |
| // The problem with source positions is that the stack trace code looks for |
| // the source position of a call before the return address. The source |
| // position of the faulty memory access, however, is recorded at the fault |
| // address. Therefore the stack trace code would not find the source position |
| // if we used the fault address as the return address. |
| __ Add_d(ra, kWasmTrapHandlerFaultAddressRegister, 1); |
| __ TailCallBuiltin(Builtin::kWasmTrapHandlerThrowTrap); |
| } |
| |
| void Builtins::Generate_WasmSuspend(MacroAssembler* masm) { |
| auto regs = RegisterAllocator::WithAllocatableGeneralRegisters(); |
| // Set up the stackframe. |
| __ EnterFrame(StackFrame::STACK_SWITCH); |
| |
| DEFINE_PINNED(suspender, a0); |
| DEFINE_PINNED(context, kContextRegister); |
| |
| __ Sub_d( |
| sp, sp, |
| Operand(StackSwitchFrameConstants::kNumSpillSlots * kSystemPointerSize)); |
| // Set a sentinel value for the spill slots visited by the GC. |
| ResetStackSwitchFrameStackSlots(masm); |
| |
| // ------------------------------------------- |
| // Save current state in active jump buffer. |
| // ------------------------------------------- |
| Label resume; |
| DEFINE_REG(continuation); |
| __ LoadRoot(continuation, RootIndex::kActiveContinuation); |
| DEFINE_REG(jmpbuf); |
| DEFINE_REG(scratch); |
| __ LoadExternalPointerField( |
| jmpbuf, |
| FieldMemOperand(continuation, WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(jmpbuf, jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| FillJumpBuffer(masm, jmpbuf, &resume, scratch); |
| SwitchStackState(masm, jmpbuf, scratch, wasm::JumpBuffer::Active, |
| wasm::JumpBuffer::Suspended); |
| regs.ResetExcept(suspender, continuation); |
| |
| DEFINE_REG(suspender_continuation); |
| __ LoadTaggedField( |
| suspender_continuation, |
| FieldMemOperand(suspender, WasmSuspenderObject::kContinuationOffset)); |
| if (v8_flags.debug_code) { |
| // ------------------------------------------- |
| // Check that the suspender's continuation is the active continuation. |
| // ------------------------------------------- |
| // TODO(thibaudm): Once we add core stack-switching instructions, this |
| // check will not hold anymore: it's possible that the active continuation |
| // changed (due to an internal switch), so we have to update the suspender. |
| Label ok; |
| __ Branch(&ok, eq, suspender_continuation, Operand(continuation)); |
| __ Trap(); |
| __ bind(&ok); |
| } |
| // ------------------------------------------- |
| // Update roots. |
| // ------------------------------------------- |
| DEFINE_REG(caller); |
| __ LoadTaggedField(caller, |
| FieldMemOperand(suspender_continuation, |
| WasmContinuationObject::kParentOffset)); |
| int32_t active_continuation_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveContinuation); |
| __ St_d(caller, MemOperand(kRootRegister, active_continuation_offset)); |
| DEFINE_REG(parent); |
| __ LoadTaggedField( |
| parent, FieldMemOperand(suspender, WasmSuspenderObject::kParentOffset)); |
| int32_t active_suspender_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveSuspender); |
| __ St_d(parent, MemOperand(kRootRegister, active_suspender_offset)); |
| regs.ResetExcept(suspender, caller, continuation); |
| |
| // ------------------------------------------- |
| // Load jump buffer. |
| // ------------------------------------------- |
| SwitchStacks(masm, continuation, false, {caller, suspender}); |
| FREE_REG(continuation); |
| ASSIGN_REG(jmpbuf); |
| __ LoadExternalPointerField( |
| jmpbuf, FieldMemOperand(caller, WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(jmpbuf, jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| __ LoadTaggedField( |
| kReturnRegister0, |
| FieldMemOperand(suspender, WasmSuspenderObject::kPromiseOffset)); |
| MemOperand GCScanSlotPlace = |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset); |
| __ St_d(zero_reg, GCScanSlotPlace); |
| ASSIGN_REG(scratch) |
| LoadJumpBuffer(masm, jmpbuf, true, scratch, wasm::JumpBuffer::Inactive); |
| __ Trap(); |
| __ bind(&resume); |
| __ LeaveFrame(StackFrame::STACK_SWITCH); |
| __ Ret(); |
| } |
| |
| namespace { |
| // Resume the suspender stored in the closure. We generate two variants of this |
| // builtin: the onFulfilled variant resumes execution at the saved PC and |
| // forwards the value, the onRejected variant throws the value. |
| |
| void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) { |
| auto regs = RegisterAllocator::WithAllocatableGeneralRegisters(); |
| __ EnterFrame(StackFrame::STACK_SWITCH); |
| |
| DEFINE_PINNED(closure, kJSFunctionRegister); // a1 |
| |
| __ Sub_d( |
| sp, sp, |
| Operand(StackSwitchFrameConstants::kNumSpillSlots * kSystemPointerSize)); |
| // Set a sentinel value for the spill slots visited by the GC. |
| ResetStackSwitchFrameStackSlots(masm); |
| |
| regs.ResetExcept(closure); |
| |
| // ------------------------------------------- |
| // Load suspender from closure. |
| // ------------------------------------------- |
| DEFINE_REG(sfi); |
| __ LoadTaggedField( |
| sfi, |
| MemOperand( |
| closure, |
| wasm::ObjectAccess::SharedFunctionInfoOffsetInTaggedJSFunction())); |
| FREE_REG(closure); |
| // Suspender should be ObjectRegister register to be used in |
| // RecordWriteField calls later. |
| DEFINE_PINNED(suspender, WriteBarrierDescriptor::ObjectRegister()); |
| DEFINE_REG(resume_data); |
| __ LoadTaggedField( |
| resume_data, |
| FieldMemOperand(sfi, SharedFunctionInfo::kUntrustedFunctionDataOffset)); |
| __ LoadTaggedField( |
| suspender, |
| FieldMemOperand(resume_data, WasmResumeData::kSuspenderOffset)); |
| regs.ResetExcept(suspender); |
| |
| // ------------------------------------------- |
| // Save current state. |
| // ------------------------------------------- |
| Label suspend; |
| DEFINE_REG(active_continuation); |
| __ LoadRoot(active_continuation, RootIndex::kActiveContinuation); |
| DEFINE_REG(current_jmpbuf); |
| DEFINE_REG(scratch); |
| __ LoadExternalPointerField( |
| current_jmpbuf, |
| FieldMemOperand(active_continuation, |
| WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(current_jmpbuf, current_jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| FillJumpBuffer(masm, current_jmpbuf, &suspend, scratch); |
| SwitchStackState(masm, current_jmpbuf, scratch, wasm::JumpBuffer::Active, |
| wasm::JumpBuffer::Inactive); |
| FREE_REG(current_jmpbuf); |
| |
| // ------------------------------------------- |
| // Set the suspender and continuation parents and update the roots |
| // ------------------------------------------- |
| DEFINE_REG(active_suspender); |
| __ LoadRoot(active_suspender, RootIndex::kActiveSuspender); |
| __ StoreTaggedField( |
| active_suspender, |
| FieldMemOperand(suspender, WasmSuspenderObject::kParentOffset)); |
| __ RecordWriteField(suspender, WasmSuspenderObject::kParentOffset, |
| active_suspender, kRAHasBeenSaved, |
| SaveFPRegsMode::kIgnore); |
| int32_t active_suspender_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveSuspender); |
| __ St_d(suspender, MemOperand(kRootRegister, active_suspender_offset)); |
| |
| // Next line we are going to load a field from suspender, but we have to use |
| // the same register for target_continuation to use it in RecordWriteField. |
| // So, free suspender here to use pinned reg, but load from it next line. |
| FREE_REG(suspender); |
| DEFINE_PINNED(target_continuation, WriteBarrierDescriptor::ObjectRegister()); |
| suspender = target_continuation; |
| __ LoadTaggedField( |
| target_continuation, |
| FieldMemOperand(suspender, WasmSuspenderObject::kContinuationOffset)); |
| suspender = no_reg; |
| |
| __ StoreTaggedField(active_continuation, |
| FieldMemOperand(target_continuation, |
| WasmContinuationObject::kParentOffset)); |
| DEFINE_REG(old_continuation); |
| __ Move(old_continuation, active_continuation); |
| __ RecordWriteField( |
| target_continuation, WasmContinuationObject::kParentOffset, |
| active_continuation, kRAHasBeenSaved, SaveFPRegsMode::kIgnore); |
| int32_t active_continuation_offset = |
| MacroAssembler::RootRegisterOffsetForRootIndex( |
| RootIndex::kActiveContinuation); |
| __ St_d(target_continuation, |
| MemOperand(kRootRegister, active_continuation_offset)); |
| |
| SwitchStacks(masm, old_continuation, false, {target_continuation}); |
| |
| regs.ResetExcept(target_continuation); |
| |
| // ------------------------------------------- |
| // Load state from target jmpbuf (longjmp). |
| // ------------------------------------------- |
| regs.Reserve(kReturnRegister0); |
| DEFINE_REG(target_jmpbuf); |
| ASSIGN_REG(scratch); |
| __ LoadExternalPointerField( |
| target_jmpbuf, |
| FieldMemOperand(target_continuation, |
| WasmContinuationObject::kStackOffset), |
| kWasmStackMemoryTag); |
| __ Add_d(target_jmpbuf, target_jmpbuf, wasm::StackMemory::jmpbuf_offset()); |
| // Move resolved value to return register. |
| __ Ld_d(kReturnRegister0, MemOperand(fp, 3 * kSystemPointerSize)); |
| MemOperand GCScanSlotPlace = |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset); |
| __ St_d(zero_reg, GCScanSlotPlace); |
| if (on_resume == wasm::OnResume::kThrow) { |
| // Switch to the continuation's stack without restoring the PC. |
| LoadJumpBuffer(masm, target_jmpbuf, false, scratch, |
| wasm::JumpBuffer::Suspended); |
| // Pop this frame now. The unwinder expects that the first STACK_SWITCH |
| // frame is the outermost one. |
| __ LeaveFrame(StackFrame::STACK_SWITCH); |
| // Forward the onRejected value to kThrow. |
| __ Push(kReturnRegister0); |
| __ CallRuntime(Runtime::kThrow); |
| } else { |
| // Resume the continuation normally. |
| LoadJumpBuffer(masm, target_jmpbuf, true, scratch, |
| wasm::JumpBuffer::Suspended); |
| } |
| __ Trap(); |
| __ bind(&suspend); |
| __ LeaveFrame(StackFrame::STACK_SWITCH); |
| // Pop receiver + parameter. |
| __ Add_d(sp, sp, Operand(2 * kSystemPointerSize)); |
| __ Ret(); |
| } |
| } // namespace |
| |
| void Builtins::Generate_WasmResume(MacroAssembler* masm) { |
| Generate_WasmResumeHelper(masm, wasm::OnResume::kContinue); |
| } |
| |
| void Builtins::Generate_WasmReject(MacroAssembler* masm) { |
| Generate_WasmResumeHelper(masm, wasm::OnResume::kThrow); |
| } |
| |
| void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) { |
| // Only needed on x64. |
| __ Trap(); |
| } |
| |
| namespace { |
| void SwitchToAllocatedStack(MacroAssembler* masm, RegisterAllocator& regs, |
| Register wasm_instance, Register wrapper_buffer, |
| Register& original_fp, Register& new_wrapper_buffer, |
| Label* suspend) { |
| ResetStackSwitchFrameStackSlots(masm); |
| DEFINE_SCOPED(scratch) |
| DEFINE_REG(target_continuation) |
| __ LoadRoot(target_continuation, RootIndex::kActiveContinuation); |
| DEFINE_REG(parent_continuation) |
| __ LoadTaggedField(parent_continuation, |
| FieldMemOperand(target_continuation, |
| WasmContinuationObject::kParentOffset)); |
| |
| SaveState(masm, parent_continuation, scratch, suspend); |
| |
| SwitchStacks(masm, parent_continuation, false, |
| {wasm_instance, wrapper_buffer}); |
| |
| FREE_REG(parent_continuation); |
| // Save the old stack's fp in t0, and use it to access the parameters in |
| // the parent frame. |
| regs.Pinned(t1, &original_fp); |
| __ mov(original_fp, fp); |
| __ LoadRoot(target_continuation, RootIndex::kActiveContinuation); |
| LoadTargetJumpBuffer(masm, target_continuation, scratch, |
| wasm::JumpBuffer::Suspended); |
| FREE_REG(target_continuation); |
| |
| // Push the loaded fp. We know it is null, because there is no frame yet, |
| // so we could also push 0 directly. In any case we need to push it, |
| // because this marks the base of the stack segment for |
| // the stack frame iterator. |
| __ EnterFrame(StackFrame::STACK_SWITCH); |
| |
| int stack_space = |
| RoundUp(StackSwitchFrameConstants::kNumSpillSlots * kSystemPointerSize + |
| JSToWasmWrapperFrameConstants::kWrapperBufferSize, |
| 16); |
| __ Sub_d(sp, sp, Operand(stack_space)); |
| |
| ASSIGN_REG(new_wrapper_buffer) |
| |
| __ mov(new_wrapper_buffer, sp); |
| // Copy data needed for return handling from old wrapper buffer to new one. |
| // kWrapperBufferRefReturnCount will be copied too, because 8 bytes are copied |
| // at the same time. |
| static_assert(JSToWasmWrapperFrameConstants::kWrapperBufferRefReturnCount == |
| JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount + 4); |
| __ Ld_d(scratch, |
| MemOperand(wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount)); |
| __ St_d(scratch, |
| MemOperand(new_wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount)); |
| __ Ld_d( |
| scratch, |
| MemOperand( |
| wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray)); |
| __ St_d( |
| scratch, |
| MemOperand( |
| new_wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray)); |
| } |
| |
| void SwitchBackAndReturnPromise(MacroAssembler* masm, RegisterAllocator& regs, |
| wasm::Promise mode, Label* return_promise) { |
| regs.ResetExcept(); |
| // The return value of the wasm function becomes the parameter of the |
| // FulfillPromise builtin, and the promise is the return value of this |
| // wrapper. |
| static const Builtin_FulfillPromise_InterfaceDescriptor desc; |
| DEFINE_PINNED(promise, desc.GetRegisterParameter(0)); |
| DEFINE_PINNED(return_value, desc.GetRegisterParameter(1)); |
| DEFINE_SCOPED(tmp); |
| DEFINE_SCOPED(tmp2); |
| DEFINE_SCOPED(tmp3); |
| if (mode == wasm::kPromise) { |
| __ mov(return_value, kReturnRegister0); |
| __ LoadRoot(promise, RootIndex::kActiveSuspender); |
| __ LoadTaggedField( |
| promise, FieldMemOperand(promise, WasmSuspenderObject::kPromiseOffset)); |
| } |
| |
| __ Ld_d(kContextRegister, |
| MemOperand(fp, StackSwitchFrameConstants::kImplicitArgOffset)); |
| GetContextFromImplicitArg(masm, kContextRegister, tmp); |
| |
| ReloadParentContinuation(masm, promise, return_value, kContextRegister, tmp, |
| tmp2, tmp3); |
| RestoreParentSuspender(masm, tmp, tmp2); |
| |
| if (mode == wasm::kPromise) { |
| __ li(tmp, Operand(1)); |
| __ St_d(tmp, |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset)); |
| __ Push(promise); |
| __ CallBuiltin(Builtin::kFulfillPromise); |
| __ Pop(promise); |
| } |
| FREE_REG(promise); |
| FREE_REG(return_value); |
| |
| __ bind(return_promise); |
| } |
| |
| void GenerateExceptionHandlingLandingPad(MacroAssembler* masm, |
| RegisterAllocator& regs, |
| Label* return_promise) { |
| regs.ResetExcept(); |
| static const Builtin_RejectPromise_InterfaceDescriptor desc; |
| DEFINE_PINNED(promise, desc.GetRegisterParameter(0)); |
| DEFINE_PINNED(reason, desc.GetRegisterParameter(1)); |
| DEFINE_PINNED(debug_event, desc.GetRegisterParameter(2)); |
| int catch_handler = __ pc_offset(); |
| |
| DEFINE_SCOPED(thread_in_wasm_flag_addr); |
| thread_in_wasm_flag_addr = a2; |
| |
| // Unset thread_in_wasm_flag. |
| __ Ld_d( |
| thread_in_wasm_flag_addr, |
| MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset())); |
| __ St_w(zero_reg, MemOperand(thread_in_wasm_flag_addr, 0)); |
| |
| // The exception becomes the parameter of the RejectPromise builtin, and the |
| // promise is the return value of this wrapper. |
| __ mov(reason, kReturnRegister0); |
| __ LoadRoot(promise, RootIndex::kActiveSuspender); |
| __ LoadTaggedField( |
| promise, FieldMemOperand(promise, WasmSuspenderObject::kPromiseOffset)); |
| |
| __ Ld_d(kContextRegister, |
| MemOperand(fp, StackSwitchFrameConstants::kImplicitArgOffset)); |
| |
| DEFINE_SCOPED(tmp); |
| DEFINE_SCOPED(tmp2); |
| DEFINE_SCOPED(tmp3); |
| GetContextFromImplicitArg(masm, kContextRegister, tmp); |
| ReloadParentContinuation(masm, promise, reason, kContextRegister, tmp, tmp2, |
| tmp3); |
| RestoreParentSuspender(masm, tmp, tmp2); |
| |
| __ li(tmp, Operand(1)); |
| __ St_d(tmp, |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset)); |
| __ Push(promise); |
| __ LoadRoot(debug_event, RootIndex::kTrueValue); |
| __ CallBuiltin(Builtin::kRejectPromise); |
| __ Pop(promise); |
| |
| // Run the rest of the wrapper normally (deconstruct the frame, ...). |
| __ jmp(return_promise); |
| |
| masm->isolate()->builtins()->SetJSPIPromptHandlerOffset(catch_handler); |
| } |
| |
| void JSToWasmWrapperHelper(MacroAssembler* masm, wasm::Promise mode) { |
| bool stack_switch = mode == wasm::kPromise || mode == wasm::kStressSwitch; |
| auto regs = RegisterAllocator::WithAllocatableGeneralRegisters(); |
| |
| __ EnterFrame(stack_switch ? StackFrame::STACK_SWITCH |
| : StackFrame::JS_TO_WASM); |
| |
| __ AllocateStackSpace(StackSwitchFrameConstants::kNumSpillSlots * |
| kSystemPointerSize); |
| |
| // Load the implicit argument (instance data or import data) from the frame. |
| DEFINE_PINNED(implicit_arg, kWasmImplicitArgRegister); |
| __ Ld_d(implicit_arg, |
| MemOperand(fp, JSToWasmWrapperFrameConstants::kImplicitArgOffset)); |
| |
| DEFINE_PINNED(wrapper_buffer, |
| WasmJSToWasmWrapperDescriptor::WrapperBufferRegister()); |
| |
| Label suspend; |
| Register original_fp = no_reg; |
| Register new_wrapper_buffer = no_reg; |
| if (stack_switch) { |
| SwitchToAllocatedStack(masm, regs, implicit_arg, wrapper_buffer, |
| original_fp, new_wrapper_buffer, &suspend); |
| } else { |
| original_fp = fp; |
| new_wrapper_buffer = wrapper_buffer; |
| } |
| |
| regs.ResetExcept(original_fp, wrapper_buffer, implicit_arg, |
| new_wrapper_buffer); |
| |
| { |
| __ St_d( |
| new_wrapper_buffer, |
| MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset)); |
| if (stack_switch) { |
| __ St_d(implicit_arg, |
| MemOperand(fp, StackSwitchFrameConstants::kImplicitArgOffset)); |
| DEFINE_SCOPED(scratch) |
| __ Ld_d( |
| scratch, |
| MemOperand(original_fp, |
| JSToWasmWrapperFrameConstants::kResultArrayParamOffset)); |
| __ St_d(scratch, |
| MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset)); |
| } |
| } |
| { |
| DEFINE_SCOPED(result_size); |
| __ Ld_d(result_size, MemOperand(wrapper_buffer, |
| JSToWasmWrapperFrameConstants:: |
| kWrapperBufferStackReturnBufferSize)); |
| __ slli_d(result_size, result_size, kSystemPointerSizeLog2); |
| __ Sub_d(sp, sp, result_size); |
| } |
| |
| __ St_d( |
| sp, |
| MemOperand( |
| new_wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferStart)); |
| |
| if (stack_switch) { |
| FREE_REG(new_wrapper_buffer) |
| } |
| FREE_REG(implicit_arg) |
| for (auto reg : wasm::kGpParamRegisters) { |
| regs.Reserve(reg); |
| } |
| |
| // The first GP parameter holds the trusted instance data or the import data. |
| // This is handled specially. |
| int stack_params_offset = |
| (arraysize(wasm::kGpParamRegisters) - 1) * kSystemPointerSize + |
| arraysize(wasm::kFpParamRegisters) * kDoubleSize; |
| int param_padding = stack_params_offset & kSystemPointerSize; |
| stack_params_offset += param_padding; |
| |
| { |
| DEFINE_SCOPED(params_start); |
| __ Ld_d( |
| params_start, |
| MemOperand(wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferParamStart)); |
| { |
| // Push stack parameters on the stack. |
| DEFINE_SCOPED(params_end); |
| __ Ld_d( |
| params_end, |
| MemOperand(wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd)); |
| DEFINE_SCOPED(last_stack_param); |
| |
| __ Add_d(last_stack_param, params_start, Operand(stack_params_offset)); |
| Label loop_start; |
| __ bind(&loop_start); |
| |
| Label finish_stack_params; |
| __ Branch(&finish_stack_params, ge, last_stack_param, |
| Operand(params_end)); |
| |
| // Push parameter |
| { |
| DEFINE_SCOPED(scratch); |
| __ Sub_d(params_end, params_end, Operand(kSystemPointerSize)); |
| __ Ld_d(scratch, MemOperand(params_end, 0)); |
| __ Push(scratch); |
| } |
| |
| __ Branch(&loop_start); |
| |
| __ bind(&finish_stack_params); |
| } |
| |
| size_t next_offset = 0; |
| for (size_t i = 1; i < arraysize(wasm::kGpParamRegisters); ++i) { |
| // Check that {params_start} does not overlap with any of the parameter |
| // registers, so that we don't overwrite it by accident with the loads |
| // below. |
| DCHECK_NE(params_start, wasm::kGpParamRegisters[i]); |
| __ Ld_d(wasm::kGpParamRegisters[i], |
| MemOperand(params_start, next_offset)); |
| next_offset += kSystemPointerSize; |
| } |
| |
| next_offset += param_padding; |
| for (size_t i = 0; i < arraysize(wasm::kFpParamRegisters); ++i) { |
| __ Fld_d(wasm::kFpParamRegisters[i], |
| MemOperand(params_start, next_offset)); |
| next_offset += kDoubleSize; |
| } |
| DCHECK_EQ(next_offset, stack_params_offset); |
| } |
| |
| { |
| DEFINE_SCOPED(thread_in_wasm_flag_addr); |
| __ Ld_d(thread_in_wasm_flag_addr, |
| MemOperand(kRootRegister, |
| Isolate::thread_in_wasm_flag_address_offset())); |
| DEFINE_SCOPED(scratch); |
| __ li(scratch, Operand(1)); |
| __ St_w(scratch, MemOperand(thread_in_wasm_flag_addr, 0)); |
| } |
| |
| __ St_d(zero_reg, |
| MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset)); |
| { |
| DEFINE_SCOPED(call_target); |
| __ LoadWasmCodePointer( |
| call_target, |
| MemOperand(wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget)); |
| // We do the call without a signature check here, since the wrapper loaded |
| // the signature from the same trusted object as the call target to set up |
| // the stack layout. We could add a signature hash and pass it through to |
| // verify it here, but an attacker that could corrupt the signature could |
| // also corrupt that signature hash (which is outside of the sandbox). |
| __ CallWasmCodePointerNoSignatureCheck(call_target); |
| } |
| |
| regs.ResetExcept(); |
| // The wrapper_buffer has to be in a2 as the correct parameter register. |
| regs.Reserve(kReturnRegister0, kReturnRegister1); |
| ASSIGN_PINNED(wrapper_buffer, a2); |
| { |
| DEFINE_SCOPED(thread_in_wasm_flag_addr); |
| __ Ld_d(thread_in_wasm_flag_addr, |
| MemOperand(kRootRegister, |
| Isolate::thread_in_wasm_flag_address_offset())); |
| __ St_w(zero_reg, MemOperand(thread_in_wasm_flag_addr, 0)); |
| } |
| |
| __ Ld_d(wrapper_buffer, |
| MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset)); |
| |
| __ Fst_d(wasm::kFpReturnRegisters[0], |
| MemOperand( |
| wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1)); |
| __ Fst_d(wasm::kFpReturnRegisters[1], |
| MemOperand( |
| wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2)); |
| __ St_d(wasm::kGpReturnRegisters[0], |
| MemOperand( |
| wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1)); |
| __ St_d(wasm::kGpReturnRegisters[1], |
| MemOperand( |
| wrapper_buffer, |
| JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2)); |
| |
| // Call the return value builtin with |
| // a0: wasm instance. |
| // a1: the result JSArray for multi-return. |
| // a2: pointer to the byte buffer which contains all parameters. |
| if (stack_switch) { |
| __ Ld_d(a1, MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset)); |
| __ Ld_d(a0, MemOperand(fp, StackSwitchFrameConstants::kImplicitArgOffset)); |
| } else { |
| __ Ld_d( |
| a1, |
| MemOperand(fp, JSToWasmWrapperFrameConstants::kResultArrayParamOffset)); |
| __ Ld_d(a0, |
| MemOperand(fp, JSToWasmWrapperFrameConstants::kImplicitArgOffset)); |
| } |
| |
| Register scratch = a3; |
| GetContextFromImplicitArg(masm, a0, scratch); |
| __ Call(BUILTIN_CODE(masm->isolate(), JSToWasmHandleReturns), |
| RelocInfo::CODE_TARGET); |
| |
| Label return_promise; |
| if (stack_switch) { |
| SwitchBackAndReturnPromise(masm, regs, mode, &return_promise); |
| } |
| __ bind(&suspend); |
| |
| __ LeaveFrame(stack_switch ? StackFrame::STACK_SWITCH |
| : StackFrame::JS_TO_WASM); |
| // Despite returning to the different location for regular and stack switching |
| // versions, incoming argument count matches both cases: |
| // instance and result array without suspend or |
| // or promise resolve/reject params for callback. |
| __ Add_d(sp, sp, Operand(2 * kSystemPointerSize)); |
| __ Ret(); |
| |
| // Catch handler for the stack-switching wrapper: reject the promise with the |
| // thrown exception. |
| if (mode == wasm::kPromise) { |
| GenerateExceptionHandlingLandingPad(masm, regs, &return_promise); |
| } |
| } |
| } // namespace |
| |
| void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { |
| JSToWasmWrapperHelper(masm, wasm::kNoPromise); |
| } |
| |
| void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) { |
| JSToWasmWrapperHelper(masm, wasm::kPromise); |
| } |
| |
| void Builtins::Generate_JSToWasmStressSwitchStacksAsm(MacroAssembler* masm) { |
| JSToWasmWrapperHelper(masm, wasm::kStressSwitch); |
| } |
| |
| namespace { |
| |
| static constexpr Register kOldSPRegister = s3; |
| static constexpr Register kSwitchFlagRegister = s4; |
| |
| void SwitchToTheCentralStackIfNeeded(MacroAssembler* masm, Register argc_input, |
| Register target_input, |
| Register argv_input) { |
| using ER = ExternalReference; |
| |
| __ mov(kSwitchFlagRegister, zero_reg); |
| __ mov(kOldSPRegister, sp); |
| |
| // Using a2-a4 as temporary registers, because they will be rewritten |
| // before exiting to native code anyway. |
| |
| ER on_central_stack_flag_loc = ER::Create( |
| IsolateAddressId::kIsOnCentralStackFlagAddress, masm->isolate()); |
| const Register& on_central_stack_flag = a2; |
| __ li(on_central_stack_flag, on_central_stack_flag_loc); |
| __ Ld_b(on_central_stack_flag, MemOperand(on_central_stack_flag, 0)); |
| |
| Label do_not_need_to_switch; |
| __ Branch(&do_not_need_to_switch, ne, on_central_stack_flag, |
| Operand(zero_reg)); |
| |
| // Switch to central stack. |
| Register central_stack_sp = a4; |
| DCHECK(!AreAliased(central_stack_sp, argc_input, argv_input, target_input)); |
| { |
| __ Push(argc_input, target_input, argv_input); |
| __ PrepareCallCFunction(2, a0); |
| __ li(kCArgRegs[0], ER::isolate_address(masm->isolate())); |
| __ mov(kCArgRegs[1], kOldSPRegister); |
| __ CallCFunction(ER::wasm_switch_to_the_central_stack(), 2, |
| SetIsolateDataSlots::kNo); |
| __ mov(central_stack_sp, kReturnRegister0); |
| __ Pop(argc_input, target_input, argv_input); |
| } |
| |
| static constexpr int kReturnAddressSlotOffset = 1 * kSystemPointerSize; |
| static constexpr int kPadding = 1 * kSystemPointerSize; |
| __ Sub_d(sp, central_stack_sp, Operand(kReturnAddressSlotOffset + kPadding)); |
| __ li(kSwitchFlagRegister, 1); |
| |
| // Update the sp saved in the frame. |
| // It will be used to calculate the callee pc during GC. |
| // The pc is going to be on the new stack segment, so rewrite it here. |
| __ Add_d(central_stack_sp, sp, Operand(kSystemPointerSize)); |
| __ St_d(central_stack_sp, MemOperand(fp, ExitFrameConstants::kSPOffset)); |
| |
| __ bind(&do_not_need_to_switch); |
| } |
| |
| void SwitchFromTheCentralStackIfNeeded(MacroAssembler* masm) { |
| using ER = ExternalReference; |
| |
| Label no_stack_change; |
| |
| __ Branch(&no_stack_change, eq, kSwitchFlagRegister, Operand(zero_reg)); |
| |
| { |
| __ Push(kReturnRegister0, kReturnRegister1); |
| __ PrepareCallCFunction(1, a0); |
| __ li(kCArgRegs[0], ER::isolate_address(masm->isolate())); |
| __ CallCFunction(ER::wasm_switch_from_the_central_stack(), 1, |
| SetIsolateDataSlots::kNo); |
| __ Pop(kReturnRegister0, kReturnRegister1); |
| } |
| |
| __ mov(sp, kOldSPRegister); |
| |
| __ bind(&no_stack_change); |
| } |
| |
| } // namespace |
| |
| #endif // V8_ENABLE_WEBASSEMBLY |
| |
| void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size, |
| ArgvMode argv_mode, bool builtin_exit_frame, |
| bool switch_to_central_stack) { |
| // Called from JavaScript; parameters are on stack as if calling JS function |
| // a0: number of arguments including receiver |
| // a1: pointer to C++ function |
| // fp: frame pointer (restored after C call) |
| // sp: stack pointer (restored as callee's sp after C call) |
| // cp: current context (C callee-saved) |
| |
| // If argv_mode == ArgvMode::kRegister: |
| // a2: pointer to the first argument |
| |
| using ER = ExternalReference; |
| |
| // Move input arguments to more convenient registers. |
| static constexpr Register argc_input = a0; |
| static constexpr Register target_fun = s1; // C callee-saved |
| static constexpr Register argv = a1; |
| static constexpr Register scratch = a3; |
| static constexpr Register argc_sav = s0; // C callee-saved |
| |
| __ mov(target_fun, argv); |
| |
| if (argv_mode == ArgvMode::kRegister) { |
| // Move argv into the correct register. |
| __ mov(argv, a2); |
| } else { |
| // Compute the argv pointer in a callee-saved register. |
| __ Alsl_d(argv, argc_input, sp, kSystemPointerSizeLog2); |
| __ Sub_d(argv, argv, kSystemPointerSize); |
| } |
| |
| // Enter the exit frame that transitions from JavaScript to C++. |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterExitFrame( |
| scratch, 0, |
| builtin_exit_frame ? StackFrame::BUILTIN_EXIT : StackFrame::EXIT); |
| |
| // Store a copy of argc in callee-saved registers for later. |
| __ mov(argc_sav, argc_input); |
| |
| // a0: number of arguments including receiver |
| // s0: number of arguments including receiver (C callee-saved) |
| // a1: pointer to first argument |
| // s1: pointer to builtin function (C callee-saved) |
| |
| // We are calling compiled C/C++ code. a0 and a1 hold our two arguments. We |
| // also need to reserve the 4 argument slots on the stack. |
| |
| __ AssertStackIsAligned(); |
| |
| #if V8_ENABLE_WEBASSEMBLY |
| if (switch_to_central_stack) { |
| SwitchToTheCentralStackIfNeeded(masm, argc_input, target_fun, argv); |
| } |
| #endif // V8_ENABLE_WEBASSEMBLY |
| |
| // Call C built-in. |
| // a0 = argc, a1 = argv, a2 = isolate, s1 = target_fun |
| DCHECK_EQ(kCArgRegs[0], argc_input); |
| DCHECK_EQ(kCArgRegs[1], argv); |
| __ li(kCArgRegs[2], ER::isolate_address()); |
| |
| __ StoreReturnAddressAndCall(target_fun); |
| |
| #if V8_ENABLE_WEBASSEMBLY |
| if (switch_to_central_stack) { |
| SwitchFromTheCentralStackIfNeeded(masm); |
| } |
| #endif // V8_ENABLE_WEBASSEMBLY |
| |
| // Result returned in a0 or a1:a0 - do not destroy these registers! |
| |
| // Check result for exception sentinel. |
| Label exception_returned; |
| // The returned value may be a trusted object, living outside of the main |
| // pointer compression cage, so we need to use full pointer comparison here. |
| __ CompareRootAndBranch(a0, RootIndex::kException, eq, &exception_returned, |
| ComparisonMode::kFullPointer); |
| |
| // Check that there is no exception, otherwise we |
| // should have returned the exception sentinel. |
| if (v8_flags.debug_code) { |
| Label okay; |
| ER exception_address = |
| ER::Create(IsolateAddressId::kExceptionAddress, masm->isolate()); |
| __ Ld_d(scratch, __ ExternalReferenceAsOperand(exception_address, no_reg)); |
| // Cannot use check here as it attempts to generate call into runtime. |
| __ Branch(&okay, eq, scratch, RootIndex::kTheHoleValue); |
| __ stop(); |
| __ bind(&okay); |
| } |
| |
| // Exit C frame and return. |
| // a0:a1: result |
| // sp: stack pointer |
| // fp: frame pointer |
| // s0: still holds argc (C caller-saved). |
| __ LeaveExitFrame(scratch); |
| if (argv_mode == ArgvMode::kStack) { |
| DCHECK(!AreAliased(scratch, argc_sav)); |
| __ Alsl_d(sp, argc_sav, sp, kSystemPointerSizeLog2); |
| } |
| |
| __ Ret(); |
| |
| // Handling of exception. |
| __ bind(&exception_returned); |
| |
| ER pending_handler_context_address = ER::Create( |
| IsolateAddressId::kPendingHandlerContextAddress, masm->isolate()); |
| ER pending_handler_entrypoint_address = ER::Create( |
| IsolateAddressId::kPendingHandlerEntrypointAddress, masm->isolate()); |
| ER pending_handler_fp_address = |
| ER::Create(IsolateAddressId::kPendingHandlerFPAddress, masm->isolate()); |
| ER pending_handler_sp_address = |
| ER::Create(IsolateAddressId::kPendingHandlerSPAddress, masm->isolate()); |
| |
| // Ask the runtime for help to determine the handler. This will set a0 to |
| // contain the current exception, don't clobber it. |
| { |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ PrepareCallCFunction(3, 0, a0); |
| __ mov(kCArgRegs[0], zero_reg); |
| __ mov(kCArgRegs[1], zero_reg); |
| __ li(kCArgRegs[2], ER::isolate_address()); |
| __ CallCFunction(ER::Create(Runtime::kUnwindAndFindExceptionHandler), 3, |
| SetIsolateDataSlots::kNo); |
| } |
| |
| // Retrieve the handler context, SP and FP. |
| __ li(cp, pending_handler_context_address); |
| __ Ld_d(cp, MemOperand(cp, 0)); |
| __ li(sp, pending_handler_sp_address); |
| __ Ld_d(sp, MemOperand(sp, 0)); |
| __ li(fp, pending_handler_fp_address); |
| __ Ld_d(fp, MemOperand(fp, 0)); |
| |
| // If the handler is a JS frame, restore the context to the frame. Note that |
| // the context will be set to (cp == 0) for non-JS frames. |
| Label zero; |
| __ Branch(&zero, eq, cp, Operand(zero_reg)); |
| __ St_d(cp, MemOperand(fp, StandardFrameConstants::kContextOffset)); |
| __ bind(&zero); |
| |
| // Clear c_entry_fp, like we do in `LeaveExitFrame`. |
| ER c_entry_fp_address = |
| ER::Create(IsolateAddressId::kCEntryFPAddress, masm->isolate()); |
| __ St_d(zero_reg, __ ExternalReferenceAsOperand(c_entry_fp_address, no_reg)); |
| |
| // Compute the handler entry address and jump to it. |
| __ Ld_d(scratch, __ ExternalReferenceAsOperand( |
| pending_handler_entrypoint_address, no_reg)); |
| __ Jump(scratch); |
| } |
| |
| #if V8_ENABLE_WEBASSEMBLY |
| void Builtins::Generate_WasmHandleStackOverflow(MacroAssembler* masm) { |
| using ER = ExternalReference; |
| Register frame_base = WasmHandleStackOverflowDescriptor::FrameBaseRegister(); |
| Register gap = WasmHandleStackOverflowDescriptor::GapRegister(); |
| { |
| DCHECK_NE(kCArgRegs[1], frame_base); |
| DCHECK_NE(kCArgRegs[3], frame_base); |
| __ mov(kCArgRegs[3], gap); |
| __ mov(kCArgRegs[1], sp); |
| __ sub_d(kCArgRegs[2], frame_base, kCArgRegs[1]); |
| __ mov(kCArgRegs[4], fp); |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(kCArgRegs[3]); |
| __ li(kCArgRegs[0], ER::isolate_address()); |
| __ PrepareCallCFunction(5, kScratchReg); |
| __ CallCFunction(ER::wasm_grow_stack(), 5); |
| __ Pop(gap); |
| DCHECK_NE(kReturnRegister0, gap); |
| } |
| Label call_runtime; |
| // wasm_grow_stack returns zero if it cannot grow a stack. |
| __ BranchShort(&call_runtime, eq, kReturnRegister0, Operand(zero_reg)); |
| { |
| UseScratchRegisterScope temps(masm); |
| Register new_fp = temps.Acquire(); |
| // Calculate old FP - SP offset to adjust FP accordingly to new SP. |
| __ sub_d(new_fp, fp, sp); |
| __ add_d(new_fp, kReturnRegister0, new_fp); |
| __ mov(fp, new_fp); |
| } |
| __ mov(sp, kReturnRegister0); |
| { |
| UseScratchRegisterScope temps(masm); |
| Register scratch = temps.Acquire(); |
| __ li(scratch, StackFrame::TypeToMarker(StackFrame::WASM_SEGMENT_START)); |
| __ St_d(scratch, MemOperand(fp, TypedFrameConstants::kFrameTypeOffset)); |
| } |
| __ Ret(); |
| |
| __ bind(&call_runtime); |
| // If wasm_grow_stack returns zero interruption or stack overflow |
| // should be handled by runtime call. |
| { |
| __ Ld_d(kWasmImplicitArgRegister, |
| MemOperand(fp, WasmFrameConstants::kWasmInstanceDataOffset)); |
| __ LoadTaggedField( |
| cp, FieldMemOperand(kWasmImplicitArgRegister, |
| WasmTrustedInstanceData::kNativeContextOffset)); |
| FrameScope scope(masm, StackFrame::MANUAL); |
| __ EnterFrame(StackFrame::INTERNAL); |
| __ SmiTag(gap); |
| __ Push(gap); |
| __ CallRuntime(Runtime::kWasmStackGuard); |
| __ LeaveFrame(StackFrame::INTERNAL); |
| __ Ret(); |
| } |
| } |
| #endif // V8_ENABLE_WEBASSEMBLY |
| |
| void Builtins::Generate_DoubleToI(MacroAssembler* masm) { |
| Label done; |
| Register result_reg = t0; |
| |
| Register scratch = GetRegisterThatIsNotOneOf(result_reg); |
| Register scratch2 = GetRegisterThatIsNotOneOf(result_reg, scratch); |
| Register scratch3 = GetRegisterThatIsNotOneOf(result_reg, scratch, scratch2); |
| DoubleRegister double_scratch = kScratchDoubleReg; |
| |
| // Account for saved regs. |
| const int kArgumentOffset = 4 * kSystemPointerSize; |
| |
| __ Push(result_reg); |
| __ Push(scratch, scratch2, scratch3); |
| |
| // Load double input. |
| __ Fld_d(double_scratch, MemOperand(sp, kArgumentOffset)); |
| |
| // Try a conversion to a signed integer. |
| __ TryInlineTruncateDoubleToI(result_reg, double_scratch, &done); |
| |
| // Load the double value and perform a manual truncation. |
| Register input_high = scratch2; |
| Register input_low = scratch3; |
| |
| // TryInlineTruncateDoubleToI destory kScratchDoubleReg, so reload it. |
| __ Ld_d(result_reg, MemOperand(sp, kArgumentOffset)); |
| |
| // Extract the biased exponent in result. |
| __ bstrpick_d(input_high, result_reg, |
| HeapNumber::kMantissaBits + HeapNumber::kExponentBits - 1, |
| HeapNumber::kMantissaBits); |
| |
| __ Sub_d(scratch, input_high, |
| HeapNumber::kExponentBias + HeapNumber::kMantissaBits + 32); |
| Label not_zero; |
| __ Branch(¬_zero, lt, scratch, Operand(zero_reg)); |
| __ mov(result_reg, zero_reg); |
| __ Branch(&done); |
| __ bind(¬_zero); |
| |
| // Isolate the mantissa bits, and set the implicit '1'. |
| __ bstrpick_d(input_low, result_reg, HeapNumber::kMantissaBits - 1, 0); |
| __ Or(input_low, input_low, Operand(1ULL << HeapNumber::kMantissaBits)); |
| |
| Label lessthan_zero_reg; |
| __ Branch(&lessthan_zero_reg, ge, result_reg, Operand(zero_reg)); |
| __ Sub_d(input_low, zero_reg, Operand(input_low)); |
| __ bind(&lessthan_zero_reg); |
| |
| // Shift the mantissa bits in the correct place. We know that we have to shift |
| // it left here, because exponent >= 63 >= kMantissaBits. |
| __ Sub_d(input_high, input_high, |
| Operand(HeapNumber::kExponentBias + HeapNumber::kMantissaBits)); |
| __ sll_w(result_reg, input_low, input_high); |
| |
| __ bind(&done); |
| |
| __ St_d(result_reg, MemOperand(sp, kArgumentOffset)); |
| __ Pop(scratch, scratch2, scratch3); |
| __ Pop(result_reg); |
| __ Ret(); |
| } |
| |
| void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm, |
| CallApiCallbackMode mode) { |
| // ----------- S t a t e ------------- |
| // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes: |
| // -- a1 : api function address |
| // Both modes: |
| // -- a2 : arguments count (not including the receiver) |
| // -- a3 : FunctionTemplateInfo |
| // -- cp : context |
| // -- sp[0] : receiver |
| // -- sp[8] : first argument |
| // -- ... |
| // -- sp[(argc) * 8] : last argument |
| // ----------------------------------- |
| |
| Register function_callback_info_arg = kCArgRegs[0]; |
| |
| Register api_function_address = no_reg; |
| Register argc = no_reg; |
| Register func_templ = no_reg; |
| Register topmost_script_having_context = no_reg; |
| Register scratch = t0; |
| |
| switch (mode) { |
| case CallApiCallbackMode::kGeneric: |
| argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister(); |
| topmost_script_having_context = CallApiCallbackGenericDescriptor:: |
| TopmostScriptHavingContextRegister(); |
| func_templ = |
| CallApiCallbackGenericDescriptor::FunctionTemplateInfoRegister(); |
| break; |
| |
| case CallApiCallbackMode::kOptimizedNoProfiling: |
| case CallApiCallbackMode::kOptimized: |
| // Caller context is always equal to current context because we don't |
| // inline Api calls cross-context. |
| topmost_script_having_context = kContextRegister; |
| api_function_address = |
| CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister(); |
| argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister(); |
| func_templ = |
| CallApiCallbackOptimizedDescriptor::FunctionTemplateInfoRegister(); |
| break; |
| } |
| DCHECK(!AreAliased(api_function_address, topmost_script_having_context, argc, |
| func_templ, scratch)); |
| |
| using FCA = FunctionCallbackArguments; |
| using ER = ExternalReference; |
| using FC = ApiCallbackExitFrameConstants; |
| |
| static_assert(FCA::kArgsLength == 6); |
| static_assert(FCA::kNewTargetIndex == 5); |
| static_assert(FCA::kTargetIndex == 4); |
| static_assert(FCA::kReturnValueIndex == 3); |
| static_assert(FCA::kContextIndex == 2); |
| static_assert(FCA::kIsolateIndex == 1); |
| static_assert(FCA::kUnusedIndex == 0); |
| |
| // Set up FunctionCallbackInfo's implicit_args on the stack as follows: |
| // |
| // Target state: |
| // sp[0 * kSystemPointerSize]: kUnused <= FCA::implicit_args_ |
| // sp[1 * kSystemPointerSize]: kIsolate |
| // sp[2 * kSystemPointerSize]: kContext |
| // sp[3 * kSystemPointerSize]: undefined (kReturnValue) |
| // sp[4 * kSystemPointerSize]: kTarget |
| // sp[5 * kSystemPointerSize]: undefined (kNewTarget) |
| // Existing state: |
| // sp[6 * kSystemPointerSize]: <= FCA:::values_ |
| |
| __ StoreRootRelative(IsolateData::topmost_script_having_context_offset(), |
| topmost_script_having_context); |
| if (mode == CallApiCallbackMode::kGeneric) { |
| api_function_address = ReassignRegister(topmost_script_having_context); |
| } |
| |
| // Reserve space on the stack. |
| __ Sub_d(sp, sp, Operand(FCA::kArgsLength * kSystemPointerSize)); |
| |
| // kIsolate. |
| __ li(scratch, ER::isolate_address()); |
| __ St_d(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize)); |
| |
| // kContext. |
| __ St_d(cp, MemOperand(sp, FCA::kContextIndex * kSystemPointerSize)); |
| |
| // kReturnValue. |
| __ LoadRoot(scratch, RootIndex::kUndefinedValue); |
| __ St_d(scratch, MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize)); |
| |
| // kTarget. |
| __ St_d(func_templ, MemOperand(sp, FCA::kTargetIndex * kSystemPointerSize)); |
| |
| // kNewTarget. |
| __ St_d(scratch, MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize)); |
| |
| // kUnused. |
| __ St_d(scratch, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize)); |
| |
| FrameScope frame_scope(masm, StackFrame::MANUAL); |
| if (mode == CallApiCallbackMode::kGeneric) { |
| __ LoadExternalPointerField( |
| api_function_address, |
| FieldMemOperand(func_templ, |
| FunctionTemplateInfo::kMaybeRedirectedCallbackOffset), |
| kFunctionTemplateInfoCallbackTag); |
| } |
| |
| __ EnterExitFrame(scratch, FC::getExtraSlotsCountFrom<ExitFrameConstants>(), |
| StackFrame::API_CALLBACK_EXIT); |
| |
| MemOperand argc_operand = MemOperand(fp, FC::kFCIArgcOffset); |
| { |
| ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo"); |
| // FunctionCallbackInfo::length_. |
| // TODO(ishell): pass JSParameterCount(argc) to simplify things on the |
| // caller end. |
| __ St_d(argc, argc_operand); |
| |
| // FunctionCallbackInfo::implicit_args_. |
| __ Add_d(scratch, fp, Operand(FC::kImplicitArgsArrayOffset)); |
| __ St_d(scratch, MemOperand(fp, FC::kFCIImplicitArgsOffset)); |
| |
| // FunctionCallbackInfo::values_ (points at JS arguments on the stack). |
| __ Add_d(scratch, fp, Operand(FC::kFirstArgumentOffset)); |
| __ St_d(scratch, MemOperand(fp, FC::kFCIValuesOffset)); |
| } |
| |
| __ RecordComment("v8::FunctionCallback's argument."); |
| // function_callback_info_arg = v8::FunctionCallbackInfo& |
| __ Add_d(function_callback_info_arg, fp, |
| Operand(FC::kFunctionCallbackInfoOffset)); |
| |
| DCHECK( |
| !AreAliased(api_function_address, scratch, function_callback_info_arg)); |
| |
| ExternalReference thunk_ref = ER::invoke_function_callback(mode); |
| Register no_thunk_arg = no_reg; |
| |
| MemOperand return_value_operand = MemOperand(fp, FC::kReturnValueOffset); |
| static constexpr int kSlotsToDropOnReturn = |
| FC::kFunctionCallbackInfoArgsLength + kJSArgcReceiverSlots; |
| |
| const bool with_profiling = |
| mode != CallApiCallbackMode::kOptimizedNoProfiling; |
| CallApiFunctionAndReturn(masm, with_profiling, api_function_address, |
| thunk_ref, no_thunk_arg, kSlotsToDropOnReturn, |
| &argc_operand, return_value_operand); |
| } |
| |
| void Builtins::Generate_CallApiGetter(MacroAssembler* masm) { |
| // ----------- S t a t e ------------- |
| // -- cp : context |
| // -- a1 : receiver |
| // -- a3 : accessor info |
| // -- a0 : holder |
| // ----------------------------------- |
| |
| Register name_arg = kCArgRegs[0]; |
| Register property_callback_info_arg = kCArgRegs[1]; |
| |
| Register api_function_address = a2; |
| Register receiver = ApiGetterDescriptor::ReceiverRegister(); |
| Register holder = ApiGetterDescriptor::HolderRegister(); |
| Register callback = ApiGetterDescriptor::CallbackRegister(); |
| Register scratch = a4; |
| Register undef = a5; |
| Register scratch2 = a6; |
| |
| DCHECK(!AreAliased(receiver, holder, callback, scratch, undef, scratch2)); |
| |
| // Build v8::PropertyCallbackInfo::args_ array on the stack and push property |
| // name below the exit frame to make GC aware of them. |
| using PCA = PropertyCallbackArguments; |
| using ER = ExternalReference; |
| using FC = ApiAccessorExitFrameConstants; |
| |
| static_assert(PCA::kPropertyKeyIndex == 0); |
| static_assert(PCA::kShouldThrowOnErrorIndex == 1); |
| static_assert(PCA::kHolderIndex == 2); |
| static_assert(PCA::kIsolateIndex == 3); |
| static_assert(PCA::kHolderV2Index == 4); |
| static_assert(PCA::kReturnValueIndex == 5); |
| static_assert(PCA::kDataIndex == 6); |
| static_assert(PCA::kThisIndex == 7); |
| static_assert(PCA::kArgsLength == 8); |
| |
| // Set up v8::PropertyCallbackInfo's (PCI) args_ on the stack as follows: |
| // Target state: |
| // sp[0 * kSystemPointerSize]: name <= PCI:args_ |
| // sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex |
| // sp[2 * kSystemPointerSize]: kHolderIndex |
| // sp[3 * kSystemPointerSize]: kIsolateIndex |
| // sp[4 * kSystemPointerSize]: kHolderV2Index |
| // sp[5 * kSystemPointerSize]: kReturnValueIndex |
| // sp[6 * kSystemPointerSize]: kDataIndex |
| // sp[7 * kSystemPointerSize]: kThisIndex / receiver |
| |
| __ LoadTaggedField(scratch, |
| FieldMemOperand(callback, AccessorInfo::kDataOffset)); |
| __ LoadRoot(undef, RootIndex::kUndefinedValue); |
| __ li(scratch2, ER::isolate_address()); |
| Register holderV2 = zero_reg; |
| __ Push(receiver, scratch, // kThisIndex, kDataIndex |
| undef, holderV2); // kReturnValueIndex, kHolderV2Index |
| __ Push(scratch2, holder); // kIsolateIndex, kHolderIndex |
| |
| // |name_arg| clashes with |holder|, so we need to push holder first. |
| __ LoadTaggedField(name_arg, |
| FieldMemOperand(callback, AccessorInfo::kNameOffset)); |
| static_assert(kDontThrow == 0); |
| Register should_throw_on_error = |
| zero_reg; // should_throw_on_error -> kDontThrow |
| __ Push(should_throw_on_error, name_arg); |
| |
| __ RecordComment("Load api_function_address"); |
| __ LoadExternalPointerField( |
| api_function_address, |
| FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset), |
| kAccessorInfoGetterTag); |
| |
| FrameScope frame_scope(masm, StackFrame::MANUAL); |
| __ EnterExitFrame(scratch, FC::getExtraSlotsCountFrom<ExitFrameConstants>(), |
| StackFrame::API_ACCESSOR_EXIT); |
| |
| __ RecordComment("Create v8::PropertyCallbackInfo object on the stack."); |
| // property_callback_info_arg = v8::PropertyCallbackInfo& |
| __ Add_d(property_callback_info_arg, fp, Operand(FC::kArgsArrayOffset)); |
| |
| DCHECK(!AreAliased(api_function_address, property_callback_info_arg, name_arg, |
| callback, scratch, scratch2)); |
| |
| #ifdef V8_ENABLE_DIRECT_HANDLE |
| // name_arg = Local<Name>(name), name value was pushed to GC-ed stack space. |
| // |name_arg| is already initialized above. |
| #else |
| // name_arg = Local<Name>(&name), which is &args_array[kPropertyKeyIndex]. |
| static_assert(PCA::kPropertyKeyIndex == 0); |
| __ mov(name_arg, property_callback_info_arg); |
| #endif |
| |
| ER thunk_ref = ER::invoke_accessor_getter_callback(); |
| // Pass AccessorInfo to thunk wrapper in case profiler or side-effect |
| // checking is enabled. |
| Register thunk_arg = callback; |
| |
| MemOperand return_value_operand = MemOperand(fp, FC::kReturnValueOffset); |
| static constexpr int kSlotsToDropOnReturn = |
| FC::kPropertyCallbackInfoArgsLength; |
| MemOperand* const kUseStackSpaceConstant = nullptr; |
| |
| const bool with_profiling = true; |
| CallApiFunctionAndReturn(masm, with_profiling, api_function_address, |
| thunk_ref, thunk_arg, kSlotsToDropOnReturn, |
| kUseStackSpaceConstant, return_value_operand); |
| } |
| |
| void Builtins::Generate_DirectCEntry(MacroAssembler* masm) { |
| // The sole purpose of DirectCEntry is for movable callers (e.g. any general |
| // purpose InstructionStream object) to be able to call into C functions that |
| // may trigger GC and thus move the caller. |
| // |
| // DirectCEntry places the return address on the stack (updated by the GC), |
| // making the call GC safe. The irregexp backend relies on this. |
| |
| __ St_d(ra, MemOperand(sp, 0)); // Store the return address. |
| __ Call(t5); // Call the C++ function. |
| __ Ld_d(ra, MemOperand(sp, 0)); // Return to calling code. |
| |
| // TODO(LOONG_dev): LOONG64 Check this assert. |
| if (v8_flags.debug_code && v8_flags.enable_slow_asserts) { |
| // In case of an error the return address may point to a memory area |
| // filled with kZapValue by the GC. Dereference the address and check for |
| // this. |
| __ Ld_d(a4, MemOperand(ra, 0)); |
| __ Assert(ne, AbortReason::kReceivedInvalidReturnAddress, a4, |
| Operand(reinterpret_cast<uint64_t>(kZapValue))); |
| } |
| |
| __ Jump(ra); |
| } |
| |
| namespace { |
| |
| // This code tries to be close to ia32 code so that any changes can be |
| // easily ported. |
| void Generate_DeoptimizationEntry(MacroAssembler* masm, |
| DeoptimizeKind deopt_kind) { |
| Isolate* isolate = masm->isolate(); |
| |
| // Unlike on ARM we don't save all the registers, just the useful ones. |
| // For the rest, there are gaps on the stack, so the offsets remain the same. |
| const int kNumberOfRegisters = Register::kNumRegisters; |
| |
| RegList restored_regs = kJSCallerSaved | kCalleeSaved; |
| RegList saved_regs = restored_regs | sp | ra; |
| |
| const int kSimd128RegsSize = kSimd128Size * Simd128Register::kNumRegisters; |
| |
| // Save all allocatable simd128 / double registers before messing with them. |
| // TODO(loong64): Add simd support here. |
| __ Sub_d(sp, sp, Operand(kSimd128RegsSize)); |
| const RegisterConfiguration* config = RegisterConfiguration::Default(); |
| for (int i = 0; i < config->num_allocatable_double_registers(); ++i) { |
| int code = config->GetAllocatableDoubleCode(i); |
| const DoubleRegister fpu_reg = DoubleRegister::from_code(code); |
| int offset = code * kSimd128Size; |
| __ Fst_d(fpu_reg, MemOperand(sp, offset)); |
| } |
| |
| // Push saved_regs (needed to populate FrameDescription::registers_). |
| // Leave gaps for other registers. |
| __ Sub_d(sp, sp, kNumberOfRegisters * kSystemPointerSize); |
| for (int16_t i = kNumberOfRegisters - 1; i >= 0; i--) { |
| if ((saved_regs.bits() & (1 << i)) != 0) { |
| __ St_d(ToRegister(i), MemOperand(sp, kSystemPointerSize * i)); |
| } |
| } |
| |
| __ li(a2, |
| ExternalReference::Create(IsolateAddressId::kCEntryFPAddress, isolate)); |
| __ St_d(fp, MemOperand(a2, 0)); |
| |
| const int kSavedRegistersAreaSize = |
| (kNumberOfRegisters * kSystemPointerSize) + kSimd128RegsSize; |
| |
| // Get the address of the location in the code object (a2) (return |
| // address for lazy deoptimization) and compute the fp-to-sp delta in |
| // register a3. |
| __ mov(a2, ra); |
| __ Add_d(a3, sp, Operand(kSavedRegistersAreaSize)); |
| |
| __ sub_d(a3, fp, a3); |
| |
| // Allocate a new deoptimizer object. |
| __ PrepareCallCFunction(5, a4); |
| // Pass six arguments, according to n64 ABI. |
| __ mov(a0, zero_reg); |
| Label context_check; |
| __ Ld_d(a1, MemOperand(fp, CommonFrameConstants::kContextOrFrameTypeOffset)); |
| __ JumpIfSmi(a1, &context_check); |
| __ Ld_d(a0, MemOperand(fp, StandardFrameConstants::kFunctionOffset)); |
| __ bind(&context_check); |
| __ li(a1, Operand(static_cast<int>(deopt_kind))); |
| // a2: code address or 0 already loaded. |
| // a3: already has fp-to-sp delta. |
| __ li(a4, ExternalReference::isolate_address()); |
| |
| // Call Deoptimizer::New(). |
| { |
| AllowExternalCallThatCantCauseGC scope(masm); |
| __ CallCFunction(ExternalReference::new_deoptimizer_function(), 5); |
| } |
| |
| // Preserve "deoptimizer" object in register a0 and get the input |
| // frame descriptor pointer to a1 (deoptimizer->input_); |
| // Move deopt-obj to a0 for call to Deoptimizer::ComputeOutputFrames() below. |
| __ Ld_d(a1, MemOperand(a0, Deoptimizer::input_offset())); |
| |
| // Copy core registers into FrameDescription::registers_[kNumRegisters]. |
| DCHECK_EQ(Register::kNumRegisters, kNumberOfRegisters); |
| for (int i = 0; i < kNumberOfRegisters; i++) { |
| int offset = |
| (i * kSystemPointerSize) + FrameDescription::registers_offset(); |
| if ((saved_regs.bits() & (1 << i)) != 0) { |
| __ Ld_d(a2, MemOperand(sp, i * kSystemPointerSize)); |
| __ St_d(a2, MemOperand(a1, offset)); |
| } else if (v8_flags.debug_code) { |
| __ li(a2, Operand(kDebugZapValue)); |
| __ St_d(a2, MemOperand(a1, offset)); |
| } |
| } |
| |
| // Copy simd128 / double registers to the input frame. |
| // TODO(loong64): Add simd support here. |
| int simd128_regs_offset = FrameDescription::simd128_registers_offset(); |
| for (int i = 0; i < config->num_allocatable_simd128_registers(); ++i) { |
| int code = config->GetAllocatableSimd128Code(i); |
| int dst_offset = code * kSimd128Size + simd128_regs_offset; |
| int src_offset = |
| code * kSimd128Size + kNumberOfRegisters * kSystemPointerSize; |
| __ Fld_d(f0, MemOperand(sp, src_offset)); |
| __ Fst_d(f0, MemOperand(a1, dst_offset)); |
| } |
| |
| // Remove the saved registers from the stack. |
| __ Add_d(sp, sp, Operand(kSavedRegistersAreaSize)); |
| |
| // Compute a pointer to the unwinding limit in register a2; that is |
| // the first stack slot not part of the input frame. |
| __ Ld_d(a2, MemOperand(a1, FrameDescription::frame_size_offset())); |
| __ add_d(a2, a2, sp); |
| |
| // Unwind the stack down to - but not including - the unwinding |
| // limit and copy the contents of the activation frame to the input |
| // frame description. |
| __ Add_d(a3, a1, Operand(FrameDescription::frame_content_offset())); |
| Label pop_loop; |
| Label pop_loop_header; |
| __ Branch(&pop_loop_header); |
| __ bind(&pop_loop); |
| __ Pop(a4); |
| __ St_d(a4, MemOperand(a3, 0)); |
| __ addi_d(a3, a3, sizeof(uint64_t)); |
| __ bind(&pop_loop_header); |
| __ BranchShort(&pop_loop, ne, a2, Operand(sp)); |
| // Compute the output frame in the deoptimizer. |
| __ Push(a0); // Preserve deoptimizer object across call. |
| // a0: deoptimizer object; a1: scratch. |
| __ PrepareCallCFunction(1, a1); |
| // Call Deoptimizer::ComputeOutputFrames(). |
| { |
| AllowExternalCallThatCantCauseGC scope(masm); |
| __ CallCFunction(ExternalReference::compute_output_frames_function(), 1); |
| } |
| __ Pop(a0); // Restore deoptimizer object (class Deoptimizer). |
| |
| __ Ld_d(sp, MemOperand(a0, Deoptimizer::caller_frame_top_offset())); |
| |
| // Replace the current (input) frame with the output frames. |
| Label outer_push_loop, inner_push_loop, outer_loop_header, inner_loop_header; |
| // Outer loop state: a4 = current "FrameDescription** output_", |
| // a1 = one past the last FrameDescription**. |
| __ Ld_w(a1, MemOperand(a0, Deoptimizer::output_count_offset())); |
| __ Ld_d(a4, MemOperand(a0, Deoptimizer::output_offset())); // a4 is output_. |
| __ Alsl_d(a1, a1, a4, kSystemPointerSizeLog2); |
| __ Branch(&outer_loop_header); |
| |
| __ bind(&outer_push_loop); |
| Register current_frame = a2; |
| Register frame_size = a3; |
| __ Ld_d(current_frame, MemOperand(a4, 0)); |
| __ Ld_d(frame_size, |
| MemOperand(current_frame, FrameDescription::frame_size_offset())); |
| __ Branch(&inner_loop_header); |
| |
| __ bind(&inner_push_loop); |
| __ Sub_d(frame_size, frame_size, Operand(sizeof(uint64_t))); |
| __ Add_d(a6, current_frame, Operand(frame_size)); |
| __ Ld_d(a7, MemOperand(a6, FrameDescription::frame_content_offset())); |
| __ Push(a7); |
| |
| __ bind(&inner_loop_header); |
| __ BranchShort(&inner_push_loop, ne, frame_size, Operand(zero_reg)); |
| |
| __ Add_d(a4, a4, Operand(kSystemPointerSize)); |
| |
| __ bind(&outer_loop_header); |
| __ BranchShort(&outer_push_loop, lt, a4, Operand(a1)); |
| |
| // TODO(loong64): Add simd support here. |
| for (int i = 0; i < config->num_allocatable_simd128_registers(); ++i) { |
| int code = config->GetAllocatableSimd128Code(i); |
| const DoubleRegister fpu_reg = DoubleRegister::from_code(code); |
| int src_offset = code * kSimd128Size + simd128_regs_offset; |
| __ Fld_d(fpu_reg, MemOperand(current_frame, src_offset)); |
| } |
| |
| // Push pc and continuation from the last output frame. |
| __ Ld_d(a6, MemOperand(current_frame, FrameDescription::pc_offset())); |
| __ Push(a6); |
| __ Ld_d(a6, |
| MemOperand(current_frame, FrameDescription::continuation_offset())); |
| __ Push(a6); |
| |
| // Technically restoring 'at' should work unless zero_reg is also restored |
| // but it's safer to check for this. |
| DCHECK(!(restored_regs.has(t7))); |
| // Restore the registers from the last output frame. |
| __ mov(t7, current_frame); |
| for (int i = kNumberOfRegisters - 1; i >= 0; i--) { |
| int offset = |
| (i * kSystemPointerSize) + FrameDescription::registers_offset(); |
| if ((restored_regs.bits() & (1 << i)) != 0) { |
| __ Ld_d(ToRegister(i), MemOperand(t7, offset)); |
| } |
| } |
| |
| // If the continuation is non-zero (JavaScript), branch to the continuation. |
| // For Wasm just return to the pc from the last output frame in the lr |
| // register. |
| Label end; |
| __ Pop(t7); // Get continuation, leave pc on stack. |
| __ Pop(ra); |
| __ BranchShort(&end, eq, t7, Operand(zero_reg)); |
| __ Jump(t7); |
| __ bind(&end); |
| __ Jump(ra); |
| } |
| |
| } // namespace |
| |
| void Builtins::Generate_DeoptimizationEntry_Eager(MacroAssembler* masm) { |
| Generate_DeoptimizationEntry(masm, DeoptimizeKind::kEager); |
| } |
| |
| void Builtins::Generate_DeoptimizationEntry_Lazy(MacroAssembler* masm) { |
| Generate_DeoptimizationEntry(masm, DeoptimizeKind::kLazy); |
| } |
| |
| // If there is baseline code on the shared function info, converts an |
| // interpreter frame into a baseline frame and continues execution in baseline |
| // code. Otherwise execution continues with bytecode. |
| void Builtins::Generate_InterpreterOnStackReplacement_ToBaseline( |
| MacroAssembler* masm) { |
| Label start; |
| __ bind(&start); |
| |
| // Get function from the frame. |
| Register closure = a1; |
| __ Ld_d(closure, MemOperand(fp, StandardFrameConstants::kFunctionOffset)); |
| |
| // Get the InstructionStream object from the shared function info. |
| Register code_obj = s1; |
| __ LoadTaggedField( |
| code_obj, |
| FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset)); |
| |
| ResetSharedFunctionInfoAge(masm, code_obj); |
| |
| __ LoadTrustedPointerField( |
| code_obj, |
| FieldMemOperand(code_obj, SharedFunctionInfo::kTrustedFunctionDataOffset), |
| kUnknownIndirectPointerTag); |
| |
| // For OSR entry it is safe to assume we always have baseline code. |
| if (v8_flags.debug_code) { |
| __ GetObjectType(code_obj, t2, t2); |
| __ Assert(eq, AbortReason::kExpectedBaselineData, t2, Operand(CODE_TYPE)); |
| AssertCodeIsBaseline(masm, code_obj, t2); |
| } |
| |
| // Load the feedback cell and vector. |
| Register feedback_cell = a2; |
| Register feedback_vector = t5; |
| __ LoadTaggedField(feedback_cell, |
| FieldMemOperand(closure, JSFunction::kFeedbackCellOffset)); |
| __ LoadTaggedField( |
| feedback_vector, |
| FieldMemOperand(feedback_cell, FeedbackCell::kValueOffset)); |
| |
| Label install_baseline_code; |
| // Check if feedback vector is valid. If not, call prepare for baseline to |
| // allocate it. |
| __ JumpIfObjectType(&install_baseline_code, ne, feedback_vector, |
| FEEDBACK_VECTOR_TYPE, t2); |
| |
| // Save BytecodeOffset from the stack frame. |
| __ SmiUntag(kInterpreterBytecodeOffsetRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeOffsetFromFp)); |
| // Replace bytecode offset with feedback cell. |
| static_assert(InterpreterFrameConstants::kBytecodeOffsetFromFp == |
| BaselineFrameConstants::kFeedbackCellFromFp); |
| __ St_d(feedback_cell, |
| MemOperand(fp, BaselineFrameConstants::kFeedbackCellFromFp)); |
| feedback_cell = no_reg; |
| // Update feedback vector cache. |
| static_assert(InterpreterFrameConstants::kFeedbackVectorFromFp == |
| BaselineFrameConstants::kFeedbackVectorFromFp); |
| __ St_d(feedback_vector, |
| MemOperand(fp, InterpreterFrameConstants::kFeedbackVectorFromFp)); |
| feedback_vector = no_reg; |
| |
| // Compute baseline pc for bytecode offset. |
| Register get_baseline_pc = a3; |
| __ li(get_baseline_pc, |
| ExternalReference::baseline_pc_for_next_executed_bytecode()); |
| |
| __ Sub_d(kInterpreterBytecodeOffsetRegister, |
| kInterpreterBytecodeOffsetRegister, |
| (BytecodeArray::kHeaderSize - kHeapObjectTag)); |
| |
| // Get bytecode array from the stack frame. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| // Save the accumulator register, since it's clobbered by the below call. |
| __ Push(kInterpreterAccumulatorRegister); |
| { |
| __ Move(kCArgRegs[0], code_obj); |
| __ Move(kCArgRegs[1], kInterpreterBytecodeOffsetRegister); |
| __ Move(kCArgRegs[2], kInterpreterBytecodeArrayRegister); |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ PrepareCallCFunction(3, 0, a4); |
| __ CallCFunction(get_baseline_pc, 3, 0); |
| } |
| __ LoadCodeInstructionStart(code_obj, code_obj, kJSEntrypointTag); |
| __ Add_d(code_obj, code_obj, kReturnRegister0); |
| __ Pop(kInterpreterAccumulatorRegister); |
| |
| // TODO(liuyu): Remove Ld as arm64 after register reallocation. |
| __ Ld_d(kInterpreterBytecodeArrayRegister, |
| MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp)); |
| Generate_OSREntry(masm, code_obj); |
| __ Trap(); // Unreachable. |
| |
| __ bind(&install_baseline_code); |
| { |
| FrameScope scope(masm, StackFrame::INTERNAL); |
| __ Push(kInterpreterAccumulatorRegister); |
| __ Push(closure); |
| __ CallRuntime(Runtime::kInstallBaselineCode, 1); |
| __ Pop(kInterpreterAccumulatorRegister); |
| } |
| // Retry from the start after installing baseline code. |
| __ Branch(&start); |
| } |
| |
| void Builtins::Generate_RestartFrameTrampoline(MacroAssembler* masm) { |
| // Restart the current frame: |
| // - Look up current function on the frame. |
| // - Leave the frame. |
| // - Restart the frame by calling the function. |
| |
| __ Ld_d(a1, MemOperand(fp, StandardFrameConstants::kFunctionOffset)); |
| __ Ld_d(a0, MemOperand(fp, StandardFrameConstants::kArgCOffset)); |
| __ LeaveFrame(StackFrame::INTERPRETED); |
| |
| // The arguments are already in the stack (including any necessary padding), |
| // we should not try to massage the arguments again. |
| #ifdef V8_ENABLE_LEAPTIERING |
| __ InvokeFunction(a1, a0, InvokeType::kJump, |
| ArgumentAdaptionMode::kDontAdapt); |
| #else |
| __ li(a2, Operand(kDontAdaptArgumentsSentinel)); |
| __ InvokeFunction(a1, a2, a0, InvokeType::kJump); |
| #endif |
| } |
| |
| #undef __ |
| |
| } // namespace internal |
| } // namespace v8 |
| |
| #endif // V8_TARGET_ARCH_LOONG64 |