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