1 /*
2 * Copyright (c) 1997, 2011, 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 "precompiled.hpp"
26 #include "asm/codeBuffer.hpp"
27 #include "memory/resourceArea.hpp"
28 #include "oops/oop.inline.hpp"
29 #include "runtime/interfaceSupport.hpp"
30 #include "runtime/sharedRuntime.hpp"
31 #include "runtime/stubRoutines.hpp"
32 #include "runtime/timer.hpp"
33 #include "utilities/copy.hpp"
34 #ifdef COMPILER2
35 #include "opto/runtime.hpp"
36 #endif
37
38
39 // Implementation of StubRoutines - for a description
40 // of how to extend it, see the header file.
41
42 // Class Variables
43
44 BufferBlob* StubRoutines::_code1 = NULL;
45 BufferBlob* StubRoutines::_code2 = NULL;
46
47 address StubRoutines::_call_stub_return_address = NULL;
48 address StubRoutines::_call_stub_entry = NULL;
49
50 address StubRoutines::_catch_exception_entry = NULL;
51 address StubRoutines::_forward_exception_entry = NULL;
52 address StubRoutines::_throw_AbstractMethodError_entry = NULL;
53 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL;
54 address StubRoutines::_throw_ArithmeticException_entry = NULL;
55 address StubRoutines::_throw_NullPointerException_entry = NULL;
56 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL;
57 address StubRoutines::_throw_StackOverflowError_entry = NULL;
58 address StubRoutines::_handler_for_unsafe_access_entry = NULL;
59 jint StubRoutines::_verify_oop_count = 0;
60 address StubRoutines::_verify_oop_subroutine_entry = NULL;
61 address StubRoutines::_atomic_xchg_entry = NULL;
62 address StubRoutines::_atomic_xchg_ptr_entry = NULL;
63 address StubRoutines::_atomic_store_entry = NULL;
64 address StubRoutines::_atomic_store_ptr_entry = NULL;
65 address StubRoutines::_atomic_cmpxchg_entry = NULL;
66 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL;
67 address StubRoutines::_atomic_cmpxchg_long_entry = NULL;
68 address StubRoutines::_atomic_add_entry = NULL;
69 address StubRoutines::_atomic_add_ptr_entry = NULL;
70 address StubRoutines::_fence_entry = NULL;
71 address StubRoutines::_d2i_wrapper = NULL;
72 address StubRoutines::_d2l_wrapper = NULL;
73
74 jint StubRoutines::_fpu_cntrl_wrd_std = 0;
75 jint StubRoutines::_fpu_cntrl_wrd_24 = 0;
76 jint StubRoutines::_fpu_cntrl_wrd_64 = 0;
77 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0;
78 jint StubRoutines::_mxcsr_std = 0;
79 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 };
80 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 };
81
82 // Compiled code entry points default values
83 // The default functions don't have separate disjoint versions.
84 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
85 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
86 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
87 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
88 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
89 address StubRoutines::_oop_arraycopy_no_pre = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_no_pre);
90 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy);
91 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy);
92 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy);
93 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy);
94 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy);
95 address StubRoutines::_oop_disjoint_arraycopy_no_pre = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy_no_pre);
96
97 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
98 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
99 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
100 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
101 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
102 address StubRoutines::_arrayof_oop_arraycopy_no_pre = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_no_pre);
103 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy);
104 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy);
105 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy);
106 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy);
107 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy);
108 address StubRoutines::_arrayof_oop_disjoint_arraycopy_no_pre = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy_no_pre);
109
110
111 address StubRoutines::_checkcast_arraycopy = NULL;
112 address StubRoutines::_checkcast_arraycopy_no_pre = NULL;
113 address StubRoutines::_unsafe_arraycopy = NULL;
114 address StubRoutines::_generic_arraycopy = NULL;
115
116
117 address StubRoutines::_jbyte_fill;
118 address StubRoutines::_jshort_fill;
119 address StubRoutines::_jint_fill;
120 address StubRoutines::_arrayof_jbyte_fill;
121 address StubRoutines::_arrayof_jshort_fill;
122 address StubRoutines::_arrayof_jint_fill;
123
124
125 double (* StubRoutines::_intrinsic_log )(double) = NULL;
126 double (* StubRoutines::_intrinsic_log10 )(double) = NULL;
127 double (* StubRoutines::_intrinsic_exp )(double) = NULL;
128 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL;
129 double (* StubRoutines::_intrinsic_sin )(double) = NULL;
130 double (* StubRoutines::_intrinsic_cos )(double) = NULL;
131 double (* StubRoutines::_intrinsic_tan )(double) = NULL;
132
133 // Initialization
134 //
135 // Note: to break cycle with universe initialization, stubs are generated in two phases.
136 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
137 // The second phase includes all other stubs (which may depend on universe being initialized.)
138
139 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators
140
141 void StubRoutines::initialize1() {
142 if (_code1 == NULL) {
143 ResourceMark rm;
144 TraceTime timer("StubRoutines generation 1", TraceStartupTime);
145 _code1 = BufferBlob::create("StubRoutines (1)", code_size1);
146 if (_code1 == NULL) {
147 vm_exit_out_of_memory(code_size1, "CodeCache: no room for StubRoutines (1)");
148 }
149 CodeBuffer buffer(_code1);
150 StubGenerator_generate(&buffer, false);
151 }
152 }
153
154
155 #ifdef ASSERT
156 typedef void (*arraycopy_fn)(address src, address dst, int count);
157
158 // simple tests of generated arraycopy functions
159 static void test_arraycopy_func(address func, int alignment) {
160 int v = 0xcc;
161 int v2 = 0x11;
162 jlong lbuffer[8];
163 jlong lbuffer2[8];
164 address fbuffer = (address) lbuffer;
165 address fbuffer2 = (address) lbuffer2;
166 unsigned int i;
167 for (i = 0; i < sizeof(lbuffer); i++) {
168 fbuffer[i] = v; fbuffer2[i] = v2;
169 }
170 // C++ does not guarantee jlong[] array alignment to 8 bytes.
171 // Use middle of array to check that memory before it is not modified.
172 address buffer = (address) round_to((intptr_t)&lbuffer[4], BytesPerLong);
173 address buffer2 = (address) round_to((intptr_t)&lbuffer2[4], BytesPerLong);
174 // do an aligned copy
175 ((arraycopy_fn)func)(buffer, buffer2, 0);
176 for (i = 0; i < sizeof(lbuffer); i++) {
177 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
178 }
179 // adjust destination alignment
180 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0);
181 for (i = 0; i < sizeof(lbuffer); i++) {
182 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
183 }
184 // adjust source alignment
185 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0);
186 for (i = 0; i < sizeof(lbuffer); i++) {
187 assert(fbuffer[i] == v && fbuffer2[i] == v2, "shouldn't have copied anything");
188 }
189 }
190 #endif
191
192
193 void StubRoutines::initialize2() {
194 if (_code2 == NULL) {
195 ResourceMark rm;
196 TraceTime timer("StubRoutines generation 2", TraceStartupTime);
197 _code2 = BufferBlob::create("StubRoutines (2)", code_size2);
198 if (_code2 == NULL) {
199 vm_exit_out_of_memory(code_size2, "CodeCache: no room for StubRoutines (2)");
200 }
201 CodeBuffer buffer(_code2);
202 StubGenerator_generate(&buffer, true);
203 }
204
205 #ifdef ASSERT
206
207 #define TEST_ARRAYCOPY(type) \
208 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \
209 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \
210 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \
211 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord))
212
213 // Make sure all the arraycopy stubs properly handle zero count
214 TEST_ARRAYCOPY(jbyte);
215 TEST_ARRAYCOPY(jshort);
216 TEST_ARRAYCOPY(jint);
217 TEST_ARRAYCOPY(jlong);
218
219 #undef TEST_ARRAYCOPY
220
221 #define TEST_FILL(type) \
222 if (_##type##_fill != NULL) { \
223 union { \
224 double d; \
225 type body[96]; \
226 } s; \
227 \
228 int v = 32; \
229 for (int offset = -2; offset <= 2; offset++) { \
230 for (int i = 0; i < 96; i++) { \
231 s.body[i] = 1; \
232 } \
233 type* start = s.body + 8 + offset; \
234 for (int aligned = 0; aligned < 2; aligned++) { \
235 if (aligned) { \
236 if (((intptr_t)start) % HeapWordSize == 0) { \
237 ((void (*)(type*, int, int))StubRoutines::_arrayof_##type##_fill)(start, v, 80); \
238 } else { \
239 continue; \
240 } \
241 } else { \
242 ((void (*)(type*, int, int))StubRoutines::_##type##_fill)(start, v, 80); \
243 } \
244 for (int i = 0; i < 96; i++) { \
245 if (i < (8 + offset) || i >= (88 + offset)) { \
246 assert(s.body[i] == 1, "what?"); \
247 } else { \
248 assert(s.body[i] == 32, "what?"); \
249 } \
250 } \
251 } \
252 } \
253 } \
254
255 TEST_FILL(jbyte);
256 TEST_FILL(jshort);
257 TEST_FILL(jint);
258
259 #undef TEST_FILL
260
261 #define TEST_COPYRTN(type) \
262 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_##type##s_atomic), sizeof(type)); \
263 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::arrayof_conjoint_##type##s), (int)MAX2(sizeof(HeapWord), sizeof(type)))
264
265 // Make sure all the copy runtime routines properly handle zero count
266 TEST_COPYRTN(jbyte);
267 TEST_COPYRTN(jshort);
268 TEST_COPYRTN(jint);
269 TEST_COPYRTN(jlong);
270
271 #undef TEST_COPYRTN
272
273 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::conjoint_words), sizeof(HeapWord));
274 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words), sizeof(HeapWord));
275 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::disjoint_words_atomic), sizeof(HeapWord));
276 // Aligned to BytesPerLong
277 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_conjoint_words), sizeof(jlong));
278 test_arraycopy_func(CAST_FROM_FN_PTR(address, Copy::aligned_disjoint_words), sizeof(jlong));
279
280 #endif
281 }
282
283
284 void stubRoutines_init1() { StubRoutines::initialize1(); }
285 void stubRoutines_init2() { StubRoutines::initialize2(); }
286
287 //
288 // Default versions of arraycopy functions
289 //
290
291 static void gen_arraycopy_barrier_pre(oop* dest, size_t count) {
292 assert(count != 0, "count should be non-zero");
293 assert(count <= (size_t)max_intx, "count too large");
294 BarrierSet* bs = Universe::heap()->barrier_set();
295 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt");
296 bs->write_ref_array_pre(dest, (int)count);
297 }
298
299 static void gen_arraycopy_barrier(oop* dest, size_t count) {
300 assert(count != 0, "count should be non-zero");
301 BarrierSet* bs = Universe::heap()->barrier_set();
302 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
303 bs->write_ref_array((HeapWord*)dest, count);
304 }
305
306 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
307 #ifndef PRODUCT
308 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
309 #endif // !PRODUCT
310 Copy::conjoint_jbytes_atomic(src, dest, count);
311 JRT_END
312
313 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
314 #ifndef PRODUCT
315 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
316 #endif // !PRODUCT
317 Copy::conjoint_jshorts_atomic(src, dest, count);
318 JRT_END
319
320 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
321 #ifndef PRODUCT
322 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
323 #endif // !PRODUCT
324 Copy::conjoint_jints_atomic(src, dest, count);
325 JRT_END
326
327 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
328 #ifndef PRODUCT
329 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
330 #endif // !PRODUCT
331 Copy::conjoint_jlongs_atomic(src, dest, count);
332 JRT_END
333
334 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
335 #ifndef PRODUCT
336 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
337 #endif // !PRODUCT
338 assert(count != 0, "count should be non-zero");
339 gen_arraycopy_barrier_pre(dest, count);
340 Copy::conjoint_oops_atomic(src, dest, count);
341 gen_arraycopy_barrier(dest, count);
342 JRT_END
343
344 JRT_LEAF(void, StubRoutines::oop_copy_no_pre(oop* src, oop* dest, size_t count))
345 #ifndef PRODUCT
346 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
347 #endif // !PRODUCT
348 assert(count != 0, "count should be non-zero");
349 Copy::conjoint_oops_atomic(src, dest, count);
350 gen_arraycopy_barrier(dest, count);
351 JRT_END
352
353 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
354 #ifndef PRODUCT
355 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
356 #endif // !PRODUCT
357 Copy::arrayof_conjoint_jbytes(src, dest, count);
358 JRT_END
359
360 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
361 #ifndef PRODUCT
362 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
363 #endif // !PRODUCT
364 Copy::arrayof_conjoint_jshorts(src, dest, count);
365 JRT_END
366
367 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
368 #ifndef PRODUCT
369 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
370 #endif // !PRODUCT
371 Copy::arrayof_conjoint_jints(src, dest, count);
372 JRT_END
373
374 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
375 #ifndef PRODUCT
376 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
377 #endif // !PRODUCT
378 Copy::arrayof_conjoint_jlongs(src, dest, count);
379 JRT_END
380
381 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
382 #ifndef PRODUCT
383 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
384 #endif // !PRODUCT
385 assert(count != 0, "count should be non-zero");
386 gen_arraycopy_barrier_pre((oop *) dest, count);
387 Copy::arrayof_conjoint_oops(src, dest, count);
388 gen_arraycopy_barrier((oop *) dest, count);
389 JRT_END
390
391 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_no_pre(HeapWord* src, HeapWord* dest, size_t count))
392 #ifndef PRODUCT
393 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
394 #endif // !PRODUCT
395 assert(count != 0, "count should be non-zero");
396 Copy::arrayof_conjoint_oops(src, dest, count);
397 gen_arraycopy_barrier((oop *) dest, count);
398 JRT_END
399
400 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
401 #define RETURN_STUB(xxx_fill) { \
402 name = #xxx_fill; \
403 return StubRoutines::xxx_fill(); }
404
405 switch (t) {
406 case T_BYTE:
407 case T_BOOLEAN:
408 if (!aligned) RETURN_STUB(jbyte_fill);
409 RETURN_STUB(arrayof_jbyte_fill);
410 case T_CHAR:
411 case T_SHORT:
412 if (!aligned) RETURN_STUB(jshort_fill);
413 RETURN_STUB(arrayof_jshort_fill);
414 case T_INT:
415 case T_FLOAT:
416 if (!aligned) RETURN_STUB(jint_fill);
417 RETURN_STUB(arrayof_jint_fill);
418 case T_DOUBLE:
419 case T_LONG:
420 case T_ARRAY:
421 case T_OBJECT:
422 case T_NARROWOOP:
423 case T_ADDRESS:
424 // Currently unsupported
425 return NULL;
426
427 default:
428 ShouldNotReachHere();
429 return NULL;
430 }
431
432 #undef RETURN_STUB
433 }