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