1 /* 2 * Copyright (c) 1997, 2014, 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 "code/codeBlob.hpp" 27 #include "code/codeCache.hpp" 28 #include "code/compiledIC.hpp" 29 #include "code/dependencies.hpp" 30 #include "code/icBuffer.hpp" 31 #include "code/nmethod.hpp" 32 #include "code/pcDesc.hpp" 33 #include "compiler/compileBroker.hpp" 34 #include "gc_implementation/shared/markSweep.hpp" 35 #include "memory/allocation.inline.hpp" 36 #include "memory/gcLocker.hpp" 37 #include "memory/iterator.hpp" 38 #include "memory/resourceArea.hpp" 39 #include "oops/method.hpp" 40 #include "oops/objArrayOop.hpp" 41 #include "oops/oop.inline.hpp" 42 #include "runtime/handles.inline.hpp" 43 #include "runtime/arguments.hpp" 44 #include "runtime/icache.hpp" 45 #include "runtime/java.hpp" 46 #include "runtime/mutexLocker.hpp" 47 #include "services/memoryService.hpp" 48 #include "trace/tracing.hpp" 49 #include "utilities/xmlstream.hpp" 50 51 // Helper class for printing in CodeCache 52 53 class CodeBlob_sizes { 54 private: 55 int count; 56 int total_size; 57 int header_size; 58 int code_size; 59 int stub_size; 60 int relocation_size; 61 int scopes_oop_size; 62 int scopes_metadata_size; 63 int scopes_data_size; 64 int scopes_pcs_size; 65 66 public: 67 CodeBlob_sizes() { 68 count = 0; 69 total_size = 0; 70 header_size = 0; 71 code_size = 0; 72 stub_size = 0; 73 relocation_size = 0; 74 scopes_oop_size = 0; 75 scopes_metadata_size = 0; 76 scopes_data_size = 0; 77 scopes_pcs_size = 0; 78 } 79 80 int total() { return total_size; } 81 bool is_empty() { return count == 0; } 82 83 void print(const char* title) { 84 tty->print_cr(" #%d %s = %dK (hdr %d%%, loc %d%%, code %d%%, stub %d%%, [oops %d%%, metadata %d%%, data %d%%, pcs %d%%])", 85 count, 86 title, 87 (int)(total() / K), 88 header_size * 100 / total_size, 89 relocation_size * 100 / total_size, 90 code_size * 100 / total_size, 91 stub_size * 100 / total_size, 92 scopes_oop_size * 100 / total_size, 93 scopes_metadata_size * 100 / total_size, 94 scopes_data_size * 100 / total_size, 95 scopes_pcs_size * 100 / total_size); 96 } 97 98 void add(CodeBlob* cb) { 99 count++; 100 total_size += cb->size(); 101 header_size += cb->header_size(); 102 relocation_size += cb->relocation_size(); 103 if (cb->is_nmethod()) { 104 nmethod* nm = cb->as_nmethod_or_null(); 105 code_size += nm->insts_size(); 106 stub_size += nm->stub_size(); 107 108 scopes_oop_size += nm->oops_size(); 109 scopes_metadata_size += nm->metadata_size(); 110 scopes_data_size += nm->scopes_data_size(); 111 scopes_pcs_size += nm->scopes_pcs_size(); 112 } else { 113 code_size += cb->code_size(); 114 } 115 } 116 }; 117 118 // CodeCache implementation 119 120 CodeHeap * CodeCache::_heap = new CodeHeap(); 121 int CodeCache::_number_of_blobs = 0; 122 int CodeCache::_number_of_adapters = 0; 123 int CodeCache::_number_of_nmethods = 0; 124 int CodeCache::_number_of_nmethods_with_dependencies = 0; 125 bool CodeCache::_needs_cache_clean = false; 126 nmethod* CodeCache::_scavenge_root_nmethods = NULL; 127 128 int CodeCache::_codemem_full_count = 0; 129 130 CodeBlob* CodeCache::first() { 131 assert_locked_or_safepoint(CodeCache_lock); 132 return (CodeBlob*)_heap->first(); 133 } 134 135 136 CodeBlob* CodeCache::next(CodeBlob* cb) { 137 assert_locked_or_safepoint(CodeCache_lock); 138 return (CodeBlob*)_heap->next(cb); 139 } 140 141 142 CodeBlob* CodeCache::alive(CodeBlob *cb) { 143 assert_locked_or_safepoint(CodeCache_lock); 144 while (cb != NULL && !cb->is_alive()) cb = next(cb); 145 return cb; 146 } 147 148 149 nmethod* CodeCache::alive_nmethod(CodeBlob* cb) { 150 assert_locked_or_safepoint(CodeCache_lock); 151 while (cb != NULL && (!cb->is_alive() || !cb->is_nmethod())) cb = next(cb); 152 return (nmethod*)cb; 153 } 154 155 nmethod* CodeCache::first_nmethod() { 156 assert_locked_or_safepoint(CodeCache_lock); 157 CodeBlob* cb = first(); 158 while (cb != NULL && !cb->is_nmethod()) { 159 cb = next(cb); 160 } 161 return (nmethod*)cb; 162 } 163 164 nmethod* CodeCache::next_nmethod (CodeBlob* cb) { 165 assert_locked_or_safepoint(CodeCache_lock); 166 cb = next(cb); 167 while (cb != NULL && !cb->is_nmethod()) { 168 cb = next(cb); 169 } 170 return (nmethod*)cb; 171 } 172 173 static size_t maxCodeCacheUsed = 0; 174 175 CodeBlob* CodeCache::allocate(int size, bool is_critical) { 176 // Do not seize the CodeCache lock here--if the caller has not 177 // already done so, we are going to lose bigtime, since the code 178 // cache will contain a garbage CodeBlob until the caller can 179 // run the constructor for the CodeBlob subclass he is busy 180 // instantiating. 181 assert_locked_or_safepoint(CodeCache_lock); 182 assert(size > 0, "allocation request must be reasonable"); 183 if (size <= 0) { 184 return NULL; 185 } 186 CodeBlob* cb = NULL; 187 while (true) { 188 cb = (CodeBlob*)_heap->allocate(size, is_critical); 189 if (cb != NULL) break; 190 if (!_heap->expand_by(CodeCacheExpansionSize)) { 191 // Expansion failed 192 return NULL; 193 } 194 if (PrintCodeCacheExtension) { 195 ResourceMark rm; 196 tty->print_cr("code cache extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (" SSIZE_FORMAT " bytes)", 197 (intptr_t)_heap->low_boundary(), (intptr_t)_heap->high(), 198 (address)_heap->high() - (address)_heap->low_boundary()); 199 } 200 } 201 maxCodeCacheUsed = MAX2(maxCodeCacheUsed, ((address)_heap->high_boundary() - 202 (address)_heap->low_boundary()) - unallocated_capacity()); 203 print_trace("allocation", cb, size); 204 _number_of_blobs++; 205 return cb; 206 } 207 208 void CodeCache::free(CodeBlob* cb) { 209 assert_locked_or_safepoint(CodeCache_lock); 210 211 print_trace("free", cb); 212 if (cb->is_nmethod()) { 213 _number_of_nmethods--; 214 if (((nmethod *)cb)->has_dependencies()) { 215 _number_of_nmethods_with_dependencies--; 216 } 217 } 218 if (cb->is_adapter_blob()) { 219 _number_of_adapters--; 220 } 221 _number_of_blobs--; 222 223 _heap->deallocate(cb); 224 225 assert(_number_of_blobs >= 0, "sanity check"); 226 } 227 228 229 void CodeCache::commit(CodeBlob* cb) { 230 // this is called by nmethod::nmethod, which must already own CodeCache_lock 231 assert_locked_or_safepoint(CodeCache_lock); 232 if (cb->is_nmethod()) { 233 _number_of_nmethods++; 234 if (((nmethod *)cb)->has_dependencies()) { 235 _number_of_nmethods_with_dependencies++; 236 } 237 } 238 if (cb->is_adapter_blob()) { 239 _number_of_adapters++; 240 } 241 242 // flush the hardware I-cache 243 ICache::invalidate_range(cb->content_begin(), cb->content_size()); 244 } 245 246 247 // Iteration over CodeBlobs 248 249 #define FOR_ALL_BLOBS(var) for (CodeBlob *var = first() ; var != NULL; var = next(var) ) 250 #define FOR_ALL_ALIVE_BLOBS(var) for (CodeBlob *var = alive(first()); var != NULL; var = alive(next(var))) 251 #define FOR_ALL_ALIVE_NMETHODS(var) for (nmethod *var = alive_nmethod(first()); var != NULL; var = alive_nmethod(next(var))) 252 253 254 bool CodeCache::contains(void *p) { 255 // It should be ok to call contains without holding a lock 256 return _heap->contains(p); 257 } 258 259 260 // This method is safe to call without holding the CodeCache_lock, as long as a dead codeblob is not 261 // looked up (i.e., one that has been marked for deletion). It only dependes on the _segmap to contain 262 // valid indices, which it will always do, as long as the CodeBlob is not in the process of being recycled. 263 CodeBlob* CodeCache::find_blob(void* start) { 264 CodeBlob* result = find_blob_unsafe(start); 265 if (result == NULL) return NULL; 266 // We could potentially look up non_entrant methods 267 guarantee(!result->is_zombie() || result->is_locked_by_vm() || is_error_reported(), "unsafe access to zombie method"); 268 return result; 269 } 270 271 nmethod* CodeCache::find_nmethod(void* start) { 272 CodeBlob *cb = find_blob(start); 273 assert(cb == NULL || cb->is_nmethod(), "did not find an nmethod"); 274 return (nmethod*)cb; 275 } 276 277 278 void CodeCache::blobs_do(void f(CodeBlob* nm)) { 279 assert_locked_or_safepoint(CodeCache_lock); 280 FOR_ALL_BLOBS(p) { 281 f(p); 282 } 283 } 284 285 286 void CodeCache::nmethods_do(void f(nmethod* nm)) { 287 assert_locked_or_safepoint(CodeCache_lock); 288 FOR_ALL_BLOBS(nm) { 289 if (nm->is_nmethod()) f((nmethod*)nm); 290 } 291 } 292 293 void CodeCache::alive_nmethods_do(void f(nmethod* nm)) { 294 assert_locked_or_safepoint(CodeCache_lock); 295 FOR_ALL_ALIVE_NMETHODS(nm) { 296 f(nm); 297 } 298 } 299 300 int CodeCache::alignment_unit() { 301 return (int)_heap->alignment_unit(); 302 } 303 304 305 int CodeCache::alignment_offset() { 306 return (int)_heap->alignment_offset(); 307 } 308 309 310 // Mark nmethods for unloading if they contain otherwise unreachable 311 // oops. 312 void CodeCache::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) { 313 assert_locked_or_safepoint(CodeCache_lock); 314 FOR_ALL_ALIVE_NMETHODS(nm) { 315 nm->do_unloading(is_alive, unloading_occurred); 316 } 317 } 318 319 void CodeCache::blobs_do(CodeBlobClosure* f) { 320 assert_locked_or_safepoint(CodeCache_lock); 321 FOR_ALL_ALIVE_BLOBS(cb) { 322 f->do_code_blob(cb); 323 324 #ifdef ASSERT 325 if (cb->is_nmethod()) 326 ((nmethod*)cb)->verify_scavenge_root_oops(); 327 #endif //ASSERT 328 } 329 } 330 331 // Walk the list of methods which might contain non-perm oops. 332 void CodeCache::scavenge_root_nmethods_do(CodeBlobClosure* f) { 333 assert_locked_or_safepoint(CodeCache_lock); 334 335 if (UseG1GC) { 336 return; 337 } 338 339 debug_only(mark_scavenge_root_nmethods()); 340 341 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) { 342 debug_only(cur->clear_scavenge_root_marked()); 343 assert(cur->scavenge_root_not_marked(), ""); 344 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list"); 345 346 bool is_live = (!cur->is_zombie() && !cur->is_unloaded()); 347 #ifndef PRODUCT 348 if (TraceScavenge) { 349 cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr(); 350 } 351 #endif //PRODUCT 352 if (is_live) { 353 // Perform cur->oops_do(f), maybe just once per nmethod. 354 f->do_code_blob(cur); 355 } 356 } 357 358 // Check for stray marks. 359 debug_only(verify_perm_nmethods(NULL)); 360 } 361 362 void CodeCache::add_scavenge_root_nmethod(nmethod* nm) { 363 assert_locked_or_safepoint(CodeCache_lock); 364 365 if (UseG1GC) { 366 return; 367 } 368 369 nm->set_on_scavenge_root_list(); 370 nm->set_scavenge_root_link(_scavenge_root_nmethods); 371 set_scavenge_root_nmethods(nm); 372 print_trace("add_scavenge_root", nm); 373 } 374 375 void CodeCache::drop_scavenge_root_nmethod(nmethod* nm) { 376 assert_locked_or_safepoint(CodeCache_lock); 377 378 if (UseG1GC) { 379 return; 380 } 381 382 print_trace("drop_scavenge_root", nm); 383 nmethod* last = NULL; 384 nmethod* cur = scavenge_root_nmethods(); 385 while (cur != NULL) { 386 nmethod* next = cur->scavenge_root_link(); 387 if (cur == nm) { 388 if (last != NULL) 389 last->set_scavenge_root_link(next); 390 else set_scavenge_root_nmethods(next); 391 nm->set_scavenge_root_link(NULL); 392 nm->clear_on_scavenge_root_list(); 393 return; 394 } 395 last = cur; 396 cur = next; 397 } 398 assert(false, "should have been on list"); 399 } 400 401 void CodeCache::prune_scavenge_root_nmethods() { 402 assert_locked_or_safepoint(CodeCache_lock); 403 404 if (UseG1GC) { 405 return; 406 } 407 408 debug_only(mark_scavenge_root_nmethods()); 409 410 nmethod* last = NULL; 411 nmethod* cur = scavenge_root_nmethods(); 412 while (cur != NULL) { 413 nmethod* next = cur->scavenge_root_link(); 414 debug_only(cur->clear_scavenge_root_marked()); 415 assert(cur->scavenge_root_not_marked(), ""); 416 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list"); 417 418 if (!cur->is_zombie() && !cur->is_unloaded() 419 && cur->detect_scavenge_root_oops()) { 420 // Keep it. Advance 'last' to prevent deletion. 421 last = cur; 422 } else { 423 // Prune it from the list, so we don't have to look at it any more. 424 print_trace("prune_scavenge_root", cur); 425 cur->set_scavenge_root_link(NULL); 426 cur->clear_on_scavenge_root_list(); 427 if (last != NULL) 428 last->set_scavenge_root_link(next); 429 else set_scavenge_root_nmethods(next); 430 } 431 cur = next; 432 } 433 434 // Check for stray marks. 435 debug_only(verify_perm_nmethods(NULL)); 436 } 437 438 #ifndef PRODUCT 439 void CodeCache::asserted_non_scavengable_nmethods_do(CodeBlobClosure* f) { 440 if (UseG1GC) { 441 return; 442 } 443 444 // While we are here, verify the integrity of the list. 445 mark_scavenge_root_nmethods(); 446 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) { 447 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list"); 448 cur->clear_scavenge_root_marked(); 449 } 450 verify_perm_nmethods(f); 451 } 452 453 // Temporarily mark nmethods that are claimed to be on the non-perm list. 454 void CodeCache::mark_scavenge_root_nmethods() { 455 FOR_ALL_ALIVE_BLOBS(cb) { 456 if (cb->is_nmethod()) { 457 nmethod *nm = (nmethod*)cb; 458 assert(nm->scavenge_root_not_marked(), "clean state"); 459 if (nm->on_scavenge_root_list()) 460 nm->set_scavenge_root_marked(); 461 } 462 } 463 } 464 465 // If the closure is given, run it on the unlisted nmethods. 466 // Also make sure that the effects of mark_scavenge_root_nmethods is gone. 467 void CodeCache::verify_perm_nmethods(CodeBlobClosure* f_or_null) { 468 FOR_ALL_ALIVE_BLOBS(cb) { 469 bool call_f = (f_or_null != NULL); 470 if (cb->is_nmethod()) { 471 nmethod *nm = (nmethod*)cb; 472 assert(nm->scavenge_root_not_marked(), "must be already processed"); 473 if (nm->on_scavenge_root_list()) 474 call_f = false; // don't show this one to the client 475 nm->verify_scavenge_root_oops(); 476 } else { 477 call_f = false; // not an nmethod 478 } 479 if (call_f) f_or_null->do_code_blob(cb); 480 } 481 } 482 #endif //PRODUCT 483 484 void CodeCache::verify_clean_inline_caches() { 485 #ifdef ASSERT 486 FOR_ALL_ALIVE_BLOBS(cb) { 487 if (cb->is_nmethod()) { 488 nmethod* nm = (nmethod*)cb; 489 assert(!nm->is_unloaded(), "Tautology"); 490 nm->verify_clean_inline_caches(); 491 nm->verify(); 492 } 493 } 494 #endif 495 } 496 497 void CodeCache::verify_icholder_relocations() { 498 #ifdef ASSERT 499 // make sure that we aren't leaking icholders 500 int count = 0; 501 FOR_ALL_BLOBS(cb) { 502 if (cb->is_nmethod()) { 503 nmethod* nm = (nmethod*)cb; 504 count += nm->verify_icholder_relocations(); 505 } 506 } 507 508 assert(count + InlineCacheBuffer::pending_icholder_count() + CompiledICHolder::live_not_claimed_count() == 509 CompiledICHolder::live_count(), "must agree"); 510 #endif 511 } 512 513 void CodeCache::gc_prologue() { 514 } 515 516 void CodeCache::gc_epilogue() { 517 assert_locked_or_safepoint(CodeCache_lock); 518 FOR_ALL_ALIVE_BLOBS(cb) { 519 if (cb->is_nmethod()) { 520 nmethod *nm = (nmethod*)cb; 521 assert(!nm->is_unloaded(), "Tautology"); 522 if (needs_cache_clean()) { 523 nm->cleanup_inline_caches(); 524 } 525 DEBUG_ONLY(nm->verify()); 526 DEBUG_ONLY(nm->verify_oop_relocations()); 527 } 528 } 529 set_needs_cache_clean(false); 530 prune_scavenge_root_nmethods(); 531 532 verify_icholder_relocations(); 533 } 534 535 void CodeCache::verify_oops() { 536 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 537 VerifyOopClosure voc; 538 FOR_ALL_ALIVE_BLOBS(cb) { 539 if (cb->is_nmethod()) { 540 nmethod *nm = (nmethod*)cb; 541 nm->oops_do(&voc); 542 nm->verify_oop_relocations(); 543 } 544 } 545 } 546 547 548 address CodeCache::first_address() { 549 assert_locked_or_safepoint(CodeCache_lock); 550 return (address)_heap->low_boundary(); 551 } 552 553 554 address CodeCache::last_address() { 555 assert_locked_or_safepoint(CodeCache_lock); 556 return (address)_heap->high(); 557 } 558 559 /** 560 * Returns the reverse free ratio. E.g., if 25% (1/4) of the code cache 561 * is free, reverse_free_ratio() returns 4. 562 */ 563 double CodeCache::reverse_free_ratio() { 564 double unallocated_capacity = (double)(CodeCache::unallocated_capacity() - CodeCacheMinimumFreeSpace); 565 double max_capacity = (double)CodeCache::max_capacity(); 566 return max_capacity / unallocated_capacity; 567 } 568 569 void icache_init(); 570 571 void CodeCache::initialize() { 572 assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points"); 573 #ifdef COMPILER2 574 assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment, "CodeCacheSegmentSize must be large enough to align inner loops"); 575 #endif 576 assert(CodeCacheSegmentSize >= sizeof(jdouble), "CodeCacheSegmentSize must be large enough to align constants"); 577 // This was originally just a check of the alignment, causing failure, instead, round 578 // the code cache to the page size. In particular, Solaris is moving to a larger 579 // default page size. 580 CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size()); 581 InitialCodeCacheSize = round_to(InitialCodeCacheSize, os::vm_page_size()); 582 ReservedCodeCacheSize = round_to(ReservedCodeCacheSize, os::vm_page_size()); 583 if (!_heap->reserve(ReservedCodeCacheSize, InitialCodeCacheSize, CodeCacheSegmentSize)) { 584 vm_exit_during_initialization("Could not reserve enough space for code cache"); 585 } 586 587 MemoryService::add_code_heap_memory_pool(_heap); 588 589 // Initialize ICache flush mechanism 590 // This service is needed for os::register_code_area 591 icache_init(); 592 593 // Give OS a chance to register generated code area. 594 // This is used on Windows 64 bit platforms to register 595 // Structured Exception Handlers for our generated code. 596 os::register_code_area(_heap->low_boundary(), _heap->high_boundary()); 597 } 598 599 600 void codeCache_init() { 601 CodeCache::initialize(); 602 } 603 604 //------------------------------------------------------------------------------------------------ 605 606 int CodeCache::number_of_nmethods_with_dependencies() { 607 return _number_of_nmethods_with_dependencies; 608 } 609 610 void CodeCache::clear_inline_caches() { 611 assert_locked_or_safepoint(CodeCache_lock); 612 FOR_ALL_ALIVE_NMETHODS(nm) { 613 nm->clear_inline_caches(); 614 } 615 } 616 617 // Keeps track of time spent for checking dependencies 618 NOT_PRODUCT(static elapsedTimer dependentCheckTime;) 619 620 int CodeCache::mark_for_deoptimization(DepChange& changes) { 621 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 622 int number_of_marked_CodeBlobs = 0; 623 624 // search the hierarchy looking for nmethods which are affected by the loading of this class 625 626 // then search the interfaces this class implements looking for nmethods 627 // which might be dependent of the fact that an interface only had one 628 // implementor. 629 // nmethod::check_all_dependencies works only correctly, if no safepoint 630 // can happen 631 No_Safepoint_Verifier nsv; 632 for (DepChange::ContextStream str(changes, nsv); str.next(); ) { 633 Klass* d = str.klass(); 634 number_of_marked_CodeBlobs += InstanceKlass::cast(d)->mark_dependent_nmethods(changes); 635 } 636 637 #ifndef PRODUCT 638 if (VerifyDependencies) { 639 // Object pointers are used as unique identifiers for dependency arguments. This 640 // is only possible if no safepoint, i.e., GC occurs during the verification code. 641 dependentCheckTime.start(); 642 nmethod::check_all_dependencies(changes); 643 dependentCheckTime.stop(); 644 } 645 #endif 646 647 return number_of_marked_CodeBlobs; 648 } 649 650 651 #ifdef HOTSWAP 652 int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) { 653 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 654 int number_of_marked_CodeBlobs = 0; 655 656 // Deoptimize all methods of the evolving class itself 657 Array<Method*>* old_methods = dependee->methods(); 658 for (int i = 0; i < old_methods->length(); i++) { 659 ResourceMark rm; 660 Method* old_method = old_methods->at(i); 661 nmethod *nm = old_method->code(); 662 if (nm != NULL) { 663 nm->mark_for_deoptimization(); 664 number_of_marked_CodeBlobs++; 665 } 666 } 667 668 FOR_ALL_ALIVE_NMETHODS(nm) { 669 if (nm->is_marked_for_deoptimization()) { 670 // ...Already marked in the previous pass; don't count it again. 671 } else if (nm->is_evol_dependent_on(dependee())) { 672 ResourceMark rm; 673 nm->mark_for_deoptimization(); 674 number_of_marked_CodeBlobs++; 675 } else { 676 // flush caches in case they refer to a redefined Method* 677 nm->clear_inline_caches(); 678 } 679 } 680 681 return number_of_marked_CodeBlobs; 682 } 683 #endif // HOTSWAP 684 685 686 // Deoptimize all methods 687 void CodeCache::mark_all_nmethods_for_deoptimization() { 688 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 689 FOR_ALL_ALIVE_NMETHODS(nm) { 690 nm->mark_for_deoptimization(); 691 } 692 } 693 694 695 int CodeCache::mark_for_deoptimization(Method* dependee) { 696 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 697 int number_of_marked_CodeBlobs = 0; 698 699 FOR_ALL_ALIVE_NMETHODS(nm) { 700 if (nm->is_dependent_on_method(dependee)) { 701 ResourceMark rm; 702 nm->mark_for_deoptimization(); 703 number_of_marked_CodeBlobs++; 704 } 705 } 706 707 return number_of_marked_CodeBlobs; 708 } 709 710 void CodeCache::make_marked_nmethods_zombies() { 711 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); 712 FOR_ALL_ALIVE_NMETHODS(nm) { 713 if (nm->is_marked_for_deoptimization()) { 714 715 // If the nmethod has already been made non-entrant and it can be converted 716 // then zombie it now. Otherwise make it non-entrant and it will eventually 717 // be zombied when it is no longer seen on the stack. Note that the nmethod 718 // might be "entrant" and not on the stack and so could be zombied immediately 719 // but we can't tell because we don't track it on stack until it becomes 720 // non-entrant. 721 722 if (nm->is_not_entrant() && nm->can_not_entrant_be_converted()) { 723 nm->make_zombie(); 724 } else { 725 nm->make_not_entrant(); 726 } 727 } 728 } 729 } 730 731 void CodeCache::make_marked_nmethods_not_entrant() { 732 assert_locked_or_safepoint(CodeCache_lock); 733 FOR_ALL_ALIVE_NMETHODS(nm) { 734 if (nm->is_marked_for_deoptimization()) { 735 nm->make_not_entrant(); 736 } 737 } 738 } 739 740 void CodeCache::verify() { 741 _heap->verify(); 742 FOR_ALL_ALIVE_BLOBS(p) { 743 p->verify(); 744 } 745 } 746 747 void CodeCache::report_codemem_full() { 748 _codemem_full_count++; 749 EventCodeCacheFull event; 750 if (event.should_commit()) { 751 event.set_startAddress((u8)low_bound()); 752 event.set_commitedTopAddress((u8)high()); 753 event.set_reservedTopAddress((u8)high_bound()); 754 event.set_entryCount(nof_blobs()); 755 event.set_methodCount(nof_nmethods()); 756 event.set_adaptorCount(nof_adapters()); 757 event.set_unallocatedCapacity(unallocated_capacity()/K); 758 event.set_fullCount(_codemem_full_count); 759 event.commit(); 760 } 761 } 762 763 void CodeCache::print_memory_overhead() { 764 size_t wasted_bytes = 0; 765 CodeBlob *cb; 766 for (cb = first(); cb != NULL; cb = next(cb)) { 767 HeapBlock* heap_block = ((HeapBlock*)cb) - 1; 768 wasted_bytes += heap_block->length() * CodeCacheSegmentSize - cb->size(); 769 } 770 // Print bytes that are allocated in the freelist 771 ttyLocker ttl; 772 tty->print_cr("Number of elements in freelist: " SSIZE_FORMAT, freelist_length()); 773 tty->print_cr("Allocated in freelist: " SSIZE_FORMAT "kB", bytes_allocated_in_freelist()/K); 774 tty->print_cr("Unused bytes in CodeBlobs: " SSIZE_FORMAT "kB", (wasted_bytes/K)); 775 tty->print_cr("Segment map size: " SSIZE_FORMAT "kB", allocated_segments()/K); // 1 byte per segment 776 } 777 778 //------------------------------------------------------------------------------------------------ 779 // Non-product version 780 781 #ifndef PRODUCT 782 783 void CodeCache::print_trace(const char* event, CodeBlob* cb, int size) { 784 if (PrintCodeCache2) { // Need to add a new flag 785 ResourceMark rm; 786 if (size == 0) size = cb->size(); 787 tty->print_cr("CodeCache %s: addr: " INTPTR_FORMAT ", size: 0x%x", event, p2i(cb), size); 788 } 789 } 790 791 void CodeCache::print_internals() { 792 int nmethodCount = 0; 793 int runtimeStubCount = 0; 794 int adapterCount = 0; 795 int deoptimizationStubCount = 0; 796 int uncommonTrapStubCount = 0; 797 int bufferBlobCount = 0; 798 int total = 0; 799 int nmethodAlive = 0; 800 int nmethodNotEntrant = 0; 801 int nmethodZombie = 0; 802 int nmethodUnloaded = 0; 803 int nmethodJava = 0; 804 int nmethodNative = 0; 805 int max_nm_size = 0; 806 ResourceMark rm; 807 808 CodeBlob *cb; 809 for (cb = first(); cb != NULL; cb = next(cb)) { 810 total++; 811 if (cb->is_nmethod()) { 812 nmethod* nm = (nmethod*)cb; 813 814 if (Verbose && nm->method() != NULL) { 815 ResourceMark rm; 816 char *method_name = nm->method()->name_and_sig_as_C_string(); 817 tty->print("%s", method_name); 818 if(nm->is_alive()) { tty->print_cr(" alive"); } 819 if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); } 820 if(nm->is_zombie()) { tty->print_cr(" zombie"); } 821 } 822 823 nmethodCount++; 824 825 if(nm->is_alive()) { nmethodAlive++; } 826 if(nm->is_not_entrant()) { nmethodNotEntrant++; } 827 if(nm->is_zombie()) { nmethodZombie++; } 828 if(nm->is_unloaded()) { nmethodUnloaded++; } 829 if(nm->method() != NULL && nm->is_native_method()) { nmethodNative++; } 830 831 if(nm->method() != NULL && nm->is_java_method()) { 832 nmethodJava++; 833 max_nm_size = MAX2(max_nm_size, nm->size()); 834 } 835 } else if (cb->is_runtime_stub()) { 836 runtimeStubCount++; 837 } else if (cb->is_deoptimization_stub()) { 838 deoptimizationStubCount++; 839 } else if (cb->is_uncommon_trap_stub()) { 840 uncommonTrapStubCount++; 841 } else if (cb->is_adapter_blob()) { 842 adapterCount++; 843 } else if (cb->is_buffer_blob()) { 844 bufferBlobCount++; 845 } 846 } 847 848 int bucketSize = 512; 849 int bucketLimit = max_nm_size / bucketSize + 1; 850 int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode); 851 memset(buckets, 0, sizeof(int) * bucketLimit); 852 853 for (cb = first(); cb != NULL; cb = next(cb)) { 854 if (cb->is_nmethod()) { 855 nmethod* nm = (nmethod*)cb; 856 if(nm->is_java_method()) { 857 buckets[nm->size() / bucketSize]++; 858 } 859 } 860 } 861 862 tty->print_cr("Code Cache Entries (total of %d)",total); 863 tty->print_cr("-------------------------------------------------"); 864 tty->print_cr("nmethods: %d",nmethodCount); 865 tty->print_cr("\talive: %d",nmethodAlive); 866 tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant); 867 tty->print_cr("\tzombie: %d",nmethodZombie); 868 tty->print_cr("\tunloaded: %d",nmethodUnloaded); 869 tty->print_cr("\tjava: %d",nmethodJava); 870 tty->print_cr("\tnative: %d",nmethodNative); 871 tty->print_cr("runtime_stubs: %d",runtimeStubCount); 872 tty->print_cr("adapters: %d",adapterCount); 873 tty->print_cr("buffer blobs: %d",bufferBlobCount); 874 tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount); 875 tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount); 876 tty->print_cr("\nnmethod size distribution (non-zombie java)"); 877 tty->print_cr("-------------------------------------------------"); 878 879 for(int i=0; i<bucketLimit; i++) { 880 if(buckets[i] != 0) { 881 tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize); 882 tty->fill_to(40); 883 tty->print_cr("%d",buckets[i]); 884 } 885 } 886 887 FREE_C_HEAP_ARRAY(int, buckets, mtCode); 888 print_memory_overhead(); 889 } 890 891 #endif // !PRODUCT 892 893 void CodeCache::print() { 894 print_summary(tty); 895 896 #ifndef PRODUCT 897 if (!Verbose) return; 898 899 CodeBlob_sizes live; 900 CodeBlob_sizes dead; 901 902 FOR_ALL_BLOBS(p) { 903 if (!p->is_alive()) { 904 dead.add(p); 905 } else { 906 live.add(p); 907 } 908 } 909 910 tty->print_cr("CodeCache:"); 911 tty->print_cr("nmethod dependency checking time %fs", dependentCheckTime.seconds()); 912 913 if (!live.is_empty()) { 914 live.print("live"); 915 } 916 if (!dead.is_empty()) { 917 dead.print("dead"); 918 } 919 920 921 if (WizardMode) { 922 // print the oop_map usage 923 int code_size = 0; 924 int number_of_blobs = 0; 925 int number_of_oop_maps = 0; 926 int map_size = 0; 927 FOR_ALL_BLOBS(p) { 928 if (p->is_alive()) { 929 number_of_blobs++; 930 code_size += p->code_size(); 931 OopMapSet* set = p->oop_maps(); 932 if (set != NULL) { 933 number_of_oop_maps += set->size(); 934 map_size += set->heap_size(); 935 } 936 } 937 } 938 tty->print_cr("OopMaps"); 939 tty->print_cr(" #blobs = %d", number_of_blobs); 940 tty->print_cr(" code size = %d", code_size); 941 tty->print_cr(" #oop_maps = %d", number_of_oop_maps); 942 tty->print_cr(" map size = %d", map_size); 943 } 944 945 #endif // !PRODUCT 946 } 947 948 void CodeCache::print_summary(outputStream* st, bool detailed) { 949 size_t total = (_heap->high_boundary() - _heap->low_boundary()); 950 st->print_cr("CodeCache: size=" SIZE_FORMAT "Kb used=" SIZE_FORMAT 951 "Kb max_used=" SIZE_FORMAT "Kb free=" SIZE_FORMAT "Kb", 952 total/K, (total - unallocated_capacity())/K, 953 maxCodeCacheUsed/K, unallocated_capacity()/K); 954 955 if (detailed) { 956 st->print_cr(" bounds [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT "]", 957 p2i(_heap->low_boundary()), 958 p2i(_heap->high()), 959 p2i(_heap->high_boundary())); 960 st->print_cr(" total_blobs=" UINT32_FORMAT " nmethods=" UINT32_FORMAT 961 " adapters=" UINT32_FORMAT, 962 nof_blobs(), nof_nmethods(), nof_adapters()); 963 st->print_cr(" compilation: %s", CompileBroker::should_compile_new_jobs() ? 964 "enabled" : Arguments::mode() == Arguments::_int ? 965 "disabled (interpreter mode)" : 966 "disabled (not enough contiguous free space left)"); 967 } 968 } 969 970 void CodeCache::log_state(outputStream* st) { 971 st->print(" total_blobs='" UINT32_FORMAT "' nmethods='" UINT32_FORMAT "'" 972 " adapters='" UINT32_FORMAT "' free_code_cache='" SIZE_FORMAT "'", 973 nof_blobs(), nof_nmethods(), nof_adapters(), 974 unallocated_capacity()); 975 } 976