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