/* * Copyright (C) 2012 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include "asm_support_arm.S" #include "interpreter/cfi_asm_support.h" #include "arch/quick_alloc_entrypoints.S" #include "arch/quick_field_entrypoints.S" /* Deliver the given exception */ .extern artDeliverExceptionFromCode /* Deliver an exception pending on a thread */ .extern artDeliverPendingException .macro SETUP_SAVE_REFS_AND_ARGS_FRAME rTemp SETUP_SAVE_REFS_AND_ARGS_FRAME_REGISTERS_ONLY LOAD_RUNTIME_INSTANCE \rTemp @ Load Runtime::Current into rTemp. @ Load kSaveRefsAndArgs Method* into rTemp. ldr \rTemp, [\rTemp, #RUNTIME_SAVE_REFS_AND_ARGS_METHOD_OFFSET] str \rTemp, [sp, #0] @ Place Method* at bottom of stack. str sp, [rSELF, #THREAD_TOP_QUICK_FRAME_OFFSET] @ Place sp in Thread::Current()->top_quick_frame. .endm .macro SETUP_SAVE_REFS_AND_ARGS_FRAME_WITH_METHOD_IN_R0 SETUP_SAVE_REFS_AND_ARGS_FRAME_REGISTERS_ONLY str r0, [sp, #0] @ Store ArtMethod* to bottom of stack. str sp, [rSELF, #THREAD_TOP_QUICK_FRAME_OFFSET] @ Place sp in Thread::Current()->top_quick_frame. .endm /* * Macro that sets up the callee save frame to conform with * Runtime::CreateCalleeSaveMethod(kSaveEverything) * when core registers are already saved. */ .macro SETUP_SAVE_EVERYTHING_FRAME_CORE_REGS_SAVED rTemp, runtime_method_offset = RUNTIME_SAVE_EVERYTHING_METHOD_OFFSET @ 14 words of callee saves and args already saved. vpush {d0-d15} @ 32 words, 2 for each of the 16 saved doubles. .cfi_adjust_cfa_offset 128 sub sp, #8 @ 2 words of space, alignment padding and Method* .cfi_adjust_cfa_offset 8 LOAD_RUNTIME_INSTANCE \rTemp @ Load Runtime::Current into rTemp. @ Load kSaveEverything Method* into rTemp. ldr \rTemp, [\rTemp, #\runtime_method_offset] str \rTemp, [sp, #0] @ Place Method* at bottom of stack. str sp, [rSELF, #THREAD_TOP_QUICK_FRAME_OFFSET] @ Place sp in Thread::Current()->top_quick_frame. // Ugly compile-time check, but we only have the preprocessor. #if (FRAME_SIZE_SAVE_EVERYTHING != 56 + 128 + 8) #error "FRAME_SIZE_SAVE_EVERYTHING(ARM) size not as expected." #endif .endm /* * Macro that sets up the callee save frame to conform with * Runtime::CreateCalleeSaveMethod(kSaveEverything) */ .macro SETUP_SAVE_EVERYTHING_FRAME rTemp, runtime_method_offset = RUNTIME_SAVE_EVERYTHING_METHOD_OFFSET push {r0-r12, lr} @ 14 words of callee saves and args. .cfi_adjust_cfa_offset 56 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset r3, 12 .cfi_rel_offset r4, 16 .cfi_rel_offset r5, 20 .cfi_rel_offset r6, 24 .cfi_rel_offset r7, 28 .cfi_rel_offset r8, 32 .cfi_rel_offset r9, 36 .cfi_rel_offset r10, 40 .cfi_rel_offset r11, 44 .cfi_rel_offset ip, 48 .cfi_rel_offset lr, 52 SETUP_SAVE_EVERYTHING_FRAME_CORE_REGS_SAVED \rTemp, \runtime_method_offset .endm .macro RESTORE_SAVE_EVERYTHING_FRAME add sp, #8 @ rewind sp .cfi_adjust_cfa_offset -8 vpop {d0-d15} .cfi_adjust_cfa_offset -128 pop {r0-r12, lr} @ 14 words of callee saves .cfi_restore r0 .cfi_restore r1 .cfi_restore r2 .cfi_restore r3 .cfi_restore r4 .cfi_restore r5 .cfi_restore r6 .cfi_restore r7 .cfi_restore r8 .cfi_restore r9 .cfi_restore r10 .cfi_restore r11 .cfi_restore r12 .cfi_restore lr .cfi_adjust_cfa_offset -56 .endm .macro RESTORE_SAVE_EVERYTHING_FRAME_KEEP_R0 add sp, #8 @ rewind sp .cfi_adjust_cfa_offset -8 vpop {d0-d15} .cfi_adjust_cfa_offset -128 add sp, #4 @ skip r0 .cfi_adjust_cfa_offset -4 .cfi_restore r0 @ debugger can no longer restore caller's r0 pop {r1-r12, lr} @ 13 words of callee saves .cfi_restore r1 .cfi_restore r2 .cfi_restore r3 .cfi_restore r4 .cfi_restore r5 .cfi_restore r6 .cfi_restore r7 .cfi_restore r8 .cfi_restore r9 .cfi_restore r10 .cfi_restore r11 .cfi_restore r12 .cfi_restore lr .cfi_adjust_cfa_offset -52 .endm .macro RETURN_OR_DEOPT_OR_DELIVER_PENDING_EXCEPTION is_ref = 0 // Use R2 to allow returning 64-bit values in R0-R1. ldr r2, [rSELF, # THREAD_EXCEPTION_OFFSET] // Get exception field. CFI_REMEMBER_STATE cbnz r2, 1f DEOPT_OR_RETURN r2, \is_ref // Check if deopt is required 1: CFI_RESTORE_STATE_AND_DEF_CFA sp, 0 DELIVER_PENDING_EXCEPTION .endm .macro RETURN_REF_OR_DEOPT_OR_DELIVER_PENDING_EXCEPTION RETURN_OR_DEOPT_OR_DELIVER_PENDING_EXCEPTION /* is_ref= */ 1 .endm .macro DEOPT_OR_RETURN temp, is_ref = 0 ldr \temp, [rSELF, #THREAD_DEOPT_CHECK_REQUIRED_OFFSET] cbnz \temp, 2f bx lr 2: SETUP_SAVE_EVERYTHING_FRAME \temp mov r2, \is_ref // pass if result is a reference mov r1, r0 // pass the result mov r0, rSELF // Thread::Current bl artDeoptimizeIfNeeded CFI_REMEMBER_STATE cbnz r0, 3f RESTORE_SAVE_EVERYTHING_FRAME REFRESH_MARKING_REGISTER bx lr 3: // Deoptimize CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING bl art_quick_do_long_jump // (Context*) bkpt // Unreached .endm .macro DEOPT_OR_RESTORE_SAVE_EVERYTHING_FRAME_AND_RETURN_R0 temp, is_ref ldr \temp, [rSELF, #THREAD_DEOPT_CHECK_REQUIRED_OFFSET] cbnz \temp, 2f CFI_REMEMBER_STATE RESTORE_SAVE_EVERYTHING_FRAME_KEEP_R0 REFRESH_MARKING_REGISTER bx lr CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING 2: str r0, [sp, SAVE_EVERYTHING_FRAME_R0_OFFSET] // update result in the frame mov r2, \is_ref // pass if result is a reference mov r1, r0 // pass the result mov r0, rSELF // Thread::Current bl artDeoptimizeIfNeeded CFI_REMEMBER_STATE cbnz r0, 3f RESTORE_SAVE_EVERYTHING_FRAME REFRESH_MARKING_REGISTER bx lr 3: // Deoptimize CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING bl art_quick_do_long_jump // (Context*) bkpt // Unreached .endm .macro NO_ARG_RUNTIME_EXCEPTION c_name, cxx_name .extern \cxx_name ENTRY \c_name SETUP_SAVE_ALL_CALLEE_SAVES_FRAME r0 @ save all registers as basis for long jump context mov r0, rSELF @ pass Thread::Current bl \cxx_name @ \cxx_name(Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END \c_name .endm .macro NO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING c_name, cxx_name .extern \cxx_name ENTRY \c_name SETUP_SAVE_EVERYTHING_FRAME r0 @ save all registers as basis for long jump context mov r0, rSELF @ pass Thread::Current bl \cxx_name @ \cxx_name(Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END \c_name .endm .macro ONE_ARG_RUNTIME_EXCEPTION c_name, cxx_name .extern \cxx_name ENTRY \c_name SETUP_SAVE_ALL_CALLEE_SAVES_FRAME r1 @ save all registers as basis for long jump context mov r1, rSELF @ pass Thread::Current bl \cxx_name @ \cxx_name(Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END \c_name .endm .macro TWO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING c_name, cxx_name .extern \cxx_name ENTRY \c_name SETUP_SAVE_EVERYTHING_FRAME r2 @ save all registers as basis for long jump context mov r2, rSELF @ pass Thread::Current bl \cxx_name @ \cxx_name(Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END \c_name .endm .macro RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER CFI_REMEMBER_STATE cbnz r0, 1f @ result non-zero branch over DEOPT_OR_RETURN r1 1: CFI_RESTORE_STATE_AND_DEF_CFA sp, 0 DELIVER_PENDING_EXCEPTION .endm .macro RETURN_OR_DEOPT_IF_RESULT_IS_NON_NULL_OR_DELIVER CFI_REMEMBER_STATE cbz r0, 1f @ result zero branch over DEOPT_OR_RETURN r1, /* is_ref= */ 1 1: CFI_RESTORE_STATE_AND_DEF_CFA sp, 0 DELIVER_PENDING_EXCEPTION .endm // Macros taking opportunity of code similarities for downcalls. // Used for field and allocation entrypoints. .macro N_ARG_DOWNCALL n, name, entrypoint, return .extern \entrypoint ENTRY \name SETUP_SAVE_REFS_ONLY_FRAME r\n @ save callee saves in case of GC mov r\n, rSELF @ pass Thread::Current bl \entrypoint @ (, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER \return END \name .endm .macro ONE_ARG_DOWNCALL name, entrypoint, return N_ARG_DOWNCALL 1, \name, \entrypoint, \return .endm .macro TWO_ARG_DOWNCALL name, entrypoint, return N_ARG_DOWNCALL 2, \name, \entrypoint, \return .endm .macro THREE_ARG_DOWNCALL name, entrypoint, return N_ARG_DOWNCALL 3, \name, \entrypoint, \return .endm // Macro to facilitate adding new allocation entrypoints. .macro FOUR_ARG_DOWNCALL name, entrypoint, return .extern \entrypoint ENTRY \name SETUP_SAVE_REFS_ONLY_FRAME r12 @ save callee saves in case of GC str rSELF, [sp, #-16]! @ expand the frame and pass Thread::Current .cfi_adjust_cfa_offset 16 bl \entrypoint @ (, Thread*) DECREASE_FRAME 16 @ strip the extra frame RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER \return END \name .endm /* * Called by managed code, saves callee saves and then calls artThrowException * that will place a mock Method* at the bottom of the stack. Arg1 holds the exception. */ ONE_ARG_RUNTIME_EXCEPTION art_quick_deliver_exception, artDeliverExceptionFromCode /* * Called by managed code to create and deliver a NullPointerException. */ NO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING art_quick_throw_null_pointer_exception, artThrowNullPointerExceptionFromCode /* * Call installed by a signal handler to create and deliver a NullPointerException. */ .extern art_quick_throw_null_pointer_exception_from_signal ENTRY art_quick_throw_null_pointer_exception_from_signal // The fault handler pushes the gc map address, i.e. "return address", to stack // and passes the fault address in LR. So we need to set up the CFI info accordingly. .cfi_def_cfa_offset __SIZEOF_POINTER__ .cfi_rel_offset lr, 0 push {r0-r12} @ 13 words of callee saves and args; LR already saved. .cfi_adjust_cfa_offset 52 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset r3, 12 .cfi_rel_offset r4, 16 .cfi_rel_offset r5, 20 .cfi_rel_offset r6, 24 .cfi_rel_offset r7, 28 .cfi_rel_offset r8, 32 .cfi_rel_offset r9, 36 .cfi_rel_offset r10, 40 .cfi_rel_offset r11, 44 .cfi_rel_offset ip, 48 @ save all registers as basis for long jump context SETUP_SAVE_EVERYTHING_FRAME_CORE_REGS_SAVED r1 mov r0, lr @ pass the fault address stored in LR by the fault handler. mov r1, rSELF @ pass Thread::Current bl artThrowNullPointerExceptionFromSignal @ (Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_throw_null_pointer_exception_from_signal /* * Called by managed code to create and deliver an ArithmeticException. */ NO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING art_quick_throw_div_zero, artThrowDivZeroFromCode /* * Called by managed code to create and deliver an ArrayIndexOutOfBoundsException. Arg1 holds * index, arg2 holds limit. */ TWO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING art_quick_throw_array_bounds, artThrowArrayBoundsFromCode /* * Called by managed code to create and deliver a StringIndexOutOfBoundsException * as if thrown from a call to String.charAt(). Arg1 holds index, arg2 holds limit. */ TWO_ARG_RUNTIME_EXCEPTION_SAVE_EVERYTHING art_quick_throw_string_bounds, artThrowStringBoundsFromCode /* * Called by managed code to create and deliver a StackOverflowError. */ NO_ARG_RUNTIME_EXCEPTION art_quick_throw_stack_overflow, artThrowStackOverflowFromCode /* * All generated callsites for interface invokes and invocation slow paths will load arguments * as usual - except instead of loading arg0/r0 with the target Method*, arg0/r0 will contain * the method_idx. This wrapper will save arg1-arg3, and call the appropriate C helper. * NOTE: "this" is first visible argument of the target, and so can be found in arg1/r1. * * The helper will attempt to locate the target and return a 64-bit result in r0/r1 consisting * of the target Method* in r0 and method->code_ in r1. * * If unsuccessful, the helper will return null/null. There will bea pending exception in the * thread and we branch to another stub to deliver it. * * On success this wrapper will restore arguments and *jump* to the target, leaving the lr * pointing back to the original caller. * * Clobbers IP (R12). */ .macro INVOKE_TRAMPOLINE_BODY cxx_name .extern \cxx_name SETUP_SAVE_REFS_AND_ARGS_FRAME r2 @ save callee saves in case allocation triggers GC mov r2, rSELF @ pass Thread::Current mov r3, sp bl \cxx_name @ (method_idx, this, Thread*, SP) mov r12, r1 @ save Method*->code_ RESTORE_SAVE_REFS_AND_ARGS_FRAME REFRESH_MARKING_REGISTER cbz r0, 1f @ did we find the target? if not go to exception delivery bx r12 @ tail call to target 1: DELIVER_PENDING_EXCEPTION .endm .macro INVOKE_TRAMPOLINE c_name, cxx_name ENTRY \c_name INVOKE_TRAMPOLINE_BODY \cxx_name END \c_name .endm INVOKE_TRAMPOLINE art_quick_invoke_interface_trampoline_with_access_check, artInvokeInterfaceTrampolineWithAccessCheck INVOKE_TRAMPOLINE art_quick_invoke_static_trampoline_with_access_check, artInvokeStaticTrampolineWithAccessCheck INVOKE_TRAMPOLINE art_quick_invoke_direct_trampoline_with_access_check, artInvokeDirectTrampolineWithAccessCheck INVOKE_TRAMPOLINE art_quick_invoke_super_trampoline_with_access_check, artInvokeSuperTrampolineWithAccessCheck INVOKE_TRAMPOLINE art_quick_invoke_virtual_trampoline_with_access_check, artInvokeVirtualTrampolineWithAccessCheck /* * Quick invocation stub internal. * On entry: * r0 = method pointer * r1 = argument array or null for no argument methods * r2 = size of argument array in bytes * r3 = (managed) thread pointer * [sp] = JValue* result * [sp + 4] = result_in_float * [sp + 8] = core register argument array * [sp + 12] = fp register argument array * +-------------------------+ * | uint32_t* fp_reg_args | * | uint32_t* core_reg_args | * | result_in_float | <- Caller frame * | Jvalue* result | * +-------------------------+ * | lr | * | r11 | * | r9 | * | r4 | <- r11 * +-------------------------+ * | uint32_t out[n-1] | * | : : | Outs * | uint32_t out[0] | * | StackRef | <- SP value=null * +-------------------------+ */ ENTRY art_quick_invoke_stub_internal SPILL_ALL_CALLEE_SAVE_GPRS @ spill regs (9) mov r11, sp @ save the stack pointer .cfi_def_cfa_register r11 mov r9, r3 @ move managed thread pointer into r9 add r4, r2, #4 @ create space for method pointer in frame sub r4, sp, r4 @ reserve & align *stack* to 16 bytes: native calling and r4, #0xFFFFFFF0 @ convention only aligns to 8B, so we have to ensure ART mov sp, r4 @ 16B alignment ourselves. mov r4, r0 @ save method* add r0, sp, #4 @ pass stack pointer + method ptr as dest for memcpy bl memcpy @ memcpy (dest, src, bytes) mov ip, #0 @ set ip to 0 str ip, [sp] @ store null for method* at bottom of frame ldr ip, [r11, #48] @ load fp register argument array pointer vldm ip, {s0-s15} @ copy s0 - s15 ldr ip, [r11, #44] @ load core register argument array pointer mov r0, r4 @ restore method* add ip, ip, #4 @ skip r0 ldm ip, {r1-r3} @ copy r1 - r3 REFRESH_MARKING_REGISTER ldr ip, [r0, #ART_METHOD_QUICK_CODE_OFFSET_32] @ get pointer to the code blx ip @ call the method mov sp, r11 @ restore the stack pointer .cfi_def_cfa_register sp ldr r4, [sp, #40] @ load result_is_float ldr r9, [sp, #36] @ load the result pointer cmp r4, #0 ite eq strdeq r0, [r9] @ store r0/r1 into result pointer vstrne d0, [r9] @ store s0-s1/d0 into result pointer pop {r4, r5, r6, r7, r8, r9, r10, r11, pc} @ restore spill regs END art_quick_invoke_stub_internal /* * On stack replacement stub. * On entry: * r0 = stack to copy * r1 = size of stack * r2 = pc to call * r3 = JValue* result * [sp] = shorty * [sp + 4] = thread */ ENTRY art_quick_osr_stub SPILL_ALL_CALLEE_SAVE_GPRS @ Spill regs (9) vpush {s16-s31} @ Spill fp-regs (16) .cfi_adjust_cfa_offset 64 SAVE_SIZE=(9*4+16*4) mov r11, sp @ Save the stack pointer .cfi_def_cfa r11, SAVE_SIZE @ CFA = r11 + SAVE_SIZE CFI_REMEMBER_STATE mov r10, r1 @ Save size of stack ldr r9, [r11, #(SAVE_SIZE+4)] @ Move managed thread pointer into r9 REFRESH_MARKING_REGISTER mov r6, r2 @ Save the pc to call sub r7, sp, #12 @ Reserve space for stack pointer, @ JValue* result, and ArtMethod* slot. and r7, #0xFFFFFFF0 @ Align stack pointer mov sp, r7 @ Update stack pointer str r11, [sp, #4] @ Save old stack pointer str r3, [sp, #8] @ Save JValue* result mov ip, #0 str ip, [sp] @ Store null for ArtMethod* at bottom of frame // r11 isn't properly spilled in the osr method, so we need use DWARF expression. // NB: the CFI must be before the call since this is the address gdb will lookup. // NB: gdb expects that cfa_expression returns the CFA value (not address to it). .cfi_escape /* CFA = [sp + 4] + SAVE_SIZE */ \ 0x0f, 6, /* DW_CFA_def_cfa_expression(len) */ \ 0x92, 13, 4, /* DW_OP_bregx(reg,offset) */ \ 0x06, /* DW_OP_deref */ \ 0x23, SAVE_SIZE /* DW_OP_plus_uconst(val) */ bl .Losr_entry @ Call the method ldr r10, [sp, #8] @ Restore JValue* result ldr sp, [sp, #4] @ Restore saved stack pointer .cfi_def_cfa sp, SAVE_SIZE @ CFA = sp + SAVE_SIZE strd r0, [r10] @ Store r0/r1 into result pointer vpop {s16-s31} .cfi_adjust_cfa_offset -64 pop {r4, r5, r6, r7, r8, r9, r10, r11, pc} .Losr_entry: CFI_RESTORE_STATE_AND_DEF_CFA r11, SAVE_SIZE @ CFA = r11 + SAVE_SIZE sub sp, sp, r10 @ Reserve space for callee stack sub r10, r10, #4 str lr, [sp, r10] @ Store link register per the compiler ABI mov r2, r10 mov r1, r0 mov r0, sp bl memcpy @ memcpy (dest r0, src r1, bytes r2) bx r6 END art_quick_osr_stub /* * On entry r0 is the long jump context. This is expected to be returned from a previous * entrypoint call which threw an exception or deoptimized. * The r12 (IP) shall be clobbered rather than retrieved from gprs_. */ ARM_ENTRY art_quick_do_long_jump // We don't use the LR, but it is needed for unwinding. str lr, [sp, #-8]! .cfi_adjust_cfa_offset 8 .cfi_rel_offset lr, 0 // Reserve space for the gprs + fprs; INCREASE_FRAME ARM_LONG_JUMP_CONTEXT_SIZE mov r1, sp add r2, sp, #ARM_LONG_JUMP_GPRS_SIZE bl artContextCopyForLongJump // Context* context, uintptr_t* gprs, uintptr_t* fprs add r0, sp, #ARM_LONG_JUMP_GPRS_SIZE vldm r0, {s0-s31} @ Load all fprs from argument fprs_. @ Do not access fprs_ from now, they may be below SP. ldm sp, {r0-r11} @ load r0-r11 from gprs_. ldr r12, [sp, #60] @ Load the value of PC (r15) from gprs_ (60 = 4 * 15) into IP (r12). ldr lr, [sp, #56] @ Load LR from gprs_, 56 = 4 * 14. ldr sp, [sp, #52] @ Load SP from gprs_ 52 = 4 * 13. @ Do not access gprs_ from now, they are below SP. .cfi_def_cfa_offset 0 .cfi_register lr, r12 REFRESH_MARKING_REGISTER bx r12 @ Do long jump. END art_quick_do_long_jump /* * Entry from managed code that calls artHandleFillArrayDataFromCode and delivers exception on * failure. */ TWO_ARG_DOWNCALL art_quick_handle_fill_data, \ artHandleFillArrayDataFromCode, \ RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER /* * Entry from managed code that tries to lock the object in a fast path and * calls `artLockObjectFromCode()` for the difficult cases, may block for GC. * r0 holds the possibly null object to lock. */ ENTRY art_quick_lock_object // Note: the slow path is actually the art_quick_lock_object_no_inline (tail call). LOCK_OBJECT_FAST_PATH r0, r1, r2, r3, .Llock_object_slow, /*can_be_null*/ 1 END art_quick_lock_object /* * Entry from managed code that calls `artLockObjectFromCode()`, may block for GC. * r0 holds the possibly null object to lock. */ .extern artLockObjectFromCode ENTRY art_quick_lock_object_no_inline // This is also the slow path for art_quick_lock_object. // Note that we need a local label as the assembler emits bad instructions // for CBZ/CBNZ if we try to jump to `art_quick_lock_object_no_inline`. .Llock_object_slow: SETUP_SAVE_REFS_ONLY_FRAME r1 @ save callee saves in case we block mov r1, rSELF @ pass Thread::Current bl artLockObjectFromCode @ (Object* obj, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER END art_quick_lock_object_no_inline /* * Entry from managed code that tries to unlock the object in a fast path and calls * `artUnlockObjectFromCode()` for the difficult cases and delivers exception on failure. * r0 holds the possibly null object to unlock. */ ENTRY art_quick_unlock_object // Note: the slow path is actually the art_quick_unlock_object_no_inline (tail call). UNLOCK_OBJECT_FAST_PATH r0, r1, r2, r3, .Lunlock_object_slow, /*can_be_null*/ 1 END art_quick_unlock_object /* * Entry from managed code that calls `artUnlockObjectFromCode()` * and delivers exception on failure. * r0 holds the possibly null object to unlock. */ .extern artUnlockObjectFromCode ENTRY art_quick_unlock_object_no_inline // This is also the slow path for art_quick_unlock_object. // Note that we need a local label as the assembler emits bad instructions // for CBZ/CBNZ if we try to jump to `art_quick_unlock_object_no_inline`. .Lunlock_object_slow: @ save callee saves in case exception allocation triggers GC SETUP_SAVE_REFS_ONLY_FRAME r1 mov r1, rSELF @ pass Thread::Current bl artUnlockObjectFromCode @ (Object* obj, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER END art_quick_unlock_object_no_inline /* * Entry from managed code that calls artInstanceOfFromCode and on failure calls * artThrowClassCastExceptionForObject. */ .extern artInstanceOfFromCode .extern artThrowClassCastExceptionForObject ENTRY art_quick_check_instance_of // Type check using the bit string passes null as the target class. In that case just throw. cbz r1, .Lthrow_class_cast_exception_for_bitstring_check push {r0-r2, lr} @ save arguments, padding (r2) and link register .cfi_adjust_cfa_offset 16 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset lr, 12 bl artInstanceOfFromCode cbz r0, .Lthrow_class_cast_exception pop {r0-r2, pc} .Lthrow_class_cast_exception: pop {r0-r2, lr} .cfi_adjust_cfa_offset -16 .cfi_restore r0 .cfi_restore r1 .cfi_restore r2 .cfi_restore lr .Lthrow_class_cast_exception_for_bitstring_check: SETUP_SAVE_ALL_CALLEE_SAVES_FRAME r2 @ save all registers as basis for long jump context mov r2, rSELF @ pass Thread::Current bl artThrowClassCastExceptionForObject @ (Object*, Class*, Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_check_instance_of // Restore rReg's value from [sp, #offset] if rReg is not the same as rExclude. .macro POP_REG_NE rReg, offset, rExclude .ifnc \rReg, \rExclude ldr \rReg, [sp, #\offset] @ restore rReg .cfi_restore \rReg .endif .endm // Save rReg's value to [sp, #offset]. .macro PUSH_REG rReg, offset str \rReg, [sp, #\offset] @ save rReg .cfi_rel_offset \rReg, \offset .endm // Helper macros for `art_quick_aput_obj`. #ifdef USE_READ_BARRIER #ifdef USE_BAKER_READ_BARRIER .macro BAKER_RB_CHECK_GRAY_BIT_AND_LOAD rDest, rObj, offset, gray_slow_path_label ldr ip, [\rObj, #MIRROR_OBJECT_LOCK_WORD_OFFSET] tst ip, #LOCK_WORD_READ_BARRIER_STATE_MASK_SHIFTED bne \gray_slow_path_label // False dependency to avoid needing load/load fence. add \rObj, \rObj, ip, lsr #32 ldr \rDest, [\rObj, #\offset] UNPOISON_HEAP_REF \rDest .endm .macro BAKER_RB_LOAD_AND_MARK rDest, rObj, offset, mark_function ldr \rDest, [\rObj, #\offset] UNPOISON_HEAP_REF \rDest str lr, [sp, #-8]! @ Save LR with correct stack alignment. .cfi_rel_offset lr, 0 .cfi_adjust_cfa_offset 8 bl \mark_function ldr lr, [sp], #8 @ Restore LR. .cfi_restore lr .cfi_adjust_cfa_offset -8 .endm #else // USE_BAKER_READ_BARRIER .extern artReadBarrierSlow .macro READ_BARRIER_SLOW rDest, rObj, offset push {r0-r3, ip, lr} @ 6 words for saved registers (used in art_quick_aput_obj) .cfi_adjust_cfa_offset 24 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset r3, 12 .cfi_rel_offset ip, 16 .cfi_rel_offset lr, 20 sub sp, #8 @ push padding .cfi_adjust_cfa_offset 8 @ mov r0, \rRef @ pass ref in r0 (no-op for now since parameter ref is unused) .ifnc \rObj, r1 mov r1, \rObj @ pass rObj .endif mov r2, #\offset @ pass offset bl artReadBarrierSlow @ artReadBarrierSlow(ref, rObj, offset) @ No need to unpoison return value in r0, artReadBarrierSlow() would do the unpoisoning. .ifnc \rDest, r0 mov \rDest, r0 @ save return value in rDest .endif add sp, #8 @ pop padding .cfi_adjust_cfa_offset -8 POP_REG_NE r0, 0, \rDest @ conditionally restore saved registers POP_REG_NE r1, 4, \rDest POP_REG_NE r2, 8, \rDest POP_REG_NE r3, 12, \rDest POP_REG_NE ip, 16, \rDest add sp, #20 .cfi_adjust_cfa_offset -20 pop {lr} @ restore lr .cfi_adjust_cfa_offset -4 .cfi_restore lr .endm #endif // USE_BAKER_READ_BARRIER #endif // USE_READ_BARRIER .hidden art_quick_aput_obj ENTRY art_quick_aput_obj #if defined(USE_READ_BARRIER) && !defined(USE_BAKER_READ_BARRIER) @ The offset to .Ldo_aput_null is too large to use cbz due to expansion from `READ_BARRIER_SLOW`. tst r2, r2 beq .Laput_obj_null READ_BARRIER_SLOW r3, r0, MIRROR_OBJECT_CLASS_OFFSET READ_BARRIER_SLOW r3, r3, MIRROR_CLASS_COMPONENT_TYPE_OFFSET READ_BARRIER_SLOW r4, r2, MIRROR_OBJECT_CLASS_OFFSET #else // !defined(USE_READ_BARRIER) || defined(USE_BAKER_READ_BARRIER) cbz r2, .Laput_obj_null #ifdef USE_READ_BARRIER cmp rMR, #0 bne .Laput_obj_gc_marking #endif // USE_READ_BARRIER ldr r3, [r0, #MIRROR_OBJECT_CLASS_OFFSET] UNPOISON_HEAP_REF r3 // R4 is a scratch register in managed ARM ABI. ldr r4, [r2, #MIRROR_OBJECT_CLASS_OFFSET] UNPOISON_HEAP_REF r4 ldr r3, [r3, #MIRROR_CLASS_COMPONENT_TYPE_OFFSET] UNPOISON_HEAP_REF r3 #endif // !defined(USE_READ_BARRIER) || defined(USE_BAKER_READ_BARRIER) cmp r3, r4 @ value's type == array's component type - trivial assignability bne .Laput_obj_check_assignability .Laput_obj_store: add r3, r0, #MIRROR_OBJECT_ARRAY_DATA_OFFSET POISON_HEAP_REF r2 str r2, [r3, r1, lsl #2] ldr r3, [rSELF, #THREAD_CARD_TABLE_OFFSET] lsr r0, r0, #CARD_TABLE_CARD_SHIFT strb r3, [r3, r0] blx lr .Laput_obj_null: add r3, r0, #MIRROR_OBJECT_ARRAY_DATA_OFFSET str r2, [r3, r1, lsl #2] blx lr .Laput_obj_check_assignability: push {r0-r2, lr} @ save arguments .cfi_adjust_cfa_offset 16 .cfi_rel_offset lr, 12 mov r1, r4 mov r0, r3 bl artIsAssignableFromCode CFI_REMEMBER_STATE cbz r0, .Lthrow_array_store_exception pop {r0-r2, lr} .cfi_restore lr .cfi_adjust_cfa_offset -16 add r3, r0, #MIRROR_OBJECT_ARRAY_DATA_OFFSET POISON_HEAP_REF r2 str r2, [r3, r1, lsl #2] ldr r3, [rSELF, #THREAD_CARD_TABLE_OFFSET] lsr r0, r0, #CARD_TABLE_CARD_SHIFT strb r3, [r3, r0] blx lr .Lthrow_array_store_exception: CFI_RESTORE_STATE_AND_DEF_CFA sp, 16 pop {r0-r2, lr} .cfi_restore lr .cfi_adjust_cfa_offset -16 #if defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) CFI_REMEMBER_STATE #endif // defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) SETUP_SAVE_ALL_CALLEE_SAVES_FRAME r3 mov r1, r2 mov r2, rSELF @ Pass Thread::Current. bl artThrowArrayStoreException @ (Class*, Class*, Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached #if defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) CFI_RESTORE_STATE_AND_DEF_CFA sp, 0 .Laput_obj_gc_marking: BAKER_RB_CHECK_GRAY_BIT_AND_LOAD \ r3, r0, MIRROR_OBJECT_CLASS_OFFSET, .Laput_obj_mark_array_class .Laput_obj_mark_array_class_continue: BAKER_RB_CHECK_GRAY_BIT_AND_LOAD \ r3, r3, MIRROR_CLASS_COMPONENT_TYPE_OFFSET, .Laput_obj_mark_array_element .Laput_obj_mark_array_element_continue: BAKER_RB_CHECK_GRAY_BIT_AND_LOAD \ r4, r2, MIRROR_OBJECT_CLASS_OFFSET, .Laput_obj_mark_object_class .Laput_obj_mark_object_class_continue: cmp r3, r4 @ value's type == array's component type - trivial assignability // All registers are set up for correctly `.Laput_obj_check_assignability`. bne .Laput_obj_check_assignability b .Laput_obj_store .Laput_obj_mark_array_class: BAKER_RB_LOAD_AND_MARK r3, r0, MIRROR_OBJECT_CLASS_OFFSET, art_quick_read_barrier_mark_reg03 b .Laput_obj_mark_array_class_continue .Laput_obj_mark_array_element: BAKER_RB_LOAD_AND_MARK \ r3, r3, MIRROR_CLASS_COMPONENT_TYPE_OFFSET, art_quick_read_barrier_mark_reg03 b .Laput_obj_mark_array_element_continue .Laput_obj_mark_object_class: BAKER_RB_LOAD_AND_MARK r4, r2, MIRROR_OBJECT_CLASS_OFFSET, art_quick_read_barrier_mark_reg04 b .Laput_obj_mark_object_class_continue #endif // defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) END art_quick_aput_obj /* * Macro for resolution and initialization of indexed DEX file * constants such as classes and strings. */ .macro ONE_ARG_SAVE_EVERYTHING_DOWNCALL name, entrypoint, runtime_method_offset = RUNTIME_SAVE_EVERYTHING_METHOD_OFFSET .extern \entrypoint ENTRY \name SETUP_SAVE_EVERYTHING_FRAME r1, \runtime_method_offset @ save everything in case of GC mov r1, rSELF @ pass Thread::Current bl \entrypoint @ (uint32_t index, Thread*) cbz r0, 1f @ If result is null, deliver the OOME. str r0, [sp, #136] @ store result in the frame DEOPT_OR_RESTORE_SAVE_EVERYTHING_FRAME_AND_RETURN_R0 r1, /* is_ref= */ 1 1: DELIVER_PENDING_EXCEPTION_FRAME_READY END \name .endm .macro ONE_ARG_SAVE_EVERYTHING_DOWNCALL_FOR_CLINIT name, entrypoint ONE_ARG_SAVE_EVERYTHING_DOWNCALL \name, \entrypoint, RUNTIME_SAVE_EVERYTHING_FOR_CLINIT_METHOD_OFFSET .endm ONE_ARG_SAVE_EVERYTHING_DOWNCALL_FOR_CLINIT art_quick_initialize_static_storage, artInitializeStaticStorageFromCode ONE_ARG_SAVE_EVERYTHING_DOWNCALL_FOR_CLINIT art_quick_resolve_type, artResolveTypeFromCode ONE_ARG_SAVE_EVERYTHING_DOWNCALL art_quick_resolve_type_and_verify_access, artResolveTypeAndVerifyAccessFromCode ONE_ARG_SAVE_EVERYTHING_DOWNCALL art_quick_resolve_method_handle, artResolveMethodHandleFromCode ONE_ARG_SAVE_EVERYTHING_DOWNCALL art_quick_resolve_method_type, artResolveMethodTypeFromCode ONE_ARG_SAVE_EVERYTHING_DOWNCALL art_quick_resolve_string, artResolveStringFromCode // Note: Functions `art{Get,Set}{Static,Instance}FromCompiledCode` are // defined with a macro in runtime/entrypoints/quick/quick_field_entrypoints.cc. GENERATE_STATIC_FIELD_GETTERS GENERATE_INSTANCE_FIELD_GETTERS GENERATE_STATIC_FIELD_SETTERS /* emit64= */ 0 GENERATE_INSTANCE_FIELD_SETTERS /* emit64= */ 0 /* * Called by managed code to resolve an instance field and store a wide value. */ .extern artSet64InstanceFromCompiledCode ENTRY art_quick_set64_instance SETUP_SAVE_REFS_ONLY_FRAME r12 @ save callee saves in case of GC @ r2:r3 contain the wide argument str rSELF, [sp, #-16]! @ expand the frame and pass Thread::Current .cfi_adjust_cfa_offset 16 bl artSet64InstanceFromCompiledCode @ (field_idx, Object*, new_val, Thread*) add sp, #16 @ release out args .cfi_adjust_cfa_offset -16 RESTORE_SAVE_REFS_ONLY_FRAME @ TODO: we can clearly save an add here REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER END art_quick_set64_instance .extern artSet64StaticFromCompiledCode ENTRY art_quick_set64_static SETUP_SAVE_REFS_ONLY_FRAME r12 @ save callee saves in case of GC @ r2:r3 contain the wide argument str rSELF, [sp, #-16]! @ expand the frame and pass Thread::Current .cfi_adjust_cfa_offset 16 bl artSet64StaticFromCompiledCode @ (field_idx, new_val, Thread*) add sp, #16 @ release out args .cfi_adjust_cfa_offset -16 RESTORE_SAVE_REFS_ONLY_FRAME @ TODO: we can clearly save an add here REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_INT_RESULT_IS_ZERO_OR_DELIVER END art_quick_set64_static // Generate the allocation entrypoints for each allocator. GENERATE_ALLOC_ENTRYPOINTS_FOR_NON_TLAB_ALLOCATORS // Comment out allocators that have arm specific asm. // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_RESOLVED(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_INITIALIZED(_region_tlab, RegionTLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_WITH_ACCESS_CHECK(_region_tlab, RegionTLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_OBJECT(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED8(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED16(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED32(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED64(_region_tlab, RegionTLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_BYTES(_region_tlab, RegionTLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_CHARS(_region_tlab, RegionTLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_STRING(_region_tlab, RegionTLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_RESOLVED(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_INITIALIZED(_tlab, TLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_OBJECT_WITH_ACCESS_CHECK(_tlab, TLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_OBJECT(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED8(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED16(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED32(_tlab, TLAB) // GENERATE_ALLOC_ENTRYPOINTS_ALLOC_ARRAY_RESOLVED64(_tlab, TLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_BYTES(_tlab, TLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_CHARS(_tlab, TLAB) GENERATE_ALLOC_ENTRYPOINTS_ALLOC_STRING_FROM_STRING(_tlab, TLAB) // A hand-written override for GENERATE_ALLOC_ENTRYPOINTS_ALLOC_RESOLVED_OBJECT(_rosalloc, RosAlloc). // // If isInitialized=1 then the compiler assumes the object's class has already been initialized. // If isInitialized=0 the compiler can only assume it's been at least resolved. .macro ART_QUICK_ALLOC_OBJECT_ROSALLOC c_name, cxx_name, isInitialized ENTRY \c_name // Fast path rosalloc allocation. // r0: type/return value, rSELF (r9): Thread::Current // r1, r2, r3, r12: free. ldr r3, [rSELF, #THREAD_LOCAL_ALLOC_STACK_TOP_OFFSET] // Check if the thread local // allocation stack has room. // TODO: consider using ldrd. ldr r12, [rSELF, #THREAD_LOCAL_ALLOC_STACK_END_OFFSET] cmp r3, r12 bhs .Lslow_path\c_name ldr r3, [r0, #MIRROR_CLASS_OBJECT_SIZE_ALLOC_FAST_PATH_OFFSET] // Load the object size (r3) cmp r3, #ROSALLOC_MAX_THREAD_LOCAL_BRACKET_SIZE // Check if the size is for a thread // local allocation. // If the class is not yet visibly initialized, or it is finalizable, // the object size will be very large to force the branch below to be taken. // // See Class::SetStatus() in class.cc for more details. bhs .Lslow_path\c_name // Compute the rosalloc bracket index // from the size. Since the size is // already aligned we can combine the // two shifts together. add r12, rSELF, r3, lsr #(ROSALLOC_BRACKET_QUANTUM_SIZE_SHIFT - POINTER_SIZE_SHIFT) // Subtract pointer size since there // are no runs for 0 byte allocations // and the size is already aligned. // Load the rosalloc run (r12) ldr r12, [r12, #(THREAD_ROSALLOC_RUNS_OFFSET - __SIZEOF_POINTER__)] // Load the free list head (r3). This // will be the return val. ldr r3, [r12, #(ROSALLOC_RUN_FREE_LIST_OFFSET + ROSALLOC_RUN_FREE_LIST_HEAD_OFFSET)] cbz r3, .Lslow_path\c_name // "Point of no slow path". Won't go to the slow path from here on. OK to clobber r0 and r1. ldr r1, [r3, #ROSALLOC_SLOT_NEXT_OFFSET] // Load the next pointer of the head // and update the list head with the // next pointer. str r1, [r12, #(ROSALLOC_RUN_FREE_LIST_OFFSET + ROSALLOC_RUN_FREE_LIST_HEAD_OFFSET)] // Store the class pointer in the // header. This also overwrites the // next pointer. The offsets are // asserted to match. #if ROSALLOC_SLOT_NEXT_OFFSET != MIRROR_OBJECT_CLASS_OFFSET #error "Class pointer needs to overwrite next pointer." #endif POISON_HEAP_REF r0 str r0, [r3, #MIRROR_OBJECT_CLASS_OFFSET] // Push the new object onto the thread // local allocation stack and // increment the thread local // allocation stack top. ldr r1, [rSELF, #THREAD_LOCAL_ALLOC_STACK_TOP_OFFSET] str r3, [r1], #COMPRESSED_REFERENCE_SIZE // (Increment r1 as a side effect.) str r1, [rSELF, #THREAD_LOCAL_ALLOC_STACK_TOP_OFFSET] // Decrement the size of the free list // After this "STR" the object is published to the thread local allocation stack, // and it will be observable from a runtime internal (eg. Heap::VisitObjects) point of view. // It is not yet visible to the running (user) compiled code until after the return. // // To avoid the memory barrier prior to the "STR", a trick is employed, by differentiating // the state of the allocation stack slot. It can be a pointer to one of: // 0) Null entry, because the stack was bumped but the new pointer wasn't written yet. // (The stack initial state is "null" pointers). // 1) A partially valid object, with an invalid class pointer to the next free rosalloc slot. // 2) A fully valid object, with a valid class pointer pointing to a real class. // Other states are not allowed. // // An object that is invalid only temporarily, and will eventually become valid. // The internal runtime code simply checks if the object is not null or is partial and then // ignores it. // // (Note: The actual check is done by seeing if a non-null object has a class pointer pointing // to ClassClass, and that the ClassClass's class pointer is self-cyclic. A rosalloc free slot // "next" pointer is not-cyclic.) // // See also b/28790624 for a listing of CLs dealing with this race. ldr r1, [r12, #(ROSALLOC_RUN_FREE_LIST_OFFSET + ROSALLOC_RUN_FREE_LIST_SIZE_OFFSET)] sub r1, #1 // TODO: consider combining this store // and the list head store above using // strd. str r1, [r12, #(ROSALLOC_RUN_FREE_LIST_OFFSET + ROSALLOC_RUN_FREE_LIST_SIZE_OFFSET)] mov r0, r3 // Set the return value and return. // No barrier. The class is already observably initialized (otherwise the fast // path size check above would fail) and new-instance allocations are protected // from publishing by the compiler which inserts its own StoreStore barrier. bx lr .Lslow_path\c_name: SETUP_SAVE_REFS_ONLY_FRAME r2 @ save callee saves in case of GC mov r1, rSELF @ pass Thread::Current bl \cxx_name @ (mirror::Class* cls, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_RESULT_IS_NON_NULL_OR_DELIVER END \c_name .endm ART_QUICK_ALLOC_OBJECT_ROSALLOC art_quick_alloc_object_resolved_rosalloc, artAllocObjectFromCodeResolvedRosAlloc, /* isInitialized */ 0 ART_QUICK_ALLOC_OBJECT_ROSALLOC art_quick_alloc_object_initialized_rosalloc, artAllocObjectFromCodeInitializedRosAlloc, /* isInitialized */ 1 // The common fast path code for art_quick_alloc_object_resolved/initialized_tlab // and art_quick_alloc_object_resolved/initialized_region_tlab. // // r0: type, rSELF (r9): Thread::Current, r1, r2, r3, r12: free. // Need to preserve r0 to the slow path. // // If isInitialized=1 then the compiler assumes the object's class has already been initialized. // If isInitialized=0 the compiler can only assume it's been at least resolved. .macro ALLOC_OBJECT_RESOLVED_TLAB_FAST_PATH slowPathLabel isInitialized // Load thread_local_pos (r12) and // thread_local_end (r3) with ldrd. // Check constraints for ldrd. #if !((THREAD_LOCAL_POS_OFFSET + 4 == THREAD_LOCAL_END_OFFSET) && (THREAD_LOCAL_POS_OFFSET % 8 == 0)) #error "Thread::thread_local_pos/end must be consecutive and are 8 byte aligned for performance" #endif ldrd r12, r3, [rSELF, #THREAD_LOCAL_POS_OFFSET] sub r12, r3, r12 // Compute the remaining buf size. ldr r3, [r0, #MIRROR_CLASS_OBJECT_SIZE_ALLOC_FAST_PATH_OFFSET] // Load the object size (r3). cmp r3, r12 // Check if it fits. // If the class is not yet visibly initialized, or it is finalizable, // the object size will be very large to force the branch below to be taken. // // See Class::SetStatus() in class.cc for more details. bhi \slowPathLabel // "Point of no slow path". Won't go to the slow path from here on. OK to clobber r0 and r1. // Reload old thread_local_pos (r0) // for the return value. ldr r2, [rSELF, #THREAD_LOCAL_POS_OFFSET] add r1, r2, r3 str r1, [rSELF, #THREAD_LOCAL_POS_OFFSET] // Store new thread_local_pos. // After this "STR" the object is published to the thread local allocation stack, // and it will be observable from a runtime internal (eg. Heap::VisitObjects) point of view. // It is not yet visible to the running (user) compiled code until after the return. // // To avoid the memory barrier prior to the "STR", a trick is employed, by differentiating // the state of the object. It can be either: // 1) A partially valid object, with a null class pointer // (because the initial state of TLAB buffers is all 0s/nulls). // 2) A fully valid object, with a valid class pointer pointing to a real class. // Other states are not allowed. // // An object that is invalid only temporarily, and will eventually become valid. // The internal runtime code simply checks if the object is not null or is partial and then // ignores it. // // (Note: The actual check is done by checking that the object's class pointer is non-null. // Also, unlike rosalloc, the object can never be observed as null). POISON_HEAP_REF r0 str r0, [r2, #MIRROR_OBJECT_CLASS_OFFSET] // Store the class pointer. mov r0, r2 // No barrier. The class is already observably initialized (otherwise the fast // path size check above would fail) and new-instance allocations are protected // from publishing by the compiler which inserts its own StoreStore barrier. bx lr .endm // The common code for art_quick_alloc_object_*region_tlab // Currently the implementation ignores isInitialized. TODO(b/172087402): clean this up. // Caller must execute a constructor fence after this. .macro GENERATE_ALLOC_OBJECT_RESOLVED_TLAB name, entrypoint, isInitialized ENTRY \name // Fast path tlab allocation. // r0: type, rSELF (r9): Thread::Current // r1, r2, r3, r12: free. ALLOC_OBJECT_RESOLVED_TLAB_FAST_PATH .Lslow_path\name, \isInitialized .Lslow_path\name: SETUP_SAVE_REFS_ONLY_FRAME r2 // Save callee saves in case of GC. mov r1, rSELF // Pass Thread::Current. bl \entrypoint // (mirror::Class* klass, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_RESULT_IS_NON_NULL_OR_DELIVER END \name .endm GENERATE_ALLOC_OBJECT_RESOLVED_TLAB art_quick_alloc_object_resolved_region_tlab, artAllocObjectFromCodeResolvedRegionTLAB, /* isInitialized */ 0 GENERATE_ALLOC_OBJECT_RESOLVED_TLAB art_quick_alloc_object_initialized_region_tlab, artAllocObjectFromCodeInitializedRegionTLAB, /* isInitialized */ 1 GENERATE_ALLOC_OBJECT_RESOLVED_TLAB art_quick_alloc_object_resolved_tlab, artAllocObjectFromCodeResolvedTLAB, /* isInitialized */ 0 GENERATE_ALLOC_OBJECT_RESOLVED_TLAB art_quick_alloc_object_initialized_tlab, artAllocObjectFromCodeInitializedTLAB, /* isInitialized */ 1 // The common fast path code for art_quick_alloc_array_resolved/initialized_tlab // and art_quick_alloc_array_resolved/initialized_region_tlab. // // r0: type, r1: component_count, r2: total_size, rSELF (r9): Thread::Current, r3, r12: free. // Need to preserve r0 and r1 to the slow path. .macro ALLOC_ARRAY_TLAB_FAST_PATH_RESOLVED_WITH_SIZE slowPathLabel and r2, r2, #OBJECT_ALIGNMENT_MASK_TOGGLED // Apply alignment mask // (addr + 7) & ~7. // Load thread_local_pos (r3) and // thread_local_end (r12) with ldrd. // Check constraints for ldrd. #if !((THREAD_LOCAL_POS_OFFSET + 4 == THREAD_LOCAL_END_OFFSET) && (THREAD_LOCAL_POS_OFFSET % 8 == 0)) #error "Thread::thread_local_pos/end must be consecutive and are 8 byte aligned for performance" #endif ldrd r3, r12, [rSELF, #THREAD_LOCAL_POS_OFFSET] sub r12, r12, r3 // Compute the remaining buf size. cmp r2, r12 // Check if the total_size fits. // The array class is always initialized here. Unlike new-instance, // this does not act as a double test. bhi \slowPathLabel // "Point of no slow path". Won't go to the slow path from here on. OK to clobber r0 and r1. add r2, r2, r3 str r2, [rSELF, #THREAD_LOCAL_POS_OFFSET] // Store new thread_local_pos. POISON_HEAP_REF r0 str r0, [r3, #MIRROR_OBJECT_CLASS_OFFSET] // Store the class pointer. str r1, [r3, #MIRROR_ARRAY_LENGTH_OFFSET] // Store the array length. mov r0, r3 // new-array is special. The class is loaded and immediately goes to the Initialized state // before it is published. Therefore the only fence needed is for the publication of the object. // See ClassLinker::CreateArrayClass() for more details. // For publication of the new array, we don't need a 'dmb ishst' here. // The compiler generates 'dmb ishst' for all new-array insts. bx lr .endm // Caller must execute a constructor fence after this. .macro GENERATE_ALLOC_ARRAY_TLAB name, entrypoint, size_setup ENTRY \name // Fast path array allocation for region tlab allocation. // r0: mirror::Class* type // r1: int32_t component_count // rSELF (r9): thread // r2, r3, r12: free. \size_setup .Lslow_path\name ALLOC_ARRAY_TLAB_FAST_PATH_RESOLVED_WITH_SIZE .Lslow_path\name .Lslow_path\name: // r0: mirror::Class* klass // r1: int32_t component_count // r2: Thread* self SETUP_SAVE_REFS_ONLY_FRAME r2 // save callee saves in case of GC mov r2, rSELF // pass Thread::Current bl \entrypoint RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_RESULT_IS_NON_NULL_OR_DELIVER END \name .endm .macro COMPUTE_ARRAY_SIZE_UNKNOWN slow_path movw r2, #((MIN_LARGE_OBJECT_THRESHOLD - MIRROR_WIDE_ARRAY_DATA_OFFSET) / 8) cmp r1, r2 bhi \slow_path // Array classes are never finalizable // or uninitialized, no need to check. ldr r3, [r0, #MIRROR_CLASS_COMPONENT_TYPE_OFFSET] // Load component type UNPOISON_HEAP_REF r3 ldr r3, [r3, #MIRROR_CLASS_OBJECT_PRIMITIVE_TYPE_OFFSET] lsr r3, r3, #PRIMITIVE_TYPE_SIZE_SHIFT_SHIFT // Component size shift is in high 16 // bits. lsl r2, r1, r3 // Calculate data size // Add array data offset and alignment. add r2, r2, #(MIRROR_INT_ARRAY_DATA_OFFSET + OBJECT_ALIGNMENT_MASK) #if MIRROR_WIDE_ARRAY_DATA_OFFSET != MIRROR_INT_ARRAY_DATA_OFFSET + 4 #error Long array data offset must be 4 greater than int array data offset. #endif add r3, r3, #1 // Add 4 to the length only if the // component size shift is 3 // (for 64 bit alignment). and r3, r3, #4 add r2, r2, r3 .endm .macro COMPUTE_ARRAY_SIZE_8 slow_path // Possibly a large object, go slow. // Also does negative array size check. movw r2, #(MIN_LARGE_OBJECT_THRESHOLD - MIRROR_INT_ARRAY_DATA_OFFSET) cmp r1, r2 bhi \slow_path // Add array data offset and alignment. add r2, r1, #(MIRROR_INT_ARRAY_DATA_OFFSET + OBJECT_ALIGNMENT_MASK) .endm .macro COMPUTE_ARRAY_SIZE_16 slow_path // Possibly a large object, go slow. // Also does negative array size check. movw r2, #((MIN_LARGE_OBJECT_THRESHOLD - MIRROR_INT_ARRAY_DATA_OFFSET) / 2) cmp r1, r2 bhi \slow_path lsl r2, r1, #1 // Add array data offset and alignment. add r2, r2, #(MIRROR_INT_ARRAY_DATA_OFFSET + OBJECT_ALIGNMENT_MASK) .endm .macro COMPUTE_ARRAY_SIZE_32 slow_path // Possibly a large object, go slow. // Also does negative array size check. movw r2, #((MIN_LARGE_OBJECT_THRESHOLD - MIRROR_INT_ARRAY_DATA_OFFSET) / 4) cmp r1, r2 bhi \slow_path lsl r2, r1, #2 // Add array data offset and alignment. add r2, r2, #(MIRROR_INT_ARRAY_DATA_OFFSET + OBJECT_ALIGNMENT_MASK) .endm .macro COMPUTE_ARRAY_SIZE_64 slow_path // Possibly a large object, go slow. // Also does negative array size check. movw r2, #((MIN_LARGE_OBJECT_THRESHOLD - MIRROR_LONG_ARRAY_DATA_OFFSET) / 8) cmp r1, r2 bhi \slow_path lsl r2, r1, #3 // Add array data offset and alignment. add r2, r2, #(MIRROR_WIDE_ARRAY_DATA_OFFSET + OBJECT_ALIGNMENT_MASK) .endm GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved_region_tlab, artAllocArrayFromCodeResolvedRegionTLAB, COMPUTE_ARRAY_SIZE_UNKNOWN GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved8_region_tlab, artAllocArrayFromCodeResolvedRegionTLAB, COMPUTE_ARRAY_SIZE_8 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved16_region_tlab, artAllocArrayFromCodeResolvedRegionTLAB, COMPUTE_ARRAY_SIZE_16 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved32_region_tlab, artAllocArrayFromCodeResolvedRegionTLAB, COMPUTE_ARRAY_SIZE_32 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved64_region_tlab, artAllocArrayFromCodeResolvedRegionTLAB, COMPUTE_ARRAY_SIZE_64 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved_tlab, artAllocArrayFromCodeResolvedTLAB, COMPUTE_ARRAY_SIZE_UNKNOWN GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved8_tlab, artAllocArrayFromCodeResolvedTLAB, COMPUTE_ARRAY_SIZE_8 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved16_tlab, artAllocArrayFromCodeResolvedTLAB, COMPUTE_ARRAY_SIZE_16 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved32_tlab, artAllocArrayFromCodeResolvedTLAB, COMPUTE_ARRAY_SIZE_32 GENERATE_ALLOC_ARRAY_TLAB art_quick_alloc_array_resolved64_tlab, artAllocArrayFromCodeResolvedTLAB, COMPUTE_ARRAY_SIZE_64 /* * Called by managed code when the value in rSUSPEND has been decremented to 0. */ .extern artTestSuspendFromCode ENTRY art_quick_test_suspend SETUP_SAVE_EVERYTHING_FRAME r0, RUNTIME_SAVE_EVERYTHING_FOR_SUSPEND_CHECK_METHOD_OFFSET @ save everything for GC stack crawl mov r0, rSELF bl artTestSuspendFromCode @ (Thread*) CFI_REMEMBER_STATE cbnz r0, .Ltest_suspend_deoptimize RESTORE_SAVE_EVERYTHING_FRAME REFRESH_MARKING_REGISTER bx lr .Ltest_suspend_deoptimize: // Deoptimize CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_test_suspend .extern artImplicitSuspendFromCode ENTRY art_quick_implicit_suspend mov r0, rSELF SETUP_SAVE_REFS_ONLY_FRAME r1 @ save callee saves for stack crawl bl artImplicitSuspendFromCode @ (Thread*) CFI_REMEMBER_STATE cbnz r0, .Limplicit_suspend_deopt RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER bx lr .Limplicit_suspend_deopt: // Deoptimize CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_REFS_ONLY bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_implicit_suspend /* * Called by managed code that is attempting to call a method on a proxy class. On entry * r0 holds the proxy method and r1 holds the receiver; r2 and r3 may contain arguments. The * frame size of the invoked proxy method agrees with a ref and args callee save frame. */ .extern artQuickProxyInvokeHandler ENTRY art_quick_proxy_invoke_handler SETUP_SAVE_REFS_AND_ARGS_FRAME_WITH_METHOD_IN_R0 mov r2, rSELF @ pass Thread::Current mov r3, sp @ pass SP blx artQuickProxyInvokeHandler @ (Method* proxy method, receiver, Thread*, SP) ldr r2, [rSELF, #THREAD_EXCEPTION_OFFSET] @ load Thread::Current()->exception_ // Tear down the callee-save frame. Skip arg registers. add sp, #(FRAME_SIZE_SAVE_REFS_AND_ARGS - FRAME_SIZE_SAVE_REFS_ONLY) .cfi_adjust_cfa_offset -(FRAME_SIZE_SAVE_REFS_AND_ARGS - FRAME_SIZE_SAVE_REFS_ONLY) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER cbnz r2, 1f @ success if no exception is pending vmov d0, r0, r1 @ store into fpr, for when it's a fpr return... bx lr @ return on success 1: DELIVER_PENDING_EXCEPTION END art_quick_proxy_invoke_handler /* * Called to resolve an imt conflict. * r0 is the conflict ArtMethod. * r12 is a hidden argument that holds the target interface method. * * Note that this stub writes to r0, r4, and r12. */ ENTRY art_quick_imt_conflict_trampoline ldr r0, [r0, #ART_METHOD_JNI_OFFSET_32] // Load ImtConflictTable ldr r4, [r0] // Load first entry in ImtConflictTable. .Limt_table_iterate: cmp r4, r12 // Branch if found. Benchmarks have shown doing a branch here is better. beq .Limt_table_found // If the entry is null, the interface method is not in the ImtConflictTable. cbz r4, .Lconflict_trampoline // Iterate over the entries of the ImtConflictTable. ldr r4, [r0, #(2 * __SIZEOF_POINTER__)]! b .Limt_table_iterate .Limt_table_found: // We successfully hit an entry in the table. Load the target method // and jump to it. ldr r0, [r0, #__SIZEOF_POINTER__] ldr pc, [r0, #ART_METHOD_QUICK_CODE_OFFSET_32] .Lconflict_trampoline: // Pass interface method to the trampoline. mov r0, r12 INVOKE_TRAMPOLINE_BODY artInvokeInterfaceTrampoline END art_quick_imt_conflict_trampoline .extern artQuickResolutionTrampoline ENTRY art_quick_resolution_trampoline SETUP_SAVE_REFS_AND_ARGS_FRAME r2 mov r2, rSELF @ pass Thread::Current mov r3, sp @ pass SP blx artQuickResolutionTrampoline @ (Method* called, receiver, Thread*, SP) CFI_REMEMBER_STATE cbz r0, 1f @ is code pointer null? goto exception mov r12, r0 ldr r0, [sp, #0] @ load resolved method in r0 RESTORE_SAVE_REFS_AND_ARGS_FRAME REFRESH_MARKING_REGISTER bx r12 @ tail-call into actual code 1: CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_REFS_AND_ARGS RESTORE_SAVE_REFS_AND_ARGS_FRAME DELIVER_PENDING_EXCEPTION END art_quick_resolution_trampoline /* * Called to do a generic JNI down-call */ ENTRY art_quick_generic_jni_trampoline SETUP_SAVE_REFS_AND_ARGS_FRAME_WITH_METHOD_IN_R0 // Save rSELF mov r11, rSELF // Save SP , so we can have static CFI info. r10 is saved in ref_and_args. mov r10, sp .cfi_def_cfa_register r10 sub sp, sp, #GENERIC_JNI_TRAMPOLINE_RESERVED_AREA // prepare for artQuickGenericJniTrampoline call // (Thread*, managed_sp, reserved_area) // r0 r1 r2 <= C calling convention // rSELF r10 sp <= where they are mov r0, rSELF // Thread* mov r1, r10 // SP for the managed frame. mov r2, sp // reserved area for arguments and other saved data (up to managed frame) blx artQuickGenericJniTrampoline // (Thread*, managed_sp, reserved_area) // The C call will have registered the complete save-frame on success. // The result of the call is: // r0: pointer to native code, 0 on error. // The bottom of the reserved area contains values for arg registers, // hidden arg register and SP for out args for the call. // Check for error (class init check or locking for synchronized native method can throw). cbz r0, .Lexception_in_native // Save the code pointer mov lr, r0 // Load parameters from frame into registers r0-r3 (soft-float), // hidden arg (r4) for @CriticalNative and SP for out args. pop {r0-r3, r4, ip} // Apply the new SP for out args, releasing unneeded reserved area. mov sp, ip // Softfloat. // TODO: Change to hardfloat when supported. blx lr // native call. // result sign extension is handled in C code // prepare for artQuickGenericJniEndTrampoline call // (Thread*, result, result_f) // r0 r2,r3 stack <= C calling convention // r11 r0,r1 r0,r1 <= where they are sub sp, sp, #8 // Stack alignment. push {r0-r1} mov r3, r1 mov r2, r0 mov r0, r11 blx artQuickGenericJniEndTrampoline // Restore self pointer. mov rSELF, r11 // Pending exceptions possible. ldr r2, [rSELF, #THREAD_EXCEPTION_OFFSET] @ load Thread::Current()->exception_ cbnz r2, .Lexception_in_native // Tear down the alloca. mov sp, r10 // store into fpr, for when it's a fpr return... vmov d0, r0, r1 LOAD_RUNTIME_INSTANCE r2 ldr r2, [r2, #RUNTIME_INSTRUMENTATION_OFFSET] ldrb r2, [r2, #INSTRUMENTATION_RUN_EXIT_HOOKS_OFFSET] CFI_REMEMBER_STATE cbnz r2, .Lcall_method_exit_hook .Lcall_method_exit_hook_done: // Tear down the callee-save frame. Skip arg registers. .cfi_def_cfa_register sp add sp, #(FRAME_SIZE_SAVE_REFS_AND_ARGS - 7 * 4) .cfi_adjust_cfa_offset -(FRAME_SIZE_SAVE_REFS_AND_ARGS - 7 * 4) pop {r5-r8, r10-r11, lr} @ This must match the non-args registers restored by .cfi_restore r5 @ `RESTORE_SAVE_REFS_AND_ARGS_FRAME`. .cfi_restore r6 .cfi_restore r7 .cfi_restore r8 .cfi_restore r10 .cfi_restore r11 .cfi_restore lr .cfi_adjust_cfa_offset -(7 * 4) REFRESH_MARKING_REGISTER bx lr // ret .Lcall_method_exit_hook: CFI_RESTORE_STATE_AND_DEF_CFA r10, FRAME_SIZE_SAVE_REFS_AND_ARGS mov r2, #FRAME_SIZE_SAVE_REFS_AND_ARGS bl art_quick_method_exit_hook b .Lcall_method_exit_hook_done .Lexception_in_native: ldr ip, [rSELF, #THREAD_TOP_QUICK_FRAME_OFFSET] add ip, ip, #-1 // Remove the GenericJNI tag. ADD/SUB writing directly to SP is UNPREDICTABLE. mov sp, ip bl art_deliver_pending_exception END art_quick_generic_jni_trampoline ENTRY art_deliver_pending_exception # This will create a new save-all frame, required by the runtime. DELIVER_PENDING_EXCEPTION END art_deliver_pending_exception .extern artQuickToInterpreterBridge ENTRY art_quick_to_interpreter_bridge SETUP_SAVE_REFS_AND_ARGS_FRAME r1 mov r1, rSELF @ pass Thread::Current mov r2, sp @ pass SP blx artQuickToInterpreterBridge @ (Method* method, Thread*, SP) ldr r2, [rSELF, #THREAD_EXCEPTION_OFFSET] @ load Thread::Current()->exception_ // Tear down the callee-save frame. Skip arg registers. add sp, #(FRAME_SIZE_SAVE_REFS_AND_ARGS - FRAME_SIZE_SAVE_REFS_ONLY) .cfi_adjust_cfa_offset -(FRAME_SIZE_SAVE_REFS_AND_ARGS - FRAME_SIZE_SAVE_REFS_ONLY) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER cbnz r2, 1f @ success if no exception is pending vmov d0, r0, r1 @ store into fpr, for when it's a fpr return... bx lr @ return on success 1: DELIVER_PENDING_EXCEPTION END art_quick_to_interpreter_bridge /* * Called to attempt to execute an obsolete method. */ ONE_ARG_RUNTIME_EXCEPTION art_invoke_obsolete_method_stub, artInvokeObsoleteMethod /* * Compiled code has requested that we deoptimize into the interpreter. The deoptimization * will long jump to the interpreter bridge. */ .extern artDeoptimizeFromCompiledCode ENTRY art_quick_deoptimize_from_compiled_code SETUP_SAVE_EVERYTHING_FRAME r1 mov r1, rSELF @ pass Thread::Current blx artDeoptimizeFromCompiledCode @ (DeoptimizationKind, Thread*) bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_deoptimize_from_compiled_code /* * Signed 64-bit integer multiply. * * Consider WXxYZ (r1r0 x r3r2) with a long multiply: * WX * x YZ * -------- * ZW ZX * YW YX * * The low word of the result holds ZX, the high word holds * (ZW+YX) + (the high overflow from ZX). YW doesn't matter because * it doesn't fit in the low 64 bits. * * Unlike most ARM math operations, multiply instructions have * restrictions on using the same register more than once (Rd and Rm * cannot be the same). */ /* mul-long vAA, vBB, vCC */ ENTRY art_quick_mul_long push {r9-r10} .cfi_adjust_cfa_offset 8 .cfi_rel_offset r9, 0 .cfi_rel_offset r10, 4 mul ip, r2, r1 @ ip<- ZxW umull r9, r10, r2, r0 @ r9/r10 <- ZxX mla r2, r0, r3, ip @ r2<- YxX + (ZxW) add r10, r2, r10 @ r10<- r10 + low(ZxW + (YxX)) mov r0,r9 mov r1,r10 pop {r9-r10} .cfi_adjust_cfa_offset -8 .cfi_restore r9 .cfi_restore r10 bx lr END art_quick_mul_long /* * Long integer shift. This is different from the generic 32/64-bit * binary operations because vAA/vBB are 64-bit but vCC (the shift * distance) is 32-bit. Also, Dalvik requires us to ignore all but the low * 6 bits. * On entry: * r0: low word * r1: high word * r2: shift count */ /* shl-long vAA, vBB, vCC */ ARM_ENTRY art_quick_shl_long @ ARM code as thumb code requires spills and r2, r2, #63 @ r2<- r2 & 0x3f mov r1, r1, asl r2 @ r1<- r1 << r2 rsb r3, r2, #32 @ r3<- 32 - r2 orr r1, r1, r0, lsr r3 @ r1<- r1 | (r0 << (32-r2)) subs ip, r2, #32 @ ip<- r2 - 32 movpl r1, r0, asl ip @ if r2 >= 32, r1<- r0 << (r2-32) mov r0, r0, asl r2 @ r0<- r0 << r2 bx lr END art_quick_shl_long /* * Long integer shift. This is different from the generic 32/64-bit * binary operations because vAA/vBB are 64-bit but vCC (the shift * distance) is 32-bit. Also, Dalvik requires us to ignore all but the low * 6 bits. * On entry: * r0: low word * r1: high word * r2: shift count */ /* shr-long vAA, vBB, vCC */ ARM_ENTRY art_quick_shr_long @ ARM code as thumb code requires spills and r2, r2, #63 @ r0<- r0 & 0x3f mov r0, r0, lsr r2 @ r0<- r2 >> r2 rsb r3, r2, #32 @ r3<- 32 - r2 orr r0, r0, r1, asl r3 @ r0<- r0 | (r1 << (32-r2)) subs ip, r2, #32 @ ip<- r2 - 32 movpl r0, r1, asr ip @ if r2 >= 32, r0<-r1 >> (r2-32) mov r1, r1, asr r2 @ r1<- r1 >> r2 bx lr END art_quick_shr_long /* * Long integer shift. This is different from the generic 32/64-bit * binary operations because vAA/vBB are 64-bit but vCC (the shift * distance) is 32-bit. Also, Dalvik requires us to ignore all but the low * 6 bits. * On entry: * r0: low word * r1: high word * r2: shift count */ /* ushr-long vAA, vBB, vCC */ ARM_ENTRY art_quick_ushr_long @ ARM code as thumb code requires spills and r2, r2, #63 @ r0<- r0 & 0x3f mov r0, r0, lsr r2 @ r0<- r2 >> r2 rsb r3, r2, #32 @ r3<- 32 - r2 orr r0, r0, r1, asl r3 @ r0<- r0 | (r1 << (32-r2)) subs ip, r2, #32 @ ip<- r2 - 32 movpl r0, r1, lsr ip @ if r2 >= 32, r0<-r1 >>> (r2-32) mov r1, r1, lsr r2 @ r1<- r1 >>> r2 bx lr END art_quick_ushr_long /* * String's indexOf. * * On entry: * r0: string object (known non-null) * r1: char to match (known <= 0xFFFF) * r2: Starting offset in string data */ ENTRY art_quick_indexof push {r4, r10-r11, lr} @ 4 words of callee saves .cfi_adjust_cfa_offset 16 .cfi_rel_offset r4, 0 .cfi_rel_offset r10, 4 .cfi_rel_offset r11, 8 .cfi_rel_offset lr, 12 #if (STRING_COMPRESSION_FEATURE) ldr r4, [r0, #MIRROR_STRING_COUNT_OFFSET] #else ldr r3, [r0, #MIRROR_STRING_COUNT_OFFSET] #endif add r0, #MIRROR_STRING_VALUE_OFFSET #if (STRING_COMPRESSION_FEATURE) /* r4 count (with flag) and r3 holds actual length */ lsr r3, r4, #1 #endif /* Clamp start to [0..count] */ cmp r2, #0 it lt movlt r2, #0 cmp r2, r3 it gt movgt r2, r3 /* Save a copy in r12 to later compute result */ mov r12, r0 /* Build pointer to start of data to compare and pre-bias */ #if (STRING_COMPRESSION_FEATURE) lsrs r4, r4, #1 bcc .Lstring_indexof_compressed #endif add r0, r0, r2, lsl #1 sub r0, #2 /* Compute iteration count */ sub r2, r3, r2 /* * At this point we have: * r0: start of data to test * r1: char to compare * r2: iteration count * r4: compression style (used temporarily) * r12: original start of string data * r3, r4, r10, r11 available for loading string data */ subs r2, #4 blt .Lindexof_remainder .Lindexof_loop4: ldrh r3, [r0, #2]! ldrh r4, [r0, #2]! ldrh r10, [r0, #2]! ldrh r11, [r0, #2]! cmp r3, r1 beq .Lmatch_0 cmp r4, r1 beq .Lmatch_1 cmp r10, r1 beq .Lmatch_2 cmp r11, r1 beq .Lmatch_3 subs r2, #4 bge .Lindexof_loop4 .Lindexof_remainder: adds r2, #4 beq .Lindexof_nomatch .Lindexof_loop1: ldrh r3, [r0, #2]! cmp r3, r1 beq .Lmatch_3 subs r2, #1 bne .Lindexof_loop1 .Lindexof_nomatch: mov r0, #-1 pop {r4, r10-r11, pc} .Lmatch_0: sub r0, #6 sub r0, r12 asr r0, r0, #1 pop {r4, r10-r11, pc} .Lmatch_1: sub r0, #4 sub r0, r12 asr r0, r0, #1 pop {r4, r10-r11, pc} .Lmatch_2: sub r0, #2 sub r0, r12 asr r0, r0, #1 pop {r4, r10-r11, pc} .Lmatch_3: sub r0, r12 asr r0, r0, #1 pop {r4, r10-r11, pc} #if (STRING_COMPRESSION_FEATURE) .Lstring_indexof_compressed: add r0, r0, r2 sub r0, #1 sub r2, r3, r2 .Lstring_indexof_compressed_loop: subs r2, #1 blt .Lindexof_nomatch ldrb r3, [r0, #1]! cmp r3, r1 beq .Lstring_indexof_compressed_matched b .Lstring_indexof_compressed_loop .Lstring_indexof_compressed_matched: sub r0, r12 pop {r4, r10-r11, pc} #endif END art_quick_indexof /* Assembly routines used to handle ABI differences. */ /* double fmod(double a, double b) */ .extern fmod ENTRY art_quick_fmod push {lr} .cfi_adjust_cfa_offset 4 .cfi_rel_offset lr, 0 sub sp, #4 .cfi_adjust_cfa_offset 4 vmov r0, r1, d0 vmov r2, r3, d1 bl fmod vmov d0, r0, r1 add sp, #4 .cfi_adjust_cfa_offset -4 pop {pc} END art_quick_fmod /* float fmodf(float a, float b) */ .extern fmodf ENTRY art_quick_fmodf push {lr} .cfi_adjust_cfa_offset 4 .cfi_rel_offset lr, 0 sub sp, #4 .cfi_adjust_cfa_offset 4 vmov r0, r1, d0 bl fmodf vmov s0, r0 add sp, #4 .cfi_adjust_cfa_offset -4 pop {pc} END art_quick_fmodf /* int64_t art_d2l(double d) */ .extern art_d2l ENTRY art_quick_d2l vmov r0, r1, d0 b art_d2l END art_quick_d2l /* int64_t art_f2l(float f) */ .extern art_f2l ENTRY art_quick_f2l vmov r0, s0 b art_f2l END art_quick_f2l /* float art_l2f(int64_t l) */ .extern art_l2f ENTRY art_quick_l2f push {lr} .cfi_adjust_cfa_offset 4 .cfi_rel_offset lr, 0 sub sp, #4 .cfi_adjust_cfa_offset 4 bl art_l2f vmov s0, r0 add sp, #4 .cfi_adjust_cfa_offset -4 pop {pc} END art_quick_l2f .extern artStringBuilderAppend ENTRY art_quick_string_builder_append SETUP_SAVE_REFS_ONLY_FRAME r2 @ save callee saves in case of GC add r1, sp, #(FRAME_SIZE_SAVE_REFS_ONLY + __SIZEOF_POINTER__) @ pass args mov r2, rSELF @ pass Thread::Current bl artStringBuilderAppend @ (uint32_t, const unit32_t*, Thread*) RESTORE_SAVE_REFS_ONLY_FRAME REFRESH_MARKING_REGISTER RETURN_OR_DEOPT_IF_RESULT_IS_NON_NULL_OR_DELIVER END art_quick_string_builder_append /* * Create a function `name` calling the ReadBarrier::Mark routine, * getting its argument and returning its result through register * `reg`, saving and restoring all caller-save registers. * * IP is clobbered; `reg` must not be IP. * * If `reg` is different from `r0`, the generated function follows a * non-standard runtime calling convention: * - register `reg` (which may be different from R0) is used to pass the (sole) argument, * - register `reg` (which may be different from R0) is used to return the result, * - all other registers are callee-save (the values they hold are preserved). */ .macro READ_BARRIER_MARK_REG name, reg ENTRY \name // Null check so that we can load the lock word. SMART_CBZ \reg, .Lret_rb_\name // Check lock word for mark bit, if marked return. Use IP for scratch since it is blocked. ldr ip, [\reg, MIRROR_OBJECT_LOCK_WORD_OFFSET] tst ip, #LOCK_WORD_MARK_BIT_MASK_SHIFTED beq .Lnot_marked_rb_\name // Already marked, return right away. .Lret_rb_\name: bx lr .Lnot_marked_rb_\name: // Test that both the forwarding state bits are 1. #if (LOCK_WORD_STATE_SHIFT != 30) || (LOCK_WORD_STATE_FORWARDING_ADDRESS != 3) // To use "CMP ip, #modified-immediate; BHS", we need the lock word state in // the highest bits and the "forwarding address" state to have all bits set. #error "Unexpected lock word state shift or forwarding address state value." #endif cmp ip, #(LOCK_WORD_STATE_FORWARDING_ADDRESS << LOCK_WORD_STATE_SHIFT) bhs .Lret_forwarding_address\name .Lslow_rb_\name: // Save IP: The kSaveEverything entrypoint art_quick_resolve_string used to // make a tail call here. Currently, it serves only for stack alignment but // we may reintroduce kSaveEverything calls here in the future. push {r0-r4, r9, ip, lr} @ save return address, core caller-save registers and ip .cfi_adjust_cfa_offset 32 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset r3, 12 .cfi_rel_offset r4, 16 .cfi_rel_offset r9, 20 .cfi_rel_offset ip, 24 .cfi_rel_offset lr, 28 .ifnc \reg, r0 mov r0, \reg @ pass arg1 - obj from `reg` .endif vpush {s0-s15} @ save floating-point caller-save registers .cfi_adjust_cfa_offset 64 bl artReadBarrierMark @ r0 <- artReadBarrierMark(obj) vpop {s0-s15} @ restore floating-point registers .cfi_adjust_cfa_offset -64 .ifc \reg, r0 @ Save result to the stack slot or destination register. str r0, [sp, #0] .else .ifc \reg, r1 str r0, [sp, #4] .else .ifc \reg, r2 str r0, [sp, #8] .else .ifc \reg, r3 str r0, [sp, #12] .else .ifc \reg, r4 str r0, [sp, #16] .else .ifc \reg, r9 str r0, [sp, #20] .else mov \reg, r0 .endif .endif .endif .endif .endif .endif pop {r0-r4, r9, ip, lr} @ restore caller-save registers .cfi_adjust_cfa_offset -32 .cfi_restore r0 .cfi_restore r1 .cfi_restore r2 .cfi_restore r3 .cfi_restore r4 .cfi_restore r9 .cfi_restore ip .cfi_restore lr bx lr .Lret_forwarding_address\name: // Shift left by the forwarding address shift. This clears out the state bits since they are // in the top 2 bits of the lock word. lsl \reg, ip, #LOCK_WORD_STATE_FORWARDING_ADDRESS_SHIFT bx lr END \name .endm READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg00, r0 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg01, r1 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg02, r2 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg03, r3 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg04, r4 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg05, r5 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg06, r6 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg07, r7 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg08, r8 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg09, r9 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg10, r10 READ_BARRIER_MARK_REG art_quick_read_barrier_mark_reg11, r11 // Helper macros for Baker CC read barrier mark introspection (BRBMI). .macro BRBMI_FOR_REGISTERS macro_for_register, macro_for_reserved_register \macro_for_register r0 \macro_for_register r1 \macro_for_register r2 \macro_for_register r3 \macro_for_register r4 \macro_for_register r5 \macro_for_register r6 \macro_for_register r7 \macro_for_reserved_register // r8 (rMR) is the marking register. \macro_for_register r9 \macro_for_register r10 \macro_for_register r11 \macro_for_reserved_register // IP is reserved. \macro_for_reserved_register // SP is reserved. \macro_for_reserved_register // LR is reserved. \macro_for_reserved_register // PC is reserved. .endm .macro BRBMI_RETURN_SWITCH_CASE reg .balign 8 .Lmark_introspection_return_switch_case_\reg: mov rMR, #1 mov \reg, ip bx lr .endm .macro BRBMI_RETURN_SWITCH_CASE_OFFSET reg .byte (.Lmark_introspection_return_switch_case_\reg - .Lmark_introspection_return_table) / 2 .endm .macro BRBMI_BAD_RETURN_SWITCH_CASE_OFFSET .byte (.Lmark_introspection_return_switch_case_bad - .Lmark_introspection_return_table) / 2 .endm #if BAKER_MARK_INTROSPECTION_FIELD_LDR_WIDE_OFFSET != BAKER_MARK_INTROSPECTION_ARRAY_LDR_OFFSET #error "Array and field introspection code sharing requires same LDR offset." #endif .macro BRBMI_ARRAY_LOAD index_reg ldr ip, [ip, \index_reg, lsl #2] // 4 bytes. b art_quick_read_barrier_mark_introspection // Should be 2 bytes, encoding T2. .balign 8 // Add padding to 8 bytes. .endm .macro BRBMI_BKPT_FILL_4B bkpt 0 bkpt 0 .endm .macro BRBMI_BKPT_FILL_8B BRBMI_BKPT_FILL_4B BRBMI_BKPT_FILL_4B .endm .macro BRBMI_RUNTIME_CALL // Note: This macro generates exactly 22 bytes of code. The core register // PUSH and the MOVs are 16-bit instructions, the rest is 32-bit instructions. push {r0-r3, r7, lr} // Save return address and caller-save registers. .cfi_adjust_cfa_offset 24 .cfi_rel_offset r0, 0 .cfi_rel_offset r1, 4 .cfi_rel_offset r2, 8 .cfi_rel_offset r3, 12 .cfi_rel_offset r7, 16 .cfi_rel_offset lr, 20 mov r0, ip // Pass the reference. vpush {s0-s15} // save floating-point caller-save registers .cfi_adjust_cfa_offset 64 bl artReadBarrierMark // r0 <- artReadBarrierMark(obj) vpop {s0-s15} // restore floating-point registers .cfi_adjust_cfa_offset -64 mov ip, r0 // Move reference to ip in preparation for return switch. pop {r0-r3, r7, lr} // Restore registers. .cfi_adjust_cfa_offset -24 .cfi_restore r0 .cfi_restore r1 .cfi_restore r2 .cfi_restore r3 .cfi_restore r7 .cfi_restore lr .endm .macro BRBMI_CHECK_NULL_AND_MARKED label_suffix // If reference is null, just return it in the right register. cmp ip, #0 beq .Lmark_introspection_return\label_suffix // Use rMR as temp and check the mark bit of the reference. ldr rMR, [ip, #MIRROR_OBJECT_LOCK_WORD_OFFSET] tst rMR, #LOCK_WORD_MARK_BIT_MASK_SHIFTED beq .Lmark_introspection_unmarked\label_suffix .Lmark_introspection_return\label_suffix: .endm .macro BRBMI_UNMARKED_FORWARDING_ADDRESS_CHECK label_suffix .Lmark_introspection_unmarked\label_suffix: // Check if the top two bits are one, if this is the case it is a forwarding address. #if (LOCK_WORD_STATE_SHIFT != 30) || (LOCK_WORD_STATE_FORWARDING_ADDRESS != 3) // To use "CMP ip, #modified-immediate; BHS", we need the lock word state in // the highest bits and the "forwarding address" state to have all bits set. #error "Unexpected lock word state shift or forwarding address state value." #endif cmp rMR, #(LOCK_WORD_STATE_FORWARDING_ADDRESS << LOCK_WORD_STATE_SHIFT) bhs .Lmark_introspection_forwarding_address\label_suffix .endm .macro BRBMI_EXTRACT_FORWARDING_ADDRESS label_suffix .Lmark_introspection_forwarding_address\label_suffix: // Note: This macro generates exactly 22 bytes of code, the branch is near. // Shift left by the forwarding address shift. This clears out the state bits since they are // in the top 2 bits of the lock word. lsl ip, rMR, #LOCK_WORD_STATE_FORWARDING_ADDRESS_SHIFT b .Lmark_introspection_return\label_suffix .endm .macro BRBMI_LOAD_RETURN_REG_FROM_CODE_wide ldr_offset // Load the half of the instruction that contains Rt. Adjust for the thumb state in LR. ldrh rMR, [lr, #(-1 + \ldr_offset + 2)] .endm .macro BRBMI_LOAD_RETURN_REG_FROM_CODE_narrow ldr_offset // Load the 16-bit instruction. Adjust for the thumb state in LR. ldrh rMR, [lr, #(-1 + \ldr_offset)] .endm .macro BRBMI_EXTRACT_RETURN_REG_wide lsr rMR, rMR, #12 // Extract `ref_reg`. .endm .macro BRBMI_EXTRACT_RETURN_REG_narrow and rMR, rMR, #7 // Extract `ref_reg`. .endm .macro BRBMI_LOAD_AND_EXTRACT_RETURN_REG ldr_offset, label_suffix BRBMI_LOAD_RETURN_REG_FROM_CODE\label_suffix \ldr_offset BRBMI_EXTRACT_RETURN_REG\label_suffix .endm .macro BRBMI_GC_ROOT gc_root_ldr_offset, label_suffix .balign 32 .thumb_func .type art_quick_read_barrier_mark_introspection_gc_roots\label_suffix, #function .hidden art_quick_read_barrier_mark_introspection_gc_roots\label_suffix .global art_quick_read_barrier_mark_introspection_gc_roots\label_suffix art_quick_read_barrier_mark_introspection_gc_roots\label_suffix: BRBMI_LOAD_AND_EXTRACT_RETURN_REG \gc_root_ldr_offset, \label_suffix .endm .macro BRBMI_FIELD_SLOW_PATH ldr_offset, label_suffix .balign 16 // Note: Generates exactly 16 bytes of code. BRBMI_UNMARKED_FORWARDING_ADDRESS_CHECK \label_suffix BRBMI_LOAD_AND_EXTRACT_RETURN_REG \ldr_offset, \label_suffix b .Lmark_introspection_runtime_call .endm /* * Use introspection to load a reference from the same address as the LDR * instruction in generated code would load (unless loaded by the thunk, * see below), call ReadBarrier::Mark() with that reference if needed * and return it in the same register as the LDR instruction would load. * * The entrypoint is called through a thunk that differs across load kinds. * For field and array loads the LDR instruction in generated code follows * the branch to the thunk, i.e. the LDR is (ignoring the heap poisoning) * at [LR, #(-4 - 1)] (encoding T3) or [LR, #(-2 - 1)] (encoding T1) where * the -1 is an adjustment for the Thumb mode bit in LR, and the thunk * knows the holder and performs the gray bit check, returning to the LDR * instruction if the object is not gray, so this entrypoint no longer * needs to know anything about the holder. For GC root loads, the LDR * instruction in generated code precedes the branch to the thunk, i.e. the * LDR is at [LR, #(-8 - 1)] (encoding T3) or [LR, #(-6 - 1)] (encoding T1) * where the -1 is again the Thumb mode bit adjustment, and the thunk does * not do the gray bit check. * * For field accesses and array loads with a constant index the thunk loads * the reference into IP using introspection and calls the main entrypoint * ("wide", for 32-bit LDR) art_quick_read_barrier_mark_introspection or * the "narrow" entrypoint (for 16-bit LDR). The latter is at a known * offset (BAKER_MARK_INTROSPECTION_FIELD_LDR_NARROW_ENTRYPOINT_OFFSET) * from the main entrypoint and the thunk adjusts the entrypoint pointer. * With heap poisoning enabled, the passed reference is poisoned. * * For array accesses with non-constant index, the thunk inserts the bits * 0-5 of the LDR instruction to the entrypoint address, effectively * calculating a switch case label based on the index register (bits 0-3) * and adding an extra offset (bits 4-5 hold the shift which is always 2 * for reference loads) to differentiate from the main entrypoint, then * moves the base register to IP and jumps to the switch case. Therefore * we need to align the main entrypoint to 512 bytes, accounting for * a 256-byte offset followed by 16 array entrypoints starting at * art_quick_read_barrier_mark_introspection_arrays, each containing an LDR * (register) and a branch to the main entrypoint. * * For GC root accesses we cannot use the main entrypoint because of the * different offset where the LDR instruction in generated code is located. * (And even with heap poisoning enabled, GC roots are not poisoned.) * To re-use the same entrypoint pointer in generated code, we make sure * that the gc root entrypoint (a copy of the entrypoint with a different * offset for introspection loads) is located at a known offset (0xc0/0xe0 * bytes, or BAKER_MARK_INTROSPECTION_GC_ROOT_LDR_WIDE_ENTRYPOINT_OFFSET/ * BAKER_MARK_INTROSPECTION_GC_ROOT_LDR_NARROW_ENTRYPOINT_OFFSET) from the * main entrypoint and the GC root thunk adjusts the entrypoint pointer, * moves the root register to IP and jumps to the customized entrypoint, * art_quick_read_barrier_mark_introspection_gc_roots_{wide,narrow}. * The thunk also performs all the fast-path checks, so we need just the * slow path. * * Intrinsic CAS operations (VarHandle*CompareAnd{Set,Exchange}* and * UnsafeCASObject) use similar code to the GC roots wide load but using * MOV (register, T3) instead of the LDR (immediate, T3), with destination * register in bits 8-11 rather than 12-15. Therefore they have their own * entrypoint, art_quick_read_barrier_mark_introspection_intrinsic_cas * at the offset BAKER_MARK_INTROSPECTION_INTRINSIC_CAS_ENTRYPOINT_OFFSET. * This is used only for high registers, low registers reuse the GC roots * narrow load entrypoint as the low 3 bits of the destination register * for MOV (register) encoding T1 match the LDR (immediate) encoding T1. * * The code structure is * art_quick_read_barrier_mark_introspection: // @0x00 * Up to 32 bytes code for main entrypoint fast-path code for fields * (and array elements with constant offset) with LDR encoding T3; * jumps to the switch in the "narrow" entrypoint. * art_quick_read_barrier_mark_introspection_narrow: // @0x20 * Up to 48 bytes code for fast path code for fields (and array * elements with constant offset) with LDR encoding T1, ending in the * return switch instruction TBB and the table with switch offsets. * .Lmark_introspection_return_switch_case_r0: // @0x50 * Exactly 88 bytes of code for the return switch cases (8 bytes per * case, 11 cases; no code for reserved registers). * .Lmark_introspection_forwarding_address_narrow: // @0xa8 * Exactly 6 bytes to extract the forwarding address and jump to the * "narrow" entrypoint fast path. * .Lmark_introspection_return_switch_case_bad: // @0xae * Exactly 2 bytes, bkpt for unexpected return register. * .Lmark_introspection_unmarked_narrow: // @0xb0 * Exactly 16 bytes for "narrow" entrypoint slow path. * art_quick_read_barrier_mark_introspection_gc_roots_wide: // @0xc0 * GC root entrypoint code for LDR encoding T3 (10 bytes); loads and * extracts the return register and jumps to the runtime call. * .Lmark_introspection_forwarding_address_wide: // @0xca * Exactly 6 bytes to extract the forwarding address and jump to the * "wide" entrypoint fast path. * .Lmark_introspection_unmarked_wide: // @0xd0 * Exactly 16 bytes for "wide" entrypoint slow path. * art_quick_read_barrier_mark_introspection_gc_roots_narrow: // @0xe0 * GC root entrypoint code for LDR encoding T1 (8 bytes); loads and * extracts the return register and falls through to the runtime call. * .Lmark_introspection_runtime_call: // @0xe8 * Exactly 24 bytes for the runtime call to MarkReg() and jump to the * return switch. * art_quick_read_barrier_mark_introspection_arrays: // @0x100 * Exactly 128 bytes for array load switch cases (16x2 instructions). * art_quick_read_barrier_mark_introspection_intrinsic_cas: // @0x180 * Intrinsic CAS entrypoint for MOV (register) encoding T3 (6 bytes). * Loads the return register and jumps to the runtime call. */ #if defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) ENTRY_ALIGNED art_quick_read_barrier_mark_introspection, 512 // At this point, IP contains the reference, rMR is clobbered by the thunk // and can be freely used as it will be set back to 1 before returning. // For heap poisoning, the reference is poisoned, so unpoison it first. UNPOISON_HEAP_REF ip // Check for null or marked, lock word is loaded into rMR. BRBMI_CHECK_NULL_AND_MARKED _wide // Load and extract the return register from the instruction. BRBMI_LOAD_AND_EXTRACT_RETURN_REG BAKER_MARK_INTROSPECTION_FIELD_LDR_WIDE_OFFSET, _wide b .Lmark_introspection_return_switch .balign 32 .thumb_func .type art_quick_read_barrier_mark_introspection_narrow, #function .hidden art_quick_read_barrier_mark_introspection_narrow .global art_quick_read_barrier_mark_introspection_narrow art_quick_read_barrier_mark_introspection_narrow: // At this point, IP contains the reference, rMR is clobbered by the thunk // and can be freely used as it will be set back to 1 before returning. // For heap poisoning, the reference is poisoned, so unpoison it first. UNPOISON_HEAP_REF ip // Check for null or marked, lock word is loaded into rMR. BRBMI_CHECK_NULL_AND_MARKED _narrow // Load and extract the return register from the instruction. BRBMI_LOAD_AND_EXTRACT_RETURN_REG BAKER_MARK_INTROSPECTION_FIELD_LDR_NARROW_OFFSET, _narrow .Lmark_introspection_return_switch: tbb [pc, rMR] // Jump to the switch case. .Lmark_introspection_return_table: BRBMI_FOR_REGISTERS BRBMI_RETURN_SWITCH_CASE_OFFSET, BRBMI_BAD_RETURN_SWITCH_CASE_OFFSET BRBMI_FOR_REGISTERS BRBMI_RETURN_SWITCH_CASE, /* no code */ .balign 8 BRBMI_EXTRACT_FORWARDING_ADDRESS _narrow // 6 bytes .Lmark_introspection_return_switch_case_bad: bkpt // 2 bytes BRBMI_FIELD_SLOW_PATH BAKER_MARK_INTROSPECTION_FIELD_LDR_NARROW_OFFSET, _narrow // 8 bytes for the loading and extracting of the return register. BRBMI_GC_ROOT BAKER_MARK_INTROSPECTION_GC_ROOT_LDR_WIDE_OFFSET, _wide // 2 bytes for near branch to the runtime call. b .Lmark_introspection_runtime_call BRBMI_EXTRACT_FORWARDING_ADDRESS _wide // Not even 4-byte aligned. BRBMI_FIELD_SLOW_PATH BAKER_MARK_INTROSPECTION_FIELD_LDR_WIDE_OFFSET, _wide // 8 bytes for the loading and extracting of the return register. BRBMI_GC_ROOT BAKER_MARK_INTROSPECTION_GC_ROOT_LDR_NARROW_OFFSET, _narrow // And the runtime call and branch to the switch taking exactly 24 bytes // (22 bytes for BRBMI_RUNTIME_CALL and 2 bytes for the near branch) // shall take the rest of the 32-byte section (within a cache line). .Lmark_introspection_runtime_call: BRBMI_RUNTIME_CALL b .Lmark_introspection_return_switch .balign 256 .thumb_func .type art_quick_read_barrier_mark_introspection_arrays, #function .hidden art_quick_read_barrier_mark_introspection_arrays .global art_quick_read_barrier_mark_introspection_arrays art_quick_read_barrier_mark_introspection_arrays: BRBMI_FOR_REGISTERS BRBMI_ARRAY_LOAD, BRBMI_BKPT_FILL_8B .balign 8 .thumb_func .type art_quick_read_barrier_mark_introspection_intrinsic_cas, #function .hidden art_quick_read_barrier_mark_introspection_intrinsic_cas .global art_quick_read_barrier_mark_introspection_intrinsic_cas art_quick_read_barrier_mark_introspection_intrinsic_cas: // Load the byte of the MOV instruction that contains Rd. Adjust for the thumb state in LR. // The MOV (register, T3) is |11101010010|S|1111|(0)000|Rd|0000|Rm|, so the byte we read // here, i.e. |(0)000|Rd|, contains only the register number, the top 4 bits are 0. ldrb rMR, [lr, #(-1 + BAKER_MARK_INTROSPECTION_INTRINSIC_CAS_MOV_OFFSET + 3)] b .Lmark_introspection_runtime_call END art_quick_read_barrier_mark_introspection #else // defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) ENTRY art_quick_read_barrier_mark_introspection bkpt // Unreachable. END art_quick_read_barrier_mark_introspection #endif // defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) .extern artInvokePolymorphic ENTRY art_quick_invoke_polymorphic SETUP_SAVE_REFS_AND_ARGS_FRAME r2 mov r0, r1 @ r0 := receiver mov r1, rSELF @ r1 := Thread::Current mov r2, sp @ r2 := SP bl artInvokePolymorphic @ artInvokePolymorphic(receiver, Thread*, SP) str r1, [sp, 72] @ r0:r1 := Result. Copy r1 to context. RESTORE_SAVE_REFS_AND_ARGS_FRAME REFRESH_MARKING_REGISTER vmov d0, r0, r1 @ Put result r0:r1 into floating point return register. RETURN_OR_DELIVER_PENDING_EXCEPTION_REG r2 END art_quick_invoke_polymorphic .extern artInvokeCustom ENTRY art_quick_invoke_custom SETUP_SAVE_REFS_AND_ARGS_FRAME r1 @ r0 := call_site_idx mov r1, rSELF @ r1 := Thread::Current mov r2, sp @ r2 := SP bl artInvokeCustom @ artInvokeCustom(call_site_idx, Thread*, SP) str r1, [sp, #72] @ Save r1 to context (r0:r1 = result) RESTORE_SAVE_REFS_AND_ARGS_FRAME REFRESH_MARKING_REGISTER vmov d0, r0, r1 @ Put result r0:r1 into floating point return register. RETURN_OR_DELIVER_PENDING_EXCEPTION_REG r2 END art_quick_invoke_custom // r0 contains the class, r4 contains the inline cache. We can use ip as temporary. ENTRY art_quick_update_inline_cache #if (INLINE_CACHE_SIZE != 5) #error "INLINE_CACHE_SIZE not as expected." #endif #if defined(USE_READ_BARRIER) && defined(USE_BAKER_READ_BARRIER) // Don't update the cache if we are marking. cmp rMR, #0 bne .Ldone #endif .Lentry1: ldr ip, [r4, #INLINE_CACHE_CLASSES_OFFSET] cmp ip, r0 beq .Ldone cmp ip, #0 bne .Lentry2 ldrex ip, [r4, #INLINE_CACHE_CLASSES_OFFSET] cmp ip, #0 bne .Lentry1 strex ip, r0, [r4, #INLINE_CACHE_CLASSES_OFFSET] cmp ip, #0 bne .Ldone b .Lentry1 .Lentry2: ldr ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+4] cmp ip, r0 beq .Ldone cmp ip, #0 bne .Lentry3 ldrex ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+4] cmp ip, #0 bne .Lentry2 strex ip, r0, [r4, #INLINE_CACHE_CLASSES_OFFSET+4] cmp ip, #0 bne .Ldone b .Lentry2 .Lentry3: ldr ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+8] cmp ip, r0 beq .Ldone cmp ip, #0 bne .Lentry4 ldrex ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+8] cmp ip, #0 bne .Lentry3 strex ip, r0, [r4, #INLINE_CACHE_CLASSES_OFFSET+8] cmp ip, #0 bne .Ldone b .Lentry3 .Lentry4: ldr ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+12] cmp ip, r0 beq .Ldone cmp ip, #0 bne .Lentry5 ldrex ip, [r4, #INLINE_CACHE_CLASSES_OFFSET+12] cmp ip, #0 bne .Lentry4 strex ip, r0, [r4, #INLINE_CACHE_CLASSES_OFFSET+12] cmp ip, #0 bne .Ldone b .Lentry4 .Lentry5: // Unconditionally store, the inline cache is megamorphic. str r0, [r4, #INLINE_CACHE_CLASSES_OFFSET+16] .Ldone: blx lr END art_quick_update_inline_cache // On entry, method is at the bottom of the stack. ENTRY art_quick_compile_optimized SETUP_SAVE_EVERYTHING_FRAME r0 ldr r0, [sp, FRAME_SIZE_SAVE_EVERYTHING] @ pass ArtMethod mov r1, rSELF @ pass Thread::Current bl artCompileOptimized @ (ArtMethod*, Thread*) RESTORE_SAVE_EVERYTHING_FRAME // We don't need to restore the marking register here, as // artCompileOptimized doesn't allow thread suspension. blx lr END art_quick_compile_optimized // On entry, method is at the bottom of the stack. ENTRY art_quick_compile_baseline SETUP_SAVE_EVERYTHING_FRAME r0 ldr r0, [sp, FRAME_SIZE_SAVE_EVERYTHING] @ pass ArtMethod mov r1, rSELF @ pass Thread::Current bl artCompileBaseline @ (ArtMethod*, Thread*) RESTORE_SAVE_EVERYTHING_FRAME // We don't need to restore the marking register here, as // artCompileBaseline doesn't allow thread suspension. blx lr END art_quick_compile_baseline // On entry, method is at the bottom of the stack. ENTRY art_quick_method_entry_hook SETUP_SAVE_EVERYTHING_FRAME r0 ldr r0, [sp, FRAME_SIZE_SAVE_EVERYTHING] @ pass ArtMethod mov r1, rSELF @ pass Thread::Current mov r2, sp @ pass SP bl artMethodEntryHook @ (ArtMethod*, Thread*, SP) CFI_REMEMBER_STATE cbnz r0, .Lentryhook_deopt RESTORE_SAVE_EVERYTHING_FRAME REFRESH_MARKING_REGISTER blx lr .Lentryhook_deopt: // Deoptimize CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_method_entry_hook ENTRY art_quick_method_exit_hook SETUP_SAVE_EVERYTHING_FRAME r5 INCREASE_FRAME 4 @ align stack push {r2} @ pass frame_size stack .cfi_adjust_cfa_offset 4 add r3, sp, #(8 + 8) @ store fpr_res pointer, in kSaveEverything frame add r2, sp, #(136 + 8) @ store gpr_res pointer, in kSaveEverything frame add r1, sp, #(FRAME_SIZE_SAVE_EVERYTHING + 8) @ pass ArtMethod** mov r0, rSELF @ pass Thread::Current blx artMethodExitHook @ (Thread*, ArtMethod**, gpr_res*, fpr_res*, @ frame_size) DECREASE_FRAME 8 @ pop arguments on stack CFI_REMEMBER_STATE cbnz r0, .Lexithook_deopt_or_exception RESTORE_SAVE_EVERYTHING_FRAME REFRESH_MARKING_REGISTER blx lr .Lexithook_deopt_or_exception: // Deoptimize or exception thrown. CFI_RESTORE_STATE_AND_DEF_CFA sp, FRAME_SIZE_SAVE_EVERYTHING bl art_quick_do_long_jump @ (Context*) bkpt // Unreached END art_quick_method_exit_hook