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