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