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