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