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