1 /*
2 * Copyright (c) 1998, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "classfile/vmSymbols.hpp"
28 #include "code/codeCache.hpp"
29 #include "code/compiledIC.hpp"
30 #include "code/icBuffer.hpp"
31 #include "code/nmethod.hpp"
32 #include "code/pcDesc.hpp"
33 #include "code/scopeDesc.hpp"
34 #include "code/vtableStubs.hpp"
35 #include "compiler/compileBroker.hpp"
36 #include "compiler/compilerOracle.hpp"
37 #include "compiler/oopMap.hpp"
38 #include "gc/g1/g1SATBCardTableModRefBS.hpp"
39 #include "gc/g1/heapRegion.hpp"
40 #include "gc/shared/barrierSet.hpp"
41 #include "gc/shared/collectedHeap.hpp"
42 #include "gc/shared/gcLocker.inline.hpp"
43 #include "interpreter/bytecode.hpp"
44 #include "interpreter/interpreter.hpp"
45 #include "interpreter/linkResolver.hpp"
46 #include "memory/oopFactory.hpp"
47 #include "oops/objArrayKlass.hpp"
48 #include "oops/oop.inline.hpp"
49 #include "opto/ad.hpp"
50 #include "opto/addnode.hpp"
51 #include "opto/callnode.hpp"
52 #include "opto/cfgnode.hpp"
53 #include "opto/graphKit.hpp"
54 #include "opto/machnode.hpp"
55 #include "opto/matcher.hpp"
56 #include "opto/memnode.hpp"
57 #include "opto/mulnode.hpp"
58 #include "opto/runtime.hpp"
59 #include "opto/subnode.hpp"
60 #include "runtime/atomic.inline.hpp"
61 #include "runtime/fprofiler.hpp"
62 #include "runtime/handles.inline.hpp"
63 #include "runtime/interfaceSupport.hpp"
64 #include "runtime/javaCalls.hpp"
65 #include "runtime/sharedRuntime.hpp"
66 #include "runtime/signature.hpp"
67 #include "runtime/threadCritical.hpp"
68 #include "runtime/vframe.hpp"
69 #include "runtime/vframeArray.hpp"
70 #include "runtime/vframe_hp.hpp"
71 #include "utilities/copy.hpp"
72 #include "utilities/preserveException.hpp"
73
74
75 // For debugging purposes:
76 // To force FullGCALot inside a runtime function, add the following two lines
77 //
78 // Universe::release_fullgc_alot_dummy();
79 // MarkSweep::invoke(0, "Debugging");
80 //
81 // At command line specify the parameters: -XX:+FullGCALot -XX:FullGCALotStart=100000000
82
83
84
85
86 // Compiled code entry points
87 address OptoRuntime::_new_instance_Java = NULL;
88 address OptoRuntime::_new_array_Java = NULL;
89 address OptoRuntime::_new_array_nozero_Java = NULL;
90 address OptoRuntime::_multianewarray2_Java = NULL;
91 address OptoRuntime::_multianewarray3_Java = NULL;
92 address OptoRuntime::_multianewarray4_Java = NULL;
93 address OptoRuntime::_multianewarray5_Java = NULL;
94 address OptoRuntime::_multianewarrayN_Java = NULL;
95 address OptoRuntime::_g1_wb_pre_Java = NULL;
96 address OptoRuntime::_g1_wb_post_Java = NULL;
97 address OptoRuntime::_vtable_must_compile_Java = NULL;
98 address OptoRuntime::_complete_monitor_locking_Java = NULL;
99 address OptoRuntime::_rethrow_Java = NULL;
100
101 address OptoRuntime::_slow_arraycopy_Java = NULL;
102 address OptoRuntime::_register_finalizer_Java = NULL;
103
104 # ifdef ENABLE_ZAP_DEAD_LOCALS
105 address OptoRuntime::_zap_dead_Java_locals_Java = NULL;
106 address OptoRuntime::_zap_dead_native_locals_Java = NULL;
107 # endif
108
109 ExceptionBlob* OptoRuntime::_exception_blob;
110
111 // This should be called in an assertion at the start of OptoRuntime routines
112 // which are entered from compiled code (all of them)
113 #ifdef ASSERT
114 static bool check_compiled_frame(JavaThread* thread) {
115 assert(thread->last_frame().is_runtime_frame(), "cannot call runtime directly from compiled code");
116 RegisterMap map(thread, false);
117 frame caller = thread->last_frame().sender(&map);
118 assert(caller.is_compiled_frame(), "not being called from compiled like code");
119 return true;
120 }
121 #endif // ASSERT
122
123
124 #define gen(env, var, type_func_gen, c_func, fancy_jump, pass_tls, save_arg_regs, return_pc) \
125 var = generate_stub(env, type_func_gen, CAST_FROM_FN_PTR(address, c_func), #var, fancy_jump, pass_tls, save_arg_regs, return_pc); \
126 if (var == NULL) { return false; }
127
128 bool OptoRuntime::generate(ciEnv* env) {
129
130 generate_exception_blob();
131
132 // Note: tls: Means fetching the return oop out of the thread-local storage
133 //
134 // variable/name type-function-gen , runtime method ,fncy_jp, tls,save_args,retpc
135 // -------------------------------------------------------------------------------------------------------------------------------
136 gen(env, _new_instance_Java , new_instance_Type , new_instance_C , 0 , true , false, false);
137 gen(env, _new_array_Java , new_array_Type , new_array_C , 0 , true , false, false);
138 gen(env, _new_array_nozero_Java , new_array_Type , new_array_nozero_C , 0 , true , false, false);
139 gen(env, _multianewarray2_Java , multianewarray2_Type , multianewarray2_C , 0 , true , false, false);
140 gen(env, _multianewarray3_Java , multianewarray3_Type , multianewarray3_C , 0 , true , false, false);
141 gen(env, _multianewarray4_Java , multianewarray4_Type , multianewarray4_C , 0 , true , false, false);
142 gen(env, _multianewarray5_Java , multianewarray5_Type , multianewarray5_C , 0 , true , false, false);
143 gen(env, _multianewarrayN_Java , multianewarrayN_Type , multianewarrayN_C , 0 , true , false, false);
144 gen(env, _g1_wb_pre_Java , g1_wb_pre_Type , SharedRuntime::g1_wb_pre , 0 , false, false, false);
145 gen(env, _g1_wb_post_Java , g1_wb_post_Type , SharedRuntime::g1_wb_post , 0 , false, false, false);
146 gen(env, _complete_monitor_locking_Java , complete_monitor_enter_Type , SharedRuntime::complete_monitor_locking_C, 0, false, false, false);
147 gen(env, _rethrow_Java , rethrow_Type , rethrow_C , 2 , true , false, true );
148
149 gen(env, _slow_arraycopy_Java , slow_arraycopy_Type , SharedRuntime::slow_arraycopy_C , 0 , false, false, false);
150 gen(env, _register_finalizer_Java , register_finalizer_Type , register_finalizer , 0 , false, false, false);
151
152 # ifdef ENABLE_ZAP_DEAD_LOCALS
153 gen(env, _zap_dead_Java_locals_Java , zap_dead_locals_Type , zap_dead_Java_locals_C , 0 , false, true , false );
154 gen(env, _zap_dead_native_locals_Java , zap_dead_locals_Type , zap_dead_native_locals_C , 0 , false, true , false );
155 # endif
156 return true;
157 }
158
159 #undef gen
160
161
162 // Helper method to do generation of RunTimeStub's
163 address OptoRuntime::generate_stub( ciEnv* env,
164 TypeFunc_generator gen, address C_function,
165 const char *name, int is_fancy_jump,
166 bool pass_tls,
167 bool save_argument_registers,
168 bool return_pc ) {
169 ResourceMark rm;
170 Compile C( env, gen, C_function, name, is_fancy_jump, pass_tls, save_argument_registers, return_pc );
171 return C.stub_entry_point();
172 }
173
174 const char* OptoRuntime::stub_name(address entry) {
175 #ifndef PRODUCT
176 CodeBlob* cb = CodeCache::find_blob(entry);
177 RuntimeStub* rs =(RuntimeStub *)cb;
178 assert(rs != NULL && rs->is_runtime_stub(), "not a runtime stub");
179 return rs->name();
180 #else
181 // Fast implementation for product mode (maybe it should be inlined too)
182 return "runtime stub";
183 #endif
184 }
185
186
187 //=============================================================================
188 // Opto compiler runtime routines
189 //=============================================================================
190
191
192 //=============================allocation======================================
193 // We failed the fast-path allocation. Now we need to do a scavenge or GC
194 // and try allocation again.
195
196 void OptoRuntime::new_store_pre_barrier(JavaThread* thread) {
197 // After any safepoint, just before going back to compiled code,
198 // we inform the GC that we will be doing initializing writes to
199 // this object in the future without emitting card-marks, so
200 // GC may take any compensating steps.
201 // NOTE: Keep this code consistent with GraphKit::store_barrier.
202
203 oop new_obj = thread->vm_result();
204 if (new_obj == NULL) return;
205
206 assert(Universe::heap()->can_elide_tlab_store_barriers(),
207 "compiler must check this first");
208 // GC may decide to give back a safer copy of new_obj.
209 new_obj = Universe::heap()->new_store_pre_barrier(thread, new_obj);
210 thread->set_vm_result(new_obj);
211 }
212
213 // object allocation
214 JRT_BLOCK_ENTRY(void, OptoRuntime::new_instance_C(Klass* klass, JavaThread* thread))
215 JRT_BLOCK;
216 #ifndef PRODUCT
217 SharedRuntime::_new_instance_ctr++; // new instance requires GC
218 #endif
219 assert(check_compiled_frame(thread), "incorrect caller");
220
221 // These checks are cheap to make and support reflective allocation.
222 int lh = klass->layout_helper();
223 if (Klass::layout_helper_needs_slow_path(lh)
224 || !InstanceKlass::cast(klass)->is_initialized()) {
225 KlassHandle kh(THREAD, klass);
226 kh->check_valid_for_instantiation(false, THREAD);
227 if (!HAS_PENDING_EXCEPTION) {
228 InstanceKlass::cast(kh())->initialize(THREAD);
229 }
230 if (!HAS_PENDING_EXCEPTION) {
231 klass = kh();
232 } else {
233 klass = NULL;
234 }
235 }
236
237 if (klass != NULL) {
238 // Scavenge and allocate an instance.
239 oop result = InstanceKlass::cast(klass)->allocate_instance(THREAD);
240 thread->set_vm_result(result);
241
242 // Pass oops back through thread local storage. Our apparent type to Java
243 // is that we return an oop, but we can block on exit from this routine and
244 // a GC can trash the oop in C's return register. The generated stub will
245 // fetch the oop from TLS after any possible GC.
246 }
247
248 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
249 JRT_BLOCK_END;
250
251 if (GraphKit::use_ReduceInitialCardMarks()) {
252 // inform GC that we won't do card marks for initializing writes.
253 new_store_pre_barrier(thread);
254 }
255 JRT_END
256
257
258 // array allocation
259 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_C(Klass* array_type, int len, JavaThread *thread))
260 JRT_BLOCK;
261 #ifndef PRODUCT
262 SharedRuntime::_new_array_ctr++; // new array requires GC
263 #endif
264 assert(check_compiled_frame(thread), "incorrect caller");
265
266 // Scavenge and allocate an instance.
267 oop result;
268
269 if (array_type->oop_is_typeArray()) {
270 // The oopFactory likes to work with the element type.
271 // (We could bypass the oopFactory, since it doesn't add much value.)
272 BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
273 result = oopFactory::new_typeArray(elem_type, len, THREAD);
274 } else {
275 // Although the oopFactory likes to work with the elem_type,
276 // the compiler prefers the array_type, since it must already have
277 // that latter value in hand for the fast path.
278 Klass* elem_type = ObjArrayKlass::cast(array_type)->element_klass();
279 result = oopFactory::new_objArray(elem_type, len, THREAD);
280 }
281
282 // Pass oops back through thread local storage. Our apparent type to Java
283 // is that we return an oop, but we can block on exit from this routine and
284 // a GC can trash the oop in C's return register. The generated stub will
285 // fetch the oop from TLS after any possible GC.
286 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
287 thread->set_vm_result(result);
288 JRT_BLOCK_END;
289
290 if (GraphKit::use_ReduceInitialCardMarks()) {
291 // inform GC that we won't do card marks for initializing writes.
292 new_store_pre_barrier(thread);
293 }
294 JRT_END
295
296 // array allocation without zeroing
297 JRT_BLOCK_ENTRY(void, OptoRuntime::new_array_nozero_C(Klass* array_type, int len, JavaThread *thread))
298 JRT_BLOCK;
299 #ifndef PRODUCT
300 SharedRuntime::_new_array_ctr++; // new array requires GC
301 #endif
302 assert(check_compiled_frame(thread), "incorrect caller");
303
304 // Scavenge and allocate an instance.
305 oop result;
306
307 assert(array_type->oop_is_typeArray(), "should be called only for type array");
308 // The oopFactory likes to work with the element type.
309 BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
310 result = oopFactory::new_typeArray_nozero(elem_type, len, THREAD);
311
312 // Pass oops back through thread local storage. Our apparent type to Java
313 // is that we return an oop, but we can block on exit from this routine and
314 // a GC can trash the oop in C's return register. The generated stub will
315 // fetch the oop from TLS after any possible GC.
316 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
317 thread->set_vm_result(result);
318 JRT_BLOCK_END;
319
320 if (GraphKit::use_ReduceInitialCardMarks()) {
321 // inform GC that we won't do card marks for initializing writes.
322 new_store_pre_barrier(thread);
323 }
324
325 oop result = thread->vm_result();
326 if ((len > 0) && (result != NULL) &&
327 is_deoptimized_caller_frame(thread)) {
328 // Zero array here if the caller is deoptimized.
329 int size = ((typeArrayOop)result)->object_size();
330 BasicType elem_type = TypeArrayKlass::cast(array_type)->element_type();
331 const size_t hs = arrayOopDesc::header_size(elem_type);
332 // Align to next 8 bytes to avoid trashing arrays's length.
333 const size_t aligned_hs = align_object_offset(hs);
334 HeapWord* obj = (HeapWord*)result;
335 if (aligned_hs > hs) {
336 Copy::zero_to_words(obj+hs, aligned_hs-hs);
337 }
338 // Optimized zeroing.
339 Copy::fill_to_aligned_words(obj+aligned_hs, size-aligned_hs);
340 }
341
342 JRT_END
343
344 // Note: multianewarray for one dimension is handled inline by GraphKit::new_array.
345
346 // multianewarray for 2 dimensions
347 JRT_ENTRY(void, OptoRuntime::multianewarray2_C(Klass* elem_type, int len1, int len2, JavaThread *thread))
348 #ifndef PRODUCT
349 SharedRuntime::_multi2_ctr++; // multianewarray for 1 dimension
350 #endif
351 assert(check_compiled_frame(thread), "incorrect caller");
352 assert(elem_type->is_klass(), "not a class");
353 jint dims[2];
354 dims[0] = len1;
355 dims[1] = len2;
356 oop obj = ArrayKlass::cast(elem_type)->multi_allocate(2, dims, THREAD);
357 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
358 thread->set_vm_result(obj);
359 JRT_END
360
361 // multianewarray for 3 dimensions
362 JRT_ENTRY(void, OptoRuntime::multianewarray3_C(Klass* elem_type, int len1, int len2, int len3, JavaThread *thread))
363 #ifndef PRODUCT
364 SharedRuntime::_multi3_ctr++; // multianewarray for 1 dimension
365 #endif
366 assert(check_compiled_frame(thread), "incorrect caller");
367 assert(elem_type->is_klass(), "not a class");
368 jint dims[3];
369 dims[0] = len1;
370 dims[1] = len2;
371 dims[2] = len3;
372 oop obj = ArrayKlass::cast(elem_type)->multi_allocate(3, dims, THREAD);
373 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
374 thread->set_vm_result(obj);
375 JRT_END
376
377 // multianewarray for 4 dimensions
378 JRT_ENTRY(void, OptoRuntime::multianewarray4_C(Klass* elem_type, int len1, int len2, int len3, int len4, JavaThread *thread))
379 #ifndef PRODUCT
380 SharedRuntime::_multi4_ctr++; // multianewarray for 1 dimension
381 #endif
382 assert(check_compiled_frame(thread), "incorrect caller");
383 assert(elem_type->is_klass(), "not a class");
384 jint dims[4];
385 dims[0] = len1;
386 dims[1] = len2;
387 dims[2] = len3;
388 dims[3] = len4;
389 oop obj = ArrayKlass::cast(elem_type)->multi_allocate(4, dims, THREAD);
390 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
391 thread->set_vm_result(obj);
392 JRT_END
393
394 // multianewarray for 5 dimensions
395 JRT_ENTRY(void, OptoRuntime::multianewarray5_C(Klass* elem_type, int len1, int len2, int len3, int len4, int len5, JavaThread *thread))
396 #ifndef PRODUCT
397 SharedRuntime::_multi5_ctr++; // multianewarray for 1 dimension
398 #endif
399 assert(check_compiled_frame(thread), "incorrect caller");
400 assert(elem_type->is_klass(), "not a class");
401 jint dims[5];
402 dims[0] = len1;
403 dims[1] = len2;
404 dims[2] = len3;
405 dims[3] = len4;
406 dims[4] = len5;
407 oop obj = ArrayKlass::cast(elem_type)->multi_allocate(5, dims, THREAD);
408 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
409 thread->set_vm_result(obj);
410 JRT_END
411
412 JRT_ENTRY(void, OptoRuntime::multianewarrayN_C(Klass* elem_type, arrayOopDesc* dims, JavaThread *thread))
413 assert(check_compiled_frame(thread), "incorrect caller");
414 assert(elem_type->is_klass(), "not a class");
415 assert(oop(dims)->is_typeArray(), "not an array");
416
417 ResourceMark rm;
418 jint len = dims->length();
419 assert(len > 0, "Dimensions array should contain data");
420 jint *j_dims = typeArrayOop(dims)->int_at_addr(0);
421 jint *c_dims = NEW_RESOURCE_ARRAY(jint, len);
422 Copy::conjoint_jints_atomic(j_dims, c_dims, len);
423
424 oop obj = ArrayKlass::cast(elem_type)->multi_allocate(len, c_dims, THREAD);
425 deoptimize_caller_frame(thread, HAS_PENDING_EXCEPTION);
426 thread->set_vm_result(obj);
427 JRT_END
428
429
430 const TypeFunc *OptoRuntime::new_instance_Type() {
431 // create input type (domain)
432 const Type **fields = TypeTuple::fields(1);
433 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
434 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
435
436 // create result type (range)
437 fields = TypeTuple::fields(1);
438 fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
439
440 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
441
442 return TypeFunc::make(domain, range);
443 }
444
445
446 const TypeFunc *OptoRuntime::athrow_Type() {
447 // create input type (domain)
448 const Type **fields = TypeTuple::fields(1);
449 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Klass to be allocated
450 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
451
452 // create result type (range)
453 fields = TypeTuple::fields(0);
454
455 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
456
457 return TypeFunc::make(domain, range);
458 }
459
460
461 const TypeFunc *OptoRuntime::new_array_Type() {
462 // create input type (domain)
463 const Type **fields = TypeTuple::fields(2);
464 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // element klass
465 fields[TypeFunc::Parms+1] = TypeInt::INT; // array size
466 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
467
468 // create result type (range)
469 fields = TypeTuple::fields(1);
470 fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
471
472 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
473
474 return TypeFunc::make(domain, range);
475 }
476
477 const TypeFunc *OptoRuntime::multianewarray_Type(int ndim) {
478 // create input type (domain)
479 const int nargs = ndim + 1;
480 const Type **fields = TypeTuple::fields(nargs);
481 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // element klass
482 for( int i = 1; i < nargs; i++ )
483 fields[TypeFunc::Parms + i] = TypeInt::INT; // array size
484 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+nargs, fields);
485
486 // create result type (range)
487 fields = TypeTuple::fields(1);
488 fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
489 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
490
491 return TypeFunc::make(domain, range);
492 }
493
494 const TypeFunc *OptoRuntime::multianewarray2_Type() {
495 return multianewarray_Type(2);
496 }
497
498 const TypeFunc *OptoRuntime::multianewarray3_Type() {
499 return multianewarray_Type(3);
500 }
501
502 const TypeFunc *OptoRuntime::multianewarray4_Type() {
503 return multianewarray_Type(4);
504 }
505
506 const TypeFunc *OptoRuntime::multianewarray5_Type() {
507 return multianewarray_Type(5);
508 }
509
510 const TypeFunc *OptoRuntime::multianewarrayN_Type() {
511 // create input type (domain)
512 const Type **fields = TypeTuple::fields(2);
513 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // element klass
514 fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL; // array of dim sizes
515 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
516
517 // create result type (range)
518 fields = TypeTuple::fields(1);
519 fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Returned oop
520 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
521
522 return TypeFunc::make(domain, range);
523 }
524
525 const TypeFunc *OptoRuntime::g1_wb_pre_Type() {
526 const Type **fields = TypeTuple::fields(2);
527 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
528 fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL; // thread
529 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
530
531 // create result type (range)
532 fields = TypeTuple::fields(0);
533 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
534
535 return TypeFunc::make(domain, range);
536 }
537
538 const TypeFunc *OptoRuntime::g1_wb_post_Type() {
539
540 const Type **fields = TypeTuple::fields(2);
541 fields[TypeFunc::Parms+0] = TypeRawPtr::NOTNULL; // Card addr
542 fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL; // thread
543 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
544
545 // create result type (range)
546 fields = TypeTuple::fields(0);
547 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
548
549 return TypeFunc::make(domain, range);
550 }
551
552 const TypeFunc *OptoRuntime::uncommon_trap_Type() {
553 // create input type (domain)
554 const Type **fields = TypeTuple::fields(1);
555 fields[TypeFunc::Parms+0] = TypeInt::INT; // trap_reason (deopt reason and action)
556 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
557
558 // create result type (range)
559 fields = TypeTuple::fields(0);
560 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
561
562 return TypeFunc::make(domain, range);
563 }
564
565 # ifdef ENABLE_ZAP_DEAD_LOCALS
566 // Type used for stub generation for zap_dead_locals.
567 // No inputs or outputs
568 const TypeFunc *OptoRuntime::zap_dead_locals_Type() {
569 // create input type (domain)
570 const Type **fields = TypeTuple::fields(0);
571 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms,fields);
572
573 // create result type (range)
574 fields = TypeTuple::fields(0);
575 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms,fields);
576
577 return TypeFunc::make(domain,range);
578 }
579 # endif
580
581
582 //-----------------------------------------------------------------------------
583 // Monitor Handling
584 const TypeFunc *OptoRuntime::complete_monitor_enter_Type() {
585 // create input type (domain)
586 const Type **fields = TypeTuple::fields(2);
587 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Object to be Locked
588 fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // Address of stack location for lock
589 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
590
591 // create result type (range)
592 fields = TypeTuple::fields(0);
593
594 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
595
596 return TypeFunc::make(domain,range);
597 }
598
599
600 //-----------------------------------------------------------------------------
601 const TypeFunc *OptoRuntime::complete_monitor_exit_Type() {
602 // create input type (domain)
603 const Type **fields = TypeTuple::fields(3);
604 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Object to be Locked
605 fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM; // Address of stack location for lock - BasicLock
606 fields[TypeFunc::Parms+2] = TypeRawPtr::BOTTOM; // Thread pointer (Self)
607 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+3,fields);
608
609 // create result type (range)
610 fields = TypeTuple::fields(0);
611
612 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
613
614 return TypeFunc::make(domain,range);
615 }
616
617 const TypeFunc* OptoRuntime::flush_windows_Type() {
618 // create input type (domain)
619 const Type** fields = TypeTuple::fields(1);
620 fields[TypeFunc::Parms+0] = NULL; // void
621 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms, fields);
622
623 // create result type
624 fields = TypeTuple::fields(1);
625 fields[TypeFunc::Parms+0] = NULL; // void
626 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
627
628 return TypeFunc::make(domain, range);
629 }
630
631 const TypeFunc* OptoRuntime::l2f_Type() {
632 // create input type (domain)
633 const Type **fields = TypeTuple::fields(2);
634 fields[TypeFunc::Parms+0] = TypeLong::LONG;
635 fields[TypeFunc::Parms+1] = Type::HALF;
636 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
637
638 // create result type (range)
639 fields = TypeTuple::fields(1);
640 fields[TypeFunc::Parms+0] = Type::FLOAT;
641 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
642
643 return TypeFunc::make(domain, range);
644 }
645
646 const TypeFunc* OptoRuntime::modf_Type() {
647 const Type **fields = TypeTuple::fields(2);
648 fields[TypeFunc::Parms+0] = Type::FLOAT;
649 fields[TypeFunc::Parms+1] = Type::FLOAT;
650 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
651
652 // create result type (range)
653 fields = TypeTuple::fields(1);
654 fields[TypeFunc::Parms+0] = Type::FLOAT;
655
656 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
657
658 return TypeFunc::make(domain, range);
659 }
660
661 const TypeFunc *OptoRuntime::Math_D_D_Type() {
662 // create input type (domain)
663 const Type **fields = TypeTuple::fields(2);
664 // Symbol* name of class to be loaded
665 fields[TypeFunc::Parms+0] = Type::DOUBLE;
666 fields[TypeFunc::Parms+1] = Type::HALF;
667 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
668
669 // create result type (range)
670 fields = TypeTuple::fields(2);
671 fields[TypeFunc::Parms+0] = Type::DOUBLE;
672 fields[TypeFunc::Parms+1] = Type::HALF;
673 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
674
675 return TypeFunc::make(domain, range);
676 }
677
678 const TypeFunc* OptoRuntime::Math_DD_D_Type() {
679 const Type **fields = TypeTuple::fields(4);
680 fields[TypeFunc::Parms+0] = Type::DOUBLE;
681 fields[TypeFunc::Parms+1] = Type::HALF;
682 fields[TypeFunc::Parms+2] = Type::DOUBLE;
683 fields[TypeFunc::Parms+3] = Type::HALF;
684 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+4, fields);
685
686 // create result type (range)
687 fields = TypeTuple::fields(2);
688 fields[TypeFunc::Parms+0] = Type::DOUBLE;
689 fields[TypeFunc::Parms+1] = Type::HALF;
690 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
691
692 return TypeFunc::make(domain, range);
693 }
694
695 //-------------- currentTimeMillis, currentTimeNanos, etc
696
697 const TypeFunc* OptoRuntime::void_long_Type() {
698 // create input type (domain)
699 const Type **fields = TypeTuple::fields(0);
700 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+0, fields);
701
702 // create result type (range)
703 fields = TypeTuple::fields(2);
704 fields[TypeFunc::Parms+0] = TypeLong::LONG;
705 fields[TypeFunc::Parms+1] = Type::HALF;
706 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+2, fields);
707
708 return TypeFunc::make(domain, range);
709 }
710
711 // arraycopy stub variations:
712 enum ArrayCopyType {
713 ac_fast, // void(ptr, ptr, size_t)
714 ac_checkcast, // int(ptr, ptr, size_t, size_t, ptr)
715 ac_slow, // void(ptr, int, ptr, int, int)
716 ac_generic // int(ptr, int, ptr, int, int)
717 };
718
719 static const TypeFunc* make_arraycopy_Type(ArrayCopyType act) {
720 // create input type (domain)
721 int num_args = (act == ac_fast ? 3 : 5);
722 int num_size_args = (act == ac_fast ? 1 : act == ac_checkcast ? 2 : 0);
723 int argcnt = num_args;
724 LP64_ONLY(argcnt += num_size_args); // halfwords for lengths
725 const Type** fields = TypeTuple::fields(argcnt);
726 int argp = TypeFunc::Parms;
727 fields[argp++] = TypePtr::NOTNULL; // src
728 if (num_size_args == 0) {
729 fields[argp++] = TypeInt::INT; // src_pos
730 }
731 fields[argp++] = TypePtr::NOTNULL; // dest
732 if (num_size_args == 0) {
733 fields[argp++] = TypeInt::INT; // dest_pos
734 fields[argp++] = TypeInt::INT; // length
735 }
736 while (num_size_args-- > 0) {
737 fields[argp++] = TypeX_X; // size in whatevers (size_t)
738 LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
739 }
740 if (act == ac_checkcast) {
741 fields[argp++] = TypePtr::NOTNULL; // super_klass
742 }
743 assert(argp == TypeFunc::Parms+argcnt, "correct decoding of act");
744 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
745
746 // create result type if needed
747 int retcnt = (act == ac_checkcast || act == ac_generic ? 1 : 0);
748 fields = TypeTuple::fields(1);
749 if (retcnt == 0)
750 fields[TypeFunc::Parms+0] = NULL; // void
751 else
752 fields[TypeFunc::Parms+0] = TypeInt::INT; // status result, if needed
753 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+retcnt, fields);
754 return TypeFunc::make(domain, range);
755 }
756
757 const TypeFunc* OptoRuntime::fast_arraycopy_Type() {
758 // This signature is simple: Two base pointers and a size_t.
759 return make_arraycopy_Type(ac_fast);
760 }
761
762 const TypeFunc* OptoRuntime::checkcast_arraycopy_Type() {
763 // An extension of fast_arraycopy_Type which adds type checking.
764 return make_arraycopy_Type(ac_checkcast);
765 }
766
767 const TypeFunc* OptoRuntime::slow_arraycopy_Type() {
768 // This signature is exactly the same as System.arraycopy.
769 // There are no intptr_t (int/long) arguments.
770 return make_arraycopy_Type(ac_slow);
771 }
772
773 const TypeFunc* OptoRuntime::generic_arraycopy_Type() {
774 // This signature is like System.arraycopy, except that it returns status.
775 return make_arraycopy_Type(ac_generic);
776 }
777
778
779 const TypeFunc* OptoRuntime::array_fill_Type() {
780 const Type** fields;
781 int argp = TypeFunc::Parms;
782 if (CCallingConventionRequiresIntsAsLongs) {
783 // create input type (domain): pointer, int, size_t
784 fields = TypeTuple::fields(3 LP64_ONLY( + 2));
785 fields[argp++] = TypePtr::NOTNULL;
786 fields[argp++] = TypeLong::LONG;
787 fields[argp++] = Type::HALF;
788 } else {
789 // create input type (domain): pointer, int, size_t
790 fields = TypeTuple::fields(3 LP64_ONLY( + 1));
791 fields[argp++] = TypePtr::NOTNULL;
792 fields[argp++] = TypeInt::INT;
793 }
794 fields[argp++] = TypeX_X; // size in whatevers (size_t)
795 LP64_ONLY(fields[argp++] = Type::HALF); // other half of long length
796 const TypeTuple *domain = TypeTuple::make(argp, fields);
797
798 // create result type
799 fields = TypeTuple::fields(1);
800 fields[TypeFunc::Parms+0] = NULL; // void
801 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
802
803 return TypeFunc::make(domain, range);
804 }
805
806 // for aescrypt encrypt/decrypt operations, just three pointers returning void (length is constant)
807 const TypeFunc* OptoRuntime::aescrypt_block_Type() {
808 // create input type (domain)
809 int num_args = 3;
810 if (Matcher::pass_original_key_for_aes()) {
811 num_args = 4;
812 }
813 int argcnt = num_args;
814 const Type** fields = TypeTuple::fields(argcnt);
815 int argp = TypeFunc::Parms;
816 fields[argp++] = TypePtr::NOTNULL; // src
817 fields[argp++] = TypePtr::NOTNULL; // dest
818 fields[argp++] = TypePtr::NOTNULL; // k array
819 if (Matcher::pass_original_key_for_aes()) {
820 fields[argp++] = TypePtr::NOTNULL; // original k array
821 }
822 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
823 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
824
825 // no result type needed
826 fields = TypeTuple::fields(1);
827 fields[TypeFunc::Parms+0] = NULL; // void
828 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
829 return TypeFunc::make(domain, range);
830 }
831
832 /**
833 * int updateBytesCRC32(int crc, byte* b, int len)
834 */
835 const TypeFunc* OptoRuntime::updateBytesCRC32_Type() {
836 // create input type (domain)
837 int num_args = 3;
838 int argcnt = num_args;
839 const Type** fields = TypeTuple::fields(argcnt);
840 int argp = TypeFunc::Parms;
841 fields[argp++] = TypeInt::INT; // crc
842 fields[argp++] = TypePtr::NOTNULL; // src
843 fields[argp++] = TypeInt::INT; // len
844 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
845 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
846
847 // result type needed
848 fields = TypeTuple::fields(1);
849 fields[TypeFunc::Parms+0] = TypeInt::INT; // crc result
850 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
851 return TypeFunc::make(domain, range);
852 }
853
854 // for cipherBlockChaining calls of aescrypt encrypt/decrypt, four pointers and a length, returning int
855 const TypeFunc* OptoRuntime::cipherBlockChaining_aescrypt_Type() {
856 // create input type (domain)
857 int num_args = 5;
858 if (Matcher::pass_original_key_for_aes()) {
859 num_args = 6;
860 }
861 int argcnt = num_args;
862 const Type** fields = TypeTuple::fields(argcnt);
863 int argp = TypeFunc::Parms;
864 fields[argp++] = TypePtr::NOTNULL; // src
865 fields[argp++] = TypePtr::NOTNULL; // dest
866 fields[argp++] = TypePtr::NOTNULL; // k array
867 fields[argp++] = TypePtr::NOTNULL; // r array
868 fields[argp++] = TypeInt::INT; // src len
869 if (Matcher::pass_original_key_for_aes()) {
870 fields[argp++] = TypePtr::NOTNULL; // original k array
871 }
872 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
873 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
874
875 // returning cipher len (int)
876 fields = TypeTuple::fields(1);
877 fields[TypeFunc::Parms+0] = TypeInt::INT;
878 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
879 return TypeFunc::make(domain, range);
880 }
881
882 /*
883 * void implCompress(byte[] buf, int ofs)
884 */
885 const TypeFunc* OptoRuntime::sha_implCompress_Type() {
886 // create input type (domain)
887 int num_args = 2;
888 int argcnt = num_args;
889 const Type** fields = TypeTuple::fields(argcnt);
890 int argp = TypeFunc::Parms;
891 fields[argp++] = TypePtr::NOTNULL; // buf
892 fields[argp++] = TypePtr::NOTNULL; // state
893 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
894 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
895
896 // no result type needed
897 fields = TypeTuple::fields(1);
898 fields[TypeFunc::Parms+0] = NULL; // void
899 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
900 return TypeFunc::make(domain, range);
901 }
902
903 /*
904 * int implCompressMultiBlock(byte[] b, int ofs, int limit)
905 */
906 const TypeFunc* OptoRuntime::digestBase_implCompressMB_Type() {
907 // create input type (domain)
908 int num_args = 4;
909 int argcnt = num_args;
910 const Type** fields = TypeTuple::fields(argcnt);
911 int argp = TypeFunc::Parms;
912 fields[argp++] = TypePtr::NOTNULL; // buf
913 fields[argp++] = TypePtr::NOTNULL; // state
914 fields[argp++] = TypeInt::INT; // ofs
915 fields[argp++] = TypeInt::INT; // limit
916 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
917 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
918
919 // returning ofs (int)
920 fields = TypeTuple::fields(1);
921 fields[TypeFunc::Parms+0] = TypeInt::INT; // ofs
922 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
923 return TypeFunc::make(domain, range);
924 }
925
926 const TypeFunc* OptoRuntime::multiplyToLen_Type() {
927 // create input type (domain)
928 int num_args = 6;
929 int argcnt = num_args;
930 const Type** fields = TypeTuple::fields(argcnt);
931 int argp = TypeFunc::Parms;
932 fields[argp++] = TypePtr::NOTNULL; // x
933 fields[argp++] = TypeInt::INT; // xlen
934 fields[argp++] = TypePtr::NOTNULL; // y
935 fields[argp++] = TypeInt::INT; // ylen
936 fields[argp++] = TypePtr::NOTNULL; // z
937 fields[argp++] = TypeInt::INT; // zlen
938 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
939 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
940
941 // no result type needed
942 fields = TypeTuple::fields(1);
943 fields[TypeFunc::Parms+0] = NULL;
944 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
945 return TypeFunc::make(domain, range);
946 }
947
948 const TypeFunc* OptoRuntime::squareToLen_Type() {
949 // create input type (domain)
950 int num_args = 4;
951 int argcnt = num_args;
952 const Type** fields = TypeTuple::fields(argcnt);
953 int argp = TypeFunc::Parms;
954 fields[argp++] = TypePtr::NOTNULL; // x
955 fields[argp++] = TypeInt::INT; // len
956 fields[argp++] = TypePtr::NOTNULL; // z
957 fields[argp++] = TypeInt::INT; // zlen
958 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
959 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
960
961 // no result type needed
962 fields = TypeTuple::fields(1);
963 fields[TypeFunc::Parms+0] = NULL;
964 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms, fields);
965 return TypeFunc::make(domain, range);
966 }
967
968 // for mulAdd calls, 2 pointers and 3 ints, returning int
969 const TypeFunc* OptoRuntime::mulAdd_Type() {
970 // create input type (domain)
971 int num_args = 5;
972 int argcnt = num_args;
973 const Type** fields = TypeTuple::fields(argcnt);
974 int argp = TypeFunc::Parms;
975 fields[argp++] = TypePtr::NOTNULL; // out
976 fields[argp++] = TypePtr::NOTNULL; // in
977 fields[argp++] = TypeInt::INT; // offset
978 fields[argp++] = TypeInt::INT; // len
979 fields[argp++] = TypeInt::INT; // k
980 assert(argp == TypeFunc::Parms+argcnt, "correct decoding");
981 const TypeTuple* domain = TypeTuple::make(TypeFunc::Parms+argcnt, fields);
982
983 // returning carry (int)
984 fields = TypeTuple::fields(1);
985 fields[TypeFunc::Parms+0] = TypeInt::INT;
986 const TypeTuple* range = TypeTuple::make(TypeFunc::Parms+1, fields);
987 return TypeFunc::make(domain, range);
988 }
989
990
991
992 //------------- Interpreter state access for on stack replacement
993 const TypeFunc* OptoRuntime::osr_end_Type() {
994 // create input type (domain)
995 const Type **fields = TypeTuple::fields(1);
996 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // OSR temp buf
997 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
998
999 // create result type
1000 fields = TypeTuple::fields(1);
1001 // fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // locked oop
1002 fields[TypeFunc::Parms+0] = NULL; // void
1003 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
1004 return TypeFunc::make(domain, range);
1005 }
1006
1007 //-------------- methodData update helpers
1008
1009 const TypeFunc* OptoRuntime::profile_receiver_type_Type() {
1010 // create input type (domain)
1011 const Type **fields = TypeTuple::fields(2);
1012 fields[TypeFunc::Parms+0] = TypeAryPtr::NOTNULL; // methodData pointer
1013 fields[TypeFunc::Parms+1] = TypeInstPtr::BOTTOM; // receiver oop
1014 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
1015
1016 // create result type
1017 fields = TypeTuple::fields(1);
1018 fields[TypeFunc::Parms+0] = NULL; // void
1019 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms, fields);
1020 return TypeFunc::make(domain,range);
1021 }
1022
1023 JRT_LEAF(void, OptoRuntime::profile_receiver_type_C(DataLayout* data, oopDesc* receiver))
1024 if (receiver == NULL) return;
1025 Klass* receiver_klass = receiver->klass();
1026
1027 intptr_t* mdp = ((intptr_t*)(data)) + DataLayout::header_size_in_cells();
1028 int empty_row = -1; // free row, if any is encountered
1029
1030 // ReceiverTypeData* vc = new ReceiverTypeData(mdp);
1031 for (uint row = 0; row < ReceiverTypeData::row_limit(); row++) {
1032 // if (vc->receiver(row) == receiver_klass)
1033 int receiver_off = ReceiverTypeData::receiver_cell_index(row);
1034 intptr_t row_recv = *(mdp + receiver_off);
1035 if (row_recv == (intptr_t) receiver_klass) {
1036 // vc->set_receiver_count(row, vc->receiver_count(row) + DataLayout::counter_increment);
1037 int count_off = ReceiverTypeData::receiver_count_cell_index(row);
1038 *(mdp + count_off) += DataLayout::counter_increment;
1039 return;
1040 } else if (row_recv == 0) {
1041 // else if (vc->receiver(row) == NULL)
1042 empty_row = (int) row;
1043 }
1044 }
1045
1046 if (empty_row != -1) {
1047 int receiver_off = ReceiverTypeData::receiver_cell_index(empty_row);
1048 // vc->set_receiver(empty_row, receiver_klass);
1049 *(mdp + receiver_off) = (intptr_t) receiver_klass;
1050 // vc->set_receiver_count(empty_row, DataLayout::counter_increment);
1051 int count_off = ReceiverTypeData::receiver_count_cell_index(empty_row);
1052 *(mdp + count_off) = DataLayout::counter_increment;
1053 } else {
1054 // Receiver did not match any saved receiver and there is no empty row for it.
1055 // Increment total counter to indicate polymorphic case.
1056 intptr_t* count_p = (intptr_t*)(((uint8_t*)(data)) + in_bytes(CounterData::count_offset()));
1057 *count_p += DataLayout::counter_increment;
1058 }
1059 JRT_END
1060
1061 //-------------------------------------------------------------------------------------
1062 // register policy
1063
1064 bool OptoRuntime::is_callee_saved_register(MachRegisterNumbers reg) {
1065 assert(reg >= 0 && reg < _last_Mach_Reg, "must be a machine register");
1066 switch (register_save_policy[reg]) {
1067 case 'C': return false; //SOC
1068 case 'E': return true ; //SOE
1069 case 'N': return false; //NS
1070 case 'A': return false; //AS
1071 }
1072 ShouldNotReachHere();
1073 return false;
1074 }
1075
1076 //-----------------------------------------------------------------------
1077 // Exceptions
1078 //
1079
1080 static void trace_exception(oop exception_oop, address exception_pc, const char* msg) PRODUCT_RETURN;
1081
1082 // The method is an entry that is always called by a C++ method not
1083 // directly from compiled code. Compiled code will call the C++ method following.
1084 // We can't allow async exception to be installed during exception processing.
1085 JRT_ENTRY_NO_ASYNC(address, OptoRuntime::handle_exception_C_helper(JavaThread* thread, nmethod* &nm))
1086
1087 // Do not confuse exception_oop with pending_exception. The exception_oop
1088 // is only used to pass arguments into the method. Not for general
1089 // exception handling. DO NOT CHANGE IT to use pending_exception, since
1090 // the runtime stubs checks this on exit.
1091 assert(thread->exception_oop() != NULL, "exception oop is found");
1092 address handler_address = NULL;
1093
1094 Handle exception(thread, thread->exception_oop());
1095 address pc = thread->exception_pc();
1096
1097 // Clear out the exception oop and pc since looking up an
1098 // exception handler can cause class loading, which might throw an
1099 // exception and those fields are expected to be clear during
1100 // normal bytecode execution.
1101 thread->clear_exception_oop_and_pc();
1102
1103 if (TraceExceptions) {
1104 trace_exception(exception(), pc, "");
1105 }
1106
1107 // for AbortVMOnException flag
1108 NOT_PRODUCT(Exceptions::debug_check_abort(exception));
1109
1110 #ifdef ASSERT
1111 if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
1112 // should throw an exception here
1113 ShouldNotReachHere();
1114 }
1115 #endif
1116
1117 // new exception handling: this method is entered only from adapters
1118 // exceptions from compiled java methods are handled in compiled code
1119 // using rethrow node
1120
1121 nm = CodeCache::find_nmethod(pc);
1122 assert(nm != NULL, "No NMethod found");
1123 if (nm->is_native_method()) {
1124 fatal("Native method should not have path to exception handling");
1125 } else {
1126 // we are switching to old paradigm: search for exception handler in caller_frame
1127 // instead in exception handler of caller_frame.sender()
1128
1129 if (JvmtiExport::can_post_on_exceptions()) {
1130 // "Full-speed catching" is not necessary here,
1131 // since we're notifying the VM on every catch.
1132 // Force deoptimization and the rest of the lookup
1133 // will be fine.
1134 deoptimize_caller_frame(thread);
1135 }
1136
1137 // Check the stack guard pages. If enabled, look for handler in this frame;
1138 // otherwise, forcibly unwind the frame.
1139 //
1140 // 4826555: use default current sp for reguard_stack instead of &nm: it's more accurate.
1141 bool force_unwind = !thread->reguard_stack();
1142 bool deopting = false;
1143 if (nm->is_deopt_pc(pc)) {
1144 deopting = true;
1145 RegisterMap map(thread, false);
1146 frame deoptee = thread->last_frame().sender(&map);
1147 assert(deoptee.is_deoptimized_frame(), "must be deopted");
1148 // Adjust the pc back to the original throwing pc
1149 pc = deoptee.pc();
1150 }
1151
1152 // If we are forcing an unwind because of stack overflow then deopt is
1153 // irrelevant since we are throwing the frame away anyway.
1154
1155 if (deopting && !force_unwind) {
1156 handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1157 } else {
1158
1159 handler_address =
1160 force_unwind ? NULL : nm->handler_for_exception_and_pc(exception, pc);
1161
1162 if (handler_address == NULL) {
1163 Handle original_exception(thread, exception());
1164 handler_address = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true);
1165 assert (handler_address != NULL, "must have compiled handler");
1166 // Update the exception cache only when the unwind was not forced
1167 // and there didn't happen another exception during the computation of the
1168 // compiled exception handler.
1169 if (!force_unwind && original_exception() == exception()) {
1170 nm->add_handler_for_exception_and_pc(exception,pc,handler_address);
1171 }
1172 } else {
1173 assert(handler_address == SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, force_unwind, true), "Must be the same");
1174 }
1175 }
1176
1177 thread->set_exception_pc(pc);
1178 thread->set_exception_handler_pc(handler_address);
1179
1180 // Check if the exception PC is a MethodHandle call site.
1181 thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
1182 }
1183
1184 // Restore correct return pc. Was saved above.
1185 thread->set_exception_oop(exception());
1186 return handler_address;
1187
1188 JRT_END
1189
1190 // We are entering here from exception_blob
1191 // If there is a compiled exception handler in this method, we will continue there;
1192 // otherwise we will unwind the stack and continue at the caller of top frame method
1193 // Note we enter without the usual JRT wrapper. We will call a helper routine that
1194 // will do the normal VM entry. We do it this way so that we can see if the nmethod
1195 // we looked up the handler for has been deoptimized in the meantime. If it has been
1196 // we must not use the handler and instead return the deopt blob.
1197 address OptoRuntime::handle_exception_C(JavaThread* thread) {
1198 //
1199 // We are in Java not VM and in debug mode we have a NoHandleMark
1200 //
1201 #ifndef PRODUCT
1202 SharedRuntime::_find_handler_ctr++; // find exception handler
1203 #endif
1204 debug_only(NoHandleMark __hm;)
1205 nmethod* nm = NULL;
1206 address handler_address = NULL;
1207 {
1208 // Enter the VM
1209
1210 ResetNoHandleMark rnhm;
1211 handler_address = handle_exception_C_helper(thread, nm);
1212 }
1213
1214 // Back in java: Use no oops, DON'T safepoint
1215
1216 // Now check to see if the handler we are returning is in a now
1217 // deoptimized frame
1218
1219 if (nm != NULL) {
1220 RegisterMap map(thread, false);
1221 frame caller = thread->last_frame().sender(&map);
1222 #ifdef ASSERT
1223 assert(caller.is_compiled_frame(), "must be");
1224 #endif // ASSERT
1225 if (caller.is_deoptimized_frame()) {
1226 handler_address = SharedRuntime::deopt_blob()->unpack_with_exception();
1227 }
1228 }
1229 return handler_address;
1230 }
1231
1232 //------------------------------rethrow----------------------------------------
1233 // We get here after compiled code has executed a 'RethrowNode'. The callee
1234 // is either throwing or rethrowing an exception. The callee-save registers
1235 // have been restored, synchronized objects have been unlocked and the callee
1236 // stack frame has been removed. The return address was passed in.
1237 // Exception oop is passed as the 1st argument. This routine is then called
1238 // from the stub. On exit, we know where to jump in the caller's code.
1239 // After this C code exits, the stub will pop his frame and end in a jump
1240 // (instead of a return). We enter the caller's default handler.
1241 //
1242 // This must be JRT_LEAF:
1243 // - caller will not change its state as we cannot block on exit,
1244 // therefore raw_exception_handler_for_return_address is all it takes
1245 // to handle deoptimized blobs
1246 //
1247 // However, there needs to be a safepoint check in the middle! So compiled
1248 // safepoints are completely watertight.
1249 //
1250 // Thus, it cannot be a leaf since it contains the No_GC_Verifier.
1251 //
1252 // *THIS IS NOT RECOMMENDED PROGRAMMING STYLE*
1253 //
1254 address OptoRuntime::rethrow_C(oopDesc* exception, JavaThread* thread, address ret_pc) {
1255 #ifndef PRODUCT
1256 SharedRuntime::_rethrow_ctr++; // count rethrows
1257 #endif
1258 assert (exception != NULL, "should have thrown a NULLPointerException");
1259 #ifdef ASSERT
1260 if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
1261 // should throw an exception here
1262 ShouldNotReachHere();
1263 }
1264 #endif
1265
1266 thread->set_vm_result(exception);
1267 // Frame not compiled (handles deoptimization blob)
1268 return SharedRuntime::raw_exception_handler_for_return_address(thread, ret_pc);
1269 }
1270
1271
1272 const TypeFunc *OptoRuntime::rethrow_Type() {
1273 // create input type (domain)
1274 const Type **fields = TypeTuple::fields(1);
1275 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1276 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1277
1278 // create result type (range)
1279 fields = TypeTuple::fields(1);
1280 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // Exception oop
1281 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
1282
1283 return TypeFunc::make(domain, range);
1284 }
1285
1286
1287 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread, bool doit) {
1288 // Deoptimize the caller before continuing, as the compiled
1289 // exception handler table may not be valid.
1290 if (!StressCompiledExceptionHandlers && doit) {
1291 deoptimize_caller_frame(thread);
1292 }
1293 }
1294
1295 void OptoRuntime::deoptimize_caller_frame(JavaThread *thread) {
1296 // Called from within the owner thread, so no need for safepoint
1297 RegisterMap reg_map(thread);
1298 frame stub_frame = thread->last_frame();
1299 assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1300 frame caller_frame = stub_frame.sender(®_map);
1301
1302 // Deoptimize the caller frame.
1303 Deoptimization::deoptimize_frame(thread, caller_frame.id());
1304 }
1305
1306
1307 bool OptoRuntime::is_deoptimized_caller_frame(JavaThread *thread) {
1308 // Called from within the owner thread, so no need for safepoint
1309 RegisterMap reg_map(thread);
1310 frame stub_frame = thread->last_frame();
1311 assert(stub_frame.is_runtime_frame() || exception_blob()->contains(stub_frame.pc()), "sanity check");
1312 frame caller_frame = stub_frame.sender(®_map);
1313 return caller_frame.is_deoptimized_frame();
1314 }
1315
1316
1317 const TypeFunc *OptoRuntime::register_finalizer_Type() {
1318 // create input type (domain)
1319 const Type **fields = TypeTuple::fields(1);
1320 fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // oop; Receiver
1321 // // The JavaThread* is passed to each routine as the last argument
1322 // fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL; // JavaThread *; Executing thread
1323 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1,fields);
1324
1325 // create result type (range)
1326 fields = TypeTuple::fields(0);
1327
1328 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1329
1330 return TypeFunc::make(domain,range);
1331 }
1332
1333
1334 //-----------------------------------------------------------------------------
1335 // Dtrace support. entry and exit probes have the same signature
1336 const TypeFunc *OptoRuntime::dtrace_method_entry_exit_Type() {
1337 // create input type (domain)
1338 const Type **fields = TypeTuple::fields(2);
1339 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1340 fields[TypeFunc::Parms+1] = TypeMetadataPtr::BOTTOM; // Method*; Method we are entering
1341 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1342
1343 // create result type (range)
1344 fields = TypeTuple::fields(0);
1345
1346 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1347
1348 return TypeFunc::make(domain,range);
1349 }
1350
1351 const TypeFunc *OptoRuntime::dtrace_object_alloc_Type() {
1352 // create input type (domain)
1353 const Type **fields = TypeTuple::fields(2);
1354 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // Thread-local storage
1355 fields[TypeFunc::Parms+1] = TypeInstPtr::NOTNULL; // oop; newly allocated object
1356
1357 const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2,fields);
1358
1359 // create result type (range)
1360 fields = TypeTuple::fields(0);
1361
1362 const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0,fields);
1363
1364 return TypeFunc::make(domain,range);
1365 }
1366
1367
1368 JRT_ENTRY_NO_ASYNC(void, OptoRuntime::register_finalizer(oopDesc* obj, JavaThread* thread))
1369 assert(obj->is_oop(), "must be a valid oop");
1370 assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
1371 InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
1372 JRT_END
1373
1374 //-----------------------------------------------------------------------------
1375
1376 NamedCounter * volatile OptoRuntime::_named_counters = NULL;
1377
1378 //
1379 // dump the collected NamedCounters.
1380 //
1381 void OptoRuntime::print_named_counters() {
1382 int total_lock_count = 0;
1383 int eliminated_lock_count = 0;
1384
1385 NamedCounter* c = _named_counters;
1386 while (c) {
1387 if (c->tag() == NamedCounter::LockCounter || c->tag() == NamedCounter::EliminatedLockCounter) {
1388 int count = c->count();
1389 if (count > 0) {
1390 bool eliminated = c->tag() == NamedCounter::EliminatedLockCounter;
1391 if (Verbose) {
1392 tty->print_cr("%d %s%s", count, c->name(), eliminated ? " (eliminated)" : "");
1393 }
1394 total_lock_count += count;
1395 if (eliminated) {
1396 eliminated_lock_count += count;
1397 }
1398 }
1399 } else if (c->tag() == NamedCounter::BiasedLockingCounter) {
1400 BiasedLockingCounters* blc = ((BiasedLockingNamedCounter*)c)->counters();
1401 if (blc->nonzero()) {
1402 tty->print_cr("%s", c->name());
1403 blc->print_on(tty);
1404 }
1405 #if INCLUDE_RTM_OPT
1406 } else if (c->tag() == NamedCounter::RTMLockingCounter) {
1407 RTMLockingCounters* rlc = ((RTMLockingNamedCounter*)c)->counters();
1408 if (rlc->nonzero()) {
1409 tty->print_cr("%s", c->name());
1410 rlc->print_on(tty);
1411 }
1412 #endif
1413 }
1414 c = c->next();
1415 }
1416 if (total_lock_count > 0) {
1417 tty->print_cr("dynamic locks: %d", total_lock_count);
1418 if (eliminated_lock_count) {
1419 tty->print_cr("eliminated locks: %d (%d%%)", eliminated_lock_count,
1420 (int)(eliminated_lock_count * 100.0 / total_lock_count));
1421 }
1422 }
1423 }
1424
1425 //
1426 // Allocate a new NamedCounter. The JVMState is used to generate the
1427 // name which consists of method@line for the inlining tree.
1428 //
1429
1430 NamedCounter* OptoRuntime::new_named_counter(JVMState* youngest_jvms, NamedCounter::CounterTag tag) {
1431 int max_depth = youngest_jvms->depth();
1432
1433 // Visit scopes from youngest to oldest.
1434 bool first = true;
1435 stringStream st;
1436 for (int depth = max_depth; depth >= 1; depth--) {
1437 JVMState* jvms = youngest_jvms->of_depth(depth);
1438 ciMethod* m = jvms->has_method() ? jvms->method() : NULL;
1439 if (!first) {
1440 st.print(" ");
1441 } else {
1442 first = false;
1443 }
1444 int bci = jvms->bci();
1445 if (bci < 0) bci = 0;
1446 st.print("%s.%s@%d", m->holder()->name()->as_utf8(), m->name()->as_utf8(), bci);
1447 // To print linenumbers instead of bci use: m->line_number_from_bci(bci)
1448 }
1449 NamedCounter* c;
1450 if (tag == NamedCounter::BiasedLockingCounter) {
1451 c = new BiasedLockingNamedCounter(st.as_string());
1452 } else if (tag == NamedCounter::RTMLockingCounter) {
1453 c = new RTMLockingNamedCounter(st.as_string());
1454 } else {
1455 c = new NamedCounter(st.as_string(), tag);
1456 }
1457
1458 // atomically add the new counter to the head of the list. We only
1459 // add counters so this is safe.
1460 NamedCounter* head;
1461 do {
1462 c->set_next(NULL);
1463 head = _named_counters;
1464 c->set_next(head);
1465 } while (Atomic::cmpxchg_ptr(c, &_named_counters, head) != head);
1466 return c;
1467 }
1468
1469 //-----------------------------------------------------------------------------
1470 // Non-product code
1471 #ifndef PRODUCT
1472
1473 int trace_exception_counter = 0;
1474 static void trace_exception(oop exception_oop, address exception_pc, const char* msg) {
1475 ttyLocker ttyl;
1476 trace_exception_counter++;
1477 tty->print("%d [Exception (%s): ", trace_exception_counter, msg);
1478 exception_oop->print_value();
1479 tty->print(" in ");
1480 CodeBlob* blob = CodeCache::find_blob(exception_pc);
1481 if (blob->is_nmethod()) {
1482 nmethod* nm = blob->as_nmethod_or_null();
1483 nm->method()->print_value();
1484 } else if (blob->is_runtime_stub()) {
1485 tty->print("<runtime-stub>");
1486 } else {
1487 tty->print("<unknown>");
1488 }
1489 tty->print(" at " INTPTR_FORMAT, p2i(exception_pc));
1490 tty->print_cr("]");
1491 }
1492
1493 #endif // PRODUCT
1494
1495
1496 # ifdef ENABLE_ZAP_DEAD_LOCALS
1497 // Called from call sites in compiled code with oop maps (actually safepoints)
1498 // Zaps dead locals in first java frame.
1499 // Is entry because may need to lock to generate oop maps
1500 // Currently, only used for compiler frames, but someday may be used
1501 // for interpreter frames, too.
1502
1503 int OptoRuntime::ZapDeadCompiledLocals_count = 0;
1504
1505 // avoid pointers to member funcs with these helpers
1506 static bool is_java_frame( frame* f) { return f->is_java_frame(); }
1507 static bool is_native_frame(frame* f) { return f->is_native_frame(); }
1508
1509
1510 void OptoRuntime::zap_dead_java_or_native_locals(JavaThread* thread,
1511 bool (*is_this_the_right_frame_to_zap)(frame*)) {
1512 assert(JavaThread::current() == thread, "is this needed?");
1513
1514 if ( !ZapDeadCompiledLocals ) return;
1515
1516 bool skip = false;
1517
1518 if ( ZapDeadCompiledLocalsFirst == 0 ) ; // nothing special
1519 else if ( ZapDeadCompiledLocalsFirst > ZapDeadCompiledLocals_count ) skip = true;
1520 else if ( ZapDeadCompiledLocalsFirst == ZapDeadCompiledLocals_count )
1521 warning("starting zapping after skipping");
1522
1523 if ( ZapDeadCompiledLocalsLast == -1 ) ; // nothing special
1524 else if ( ZapDeadCompiledLocalsLast < ZapDeadCompiledLocals_count ) skip = true;
1525 else if ( ZapDeadCompiledLocalsLast == ZapDeadCompiledLocals_count )
1526 warning("about to zap last zap");
1527
1528 ++ZapDeadCompiledLocals_count; // counts skipped zaps, too
1529
1530 if ( skip ) return;
1531
1532 // find java frame and zap it
1533
1534 for (StackFrameStream sfs(thread); !sfs.is_done(); sfs.next()) {
1535 if (is_this_the_right_frame_to_zap(sfs.current()) ) {
1536 sfs.current()->zap_dead_locals(thread, sfs.register_map());
1537 return;
1538 }
1539 }
1540 warning("no frame found to zap in zap_dead_Java_locals_C");
1541 }
1542
1543 JRT_LEAF(void, OptoRuntime::zap_dead_Java_locals_C(JavaThread* thread))
1544 zap_dead_java_or_native_locals(thread, is_java_frame);
1545 JRT_END
1546
1547 // The following does not work because for one thing, the
1548 // thread state is wrong; it expects java, but it is native.
1549 // Also, the invariants in a native stub are different and
1550 // I'm not sure it is safe to have a MachCalRuntimeDirectNode
1551 // in there.
1552 // So for now, we do not zap in native stubs.
1553
1554 JRT_LEAF(void, OptoRuntime::zap_dead_native_locals_C(JavaThread* thread))
1555 zap_dead_java_or_native_locals(thread, is_native_frame);
1556 JRT_END
1557
1558 # endif