sharedRuntime.cpp revision 5946:b5c8a61d7fa0
119370Spst/* 2130803Smarcel * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. 3130803Smarcel * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4130803Smarcel * 5130803Smarcel * This code is free software; you can redistribute it and/or modify it 619370Spst * under the terms of the GNU General Public License version 2 only, as 719370Spst * published by the Free Software Foundation. 819370Spst * 998944Sobrien * This code is distributed in the hope that it will be useful, but WITHOUT 1019370Spst * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1198944Sobrien * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1298944Sobrien * version 2 for more details (a copy is included in the LICENSE file that 1398944Sobrien * accompanied this code). 1498944Sobrien * 1519370Spst * You should have received a copy of the GNU General Public License version 1698944Sobrien * 2 along with this work; if not, write to the Free Software Foundation, 1798944Sobrien * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1898944Sobrien * 1998944Sobrien * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 2019370Spst * or visit www.oracle.com if you need additional information or have any 2198944Sobrien * questions. 2298944Sobrien * 2398944Sobrien */ 2498944Sobrien 2519370Spst#include "precompiled.hpp" 2619370Spst#include "classfile/systemDictionary.hpp" 2719370Spst#include "classfile/vmSymbols.hpp" 2819370Spst#include "code/compiledIC.hpp" 2919370Spst#include "code/scopeDesc.hpp" 3019370Spst#include "code/vtableStubs.hpp" 3119370Spst#include "compiler/abstractCompiler.hpp" 3219370Spst#include "compiler/compileBroker.hpp" 3319370Spst#include "compiler/compilerOracle.hpp" 3419370Spst#include "compiler/disassembler.hpp" 3519370Spst#include "interpreter/interpreter.hpp" 3619370Spst#include "interpreter/interpreterRuntime.hpp" 3719370Spst#include "memory/gcLocker.inline.hpp" 3819370Spst#include "memory/universe.inline.hpp" 3919370Spst#include "oops/oop.inline.hpp" 4019370Spst#include "prims/forte.hpp" 4119370Spst#include "prims/jvmtiExport.hpp" 4219370Spst#include "prims/jvmtiRedefineClassesTrace.hpp" 4319370Spst#include "prims/methodHandles.hpp" 4419370Spst#include "prims/nativeLookup.hpp" 4519370Spst#include "runtime/arguments.hpp" 4698944Sobrien#include "runtime/biasedLocking.hpp" 47130803Smarcel#include "runtime/handles.inline.hpp" 4819370Spst#include "runtime/init.hpp" 4998944Sobrien#include "runtime/interfaceSupport.hpp" 5019370Spst#include "runtime/javaCalls.hpp" 5198944Sobrien#include "runtime/sharedRuntime.hpp" 5219370Spst#include "runtime/stubRoutines.hpp" 5398944Sobrien#include "runtime/vframe.hpp" 5419370Spst#include "runtime/vframeArray.hpp" 5598944Sobrien#include "utilities/copy.hpp" 5619370Spst#include "utilities/dtrace.hpp" 5798944Sobrien#include "utilities/events.hpp" 5819370Spst#include "utilities/hashtable.inline.hpp" 5998944Sobrien#include "utilities/macros.hpp" 6019370Spst#include "utilities/xmlstream.hpp" 6198944Sobrien#ifdef TARGET_ARCH_x86 6219370Spst# include "nativeInst_x86.hpp" 6398944Sobrien# include "vmreg_x86.inline.hpp" 6419370Spst#endif 6598944Sobrien#ifdef TARGET_ARCH_sparc 6619370Spst# include "nativeInst_sparc.hpp" 6798944Sobrien# include "vmreg_sparc.inline.hpp" 6819370Spst#endif 6998944Sobrien#ifdef TARGET_ARCH_zero 7019370Spst# include "nativeInst_zero.hpp" 7198944Sobrien# include "vmreg_zero.inline.hpp" 7219370Spst#endif 7398944Sobrien#ifdef TARGET_ARCH_arm 7419370Spst# include "nativeInst_arm.hpp" 7598944Sobrien# include "vmreg_arm.inline.hpp" 7619370Spst#endif 7798944Sobrien#ifdef TARGET_ARCH_ppc 7846283Sdfr# include "nativeInst_ppc.hpp" 7998944Sobrien# include "vmreg_ppc.inline.hpp" 8046283Sdfr#endif 8198944Sobrien#ifdef COMPILER1 8246283Sdfr#include "c1/c1_Runtime1.hpp" 8398944Sobrien#endif 8446283Sdfr 8598944Sobrien// Shared stub locations 8646283SdfrRuntimeStub* SharedRuntime::_wrong_method_blob; 8798944SobrienRuntimeStub* SharedRuntime::_ic_miss_blob; 8846283SdfrRuntimeStub* SharedRuntime::_resolve_opt_virtual_call_blob; 8998944SobrienRuntimeStub* SharedRuntime::_resolve_virtual_call_blob; 9098944SobrienRuntimeStub* SharedRuntime::_resolve_static_call_blob; 9198944Sobrien 9246283SdfrDeoptimizationBlob* SharedRuntime::_deopt_blob; 9398944SobrienSafepointBlob* SharedRuntime::_polling_page_vectors_safepoint_handler_blob; 9498944SobrienSafepointBlob* SharedRuntime::_polling_page_safepoint_handler_blob; 9598944SobrienSafepointBlob* SharedRuntime::_polling_page_return_handler_blob; 9698944Sobrien 9798944Sobrien#ifdef COMPILER2 9898944SobrienUncommonTrapBlob* SharedRuntime::_uncommon_trap_blob; 9998944Sobrien#endif // COMPILER2 10098944Sobrien 10198944Sobrien 10298944Sobrien//----------------------------generate_stubs----------------------------------- 10398944Sobrienvoid SharedRuntime::generate_stubs() { 104130803Smarcel _wrong_method_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method), "wrong_method_stub"); 105130803Smarcel _ic_miss_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss), "ic_miss_stub"); 10619370Spst _resolve_opt_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C), "resolve_opt_virtual_call"); 10719370Spst _resolve_virtual_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C), "resolve_virtual_call"); 10898944Sobrien _resolve_static_call_blob = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C), "resolve_static_call"); 10919370Spst 11098944Sobrien#ifdef COMPILER2 11198944Sobrien // Vectors are generated only by C2. 11298944Sobrien if (is_wide_vector(MaxVectorSize)) { 11319370Spst _polling_page_vectors_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_VECTOR_LOOP); 11419370Spst } 11519370Spst#endif // COMPILER2 11619370Spst _polling_page_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_LOOP); 11719370Spst _polling_page_return_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_RETURN); 11898944Sobrien 11998944Sobrien generate_deopt_blob(); 12019370Spst 12119370Spst#ifdef COMPILER2 12219370Spst generate_uncommon_trap_blob(); 12319370Spst#endif // COMPILER2 12419370Spst} 12519370Spst 12619370Spst#include <math.h> 12719370Spst 12819370Spst#ifndef USDT2 12919370SpstHS_DTRACE_PROBE_DECL4(hotspot, object__alloc, Thread*, char*, int, size_t); 13019370SpstHS_DTRACE_PROBE_DECL7(hotspot, method__entry, int, 13119370Spst char*, int, char*, int, char*, int); 13219370SpstHS_DTRACE_PROBE_DECL7(hotspot, method__return, int, 13319370Spst char*, int, char*, int, char*, int); 13419370Spst#endif /* !USDT2 */ 13519370Spst 13619370Spst// Implementation of SharedRuntime 13719370Spst 13819370Spst#ifndef PRODUCT 13919370Spst// For statistics 14019370Spstint SharedRuntime::_ic_miss_ctr = 0; 14119370Spstint SharedRuntime::_wrong_method_ctr = 0; 14219370Spstint SharedRuntime::_resolve_static_ctr = 0; 14319370Spstint SharedRuntime::_resolve_virtual_ctr = 0; 14419370Spstint SharedRuntime::_resolve_opt_virtual_ctr = 0; 14519370Spstint SharedRuntime::_implicit_null_throws = 0; 14619370Spstint SharedRuntime::_implicit_div0_throws = 0; 14798944Sobrienint SharedRuntime::_throw_null_ctr = 0; 14819370Spst 14919370Spstint SharedRuntime::_nof_normal_calls = 0; 15019370Spstint SharedRuntime::_nof_optimized_calls = 0; 15119370Spstint SharedRuntime::_nof_inlined_calls = 0; 15298944Sobrienint SharedRuntime::_nof_megamorphic_calls = 0; 15398944Sobrienint SharedRuntime::_nof_static_calls = 0; 15419370Spstint SharedRuntime::_nof_inlined_static_calls = 0; 15519370Spstint SharedRuntime::_nof_interface_calls = 0; 15619370Spstint SharedRuntime::_nof_optimized_interface_calls = 0; 15719370Spstint SharedRuntime::_nof_inlined_interface_calls = 0; 15819370Spstint SharedRuntime::_nof_megamorphic_interface_calls = 0; 15919370Spstint SharedRuntime::_nof_removable_exceptions = 0; 16098944Sobrien 16119370Spstint SharedRuntime::_new_instance_ctr=0; 16298944Sobrienint SharedRuntime::_new_array_ctr=0; 16319370Spstint SharedRuntime::_multi1_ctr=0; 16498944Sobrienint SharedRuntime::_multi2_ctr=0; 16598944Sobrienint SharedRuntime::_multi3_ctr=0; 16698944Sobrienint SharedRuntime::_multi4_ctr=0; 16798944Sobrienint SharedRuntime::_multi5_ctr=0; 16898944Sobrienint SharedRuntime::_mon_enter_stub_ctr=0; 16919370Spstint SharedRuntime::_mon_exit_stub_ctr=0; 17019370Spstint SharedRuntime::_mon_enter_ctr=0; 17119370Spstint SharedRuntime::_mon_exit_ctr=0; 17219370Spstint SharedRuntime::_partial_subtype_ctr=0; 17398944Sobrienint SharedRuntime::_jbyte_array_copy_ctr=0; 17419370Spstint SharedRuntime::_jshort_array_copy_ctr=0; 17519370Spstint SharedRuntime::_jint_array_copy_ctr=0; 17619370Spstint SharedRuntime::_jlong_array_copy_ctr=0; 17719370Spstint SharedRuntime::_oop_array_copy_ctr=0; 17819370Spstint SharedRuntime::_checkcast_array_copy_ctr=0; 17919370Spstint SharedRuntime::_unsafe_array_copy_ctr=0; 18019370Spstint SharedRuntime::_generic_array_copy_ctr=0; 18198944Sobrienint SharedRuntime::_slow_array_copy_ctr=0; 18219370Spstint SharedRuntime::_find_handler_ctr=0; 18319370Spstint SharedRuntime::_rethrow_ctr=0; 18419370Spst 18519370Spstint SharedRuntime::_ICmiss_index = 0; 18619370Spstint SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count]; 18719370Spstaddress SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count]; 18819370Spst 18919370Spst 19019370Spstvoid SharedRuntime::trace_ic_miss(address at) { 19119370Spst for (int i = 0; i < _ICmiss_index; i++) { 19219370Spst if (_ICmiss_at[i] == at) { 19319370Spst _ICmiss_count[i]++; 19419370Spst return; 19598944Sobrien } 19698944Sobrien } 19719370Spst int index = _ICmiss_index++; 19819370Spst if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1; 19919370Spst _ICmiss_at[index] = at; 20019370Spst _ICmiss_count[index] = 1; 20198944Sobrien} 20219370Spst 20319370Spstvoid SharedRuntime::print_ic_miss_histogram() { 20419370Spst if (ICMissHistogram) { 20519370Spst tty->print_cr ("IC Miss Histogram:"); 20698944Sobrien int tot_misses = 0; 20798944Sobrien for (int i = 0; i < _ICmiss_index; i++) { 208130803Smarcel tty->print_cr(" at: " INTPTR_FORMAT " nof: %d", _ICmiss_at[i], _ICmiss_count[i]); 20998944Sobrien tot_misses += _ICmiss_count[i]; 21098944Sobrien } 21198944Sobrien tty->print_cr ("Total IC misses: %7d", tot_misses); 21298944Sobrien } 21398944Sobrien} 21498944Sobrien#endif // PRODUCT 21598944Sobrien 21698944Sobrien#if INCLUDE_ALL_GCS 21798944Sobrien 21898944Sobrien// G1 write-barrier pre: executed before a pointer store. 21998944SobrienJRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread)) 22098944Sobrien if (orig == NULL) { 22198944Sobrien assert(false, "should be optimized out"); 22298944Sobrien return; 22398944Sobrien } 22498944Sobrien assert(orig->is_oop(true /* ignore mark word */), "Error"); 22598944Sobrien // store the original value that was in the field reference 22698944Sobrien thread->satb_mark_queue().enqueue(orig); 22798944SobrienJRT_END 22898944Sobrien 22998944Sobrien// G1 write-barrier post: executed after a pointer store. 23098944SobrienJRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread)) 23198944Sobrien thread->dirty_card_queue().enqueue(card_addr); 23219370SpstJRT_END 23319370Spst 23419370Spst#endif // INCLUDE_ALL_GCS 23519370Spst 23698944Sobrien 23798944SobrienJRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x)) 23898944Sobrien return x * y; 23998944SobrienJRT_END 24019370Spst 24119370Spst 24219370SpstJRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x)) 24319370Spst if (x == min_jlong && y == CONST64(-1)) { 24419370Spst return x; 24598944Sobrien } else { 24619370Spst return x / y; 24798944Sobrien } 24898944SobrienJRT_END 24998944Sobrien 25019370Spst 25119370SpstJRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x)) 25219370Spst if (x == min_jlong && y == CONST64(-1)) { 25319370Spst return 0; 25498944Sobrien } else { 25519370Spst return x % y; 256130803Smarcel } 25798944SobrienJRT_END 25819370Spst 25919370Spst 26098944Sobrienconst juint float_sign_mask = 0x7FFFFFFF; 261130803Smarcelconst juint float_infinity = 0x7F800000; 26298944Sobrienconst julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF); 26319370Spstconst julong double_infinity = CONST64(0x7FF0000000000000); 26419370Spst 26598944SobrienJRT_LEAF(jfloat, SharedRuntime::frem(jfloat x, jfloat y)) 266130803Smarcel#ifdef _WIN64 26798944Sobrien // 64-bit Windows on amd64 returns the wrong values for 26819370Spst // infinity operands. 26919370Spst union { jfloat f; juint i; } xbits, ybits; 27098944Sobrien xbits.f = x; 271130803Smarcel ybits.f = y; 27298944Sobrien // x Mod Infinity == x unless x is infinity 27319370Spst if ( ((xbits.i & float_sign_mask) != float_infinity) && 27498944Sobrien ((ybits.i & float_sign_mask) == float_infinity) ) { 27519370Spst return x; 27698944Sobrien } 27719370Spst#endif 27898944Sobrien return ((jfloat)fmod((double)x,(double)y)); 27998944SobrienJRT_END 28098944Sobrien 28198944Sobrien 28298944SobrienJRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y)) 28398944Sobrien#ifdef _WIN64 28498944Sobrien union { jdouble d; julong l; } xbits, ybits; 28519370Spst xbits.d = x; 28619370Spst ybits.d = y; 28719370Spst // x Mod Infinity == x unless x is infinity 28819370Spst if ( ((xbits.l & double_sign_mask) != double_infinity) && 28919370Spst ((ybits.l & double_sign_mask) == double_infinity) ) { 29098944Sobrien return x; 29119370Spst } 29219370Spst#endif 29398944Sobrien return ((jdouble)fmod((double)x,(double)y)); 29498944SobrienJRT_END 29598944Sobrien 29619370Spst#ifdef __SOFTFP__ 29719370SpstJRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y)) 29819370Spst return x + y; 29919370SpstJRT_END 30098944Sobrien 30119370SpstJRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y)) 302130803Smarcel return x - y; 30398944SobrienJRT_END 30419370Spst 30519370SpstJRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y)) 30698944Sobrien return x * y; 307130803SmarcelJRT_END 30898944Sobrien 30919370SpstJRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y)) 31019370Spst return x / y; 31198944SobrienJRT_END 312130803Smarcel 31398944SobrienJRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y)) 31419370Spst return x + y; 31519370SpstJRT_END 31698944Sobrien 317130803SmarcelJRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y)) 31898944Sobrien return x - y; 31919370SpstJRT_END 32098944Sobrien 32119370SpstJRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y)) 32298944Sobrien return x * y; 32319370SpstJRT_END 32498944Sobrien 32598944SobrienJRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y)) 32698944Sobrien return x / y; 32798944SobrienJRT_END 32898944Sobrien 32998944SobrienJRT_LEAF(jfloat, SharedRuntime::i2f(jint x)) 33098944Sobrien return (jfloat)x; 33198944SobrienJRT_END 33298944Sobrien 33398944SobrienJRT_LEAF(jdouble, SharedRuntime::i2d(jint x)) 33498944Sobrien return (jdouble)x; 33598944SobrienJRT_END 33698944Sobrien 33798944SobrienJRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x)) 33898944Sobrien return (jdouble)x; 33998944SobrienJRT_END 34098944Sobrien 34198944SobrienJRT_LEAF(int, SharedRuntime::fcmpl(float x, float y)) 34298944Sobrien return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan*/ 34398944SobrienJRT_END 34498944Sobrien 34598944SobrienJRT_LEAF(int, SharedRuntime::fcmpg(float x, float y)) 34698944Sobrien return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */ 347130803SmarcelJRT_END 34898944Sobrien 34998944SobrienJRT_LEAF(int, SharedRuntime::dcmpl(double x, double y)) 35098944Sobrien return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */ 35119370SpstJRT_END 352130803Smarcel 35398944SobrienJRT_LEAF(int, SharedRuntime::dcmpg(double x, double y)) 35498944Sobrien return x<y ? -1 : (x==y ? 0 : 1); /* x>y or is_nan */ 35598944SobrienJRT_END 35698944Sobrien 357130803Smarcel// Functions to return the opposite of the aeabi functions for nan. 35898944SobrienJRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y)) 35998944Sobrien return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 36098944SobrienJRT_END 36198944Sobrien 36298944SobrienJRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y)) 36398944Sobrien return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 36498944SobrienJRT_END 36598944Sobrien 36698944SobrienJRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y)) 36798944Sobrien return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 36898944SobrienJRT_END 36998944Sobrien 37098944SobrienJRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y)) 37119370Spst return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 37219370SpstJRT_END 37398944Sobrien 37419370SpstJRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y)) 37519370Spst return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 37619370SpstJRT_END 37719370Spst 37898944SobrienJRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y)) 37919370Spst return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 38019370SpstJRT_END 38119370Spst 38219370SpstJRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y)) 38319370Spst return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 38419370SpstJRT_END 38519370Spst 38619370SpstJRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y)) 38798944Sobrien return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0); 38898944SobrienJRT_END 38998944Sobrien 39098944Sobrien// Intrinsics make gcc generate code for these. 39198944Sobrienfloat SharedRuntime::fneg(float f) { 39298944Sobrien return -f; 39319370Spst} 39419370Spst 39546283Sdfrdouble SharedRuntime::dneg(double f) { 39619370Spst return -f; 39746283Sdfr} 39898944Sobrien 39919370Spst#endif // __SOFTFP__ 40019370Spst 40146283Sdfr#if defined(__SOFTFP__) || defined(E500V2) 40219370Spst// Intrinsics make gcc generate code for these. 40346283Sdfrdouble SharedRuntime::dabs(double f) { 40446283Sdfr return (f <= (double)0.0) ? (double)0.0 - f : f; 40598944Sobrien} 40698944Sobrien 40798944Sobrien#endif 40898944Sobrien 40998944Sobrien#if defined(__SOFTFP__) || defined(PPC32) 41098944Sobriendouble SharedRuntime::dsqrt(double f) { 41198944Sobrien return sqrt(f); 41298944Sobrien} 41398944Sobrien#endif 41419370Spst 41546283SdfrJRT_LEAF(jint, SharedRuntime::f2i(jfloat x)) 41646283Sdfr if (g_isnan(x)) 41719370Spst return 0; 41819370Spst if (x >= (jfloat) max_jint) 41919370Spst return max_jint; 42019370Spst if (x <= (jfloat) min_jint) 42119370Spst return min_jint; 42298944Sobrien return (jint) x; 42319370SpstJRT_END 42498944Sobrien 42519370Spst 42698944SobrienJRT_LEAF(jlong, SharedRuntime::f2l(jfloat x)) 42798944Sobrien if (g_isnan(x)) 42898944Sobrien return 0; 42998944Sobrien if (x >= (jfloat) max_jlong) 43019370Spst return max_jlong; 43198944Sobrien if (x <= (jfloat) min_jlong) 43219370Spst return min_jlong; 43319370Spst return (jlong) x; 43419370SpstJRT_END 43598944Sobrien 43619370Spst 43798944SobrienJRT_LEAF(jint, SharedRuntime::d2i(jdouble x)) 43819370Spst if (g_isnan(x)) 43998944Sobrien return 0; 44098944Sobrien if (x >= (jdouble) max_jint) 44198944Sobrien return max_jint; 44298944Sobrien if (x <= (jdouble) min_jint) 44319370Spst return min_jint; 44498944Sobrien return (jint) x; 44598944SobrienJRT_END 44698944Sobrien 44719370Spst 44819370SpstJRT_LEAF(jlong, SharedRuntime::d2l(jdouble x)) 44998944Sobrien if (g_isnan(x)) 45019370Spst return 0; 45119370Spst if (x >= (jdouble) max_jlong) 45298944Sobrien return max_jlong; 45319370Spst if (x <= (jdouble) min_jlong) 45419370Spst return min_jlong; 45598944Sobrien return (jlong) x; 45619370SpstJRT_END 45798944Sobrien 45819370Spst 45998944SobrienJRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x)) 46019370Spst return (jfloat)x; 46119370SpstJRT_END 46219370Spst 46398944Sobrien 46419370SpstJRT_LEAF(jfloat, SharedRuntime::l2f(jlong x)) 46598944Sobrien return (jfloat)x; 46619370SpstJRT_END 46798944Sobrien 46898944Sobrien 46919370SpstJRT_LEAF(jdouble, SharedRuntime::l2d(jlong x)) 47098944Sobrien return (jdouble)x; 47198944SobrienJRT_END 47298944Sobrien 47319370Spst// Exception handling accross interpreter/compiler boundaries 47419370Spst// 47598944Sobrien// exception_handler_for_return_address(...) returns the continuation address. 47619370Spst// The continuation address is the entry point of the exception handler of the 47719370Spst// previous frame depending on the return address. 47898944Sobrien 47919370Spstaddress SharedRuntime::raw_exception_handler_for_return_address(JavaThread* thread, address return_address) { 48019370Spst assert(frame::verify_return_pc(return_address), err_msg("must be a return address: " INTPTR_FORMAT, return_address)); 48198944Sobrien 48219370Spst // Reset method handle flag. 48398944Sobrien thread->set_is_method_handle_return(false); 48498944Sobrien 48598944Sobrien // The fastest case first 48698944Sobrien CodeBlob* blob = CodeCache::find_blob(return_address); 48798944Sobrien nmethod* nm = (blob != NULL) ? blob->as_nmethod_or_null() : NULL; 48898944Sobrien if (nm != NULL) { 48998944Sobrien // Set flag if return address is a method handle call site. 49098944Sobrien thread->set_is_method_handle_return(nm->is_method_handle_return(return_address)); 491130803Smarcel // native nmethods don't have exception handlers 49298944Sobrien assert(!nm->is_native_method(), "no exception handler"); 49398944Sobrien assert(nm->header_begin() != nm->exception_begin(), "no exception handler"); 49498944Sobrien if (nm->is_deopt_pc(return_address)) { 49598944Sobrien return SharedRuntime::deopt_blob()->unpack_with_exception(); 49698944Sobrien } else { 49798944Sobrien return nm->exception_begin(); 49898944Sobrien } 49998944Sobrien } 50098944Sobrien 50198944Sobrien // Entry code 50298944Sobrien if (StubRoutines::returns_to_call_stub(return_address)) { 50398944Sobrien return StubRoutines::catch_exception_entry(); 50498944Sobrien } 50598944Sobrien // Interpreted code 50698944Sobrien if (Interpreter::contains(return_address)) { 50798944Sobrien return Interpreter::rethrow_exception_entry(); 50819370Spst } 50919370Spst 51098944Sobrien guarantee(blob == NULL || !blob->is_runtime_stub(), "caller should have skipped stub"); 51198944Sobrien guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!"); 51219370Spst 51319370Spst#ifndef PRODUCT 51419370Spst { ResourceMark rm; 51519370Spst tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", return_address); 51619370Spst tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here"); 51719370Spst tty->print_cr("b) other problem"); 51898944Sobrien } 51919370Spst#endif // PRODUCT 52019370Spst 52119370Spst ShouldNotReachHere(); 52219370Spst return NULL; 52319370Spst} 52498944Sobrien 52598944Sobrien 52619370SpstJRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* thread, address return_address)) 52719370Spst return raw_exception_handler_for_return_address(thread, return_address); 52819370SpstJRT_END 52998944Sobrien 53098944Sobrien 53198944Sobrienaddress SharedRuntime::get_poll_stub(address pc) { 53298944Sobrien address stub; 53398944Sobrien // Look up the code blob 53498944Sobrien CodeBlob *cb = CodeCache::find_blob(pc); 53519370Spst 53619370Spst // Should be an nmethod 53719370Spst assert( cb && cb->is_nmethod(), "safepoint polling: pc must refer to an nmethod" ); 53819370Spst 53919370Spst // Look up the relocation information 54098944Sobrien assert( ((nmethod*)cb)->is_at_poll_or_poll_return(pc), 54119370Spst "safepoint polling: type must be poll" ); 54219370Spst 54398944Sobrien assert( ((NativeInstruction*)pc)->is_safepoint_poll(), 54419370Spst "Only polling locations are used for safepoint"); 54598944Sobrien 54698944Sobrien bool at_poll_return = ((nmethod*)cb)->is_at_poll_return(pc); 54798944Sobrien bool has_wide_vectors = ((nmethod*)cb)->has_wide_vectors(); 54819370Spst if (at_poll_return) { 54998944Sobrien assert(SharedRuntime::polling_page_return_handler_blob() != NULL, 55098944Sobrien "polling page return stub not created yet"); 55119370Spst stub = SharedRuntime::polling_page_return_handler_blob()->entry_point(); 55298944Sobrien } else if (has_wide_vectors) { 55398944Sobrien assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != NULL, 55498944Sobrien "polling page vectors safepoint stub not created yet"); 55598944Sobrien stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point(); 556130803Smarcel } else { 55798944Sobrien assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL, 55898944Sobrien "polling page safepoint stub not created yet"); 55998944Sobrien stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point(); 56098944Sobrien } 56198944Sobrien#ifndef PRODUCT 56298944Sobrien if( TraceSafepoint ) { 56398944Sobrien char buf[256]; 56498944Sobrien jio_snprintf(buf, sizeof(buf), 56598944Sobrien "... found polling page %s exception at pc = " 56698944Sobrien INTPTR_FORMAT ", stub =" INTPTR_FORMAT, 56798944Sobrien at_poll_return ? "return" : "loop", 56898944Sobrien (intptr_t)pc, (intptr_t)stub); 56919370Spst tty->print_raw_cr(buf); 57098944Sobrien } 57119370Spst#endif // PRODUCT 57298944Sobrien return stub; 57398944Sobrien} 57419370Spst 57598944Sobrien 57698944Sobrienoop SharedRuntime::retrieve_receiver( Symbol* sig, frame caller ) { 57798944Sobrien assert(caller.is_interpreted_frame(), ""); 57819370Spst int args_size = ArgumentSizeComputer(sig).size() + 1; 57919370Spst assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack"); 58098944Sobrien oop result = (oop) *caller.interpreter_frame_tos_at(args_size - 1); 58198944Sobrien assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop"); 58219370Spst return result; 58319370Spst} 58419370Spst 58519370Spst 58619370Spstvoid SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) { 58719370Spst if (JvmtiExport::can_post_on_exceptions()) { 58819370Spst vframeStream vfst(thread, true); 58998944Sobrien methodHandle method = methodHandle(thread, vfst.method()); 59019370Spst address bcp = method()->bcp_from(vfst.bci()); 59198944Sobrien JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception()); 59219370Spst } 59398944Sobrien Exceptions::_throw(thread, __FILE__, __LINE__, h_exception); 59498944Sobrien} 59598944Sobrien 59698944Sobrienvoid SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Symbol* name, const char *message) { 59798944Sobrien Handle h_exception = Exceptions::new_exception(thread, name, message); 59898944Sobrien throw_and_post_jvmti_exception(thread, h_exception); 59919370Spst} 60019370Spst 601130803Smarcel// The interpreter code to call this tracing function is only 60219370Spst// called/generated when TraceRedefineClasses has the right bits 60319370Spst// set. Since obsolete methods are never compiled, we don't have 604130803Smarcel// to modify the compilers to generate calls to this function. 60519370Spst// 606130803SmarcelJRT_LEAF(int, SharedRuntime::rc_trace_method_entry( 60719370Spst JavaThread* thread, Method* method)) 60819370Spst assert(RC_TRACE_IN_RANGE(0x00001000, 0x00002000), "wrong call"); 60998944Sobrien 61098944Sobrien if (method->is_obsolete()) { 61198944Sobrien // We are calling an obsolete method, but this is not necessarily 61298944Sobrien // an error. Our method could have been redefined just after we 61398944Sobrien // fetched the Method* from the constant pool. 614130803Smarcel 61598944Sobrien // RC_TRACE macro has an embedded ResourceMark 61698944Sobrien RC_TRACE_WITH_THREAD(0x00001000, thread, 61798944Sobrien ("calling obsolete method '%s'", 61898944Sobrien method->name_and_sig_as_C_string())); 61998944Sobrien if (RC_TRACE_ENABLED(0x00002000)) { 62098944Sobrien // this option is provided to debug calls to obsolete methods 62198944Sobrien guarantee(false, "faulting at call to an obsolete method."); 62298944Sobrien } 62398944Sobrien } 62498944Sobrien return 0; 62598944SobrienJRT_END 62698944Sobrien 62798944Sobrien// ret_pc points into caller; we are returning caller's exception handler 62898944Sobrien// for given exception 62998944Sobrienaddress SharedRuntime::compute_compiled_exc_handler(nmethod* nm, address ret_pc, Handle& exception, 63098944Sobrien bool force_unwind, bool top_frame_only) { 63198944Sobrien assert(nm != NULL, "must exist"); 63298944Sobrien ResourceMark rm; 63398944Sobrien 63498944Sobrien ScopeDesc* sd = nm->scope_desc_at(ret_pc); 63598944Sobrien // determine handler bci, if any 63698944Sobrien EXCEPTION_MARK; 63798944Sobrien 63898944Sobrien int handler_bci = -1; 63998944Sobrien int scope_depth = 0; 64098944Sobrien if (!force_unwind) { 64198944Sobrien int bci = sd->bci(); 64298944Sobrien bool recursive_exception = false; 64398944Sobrien do { 64498944Sobrien bool skip_scope_increment = false; 64598944Sobrien // exception handler lookup 64698944Sobrien KlassHandle ek (THREAD, exception->klass()); 64798944Sobrien methodHandle mh(THREAD, sd->method()); 64898944Sobrien handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD); 64998944Sobrien if (HAS_PENDING_EXCEPTION) { 65098944Sobrien recursive_exception = true; 65198944Sobrien // We threw an exception while trying to find the exception handler. 65298944Sobrien // Transfer the new exception to the exception handle which will 653130803Smarcel // be set into thread local storage, and do another lookup for an 65498944Sobrien // exception handler for this exception, this time starting at the 65598944Sobrien // BCI of the exception handler which caused the exception to be 65698944Sobrien // thrown (bugs 4307310 and 4546590). Set "exception" reference 65798944Sobrien // argument to ensure that the correct exception is thrown (4870175). 65898944Sobrien exception = Handle(THREAD, PENDING_EXCEPTION); 65998944Sobrien CLEAR_PENDING_EXCEPTION; 66098944Sobrien if (handler_bci >= 0) { 66198944Sobrien bci = handler_bci; 66298944Sobrien handler_bci = -1; 66398944Sobrien skip_scope_increment = true; 66498944Sobrien } 66598944Sobrien } 66698944Sobrien else { 66798944Sobrien recursive_exception = false; 66898944Sobrien } 66998944Sobrien if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) { 67098944Sobrien sd = sd->sender(); 67198944Sobrien if (sd != NULL) { 67298944Sobrien bci = sd->bci(); 67398944Sobrien } 67498944Sobrien ++scope_depth; 675130803Smarcel } 67698944Sobrien } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != NULL)); 67719370Spst } 67819370Spst 67919370Spst // found handling method => lookup exception handler 68098944Sobrien int catch_pco = ret_pc - nm->code_begin(); 68119370Spst 68298944Sobrien ExceptionHandlerTable table(nm); 68319370Spst HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth); 68498944Sobrien if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) { 68598944Sobrien // Allow abbreviated catch tables. The idea is to allow a method 68698944Sobrien // to materialize its exceptions without committing to the exact 68798944Sobrien // routing of exceptions. In particular this is needed for adding 68898944Sobrien // a synthethic handler to unlock monitors when inlining 68998944Sobrien // synchonized methods since the unlock path isn't represented in 69019370Spst // the bytecodes. 69119370Spst t = table.entry_for(catch_pco, -1, 0); 69219370Spst } 69319370Spst 69498944Sobrien#ifdef COMPILER1 69519370Spst if (t == NULL && nm->is_compiled_by_c1()) { 69698944Sobrien assert(nm->unwind_handler_begin() != NULL, ""); 69719370Spst return nm->unwind_handler_begin(); 69898944Sobrien } 69998944Sobrien#endif 70098944Sobrien 70198944Sobrien if (t == NULL) { 70298944Sobrien tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", ret_pc, handler_bci); 70398944Sobrien tty->print_cr(" Exception:"); 70419370Spst exception->print(); 70519370Spst tty->cr(); 70619370Spst tty->print_cr(" Compiled exception table :"); 70719370Spst table.print(); 70819370Spst nm->print_code(); 70919370Spst guarantee(false, "missing exception handler"); 71019370Spst return NULL; 71119370Spst } 71219370Spst 71319370Spst return nm->code_begin() + t->pco(); 71419370Spst} 71519370Spst 71619370SpstJRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread)) 71719370Spst // These errors occur only at call sites 71819370Spst throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError()); 71919370SpstJRT_END 72019370Spst 72119370SpstJRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread)) 72219370Spst // These errors occur only at call sites 72319370Spst throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub"); 72419370SpstJRT_END 72598944Sobrien 72619370SpstJRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread)) 72719370Spst throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero"); 72898944SobrienJRT_END 72998944Sobrien 73098944SobrienJRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread)) 73198944Sobrien throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException()); 73298944SobrienJRT_END 73398944Sobrien 73498944SobrienJRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread)) 73598944Sobrien // This entry point is effectively only used for NullPointerExceptions which occur at inline 73698944Sobrien // cache sites (when the callee activation is not yet set up) so we are at a call site 73719370Spst throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException()); 73898944SobrienJRT_END 73998944Sobrien 74098944SobrienJRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread)) 74119370Spst // We avoid using the normal exception construction in this case because 74219370Spst // it performs an upcall to Java, and we're already out of stack space. 74319370Spst Klass* k = SystemDictionary::StackOverflowError_klass(); 74419370Spst oop exception_oop = InstanceKlass::cast(k)->allocate_instance(CHECK); 74519370Spst Handle exception (thread, exception_oop); 74619370Spst if (StackTraceInThrowable) { 74719370Spst java_lang_Throwable::fill_in_stack_trace(exception); 74898944Sobrien } 74919370Spst throw_and_post_jvmti_exception(thread, exception); 75019370SpstJRT_END 75198944Sobrien 75298944Sobrienaddress SharedRuntime::continuation_for_implicit_exception(JavaThread* thread, 75398944Sobrien address pc, 75498944Sobrien SharedRuntime::ImplicitExceptionKind exception_kind) 75598944Sobrien{ 75698944Sobrien address target_pc = NULL; 75798944Sobrien 75898944Sobrien if (Interpreter::contains(pc)) { 75919370Spst#ifdef CC_INTERP 76098944Sobrien // C++ interpreter doesn't throw implicit exceptions 76198944Sobrien ShouldNotReachHere(); 76298944Sobrien#else 76319370Spst switch (exception_kind) { 76419370Spst case IMPLICIT_NULL: return Interpreter::throw_NullPointerException_entry(); 76519370Spst case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry(); 76619370Spst case STACK_OVERFLOW: return Interpreter::throw_StackOverflowError_entry(); 76798944Sobrien default: ShouldNotReachHere(); 76819370Spst } 76919370Spst#endif // !CC_INTERP 77098944Sobrien } else { 77198944Sobrien switch (exception_kind) { 77298944Sobrien case STACK_OVERFLOW: { 77398944Sobrien // Stack overflow only occurs upon frame setup; the callee is 77498944Sobrien // going to be unwound. Dispatch to a shared runtime stub 77598944Sobrien // which will cause the StackOverflowError to be fabricated 77698944Sobrien // and processed. 77798944Sobrien // For stack overflow in deoptimization blob, cleanup thread. 77898944Sobrien if (thread->deopt_mark() != NULL) { 77998944Sobrien Deoptimization::cleanup_deopt_info(thread, NULL); 78098944Sobrien } 78119370Spst Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, pc); 78219370Spst return StubRoutines::throw_StackOverflowError_entry(); 78319370Spst } 78419370Spst 78598944Sobrien case IMPLICIT_NULL: { 78619370Spst if (VtableStubs::contains(pc)) { 78719370Spst // We haven't yet entered the callee frame. Fabricate an 78898944Sobrien // exception and begin dispatching it in the caller. Since 78998944Sobrien // the caller was at a call site, it's safe to destroy all 79098944Sobrien // caller-saved registers, as these entry points do. 79198944Sobrien VtableStub* vt_stub = VtableStubs::stub_containing(pc); 792130803Smarcel 79398944Sobrien // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error. 79498944Sobrien if (vt_stub == NULL) return NULL; 79598944Sobrien 79698944Sobrien if (vt_stub->is_abstract_method_error(pc)) { 79798944Sobrien assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs"); 79898944Sobrien Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, pc); 79919370Spst return StubRoutines::throw_AbstractMethodError_entry(); 80098944Sobrien } else { 80119370Spst Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, pc); 80219370Spst return StubRoutines::throw_NullPointerException_at_call_entry(); 80319370Spst } 80419370Spst } else { 80598944Sobrien CodeBlob* cb = CodeCache::find_blob(pc); 80619370Spst 80719370Spst // If code blob is NULL, then return NULL to signal handler to report the SEGV error. 80898944Sobrien if (cb == NULL) return NULL; 80998944Sobrien 81098944Sobrien // Exception happened in CodeCache. Must be either: 81198944Sobrien // 1. Inline-cache check in C2I handler blob, 81298944Sobrien // 2. Inline-cache check in nmethod, or 81319370Spst // 3. Implict null exception in nmethod 81498944Sobrien 81598944Sobrien if (!cb->is_nmethod()) { 81698944Sobrien guarantee(cb->is_adapter_blob() || cb->is_method_handles_adapter_blob(), 81719370Spst "exception happened outside interpreter, nmethods and vtable stubs (1)"); 81819370Spst Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, pc); 81919370Spst // There is no handler here, so we will simply unwind. 82019370Spst return StubRoutines::throw_NullPointerException_at_call_entry(); 82198944Sobrien } 82219370Spst 82319370Spst // Otherwise, it's an nmethod. Consult its exception handlers. 82498944Sobrien nmethod* nm = (nmethod*)cb; 82598944Sobrien if (nm->inlinecache_check_contains(pc)) { 82698944Sobrien // exception happened inside inline-cache check code 82798944Sobrien // => the nmethod is not yet active (i.e., the frame 82898944Sobrien // is not set up yet) => use return address pushed by 82919370Spst // caller => don't push another return address 83098944Sobrien Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, pc); 83198944Sobrien return StubRoutines::throw_NullPointerException_at_call_entry(); 832130803Smarcel } 83398944Sobrien 83498944Sobrien if (nm->method()->is_method_handle_intrinsic()) { 83598944Sobrien // exception happened inside MH dispatch code, similar to a vtable stub 83698944Sobrien Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, pc); 83719370Spst return StubRoutines::throw_NullPointerException_at_call_entry(); 83898944Sobrien } 83919370Spst 84019370Spst#ifndef PRODUCT 84119370Spst _implicit_null_throws++; 84219370Spst#endif 84398944Sobrien target_pc = nm->continuation_for_implicit_exception(pc); 84419370Spst // If there's an unexpected fault, target_pc might be NULL, 84519370Spst // in which case we want to fall through into the normal 84698944Sobrien // error handling code. 84798944Sobrien } 84898944Sobrien 84998944Sobrien break; // fall through 85098944Sobrien } 85119370Spst 85298944Sobrien 85398944Sobrien case IMPLICIT_DIVIDE_BY_ZERO: { 854130803Smarcel nmethod* nm = CodeCache::find_nmethod(pc); 85519370Spst guarantee(nm != NULL, "must have containing nmethod for implicit division-by-zero exceptions"); 85619370Spst#ifndef PRODUCT 85798944Sobrien _implicit_div0_throws++; 85819370Spst#endif 85998944Sobrien target_pc = nm->continuation_for_implicit_exception(pc); 86019370Spst // If there's an unexpected fault, target_pc might be NULL, 86119370Spst // in which case we want to fall through into the normal 86219370Spst // error handling code. 86319370Spst break; // fall through 86498944Sobrien } 86519370Spst 86619370Spst default: ShouldNotReachHere(); 86719370Spst } 86819370Spst 86998944Sobrien assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind"); 87019370Spst 87119370Spst // for AbortVMOnException flag 87219370Spst NOT_PRODUCT(Exceptions::debug_check_abort("java.lang.NullPointerException")); 873130803Smarcel if (exception_kind == IMPLICIT_NULL) { 874130803Smarcel Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc); 875130803Smarcel } else { 876130803Smarcel Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, pc, target_pc); 87719370Spst } 87819370Spst return target_pc; 87998944Sobrien } 88019370Spst 88198944Sobrien ShouldNotReachHere(); 88219370Spst return NULL; 88319370Spst} 88419370Spst 88519370Spst 88619370Spst/** 88798944Sobrien * Throws an java/lang/UnsatisfiedLinkError. The address of this method is 88819370Spst * installed in the native function entry of all native Java methods before 88919370Spst * they get linked to their actual native methods. 89098944Sobrien * 89119370Spst * \note 89219370Spst * This method actually never gets called! The reason is because 89319370Spst * the interpreter's native entries call NativeLookup::lookup() which 89419370Spst * throws the exception when the lookup fails. The exception is then 89598944Sobrien * caught and forwarded on the return from NativeLookup::lookup() call 89619370Spst * before the call to the native function. This might change in the future. 89798944Sobrien */ 89898944SobrienJNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...)) 89919370Spst{ 90019370Spst // We return a bad value here to make sure that the exception is 90119370Spst // forwarded before we look at the return value. 90219370Spst THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badJNIHandle); 90398944Sobrien} 90419370SpstJNI_END 90519370Spst 90698944Sobrienaddress SharedRuntime::native_method_throw_unsatisfied_link_error_entry() { 90798944Sobrien return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error); 90898944Sobrien} 90998944Sobrien 910130803Smarcel 91198944Sobrien#ifndef PRODUCT 91298944SobrienJRT_ENTRY(intptr_t, SharedRuntime::trace_bytecode(JavaThread* thread, intptr_t preserve_this_value, intptr_t tos, intptr_t tos2)) 91398944Sobrien const frame f = thread->last_frame(); 91498944Sobrien assert(f.is_interpreted_frame(), "must be an interpreted frame"); 91519370Spst#ifndef PRODUCT 91619370Spst methodHandle mh(THREAD, f.interpreter_frame_method()); 91719370Spst BytecodeTracer::trace(mh, f.interpreter_frame_bcp(), tos, tos2); 91819370Spst#endif // !PRODUCT 91998944Sobrien return preserve_this_value; 92098944SobrienJRT_END 92198944Sobrien#endif // !PRODUCT 92298944Sobrien 92398944Sobrien 92419370SpstJRT_ENTRY(void, SharedRuntime::yield_all(JavaThread* thread, int attempts)) 92598944Sobrien os::yield_all(attempts); 92619370SpstJRT_END 92719370Spst 92819370Spst 92919370SpstJRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj)) 93098944Sobrien assert(obj->is_oop(), "must be a valid oop"); 93119370Spst assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise"); 93219370Spst InstanceKlass::register_finalizer(instanceOop(obj), CHECK); 93319370SpstJRT_END 93498944Sobrien 93519370Spst 93619370Spstjlong SharedRuntime::get_java_tid(Thread* thread) { 937130803Smarcel if (thread != NULL) { 93819370Spst if (thread->is_Java_thread()) { 93919370Spst oop obj = ((JavaThread*)thread)->threadObj(); 94019370Spst return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj); 94119370Spst } 94219370Spst } 94319370Spst return 0; 94419370Spst} 94519370Spst 94698944Sobrien/** 94798944Sobrien * This function ought to be a void function, but cannot be because 948130803Smarcel * it gets turned into a tail-call on sparc, which runs into dtrace bug 94998944Sobrien * 6254741. Once that is fixed we can remove the dummy return value. 950130803Smarcel */ 95119370Spstint SharedRuntime::dtrace_object_alloc(oopDesc* o) { 95219370Spst return dtrace_object_alloc_base(Thread::current(), o); 95319370Spst} 95419370Spst 95519370Spstint SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o) { 95619370Spst assert(DTraceAllocProbes, "wrong call"); 95746283Sdfr Klass* klass = o->klass(); 95898944Sobrien int size = o->size(); 959130803Smarcel Symbol* name = klass->name(); 96098944Sobrien#ifndef USDT2 96198944Sobrien HS_DTRACE_PROBE4(hotspot, object__alloc, get_java_tid(thread), 96298944Sobrien name->bytes(), name->utf8_length(), size * HeapWordSize); 96398944Sobrien#else /* USDT2 */ 96498944Sobrien HOTSPOT_OBJECT_ALLOC( 96598944Sobrien get_java_tid(thread), 96698944Sobrien (char *) name->bytes(), name->utf8_length(), size * HeapWordSize); 96719370Spst#endif /* USDT2 */ 96819370Spst return 0; 96919370Spst} 97019370Spst 97119370SpstJRT_LEAF(int, SharedRuntime::dtrace_method_entry( 97219370Spst JavaThread* thread, Method* method)) 97319370Spst assert(DTraceMethodProbes, "wrong call"); 97419370Spst Symbol* kname = method->klass_name(); 97519370Spst Symbol* name = method->name(); 97619370Spst Symbol* sig = method->signature(); 97798944Sobrien#ifndef USDT2 97819370Spst HS_DTRACE_PROBE7(hotspot, method__entry, get_java_tid(thread), 97919370Spst kname->bytes(), kname->utf8_length(), 98019370Spst name->bytes(), name->utf8_length(), 98119370Spst sig->bytes(), sig->utf8_length()); 98219370Spst#else /* USDT2 */ 98319370Spst HOTSPOT_METHOD_ENTRY( 98419370Spst get_java_tid(thread), 98519370Spst (char *) kname->bytes(), kname->utf8_length(), 98619370Spst (char *) name->bytes(), name->utf8_length(), 98719370Spst (char *) sig->bytes(), sig->utf8_length()); 98819370Spst#endif /* USDT2 */ 98919370Spst return 0; 99019370SpstJRT_END 99119370Spst 99298944SobrienJRT_LEAF(int, SharedRuntime::dtrace_method_exit( 99398944Sobrien JavaThread* thread, Method* method)) 99498944Sobrien assert(DTraceMethodProbes, "wrong call"); 99598944Sobrien Symbol* kname = method->klass_name(); 99698944Sobrien Symbol* name = method->name(); 99798944Sobrien Symbol* sig = method->signature(); 99819370Spst#ifndef USDT2 99919370Spst HS_DTRACE_PROBE7(hotspot, method__return, get_java_tid(thread), 100098944Sobrien kname->bytes(), kname->utf8_length(), 100119370Spst name->bytes(), name->utf8_length(), 100298944Sobrien sig->bytes(), sig->utf8_length()); 100398944Sobrien#else /* USDT2 */ 100419370Spst HOTSPOT_METHOD_RETURN( 100598944Sobrien get_java_tid(thread), 100698944Sobrien (char *) kname->bytes(), kname->utf8_length(), 100798944Sobrien (char *) name->bytes(), name->utf8_length(), 100898944Sobrien (char *) sig->bytes(), sig->utf8_length()); 100998944Sobrien#endif /* USDT2 */ 101098944Sobrien return 0; 101198944SobrienJRT_END 101298944Sobrien 101398944Sobrien 101498944Sobrien// Finds receiver, CallInfo (i.e. receiver method), and calling bytecode) 101598944Sobrien// for a call current in progress, i.e., arguments has been pushed on stack 101698944Sobrien// put callee has not been invoked yet. Used by: resolve virtual/static, 101798944Sobrien// vtable updates, etc. Caller frame must be compiled. 101898944SobrienHandle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) { 101998944Sobrien ResourceMark rm(THREAD); 102098944Sobrien 102198944Sobrien // last java frame on stack (which includes native call frames) 102298944Sobrien vframeStream vfst(thread, true); // Do not skip and javaCalls 102319370Spst 102419370Spst return find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(Handle())); 102519370Spst} 102698944Sobrien 102719370Spst 102898944Sobrien// Finds receiver, CallInfo (i.e. receiver method), and calling bytecode 102998944Sobrien// for a call current in progress, i.e., arguments has been pushed on stack 103019370Spst// but callee has not been invoked yet. Caller frame must be compiled. 103198944SobrienHandle SharedRuntime::find_callee_info_helper(JavaThread* thread, 103298944Sobrien vframeStream& vfst, 103398944Sobrien Bytecodes::Code& bc, 103498944Sobrien CallInfo& callinfo, TRAPS) { 103598944Sobrien Handle receiver; 103698944Sobrien Handle nullHandle; //create a handy null handle for exception returns 103798944Sobrien 103898944Sobrien assert(!vfst.at_end(), "Java frame must exist"); 103998944Sobrien 104098944Sobrien // Find caller and bci from vframe 104198944Sobrien methodHandle caller(THREAD, vfst.method()); 104298944Sobrien int bci = vfst.bci(); 104398944Sobrien 104498944Sobrien // Find bytecode 104598944Sobrien Bytecode_invoke bytecode(caller, bci); 104698944Sobrien bc = bytecode.invoke_code(); 104798944Sobrien int bytecode_index = bytecode.index(); 104898944Sobrien 104919370Spst // Find receiver for non-static call 105098944Sobrien if (bc != Bytecodes::_invokestatic && 105119370Spst bc != Bytecodes::_invokedynamic) { 105219370Spst // This register map must be update since we need to find the receiver for 105319370Spst // compiled frames. The receiver might be in a register. 105446283Sdfr RegisterMap reg_map2(thread); 105546283Sdfr frame stubFrame = thread->last_frame(); 105646283Sdfr // Caller-frame is a compiled frame 105798944Sobrien frame callerFrame = stubFrame.sender(®_map2); 105846283Sdfr 105946283Sdfr methodHandle callee = bytecode.static_target(CHECK_(nullHandle)); 106046283Sdfr if (callee.is_null()) { 106198944Sobrien THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle); 1062130803Smarcel } 106346283Sdfr // Retrieve from a compiled argument list 106446283Sdfr receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2)); 106546283Sdfr 106646283Sdfr if (receiver.is_null()) { 106746283Sdfr THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle); 106819370Spst } 106919370Spst } 107019370Spst 107198944Sobrien // Resolve method. This is parameterized by bytecode. 107219370Spst constantPoolHandle constants(THREAD, caller->constants()); 107319370Spst assert(receiver.is_null() || receiver->is_oop(), "wrong receiver"); 107419370Spst LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_(nullHandle)); 107598944Sobrien 107698944Sobrien#ifdef ASSERT 107798944Sobrien // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls 107898944Sobrien if (bc != Bytecodes::_invokestatic && bc != Bytecodes::_invokedynamic) { 107998944Sobrien assert(receiver.not_null(), "should have thrown exception"); 108098944Sobrien KlassHandle receiver_klass(THREAD, receiver->klass()); 108119370Spst Klass* rk = constants->klass_ref_at(bytecode_index, CHECK_(nullHandle)); 108219370Spst // klass is already loaded 108319370Spst KlassHandle static_receiver_klass(THREAD, rk); 108419370Spst // Method handle invokes might have been optimized to a direct call 108519370Spst // so don't check for the receiver class. 108619370Spst // FIXME this weakens the assert too much 108798944Sobrien methodHandle callee = callinfo.selected_method(); 108819370Spst assert(receiver_klass->is_subtype_of(static_receiver_klass()) || 108919370Spst callee->is_method_handle_intrinsic() || 109019370Spst callee->is_compiled_lambda_form(), 109198944Sobrien "actual receiver must be subclass of static receiver klass"); 109298944Sobrien if (receiver_klass->oop_is_instance()) { 109398944Sobrien if (InstanceKlass::cast(receiver_klass())->is_not_initialized()) { 109498944Sobrien tty->print_cr("ERROR: Klass not yet initialized!!"); 109598944Sobrien receiver_klass()->print(); 109698944Sobrien } 109719370Spst assert(!InstanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized"); 109819370Spst } 109919370Spst } 110019370Spst#endif 110119370Spst 110298944Sobrien return receiver; 110319370Spst} 110498944Sobrien 110598944SobrienmethodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) { 110698944Sobrien ResourceMark rm(THREAD); 110719370Spst // We need first to check if any Java activations (compiled, interpreted) 110819370Spst // exist on the stack since last JavaCall. If not, we need 110919370Spst // to get the target method from the JavaCall wrapper. 111098944Sobrien vframeStream vfst(thread, true); // Do not skip any javaCalls 111119370Spst methodHandle callee_method; 111298944Sobrien if (vfst.at_end()) { 111319370Spst // No Java frames were found on stack since we did the JavaCall. 111419370Spst // Hence the stack can only contain an entry_frame. We need to 111519370Spst // find the target method from the stub frame. 111619370Spst RegisterMap reg_map(thread, false); 111719370Spst frame fr = thread->last_frame(); 111898944Sobrien assert(fr.is_runtime_frame(), "must be a runtimeStub"); 111919370Spst fr = fr.sender(®_map); 112019370Spst assert(fr.is_entry_frame(), "must be"); 112119370Spst // fr is now pointing to the entry frame. 112298944Sobrien callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method()); 112398944Sobrien assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??"); 112498944Sobrien } else { 112519370Spst Bytecodes::Code bc; 112619370Spst CallInfo callinfo; 112719370Spst find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle())); 112819370Spst callee_method = callinfo.selected_method(); 112919370Spst } 113019370Spst assert(callee_method()->is_method(), "must be"); 113119370Spst return callee_method; 113219370Spst} 113319370Spst 113419370Spst// Resolves a call. 113519370SpstmethodHandle SharedRuntime::resolve_helper(JavaThread *thread, 113619370Spst bool is_virtual, 113798944Sobrien bool is_optimized, TRAPS) { 113819370Spst methodHandle callee_method; 113919370Spst callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD); 114019370Spst if (JvmtiExport::can_hotswap_or_post_breakpoint()) { 114119370Spst int retry_count = 0; 1142130803Smarcel while (!HAS_PENDING_EXCEPTION && callee_method->is_old() && 1143130803Smarcel callee_method->method_holder() != SystemDictionary::Object_klass()) { 1144130803Smarcel // If has a pending exception then there is no need to re-try to 1145130803Smarcel // resolve this method. 1146130803Smarcel // If the method has been redefined, we need to try again. 1147130803Smarcel // Hack: we have no way to update the vtables of arrays, so don't 1148130803Smarcel // require that java.lang.Object has been updated. 1149130803Smarcel 1150130803Smarcel // It is very unlikely that method is redefined more than 100 times 1151130803Smarcel // in the middle of resolve. If it is looping here more than 100 times 1152130803Smarcel // means then there could be a bug here. 1153130803Smarcel guarantee((retry_count++ < 100), 1154130803Smarcel "Could not resolve to latest version of redefined method"); 1155130803Smarcel // method is redefined in the middle of resolve so re-try. 1156130803Smarcel callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD); 1157130803Smarcel } 1158130803Smarcel } 1159130803Smarcel return callee_method; 1160130803Smarcel} 1161130803Smarcel 1162130803Smarcel// Resolves a call. The compilers generate code for calls that go here 1163130803Smarcel// and are patched with the real destination of the call. 1164130803SmarcelmethodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread, 1165130803Smarcel bool is_virtual, 1166130803Smarcel bool is_optimized, TRAPS) { 1167130803Smarcel 1168130803Smarcel ResourceMark rm(thread); 1169130803Smarcel RegisterMap cbl_map(thread, false); 1170130803Smarcel frame caller_frame = thread->last_frame().sender(&cbl_map); 1171130803Smarcel 1172130803Smarcel CodeBlob* caller_cb = caller_frame.cb(); 1173130803Smarcel guarantee(caller_cb != NULL && caller_cb->is_nmethod(), "must be called from nmethod"); 1174130803Smarcel nmethod* caller_nm = caller_cb->as_nmethod_or_null(); 1175130803Smarcel // make sure caller is not getting deoptimized 1176130803Smarcel // and removed before we are done with it. 1177130803Smarcel // CLEANUP - with lazy deopt shouldn't need this lock 1178130803Smarcel nmethodLocker caller_lock(caller_nm); 1179130803Smarcel 1180130803Smarcel 1181130803Smarcel // determine call info & receiver 1182130803Smarcel // note: a) receiver is NULL for static calls 1183130803Smarcel // b) an exception is thrown if receiver is NULL for non-static calls 1184130803Smarcel CallInfo call_info; 1185130803Smarcel Bytecodes::Code invoke_code = Bytecodes::_illegal; 1186130803Smarcel Handle receiver = find_callee_info(thread, invoke_code, 1187130803Smarcel call_info, CHECK_(methodHandle())); 1188130803Smarcel methodHandle callee_method = call_info.selected_method(); 118919370Spst 119019370Spst assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) || 119119370Spst (!is_virtual && invoke_code == Bytecodes::_invokehandle ) || 119298944Sobrien (!is_virtual && invoke_code == Bytecodes::_invokedynamic) || 119319370Spst ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode"); 119419370Spst 119519370Spst#ifndef PRODUCT 119619370Spst // tracing/debugging/statistics 119719370Spst int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) : 119898944Sobrien (is_virtual) ? (&_resolve_virtual_ctr) : 119919370Spst (&_resolve_static_ctr); 120019370Spst Atomic::inc(addr); 120119370Spst 120219370Spst if (TraceCallFixup) { 120319370Spst ResourceMark rm(thread); 1204130803Smarcel tty->print("resolving %s%s (%s) call to", 120546283Sdfr (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static", 120646283Sdfr Bytecodes::name(invoke_code)); 120746283Sdfr callee_method->print_short_name(tty); 120846283Sdfr tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, caller_frame.pc(), callee_method->code()); 120946283Sdfr } 1210130803Smarcel#endif 121119370Spst 121219370Spst // JSR 292 key invariant: 121319370Spst // If the resolved method is a MethodHandle invoke target the call 121419370Spst // site must be a MethodHandle call site, because the lambda form might tail-call 121519370Spst // leaving the stack in a state unknown to either caller or callee 121698944Sobrien // TODO detune for now but we might need it again 121798944Sobrien// assert(!callee_method->is_compiled_lambda_form() || 121819370Spst// caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site"); 121919370Spst 122019370Spst // Compute entry points. This might require generation of C2I converter 122119370Spst // frames, so we cannot be holding any locks here. Furthermore, the 122219370Spst // computation of the entry points is independent of patching the call. We 122398944Sobrien // always return the entry-point, but we only patch the stub if the call has 122419370Spst // not been deoptimized. Return values: For a virtual call this is an 122519370Spst // (cached_oop, destination address) pair. For a static call/optimized 122619370Spst // virtual this is just a destination address. 122719370Spst 122846283Sdfr StaticCallInfo static_call_info; 122998944Sobrien CompiledICInfo virtual_call_info; 123098944Sobrien 123119370Spst // Make sure the callee nmethod does not get deoptimized and removed before 123219370Spst // we are done patching the code. 123319370Spst nmethod* callee_nm = callee_method->code(); 123419370Spst nmethodLocker nl_callee(callee_nm); 123546283Sdfr#ifdef ASSERT 123698944Sobrien address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below 123798944Sobrien#endif 123898944Sobrien 123919370Spst if (is_virtual) { 124019370Spst assert(receiver.not_null(), "sanity check"); 124119370Spst bool static_bound = call_info.resolved_method()->can_be_statically_bound(); 124219370Spst KlassHandle h_klass(THREAD, receiver->klass()); 124346283Sdfr CompiledIC::compute_monomorphic_entry(callee_method, h_klass, 124498944Sobrien is_optimized, static_bound, virtual_call_info, 124598944Sobrien CHECK_(methodHandle())); 124619370Spst } else { 124719370Spst // static call 124819370Spst CompiledStaticCall::compute_entry(callee_method, static_call_info); 124919370Spst } 1250130803Smarcel 1251130803Smarcel // grab lock, check for deoptimization and potentially patch caller 1252130803Smarcel { 1253130803Smarcel MutexLocker ml_patch(CompiledIC_lock); 1254130803Smarcel 1255130803Smarcel // Now that we are ready to patch if the Method* was redefined then 1256130803Smarcel // don't update call site and let the caller retry. 1257130803Smarcel 1258130803Smarcel if (!callee_method->is_old()) { 1259130803Smarcel#ifdef ASSERT 1260130803Smarcel // We must not try to patch to jump to an already unloaded method. 1261130803Smarcel if (dest_entry_point != 0) { 126298944Sobrien assert(CodeCache::find_blob(dest_entry_point) != NULL, 126398944Sobrien "should not unload nmethod while locked"); 126498944Sobrien } 126519370Spst#endif 126698944Sobrien if (is_virtual) { 126798944Sobrien nmethod* nm = callee_nm; 126898944Sobrien if (nm == NULL) CodeCache::find_blob(caller_frame.pc()); 126998944Sobrien CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc()); 127019370Spst if (inline_cache->is_clean()) { 127198944Sobrien inline_cache->set_to_monomorphic(virtual_call_info); 127298944Sobrien } 127319370Spst } else { 127419370Spst CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc()); 127519370Spst if (ssc->is_clean()) ssc->set(static_call_info); 127619370Spst } 127719370Spst } 127898944Sobrien 1279130803Smarcel } // unlock CompiledIC_lock 128019370Spst 128119370Spst return callee_method; 128219370Spst} 128319370Spst 128446283Sdfr 128519370Spst// Inline caches exist only in compiled code 128619370SpstJRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread)) 128719370Spst#ifdef ASSERT 128819370Spst RegisterMap reg_map(thread, false); 1289130803Smarcel frame stub_frame = thread->last_frame(); 1290130803Smarcel assert(stub_frame.is_runtime_frame(), "sanity check"); 1291130803Smarcel frame caller_frame = stub_frame.sender(®_map); 1292130803Smarcel assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame"); 1293130803Smarcel#endif /* ASSERT */ 129498944Sobrien 129598944Sobrien methodHandle callee_method; 129698944Sobrien JRT_BLOCK 129798944Sobrien callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL); 129819370Spst // Return Method* through TLS 129919370Spst thread->set_vm_result_2(callee_method()); 130019370Spst JRT_BLOCK_END 130198944Sobrien // return compiled code entry point after potential safepoints 1302130803Smarcel assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 130319370Spst return callee_method->verified_code_entry(); 130419370SpstJRT_END 130519370Spst 130619370Spst 130798944Sobrien// Handle call site that has been made non-entrant 130898944SobrienJRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread)) 130919370Spst // 6243940 We might end up in here if the callee is deoptimized 131019370Spst // as we race to call it. We don't want to take a safepoint if 131119370Spst // the caller was interpreted because the caller frame will look 131219370Spst // interpreted to the stack walkers and arguments are now 131319370Spst // "compiled" so it is much better to make this transition 131498944Sobrien // invisible to the stack walking code. The i2c path will 1315130803Smarcel // place the callee method in the callee_target. It is stashed 131619370Spst // there because if we try and find the callee by normal means a 131719370Spst // safepoint is possible and have trouble gc'ing the compiled args. 131819370Spst RegisterMap reg_map(thread, false); 131919370Spst frame stub_frame = thread->last_frame(); 132046283Sdfr assert(stub_frame.is_runtime_frame(), "sanity check"); 132119370Spst frame caller_frame = stub_frame.sender(®_map); 132219370Spst 132319370Spst if (caller_frame.is_interpreted_frame() || 132419370Spst caller_frame.is_entry_frame()) { 1325130803Smarcel Method* callee = thread->callee_target(); 1326130803Smarcel guarantee(callee != NULL && callee->is_method(), "bad handshake"); 1327130803Smarcel thread->set_vm_result_2(callee); 1328130803Smarcel thread->set_callee_target(NULL); 1329130803Smarcel return callee->get_c2i_entry(); 133098944Sobrien } 133198944Sobrien 133298944Sobrien // Must be compiled to compiled path which is safe to stackwalk 133398944Sobrien methodHandle callee_method; 133419370Spst JRT_BLOCK 133519370Spst // Force resolving of caller (if we called from compiled frame) 133619370Spst callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL); 133798944Sobrien thread->set_vm_result_2(callee_method()); 1338130803Smarcel JRT_BLOCK_END 133919370Spst // return compiled code entry point after potential safepoints 134019370Spst assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 134119370Spst return callee_method->verified_code_entry(); 134298944SobrienJRT_END 134398944Sobrien 134419370Spst 134519370Spst// resolve a static call and patch code 134619370SpstJRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread )) 134719370Spst methodHandle callee_method; 134819370Spst JRT_BLOCK 134998944Sobrien callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL); 1350130803Smarcel thread->set_vm_result_2(callee_method()); 135119370Spst JRT_BLOCK_END 135219370Spst // return compiled code entry point after potential safepoints 135319370Spst assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 135419370Spst return callee_method->verified_code_entry(); 135546283SdfrJRT_END 135619370Spst 135719370Spst 135819370Spst// resolve virtual call and update inline cache to monomorphic 135919370SpstJRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread )) 1360130803Smarcel methodHandle callee_method; 1361130803Smarcel JRT_BLOCK 1362130803Smarcel callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL); 1363130803Smarcel thread->set_vm_result_2(callee_method()); 1364130803Smarcel JRT_BLOCK_END 136598944Sobrien // return compiled code entry point after potential safepoints 136698944Sobrien assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 136798944Sobrien return callee_method->verified_code_entry(); 136898944SobrienJRT_END 136919370Spst 137019370Spst 137119370Spst// Resolve a virtual call that can be statically bound (e.g., always 137298944Sobrien// monomorphic, so it has no inline cache). Patch code to resolved target. 1373130803SmarcelJRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread)) 137419370Spst methodHandle callee_method; 137519370Spst JRT_BLOCK 137619370Spst callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL); 137719370Spst thread->set_vm_result_2(callee_method()); 137819370Spst JRT_BLOCK_END 137919370Spst // return compiled code entry point after potential safepoints 138098944Sobrien assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 138119370Spst return callee_method->verified_code_entry(); 138298944SobrienJRT_END 138319370Spst 138498944Sobrien 138519370Spst 138698944Sobrien 138798944Sobrien 138898944SobrienmethodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) { 138998944Sobrien ResourceMark rm(thread); 139098944Sobrien CallInfo call_info; 139198944Sobrien Bytecodes::Code bc; 139298944Sobrien 139319370Spst // receiver is NULL for static calls. An exception is thrown for NULL 139498944Sobrien // receivers for non-static calls 1395130803Smarcel Handle receiver = find_callee_info(thread, bc, call_info, 139698944Sobrien CHECK_(methodHandle())); 139798944Sobrien // Compiler1 can produce virtual call sites that can actually be statically bound 139898944Sobrien // If we fell thru to below we would think that the site was going megamorphic 139919370Spst // when in fact the site can never miss. Worse because we'd think it was megamorphic 140098944Sobrien // we'd try and do a vtable dispatch however methods that can be statically bound 1401130803Smarcel // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a 140298944Sobrien // reresolution of the call site (as if we did a handle_wrong_method and not an 140398944Sobrien // plain ic_miss) and the site will be converted to an optimized virtual call site 140498944Sobrien // never to miss again. I don't believe C2 will produce code like this but if it 140519370Spst // did this would still be the correct thing to do for it too, hence no ifdef. 140698944Sobrien // 140798944Sobrien if (call_info.resolved_method()->can_be_statically_bound()) { 140898944Sobrien methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle())); 140998944Sobrien if (TraceCallFixup) { 141098944Sobrien RegisterMap reg_map(thread, false); 141198944Sobrien frame caller_frame = thread->last_frame().sender(®_map); 141298944Sobrien ResourceMark rm(thread); 141319370Spst tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc)); 141498944Sobrien callee_method->print_short_name(tty); 141598944Sobrien tty->print_cr(" from pc: " INTPTR_FORMAT, caller_frame.pc()); 141698944Sobrien tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code()); 141798944Sobrien } 141898944Sobrien return callee_method; 141998944Sobrien } 142098944Sobrien 142119370Spst methodHandle callee_method = call_info.selected_method(); 142298944Sobrien 142398944Sobrien bool should_be_mono = false; 142498944Sobrien 142598944Sobrien#ifndef PRODUCT 142698944Sobrien Atomic::inc(&_ic_miss_ctr); 142798944Sobrien 142898944Sobrien // Statistics & Tracing 142998944Sobrien if (TraceCallFixup) { 143019370Spst ResourceMark rm(thread); 143198944Sobrien tty->print("IC miss (%s) call to", Bytecodes::name(bc)); 143298944Sobrien callee_method->print_short_name(tty); 143398944Sobrien tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code()); 143419370Spst } 143598944Sobrien 143698944Sobrien if (ICMissHistogram) { 143798944Sobrien MutexLocker m(VMStatistic_lock); 143898944Sobrien RegisterMap reg_map(thread, false); 143919370Spst frame f = thread->last_frame().real_sender(®_map);// skip runtime stub 144098944Sobrien // produce statistics under the lock 144198944Sobrien trace_ic_miss(f.pc()); 144219370Spst } 1443#endif 1444 1445 // install an event collector so that when a vtable stub is created the 1446 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The 1447 // event can't be posted when the stub is created as locks are held 1448 // - instead the event will be deferred until the event collector goes 1449 // out of scope. 1450 JvmtiDynamicCodeEventCollector event_collector; 1451 1452 // Update inline cache to megamorphic. Skip update if caller has been 1453 // made non-entrant or we are called from interpreted. 1454 { MutexLocker ml_patch (CompiledIC_lock); 1455 RegisterMap reg_map(thread, false); 1456 frame caller_frame = thread->last_frame().sender(®_map); 1457 CodeBlob* cb = caller_frame.cb(); 1458 if (cb->is_nmethod() && ((nmethod*)cb)->is_in_use()) { 1459 // Not a non-entrant nmethod, so find inline_cache 1460 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc()); 1461 bool should_be_mono = false; 1462 if (inline_cache->is_optimized()) { 1463 if (TraceCallFixup) { 1464 ResourceMark rm(thread); 1465 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc)); 1466 callee_method->print_short_name(tty); 1467 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code()); 1468 } 1469 should_be_mono = true; 1470 } else if (inline_cache->is_icholder_call()) { 1471 CompiledICHolder* ic_oop = inline_cache->cached_icholder(); 1472 if ( ic_oop != NULL) { 1473 1474 if (receiver()->klass() == ic_oop->holder_klass()) { 1475 // This isn't a real miss. We must have seen that compiled code 1476 // is now available and we want the call site converted to a 1477 // monomorphic compiled call site. 1478 // We can't assert for callee_method->code() != NULL because it 1479 // could have been deoptimized in the meantime 1480 if (TraceCallFixup) { 1481 ResourceMark rm(thread); 1482 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc)); 1483 callee_method->print_short_name(tty); 1484 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code()); 1485 } 1486 should_be_mono = true; 1487 } 1488 } 1489 } 1490 1491 if (should_be_mono) { 1492 1493 // We have a path that was monomorphic but was going interpreted 1494 // and now we have (or had) a compiled entry. We correct the IC 1495 // by using a new icBuffer. 1496 CompiledICInfo info; 1497 KlassHandle receiver_klass(THREAD, receiver()->klass()); 1498 inline_cache->compute_monomorphic_entry(callee_method, 1499 receiver_klass, 1500 inline_cache->is_optimized(), 1501 false, 1502 info, CHECK_(methodHandle())); 1503 inline_cache->set_to_monomorphic(info); 1504 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) { 1505 // Change to megamorphic 1506 inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle())); 1507 } else { 1508 // Either clean or megamorphic 1509 } 1510 } 1511 } // Release CompiledIC_lock 1512 1513 return callee_method; 1514} 1515 1516// 1517// Resets a call-site in compiled code so it will get resolved again. 1518// This routines handles both virtual call sites, optimized virtual call 1519// sites, and static call sites. Typically used to change a call sites 1520// destination from compiled to interpreted. 1521// 1522methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) { 1523 ResourceMark rm(thread); 1524 RegisterMap reg_map(thread, false); 1525 frame stub_frame = thread->last_frame(); 1526 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub"); 1527 frame caller = stub_frame.sender(®_map); 1528 1529 // Do nothing if the frame isn't a live compiled frame. 1530 // nmethod could be deoptimized by the time we get here 1531 // so no update to the caller is needed. 1532 1533 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) { 1534 1535 address pc = caller.pc(); 1536 1537 // Default call_addr is the location of the "basic" call. 1538 // Determine the address of the call we a reresolving. With 1539 // Inline Caches we will always find a recognizable call. 1540 // With Inline Caches disabled we may or may not find a 1541 // recognizable call. We will always find a call for static 1542 // calls and for optimized virtual calls. For vanilla virtual 1543 // calls it depends on the state of the UseInlineCaches switch. 1544 // 1545 // With Inline Caches disabled we can get here for a virtual call 1546 // for two reasons: 1547 // 1 - calling an abstract method. The vtable for abstract methods 1548 // will run us thru handle_wrong_method and we will eventually 1549 // end up in the interpreter to throw the ame. 1550 // 2 - a racing deoptimization. We could be doing a vanilla vtable 1551 // call and between the time we fetch the entry address and 1552 // we jump to it the target gets deoptimized. Similar to 1 1553 // we will wind up in the interprter (thru a c2i with c2). 1554 // 1555 address call_addr = NULL; 1556 { 1557 // Get call instruction under lock because another thread may be 1558 // busy patching it. 1559 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag); 1560 // Location of call instruction 1561 if (NativeCall::is_call_before(pc)) { 1562 NativeCall *ncall = nativeCall_before(pc); 1563 call_addr = ncall->instruction_address(); 1564 } 1565 } 1566 1567 // Check for static or virtual call 1568 bool is_static_call = false; 1569 nmethod* caller_nm = CodeCache::find_nmethod(pc); 1570 // Make sure nmethod doesn't get deoptimized and removed until 1571 // this is done with it. 1572 // CLEANUP - with lazy deopt shouldn't need this lock 1573 nmethodLocker nmlock(caller_nm); 1574 1575 if (call_addr != NULL) { 1576 RelocIterator iter(caller_nm, call_addr, call_addr+1); 1577 int ret = iter.next(); // Get item 1578 if (ret) { 1579 assert(iter.addr() == call_addr, "must find call"); 1580 if (iter.type() == relocInfo::static_call_type) { 1581 is_static_call = true; 1582 } else { 1583 assert(iter.type() == relocInfo::virtual_call_type || 1584 iter.type() == relocInfo::opt_virtual_call_type 1585 , "unexpected relocInfo. type"); 1586 } 1587 } else { 1588 assert(!UseInlineCaches, "relocation info. must exist for this address"); 1589 } 1590 1591 // Cleaning the inline cache will force a new resolve. This is more robust 1592 // than directly setting it to the new destination, since resolving of calls 1593 // is always done through the same code path. (experience shows that it 1594 // leads to very hard to track down bugs, if an inline cache gets updated 1595 // to a wrong method). It should not be performance critical, since the 1596 // resolve is only done once. 1597 1598 MutexLocker ml(CompiledIC_lock); 1599 // 1600 // We do not patch the call site if the nmethod has been made non-entrant 1601 // as it is a waste of time 1602 // 1603 if (caller_nm->is_in_use()) { 1604 if (is_static_call) { 1605 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr); 1606 ssc->set_to_clean(); 1607 } else { 1608 // compiled, dispatched call (which used to call an interpreted method) 1609 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr); 1610 inline_cache->set_to_clean(); 1611 } 1612 } 1613 } 1614 1615 } 1616 1617 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle())); 1618 1619 1620#ifndef PRODUCT 1621 Atomic::inc(&_wrong_method_ctr); 1622 1623 if (TraceCallFixup) { 1624 ResourceMark rm(thread); 1625 tty->print("handle_wrong_method reresolving call to"); 1626 callee_method->print_short_name(tty); 1627 tty->print_cr(" code: " INTPTR_FORMAT, callee_method->code()); 1628 } 1629#endif 1630 1631 return callee_method; 1632} 1633 1634#ifdef ASSERT 1635void SharedRuntime::check_member_name_argument_is_last_argument(methodHandle method, 1636 const BasicType* sig_bt, 1637 const VMRegPair* regs) { 1638 ResourceMark rm; 1639 const int total_args_passed = method->size_of_parameters(); 1640 const VMRegPair* regs_with_member_name = regs; 1641 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1); 1642 1643 const int member_arg_pos = total_args_passed - 1; 1644 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob"); 1645 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object"); 1646 1647 const bool is_outgoing = method->is_method_handle_intrinsic(); 1648 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing); 1649 1650 for (int i = 0; i < member_arg_pos; i++) { 1651 VMReg a = regs_with_member_name[i].first(); 1652 VMReg b = regs_without_member_name[i].first(); 1653 assert(a->value() == b->value(), err_msg_res("register allocation mismatch: a=%d, b=%d", a->value(), b->value())); 1654 } 1655 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg"); 1656} 1657#endif 1658 1659// --------------------------------------------------------------------------- 1660// We are calling the interpreter via a c2i. Normally this would mean that 1661// we were called by a compiled method. However we could have lost a race 1662// where we went int -> i2c -> c2i and so the caller could in fact be 1663// interpreted. If the caller is compiled we attempt to patch the caller 1664// so he no longer calls into the interpreter. 1665IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc)) 1666 Method* moop(method); 1667 1668 address entry_point = moop->from_compiled_entry(); 1669 1670 // It's possible that deoptimization can occur at a call site which hasn't 1671 // been resolved yet, in which case this function will be called from 1672 // an nmethod that has been patched for deopt and we can ignore the 1673 // request for a fixup. 1674 // Also it is possible that we lost a race in that from_compiled_entry 1675 // is now back to the i2c in that case we don't need to patch and if 1676 // we did we'd leap into space because the callsite needs to use 1677 // "to interpreter" stub in order to load up the Method*. Don't 1678 // ask me how I know this... 1679 1680 CodeBlob* cb = CodeCache::find_blob(caller_pc); 1681 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) { 1682 return; 1683 } 1684 1685 // The check above makes sure this is a nmethod. 1686 nmethod* nm = cb->as_nmethod_or_null(); 1687 assert(nm, "must be"); 1688 1689 // Get the return PC for the passed caller PC. 1690 address return_pc = caller_pc + frame::pc_return_offset; 1691 1692 // There is a benign race here. We could be attempting to patch to a compiled 1693 // entry point at the same time the callee is being deoptimized. If that is 1694 // the case then entry_point may in fact point to a c2i and we'd patch the 1695 // call site with the same old data. clear_code will set code() to NULL 1696 // at the end of it. If we happen to see that NULL then we can skip trying 1697 // to patch. If we hit the window where the callee has a c2i in the 1698 // from_compiled_entry and the NULL isn't present yet then we lose the race 1699 // and patch the code with the same old data. Asi es la vida. 1700 1701 if (moop->code() == NULL) return; 1702 1703 if (nm->is_in_use()) { 1704 1705 // Expect to find a native call there (unless it was no-inline cache vtable dispatch) 1706 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag); 1707 if (NativeCall::is_call_before(return_pc)) { 1708 NativeCall *call = nativeCall_before(return_pc); 1709 // 1710 // bug 6281185. We might get here after resolving a call site to a vanilla 1711 // virtual call. Because the resolvee uses the verified entry it may then 1712 // see compiled code and attempt to patch the site by calling us. This would 1713 // then incorrectly convert the call site to optimized and its downhill from 1714 // there. If you're lucky you'll get the assert in the bugid, if not you've 1715 // just made a call site that could be megamorphic into a monomorphic site 1716 // for the rest of its life! Just another racing bug in the life of 1717 // fixup_callers_callsite ... 1718 // 1719 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address()); 1720 iter.next(); 1721 assert(iter.has_current(), "must have a reloc at java call site"); 1722 relocInfo::relocType typ = iter.reloc()->type(); 1723 if ( typ != relocInfo::static_call_type && 1724 typ != relocInfo::opt_virtual_call_type && 1725 typ != relocInfo::static_stub_type) { 1726 return; 1727 } 1728 address destination = call->destination(); 1729 if (destination != entry_point) { 1730 CodeBlob* callee = CodeCache::find_blob(destination); 1731 // callee == cb seems weird. It means calling interpreter thru stub. 1732 if (callee == cb || callee->is_adapter_blob()) { 1733 // static call or optimized virtual 1734 if (TraceCallFixup) { 1735 tty->print("fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc); 1736 moop->print_short_name(tty); 1737 tty->print_cr(" to " INTPTR_FORMAT, entry_point); 1738 } 1739 call->set_destination_mt_safe(entry_point); 1740 } else { 1741 if (TraceCallFixup) { 1742 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", caller_pc); 1743 moop->print_short_name(tty); 1744 tty->print_cr(" to " INTPTR_FORMAT, entry_point); 1745 } 1746 // assert is too strong could also be resolve destinations. 1747 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be"); 1748 } 1749 } else { 1750 if (TraceCallFixup) { 1751 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", caller_pc); 1752 moop->print_short_name(tty); 1753 tty->print_cr(" to " INTPTR_FORMAT, entry_point); 1754 } 1755 } 1756 } 1757 } 1758IRT_END 1759 1760 1761// same as JVM_Arraycopy, but called directly from compiled code 1762JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos, 1763 oopDesc* dest, jint dest_pos, 1764 jint length, 1765 JavaThread* thread)) { 1766#ifndef PRODUCT 1767 _slow_array_copy_ctr++; 1768#endif 1769 // Check if we have null pointers 1770 if (src == NULL || dest == NULL) { 1771 THROW(vmSymbols::java_lang_NullPointerException()); 1772 } 1773 // Do the copy. The casts to arrayOop are necessary to the copy_array API, 1774 // even though the copy_array API also performs dynamic checks to ensure 1775 // that src and dest are truly arrays (and are conformable). 1776 // The copy_array mechanism is awkward and could be removed, but 1777 // the compilers don't call this function except as a last resort, 1778 // so it probably doesn't matter. 1779 src->klass()->copy_array((arrayOopDesc*)src, src_pos, 1780 (arrayOopDesc*)dest, dest_pos, 1781 length, thread); 1782} 1783JRT_END 1784 1785char* SharedRuntime::generate_class_cast_message( 1786 JavaThread* thread, const char* objName) { 1787 1788 // Get target class name from the checkcast instruction 1789 vframeStream vfst(thread, true); 1790 assert(!vfst.at_end(), "Java frame must exist"); 1791 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci())); 1792 Klass* targetKlass = vfst.method()->constants()->klass_at( 1793 cc.index(), thread); 1794 return generate_class_cast_message(objName, targetKlass->external_name()); 1795} 1796 1797char* SharedRuntime::generate_class_cast_message( 1798 const char* objName, const char* targetKlassName, const char* desc) { 1799 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1; 1800 1801 char* message = NEW_RESOURCE_ARRAY(char, msglen); 1802 if (NULL == message) { 1803 // Shouldn't happen, but don't cause even more problems if it does 1804 message = const_cast<char*>(objName); 1805 } else { 1806 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName); 1807 } 1808 return message; 1809} 1810 1811JRT_LEAF(void, SharedRuntime::reguard_yellow_pages()) 1812 (void) JavaThread::current()->reguard_stack(); 1813JRT_END 1814 1815 1816// Handles the uncommon case in locking, i.e., contention or an inflated lock. 1817#ifndef PRODUCT 1818int SharedRuntime::_monitor_enter_ctr=0; 1819#endif 1820JRT_ENTRY_NO_ASYNC(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread)) 1821 oop obj(_obj); 1822#ifndef PRODUCT 1823 _monitor_enter_ctr++; // monitor enter slow 1824#endif 1825 if (PrintBiasedLockingStatistics) { 1826 Atomic::inc(BiasedLocking::slow_path_entry_count_addr()); 1827 } 1828 Handle h_obj(THREAD, obj); 1829 if (UseBiasedLocking) { 1830 // Retry fast entry if bias is revoked to avoid unnecessary inflation 1831 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK); 1832 } else { 1833 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK); 1834 } 1835 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here"); 1836JRT_END 1837 1838#ifndef PRODUCT 1839int SharedRuntime::_monitor_exit_ctr=0; 1840#endif 1841// Handles the uncommon cases of monitor unlocking in compiled code 1842JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock)) 1843 oop obj(_obj); 1844#ifndef PRODUCT 1845 _monitor_exit_ctr++; // monitor exit slow 1846#endif 1847 Thread* THREAD = JavaThread::current(); 1848 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore 1849 // testing was unable to ever fire the assert that guarded it so I have removed it. 1850 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?"); 1851#undef MIGHT_HAVE_PENDING 1852#ifdef MIGHT_HAVE_PENDING 1853 // Save and restore any pending_exception around the exception mark. 1854 // While the slow_exit must not throw an exception, we could come into 1855 // this routine with one set. 1856 oop pending_excep = NULL; 1857 const char* pending_file; 1858 int pending_line; 1859 if (HAS_PENDING_EXCEPTION) { 1860 pending_excep = PENDING_EXCEPTION; 1861 pending_file = THREAD->exception_file(); 1862 pending_line = THREAD->exception_line(); 1863 CLEAR_PENDING_EXCEPTION; 1864 } 1865#endif /* MIGHT_HAVE_PENDING */ 1866 1867 { 1868 // Exit must be non-blocking, and therefore no exceptions can be thrown. 1869 EXCEPTION_MARK; 1870 ObjectSynchronizer::slow_exit(obj, lock, THREAD); 1871 } 1872 1873#ifdef MIGHT_HAVE_PENDING 1874 if (pending_excep != NULL) { 1875 THREAD->set_pending_exception(pending_excep, pending_file, pending_line); 1876 } 1877#endif /* MIGHT_HAVE_PENDING */ 1878JRT_END 1879 1880#ifndef PRODUCT 1881 1882void SharedRuntime::print_statistics() { 1883 ttyLocker ttyl; 1884 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'"); 1885 1886 if (_monitor_enter_ctr ) tty->print_cr("%5d monitor enter slow", _monitor_enter_ctr); 1887 if (_monitor_exit_ctr ) tty->print_cr("%5d monitor exit slow", _monitor_exit_ctr); 1888 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr); 1889 1890 SharedRuntime::print_ic_miss_histogram(); 1891 1892 if (CountRemovableExceptions) { 1893 if (_nof_removable_exceptions > 0) { 1894 Unimplemented(); // this counter is not yet incremented 1895 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions); 1896 } 1897 } 1898 1899 // Dump the JRT_ENTRY counters 1900 if( _new_instance_ctr ) tty->print_cr("%5d new instance requires GC", _new_instance_ctr); 1901 if( _new_array_ctr ) tty->print_cr("%5d new array requires GC", _new_array_ctr); 1902 if( _multi1_ctr ) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr); 1903 if( _multi2_ctr ) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr); 1904 if( _multi3_ctr ) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr); 1905 if( _multi4_ctr ) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr); 1906 if( _multi5_ctr ) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr); 1907 1908 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr ); 1909 tty->print_cr("%5d wrong method", _wrong_method_ctr ); 1910 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr ); 1911 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr ); 1912 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr ); 1913 1914 if( _mon_enter_stub_ctr ) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr ); 1915 if( _mon_exit_stub_ctr ) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr ); 1916 if( _mon_enter_ctr ) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr ); 1917 if( _mon_exit_ctr ) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr ); 1918 if( _partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr ); 1919 if( _jbyte_array_copy_ctr ) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr ); 1920 if( _jshort_array_copy_ctr ) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr ); 1921 if( _jint_array_copy_ctr ) tty->print_cr("%5d int array copies", _jint_array_copy_ctr ); 1922 if( _jlong_array_copy_ctr ) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr ); 1923 if( _oop_array_copy_ctr ) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr ); 1924 if( _checkcast_array_copy_ctr ) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr ); 1925 if( _unsafe_array_copy_ctr ) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr ); 1926 if( _generic_array_copy_ctr ) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr ); 1927 if( _slow_array_copy_ctr ) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr ); 1928 if( _find_handler_ctr ) tty->print_cr("%5d find exception handler", _find_handler_ctr ); 1929 if( _rethrow_ctr ) tty->print_cr("%5d rethrow handler", _rethrow_ctr ); 1930 1931 AdapterHandlerLibrary::print_statistics(); 1932 1933 if (xtty != NULL) xtty->tail("statistics"); 1934} 1935 1936inline double percent(int x, int y) { 1937 return 100.0 * x / MAX2(y, 1); 1938} 1939 1940class MethodArityHistogram { 1941 public: 1942 enum { MAX_ARITY = 256 }; 1943 private: 1944 static int _arity_histogram[MAX_ARITY]; // histogram of #args 1945 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words 1946 static int _max_arity; // max. arity seen 1947 static int _max_size; // max. arg size seen 1948 1949 static void add_method_to_histogram(nmethod* nm) { 1950 Method* m = nm->method(); 1951 ArgumentCount args(m->signature()); 1952 int arity = args.size() + (m->is_static() ? 0 : 1); 1953 int argsize = m->size_of_parameters(); 1954 arity = MIN2(arity, MAX_ARITY-1); 1955 argsize = MIN2(argsize, MAX_ARITY-1); 1956 int count = nm->method()->compiled_invocation_count(); 1957 _arity_histogram[arity] += count; 1958 _size_histogram[argsize] += count; 1959 _max_arity = MAX2(_max_arity, arity); 1960 _max_size = MAX2(_max_size, argsize); 1961 } 1962 1963 void print_histogram_helper(int n, int* histo, const char* name) { 1964 const int N = MIN2(5, n); 1965 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):"); 1966 double sum = 0; 1967 double weighted_sum = 0; 1968 int i; 1969 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; } 1970 double rest = sum; 1971 double percent = sum / 100; 1972 for (i = 0; i <= N; i++) { 1973 rest -= histo[i]; 1974 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent); 1975 } 1976 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent); 1977 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n); 1978 } 1979 1980 void print_histogram() { 1981 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):"); 1982 print_histogram_helper(_max_arity, _arity_histogram, "arity"); 1983 tty->print_cr("\nSame for parameter size (in words):"); 1984 print_histogram_helper(_max_size, _size_histogram, "size"); 1985 tty->cr(); 1986 } 1987 1988 public: 1989 MethodArityHistogram() { 1990 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 1991 _max_arity = _max_size = 0; 1992 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram [i] = 0; 1993 CodeCache::nmethods_do(add_method_to_histogram); 1994 print_histogram(); 1995 } 1996}; 1997 1998int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY]; 1999int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY]; 2000int MethodArityHistogram::_max_arity; 2001int MethodArityHistogram::_max_size; 2002 2003void SharedRuntime::print_call_statistics(int comp_total) { 2004 tty->print_cr("Calls from compiled code:"); 2005 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls; 2006 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls; 2007 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls; 2008 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total)); 2009 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total)); 2010 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls)); 2011 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls)); 2012 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls)); 2013 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls)); 2014 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total)); 2015 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls)); 2016 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls)); 2017 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls)); 2018 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls)); 2019 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total)); 2020 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls)); 2021 tty->cr(); 2022 tty->print_cr("Note 1: counter updates are not MT-safe."); 2023 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;"); 2024 tty->print_cr(" %% in nested categories are relative to their category"); 2025 tty->print_cr(" (and thus add up to more than 100%% with inlining)"); 2026 tty->cr(); 2027 2028 MethodArityHistogram h; 2029} 2030#endif 2031 2032 2033// A simple wrapper class around the calling convention information 2034// that allows sharing of adapters for the same calling convention. 2035class AdapterFingerPrint : public CHeapObj<mtCode> { 2036 private: 2037 enum { 2038 _basic_type_bits = 4, 2039 _basic_type_mask = right_n_bits(_basic_type_bits), 2040 _basic_types_per_int = BitsPerInt / _basic_type_bits, 2041 _compact_int_count = 3 2042 }; 2043 // TO DO: Consider integrating this with a more global scheme for compressing signatures. 2044 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive. 2045 2046 union { 2047 int _compact[_compact_int_count]; 2048 int* _fingerprint; 2049 } _value; 2050 int _length; // A negative length indicates the fingerprint is in the compact form, 2051 // Otherwise _value._fingerprint is the array. 2052 2053 // Remap BasicTypes that are handled equivalently by the adapters. 2054 // These are correct for the current system but someday it might be 2055 // necessary to make this mapping platform dependent. 2056 static int adapter_encoding(BasicType in) { 2057 switch(in) { 2058 case T_BOOLEAN: 2059 case T_BYTE: 2060 case T_SHORT: 2061 case T_CHAR: 2062 // There are all promoted to T_INT in the calling convention 2063 return T_INT; 2064 2065 case T_OBJECT: 2066 case T_ARRAY: 2067 // In other words, we assume that any register good enough for 2068 // an int or long is good enough for a managed pointer. 2069#ifdef _LP64 2070 return T_LONG; 2071#else 2072 return T_INT; 2073#endif 2074 2075 case T_INT: 2076 case T_LONG: 2077 case T_FLOAT: 2078 case T_DOUBLE: 2079 case T_VOID: 2080 return in; 2081 2082 default: 2083 ShouldNotReachHere(); 2084 return T_CONFLICT; 2085 } 2086 } 2087 2088 public: 2089 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) { 2090 // The fingerprint is based on the BasicType signature encoded 2091 // into an array of ints with eight entries per int. 2092 int* ptr; 2093 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int; 2094 if (len <= _compact_int_count) { 2095 assert(_compact_int_count == 3, "else change next line"); 2096 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0; 2097 // Storing the signature encoded as signed chars hits about 98% 2098 // of the time. 2099 _length = -len; 2100 ptr = _value._compact; 2101 } else { 2102 _length = len; 2103 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode); 2104 ptr = _value._fingerprint; 2105 } 2106 2107 // Now pack the BasicTypes with 8 per int 2108 int sig_index = 0; 2109 for (int index = 0; index < len; index++) { 2110 int value = 0; 2111 for (int byte = 0; byte < _basic_types_per_int; byte++) { 2112 int bt = ((sig_index < total_args_passed) 2113 ? adapter_encoding(sig_bt[sig_index++]) 2114 : 0); 2115 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits"); 2116 value = (value << _basic_type_bits) | bt; 2117 } 2118 ptr[index] = value; 2119 } 2120 } 2121 2122 ~AdapterFingerPrint() { 2123 if (_length > 0) { 2124 FREE_C_HEAP_ARRAY(int, _value._fingerprint, mtCode); 2125 } 2126 } 2127 2128 int value(int index) { 2129 if (_length < 0) { 2130 return _value._compact[index]; 2131 } 2132 return _value._fingerprint[index]; 2133 } 2134 int length() { 2135 if (_length < 0) return -_length; 2136 return _length; 2137 } 2138 2139 bool is_compact() { 2140 return _length <= 0; 2141 } 2142 2143 unsigned int compute_hash() { 2144 int hash = 0; 2145 for (int i = 0; i < length(); i++) { 2146 int v = value(i); 2147 hash = (hash << 8) ^ v ^ (hash >> 5); 2148 } 2149 return (unsigned int)hash; 2150 } 2151 2152 const char* as_string() { 2153 stringStream st; 2154 st.print("0x"); 2155 for (int i = 0; i < length(); i++) { 2156 st.print("%08x", value(i)); 2157 } 2158 return st.as_string(); 2159 } 2160 2161 bool equals(AdapterFingerPrint* other) { 2162 if (other->_length != _length) { 2163 return false; 2164 } 2165 if (_length < 0) { 2166 assert(_compact_int_count == 3, "else change next line"); 2167 return _value._compact[0] == other->_value._compact[0] && 2168 _value._compact[1] == other->_value._compact[1] && 2169 _value._compact[2] == other->_value._compact[2]; 2170 } else { 2171 for (int i = 0; i < _length; i++) { 2172 if (_value._fingerprint[i] != other->_value._fingerprint[i]) { 2173 return false; 2174 } 2175 } 2176 } 2177 return true; 2178 } 2179}; 2180 2181 2182// A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries 2183class AdapterHandlerTable : public BasicHashtable<mtCode> { 2184 friend class AdapterHandlerTableIterator; 2185 2186 private: 2187 2188#ifndef PRODUCT 2189 static int _lookups; // number of calls to lookup 2190 static int _buckets; // number of buckets checked 2191 static int _equals; // number of buckets checked with matching hash 2192 static int _hits; // number of successful lookups 2193 static int _compact; // number of equals calls with compact signature 2194#endif 2195 2196 AdapterHandlerEntry* bucket(int i) { 2197 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i); 2198 } 2199 2200 public: 2201 AdapterHandlerTable() 2202 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { } 2203 2204 // Create a new entry suitable for insertion in the table 2205 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) { 2206 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash()); 2207 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry); 2208 return entry; 2209 } 2210 2211 // Insert an entry into the table 2212 void add(AdapterHandlerEntry* entry) { 2213 int index = hash_to_index(entry->hash()); 2214 add_entry(index, entry); 2215 } 2216 2217 void free_entry(AdapterHandlerEntry* entry) { 2218 entry->deallocate(); 2219 BasicHashtable<mtCode>::free_entry(entry); 2220 } 2221 2222 // Find a entry with the same fingerprint if it exists 2223 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) { 2224 NOT_PRODUCT(_lookups++); 2225 AdapterFingerPrint fp(total_args_passed, sig_bt); 2226 unsigned int hash = fp.compute_hash(); 2227 int index = hash_to_index(hash); 2228 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2229 NOT_PRODUCT(_buckets++); 2230 if (e->hash() == hash) { 2231 NOT_PRODUCT(_equals++); 2232 if (fp.equals(e->fingerprint())) { 2233#ifndef PRODUCT 2234 if (fp.is_compact()) _compact++; 2235 _hits++; 2236#endif 2237 return e; 2238 } 2239 } 2240 } 2241 return NULL; 2242 } 2243 2244#ifndef PRODUCT 2245 void print_statistics() { 2246 ResourceMark rm; 2247 int longest = 0; 2248 int empty = 0; 2249 int total = 0; 2250 int nonempty = 0; 2251 for (int index = 0; index < table_size(); index++) { 2252 int count = 0; 2253 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2254 count++; 2255 } 2256 if (count != 0) nonempty++; 2257 if (count == 0) empty++; 2258 if (count > longest) longest = count; 2259 total += count; 2260 } 2261 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f", 2262 empty, longest, total, total / (double)nonempty); 2263 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d", 2264 _lookups, _buckets, _equals, _hits, _compact); 2265 } 2266#endif 2267}; 2268 2269 2270#ifndef PRODUCT 2271 2272int AdapterHandlerTable::_lookups; 2273int AdapterHandlerTable::_buckets; 2274int AdapterHandlerTable::_equals; 2275int AdapterHandlerTable::_hits; 2276int AdapterHandlerTable::_compact; 2277 2278#endif 2279 2280class AdapterHandlerTableIterator : public StackObj { 2281 private: 2282 AdapterHandlerTable* _table; 2283 int _index; 2284 AdapterHandlerEntry* _current; 2285 2286 void scan() { 2287 while (_index < _table->table_size()) { 2288 AdapterHandlerEntry* a = _table->bucket(_index); 2289 _index++; 2290 if (a != NULL) { 2291 _current = a; 2292 return; 2293 } 2294 } 2295 } 2296 2297 public: 2298 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) { 2299 scan(); 2300 } 2301 bool has_next() { 2302 return _current != NULL; 2303 } 2304 AdapterHandlerEntry* next() { 2305 if (_current != NULL) { 2306 AdapterHandlerEntry* result = _current; 2307 _current = _current->next(); 2308 if (_current == NULL) scan(); 2309 return result; 2310 } else { 2311 return NULL; 2312 } 2313 } 2314}; 2315 2316 2317// --------------------------------------------------------------------------- 2318// Implementation of AdapterHandlerLibrary 2319AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL; 2320AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL; 2321const int AdapterHandlerLibrary_size = 16*K; 2322BufferBlob* AdapterHandlerLibrary::_buffer = NULL; 2323 2324BufferBlob* AdapterHandlerLibrary::buffer_blob() { 2325 // Should be called only when AdapterHandlerLibrary_lock is active. 2326 if (_buffer == NULL) // Initialize lazily 2327 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size); 2328 return _buffer; 2329} 2330 2331void AdapterHandlerLibrary::initialize() { 2332 if (_adapters != NULL) return; 2333 _adapters = new AdapterHandlerTable(); 2334 2335 // Create a special handler for abstract methods. Abstract methods 2336 // are never compiled so an i2c entry is somewhat meaningless, but 2337 // fill it in with something appropriate just in case. Pass handle 2338 // wrong method for the c2i transitions. 2339 address wrong_method = SharedRuntime::get_handle_wrong_method_stub(); 2340 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL), 2341 StubRoutines::throw_AbstractMethodError_entry(), 2342 wrong_method, wrong_method); 2343} 2344 2345AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint, 2346 address i2c_entry, 2347 address c2i_entry, 2348 address c2i_unverified_entry) { 2349 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry); 2350} 2351 2352AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(methodHandle method) { 2353 // Use customized signature handler. Need to lock around updates to 2354 // the AdapterHandlerTable (it is not safe for concurrent readers 2355 // and a single writer: this could be fixed if it becomes a 2356 // problem). 2357 2358 // Get the address of the ic_miss handlers before we grab the 2359 // AdapterHandlerLibrary_lock. This fixes bug 6236259 which 2360 // was caused by the initialization of the stubs happening 2361 // while we held the lock and then notifying jvmti while 2362 // holding it. This just forces the initialization to be a little 2363 // earlier. 2364 address ic_miss = SharedRuntime::get_ic_miss_stub(); 2365 assert(ic_miss != NULL, "must have handler"); 2366 2367 ResourceMark rm; 2368 2369 NOT_PRODUCT(int insts_size); 2370 AdapterBlob* B = NULL; 2371 AdapterHandlerEntry* entry = NULL; 2372 AdapterFingerPrint* fingerprint = NULL; 2373 { 2374 MutexLocker mu(AdapterHandlerLibrary_lock); 2375 // make sure data structure is initialized 2376 initialize(); 2377 2378 if (method->is_abstract()) { 2379 return _abstract_method_handler; 2380 } 2381 2382 // Fill in the signature array, for the calling-convention call. 2383 int total_args_passed = method->size_of_parameters(); // All args on stack 2384 2385 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed); 2386 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed); 2387 int i = 0; 2388 if (!method->is_static()) // Pass in receiver first 2389 sig_bt[i++] = T_OBJECT; 2390 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) { 2391 sig_bt[i++] = ss.type(); // Collect remaining bits of signature 2392 if (ss.type() == T_LONG || ss.type() == T_DOUBLE) 2393 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots 2394 } 2395 assert(i == total_args_passed, ""); 2396 2397 // Lookup method signature's fingerprint 2398 entry = _adapters->lookup(total_args_passed, sig_bt); 2399 2400#ifdef ASSERT 2401 AdapterHandlerEntry* shared_entry = NULL; 2402 if (VerifyAdapterSharing && entry != NULL) { 2403 shared_entry = entry; 2404 entry = NULL; 2405 } 2406#endif 2407 2408 if (entry != NULL) { 2409 return entry; 2410 } 2411 2412 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage 2413 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false); 2414 2415 // Make a C heap allocated version of the fingerprint to store in the adapter 2416 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt); 2417 2418 // Create I2C & C2I handlers 2419 2420 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache 2421 if (buf != NULL) { 2422 CodeBuffer buffer(buf); 2423 short buffer_locs[20]; 2424 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs, 2425 sizeof(buffer_locs)/sizeof(relocInfo)); 2426 MacroAssembler _masm(&buffer); 2427 2428 entry = SharedRuntime::generate_i2c2i_adapters(&_masm, 2429 total_args_passed, 2430 comp_args_on_stack, 2431 sig_bt, 2432 regs, 2433 fingerprint); 2434 2435#ifdef ASSERT 2436 if (VerifyAdapterSharing) { 2437 if (shared_entry != NULL) { 2438 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size(), total_args_passed, sig_bt), 2439 "code must match"); 2440 // Release the one just created and return the original 2441 _adapters->free_entry(entry); 2442 return shared_entry; 2443 } else { 2444 entry->save_code(buf->code_begin(), buffer.insts_size(), total_args_passed, sig_bt); 2445 } 2446 } 2447#endif 2448 2449 B = AdapterBlob::create(&buffer); 2450 NOT_PRODUCT(insts_size = buffer.insts_size()); 2451 } 2452 if (B == NULL) { 2453 // CodeCache is full, disable compilation 2454 // Ought to log this but compile log is only per compile thread 2455 // and we're some non descript Java thread. 2456 MutexUnlocker mu(AdapterHandlerLibrary_lock); 2457 CompileBroker::handle_full_code_cache(); 2458 return NULL; // Out of CodeCache space 2459 } 2460 entry->relocate(B->content_begin()); 2461#ifndef PRODUCT 2462 // debugging suppport 2463 if (PrintAdapterHandlers || PrintStubCode) { 2464 ttyLocker ttyl; 2465 entry->print_adapter_on(tty); 2466 tty->print_cr("i2c argument handler #%d for: %s %s (%d bytes generated)", 2467 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"), 2468 method->signature()->as_C_string(), insts_size); 2469 tty->print_cr("c2i argument handler starts at %p",entry->get_c2i_entry()); 2470 if (Verbose || PrintStubCode) { 2471 address first_pc = entry->base_address(); 2472 if (first_pc != NULL) { 2473 Disassembler::decode(first_pc, first_pc + insts_size); 2474 tty->cr(); 2475 } 2476 } 2477 } 2478#endif 2479 2480 _adapters->add(entry); 2481 } 2482 // Outside of the lock 2483 if (B != NULL) { 2484 char blob_id[256]; 2485 jio_snprintf(blob_id, 2486 sizeof(blob_id), 2487 "%s(%s)@" PTR_FORMAT, 2488 B->name(), 2489 fingerprint->as_string(), 2490 B->content_begin()); 2491 Forte::register_stub(blob_id, B->content_begin(), B->content_end()); 2492 2493 if (JvmtiExport::should_post_dynamic_code_generated()) { 2494 JvmtiExport::post_dynamic_code_generated(blob_id, B->content_begin(), B->content_end()); 2495 } 2496 } 2497 return entry; 2498} 2499 2500address AdapterHandlerEntry::base_address() { 2501 address base = _i2c_entry; 2502 if (base == NULL) base = _c2i_entry; 2503 assert(base <= _c2i_entry || _c2i_entry == NULL, ""); 2504 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, ""); 2505 return base; 2506} 2507 2508void AdapterHandlerEntry::relocate(address new_base) { 2509 address old_base = base_address(); 2510 assert(old_base != NULL, ""); 2511 ptrdiff_t delta = new_base - old_base; 2512 if (_i2c_entry != NULL) 2513 _i2c_entry += delta; 2514 if (_c2i_entry != NULL) 2515 _c2i_entry += delta; 2516 if (_c2i_unverified_entry != NULL) 2517 _c2i_unverified_entry += delta; 2518 assert(base_address() == new_base, ""); 2519} 2520 2521 2522void AdapterHandlerEntry::deallocate() { 2523 delete _fingerprint; 2524#ifdef ASSERT 2525 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code, mtCode); 2526 if (_saved_sig) FREE_C_HEAP_ARRAY(Basictype, _saved_sig, mtCode); 2527#endif 2528} 2529 2530 2531#ifdef ASSERT 2532// Capture the code before relocation so that it can be compared 2533// against other versions. If the code is captured after relocation 2534// then relative instructions won't be equivalent. 2535void AdapterHandlerEntry::save_code(unsigned char* buffer, int length, int total_args_passed, BasicType* sig_bt) { 2536 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode); 2537 _code_length = length; 2538 memcpy(_saved_code, buffer, length); 2539 _total_args_passed = total_args_passed; 2540 _saved_sig = NEW_C_HEAP_ARRAY(BasicType, _total_args_passed, mtCode); 2541 memcpy(_saved_sig, sig_bt, _total_args_passed * sizeof(BasicType)); 2542} 2543 2544 2545bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length, int total_args_passed, BasicType* sig_bt) { 2546 if (length != _code_length) { 2547 return false; 2548 } 2549 for (int i = 0; i < length; i++) { 2550 if (buffer[i] != _saved_code[i]) { 2551 return false; 2552 } 2553 } 2554 return true; 2555} 2556#endif 2557 2558 2559// Create a native wrapper for this native method. The wrapper converts the 2560// java compiled calling convention to the native convention, handlizes 2561// arguments, and transitions to native. On return from the native we transition 2562// back to java blocking if a safepoint is in progress. 2563nmethod *AdapterHandlerLibrary::create_native_wrapper(methodHandle method, int compile_id) { 2564 ResourceMark rm; 2565 nmethod* nm = NULL; 2566 2567 assert(method->is_native(), "must be native"); 2568 assert(method->is_method_handle_intrinsic() || 2569 method->has_native_function(), "must have something valid to call!"); 2570 2571 { 2572 // perform the work while holding the lock, but perform any printing outside the lock 2573 MutexLocker mu(AdapterHandlerLibrary_lock); 2574 // See if somebody beat us to it 2575 nm = method->code(); 2576 if (nm) { 2577 return nm; 2578 } 2579 2580 ResourceMark rm; 2581 2582 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache 2583 if (buf != NULL) { 2584 CodeBuffer buffer(buf); 2585 double locs_buf[20]; 2586 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo)); 2587 MacroAssembler _masm(&buffer); 2588 2589 // Fill in the signature array, for the calling-convention call. 2590 const int total_args_passed = method->size_of_parameters(); 2591 2592 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed); 2593 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed); 2594 int i=0; 2595 if( !method->is_static() ) // Pass in receiver first 2596 sig_bt[i++] = T_OBJECT; 2597 SignatureStream ss(method->signature()); 2598 for( ; !ss.at_return_type(); ss.next()) { 2599 sig_bt[i++] = ss.type(); // Collect remaining bits of signature 2600 if( ss.type() == T_LONG || ss.type() == T_DOUBLE ) 2601 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots 2602 } 2603 assert(i == total_args_passed, ""); 2604 BasicType ret_type = ss.type(); 2605 2606 // Now get the compiled-Java layout as input (or output) arguments. 2607 // NOTE: Stubs for compiled entry points of method handle intrinsics 2608 // are just trampolines so the argument registers must be outgoing ones. 2609 const bool is_outgoing = method->is_method_handle_intrinsic(); 2610 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing); 2611 2612 // Generate the compiled-to-native wrapper code 2613 nm = SharedRuntime::generate_native_wrapper(&_masm, 2614 method, 2615 compile_id, 2616 sig_bt, 2617 regs, 2618 ret_type); 2619 } 2620 } 2621 2622 // Must unlock before calling set_code 2623 2624 // Install the generated code. 2625 if (nm != NULL) { 2626 if (PrintCompilation) { 2627 ttyLocker ttyl; 2628 CompileTask::print_compilation(tty, nm, method->is_static() ? "(static)" : ""); 2629 } 2630 method->set_code(method, nm); 2631 nm->post_compiled_method_load_event(); 2632 } else { 2633 // CodeCache is full, disable compilation 2634 CompileBroker::handle_full_code_cache(); 2635 } 2636 return nm; 2637} 2638 2639JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread)) 2640 assert(thread == JavaThread::current(), "must be"); 2641 // The code is about to enter a JNI lazy critical native method and 2642 // _needs_gc is true, so if this thread is already in a critical 2643 // section then just return, otherwise this thread should block 2644 // until needs_gc has been cleared. 2645 if (thread->in_critical()) { 2646 return; 2647 } 2648 // Lock and unlock a critical section to give the system a chance to block 2649 GC_locker::lock_critical(thread); 2650 GC_locker::unlock_critical(thread); 2651JRT_END 2652 2653#ifdef HAVE_DTRACE_H 2654// Create a dtrace nmethod for this method. The wrapper converts the 2655// java compiled calling convention to the native convention, makes a dummy call 2656// (actually nops for the size of the call instruction, which become a trap if 2657// probe is enabled). The returns to the caller. Since this all looks like a 2658// leaf no thread transition is needed. 2659 2660nmethod *AdapterHandlerLibrary::create_dtrace_nmethod(methodHandle method) { 2661 ResourceMark rm; 2662 nmethod* nm = NULL; 2663 2664 if (PrintCompilation) { 2665 ttyLocker ttyl; 2666 tty->print("--- n%s "); 2667 method->print_short_name(tty); 2668 if (method->is_static()) { 2669 tty->print(" (static)"); 2670 } 2671 tty->cr(); 2672 } 2673 2674 { 2675 // perform the work while holding the lock, but perform any printing 2676 // outside the lock 2677 MutexLocker mu(AdapterHandlerLibrary_lock); 2678 // See if somebody beat us to it 2679 nm = method->code(); 2680 if (nm) { 2681 return nm; 2682 } 2683 2684 ResourceMark rm; 2685 2686 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache 2687 if (buf != NULL) { 2688 CodeBuffer buffer(buf); 2689 // Need a few relocation entries 2690 double locs_buf[20]; 2691 buffer.insts()->initialize_shared_locs( 2692 (relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo)); 2693 MacroAssembler _masm(&buffer); 2694 2695 // Generate the compiled-to-native wrapper code 2696 nm = SharedRuntime::generate_dtrace_nmethod(&_masm, method); 2697 } 2698 } 2699 return nm; 2700} 2701 2702// the dtrace method needs to convert java lang string to utf8 string. 2703void SharedRuntime::get_utf(oopDesc* src, address dst) { 2704 typeArrayOop jlsValue = java_lang_String::value(src); 2705 int jlsOffset = java_lang_String::offset(src); 2706 int jlsLen = java_lang_String::length(src); 2707 jchar* jlsPos = (jlsLen == 0) ? NULL : 2708 jlsValue->char_at_addr(jlsOffset); 2709 assert(TypeArrayKlass::cast(jlsValue->klass())->element_type() == T_CHAR, "compressed string"); 2710 (void) UNICODE::as_utf8(jlsPos, jlsLen, (char *)dst, max_dtrace_string_size); 2711} 2712#endif // ndef HAVE_DTRACE_H 2713 2714// ------------------------------------------------------------------------- 2715// Java-Java calling convention 2716// (what you use when Java calls Java) 2717 2718//------------------------------name_for_receiver---------------------------------- 2719// For a given signature, return the VMReg for parameter 0. 2720VMReg SharedRuntime::name_for_receiver() { 2721 VMRegPair regs; 2722 BasicType sig_bt = T_OBJECT; 2723 (void) java_calling_convention(&sig_bt, ®s, 1, true); 2724 // Return argument 0 register. In the LP64 build pointers 2725 // take 2 registers, but the VM wants only the 'main' name. 2726 return regs.first(); 2727} 2728 2729VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) { 2730 // This method is returning a data structure allocating as a 2731 // ResourceObject, so do not put any ResourceMarks in here. 2732 char *s = sig->as_C_string(); 2733 int len = (int)strlen(s); 2734 *s++; len--; // Skip opening paren 2735 char *t = s+len; 2736 while( *(--t) != ')' ) ; // Find close paren 2737 2738 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, 256 ); 2739 VMRegPair *regs = NEW_RESOURCE_ARRAY( VMRegPair, 256 ); 2740 int cnt = 0; 2741 if (has_receiver) { 2742 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature 2743 } 2744 2745 while( s < t ) { 2746 switch( *s++ ) { // Switch on signature character 2747 case 'B': sig_bt[cnt++] = T_BYTE; break; 2748 case 'C': sig_bt[cnt++] = T_CHAR; break; 2749 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break; 2750 case 'F': sig_bt[cnt++] = T_FLOAT; break; 2751 case 'I': sig_bt[cnt++] = T_INT; break; 2752 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break; 2753 case 'S': sig_bt[cnt++] = T_SHORT; break; 2754 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break; 2755 case 'V': sig_bt[cnt++] = T_VOID; break; 2756 case 'L': // Oop 2757 while( *s++ != ';' ) ; // Skip signature 2758 sig_bt[cnt++] = T_OBJECT; 2759 break; 2760 case '[': { // Array 2761 do { // Skip optional size 2762 while( *s >= '0' && *s <= '9' ) s++; 2763 } while( *s++ == '[' ); // Nested arrays? 2764 // Skip element type 2765 if( s[-1] == 'L' ) 2766 while( *s++ != ';' ) ; // Skip signature 2767 sig_bt[cnt++] = T_ARRAY; 2768 break; 2769 } 2770 default : ShouldNotReachHere(); 2771 } 2772 } 2773 2774 if (has_appendix) { 2775 sig_bt[cnt++] = T_OBJECT; 2776 } 2777 2778 assert( cnt < 256, "grow table size" ); 2779 2780 int comp_args_on_stack; 2781 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true); 2782 2783 // the calling convention doesn't count out_preserve_stack_slots so 2784 // we must add that in to get "true" stack offsets. 2785 2786 if (comp_args_on_stack) { 2787 for (int i = 0; i < cnt; i++) { 2788 VMReg reg1 = regs[i].first(); 2789 if( reg1->is_stack()) { 2790 // Yuck 2791 reg1 = reg1->bias(out_preserve_stack_slots()); 2792 } 2793 VMReg reg2 = regs[i].second(); 2794 if( reg2->is_stack()) { 2795 // Yuck 2796 reg2 = reg2->bias(out_preserve_stack_slots()); 2797 } 2798 regs[i].set_pair(reg2, reg1); 2799 } 2800 } 2801 2802 // results 2803 *arg_size = cnt; 2804 return regs; 2805} 2806 2807// OSR Migration Code 2808// 2809// This code is used convert interpreter frames into compiled frames. It is 2810// called from very start of a compiled OSR nmethod. A temp array is 2811// allocated to hold the interesting bits of the interpreter frame. All 2812// active locks are inflated to allow them to move. The displaced headers and 2813// active interpeter locals are copied into the temp buffer. Then we return 2814// back to the compiled code. The compiled code then pops the current 2815// interpreter frame off the stack and pushes a new compiled frame. Then it 2816// copies the interpreter locals and displaced headers where it wants. 2817// Finally it calls back to free the temp buffer. 2818// 2819// All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed. 2820 2821JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) ) 2822 2823 // 2824 // This code is dependent on the memory layout of the interpreter local 2825 // array and the monitors. On all of our platforms the layout is identical 2826 // so this code is shared. If some platform lays the their arrays out 2827 // differently then this code could move to platform specific code or 2828 // the code here could be modified to copy items one at a time using 2829 // frame accessor methods and be platform independent. 2830 2831 frame fr = thread->last_frame(); 2832 assert( fr.is_interpreted_frame(), "" ); 2833 assert( fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks" ); 2834 2835 // Figure out how many monitors are active. 2836 int active_monitor_count = 0; 2837 for( BasicObjectLock *kptr = fr.interpreter_frame_monitor_end(); 2838 kptr < fr.interpreter_frame_monitor_begin(); 2839 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) { 2840 if( kptr->obj() != NULL ) active_monitor_count++; 2841 } 2842 2843 // QQQ we could place number of active monitors in the array so that compiled code 2844 // could double check it. 2845 2846 Method* moop = fr.interpreter_frame_method(); 2847 int max_locals = moop->max_locals(); 2848 // Allocate temp buffer, 1 word per local & 2 per active monitor 2849 int buf_size_words = max_locals + active_monitor_count*2; 2850 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode); 2851 2852 // Copy the locals. Order is preserved so that loading of longs works. 2853 // Since there's no GC I can copy the oops blindly. 2854 assert( sizeof(HeapWord)==sizeof(intptr_t), "fix this code"); 2855 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1), 2856 (HeapWord*)&buf[0], 2857 max_locals); 2858 2859 // Inflate locks. Copy the displaced headers. Be careful, there can be holes. 2860 int i = max_locals; 2861 for( BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end(); 2862 kptr2 < fr.interpreter_frame_monitor_begin(); 2863 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) { 2864 if( kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array 2865 BasicLock *lock = kptr2->lock(); 2866 // Inflate so the displaced header becomes position-independent 2867 if (lock->displaced_header()->is_unlocked()) 2868 ObjectSynchronizer::inflate_helper(kptr2->obj()); 2869 // Now the displaced header is free to move 2870 buf[i++] = (intptr_t)lock->displaced_header(); 2871 buf[i++] = (intptr_t)kptr2->obj(); 2872 } 2873 } 2874 assert( i - max_locals == active_monitor_count*2, "found the expected number of monitors" ); 2875 2876 return buf; 2877JRT_END 2878 2879JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) ) 2880 FREE_C_HEAP_ARRAY(intptr_t,buf, mtCode); 2881JRT_END 2882 2883bool AdapterHandlerLibrary::contains(CodeBlob* b) { 2884 AdapterHandlerTableIterator iter(_adapters); 2885 while (iter.has_next()) { 2886 AdapterHandlerEntry* a = iter.next(); 2887 if ( b == CodeCache::find_blob(a->get_i2c_entry()) ) return true; 2888 } 2889 return false; 2890} 2891 2892void AdapterHandlerLibrary::print_handler_on(outputStream* st, CodeBlob* b) { 2893 AdapterHandlerTableIterator iter(_adapters); 2894 while (iter.has_next()) { 2895 AdapterHandlerEntry* a = iter.next(); 2896 if (b == CodeCache::find_blob(a->get_i2c_entry())) { 2897 st->print("Adapter for signature: "); 2898 a->print_adapter_on(tty); 2899 return; 2900 } 2901 } 2902 assert(false, "Should have found handler"); 2903} 2904 2905void AdapterHandlerEntry::print_adapter_on(outputStream* st) const { 2906 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT, 2907 (intptr_t) this, fingerprint()->as_string(), 2908 get_i2c_entry(), get_c2i_entry(), get_c2i_unverified_entry()); 2909 2910} 2911 2912#ifndef PRODUCT 2913 2914void AdapterHandlerLibrary::print_statistics() { 2915 _adapters->print_statistics(); 2916} 2917 2918#endif /* PRODUCT */ 2919