Mercurial > hg > graal-jvmci-8
annotate src/share/vm/runtime/stubRoutines.cpp @ 1538:bfe29ec02863
6950075: nmethod sweeper should operate concurrently
Reviewed-by: never, kvn
Contributed-by: eric.caspole@amd.com
author | never |
---|---|
date | Mon, 17 May 2010 16:50:07 -0700 |
parents | f03d0a26bf83 |
children | c18cbe5936b8 |
rev | line source |
---|---|
0 | 1 /* |
1174
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
2 * Copyright 1997-2010 Sun Microsystems, Inc. All Rights Reserved. |
0 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any 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 | |
34 BufferBlob* StubRoutines::_code1 = NULL; | |
35 BufferBlob* StubRoutines::_code2 = NULL; | |
36 | |
37 address StubRoutines::_call_stub_return_address = NULL; | |
38 address StubRoutines::_call_stub_entry = NULL; | |
39 | |
40 address StubRoutines::_catch_exception_entry = NULL; | |
41 address StubRoutines::_forward_exception_entry = NULL; | |
42 address StubRoutines::_throw_AbstractMethodError_entry = NULL; | |
16
f8236e79048a
6664627: Merge changes made only in hotspot 11 forward to jdk 7
dcubed
parents:
0
diff
changeset
|
43 address StubRoutines::_throw_IncompatibleClassChangeError_entry = NULL; |
0 | 44 address StubRoutines::_throw_ArithmeticException_entry = NULL; |
45 address StubRoutines::_throw_NullPointerException_entry = NULL; | |
46 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL; | |
47 address StubRoutines::_throw_StackOverflowError_entry = NULL; | |
48 address StubRoutines::_handler_for_unsafe_access_entry = NULL; | |
49 jint StubRoutines::_verify_oop_count = 0; | |
50 address StubRoutines::_verify_oop_subroutine_entry = NULL; | |
51 address StubRoutines::_atomic_xchg_entry = NULL; | |
52 address StubRoutines::_atomic_xchg_ptr_entry = NULL; | |
53 address StubRoutines::_atomic_store_entry = NULL; | |
54 address StubRoutines::_atomic_store_ptr_entry = NULL; | |
55 address StubRoutines::_atomic_cmpxchg_entry = NULL; | |
56 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; | |
57 address StubRoutines::_atomic_cmpxchg_long_entry = NULL; | |
58 address StubRoutines::_atomic_add_entry = NULL; | |
59 address StubRoutines::_atomic_add_ptr_entry = NULL; | |
60 address StubRoutines::_fence_entry = NULL; | |
61 address StubRoutines::_d2i_wrapper = NULL; | |
62 address StubRoutines::_d2l_wrapper = NULL; | |
63 | |
64 jint StubRoutines::_fpu_cntrl_wrd_std = 0; | |
65 jint StubRoutines::_fpu_cntrl_wrd_24 = 0; | |
66 jint StubRoutines::_fpu_cntrl_wrd_64 = 0; | |
67 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0; | |
68 jint StubRoutines::_mxcsr_std = 0; | |
69 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; | |
70 jint 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. | |
74 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); | |
75 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
76 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
77 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
78 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
79 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); | |
80 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
81 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
82 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
83 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
84 | |
85 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); | |
86 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
87 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
88 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
89 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); | |
90 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); | |
91 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
92 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
93 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
94 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); | |
95 | |
96 address StubRoutines::_checkcast_arraycopy = NULL; | |
97 address StubRoutines::_unsafe_arraycopy = NULL; | |
98 address StubRoutines::_generic_arraycopy = NULL; | |
99 | |
1174
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
100 double (* StubRoutines::_intrinsic_log )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
101 double (* StubRoutines::_intrinsic_log10 )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
102 double (* StubRoutines::_intrinsic_exp )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
103 double (* StubRoutines::_intrinsic_pow )(double, double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
104 double (* StubRoutines::_intrinsic_sin )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
105 double (* StubRoutines::_intrinsic_cos )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
106 double (* StubRoutines::_intrinsic_tan )(double) = NULL; |
ddb7834449d0
6849984: Value methods for platform dependent math functions constant fold incorrectly
never
parents:
16
diff
changeset
|
107 |
0 | 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 | |
114 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators | |
115 | |
116 void StubRoutines::initialize1() { | |
117 if (_code1 == NULL) { | |
118 ResourceMark rm; | |
119 TraceTime timer("StubRoutines generation 1", TraceStartupTime); | |
120 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
121 if (_code1 == NULL) { |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
122 vm_exit_out_of_memory(code_size1, |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
123 "CodeCache: no room for StubRoutines (1)"); |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
124 } |
0 | 125 CodeBuffer buffer(_code1->instructions_begin(), _code1->instructions_size()); |
126 StubGenerator_generate(&buffer, false); | |
127 } | |
128 } | |
129 | |
130 | |
131 #ifdef ASSERT | |
132 typedef void (*arraycopy_fn)(address src, address dst, int count); | |
133 | |
134 // simple tests of generated arraycopy functions | |
135 static 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 | |
165 void StubRoutines::initialize2() { | |
166 if (_code2 == NULL) { | |
167 ResourceMark rm; | |
168 TraceTime timer("StubRoutines generation 2", TraceStartupTime); | |
169 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); | |
1490
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
170 if (_code2 == NULL) { |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
171 vm_exit_out_of_memory(code_size2, |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
172 "CodeCache: no room for StubRoutines (2)"); |
f03d0a26bf83
6888954: argument formatting for assert() and friends
jcoomes
parents:
1245
diff
changeset
|
173 } |
0 | 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 | |
198 void stubRoutines_init1() { StubRoutines::initialize1(); } | |
199 void stubRoutines_init2() { StubRoutines::initialize2(); } | |
200 | |
201 // | |
202 // Default versions of arraycopy functions | |
203 // | |
204 | |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
205 static void gen_arraycopy_barrier_pre(oop* dest, size_t count) { |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
206 assert(count != 0, "count should be non-zero"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
207 assert(count <= (size_t)max_intx, "count too large"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
208 BarrierSet* bs = Universe::heap()->barrier_set(); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
209 assert(bs->has_write_ref_array_pre_opt(), "Must have pre-barrier opt"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
210 bs->write_ref_array_pre(dest, (int)count); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
211 } |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
212 |
0 | 213 static 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"); | |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
217 bs->write_ref_array((HeapWord*)dest, count); |
0 | 218 } |
219 | |
220 JRT_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); | |
226 JRT_END | |
227 | |
228 JRT_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); | |
234 JRT_END | |
235 | |
236 JRT_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); | |
242 JRT_END | |
243 | |
244 JRT_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); | |
250 JRT_END | |
251 | |
252 JRT_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"); | |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
257 gen_arraycopy_barrier_pre(dest, count); |
0 | 258 Copy::conjoint_oops_atomic(src, dest, count); |
259 gen_arraycopy_barrier(dest, count); | |
260 JRT_END | |
261 | |
262 JRT_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); | |
268 JRT_END | |
269 | |
270 JRT_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); | |
276 JRT_END | |
277 | |
278 JRT_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); | |
284 JRT_END | |
285 | |
286 JRT_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); | |
292 JRT_END | |
293 | |
294 JRT_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"); | |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1174
diff
changeset
|
299 gen_arraycopy_barrier_pre((oop *) dest, count); |
0 | 300 Copy::arrayof_conjoint_oops(src, dest, count); |
301 gen_arraycopy_barrier((oop *) dest, count); | |
302 JRT_END |