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