Mercurial > hg > graal-compiler
comparison src/share/vm/runtime/stubRoutines.cpp @ 0:a61af66fc99e jdk7-b24
Initial load
author | duke |
---|---|
date | Sat, 01 Dec 2007 00:00:00 +0000 |
parents | |
children | f8236e79048a |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 0:a61af66fc99e |
---|---|
1 /* | |
2 * Copyright 1997-2007 Sun Microsystems, Inc. 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 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; | |
43 address StubRoutines::_throw_ArithmeticException_entry = NULL; | |
44 address StubRoutines::_throw_NullPointerException_entry = NULL; | |
45 address StubRoutines::_throw_NullPointerException_at_call_entry = NULL; | |
46 address StubRoutines::_throw_StackOverflowError_entry = NULL; | |
47 address StubRoutines::_handler_for_unsafe_access_entry = NULL; | |
48 jint StubRoutines::_verify_oop_count = 0; | |
49 address StubRoutines::_verify_oop_subroutine_entry = NULL; | |
50 address StubRoutines::_atomic_xchg_entry = NULL; | |
51 address StubRoutines::_atomic_xchg_ptr_entry = NULL; | |
52 address StubRoutines::_atomic_store_entry = NULL; | |
53 address StubRoutines::_atomic_store_ptr_entry = NULL; | |
54 address StubRoutines::_atomic_cmpxchg_entry = NULL; | |
55 address StubRoutines::_atomic_cmpxchg_ptr_entry = NULL; | |
56 address StubRoutines::_atomic_cmpxchg_long_entry = NULL; | |
57 address StubRoutines::_atomic_add_entry = NULL; | |
58 address StubRoutines::_atomic_add_ptr_entry = NULL; | |
59 address StubRoutines::_fence_entry = NULL; | |
60 address StubRoutines::_d2i_wrapper = NULL; | |
61 address StubRoutines::_d2l_wrapper = NULL; | |
62 | |
63 jint StubRoutines::_fpu_cntrl_wrd_std = 0; | |
64 jint StubRoutines::_fpu_cntrl_wrd_24 = 0; | |
65 jint StubRoutines::_fpu_cntrl_wrd_64 = 0; | |
66 jint StubRoutines::_fpu_cntrl_wrd_trunc = 0; | |
67 jint StubRoutines::_mxcsr_std = 0; | |
68 jint StubRoutines::_fpu_subnormal_bias1[3] = { 0, 0, 0 }; | |
69 jint StubRoutines::_fpu_subnormal_bias2[3] = { 0, 0, 0 }; | |
70 | |
71 // Compiled code entry points default values | |
72 // The dafault functions don't have separate disjoint versions. | |
73 address StubRoutines::_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); | |
74 address StubRoutines::_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
75 address StubRoutines::_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
76 address StubRoutines::_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
77 address StubRoutines::_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
78 address StubRoutines::_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jbyte_copy); | |
79 address StubRoutines::_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jshort_copy); | |
80 address StubRoutines::_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jint_copy); | |
81 address StubRoutines::_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::jlong_copy); | |
82 address StubRoutines::_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::oop_copy); | |
83 | |
84 address StubRoutines::_arrayof_jbyte_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); | |
85 address StubRoutines::_arrayof_jshort_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
86 address StubRoutines::_arrayof_jint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
87 address StubRoutines::_arrayof_jlong_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
88 address StubRoutines::_arrayof_oop_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); | |
89 address StubRoutines::_arrayof_jbyte_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jbyte_copy); | |
90 address StubRoutines::_arrayof_jshort_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jshort_copy); | |
91 address StubRoutines::_arrayof_jint_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jint_copy); | |
92 address StubRoutines::_arrayof_jlong_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_jlong_copy); | |
93 address StubRoutines::_arrayof_oop_disjoint_arraycopy = CAST_FROM_FN_PTR(address, StubRoutines::arrayof_oop_copy); | |
94 | |
95 address StubRoutines::_checkcast_arraycopy = NULL; | |
96 address StubRoutines::_unsafe_arraycopy = NULL; | |
97 address StubRoutines::_generic_arraycopy = NULL; | |
98 | |
99 // Initialization | |
100 // | |
101 // Note: to break cycle with universe initialization, stubs are generated in two phases. | |
102 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry). | |
103 // The second phase includes all other stubs (which may depend on universe being initialized.) | |
104 | |
105 extern void StubGenerator_generate(CodeBuffer* code, bool all); // only interface to generators | |
106 | |
107 void StubRoutines::initialize1() { | |
108 if (_code1 == NULL) { | |
109 ResourceMark rm; | |
110 TraceTime timer("StubRoutines generation 1", TraceStartupTime); | |
111 _code1 = BufferBlob::create("StubRoutines (1)", code_size1); | |
112 if( _code1 == NULL) vm_exit_out_of_memory1(code_size1, "CodeCache: no room for %s", "StubRoutines (1)"); | |
113 CodeBuffer buffer(_code1->instructions_begin(), _code1->instructions_size()); | |
114 StubGenerator_generate(&buffer, false); | |
115 } | |
116 } | |
117 | |
118 | |
119 #ifdef ASSERT | |
120 typedef void (*arraycopy_fn)(address src, address dst, int count); | |
121 | |
122 // simple tests of generated arraycopy functions | |
123 static void test_arraycopy_func(address func, int alignment) { | |
124 int v = 0xcc; | |
125 int v2 = 0x11; | |
126 jlong lbuffer[2]; | |
127 jlong lbuffer2[2]; | |
128 address buffer = (address) lbuffer; | |
129 address buffer2 = (address) lbuffer2; | |
130 unsigned int i; | |
131 for (i = 0; i < sizeof(lbuffer); i++) { | |
132 buffer[i] = v; buffer2[i] = v2; | |
133 } | |
134 // do an aligned copy | |
135 ((arraycopy_fn)func)(buffer, buffer2, 0); | |
136 for (i = 0; i < sizeof(lbuffer); i++) { | |
137 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything"); | |
138 } | |
139 // adjust destination alignment | |
140 ((arraycopy_fn)func)(buffer, buffer2 + alignment, 0); | |
141 for (i = 0; i < sizeof(lbuffer); i++) { | |
142 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything"); | |
143 } | |
144 // adjust source alignment | |
145 ((arraycopy_fn)func)(buffer + alignment, buffer2, 0); | |
146 for (i = 0; i < sizeof(lbuffer); i++) { | |
147 assert(buffer[i] == v && buffer2[i] == v2, "shouldn't have copied anything"); | |
148 } | |
149 } | |
150 #endif | |
151 | |
152 | |
153 void StubRoutines::initialize2() { | |
154 if (_code2 == NULL) { | |
155 ResourceMark rm; | |
156 TraceTime timer("StubRoutines generation 2", TraceStartupTime); | |
157 _code2 = BufferBlob::create("StubRoutines (2)", code_size2); | |
158 if( _code2 == NULL) vm_exit_out_of_memory1(code_size2, "CodeCache: no room for %s", "StubRoutines (2)"); | |
159 CodeBuffer buffer(_code2->instructions_begin(), _code2->instructions_size()); | |
160 StubGenerator_generate(&buffer, true); | |
161 } | |
162 | |
163 #ifdef ASSERT | |
164 | |
165 #define TEST_ARRAYCOPY(type) \ | |
166 test_arraycopy_func( type##_arraycopy(), sizeof(type)); \ | |
167 test_arraycopy_func( type##_disjoint_arraycopy(), sizeof(type)); \ | |
168 test_arraycopy_func(arrayof_##type##_arraycopy(), sizeof(HeapWord)); \ | |
169 test_arraycopy_func(arrayof_##type##_disjoint_arraycopy(), sizeof(HeapWord)) | |
170 | |
171 // Make sure all the arraycopy stubs properly handle zeros | |
172 TEST_ARRAYCOPY(jbyte); | |
173 TEST_ARRAYCOPY(jshort); | |
174 TEST_ARRAYCOPY(jint); | |
175 TEST_ARRAYCOPY(jlong); | |
176 | |
177 #undef TEST_ARRAYCOPY | |
178 | |
179 #endif | |
180 } | |
181 | |
182 | |
183 void stubRoutines_init1() { StubRoutines::initialize1(); } | |
184 void stubRoutines_init2() { StubRoutines::initialize2(); } | |
185 | |
186 // | |
187 // Default versions of arraycopy functions | |
188 // | |
189 | |
190 static void gen_arraycopy_barrier(oop* dest, size_t count) { | |
191 assert(count != 0, "count should be non-zero"); | |
192 BarrierSet* bs = Universe::heap()->barrier_set(); | |
193 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); | |
194 bs->write_ref_array(MemRegion((HeapWord*)dest, (HeapWord*)(dest + count))); | |
195 } | |
196 | |
197 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count)) | |
198 #ifndef PRODUCT | |
199 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
200 #endif // !PRODUCT | |
201 assert(count != 0, "count should be non-zero"); | |
202 Copy::conjoint_bytes_atomic(src, dest, count); | |
203 JRT_END | |
204 | |
205 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count)) | |
206 #ifndef PRODUCT | |
207 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
208 #endif // !PRODUCT | |
209 assert(count != 0, "count should be non-zero"); | |
210 Copy::conjoint_jshorts_atomic(src, dest, count); | |
211 JRT_END | |
212 | |
213 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count)) | |
214 #ifndef PRODUCT | |
215 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
216 #endif // !PRODUCT | |
217 assert(count != 0, "count should be non-zero"); | |
218 Copy::conjoint_jints_atomic(src, dest, count); | |
219 JRT_END | |
220 | |
221 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count)) | |
222 #ifndef PRODUCT | |
223 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy | |
224 #endif // !PRODUCT | |
225 assert(count != 0, "count should be non-zero"); | |
226 Copy::conjoint_jlongs_atomic(src, dest, count); | |
227 JRT_END | |
228 | |
229 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count)) | |
230 #ifndef PRODUCT | |
231 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
232 #endif // !PRODUCT | |
233 assert(count != 0, "count should be non-zero"); | |
234 Copy::conjoint_oops_atomic(src, dest, count); | |
235 gen_arraycopy_barrier(dest, count); | |
236 JRT_END | |
237 | |
238 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
239 #ifndef PRODUCT | |
240 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy | |
241 #endif // !PRODUCT | |
242 assert(count != 0, "count should be non-zero"); | |
243 Copy::arrayof_conjoint_bytes(src, dest, count); | |
244 JRT_END | |
245 | |
246 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
247 #ifndef PRODUCT | |
248 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy | |
249 #endif // !PRODUCT | |
250 assert(count != 0, "count should be non-zero"); | |
251 Copy::arrayof_conjoint_jshorts(src, dest, count); | |
252 JRT_END | |
253 | |
254 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
255 #ifndef PRODUCT | |
256 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy | |
257 #endif // !PRODUCT | |
258 assert(count != 0, "count should be non-zero"); | |
259 Copy::arrayof_conjoint_jints(src, dest, count); | |
260 JRT_END | |
261 | |
262 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
263 #ifndef PRODUCT | |
264 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy | |
265 #endif // !PRODUCT | |
266 assert(count != 0, "count should be non-zero"); | |
267 Copy::arrayof_conjoint_jlongs(src, dest, count); | |
268 JRT_END | |
269 | |
270 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count)) | |
271 #ifndef PRODUCT | |
272 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy | |
273 #endif // !PRODUCT | |
274 assert(count != 0, "count should be non-zero"); | |
275 Copy::arrayof_conjoint_oops(src, dest, count); | |
276 gen_arraycopy_barrier((oop *) dest, count); | |
277 JRT_END |