duke@435: /*
drchase@6680:  * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "code/codeBlob.hpp"
stefank@2314: #include "code/codeCache.hpp"
coleenp@4037: #include "code/compiledIC.hpp"
stefank@2314: #include "code/dependencies.hpp"
coleenp@4037: #include "code/icBuffer.hpp"
stefank@2314: #include "code/nmethod.hpp"
stefank@2314: #include "code/pcDesc.hpp"
vladidan@4438: #include "compiler/compileBroker.hpp"
stefank@2314: #include "gc_implementation/shared/markSweep.hpp"
stefank@2314: #include "memory/allocation.inline.hpp"
stefank@2314: #include "memory/gcLocker.hpp"
stefank@2314: #include "memory/iterator.hpp"
stefank@2314: #include "memory/resourceArea.hpp"
coleenp@4037: #include "oops/method.hpp"
stefank@2314: #include "oops/objArrayOop.hpp"
stefank@2314: #include "oops/oop.inline.hpp"
stefank@2314: #include "runtime/handles.inline.hpp"
vladidan@4438: #include "runtime/arguments.hpp"
stefank@2314: #include "runtime/icache.hpp"
stefank@2314: #include "runtime/java.hpp"
stefank@2314: #include "runtime/mutexLocker.hpp"
stefank@2314: #include "services/memoryService.hpp"
sla@5237: #include "trace/tracing.hpp"
stefank@2314: #include "utilities/xmlstream.hpp"
duke@435: 
duke@435: // Helper class for printing in CodeCache
duke@435: 
duke@435: class CodeBlob_sizes {
duke@435:  private:
duke@435:   int count;
duke@435:   int total_size;
duke@435:   int header_size;
duke@435:   int code_size;
duke@435:   int stub_size;
duke@435:   int relocation_size;
duke@435:   int scopes_oop_size;
coleenp@4037:   int scopes_metadata_size;
duke@435:   int scopes_data_size;
duke@435:   int scopes_pcs_size;
duke@435: 
duke@435:  public:
duke@435:   CodeBlob_sizes() {
duke@435:     count            = 0;
duke@435:     total_size       = 0;
duke@435:     header_size      = 0;
duke@435:     code_size        = 0;
duke@435:     stub_size        = 0;
duke@435:     relocation_size  = 0;
duke@435:     scopes_oop_size  = 0;
coleenp@4037:     scopes_metadata_size  = 0;
duke@435:     scopes_data_size = 0;
duke@435:     scopes_pcs_size  = 0;
duke@435:   }
duke@435: 
duke@435:   int total()                                    { return total_size; }
duke@435:   bool is_empty()                                { return count == 0; }
duke@435: 
duke@435:   void print(const char* title) {
drchase@6680:     tty->print_cr(" #%d %s = %dK (hdr %d%%,  loc %d%%, code %d%%, stub %d%%, [oops %d%%, metadata %d%%, data %d%%, pcs %d%%])",
duke@435:                   count,
duke@435:                   title,
drchase@6680:                   (int)(total() / K),
duke@435:                   header_size             * 100 / total_size,
duke@435:                   relocation_size         * 100 / total_size,
duke@435:                   code_size               * 100 / total_size,
duke@435:                   stub_size               * 100 / total_size,
duke@435:                   scopes_oop_size         * 100 / total_size,
coleenp@4037:                   scopes_metadata_size    * 100 / total_size,
duke@435:                   scopes_data_size        * 100 / total_size,
duke@435:                   scopes_pcs_size         * 100 / total_size);
duke@435:   }
duke@435: 
duke@435:   void add(CodeBlob* cb) {
duke@435:     count++;
duke@435:     total_size       += cb->size();
duke@435:     header_size      += cb->header_size();
duke@435:     relocation_size  += cb->relocation_size();
duke@435:     if (cb->is_nmethod()) {
twisti@1918:       nmethod* nm = cb->as_nmethod_or_null();
twisti@2103:       code_size        += nm->insts_size();
duke@435:       stub_size        += nm->stub_size();
duke@435: 
twisti@1918:       scopes_oop_size  += nm->oops_size();
coleenp@4037:       scopes_metadata_size  += nm->metadata_size();
duke@435:       scopes_data_size += nm->scopes_data_size();
duke@435:       scopes_pcs_size  += nm->scopes_pcs_size();
duke@435:     } else {
twisti@2103:       code_size        += cb->code_size();
duke@435:     }
duke@435:   }
duke@435: };
duke@435: 
duke@435: // CodeCache implementation
duke@435: 
duke@435: CodeHeap * CodeCache::_heap = new CodeHeap();
duke@435: int CodeCache::_number_of_blobs = 0;
never@1999: int CodeCache::_number_of_adapters = 0;
never@1999: int CodeCache::_number_of_nmethods = 0;
duke@435: int CodeCache::_number_of_nmethods_with_dependencies = 0;
duke@435: bool CodeCache::_needs_cache_clean = false;
jrose@1424: nmethod* CodeCache::_scavenge_root_nmethods = NULL;
duke@435: 
sla@5237: int CodeCache::_codemem_full_count = 0;
duke@435: 
duke@435: CodeBlob* CodeCache::first() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   return (CodeBlob*)_heap->first();
duke@435: }
duke@435: 
duke@435: 
duke@435: CodeBlob* CodeCache::next(CodeBlob* cb) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   return (CodeBlob*)_heap->next(cb);
duke@435: }
duke@435: 
duke@435: 
duke@435: CodeBlob* CodeCache::alive(CodeBlob *cb) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   while (cb != NULL && !cb->is_alive()) cb = next(cb);
duke@435:   return cb;
duke@435: }
duke@435: 
duke@435: 
duke@435: nmethod* CodeCache::alive_nmethod(CodeBlob* cb) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   while (cb != NULL && (!cb->is_alive() || !cb->is_nmethod())) cb = next(cb);
duke@435:   return (nmethod*)cb;
duke@435: }
duke@435: 
never@1893: nmethod* CodeCache::first_nmethod() {
never@1893:   assert_locked_or_safepoint(CodeCache_lock);
never@1893:   CodeBlob* cb = first();
never@1893:   while (cb != NULL && !cb->is_nmethod()) {
never@1893:     cb = next(cb);
never@1893:   }
never@1893:   return (nmethod*)cb;
never@1893: }
never@1893: 
never@1893: nmethod* CodeCache::next_nmethod (CodeBlob* cb) {
never@1893:   assert_locked_or_safepoint(CodeCache_lock);
never@1893:   cb = next(cb);
never@1893:   while (cb != NULL && !cb->is_nmethod()) {
never@1893:     cb = next(cb);
never@1893:   }
never@1893:   return (nmethod*)cb;
never@1893: }
duke@435: 
vladidan@4438: static size_t maxCodeCacheUsed = 0;
vladidan@4438: 
neliasso@4952: CodeBlob* CodeCache::allocate(int size, bool is_critical) {
duke@435:   // Do not seize the CodeCache lock here--if the caller has not
duke@435:   // already done so, we are going to lose bigtime, since the code
duke@435:   // cache will contain a garbage CodeBlob until the caller can
duke@435:   // run the constructor for the CodeBlob subclass he is busy
duke@435:   // instantiating.
duke@435:   guarantee(size >= 0, "allocation request must be reasonable");
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   CodeBlob* cb = NULL;
duke@435:   _number_of_blobs++;
duke@435:   while (true) {
neliasso@4952:     cb = (CodeBlob*)_heap->allocate(size, is_critical);
duke@435:     if (cb != NULL) break;
duke@435:     if (!_heap->expand_by(CodeCacheExpansionSize)) {
duke@435:       // Expansion failed
duke@435:       return NULL;
duke@435:     }
duke@435:     if (PrintCodeCacheExtension) {
duke@435:       ResourceMark rm;
drchase@6680:       tty->print_cr("code cache extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (" SSIZE_FORMAT " bytes)",
neliasso@4952:                     (intptr_t)_heap->low_boundary(), (intptr_t)_heap->high(),
neliasso@4952:                     (address)_heap->high() - (address)_heap->low_boundary());
duke@435:     }
duke@435:   }
vladidan@4438:   maxCodeCacheUsed = MAX2(maxCodeCacheUsed, ((address)_heap->high_boundary() -
vladidan@4438:                           (address)_heap->low_boundary()) - unallocated_capacity());
duke@435:   verify_if_often();
jrose@1424:   print_trace("allocation", cb, size);
duke@435:   return cb;
duke@435: }
duke@435: 
duke@435: void CodeCache::free(CodeBlob* cb) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   verify_if_often();
duke@435: 
jrose@1424:   print_trace("free", cb);
never@1999:   if (cb->is_nmethod()) {
never@1999:     _number_of_nmethods--;
never@1999:     if (((nmethod *)cb)->has_dependencies()) {
never@1999:       _number_of_nmethods_with_dependencies--;
never@1999:     }
never@1999:   }
never@1999:   if (cb->is_adapter_blob()) {
never@1999:     _number_of_adapters--;
duke@435:   }
duke@435:   _number_of_blobs--;
duke@435: 
duke@435:   _heap->deallocate(cb);
duke@435: 
duke@435:   verify_if_often();
duke@435:   assert(_number_of_blobs >= 0, "sanity check");
duke@435: }
duke@435: 
duke@435: 
duke@435: void CodeCache::commit(CodeBlob* cb) {
duke@435:   // this is called by nmethod::nmethod, which must already own CodeCache_lock
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
never@1999:   if (cb->is_nmethod()) {
never@1999:     _number_of_nmethods++;
never@1999:     if (((nmethod *)cb)->has_dependencies()) {
never@1999:       _number_of_nmethods_with_dependencies++;
never@1999:     }
duke@435:   }
never@1999:   if (cb->is_adapter_blob()) {
never@1999:     _number_of_adapters++;
never@1999:   }
never@1999: 
duke@435:   // flush the hardware I-cache
twisti@2103:   ICache::invalidate_range(cb->content_begin(), cb->content_size());
duke@435: }
duke@435: 
duke@435: 
duke@435: void CodeCache::flush() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   Unimplemented();
duke@435: }
duke@435: 
duke@435: 
duke@435: // Iteration over CodeBlobs
duke@435: 
duke@435: #define FOR_ALL_BLOBS(var)       for (CodeBlob *var =       first() ; var != NULL; var =       next(var) )
duke@435: #define FOR_ALL_ALIVE_BLOBS(var) for (CodeBlob *var = alive(first()); var != NULL; var = alive(next(var)))
duke@435: #define FOR_ALL_ALIVE_NMETHODS(var) for (nmethod *var = alive_nmethod(first()); var != NULL; var = alive_nmethod(next(var)))
duke@435: 
duke@435: 
duke@435: bool CodeCache::contains(void *p) {
duke@435:   // It should be ok to call contains without holding a lock
duke@435:   return _heap->contains(p);
duke@435: }
duke@435: 
duke@435: 
duke@435: // This method is safe to call without holding the CodeCache_lock, as long as a dead codeblob is not
duke@435: // looked up (i.e., one that has been marked for deletion). It only dependes on the _segmap to contain
duke@435: // valid indices, which it will always do, as long as the CodeBlob is not in the process of being recycled.
duke@435: CodeBlob* CodeCache::find_blob(void* start) {
duke@435:   CodeBlob* result = find_blob_unsafe(start);
duke@435:   if (result == NULL) return NULL;
duke@435:   // We could potientially look up non_entrant methods
duke@435:   guarantee(!result->is_zombie() || result->is_locked_by_vm() || is_error_reported(), "unsafe access to zombie method");
duke@435:   return result;
duke@435: }
duke@435: 
duke@435: nmethod* CodeCache::find_nmethod(void* start) {
duke@435:   CodeBlob *cb = find_blob(start);
duke@435:   assert(cb == NULL || cb->is_nmethod(), "did not find an nmethod");
duke@435:   return (nmethod*)cb;
duke@435: }
duke@435: 
duke@435: 
duke@435: void CodeCache::blobs_do(void f(CodeBlob* nm)) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_BLOBS(p) {
duke@435:     f(p);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void CodeCache::nmethods_do(void f(nmethod* nm)) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_BLOBS(nm) {
duke@435:     if (nm->is_nmethod()) f((nmethod*)nm);
duke@435:   }
duke@435: }
duke@435: 
coleenp@4037: void CodeCache::alive_nmethods_do(void f(nmethod* nm)) {
coleenp@4037:   assert_locked_or_safepoint(CodeCache_lock);
coleenp@4037:   FOR_ALL_ALIVE_NMETHODS(nm) {
coleenp@4037:     f(nm);
coleenp@4037:   }
coleenp@4037: }
duke@435: 
duke@435: int CodeCache::alignment_unit() {
duke@435:   return (int)_heap->alignment_unit();
duke@435: }
duke@435: 
duke@435: 
duke@435: int CodeCache::alignment_offset() {
duke@435:   return (int)_heap->alignment_offset();
duke@435: }
duke@435: 
duke@435: 
twisti@1918: // Mark nmethods for unloading if they contain otherwise unreachable
twisti@1918: // oops.
brutisso@4098: void CodeCache::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
twisti@1918:   FOR_ALL_ALIVE_NMETHODS(nm) {
brutisso@4098:     nm->do_unloading(is_alive, unloading_occurred);
duke@435:   }
duke@435: }
duke@435: 
jrose@1424: void CodeCache::blobs_do(CodeBlobClosure* f) {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_ALIVE_BLOBS(cb) {
jrose@1424:     f->do_code_blob(cb);
jrose@1424: 
jrose@1424: #ifdef ASSERT
jrose@1424:     if (cb->is_nmethod())
jrose@1424:       ((nmethod*)cb)->verify_scavenge_root_oops();
jrose@1424: #endif //ASSERT
duke@435:   }
duke@435: }
duke@435: 
jrose@1424: // Walk the list of methods which might contain non-perm oops.
jrose@1424: void CodeCache::scavenge_root_nmethods_do(CodeBlobClosure* f) {
jrose@1424:   assert_locked_or_safepoint(CodeCache_lock);
stefank@6992: 
stefank@6992:   if (UseG1GC) {
stefank@6992:     return;
stefank@6992:   }
stefank@6992: 
jrose@1424:   debug_only(mark_scavenge_root_nmethods());
jrose@1424: 
jrose@1424:   for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
jrose@1424:     debug_only(cur->clear_scavenge_root_marked());
jrose@1424:     assert(cur->scavenge_root_not_marked(), "");
jrose@1424:     assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
jrose@1424: 
jrose@1424:     bool is_live = (!cur->is_zombie() && !cur->is_unloaded());
jrose@1424: #ifndef PRODUCT
jrose@1424:     if (TraceScavenge) {
jrose@1424:       cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr();
jrose@1424:     }
jrose@1424: #endif //PRODUCT
twisti@1798:     if (is_live) {
jrose@1424:       // Perform cur->oops_do(f), maybe just once per nmethod.
jrose@1424:       f->do_code_blob(cur);
twisti@1798:     }
jrose@1424:   }
jrose@1424: 
jrose@1424:   // Check for stray marks.
jrose@1424:   debug_only(verify_perm_nmethods(NULL));
jrose@1424: }
jrose@1424: 
jrose@1424: void CodeCache::add_scavenge_root_nmethod(nmethod* nm) {
jrose@1424:   assert_locked_or_safepoint(CodeCache_lock);
stefank@6992: 
stefank@6992:   if (UseG1GC) {
stefank@6992:     return;
stefank@6992:   }
stefank@6992: 
jrose@1424:   nm->set_on_scavenge_root_list();
jrose@1424:   nm->set_scavenge_root_link(_scavenge_root_nmethods);
jrose@1424:   set_scavenge_root_nmethods(nm);
jrose@1424:   print_trace("add_scavenge_root", nm);
jrose@1424: }
jrose@1424: 
jrose@1424: void CodeCache::drop_scavenge_root_nmethod(nmethod* nm) {
jrose@1424:   assert_locked_or_safepoint(CodeCache_lock);
stefank@6992: 
stefank@6992:   if (UseG1GC) {
stefank@6992:     return;
stefank@6992:   }
stefank@6992: 
jrose@1424:   print_trace("drop_scavenge_root", nm);
jrose@1424:   nmethod* last = NULL;
jrose@1424:   nmethod* cur = scavenge_root_nmethods();
jrose@1424:   while (cur != NULL) {
jrose@1424:     nmethod* next = cur->scavenge_root_link();
jrose@1424:     if (cur == nm) {
jrose@1424:       if (last != NULL)
jrose@1424:             last->set_scavenge_root_link(next);
jrose@1424:       else  set_scavenge_root_nmethods(next);
jrose@1424:       nm->set_scavenge_root_link(NULL);
jrose@1424:       nm->clear_on_scavenge_root_list();
jrose@1424:       return;
jrose@1424:     }
jrose@1424:     last = cur;
jrose@1424:     cur = next;
jrose@1424:   }
jrose@1424:   assert(false, "should have been on list");
jrose@1424: }
jrose@1424: 
jrose@1424: void CodeCache::prune_scavenge_root_nmethods() {
jrose@1424:   assert_locked_or_safepoint(CodeCache_lock);
stefank@6992: 
stefank@6992:   if (UseG1GC) {
stefank@6992:     return;
stefank@6992:   }
stefank@6992: 
jrose@1424:   debug_only(mark_scavenge_root_nmethods());
jrose@1424: 
jrose@1424:   nmethod* last = NULL;
jrose@1424:   nmethod* cur = scavenge_root_nmethods();
jrose@1424:   while (cur != NULL) {
jrose@1424:     nmethod* next = cur->scavenge_root_link();
jrose@1424:     debug_only(cur->clear_scavenge_root_marked());
jrose@1424:     assert(cur->scavenge_root_not_marked(), "");
jrose@1424:     assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
jrose@1424: 
jrose@1424:     if (!cur->is_zombie() && !cur->is_unloaded()
jrose@1424:         && cur->detect_scavenge_root_oops()) {
jrose@1424:       // Keep it.  Advance 'last' to prevent deletion.
jrose@1424:       last = cur;
jrose@1424:     } else {
jrose@1424:       // Prune it from the list, so we don't have to look at it any more.
jrose@1424:       print_trace("prune_scavenge_root", cur);
jrose@1424:       cur->set_scavenge_root_link(NULL);
jrose@1424:       cur->clear_on_scavenge_root_list();
jrose@1424:       if (last != NULL)
jrose@1424:             last->set_scavenge_root_link(next);
jrose@1424:       else  set_scavenge_root_nmethods(next);
jrose@1424:     }
jrose@1424:     cur = next;
jrose@1424:   }
jrose@1424: 
jrose@1424:   // Check for stray marks.
jrose@1424:   debug_only(verify_perm_nmethods(NULL));
jrose@1424: }
jrose@1424: 
jrose@1424: #ifndef PRODUCT
jrose@1424: void CodeCache::asserted_non_scavengable_nmethods_do(CodeBlobClosure* f) {
stefank@6992:   if (UseG1GC) {
stefank@6992:     return;
stefank@6992:   }
stefank@6992: 
jrose@1424:   // While we are here, verify the integrity of the list.
jrose@1424:   mark_scavenge_root_nmethods();
jrose@1424:   for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
jrose@1424:     assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
jrose@1424:     cur->clear_scavenge_root_marked();
jrose@1424:   }
jrose@1424:   verify_perm_nmethods(f);
jrose@1424: }
jrose@1424: 
jrose@1424: // Temporarily mark nmethods that are claimed to be on the non-perm list.
jrose@1424: void CodeCache::mark_scavenge_root_nmethods() {
jrose@1424:   FOR_ALL_ALIVE_BLOBS(cb) {
jrose@1424:     if (cb->is_nmethod()) {
jrose@1424:       nmethod *nm = (nmethod*)cb;
jrose@1424:       assert(nm->scavenge_root_not_marked(), "clean state");
jrose@1424:       if (nm->on_scavenge_root_list())
jrose@1424:         nm->set_scavenge_root_marked();
jrose@1424:     }
jrose@1424:   }
jrose@1424: }
jrose@1424: 
jrose@1424: // If the closure is given, run it on the unlisted nmethods.
jrose@1424: // Also make sure that the effects of mark_scavenge_root_nmethods is gone.
jrose@1424: void CodeCache::verify_perm_nmethods(CodeBlobClosure* f_or_null) {
jrose@1424:   FOR_ALL_ALIVE_BLOBS(cb) {
jrose@1424:     bool call_f = (f_or_null != NULL);
jrose@1424:     if (cb->is_nmethod()) {
jrose@1424:       nmethod *nm = (nmethod*)cb;
jrose@1424:       assert(nm->scavenge_root_not_marked(), "must be already processed");
jrose@1424:       if (nm->on_scavenge_root_list())
jrose@1424:         call_f = false;  // don't show this one to the client
jrose@1424:       nm->verify_scavenge_root_oops();
jrose@1424:     } else {
jrose@1424:       call_f = false;   // not an nmethod
jrose@1424:     }
jrose@1424:     if (call_f)  f_or_null->do_code_blob(cb);
jrose@1424:   }
jrose@1424: }
jrose@1424: #endif //PRODUCT
jrose@1424: 
stefank@6992: void CodeCache::verify_clean_inline_caches() {
stefank@6992: #ifdef ASSERT
stefank@6992:   FOR_ALL_ALIVE_BLOBS(cb) {
stefank@6992:     if (cb->is_nmethod()) {
stefank@6992:       nmethod* nm = (nmethod*)cb;
stefank@6992:       assert(!nm->is_unloaded(), "Tautology");
stefank@6992:       nm->verify_clean_inline_caches();
stefank@6992:       nm->verify();
stefank@6992:     }
stefank@6992:   }
stefank@6992: #endif
stefank@6992: }
stefank@6992: 
stefank@6992: void CodeCache::verify_icholder_relocations() {
stefank@6992: #ifdef ASSERT
stefank@6992:   // make sure that we aren't leaking icholders
stefank@6992:   int count = 0;
stefank@6992:   FOR_ALL_BLOBS(cb) {
stefank@6992:     if (cb->is_nmethod()) {
stefank@6992:       nmethod* nm = (nmethod*)cb;
stefank@6992:       count += nm->verify_icholder_relocations();
stefank@6992:     }
stefank@6992:   }
stefank@6992: 
stefank@6992:   assert(count + InlineCacheBuffer::pending_icholder_count() + CompiledICHolder::live_not_claimed_count() ==
stefank@6992:          CompiledICHolder::live_count(), "must agree");
stefank@6992: #endif
stefank@6992: }
kvn@1637: 
duke@435: void CodeCache::gc_prologue() {
duke@435: }
duke@435: 
duke@435: void CodeCache::gc_epilogue() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_ALIVE_BLOBS(cb) {
duke@435:     if (cb->is_nmethod()) {
duke@435:       nmethod *nm = (nmethod*)cb;
duke@435:       assert(!nm->is_unloaded(), "Tautology");
duke@435:       if (needs_cache_clean()) {
duke@435:         nm->cleanup_inline_caches();
duke@435:       }
twisti@1918:       DEBUG_ONLY(nm->verify());
stefank@6992:       DEBUG_ONLY(nm->verify_oop_relocations());
duke@435:     }
duke@435:   }
duke@435:   set_needs_cache_clean(false);
jrose@1424:   prune_scavenge_root_nmethods();
coleenp@4037: 
stefank@6992:   verify_icholder_relocations();
duke@435: }
duke@435: 
never@2657: void CodeCache::verify_oops() {
never@2657:   MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
never@2657:   VerifyOopClosure voc;
never@2657:   FOR_ALL_ALIVE_BLOBS(cb) {
never@2657:     if (cb->is_nmethod()) {
never@2657:       nmethod *nm = (nmethod*)cb;
never@2657:       nm->oops_do(&voc);
never@2657:       nm->verify_oop_relocations();
never@2657:     }
never@2657:   }
never@2657: }
never@2657: 
never@2657: 
duke@435: address CodeCache::first_address() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
neliasso@4952:   return (address)_heap->low_boundary();
duke@435: }
duke@435: 
duke@435: 
duke@435: address CodeCache::last_address() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
neliasso@4952:   return (address)_heap->high();
duke@435: }
duke@435: 
anoll@5151: /**
anoll@5151:  * Returns the reverse free ratio. E.g., if 25% (1/4) of the code cache
anoll@5151:  * is free, reverse_free_ratio() returns 4.
anoll@5151:  */
anoll@5151: double CodeCache::reverse_free_ratio() {
anoll@5151:   double unallocated_capacity = (double)(CodeCache::unallocated_capacity() - CodeCacheMinimumFreeSpace);
anoll@5151:   double max_capacity = (double)CodeCache::max_capacity();
anoll@5151:   return max_capacity / unallocated_capacity;
anoll@5151: }
duke@435: 
duke@435: void icache_init();
duke@435: 
duke@435: void CodeCache::initialize() {
duke@435:   assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points");
duke@435: #ifdef COMPILER2
duke@435:   assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment,  "CodeCacheSegmentSize must be large enough to align inner loops");
duke@435: #endif
duke@435:   assert(CodeCacheSegmentSize >= sizeof(jdouble),    "CodeCacheSegmentSize must be large enough to align constants");
duke@435:   // This was originally just a check of the alignment, causing failure, instead, round
duke@435:   // the code cache to the page size.  In particular, Solaris is moving to a larger
duke@435:   // default page size.
duke@435:   CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size());
duke@435:   InitialCodeCacheSize = round_to(InitialCodeCacheSize, os::vm_page_size());
duke@435:   ReservedCodeCacheSize = round_to(ReservedCodeCacheSize, os::vm_page_size());
duke@435:   if (!_heap->reserve(ReservedCodeCacheSize, InitialCodeCacheSize, CodeCacheSegmentSize)) {
duke@435:     vm_exit_during_initialization("Could not reserve enough space for code cache");
duke@435:   }
duke@435: 
duke@435:   MemoryService::add_code_heap_memory_pool(_heap);
duke@435: 
duke@435:   // Initialize ICache flush mechanism
duke@435:   // This service is needed for os::register_code_area
duke@435:   icache_init();
duke@435: 
duke@435:   // Give OS a chance to register generated code area.
duke@435:   // This is used on Windows 64 bit platforms to register
duke@435:   // Structured Exception Handlers for our generated code.
duke@435:   os::register_code_area(_heap->low_boundary(), _heap->high_boundary());
duke@435: }
duke@435: 
duke@435: 
duke@435: void codeCache_init() {
duke@435:   CodeCache::initialize();
duke@435: }
duke@435: 
duke@435: //------------------------------------------------------------------------------------------------
duke@435: 
duke@435: int CodeCache::number_of_nmethods_with_dependencies() {
duke@435:   return _number_of_nmethods_with_dependencies;
duke@435: }
duke@435: 
duke@435: void CodeCache::clear_inline_caches() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     nm->clear_inline_caches();
duke@435:   }
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: // used to keep track of how much time is spent in mark_for_deoptimization
duke@435: static elapsedTimer dependentCheckTime;
duke@435: static int dependentCheckCount = 0;
duke@435: #endif // PRODUCT
duke@435: 
duke@435: 
duke@435: int CodeCache::mark_for_deoptimization(DepChange& changes) {
duke@435:   MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
duke@435: 
duke@435: #ifndef PRODUCT
duke@435:   dependentCheckTime.start();
duke@435:   dependentCheckCount++;
duke@435: #endif // PRODUCT
duke@435: 
duke@435:   int number_of_marked_CodeBlobs = 0;
duke@435: 
duke@435:   // search the hierarchy looking for nmethods which are affected by the loading of this class
duke@435: 
duke@435:   // then search the interfaces this class implements looking for nmethods
duke@435:   // which might be dependent of the fact that an interface only had one
duke@435:   // implementor.
duke@435: 
duke@435:   { No_Safepoint_Verifier nsv;
duke@435:     for (DepChange::ContextStream str(changes, nsv); str.next(); ) {
coleenp@4037:       Klass* d = str.klass();
coleenp@4037:       number_of_marked_CodeBlobs += InstanceKlass::cast(d)->mark_dependent_nmethods(changes);
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   if (VerifyDependencies) {
duke@435:     // Turn off dependency tracing while actually testing deps.
duke@435:     NOT_PRODUCT( FlagSetting fs(TraceDependencies, false) );
duke@435:     FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:       if (!nm->is_marked_for_deoptimization() &&
duke@435:           nm->check_all_dependencies()) {
duke@435:         ResourceMark rm;
duke@435:         tty->print_cr("Should have been marked for deoptimization:");
duke@435:         changes.print();
duke@435:         nm->print();
duke@435:         nm->print_dependencies();
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435:   dependentCheckTime.stop();
duke@435: #endif // PRODUCT
duke@435: 
duke@435:   return number_of_marked_CodeBlobs;
duke@435: }
duke@435: 
duke@435: 
duke@435: #ifdef HOTSWAP
duke@435: int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) {
duke@435:   MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
duke@435:   int number_of_marked_CodeBlobs = 0;
duke@435: 
duke@435:   // Deoptimize all methods of the evolving class itself
coleenp@4037:   Array<Method*>* old_methods = dependee->methods();
duke@435:   for (int i = 0; i < old_methods->length(); i++) {
duke@435:     ResourceMark rm;
coleenp@4037:     Method* old_method = old_methods->at(i);
duke@435:     nmethod *nm = old_method->code();
duke@435:     if (nm != NULL) {
duke@435:       nm->mark_for_deoptimization();
duke@435:       number_of_marked_CodeBlobs++;
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     if (nm->is_marked_for_deoptimization()) {
duke@435:       // ...Already marked in the previous pass; don't count it again.
duke@435:     } else if (nm->is_evol_dependent_on(dependee())) {
duke@435:       ResourceMark rm;
duke@435:       nm->mark_for_deoptimization();
duke@435:       number_of_marked_CodeBlobs++;
duke@435:     } else  {
coleenp@4037:       // flush caches in case they refer to a redefined Method*
duke@435:       nm->clear_inline_caches();
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   return number_of_marked_CodeBlobs;
duke@435: }
duke@435: #endif // HOTSWAP
duke@435: 
duke@435: 
duke@435: // Deoptimize all methods
duke@435: void CodeCache::mark_all_nmethods_for_deoptimization() {
duke@435:   MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     nm->mark_for_deoptimization();
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
coleenp@4037: int CodeCache::mark_for_deoptimization(Method* dependee) {
duke@435:   MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
duke@435:   int number_of_marked_CodeBlobs = 0;
duke@435: 
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     if (nm->is_dependent_on_method(dependee)) {
duke@435:       ResourceMark rm;
duke@435:       nm->mark_for_deoptimization();
duke@435:       number_of_marked_CodeBlobs++;
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   return number_of_marked_CodeBlobs;
duke@435: }
duke@435: 
duke@435: void CodeCache::make_marked_nmethods_zombies() {
duke@435:   assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint");
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     if (nm->is_marked_for_deoptimization()) {
duke@435: 
duke@435:       // If the nmethod has already been made non-entrant and it can be converted
duke@435:       // then zombie it now. Otherwise make it non-entrant and it will eventually
duke@435:       // be zombied when it is no longer seen on the stack. Note that the nmethod
duke@435:       // might be "entrant" and not on the stack and so could be zombied immediately
duke@435:       // but we can't tell because we don't track it on stack until it becomes
duke@435:       // non-entrant.
duke@435: 
duke@435:       if (nm->is_not_entrant() && nm->can_not_entrant_be_converted()) {
duke@435:         nm->make_zombie();
duke@435:       } else {
duke@435:         nm->make_not_entrant();
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void CodeCache::make_marked_nmethods_not_entrant() {
duke@435:   assert_locked_or_safepoint(CodeCache_lock);
duke@435:   FOR_ALL_ALIVE_NMETHODS(nm) {
duke@435:     if (nm->is_marked_for_deoptimization()) {
duke@435:       nm->make_not_entrant();
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void CodeCache::verify() {
duke@435:   _heap->verify();
duke@435:   FOR_ALL_ALIVE_BLOBS(p) {
duke@435:     p->verify();
duke@435:   }
duke@435: }
duke@435: 
sla@5237: void CodeCache::report_codemem_full() {
sla@5237:   _codemem_full_count++;
sla@5237:   EventCodeCacheFull event;
sla@5237:   if (event.should_commit()) {
sla@5237:     event.set_startAddress((u8)low_bound());
sla@5237:     event.set_commitedTopAddress((u8)high());
sla@5237:     event.set_reservedTopAddress((u8)high_bound());
sla@5237:     event.set_entryCount(nof_blobs());
sla@5237:     event.set_methodCount(nof_nmethods());
sla@5237:     event.set_adaptorCount(nof_adapters());
sla@5237:     event.set_unallocatedCapacity(unallocated_capacity()/K);
sla@5237:     event.set_fullCount(_codemem_full_count);
sla@5237:     event.commit();
sla@5237:   }
sla@5237: }
sla@5237: 
duke@435: //------------------------------------------------------------------------------------------------
duke@435: // Non-product version
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: 
duke@435: void CodeCache::verify_if_often() {
duke@435:   if (VerifyCodeCacheOften) {
duke@435:     _heap->verify();
duke@435:   }
duke@435: }
duke@435: 
jrose@1424: void CodeCache::print_trace(const char* event, CodeBlob* cb, int size) {
jrose@1424:   if (PrintCodeCache2) {  // Need to add a new flag
jrose@1424:     ResourceMark rm;
jrose@1424:     if (size == 0)  size = cb->size();
drchase@6680:     tty->print_cr("CodeCache %s:  addr: " INTPTR_FORMAT ", size: 0x%x", event, p2i(cb), size);
jrose@1424:   }
jrose@1424: }
jrose@1424: 
duke@435: void CodeCache::print_internals() {
duke@435:   int nmethodCount = 0;
duke@435:   int runtimeStubCount = 0;
duke@435:   int adapterCount = 0;
duke@435:   int deoptimizationStubCount = 0;
duke@435:   int uncommonTrapStubCount = 0;
duke@435:   int bufferBlobCount = 0;
duke@435:   int total = 0;
duke@435:   int nmethodAlive = 0;
duke@435:   int nmethodNotEntrant = 0;
duke@435:   int nmethodZombie = 0;
duke@435:   int nmethodUnloaded = 0;
duke@435:   int nmethodJava = 0;
duke@435:   int nmethodNative = 0;
duke@435:   int maxCodeSize = 0;
duke@435:   ResourceMark rm;
duke@435: 
duke@435:   CodeBlob *cb;
duke@435:   for (cb = first(); cb != NULL; cb = next(cb)) {
duke@435:     total++;
duke@435:     if (cb->is_nmethod()) {
duke@435:       nmethod* nm = (nmethod*)cb;
duke@435: 
duke@435:       if (Verbose && nm->method() != NULL) {
duke@435:         ResourceMark rm;
duke@435:         char *method_name = nm->method()->name_and_sig_as_C_string();
duke@435:         tty->print("%s", method_name);
duke@435:         if(nm->is_alive()) { tty->print_cr(" alive"); }
duke@435:         if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); }
duke@435:         if(nm->is_zombie()) { tty->print_cr(" zombie"); }
duke@435:       }
duke@435: 
duke@435:       nmethodCount++;
duke@435: 
duke@435:       if(nm->is_alive()) { nmethodAlive++; }
duke@435:       if(nm->is_not_entrant()) { nmethodNotEntrant++; }
duke@435:       if(nm->is_zombie()) { nmethodZombie++; }
duke@435:       if(nm->is_unloaded()) { nmethodUnloaded++; }
duke@435:       if(nm->is_native_method()) { nmethodNative++; }
duke@435: 
duke@435:       if(nm->method() != NULL && nm->is_java_method()) {
duke@435:         nmethodJava++;
twisti@2103:         if (nm->insts_size() > maxCodeSize) {
twisti@2103:           maxCodeSize = nm->insts_size();
duke@435:         }
duke@435:       }
duke@435:     } else if (cb->is_runtime_stub()) {
duke@435:       runtimeStubCount++;
duke@435:     } else if (cb->is_deoptimization_stub()) {
duke@435:       deoptimizationStubCount++;
duke@435:     } else if (cb->is_uncommon_trap_stub()) {
duke@435:       uncommonTrapStubCount++;
duke@435:     } else if (cb->is_adapter_blob()) {
duke@435:       adapterCount++;
duke@435:     } else if (cb->is_buffer_blob()) {
duke@435:       bufferBlobCount++;
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   int bucketSize = 512;
duke@435:   int bucketLimit = maxCodeSize / bucketSize + 1;
zgu@3900:   int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode);
duke@435:   memset(buckets,0,sizeof(int) * bucketLimit);
duke@435: 
duke@435:   for (cb = first(); cb != NULL; cb = next(cb)) {
duke@435:     if (cb->is_nmethod()) {
duke@435:       nmethod* nm = (nmethod*)cb;
duke@435:       if(nm->is_java_method()) {
twisti@2103:         buckets[nm->insts_size() / bucketSize]++;
duke@435:       }
duke@435:     }
duke@435:   }
duke@435:   tty->print_cr("Code Cache Entries (total of %d)",total);
duke@435:   tty->print_cr("-------------------------------------------------");
duke@435:   tty->print_cr("nmethods: %d",nmethodCount);
duke@435:   tty->print_cr("\talive: %d",nmethodAlive);
duke@435:   tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant);
duke@435:   tty->print_cr("\tzombie: %d",nmethodZombie);
duke@435:   tty->print_cr("\tunloaded: %d",nmethodUnloaded);
duke@435:   tty->print_cr("\tjava: %d",nmethodJava);
duke@435:   tty->print_cr("\tnative: %d",nmethodNative);
duke@435:   tty->print_cr("runtime_stubs: %d",runtimeStubCount);
duke@435:   tty->print_cr("adapters: %d",adapterCount);
duke@435:   tty->print_cr("buffer blobs: %d",bufferBlobCount);
duke@435:   tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount);
duke@435:   tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount);
duke@435:   tty->print_cr("\nnmethod size distribution (non-zombie java)");
duke@435:   tty->print_cr("-------------------------------------------------");
duke@435: 
duke@435:   for(int i=0; i<bucketLimit; i++) {
duke@435:     if(buckets[i] != 0) {
duke@435:       tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize);
duke@435:       tty->fill_to(40);
duke@435:       tty->print_cr("%d",buckets[i]);
duke@435:     }
duke@435:   }
duke@435: 
zgu@3900:   FREE_C_HEAP_ARRAY(int, buckets, mtCode);
duke@435: }
duke@435: 
vladidan@4438: #endif // !PRODUCT
vladidan@4438: 
duke@435: void CodeCache::print() {
vladidan@4438:   print_summary(tty);
vladidan@4438: 
vladidan@4438: #ifndef PRODUCT
vladidan@4438:   if (!Verbose) return;
vladidan@4438: 
duke@435:   CodeBlob_sizes live;
duke@435:   CodeBlob_sizes dead;
duke@435: 
duke@435:   FOR_ALL_BLOBS(p) {
duke@435:     if (!p->is_alive()) {
duke@435:       dead.add(p);
duke@435:     } else {
duke@435:       live.add(p);
duke@435:     }
duke@435:   }
duke@435: 
duke@435:   tty->print_cr("CodeCache:");
duke@435: 
drchase@6680:   tty->print_cr("nmethod dependency checking time %f, per dependent %f", dependentCheckTime.seconds(),
duke@435:                 dependentCheckTime.seconds() / dependentCheckCount);
duke@435: 
duke@435:   if (!live.is_empty()) {
duke@435:     live.print("live");
duke@435:   }
duke@435:   if (!dead.is_empty()) {
duke@435:     dead.print("dead");
duke@435:   }
duke@435: 
duke@435: 
vladidan@4438:   if (WizardMode) {
duke@435:      // print the oop_map usage
duke@435:     int code_size = 0;
duke@435:     int number_of_blobs = 0;
duke@435:     int number_of_oop_maps = 0;
duke@435:     int map_size = 0;
duke@435:     FOR_ALL_BLOBS(p) {
duke@435:       if (p->is_alive()) {
duke@435:         number_of_blobs++;
twisti@2103:         code_size += p->code_size();
duke@435:         OopMapSet* set = p->oop_maps();
duke@435:         if (set != NULL) {
duke@435:           number_of_oop_maps += set->size();
twisti@2103:           map_size           += set->heap_size();
duke@435:         }
duke@435:       }
duke@435:     }
duke@435:     tty->print_cr("OopMaps");
duke@435:     tty->print_cr("  #blobs    = %d", number_of_blobs);
duke@435:     tty->print_cr("  code size = %d", code_size);
duke@435:     tty->print_cr("  #oop_maps = %d", number_of_oop_maps);
duke@435:     tty->print_cr("  map size  = %d", map_size);
duke@435:   }
duke@435: 
vladidan@4438: #endif // !PRODUCT
duke@435: }
duke@435: 
vladidan@4438: void CodeCache::print_summary(outputStream* st, bool detailed) {
vladidan@4438:   size_t total = (_heap->high_boundary() - _heap->low_boundary());
vladidan@4438:   st->print_cr("CodeCache: size=" SIZE_FORMAT "Kb used=" SIZE_FORMAT
neliasso@4952:                "Kb max_used=" SIZE_FORMAT "Kb free=" SIZE_FORMAT "Kb",
vladidan@4438:                total/K, (total - unallocated_capacity())/K,
neliasso@4952:                maxCodeCacheUsed/K, unallocated_capacity()/K);
never@2262: 
vladidan@4438:   if (detailed) {
vladidan@4438:     st->print_cr(" bounds [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT "]",
drchase@6680:                  p2i(_heap->low_boundary()),
drchase@6680:                  p2i(_heap->high()),
drchase@6680:                  p2i(_heap->high_boundary()));
vladidan@4438:     st->print_cr(" total_blobs=" UINT32_FORMAT " nmethods=" UINT32_FORMAT
vladidan@4438:                  " adapters=" UINT32_FORMAT,
vladidan@4438:                  nof_blobs(), nof_nmethods(), nof_adapters());
vladidan@4438:     st->print_cr(" compilation: %s", CompileBroker::should_compile_new_jobs() ?
vladidan@4438:                  "enabled" : Arguments::mode() == Arguments::_int ?
vladidan@4438:                  "disabled (interpreter mode)" :
vladidan@4438:                  "disabled (not enough contiguous free space left)");
vladidan@4438:   }
never@2262: }
kvn@2635: 
kvn@2635: void CodeCache::log_state(outputStream* st) {
kvn@2635:   st->print(" total_blobs='" UINT32_FORMAT "' nmethods='" UINT32_FORMAT "'"
neliasso@4952:             " adapters='" UINT32_FORMAT "' free_code_cache='" SIZE_FORMAT "'",
kvn@2635:             nof_blobs(), nof_nmethods(), nof_adapters(),
neliasso@4952:             unallocated_capacity());
kvn@2635: }
never@2739: