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