src/share/vm/runtime/stubRoutines.cpp

Wed, 25 Aug 2010 05:27:54 -0700

author
twisti
date
Wed, 25 Aug 2010 05:27:54 -0700
changeset 2103
3e8fbc61cee8
parent 1958
d93949c5bdcc
child 2119
14197af1010e
permissions
-rw-r--r--

6978355: renaming for 6961697
Summary: This is the renaming part of 6961697 to keep the actual changes small for review.
Reviewed-by: kvn, never

duke@435 1 /*
trims@1907 2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 #include "incls/_precompiled.incl"
duke@435 26 #include "incls/_stubRoutines.cpp.incl"
duke@435 27
duke@435 28
duke@435 29 // Implementation of StubRoutines - for a description
duke@435 30 // of how to extend it, see the header file.
duke@435 31
duke@435 32 // Class Variables
duke@435 33
duke@435 34 BufferBlob* StubRoutines::_code1 = NULL;
duke@435 35 BufferBlob* StubRoutines::_code2 = NULL;
duke@435 36
duke@435 37 address StubRoutines::_call_stub_return_address = NULL;
duke@435 38 address StubRoutines::_call_stub_entry = NULL;
duke@435 39
duke@435 40 address StubRoutines::_catch_exception_entry = NULL;
duke@435 41 address StubRoutines::_forward_exception_entry = NULL;
duke@435 42 address StubRoutines::_throw_AbstractMethodError_entry = NULL;
dcubed@451 43 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
duke@435 44 address StubRoutines::_throw_ArithmeticException_entry = NULL;
duke@435 45 address StubRoutines::_throw_NullPointerException_entry = NULL;
duke@435 46 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
duke@435 47 address StubRoutines::_throw_StackOverflowError_entry = NULL;
duke@435 48 address StubRoutines::_handler_for_unsafe_access_entry = NULL;
duke@435 49 jint StubRoutines::_verify_oop_count = 0;
duke@435 50 address StubRoutines::_verify_oop_subroutine_entry = NULL;
duke@435 51 address StubRoutines::_atomic_xchg_entry = NULL;
duke@435 52 address StubRoutines::_atomic_xchg_ptr_entry = NULL;
duke@435 53 address StubRoutines::_atomic_store_entry = NULL;
duke@435 54 address StubRoutines::_atomic_store_ptr_entry = NULL;
duke@435 55 address StubRoutines::_atomic_cmpxchg_entry = NULL;
duke@435 56 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL;
duke@435 57 address StubRoutines::_atomic_cmpxchg_long_entry = NULL;
duke@435 58 address StubRoutines::_atomic_add_entry = NULL;
duke@435 59 address StubRoutines::_atomic_add_ptr_entry = NULL;
duke@435 60 address StubRoutines::_fence_entry = NULL;
duke@435 61 address StubRoutines::_d2i_wrapper = NULL;
duke@435 62 address StubRoutines::_d2l_wrapper = NULL;
duke@435 63
duke@435 64 jint StubRoutines::_fpu_cntrl_wrd_std = 0;
duke@435 65 jint StubRoutines::_fpu_cntrl_wrd_24 = 0;
duke@435 66 jint StubRoutines::_fpu_cntrl_wrd_64 = 0;
duke@435 67 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0;
duke@435 68 jint StubRoutines::_mxcsr_std = 0;
duke@435 69 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 };
duke@435 70 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 };
duke@435 71
duke@435 72 // Compiled code entry points default values
duke@435 73 // The dafault functions don't have separate disjoint versions.
duke@435 74 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
duke@435 75 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
duke@435 76 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
duke@435 77 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
duke@435 78 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
duke@435 79 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
duke@435 80 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
duke@435 81 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
duke@435 82 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
duke@435 83 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
duke@435 84
duke@435 85 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
duke@435 86 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
duke@435 87 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
duke@435 88 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
duke@435 89 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
duke@435 90 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
duke@435 91 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
duke@435 92 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
duke@435 93 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
duke@435 94 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
duke@435 95
duke@435 96 address StubRoutines::_checkcast_arraycopy = NULL;
duke@435 97 address StubRoutines::_unsafe_arraycopy = NULL;
duke@435 98 address StubRoutines::_generic_arraycopy = NULL;
duke@435 99
never@1609 100 double (* StubRoutines::_intrinsic_log )(double) = NULL;
never@1609 101 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
never@1609 102 double (* StubRoutines::_intrinsic_exp )(double) = NULL;
never@1609 103 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL;
never@1609 104 double (* StubRoutines::_intrinsic_sin )(double) = NULL;
never@1609 105 double (* StubRoutines::_intrinsic_cos )(double) = NULL;
never@1609 106 double (* StubRoutines::_intrinsic_tan )(double) = NULL;
never@1609 107
duke@435 108 // Initialization
duke@435 109 //
duke@435 110 // Note: to break cycle with universe initialization, stubs are generated in two phases.
duke@435 111 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
duke@435 112 // The second phase includes all other stubs (which may depend on universe being initialized.)
duke@435 113
duke@435 114 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
duke@435 115
duke@435 116 void StubRoutines::initialize1() {
duke@435 117 if (_code1 == NULL) {
duke@435 118 ResourceMark rm;
duke@435 119 TraceTime timer("StubRoutines generation 1", TraceStartupTime);
duke@435 120 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
jcoomes@1845 121 if (_code1 == NULL) {
twisti@2103 122 vm_exit_out_of_memory(code_size1, "CodeCache: no room for StubRoutines (1)");
jcoomes@1845 123 }
twisti@2103 124 CodeBuffer buffer(_code1);
duke@435 125 StubGenerator_generate(&buffer, false);
duke@435 126 }
duke@435 127 }
duke@435 128
duke@435 129
duke@435 130 #ifdef ASSERT
duke@435 131 typedef void (*arraycopy_fn)(address src, address dst, int count);
duke@435 132
duke@435 133 // simple tests of generated arraycopy functions
duke@435 134 static void test_arraycopy_func(address func, int alignment) {
duke@435 135 int v = 0xcc;
duke@435 136 int v2 = 0x11;
kvn@1958 137 jlong lbuffer[8];
kvn@1958 138 jlong lbuffer2[8];
kvn@1958 139 address fbuffer = (address) lbuffer;
kvn@1958 140 address fbuffer2 = (address) lbuffer2;
duke@435 141 unsigned int i;
duke@435 142 for (i = 0; i < sizeof(lbuffer); i++) {
kvn@1958 143 fbuffer[i] = v; fbuffer2[i] = v2;
duke@435 144 }
kvn@1958 145 // C++ does not guarantee jlong[] array alignment to 8 bytes.
kvn@1958 146 // Use middle of array to check that memory before it is not modified.
kvn@1958 147 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
kvn@1958 148 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
duke@435 149 // do an aligned copy
duke@435 150 ((arraycopy_fn)func)(buffer, buffer2, 0);
duke@435 151 for (i = 0; i < sizeof(lbuffer); i++) {
kvn@1958 152 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
duke@435 153 }
duke@435 154 // adjust destination alignment
duke@435 155 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
duke@435 156 for (i = 0; i < sizeof(lbuffer); i++) {
kvn@1958 157 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
duke@435 158 }
duke@435 159 // adjust source alignment
duke@435 160 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
duke@435 161 for (i = 0; i < sizeof(lbuffer); i++) {
kvn@1958 162 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
duke@435 163 }
duke@435 164 }
duke@435 165 #endif
duke@435 166
duke@435 167
duke@435 168 void StubRoutines::initialize2() {
duke@435 169 if (_code2 == NULL) {
duke@435 170 ResourceMark rm;
duke@435 171 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
duke@435 172 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
jcoomes@1845 173 if (_code2 == NULL) {
twisti@2103 174 vm_exit_out_of_memory(code_size2, "CodeCache: no room for StubRoutines (2)");
jcoomes@1845 175 }
twisti@2103 176 CodeBuffer buffer(_code2);
duke@435 177 StubGenerator_generate(&buffer, true);
duke@435 178 }
duke@435 179
duke@435 180 #ifdef ASSERT
duke@435 181
duke@435 182 #define TEST_ARRAYCOPY(type) \
duke@435 183 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
duke@435 184 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
duke@435 185 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
duke@435 186 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
duke@435 187
kvn@1958 188 // Make sure all the arraycopy stubs properly handle zero count
duke@435 189 TEST_ARRAYCOPY(jbyte);
duke@435 190 TEST_ARRAYCOPY(jshort);
duke@435 191 TEST_ARRAYCOPY(jint);
duke@435 192 TEST_ARRAYCOPY(jlong);
duke@435 193
duke@435 194 #undef TEST_ARRAYCOPY
duke@435 195
kvn@1958 196 #define TEST_COPYRTN(type) \
kvn@1958 197 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
kvn@1958 198 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
kvn@1958 199
kvn@1958 200 // Make sure all the copy runtime routines properly handle zero count
kvn@1958 201 TEST_COPYRTN(jbyte);
kvn@1958 202 TEST_COPYRTN(jshort);
kvn@1958 203 TEST_COPYRTN(jint);
kvn@1958 204 TEST_COPYRTN(jlong);
kvn@1958 205
kvn@1958 206 #undef TEST_COPYRTN
kvn@1958 207
kvn@1958 208 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
kvn@1958 209 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
kvn@1958 210 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
kvn@1958 211 // Aligned to BytesPerLong
kvn@1958 212 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
kvn@1958 213 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
kvn@1958 214
duke@435 215 #endif
duke@435 216 }
duke@435 217
duke@435 218
duke@435 219 void stubRoutines_init1() { StubRoutines::initialize1(); }
duke@435 220 void stubRoutines_init2() { StubRoutines::initialize2(); }
duke@435 221
duke@435 222 //
duke@435 223 // Default versions of arraycopy functions
duke@435 224 //
duke@435 225
ysr@1680 226 static void gen_arraycopy_barrier_pre(oop* dest, size_t count) {
ysr@1680 227 assert(count != 0, "count should be non-zero");
ysr@1680 228 assert(count <= (size_t)max_intx, "count too large");
ysr@1680 229 BarrierSet* bs = Universe::heap()->barrier_set();
ysr@1680 230 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
ysr@1680 231 bs->write_ref_array_pre(dest, (int)count);
ysr@1680 232 }
ysr@1680 233
duke@435 234 static void gen_arraycopy_barrier(oop* dest, size_t count) {
duke@435 235 assert(count != 0, "count should be non-zero");
duke@435 236 BarrierSet* bs = Universe::heap()->barrier_set();
duke@435 237 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
ysr@1680 238 bs->write_ref_array((HeapWord*)dest, count);
duke@435 239 }
duke@435 240
duke@435 241 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
duke@435 242 #ifndef PRODUCT
duke@435 243 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
duke@435 244 #endif // !PRODUCT
kvn@1958 245 Copy::conjoint_jbytes_atomic(src, dest, count);
duke@435 246 JRT_END
duke@435 247
duke@435 248 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
duke@435 249 #ifndef PRODUCT
duke@435 250 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
duke@435 251 #endif // !PRODUCT
duke@435 252 Copy::conjoint_jshorts_atomic(src, dest, count);
duke@435 253 JRT_END
duke@435 254
duke@435 255 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
duke@435 256 #ifndef PRODUCT
duke@435 257 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
duke@435 258 #endif // !PRODUCT
duke@435 259 Copy::conjoint_jints_atomic(src, dest, count);
duke@435 260 JRT_END
duke@435 261
duke@435 262 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
duke@435 263 #ifndef PRODUCT
duke@435 264 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
duke@435 265 #endif // !PRODUCT
duke@435 266 Copy::conjoint_jlongs_atomic(src, dest, count);
duke@435 267 JRT_END
duke@435 268
duke@435 269 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
duke@435 270 #ifndef PRODUCT
duke@435 271 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
duke@435 272 #endif // !PRODUCT
duke@435 273 assert(count != 0, "count should be non-zero");
ysr@1680 274 gen_arraycopy_barrier_pre(dest, count);
duke@435 275 Copy::conjoint_oops_atomic(src, dest, count);
duke@435 276 gen_arraycopy_barrier(dest, count);
duke@435 277 JRT_END
duke@435 278
duke@435 279 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 280 #ifndef PRODUCT
duke@435 281 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
duke@435 282 #endif // !PRODUCT
kvn@1958 283 Copy::arrayof_conjoint_jbytes(src, dest, count);
duke@435 284 JRT_END
duke@435 285
duke@435 286 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 287 #ifndef PRODUCT
duke@435 288 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
duke@435 289 #endif // !PRODUCT
duke@435 290 Copy::arrayof_conjoint_jshorts(src, dest, count);
duke@435 291 JRT_END
duke@435 292
duke@435 293 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 294 #ifndef PRODUCT
duke@435 295 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
duke@435 296 #endif // !PRODUCT
duke@435 297 Copy::arrayof_conjoint_jints(src, dest, count);
duke@435 298 JRT_END
duke@435 299
duke@435 300 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 301 #ifndef PRODUCT
duke@435 302 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
duke@435 303 #endif // !PRODUCT
duke@435 304 Copy::arrayof_conjoint_jlongs(src, dest, count);
duke@435 305 JRT_END
duke@435 306
duke@435 307 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 308 #ifndef PRODUCT
duke@435 309 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
duke@435 310 #endif // !PRODUCT
duke@435 311 assert(count != 0, "count should be non-zero");
ysr@1680 312 gen_arraycopy_barrier_pre((oop *) dest, count);
duke@435 313 Copy::arrayof_conjoint_oops(src, dest, count);
duke@435 314 gen_arraycopy_barrier((oop *) dest, count);
duke@435 315 JRT_END

mercurial