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