Thu, 19 Mar 2009 09:13:24 -0700
Merge
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_codeCache.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | // Helper class for printing in CodeCache |
duke@435 | 29 | |
duke@435 | 30 | class CodeBlob_sizes { |
duke@435 | 31 | private: |
duke@435 | 32 | int count; |
duke@435 | 33 | int total_size; |
duke@435 | 34 | int header_size; |
duke@435 | 35 | int code_size; |
duke@435 | 36 | int stub_size; |
duke@435 | 37 | int relocation_size; |
duke@435 | 38 | int scopes_oop_size; |
duke@435 | 39 | int scopes_data_size; |
duke@435 | 40 | int scopes_pcs_size; |
duke@435 | 41 | |
duke@435 | 42 | public: |
duke@435 | 43 | CodeBlob_sizes() { |
duke@435 | 44 | count = 0; |
duke@435 | 45 | total_size = 0; |
duke@435 | 46 | header_size = 0; |
duke@435 | 47 | code_size = 0; |
duke@435 | 48 | stub_size = 0; |
duke@435 | 49 | relocation_size = 0; |
duke@435 | 50 | scopes_oop_size = 0; |
duke@435 | 51 | scopes_data_size = 0; |
duke@435 | 52 | scopes_pcs_size = 0; |
duke@435 | 53 | } |
duke@435 | 54 | |
duke@435 | 55 | int total() { return total_size; } |
duke@435 | 56 | bool is_empty() { return count == 0; } |
duke@435 | 57 | |
duke@435 | 58 | void print(const char* title) { |
duke@435 | 59 | tty->print_cr(" #%d %s = %dK (hdr %d%%, loc %d%%, code %d%%, stub %d%%, [oops %d%%, data %d%%, pcs %d%%])", |
duke@435 | 60 | count, |
duke@435 | 61 | title, |
duke@435 | 62 | total() / K, |
duke@435 | 63 | header_size * 100 / total_size, |
duke@435 | 64 | relocation_size * 100 / total_size, |
duke@435 | 65 | code_size * 100 / total_size, |
duke@435 | 66 | stub_size * 100 / total_size, |
duke@435 | 67 | scopes_oop_size * 100 / total_size, |
duke@435 | 68 | scopes_data_size * 100 / total_size, |
duke@435 | 69 | scopes_pcs_size * 100 / total_size); |
duke@435 | 70 | } |
duke@435 | 71 | |
duke@435 | 72 | void add(CodeBlob* cb) { |
duke@435 | 73 | count++; |
duke@435 | 74 | total_size += cb->size(); |
duke@435 | 75 | header_size += cb->header_size(); |
duke@435 | 76 | relocation_size += cb->relocation_size(); |
duke@435 | 77 | scopes_oop_size += cb->oops_size(); |
duke@435 | 78 | if (cb->is_nmethod()) { |
duke@435 | 79 | nmethod *nm = (nmethod*)cb; |
duke@435 | 80 | code_size += nm->code_size(); |
duke@435 | 81 | stub_size += nm->stub_size(); |
duke@435 | 82 | |
duke@435 | 83 | scopes_data_size += nm->scopes_data_size(); |
duke@435 | 84 | scopes_pcs_size += nm->scopes_pcs_size(); |
duke@435 | 85 | } else { |
duke@435 | 86 | code_size += cb->instructions_size(); |
duke@435 | 87 | } |
duke@435 | 88 | } |
duke@435 | 89 | }; |
duke@435 | 90 | |
duke@435 | 91 | |
duke@435 | 92 | // CodeCache implementation |
duke@435 | 93 | |
duke@435 | 94 | CodeHeap * CodeCache::_heap = new CodeHeap(); |
duke@435 | 95 | int CodeCache::_number_of_blobs = 0; |
duke@435 | 96 | int CodeCache::_number_of_nmethods_with_dependencies = 0; |
duke@435 | 97 | bool CodeCache::_needs_cache_clean = false; |
duke@435 | 98 | |
duke@435 | 99 | |
duke@435 | 100 | CodeBlob* CodeCache::first() { |
duke@435 | 101 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 102 | return (CodeBlob*)_heap->first(); |
duke@435 | 103 | } |
duke@435 | 104 | |
duke@435 | 105 | |
duke@435 | 106 | CodeBlob* CodeCache::next(CodeBlob* cb) { |
duke@435 | 107 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 108 | return (CodeBlob*)_heap->next(cb); |
duke@435 | 109 | } |
duke@435 | 110 | |
duke@435 | 111 | |
duke@435 | 112 | CodeBlob* CodeCache::alive(CodeBlob *cb) { |
duke@435 | 113 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 114 | while (cb != NULL && !cb->is_alive()) cb = next(cb); |
duke@435 | 115 | return cb; |
duke@435 | 116 | } |
duke@435 | 117 | |
duke@435 | 118 | |
duke@435 | 119 | nmethod* CodeCache::alive_nmethod(CodeBlob* cb) { |
duke@435 | 120 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 121 | while (cb != NULL && (!cb->is_alive() || !cb->is_nmethod())) cb = next(cb); |
duke@435 | 122 | return (nmethod*)cb; |
duke@435 | 123 | } |
duke@435 | 124 | |
duke@435 | 125 | |
duke@435 | 126 | CodeBlob* CodeCache::allocate(int size) { |
duke@435 | 127 | // Do not seize the CodeCache lock here--if the caller has not |
duke@435 | 128 | // already done so, we are going to lose bigtime, since the code |
duke@435 | 129 | // cache will contain a garbage CodeBlob until the caller can |
duke@435 | 130 | // run the constructor for the CodeBlob subclass he is busy |
duke@435 | 131 | // instantiating. |
duke@435 | 132 | guarantee(size >= 0, "allocation request must be reasonable"); |
duke@435 | 133 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 134 | CodeBlob* cb = NULL; |
duke@435 | 135 | _number_of_blobs++; |
duke@435 | 136 | while (true) { |
duke@435 | 137 | cb = (CodeBlob*)_heap->allocate(size); |
duke@435 | 138 | if (cb != NULL) break; |
duke@435 | 139 | if (!_heap->expand_by(CodeCacheExpansionSize)) { |
duke@435 | 140 | // Expansion failed |
duke@435 | 141 | return NULL; |
duke@435 | 142 | } |
duke@435 | 143 | if (PrintCodeCacheExtension) { |
duke@435 | 144 | ResourceMark rm; |
duke@435 | 145 | tty->print_cr("code cache extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (%d bytes)", |
duke@435 | 146 | (intptr_t)_heap->begin(), (intptr_t)_heap->end(), |
duke@435 | 147 | (address)_heap->end() - (address)_heap->begin()); |
duke@435 | 148 | } |
duke@435 | 149 | } |
duke@435 | 150 | verify_if_often(); |
duke@435 | 151 | if (PrintCodeCache2) { // Need to add a new flag |
duke@435 | 152 | ResourceMark rm; |
duke@435 | 153 | tty->print_cr("CodeCache allocation: addr: " INTPTR_FORMAT ", size: 0x%x\n", cb, size); |
duke@435 | 154 | } |
duke@435 | 155 | return cb; |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | void CodeCache::free(CodeBlob* cb) { |
duke@435 | 159 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 160 | verify_if_often(); |
duke@435 | 161 | |
duke@435 | 162 | if (PrintCodeCache2) { // Need to add a new flag |
duke@435 | 163 | ResourceMark rm; |
duke@435 | 164 | tty->print_cr("CodeCache free: addr: " INTPTR_FORMAT ", size: 0x%x\n", cb, cb->size()); |
duke@435 | 165 | } |
duke@435 | 166 | if (cb->is_nmethod() && ((nmethod *)cb)->has_dependencies()) { |
duke@435 | 167 | _number_of_nmethods_with_dependencies--; |
duke@435 | 168 | } |
duke@435 | 169 | _number_of_blobs--; |
duke@435 | 170 | |
duke@435 | 171 | _heap->deallocate(cb); |
duke@435 | 172 | |
duke@435 | 173 | verify_if_often(); |
duke@435 | 174 | assert(_number_of_blobs >= 0, "sanity check"); |
duke@435 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | |
duke@435 | 178 | void CodeCache::commit(CodeBlob* cb) { |
duke@435 | 179 | // this is called by nmethod::nmethod, which must already own CodeCache_lock |
duke@435 | 180 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 181 | if (cb->is_nmethod() && ((nmethod *)cb)->has_dependencies()) { |
duke@435 | 182 | _number_of_nmethods_with_dependencies++; |
duke@435 | 183 | } |
duke@435 | 184 | // flush the hardware I-cache |
duke@435 | 185 | ICache::invalidate_range(cb->instructions_begin(), cb->instructions_size()); |
duke@435 | 186 | } |
duke@435 | 187 | |
duke@435 | 188 | |
duke@435 | 189 | void CodeCache::flush() { |
duke@435 | 190 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 191 | Unimplemented(); |
duke@435 | 192 | } |
duke@435 | 193 | |
duke@435 | 194 | |
duke@435 | 195 | // Iteration over CodeBlobs |
duke@435 | 196 | |
duke@435 | 197 | #define FOR_ALL_BLOBS(var) for (CodeBlob *var = first() ; var != NULL; var = next(var) ) |
duke@435 | 198 | #define FOR_ALL_ALIVE_BLOBS(var) for (CodeBlob *var = alive(first()); var != NULL; var = alive(next(var))) |
duke@435 | 199 | #define FOR_ALL_ALIVE_NMETHODS(var) for (nmethod *var = alive_nmethod(first()); var != NULL; var = alive_nmethod(next(var))) |
duke@435 | 200 | |
duke@435 | 201 | |
duke@435 | 202 | bool CodeCache::contains(void *p) { |
duke@435 | 203 | // It should be ok to call contains without holding a lock |
duke@435 | 204 | return _heap->contains(p); |
duke@435 | 205 | } |
duke@435 | 206 | |
duke@435 | 207 | |
duke@435 | 208 | // This method is safe to call without holding the CodeCache_lock, as long as a dead codeblob is not |
duke@435 | 209 | // looked up (i.e., one that has been marked for deletion). It only dependes on the _segmap to contain |
duke@435 | 210 | // valid indices, which it will always do, as long as the CodeBlob is not in the process of being recycled. |
duke@435 | 211 | CodeBlob* CodeCache::find_blob(void* start) { |
duke@435 | 212 | CodeBlob* result = find_blob_unsafe(start); |
duke@435 | 213 | if (result == NULL) return NULL; |
duke@435 | 214 | // We could potientially look up non_entrant methods |
duke@435 | 215 | guarantee(!result->is_zombie() || result->is_locked_by_vm() || is_error_reported(), "unsafe access to zombie method"); |
duke@435 | 216 | return result; |
duke@435 | 217 | } |
duke@435 | 218 | |
duke@435 | 219 | nmethod* CodeCache::find_nmethod(void* start) { |
duke@435 | 220 | CodeBlob *cb = find_blob(start); |
duke@435 | 221 | assert(cb == NULL || cb->is_nmethod(), "did not find an nmethod"); |
duke@435 | 222 | return (nmethod*)cb; |
duke@435 | 223 | } |
duke@435 | 224 | |
duke@435 | 225 | |
duke@435 | 226 | void CodeCache::blobs_do(void f(CodeBlob* nm)) { |
duke@435 | 227 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 228 | FOR_ALL_BLOBS(p) { |
duke@435 | 229 | f(p); |
duke@435 | 230 | } |
duke@435 | 231 | } |
duke@435 | 232 | |
duke@435 | 233 | |
duke@435 | 234 | void CodeCache::nmethods_do(void f(nmethod* nm)) { |
duke@435 | 235 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 236 | FOR_ALL_BLOBS(nm) { |
duke@435 | 237 | if (nm->is_nmethod()) f((nmethod*)nm); |
duke@435 | 238 | } |
duke@435 | 239 | } |
duke@435 | 240 | |
duke@435 | 241 | |
duke@435 | 242 | int CodeCache::alignment_unit() { |
duke@435 | 243 | return (int)_heap->alignment_unit(); |
duke@435 | 244 | } |
duke@435 | 245 | |
duke@435 | 246 | |
duke@435 | 247 | int CodeCache::alignment_offset() { |
duke@435 | 248 | return (int)_heap->alignment_offset(); |
duke@435 | 249 | } |
duke@435 | 250 | |
duke@435 | 251 | |
duke@435 | 252 | // Mark code blobs for unloading if they contain otherwise |
duke@435 | 253 | // unreachable oops. |
duke@435 | 254 | void CodeCache::do_unloading(BoolObjectClosure* is_alive, |
duke@435 | 255 | OopClosure* keep_alive, |
duke@435 | 256 | bool unloading_occurred) { |
duke@435 | 257 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 258 | FOR_ALL_ALIVE_BLOBS(cb) { |
duke@435 | 259 | cb->do_unloading(is_alive, keep_alive, unloading_occurred); |
duke@435 | 260 | } |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | void CodeCache::oops_do(OopClosure* f) { |
duke@435 | 264 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 265 | FOR_ALL_ALIVE_BLOBS(cb) { |
duke@435 | 266 | cb->oops_do(f); |
duke@435 | 267 | } |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | void CodeCache::gc_prologue() { |
duke@435 | 271 | } |
duke@435 | 272 | |
duke@435 | 273 | |
duke@435 | 274 | void CodeCache::gc_epilogue() { |
duke@435 | 275 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 276 | FOR_ALL_ALIVE_BLOBS(cb) { |
duke@435 | 277 | if (cb->is_nmethod()) { |
duke@435 | 278 | nmethod *nm = (nmethod*)cb; |
duke@435 | 279 | assert(!nm->is_unloaded(), "Tautology"); |
duke@435 | 280 | if (needs_cache_clean()) { |
duke@435 | 281 | nm->cleanup_inline_caches(); |
duke@435 | 282 | } |
duke@435 | 283 | debug_only(nm->verify();) |
duke@435 | 284 | } |
duke@435 | 285 | cb->fix_oop_relocations(); |
duke@435 | 286 | } |
duke@435 | 287 | set_needs_cache_clean(false); |
duke@435 | 288 | } |
duke@435 | 289 | |
duke@435 | 290 | |
duke@435 | 291 | address CodeCache::first_address() { |
duke@435 | 292 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 293 | return (address)_heap->begin(); |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | |
duke@435 | 297 | address CodeCache::last_address() { |
duke@435 | 298 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 299 | return (address)_heap->end(); |
duke@435 | 300 | } |
duke@435 | 301 | |
duke@435 | 302 | |
duke@435 | 303 | void icache_init(); |
duke@435 | 304 | |
duke@435 | 305 | void CodeCache::initialize() { |
duke@435 | 306 | assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points"); |
duke@435 | 307 | #ifdef COMPILER2 |
duke@435 | 308 | assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment, "CodeCacheSegmentSize must be large enough to align inner loops"); |
duke@435 | 309 | #endif |
duke@435 | 310 | assert(CodeCacheSegmentSize >= sizeof(jdouble), "CodeCacheSegmentSize must be large enough to align constants"); |
duke@435 | 311 | // This was originally just a check of the alignment, causing failure, instead, round |
duke@435 | 312 | // the code cache to the page size. In particular, Solaris is moving to a larger |
duke@435 | 313 | // default page size. |
duke@435 | 314 | CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size()); |
duke@435 | 315 | InitialCodeCacheSize = round_to(InitialCodeCacheSize, os::vm_page_size()); |
duke@435 | 316 | ReservedCodeCacheSize = round_to(ReservedCodeCacheSize, os::vm_page_size()); |
duke@435 | 317 | if (!_heap->reserve(ReservedCodeCacheSize, InitialCodeCacheSize, CodeCacheSegmentSize)) { |
duke@435 | 318 | vm_exit_during_initialization("Could not reserve enough space for code cache"); |
duke@435 | 319 | } |
duke@435 | 320 | |
duke@435 | 321 | MemoryService::add_code_heap_memory_pool(_heap); |
duke@435 | 322 | |
duke@435 | 323 | // Initialize ICache flush mechanism |
duke@435 | 324 | // This service is needed for os::register_code_area |
duke@435 | 325 | icache_init(); |
duke@435 | 326 | |
duke@435 | 327 | // Give OS a chance to register generated code area. |
duke@435 | 328 | // This is used on Windows 64 bit platforms to register |
duke@435 | 329 | // Structured Exception Handlers for our generated code. |
duke@435 | 330 | os::register_code_area(_heap->low_boundary(), _heap->high_boundary()); |
duke@435 | 331 | } |
duke@435 | 332 | |
duke@435 | 333 | |
duke@435 | 334 | void codeCache_init() { |
duke@435 | 335 | CodeCache::initialize(); |
duke@435 | 336 | } |
duke@435 | 337 | |
duke@435 | 338 | //------------------------------------------------------------------------------------------------ |
duke@435 | 339 | |
duke@435 | 340 | int CodeCache::number_of_nmethods_with_dependencies() { |
duke@435 | 341 | return _number_of_nmethods_with_dependencies; |
duke@435 | 342 | } |
duke@435 | 343 | |
duke@435 | 344 | void CodeCache::clear_inline_caches() { |
duke@435 | 345 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 346 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 347 | nm->clear_inline_caches(); |
duke@435 | 348 | } |
duke@435 | 349 | } |
duke@435 | 350 | |
duke@435 | 351 | #ifndef PRODUCT |
duke@435 | 352 | // used to keep track of how much time is spent in mark_for_deoptimization |
duke@435 | 353 | static elapsedTimer dependentCheckTime; |
duke@435 | 354 | static int dependentCheckCount = 0; |
duke@435 | 355 | #endif // PRODUCT |
duke@435 | 356 | |
duke@435 | 357 | |
duke@435 | 358 | int CodeCache::mark_for_deoptimization(DepChange& changes) { |
duke@435 | 359 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 360 | |
duke@435 | 361 | #ifndef PRODUCT |
duke@435 | 362 | dependentCheckTime.start(); |
duke@435 | 363 | dependentCheckCount++; |
duke@435 | 364 | #endif // PRODUCT |
duke@435 | 365 | |
duke@435 | 366 | int number_of_marked_CodeBlobs = 0; |
duke@435 | 367 | |
duke@435 | 368 | // search the hierarchy looking for nmethods which are affected by the loading of this class |
duke@435 | 369 | |
duke@435 | 370 | // then search the interfaces this class implements looking for nmethods |
duke@435 | 371 | // which might be dependent of the fact that an interface only had one |
duke@435 | 372 | // implementor. |
duke@435 | 373 | |
duke@435 | 374 | { No_Safepoint_Verifier nsv; |
duke@435 | 375 | for (DepChange::ContextStream str(changes, nsv); str.next(); ) { |
duke@435 | 376 | klassOop d = str.klass(); |
duke@435 | 377 | number_of_marked_CodeBlobs += instanceKlass::cast(d)->mark_dependent_nmethods(changes); |
duke@435 | 378 | } |
duke@435 | 379 | } |
duke@435 | 380 | |
duke@435 | 381 | if (VerifyDependencies) { |
duke@435 | 382 | // Turn off dependency tracing while actually testing deps. |
duke@435 | 383 | NOT_PRODUCT( FlagSetting fs(TraceDependencies, false) ); |
duke@435 | 384 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 385 | if (!nm->is_marked_for_deoptimization() && |
duke@435 | 386 | nm->check_all_dependencies()) { |
duke@435 | 387 | ResourceMark rm; |
duke@435 | 388 | tty->print_cr("Should have been marked for deoptimization:"); |
duke@435 | 389 | changes.print(); |
duke@435 | 390 | nm->print(); |
duke@435 | 391 | nm->print_dependencies(); |
duke@435 | 392 | } |
duke@435 | 393 | } |
duke@435 | 394 | } |
duke@435 | 395 | |
duke@435 | 396 | #ifndef PRODUCT |
duke@435 | 397 | dependentCheckTime.stop(); |
duke@435 | 398 | #endif // PRODUCT |
duke@435 | 399 | |
duke@435 | 400 | return number_of_marked_CodeBlobs; |
duke@435 | 401 | } |
duke@435 | 402 | |
duke@435 | 403 | |
duke@435 | 404 | #ifdef HOTSWAP |
duke@435 | 405 | int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) { |
duke@435 | 406 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 407 | int number_of_marked_CodeBlobs = 0; |
duke@435 | 408 | |
duke@435 | 409 | // Deoptimize all methods of the evolving class itself |
duke@435 | 410 | objArrayOop old_methods = dependee->methods(); |
duke@435 | 411 | for (int i = 0; i < old_methods->length(); i++) { |
duke@435 | 412 | ResourceMark rm; |
duke@435 | 413 | methodOop old_method = (methodOop) old_methods->obj_at(i); |
duke@435 | 414 | nmethod *nm = old_method->code(); |
duke@435 | 415 | if (nm != NULL) { |
duke@435 | 416 | nm->mark_for_deoptimization(); |
duke@435 | 417 | number_of_marked_CodeBlobs++; |
duke@435 | 418 | } |
duke@435 | 419 | } |
duke@435 | 420 | |
duke@435 | 421 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 422 | if (nm->is_marked_for_deoptimization()) { |
duke@435 | 423 | // ...Already marked in the previous pass; don't count it again. |
duke@435 | 424 | } else if (nm->is_evol_dependent_on(dependee())) { |
duke@435 | 425 | ResourceMark rm; |
duke@435 | 426 | nm->mark_for_deoptimization(); |
duke@435 | 427 | number_of_marked_CodeBlobs++; |
duke@435 | 428 | } else { |
duke@435 | 429 | // flush caches in case they refer to a redefined methodOop |
duke@435 | 430 | nm->clear_inline_caches(); |
duke@435 | 431 | } |
duke@435 | 432 | } |
duke@435 | 433 | |
duke@435 | 434 | return number_of_marked_CodeBlobs; |
duke@435 | 435 | } |
duke@435 | 436 | #endif // HOTSWAP |
duke@435 | 437 | |
duke@435 | 438 | |
duke@435 | 439 | // Deoptimize all methods |
duke@435 | 440 | void CodeCache::mark_all_nmethods_for_deoptimization() { |
duke@435 | 441 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 442 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 443 | nm->mark_for_deoptimization(); |
duke@435 | 444 | } |
duke@435 | 445 | } |
duke@435 | 446 | |
duke@435 | 447 | |
duke@435 | 448 | int CodeCache::mark_for_deoptimization(methodOop dependee) { |
duke@435 | 449 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 450 | int number_of_marked_CodeBlobs = 0; |
duke@435 | 451 | |
duke@435 | 452 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 453 | if (nm->is_dependent_on_method(dependee)) { |
duke@435 | 454 | ResourceMark rm; |
duke@435 | 455 | nm->mark_for_deoptimization(); |
duke@435 | 456 | number_of_marked_CodeBlobs++; |
duke@435 | 457 | } |
duke@435 | 458 | } |
duke@435 | 459 | |
duke@435 | 460 | return number_of_marked_CodeBlobs; |
duke@435 | 461 | } |
duke@435 | 462 | |
duke@435 | 463 | void CodeCache::make_marked_nmethods_zombies() { |
duke@435 | 464 | assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); |
duke@435 | 465 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 466 | if (nm->is_marked_for_deoptimization()) { |
duke@435 | 467 | |
duke@435 | 468 | // If the nmethod has already been made non-entrant and it can be converted |
duke@435 | 469 | // then zombie it now. Otherwise make it non-entrant and it will eventually |
duke@435 | 470 | // be zombied when it is no longer seen on the stack. Note that the nmethod |
duke@435 | 471 | // might be "entrant" and not on the stack and so could be zombied immediately |
duke@435 | 472 | // but we can't tell because we don't track it on stack until it becomes |
duke@435 | 473 | // non-entrant. |
duke@435 | 474 | |
duke@435 | 475 | if (nm->is_not_entrant() && nm->can_not_entrant_be_converted()) { |
duke@435 | 476 | nm->make_zombie(); |
duke@435 | 477 | } else { |
duke@435 | 478 | nm->make_not_entrant(); |
duke@435 | 479 | } |
duke@435 | 480 | } |
duke@435 | 481 | } |
duke@435 | 482 | } |
duke@435 | 483 | |
duke@435 | 484 | void CodeCache::make_marked_nmethods_not_entrant() { |
duke@435 | 485 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 486 | FOR_ALL_ALIVE_NMETHODS(nm) { |
duke@435 | 487 | if (nm->is_marked_for_deoptimization()) { |
duke@435 | 488 | nm->make_not_entrant(); |
duke@435 | 489 | } |
duke@435 | 490 | } |
duke@435 | 491 | } |
duke@435 | 492 | |
duke@435 | 493 | void CodeCache::verify() { |
duke@435 | 494 | _heap->verify(); |
duke@435 | 495 | FOR_ALL_ALIVE_BLOBS(p) { |
duke@435 | 496 | p->verify(); |
duke@435 | 497 | } |
duke@435 | 498 | } |
duke@435 | 499 | |
duke@435 | 500 | //------------------------------------------------------------------------------------------------ |
duke@435 | 501 | // Non-product version |
duke@435 | 502 | |
duke@435 | 503 | #ifndef PRODUCT |
duke@435 | 504 | |
duke@435 | 505 | void CodeCache::verify_if_often() { |
duke@435 | 506 | if (VerifyCodeCacheOften) { |
duke@435 | 507 | _heap->verify(); |
duke@435 | 508 | } |
duke@435 | 509 | } |
duke@435 | 510 | |
duke@435 | 511 | void CodeCache::print_internals() { |
duke@435 | 512 | int nmethodCount = 0; |
duke@435 | 513 | int runtimeStubCount = 0; |
duke@435 | 514 | int adapterCount = 0; |
duke@435 | 515 | int deoptimizationStubCount = 0; |
duke@435 | 516 | int uncommonTrapStubCount = 0; |
duke@435 | 517 | int bufferBlobCount = 0; |
duke@435 | 518 | int total = 0; |
duke@435 | 519 | int nmethodAlive = 0; |
duke@435 | 520 | int nmethodNotEntrant = 0; |
duke@435 | 521 | int nmethodZombie = 0; |
duke@435 | 522 | int nmethodUnloaded = 0; |
duke@435 | 523 | int nmethodJava = 0; |
duke@435 | 524 | int nmethodNative = 0; |
duke@435 | 525 | int maxCodeSize = 0; |
duke@435 | 526 | ResourceMark rm; |
duke@435 | 527 | |
duke@435 | 528 | CodeBlob *cb; |
duke@435 | 529 | for (cb = first(); cb != NULL; cb = next(cb)) { |
duke@435 | 530 | total++; |
duke@435 | 531 | if (cb->is_nmethod()) { |
duke@435 | 532 | nmethod* nm = (nmethod*)cb; |
duke@435 | 533 | |
duke@435 | 534 | if (Verbose && nm->method() != NULL) { |
duke@435 | 535 | ResourceMark rm; |
duke@435 | 536 | char *method_name = nm->method()->name_and_sig_as_C_string(); |
duke@435 | 537 | tty->print("%s", method_name); |
duke@435 | 538 | if(nm->is_alive()) { tty->print_cr(" alive"); } |
duke@435 | 539 | if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); } |
duke@435 | 540 | if(nm->is_zombie()) { tty->print_cr(" zombie"); } |
duke@435 | 541 | } |
duke@435 | 542 | |
duke@435 | 543 | nmethodCount++; |
duke@435 | 544 | |
duke@435 | 545 | if(nm->is_alive()) { nmethodAlive++; } |
duke@435 | 546 | if(nm->is_not_entrant()) { nmethodNotEntrant++; } |
duke@435 | 547 | if(nm->is_zombie()) { nmethodZombie++; } |
duke@435 | 548 | if(nm->is_unloaded()) { nmethodUnloaded++; } |
duke@435 | 549 | if(nm->is_native_method()) { nmethodNative++; } |
duke@435 | 550 | |
duke@435 | 551 | if(nm->method() != NULL && nm->is_java_method()) { |
duke@435 | 552 | nmethodJava++; |
duke@435 | 553 | if(nm->code_size() > maxCodeSize) { |
duke@435 | 554 | maxCodeSize = nm->code_size(); |
duke@435 | 555 | } |
duke@435 | 556 | } |
duke@435 | 557 | } else if (cb->is_runtime_stub()) { |
duke@435 | 558 | runtimeStubCount++; |
duke@435 | 559 | } else if (cb->is_deoptimization_stub()) { |
duke@435 | 560 | deoptimizationStubCount++; |
duke@435 | 561 | } else if (cb->is_uncommon_trap_stub()) { |
duke@435 | 562 | uncommonTrapStubCount++; |
duke@435 | 563 | } else if (cb->is_adapter_blob()) { |
duke@435 | 564 | adapterCount++; |
duke@435 | 565 | } else if (cb->is_buffer_blob()) { |
duke@435 | 566 | bufferBlobCount++; |
duke@435 | 567 | } |
duke@435 | 568 | } |
duke@435 | 569 | |
duke@435 | 570 | int bucketSize = 512; |
duke@435 | 571 | int bucketLimit = maxCodeSize / bucketSize + 1; |
duke@435 | 572 | int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit); |
duke@435 | 573 | memset(buckets,0,sizeof(int) * bucketLimit); |
duke@435 | 574 | |
duke@435 | 575 | for (cb = first(); cb != NULL; cb = next(cb)) { |
duke@435 | 576 | if (cb->is_nmethod()) { |
duke@435 | 577 | nmethod* nm = (nmethod*)cb; |
duke@435 | 578 | if(nm->is_java_method()) { |
duke@435 | 579 | buckets[nm->code_size() / bucketSize]++; |
duke@435 | 580 | } |
duke@435 | 581 | } |
duke@435 | 582 | } |
duke@435 | 583 | tty->print_cr("Code Cache Entries (total of %d)",total); |
duke@435 | 584 | tty->print_cr("-------------------------------------------------"); |
duke@435 | 585 | tty->print_cr("nmethods: %d",nmethodCount); |
duke@435 | 586 | tty->print_cr("\talive: %d",nmethodAlive); |
duke@435 | 587 | tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant); |
duke@435 | 588 | tty->print_cr("\tzombie: %d",nmethodZombie); |
duke@435 | 589 | tty->print_cr("\tunloaded: %d",nmethodUnloaded); |
duke@435 | 590 | tty->print_cr("\tjava: %d",nmethodJava); |
duke@435 | 591 | tty->print_cr("\tnative: %d",nmethodNative); |
duke@435 | 592 | tty->print_cr("runtime_stubs: %d",runtimeStubCount); |
duke@435 | 593 | tty->print_cr("adapters: %d",adapterCount); |
duke@435 | 594 | tty->print_cr("buffer blobs: %d",bufferBlobCount); |
duke@435 | 595 | tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount); |
duke@435 | 596 | tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount); |
duke@435 | 597 | tty->print_cr("\nnmethod size distribution (non-zombie java)"); |
duke@435 | 598 | tty->print_cr("-------------------------------------------------"); |
duke@435 | 599 | |
duke@435 | 600 | for(int i=0; i<bucketLimit; i++) { |
duke@435 | 601 | if(buckets[i] != 0) { |
duke@435 | 602 | tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize); |
duke@435 | 603 | tty->fill_to(40); |
duke@435 | 604 | tty->print_cr("%d",buckets[i]); |
duke@435 | 605 | } |
duke@435 | 606 | } |
duke@435 | 607 | |
duke@435 | 608 | FREE_C_HEAP_ARRAY(int, buckets); |
duke@435 | 609 | } |
duke@435 | 610 | |
duke@435 | 611 | void CodeCache::print() { |
duke@435 | 612 | CodeBlob_sizes live; |
duke@435 | 613 | CodeBlob_sizes dead; |
duke@435 | 614 | |
duke@435 | 615 | FOR_ALL_BLOBS(p) { |
duke@435 | 616 | if (!p->is_alive()) { |
duke@435 | 617 | dead.add(p); |
duke@435 | 618 | } else { |
duke@435 | 619 | live.add(p); |
duke@435 | 620 | } |
duke@435 | 621 | } |
duke@435 | 622 | |
duke@435 | 623 | tty->print_cr("CodeCache:"); |
duke@435 | 624 | |
duke@435 | 625 | tty->print_cr("nmethod dependency checking time %f", dependentCheckTime.seconds(), |
duke@435 | 626 | dependentCheckTime.seconds() / dependentCheckCount); |
duke@435 | 627 | |
duke@435 | 628 | if (!live.is_empty()) { |
duke@435 | 629 | live.print("live"); |
duke@435 | 630 | } |
duke@435 | 631 | if (!dead.is_empty()) { |
duke@435 | 632 | dead.print("dead"); |
duke@435 | 633 | } |
duke@435 | 634 | |
duke@435 | 635 | |
duke@435 | 636 | if (Verbose) { |
duke@435 | 637 | // print the oop_map usage |
duke@435 | 638 | int code_size = 0; |
duke@435 | 639 | int number_of_blobs = 0; |
duke@435 | 640 | int number_of_oop_maps = 0; |
duke@435 | 641 | int map_size = 0; |
duke@435 | 642 | FOR_ALL_BLOBS(p) { |
duke@435 | 643 | if (p->is_alive()) { |
duke@435 | 644 | number_of_blobs++; |
duke@435 | 645 | code_size += p->instructions_size(); |
duke@435 | 646 | OopMapSet* set = p->oop_maps(); |
duke@435 | 647 | if (set != NULL) { |
duke@435 | 648 | number_of_oop_maps += set->size(); |
duke@435 | 649 | map_size += set->heap_size(); |
duke@435 | 650 | } |
duke@435 | 651 | } |
duke@435 | 652 | } |
duke@435 | 653 | tty->print_cr("OopMaps"); |
duke@435 | 654 | tty->print_cr(" #blobs = %d", number_of_blobs); |
duke@435 | 655 | tty->print_cr(" code size = %d", code_size); |
duke@435 | 656 | tty->print_cr(" #oop_maps = %d", number_of_oop_maps); |
duke@435 | 657 | tty->print_cr(" map size = %d", map_size); |
duke@435 | 658 | } |
duke@435 | 659 | |
duke@435 | 660 | } |
duke@435 | 661 | |
duke@435 | 662 | #endif // PRODUCT |