Fri, 05 Oct 2012 18:57:10 -0700
7177003: C1: LogCompilation support
Summary: add LogCompilation support in C1 - both client and tiered mode.
Reviewed-by: twisti, kvn
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/metadataFactory.hpp"
37 #include "memory/oopFactory.hpp"
38 #include "oops/methodData.hpp"
39 #include "oops/method.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "oops/symbol.hpp"
42 #include "prims/jvmtiExport.hpp"
43 #include "prims/jvmtiRedefineClasses.hpp"
44 #include "prims/methodHandles.hpp"
45 #include "prims/nativeLookup.hpp"
46 #include "runtime/arguments.hpp"
47 #include "runtime/compilationPolicy.hpp"
48 #include "runtime/frame.inline.hpp"
49 #include "runtime/handles.inline.hpp"
50 #include "runtime/relocator.hpp"
51 #include "runtime/sharedRuntime.hpp"
52 #include "runtime/signature.hpp"
53 #include "utilities/quickSort.hpp"
54 #include "utilities/xmlstream.hpp"
57 // Implementation of Method
59 Method* Method::allocate(ClassLoaderData* loader_data,
60 int byte_code_size,
61 AccessFlags access_flags,
62 int compressed_line_number_size,
63 int localvariable_table_length,
64 int exception_table_length,
65 int checked_exceptions_length,
66 TRAPS) {
67 assert(!access_flags.is_native() || byte_code_size == 0,
68 "native methods should not contain byte codes");
69 ConstMethod* cm = ConstMethod::allocate(loader_data,
70 byte_code_size,
71 compressed_line_number_size,
72 localvariable_table_length,
73 exception_table_length,
74 checked_exceptions_length,
75 CHECK_NULL);
77 int size = Method::size(access_flags.is_native());
79 return new (loader_data, size, false, THREAD) Method(cm, access_flags, size);
80 }
82 Method::Method(ConstMethod* xconst,
83 AccessFlags access_flags, int size) {
84 No_Safepoint_Verifier no_safepoint;
85 set_constMethod(xconst);
86 set_access_flags(access_flags);
87 set_method_size(size);
88 set_name_index(0);
89 set_signature_index(0);
90 #ifdef CC_INTERP
91 set_result_index(T_VOID);
92 #endif
93 set_constants(NULL);
94 set_max_stack(0);
95 set_max_locals(0);
96 set_intrinsic_id(vmIntrinsics::_none);
97 set_jfr_towrite(false);
98 set_method_data(NULL);
99 set_interpreter_throwout_count(0);
100 set_vtable_index(Method::garbage_vtable_index);
102 // Fix and bury in Method*
103 set_interpreter_entry(NULL); // sets i2i entry and from_int
104 set_adapter_entry(NULL);
105 clear_code(); // from_c/from_i get set to c2i/i2i
107 if (access_flags.is_native()) {
108 clear_native_function();
109 set_signature_handler(NULL);
110 }
112 NOT_PRODUCT(set_compiled_invocation_count(0);)
113 set_interpreter_invocation_count(0);
114 invocation_counter()->init();
115 backedge_counter()->init();
116 clear_number_of_breakpoints();
118 #ifdef TIERED
119 set_rate(0);
120 set_prev_event_count(0);
121 set_prev_time(0);
122 #endif
123 }
125 // Release Method*. The nmethod will be gone when we get here because
126 // we've walked the code cache.
127 void Method::deallocate_contents(ClassLoaderData* loader_data) {
128 MetadataFactory::free_metadata(loader_data, constMethod());
129 set_constMethod(NULL);
130 MetadataFactory::free_metadata(loader_data, method_data());
131 set_method_data(NULL);
132 // The nmethod will be gone when we get here.
133 if (code() != NULL) _code = NULL;
134 }
136 address Method::get_i2c_entry() {
137 assert(_adapter != NULL, "must have");
138 return _adapter->get_i2c_entry();
139 }
141 address Method::get_c2i_entry() {
142 assert(_adapter != NULL, "must have");
143 return _adapter->get_c2i_entry();
144 }
146 address Method::get_c2i_unverified_entry() {
147 assert(_adapter != NULL, "must have");
148 return _adapter->get_c2i_unverified_entry();
149 }
151 char* Method::name_and_sig_as_C_string() const {
152 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature());
153 }
155 char* Method::name_and_sig_as_C_string(char* buf, int size) const {
156 return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size);
157 }
159 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) {
160 const char* klass_name = klass->external_name();
161 int klass_name_len = (int)strlen(klass_name);
162 int method_name_len = method_name->utf8_length();
163 int len = klass_name_len + 1 + method_name_len + signature->utf8_length();
164 char* dest = NEW_RESOURCE_ARRAY(char, len + 1);
165 strcpy(dest, klass_name);
166 dest[klass_name_len] = '.';
167 strcpy(&dest[klass_name_len + 1], method_name->as_C_string());
168 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string());
169 dest[len] = 0;
170 return dest;
171 }
173 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) {
174 Symbol* klass_name = klass->name();
175 klass_name->as_klass_external_name(buf, size);
176 int len = (int)strlen(buf);
178 if (len < size - 1) {
179 buf[len++] = '.';
181 method_name->as_C_string(&(buf[len]), size - len);
182 len = (int)strlen(buf);
184 signature->as_C_string(&(buf[len]), size - len);
185 }
187 return buf;
188 }
190 int Method::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) {
191 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index)
192 // access exception table
193 ExceptionTable table(this);
194 int length = table.length();
195 // iterate through all entries sequentially
196 constantPoolHandle pool(THREAD, constants());
197 for (int i = 0; i < length; i ++) {
198 //reacquire the table in case a GC happened
199 ExceptionTable table(this);
200 int beg_bci = table.start_pc(i);
201 int end_bci = table.end_pc(i);
202 assert(beg_bci <= end_bci, "inconsistent exception table");
203 if (beg_bci <= throw_bci && throw_bci < end_bci) {
204 // exception handler bci range covers throw_bci => investigate further
205 int handler_bci = table.handler_pc(i);
206 int klass_index = table.catch_type_index(i);
207 if (klass_index == 0) {
208 return handler_bci;
209 } else if (ex_klass.is_null()) {
210 return handler_bci;
211 } else {
212 // we know the exception class => get the constraint class
213 // this may require loading of the constraint class; if verification
214 // fails or some other exception occurs, return handler_bci
215 Klass* k = pool->klass_at(klass_index, CHECK_(handler_bci));
216 KlassHandle klass = KlassHandle(THREAD, k);
217 assert(klass.not_null(), "klass not loaded");
218 if (ex_klass->is_subtype_of(klass())) {
219 return handler_bci;
220 }
221 }
222 }
223 }
225 return -1;
226 }
228 void Method::mask_for(int bci, InterpreterOopMap* mask) {
230 Thread* myThread = Thread::current();
231 methodHandle h_this(myThread, this);
232 #ifdef ASSERT
233 bool has_capability = myThread->is_VM_thread() ||
234 myThread->is_ConcurrentGC_thread() ||
235 myThread->is_GC_task_thread();
237 if (!has_capability) {
238 if (!VerifyStack && !VerifyLastFrame) {
239 // verify stack calls this outside VM thread
240 warning("oopmap should only be accessed by the "
241 "VM, GC task or CMS threads (or during debugging)");
242 InterpreterOopMap local_mask;
243 InstanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask);
244 local_mask.print();
245 }
246 }
247 #endif
248 InstanceKlass::cast(method_holder())->mask_for(h_this, bci, mask);
249 return;
250 }
253 int Method::bci_from(address bcp) const {
254 #ifdef ASSERT
255 { ResourceMark rm;
256 assert(is_native() && bcp == code_base() || contains(bcp) || is_error_reported(),
257 err_msg("bcp doesn't belong to this method: bcp: " INTPTR_FORMAT ", method: %s", bcp, name_and_sig_as_C_string()));
258 }
259 #endif
260 return bcp - code_base();
261 }
264 // Return (int)bcx if it appears to be a valid BCI.
265 // Return bci_from((address)bcx) if it appears to be a valid BCP.
266 // Return -1 otherwise.
267 // Used by profiling code, when invalid data is a possibility.
268 // The caller is responsible for validating the Method* itself.
269 int Method::validate_bci_from_bcx(intptr_t bcx) const {
270 // keep bci as -1 if not a valid bci
271 int bci = -1;
272 if (bcx == 0 || (address)bcx == code_base()) {
273 // code_size() may return 0 and we allow 0 here
274 // the method may be native
275 bci = 0;
276 } else if (frame::is_bci(bcx)) {
277 if (bcx < code_size()) {
278 bci = (int)bcx;
279 }
280 } else if (contains((address)bcx)) {
281 bci = (address)bcx - code_base();
282 }
283 // Assert that if we have dodged any asserts, bci is negative.
284 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0");
285 return bci;
286 }
288 address Method::bcp_from(int bci) const {
289 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci");
290 address bcp = code_base() + bci;
291 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method");
292 return bcp;
293 }
296 int Method::size(bool is_native) {
297 // If native, then include pointers for native_function and signature_handler
298 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0;
299 int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord;
300 return align_object_size(header_size() + extra_words);
301 }
304 Symbol* Method::klass_name() const {
305 Klass* k = method_holder();
306 assert(k->is_klass(), "must be klass");
307 InstanceKlass* ik = (InstanceKlass*) k;
308 return ik->name();
309 }
312 void Method::set_interpreter_kind() {
313 int kind = Interpreter::method_kind(this);
314 assert(kind != Interpreter::invalid,
315 "interpreter entry must be valid");
316 set_interpreter_kind(kind);
317 }
320 // Attempt to return method oop to original state. Clear any pointers
321 // (to objects outside the shared spaces). We won't be able to predict
322 // where they should point in a new JVM. Further initialize some
323 // entries now in order allow them to be write protected later.
325 void Method::remove_unshareable_info() {
326 unlink_method();
327 set_interpreter_kind();
328 }
331 bool Method::was_executed_more_than(int n) {
332 // Invocation counter is reset when the Method* is compiled.
333 // If the method has compiled code we therefore assume it has
334 // be excuted more than n times.
335 if (is_accessor() || is_empty_method() || (code() != NULL)) {
336 // interpreter doesn't bump invocation counter of trivial methods
337 // compiler does not bump invocation counter of compiled methods
338 return true;
339 }
340 else if (_invocation_counter.carry() || (method_data() != NULL && method_data()->invocation_counter()->carry())) {
341 // The carry bit is set when the counter overflows and causes
342 // a compilation to occur. We don't know how many times
343 // the counter has been reset, so we simply assume it has
344 // been executed more than n times.
345 return true;
346 } else {
347 return invocation_count() > n;
348 }
349 }
351 #ifndef PRODUCT
352 void Method::print_invocation_count() {
353 if (is_static()) tty->print("static ");
354 if (is_final()) tty->print("final ");
355 if (is_synchronized()) tty->print("synchronized ");
356 if (is_native()) tty->print("native ");
357 method_holder()->name()->print_symbol_on(tty);
358 tty->print(".");
359 name()->print_symbol_on(tty);
360 signature()->print_symbol_on(tty);
362 if (WizardMode) {
363 // dump the size of the byte codes
364 tty->print(" {%d}", code_size());
365 }
366 tty->cr();
368 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count());
369 tty->print_cr (" invocation_counter: %8d ", invocation_count());
370 tty->print_cr (" backedge_counter: %8d ", backedge_count());
371 if (CountCompiledCalls) {
372 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count());
373 }
375 }
376 #endif
378 // Build a MethodData* object to hold information about this method
379 // collected in the interpreter.
380 void Method::build_interpreter_method_data(methodHandle method, TRAPS) {
381 // Do not profile method if current thread holds the pending list lock,
382 // which avoids deadlock for acquiring the MethodData_lock.
383 if (InstanceRefKlass::owns_pending_list_lock((JavaThread*)THREAD)) {
384 return;
385 }
387 // Grab a lock here to prevent multiple
388 // MethodData*s from being created.
389 MutexLocker ml(MethodData_lock, THREAD);
390 if (method->method_data() == NULL) {
391 ClassLoaderData* loader_data = method->method_holder()->class_loader_data();
392 MethodData* method_data = MethodData::allocate(loader_data, method, CHECK);
393 method->set_method_data(method_data);
394 if (PrintMethodData && (Verbose || WizardMode)) {
395 ResourceMark rm(THREAD);
396 tty->print("build_interpreter_method_data for ");
397 method->print_name(tty);
398 tty->cr();
399 // At the end of the run, the MDO, full of data, will be dumped.
400 }
401 }
402 }
404 void Method::cleanup_inline_caches() {
405 // The current system doesn't use inline caches in the interpreter
406 // => nothing to do (keep this method around for future use)
407 }
410 int Method::extra_stack_words() {
411 // not an inline function, to avoid a header dependency on Interpreter
412 return extra_stack_entries() * Interpreter::stackElementSize;
413 }
416 void Method::compute_size_of_parameters(Thread *thread) {
417 ArgumentSizeComputer asc(signature());
418 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
419 }
421 #ifdef CC_INTERP
422 void Method::set_result_index(BasicType type) {
423 _result_index = Interpreter::BasicType_as_index(type);
424 }
425 #endif
427 BasicType Method::result_type() const {
428 ResultTypeFinder rtf(signature());
429 return rtf.type();
430 }
433 bool Method::is_empty_method() const {
434 return code_size() == 1
435 && *code_base() == Bytecodes::_return;
436 }
439 bool Method::is_vanilla_constructor() const {
440 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
441 // which only calls the superclass vanilla constructor and possibly does stores of
442 // zero constants to local fields:
443 //
444 // aload_0
445 // invokespecial
446 // indexbyte1
447 // indexbyte2
448 //
449 // followed by an (optional) sequence of:
450 //
451 // aload_0
452 // aconst_null / iconst_0 / fconst_0 / dconst_0
453 // putfield
454 // indexbyte1
455 // indexbyte2
456 //
457 // followed by:
458 //
459 // return
461 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
462 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
463 int size = code_size();
464 // Check if size match
465 if (size == 0 || size % 5 != 0) return false;
466 address cb = code_base();
467 int last = size - 1;
468 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
469 // Does not call superclass default constructor
470 return false;
471 }
472 // Check optional sequence
473 for (int i = 4; i < last; i += 5) {
474 if (cb[i] != Bytecodes::_aload_0) return false;
475 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
476 if (cb[i+2] != Bytecodes::_putfield) return false;
477 }
478 return true;
479 }
482 bool Method::compute_has_loops_flag() {
483 BytecodeStream bcs(this);
484 Bytecodes::Code bc;
486 while ((bc = bcs.next()) >= 0) {
487 switch( bc ) {
488 case Bytecodes::_ifeq:
489 case Bytecodes::_ifnull:
490 case Bytecodes::_iflt:
491 case Bytecodes::_ifle:
492 case Bytecodes::_ifne:
493 case Bytecodes::_ifnonnull:
494 case Bytecodes::_ifgt:
495 case Bytecodes::_ifge:
496 case Bytecodes::_if_icmpeq:
497 case Bytecodes::_if_icmpne:
498 case Bytecodes::_if_icmplt:
499 case Bytecodes::_if_icmpgt:
500 case Bytecodes::_if_icmple:
501 case Bytecodes::_if_icmpge:
502 case Bytecodes::_if_acmpeq:
503 case Bytecodes::_if_acmpne:
504 case Bytecodes::_goto:
505 case Bytecodes::_jsr:
506 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
507 break;
509 case Bytecodes::_goto_w:
510 case Bytecodes::_jsr_w:
511 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
512 break;
513 }
514 }
515 _access_flags.set_loops_flag_init();
516 return _access_flags.has_loops();
517 }
520 bool Method::is_final_method() const {
521 // %%% Should return true for private methods also,
522 // since there is no way to override them.
523 return is_final() || Klass::cast(method_holder())->is_final();
524 }
527 bool Method::is_strict_method() const {
528 return is_strict();
529 }
532 bool Method::can_be_statically_bound() const {
533 if (is_final_method()) return true;
534 return vtable_index() == nonvirtual_vtable_index;
535 }
538 bool Method::is_accessor() const {
539 if (code_size() != 5) return false;
540 if (size_of_parameters() != 1) return false;
541 if (java_code_at(0) != Bytecodes::_aload_0 ) return false;
542 if (java_code_at(1) != Bytecodes::_getfield) return false;
543 if (java_code_at(4) != Bytecodes::_areturn &&
544 java_code_at(4) != Bytecodes::_ireturn ) return false;
545 return true;
546 }
549 bool Method::is_initializer() const {
550 return name() == vmSymbols::object_initializer_name() || is_static_initializer();
551 }
553 bool Method::has_valid_initializer_flags() const {
554 return (is_static() ||
555 InstanceKlass::cast(method_holder())->major_version() < 51);
556 }
558 bool Method::is_static_initializer() const {
559 // For classfiles version 51 or greater, ensure that the clinit method is
560 // static. Non-static methods with the name "<clinit>" are not static
561 // initializers. (older classfiles exempted for backward compatibility)
562 return name() == vmSymbols::class_initializer_name() &&
563 has_valid_initializer_flags();
564 }
567 objArrayHandle Method::resolved_checked_exceptions_impl(Method* this_oop, TRAPS) {
568 int length = this_oop->checked_exceptions_length();
569 if (length == 0) { // common case
570 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
571 } else {
572 methodHandle h_this(THREAD, this_oop);
573 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
574 objArrayHandle mirrors (THREAD, m_oop);
575 for (int i = 0; i < length; i++) {
576 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
577 Klass* k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
578 assert(Klass::cast(k)->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
579 mirrors->obj_at_put(i, Klass::cast(k)->java_mirror());
580 }
581 return mirrors;
582 }
583 };
586 int Method::line_number_from_bci(int bci) const {
587 if (bci == SynchronizationEntryBCI) bci = 0;
588 assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci");
589 int best_bci = 0;
590 int best_line = -1;
592 if (has_linenumber_table()) {
593 // The line numbers are a short array of 2-tuples [start_pc, line_number].
594 // Not necessarily sorted and not necessarily one-to-one.
595 CompressedLineNumberReadStream stream(compressed_linenumber_table());
596 while (stream.read_pair()) {
597 if (stream.bci() == bci) {
598 // perfect match
599 return stream.line();
600 } else {
601 // update best_bci/line
602 if (stream.bci() < bci && stream.bci() >= best_bci) {
603 best_bci = stream.bci();
604 best_line = stream.line();
605 }
606 }
607 }
608 }
609 return best_line;
610 }
613 bool Method::is_klass_loaded_by_klass_index(int klass_index) const {
614 if( constants()->tag_at(klass_index).is_unresolved_klass() ) {
615 Thread *thread = Thread::current();
616 Symbol* klass_name = constants()->klass_name_at(klass_index);
617 Handle loader(thread, InstanceKlass::cast(method_holder())->class_loader());
618 Handle prot (thread, Klass::cast(method_holder())->protection_domain());
619 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
620 } else {
621 return true;
622 }
623 }
626 bool Method::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
627 int klass_index = constants()->klass_ref_index_at(refinfo_index);
628 if (must_be_resolved) {
629 // Make sure klass is resolved in constantpool.
630 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
631 }
632 return is_klass_loaded_by_klass_index(klass_index);
633 }
636 void Method::set_native_function(address function, bool post_event_flag) {
637 assert(function != NULL, "use clear_native_function to unregister natives");
638 assert(!is_method_handle_intrinsic() || function == SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), "");
639 address* native_function = native_function_addr();
641 // We can see racers trying to place the same native function into place. Once
642 // is plenty.
643 address current = *native_function;
644 if (current == function) return;
645 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
646 function != NULL) {
647 // native_method_throw_unsatisfied_link_error_entry() should only
648 // be passed when post_event_flag is false.
649 assert(function !=
650 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
651 "post_event_flag mis-match");
653 // post the bind event, and possible change the bind function
654 JvmtiExport::post_native_method_bind(this, &function);
655 }
656 *native_function = function;
657 // This function can be called more than once. We must make sure that we always
658 // use the latest registered method -> check if a stub already has been generated.
659 // If so, we have to make it not_entrant.
660 nmethod* nm = code(); // Put it into local variable to guard against concurrent updates
661 if (nm != NULL) {
662 nm->make_not_entrant();
663 }
664 }
667 bool Method::has_native_function() const {
668 if (is_method_handle_intrinsic())
669 return false; // special-cased in SharedRuntime::generate_native_wrapper
670 address func = native_function();
671 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
672 }
675 void Method::clear_native_function() {
676 // Note: is_method_handle_intrinsic() is allowed here.
677 set_native_function(
678 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
679 !native_bind_event_is_interesting);
680 clear_code();
681 }
683 address Method::critical_native_function() {
684 methodHandle mh(this);
685 return NativeLookup::lookup_critical_entry(mh);
686 }
689 void Method::set_signature_handler(address handler) {
690 address* signature_handler = signature_handler_addr();
691 *signature_handler = handler;
692 }
695 void Method::print_made_not_compilable(int comp_level, bool is_osr, bool report) {
696 if (PrintCompilation && report) {
697 ttyLocker ttyl;
698 tty->print("made not %scompilable on ", is_osr ? "OSR " : "");
699 if (comp_level == CompLevel_all) {
700 tty->print("all levels ");
701 } else {
702 tty->print("levels ");
703 for (int i = (int)CompLevel_none; i <= comp_level; i++) {
704 tty->print("%d ", i);
705 }
706 }
707 this->print_short_name(tty);
708 int size = this->code_size();
709 if (size > 0)
710 tty->print(" (%d bytes)", size);
711 tty->cr();
712 }
713 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
714 ttyLocker ttyl;
715 xtty->begin_elem("make_not_%scompilable thread='" UINTX_FORMAT "'",
716 is_osr ? "osr_" : "", os::current_thread_id());
717 xtty->method(this);
718 xtty->stamp();
719 xtty->end_elem();
720 }
721 }
723 bool Method::is_not_compilable(int comp_level) const {
724 if (number_of_breakpoints() > 0)
725 return true;
726 if (is_method_handle_intrinsic())
727 return !is_synthetic(); // the generated adapters must be compiled
728 if (comp_level == CompLevel_any)
729 return is_not_c1_compilable() || is_not_c2_compilable();
730 if (is_c1_compile(comp_level))
731 return is_not_c1_compilable();
732 if (is_c2_compile(comp_level))
733 return is_not_c2_compilable();
734 return false;
735 }
737 // call this when compiler finds that this method is not compilable
738 void Method::set_not_compilable(int comp_level, bool report) {
739 print_made_not_compilable(comp_level, /*is_osr*/ false, report);
740 if (comp_level == CompLevel_all) {
741 set_not_c1_compilable();
742 set_not_c2_compilable();
743 } else {
744 if (is_c1_compile(comp_level))
745 set_not_c1_compilable();
746 if (is_c2_compile(comp_level))
747 set_not_c2_compilable();
748 }
749 CompilationPolicy::policy()->disable_compilation(this);
750 }
752 bool Method::is_not_osr_compilable(int comp_level) const {
753 if (is_not_compilable(comp_level))
754 return true;
755 if (comp_level == CompLevel_any)
756 return is_not_c1_osr_compilable() || is_not_c2_osr_compilable();
757 if (is_c1_compile(comp_level))
758 return is_not_c1_osr_compilable();
759 if (is_c2_compile(comp_level))
760 return is_not_c2_osr_compilable();
761 return false;
762 }
764 void Method::set_not_osr_compilable(int comp_level, bool report) {
765 print_made_not_compilable(comp_level, /*is_osr*/ true, report);
766 if (comp_level == CompLevel_all) {
767 set_not_c1_osr_compilable();
768 set_not_c2_osr_compilable();
769 } else {
770 if (is_c1_compile(comp_level))
771 set_not_c1_osr_compilable();
772 if (is_c2_compile(comp_level))
773 set_not_c2_osr_compilable();
774 }
775 CompilationPolicy::policy()->disable_compilation(this);
776 }
778 // Revert to using the interpreter and clear out the nmethod
779 void Method::clear_code() {
781 // this may be NULL if c2i adapters have not been made yet
782 // Only should happen at allocate time.
783 if (_adapter == NULL) {
784 _from_compiled_entry = NULL;
785 } else {
786 _from_compiled_entry = _adapter->get_c2i_entry();
787 }
788 OrderAccess::storestore();
789 _from_interpreted_entry = _i2i_entry;
790 OrderAccess::storestore();
791 _code = NULL;
792 }
794 // Called by class data sharing to remove any entry points (which are not shared)
795 void Method::unlink_method() {
796 _code = NULL;
797 _i2i_entry = NULL;
798 _from_interpreted_entry = NULL;
799 if (is_native()) {
800 *native_function_addr() = NULL;
801 set_signature_handler(NULL);
802 }
803 NOT_PRODUCT(set_compiled_invocation_count(0);)
804 invocation_counter()->reset();
805 backedge_counter()->reset();
806 _adapter = NULL;
807 _from_compiled_entry = NULL;
808 assert(_method_data == NULL, "unexpected method data?");
809 set_method_data(NULL);
810 set_interpreter_throwout_count(0);
811 set_interpreter_invocation_count(0);
812 }
814 // Called when the method_holder is getting linked. Setup entrypoints so the method
815 // is ready to be called from interpreter, compiler, and vtables.
816 void Method::link_method(methodHandle h_method, TRAPS) {
817 // If the code cache is full, we may reenter this function for the
818 // leftover methods that weren't linked.
819 if (_i2i_entry != NULL) return;
821 assert(_adapter == NULL, "init'd to NULL" );
822 assert( _code == NULL, "nothing compiled yet" );
824 // Setup interpreter entrypoint
825 assert(this == h_method(), "wrong h_method()" );
826 address entry = Interpreter::entry_for_method(h_method);
827 assert(entry != NULL, "interpreter entry must be non-null");
828 // Sets both _i2i_entry and _from_interpreted_entry
829 set_interpreter_entry(entry);
830 if (is_native() && !is_method_handle_intrinsic()) {
831 set_native_function(
832 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
833 !native_bind_event_is_interesting);
834 }
836 // Setup compiler entrypoint. This is made eagerly, so we do not need
837 // special handling of vtables. An alternative is to make adapters more
838 // lazily by calling make_adapter() from from_compiled_entry() for the
839 // normal calls. For vtable calls life gets more complicated. When a
840 // call-site goes mega-morphic we need adapters in all methods which can be
841 // called from the vtable. We need adapters on such methods that get loaded
842 // later. Ditto for mega-morphic itable calls. If this proves to be a
843 // problem we'll make these lazily later.
844 (void) make_adapters(h_method, CHECK);
846 // ONLY USE the h_method now as make_adapter may have blocked
848 }
850 address Method::make_adapters(methodHandle mh, TRAPS) {
851 // Adapters for compiled code are made eagerly here. They are fairly
852 // small (generally < 100 bytes) and quick to make (and cached and shared)
853 // so making them eagerly shouldn't be too expensive.
854 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
855 if (adapter == NULL ) {
856 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "out of space in CodeCache for adapters");
857 }
859 mh->set_adapter_entry(adapter);
860 mh->_from_compiled_entry = adapter->get_c2i_entry();
861 return adapter->get_c2i_entry();
862 }
864 // The verified_code_entry() must be called when a invoke is resolved
865 // on this method.
867 // It returns the compiled code entry point, after asserting not null.
868 // This function is called after potential safepoints so that nmethod
869 // or adapter that it points to is still live and valid.
870 // This function must not hit a safepoint!
871 address Method::verified_code_entry() {
872 debug_only(No_Safepoint_Verifier nsv;)
873 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
874 if (code == NULL && UseCodeCacheFlushing) {
875 nmethod *saved_code = CodeCache::find_and_remove_saved_code(this);
876 if (saved_code != NULL) {
877 methodHandle method(this);
878 assert( ! saved_code->is_osr_method(), "should not get here for osr" );
879 set_code( method, saved_code );
880 }
881 }
883 assert(_from_compiled_entry != NULL, "must be set");
884 return _from_compiled_entry;
885 }
887 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
888 // (could be racing a deopt).
889 // Not inline to avoid circular ref.
890 bool Method::check_code() const {
891 // cached in a register or local. There's a race on the value of the field.
892 nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code);
893 return code == NULL || (code->method() == NULL) || (code->method() == (Method*)this && !code->is_osr_method());
894 }
896 // Install compiled code. Instantly it can execute.
897 void Method::set_code(methodHandle mh, nmethod *code) {
898 assert( code, "use clear_code to remove code" );
899 assert( mh->check_code(), "" );
901 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
903 // These writes must happen in this order, because the interpreter will
904 // directly jump to from_interpreted_entry which jumps to an i2c adapter
905 // which jumps to _from_compiled_entry.
906 mh->_code = code; // Assign before allowing compiled code to exec
908 int comp_level = code->comp_level();
909 // In theory there could be a race here. In practice it is unlikely
910 // and not worth worrying about.
911 if (comp_level > mh->highest_comp_level()) {
912 mh->set_highest_comp_level(comp_level);
913 }
915 OrderAccess::storestore();
916 #ifdef SHARK
917 mh->_from_interpreted_entry = code->insts_begin();
918 #else //!SHARK
919 mh->_from_compiled_entry = code->verified_entry_point();
920 OrderAccess::storestore();
921 // Instantly compiled code can execute.
922 if (!mh->is_method_handle_intrinsic())
923 mh->_from_interpreted_entry = mh->get_i2c_entry();
924 #endif //!SHARK
925 }
928 bool Method::is_overridden_in(Klass* k) const {
929 InstanceKlass* ik = InstanceKlass::cast(k);
931 if (ik->is_interface()) return false;
933 // If method is an interface, we skip it - except if it
934 // is a miranda method
935 if (InstanceKlass::cast(method_holder())->is_interface()) {
936 // Check that method is not a miranda method
937 if (ik->lookup_method(name(), signature()) == NULL) {
938 // No implementation exist - so miranda method
939 return false;
940 }
941 return true;
942 }
944 assert(ik->is_subclass_of(method_holder()), "should be subklass");
945 assert(ik->vtable() != NULL, "vtable should exist");
946 if (vtable_index() == nonvirtual_vtable_index) {
947 return false;
948 } else {
949 Method* vt_m = ik->method_at_vtable(vtable_index());
950 return vt_m != this;
951 }
952 }
955 // give advice about whether this Method* should be cached or not
956 bool Method::should_not_be_cached() const {
957 if (is_old()) {
958 // This method has been redefined. It is either EMCP or obsolete
959 // and we don't want to cache it because that would pin the method
960 // down and prevent it from being collectible if and when it
961 // finishes executing.
962 return true;
963 }
965 // caching this method should be just fine
966 return false;
967 }
969 // Constant pool structure for invoke methods:
970 enum {
971 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc.
972 _imcp_invoke_signature, // utf8: (variable Symbol*)
973 _imcp_limit
974 };
976 // Test if this method is an MH adapter frame generated by Java code.
977 // Cf. java/lang/invoke/InvokerBytecodeGenerator
978 bool Method::is_compiled_lambda_form() const {
979 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm;
980 }
982 // Test if this method is an internal MH primitive method.
983 bool Method::is_method_handle_intrinsic() const {
984 vmIntrinsics::ID iid = intrinsic_id();
985 return (MethodHandles::is_signature_polymorphic(iid) &&
986 MethodHandles::is_signature_polymorphic_intrinsic(iid));
987 }
989 bool Method::has_member_arg() const {
990 vmIntrinsics::ID iid = intrinsic_id();
991 return (MethodHandles::is_signature_polymorphic(iid) &&
992 MethodHandles::has_member_arg(iid));
993 }
995 // Make an instance of a signature-polymorphic internal MH primitive.
996 methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid,
997 Symbol* signature,
998 TRAPS) {
999 ResourceMark rm;
1000 methodHandle empty;
1002 KlassHandle holder = SystemDictionary::MethodHandle_klass();
1003 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid);
1004 assert(iid == MethodHandles::signature_polymorphic_name_id(name), "");
1005 if (TraceMethodHandles) {
1006 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string());
1007 }
1009 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup)
1010 name->increment_refcount();
1011 signature->increment_refcount();
1013 int cp_length = _imcp_limit;
1014 ClassLoaderData* loader_data = holder->class_loader_data();
1015 constantPoolHandle cp;
1016 {
1017 ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty));
1018 cp = constantPoolHandle(THREAD, cp_oop);
1019 }
1020 cp->set_pool_holder(holder());
1021 cp->symbol_at_put(_imcp_invoke_name, name);
1022 cp->symbol_at_put(_imcp_invoke_signature, signature);
1023 cp->set_preresolution();
1025 // decide on access bits: public or not?
1026 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL);
1027 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid);
1028 if (must_be_static) flags_bits |= JVM_ACC_STATIC;
1029 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods");
1031 methodHandle m;
1032 {
1033 Method* m_oop = Method::allocate(loader_data, 0, accessFlags_from(flags_bits),
1034 0, 0, 0, 0, CHECK_(empty));
1035 m = methodHandle(THREAD, m_oop);
1036 }
1037 m->set_constants(cp());
1038 m->set_name_index(_imcp_invoke_name);
1039 m->set_signature_index(_imcp_invoke_signature);
1040 assert(MethodHandles::is_signature_polymorphic_name(m->name()), "");
1041 assert(m->signature() == signature, "");
1042 #ifdef CC_INTERP
1043 ResultTypeFinder rtf(signature);
1044 m->set_result_index(rtf.type());
1045 #endif
1046 m->compute_size_of_parameters(THREAD);
1047 m->init_intrinsic_id();
1048 assert(m->is_method_handle_intrinsic(), "");
1049 #ifdef ASSERT
1050 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print();
1051 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker");
1052 assert(m->intrinsic_id() == iid, "correctly predicted iid");
1053 #endif //ASSERT
1055 // Finally, set up its entry points.
1056 assert(m->can_be_statically_bound(), "");
1057 m->set_vtable_index(Method::nonvirtual_vtable_index);
1058 m->link_method(m, CHECK_(empty));
1060 if (TraceMethodHandles && (Verbose || WizardMode))
1061 m->print_on(tty);
1063 return m;
1064 }
1066 Klass* Method::check_non_bcp_klass(Klass* klass) {
1067 if (klass != NULL && Klass::cast(klass)->class_loader() != NULL) {
1068 if (Klass::cast(klass)->oop_is_objArray())
1069 klass = objArrayKlass::cast(klass)->bottom_klass();
1070 return klass;
1071 }
1072 return NULL;
1073 }
1076 methodHandle Method::clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length,
1077 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
1078 // Code below does not work for native methods - they should never get rewritten anyway
1079 assert(!m->is_native(), "cannot rewrite native methods");
1080 // Allocate new Method*
1081 AccessFlags flags = m->access_flags();
1082 int checked_exceptions_len = m->checked_exceptions_length();
1083 int localvariable_len = m->localvariable_table_length();
1084 int exception_table_len = m->exception_table_length();
1086 ClassLoaderData* loader_data = m()->method_holder()->class_loader_data();
1087 Method* newm_oop = Method::allocate(loader_data,
1088 new_code_length,
1089 flags,
1090 new_compressed_linenumber_size,
1091 localvariable_len,
1092 exception_table_len,
1093 checked_exceptions_len,
1094 CHECK_(methodHandle()));
1095 methodHandle newm (THREAD, newm_oop);
1096 int new_method_size = newm->method_size();
1098 // Create a shallow copy of Method part, but be careful to preserve the new ConstMethod*
1099 ConstMethod* newcm = newm->constMethod();
1100 int new_const_method_size = newm->constMethod()->size();
1102 memcpy(newm(), m(), sizeof(Method));
1104 // Create shallow copy of ConstMethod.
1105 memcpy(newcm, m->constMethod(), sizeof(ConstMethod));
1107 // Reset correct method/const method, method size, and parameter info
1108 newm->set_constMethod(newcm);
1109 newm->constMethod()->set_code_size(new_code_length);
1110 newm->constMethod()->set_constMethod_size(new_const_method_size);
1111 newm->set_method_size(new_method_size);
1112 assert(newm->code_size() == new_code_length, "check");
1113 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1114 assert(newm->exception_table_length() == exception_table_len, "check");
1115 assert(newm->localvariable_table_length() == localvariable_len, "check");
1116 // Copy new byte codes
1117 memcpy(newm->code_base(), new_code, new_code_length);
1118 // Copy line number table
1119 if (new_compressed_linenumber_size > 0) {
1120 memcpy(newm->compressed_linenumber_table(),
1121 new_compressed_linenumber_table,
1122 new_compressed_linenumber_size);
1123 }
1124 // Copy checked_exceptions
1125 if (checked_exceptions_len > 0) {
1126 memcpy(newm->checked_exceptions_start(),
1127 m->checked_exceptions_start(),
1128 checked_exceptions_len * sizeof(CheckedExceptionElement));
1129 }
1130 // Copy exception table
1131 if (exception_table_len > 0) {
1132 memcpy(newm->exception_table_start(),
1133 m->exception_table_start(),
1134 exception_table_len * sizeof(ExceptionTableElement));
1135 }
1136 // Copy local variable number table
1137 if (localvariable_len > 0) {
1138 memcpy(newm->localvariable_table_start(),
1139 m->localvariable_table_start(),
1140 localvariable_len * sizeof(LocalVariableTableElement));
1141 }
1142 // Copy stackmap table
1143 if (m->has_stackmap_table()) {
1144 int code_attribute_length = m->stackmap_data()->length();
1145 Array<u1>* stackmap_data =
1146 MetadataFactory::new_array<u1>(loader_data, code_attribute_length, 0, CHECK_NULL);
1147 memcpy((void*)stackmap_data->adr_at(0),
1148 (void*)m->stackmap_data()->adr_at(0), code_attribute_length);
1149 newm->set_stackmap_data(stackmap_data);
1150 }
1152 return newm;
1153 }
1155 vmSymbols::SID Method::klass_id_for_intrinsics(Klass* holder) {
1156 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1157 // because we are not loading from core libraries
1158 if (InstanceKlass::cast(holder)->class_loader() != NULL)
1159 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1161 // see if the klass name is well-known:
1162 Symbol* klass_name = InstanceKlass::cast(holder)->name();
1163 return vmSymbols::find_sid(klass_name);
1164 }
1166 void Method::init_intrinsic_id() {
1167 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1168 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1169 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1170 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1172 // the klass name is well-known:
1173 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1174 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1176 // ditto for method and signature:
1177 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1178 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1179 && name_id == vmSymbols::NO_SID)
1180 return;
1181 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1182 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1183 && sig_id == vmSymbols::NO_SID) return;
1184 jshort flags = access_flags().as_short();
1186 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1187 if (id != vmIntrinsics::_none) {
1188 set_intrinsic_id(id);
1189 return;
1190 }
1192 // A few slightly irregular cases:
1193 switch (klass_id) {
1194 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1195 // Second chance: check in regular Math.
1196 switch (name_id) {
1197 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1198 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1199 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1200 // pretend it is the corresponding method in the non-strict class:
1201 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1202 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1203 break;
1204 }
1205 break;
1207 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*.
1208 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle):
1209 if (!is_native()) break;
1210 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name());
1211 if (is_static() != MethodHandles::is_signature_polymorphic_static(id))
1212 id = vmIntrinsics::_none;
1213 break;
1214 }
1216 if (id != vmIntrinsics::_none) {
1217 // Set up its iid. It is an alias method.
1218 set_intrinsic_id(id);
1219 return;
1220 }
1221 }
1223 // These two methods are static since a GC may move the Method
1224 bool Method::load_signature_classes(methodHandle m, TRAPS) {
1225 if (THREAD->is_Compiler_thread()) {
1226 // There is nothing useful this routine can do from within the Compile thread.
1227 // Hopefully, the signature contains only well-known classes.
1228 // We could scan for this and return true/false, but the caller won't care.
1229 return false;
1230 }
1231 bool sig_is_loaded = true;
1232 Handle class_loader(THREAD, InstanceKlass::cast(m->method_holder())->class_loader());
1233 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1234 ResourceMark rm(THREAD);
1235 Symbol* signature = m->signature();
1236 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1237 if (ss.is_object()) {
1238 Symbol* sym = ss.as_symbol(CHECK_(false));
1239 Symbol* name = sym;
1240 Klass* klass = SystemDictionary::resolve_or_null(name, class_loader,
1241 protection_domain, THREAD);
1242 // We are loading classes eagerly. If a ClassNotFoundException or
1243 // a LinkageError was generated, be sure to ignore it.
1244 if (HAS_PENDING_EXCEPTION) {
1245 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1246 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1247 CLEAR_PENDING_EXCEPTION;
1248 } else {
1249 return false;
1250 }
1251 }
1252 if( klass == NULL) { sig_is_loaded = false; }
1253 }
1254 }
1255 return sig_is_loaded;
1256 }
1258 bool Method::has_unloaded_classes_in_signature(methodHandle m, TRAPS) {
1259 Handle class_loader(THREAD, InstanceKlass::cast(m->method_holder())->class_loader());
1260 Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain());
1261 ResourceMark rm(THREAD);
1262 Symbol* signature = m->signature();
1263 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1264 if (ss.type() == T_OBJECT) {
1265 Symbol* name = ss.as_symbol_or_null();
1266 if (name == NULL) return true;
1267 Klass* klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1268 if (klass == NULL) return true;
1269 }
1270 }
1271 return false;
1272 }
1274 // Exposed so field engineers can debug VM
1275 void Method::print_short_name(outputStream* st) {
1276 ResourceMark rm;
1277 #ifdef PRODUCT
1278 st->print(" %s::", method_holder()->external_name());
1279 #else
1280 st->print(" %s::", method_holder()->internal_name());
1281 #endif
1282 name()->print_symbol_on(st);
1283 if (WizardMode) signature()->print_symbol_on(st);
1284 else if (MethodHandles::is_signature_polymorphic(intrinsic_id()))
1285 MethodHandles::print_as_basic_type_signature_on(st, signature(), true);
1286 }
1288 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1289 static void reorder_based_on_method_index(Array<Method*>* methods,
1290 Array<AnnotationArray*>* annotations,
1291 GrowableArray<AnnotationArray*>* temp_array) {
1292 if (annotations == NULL) {
1293 return;
1294 }
1296 int length = methods->length();
1297 int i;
1298 // Copy to temp array
1299 temp_array->clear();
1300 for (i = 0; i < length; i++) {
1301 temp_array->append(annotations->at(i));
1302 }
1304 // Copy back using old method indices
1305 for (i = 0; i < length; i++) {
1306 Method* m = methods->at(i);
1307 annotations->at_put(i, temp_array->at(m->method_idnum()));
1308 }
1309 }
1311 // Comparer for sorting an object array containing
1312 // Method*s.
1313 static int method_comparator(Method* a, Method* b) {
1314 return a->name()->fast_compare(b->name());
1315 }
1317 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1318 void Method::sort_methods(Array<Method*>* methods,
1319 Array<AnnotationArray*>* methods_annotations,
1320 Array<AnnotationArray*>* methods_parameter_annotations,
1321 Array<AnnotationArray*>* methods_default_annotations,
1322 bool idempotent) {
1323 int length = methods->length();
1324 if (length > 1) {
1325 bool do_annotations = false;
1326 if (methods_annotations != NULL ||
1327 methods_parameter_annotations != NULL ||
1328 methods_default_annotations != NULL) {
1329 do_annotations = true;
1330 }
1331 if (do_annotations) {
1332 // Remember current method ordering so we can reorder annotations
1333 for (int i = 0; i < length; i++) {
1334 Method* m = methods->at(i);
1335 m->set_method_idnum(i);
1336 }
1337 }
1338 {
1339 No_Safepoint_Verifier nsv;
1340 QuickSort::sort<Method*>(methods->data(), length, method_comparator, idempotent);
1341 }
1343 // Sort annotations if necessary
1344 assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), "");
1345 assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), "");
1346 assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), "");
1347 if (do_annotations) {
1348 ResourceMark rm;
1349 // Allocate temporary storage
1350 GrowableArray<AnnotationArray*>* temp_array = new GrowableArray<AnnotationArray*>(length);
1351 reorder_based_on_method_index(methods, methods_annotations, temp_array);
1352 reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array);
1353 reorder_based_on_method_index(methods, methods_default_annotations, temp_array);
1354 }
1356 // Reset method ordering
1357 for (int i = 0; i < length; i++) {
1358 Method* m = methods->at(i);
1359 m->set_method_idnum(i);
1360 }
1361 }
1362 }
1365 //-----------------------------------------------------------------------------------
1366 // Non-product code
1368 #ifndef PRODUCT
1369 class SignatureTypePrinter : public SignatureTypeNames {
1370 private:
1371 outputStream* _st;
1372 bool _use_separator;
1374 void type_name(const char* name) {
1375 if (_use_separator) _st->print(", ");
1376 _st->print(name);
1377 _use_separator = true;
1378 }
1380 public:
1381 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) {
1382 _st = st;
1383 _use_separator = false;
1384 }
1386 void print_parameters() { _use_separator = false; iterate_parameters(); }
1387 void print_returntype() { _use_separator = false; iterate_returntype(); }
1388 };
1391 void Method::print_name(outputStream* st) {
1392 Thread *thread = Thread::current();
1393 ResourceMark rm(thread);
1394 SignatureTypePrinter sig(signature(), st);
1395 st->print("%s ", is_static() ? "static" : "virtual");
1396 sig.print_returntype();
1397 st->print(" %s.", method_holder()->internal_name());
1398 name()->print_symbol_on(st);
1399 st->print("(");
1400 sig.print_parameters();
1401 st->print(")");
1402 }
1405 void Method::print_codes_on(outputStream* st) const {
1406 print_codes_on(0, code_size(), st);
1407 }
1409 void Method::print_codes_on(int from, int to, outputStream* st) const {
1410 Thread *thread = Thread::current();
1411 ResourceMark rm(thread);
1412 methodHandle mh (thread, (Method*)this);
1413 BytecodeStream s(mh);
1414 s.set_interval(from, to);
1415 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1416 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1417 }
1418 #endif // not PRODUCT
1421 // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas
1422 // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned)
1423 // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used
1424 // as end-of-stream terminator.
1426 void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) {
1427 // bci and line number does not compress into single byte.
1428 // Write out escape character and use regular compression for bci and line number.
1429 write_byte((jubyte)0xFF);
1430 write_signed_int(bci_delta);
1431 write_signed_int(line_delta);
1432 }
1434 // See comment in method.hpp which explains why this exists.
1435 #if defined(_M_AMD64) && _MSC_VER >= 1400
1436 #pragma optimize("", off)
1437 void CompressedLineNumberWriteStream::write_pair(int bci, int line) {
1438 write_pair_inline(bci, line);
1439 }
1440 #pragma optimize("", on)
1441 #endif
1443 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1444 _bci = 0;
1445 _line = 0;
1446 };
1449 bool CompressedLineNumberReadStream::read_pair() {
1450 jubyte next = read_byte();
1451 // Check for terminator
1452 if (next == 0) return false;
1453 if (next == 0xFF) {
1454 // Escape character, regular compression used
1455 _bci += read_signed_int();
1456 _line += read_signed_int();
1457 } else {
1458 // Single byte compression used
1459 _bci += next >> 3;
1460 _line += next & 0x7;
1461 }
1462 return true;
1463 }
1466 Bytecodes::Code Method::orig_bytecode_at(int bci) const {
1467 BreakpointInfo* bp = InstanceKlass::cast(method_holder())->breakpoints();
1468 for (; bp != NULL; bp = bp->next()) {
1469 if (bp->match(this, bci)) {
1470 return bp->orig_bytecode();
1471 }
1472 }
1473 ShouldNotReachHere();
1474 return Bytecodes::_shouldnotreachhere;
1475 }
1477 void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1478 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1479 BreakpointInfo* bp = InstanceKlass::cast(method_holder())->breakpoints();
1480 for (; bp != NULL; bp = bp->next()) {
1481 if (bp->match(this, bci)) {
1482 bp->set_orig_bytecode(code);
1483 // and continue, in case there is more than one
1484 }
1485 }
1486 }
1488 void Method::set_breakpoint(int bci) {
1489 InstanceKlass* ik = InstanceKlass::cast(method_holder());
1490 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1491 bp->set_next(ik->breakpoints());
1492 ik->set_breakpoints(bp);
1493 // do this last:
1494 bp->set(this);
1495 }
1497 static void clear_matches(Method* m, int bci) {
1498 InstanceKlass* ik = InstanceKlass::cast(m->method_holder());
1499 BreakpointInfo* prev_bp = NULL;
1500 BreakpointInfo* next_bp;
1501 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1502 next_bp = bp->next();
1503 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1504 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1505 // do this first:
1506 bp->clear(m);
1507 // unhook it
1508 if (prev_bp != NULL)
1509 prev_bp->set_next(next_bp);
1510 else
1511 ik->set_breakpoints(next_bp);
1512 delete bp;
1513 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1514 // at same location. So we have multiple matching (method_index and bci)
1515 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1516 // breakpoint for clear_breakpoint request and keep all other method versions
1517 // BreakpointInfo for future clear_breakpoint request.
1518 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1519 // which is being called when class is unloaded. We delete all the Breakpoint
1520 // information for all versions of method. We may not correctly restore the original
1521 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1522 // so these methods won't be used anymore.
1523 if (bci >= 0) {
1524 break;
1525 }
1526 } else {
1527 // This one is a keeper.
1528 prev_bp = bp;
1529 }
1530 }
1531 }
1533 void Method::clear_breakpoint(int bci) {
1534 assert(bci >= 0, "");
1535 clear_matches(this, bci);
1536 }
1538 void Method::clear_all_breakpoints() {
1539 clear_matches(this, -1);
1540 }
1543 int Method::invocation_count() {
1544 if (TieredCompilation) {
1545 MethodData* const mdo = method_data();
1546 if (invocation_counter()->carry() || ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1547 return InvocationCounter::count_limit;
1548 } else {
1549 return invocation_counter()->count() + ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1550 }
1551 } else {
1552 return invocation_counter()->count();
1553 }
1554 }
1556 int Method::backedge_count() {
1557 if (TieredCompilation) {
1558 MethodData* const mdo = method_data();
1559 if (backedge_counter()->carry() || ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1560 return InvocationCounter::count_limit;
1561 } else {
1562 return backedge_counter()->count() + ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1563 }
1564 } else {
1565 return backedge_counter()->count();
1566 }
1567 }
1569 int Method::highest_comp_level() const {
1570 MethodData* mdo = method_data();
1571 if (mdo != NULL) {
1572 return mdo->highest_comp_level();
1573 } else {
1574 return CompLevel_none;
1575 }
1576 }
1578 int Method::highest_osr_comp_level() const {
1579 MethodData* mdo = method_data();
1580 if (mdo != NULL) {
1581 return mdo->highest_osr_comp_level();
1582 } else {
1583 return CompLevel_none;
1584 }
1585 }
1587 void Method::set_highest_comp_level(int level) {
1588 MethodData* mdo = method_data();
1589 if (mdo != NULL) {
1590 mdo->set_highest_comp_level(level);
1591 }
1592 }
1594 void Method::set_highest_osr_comp_level(int level) {
1595 MethodData* mdo = method_data();
1596 if (mdo != NULL) {
1597 mdo->set_highest_osr_comp_level(level);
1598 }
1599 }
1601 BreakpointInfo::BreakpointInfo(Method* m, int bci) {
1602 _bci = bci;
1603 _name_index = m->name_index();
1604 _signature_index = m->signature_index();
1605 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1606 if (_orig_bytecode == Bytecodes::_breakpoint)
1607 _orig_bytecode = m->orig_bytecode_at(_bci);
1608 _next = NULL;
1609 }
1611 void BreakpointInfo::set(Method* method) {
1612 #ifdef ASSERT
1613 {
1614 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1615 if (code == Bytecodes::_breakpoint)
1616 code = method->orig_bytecode_at(_bci);
1617 assert(orig_bytecode() == code, "original bytecode must be the same");
1618 }
1619 #endif
1620 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1621 method->incr_number_of_breakpoints();
1622 SystemDictionary::notice_modification();
1623 {
1624 // Deoptimize all dependents on this method
1625 Thread *thread = Thread::current();
1626 HandleMark hm(thread);
1627 methodHandle mh(thread, method);
1628 Universe::flush_dependents_on_method(mh);
1629 }
1630 }
1632 void BreakpointInfo::clear(Method* method) {
1633 *method->bcp_from(_bci) = orig_bytecode();
1634 assert(method->number_of_breakpoints() > 0, "must not go negative");
1635 method->decr_number_of_breakpoints();
1636 }
1638 // jmethodID handling
1640 // This is a block allocating object, sort of like JNIHandleBlock, only a
1641 // lot simpler. There aren't many of these, they aren't long, they are rarely
1642 // deleted and so we can do some suboptimal things.
1643 // It's allocated on the CHeap because once we allocate a jmethodID, we can
1644 // never get rid of it.
1645 // It would be nice to be able to parameterize the number of methods for
1646 // the null_class_loader but then we'd have to turn this and ClassLoaderData
1647 // into templates.
1649 // I feel like this brain dead class should exist somewhere in the STL
1651 class JNIMethodBlock : public CHeapObj<mtClass> {
1652 enum { number_of_methods = 8 };
1654 Method* _methods[number_of_methods];
1655 int _top;
1656 JNIMethodBlock* _next;
1657 public:
1658 static Method* const _free_method;
1660 JNIMethodBlock() : _next(NULL), _top(0) {
1661 for (int i = 0; i< number_of_methods; i++) _methods[i] = _free_method;
1662 }
1664 Method** add_method(Method* m) {
1665 if (_top < number_of_methods) {
1666 // top points to the next free entry.
1667 int i = _top;
1668 _methods[i] = m;
1669 _top++;
1670 return &_methods[i];
1671 } else if (_top == number_of_methods) {
1672 // if the next free entry ran off the block see if there's a free entry
1673 for (int i = 0; i< number_of_methods; i++) {
1674 if (_methods[i] == _free_method) {
1675 _methods[i] = m;
1676 return &_methods[i];
1677 }
1678 }
1679 // Only check each block once for frees. They're very unlikely.
1680 // Increment top past the end of the block.
1681 _top++;
1682 }
1683 // need to allocate a next block.
1684 if (_next == NULL) {
1685 _next = new JNIMethodBlock();
1686 }
1687 return _next->add_method(m);
1688 }
1690 bool contains(Method** m) {
1691 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1692 for (int i = 0; i< number_of_methods; i++) {
1693 if (&(b->_methods[i]) == m) {
1694 return true;
1695 }
1696 }
1697 }
1698 return false; // not found
1699 }
1701 // Doesn't really destroy it, just marks it as free so it can be reused.
1702 void destroy_method(Method** m) {
1703 #ifdef ASSERT
1704 assert(contains(m), "should be a methodID");
1705 #endif // ASSERT
1706 *m = _free_method;
1707 }
1709 // During class unloading the methods are cleared, which is different
1710 // than freed.
1711 void clear_all_methods() {
1712 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1713 for (int i = 0; i< number_of_methods; i++) {
1714 _methods[i] = NULL;
1715 }
1716 }
1717 }
1718 #ifndef PRODUCT
1719 int count_methods() {
1720 // count all allocated methods
1721 int count = 0;
1722 for (JNIMethodBlock* b = this; b != NULL; b = b->_next) {
1723 for (int i = 0; i< number_of_methods; i++) {
1724 if (_methods[i] != _free_method) count++;
1725 }
1726 }
1727 return count;
1728 }
1729 #endif // PRODUCT
1730 };
1732 // Something that can't be mistaken for an address or a markOop
1733 Method* const JNIMethodBlock::_free_method = (Method*)55;
1735 // Add a method id to the jmethod_ids
1736 jmethodID Method::make_jmethod_id(ClassLoaderData* loader_data, Method* m) {
1737 ClassLoaderData* cld = loader_data;
1739 if (!SafepointSynchronize::is_at_safepoint()) {
1740 // Have to add jmethod_ids() to class loader data thread-safely.
1741 // Also have to add the method to the list safely, which the cld lock
1742 // protects as well.
1743 MutexLockerEx ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag);
1744 if (cld->jmethod_ids() == NULL) {
1745 cld->set_jmethod_ids(new JNIMethodBlock());
1746 }
1747 // jmethodID is a pointer to Method*
1748 return (jmethodID)cld->jmethod_ids()->add_method(m);
1749 } else {
1750 // At safepoint, we are single threaded and can set this.
1751 if (cld->jmethod_ids() == NULL) {
1752 cld->set_jmethod_ids(new JNIMethodBlock());
1753 }
1754 // jmethodID is a pointer to Method*
1755 return (jmethodID)cld->jmethod_ids()->add_method(m);
1756 }
1757 }
1759 // Mark a jmethodID as free. This is called when there is a data race in
1760 // InstanceKlass while creating the jmethodID cache.
1761 void Method::destroy_jmethod_id(ClassLoaderData* loader_data, jmethodID m) {
1762 ClassLoaderData* cld = loader_data;
1763 Method** ptr = (Method**)m;
1764 assert(cld->jmethod_ids() != NULL, "should have method handles");
1765 cld->jmethod_ids()->destroy_method(ptr);
1766 }
1768 void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* new_method) {
1769 // Can't assert the method_holder is the same because the new method has the
1770 // scratch method holder.
1771 assert(resolve_jmethod_id(jmid)->method_holder()->class_loader()
1772 == new_method->method_holder()->class_loader(),
1773 "changing to a different class loader");
1774 // Just change the method in place, jmethodID pointer doesn't change.
1775 *((Method**)jmid) = new_method;
1776 }
1778 bool Method::is_method_id(jmethodID mid) {
1779 Method* m = resolve_jmethod_id(mid);
1780 assert(m != NULL, "should be called with non-null method");
1781 InstanceKlass* ik = InstanceKlass::cast(m->method_holder());
1782 ClassLoaderData* cld = ik->class_loader_data();
1783 if (cld->jmethod_ids() == NULL) return false;
1784 return (cld->jmethod_ids()->contains((Method**)mid));
1785 }
1787 Method* Method::checked_resolve_jmethod_id(jmethodID mid) {
1788 if (mid == NULL) return NULL;
1789 Method* o = resolve_jmethod_id(mid);
1790 if (o == NULL || o == JNIMethodBlock::_free_method || !((Metadata*)o)->is_method()) {
1791 return NULL;
1792 }
1793 return o;
1794 };
1796 void Method::set_on_stack(const bool value) {
1797 // Set both the method itself and its constant pool. The constant pool
1798 // on stack means some method referring to it is also on the stack.
1799 _access_flags.set_on_stack(value);
1800 constants()->set_on_stack(value);
1801 if (value) MetadataOnStackMark::record(this);
1802 }
1804 // Called when the class loader is unloaded to make all methods weak.
1805 void Method::clear_jmethod_ids(ClassLoaderData* loader_data) {
1806 loader_data->jmethod_ids()->clear_all_methods();
1807 }
1809 #ifndef PRODUCT
1810 void Method::print_jmethod_ids(ClassLoaderData* loader_data, outputStream* out) {
1811 out->print_cr("jni_method_id count = %d", loader_data->jmethod_ids()->count_methods());
1812 }
1813 #endif // PRODUCT
1816 // Printing
1818 #ifndef PRODUCT
1820 void Method::print_on(outputStream* st) const {
1821 ResourceMark rm;
1822 assert(is_method(), "must be method");
1823 st->print_cr(internal_name());
1824 // get the effect of PrintOopAddress, always, for methods:
1825 st->print_cr(" - this oop: "INTPTR_FORMAT, (intptr_t)this);
1826 st->print (" - method holder: "); method_holder()->print_value_on(st); st->cr();
1827 st->print (" - constants: "INTPTR_FORMAT" ", (address)constants());
1828 constants()->print_value_on(st); st->cr();
1829 st->print (" - access: 0x%x ", access_flags().as_int()); access_flags().print_on(st); st->cr();
1830 st->print (" - name: "); name()->print_value_on(st); st->cr();
1831 st->print (" - signature: "); signature()->print_value_on(st); st->cr();
1832 st->print_cr(" - max stack: %d", max_stack());
1833 st->print_cr(" - max locals: %d", max_locals());
1834 st->print_cr(" - size of params: %d", size_of_parameters());
1835 st->print_cr(" - method size: %d", method_size());
1836 if (intrinsic_id() != vmIntrinsics::_none)
1837 st->print_cr(" - intrinsic id: %d %s", intrinsic_id(), vmIntrinsics::name_at(intrinsic_id()));
1838 if (highest_comp_level() != CompLevel_none)
1839 st->print_cr(" - highest level: %d", highest_comp_level());
1840 st->print_cr(" - vtable index: %d", _vtable_index);
1841 st->print_cr(" - i2i entry: " INTPTR_FORMAT, interpreter_entry());
1842 st->print( " - adapters: ");
1843 AdapterHandlerEntry* a = ((Method*)this)->adapter();
1844 if (a == NULL)
1845 st->print_cr(INTPTR_FORMAT, a);
1846 else
1847 a->print_adapter_on(st);
1848 st->print_cr(" - compiled entry " INTPTR_FORMAT, from_compiled_entry());
1849 st->print_cr(" - code size: %d", code_size());
1850 if (code_size() != 0) {
1851 st->print_cr(" - code start: " INTPTR_FORMAT, code_base());
1852 st->print_cr(" - code end (excl): " INTPTR_FORMAT, code_base() + code_size());
1853 }
1854 if (method_data() != NULL) {
1855 st->print_cr(" - method data: " INTPTR_FORMAT, (address)method_data());
1856 }
1857 st->print_cr(" - checked ex length: %d", checked_exceptions_length());
1858 if (checked_exceptions_length() > 0) {
1859 CheckedExceptionElement* table = checked_exceptions_start();
1860 st->print_cr(" - checked ex start: " INTPTR_FORMAT, table);
1861 if (Verbose) {
1862 for (int i = 0; i < checked_exceptions_length(); i++) {
1863 st->print_cr(" - throws %s", constants()->printable_name_at(table[i].class_cp_index));
1864 }
1865 }
1866 }
1867 if (has_linenumber_table()) {
1868 u_char* table = compressed_linenumber_table();
1869 st->print_cr(" - linenumber start: " INTPTR_FORMAT, table);
1870 if (Verbose) {
1871 CompressedLineNumberReadStream stream(table);
1872 while (stream.read_pair()) {
1873 st->print_cr(" - line %d: %d", stream.line(), stream.bci());
1874 }
1875 }
1876 }
1877 st->print_cr(" - localvar length: %d", localvariable_table_length());
1878 if (localvariable_table_length() > 0) {
1879 LocalVariableTableElement* table = localvariable_table_start();
1880 st->print_cr(" - localvar start: " INTPTR_FORMAT, table);
1881 if (Verbose) {
1882 for (int i = 0; i < localvariable_table_length(); i++) {
1883 int bci = table[i].start_bci;
1884 int len = table[i].length;
1885 const char* name = constants()->printable_name_at(table[i].name_cp_index);
1886 const char* desc = constants()->printable_name_at(table[i].descriptor_cp_index);
1887 int slot = table[i].slot;
1888 st->print_cr(" - %s %s bci=%d len=%d slot=%d", desc, name, bci, len, slot);
1889 }
1890 }
1891 }
1892 if (code() != NULL) {
1893 st->print (" - compiled code: ");
1894 code()->print_value_on(st);
1895 }
1896 if (is_native()) {
1897 st->print_cr(" - native function: " INTPTR_FORMAT, native_function());
1898 st->print_cr(" - signature handler: " INTPTR_FORMAT, signature_handler());
1899 }
1900 }
1902 #endif //PRODUCT
1904 void Method::print_value_on(outputStream* st) const {
1905 assert(is_method(), "must be method");
1906 st->print_cr(internal_name());
1907 print_address_on(st);
1908 st->print(" ");
1909 name()->print_value_on(st);
1910 st->print(" ");
1911 signature()->print_value_on(st);
1912 st->print(" in ");
1913 method_holder()->print_value_on(st);
1914 if (WizardMode) st->print("[%d,%d]", size_of_parameters(), max_locals());
1915 if (WizardMode && code() != NULL) st->print(" ((nmethod*)%p)", code());
1916 }
1919 // Verification
1921 void Method::verify_on(outputStream* st) {
1922 guarantee(is_method(), "object must be method");
1923 guarantee(is_metadata(), "should be metadata");
1924 guarantee(constants()->is_constantPool(), "should be constant pool");
1925 guarantee(constants()->is_metadata(), "should be metadata");
1926 guarantee(constMethod()->is_constMethod(), "should be ConstMethod*");
1927 guarantee(constMethod()->is_metadata(), "should be metadata");
1928 MethodData* md = method_data();
1929 guarantee(md == NULL ||
1930 md->is_metadata(), "should be in permspace");
1931 guarantee(md == NULL ||
1932 md->is_methodData(), "should be method data");
1933 }