Tue, 24 Jul 2012 10:51:00 -0700
7023639: JSR 292 method handle invocation needs a fast path for compiled code
6984705: JSR 292 method handle creation should not go through JNI
Summary: remove assembly code for JDK 7 chained method handles
Reviewed-by: jrose, twisti, kvn, mhaupt
Contributed-by: John Rose <john.r.rose@oracle.com>, Christian Thalinger <christian.thalinger@oracle.com>, Michael Haupt <michael.haupt@oracle.com>
1 /*
2 * Copyright (c) 1997, 2012, 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 */
25 #include "precompiled.hpp"
26 #include "classfile/systemDictionary.hpp"
27 #include "code/debugInfoRec.hpp"
28 #include "gc_interface/collectedHeap.inline.hpp"
29 #include "interpreter/bytecodeStream.hpp"
30 #include "interpreter/bytecodeTracer.hpp"
31 #include "interpreter/bytecodes.hpp"
32 #include "interpreter/interpreter.hpp"
33 #include "interpreter/oopMapCache.hpp"
34 #include "memory/gcLocker.hpp"
35 #include "memory/generation.hpp"
36 #include "memory/oopFactory.hpp"
37 #include "oops/klassOop.hpp"
38 #include "oops/methodDataOop.hpp"
39 #include "oops/methodOop.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/symbol.hpp"
42 #include "prims/jvmtiExport.hpp"
43 #include "prims/methodHandles.hpp"
44 #include "prims/nativeLookup.hpp"
45 #include "runtime/arguments.hpp"
46 #include "runtime/compilationPolicy.hpp"
47 #include "runtime/frame.inline.hpp"
48 #include "runtime/handles.inline.hpp"
49 #include "runtime/relocator.hpp"
50 #include "runtime/sharedRuntime.hpp"
51 #include "runtime/signature.hpp"
52 #include "utilities/quickSort.hpp"
53 #include "utilities/xmlstream.hpp"
56 // Implementation of methodOopDesc
58 address methodOopDesc::get_i2c_entry() {
59 assert(_adapter != NULL, "must have");
60 return _adapter->get_i2c_entry();
61 }
63 address methodOopDesc::get_c2i_entry() {
64 assert(_adapter != NULL, "must have");
65 return _adapter->get_c2i_entry();
66 }
68 address methodOopDesc::get_c2i_unverified_entry() {
69 assert(_adapter != NULL, "must have");
70 return _adapter->get_c2i_unverified_entry();
71 }
73 char* methodOopDesc::name_and_sig_as_C_string() const {
74 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature());
75 }
77 char* methodOopDesc::name_and_sig_as_C_string(char* buf, int size) const {
78 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size);
79 }
81 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) {
82 const char* klass_name = klass->external_name();
83 int klass_name_len = (int)strlen(klass_name);
84 int method_name_len = method_name->utf8_length();
85 int len = klass_name_len + 1 + method_name_len + signature->utf8_length();
86 char* dest = NEW_RESOURCE_ARRAY(char, len + 1);
87 strcpy(dest, klass_name);
88 dest[klass_name_len] = '.';
89 strcpy(&dest[klass_name_len + 1], method_name->as_C_string());
90 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string());
91 dest[len] = 0;
92 return dest;
93 }
95 char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) {
96 Symbol* klass_name = klass->name();
97 klass_name->as_klass_external_name(buf, size);
98 int len = (int)strlen(buf);
100 if (len < size - 1) {
101 buf[len++] = '.';
103 method_name->as_C_string(&(buf[len]), size - len);
104 len = (int)strlen(buf);
106 signature->as_C_string(&(buf[len]), size - len);
107 }
109 return buf;
110 }
112 int methodOopDesc::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) {
113 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index)
114 // access exception table
115 ExceptionTable table(this);
116 int length = table.length();
117 // iterate through all entries sequentially
118 constantPoolHandle pool(THREAD, constants());
119 for (int i = 0; i < length; i ++) {
120 //reacquire the table in case a GC happened
121 ExceptionTable table(this);
122 int beg_bci = table.start_pc(i);
123 int end_bci = table.end_pc(i);
124 assert(beg_bci <= end_bci, "inconsistent exception table");
125 if (beg_bci <= throw_bci && throw_bci < end_bci) {
126 // exception handler bci range covers throw_bci => investigate further
127 int handler_bci = table.handler_pc(i);
128 int klass_index = table.catch_type_index(i);
129 if (klass_index == 0) {
130 return handler_bci;
131 } else if (ex_klass.is_null()) {
132 return handler_bci;
133 } else {
134 // we know the exception class => get the constraint class
135 // this may require loading of the constraint class; if verification
136 // fails or some other exception occurs, return handler_bci
137 klassOop k = pool->klass_at(klass_index, CHECK_(handler_bci));
138 KlassHandle klass = KlassHandle(THREAD, k);
139 assert(klass.not_null(), "klass not loaded");
140 if (ex_klass->is_subtype_of(klass())) {
141 return handler_bci;
142 }
143 }
144 }
145 }
147 return -1;
148 }
150 void methodOopDesc::mask_for(int bci, InterpreterOopMap* mask) {
152 Thread* myThread = Thread::current();
153 methodHandle h_this(myThread, this);
154 #ifdef ASSERT
155 bool has_capability = myThread->is_VM_thread() ||
156 myThread->is_ConcurrentGC_thread() ||
157 myThread->is_GC_task_thread();
159 if (!has_capability) {
160 if (!VerifyStack && !VerifyLastFrame) {
161 // verify stack calls this outside VM thread
162 warning("oopmap should only be accessed by the "
163 "VM, GC task or CMS threads (or during debugging)");
164 InterpreterOopMap local_mask;
165 instanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask);
166 local_mask.print();
167 }
168 }
169 #endif
170 instanceKlass::cast(method_holder())->mask_for(h_this, bci, mask);
171 return;
172 }
175 int methodOopDesc::bci_from(address bcp) const {
176 assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(),
177 err_msg("bcp doesn't belong to this method: bcp: " INTPTR_FORMAT ", method: %s", bcp, name_and_sig_as_C_string()));
178 return bcp - code_base();
179 }
182 // Return (int)bcx if it appears to be a valid BCI.
183 // Return bci_from((address)bcx) if it appears to be a valid BCP.
184 // Return -1 otherwise.
185 // Used by profiling code, when invalid data is a possibility.
186 // The caller is responsible for validating the methodOop itself.
187 int methodOopDesc::validate_bci_from_bcx(intptr_t bcx) const {
188 // keep bci as -1 if not a valid bci
189 int bci = -1;
190 if (bcx == 0 || (address)bcx == code_base()) {
191 // code_size() may return 0 and we allow 0 here
192 // the method may be native
193 bci = 0;
194 } else if (frame::is_bci(bcx)) {
195 if (bcx < code_size()) {
196 bci = (int)bcx;
197 }
198 } else if (contains((address)bcx)) {
199 bci = (address)bcx - code_base();
200 }
201 // Assert that if we have dodged any asserts, bci is negative.
202 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0");
203 return bci;
204 }
206 address methodOopDesc::bcp_from(int bci) const {
207 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci");
208 address bcp = code_base() + bci;
209 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method");
210 return bcp;
211 }
214 int methodOopDesc::object_size(bool is_native) {
215 // If native, then include pointers for native_function and signature_handler
216 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0;
217 int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord;
218 return align_object_size(header_size() + extra_words);
219 }
222 Symbol* methodOopDesc::klass_name() const {
223 klassOop k = method_holder();
224 assert(k->is_klass(), "must be klass");
225 instanceKlass* ik = (instanceKlass*) k->klass_part();
226 return ik->name();
227 }
230 void methodOopDesc::set_interpreter_kind() {
231 int kind = Interpreter::method_kind(methodOop(this));
232 assert(kind != Interpreter::invalid,
233 "interpreter entry must be valid");
234 set_interpreter_kind(kind);
235 }
238 // Attempt to return method oop to original state. Clear any pointers
239 // (to objects outside the shared spaces). We won't be able to predict
240 // where they should point in a new JVM. Further initialize some
241 // entries now in order allow them to be write protected later.
243 void methodOopDesc::remove_unshareable_info() {
244 unlink_method();
245 set_interpreter_kind();
246 }
249 bool methodOopDesc::was_executed_more_than(int n) {
250 // Invocation counter is reset when the methodOop is compiled.
251 // If the method has compiled code we therefore assume it has
252 // be excuted more than n times.
253 if (is_accessor() || is_empty_method() || (code() != NULL)) {
254 // interpreter doesn't bump invocation counter of trivial methods
255 // compiler does not bump invocation counter of compiled methods
256 return true;
257 }
258 else if (_invocation_counter.carry() || (method_data() != NULL && method_data()->invocation_counter()->carry())) {
259 // The carry bit is set when the counter overflows and causes
260 // a compilation to occur. We don't know how many times
261 // the counter has been reset, so we simply assume it has
262 // been executed more than n times.
263 return true;
264 } else {
265 return invocation_count() > n;
266 }
267 }
269 #ifndef PRODUCT
270 void methodOopDesc::print_invocation_count() {
271 if (is_static()) tty->print("static ");
272 if (is_final()) tty->print("final ");
273 if (is_synchronized()) tty->print("synchronized ");
274 if (is_native()) tty->print("native ");
275 method_holder()->klass_part()->name()->print_symbol_on(tty);
276 tty->print(".");
277 name()->print_symbol_on(tty);
278 signature()->print_symbol_on(tty);
280 if (WizardMode) {
281 // dump the size of the byte codes
282 tty->print(" {%d}", code_size());
283 }
284 tty->cr();
286 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count());
287 tty->print_cr (" invocation_counter: %8d ", invocation_count());
288 tty->print_cr (" backedge_counter: %8d ", backedge_count());
289 if (CountCompiledCalls) {
290 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count());
291 }
293 }
294 #endif
296 // Build a methodDataOop object to hold information about this method
297 // collected in the interpreter.
298 void methodOopDesc::build_interpreter_method_data(methodHandle method, TRAPS) {
299 // Do not profile method if current thread holds the pending list lock,
300 // which avoids deadlock for acquiring the MethodData_lock.
301 if (instanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) {
302 return;
303 }
305 // Grab a lock here to prevent multiple
306 // methodDataOops from being created.
307 MutexLocker ml(MethodData_lock, THREAD);
308 if (method->method_data() == NULL) {
309 methodDataOop method_data = oopFactory::new_methodData(method, CHECK);
310 method->set_method_data(method_data);
311 if (PrintMethodData && (Verbose || WizardMode)) {
312 ResourceMark rm(THREAD);
313 tty->print("build_interpreter_method_data for ");
314 method->print_name(tty);
315 tty->cr();
316 // At the end of the run, the MDO, full of data, will be dumped.
317 }
318 }
319 }
321 void methodOopDesc::cleanup_inline_caches() {
322 // The current system doesn't use inline caches in the interpreter
323 // => nothing to do (keep this method around for future use)
324 }
327 int methodOopDesc::extra_stack_words() {
328 // not an inline function, to avoid a header dependency on Interpreter
329 return extra_stack_entries() * Interpreter::stackElementSize;
330 }
333 void methodOopDesc::compute_size_of_parameters(Thread *thread) {
334 ArgumentSizeComputer asc(signature());
335 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
336 }
338 #ifdef CC_INTERP
339 void methodOopDesc::set_result_index(BasicType type) {
340 _result_index = Interpreter::BasicType_as_index(type);
341 }
342 #endif
344 BasicType methodOopDesc::result_type() const {
345 ResultTypeFinder rtf(signature());
346 return rtf.type();
347 }
350 bool methodOopDesc::is_empty_method() const {
351 return code_size() == 1
352 && *code_base() == Bytecodes::_return;
353 }
356 bool methodOopDesc::is_vanilla_constructor() const {
357 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
358 // which only calls the superclass vanilla constructor and possibly does stores of
359 // zero constants to local fields:
360 //
361 // aload_0
362 // invokespecial
363 // indexbyte1
364 // indexbyte2
365 //
366 // followed by an (optional) sequence of:
367 //
368 // aload_0
369 // aconst_null / iconst_0 / fconst_0 / dconst_0
370 // putfield
371 // indexbyte1
372 // indexbyte2
373 //
374 // followed by:
375 //
376 // return
378 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
379 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
380 int size = code_size();
381 // Check if size match
382 if (size == 0 || size % 5 != 0) return false;
383 address cb = code_base();
384 int last = size - 1;
385 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
386 // Does not call superclass default constructor
387 return false;
388 }
389 // Check optional sequence
390 for (int i = 4; i < last; i += 5) {
391 if (cb[i] != Bytecodes::_aload_0) return false;
392 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
393 if (cb[i+2] != Bytecodes::_putfield) return false;
394 }
395 return true;
396 }
399 bool methodOopDesc::compute_has_loops_flag() {
400 BytecodeStream bcs(methodOop(this));
401 Bytecodes::Code bc;
403 while ((bc = bcs.next()) >= 0) {
404 switch( bc ) {
405 case Bytecodes::_ifeq:
406 case Bytecodes::_ifnull:
407 case Bytecodes::_iflt:
408 case Bytecodes::_ifle:
409 case Bytecodes::_ifne:
410 case Bytecodes::_ifnonnull:
411 case Bytecodes::_ifgt:
412 case Bytecodes::_ifge:
413 case Bytecodes::_if_icmpeq:
414 case Bytecodes::_if_icmpne:
415 case Bytecodes::_if_icmplt:
416 case Bytecodes::_if_icmpgt:
417 case Bytecodes::_if_icmple:
418 case Bytecodes::_if_icmpge:
419 case Bytecodes::_if_acmpeq:
420 case Bytecodes::_if_acmpne:
421 case Bytecodes::_goto:
422 case Bytecodes::_jsr:
423 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
424 break;
426 case Bytecodes::_goto_w:
427 case Bytecodes::_jsr_w:
428 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
429 break;
430 }
431 }
432 _access_flags.set_loops_flag_init();
433 return _access_flags.has_loops();
434 }
437 bool methodOopDesc::is_final_method() const {
438 // %%% Should return true for private methods also,
439 // since there is no way to override them.
440 return is_final() || Klass::cast(method_holder())->is_final();
441 }
444 bool methodOopDesc::is_strict_method() const {
445 return is_strict();
446 }
449 bool methodOopDesc::can_be_statically_bound() const {
450 if (is_final_method()) return true;
451 return vtable_index() == nonvirtual_vtable_index;
452 }
455 bool methodOopDesc::is_accessor() const {
456 if (code_size() != 5) return false;
457 if (size_of_parameters() != 1) return false;
458 if (java_code_at(0) != Bytecodes::_aload_0 ) return false;
459 if (java_code_at(1) != Bytecodes::_getfield) return false;
460 if (java_code_at(4) != Bytecodes::_areturn &&
461 java_code_at(4) != Bytecodes::_ireturn ) return false;
462 return true;
463 }
466 bool methodOopDesc::is_initializer() const {
467 return name() == vmSymbols::object_initializer_name() || is_static_initializer();
468 }
470 bool methodOopDesc::has_valid_initializer_flags() const {
471 return (is_static() ||
472 instanceKlass::cast(method_holder())->major_version() < 51);
473 }
475 bool methodOopDesc::is_static_initializer() const {
476 // For classfiles version 51 or greater, ensure that the clinit method is
477 // static. Non-static methods with the name "<clinit>" are not static
478 // initializers. (older classfiles exempted for backward compatibility)
479 return name() == vmSymbols::class_initializer_name() &&
480 has_valid_initializer_flags();
481 }
484 objArrayHandle methodOopDesc::resolved_checked_exceptions_impl(methodOop this_oop, TRAPS) {
485 int length = this_oop->checked_exceptions_length();
486 if (length == 0) { // common case
487 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
488 } else {
489 methodHandle h_this(THREAD, this_oop);
490 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
491 objArrayHandle mirrors (THREAD, m_oop);
492 for (int i = 0; i < length; i++) {
493 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
494 klassOop k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
495 assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
496 mirrors->obj_at_put(i, Klass::cast(k)->java_mirror());
497 }
498 return mirrors;
499 }
500 };
503 int methodOopDesc::line_number_from_bci(int bci) const {
504 if (bci == SynchronizationEntryBCI) bci = 0;
505 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci");
506 int best_bci = 0;
507 int best_line = -1;
509 if (has_linenumber_table()) {
510 // The line numbers are a short array of 2-tuples [start_pc, line_number].
511 // Not necessarily sorted and not necessarily one-to-one.
512 CompressedLineNumberReadStream stream(compressed_linenumber_table());
513 while (stream.read_pair()) {
514 if (stream.bci() == bci) {
515 // perfect match
516 return stream.line();
517 } else {
518 // update best_bci/line
519 if (stream.bci() < bci && stream.bci() >= best_bci) {
520 best_bci = stream.bci();
521 best_line = stream.line();
522 }
523 }
524 }
525 }
526 return best_line;
527 }
530 bool methodOopDesc::is_klass_loaded_by_klass_index(int klass_index) const {
531 if( constants()->tag_at(klass_index).is_unresolved_klass() ) {
532 Thread *thread = Thread::current();
533 Symbol* klass_name = constants()->klass_name_at(klass_index);
534 Handle loader(thread, instanceKlass::cast(method_holder())->class_loader());
535 Handle prot (thread, Klass::cast(method_holder())->protection_domain());
536 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
537 } else {
538 return true;
539 }
540 }
543 bool methodOopDesc::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
544 int klass_index = constants()->klass_ref_index_at(refinfo_index);
545 if (must_be_resolved) {
546 // Make sure klass is resolved in constantpool.
547 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
548 }
549 return is_klass_loaded_by_klass_index(klass_index);
550 }
553 void methodOopDesc::set_native_function(address function, bool post_event_flag) {
554 assert(function != NULL, "use clear_native_function to unregister natives");
555 assert(!is_method_handle_intrinsic() || function == SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), "");
556 address* native_function = native_function_addr();
558 // We can see racers trying to place the same native function into place. Once
559 // is plenty.
560 address current = *native_function;
561 if (current == function) return;
562 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
563 function != NULL) {
564 // native_method_throw_unsatisfied_link_error_entry() should only
565 // be passed when post_event_flag is false.
566 assert(function !=
567 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
568 "post_event_flag mis-match");
570 // post the bind event, and possible change the bind function
571 JvmtiExport::post_native_method_bind(this, &function);
572 }
573 *native_function = function;
574 // This function can be called more than once. We must make sure that we always
575 // use the latest registered method -> check if a stub already has been generated.
576 // If so, we have to make it not_entrant.
577 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates
578 if (nm != NULL) {
579 nm->make_not_entrant();
580 }
581 }
584 bool methodOopDesc::has_native_function() const {
585 assert(!is_method_handle_intrinsic(), "");
586 address func = native_function();
587 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
588 }
591 void methodOopDesc::clear_native_function() {
592 // Note: is_method_handle_intrinsic() is allowed here.
593 set_native_function(
594 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
595 !native_bind_event_is_interesting);
596 clear_code();
597 }
599 address methodOopDesc::critical_native_function() {
600 methodHandle mh(this);
601 return NativeLookup::lookup_critical_entry(mh);
602 }
605 void methodOopDesc::set_signature_handler(address handler) {
606 address* signature_handler = signature_handler_addr();
607 *signature_handler = handler;
608 }
611 bool methodOopDesc::is_not_compilable(int comp_level) const {
612 if (number_of_breakpoints() > 0) {
613 return true;
614 }
615 if (comp_level == CompLevel_any) {
616 return is_not_c1_compilable() || is_not_c2_compilable();
617 }
618 if (is_c1_compile(comp_level)) {
619 return is_not_c1_compilable();
620 }
621 if (is_c2_compile(comp_level)) {
622 return is_not_c2_compilable();
623 }
624 return false;
625 }
627 // call this when compiler finds that this method is not compilable
628 void methodOopDesc::set_not_compilable(int comp_level, bool report) {
629 if (PrintCompilation && report) {
630 ttyLocker ttyl;
631 tty->print("made not compilable ");
632 this->print_short_name(tty);
633 int size = this->code_size();
634 if (size > 0)
635 tty->print(" (%d bytes)", size);
636 tty->cr();
637 }
638 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
639 ttyLocker ttyl;
640 xtty->begin_elem("make_not_compilable thread='%d'", (int) os::current_thread_id());
641 xtty->method(methodOop(this));
642 xtty->stamp();
643 xtty->end_elem();
644 }
645 if (comp_level == CompLevel_all) {
646 set_not_c1_compilable();
647 set_not_c2_compilable();
648 } else {
649 if (is_c1_compile(comp_level)) {
650 set_not_c1_compilable();
651 } else
652 if (is_c2_compile(comp_level)) {
653 set_not_c2_compilable();
654 }
655 }
656 CompilationPolicy::policy()->disable_compilation(this);
657 }
659 // Revert to using the interpreter and clear out the nmethod
660 void methodOopDesc::clear_code() {
662 // this may be NULL if c2i adapters have not been made yet
663 // Only should happen at allocate time.
664 if (_adapter == NULL) {
665 _from_compiled_entry = NULL;
666 } else {
667 _from_compiled_entry = _adapter->get_c2i_entry();
668 }
669 OrderAccess::storestore();
670 _from_interpreted_entry = _i2i_entry;
671 OrderAccess::storestore();
672 _code = NULL;
673 }
675 // Called by class data sharing to remove any entry points (which are not shared)
676 void methodOopDesc::unlink_method() {
677 _code = NULL;
678 _i2i_entry = NULL;
679 _from_interpreted_entry = NULL;
680 if (is_native()) {
681 *native_function_addr() = NULL;
682 set_signature_handler(NULL);
683 }
684 NOT_PRODUCT(set_compiled_invocation_count(0);)
685 invocation_counter()->reset();
686 backedge_counter()->reset();
687 _adapter = NULL;
688 _from_compiled_entry = NULL;
689 assert(_method_data == NULL, "unexpected method data?");
690 set_method_data(NULL);
691 set_interpreter_throwout_count(0);
692 set_interpreter_invocation_count(0);
693 }
695 // Called when the method_holder is getting linked. Setup entrypoints so the method
696 // is ready to be called from interpreter, compiler, and vtables.
697 void methodOopDesc::link_method(methodHandle h_method, TRAPS) {
698 // If the code cache is full, we may reenter this function for the
699 // leftover methods that weren't linked.
700 if (_i2i_entry != NULL) return;
702 assert(_adapter == NULL, "init'd to NULL" );
703 assert( _code == NULL, "nothing compiled yet" );
705 // Setup interpreter entrypoint
706 assert(this == h_method(), "wrong h_method()" );
707 address entry = Interpreter::entry_for_method(h_method);
708 assert(entry != NULL, "interpreter entry must be non-null");
709 // Sets both _i2i_entry and _from_interpreted_entry
710 set_interpreter_entry(entry);
711 if (is_native() && !is_method_handle_intrinsic()) {
712 set_native_function(
713 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
714 !native_bind_event_is_interesting);
715 }
717 // Setup compiler entrypoint. This is made eagerly, so we do not need
718 // special handling of vtables. An alternative is to make adapters more
719 // lazily by calling make_adapter() from from_compiled_entry() for the
720 // normal calls. For vtable calls life gets more complicated. When a
721 // call-site goes mega-morphic we need adapters in all methods which can be
722 // called from the vtable. We need adapters on such methods that get loaded
723 // later. Ditto for mega-morphic itable calls. If this proves to be a
724 // problem we'll make these lazily later.
725 (void) make_adapters(h_method, CHECK);
727 // ONLY USE the h_method now as make_adapter may have blocked
729 }
731 address methodOopDesc::make_adapters(methodHandle mh, TRAPS) {
732 // Adapters for compiled code are made eagerly here. They are fairly
733 // small (generally < 100 bytes) and quick to make (and cached and shared)
734 // so making them eagerly shouldn't be too expensive.
735 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
736 if (adapter == NULL ) {
737 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters");
738 }
740 mh->set_adapter_entry(adapter);
741 mh->_from_compiled_entry = adapter->get_c2i_entry();
742 return adapter->get_c2i_entry();
743 }
745 // The verified_code_entry() must be called when a invoke is resolved
746 // on this method.
748 // It returns the compiled code entry point, after asserting not null.
749 // This function is called after potential safepoints so that nmethod
750 // or adapter that it points to is still live and valid.
751 // This function must not hit a safepoint!
752 address methodOopDesc::verified_code_entry() {
753 debug_only(No_Safepoint_Verifier nsv;)
754 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
755 if (code == NULL && UseCodeCacheFlushing) {
756 nmethod *saved_code = CodeCache::find_and_remove_saved_code(this);
757 if (saved_code != NULL) {
758 methodHandle method(this);
759 assert( ! saved_code->is_osr_method(), "should not get here for osr" );
760 set_code( method, saved_code );
761 }
762 }
764 assert(_from_compiled_entry != NULL, "must be set");
765 return _from_compiled_entry;
766 }
768 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
769 // (could be racing a deopt).
770 // Not inline to avoid circular ref.
771 bool methodOopDesc::check_code() const {
772 // cached in a register or local. There's a race on the value of the field.
773 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
774 return code == NULL || (code->method() == NULL) || (code->method() == (methodOop)this && !code->is_osr_method());
775 }
777 // Install compiled code. Instantly it can execute.
778 void methodOopDesc::set_code(methodHandle mh, nmethod *code) {
779 assert( code, "use clear_code to remove code" );
780 assert( mh->check_code(), "" );
782 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
784 // These writes must happen in this order, because the interpreter will
785 // directly jump to from_interpreted_entry which jumps to an i2c adapter
786 // which jumps to _from_compiled_entry.
787 mh->_code = code; // Assign before allowing compiled code to exec
789 int comp_level = code->comp_level();
790 // In theory there could be a race here. In practice it is unlikely
791 // and not worth worrying about.
792 if (comp_level > mh->highest_comp_level()) {
793 mh->set_highest_comp_level(comp_level);
794 }
796 OrderAccess::storestore();
797 #ifdef SHARK
798 mh->_from_interpreted_entry = code->insts_begin();
799 #else //!SHARK
800 mh->_from_compiled_entry = code->verified_entry_point();
801 OrderAccess::storestore();
802 // Instantly compiled code can execute.
803 if (!mh->is_method_handle_intrinsic())
804 mh->_from_interpreted_entry = mh->get_i2c_entry();
805 #endif //!SHARK
806 }
809 bool methodOopDesc::is_overridden_in(klassOop k) const {
810 instanceKlass* ik = instanceKlass::cast(k);
812 if (ik->is_interface()) return false;
814 // If method is an interface, we skip it - except if it
815 // is a miranda method
816 if (instanceKlass::cast(method_holder())->is_interface()) {
817 // Check that method is not a miranda method
818 if (ik->lookup_method(name(), signature()) == NULL) {
819 // No implementation exist - so miranda method
820 return false;
821 }
822 return true;
823 }
825 assert(ik->is_subclass_of(method_holder()), "should be subklass");
826 assert(ik->vtable() != NULL, "vtable should exist");
827 if (vtable_index() == nonvirtual_vtable_index) {
828 return false;
829 } else {
830 methodOop vt_m = ik->method_at_vtable(vtable_index());
831 return vt_m != methodOop(this);
832 }
833 }
836 // give advice about whether this methodOop should be cached or not
837 bool methodOopDesc::should_not_be_cached() const {
838 if (is_old()) {
839 // This method has been redefined. It is either EMCP or obsolete
840 // and we don't want to cache it because that would pin the method
841 // down and prevent it from being collectible if and when it
842 // finishes executing.
843 return true;
844 }
846 if (mark()->should_not_be_cached()) {
847 // It is either not safe or not a good idea to cache this
848 // method at this time because of the state of the embedded
849 // markOop. See markOop.cpp for the gory details.
850 return true;
851 }
853 // caching this method should be just fine
854 return false;
855 }
857 // Constant pool structure for invoke methods:
858 enum {
859 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc.
860 _imcp_invoke_signature, // utf8: (variable Symbol*)
861 _imcp_limit
862 };
864 // Test if this method is an MH adapter frame generated by Java code.
865 // Cf. java/lang/invoke/InvokerBytecodeGenerator
866 bool methodOopDesc::is_compiled_lambda_form() const {
867 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm;
868 }
870 // Test if this method is an internal MH primitive method.
871 bool methodOopDesc::is_method_handle_intrinsic() const {
872 vmIntrinsics::ID iid = intrinsic_id();
873 return (MethodHandles::is_signature_polymorphic(iid) &&
874 MethodHandles::is_signature_polymorphic_intrinsic(iid));
875 }
877 bool methodOopDesc::has_member_arg() const {
878 vmIntrinsics::ID iid = intrinsic_id();
879 return (MethodHandles::is_signature_polymorphic(iid) &&
880 MethodHandles::has_member_arg(iid));
881 }
883 // Make an instance of a signature-polymorphic internal MH primitive.
884 methodHandle methodOopDesc::make_method_handle_intrinsic(vmIntrinsics::ID iid,
885 Symbol* signature,
886 TRAPS) {
887 ResourceMark rm;
888 methodHandle empty;
890 KlassHandle holder = SystemDictionary::MethodHandle_klass();
891 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid);
892 assert(iid == MethodHandles::signature_polymorphic_name_id(name), "");
893 if (TraceMethodHandles) {
894 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string());
895 }
897 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup)
898 name->increment_refcount();
899 signature->increment_refcount();
901 int cp_length = _imcp_limit;
902 constantPoolHandle cp;
903 {
904 constantPoolOop cp_oop = oopFactory::new_constantPool(cp_length, IsSafeConc, CHECK_(empty));
905 cp = constantPoolHandle(THREAD, cp_oop);
906 }
907 cp->symbol_at_put(_imcp_invoke_name, name);
908 cp->symbol_at_put(_imcp_invoke_signature, signature);
909 cp->set_preresolution();
910 cp->set_pool_holder(holder());
912 // decide on access bits: public or not?
913 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL);
914 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid);
915 if (must_be_static) flags_bits |= JVM_ACC_STATIC;
916 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods");
918 methodHandle m;
919 {
920 methodOop m_oop = oopFactory::new_method(0, accessFlags_from(flags_bits),
921 0, 0, 0, 0, IsSafeConc, CHECK_(empty));
922 m = methodHandle(THREAD, m_oop);
923 }
924 m->set_constants(cp());
925 m->set_name_index(_imcp_invoke_name);
926 m->set_signature_index(_imcp_invoke_signature);
927 assert(MethodHandles::is_signature_polymorphic_name(m->name()), "");
928 assert(m->signature() == signature, "");
929 #ifdef CC_INTERP
930 ResultTypeFinder rtf(signature);
931 m->set_result_index(rtf.type());
932 #endif
933 m->compute_size_of_parameters(THREAD);
934 m->init_intrinsic_id();
935 assert(m->is_method_handle_intrinsic(), "");
936 #ifdef ASSERT
937 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print();
938 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker");
939 assert(m->intrinsic_id() == iid, "correctly predicted iid");
940 #endif //ASSERT
942 // Finally, set up its entry points.
943 assert(m->can_be_statically_bound(), "");
944 m->set_vtable_index(methodOopDesc::nonvirtual_vtable_index);
945 m->link_method(m, CHECK_(empty));
947 if (TraceMethodHandles && (Verbose || WizardMode))
948 m->print_on(tty);
950 return m;
951 }
953 klassOop methodOopDesc::check_non_bcp_klass(klassOop klass) {
954 if (klass != NULL && Klass::cast(klass)->class_loader() != NULL) {
955 if (Klass::cast(klass)->oop_is_objArray())
956 klass = objArrayKlass::cast(klass)->bottom_klass();
957 return klass;
958 }
959 return NULL;
960 }
963 methodHandle methodOopDesc::clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length,
964 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
965 // Code below does not work for native methods - they should never get rewritten anyway
966 assert(!m->is_native(), "cannot rewrite native methods");
967 // Allocate new methodOop
968 AccessFlags flags = m->access_flags();
969 int checked_exceptions_len = m->checked_exceptions_length();
970 int localvariable_len = m->localvariable_table_length();
971 int exception_table_len = m->exception_table_length();
972 // Allocate newm_oop with the is_conc_safe parameter set
973 // to IsUnsafeConc to indicate that newm_oop is not yet
974 // safe for concurrent processing by a GC.
975 methodOop newm_oop = oopFactory::new_method(new_code_length,
976 flags,
977 new_compressed_linenumber_size,
978 localvariable_len,
979 exception_table_len,
980 checked_exceptions_len,
981 IsUnsafeConc,
982 CHECK_(methodHandle()));
983 methodHandle newm (THREAD, newm_oop);
984 NOT_PRODUCT(int nmsz = newm->is_parsable() ? newm->size() : -1;)
985 int new_method_size = newm->method_size();
986 // Create a shallow copy of methodOopDesc part, but be careful to preserve the new constMethodOop
987 constMethodOop newcm = newm->constMethod();
988 NOT_PRODUCT(int ncmsz = newcm->is_parsable() ? newcm->size() : -1;)
989 int new_const_method_size = newm->constMethod()->object_size();
991 memcpy(newm(), m(), sizeof(methodOopDesc));
992 // Create shallow copy of constMethodOopDesc, but be careful to preserve the methodOop
993 // is_conc_safe is set to false because that is the value of
994 // is_conc_safe initialzied into newcm and the copy should
995 // not overwrite that value. During the window during which it is
996 // tagged as unsafe, some extra work could be needed during precleaning
997 // or concurrent marking but those phases will be correct. Setting and
998 // resetting is done in preference to a careful copying into newcm to
999 // avoid having to know the precise layout of a constMethodOop.
1000 m->constMethod()->set_is_conc_safe(oopDesc::IsUnsafeConc);
1001 assert(m->constMethod()->is_parsable(), "Should remain parsable");
1003 // NOTE: this is a reachable object that transiently signals "conc_unsafe"
1004 // However, no allocations are done during this window
1005 // during which it is tagged conc_unsafe, so we are assured that any concurrent
1006 // thread will not wait forever for the object to revert to "conc_safe".
1007 // Further, any such conc_unsafe object will indicate a stable size
1008 // through the transition.
1009 memcpy(newcm, m->constMethod(), sizeof(constMethodOopDesc));
1010 m->constMethod()->set_is_conc_safe(oopDesc::IsSafeConc);
1011 assert(m->constMethod()->is_parsable(), "Should remain parsable");
1013 // Reset correct method/const method, method size, and parameter info
1014 newm->set_constMethod(newcm);
1015 newm->constMethod()->set_code_size(new_code_length);
1016 newm->constMethod()->set_constMethod_size(new_const_method_size);
1017 newm->set_method_size(new_method_size);
1018 assert(newm->code_size() == new_code_length, "check");
1019 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1020 assert(newm->exception_table_length() == exception_table_len, "check");
1021 assert(newm->localvariable_table_length() == localvariable_len, "check");
1022 // Copy new byte codes
1023 memcpy(newm->code_base(), new_code, new_code_length);
1024 // Copy line number table
1025 if (new_compressed_linenumber_size > 0) {
1026 memcpy(newm->compressed_linenumber_table(),
1027 new_compressed_linenumber_table,
1028 new_compressed_linenumber_size);
1029 }
1030 // Copy checked_exceptions
1031 if (checked_exceptions_len > 0) {
1032 memcpy(newm->checked_exceptions_start(),
1033 m->checked_exceptions_start(),
1034 checked_exceptions_len * sizeof(CheckedExceptionElement));
1035 }
1036 // Copy exception table
1037 if (exception_table_len > 0) {
1038 memcpy(newm->exception_table_start(),
1039 m->exception_table_start(),
1040 exception_table_len * sizeof(ExceptionTableElement));
1041 }
1042 // Copy local variable number table
1043 if (localvariable_len > 0) {
1044 memcpy(newm->localvariable_table_start(),
1045 m->localvariable_table_start(),
1046 localvariable_len * sizeof(LocalVariableTableElement));
1047 }
1049 // Only set is_conc_safe to true when changes to newcm are
1050 // complete.
1051 assert(!newm->is_parsable() || nmsz < 0 || newm->size() == nmsz, "newm->size() inconsistency");
1052 assert(!newcm->is_parsable() || ncmsz < 0 || newcm->size() == ncmsz, "newcm->size() inconsistency");
1053 newcm->set_is_conc_safe(true);
1054 return newm;
1055 }
1057 vmSymbols::SID methodOopDesc::klass_id_for_intrinsics(klassOop holder) {
1058 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1059 // because we are not loading from core libraries
1060 if (instanceKlass::cast(holder)->class_loader() != NULL)
1061 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1063 // see if the klass name is well-known:
1064 Symbol* klass_name = instanceKlass::cast(holder)->name();
1065 return vmSymbols::find_sid(klass_name);
1066 }
1068 void methodOopDesc::init_intrinsic_id() {
1069 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1070 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1071 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1072 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1074 // the klass name is well-known:
1075 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1076 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1078 // ditto for method and signature:
1079 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1080 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1081 && name_id == vmSymbols::NO_SID)
1082 return;
1083 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1084 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1085 && sig_id == vmSymbols::NO_SID) return;
1086 jshort flags = access_flags().as_short();
1088 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1089 if (id != vmIntrinsics::_none) {
1090 set_intrinsic_id(id);
1091 return;
1092 }
1094 // A few slightly irregular cases:
1095 switch (klass_id) {
1096 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1097 // Second chance: check in regular Math.
1098 switch (name_id) {
1099 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1100 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1101 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1102 // pretend it is the corresponding method in the non-strict class:
1103 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1104 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1105 break;
1106 }
1107 break;
1109 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*.
1110 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle):
1111 if (!is_native()) break;
1112 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name());
1113 if (is_static() != MethodHandles::is_signature_polymorphic_static(id))
1114 id = vmIntrinsics::_none;
1115 break;
1116 }
1118 if (id != vmIntrinsics::_none) {
1119 // Set up its iid. It is an alias method.
1120 set_intrinsic_id(id);
1121 return;
1122 }
1123 }
1125 // These two methods are static since a GC may move the methodOopDesc
1126 bool methodOopDesc::load_signature_classes(methodHandle m, TRAPS) {
1127 if (THREAD->is_Compiler_thread()) {
1128 // There is nothing useful this routine can do from within the Compile thread.
1129 // Hopefully, the signature contains only well-known classes.
1130 // We could scan for this and return true/false, but the caller won't care.
1131 return false;
1132 }
1133 bool sig_is_loaded = true;
1134 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1135 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1136 ResourceMark rm(THREAD);
1137 Symbol* signature = m->signature();
1138 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1139 if (ss.is_object()) {
1140 Symbol* sym = ss.as_symbol(CHECK_(false));
1141 Symbol* name = sym;
1142 klassOop klass = SystemDictionary::resolve_or_null(name, class_loader,
1143 protection_domain, THREAD);
1144 // We are loading classes eagerly. If a ClassNotFoundException or
1145 // a LinkageError was generated, be sure to ignore it.
1146 if (HAS_PENDING_EXCEPTION) {
1147 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1148 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1149 CLEAR_PENDING_EXCEPTION;
1150 } else {
1151 return false;
1152 }
1153 }
1154 if( klass == NULL) { sig_is_loaded = false; }
1155 }
1156 }
1157 return sig_is_loaded;
1158 }
1160 bool methodOopDesc::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
1161 Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader());
1162 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1163 ResourceMark rm(THREAD);
1164 Symbol* signature = m->signature();
1165 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1166 if (ss.type() == T_OBJECT) {
1167 Symbol* name = ss.as_symbol_or_null();
1168 if (name == NULL) return true;
1169 klassOop klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1170 if (klass == NULL) return true;
1171 }
1172 }
1173 return false;
1174 }
1176 // Exposed so field engineers can debug VM
1177 void methodOopDesc::print_short_name(outputStream* st) {
1178 ResourceMark rm;
1179 #ifdef PRODUCT
1180 st->print(" %s::", method_holder()->klass_part()->external_name());
1181 #else
1182 st->print(" %s::", method_holder()->klass_part()->internal_name());
1183 #endif
1184 name()->print_symbol_on(st);
1185 if (WizardMode) signature()->print_symbol_on(st);
1186 else if (MethodHandles::is_signature_polymorphic(intrinsic_id()))
1187 MethodHandles::print_as_basic_type_signature_on(st, signature(), true);
1188 }
1190 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1191 static void reorder_based_on_method_index(objArrayOop methods,
1192 objArrayOop annotations,
1193 GrowableArray<oop>* temp_array) {
1194 if (annotations == NULL) {
1195 return;
1196 }
1198 int length = methods->length();
1199 int i;
1200 // Copy to temp array
1201 temp_array->clear();
1202 for (i = 0; i < length; i++) {
1203 temp_array->append(annotations->obj_at(i));
1204 }
1206 // Copy back using old method indices
1207 for (i = 0; i < length; i++) {
1208 methodOop m = (methodOop) methods->obj_at(i);
1209 annotations->obj_at_put(i, temp_array->at(m->method_idnum()));
1210 }
1211 }
1213 // Comparer for sorting an object array containing
1214 // methodOops.
1215 // Used non-template method_comparator methods since
1216 // Visual Studio 2003 compiler generates incorrect
1217 // optimized code for it.
1218 static int method_comparator_narrowOop(narrowOop a, narrowOop b) {
1219 methodOop m = (methodOop)oopDesc::decode_heap_oop_not_null(a);
1220 methodOop n = (methodOop)oopDesc::decode_heap_oop_not_null(b);
1221 return m->name()->fast_compare(n->name());
1222 }
1223 static int method_comparator_oop(oop a, oop b) {
1224 methodOop m = (methodOop)a;
1225 methodOop n = (methodOop)b;
1226 return m->name()->fast_compare(n->name());
1227 }
1229 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1230 void methodOopDesc::sort_methods(objArrayOop methods,
1231 objArrayOop methods_annotations,
1232 objArrayOop methods_parameter_annotations,
1233 objArrayOop methods_default_annotations,
1234 bool idempotent) {
1235 int length = methods->length();
1236 if (length > 1) {
1237 bool do_annotations = false;
1238 if (methods_annotations != NULL ||
1239 methods_parameter_annotations != NULL ||
1240 methods_default_annotations != NULL) {
1241 do_annotations = true;
1242 }
1243 if (do_annotations) {
1244 // Remember current method ordering so we can reorder annotations
1245 for (int i = 0; i < length; i++) {
1246 methodOop m = (methodOop) methods->obj_at(i);
1247 m->set_method_idnum(i);
1248 }
1249 }
1250 {
1251 No_Safepoint_Verifier nsv;
1252 if (UseCompressedOops) {
1253 QuickSort::sort<narrowOop>((narrowOop*)(methods->base()), length, method_comparator_narrowOop, idempotent);
1254 } else {
1255 QuickSort::sort<oop>((oop*)(methods->base()), length, method_comparator_oop, idempotent);
1256 }
1257 if (UseConcMarkSweepGC) {
1258 // For CMS we need to dirty the cards for the array
1259 BarrierSet* bs = Universe::heap()->barrier_set();
1260 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt");
1261 bs->write_ref_array(methods->base(), length);
1262 }
1263 }
1265 // Sort annotations if necessary
1266 assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), "");
1267 assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), "");
1268 assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), "");
1269 if (do_annotations) {
1270 ResourceMark rm;
1271 // Allocate temporary storage
1272 GrowableArray<oop>* temp_array = new GrowableArray<oop>(length);
1273 reorder_based_on_method_index(methods, methods_annotations, temp_array);
1274 reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array);
1275 reorder_based_on_method_index(methods, methods_default_annotations, temp_array);
1276 }
1278 // Reset method ordering
1279 for (int i = 0; i < length; i++) {
1280 methodOop m = (methodOop) methods->obj_at(i);
1281 m->set_method_idnum(i);
1282 }
1283 }
1284 }
1287 //-----------------------------------------------------------------------------------
1288 // Non-product code
1290 #ifndef PRODUCT
1291 class SignatureTypePrinter : public SignatureTypeNames {
1292 private:
1293 outputStream* _st;
1294 bool _use_separator;
1296 void type_name(const char* name) {
1297 if (_use_separator) _st->print(", ");
1298 _st->print(name);
1299 _use_separator = true;
1300 }
1302 public:
1303 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) {
1304 _st = st;
1305 _use_separator = false;
1306 }
1308 void print_parameters() { _use_separator = false; iterate_parameters(); }
1309 void print_returntype() { _use_separator = false; iterate_returntype(); }
1310 };
1313 void methodOopDesc::print_name(outputStream* st) {
1314 Thread *thread = Thread::current();
1315 ResourceMark rm(thread);
1316 SignatureTypePrinter sig(signature(), st);
1317 st->print("%s ", is_static() ? "static" : "virtual");
1318 sig.print_returntype();
1319 st->print(" %s.", method_holder()->klass_part()->internal_name());
1320 name()->print_symbol_on(st);
1321 st->print("(");
1322 sig.print_parameters();
1323 st->print(")");
1324 }
1327 void methodOopDesc::print_codes_on(outputStream* st) const {
1328 print_codes_on(0, code_size(), st);
1329 }
1331 void methodOopDesc::print_codes_on(int from, int to, outputStream* st) const {
1332 Thread *thread = Thread::current();
1333 ResourceMark rm(thread);
1334 methodHandle mh (thread, (methodOop)this);
1335 BytecodeStream s(mh);
1336 s.set_interval(from, to);
1337 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1338 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1339 }
1340 #endif // not PRODUCT
1343 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas
1344 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned)
1345 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used
1346 // as end-of-stream terminator.
1348 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) {
1349 // bci and line number does not compress into single byte.
1350 // Write out escape character and use regular compression for bci and line number.
1351 write_byte((jubyte)0xFF);
1352 write_signed_int(bci_delta);
1353 write_signed_int(line_delta);
1354 }
1356 // See comment in methodOop.hpp which explains why this exists.
1357 #if defined(_M_AMD64) && _MSC_VER >= 1400
1358 #pragma optimize("", off)
1359 void CompressedLineNumberWriteStream::write_pair(int bci, int line) {
1360 write_pair_inline(bci, line);
1361 }
1362 #pragma optimize("", on)
1363 #endif
1365 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1366 _bci = 0;
1367 _line = 0;
1368 };
1371 bool CompressedLineNumberReadStream::read_pair() {
1372 jubyte next = read_byte();
1373 // Check for terminator
1374 if (next == 0) return false;
1375 if (next == 0xFF) {
1376 // Escape character, regular compression used
1377 _bci += read_signed_int();
1378 _line += read_signed_int();
1379 } else {
1380 // Single byte compression used
1381 _bci += next >> 3;
1382 _line += next & 0x7;
1383 }
1384 return true;
1385 }
1388 Bytecodes::Code methodOopDesc::orig_bytecode_at(int bci) const {
1389 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1390 for (; bp != NULL; bp = bp->next()) {
1391 if (bp->match(this, bci)) {
1392 return bp->orig_bytecode();
1393 }
1394 }
1395 ShouldNotReachHere();
1396 return Bytecodes::_shouldnotreachhere;
1397 }
1399 void methodOopDesc::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1400 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1401 BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints();
1402 for (; bp != NULL; bp = bp->next()) {
1403 if (bp->match(this, bci)) {
1404 bp->set_orig_bytecode(code);
1405 // and continue, in case there is more than one
1406 }
1407 }
1408 }
1410 void methodOopDesc::set_breakpoint(int bci) {
1411 instanceKlass* ik = instanceKlass::cast(method_holder());
1412 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1413 bp->set_next(ik->breakpoints());
1414 ik->set_breakpoints(bp);
1415 // do this last:
1416 bp->set(this);
1417 }
1419 static void clear_matches(methodOop m, int bci) {
1420 instanceKlass* ik = instanceKlass::cast(m->method_holder());
1421 BreakpointInfo* prev_bp = NULL;
1422 BreakpointInfo* next_bp;
1423 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1424 next_bp = bp->next();
1425 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1426 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1427 // do this first:
1428 bp->clear(m);
1429 // unhook it
1430 if (prev_bp != NULL)
1431 prev_bp->set_next(next_bp);
1432 else
1433 ik->set_breakpoints(next_bp);
1434 delete bp;
1435 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1436 // at same location. So we have multiple matching (method_index and bci)
1437 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1438 // breakpoint for clear_breakpoint request and keep all other method versions
1439 // BreakpointInfo for future clear_breakpoint request.
1440 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1441 // which is being called when class is unloaded. We delete all the Breakpoint
1442 // information for all versions of method. We may not correctly restore the original
1443 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1444 // so these methods won't be used anymore.
1445 if (bci >= 0) {
1446 break;
1447 }
1448 } else {
1449 // This one is a keeper.
1450 prev_bp = bp;
1451 }
1452 }
1453 }
1455 void methodOopDesc::clear_breakpoint(int bci) {
1456 assert(bci >= 0, "");
1457 clear_matches(this, bci);
1458 }
1460 void methodOopDesc::clear_all_breakpoints() {
1461 clear_matches(this, -1);
1462 }
1465 int methodOopDesc::invocation_count() {
1466 if (TieredCompilation) {
1467 const methodDataOop mdo = method_data();
1468 if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1469 return InvocationCounter::count_limit;
1470 } else {
1471 return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1472 }
1473 } else {
1474 return invocation_counter()->count();
1475 }
1476 }
1478 int methodOopDesc::backedge_count() {
1479 if (TieredCompilation) {
1480 const methodDataOop mdo = method_data();
1481 if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1482 return InvocationCounter::count_limit;
1483 } else {
1484 return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1485 }
1486 } else {
1487 return backedge_counter()->count();
1488 }
1489 }
1491 int methodOopDesc::highest_comp_level() const {
1492 methodDataOop mdo = method_data();
1493 if (mdo != NULL) {
1494 return mdo->highest_comp_level();
1495 } else {
1496 return CompLevel_none;
1497 }
1498 }
1500 int methodOopDesc::highest_osr_comp_level() const {
1501 methodDataOop mdo = method_data();
1502 if (mdo != NULL) {
1503 return mdo->highest_osr_comp_level();
1504 } else {
1505 return CompLevel_none;
1506 }
1507 }
1509 void methodOopDesc::set_highest_comp_level(int level) {
1510 methodDataOop mdo = method_data();
1511 if (mdo != NULL) {
1512 mdo->set_highest_comp_level(level);
1513 }
1514 }
1516 void methodOopDesc::set_highest_osr_comp_level(int level) {
1517 methodDataOop mdo = method_data();
1518 if (mdo != NULL) {
1519 mdo->set_highest_osr_comp_level(level);
1520 }
1521 }
1523 BreakpointInfo::BreakpointInfo(methodOop m, int bci) {
1524 _bci = bci;
1525 _name_index = m->name_index();
1526 _signature_index = m->signature_index();
1527 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1528 if (_orig_bytecode == Bytecodes::_breakpoint)
1529 _orig_bytecode = m->orig_bytecode_at(_bci);
1530 _next = NULL;
1531 }
1533 void BreakpointInfo::set(methodOop method) {
1534 #ifdef ASSERT
1535 {
1536 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1537 if (code == Bytecodes::_breakpoint)
1538 code = method->orig_bytecode_at(_bci);
1539 assert(orig_bytecode() == code, "original bytecode must be the same");
1540 }
1541 #endif
1542 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1543 method->incr_number_of_breakpoints();
1544 SystemDictionary::notice_modification();
1545 {
1546 // Deoptimize all dependents on this method
1547 Thread *thread = Thread::current();
1548 HandleMark hm(thread);
1549 methodHandle mh(thread, method);
1550 Universe::flush_dependents_on_method(mh);
1551 }
1552 }
1554 void BreakpointInfo::clear(methodOop method) {
1555 *method->bcp_from(_bci) = orig_bytecode();
1556 assert(method->number_of_breakpoints() > 0, "must not go negative");
1557 method->decr_number_of_breakpoints();
1558 }