rev 54838 : [mq]: 8221734-v2 rev 54839 : [mq]: 8221734-v3
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 Method::unlink_code(this); 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(Method *method, CompiledMethod *compare) { 956 if (method == NULL) { 957 return; 958 } 959 MutexLocker ml(CompiledMethod_lock->owned_by_self() ? NULL : CompiledMethod_lock, Mutex::_no_safepoint_check_flag); 960 if (method->code() == compare || 961 method->from_compiled_entry() == compare->verified_entry_point()) { 962 method->clear_code(); 963 } 964 } 965 966 void Method::unlink_code(Method *method) { 967 if (method != NULL) { 968 MutexLocker ml(CompiledMethod_lock->owned_by_self() ? NULL : CompiledMethod_lock, Mutex::_no_safepoint_check_flag); 969 method->clear_code(); 970 } 971 } 972 973 #if INCLUDE_CDS 974 // Called by class data sharing to remove any entry points (which are not shared) 975 void Method::unlink_method() { 976 _code = NULL; 977 978 assert(DumpSharedSpaces, "dump time only"); 979 // Set the values to what they should be at run time. Note that 980 // this Method can no longer be executed during dump time. 981 _i2i_entry = Interpreter::entry_for_cds_method(this); 982 _from_interpreted_entry = _i2i_entry; 983 984 if (is_native()) { 985 *native_function_addr() = NULL; 986 set_signature_handler(NULL); 987 } 988 NOT_PRODUCT(set_compiled_invocation_count(0);) 989 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, "must be NULL during dump time, to be initialized at run time"); 994 995 set_method_data(NULL); 996 clear_method_counters(); 997 } 998 #endif 999 1000 /**************************************************************************** 1001 // The following illustrates how the entries work for CDS shared Methods: 1002 // 1003 // Our goal is to delay writing into a shared Method until it's compiled. 1004 // Hence, we want to determine the initial values for _i2i_entry, 1005 // _from_interpreted_entry and _from_compiled_entry during CDS dump time. 1006 // 1007 // In this example, both Methods A and B have the _i2i_entry of "zero_locals". 1008 // They also have similar signatures so that they will share the same 1009 // AdapterHandlerEntry. 1010 // 1011 // _adapter_trampoline points to a fixed location in the RW section of 1012 // the CDS archive. This location initially contains a NULL pointer. When the 1013 // first of method A or B is linked, an AdapterHandlerEntry is allocated 1014 // dynamically, and its c2i/i2c entries are generated. 1015 // 1016 // _i2i_entry and _from_interpreted_entry initially points to the same 1017 // (fixed) location in the CODE section of the CDS archive. This contains 1018 // an unconditional branch to the actual entry for "zero_locals", which is 1019 // generated at run time and may be on an arbitrary address. Thus, the 1020 // unconditional branch is also generated at run time to jump to the correct 1021 // address. 1022 // 1023 // Similarly, _from_compiled_entry points to a fixed address in the CODE 1024 // section. This address has enough space for an unconditional branch 1025 // instruction, and is initially zero-filled. After the AdapterHandlerEntry is 1026 // initialized, and the address for the actual c2i_entry is known, we emit a 1027 // branch instruction here to branch to the actual c2i_entry. 1028 // 1029 // The effect of the extra branch on the i2i and c2i entries is negligible. 1030 // 1031 // The reason for putting _adapter_trampoline in RO is many shared Methods 1032 // share the same AdapterHandlerEntry, so we can save space in the RW section 1033 // by having the extra indirection. 1034 1035 1036 [Method A: RW] 1037 _constMethod ----> [ConstMethod: RO] 1038 _adapter_trampoline -----------+ 1039 | 1040 _i2i_entry (same value as method B) | 1041 _from_interpreted_entry (same value as method B) | 1042 _from_compiled_entry (same value as method B) | 1043 | 1044 | 1045 [Method B: RW] +--------+ 1046 _constMethod ----> [ConstMethod: RO] | 1047 _adapter_trampoline --+--->(AdapterHandlerEntry* ptr: RW)-+ 1048 | 1049 +-------------------------------+ 1050 | 1051 +----> [AdapterHandlerEntry] (allocated at run time) 1052 _fingerprint 1053 _c2i_entry ---------------------------------+->[c2i entry..] 1054 _i2i_entry -------------+ _i2c_entry ---------------+-> [i2c entry..] | 1055 _from_interpreted_entry | _c2i_unverified_entry | | 1056 | | | | 1057 | | (_cds_entry_table: CODE) | | 1058 | +->[0]: jmp _entry_table[0] --> (i2i_entry_for "zero_locals") | | 1059 | | (allocated at run time) | | 1060 | | ... [asm code ...] | | 1061 +-[not compiled]-+ [n]: jmp _entry_table[n] | | 1062 | | | 1063 | | | 1064 +-[compiled]-------------------------------------------------------------------+ | 1065 | 1066 _from_compiled_entry------------> (_c2i_entry_trampoline: CODE) | 1067 [jmp c2i_entry] ------------------------------------------------------+ 1068 1069 ***/ 1070 1071 // Called when the method_holder is getting linked. Setup entrypoints so the method 1072 // is ready to be called from interpreter, compiler, and vtables. 1073 void Method::link_method(const methodHandle& h_method, TRAPS) { 1074 // If the code cache is full, we may reenter this function for the 1075 // leftover methods that weren't linked. 1076 if (is_shared()) { 1077 address entry = Interpreter::entry_for_cds_method(h_method); 1078 assert(entry != NULL && entry == _i2i_entry, 1079 "should be correctly set during dump time"); 1080 if (adapter() != NULL) { 1081 return; 1082 } 1083 assert(entry == _from_interpreted_entry, 1084 "should be correctly set during dump time"); 1085 } else if (_i2i_entry != NULL) { 1086 return; 1087 } 1088 assert( _code == NULL, "nothing compiled yet" ); 1089 1090 // Setup interpreter entrypoint 1091 assert(this == h_method(), "wrong h_method()" ); 1092 1093 if (!is_shared()) { 1094 assert(adapter() == NULL, "init'd to NULL"); 1095 address entry = Interpreter::entry_for_method(h_method); 1096 assert(entry != NULL, "interpreter entry must be non-null"); 1097 // Sets both _i2i_entry and _from_interpreted_entry 1098 set_interpreter_entry(entry); 1099 } 1100 1101 // Don't overwrite already registered native entries. 1102 if (is_native() && !has_native_function()) { 1103 set_native_function( 1104 SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), 1105 !native_bind_event_is_interesting); 1106 } 1107 1108 // Setup compiler entrypoint. This is made eagerly, so we do not need 1109 // special handling of vtables. An alternative is to make adapters more 1110 // lazily by calling make_adapter() from from_compiled_entry() for the 1111 // normal calls. For vtable calls life gets more complicated. When a 1112 // call-site goes mega-morphic we need adapters in all methods which can be 1113 // called from the vtable. We need adapters on such methods that get loaded 1114 // later. Ditto for mega-morphic itable calls. If this proves to be a 1115 // problem we'll make these lazily later. 1116 (void) make_adapters(h_method, CHECK); 1117 1118 // ONLY USE the h_method now as make_adapter may have blocked 1119 1120 } 1121 1122 address Method::make_adapters(const methodHandle& mh, TRAPS) { 1123 // Adapters for compiled code are made eagerly here. They are fairly 1124 // small (generally < 100 bytes) and quick to make (and cached and shared) 1125 // so making them eagerly shouldn't be too expensive. 1126 AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh); 1127 if (adapter == NULL ) { 1128 if (!is_init_completed()) { 1129 // Don't throw exceptions during VM initialization because java.lang.* classes 1130 // might not have been initialized, causing problems when constructing the 1131 // Java exception object. 1132 vm_exit_during_initialization("Out of space in CodeCache for adapters"); 1133 } else { 1134 THROW_MSG_NULL(vmSymbols::java_lang_VirtualMachineError(), "Out of space in CodeCache for adapters"); 1135 } 1136 } 1137 1138 if (mh->is_shared()) { 1139 assert(mh->adapter() == adapter, "must be"); 1140 assert(mh->_from_compiled_entry != NULL, "must be"); 1141 } else { 1142 mh->set_adapter_entry(adapter); 1143 mh->_from_compiled_entry = adapter->get_c2i_entry(); 1144 } 1145 return adapter->get_c2i_entry(); 1146 } 1147 1148 void Method::restore_unshareable_info(TRAPS) { 1149 assert(is_method() && is_valid_method(this), "ensure C++ vtable is restored"); 1150 1151 // Since restore_unshareable_info can be called more than once for a method, don't 1152 // redo any work. 1153 if (adapter() == NULL) { 1154 methodHandle mh(THREAD, this); 1155 link_method(mh, CHECK); 1156 } 1157 } 1158 1159 address Method::from_compiled_entry_no_trampoline() const { 1160 CompiledMethod *code = OrderAccess::load_acquire(&_code); 1161 if (code) { 1162 return code->verified_entry_point(); 1163 } else { 1164 return adapter()->get_c2i_entry(); 1165 } 1166 } 1167 1168 // The verified_code_entry() must be called when a invoke is resolved 1169 // on this method. 1170 1171 // It returns the compiled code entry point, after asserting not null. 1172 // This function is called after potential safepoints so that nmethod 1173 // or adapter that it points to is still live and valid. 1174 // This function must not hit a safepoint! 1175 address Method::verified_code_entry() { 1176 debug_only(NoSafepointVerifier nsv;) 1177 assert(_from_compiled_entry != NULL, "must be set"); 1178 return _from_compiled_entry; 1179 } 1180 1181 // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all 1182 // (could be racing a deopt). 1183 // Not inline to avoid circular ref. 1184 bool Method::check_code() const { 1185 // cached in a register or local. There's a race on the value of the field. 1186 CompiledMethod *code = OrderAccess::load_acquire(&_code); 1187 return code == NULL || (code->method() == NULL) || (code->method() == (Method*)this && !code->is_osr_method()); 1188 } 1189 1190 // Install compiled code. Instantly it can execute. 1191 void Method::set_code(const methodHandle& mh, CompiledMethod *code) { 1192 MutexLocker pl(CompiledMethod_lock, Mutex::_no_safepoint_check_flag); 1193 assert( code, "use clear_code to remove code" ); 1194 assert( mh->check_code(), "" ); 1195 1196 guarantee(mh->adapter() != NULL, "Adapter blob must already exist!"); 1197 1198 // These writes must happen in this order, because the interpreter will 1199 // directly jump to from_interpreted_entry which jumps to an i2c adapter 1200 // which jumps to _from_compiled_entry. 1201 mh->_code = code; // Assign before allowing compiled code to exec 1202 1203 int comp_level = code->comp_level(); 1204 // In theory there could be a race here. In practice it is unlikely 1205 // and not worth worrying about. 1206 if (comp_level > mh->highest_comp_level()) { 1207 mh->set_highest_comp_level(comp_level); 1208 } 1209 1210 OrderAccess::storestore(); 1211 mh->_from_compiled_entry = code->verified_entry_point(); 1212 OrderAccess::storestore(); 1213 // Instantly compiled code can execute. 1214 if (!mh->is_method_handle_intrinsic()) 1215 mh->_from_interpreted_entry = mh->get_i2c_entry(); 1216 } 1217 1218 1219 bool Method::is_overridden_in(Klass* k) const { 1220 InstanceKlass* ik = InstanceKlass::cast(k); 1221 1222 if (ik->is_interface()) return false; 1223 1224 // If method is an interface, we skip it - except if it 1225 // is a miranda method 1226 if (method_holder()->is_interface()) { 1227 // Check that method is not a miranda method 1228 if (ik->lookup_method(name(), signature()) == NULL) { 1229 // No implementation exist - so miranda method 1230 return false; 1231 } 1232 return true; 1233 } 1234 1235 assert(ik->is_subclass_of(method_holder()), "should be subklass"); 1236 if (!has_vtable_index()) { 1237 return false; 1238 } else { 1239 Method* vt_m = ik->method_at_vtable(vtable_index()); 1240 return vt_m != this; 1241 } 1242 } 1243 1244 1245 // give advice about whether this Method* should be cached or not 1246 bool Method::should_not_be_cached() const { 1247 if (is_old()) { 1248 // This method has been redefined. It is either EMCP or obsolete 1249 // and we don't want to cache it because that would pin the method 1250 // down and prevent it from being collectible if and when it 1251 // finishes executing. 1252 return true; 1253 } 1254 1255 // caching this method should be just fine 1256 return false; 1257 } 1258 1259 1260 /** 1261 * Returns true if this is one of the specially treated methods for 1262 * security related stack walks (like Reflection.getCallerClass). 1263 */ 1264 bool Method::is_ignored_by_security_stack_walk() const { 1265 if (intrinsic_id() == vmIntrinsics::_invoke) { 1266 // This is Method.invoke() -- ignore it 1267 return true; 1268 } 1269 if (method_holder()->is_subclass_of(SystemDictionary::reflect_MethodAccessorImpl_klass())) { 1270 // This is an auxilary frame -- ignore it 1271 return true; 1272 } 1273 if (is_method_handle_intrinsic() || is_compiled_lambda_form()) { 1274 // This is an internal adapter frame for method handles -- ignore it 1275 return true; 1276 } 1277 return false; 1278 } 1279 1280 1281 // Constant pool structure for invoke methods: 1282 enum { 1283 _imcp_invoke_name = 1, // utf8: 'invokeExact', etc. 1284 _imcp_invoke_signature, // utf8: (variable Symbol*) 1285 _imcp_limit 1286 }; 1287 1288 // Test if this method is an MH adapter frame generated by Java code. 1289 // Cf. java/lang/invoke/InvokerBytecodeGenerator 1290 bool Method::is_compiled_lambda_form() const { 1291 return intrinsic_id() == vmIntrinsics::_compiledLambdaForm; 1292 } 1293 1294 // Test if this method is an internal MH primitive method. 1295 bool Method::is_method_handle_intrinsic() const { 1296 vmIntrinsics::ID iid = intrinsic_id(); 1297 return (MethodHandles::is_signature_polymorphic(iid) && 1298 MethodHandles::is_signature_polymorphic_intrinsic(iid)); 1299 } 1300 1301 bool Method::has_member_arg() const { 1302 vmIntrinsics::ID iid = intrinsic_id(); 1303 return (MethodHandles::is_signature_polymorphic(iid) && 1304 MethodHandles::has_member_arg(iid)); 1305 } 1306 1307 // Make an instance of a signature-polymorphic internal MH primitive. 1308 methodHandle Method::make_method_handle_intrinsic(vmIntrinsics::ID iid, 1309 Symbol* signature, 1310 TRAPS) { 1311 ResourceMark rm; 1312 methodHandle empty; 1313 1314 InstanceKlass* holder = SystemDictionary::MethodHandle_klass(); 1315 Symbol* name = MethodHandles::signature_polymorphic_intrinsic_name(iid); 1316 assert(iid == MethodHandles::signature_polymorphic_name_id(name), ""); 1317 if (TraceMethodHandles) { 1318 tty->print_cr("make_method_handle_intrinsic MH.%s%s", name->as_C_string(), signature->as_C_string()); 1319 } 1320 1321 // invariant: cp->symbol_at_put is preceded by a refcount increment (more usually a lookup) 1322 name->increment_refcount(); 1323 signature->increment_refcount(); 1324 1325 int cp_length = _imcp_limit; 1326 ClassLoaderData* loader_data = holder->class_loader_data(); 1327 constantPoolHandle cp; 1328 { 1329 ConstantPool* cp_oop = ConstantPool::allocate(loader_data, cp_length, CHECK_(empty)); 1330 cp = constantPoolHandle(THREAD, cp_oop); 1331 } 1332 cp->set_pool_holder(holder); 1333 cp->symbol_at_put(_imcp_invoke_name, name); 1334 cp->symbol_at_put(_imcp_invoke_signature, signature); 1335 cp->set_has_preresolution(); 1336 1337 // decide on access bits: public or not? 1338 int flags_bits = (JVM_ACC_NATIVE | JVM_ACC_SYNTHETIC | JVM_ACC_FINAL); 1339 bool must_be_static = MethodHandles::is_signature_polymorphic_static(iid); 1340 if (must_be_static) flags_bits |= JVM_ACC_STATIC; 1341 assert((flags_bits & JVM_ACC_PUBLIC) == 0, "do not expose these methods"); 1342 1343 methodHandle m; 1344 { 1345 InlineTableSizes sizes; 1346 Method* m_oop = Method::allocate(loader_data, 0, 1347 accessFlags_from(flags_bits), &sizes, 1348 ConstMethod::NORMAL, CHECK_(empty)); 1349 m = methodHandle(THREAD, m_oop); 1350 } 1351 m->set_constants(cp()); 1352 m->set_name_index(_imcp_invoke_name); 1353 m->set_signature_index(_imcp_invoke_signature); 1354 assert(MethodHandles::is_signature_polymorphic_name(m->name()), ""); 1355 assert(m->signature() == signature, ""); 1356 ResultTypeFinder rtf(signature); 1357 m->constMethod()->set_result_type(rtf.type()); 1358 m->compute_size_of_parameters(THREAD); 1359 m->init_intrinsic_id(); 1360 assert(m->is_method_handle_intrinsic(), ""); 1361 #ifdef ASSERT 1362 if (!MethodHandles::is_signature_polymorphic(m->intrinsic_id())) m->print(); 1363 assert(MethodHandles::is_signature_polymorphic(m->intrinsic_id()), "must be an invoker"); 1364 assert(m->intrinsic_id() == iid, "correctly predicted iid"); 1365 #endif //ASSERT 1366 1367 // Finally, set up its entry points. 1368 assert(m->can_be_statically_bound(), ""); 1369 m->set_vtable_index(Method::nonvirtual_vtable_index); 1370 m->link_method(m, CHECK_(empty)); 1371 1372 if (TraceMethodHandles && (Verbose || WizardMode)) { 1373 ttyLocker ttyl; 1374 m->print_on(tty); 1375 } 1376 1377 return m; 1378 } 1379 1380 Klass* Method::check_non_bcp_klass(Klass* klass) { 1381 if (klass != NULL && klass->class_loader() != NULL) { 1382 if (klass->is_objArray_klass()) 1383 klass = ObjArrayKlass::cast(klass)->bottom_klass(); 1384 return klass; 1385 } 1386 return NULL; 1387 } 1388 1389 1390 methodHandle Method::clone_with_new_data(const methodHandle& m, u_char* new_code, int new_code_length, 1391 u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) { 1392 // Code below does not work for native methods - they should never get rewritten anyway 1393 assert(!m->is_native(), "cannot rewrite native methods"); 1394 // Allocate new Method* 1395 AccessFlags flags = m->access_flags(); 1396 1397 ConstMethod* cm = m->constMethod(); 1398 int checked_exceptions_len = cm->checked_exceptions_length(); 1399 int localvariable_len = cm->localvariable_table_length(); 1400 int exception_table_len = cm->exception_table_length(); 1401 int method_parameters_len = cm->method_parameters_length(); 1402 int method_annotations_len = cm->method_annotations_length(); 1403 int parameter_annotations_len = cm->parameter_annotations_length(); 1404 int type_annotations_len = cm->type_annotations_length(); 1405 int default_annotations_len = cm->default_annotations_length(); 1406 1407 InlineTableSizes sizes( 1408 localvariable_len, 1409 new_compressed_linenumber_size, 1410 exception_table_len, 1411 checked_exceptions_len, 1412 method_parameters_len, 1413 cm->generic_signature_index(), 1414 method_annotations_len, 1415 parameter_annotations_len, 1416 type_annotations_len, 1417 default_annotations_len, 1418 0); 1419 1420 ClassLoaderData* loader_data = m->method_holder()->class_loader_data(); 1421 Method* newm_oop = Method::allocate(loader_data, 1422 new_code_length, 1423 flags, 1424 &sizes, 1425 m->method_type(), 1426 CHECK_(methodHandle())); 1427 methodHandle newm (THREAD, newm_oop); 1428 1429 // Create a shallow copy of Method part, but be careful to preserve the new ConstMethod* 1430 ConstMethod* newcm = newm->constMethod(); 1431 int new_const_method_size = newm->constMethod()->size(); 1432 1433 // This works because the source and target are both Methods. Some compilers 1434 // (e.g., clang) complain that the target vtable pointer will be stomped, 1435 // so cast away newm()'s and m()'s Methodness. 1436 memcpy((void*)newm(), (void*)m(), sizeof(Method)); 1437 1438 // Create shallow copy of ConstMethod. 1439 memcpy(newcm, m->constMethod(), sizeof(ConstMethod)); 1440 1441 // Reset correct method/const method, method size, and parameter info 1442 newm->set_constMethod(newcm); 1443 newm->constMethod()->set_code_size(new_code_length); 1444 newm->constMethod()->set_constMethod_size(new_const_method_size); 1445 assert(newm->code_size() == new_code_length, "check"); 1446 assert(newm->method_parameters_length() == method_parameters_len, "check"); 1447 assert(newm->checked_exceptions_length() == checked_exceptions_len, "check"); 1448 assert(newm->exception_table_length() == exception_table_len, "check"); 1449 assert(newm->localvariable_table_length() == localvariable_len, "check"); 1450 // Copy new byte codes 1451 memcpy(newm->code_base(), new_code, new_code_length); 1452 // Copy line number table 1453 if (new_compressed_linenumber_size > 0) { 1454 memcpy(newm->compressed_linenumber_table(), 1455 new_compressed_linenumber_table, 1456 new_compressed_linenumber_size); 1457 } 1458 // Copy method_parameters 1459 if (method_parameters_len > 0) { 1460 memcpy(newm->method_parameters_start(), 1461 m->method_parameters_start(), 1462 method_parameters_len * sizeof(MethodParametersElement)); 1463 } 1464 // Copy checked_exceptions 1465 if (checked_exceptions_len > 0) { 1466 memcpy(newm->checked_exceptions_start(), 1467 m->checked_exceptions_start(), 1468 checked_exceptions_len * sizeof(CheckedExceptionElement)); 1469 } 1470 // Copy exception table 1471 if (exception_table_len > 0) { 1472 memcpy(newm->exception_table_start(), 1473 m->exception_table_start(), 1474 exception_table_len * sizeof(ExceptionTableElement)); 1475 } 1476 // Copy local variable number table 1477 if (localvariable_len > 0) { 1478 memcpy(newm->localvariable_table_start(), 1479 m->localvariable_table_start(), 1480 localvariable_len * sizeof(LocalVariableTableElement)); 1481 } 1482 // Copy stackmap table 1483 if (m->has_stackmap_table()) { 1484 int code_attribute_length = m->stackmap_data()->length(); 1485 Array<u1>* stackmap_data = 1486 MetadataFactory::new_array<u1>(loader_data, code_attribute_length, 0, CHECK_NULL); 1487 memcpy((void*)stackmap_data->adr_at(0), 1488 (void*)m->stackmap_data()->adr_at(0), code_attribute_length); 1489 newm->set_stackmap_data(stackmap_data); 1490 } 1491 1492 // copy annotations over to new method 1493 newcm->copy_annotations_from(loader_data, cm, CHECK_NULL); 1494 return newm; 1495 } 1496 1497 vmSymbols::SID Method::klass_id_for_intrinsics(const Klass* holder) { 1498 // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics 1499 // because we are not loading from core libraries 1500 // exception: the AES intrinsics come from lib/ext/sunjce_provider.jar 1501 // which does not use the class default class loader so we check for its loader here 1502 const InstanceKlass* ik = InstanceKlass::cast(holder); 1503 if ((ik->class_loader() != NULL) && !SystemDictionary::is_platform_class_loader(ik->class_loader())) { 1504 return vmSymbols::NO_SID; // regardless of name, no intrinsics here 1505 } 1506 1507 // see if the klass name is well-known: 1508 Symbol* klass_name = ik->name(); 1509 return vmSymbols::find_sid(klass_name); 1510 } 1511 1512 void Method::init_intrinsic_id() { 1513 assert(_intrinsic_id == vmIntrinsics::_none, "do this just once"); 1514 const uintptr_t max_id_uint = right_n_bits((int)(sizeof(_intrinsic_id) * BitsPerByte)); 1515 assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_id_uint, "else fix size"); 1516 assert(intrinsic_id_size_in_bytes() == sizeof(_intrinsic_id), ""); 1517 1518 // the klass name is well-known: 1519 vmSymbols::SID klass_id = klass_id_for_intrinsics(method_holder()); 1520 assert(klass_id != vmSymbols::NO_SID, "caller responsibility"); 1521 1522 // ditto for method and signature: 1523 vmSymbols::SID name_id = vmSymbols::find_sid(name()); 1524 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle) 1525 && klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle) 1526 && name_id == vmSymbols::NO_SID) { 1527 return; 1528 } 1529 vmSymbols::SID sig_id = vmSymbols::find_sid(signature()); 1530 if (klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle) 1531 && klass_id != vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle) 1532 && sig_id == vmSymbols::NO_SID) { 1533 return; 1534 } 1535 jshort flags = access_flags().as_short(); 1536 1537 vmIntrinsics::ID id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); 1538 if (id != vmIntrinsics::_none) { 1539 set_intrinsic_id(id); 1540 if (id == vmIntrinsics::_Class_cast) { 1541 // Even if the intrinsic is rejected, we want to inline this simple method. 1542 set_force_inline(true); 1543 } 1544 return; 1545 } 1546 1547 // A few slightly irregular cases: 1548 switch (klass_id) { 1549 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath): 1550 // Second chance: check in regular Math. 1551 switch (name_id) { 1552 case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name): 1553 case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name): 1554 case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name): 1555 // pretend it is the corresponding method in the non-strict class: 1556 klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math); 1557 id = vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); 1558 break; 1559 default: 1560 break; 1561 } 1562 break; 1563 1564 // Signature-polymorphic methods: MethodHandle.invoke*, InvokeDynamic.*., VarHandle 1565 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_MethodHandle): 1566 case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_invoke_VarHandle): 1567 if (!is_native()) break; 1568 id = MethodHandles::signature_polymorphic_name_id(method_holder(), name()); 1569 if (is_static() != MethodHandles::is_signature_polymorphic_static(id)) 1570 id = vmIntrinsics::_none; 1571 break; 1572 1573 default: 1574 break; 1575 } 1576 1577 if (id != vmIntrinsics::_none) { 1578 // Set up its iid. It is an alias method. 1579 set_intrinsic_id(id); 1580 return; 1581 } 1582 } 1583 1584 // These two methods are static since a GC may move the Method 1585 bool Method::load_signature_classes(const methodHandle& m, TRAPS) { 1586 if (!THREAD->can_call_java()) { 1587 // There is nothing useful this routine can do from within the Compile thread. 1588 // Hopefully, the signature contains only well-known classes. 1589 // We could scan for this and return true/false, but the caller won't care. 1590 return false; 1591 } 1592 bool sig_is_loaded = true; 1593 Handle class_loader(THREAD, m->method_holder()->class_loader()); 1594 Handle protection_domain(THREAD, m->method_holder()->protection_domain()); 1595 ResourceMark rm(THREAD); 1596 Symbol* signature = m->signature(); 1597 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { 1598 if (ss.is_object()) { 1599 Symbol* sym = ss.as_symbol(CHECK_(false)); 1600 Symbol* name = sym; 1601 Klass* klass = SystemDictionary::resolve_or_null(name, class_loader, 1602 protection_domain, THREAD); 1603 // We are loading classes eagerly. If a ClassNotFoundException or 1604 // a LinkageError was generated, be sure to ignore it. 1605 if (HAS_PENDING_EXCEPTION) { 1606 if (PENDING_EXCEPTION->is_a(SystemDictionary::ClassNotFoundException_klass()) || 1607 PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass())) { 1608 CLEAR_PENDING_EXCEPTION; 1609 } else { 1610 return false; 1611 } 1612 } 1613 if( klass == NULL) { sig_is_loaded = false; } 1614 } 1615 } 1616 return sig_is_loaded; 1617 } 1618 1619 bool Method::has_unloaded_classes_in_signature(const methodHandle& m, TRAPS) { 1620 Handle class_loader(THREAD, m->method_holder()->class_loader()); 1621 Handle protection_domain(THREAD, m->method_holder()->protection_domain()); 1622 ResourceMark rm(THREAD); 1623 Symbol* signature = m->signature(); 1624 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { 1625 if (ss.type() == T_OBJECT) { 1626 Symbol* name = ss.as_symbol_or_null(); 1627 if (name == NULL) return true; 1628 Klass* klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD); 1629 if (klass == NULL) return true; 1630 } 1631 } 1632 return false; 1633 } 1634 1635 // Exposed so field engineers can debug VM 1636 void Method::print_short_name(outputStream* st) { 1637 ResourceMark rm; 1638 #ifdef PRODUCT 1639 st->print(" %s::", method_holder()->external_name()); 1640 #else 1641 st->print(" %s::", method_holder()->internal_name()); 1642 #endif 1643 name()->print_symbol_on(st); 1644 if (WizardMode) signature()->print_symbol_on(st); 1645 else if (MethodHandles::is_signature_polymorphic(intrinsic_id())) 1646 MethodHandles::print_as_basic_type_signature_on(st, signature(), true); 1647 } 1648 1649 // Comparer for sorting an object array containing 1650 // Method*s. 1651 static int method_comparator(Method* a, Method* b) { 1652 return a->name()->fast_compare(b->name()); 1653 } 1654 1655 // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array 1656 // default_methods also uses this without the ordering for fast find_method 1657 void Method::sort_methods(Array<Method*>* methods, bool set_idnums) { 1658 int length = methods->length(); 1659 if (length > 1) { 1660 { 1661 NoSafepointVerifier nsv; 1662 QuickSort::sort(methods->data(), length, method_comparator, /*idempotent=*/false); 1663 } 1664 // Reset method ordering 1665 if (set_idnums) { 1666 for (int i = 0; i < length; i++) { 1667 Method* m = methods->at(i); 1668 m->set_method_idnum(i); 1669 m->set_orig_method_idnum(i); 1670 } 1671 } 1672 } 1673 } 1674 1675 //----------------------------------------------------------------------------------- 1676 // Non-product code unless JVM/TI needs it 1677 1678 #if !defined(PRODUCT) || INCLUDE_JVMTI 1679 class SignatureTypePrinter : public SignatureTypeNames { 1680 private: 1681 outputStream* _st; 1682 bool _use_separator; 1683 1684 void type_name(const char* name) { 1685 if (_use_separator) _st->print(", "); 1686 _st->print("%s", name); 1687 _use_separator = true; 1688 } 1689 1690 public: 1691 SignatureTypePrinter(Symbol* signature, outputStream* st) : SignatureTypeNames(signature) { 1692 _st = st; 1693 _use_separator = false; 1694 } 1695 1696 void print_parameters() { _use_separator = false; iterate_parameters(); } 1697 void print_returntype() { _use_separator = false; iterate_returntype(); } 1698 }; 1699 1700 1701 void Method::print_name(outputStream* st) { 1702 Thread *thread = Thread::current(); 1703 ResourceMark rm(thread); 1704 st->print("%s ", is_static() ? "static" : "virtual"); 1705 if (WizardMode) { 1706 st->print("%s.", method_holder()->internal_name()); 1707 name()->print_symbol_on(st); 1708 signature()->print_symbol_on(st); 1709 } else { 1710 SignatureTypePrinter sig(signature(), st); 1711 sig.print_returntype(); 1712 st->print(" %s.", method_holder()->internal_name()); 1713 name()->print_symbol_on(st); 1714 st->print("("); 1715 sig.print_parameters(); 1716 st->print(")"); 1717 } 1718 } 1719 #endif // !PRODUCT || INCLUDE_JVMTI 1720 1721 1722 void Method::print_codes_on(outputStream* st) const { 1723 print_codes_on(0, code_size(), st); 1724 } 1725 1726 void Method::print_codes_on(int from, int to, outputStream* st) const { 1727 Thread *thread = Thread::current(); 1728 ResourceMark rm(thread); 1729 methodHandle mh (thread, (Method*)this); 1730 BytecodeStream s(mh); 1731 s.set_interval(from, to); 1732 BytecodeTracer::set_closure(BytecodeTracer::std_closure()); 1733 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st); 1734 } 1735 1736 CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) { 1737 _bci = 0; 1738 _line = 0; 1739 }; 1740 1741 bool CompressedLineNumberReadStream::read_pair() { 1742 jubyte next = read_byte(); 1743 // Check for terminator 1744 if (next == 0) return false; 1745 if (next == 0xFF) { 1746 // Escape character, regular compression used 1747 _bci += read_signed_int(); 1748 _line += read_signed_int(); 1749 } else { 1750 // Single byte compression used 1751 _bci += next >> 3; 1752 _line += next & 0x7; 1753 } 1754 return true; 1755 } 1756 1757 #if INCLUDE_JVMTI 1758 1759 Bytecodes::Code Method::orig_bytecode_at(int bci) const { 1760 BreakpointInfo* bp = method_holder()->breakpoints(); 1761 for (; bp != NULL; bp = bp->next()) { 1762 if (bp->match(this, bci)) { 1763 return bp->orig_bytecode(); 1764 } 1765 } 1766 { 1767 ResourceMark rm; 1768 fatal("no original bytecode found in %s at bci %d", name_and_sig_as_C_string(), bci); 1769 } 1770 return Bytecodes::_shouldnotreachhere; 1771 } 1772 1773 void Method::set_orig_bytecode_at(int bci, Bytecodes::Code code) { 1774 assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way"); 1775 BreakpointInfo* bp = method_holder()->breakpoints(); 1776 for (; bp != NULL; bp = bp->next()) { 1777 if (bp->match(this, bci)) { 1778 bp->set_orig_bytecode(code); 1779 // and continue, in case there is more than one 1780 } 1781 } 1782 } 1783 1784 void Method::set_breakpoint(int bci) { 1785 InstanceKlass* ik = method_holder(); 1786 BreakpointInfo *bp = new BreakpointInfo(this, bci); 1787 bp->set_next(ik->breakpoints()); 1788 ik->set_breakpoints(bp); 1789 // do this last: 1790 bp->set(this); 1791 } 1792 1793 static void clear_matches(Method* m, int bci) { 1794 InstanceKlass* ik = m->method_holder(); 1795 BreakpointInfo* prev_bp = NULL; 1796 BreakpointInfo* next_bp; 1797 for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) { 1798 next_bp = bp->next(); 1799 // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint). 1800 if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) { 1801 // do this first: 1802 bp->clear(m); 1803 // unhook it 1804 if (prev_bp != NULL) 1805 prev_bp->set_next(next_bp); 1806 else 1807 ik->set_breakpoints(next_bp); 1808 delete bp; 1809 // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods 1810 // at same location. So we have multiple matching (method_index and bci) 1811 // BreakpointInfo nodes in BreakpointInfo list. We should just delete one 1812 // breakpoint for clear_breakpoint request and keep all other method versions 1813 // BreakpointInfo for future clear_breakpoint request. 1814 // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints) 1815 // which is being called when class is unloaded. We delete all the Breakpoint 1816 // information for all versions of method. We may not correctly restore the original 1817 // bytecode in all method versions, but that is ok. Because the class is being unloaded 1818 // so these methods won't be used anymore. 1819 if (bci >= 0) { 1820 break; 1821 } 1822 } else { 1823 // This one is a keeper. 1824 prev_bp = bp; 1825 } 1826 } 1827 } 1828 1829 void Method::clear_breakpoint(int bci) { 1830 assert(bci >= 0, ""); 1831 clear_matches(this, bci); 1832 } 1833 1834 void Method::clear_all_breakpoints() { 1835 clear_matches(this, -1); 1836 } 1837 1838 #endif // INCLUDE_JVMTI 1839 1840 int Method::invocation_count() { 1841 MethodCounters *mcs = method_counters(); 1842 if (TieredCompilation) { 1843 MethodData* const mdo = method_data(); 1844 if (((mcs != NULL) ? mcs->invocation_counter()->carry() : false) || 1845 ((mdo != NULL) ? mdo->invocation_counter()->carry() : false)) { 1846 return InvocationCounter::count_limit; 1847 } else { 1848 return ((mcs != NULL) ? mcs->invocation_counter()->count() : 0) + 1849 ((mdo != NULL) ? mdo->invocation_counter()->count() : 0); 1850 } 1851 } else { 1852 return (mcs == NULL) ? 0 : mcs->invocation_counter()->count(); 1853 } 1854 } 1855 1856 int Method::backedge_count() { 1857 MethodCounters *mcs = method_counters(); 1858 if (TieredCompilation) { 1859 MethodData* const mdo = method_data(); 1860 if (((mcs != NULL) ? mcs->backedge_counter()->carry() : false) || 1861 ((mdo != NULL) ? mdo->backedge_counter()->carry() : false)) { 1862 return InvocationCounter::count_limit; 1863 } else { 1864 return ((mcs != NULL) ? mcs->backedge_counter()->count() : 0) + 1865 ((mdo != NULL) ? mdo->backedge_counter()->count() : 0); 1866 } 1867 } else { 1868 return (mcs == NULL) ? 0 : mcs->backedge_counter()->count(); 1869 } 1870 } 1871 1872 int Method::highest_comp_level() const { 1873 const MethodCounters* mcs = method_counters(); 1874 if (mcs != NULL) { 1875 return mcs->highest_comp_level(); 1876 } else { 1877 return CompLevel_none; 1878 } 1879 } 1880 1881 int Method::highest_osr_comp_level() const { 1882 const MethodCounters* mcs = method_counters(); 1883 if (mcs != NULL) { 1884 return mcs->highest_osr_comp_level(); 1885 } else { 1886 return CompLevel_none; 1887 } 1888 } 1889 1890 void Method::set_highest_comp_level(int level) { 1891 MethodCounters* mcs = method_counters(); 1892 if (mcs != NULL) { 1893 mcs->set_highest_comp_level(level); 1894 } 1895 } 1896 1897 void Method::set_highest_osr_comp_level(int level) { 1898 MethodCounters* mcs = method_counters(); 1899 if (mcs != NULL) { 1900 mcs->set_highest_osr_comp_level(level); 1901 } 1902 } 1903 1904 #if INCLUDE_JVMTI 1905 1906 BreakpointInfo::BreakpointInfo(Method* m, int bci) { 1907 _bci = bci; 1908 _name_index = m->name_index(); 1909 _signature_index = m->signature_index(); 1910 _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci); 1911 if (_orig_bytecode == Bytecodes::_breakpoint) 1912 _orig_bytecode = m->orig_bytecode_at(_bci); 1913 _next = NULL; 1914 } 1915 1916 void BreakpointInfo::set(Method* method) { 1917 #ifdef ASSERT 1918 { 1919 Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci); 1920 if (code == Bytecodes::_breakpoint) 1921 code = method->orig_bytecode_at(_bci); 1922 assert(orig_bytecode() == code, "original bytecode must be the same"); 1923 } 1924 #endif 1925 Thread *thread = Thread::current(); 1926 *method->bcp_from(_bci) = Bytecodes::_breakpoint; 1927 method->incr_number_of_breakpoints(thread); 1928 SystemDictionary::notice_modification(); 1929 { 1930 // Deoptimize all dependents on this method 1931 HandleMark hm(thread); 1932 methodHandle mh(thread, method); 1933 CodeCache::flush_dependents_on_method(mh); 1934 } 1935 } 1936 1937 void BreakpointInfo::clear(Method* method) { 1938 *method->bcp_from(_bci) = orig_bytecode(); 1939 assert(method->number_of_breakpoints() > 0, "must not go negative"); 1940 method->decr_number_of_breakpoints(Thread::current()); 1941 } 1942 1943 #endif // INCLUDE_JVMTI 1944 1945 // jmethodID handling 1946 1947 // This is a block allocating object, sort of like JNIHandleBlock, only a 1948 // lot simpler. 1949 // It's allocated on the CHeap because once we allocate a jmethodID, we can 1950 // never get rid of it. 1951 1952 static const int min_block_size = 8; 1953 1954 class JNIMethodBlockNode : public CHeapObj<mtClass> { 1955 friend class JNIMethodBlock; 1956 Method** _methods; 1957 int _number_of_methods; 1958 int _top; 1959 JNIMethodBlockNode* _next; 1960 1961 public: 1962 1963 JNIMethodBlockNode(int num_methods = min_block_size); 1964 1965 ~JNIMethodBlockNode() { FREE_C_HEAP_ARRAY(Method*, _methods); } 1966 1967 void ensure_methods(int num_addl_methods) { 1968 if (_top < _number_of_methods) { 1969 num_addl_methods -= _number_of_methods - _top; 1970 if (num_addl_methods <= 0) { 1971 return; 1972 } 1973 } 1974 if (_next == NULL) { 1975 _next = new JNIMethodBlockNode(MAX2(num_addl_methods, min_block_size)); 1976 } else { 1977 _next->ensure_methods(num_addl_methods); 1978 } 1979 } 1980 }; 1981 1982 class JNIMethodBlock : public CHeapObj<mtClass> { 1983 JNIMethodBlockNode _head; 1984 JNIMethodBlockNode *_last_free; 1985 public: 1986 static Method* const _free_method; 1987 1988 JNIMethodBlock(int initial_capacity = min_block_size) 1989 : _head(initial_capacity), _last_free(&_head) {} 1990 1991 void ensure_methods(int num_addl_methods) { 1992 _last_free->ensure_methods(num_addl_methods); 1993 } 1994 1995 Method** add_method(Method* m) { 1996 for (JNIMethodBlockNode* b = _last_free; b != NULL; b = b->_next) { 1997 if (b->_top < b->_number_of_methods) { 1998 // top points to the next free entry. 1999 int i = b->_top; 2000 b->_methods[i] = m; 2001 b->_top++; 2002 _last_free = b; 2003 return &(b->_methods[i]); 2004 } else if (b->_top == b->_number_of_methods) { 2005 // if the next free entry ran off the block see if there's a free entry 2006 for (int i = 0; i < b->_number_of_methods; i++) { 2007 if (b->_methods[i] == _free_method) { 2008 b->_methods[i] = m; 2009 _last_free = b; 2010 return &(b->_methods[i]); 2011 } 2012 } 2013 // Only check each block once for frees. They're very unlikely. 2014 // Increment top past the end of the block. 2015 b->_top++; 2016 } 2017 // need to allocate a next block. 2018 if (b->_next == NULL) { 2019 b->_next = _last_free = new JNIMethodBlockNode(); 2020 } 2021 } 2022 guarantee(false, "Should always allocate a free block"); 2023 return NULL; 2024 } 2025 2026 bool contains(Method** m) { 2027 if (m == NULL) return false; 2028 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) { 2029 if (b->_methods <= m && m < b->_methods + b->_number_of_methods) { 2030 // This is a bit of extra checking, for two reasons. One is 2031 // that contains() deals with pointers that are passed in by 2032 // JNI code, so making sure that the pointer is aligned 2033 // correctly is valuable. The other is that <= and > are 2034 // technically not defined on pointers, so the if guard can 2035 // pass spuriously; no modern compiler is likely to make that 2036 // a problem, though (and if one did, the guard could also 2037 // fail spuriously, which would be bad). 2038 ptrdiff_t idx = m - b->_methods; 2039 if (b->_methods + idx == m) { 2040 return true; 2041 } 2042 } 2043 } 2044 return false; // not found 2045 } 2046 2047 // Doesn't really destroy it, just marks it as free so it can be reused. 2048 void destroy_method(Method** m) { 2049 #ifdef ASSERT 2050 assert(contains(m), "should be a methodID"); 2051 #endif // ASSERT 2052 *m = _free_method; 2053 } 2054 2055 // During class unloading the methods are cleared, which is different 2056 // than freed. 2057 void clear_all_methods() { 2058 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) { 2059 for (int i = 0; i< b->_number_of_methods; i++) { 2060 b->_methods[i] = NULL; 2061 } 2062 } 2063 } 2064 #ifndef PRODUCT 2065 int count_methods() { 2066 // count all allocated methods 2067 int count = 0; 2068 for (JNIMethodBlockNode* b = &_head; b != NULL; b = b->_next) { 2069 for (int i = 0; i< b->_number_of_methods; i++) { 2070 if (b->_methods[i] != _free_method) count++; 2071 } 2072 } 2073 return count; 2074 } 2075 #endif // PRODUCT 2076 }; 2077 2078 // Something that can't be mistaken for an address or a markOop 2079 Method* const JNIMethodBlock::_free_method = (Method*)55; 2080 2081 JNIMethodBlockNode::JNIMethodBlockNode(int num_methods) : _top(0), _next(NULL) { 2082 _number_of_methods = MAX2(num_methods, min_block_size); 2083 _methods = NEW_C_HEAP_ARRAY(Method*, _number_of_methods, mtInternal); 2084 for (int i = 0; i < _number_of_methods; i++) { 2085 _methods[i] = JNIMethodBlock::_free_method; 2086 } 2087 } 2088 2089 void Method::ensure_jmethod_ids(ClassLoaderData* loader_data, int capacity) { 2090 ClassLoaderData* cld = loader_data; 2091 if (!SafepointSynchronize::is_at_safepoint()) { 2092 // Have to add jmethod_ids() to class loader data thread-safely. 2093 // Also have to add the method to the list safely, which the cld lock 2094 // protects as well. 2095 MutexLocker ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag); 2096 if (cld->jmethod_ids() == NULL) { 2097 cld->set_jmethod_ids(new JNIMethodBlock(capacity)); 2098 } else { 2099 cld->jmethod_ids()->ensure_methods(capacity); 2100 } 2101 } else { 2102 // At safepoint, we are single threaded and can set this. 2103 if (cld->jmethod_ids() == NULL) { 2104 cld->set_jmethod_ids(new JNIMethodBlock(capacity)); 2105 } else { 2106 cld->jmethod_ids()->ensure_methods(capacity); 2107 } 2108 } 2109 } 2110 2111 // Add a method id to the jmethod_ids 2112 jmethodID Method::make_jmethod_id(ClassLoaderData* loader_data, Method* m) { 2113 ClassLoaderData* cld = loader_data; 2114 2115 if (!SafepointSynchronize::is_at_safepoint()) { 2116 // Have to add jmethod_ids() to class loader data thread-safely. 2117 // Also have to add the method to the list safely, which the cld lock 2118 // protects as well. 2119 MutexLocker ml(cld->metaspace_lock(), Mutex::_no_safepoint_check_flag); 2120 if (cld->jmethod_ids() == NULL) { 2121 cld->set_jmethod_ids(new JNIMethodBlock()); 2122 } 2123 // jmethodID is a pointer to Method* 2124 return (jmethodID)cld->jmethod_ids()->add_method(m); 2125 } else { 2126 // At safepoint, we are single threaded and can set this. 2127 if (cld->jmethod_ids() == NULL) { 2128 cld->set_jmethod_ids(new JNIMethodBlock()); 2129 } 2130 // jmethodID is a pointer to Method* 2131 return (jmethodID)cld->jmethod_ids()->add_method(m); 2132 } 2133 } 2134 2135 // Mark a jmethodID as free. This is called when there is a data race in 2136 // InstanceKlass while creating the jmethodID cache. 2137 void Method::destroy_jmethod_id(ClassLoaderData* loader_data, jmethodID m) { 2138 ClassLoaderData* cld = loader_data; 2139 Method** ptr = (Method**)m; 2140 assert(cld->jmethod_ids() != NULL, "should have method handles"); 2141 cld->jmethod_ids()->destroy_method(ptr); 2142 } 2143 2144 void Method::change_method_associated_with_jmethod_id(jmethodID jmid, Method* new_method) { 2145 // Can't assert the method_holder is the same because the new method has the 2146 // scratch method holder. 2147 assert(resolve_jmethod_id(jmid)->method_holder()->class_loader() 2148 == new_method->method_holder()->class_loader() || 2149 new_method->method_holder()->class_loader() == NULL, // allow Unsafe substitution 2150 "changing to a different class loader"); 2151 // Just change the method in place, jmethodID pointer doesn't change. 2152 *((Method**)jmid) = new_method; 2153 } 2154 2155 bool Method::is_method_id(jmethodID mid) { 2156 Method* m = resolve_jmethod_id(mid); 2157 assert(m != NULL, "should be called with non-null method"); 2158 InstanceKlass* ik = m->method_holder(); 2159 ClassLoaderData* cld = ik->class_loader_data(); 2160 if (cld->jmethod_ids() == NULL) return false; 2161 return (cld->jmethod_ids()->contains((Method**)mid)); 2162 } 2163 2164 Method* Method::checked_resolve_jmethod_id(jmethodID mid) { 2165 if (mid == NULL) return NULL; 2166 Method* o = resolve_jmethod_id(mid); 2167 if (o == NULL || o == JNIMethodBlock::_free_method || !((Metadata*)o)->is_method()) { 2168 return NULL; 2169 } 2170 return o; 2171 }; 2172 2173 void Method::set_on_stack(const bool value) { 2174 // Set both the method itself and its constant pool. The constant pool 2175 // on stack means some method referring to it is also on the stack. 2176 constants()->set_on_stack(value); 2177 2178 bool already_set = on_stack(); 2179 _access_flags.set_on_stack(value); 2180 if (value && !already_set) { 2181 MetadataOnStackMark::record(this); 2182 } 2183 assert(!value || !is_old() || is_obsolete() || is_running_emcp(), 2184 "emcp methods cannot run after emcp bit is cleared"); 2185 } 2186 2187 // Called when the class loader is unloaded to make all methods weak. 2188 void Method::clear_jmethod_ids(ClassLoaderData* loader_data) { 2189 loader_data->jmethod_ids()->clear_all_methods(); 2190 } 2191 2192 bool Method::has_method_vptr(const void* ptr) { 2193 Method m; 2194 // This assumes that the vtbl pointer is the first word of a C++ object. 2195 return dereference_vptr(&m) == dereference_vptr(ptr); 2196 } 2197 2198 // Check that this pointer is valid by checking that the vtbl pointer matches 2199 bool Method::is_valid_method(const Method* m) { 2200 if (m == NULL) { 2201 return false; 2202 } else if ((intptr_t(m) & (wordSize-1)) != 0) { 2203 // Quick sanity check on pointer. 2204 return false; 2205 } else if (m->is_shared()) { 2206 return MetaspaceShared::is_valid_shared_method(m); 2207 } else if (Metaspace::contains_non_shared(m)) { 2208 return has_method_vptr((const void*)m); 2209 } else { 2210 return false; 2211 } 2212 } 2213 2214 #ifndef PRODUCT 2215 void Method::print_jmethod_ids(const ClassLoaderData* loader_data, outputStream* out) { 2216 out->print(" jni_method_id count = %d", loader_data->jmethod_ids()->count_methods()); 2217 } 2218 #endif // PRODUCT 2219 2220 2221 // Printing 2222 2223 #ifndef PRODUCT 2224 2225 void Method::print_on(outputStream* st) const { 2226 ResourceMark rm; 2227 assert(is_method(), "must be method"); 2228 st->print_cr("%s", internal_name()); 2229 st->print_cr(" - this oop: " INTPTR_FORMAT, p2i(this)); 2230 st->print (" - method holder: "); method_holder()->print_value_on(st); st->cr(); 2231 st->print (" - constants: " INTPTR_FORMAT " ", p2i(constants())); 2232 constants()->print_value_on(st); st->cr(); 2233 st->print (" - access: 0x%x ", access_flags().as_int()); access_flags().print_on(st); st->cr(); 2234 st->print (" - name: "); name()->print_value_on(st); st->cr(); 2235 st->print (" - signature: "); signature()->print_value_on(st); st->cr(); 2236 st->print_cr(" - max stack: %d", max_stack()); 2237 st->print_cr(" - max locals: %d", max_locals()); 2238 st->print_cr(" - size of params: %d", size_of_parameters()); 2239 st->print_cr(" - method size: %d", method_size()); 2240 if (intrinsic_id() != vmIntrinsics::_none) 2241 st->print_cr(" - intrinsic id: %d %s", intrinsic_id(), vmIntrinsics::name_at(intrinsic_id())); 2242 if (highest_comp_level() != CompLevel_none) 2243 st->print_cr(" - highest level: %d", highest_comp_level()); 2244 st->print_cr(" - vtable index: %d", _vtable_index); 2245 st->print_cr(" - i2i entry: " INTPTR_FORMAT, p2i(interpreter_entry())); 2246 st->print( " - adapters: "); 2247 AdapterHandlerEntry* a = ((Method*)this)->adapter(); 2248 if (a == NULL) 2249 st->print_cr(INTPTR_FORMAT, p2i(a)); 2250 else 2251 a->print_adapter_on(st); 2252 st->print_cr(" - compiled entry " INTPTR_FORMAT, p2i(from_compiled_entry())); 2253 st->print_cr(" - code size: %d", code_size()); 2254 if (code_size() != 0) { 2255 st->print_cr(" - code start: " INTPTR_FORMAT, p2i(code_base())); 2256 st->print_cr(" - code end (excl): " INTPTR_FORMAT, p2i(code_base() + code_size())); 2257 } 2258 if (method_data() != NULL) { 2259 st->print_cr(" - method data: " INTPTR_FORMAT, p2i(method_data())); 2260 } 2261 st->print_cr(" - checked ex length: %d", checked_exceptions_length()); 2262 if (checked_exceptions_length() > 0) { 2263 CheckedExceptionElement* table = checked_exceptions_start(); 2264 st->print_cr(" - checked ex start: " INTPTR_FORMAT, p2i(table)); 2265 if (Verbose) { 2266 for (int i = 0; i < checked_exceptions_length(); i++) { 2267 st->print_cr(" - throws %s", constants()->printable_name_at(table[i].class_cp_index)); 2268 } 2269 } 2270 } 2271 if (has_linenumber_table()) { 2272 u_char* table = compressed_linenumber_table(); 2273 st->print_cr(" - linenumber start: " INTPTR_FORMAT, p2i(table)); 2274 if (Verbose) { 2275 CompressedLineNumberReadStream stream(table); 2276 while (stream.read_pair()) { 2277 st->print_cr(" - line %d: %d", stream.line(), stream.bci()); 2278 } 2279 } 2280 } 2281 st->print_cr(" - localvar length: %d", localvariable_table_length()); 2282 if (localvariable_table_length() > 0) { 2283 LocalVariableTableElement* table = localvariable_table_start(); 2284 st->print_cr(" - localvar start: " INTPTR_FORMAT, p2i(table)); 2285 if (Verbose) { 2286 for (int i = 0; i < localvariable_table_length(); i++) { 2287 int bci = table[i].start_bci; 2288 int len = table[i].length; 2289 const char* name = constants()->printable_name_at(table[i].name_cp_index); 2290 const char* desc = constants()->printable_name_at(table[i].descriptor_cp_index); 2291 int slot = table[i].slot; 2292 st->print_cr(" - %s %s bci=%d len=%d slot=%d", desc, name, bci, len, slot); 2293 } 2294 } 2295 } 2296 if (code() != NULL) { 2297 st->print (" - compiled code: "); 2298 code()->print_value_on(st); 2299 } 2300 if (is_native()) { 2301 st->print_cr(" - native function: " INTPTR_FORMAT, p2i(native_function())); 2302 st->print_cr(" - signature handler: " INTPTR_FORMAT, p2i(signature_handler())); 2303 } 2304 } 2305 2306 void Method::print_linkage_flags(outputStream* st) { 2307 access_flags().print_on(st); 2308 if (is_default_method()) { 2309 st->print("default "); 2310 } 2311 if (is_overpass()) { 2312 st->print("overpass "); 2313 } 2314 } 2315 #endif //PRODUCT 2316 2317 void Method::print_value_on(outputStream* st) const { 2318 assert(is_method(), "must be method"); 2319 st->print("%s", internal_name()); 2320 print_address_on(st); 2321 st->print(" "); 2322 name()->print_value_on(st); 2323 st->print(" "); 2324 signature()->print_value_on(st); 2325 st->print(" in "); 2326 method_holder()->print_value_on(st); 2327 if (WizardMode) st->print("#%d", _vtable_index); 2328 if (WizardMode) st->print("[%d,%d]", size_of_parameters(), max_locals()); 2329 if (WizardMode && code() != NULL) st->print(" ((nmethod*)%p)", code()); 2330 } 2331 2332 #if INCLUDE_SERVICES 2333 // Size Statistics 2334 void Method::collect_statistics(KlassSizeStats *sz) const { 2335 int mysize = sz->count(this); 2336 sz->_method_bytes += mysize; 2337 sz->_method_all_bytes += mysize; 2338 sz->_rw_bytes += mysize; 2339 2340 if (constMethod()) { 2341 constMethod()->collect_statistics(sz); 2342 } 2343 if (method_data()) { 2344 method_data()->collect_statistics(sz); 2345 } 2346 } 2347 #endif // INCLUDE_SERVICES 2348 2349 // LogTouchedMethods and PrintTouchedMethods 2350 2351 // TouchedMethodRecord -- we can't use a HashtableEntry<Method*> because 2352 // the Method may be garbage collected. Let's roll our own hash table. 2353 class TouchedMethodRecord : CHeapObj<mtTracing> { 2354 public: 2355 // It's OK to store Symbols here because they will NOT be GC'ed if 2356 // LogTouchedMethods is enabled. 2357 TouchedMethodRecord* _next; 2358 Symbol* _class_name; 2359 Symbol* _method_name; 2360 Symbol* _method_signature; 2361 }; 2362 2363 static const int TOUCHED_METHOD_TABLE_SIZE = 20011; 2364 static TouchedMethodRecord** _touched_method_table = NULL; 2365 2366 void Method::log_touched(TRAPS) { 2367 2368 const int table_size = TOUCHED_METHOD_TABLE_SIZE; 2369 Symbol* my_class = klass_name(); 2370 Symbol* my_name = name(); 2371 Symbol* my_sig = signature(); 2372 2373 unsigned int hash = my_class->identity_hash() + 2374 my_name->identity_hash() + 2375 my_sig->identity_hash(); 2376 juint index = juint(hash) % table_size; 2377 2378 MutexLocker ml(TouchedMethodLog_lock, THREAD); 2379 if (_touched_method_table == NULL) { 2380 _touched_method_table = NEW_C_HEAP_ARRAY2(TouchedMethodRecord*, table_size, 2381 mtTracing, CURRENT_PC); 2382 memset(_touched_method_table, 0, sizeof(TouchedMethodRecord*)*table_size); 2383 } 2384 2385 TouchedMethodRecord* ptr = _touched_method_table[index]; 2386 while (ptr) { 2387 if (ptr->_class_name == my_class && 2388 ptr->_method_name == my_name && 2389 ptr->_method_signature == my_sig) { 2390 return; 2391 } 2392 if (ptr->_next == NULL) break; 2393 ptr = ptr->_next; 2394 } 2395 TouchedMethodRecord* nptr = NEW_C_HEAP_OBJ(TouchedMethodRecord, mtTracing); 2396 my_class->increment_refcount(); 2397 my_name->increment_refcount(); 2398 my_sig->increment_refcount(); 2399 nptr->_class_name = my_class; 2400 nptr->_method_name = my_name; 2401 nptr->_method_signature = my_sig; 2402 nptr->_next = NULL; 2403 2404 if (ptr == NULL) { 2405 // first 2406 _touched_method_table[index] = nptr; 2407 } else { 2408 ptr->_next = nptr; 2409 } 2410 } 2411 2412 void Method::print_touched_methods(outputStream* out) { 2413 MutexLocker ml(Thread::current()->is_VM_thread() ? NULL : TouchedMethodLog_lock); 2414 out->print_cr("# Method::print_touched_methods version 1"); 2415 if (_touched_method_table) { 2416 for (int i = 0; i < TOUCHED_METHOD_TABLE_SIZE; i++) { 2417 TouchedMethodRecord* ptr = _touched_method_table[i]; 2418 while(ptr) { 2419 ptr->_class_name->print_symbol_on(out); out->print("."); 2420 ptr->_method_name->print_symbol_on(out); out->print(":"); 2421 ptr->_method_signature->print_symbol_on(out); out->cr(); 2422 ptr = ptr->_next; 2423 } 2424 } 2425 } 2426 } 2427 2428 // Verification 2429 2430 void Method::verify_on(outputStream* st) { 2431 guarantee(is_method(), "object must be method"); 2432 guarantee(constants()->is_constantPool(), "should be constant pool"); 2433 MethodData* md = method_data(); 2434 guarantee(md == NULL || 2435 md->is_methodData(), "should be method data"); 2436 } --- EOF ---