Mercurial > hg > graal-compiler
annotate src/share/vm/c1/c1_Runtime1.cpp @ 4825:20334ed5ed3c
7131259: compile_method and CompilationPolicy::event shouldn't be declared TRAPS
Summary: Make sure that CompilationPolicy::event() doesn't throw exceptions
Reviewed-by: kvn, never
author | iveresov |
---|---|
date | Thu, 26 Jan 2012 12:15:24 -0800 |
parents | cec1757a0134 |
children | aa3d708d67c4 |
rev | line source |
---|---|
0 | 1 /* |
2142 | 2 * Copyright (c) 1999, 2011, Oracle and/or its affiliates. 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1247
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1247
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1247
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "asm/codeBuffer.hpp" | |
27 #include "c1/c1_CodeStubs.hpp" | |
28 #include "c1/c1_Defs.hpp" | |
29 #include "c1/c1_FrameMap.hpp" | |
30 #include "c1/c1_LIRAssembler.hpp" | |
31 #include "c1/c1_MacroAssembler.hpp" | |
32 #include "c1/c1_Runtime1.hpp" | |
33 #include "classfile/systemDictionary.hpp" | |
34 #include "classfile/vmSymbols.hpp" | |
35 #include "code/codeBlob.hpp" | |
36 #include "code/compiledIC.hpp" | |
37 #include "code/pcDesc.hpp" | |
38 #include "code/scopeDesc.hpp" | |
39 #include "code/vtableStubs.hpp" | |
40 #include "compiler/disassembler.hpp" | |
41 #include "gc_interface/collectedHeap.hpp" | |
42 #include "interpreter/bytecode.hpp" | |
43 #include "interpreter/interpreter.hpp" | |
44 #include "memory/allocation.inline.hpp" | |
45 #include "memory/barrierSet.hpp" | |
46 #include "memory/oopFactory.hpp" | |
47 #include "memory/resourceArea.hpp" | |
48 #include "oops/objArrayKlass.hpp" | |
49 #include "oops/oop.inline.hpp" | |
50 #include "runtime/biasedLocking.hpp" | |
51 #include "runtime/compilationPolicy.hpp" | |
52 #include "runtime/interfaceSupport.hpp" | |
53 #include "runtime/javaCalls.hpp" | |
54 #include "runtime/sharedRuntime.hpp" | |
55 #include "runtime/threadCritical.hpp" | |
56 #include "runtime/vframe.hpp" | |
57 #include "runtime/vframeArray.hpp" | |
58 #include "utilities/copy.hpp" | |
59 #include "utilities/events.hpp" | |
0 | 60 |
61 | |
62 // Implementation of StubAssembler | |
63 | |
64 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) { | |
65 _name = name; | |
66 _must_gc_arguments = false; | |
67 _frame_size = no_frame_size; | |
68 _num_rt_args = 0; | |
69 _stub_id = stub_id; | |
70 } | |
71 | |
72 | |
73 void StubAssembler::set_info(const char* name, bool must_gc_arguments) { | |
74 _name = name; | |
75 _must_gc_arguments = must_gc_arguments; | |
76 } | |
77 | |
78 | |
79 void StubAssembler::set_frame_size(int size) { | |
80 if (_frame_size == no_frame_size) { | |
81 _frame_size = size; | |
82 } | |
83 assert(_frame_size == size, "can't change the frame size"); | |
84 } | |
85 | |
86 | |
87 void StubAssembler::set_num_rt_args(int args) { | |
88 if (_num_rt_args == 0) { | |
89 _num_rt_args = args; | |
90 } | |
91 assert(_num_rt_args == args, "can't change the number of args"); | |
92 } | |
93 | |
94 // Implementation of Runtime1 | |
95 | |
96 CodeBlob* Runtime1::_blobs[Runtime1::number_of_ids]; | |
97 const char *Runtime1::_blob_names[] = { | |
98 RUNTIME1_STUBS(STUB_NAME, LAST_STUB_NAME) | |
99 }; | |
100 | |
101 #ifndef PRODUCT | |
102 // statistics | |
103 int Runtime1::_generic_arraycopy_cnt = 0; | |
104 int Runtime1::_primitive_arraycopy_cnt = 0; | |
105 int Runtime1::_oop_arraycopy_cnt = 0; | |
2446 | 106 int Runtime1::_generic_arraycopystub_cnt = 0; |
0 | 107 int Runtime1::_arraycopy_slowcase_cnt = 0; |
2446 | 108 int Runtime1::_arraycopy_checkcast_cnt = 0; |
109 int Runtime1::_arraycopy_checkcast_attempt_cnt = 0; | |
0 | 110 int Runtime1::_new_type_array_slowcase_cnt = 0; |
111 int Runtime1::_new_object_array_slowcase_cnt = 0; | |
112 int Runtime1::_new_instance_slowcase_cnt = 0; | |
113 int Runtime1::_new_multi_array_slowcase_cnt = 0; | |
114 int Runtime1::_monitorenter_slowcase_cnt = 0; | |
115 int Runtime1::_monitorexit_slowcase_cnt = 0; | |
116 int Runtime1::_patch_code_slowcase_cnt = 0; | |
117 int Runtime1::_throw_range_check_exception_count = 0; | |
118 int Runtime1::_throw_index_exception_count = 0; | |
119 int Runtime1::_throw_div0_exception_count = 0; | |
120 int Runtime1::_throw_null_pointer_exception_count = 0; | |
121 int Runtime1::_throw_class_cast_exception_count = 0; | |
122 int Runtime1::_throw_incompatible_class_change_error_count = 0; | |
123 int Runtime1::_throw_array_store_exception_count = 0; | |
124 int Runtime1::_throw_count = 0; | |
2446 | 125 |
126 static int _byte_arraycopy_cnt = 0; | |
127 static int _short_arraycopy_cnt = 0; | |
128 static int _int_arraycopy_cnt = 0; | |
129 static int _long_arraycopy_cnt = 0; | |
130 static int _oop_arraycopy_cnt = 0; | |
131 | |
132 address Runtime1::arraycopy_count_address(BasicType type) { | |
133 switch (type) { | |
134 case T_BOOLEAN: | |
135 case T_BYTE: return (address)&_byte_arraycopy_cnt; | |
136 case T_CHAR: | |
137 case T_SHORT: return (address)&_short_arraycopy_cnt; | |
138 case T_FLOAT: | |
139 case T_INT: return (address)&_int_arraycopy_cnt; | |
140 case T_DOUBLE: | |
141 case T_LONG: return (address)&_long_arraycopy_cnt; | |
142 case T_ARRAY: | |
143 case T_OBJECT: return (address)&_oop_arraycopy_cnt; | |
144 default: | |
145 ShouldNotReachHere(); | |
146 return NULL; | |
147 } | |
148 } | |
149 | |
150 | |
0 | 151 #endif |
152 | |
153 // Simple helper to see if the caller of a runtime stub which | |
154 // entered the VM has been deoptimized | |
155 | |
156 static bool caller_is_deopted() { | |
157 JavaThread* thread = JavaThread::current(); | |
158 RegisterMap reg_map(thread, false); | |
159 frame runtime_frame = thread->last_frame(); | |
160 frame caller_frame = runtime_frame.sender(®_map); | |
161 assert(caller_frame.is_compiled_frame(), "must be compiled"); | |
162 return caller_frame.is_deoptimized_frame(); | |
163 } | |
164 | |
165 // Stress deoptimization | |
166 static void deopt_caller() { | |
167 if ( !caller_is_deopted()) { | |
168 JavaThread* thread = JavaThread::current(); | |
169 RegisterMap reg_map(thread, false); | |
170 frame runtime_frame = thread->last_frame(); | |
171 frame caller_frame = runtime_frame.sender(®_map); | |
1213
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1142
diff
changeset
|
172 Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
0 | 173 assert(caller_is_deopted(), "Must be deoptimized"); |
174 } | |
175 } | |
176 | |
177 | |
1584 | 178 void Runtime1::generate_blob_for(BufferBlob* buffer_blob, StubID id) { |
0 | 179 assert(0 <= id && id < number_of_ids, "illegal stub id"); |
180 ResourceMark rm; | |
181 // create code buffer for code storage | |
1748 | 182 CodeBuffer code(buffer_blob); |
0 | 183 |
1584 | 184 Compilation::setup_code_buffer(&code, 0); |
0 | 185 |
186 // create assembler for code generation | |
187 StubAssembler* sasm = new StubAssembler(&code, name_for(id), id); | |
188 // generate code for runtime stub | |
189 OopMapSet* oop_maps; | |
190 oop_maps = generate_code_for(id, sasm); | |
191 assert(oop_maps == NULL || sasm->frame_size() != no_frame_size, | |
192 "if stub has an oop map it must have a valid frame size"); | |
193 | |
194 #ifdef ASSERT | |
195 // Make sure that stubs that need oopmaps have them | |
196 switch (id) { | |
197 // These stubs don't need to have an oopmap | |
198 case dtrace_object_alloc_id: | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
199 case g1_pre_barrier_slow_id: |
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
200 case g1_post_barrier_slow_id: |
0 | 201 case slow_subtype_check_id: |
202 case fpu2long_stub_id: | |
203 case unwind_exception_id: | |
1783 | 204 case counter_overflow_id: |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
205 #if defined(SPARC) || defined(PPC) |
0 | 206 case handle_exception_nofpu_id: // Unused on sparc |
207 #endif | |
208 break; | |
209 | |
210 // All other stubs should have oopmaps | |
211 default: | |
212 assert(oop_maps != NULL, "must have an oopmap"); | |
213 } | |
214 #endif | |
215 | |
216 // align so printing shows nop's instead of random code at the end (SimpleStubs are aligned) | |
217 sasm->align(BytesPerWord); | |
218 // make sure all code is in code buffer | |
219 sasm->flush(); | |
220 // create blob - distinguish a few special cases | |
221 CodeBlob* blob = RuntimeStub::new_runtime_stub(name_for(id), | |
222 &code, | |
223 CodeOffsets::frame_never_safe, | |
224 sasm->frame_size(), | |
225 oop_maps, | |
226 sasm->must_gc_arguments()); | |
227 // install blob | |
228 assert(blob != NULL, "blob must exist"); | |
229 _blobs[id] = blob; | |
230 } | |
231 | |
232 | |
1584 | 233 void Runtime1::initialize(BufferBlob* blob) { |
234 // platform-dependent initialization | |
235 initialize_pd(); | |
236 // generate stubs | |
237 for (int id = 0; id < number_of_ids; id++) generate_blob_for(blob, (StubID)id); | |
238 // printing | |
0 | 239 #ifndef PRODUCT |
1584 | 240 if (PrintSimpleStubs) { |
241 ResourceMark rm; | |
242 for (int id = 0; id < number_of_ids; id++) { | |
243 _blobs[id]->print(); | |
244 if (_blobs[id]->oop_maps() != NULL) { | |
245 _blobs[id]->oop_maps()->print(); | |
0 | 246 } |
247 } | |
1584 | 248 } |
0 | 249 #endif |
250 } | |
251 | |
252 | |
253 CodeBlob* Runtime1::blob_for(StubID id) { | |
254 assert(0 <= id && id < number_of_ids, "illegal stub id"); | |
255 return _blobs[id]; | |
256 } | |
257 | |
258 | |
259 const char* Runtime1::name_for(StubID id) { | |
260 assert(0 <= id && id < number_of_ids, "illegal stub id"); | |
261 return _blob_names[id]; | |
262 } | |
263 | |
264 const char* Runtime1::name_for_address(address entry) { | |
265 for (int id = 0; id < number_of_ids; id++) { | |
266 if (entry == entry_for((StubID)id)) return name_for((StubID)id); | |
267 } | |
268 | |
269 #define FUNCTION_CASE(a, f) \ | |
270 if ((intptr_t)a == CAST_FROM_FN_PTR(intptr_t, f)) return #f | |
271 | |
272 FUNCTION_CASE(entry, os::javaTimeMillis); | |
273 FUNCTION_CASE(entry, os::javaTimeNanos); | |
274 FUNCTION_CASE(entry, SharedRuntime::OSR_migration_end); | |
275 FUNCTION_CASE(entry, SharedRuntime::d2f); | |
276 FUNCTION_CASE(entry, SharedRuntime::d2i); | |
277 FUNCTION_CASE(entry, SharedRuntime::d2l); | |
278 FUNCTION_CASE(entry, SharedRuntime::dcos); | |
279 FUNCTION_CASE(entry, SharedRuntime::dexp); | |
280 FUNCTION_CASE(entry, SharedRuntime::dlog); | |
281 FUNCTION_CASE(entry, SharedRuntime::dlog10); | |
282 FUNCTION_CASE(entry, SharedRuntime::dpow); | |
283 FUNCTION_CASE(entry, SharedRuntime::drem); | |
284 FUNCTION_CASE(entry, SharedRuntime::dsin); | |
285 FUNCTION_CASE(entry, SharedRuntime::dtan); | |
286 FUNCTION_CASE(entry, SharedRuntime::f2i); | |
287 FUNCTION_CASE(entry, SharedRuntime::f2l); | |
288 FUNCTION_CASE(entry, SharedRuntime::frem); | |
289 FUNCTION_CASE(entry, SharedRuntime::l2d); | |
290 FUNCTION_CASE(entry, SharedRuntime::l2f); | |
291 FUNCTION_CASE(entry, SharedRuntime::ldiv); | |
292 FUNCTION_CASE(entry, SharedRuntime::lmul); | |
293 FUNCTION_CASE(entry, SharedRuntime::lrem); | |
294 FUNCTION_CASE(entry, SharedRuntime::lrem); | |
295 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_entry); | |
296 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_exit); | |
297 FUNCTION_CASE(entry, trace_block_entry); | |
298 | |
299 #undef FUNCTION_CASE | |
300 | |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
301 // Soft float adds more runtime names. |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
302 return pd_name_for_address(entry); |
0 | 303 } |
304 | |
305 | |
306 JRT_ENTRY(void, Runtime1::new_instance(JavaThread* thread, klassOopDesc* klass)) | |
307 NOT_PRODUCT(_new_instance_slowcase_cnt++;) | |
308 | |
309 assert(oop(klass)->is_klass(), "not a class"); | |
310 instanceKlassHandle h(thread, klass); | |
311 h->check_valid_for_instantiation(true, CHECK); | |
312 // make sure klass is initialized | |
313 h->initialize(CHECK); | |
314 // allocate instance and return via TLS | |
315 oop obj = h->allocate_instance(CHECK); | |
316 thread->set_vm_result(obj); | |
317 JRT_END | |
318 | |
319 | |
320 JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* thread, klassOopDesc* klass, jint length)) | |
321 NOT_PRODUCT(_new_type_array_slowcase_cnt++;) | |
322 // Note: no handle for klass needed since they are not used | |
323 // anymore after new_typeArray() and no GC can happen before. | |
324 // (This may have to change if this code changes!) | |
325 assert(oop(klass)->is_klass(), "not a class"); | |
326 BasicType elt_type = typeArrayKlass::cast(klass)->element_type(); | |
327 oop obj = oopFactory::new_typeArray(elt_type, length, CHECK); | |
328 thread->set_vm_result(obj); | |
329 // This is pretty rare but this runtime patch is stressful to deoptimization | |
330 // if we deoptimize here so force a deopt to stress the path. | |
331 if (DeoptimizeALot) { | |
332 deopt_caller(); | |
333 } | |
334 | |
335 JRT_END | |
336 | |
337 | |
338 JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* thread, klassOopDesc* array_klass, jint length)) | |
339 NOT_PRODUCT(_new_object_array_slowcase_cnt++;) | |
340 | |
341 // Note: no handle for klass needed since they are not used | |
342 // anymore after new_objArray() and no GC can happen before. | |
343 // (This may have to change if this code changes!) | |
344 assert(oop(array_klass)->is_klass(), "not a class"); | |
345 klassOop elem_klass = objArrayKlass::cast(array_klass)->element_klass(); | |
346 objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK); | |
347 thread->set_vm_result(obj); | |
348 // This is pretty rare but this runtime patch is stressful to deoptimization | |
349 // if we deoptimize here so force a deopt to stress the path. | |
350 if (DeoptimizeALot) { | |
351 deopt_caller(); | |
352 } | |
353 JRT_END | |
354 | |
355 | |
356 JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* thread, klassOopDesc* klass, int rank, jint* dims)) | |
357 NOT_PRODUCT(_new_multi_array_slowcase_cnt++;) | |
358 | |
359 assert(oop(klass)->is_klass(), "not a class"); | |
360 assert(rank >= 1, "rank must be nonzero"); | |
361 oop obj = arrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK); | |
362 thread->set_vm_result(obj); | |
363 JRT_END | |
364 | |
365 | |
366 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* thread, StubID id)) | |
367 tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", id); | |
368 JRT_END | |
369 | |
370 | |
2168
e4fee0bdaa85
7008809: should report the class in ArrayStoreExceptions from compiled code
never
parents:
2142
diff
changeset
|
371 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* thread, oopDesc* obj)) |
e4fee0bdaa85
7008809: should report the class in ArrayStoreExceptions from compiled code
never
parents:
2142
diff
changeset
|
372 ResourceMark rm(thread); |
e4fee0bdaa85
7008809: should report the class in ArrayStoreExceptions from compiled code
never
parents:
2142
diff
changeset
|
373 const char* klass_name = Klass::cast(obj->klass())->external_name(); |
e4fee0bdaa85
7008809: should report the class in ArrayStoreExceptions from compiled code
never
parents:
2142
diff
changeset
|
374 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayStoreException(), klass_name); |
0 | 375 JRT_END |
376 | |
377 | |
3791
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3269
diff
changeset
|
378 // counter_overflow() is called from within C1-compiled methods. The enclosing method is the method |
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3269
diff
changeset
|
379 // associated with the top activation record. The inlinee (that is possibly included in the enclosing |
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3269
diff
changeset
|
380 // method) method oop is passed as an argument. In order to do that it is embedded in the code as |
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3269
diff
changeset
|
381 // a constant. |
1783 | 382 static nmethod* counter_overflow_helper(JavaThread* THREAD, int branch_bci, methodOopDesc* m) { |
383 nmethod* osr_nm = NULL; | |
384 methodHandle method(THREAD, m); | |
385 | |
386 RegisterMap map(THREAD, false); | |
387 frame fr = THREAD->last_frame().sender(&map); | |
0 | 388 nmethod* nm = (nmethod*) fr.cb(); |
1783 | 389 assert(nm!= NULL && nm->is_nmethod(), "Sanity check"); |
390 methodHandle enclosing_method(THREAD, nm->method()); | |
391 | |
392 CompLevel level = (CompLevel)nm->comp_level(); | |
393 int bci = InvocationEntryBci; | |
394 if (branch_bci != InvocationEntryBci) { | |
395 // Compute desination bci | |
396 address pc = method()->code_base() + branch_bci; | |
2142 | 397 Bytecodes::Code branch = Bytecodes::code_at(method(), pc); |
1783 | 398 int offset = 0; |
399 switch (branch) { | |
400 case Bytecodes::_if_icmplt: case Bytecodes::_iflt: | |
401 case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt: | |
402 case Bytecodes::_if_icmple: case Bytecodes::_ifle: | |
403 case Bytecodes::_if_icmpge: case Bytecodes::_ifge: | |
404 case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq: | |
405 case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne: | |
406 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto: | |
407 offset = (int16_t)Bytes::get_Java_u2(pc + 1); | |
408 break; | |
409 case Bytecodes::_goto_w: | |
410 offset = Bytes::get_Java_u4(pc + 1); | |
411 break; | |
412 default: ; | |
0 | 413 } |
1783 | 414 bci = branch_bci + offset; |
415 } | |
4825
20334ed5ed3c
7131259: compile_method and CompilationPolicy::event shouldn't be declared TRAPS
iveresov
parents:
4048
diff
changeset
|
416 assert(!HAS_PENDING_EXCEPTION, "Should not have any exceptions pending"); |
3791
2c359f27615c
7057120: Tiered: Allow C1 to inline methods with loops
iveresov
parents:
3269
diff
changeset
|
417 osr_nm = CompilationPolicy::policy()->event(enclosing_method, method, branch_bci, bci, level, nm, THREAD); |
4825
20334ed5ed3c
7131259: compile_method and CompilationPolicy::event shouldn't be declared TRAPS
iveresov
parents:
4048
diff
changeset
|
418 assert(!HAS_PENDING_EXCEPTION, "Event handler should not throw any exceptions"); |
1783 | 419 return osr_nm; |
420 } | |
421 | |
422 JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* thread, int bci, methodOopDesc* method)) | |
423 nmethod* osr_nm; | |
424 JRT_BLOCK | |
425 osr_nm = counter_overflow_helper(thread, bci, method); | |
426 if (osr_nm != NULL) { | |
427 RegisterMap map(thread, false); | |
428 frame fr = thread->last_frame().sender(&map); | |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1783
diff
changeset
|
429 Deoptimization::deoptimize_frame(thread, fr.id()); |
0 | 430 } |
1783 | 431 JRT_BLOCK_END |
432 return NULL; | |
0 | 433 JRT_END |
434 | |
435 extern void vm_exit(int code); | |
436 | |
437 // Enter this method from compiled code handler below. This is where we transition | |
438 // to VM mode. This is done as a helper routine so that the method called directly | |
439 // from compiled code does not have to transition to VM. This allows the entry | |
440 // method to see if the nmethod that we have just looked up a handler for has | |
441 // been deoptimized while we were in the vm. This simplifies the assembly code | |
442 // cpu directories. | |
443 // | |
444 // We are entering here from exception stub (via the entry method below) | |
445 // If there is a compiled exception handler in this method, we will continue there; | |
446 // otherwise we will unwind the stack and continue at the caller of top frame method | |
447 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to | |
448 // control the area where we can allow a safepoint. After we exit the safepoint area we can | |
449 // check to see if the handler we are going to return is now in a nmethod that has | |
450 // been deoptimized. If that is the case we return the deopt blob | |
451 // unpack_with_exception entry instead. This makes life for the exception blob easier | |
452 // because making that same check and diverting is painful from assembly language. | |
453 JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* thread, oopDesc* ex, address pc, nmethod*& nm)) | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
454 // Reset method handle flag. |
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
455 thread->set_is_method_handle_return(false); |
0 | 456 |
457 Handle exception(thread, ex); | |
458 nm = CodeCache::find_nmethod(pc); | |
459 assert(nm != NULL, "this is not an nmethod"); | |
460 // Adjust the pc as needed/ | |
461 if (nm->is_deopt_pc(pc)) { | |
462 RegisterMap map(thread, false); | |
463 frame exception_frame = thread->last_frame().sender(&map); | |
464 // if the frame isn't deopted then pc must not correspond to the caller of last_frame | |
465 assert(exception_frame.is_deoptimized_frame(), "must be deopted"); | |
466 pc = exception_frame.pc(); | |
467 } | |
468 #ifdef ASSERT | |
469 assert(exception.not_null(), "NULL exceptions should be handled by throw_exception"); | |
470 assert(exception->is_oop(), "just checking"); | |
471 // Check that exception is a subclass of Throwable, otherwise we have a VerifyError | |
1142 | 472 if (!(exception->is_a(SystemDictionary::Throwable_klass()))) { |
0 | 473 if (ExitVMOnVerifyError) vm_exit(-1); |
474 ShouldNotReachHere(); | |
475 } | |
476 #endif | |
477 | |
478 // Check the stack guard pages and reenable them if necessary and there is | |
479 // enough space on the stack to do so. Use fast exceptions only if the guard | |
480 // pages are enabled. | |
481 bool guard_pages_enabled = thread->stack_yellow_zone_enabled(); | |
482 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack(); | |
483 | |
1213
6deeaebad47a
6902182: 4/4 Starting with jdwp agent should not incur performance penalty
dcubed
parents:
1142
diff
changeset
|
484 if (JvmtiExport::can_post_on_exceptions()) { |
0 | 485 // To ensure correct notification of exception catches and throws |
486 // we have to deoptimize here. If we attempted to notify the | |
487 // catches and throws during this exception lookup it's possible | |
488 // we could deoptimize on the way out of the VM and end back in | |
489 // the interpreter at the throw site. This would result in double | |
490 // notifications since the interpreter would also notify about | |
491 // these same catches and throws as it unwound the frame. | |
492 | |
493 RegisterMap reg_map(thread); | |
494 frame stub_frame = thread->last_frame(); | |
495 frame caller_frame = stub_frame.sender(®_map); | |
496 | |
497 // We don't really want to deoptimize the nmethod itself since we | |
498 // can actually continue in the exception handler ourselves but I | |
499 // don't see an easy way to have the desired effect. | |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1783
diff
changeset
|
500 Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1783
diff
changeset
|
501 assert(caller_is_deopted(), "Must be deoptimized"); |
0 | 502 |
503 return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); | |
504 } | |
505 | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
506 // ExceptionCache is used only for exceptions at call sites and not for implicit exceptions |
0 | 507 if (guard_pages_enabled) { |
508 address fast_continuation = nm->handler_for_exception_and_pc(exception, pc); | |
509 if (fast_continuation != NULL) { | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
510 // Set flag if return address is a method handle call site. |
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
511 thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); |
0 | 512 return fast_continuation; |
513 } | |
514 } | |
515 | |
516 // If the stack guard pages are enabled, check whether there is a handler in | |
517 // the current method. Otherwise (guard pages disabled), force an unwind and | |
518 // skip the exception cache update (i.e., just leave continuation==NULL). | |
519 address continuation = NULL; | |
520 if (guard_pages_enabled) { | |
521 | |
522 // New exception handling mechanism can support inlined methods | |
523 // with exception handlers since the mappings are from PC to PC | |
524 | |
525 // debugging support | |
526 // tracing | |
527 if (TraceExceptions) { | |
528 ttyLocker ttyl; | |
529 ResourceMark rm; | |
530 tty->print_cr("Exception <%s> (0x%x) thrown in compiled method <%s> at PC " PTR_FORMAT " for thread 0x%x", | |
531 exception->print_value_string(), (address)exception(), nm->method()->print_value_string(), pc, thread); | |
532 } | |
533 // for AbortVMOnException flag | |
534 NOT_PRODUCT(Exceptions::debug_check_abort(exception)); | |
535 | |
536 // Clear out the exception oop and pc since looking up an | |
537 // exception handler can cause class loading, which might throw an | |
538 // exception and those fields are expected to be clear during | |
539 // normal bytecode execution. | |
540 thread->set_exception_oop(NULL); | |
541 thread->set_exception_pc(NULL); | |
542 | |
543 continuation = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, false, false); | |
544 // If an exception was thrown during exception dispatch, the exception oop may have changed | |
545 thread->set_exception_oop(exception()); | |
546 thread->set_exception_pc(pc); | |
547 | |
548 // the exception cache is used only by non-implicit exceptions | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
549 if (continuation != NULL) { |
0 | 550 nm->add_handler_for_exception_and_pc(exception, pc, continuation); |
551 } | |
552 } | |
553 | |
554 thread->set_vm_result(exception()); | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
555 // Set flag if return address is a method handle call site. |
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
556 thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); |
0 | 557 |
558 if (TraceExceptions) { | |
559 ttyLocker ttyl; | |
560 ResourceMark rm; | |
561 tty->print_cr("Thread " PTR_FORMAT " continuing at PC " PTR_FORMAT " for exception thrown at PC " PTR_FORMAT, | |
562 thread, continuation, pc); | |
563 } | |
564 | |
565 return continuation; | |
566 JRT_END | |
567 | |
568 // Enter this method from compiled code only if there is a Java exception handler | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
569 // in the method handling the exception. |
0 | 570 // We are entering here from exception stub. We don't do a normal VM transition here. |
571 // We do it in a helper. This is so we can check to see if the nmethod we have just | |
572 // searched for an exception handler has been deoptimized in the meantime. | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
573 address Runtime1::exception_handler_for_pc(JavaThread* thread) { |
0 | 574 oop exception = thread->exception_oop(); |
575 address pc = thread->exception_pc(); | |
576 // Still in Java mode | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
577 DEBUG_ONLY(ResetNoHandleMark rnhm); |
0 | 578 nmethod* nm = NULL; |
579 address continuation = NULL; | |
580 { | |
581 // Enter VM mode by calling the helper | |
582 ResetNoHandleMark rnhm; | |
583 continuation = exception_handler_for_pc_helper(thread, exception, pc, nm); | |
584 } | |
585 // Back in JAVA, use no oops DON'T safepoint | |
586 | |
587 // Now check to see if the nmethod we were called from is now deoptimized. | |
588 // If so we must return to the deopt blob and deoptimize the nmethod | |
589 if (nm != NULL && caller_is_deopted()) { | |
590 continuation = SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); | |
591 } | |
592 | |
2321
1b4e6a5d98e0
7012914: JSR 292 MethodHandlesTest C1: frame::verify_return_pc(return_address) failed: must be a return pc
twisti
parents:
2168
diff
changeset
|
593 assert(continuation != NULL, "no handler found"); |
0 | 594 return continuation; |
595 } | |
596 | |
597 | |
598 JRT_ENTRY(void, Runtime1::throw_range_check_exception(JavaThread* thread, int index)) | |
599 NOT_PRODUCT(_throw_range_check_exception_count++;) | |
600 Events::log("throw_range_check"); | |
601 char message[jintAsStringSize]; | |
602 sprintf(message, "%d", index); | |
603 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), message); | |
604 JRT_END | |
605 | |
606 | |
607 JRT_ENTRY(void, Runtime1::throw_index_exception(JavaThread* thread, int index)) | |
608 NOT_PRODUCT(_throw_index_exception_count++;) | |
609 Events::log("throw_index"); | |
610 char message[16]; | |
611 sprintf(message, "%d", index); | |
612 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IndexOutOfBoundsException(), message); | |
613 JRT_END | |
614 | |
615 | |
616 JRT_ENTRY(void, Runtime1::throw_div0_exception(JavaThread* thread)) | |
617 NOT_PRODUCT(_throw_div0_exception_count++;) | |
618 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero"); | |
619 JRT_END | |
620 | |
621 | |
622 JRT_ENTRY(void, Runtime1::throw_null_pointer_exception(JavaThread* thread)) | |
623 NOT_PRODUCT(_throw_null_pointer_exception_count++;) | |
624 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException()); | |
625 JRT_END | |
626 | |
627 | |
628 JRT_ENTRY(void, Runtime1::throw_class_cast_exception(JavaThread* thread, oopDesc* object)) | |
629 NOT_PRODUCT(_throw_class_cast_exception_count++;) | |
630 ResourceMark rm(thread); | |
631 char* message = SharedRuntime::generate_class_cast_message( | |
632 thread, Klass::cast(object->klass())->external_name()); | |
633 SharedRuntime::throw_and_post_jvmti_exception( | |
634 thread, vmSymbols::java_lang_ClassCastException(), message); | |
635 JRT_END | |
636 | |
637 | |
638 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* thread)) | |
639 NOT_PRODUCT(_throw_incompatible_class_change_error_count++;) | |
640 ResourceMark rm(thread); | |
641 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError()); | |
642 JRT_END | |
643 | |
644 | |
645 JRT_ENTRY_NO_ASYNC(void, Runtime1::monitorenter(JavaThread* thread, oopDesc* obj, BasicObjectLock* lock)) | |
646 NOT_PRODUCT(_monitorenter_slowcase_cnt++;) | |
647 if (PrintBiasedLockingStatistics) { | |
648 Atomic::inc(BiasedLocking::slow_path_entry_count_addr()); | |
649 } | |
650 Handle h_obj(thread, obj); | |
651 assert(h_obj()->is_oop(), "must be NULL or an object"); | |
652 if (UseBiasedLocking) { | |
653 // Retry fast entry if bias is revoked to avoid unnecessary inflation | |
654 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), true, CHECK); | |
655 } else { | |
656 if (UseFastLocking) { | |
657 // When using fast locking, the compiled code has already tried the fast case | |
658 assert(obj == lock->obj(), "must match"); | |
659 ObjectSynchronizer::slow_enter(h_obj, lock->lock(), THREAD); | |
660 } else { | |
661 lock->set_obj(obj); | |
662 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), false, THREAD); | |
663 } | |
664 } | |
665 JRT_END | |
666 | |
667 | |
668 JRT_LEAF(void, Runtime1::monitorexit(JavaThread* thread, BasicObjectLock* lock)) | |
669 NOT_PRODUCT(_monitorexit_slowcase_cnt++;) | |
670 assert(thread == JavaThread::current(), "threads must correspond"); | |
671 assert(thread->last_Java_sp(), "last_Java_sp must be set"); | |
672 // monitorexit is non-blocking (leaf routine) => no exceptions can be thrown | |
673 EXCEPTION_MARK; | |
674 | |
675 oop obj = lock->obj(); | |
676 assert(obj->is_oop(), "must be NULL or an object"); | |
677 if (UseFastLocking) { | |
678 // When using fast locking, the compiled code has already tried the fast case | |
679 ObjectSynchronizer::slow_exit(obj, lock->lock(), THREAD); | |
680 } else { | |
681 ObjectSynchronizer::fast_exit(obj, lock->lock(), THREAD); | |
682 } | |
683 JRT_END | |
684 | |
4048
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
685 // Cf. OptoRuntime::deoptimize_caller_frame |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
686 JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* thread)) |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
687 // Called from within the owner thread, so no need for safepoint |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
688 RegisterMap reg_map(thread, false); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
689 frame stub_frame = thread->last_frame(); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
690 assert(stub_frame.is_runtime_frame(), "sanity check"); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
691 frame caller_frame = stub_frame.sender(®_map); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
692 |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
693 // We are coming from a compiled method; check this is true. |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
694 assert(CodeCache::find_nmethod(caller_frame.pc()) != NULL, "sanity"); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
695 |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
696 // Deoptimize the caller frame. |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
697 Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
698 |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
699 // Return to the now deoptimized frame. |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
700 JRT_END |
cec1757a0134
7102657: JSR 292: C1 deoptimizes unlinked invokedynamic call sites infinitely
twisti
parents:
3899
diff
changeset
|
701 |
0 | 702 |
703 static klassOop resolve_field_return_klass(methodHandle caller, int bci, TRAPS) { | |
2142 | 704 Bytecode_field field_access(caller, bci); |
0 | 705 // This can be static or non-static field access |
2142 | 706 Bytecodes::Code code = field_access.code(); |
0 | 707 |
708 // We must load class, initialize class and resolvethe field | |
709 FieldAccessInfo result; // initialize class if needed | |
710 constantPoolHandle constants(THREAD, caller->constants()); | |
2142 | 711 LinkResolver::resolve_field(result, constants, field_access.index(), Bytecodes::java_code(code), false, CHECK_NULL); |
0 | 712 return result.klass()(); |
713 } | |
714 | |
715 | |
716 // | |
717 // This routine patches sites where a class wasn't loaded or | |
718 // initialized at the time the code was generated. It handles | |
719 // references to classes, fields and forcing of initialization. Most | |
720 // of the cases are straightforward and involving simply forcing | |
721 // resolution of a class, rewriting the instruction stream with the | |
722 // needed constant and replacing the call in this function with the | |
723 // patched code. The case for static field is more complicated since | |
724 // the thread which is in the process of initializing a class can | |
725 // access it's static fields but other threads can't so the code | |
726 // either has to deoptimize when this case is detected or execute a | |
727 // check that the current thread is the initializing thread. The | |
728 // current | |
729 // | |
730 // Patches basically look like this: | |
731 // | |
732 // | |
733 // patch_site: jmp patch stub ;; will be patched | |
734 // continue: ... | |
735 // ... | |
736 // ... | |
737 // ... | |
738 // | |
739 // They have a stub which looks like this: | |
740 // | |
741 // ;; patch body | |
742 // movl <const>, reg (for class constants) | |
743 // <or> movl [reg1 + <const>], reg (for field offsets) | |
744 // <or> movl reg, [reg1 + <const>] (for field offsets) | |
745 // <being_init offset> <bytes to copy> <bytes to skip> | |
746 // patch_stub: call Runtime1::patch_code (through a runtime stub) | |
747 // jmp patch_site | |
748 // | |
749 // | |
750 // A normal patch is done by rewriting the patch body, usually a move, | |
751 // and then copying it into place over top of the jmp instruction | |
752 // being careful to flush caches and doing it in an MP-safe way. The | |
753 // constants following the patch body are used to find various pieces | |
754 // of the patch relative to the call site for Runtime1::patch_code. | |
755 // The case for getstatic and putstatic is more complicated because | |
756 // getstatic and putstatic have special semantics when executing while | |
757 // the class is being initialized. getstatic/putstatic on a class | |
758 // which is being_initialized may be executed by the initializing | |
759 // thread but other threads have to block when they execute it. This | |
760 // is accomplished in compiled code by executing a test of the current | |
761 // thread against the initializing thread of the class. It's emitted | |
762 // as boilerplate in their stub which allows the patched code to be | |
763 // executed before it's copied back into the main body of the nmethod. | |
764 // | |
765 // being_init: get_thread(<tmp reg> | |
766 // cmpl [reg1 + <init_thread_offset>], <tmp reg> | |
767 // jne patch_stub | |
768 // movl [reg1 + <const>], reg (for field offsets) <or> | |
769 // movl reg, [reg1 + <const>] (for field offsets) | |
770 // jmp continue | |
771 // <being_init offset> <bytes to copy> <bytes to skip> | |
772 // patch_stub: jmp Runtim1::patch_code (through a runtime stub) | |
773 // jmp patch_site | |
774 // | |
775 // If the class is being initialized the patch body is rewritten and | |
776 // the patch site is rewritten to jump to being_init, instead of | |
777 // patch_stub. Whenever this code is executed it checks the current | |
778 // thread against the intializing thread so other threads will enter | |
779 // the runtime and end up blocked waiting the class to finish | |
780 // initializing inside the calls to resolve_field below. The | |
781 // initializing class will continue on it's way. Once the class is | |
782 // fully_initialized, the intializing_thread of the class becomes | |
783 // NULL, so the next thread to execute this code will fail the test, | |
784 // call into patch_code and complete the patching process by copying | |
785 // the patch body back into the main part of the nmethod and resume | |
786 // executing. | |
787 // | |
788 // | |
789 | |
790 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id )) | |
791 NOT_PRODUCT(_patch_code_slowcase_cnt++;) | |
792 | |
793 ResourceMark rm(thread); | |
794 RegisterMap reg_map(thread, false); | |
795 frame runtime_frame = thread->last_frame(); | |
796 frame caller_frame = runtime_frame.sender(®_map); | |
797 | |
798 // last java frame on stack | |
799 vframeStream vfst(thread, true); | |
800 assert(!vfst.at_end(), "Java frame must exist"); | |
801 | |
802 methodHandle caller_method(THREAD, vfst.method()); | |
803 // Note that caller_method->code() may not be same as caller_code because of OSR's | |
804 // Note also that in the presence of inlining it is not guaranteed | |
805 // that caller_method() == caller_code->method() | |
806 | |
807 | |
808 int bci = vfst.bci(); | |
809 | |
810 Events::log("patch_code @ " INTPTR_FORMAT , caller_frame.pc()); | |
811 | |
2142 | 812 Bytecodes::Code code = caller_method()->java_code_at(bci); |
0 | 813 |
814 #ifndef PRODUCT | |
815 // this is used by assertions in the access_field_patching_id | |
816 BasicType patch_field_type = T_ILLEGAL; | |
817 #endif // PRODUCT | |
818 bool deoptimize_for_volatile = false; | |
819 int patch_field_offset = -1; | |
820 KlassHandle init_klass(THREAD, klassOop(NULL)); // klass needed by access_field_patching code | |
821 Handle load_klass(THREAD, NULL); // oop needed by load_klass_patching code | |
822 if (stub_id == Runtime1::access_field_patching_id) { | |
823 | |
2142 | 824 Bytecode_field field_access(caller_method, bci); |
0 | 825 FieldAccessInfo result; // initialize class if needed |
2142 | 826 Bytecodes::Code code = field_access.code(); |
0 | 827 constantPoolHandle constants(THREAD, caller_method->constants()); |
2142 | 828 LinkResolver::resolve_field(result, constants, field_access.index(), Bytecodes::java_code(code), false, CHECK); |
0 | 829 patch_field_offset = result.field_offset(); |
830 | |
831 // If we're patching a field which is volatile then at compile it | |
832 // must not have been know to be volatile, so the generated code | |
833 // isn't correct for a volatile reference. The nmethod has to be | |
834 // deoptimized so that the code can be regenerated correctly. | |
835 // This check is only needed for access_field_patching since this | |
836 // is the path for patching field offsets. load_klass is only | |
837 // used for patching references to oops which don't need special | |
838 // handling in the volatile case. | |
839 deoptimize_for_volatile = result.access_flags().is_volatile(); | |
840 | |
841 #ifndef PRODUCT | |
842 patch_field_type = result.field_type(); | |
843 #endif | |
844 } else if (stub_id == Runtime1::load_klass_patching_id) { | |
845 oop k; | |
846 switch (code) { | |
847 case Bytecodes::_putstatic: | |
848 case Bytecodes::_getstatic: | |
849 { klassOop klass = resolve_field_return_klass(caller_method, bci, CHECK); | |
850 // Save a reference to the class that has to be checked for initialization | |
851 init_klass = KlassHandle(THREAD, klass); | |
2376
c7f3d0b4570f
7017732: move static fields into Class to prepare for perm gen removal
never
parents:
2321
diff
changeset
|
852 k = klass->java_mirror(); |
0 | 853 } |
854 break; | |
855 case Bytecodes::_new: | |
2142 | 856 { Bytecode_new bnew(caller_method(), caller_method->bcp_from(bci)); |
857 k = caller_method->constants()->klass_at(bnew.index(), CHECK); | |
0 | 858 } |
859 break; | |
860 case Bytecodes::_multianewarray: | |
2142 | 861 { Bytecode_multianewarray mna(caller_method(), caller_method->bcp_from(bci)); |
862 k = caller_method->constants()->klass_at(mna.index(), CHECK); | |
0 | 863 } |
864 break; | |
865 case Bytecodes::_instanceof: | |
2142 | 866 { Bytecode_instanceof io(caller_method(), caller_method->bcp_from(bci)); |
867 k = caller_method->constants()->klass_at(io.index(), CHECK); | |
0 | 868 } |
869 break; | |
870 case Bytecodes::_checkcast: | |
2142 | 871 { Bytecode_checkcast cc(caller_method(), caller_method->bcp_from(bci)); |
872 k = caller_method->constants()->klass_at(cc.index(), CHECK); | |
0 | 873 } |
874 break; | |
875 case Bytecodes::_anewarray: | |
2142 | 876 { Bytecode_anewarray anew(caller_method(), caller_method->bcp_from(bci)); |
877 klassOop ek = caller_method->constants()->klass_at(anew.index(), CHECK); | |
0 | 878 k = Klass::cast(ek)->array_klass(CHECK); |
879 } | |
880 break; | |
881 case Bytecodes::_ldc: | |
882 case Bytecodes::_ldc_w: | |
883 { | |
2142 | 884 Bytecode_loadconstant cc(caller_method, bci); |
885 k = cc.resolve_constant(CHECK); | |
1602 | 886 assert(k != NULL && !k->is_klass(), "must be class mirror or other Java constant"); |
0 | 887 } |
888 break; | |
889 default: Unimplemented(); | |
890 } | |
891 // convert to handle | |
892 load_klass = Handle(THREAD, k); | |
893 } else { | |
894 ShouldNotReachHere(); | |
895 } | |
896 | |
897 if (deoptimize_for_volatile) { | |
898 // At compile time we assumed the field wasn't volatile but after | |
899 // loading it turns out it was volatile so we have to throw the | |
900 // compiled code out and let it be regenerated. | |
901 if (TracePatching) { | |
902 tty->print_cr("Deoptimizing for patching volatile field reference"); | |
903 } | |
485
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
904 // It's possible the nmethod was invalidated in the last |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
905 // safepoint, but if it's still alive then make it not_entrant. |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
906 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
907 if (nm != NULL) { |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
908 nm->make_not_entrant(); |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
909 } |
ac8fe14c93e4
6767587: missing call to make_not_entrant after deoptimizing for patching volatiles
never
parents:
362
diff
changeset
|
910 |
1905
ce6848d0666d
6968367: can_post_on_exceptions is still using VM_DeoptimizeFrame in some places
never
parents:
1783
diff
changeset
|
911 Deoptimization::deoptimize_frame(thread, caller_frame.id()); |
0 | 912 |
913 // Return to the now deoptimized frame. | |
914 } | |
915 | |
1602 | 916 // If we are patching in a non-perm oop, make sure the nmethod |
917 // is on the right list. | |
918 if (ScavengeRootsInCode && load_klass.not_null() && load_klass->is_scavengable()) { | |
919 MutexLockerEx ml_code (CodeCache_lock, Mutex::_no_safepoint_check_flag); | |
920 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); | |
921 guarantee(nm != NULL, "only nmethods can contain non-perm oops"); | |
922 if (!nm->on_scavenge_root_list()) | |
923 CodeCache::add_scavenge_root_nmethod(nm); | |
924 } | |
0 | 925 |
926 // Now copy code back | |
927 | |
928 { | |
929 MutexLockerEx ml_patch (Patching_lock, Mutex::_no_safepoint_check_flag); | |
930 // | |
931 // Deoptimization may have happened while we waited for the lock. | |
932 // In that case we don't bother to do any patching we just return | |
933 // and let the deopt happen | |
934 if (!caller_is_deopted()) { | |
935 NativeGeneralJump* jump = nativeGeneralJump_at(caller_frame.pc()); | |
936 address instr_pc = jump->jump_destination(); | |
937 NativeInstruction* ni = nativeInstruction_at(instr_pc); | |
938 if (ni->is_jump() ) { | |
939 // the jump has not been patched yet | |
940 // The jump destination is slow case and therefore not part of the stubs | |
941 // (stubs are only for StaticCalls) | |
942 | |
943 // format of buffer | |
944 // .... | |
945 // instr byte 0 <-- copy_buff | |
946 // instr byte 1 | |
947 // .. | |
948 // instr byte n-1 | |
949 // n | |
950 // .... <-- call destination | |
951 | |
952 address stub_location = caller_frame.pc() + PatchingStub::patch_info_offset(); | |
953 unsigned char* byte_count = (unsigned char*) (stub_location - 1); | |
954 unsigned char* byte_skip = (unsigned char*) (stub_location - 2); | |
955 unsigned char* being_initialized_entry_offset = (unsigned char*) (stub_location - 3); | |
956 address copy_buff = stub_location - *byte_skip - *byte_count; | |
957 address being_initialized_entry = stub_location - *being_initialized_entry_offset; | |
958 if (TracePatching) { | |
959 tty->print_cr(" Patching %s at bci %d at address 0x%x (%s)", Bytecodes::name(code), bci, | |
960 instr_pc, (stub_id == Runtime1::access_field_patching_id) ? "field" : "klass"); | |
961 nmethod* caller_code = CodeCache::find_nmethod(caller_frame.pc()); | |
962 assert(caller_code != NULL, "nmethod not found"); | |
963 | |
964 // NOTE we use pc() not original_pc() because we already know they are | |
965 // identical otherwise we'd have never entered this block of code | |
966 | |
967 OopMap* map = caller_code->oop_map_for_return_address(caller_frame.pc()); | |
968 assert(map != NULL, "null check"); | |
969 map->print(); | |
970 tty->cr(); | |
971 | |
972 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); | |
973 } | |
974 // depending on the code below, do_patch says whether to copy the patch body back into the nmethod | |
975 bool do_patch = true; | |
976 if (stub_id == Runtime1::access_field_patching_id) { | |
977 // The offset may not be correct if the class was not loaded at code generation time. | |
978 // Set it now. | |
979 NativeMovRegMem* n_move = nativeMovRegMem_at(copy_buff); | |
980 assert(n_move->offset() == 0 || (n_move->offset() == 4 && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)), "illegal offset for type"); | |
981 assert(patch_field_offset >= 0, "illegal offset"); | |
982 n_move->add_offset_in_bytes(patch_field_offset); | |
983 } else if (stub_id == Runtime1::load_klass_patching_id) { | |
984 // If a getstatic or putstatic is referencing a klass which | |
985 // isn't fully initialized, the patch body isn't copied into | |
986 // place until initialization is complete. In this case the | |
987 // patch site is setup so that any threads besides the | |
988 // initializing thread are forced to come into the VM and | |
989 // block. | |
990 do_patch = (code != Bytecodes::_getstatic && code != Bytecodes::_putstatic) || | |
991 instanceKlass::cast(init_klass())->is_initialized(); | |
992 NativeGeneralJump* jump = nativeGeneralJump_at(instr_pc); | |
993 if (jump->jump_destination() == being_initialized_entry) { | |
994 assert(do_patch == true, "initialization must be complete at this point"); | |
995 } else { | |
996 // patch the instruction <move reg, klass> | |
997 NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff); | |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
998 |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
999 assert(n_copy->data() == 0 || |
1783 | 1000 n_copy->data() == (intptr_t)Universe::non_oop_word(), |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1001 "illegal init value"); |
0 | 1002 assert(load_klass() != NULL, "klass not set"); |
1003 n_copy->set_data((intx) (load_klass())); | |
1004 | |
1005 if (TracePatching) { | |
1006 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); | |
1007 } | |
1008 | |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1009 #if defined(SPARC) || defined(PPC) |
0 | 1010 // Update the oop location in the nmethod with the proper |
1011 // oop. When the code was generated, a NULL was stuffed | |
1012 // in the oop table and that table needs to be update to | |
1013 // have the right value. On intel the value is kept | |
1014 // directly in the instruction instead of in the oop | |
1015 // table, so set_data above effectively updated the value. | |
1016 nmethod* nm = CodeCache::find_nmethod(instr_pc); | |
1017 assert(nm != NULL, "invalid nmethod_pc"); | |
1018 RelocIterator oops(nm, copy_buff, copy_buff + 1); | |
1019 bool found = false; | |
1020 while (oops.next() && !found) { | |
1021 if (oops.type() == relocInfo::oop_type) { | |
1022 oop_Relocation* r = oops.oop_reloc(); | |
1023 oop* oop_adr = r->oop_addr(); | |
1024 *oop_adr = load_klass(); | |
1025 r->fix_oop_relocation(); | |
1026 found = true; | |
1027 } | |
1028 } | |
1029 assert(found, "the oop must exist!"); | |
1030 #endif | |
1031 | |
1032 } | |
1033 } else { | |
1034 ShouldNotReachHere(); | |
1035 } | |
1036 if (do_patch) { | |
1037 // replace instructions | |
1038 // first replace the tail, then the call | |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1039 #ifdef ARM |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1040 if(stub_id == Runtime1::load_klass_patching_id && !VM_Version::supports_movw()) { |
3269
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1041 nmethod* nm = CodeCache::find_nmethod(instr_pc); |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1042 oop* oop_addr = NULL; |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1043 assert(nm != NULL, "invalid nmethod_pc"); |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1044 RelocIterator oops(nm, copy_buff, copy_buff + 1); |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1045 while (oops.next()) { |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1046 if (oops.type() == relocInfo::oop_type) { |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1047 oop_Relocation* r = oops.oop_reloc(); |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1048 oop_addr = r->oop_addr(); |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1049 break; |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1050 } |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1051 } |
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1052 assert(oop_addr != NULL, "oop relocation must exist"); |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1053 copy_buff -= *byte_count; |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1054 NativeMovConstReg* n_copy2 = nativeMovConstReg_at(copy_buff); |
3269
7ec4bb02d5f0
7035861: linux-armsflt: assert(ni->data() == (int)(x + o)) failed: instructions must match
vladidan
parents:
2446
diff
changeset
|
1055 n_copy2->set_pc_relative_offset((address)oop_addr, instr_pc); |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1056 } |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1057 #endif |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1058 |
0 | 1059 for (int i = NativeCall::instruction_size; i < *byte_count; i++) { |
1060 address ptr = copy_buff + i; | |
1061 int a_byte = (*ptr) & 0xFF; | |
1062 address dst = instr_pc + i; | |
1063 *(unsigned char*)dst = (unsigned char) a_byte; | |
1064 } | |
1065 ICache::invalidate_range(instr_pc, *byte_count); | |
1066 NativeGeneralJump::replace_mt_safe(instr_pc, copy_buff); | |
1067 | |
1068 if (stub_id == Runtime1::load_klass_patching_id) { | |
1069 // update relocInfo to oop | |
1070 nmethod* nm = CodeCache::find_nmethod(instr_pc); | |
1071 assert(nm != NULL, "invalid nmethod_pc"); | |
1072 | |
1073 // The old patch site is now a move instruction so update | |
1074 // the reloc info so that it will get updated during | |
1075 // future GCs. | |
1076 RelocIterator iter(nm, (address)instr_pc, (address)(instr_pc + 1)); | |
1077 relocInfo::change_reloc_info_for_address(&iter, (address) instr_pc, | |
1078 relocInfo::none, relocInfo::oop_type); | |
1079 #ifdef SPARC | |
1080 // Sparc takes two relocations for an oop so update the second one. | |
1081 address instr_pc2 = instr_pc + NativeMovConstReg::add_offset; | |
1082 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); | |
1083 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, | |
1084 relocInfo::none, relocInfo::oop_type); | |
1085 #endif | |
1681
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1086 #ifdef PPC |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1087 { address instr_pc2 = instr_pc + NativeMovConstReg::lo_offset; |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1088 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1089 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, relocInfo::none, relocInfo::oop_type); |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1090 } |
126ea7725993
6953477: Increase portability and flexibility of building Hotspot
bobv
parents:
1603
diff
changeset
|
1091 #endif |
0 | 1092 } |
1093 | |
1094 } else { | |
1095 ICache::invalidate_range(copy_buff, *byte_count); | |
1096 NativeGeneralJump::insert_unconditional(instr_pc, being_initialized_entry); | |
1097 } | |
1098 } | |
1099 } | |
1100 } | |
1101 JRT_END | |
1102 | |
1103 // | |
1104 // Entry point for compiled code. We want to patch a nmethod. | |
1105 // We don't do a normal VM transition here because we want to | |
1106 // know after the patching is complete and any safepoint(s) are taken | |
1107 // if the calling nmethod was deoptimized. We do this by calling a | |
1108 // helper method which does the normal VM transition and when it | |
1109 // completes we can check for deoptimization. This simplifies the | |
1110 // assembly code in the cpu directories. | |
1111 // | |
1112 int Runtime1::move_klass_patching(JavaThread* thread) { | |
1113 // | |
1114 // NOTE: we are still in Java | |
1115 // | |
1116 Thread* THREAD = thread; | |
1117 debug_only(NoHandleMark nhm;) | |
1118 { | |
1119 // Enter VM mode | |
1120 | |
1121 ResetNoHandleMark rnhm; | |
1122 patch_code(thread, load_klass_patching_id); | |
1123 } | |
1124 // Back in JAVA, use no oops DON'T safepoint | |
1125 | |
1126 // Return true if calling code is deoptimized | |
1127 | |
1128 return caller_is_deopted(); | |
1129 } | |
1130 | |
1131 // | |
1132 // Entry point for compiled code. We want to patch a nmethod. | |
1133 // We don't do a normal VM transition here because we want to | |
1134 // know after the patching is complete and any safepoint(s) are taken | |
1135 // if the calling nmethod was deoptimized. We do this by calling a | |
1136 // helper method which does the normal VM transition and when it | |
1137 // completes we can check for deoptimization. This simplifies the | |
1138 // assembly code in the cpu directories. | |
1139 // | |
1140 | |
1141 int Runtime1::access_field_patching(JavaThread* thread) { | |
1142 // | |
1143 // NOTE: we are still in Java | |
1144 // | |
1145 Thread* THREAD = thread; | |
1146 debug_only(NoHandleMark nhm;) | |
1147 { | |
1148 // Enter VM mode | |
1149 | |
1150 ResetNoHandleMark rnhm; | |
1151 patch_code(thread, access_field_patching_id); | |
1152 } | |
1153 // Back in JAVA, use no oops DON'T safepoint | |
1154 | |
1155 // Return true if calling code is deoptimized | |
1156 | |
1157 return caller_is_deopted(); | |
1158 JRT_END | |
1159 | |
1160 | |
1161 JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id)) | |
1162 // for now we just print out the block id | |
1163 tty->print("%d ", block_id); | |
1164 JRT_END | |
1165 | |
1166 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1167 // Array copy return codes. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1168 enum { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1169 ac_failed = -1, // arraycopy failed |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1170 ac_ok = 0 // arraycopy succeeded |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1171 }; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1172 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1173 |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1174 // Below length is the # elements copied. |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1175 template <class T> int obj_arraycopy_work(oopDesc* src, T* src_addr, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1176 oopDesc* dst, T* dst_addr, |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1177 int length) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1178 |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1179 // For performance reasons, we assume we are using a card marking write |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1180 // barrier. The assert will fail if this is not the case. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1181 // Note that we use the non-virtual inlineable variant of write_ref_array. |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1182 BarrierSet* bs = Universe::heap()->barrier_set(); |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1183 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1184 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1185 if (src == dst) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1186 // same object, no check |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1187 bs->write_ref_array_pre(dst_addr, length); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1188 Copy::conjoint_oops_atomic(src_addr, dst_addr, length); |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1189 bs->write_ref_array((HeapWord*)dst_addr, length); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1190 return ac_ok; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1191 } else { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1192 klassOop bound = objArrayKlass::cast(dst->klass())->element_klass(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1193 klassOop stype = objArrayKlass::cast(src->klass())->element_klass(); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1194 if (stype == bound || Klass::cast(stype)->is_subtype_of(bound)) { |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1195 // Elements are guaranteed to be subtypes, so no check necessary |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1196 bs->write_ref_array_pre(dst_addr, length); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1197 Copy::conjoint_oops_atomic(src_addr, dst_addr, length); |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1198 bs->write_ref_array((HeapWord*)dst_addr, length); |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1199 return ac_ok; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1200 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1201 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1202 return ac_failed; |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1203 } |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1204 |
0 | 1205 // fast and direct copy of arrays; returning -1, means that an exception may be thrown |
1206 // and we did not copy anything | |
1207 JRT_LEAF(int, Runtime1::arraycopy(oopDesc* src, int src_pos, oopDesc* dst, int dst_pos, int length)) | |
1208 #ifndef PRODUCT | |
1209 _generic_arraycopy_cnt++; // Slow-path oop array copy | |
1210 #endif | |
1211 | |
1212 if (src == NULL || dst == NULL || src_pos < 0 || dst_pos < 0 || length < 0) return ac_failed; | |
1213 if (!dst->is_array() || !src->is_array()) return ac_failed; | |
1214 if ((unsigned int) arrayOop(src)->length() < (unsigned int)src_pos + (unsigned int)length) return ac_failed; | |
1215 if ((unsigned int) arrayOop(dst)->length() < (unsigned int)dst_pos + (unsigned int)length) return ac_failed; | |
1216 | |
1217 if (length == 0) return ac_ok; | |
1218 if (src->is_typeArray()) { | |
1219 const klassOop klass_oop = src->klass(); | |
1220 if (klass_oop != dst->klass()) return ac_failed; | |
1221 typeArrayKlass* klass = typeArrayKlass::cast(klass_oop); | |
1222 const int l2es = klass->log2_element_size(); | |
1223 const int ihs = klass->array_header_in_bytes() / wordSize; | |
1224 char* src_addr = (char*) ((oopDesc**)src + ihs) + (src_pos << l2es); | |
1225 char* dst_addr = (char*) ((oopDesc**)dst + ihs) + (dst_pos << l2es); | |
1226 // Potential problem: memmove is not guaranteed to be word atomic | |
1227 // Revisit in Merlin | |
1228 memmove(dst_addr, src_addr, length << l2es); | |
1229 return ac_ok; | |
1230 } else if (src->is_objArray() && dst->is_objArray()) { | |
2002 | 1231 if (UseCompressedOops) { |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1232 narrowOop *src_addr = objArrayOop(src)->obj_at_addr<narrowOop>(src_pos); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1233 narrowOop *dst_addr = objArrayOop(dst)->obj_at_addr<narrowOop>(dst_pos); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1234 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); |
0 | 1235 } else { |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1236 oop *src_addr = objArrayOop(src)->obj_at_addr<oop>(src_pos); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1237 oop *dst_addr = objArrayOop(dst)->obj_at_addr<oop>(dst_pos); |
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
1238 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); |
0 | 1239 } |
1240 } | |
1241 return ac_failed; | |
1242 JRT_END | |
1243 | |
1244 | |
1245 JRT_LEAF(void, Runtime1::primitive_arraycopy(HeapWord* src, HeapWord* dst, int length)) | |
1246 #ifndef PRODUCT | |
1247 _primitive_arraycopy_cnt++; | |
1248 #endif | |
1249 | |
1250 if (length == 0) return; | |
1251 // Not guaranteed to be word atomic, but that doesn't matter | |
1252 // for anything but an oop array, which is covered by oop_arraycopy. | |
1603
d93949c5bdcc
6730276: JDI_REGRESSION tests fail with "Error: count must be non-zero" error on x86
kvn
parents:
1602
diff
changeset
|
1253 Copy::conjoint_jbytes(src, dst, length); |
0 | 1254 JRT_END |
1255 | |
1256 JRT_LEAF(void, Runtime1::oop_arraycopy(HeapWord* src, HeapWord* dst, int num)) | |
1257 #ifndef PRODUCT | |
1258 _oop_arraycopy_cnt++; | |
1259 #endif | |
1260 | |
1261 if (num == 0) return; | |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1262 BarrierSet* bs = Universe::heap()->barrier_set(); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1263 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1264 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1265 if (UseCompressedOops) { |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1266 bs->write_ref_array_pre((narrowOop*)dst, num); |
2002 | 1267 Copy::conjoint_oops_atomic((narrowOop*) src, (narrowOop*) dst, num); |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1268 } else { |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1269 bs->write_ref_array_pre((oop*)dst, num); |
2002 | 1270 Copy::conjoint_oops_atomic((oop*) src, (oop*) dst, num); |
1245
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1271 } |
6484c4ee11cb
6904516: More object array barrier fixes, following up on 6906727
ysr
parents:
1142
diff
changeset
|
1272 bs->write_ref_array(dst, num); |
0 | 1273 JRT_END |
1274 | |
1275 | |
1276 #ifndef PRODUCT | |
1277 void Runtime1::print_statistics() { | |
1278 tty->print_cr("C1 Runtime statistics:"); | |
1279 tty->print_cr(" _resolve_invoke_virtual_cnt: %d", SharedRuntime::_resolve_virtual_ctr); | |
1280 tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %d", SharedRuntime::_resolve_opt_virtual_ctr); | |
1281 tty->print_cr(" _resolve_invoke_static_cnt: %d", SharedRuntime::_resolve_static_ctr); | |
1282 tty->print_cr(" _handle_wrong_method_cnt: %d", SharedRuntime::_wrong_method_ctr); | |
1283 tty->print_cr(" _ic_miss_cnt: %d", SharedRuntime::_ic_miss_ctr); | |
1284 tty->print_cr(" _generic_arraycopy_cnt: %d", _generic_arraycopy_cnt); | |
2446 | 1285 tty->print_cr(" _generic_arraycopystub_cnt: %d", _generic_arraycopystub_cnt); |
1286 tty->print_cr(" _byte_arraycopy_cnt: %d", _byte_arraycopy_cnt); | |
1287 tty->print_cr(" _short_arraycopy_cnt: %d", _short_arraycopy_cnt); | |
1288 tty->print_cr(" _int_arraycopy_cnt: %d", _int_arraycopy_cnt); | |
1289 tty->print_cr(" _long_arraycopy_cnt: %d", _long_arraycopy_cnt); | |
0 | 1290 tty->print_cr(" _primitive_arraycopy_cnt: %d", _primitive_arraycopy_cnt); |
2446 | 1291 tty->print_cr(" _oop_arraycopy_cnt (C): %d", Runtime1::_oop_arraycopy_cnt); |
1292 tty->print_cr(" _oop_arraycopy_cnt (stub): %d", _oop_arraycopy_cnt); | |
0 | 1293 tty->print_cr(" _arraycopy_slowcase_cnt: %d", _arraycopy_slowcase_cnt); |
2446 | 1294 tty->print_cr(" _arraycopy_checkcast_cnt: %d", _arraycopy_checkcast_cnt); |
1295 tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%d", _arraycopy_checkcast_attempt_cnt); | |
0 | 1296 |
1297 tty->print_cr(" _new_type_array_slowcase_cnt: %d", _new_type_array_slowcase_cnt); | |
1298 tty->print_cr(" _new_object_array_slowcase_cnt: %d", _new_object_array_slowcase_cnt); | |
1299 tty->print_cr(" _new_instance_slowcase_cnt: %d", _new_instance_slowcase_cnt); | |
1300 tty->print_cr(" _new_multi_array_slowcase_cnt: %d", _new_multi_array_slowcase_cnt); | |
1301 tty->print_cr(" _monitorenter_slowcase_cnt: %d", _monitorenter_slowcase_cnt); | |
1302 tty->print_cr(" _monitorexit_slowcase_cnt: %d", _monitorexit_slowcase_cnt); | |
1303 tty->print_cr(" _patch_code_slowcase_cnt: %d", _patch_code_slowcase_cnt); | |
1304 | |
1305 tty->print_cr(" _throw_range_check_exception_count: %d:", _throw_range_check_exception_count); | |
1306 tty->print_cr(" _throw_index_exception_count: %d:", _throw_index_exception_count); | |
1307 tty->print_cr(" _throw_div0_exception_count: %d:", _throw_div0_exception_count); | |
1308 tty->print_cr(" _throw_null_pointer_exception_count: %d:", _throw_null_pointer_exception_count); | |
1309 tty->print_cr(" _throw_class_cast_exception_count: %d:", _throw_class_cast_exception_count); | |
1310 tty->print_cr(" _throw_incompatible_class_change_error_count: %d:", _throw_incompatible_class_change_error_count); | |
1311 tty->print_cr(" _throw_array_store_exception_count: %d:", _throw_array_store_exception_count); | |
1312 tty->print_cr(" _throw_count: %d:", _throw_count); | |
1313 | |
1314 SharedRuntime::print_ic_miss_histogram(); | |
1315 tty->cr(); | |
1316 } | |
1317 #endif // PRODUCT |