duke@435: /* trims@1907: * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "asm/codeBuffer.hpp" stefank@2314: #include "memory/resourceArea.hpp" stefank@2314: #include "oops/oop.inline.hpp" stefank@2314: #include "runtime/interfaceSupport.hpp" stefank@2314: #include "runtime/sharedRuntime.hpp" stefank@2314: #include "runtime/stubRoutines.hpp" stefank@2314: #include "runtime/timer.hpp" stefank@2314: #include "utilities/copy.hpp" stefank@2314: #ifdef COMPILER2 stefank@2314: #include "opto/runtime.hpp" stefank@2314: #endif duke@435: duke@435: duke@435: // Implementation of StubRoutines - for a description duke@435: // of how to extend it, see the header file. duke@435: duke@435: // Class Variables duke@435: duke@435: BufferBlob* StubRoutines::_code1 = NULL; duke@435: BufferBlob* StubRoutines::_code2 = NULL; duke@435: duke@435: address StubRoutines::_call_stub_return_address = NULL; duke@435: address StubRoutines::_call_stub_entry = NULL; duke@435: duke@435: address StubRoutines::_catch_exception_entry = NULL; duke@435: address StubRoutines::_forward_exception_entry = NULL; duke@435: address StubRoutines::_throw_AbstractMethodError_entry = NULL; dcubed@451: address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL; duke@435: address StubRoutines::_throw_ArithmeticException_entry = NULL; duke@435: address StubRoutines::_throw_NullPointerException_entry = NULL; duke@435: address StubRoutines::_throw_NullPointerException_at_call_entry = NULL; duke@435: address StubRoutines::_throw_StackOverflowError_entry = NULL; duke@435: address StubRoutines::_handler_for_unsafe_access_entry = NULL; duke@435: jint StubRoutines::_verify_oop_count = 0; duke@435: address StubRoutines::_verify_oop_subroutine_entry = NULL; duke@435: address StubRoutines::_atomic_xchg_entry = NULL; duke@435: address StubRoutines::_atomic_xchg_ptr_entry = NULL; duke@435: address StubRoutines::_atomic_store_entry = NULL; duke@435: address StubRoutines::_atomic_store_ptr_entry = NULL; duke@435: address StubRoutines::_atomic_cmpxchg_entry = NULL; duke@435: address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; duke@435: address StubRoutines::_atomic_cmpxchg_long_entry = NULL; duke@435: address StubRoutines::_atomic_add_entry = NULL; duke@435: address StubRoutines::_atomic_add_ptr_entry = NULL; duke@435: address StubRoutines::_fence_entry = NULL; duke@435: address StubRoutines::_d2i_wrapper = NULL; duke@435: address StubRoutines::_d2l_wrapper = NULL; duke@435: duke@435: jint StubRoutines::_fpu_cntrl_wrd_std = 0; duke@435: jint StubRoutines::_fpu_cntrl_wrd_24 = 0; duke@435: jint StubRoutines::_fpu_cntrl_wrd_64 = 0; duke@435: jint StubRoutines::_fpu_cntrl_wrd_trunc = 0; duke@435: jint StubRoutines::_mxcsr_std = 0; duke@435: jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; duke@435: jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 }; duke@435: duke@435: // Compiled code entry points default values duke@435: // The dafault functions don't have separate disjoint versions. duke@435: address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); duke@435: address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); duke@435: address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); duke@435: address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); duke@435: address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); duke@435: address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); duke@435: address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); duke@435: address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); duke@435: address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); duke@435: address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); duke@435: duke@435: address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); duke@435: address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); duke@435: address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); duke@435: address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); duke@435: address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); duke@435: address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); duke@435: address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); duke@435: address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); duke@435: address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); duke@435: address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); duke@435: duke@435: address StubRoutines::_checkcast_arraycopy = NULL; duke@435: address StubRoutines::_unsafe_arraycopy = NULL; duke@435: address StubRoutines::_generic_arraycopy = NULL; duke@435: never@2118: never@2118: address StubRoutines::_jbyte_fill; never@2118: address StubRoutines::_jshort_fill; never@2118: address StubRoutines::_jint_fill; never@2118: address StubRoutines::_arrayof_jbyte_fill; never@2118: address StubRoutines::_arrayof_jshort_fill; never@2118: address StubRoutines::_arrayof_jint_fill; never@2118: never@2118: never@1609: double (* StubRoutines::_intrinsic_log )(double) = NULL; never@1609: double (* StubRoutines::_intrinsic_log10 )(double) = NULL; never@1609: double (* StubRoutines::_intrinsic_exp )(double) = NULL; never@1609: double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; never@1609: double (* StubRoutines::_intrinsic_sin )(double) = NULL; never@1609: double (* StubRoutines::_intrinsic_cos )(double) = NULL; never@1609: double (* StubRoutines::_intrinsic_tan )(double) = NULL; never@1609: duke@435: // Initialization duke@435: // duke@435: // Note: to break cycle with universe initialization, stubs are generated in two phases. duke@435: // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). duke@435: // The second phase includes all other stubs (which may depend on universe being initialized.) duke@435: duke@435: extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators duke@435: duke@435: void StubRoutines::initialize1() { duke@435: if (_code1 == NULL) { duke@435: ResourceMark rm; duke@435: TraceTime timer("StubRoutines generation 1", TraceStartupTime); duke@435: _code1 = BufferBlob::create("StubRoutines (1)", code_size1); jcoomes@1845: if (_code1 == NULL) { twisti@2103: vm_exit_out_of_memory(code_size1, "CodeCache: no room for StubRoutines (1)"); jcoomes@1845: } twisti@2103: CodeBuffer buffer(_code1); duke@435: StubGenerator_generate(&buffer, false); duke@435: } duke@435: } duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: typedef void (*arraycopy_fn)(address src, address dst, int count); duke@435: duke@435: // simple tests of generated arraycopy functions duke@435: static void test_arraycopy_func(address func, int alignment) { duke@435: int v = 0xcc; duke@435: int v2 = 0x11; kvn@1958: jlong lbuffer[8]; kvn@1958: jlong lbuffer2[8]; kvn@1958: address fbuffer = (address) lbuffer; kvn@1958: address fbuffer2 = (address) lbuffer2; duke@435: unsigned int i; duke@435: for (i = 0; i < sizeof(lbuffer); i++) { kvn@1958: fbuffer[i] = v; fbuffer2[i] = v2; duke@435: } kvn@1958: // C++ does not guarantee jlong[] array alignment to 8 bytes. kvn@1958: // Use middle of array to check that memory before it is not modified. kvn@1958: address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong); kvn@1958: address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong); duke@435: // do an aligned copy duke@435: ((arraycopy_fn)func)(buffer, buffer2, 0); duke@435: for (i = 0; i < sizeof(lbuffer); i++) { kvn@1958: assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); duke@435: } duke@435: // adjust destination alignment duke@435: ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); duke@435: for (i = 0; i < sizeof(lbuffer); i++) { kvn@1958: assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); duke@435: } duke@435: // adjust source alignment duke@435: ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); duke@435: for (i = 0; i < sizeof(lbuffer); i++) { kvn@1958: assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything"); duke@435: } duke@435: } duke@435: #endif duke@435: duke@435: duke@435: void StubRoutines::initialize2() { duke@435: if (_code2 == NULL) { duke@435: ResourceMark rm; duke@435: TraceTime timer("StubRoutines generation 2", TraceStartupTime); duke@435: _code2 = BufferBlob::create("StubRoutines (2)", code_size2); jcoomes@1845: if (_code2 == NULL) { twisti@2103: vm_exit_out_of_memory(code_size2, "CodeCache: no room for StubRoutines (2)"); jcoomes@1845: } twisti@2103: CodeBuffer buffer(_code2); duke@435: StubGenerator_generate(&buffer, true); duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: duke@435: #define TEST_ARRAYCOPY(type) \ duke@435: test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ duke@435: test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ duke@435: test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ duke@435: test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) duke@435: kvn@1958: // Make sure all the arraycopy stubs properly handle zero count duke@435: TEST_ARRAYCOPY(jbyte); duke@435: TEST_ARRAYCOPY(jshort); duke@435: TEST_ARRAYCOPY(jint); duke@435: TEST_ARRAYCOPY(jlong); duke@435: duke@435: #undef TEST_ARRAYCOPY duke@435: never@2118: #define TEST_FILL(type) \ never@2118: if (_##type##_fill != NULL) { \ never@2118: union { \ never@2118: double d; \ never@2118: type body[96]; \ never@2118: } s; \ never@2118: \ never@2118: int v = 32; \ never@2118: for (int offset = -2; offset <= 2; offset++) { \ never@2118: for (int i = 0; i < 96; i++) { \ never@2118: s.body[i] = 1; \ never@2118: } \ never@2118: type* start = s.body + 8 + offset; \ never@2118: for (int aligned = 0; aligned < 2; aligned++) { \ never@2118: if (aligned) { \ never@2118: if (((intptr_t)start) % HeapWordSize == 0) { \ never@2118: ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \ never@2118: } else { \ never@2118: continue; \ never@2118: } \ never@2118: } else { \ never@2118: ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \ never@2118: } \ never@2118: for (int i = 0; i < 96; i++) { \ never@2118: if (i < (8 + offset) || i >= (88 + offset)) { \ never@2118: assert(s.body[i] == 1, "what?"); \ never@2118: } else { \ never@2118: assert(s.body[i] == 32, "what?"); \ never@2118: } \ never@2118: } \ never@2118: } \ never@2118: } \ never@2118: } \ never@2118: never@2118: TEST_FILL(jbyte); never@2118: TEST_FILL(jshort); never@2118: TEST_FILL(jint); never@2118: never@2118: #undef TEST_FILL never@2118: kvn@1958: #define TEST_COPYRTN(type) \ kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \ kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type))) kvn@1958: kvn@1958: // Make sure all the copy runtime routines properly handle zero count kvn@1958: TEST_COPYRTN(jbyte); kvn@1958: TEST_COPYRTN(jshort); kvn@1958: TEST_COPYRTN(jint); kvn@1958: TEST_COPYRTN(jlong); kvn@1958: kvn@1958: #undef TEST_COPYRTN kvn@1958: kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord)); kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord)); kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord)); kvn@1958: // Aligned to BytesPerLong kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong)); kvn@1958: test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong)); kvn@1958: duke@435: #endif duke@435: } duke@435: duke@435: duke@435: void stubRoutines_init1() { StubRoutines::initialize1(); } duke@435: void stubRoutines_init2() { StubRoutines::initialize2(); } duke@435: duke@435: // duke@435: // Default versions of arraycopy functions duke@435: // duke@435: ysr@1680: static void gen_arraycopy_barrier_pre(oop* dest, size_t count) { ysr@1680: assert(count != 0, "count should be non-zero"); ysr@1680: assert(count <= (size_t)max_intx, "count too large"); ysr@1680: BarrierSet* bs = Universe::heap()->barrier_set(); ysr@1680: assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); ysr@1680: bs->write_ref_array_pre(dest, (int)count); ysr@1680: } ysr@1680: duke@435: static void gen_arraycopy_barrier(oop* dest, size_t count) { duke@435: assert(count != 0, "count should be non-zero"); duke@435: BarrierSet* bs = Universe::heap()->barrier_set(); duke@435: assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); ysr@1680: bs->write_ref_array((HeapWord*)dest, count); duke@435: } duke@435: duke@435: JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy duke@435: #endif // !PRODUCT kvn@1958: Copy::conjoint_jbytes_atomic(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy duke@435: #endif // !PRODUCT duke@435: Copy::conjoint_jshorts_atomic(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy duke@435: #endif // !PRODUCT duke@435: Copy::conjoint_jints_atomic(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy duke@435: #endif // !PRODUCT duke@435: Copy::conjoint_jlongs_atomic(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy duke@435: #endif // !PRODUCT duke@435: assert(count != 0, "count should be non-zero"); ysr@1680: gen_arraycopy_barrier_pre(dest, count); duke@435: Copy::conjoint_oops_atomic(src, dest, count); duke@435: gen_arraycopy_barrier(dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy duke@435: #endif // !PRODUCT kvn@1958: Copy::arrayof_conjoint_jbytes(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy duke@435: #endif // !PRODUCT duke@435: Copy::arrayof_conjoint_jshorts(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy duke@435: #endif // !PRODUCT duke@435: Copy::arrayof_conjoint_jints(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy duke@435: #endif // !PRODUCT duke@435: Copy::arrayof_conjoint_jlongs(src, dest, count); duke@435: JRT_END duke@435: duke@435: JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) duke@435: #ifndef PRODUCT duke@435: SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy duke@435: #endif // !PRODUCT duke@435: assert(count != 0, "count should be non-zero"); ysr@1680: gen_arraycopy_barrier_pre((oop *) dest, count); duke@435: Copy::arrayof_conjoint_oops(src, dest, count); duke@435: gen_arraycopy_barrier((oop *) dest, count); duke@435: JRT_END never@2118: never@2118: never@2118: address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) { never@2118: #define RETURN_STUB(xxx_fill) { \ never@2118: name = #xxx_fill; \ never@2118: return StubRoutines::xxx_fill(); } never@2118: never@2118: switch (t) { never@2118: case T_BYTE: never@2118: case T_BOOLEAN: never@2118: if (!aligned) RETURN_STUB(jbyte_fill); never@2118: RETURN_STUB(arrayof_jbyte_fill); never@2118: case T_CHAR: never@2118: case T_SHORT: never@2118: if (!aligned) RETURN_STUB(jshort_fill); never@2118: RETURN_STUB(arrayof_jshort_fill); never@2118: case T_INT: never@2118: case T_FLOAT: never@2118: if (!aligned) RETURN_STUB(jint_fill); never@2118: RETURN_STUB(arrayof_jint_fill); never@2118: case T_DOUBLE: never@2118: case T_LONG: never@2118: case T_ARRAY: never@2118: case T_OBJECT: never@2118: case T_NARROWOOP: never@2118: case T_ADDRESS: never@2118: // Currently unsupported never@2118: return NULL; never@2118: never@2118: default: never@2118: ShouldNotReachHere(); never@2118: return NULL; never@2118: } never@2118: never@2118: #undef RETURN_STUB never@2118: }