1 /*
2 * Copyright (c) 1997, 2019, 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/classLoaderDataGraph.hpp"
27 #include "classfile/metadataOnStackMark.hpp"
28 #include "classfile/systemDictionary.hpp"
29 #include "code/codeCache.hpp"
30 #include "code/debugInfoRec.hpp"
31 #include "gc/shared/collectedHeap.inline.hpp"
32 #include "interpreter/bytecodeStream.hpp"
33 #include "interpreter/bytecodeTracer.hpp"
34 #include "interpreter/bytecodes.hpp"
35 #include "interpreter/interpreter.hpp"
36 #include "interpreter/oopMapCache.hpp"
37 #include "memory/allocation.inline.hpp"
38 #include "memory/heapInspection.hpp"
39 #include "memory/metadataFactory.hpp"
40 #include "memory/metaspaceClosure.hpp"
41 #include "memory/metaspaceShared.hpp"
42 #include "memory/oopFactory.hpp"
43 #include "memory/resourceArea.hpp"
44 #include "oops/constMethod.hpp"
45 #include "oops/constantPool.hpp"
46 #include "oops/method.inline.hpp"
47 #include "oops/methodData.hpp"
48 #include "oops/objArrayOop.inline.hpp"
49 #include "oops/oop.inline.hpp"
50 #include "oops/symbol.hpp"
51 #include "prims/jvmtiExport.hpp"
52 #include "prims/methodHandles.hpp"
53 #include "prims/nativeLookup.hpp"
54 #include "runtime/arguments.hpp"
55 #include "runtime/compilationPolicy.hpp"
56 #include "runtime/frame.inline.hpp"
57 #include "runtime/handles.inline.hpp"
58 #include "runtime/init.hpp"
59 #include "runtime/orderAccess.hpp"
60 #include "runtime/relocator.hpp"
61 #include "runtime/safepointVerifiers.hpp"
62 #include "runtime/sharedRuntime.hpp"
63 #include "runtime/signature.hpp"
64 #include "utilities/align.hpp"
65 #include "utilities/quickSort.hpp"
66 #include "utilities/vmError.hpp"
67 #include "utilities/xmlstream.hpp"
68
69 // Implementation of Method
70
71 Method* Method::allocate(ClassLoaderData* loader_data,
72 int byte_code_size,
73 AccessFlags access_flags,
74 InlineTableSizes* sizes,
75 ConstMethod::MethodType method_type,
76 TRAPS) {
77 assert(!access_flags.is_native() || byte_code_size == 0,
78 "native methods should not contain byte codes");
79 ConstMethod* cm = ConstMethod::allocate(loader_data,
80 byte_code_size,
81 sizes,
82 method_type,
83 CHECK_NULL);
84 int size = Method::size(access_flags.is_native());
85 return new (loader_data, size, MetaspaceObj::MethodType, THREAD) Method(cm, access_flags);
86 }
87
88 Method::Method(ConstMethod* xconst, AccessFlags access_flags) {
89 NoSafepointVerifier no_safepoint;
90 set_constMethod(xconst);
91 set_access_flags(access_flags);
92 set_intrinsic_id(vmIntrinsics::_none);
93 set_force_inline(false);
94 set_hidden(false);
95 set_dont_inline(false);
96 set_has_injected_profile(false);
97 set_method_data(NULL);
98 clear_method_counters();
99 set_vtable_index(Method::garbage_vtable_index);
100
101 // Fix and bury in Method*
102 set_interpreter_entry(NULL); // sets i2i entry and from_int
103 set_adapter_entry(NULL);
104 Method::clear_code(); // from_c/from_i get set to c2i/i2i
105
106 if (access_flags.is_native()) {
107 clear_native_function();
108 set_signature_handler(NULL);
109 }
110
111 NOT_PRODUCT(set_compiled_invocation_count(0);)
112 }
113
114 // Release Method*. The nmethod will be gone when we get here because
115 // we've walked the code cache.
116 void Method::deallocate_contents(ClassLoaderData* loader_data) {
117 MetadataFactory::free_metadata(loader_data, constMethod());
118 set_constMethod(NULL);
119 #if INCLUDE_JVMCI
120 if (method_data()) {
121 FailedSpeculation::free_failed_speculations(method_data()->get_failed_speculations_address());
122 }
123 #endif
124 MetadataFactory::free_metadata(loader_data, method_data());
125 set_method_data(NULL);
126 MetadataFactory::free_metadata(loader_data, method_counters());
127 clear_method_counters();
128 // The nmethod will be gone when we get here.
129 if (code() != NULL) _code = NULL;
130 }
131
132 address Method::get_i2c_entry() {
133 assert(adapter() != NULL, "must have");
134 return adapter()->get_i2c_entry();
135 }
136
137 address Method::get_c2i_entry() {
138 assert(adapter() != NULL, "must have");
139 return adapter()->get_c2i_entry();
140 }
141
142 address Method::get_c2i_unverified_entry() {
143 assert(adapter() != NULL, "must have");
144 return adapter()->get_c2i_unverified_entry();
145 }
146
147 char* Method::name_and_sig_as_C_string() const {
148 return name_and_sig_as_C_string(constants()->pool_holder(), name(), signature());
149 }
150
151 char* Method::name_and_sig_as_C_string(char* buf, int size) const {
152 return name_and_sig_as_C_string(constants()->pool_holder(), name(), signature(), buf, size);
153 }
154
155 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature) {
156 const char* klass_name = klass->external_name();
157 int klass_name_len = (int)strlen(klass_name);
158 int method_name_len = method_name->utf8_length();
159 int len = klass_name_len + 1 + method_name_len + signature->utf8_length();
160 char* dest = NEW_RESOURCE_ARRAY(char, len + 1);
161 strcpy(dest, klass_name);
162 dest[klass_name_len] = '.';
163 strcpy(&dest[klass_name_len + 1], method_name->as_C_string());
164 strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string());
165 dest[len] = 0;
166 return dest;
167 }
168
169 char* Method::name_and_sig_as_C_string(Klass* klass, Symbol* method_name, Symbol* signature, char* buf, int size) {
170 Symbol* klass_name = klass->name();
171 klass_name->as_klass_external_name(buf, size);
172 int len = (int)strlen(buf);
173
174 if (len < size - 1) {
175 buf[len++] = '.';
176
177 method_name->as_C_string(&(buf[len]), size - len);
178 len = (int)strlen(buf);
179
180 signature->as_C_string(&(buf[len]), size - len);
181 }
182
183 return buf;
184 }
185
186 const char* Method::external_name() const {
187 return external_name(constants()->pool_holder(), name(), signature());
188 }
189
190 void Method::print_external_name(outputStream *os) const {
191 print_external_name(os, constants()->pool_holder(), name(), signature());
192 }
193
194 const char* Method::external_name(Klass* klass, Symbol* method_name, Symbol* signature) {
195 stringStream ss;
196 print_external_name(&ss, klass, method_name, signature);
197 return ss.as_string();
198 }
199
200 void Method::print_external_name(outputStream *os, Klass* klass, Symbol* method_name, Symbol* signature) {
201 signature->print_as_signature_external_return_type(os);
202 os->print(" %s.%s(", klass->external_name(), method_name->as_C_string());
203 signature->print_as_signature_external_parameters(os);
204 os->print(")");
205 }
206
207 int Method::fast_exception_handler_bci_for(const methodHandle& mh, Klass* ex_klass, int throw_bci, TRAPS) {
208 // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index)
209 // access exception table
210 ExceptionTable table(mh());
211 int length = table.length();
212 // iterate through all entries sequentially
213 constantPoolHandle pool(THREAD, mh->constants());
214 for (int i = 0; i < length; i ++) {
215 //reacquire the table in case a GC happened
216 ExceptionTable table(mh());
217 int beg_bci = table.start_pc(i);
218 int end_bci = table.end_pc(i);
219 assert(beg_bci <= end_bci, "inconsistent exception table");
220 if (beg_bci <= throw_bci && throw_bci < end_bci) {
221 // exception handler bci range covers throw_bci => investigate further
222 int handler_bci = table.handler_pc(i);
223 int klass_index = table.catch_type_index(i);
224 if (klass_index == 0) {
225 return handler_bci;
226 } else if (ex_klass == NULL) {
227 return handler_bci;
228 } else {
229 // we know the exception class => get the constraint class
230 // this may require loading of the constraint class; if verification
231 // fails or some other exception occurs, return handler_bci
232 Klass* k = pool->klass_at(klass_index, CHECK_(handler_bci));
233 assert(k != NULL, "klass not loaded");
234 if (ex_klass->is_subtype_of(k)) {
235 return handler_bci;
236 }
237 }
238 }
239 }
240
241 return -1;
242 }
243
244 void Method::mask_for(int bci, InterpreterOopMap* mask) {
245 methodHandle h_this(Thread::current(), this);
246 // Only GC uses the OopMapCache during thread stack root scanning
247 // any other uses generate an oopmap but do not save it in the cache.
248 if (Universe::heap()->is_gc_active()) {
249 method_holder()->mask_for(h_this, bci, mask);
250 } else {
251 OopMapCache::compute_one_oop_map(h_this, bci, mask);
252 }
253 return;
254 }
255
256
257 int Method::bci_from(address bcp) const {
258 if (is_native() && bcp == 0) {
259 return 0;
260 }
261 #ifdef ASSERT
262 {
263 ResourceMark rm;
264 assert(is_native() && bcp == code_base() || contains(bcp) || VMError::is_error_reported(),
265 "bcp doesn't belong to this method: bcp: " INTPTR_FORMAT ", method: %s",
266 p2i(bcp), name_and_sig_as_C_string());
267 }
268 #endif
269 return bcp - code_base();
270 }
271
272
273 int Method::validate_bci(int bci) const {
274 return (bci == 0 || bci < code_size()) ? bci : -1;
275 }
276
277 // Return bci if it appears to be a valid bcp
278 // Return -1 otherwise.
279 // Used by profiling code, when invalid data is a possibility.
280 // The caller is responsible for validating the Method* itself.
281 int Method::validate_bci_from_bcp(address bcp) const {
282 // keep bci as -1 if not a valid bci
283 int bci = -1;
284 if (bcp == 0 || bcp == code_base()) {
285 // code_size() may return 0 and we allow 0 here
286 // the method may be native
287 bci = 0;
288 } else if (contains(bcp)) {
289 bci = bcp - code_base();
290 }
291 // Assert that if we have dodged any asserts, bci is negative.
292 assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0");
293 return bci;
294 }
295
296 address Method::bcp_from(int bci) const {
297 assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()),
298 "illegal bci: %d for %s method", bci, is_native() ? "native" : "non-native");
299 address bcp = code_base() + bci;
300 assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method");
301 return bcp;
302 }
303
304 address Method::bcp_from(address bcp) const {
305 if (is_native() && bcp == NULL) {
306 return code_base();
307 } else {
308 return bcp;
309 }
310 }
311
312 int Method::size(bool is_native) {
313 // If native, then include pointers for native_function and signature_handler
314 int extra_bytes = (is_native) ? 2*sizeof(address*) : 0;
315 int extra_words = align_up(extra_bytes, BytesPerWord) / BytesPerWord;
316 return align_metadata_size(header_size() + extra_words);
317 }
318
319
320 Symbol* Method::klass_name() const {
321 return method_holder()->name();
322 }
323
324
325 void Method::metaspace_pointers_do(MetaspaceClosure* it) {
326 log_trace(cds)("Iter(Method): %p", this);
327
328 it->push(&_constMethod);
329 it->push(&_method_data);
330 it->push(&_method_counters);
331 }
332
333 // Attempt to return method oop to original state. Clear any pointers
334 // (to objects outside the shared spaces). We won't be able to predict
335 // where they should point in a new JVM. Further initialize some
336 // entries now in order allow them to be write protected later.
337
338 void Method::remove_unshareable_info() {
339 unlink_method();
340 }
341
342 void Method::set_vtable_index(int index) {
343 if (is_shared() && !MetaspaceShared::remapped_readwrite()) {
344 // At runtime initialize_vtable is rerun as part of link_class_impl()
345 // for a shared class loaded by the non-boot loader to obtain the loader
346 // constraints based on the runtime classloaders' context.
347 return; // don't write into the shared class
348 } else {
349 _vtable_index = index;
350 }
351 }
352
353 void Method::set_itable_index(int index) {
354 if (is_shared() && !MetaspaceShared::remapped_readwrite()) {
355 // At runtime initialize_itable is rerun as part of link_class_impl()
356 // for a shared class loaded by the non-boot loader to obtain the loader
357 // constraints based on the runtime classloaders' context. The dumptime
358 // itable index should be the same as the runtime index.
359 assert(_vtable_index == itable_index_max - index,
360 "archived itable index is different from runtime index");
361 return; // don’t write into the shared class
362 } else {
363 _vtable_index = itable_index_max - index;
364 }
365 assert(valid_itable_index(), "");
366 }
367
368
369
370 bool Method::was_executed_more_than(int n) {
371 // Invocation counter is reset when the Method* is compiled.
372 // If the method has compiled code we therefore assume it has
373 // be excuted more than n times.
374 if (is_accessor() || is_empty_method() || (code() != NULL)) {
375 // interpreter doesn't bump invocation counter of trivial methods
376 // compiler does not bump invocation counter of compiled methods
377 return true;
378 }
379 else if ((method_counters() != NULL &&
380 method_counters()->invocation_counter()->carry()) ||
381 (method_data() != NULL &&
382 method_data()->invocation_counter()->carry())) {
383 // The carry bit is set when the counter overflows and causes
384 // a compilation to occur. We don't know how many times
385 // the counter has been reset, so we simply assume it has
386 // been executed more than n times.
387 return true;
388 } else {
389 return invocation_count() > n;
390 }
391 }
392
393 void Method::print_invocation_count() {
394 if (is_static()) tty->print("static ");
395 if (is_final()) tty->print("final ");
396 if (is_synchronized()) tty->print("synchronized ");
397 if (is_native()) tty->print("native ");
398 tty->print("%s::", method_holder()->external_name());
399 name()->print_symbol_on(tty);
400 signature()->print_symbol_on(tty);
401
402 if (WizardMode) {
403 // dump the size of the byte codes
404 tty->print(" {%d}", code_size());
405 }
406 tty->cr();
407
408 tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count());
409 tty->print_cr (" invocation_counter: %8d ", invocation_count());
410 tty->print_cr (" backedge_counter: %8d ", backedge_count());
411 #ifndef PRODUCT
412 if (CountCompiledCalls) {
413 tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count());
414 }
415 #endif
416 }
417
418 // Build a MethodData* object to hold information about this method
419 // collected in the interpreter.
420 void Method::build_interpreter_method_data(const methodHandle& method, TRAPS) {
421 // Do not profile the method if metaspace has hit an OOM previously
422 // allocating profiling data. Callers clear pending exception so don't
423 // add one here.
424 if (ClassLoaderDataGraph::has_metaspace_oom()) {
425 return;
426 }
427
428 // Grab a lock here to prevent multiple
429 // MethodData*s from being created.
430 MutexLocker ml(MethodData_lock, THREAD);
431 if (method->method_data() == NULL) {
432 ClassLoaderData* loader_data = method->method_holder()->class_loader_data();
433 MethodData* method_data = MethodData::allocate(loader_data, method, THREAD);
434 if (HAS_PENDING_EXCEPTION) {
435 CompileBroker::log_metaspace_failure();
436 ClassLoaderDataGraph::set_metaspace_oom(true);
437 return; // return the exception (which is cleared)
438 }
439
440 method->set_method_data(method_data);
441 if (PrintMethodData && (Verbose || WizardMode)) {
442 ResourceMark rm(THREAD);
443 tty->print("build_interpreter_method_data for ");
444 method->print_name(tty);
445 tty->cr();
446 // At the end of the run, the MDO, full of data, will be dumped.
447 }
448 }
449 }
450
451 MethodCounters* Method::build_method_counters(Method* m, TRAPS) {
452 // Do not profile the method if metaspace has hit an OOM previously
453 if (ClassLoaderDataGraph::has_metaspace_oom()) {
454 return NULL;
455 }
456
457 methodHandle mh(m);
458 MethodCounters* counters = MethodCounters::allocate(mh, THREAD);
459 if (HAS_PENDING_EXCEPTION) {
460 CompileBroker::log_metaspace_failure();
461 ClassLoaderDataGraph::set_metaspace_oom(true);
462 return NULL; // return the exception (which is cleared)
463 }
464 if (!mh->init_method_counters(counters)) {
465 MetadataFactory::free_metadata(mh->method_holder()->class_loader_data(), counters);
466 }
467
468 if (LogTouchedMethods) {
469 mh->log_touched(CHECK_NULL);
470 }
471
472 return mh->method_counters();
473 }
474
475 bool Method::init_method_counters(MethodCounters* counters) {
476 // Try to install a pointer to MethodCounters, return true on success.
477 return Atomic::replace_if_null(counters, &_method_counters);
478 }
479
480 int Method::extra_stack_words() {
481 // not an inline function, to avoid a header dependency on Interpreter
482 return extra_stack_entries() * Interpreter::stackElementSize;
483 }
484
485
486 void Method::compute_size_of_parameters(Thread *thread) {
487 ArgumentSizeComputer asc(signature());
488 set_size_of_parameters(asc.size() + (is_static() ? 0 : 1));
489 }
490
491 BasicType Method::result_type() const {
492 ResultTypeFinder rtf(signature());
493 return rtf.type();
494 }
495
496
497 bool Method::is_empty_method() const {
498 return code_size() == 1
499 && *code_base() == Bytecodes::_return;
500 }
501
502
503 bool Method::is_vanilla_constructor() const {
504 // Returns true if this method is a vanilla constructor, i.e. an "<init>" "()V" method
505 // which only calls the superclass vanilla constructor and possibly does stores of
506 // zero constants to local fields:
507 //
508 // aload_0
509 // invokespecial
510 // indexbyte1
511 // indexbyte2
512 //
513 // followed by an (optional) sequence of:
514 //
515 // aload_0
516 // aconst_null / iconst_0 / fconst_0 / dconst_0
517 // putfield
518 // indexbyte1
519 // indexbyte2
520 //
521 // followed by:
522 //
523 // return
524
525 assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors");
526 assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors");
527 int size = code_size();
528 // Check if size match
529 if (size == 0 || size % 5 != 0) return false;
530 address cb = code_base();
531 int last = size - 1;
532 if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) {
533 // Does not call superclass default constructor
534 return false;
535 }
536 // Check optional sequence
537 for (int i = 4; i < last; i += 5) {
538 if (cb[i] != Bytecodes::_aload_0) return false;
539 if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false;
540 if (cb[i+2] != Bytecodes::_putfield) return false;
541 }
542 return true;
543 }
544
545
546 bool Method::compute_has_loops_flag() {
547 BytecodeStream bcs(this);
548 Bytecodes::Code bc;
549
550 while ((bc = bcs.next()) >= 0) {
551 switch( bc ) {
552 case Bytecodes::_ifeq:
553 case Bytecodes::_ifnull:
554 case Bytecodes::_iflt:
555 case Bytecodes::_ifle:
556 case Bytecodes::_ifne:
557 case Bytecodes::_ifnonnull:
558 case Bytecodes::_ifgt:
559 case Bytecodes::_ifge:
560 case Bytecodes::_if_icmpeq:
561 case Bytecodes::_if_icmpne:
562 case Bytecodes::_if_icmplt:
563 case Bytecodes::_if_icmpgt:
564 case Bytecodes::_if_icmple:
565 case Bytecodes::_if_icmpge:
566 case Bytecodes::_if_acmpeq:
567 case Bytecodes::_if_acmpne:
568 case Bytecodes::_goto:
569 case Bytecodes::_jsr:
570 if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops();
571 break;
572
573 case Bytecodes::_goto_w:
574 case Bytecodes::_jsr_w:
575 if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops();
576 break;
577
578 default:
579 break;
580 }
581 }
582 _access_flags.set_loops_flag_init();
583 return _access_flags.has_loops();
584 }
585
586 bool Method::is_final_method(AccessFlags class_access_flags) const {
587 // or "does_not_require_vtable_entry"
588 // default method or overpass can occur, is not final (reuses vtable entry)
589 // private methods in classes get vtable entries for backward class compatibility.
590 if (is_overpass() || is_default_method()) return false;
591 return is_final() || class_access_flags.is_final();
592 }
593
594 bool Method::is_final_method() const {
595 return is_final_method(method_holder()->access_flags());
596 }
597
598 bool Method::is_default_method() const {
599 if (method_holder() != NULL &&
600 method_holder()->is_interface() &&
601 !is_abstract() && !is_private()) {
602 return true;
603 } else {
604 return false;
605 }
606 }
607
608 bool Method::can_be_statically_bound(AccessFlags class_access_flags) const {
609 if (is_final_method(class_access_flags)) return true;
610 #ifdef ASSERT
611 ResourceMark rm;
612 bool is_nonv = (vtable_index() == nonvirtual_vtable_index);
613 if (class_access_flags.is_interface()) {
614 assert(is_nonv == is_static() || is_nonv == is_private(),
615 "nonvirtual unexpected for non-static, non-private: %s",
616 name_and_sig_as_C_string());
617 }
618 #endif
619 assert(valid_vtable_index() || valid_itable_index(), "method must be linked before we ask this question");
620 return vtable_index() == nonvirtual_vtable_index;
621 }
622
623 bool Method::can_be_statically_bound() const {
624 return can_be_statically_bound(method_holder()->access_flags());
625 }
626
627 bool Method::is_accessor() const {
628 return is_getter() || is_setter();
629 }
630
631 bool Method::is_getter() const {
632 if (code_size() != 5) return false;
633 if (size_of_parameters() != 1) return false;
634 if (java_code_at(0) != Bytecodes::_aload_0) return false;
635 if (java_code_at(1) != Bytecodes::_getfield) return false;
636 switch (java_code_at(4)) {
637 case Bytecodes::_ireturn:
638 case Bytecodes::_lreturn:
639 case Bytecodes::_freturn:
640 case Bytecodes::_dreturn:
641 case Bytecodes::_areturn:
642 break;
643 default:
644 return false;
645 }
646 return true;
647 }
648
649 bool Method::is_setter() const {
650 if (code_size() != 6) return false;
651 if (java_code_at(0) != Bytecodes::_aload_0) return false;
652 switch (java_code_at(1)) {
653 case Bytecodes::_iload_1:
654 case Bytecodes::_aload_1:
655 case Bytecodes::_fload_1:
656 if (size_of_parameters() != 2) return false;
657 break;
658 case Bytecodes::_dload_1:
659 case Bytecodes::_lload_1:
660 if (size_of_parameters() != 3) return false;
661 break;
662 default:
663 return false;
664 }
665 if (java_code_at(2) != Bytecodes::_putfield) return false;
666 if (java_code_at(5) != Bytecodes::_return) return false;
667 return true;
668 }
669
670 bool Method::is_constant_getter() const {
671 int last_index = code_size() - 1;
672 // Check if the first 1-3 bytecodes are a constant push
673 // and the last bytecode is a return.
674 return (2 <= code_size() && code_size() <= 4 &&
675 Bytecodes::is_const(java_code_at(0)) &&
676 Bytecodes::length_for(java_code_at(0)) == last_index &&
677 Bytecodes::is_return(java_code_at(last_index)));
678 }
679
680 bool Method::is_initializer() const {
681 return is_object_initializer() || is_static_initializer();
682 }
683
684 bool Method::has_valid_initializer_flags() const {
685 return (is_static() ||
686 method_holder()->major_version() < 51);
687 }
688
689 bool Method::is_static_initializer() const {
690 // For classfiles version 51 or greater, ensure that the clinit method is
691 // static. Non-static methods with the name "<clinit>" are not static
692 // initializers. (older classfiles exempted for backward compatibility)
693 return name() == vmSymbols::class_initializer_name() &&
694 has_valid_initializer_flags();
695 }
696
697 bool Method::is_object_initializer() const {
698 return name() == vmSymbols::object_initializer_name();
699 }
700
701 objArrayHandle Method::resolved_checked_exceptions_impl(Method* method, TRAPS) {
702 int length = method->checked_exceptions_length();
703 if (length == 0) { // common case
704 return objArrayHandle(THREAD, Universe::the_empty_class_klass_array());
705 } else {
706 methodHandle h_this(THREAD, method);
707 objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::Class_klass(), length, CHECK_(objArrayHandle()));
708 objArrayHandle mirrors (THREAD, m_oop);
709 for (int i = 0; i < length; i++) {
710 CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe
711 Klass* k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle()));
712 assert(k->is_subclass_of(SystemDictionary::Throwable_klass()), "invalid exception class");
713 mirrors->obj_at_put(i, k->java_mirror());
714 }
715 return mirrors;
716 }
717 };
718
719
720 int Method::line_number_from_bci(int bci) const {
721 int best_bci = 0;
722 int best_line = -1;
723 if (bci == SynchronizationEntryBCI) bci = 0;
724 if (0 <= bci && bci < code_size() && has_linenumber_table()) {
725 // The line numbers are a short array of 2-tuples [start_pc, line_number].
726 // Not necessarily sorted and not necessarily one-to-one.
727 CompressedLineNumberReadStream stream(compressed_linenumber_table());
728 while (stream.read_pair()) {
729 if (stream.bci() == bci) {
730 // perfect match
731 return stream.line();
732 } else {
733 // update best_bci/line
734 if (stream.bci() < bci && stream.bci() >= best_bci) {
735 best_bci = stream.bci();
736 best_line = stream.line();
737 }
738 }
739 }
740 }
741 return best_line;
742 }
743
744
745 bool Method::is_klass_loaded_by_klass_index(int klass_index) const {
746 if( constants()->tag_at(klass_index).is_unresolved_klass() ) {
747 Thread *thread = Thread::current();
748 Symbol* klass_name = constants()->klass_name_at(klass_index);
749 Handle loader(thread, method_holder()->class_loader());
750 Handle prot (thread, method_holder()->protection_domain());
751 return SystemDictionary::find(klass_name, loader, prot, thread) != NULL;
752 } else {
753 return true;
754 }
755 }
756
757
758 bool Method::is_klass_loaded(int refinfo_index, bool must_be_resolved) const {
759 int klass_index = constants()->klass_ref_index_at(refinfo_index);
760 if (must_be_resolved) {
761 // Make sure klass is resolved in constantpool.
762 if (constants()->tag_at(klass_index).is_unresolved_klass()) return false;
763 }
764 return is_klass_loaded_by_klass_index(klass_index);
765 }
766
767
768 void Method::set_native_function(address function, bool post_event_flag) {
769 assert(function != NULL, "use clear_native_function to unregister natives");
770 assert(!is_method_handle_intrinsic() || function == SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), "");
771 address* native_function = native_function_addr();
772
773 // We can see racers trying to place the same native function into place. Once
774 // is plenty.
775 address current = *native_function;
776 if (current == function) return;
777 if (post_event_flag && JvmtiExport::should_post_native_method_bind() &&
778 function != NULL) {
779 // native_method_throw_unsatisfied_link_error_entry() should only
780 // be passed when post_event_flag is false.
781 assert(function !=
782 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
783 "post_event_flag mis-match");
784
785 // post the bind event, and possible change the bind function
786 JvmtiExport::post_native_method_bind(this, &function);
787 }
788 *native_function = function;
789 // This function can be called more than once. We must make sure that we always
790 // use the latest registered method -> check if a stub already has been generated.
791 // If so, we have to make it not_entrant.
792 CompiledMethod* nm = code(); // Put it into local variable to guard against concurrent updates
793 if (nm != NULL) {
794 nm->make_not_entrant();
795 }
796 }
797
798
799 bool Method::has_native_function() const {
800 if (is_method_handle_intrinsic())
801 return false; // special-cased in SharedRuntime::generate_native_wrapper
802 address func = native_function();
803 return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry());
804 }
805
806
807 void Method::clear_native_function() {
808 // Note: is_method_handle_intrinsic() is allowed here.
809 set_native_function(
810 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
811 !native_bind_event_is_interesting);
812 Method::unlink_code(this);
813 }
814
815 address Method::critical_native_function() {
816 methodHandle mh(this);
817 return NativeLookup::lookup_critical_entry(mh);
818 }
819
820
821 void Method::set_signature_handler(address handler) {
822 address* signature_handler = signature_handler_addr();
823 *signature_handler = handler;
824 }
825
826
827 void Method::print_made_not_compilable(int comp_level, bool is_osr, bool report, const char* reason) {
828 if (PrintCompilation && report) {
829 ttyLocker ttyl;
830 tty->print("made not %scompilable on ", is_osr ? "OSR " : "");
831 if (comp_level == CompLevel_all) {
832 tty->print("all levels ");
833 } else {
834 tty->print("levels ");
835 for (int i = (int)CompLevel_none; i <= comp_level; i++) {
836 tty->print("%d ", i);
837 }
838 }
839 this->print_short_name(tty);
840 int size = this->code_size();
841 if (size > 0) {
842 tty->print(" (%d bytes)", size);
843 }
844 if (reason != NULL) {
845 tty->print(" %s", reason);
846 }
847 tty->cr();
848 }
849 if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) {
850 ttyLocker ttyl;
851 xtty->begin_elem("make_not_compilable thread='" UINTX_FORMAT "' osr='%d' level='%d'",
852 os::current_thread_id(), is_osr, comp_level);
853 if (reason != NULL) {
854 xtty->print(" reason=\'%s\'", reason);
855 }
856 xtty->method(this);
857 xtty->stamp();
858 xtty->end_elem();
859 }
860 }
861
862 bool Method::is_always_compilable() const {
863 // Generated adapters must be compiled
864 if (is_method_handle_intrinsic() && is_synthetic()) {
865 assert(!is_not_c1_compilable(), "sanity check");
866 assert(!is_not_c2_compilable(), "sanity check");
867 return true;
868 }
869
870 return false;
871 }
872
873 bool Method::is_not_compilable(int comp_level) const {
874 if (number_of_breakpoints() > 0)
875 return true;
876 if (is_always_compilable())
877 return false;
878 if (comp_level == CompLevel_any)
879 return is_not_c1_compilable() || is_not_c2_compilable();
880 if (is_c1_compile(comp_level))
881 return is_not_c1_compilable();
882 if (is_c2_compile(comp_level))
883 return is_not_c2_compilable();
884 return false;
885 }
886
887 // call this when compiler finds that this method is not compilable
888 void Method::set_not_compilable(int comp_level, bool report, const char* reason) {
889 if (is_always_compilable()) {
890 // Don't mark a method which should be always compilable
891 return;
892 }
893 print_made_not_compilable(comp_level, /*is_osr*/ false, report, reason);
894 if (comp_level == CompLevel_all) {
895 set_not_c1_compilable();
896 set_not_c2_compilable();
897 } else {
898 if (is_c1_compile(comp_level))
899 set_not_c1_compilable();
900 if (is_c2_compile(comp_level))
901 set_not_c2_compilable();
902 }
903 CompilationPolicy::policy()->disable_compilation(this);
904 assert(!CompilationPolicy::can_be_compiled(this, comp_level), "sanity check");
905 }
906
907 bool Method::is_not_osr_compilable(int comp_level) const {
908 if (is_not_compilable(comp_level))
909 return true;
910 if (comp_level == CompLevel_any)
911 return is_not_c1_osr_compilable() || is_not_c2_osr_compilable();
912 if (is_c1_compile(comp_level))
913 return is_not_c1_osr_compilable();
914 if (is_c2_compile(comp_level))
915 return is_not_c2_osr_compilable();
916 return false;
917 }
918
919 void Method::set_not_osr_compilable(int comp_level, bool report, const char* reason) {
920 print_made_not_compilable(comp_level, /*is_osr*/ true, report, reason);
921 if (comp_level == CompLevel_all) {
922 set_not_c1_osr_compilable();
923 set_not_c2_osr_compilable();
924 } else {
925 if (is_c1_compile(comp_level))
926 set_not_c1_osr_compilable();
927 if (is_c2_compile(comp_level))
928 set_not_c2_osr_compilable();
929 }
930 CompilationPolicy::policy()->disable_compilation(this);
931 assert(!CompilationPolicy::can_be_osr_compiled(this, comp_level), "sanity check");
932 }
933
934 // Revert to using the interpreter and clear out the nmethod
935 void Method::clear_code() {
936 // this may be NULL if c2i adapters have not been made yet
937 // Only should happen at allocate time.
938 if (adapter() == NULL) {
939 _from_compiled_entry = NULL;
940 } else {
941 _from_compiled_entry = adapter()->get_c2i_entry();
942 }
943 OrderAccess::storestore();
944 _from_interpreted_entry = _i2i_entry;
945 OrderAccess::storestore();
946 _code = NULL;
947 }
948
949 void Method::unlink_code(Method *method, CompiledMethod *compare) {
950 if (method == NULL) {
951 return;
952 }
953 MutexLocker ml(CompiledMethod_lock->owned_by_self() ? NULL : CompiledMethod_lock, Mutex::_no_safepoint_check_flag);
954 if (method->code() == compare ||
955 method->from_compiled_entry() == compare->verified_entry_point()) {
956 method->clear_code();
957 }
958 }
959
960 void Method::unlink_code(Method *method) {
961 if (method != NULL) {
962 MutexLocker ml(CompiledMethod_lock->owned_by_self() ? NULL : CompiledMethod_lock, Mutex::_no_safepoint_check_flag);
963 method->clear_code();
964 }
965 }
966
967 #if INCLUDE_CDS
968 // Called by class data sharing to remove any entry points (which are not shared)
969 void Method::unlink_method() {
970 _code = NULL;
971
972 assert(DumpSharedSpaces, "dump time only");
973 // Set the values to what they should be at run time. Note that
974 // this Method can no longer be executed during dump time.
975 _i2i_entry = Interpreter::entry_for_cds_method(this);
976 _from_interpreted_entry = _i2i_entry;
977
978 if (is_native()) {
979 *native_function_addr() = NULL;
980 set_signature_handler(NULL);
981 }
982 NOT_PRODUCT(set_compiled_invocation_count(0);)
983
984 CDSAdapterHandlerEntry* cds_adapter = (CDSAdapterHandlerEntry*)adapter();
985 constMethod()->set_adapter_trampoline(cds_adapter->get_adapter_trampoline());
986 _from_compiled_entry = cds_adapter->get_c2i_entry_trampoline();
987 assert(*((int*)_from_compiled_entry) == 0, "must be NULL during dump time, to be initialized at run time");
988
989 set_method_data(NULL);
990 clear_method_counters();
991 }
992 #endif
993
994 /****************************************************************************
995 // The following illustrates how the entries work for CDS shared Methods:
996 //
997 // Our goal is to delay writing into a shared Method until it's compiled.
998 // Hence, we want to determine the initial values for _i2i_entry,
999 // _from_interpreted_entry and _from_compiled_entry during CDS dump time.
1000 //
1001 // In this example, both Methods A and B have the _i2i_entry of "zero_locals".
1002 // They also have similar signatures so that they will share the same
1003 // AdapterHandlerEntry.
1004 //
1005 // _adapter_trampoline points to a fixed location in the RW section of
1006 // the CDS archive. This location initially contains a NULL pointer. When the
1007 // first of method A or B is linked, an AdapterHandlerEntry is allocated
1008 // dynamically, and its c2i/i2c entries are generated.
1009 //
1010 // _i2i_entry and _from_interpreted_entry initially points to the same
1011 // (fixed) location in the CODE section of the CDS archive. This contains
1012 // an unconditional branch to the actual entry for "zero_locals", which is
1013 // generated at run time and may be on an arbitrary address. Thus, the
1014 // unconditional branch is also generated at run time to jump to the correct
1015 // address.
1016 //
1017 // Similarly, _from_compiled_entry points to a fixed address in the CODE
1018 // section. This address has enough space for an unconditional branch
1019 // instruction, and is initially zero-filled. After the AdapterHandlerEntry is
1020 // initialized, and the address for the actual c2i_entry is known, we emit a
1021 // branch instruction here to branch to the actual c2i_entry.
1022 //
1023 // The effect of the extra branch on the i2i and c2i entries is negligible.
1024 //
1025 // The reason for putting _adapter_trampoline in RO is many shared Methods
1026 // share the same AdapterHandlerEntry, so we can save space in the RW section
1027 // by having the extra indirection.
1028
1029
1030 [Method A: RW]
1031 _constMethod ----> [ConstMethod: RO]
1032 _adapter_trampoline -----------+
1033 |
1034 _i2i_entry (same value as method B) |
1035 _from_interpreted_entry (same value as method B) |
1036 _from_compiled_entry (same value as method B) |
1037 |
1038 |
1039 [Method B: RW] +--------+
1040 _constMethod ----> [ConstMethod: RO] |
1041 _adapter_trampoline --+--->(AdapterHandlerEntry* ptr: RW)-+
1042 |
1043 +-------------------------------+
1044 |
1045 +----> [AdapterHandlerEntry] (allocated at run time)
1046 _fingerprint
1047 _c2i_entry ---------------------------------+->[c2i entry..]
1048 _i2i_entry -------------+ _i2c_entry ---------------+-> [i2c entry..] |
1049 _from_interpreted_entry | _c2i_unverified_entry | |
1050 | | | |
1051 | | (_cds_entry_table: CODE) | |
1052 | +->[0]: jmp _entry_table[0] --> (i2i_entry_for "zero_locals") | |
1053 | | (allocated at run time) | |
1054 | | ... [asm code ...] | |
1055 +-[not compiled]-+ [n]: jmp _entry_table[n] | |
1056 | | |
1057 | | |
1058 +-[compiled]-------------------------------------------------------------------+ |
1059 |
1060 _from_compiled_entry------------> (_c2i_entry_trampoline: CODE) |
1061 [jmp c2i_entry] ------------------------------------------------------+
1062
1063 ***/
1064
1065 // Called when the method_holder is getting linked. Setup entrypoints so the method
1066 // is ready to be called from interpreter, compiler, and vtables.
1067 void Method::link_method(const methodHandle& h_method, TRAPS) {
1068 // If the code cache is full, we may reenter this function for the
1069 // leftover methods that weren't linked.
1070 if (is_shared()) {
1071 address entry = Interpreter::entry_for_cds_method(h_method);
1072 assert(entry != NULL && entry == _i2i_entry,
1073 "should be correctly set during dump time");
1074 if (adapter() != NULL) {
1075 return;
1076 }
1077 assert(entry == _from_interpreted_entry,
1078 "should be correctly set during dump time");
1079 } else if (_i2i_entry != NULL) {
1080 return;
1081 }
1082 assert( _code == NULL, "nothing compiled yet" );
1083
1084 // Setup interpreter entrypoint
1085 assert(this == h_method(), "wrong h_method()" );
1086
1087 if (!is_shared()) {
1088 assert(adapter() == NULL, "init'd to NULL");
1089 address entry = Interpreter::entry_for_method(h_method);
1090 assert(entry != NULL, "interpreter entry must be non-null");
1091 // Sets both _i2i_entry and _from_interpreted_entry
1092 set_interpreter_entry(entry);
1093 }
1094
1095 // Don't overwrite already registered native entries.
1096 if (is_native() && !has_native_function()) {
1097 set_native_function(
1098 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(),
1099 !native_bind_event_is_interesting);
1100 }
1101
1102 // Setup compiler entrypoint. This is made eagerly, so we do not need
1103 // special handling of vtables. An alternative is to make adapters more
1104 // lazily by calling make_adapter() from from_compiled_entry() for the
1105 // normal calls. For vtable calls life gets more complicated. When a
1106 // call-site goes mega-morphic we need adapters in all methods which can be
1107 // called from the vtable. We need adapters on such methods that get loaded
1108 // later. Ditto for mega-morphic itable calls. If this proves to be a
1109 // problem we'll make these lazily later.
1110 (void) make_adapters(h_method, CHECK);
1111
1112 // ONLY USE the h_method now as make_adapter may have blocked
1113
1114 }
1115
1116 address Method::make_adapters(const methodHandle& mh, TRAPS) {
1117 // Adapters for compiled code are made eagerly here. They are fairly
1118 // small (generally < 100 bytes) and quick to make (and cached and shared)
1119 // so making them eagerly shouldn't be too expensive.
1120 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh);
1121 if (adapter == NULL ) {
1122 if (!is_init_completed()) {
1123 // Don't throw exceptions during VM initialization because java.lang.* classes
1124 // might not have been initialized, causing problems when constructing the
1125 // Java exception object.
1126 vm_exit_during_initialization("Out of space in CodeCache for adapters");
1127 } else {
1128 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "Out of space in CodeCache for adapters");
1129 }
1130 }
1131
1132 if (mh->is_shared()) {
1133 assert(mh->adapter() == adapter, "must be");
1134 assert(mh->_from_compiled_entry != NULL, "must be");
1135 } else {
1136 mh->set_adapter_entry(adapter);
1137 mh->_from_compiled_entry = adapter->get_c2i_entry();
1138 }
1139 return adapter->get_c2i_entry();
1140 }
1141
1142 void Method::restore_unshareable_info(TRAPS) {
1143 assert(is_method() && is_valid_method(this), "ensure C++ vtable is restored");
1144
1145 // Since restore_unshareable_info can be called more than once for a method, don't
1146 // redo any work.
1147 if (adapter() == NULL) {
1148 methodHandle mh(THREAD, this);
1149 link_method(mh, CHECK);
1150 }
1151 }
1152
1153 address Method::from_compiled_entry_no_trampoline() const {
1154 CompiledMethod *code = OrderAccess::load_acquire(&_code);
1155 if (code) {
1156 return code->verified_entry_point();
1157 } else {
1158 return adapter()->get_c2i_entry();
1159 }
1160 }
1161
1162 // The verified_code_entry() must be called when a invoke is resolved
1163 // on this method.
1164
1165 // It returns the compiled code entry point, after asserting not null.
1166 // This function is called after potential safepoints so that nmethod
1167 // or adapter that it points to is still live and valid.
1168 // This function must not hit a safepoint!
1169 address Method::verified_code_entry() {
1170 debug_only(NoSafepointVerifier nsv;)
1171 assert(_from_compiled_entry != NULL, "must be set");
1172 return _from_compiled_entry;
1173 }
1174
1175 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all
1176 // (could be racing a deopt).
1177 // Not inline to avoid circular ref.
1178 bool Method::check_code() const {
1179 // cached in a register or local. There's a race on the value of the field.
1180 CompiledMethod *code = OrderAccess::load_acquire(&_code);
1181 return code == NULL || (code->method() == NULL) || (code->method() == (Method*)this && !code->is_osr_method());
1182 }
1183
1184 // Install compiled code. Instantly it can execute.
1185 void Method::set_code(const methodHandle& mh, CompiledMethod *code) {
1186 MutexLocker pl(CompiledMethod_lock, Mutex::_no_safepoint_check_flag);
1187 assert( code, "use clear_code to remove code" );
1188 assert( mh->check_code(), "" );
1189
1190 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!");
1191
1192 // These writes must happen in this order, because the interpreter will
1193 // directly jump to from_interpreted_entry which jumps to an i2c adapter
1194 // which jumps to _from_compiled_entry.
1195 mh->_code = code; // Assign before allowing compiled code to exec
1196
1197 int comp_level = code->comp_level();
1198 // In theory there could be a race here. In practice it is unlikely
1199 // and not worth worrying about.
1200 if (comp_level > mh->highest_comp_level()) {
1201 mh->set_highest_comp_level(comp_level);
1202 }
1203
1204 OrderAccess::storestore();
1205 mh->_from_compiled_entry = code->verified_entry_point();
1206 OrderAccess::storestore();
1207 // Instantly compiled code can execute.
1208 if (!mh->is_method_handle_intrinsic())
1209 mh->_from_interpreted_entry = mh->get_i2c_entry();
1210 }
1211
1212
1213 bool Method::is_overridden_in(Klass* k) const {
1214 InstanceKlass* ik = InstanceKlass::cast(k);
1215
1216 if (ik->is_interface()) return false;
1217
1218 // If method is an interface, we skip it - except if it
1219 // is a miranda method
1220 if (method_holder()->is_interface()) {
1221 // Check that method is not a miranda method
1222 if (ik->lookup_method(name(), signature()) == NULL) {
1223 // No implementation exist - so miranda method
1224 return false;
1225 }
1226 return true;
1227 }
1228
1229 assert(ik->is_subclass_of(method_holder()), "should be subklass");
1230 if (!has_vtable_index()) {
1231 return false;
1232 } else {
1233 Method* vt_m = ik->method_at_vtable(vtable_index());
1234 return vt_m != this;
1235 }
1236 }
1237
1238
1239 // give advice about whether this Method* should be cached or not
1240 bool Method::should_not_be_cached() const {
1241 if (is_old()) {
1242 // This method has been redefined. It is either EMCP or obsolete
1243 // and we don't want to cache it because that would pin the method
1244 // down and prevent it from being collectible if and when it
1245 // finishes executing.
1246 return true;
1247 }
1248
1249 // caching this method should be just fine
1250 return false;
1251 }
1252
1253
1254 /**
1255 * Returns true if this is one of the specially treated methods for
1256 * security related stack walks (like Reflection.getCallerClass).
1257 */
1258 bool Method::is_ignored_by_security_stack_walk() const {
1259 if (intrinsic_id() == vmIntrinsics::_invoke) {
1260 // This is Method.invoke() -- ignore it
1261 return true;
1262 }
1263 if (method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass())) {
1264 // This is an auxilary frame -- ignore it
1265 return true;
1266 }
1267 if (is_method_handle_intrinsic() || is_compiled_lambda_form()) {
1268 // This is an internal adapter frame for method handles -- ignore it
1269 return true;
1270 }
1271 return false;
1272 }
1273
1274
1275 // Constant pool structure for invoke methods:
1276 enum {
1277 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc.
1278 _imcp_invoke_signature, // utf8: (variable Symbol*)
1279 _imcp_limit
1280 };
1281
1282 // Test if this method is an MH adapter frame generated by Java code.
1283 // Cf. java/lang/invoke/InvokerBytecodeGenerator
1284 bool Method::is_compiled_lambda_form() const {
1285 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm;
1286 }
1287
1288 // Test if this method is an internal MH primitive method.
1289 bool Method::is_method_handle_intrinsic() const {
1290 vmIntrinsics::ID iid = intrinsic_id();
1291 return (MethodHandles::is_signature_polymorphic(iid) &&
1292 MethodHandles::is_signature_polymorphic_intrinsic(iid));
1293 }
1294
1295 bool Method::has_member_arg() const {
1296 vmIntrinsics::ID iid = intrinsic_id();
1297 return (MethodHandles::is_signature_polymorphic(iid) &&
1298 MethodHandles::has_member_arg(iid));
1299 }
1300
1301 // Make an instance of a signature-polymorphic internal MH primitive.
1302 methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid,
1303 Symbol* signature,
1304 TRAPS) {
1305 ResourceMark rm;
1306 methodHandle empty;
1307
1308 InstanceKlass* holder = SystemDictionary::MethodHandle_klass();
1309 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid);
1310 assert(iid == MethodHandles::signature_polymorphic_name_id(name), "");
1311 if (TraceMethodHandles) {
1312 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string());
1313 }
1314
1315 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup)
1316 name->increment_refcount();
1317 signature->increment_refcount();
1318
1319 int cp_length = _imcp_limit;
1320 ClassLoaderData* loader_data = holder->class_loader_data();
1321 constantPoolHandle cp;
1322 {
1323 ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty));
1324 cp = constantPoolHandle(THREAD, cp_oop);
1325 }
1326 cp->set_pool_holder(holder);
1327 cp->symbol_at_put(_imcp_invoke_name, name);
1328 cp->symbol_at_put(_imcp_invoke_signature, signature);
1329 cp->set_has_preresolution();
1330
1331 // decide on access bits: public or not?
1332 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL);
1333 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid);
1334 if (must_be_static) flags_bits |= JVM_ACC_STATIC;
1335 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods");
1336
1337 methodHandle m;
1338 {
1339 InlineTableSizes sizes;
1340 Method* m_oop = Method::allocate(loader_data, 0,
1341 accessFlags_from(flags_bits), &sizes,
1342 ConstMethod::NORMAL, CHECK_(empty));
1343 m = methodHandle(THREAD, m_oop);
1344 }
1345 m->set_constants(cp());
1346 m->set_name_index(_imcp_invoke_name);
1347 m->set_signature_index(_imcp_invoke_signature);
1348 assert(MethodHandles::is_signature_polymorphic_name(m->name()), "");
1349 assert(m->signature() == signature, "");
1350 ResultTypeFinder rtf(signature);
1351 m->constMethod()->set_result_type(rtf.type());
1352 m->compute_size_of_parameters(THREAD);
1353 m->init_intrinsic_id();
1354 assert(m->is_method_handle_intrinsic(), "");
1355 #ifdef ASSERT
1356 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print();
1357 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker");
1358 assert(m->intrinsic_id() == iid, "correctly predicted iid");
1359 #endif //ASSERT
1360
1361 // Finally, set up its entry points.
1362 assert(m->can_be_statically_bound(), "");
1363 m->set_vtable_index(Method::nonvirtual_vtable_index);
1364 m->link_method(m, CHECK_(empty));
1365
1366 if (TraceMethodHandles && (Verbose || WizardMode)) {
1367 ttyLocker ttyl;
1368 m->print_on(tty);
1369 }
1370
1371 return m;
1372 }
1373
1374 Klass* Method::check_non_bcp_klass(Klass* klass) {
1375 if (klass != NULL && klass->class_loader() != NULL) {
1376 if (klass->is_objArray_klass())
1377 klass = ObjArrayKlass::cast(klass)->bottom_klass();
1378 return klass;
1379 }
1380 return NULL;
1381 }
1382
1383
1384 methodHandle Method::clone_with_new_data(const methodHandle& m, u_char* new_code, int new_code_length,
1385 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) {
1386 // Code below does not work for native methods - they should never get rewritten anyway
1387 assert(!m->is_native(), "cannot rewrite native methods");
1388 // Allocate new Method*
1389 AccessFlags flags = m->access_flags();
1390
1391 ConstMethod* cm = m->constMethod();
1392 int checked_exceptions_len = cm->checked_exceptions_length();
1393 int localvariable_len = cm->localvariable_table_length();
1394 int exception_table_len = cm->exception_table_length();
1395 int method_parameters_len = cm->method_parameters_length();
1396 int method_annotations_len = cm->method_annotations_length();
1397 int parameter_annotations_len = cm->parameter_annotations_length();
1398 int type_annotations_len = cm->type_annotations_length();
1399 int default_annotations_len = cm->default_annotations_length();
1400
1401 InlineTableSizes sizes(
1402 localvariable_len,
1403 new_compressed_linenumber_size,
1404 exception_table_len,
1405 checked_exceptions_len,
1406 method_parameters_len,
1407 cm->generic_signature_index(),
1408 method_annotations_len,
1409 parameter_annotations_len,
1410 type_annotations_len,
1411 default_annotations_len,
1412 0);
1413
1414 ClassLoaderData* loader_data = m->method_holder()->class_loader_data();
1415 Method* newm_oop = Method::allocate(loader_data,
1416 new_code_length,
1417 flags,
1418 &sizes,
1419 m->method_type(),
1420 CHECK_(methodHandle()));
1421 methodHandle newm (THREAD, newm_oop);
1422
1423 // Create a shallow copy of Method part, but be careful to preserve the new ConstMethod*
1424 ConstMethod* newcm = newm->constMethod();
1425 int new_const_method_size = newm->constMethod()->size();
1426
1427 // This works because the source and target are both Methods. Some compilers
1428 // (e.g., clang) complain that the target vtable pointer will be stomped,
1429 // so cast away newm()'s and m()'s Methodness.
1430 memcpy((void*)newm(), (void*)m(), sizeof(Method));
1431
1432 // Create shallow copy of ConstMethod.
1433 memcpy(newcm, m->constMethod(), sizeof(ConstMethod));
1434
1435 // Reset correct method/const method, method size, and parameter info
1436 newm->set_constMethod(newcm);
1437 newm->constMethod()->set_code_size(new_code_length);
1438 newm->constMethod()->set_constMethod_size(new_const_method_size);
1439 assert(newm->code_size() == new_code_length, "check");
1440 assert(newm->method_parameters_length() == method_parameters_len, "check");
1441 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check");
1442 assert(newm->exception_table_length() == exception_table_len, "check");
1443 assert(newm->localvariable_table_length() == localvariable_len, "check");
1444 // Copy new byte codes
1445 memcpy(newm->code_base(), new_code, new_code_length);
1446 // Copy line number table
1447 if (new_compressed_linenumber_size > 0) {
1448 memcpy(newm->compressed_linenumber_table(),
1449 new_compressed_linenumber_table,
1450 new_compressed_linenumber_size);
1451 }
1452 // Copy method_parameters
1453 if (method_parameters_len > 0) {
1454 memcpy(newm->method_parameters_start(),
1455 m->method_parameters_start(),
1456 method_parameters_len * sizeof(MethodParametersElement));
1457 }
1458 // Copy checked_exceptions
1459 if (checked_exceptions_len > 0) {
1460 memcpy(newm->checked_exceptions_start(),
1461 m->checked_exceptions_start(),
1462 checked_exceptions_len * sizeof(CheckedExceptionElement));
1463 }
1464 // Copy exception table
1465 if (exception_table_len > 0) {
1466 memcpy(newm->exception_table_start(),
1467 m->exception_table_start(),
1468 exception_table_len * sizeof(ExceptionTableElement));
1469 }
1470 // Copy local variable number table
1471 if (localvariable_len > 0) {
1472 memcpy(newm->localvariable_table_start(),
1473 m->localvariable_table_start(),
1474 localvariable_len * sizeof(LocalVariableTableElement));
1475 }
1476 // Copy stackmap table
1477 if (m->has_stackmap_table()) {
1478 int code_attribute_length = m->stackmap_data()->length();
1479 Array<u1>* stackmap_data =
1480 MetadataFactory::new_array<u1>(loader_data, code_attribute_length, 0, CHECK_NULL);
1481 memcpy((void*)stackmap_data->adr_at(0),
1482 (void*)m->stackmap_data()->adr_at(0), code_attribute_length);
1483 newm->set_stackmap_data(stackmap_data);
1484 }
1485
1486 // copy annotations over to new method
1487 newcm->copy_annotations_from(loader_data, cm, CHECK_NULL);
1488 return newm;
1489 }
1490
1491 vmSymbols::SID Method::klass_id_for_intrinsics(const Klass* holder) {
1492 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics
1493 // because we are not loading from core libraries
1494 // exception: the AES intrinsics come from lib/ext/sunjce_provider.jar
1495 // which does not use the class default class loader so we check for its loader here
1496 const InstanceKlass* ik = InstanceKlass::cast(holder);
1497 if ((ik->class_loader() != NULL) && !SystemDictionary::is_platform_class_loader(ik->class_loader())) {
1498 return vmSymbols::NO_SID; // regardless of name, no intrinsics here
1499 }
1500
1501 // see if the klass name is well-known:
1502 Symbol* klass_name = ik->name();
1503 return vmSymbols::find_sid(klass_name);
1504 }
1505
1506 void Method::init_intrinsic_id() {
1507 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once");
1508 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte));
1509 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size");
1510 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), "");
1511
1512 // the klass name is well-known:
1513 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder());
1514 assert(klass_id != vmSymbols::NO_SID, "caller responsibility");
1515
1516 // ditto for method and signature:
1517 vmSymbols::SID name_id = vmSymbols::find_sid(name());
1518 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1519 && klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle)
1520 && name_id == vmSymbols::NO_SID) {
1521 return;
1522 }
1523 vmSymbols::SID sig_id = vmSymbols::find_sid(signature());
1524 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle)
1525 && klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle)
1526 && sig_id == vmSymbols::NO_SID) {
1527 return;
1528 }
1529 jshort flags = access_flags().as_short();
1530
1531 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1532 if (id != vmIntrinsics::_none) {
1533 set_intrinsic_id(id);
1534 if (id == vmIntrinsics::_Class_cast) {
1535 // Even if the intrinsic is rejected, we want to inline this simple method.
1536 set_force_inline(true);
1537 }
1538 return;
1539 }
1540
1541 // A few slightly irregular cases:
1542 switch (klass_id) {
1543 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath):
1544 // Second chance: check in regular Math.
1545 switch (name_id) {
1546 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name):
1547 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name):
1548 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name):
1549 // pretend it is the corresponding method in the non-strict class:
1550 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math);
1551 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags);
1552 break;
1553 default:
1554 break;
1555 }
1556 break;
1557
1558 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*., VarHandle
1559 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle):
1560 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle):
1561 if (!is_native()) break;
1562 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name());
1563 if (is_static() != MethodHandles::is_signature_polymorphic_static(id))
1564 id = vmIntrinsics::_none;
1565 break;
1566
1567 default:
1568 break;
1569 }
1570
1571 if (id != vmIntrinsics::_none) {
1572 // Set up its iid. It is an alias method.
1573 set_intrinsic_id(id);
1574 return;
1575 }
1576 }
1577
1578 // These two methods are static since a GC may move the Method
1579 bool Method::load_signature_classes(const methodHandle& m, TRAPS) {
1580 if (!THREAD->can_call_java()) {
1581 // There is nothing useful this routine can do from within the Compile thread.
1582 // Hopefully, the signature contains only well-known classes.
1583 // We could scan for this and return true/false, but the caller won't care.
1584 return false;
1585 }
1586 bool sig_is_loaded = true;
1587 Handle class_loader(THREAD, m->method_holder()->class_loader());
1588 Handle protection_domain(THREAD, m->method_holder()->protection_domain());
1589 ResourceMark rm(THREAD);
1590 Symbol* signature = m->signature();
1591 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1592 if (ss.is_object()) {
1593 Symbol* sym = ss.as_symbol(CHECK_(false));
1594 Symbol* name = sym;
1595 Klass* klass = SystemDictionary::resolve_or_null(name, class_loader,
1596 protection_domain, THREAD);
1597 // We are loading classes eagerly. If a ClassNotFoundException or
1598 // a LinkageError was generated, be sure to ignore it.
1599 if (HAS_PENDING_EXCEPTION) {
1600 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) ||
1601 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) {
1602 CLEAR_PENDING_EXCEPTION;
1603 } else {
1604 return false;
1605 }
1606 }
1607 if( klass == NULL) { sig_is_loaded = false; }
1608 }
1609 }
1610 return sig_is_loaded;
1611 }
1612
1613 bool Method::has_unloaded_classes_in_signature(const methodHandle& m, TRAPS) {
1614 Handle class_loader(THREAD, m->method_holder()->class_loader());
1615 Handle protection_domain(THREAD, m->method_holder()->protection_domain());
1616 ResourceMark rm(THREAD);
1617 Symbol* signature = m->signature();
1618 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1619 if (ss.type() == T_OBJECT) {
1620 Symbol* name = ss.as_symbol_or_null();
1621 if (name == NULL) return true;
1622 Klass* klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD);
1623 if (klass == NULL) return true;
1624 }
1625 }
1626 return false;
1627 }
1628
1629 // Exposed so field engineers can debug VM
1630 void Method::print_short_name(outputStream* st) {
1631 ResourceMark rm;
1632 #ifdef PRODUCT
1633 st->print(" %s::", method_holder()->external_name());
1634 #else
1635 st->print(" %s::", method_holder()->internal_name());
1636 #endif
1637 name()->print_symbol_on(st);
1638 if (WizardMode) signature()->print_symbol_on(st);
1639 else if (MethodHandles::is_signature_polymorphic(intrinsic_id()))
1640 MethodHandles::print_as_basic_type_signature_on(st, signature(), true);
1641 }
1642
1643 // Comparer for sorting an object array containing
1644 // Method*s.
1645 static int method_comparator(Method* a, Method* b) {
1646 return a->name()->fast_compare(b->name());
1647 }
1648
1649 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array
1650 // default_methods also uses this without the ordering for fast find_method
1651 void Method::sort_methods(Array<Method*>* methods, bool set_idnums) {
1652 int length = methods->length();
1653 if (length > 1) {
1654 {
1655 NoSafepointVerifier nsv;
1656 QuickSort::sort(methods->data(), length, method_comparator, /*idempotent=*/false);
1657 }
1658 // Reset method ordering
1659 if (set_idnums) {
1660 for (int i = 0; i < length; i++) {
1661 Method* m = methods->at(i);
1662 m->set_method_idnum(i);
1663 m->set_orig_method_idnum(i);
1664 }
1665 }
1666 }
1667 }
1668
1669 //-----------------------------------------------------------------------------------
1670 // Non-product code unless JVM/TI needs it
1671
1672 #if !defined(PRODUCT) || INCLUDE_JVMTI
1673 class SignatureTypePrinter : public SignatureTypeNames {
1674 private:
1675 outputStream* _st;
1676 bool _use_separator;
1677
1678 void type_name(const char* name) {
1679 if (_use_separator) _st->print(", ");
1680 _st->print("%s", name);
1681 _use_separator = true;
1682 }
1683
1684 public:
1685 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) {
1686 _st = st;
1687 _use_separator = false;
1688 }
1689
1690 void print_parameters() { _use_separator = false; iterate_parameters(); }
1691 void print_returntype() { _use_separator = false; iterate_returntype(); }
1692 };
1693
1694
1695 void Method::print_name(outputStream* st) {
1696 Thread *thread = Thread::current();
1697 ResourceMark rm(thread);
1698 st->print("%s ", is_static() ? "static" : "virtual");
1699 if (WizardMode) {
1700 st->print("%s.", method_holder()->internal_name());
1701 name()->print_symbol_on(st);
1702 signature()->print_symbol_on(st);
1703 } else {
1704 SignatureTypePrinter sig(signature(), st);
1705 sig.print_returntype();
1706 st->print(" %s.", method_holder()->internal_name());
1707 name()->print_symbol_on(st);
1708 st->print("(");
1709 sig.print_parameters();
1710 st->print(")");
1711 }
1712 }
1713 #endif // !PRODUCT || INCLUDE_JVMTI
1714
1715
1716 void Method::print_codes_on(outputStream* st) const {
1717 print_codes_on(0, code_size(), st);
1718 }
1719
1720 void Method::print_codes_on(int from, int to, outputStream* st) const {
1721 Thread *thread = Thread::current();
1722 ResourceMark rm(thread);
1723 methodHandle mh (thread, (Method*)this);
1724 BytecodeStream s(mh);
1725 s.set_interval(from, to);
1726 BytecodeTracer::set_closure(BytecodeTracer::std_closure());
1727 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1728 }
1729
1730 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) {
1731 _bci = 0;
1732 _line = 0;
1733 };
1734
1735 bool CompressedLineNumberReadStream::read_pair() {
1736 jubyte next = read_byte();
1737 // Check for terminator
1738 if (next == 0) return false;
1739 if (next == 0xFF) {
1740 // Escape character, regular compression used
1741 _bci += read_signed_int();
1742 _line += read_signed_int();
1743 } else {
1744 // Single byte compression used
1745 _bci += next >> 3;
1746 _line += next & 0x7;
1747 }
1748 return true;
1749 }
1750
1751 #if INCLUDE_JVMTI
1752
1753 Bytecodes::Code Method::orig_bytecode_at(int bci) const {
1754 BreakpointInfo* bp = method_holder()->breakpoints();
1755 for (; bp != NULL; bp = bp->next()) {
1756 if (bp->match(this, bci)) {
1757 return bp->orig_bytecode();
1758 }
1759 }
1760 {
1761 ResourceMark rm;
1762 fatal("no original bytecode found in %s at bci %d", name_and_sig_as_C_string(), bci);
1763 }
1764 return Bytecodes::_shouldnotreachhere;
1765 }
1766
1767 void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) {
1768 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way");
1769 BreakpointInfo* bp = method_holder()->breakpoints();
1770 for (; bp != NULL; bp = bp->next()) {
1771 if (bp->match(this, bci)) {
1772 bp->set_orig_bytecode(code);
1773 // and continue, in case there is more than one
1774 }
1775 }
1776 }
1777
1778 void Method::set_breakpoint(int bci) {
1779 InstanceKlass* ik = method_holder();
1780 BreakpointInfo *bp = new BreakpointInfo(this, bci);
1781 bp->set_next(ik->breakpoints());
1782 ik->set_breakpoints(bp);
1783 // do this last:
1784 bp->set(this);
1785 }
1786
1787 static void clear_matches(Method* m, int bci) {
1788 InstanceKlass* ik = m->method_holder();
1789 BreakpointInfo* prev_bp = NULL;
1790 BreakpointInfo* next_bp;
1791 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) {
1792 next_bp = bp->next();
1793 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint).
1794 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) {
1795 // do this first:
1796 bp->clear(m);
1797 // unhook it
1798 if (prev_bp != NULL)
1799 prev_bp->set_next(next_bp);
1800 else
1801 ik->set_breakpoints(next_bp);
1802 delete bp;
1803 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods
1804 // at same location. So we have multiple matching (method_index and bci)
1805 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one
1806 // breakpoint for clear_breakpoint request and keep all other method versions
1807 // BreakpointInfo for future clear_breakpoint request.
1808 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints)
1809 // which is being called when class is unloaded. We delete all the Breakpoint
1810 // information for all versions of method. We may not correctly restore the original
1811 // bytecode in all method versions, but that is ok. Because the class is being unloaded
1812 // so these methods won't be used anymore.
1813 if (bci >= 0) {
1814 break;
1815 }
1816 } else {
1817 // This one is a keeper.
1818 prev_bp = bp;
1819 }
1820 }
1821 }
1822
1823 void Method::clear_breakpoint(int bci) {
1824 assert(bci >= 0, "");
1825 clear_matches(this, bci);
1826 }
1827
1828 void Method::clear_all_breakpoints() {
1829 clear_matches(this, -1);
1830 }
1831
1832 #endif // INCLUDE_JVMTI
1833
1834 int Method::invocation_count() {
1835 MethodCounters *mcs = method_counters();
1836 if (TieredCompilation) {
1837 MethodData* const mdo = method_data();
1838 if (((mcs != NULL) ? mcs->invocation_counter()->carry() : false) ||
1839 ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) {
1840 return InvocationCounter::count_limit;
1841 } else {
1842 return ((mcs != NULL) ? mcs->invocation_counter()->count() : 0) +
1843 ((mdo != NULL) ? mdo->invocation_counter()->count() : 0);
1844 }
1845 } else {
1846 return (mcs == NULL) ? 0 : mcs->invocation_counter()->count();
1847 }
1848 }
1849
1850 int Method::backedge_count() {
1851 MethodCounters *mcs = method_counters();
1852 if (TieredCompilation) {
1853 MethodData* const mdo = method_data();
1854 if (((mcs != NULL) ? mcs->backedge_counter()->carry() : false) ||
1855 ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) {
1856 return InvocationCounter::count_limit;
1857 } else {
1858 return ((mcs != NULL) ? mcs->backedge_counter()->count() : 0) +
1859 ((mdo != NULL) ? mdo->backedge_counter()->count() : 0);
1860 }
1861 } else {
1862 return (mcs == NULL) ? 0 : mcs->backedge_counter()->count();
1863 }
1864 }
1865
1866 int Method::highest_comp_level() const {
1867 const MethodCounters* mcs = method_counters();
1868 if (mcs != NULL) {
1869 return mcs->highest_comp_level();
1870 } else {
1871 return CompLevel_none;
1872 }
1873 }
1874
1875 int Method::highest_osr_comp_level() const {
1876 const MethodCounters* mcs = method_counters();
1877 if (mcs != NULL) {
1878 return mcs->highest_osr_comp_level();
1879 } else {
1880 return CompLevel_none;
1881 }
1882 }
1883
1884 void Method::set_highest_comp_level(int level) {
1885 MethodCounters* mcs = method_counters();
1886 if (mcs != NULL) {
1887 mcs->set_highest_comp_level(level);
1888 }
1889 }
1890
1891 void Method::set_highest_osr_comp_level(int level) {
1892 MethodCounters* mcs = method_counters();
1893 if (mcs != NULL) {
1894 mcs->set_highest_osr_comp_level(level);
1895 }
1896 }
1897
1898 #if INCLUDE_JVMTI
1899
1900 BreakpointInfo::BreakpointInfo(Method* m, int bci) {
1901 _bci = bci;
1902 _name_index = m->name_index();
1903 _signature_index = m->signature_index();
1904 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci);
1905 if (_orig_bytecode == Bytecodes::_breakpoint)
1906 _orig_bytecode = m->orig_bytecode_at(_bci);
1907 _next = NULL;
1908 }
1909
1910 void BreakpointInfo::set(Method* method) {
1911 #ifdef ASSERT
1912 {
1913 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci);
1914 if (code == Bytecodes::_breakpoint)
1915 code = method->orig_bytecode_at(_bci);
1916 assert(orig_bytecode() == code, "original bytecode must be the same");
1917 }
1918 #endif
1919 Thread *thread = Thread::current();
1920 *method->bcp_from(_bci) = Bytecodes::_breakpoint;
1921 method->incr_number_of_breakpoints(thread);
1922 SystemDictionary::notice_modification();
1923 {
1924 // Deoptimize all dependents on this method
1925 HandleMark hm(thread);
1926 methodHandle mh(thread, method);
1927 CodeCache::flush_dependents_on_method(mh);
1928 }
1929 }
1930
1931 void BreakpointInfo::clear(Method* method) {
1932 *method->bcp_from(_bci) = orig_bytecode();
1933 assert(method->number_of_breakpoints() > 0, "must not go negative");
1934 method->decr_number_of_breakpoints(Thread::current());
1935 }
1936
1937 #endif // INCLUDE_JVMTI
1938
1939 // jmethodID handling
1940
1941 // This is a block allocating object, sort of like JNIHandleBlock, only a
1942 // lot simpler.
1943 // It's allocated on the CHeap because once we allocate a jmethodID, we can
1944 // never get rid of it.
1945
1946 static const int min_block_size = 8;
1947
1948 class JNIMethodBlockNode : public CHeapObj<mtClass> {
1949 friend class JNIMethodBlock;
1950 Method** _methods;
1951 int _number_of_methods;
1952 int _top;
1953 JNIMethodBlockNode* _next;
1954
1955 public:
1956
1957 JNIMethodBlockNode(int num_methods = min_block_size);
1958
1959 ~JNIMethodBlockNode() { FREE_C_HEAP_ARRAY(Method*, _methods); }
1960
1961 void ensure_methods(int num_addl_methods) {
1962 if (_top < _number_of_methods) {
1963 num_addl_methods -= _number_of_methods - _top;
1964 if (num_addl_methods <= 0) {
1965 return;
1966 }
1967 }
1968 if (_next == NULL) {
1969 _next = new JNIMethodBlockNode(MAX2(num_addl_methods, min_block_size));
1970 } else {
1971 _next->ensure_methods(num_addl_methods);
1972 }
1973 }
1974 };
1975
1976 class JNIMethodBlock : public CHeapObj<mtClass> {
1977 JNIMethodBlockNode _head;
1978 JNIMethodBlockNode *_last_free;
1979 public:
1980 static Method* const _free_method;
1981
1982 JNIMethodBlock(int initial_capacity = min_block_size)
1983 : _head(initial_capacity), _last_free(&_head) {}
1984
1985 void ensure_methods(int num_addl_methods) {
1986 _last_free->ensure_methods(num_addl_methods);
1987 }
1988
1989 Method** add_method(Method* m) {
1990 for (JNIMethodBlockNode* b = _last_free; b != NULL; b = b->_next) {
1991 if (b->_top < b->_number_of_methods) {
1992 // top points to the next free entry.
1993 int i = b->_top;
1994 b->_methods[i] = m;
1995 b->_top++;
1996 _last_free = b;
1997 return &(b->_methods[i]);
1998 } else if (b->_top == b->_number_of_methods) {
1999 // if the next free entry ran off the block see if there's a free entry
2000 for (int i = 0; i < b->_number_of_methods; i++) {
2001 if (b->_methods[i] == _free_method) {
2002 b->_methods[i] = m;
2003 _last_free = b;
2004 return &(b->_methods[i]);
2005 }
2006 }
2007 // Only check each block once for frees. They're very unlikely.
2008 // Increment top past the end of the block.
2009 b->_top++;
2010 }
2011 // need to allocate a next block.
2012 if (b->_next == NULL) {
2013 b->_next = _last_free = new JNIMethodBlockNode();
2014 }
2015 }
2016 guarantee(false, "Should always allocate a free block");
2017 return NULL;
2018 }
2019
2020 bool contains(Method** m) {
2021 if (m == NULL) return false;
2022 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) {
2023 if (b->_methods <= m && m < b->_methods + b->_number_of_methods) {
2024 // This is a bit of extra checking, for two reasons. One is
2025 // that contains() deals with pointers that are passed in by
2026 // JNI code, so making sure that the pointer is aligned
2027 // correctly is valuable. The other is that <= and > are
2028 // technically not defined on pointers, so the if guard can
2029 // pass spuriously; no modern compiler is likely to make that
2030 // a problem, though (and if one did, the guard could also
2031 // fail spuriously, which would be bad).
2032 ptrdiff_t idx = m - b->_methods;
2033 if (b->_methods + idx == m) {
2034 return true;
2035 }
2036 }
2037 }
2038 return false; // not found
2039 }
2040
2041 // Doesn't really destroy it, just marks it as free so it can be reused.
2042 void destroy_method(Method** m) {
2043 #ifdef ASSERT
2044 assert(contains(m), "should be a methodID");
2045 #endif // ASSERT
2046 *m = _free_method;
2047 }
2048
2049 // During class unloading the methods are cleared, which is different
2050 // than freed.
2051 void clear_all_methods() {
2052 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) {
2053 for (int i = 0; i< b->_number_of_methods; i++) {
2054 b->_methods[i] = NULL;
2055 }
2056 }
2057 }
2058 #ifndef PRODUCT
2059 int count_methods() {
2060 // count all allocated methods
2061 int count = 0;
2062 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) {
2063 for (int i = 0; i< b->_number_of_methods; i++) {
2064 if (b->_methods[i] != _free_method) count++;
2065 }
2066 }
2067 return count;
2068 }
2069 #endif // PRODUCT
2070 };
2071
2072 // Something that can't be mistaken for an address or a markOop
2073 Method* const JNIMethodBlock::_free_method = (Method*)55;
2074
2075 JNIMethodBlockNode::JNIMethodBlockNode(int num_methods) : _top(0), _next(NULL) {
2076 _number_of_methods = MAX2(num_methods, min_block_size);
2077 _methods = NEW_C_HEAP_ARRAY(Method*, _number_of_methods, mtInternal);
2078 for (int i = 0; i < _number_of_methods; i++) {
2079 _methods[i] = JNIMethodBlock::_free_method;
2080 }
2081 }
2082
2083 void Method::ensure_jmethod_ids(ClassLoaderData* loader_data, int capacity) {
2084 ClassLoaderData* cld = loader_data;
2085 if (!SafepointSynchronize::is_at_safepoint()) {
2086 // Have to add jmethod_ids() to class loader data thread-safely.
2087 // Also have to add the method to the list safely, which the cld lock
2088 // protects as well.
2089 MutexLocker ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag);
2090 if (cld->jmethod_ids() == NULL) {
2091 cld->set_jmethod_ids(new JNIMethodBlock(capacity));
2092 } else {
2093 cld->jmethod_ids()->ensure_methods(capacity);
2094 }
2095 } else {
2096 // At safepoint, we are single threaded and can set this.
2097 if (cld->jmethod_ids() == NULL) {
2098 cld->set_jmethod_ids(new JNIMethodBlock(capacity));
2099 } else {
2100 cld->jmethod_ids()->ensure_methods(capacity);
2101 }
2102 }
2103 }
2104
2105 // Add a method id to the jmethod_ids
2106 jmethodID Method::make_jmethod_id(ClassLoaderData* loader_data, Method* m) {
2107 ClassLoaderData* cld = loader_data;
2108
2109 if (!SafepointSynchronize::is_at_safepoint()) {
2110 // Have to add jmethod_ids() to class loader data thread-safely.
2111 // Also have to add the method to the list safely, which the cld lock
2112 // protects as well.
2113 MutexLocker ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag);
2114 if (cld->jmethod_ids() == NULL) {
2115 cld->set_jmethod_ids(new JNIMethodBlock());
2116 }
2117 // jmethodID is a pointer to Method*
2118 return (jmethodID)cld->jmethod_ids()->add_method(m);
2119 } else {
2120 // At safepoint, we are single threaded and can set this.
2121 if (cld->jmethod_ids() == NULL) {
2122 cld->set_jmethod_ids(new JNIMethodBlock());
2123 }
2124 // jmethodID is a pointer to Method*
2125 return (jmethodID)cld->jmethod_ids()->add_method(m);
2126 }
2127 }
2128
2129 // Mark a jmethodID as free. This is called when there is a data race in
2130 // InstanceKlass while creating the jmethodID cache.
2131 void Method::destroy_jmethod_id(ClassLoaderData* loader_data, jmethodID m) {
2132 ClassLoaderData* cld = loader_data;
2133 Method** ptr = (Method**)m;
2134 assert(cld->jmethod_ids() != NULL, "should have method handles");
2135 cld->jmethod_ids()->destroy_method(ptr);
2136 }
2137
2138 void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* new_method) {
2139 // Can't assert the method_holder is the same because the new method has the
2140 // scratch method holder.
2141 assert(resolve_jmethod_id(jmid)->method_holder()->class_loader()
2142 == new_method->method_holder()->class_loader() ||
2143 new_method->method_holder()->class_loader() == NULL, // allow Unsafe substitution
2144 "changing to a different class loader");
2145 // Just change the method in place, jmethodID pointer doesn't change.
2146 *((Method**)jmid) = new_method;
2147 }
2148
2149 bool Method::is_method_id(jmethodID mid) {
2150 Method* m = resolve_jmethod_id(mid);
2151 assert(m != NULL, "should be called with non-null method");
2152 InstanceKlass* ik = m->method_holder();
2153 ClassLoaderData* cld = ik->class_loader_data();
2154 if (cld->jmethod_ids() == NULL) return false;
2155 return (cld->jmethod_ids()->contains((Method**)mid));
2156 }
2157
2158 Method* Method::checked_resolve_jmethod_id(jmethodID mid) {
2159 if (mid == NULL) return NULL;
2160 Method* o = resolve_jmethod_id(mid);
2161 if (o == NULL || o == JNIMethodBlock::_free_method || !((Metadata*)o)->is_method()) {
2162 return NULL;
2163 }
2164 return o;
2165 };
2166
2167 void Method::set_on_stack(const bool value) {
2168 // Set both the method itself and its constant pool. The constant pool
2169 // on stack means some method referring to it is also on the stack.
2170 constants()->set_on_stack(value);
2171
2172 bool already_set = on_stack();
2173 _access_flags.set_on_stack(value);
2174 if (value && !already_set) {
2175 MetadataOnStackMark::record(this);
2176 }
2177 assert(!value || !is_old() || is_obsolete() || is_running_emcp(),
2178 "emcp methods cannot run after emcp bit is cleared");
2179 }
2180
2181 // Called when the class loader is unloaded to make all methods weak.
2182 void Method::clear_jmethod_ids(ClassLoaderData* loader_data) {
2183 loader_data->jmethod_ids()->clear_all_methods();
2184 }
2185
2186 bool Method::has_method_vptr(const void* ptr) {
2187 Method m;
2188 // This assumes that the vtbl pointer is the first word of a C++ object.
2189 return dereference_vptr(&m) == dereference_vptr(ptr);
2190 }
2191
2192 // Check that this pointer is valid by checking that the vtbl pointer matches
2193 bool Method::is_valid_method(const Method* m) {
2194 if (m == NULL) {
2195 return false;
2196 } else if ((intptr_t(m) & (wordSize-1)) != 0) {
2197 // Quick sanity check on pointer.
2198 return false;
2199 } else if (m->is_shared()) {
2200 return MetaspaceShared::is_valid_shared_method(m);
2201 } else if (Metaspace::contains_non_shared(m)) {
2202 return has_method_vptr((const void*)m);
2203 } else {
2204 return false;
2205 }
2206 }
2207
2208 #ifndef PRODUCT
2209 void Method::print_jmethod_ids(const ClassLoaderData* loader_data, outputStream* out) {
2210 out->print(" jni_method_id count = %d", loader_data->jmethod_ids()->count_methods());
2211 }
2212 #endif // PRODUCT
2213
2214
2215 // Printing
2216
2217 #ifndef PRODUCT
2218
2219 void Method::print_on(outputStream* st) const {
2220 ResourceMark rm;
2221 assert(is_method(), "must be method");
2222 st->print_cr("%s", internal_name());
2223 st->print_cr(" - this oop: " INTPTR_FORMAT, p2i(this));
2224 st->print (" - method holder: "); method_holder()->print_value_on(st); st->cr();
2225 st->print (" - constants: " INTPTR_FORMAT " ", p2i(constants()));
2226 constants()->print_value_on(st); st->cr();
2227 st->print (" - access: 0x%x ", access_flags().as_int()); access_flags().print_on(st); st->cr();
2228 st->print (" - name: "); name()->print_value_on(st); st->cr();
2229 st->print (" - signature: "); signature()->print_value_on(st); st->cr();
2230 st->print_cr(" - max stack: %d", max_stack());
2231 st->print_cr(" - max locals: %d", max_locals());
2232 st->print_cr(" - size of params: %d", size_of_parameters());
2233 st->print_cr(" - method size: %d", method_size());
2234 if (intrinsic_id() != vmIntrinsics::_none)
2235 st->print_cr(" - intrinsic id: %d %s", intrinsic_id(), vmIntrinsics::name_at(intrinsic_id()));
2236 if (highest_comp_level() != CompLevel_none)
2237 st->print_cr(" - highest level: %d", highest_comp_level());
2238 st->print_cr(" - vtable index: %d", _vtable_index);
2239 st->print_cr(" - i2i entry: " INTPTR_FORMAT, p2i(interpreter_entry()));
2240 st->print( " - adapters: ");
2241 AdapterHandlerEntry* a = ((Method*)this)->adapter();
2242 if (a == NULL)
2243 st->print_cr(INTPTR_FORMAT, p2i(a));
2244 else
2245 a->print_adapter_on(st);
2246 st->print_cr(" - compiled entry " INTPTR_FORMAT, p2i(from_compiled_entry()));
2247 st->print_cr(" - code size: %d", code_size());
2248 if (code_size() != 0) {
2249 st->print_cr(" - code start: " INTPTR_FORMAT, p2i(code_base()));
2250 st->print_cr(" - code end (excl): " INTPTR_FORMAT, p2i(code_base() + code_size()));
2251 }
2252 if (method_data() != NULL) {
2253 st->print_cr(" - method data: " INTPTR_FORMAT, p2i(method_data()));
2254 }
2255 st->print_cr(" - checked ex length: %d", checked_exceptions_length());
2256 if (checked_exceptions_length() > 0) {
2257 CheckedExceptionElement* table = checked_exceptions_start();
2258 st->print_cr(" - checked ex start: " INTPTR_FORMAT, p2i(table));
2259 if (Verbose) {
2260 for (int i = 0; i < checked_exceptions_length(); i++) {
2261 st->print_cr(" - throws %s", constants()->printable_name_at(table[i].class_cp_index));
2262 }
2263 }
2264 }
2265 if (has_linenumber_table()) {
2266 u_char* table = compressed_linenumber_table();
2267 st->print_cr(" - linenumber start: " INTPTR_FORMAT, p2i(table));
2268 if (Verbose) {
2269 CompressedLineNumberReadStream stream(table);
2270 while (stream.read_pair()) {
2271 st->print_cr(" - line %d: %d", stream.line(), stream.bci());
2272 }
2273 }
2274 }
2275 st->print_cr(" - localvar length: %d", localvariable_table_length());
2276 if (localvariable_table_length() > 0) {
2277 LocalVariableTableElement* table = localvariable_table_start();
2278 st->print_cr(" - localvar start: " INTPTR_FORMAT, p2i(table));
2279 if (Verbose) {
2280 for (int i = 0; i < localvariable_table_length(); i++) {
2281 int bci = table[i].start_bci;
2282 int len = table[i].length;
2283 const char* name = constants()->printable_name_at(table[i].name_cp_index);
2284 const char* desc = constants()->printable_name_at(table[i].descriptor_cp_index);
2285 int slot = table[i].slot;
2286 st->print_cr(" - %s %s bci=%d len=%d slot=%d", desc, name, bci, len, slot);
2287 }
2288 }
2289 }
2290 if (code() != NULL) {
2291 st->print (" - compiled code: ");
2292 code()->print_value_on(st);
2293 }
2294 if (is_native()) {
2295 st->print_cr(" - native function: " INTPTR_FORMAT, p2i(native_function()));
2296 st->print_cr(" - signature handler: " INTPTR_FORMAT, p2i(signature_handler()));
2297 }
2298 }
2299
2300 void Method::print_linkage_flags(outputStream* st) {
2301 access_flags().print_on(st);
2302 if (is_default_method()) {
2303 st->print("default ");
2304 }
2305 if (is_overpass()) {
2306 st->print("overpass ");
2307 }
2308 }
2309 #endif //PRODUCT
2310
2311 void Method::print_value_on(outputStream* st) const {
2312 assert(is_method(), "must be method");
2313 st->print("%s", internal_name());
2314 print_address_on(st);
2315 st->print(" ");
2316 name()->print_value_on(st);
2317 st->print(" ");
2318 signature()->print_value_on(st);
2319 st->print(" in ");
2320 method_holder()->print_value_on(st);
2321 if (WizardMode) st->print("#%d", _vtable_index);
2322 if (WizardMode) st->print("[%d,%d]", size_of_parameters(), max_locals());
2323 if (WizardMode && code() != NULL) st->print(" ((nmethod*)%p)", code());
2324 }
2325
2326 #if INCLUDE_SERVICES
2327 // Size Statistics
2328 void Method::collect_statistics(KlassSizeStats *sz) const {
2329 int mysize = sz->count(this);
2330 sz->_method_bytes += mysize;
2331 sz->_method_all_bytes += mysize;
2332 sz->_rw_bytes += mysize;
2333
2334 if (constMethod()) {
2335 constMethod()->collect_statistics(sz);
2336 }
2337 if (method_data()) {
2338 method_data()->collect_statistics(sz);
2339 }
2340 }
2341 #endif // INCLUDE_SERVICES
2342
2343 // LogTouchedMethods and PrintTouchedMethods
2344
2345 // TouchedMethodRecord -- we can't use a HashtableEntry<Method*> because
2346 // the Method may be garbage collected. Let's roll our own hash table.
2347 class TouchedMethodRecord : CHeapObj<mtTracing> {
2348 public:
2349 // It's OK to store Symbols here because they will NOT be GC'ed if
2350 // LogTouchedMethods is enabled.
2351 TouchedMethodRecord* _next;
2352 Symbol* _class_name;
2353 Symbol* _method_name;
2354 Symbol* _method_signature;
2355 };
2356
2357 static const int TOUCHED_METHOD_TABLE_SIZE = 20011;
2358 static TouchedMethodRecord** _touched_method_table = NULL;
2359
2360 void Method::log_touched(TRAPS) {
2361
2362 const int table_size = TOUCHED_METHOD_TABLE_SIZE;
2363 Symbol* my_class = klass_name();
2364 Symbol* my_name = name();
2365 Symbol* my_sig = signature();
2366
2367 unsigned int hash = my_class->identity_hash() +
2368 my_name->identity_hash() +
2369 my_sig->identity_hash();
2370 juint index = juint(hash) % table_size;
2371
2372 MutexLocker ml(TouchedMethodLog_lock, THREAD);
2373 if (_touched_method_table == NULL) {
2374 _touched_method_table = NEW_C_HEAP_ARRAY2(TouchedMethodRecord*, table_size,
2375 mtTracing, CURRENT_PC);
2376 memset(_touched_method_table, 0, sizeof(TouchedMethodRecord*)*table_size);
2377 }
2378
2379 TouchedMethodRecord* ptr = _touched_method_table[index];
2380 while (ptr) {
2381 if (ptr->_class_name == my_class &&
2382 ptr->_method_name == my_name &&
2383 ptr->_method_signature == my_sig) {
2384 return;
2385 }
2386 if (ptr->_next == NULL) break;
2387 ptr = ptr->_next;
2388 }
2389 TouchedMethodRecord* nptr = NEW_C_HEAP_OBJ(TouchedMethodRecord, mtTracing);
2390 my_class->increment_refcount();
2391 my_name->increment_refcount();
2392 my_sig->increment_refcount();
2393 nptr->_class_name = my_class;
2394 nptr->_method_name = my_name;
2395 nptr->_method_signature = my_sig;
2396 nptr->_next = NULL;
2397
2398 if (ptr == NULL) {
2399 // first
2400 _touched_method_table[index] = nptr;
2401 } else {
2402 ptr->_next = nptr;
2403 }
2404 }
2405
2406 void Method::print_touched_methods(outputStream* out) {
2407 MutexLocker ml(Thread::current()->is_VM_thread() ? NULL : TouchedMethodLog_lock);
2408 out->print_cr("# Method::print_touched_methods version 1");
2409 if (_touched_method_table) {
2410 for (int i = 0; i < TOUCHED_METHOD_TABLE_SIZE; i++) {
2411 TouchedMethodRecord* ptr = _touched_method_table[i];
2412 while(ptr) {
2413 ptr->_class_name->print_symbol_on(out); out->print(".");
2414 ptr->_method_name->print_symbol_on(out); out->print(":");
2415 ptr->_method_signature->print_symbol_on(out); out->cr();
2416 ptr = ptr->_next;
2417 }
2418 }
2419 }
2420 }
2421
2422 // Verification
2423
2424 void Method::verify_on(outputStream* st) {
2425 guarantee(is_method(), "object must be method");
2426 guarantee(constants()->is_constantPool(), "should be constant pool");
2427 MethodData* md = method_data();
2428 guarantee(md == NULL ||
2429 md->is_methodData(), "should be method data");
2430 }