Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/runtime/stubRoutines.cpp@46b819ba120b (annotated)

src/share/vm/runtime/stubRoutines.cpp

Wed, 30 Sep 2009 13:25:39 -0700

author
jrose
date
Wed, 30 Sep 2009 13:25:39 -0700
changeset 1432
46b819ba120b
parent 451
f8236e79048a
child 1609
ddb7834449d0
permissions
-rw-r--r--

Merge

duke@435 1 /*
duke@435 2 * Copyright 1997-2007 Sun Microsystems, Inc. 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 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any 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
duke@435 100 // Initialization
duke@435 101 //
duke@435 102 // Note: to break cycle with universe initialization, stubs are generated in two phases.
duke@435 103 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
duke@435 104 // The second phase includes all other stubs (which may depend on universe being initialized.)
duke@435 105
duke@435 106 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
duke@435 107
duke@435 108 void StubRoutines::initialize1() {
duke@435 109 if (_code1 == NULL) {
duke@435 110 ResourceMark rm;
duke@435 111 TraceTime timer("StubRoutines generation 1", TraceStartupTime);
duke@435 112 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
duke@435 113 if( _code1 == NULL) vm_exit_out_of_memory1(code_size1, "CodeCache: no room for %s", "StubRoutines (1)");
duke@435 114 CodeBuffer buffer(_code1->instructions_begin(), _code1->instructions_size());
duke@435 115 StubGenerator_generate(&buffer, false);
duke@435 116 }
duke@435 117 }
duke@435 118
duke@435 119
duke@435 120 #ifdef ASSERT
duke@435 121 typedef void (*arraycopy_fn)(address src, address dst, int count);
duke@435 122
duke@435 123 // simple tests of generated arraycopy functions
duke@435 124 static void test_arraycopy_func(address func, int alignment) {
duke@435 125 int v = 0xcc;
duke@435 126 int v2 = 0x11;
duke@435 127 jlong lbuffer[2];
duke@435 128 jlong lbuffer2[2];
duke@435 129 address buffer = (address) lbuffer;
duke@435 130 address buffer2 = (address) lbuffer2;
duke@435 131 unsigned int i;
duke@435 132 for (i = 0; i < sizeof(lbuffer); i++) {
duke@435 133 buffer[i] = v; buffer2[i] = v2;
duke@435 134 }
duke@435 135 // do an aligned copy
duke@435 136 ((arraycopy_fn)func)(buffer, buffer2, 0);
duke@435 137 for (i = 0; i < sizeof(lbuffer); i++) {
duke@435 138 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything");
duke@435 139 }
duke@435 140 // adjust destination alignment
duke@435 141 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
duke@435 142 for (i = 0; i < sizeof(lbuffer); i++) {
duke@435 143 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything");
duke@435 144 }
duke@435 145 // adjust source alignment
duke@435 146 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
duke@435 147 for (i = 0; i < sizeof(lbuffer); i++) {
duke@435 148 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything");
duke@435 149 }
duke@435 150 }
duke@435 151 #endif
duke@435 152
duke@435 153
duke@435 154 void StubRoutines::initialize2() {
duke@435 155 if (_code2 == NULL) {
duke@435 156 ResourceMark rm;
duke@435 157 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
duke@435 158 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
duke@435 159 if( _code2 == NULL) vm_exit_out_of_memory1(code_size2, "CodeCache: no room for %s", "StubRoutines (2)");
duke@435 160 CodeBuffer buffer(_code2->instructions_begin(), _code2->instructions_size());
duke@435 161 StubGenerator_generate(&buffer, true);
duke@435 162 }
duke@435 163
duke@435 164 #ifdef ASSERT
duke@435 165
duke@435 166 #define TEST_ARRAYCOPY(type) \
duke@435 167 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
duke@435 168 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
duke@435 169 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
duke@435 170 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
duke@435 171
duke@435 172 // Make sure all the arraycopy stubs properly handle zeros
duke@435 173 TEST_ARRAYCOPY(jbyte);
duke@435 174 TEST_ARRAYCOPY(jshort);
duke@435 175 TEST_ARRAYCOPY(jint);
duke@435 176 TEST_ARRAYCOPY(jlong);
duke@435 177
duke@435 178 #undef TEST_ARRAYCOPY
duke@435 179
duke@435 180 #endif
duke@435 181 }
duke@435 182
duke@435 183
duke@435 184 void stubRoutines_init1() { StubRoutines::initialize1(); }
duke@435 185 void stubRoutines_init2() { StubRoutines::initialize2(); }
duke@435 186
duke@435 187 //
duke@435 188 // Default versions of arraycopy functions
duke@435 189 //
duke@435 190
duke@435 191 static void gen_arraycopy_barrier(oop* dest, size_t count) {
duke@435 192 assert(count != 0, "count should be non-zero");
duke@435 193 BarrierSet* bs = Universe::heap()->barrier_set();
duke@435 194 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
duke@435 195 bs->write_ref_array(MemRegion((HeapWord*)dest, (HeapWord*)(dest + count)));
duke@435 196 }
duke@435 197
duke@435 198 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
duke@435 199 #ifndef PRODUCT
duke@435 200 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
duke@435 201 #endif // !PRODUCT
duke@435 202 assert(count != 0, "count should be non-zero");
duke@435 203 Copy::conjoint_bytes_atomic(src, dest, count);
duke@435 204 JRT_END
duke@435 205
duke@435 206 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
duke@435 207 #ifndef PRODUCT
duke@435 208 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
duke@435 209 #endif // !PRODUCT
duke@435 210 assert(count != 0, "count should be non-zero");
duke@435 211 Copy::conjoint_jshorts_atomic(src, dest, count);
duke@435 212 JRT_END
duke@435 213
duke@435 214 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
duke@435 215 #ifndef PRODUCT
duke@435 216 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
duke@435 217 #endif // !PRODUCT
duke@435 218 assert(count != 0, "count should be non-zero");
duke@435 219 Copy::conjoint_jints_atomic(src, dest, count);
duke@435 220 JRT_END
duke@435 221
duke@435 222 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
duke@435 223 #ifndef PRODUCT
duke@435 224 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
duke@435 225 #endif // !PRODUCT
duke@435 226 assert(count != 0, "count should be non-zero");
duke@435 227 Copy::conjoint_jlongs_atomic(src, dest, count);
duke@435 228 JRT_END
duke@435 229
duke@435 230 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
duke@435 231 #ifndef PRODUCT
duke@435 232 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
duke@435 233 #endif // !PRODUCT
duke@435 234 assert(count != 0, "count should be non-zero");
duke@435 235 Copy::conjoint_oops_atomic(src, dest, count);
duke@435 236 gen_arraycopy_barrier(dest, count);
duke@435 237 JRT_END
duke@435 238
duke@435 239 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 240 #ifndef PRODUCT
duke@435 241 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
duke@435 242 #endif // !PRODUCT
duke@435 243 assert(count != 0, "count should be non-zero");
duke@435 244 Copy::arrayof_conjoint_bytes(src, dest, count);
duke@435 245 JRT_END
duke@435 246
duke@435 247 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 248 #ifndef PRODUCT
duke@435 249 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
duke@435 250 #endif // !PRODUCT
duke@435 251 assert(count != 0, "count should be non-zero");
duke@435 252 Copy::arrayof_conjoint_jshorts(src, dest, count);
duke@435 253 JRT_END
duke@435 254
duke@435 255 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* 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 assert(count != 0, "count should be non-zero");
duke@435 260 Copy::arrayof_conjoint_jints(src, dest, count);
duke@435 261 JRT_END
duke@435 262
duke@435 263 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 264 #ifndef PRODUCT
duke@435 265 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
duke@435 266 #endif // !PRODUCT
duke@435 267 assert(count != 0, "count should be non-zero");
duke@435 268 Copy::arrayof_conjoint_jlongs(src, dest, count);
duke@435 269 JRT_END
duke@435 270
duke@435 271 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
duke@435 272 #ifndef PRODUCT
duke@435 273 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
duke@435 274 #endif // !PRODUCT
duke@435 275 assert(count != 0, "count should be non-zero");
duke@435 276 Copy::arrayof_conjoint_oops(src, dest, count);
duke@435 277 gen_arraycopy_barrier((oop *) dest, count);
duke@435 278 JRT_END

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial