Mercurial > jdk8-mips64-public > hotspot / file revision
src/share/vm/code/codeCache.cpp@2c6ef90f030a
src/share/vm/code/codeCache.cpp
Mon, 07 Jul 2014 10:12:40 +0200
- author
- stefank
- date
- Mon, 07 Jul 2014 10:12:40 +0200
- changeset 6992
- 2c6ef90f030a
- parent 6991
- 882004b9e7e1
- child 7146
- aff6ccb506cb
- permissions
- -rw-r--r--
8049421: G1 Class Unloading after completing a concurrent mark cycle
Reviewed-by: tschatzl, ehelin, brutisso, coleenp, roland, iveresov
Contributed-by: stefan.karlsson@oracle.com, mikael.gerdin@oracle.com
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 */
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"
51 // Helper class for printing in CodeCache
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;
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 }
80 int total() { return total_size; }
81 bool is_empty() { return count == 0; }
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 }
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();
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 };
118 // CodeCache implementation
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;
128 int CodeCache::_codemem_full_count = 0;
130 CodeBlob* CodeCache::first() {
131 assert_locked_or_safepoint(CodeCache_lock);
132 return (CodeBlob*)_heap->first();
133 }
136 CodeBlob* CodeCache::next(CodeBlob* cb) {
137 assert_locked_or_safepoint(CodeCache_lock);
138 return (CodeBlob*)_heap->next(cb);
139 }
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 }
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 }
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 }
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 }
173 static size_t maxCodeCacheUsed = 0;
175 CodeBlob* CodeCache::allocate(int size, bool is_critical) {
176 // Do not seize the CodeCache lock here--if the caller has not
177 // already done so, we are going to lose bigtime, since the code
178 // cache will contain a garbage CodeBlob until the caller can
179 // run the constructor for the CodeBlob subclass he is busy
180 // instantiating.
181 guarantee(size >= 0, "allocation request must be reasonable");
182 assert_locked_or_safepoint(CodeCache_lock);
183 CodeBlob* cb = NULL;
184 _number_of_blobs++;
185 while (true) {
186 cb = (CodeBlob*)_heap->allocate(size, is_critical);
187 if (cb != NULL) break;
188 if (!_heap->expand_by(CodeCacheExpansionSize)) {
189 // Expansion failed
190 return NULL;
191 }
192 if (PrintCodeCacheExtension) {
193 ResourceMark rm;
194 tty->print_cr("code cache extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (" SSIZE_FORMAT " bytes)",
195 (intptr_t)_heap->low_boundary(), (intptr_t)_heap->high(),
196 (address)_heap->high() - (address)_heap->low_boundary());
197 }
198 }
199 maxCodeCacheUsed = MAX2(maxCodeCacheUsed, ((address)_heap->high_boundary() -
200 (address)_heap->low_boundary()) - unallocated_capacity());
201 verify_if_often();
202 print_trace("allocation", cb, size);
203 return cb;
204 }
206 void CodeCache::free(CodeBlob* cb) {
207 assert_locked_or_safepoint(CodeCache_lock);
208 verify_if_often();
210 print_trace("free", cb);
211 if (cb->is_nmethod()) {
212 _number_of_nmethods--;
213 if (((nmethod *)cb)->has_dependencies()) {
214 _number_of_nmethods_with_dependencies--;
215 }
216 }
217 if (cb->is_adapter_blob()) {
218 _number_of_adapters--;
219 }
220 _number_of_blobs--;
222 _heap->deallocate(cb);
224 verify_if_often();
225 assert(_number_of_blobs >= 0, "sanity check");
226 }
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 }
242 // flush the hardware I-cache
243 ICache::invalidate_range(cb->content_begin(), cb->content_size());
244 }
247 void CodeCache::flush() {
248 assert_locked_or_safepoint(CodeCache_lock);
249 Unimplemented();
250 }
253 // Iteration over CodeBlobs
255 #define FOR_ALL_BLOBS(var) for (CodeBlob *var = first() ; var != NULL; var = next(var) )
256 #define FOR_ALL_ALIVE_BLOBS(var) for (CodeBlob *var = alive(first()); var != NULL; var = alive(next(var)))
257 #define FOR_ALL_ALIVE_NMETHODS(var) for (nmethod *var = alive_nmethod(first()); var != NULL; var = alive_nmethod(next(var)))
260 bool CodeCache::contains(void *p) {
261 // It should be ok to call contains without holding a lock
262 return _heap->contains(p);
263 }
266 // This method is safe to call without holding the CodeCache_lock, as long as a dead codeblob is not
267 // looked up (i.e., one that has been marked for deletion). It only dependes on the _segmap to contain
268 // valid indices, which it will always do, as long as the CodeBlob is not in the process of being recycled.
269 CodeBlob* CodeCache::find_blob(void* start) {
270 CodeBlob* result = find_blob_unsafe(start);
271 if (result == NULL) return NULL;
272 // We could potientially look up non_entrant methods
273 guarantee(!result->is_zombie() || result->is_locked_by_vm() || is_error_reported(), "unsafe access to zombie method");
274 return result;
275 }
277 nmethod* CodeCache::find_nmethod(void* start) {
278 CodeBlob *cb = find_blob(start);
279 assert(cb == NULL || cb->is_nmethod(), "did not find an nmethod");
280 return (nmethod*)cb;
281 }
284 void CodeCache::blobs_do(void f(CodeBlob* nm)) {
285 assert_locked_or_safepoint(CodeCache_lock);
286 FOR_ALL_BLOBS(p) {
287 f(p);
288 }
289 }
292 void CodeCache::nmethods_do(void f(nmethod* nm)) {
293 assert_locked_or_safepoint(CodeCache_lock);
294 FOR_ALL_BLOBS(nm) {
295 if (nm->is_nmethod()) f((nmethod*)nm);
296 }
297 }
299 void CodeCache::alive_nmethods_do(void f(nmethod* nm)) {
300 assert_locked_or_safepoint(CodeCache_lock);
301 FOR_ALL_ALIVE_NMETHODS(nm) {
302 f(nm);
303 }
304 }
306 int CodeCache::alignment_unit() {
307 return (int)_heap->alignment_unit();
308 }
311 int CodeCache::alignment_offset() {
312 return (int)_heap->alignment_offset();
313 }
316 // Mark nmethods for unloading if they contain otherwise unreachable
317 // oops.
318 void CodeCache::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) {
319 assert_locked_or_safepoint(CodeCache_lock);
320 FOR_ALL_ALIVE_NMETHODS(nm) {
321 nm->do_unloading(is_alive, unloading_occurred);
322 }
323 }
325 void CodeCache::blobs_do(CodeBlobClosure* f) {
326 assert_locked_or_safepoint(CodeCache_lock);
327 FOR_ALL_ALIVE_BLOBS(cb) {
328 f->do_code_blob(cb);
330 #ifdef ASSERT
331 if (cb->is_nmethod())
332 ((nmethod*)cb)->verify_scavenge_root_oops();
333 #endif //ASSERT
334 }
335 }
337 // Walk the list of methods which might contain non-perm oops.
338 void CodeCache::scavenge_root_nmethods_do(CodeBlobClosure* f) {
339 assert_locked_or_safepoint(CodeCache_lock);
341 if (UseG1GC) {
342 return;
343 }
345 debug_only(mark_scavenge_root_nmethods());
347 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
348 debug_only(cur->clear_scavenge_root_marked());
349 assert(cur->scavenge_root_not_marked(), "");
350 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
352 bool is_live = (!cur->is_zombie() && !cur->is_unloaded());
353 #ifndef PRODUCT
354 if (TraceScavenge) {
355 cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr();
356 }
357 #endif //PRODUCT
358 if (is_live) {
359 // Perform cur->oops_do(f), maybe just once per nmethod.
360 f->do_code_blob(cur);
361 }
362 }
364 // Check for stray marks.
365 debug_only(verify_perm_nmethods(NULL));
366 }
368 void CodeCache::add_scavenge_root_nmethod(nmethod* nm) {
369 assert_locked_or_safepoint(CodeCache_lock);
371 if (UseG1GC) {
372 return;
373 }
375 nm->set_on_scavenge_root_list();
376 nm->set_scavenge_root_link(_scavenge_root_nmethods);
377 set_scavenge_root_nmethods(nm);
378 print_trace("add_scavenge_root", nm);
379 }
381 void CodeCache::drop_scavenge_root_nmethod(nmethod* nm) {
382 assert_locked_or_safepoint(CodeCache_lock);
384 if (UseG1GC) {
385 return;
386 }
388 print_trace("drop_scavenge_root", nm);
389 nmethod* last = NULL;
390 nmethod* cur = scavenge_root_nmethods();
391 while (cur != NULL) {
392 nmethod* next = cur->scavenge_root_link();
393 if (cur == nm) {
394 if (last != NULL)
395 last->set_scavenge_root_link(next);
396 else set_scavenge_root_nmethods(next);
397 nm->set_scavenge_root_link(NULL);
398 nm->clear_on_scavenge_root_list();
399 return;
400 }
401 last = cur;
402 cur = next;
403 }
404 assert(false, "should have been on list");
405 }
407 void CodeCache::prune_scavenge_root_nmethods() {
408 assert_locked_or_safepoint(CodeCache_lock);
410 if (UseG1GC) {
411 return;
412 }
414 debug_only(mark_scavenge_root_nmethods());
416 nmethod* last = NULL;
417 nmethod* cur = scavenge_root_nmethods();
418 while (cur != NULL) {
419 nmethod* next = cur->scavenge_root_link();
420 debug_only(cur->clear_scavenge_root_marked());
421 assert(cur->scavenge_root_not_marked(), "");
422 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
424 if (!cur->is_zombie() && !cur->is_unloaded()
425 && cur->detect_scavenge_root_oops()) {
426 // Keep it. Advance 'last' to prevent deletion.
427 last = cur;
428 } else {
429 // Prune it from the list, so we don't have to look at it any more.
430 print_trace("prune_scavenge_root", cur);
431 cur->set_scavenge_root_link(NULL);
432 cur->clear_on_scavenge_root_list();
433 if (last != NULL)
434 last->set_scavenge_root_link(next);
435 else set_scavenge_root_nmethods(next);
436 }
437 cur = next;
438 }
440 // Check for stray marks.
441 debug_only(verify_perm_nmethods(NULL));
442 }
444 #ifndef PRODUCT
445 void CodeCache::asserted_non_scavengable_nmethods_do(CodeBlobClosure* f) {
446 if (UseG1GC) {
447 return;
448 }
450 // While we are here, verify the integrity of the list.
451 mark_scavenge_root_nmethods();
452 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
453 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
454 cur->clear_scavenge_root_marked();
455 }
456 verify_perm_nmethods(f);
457 }
459 // Temporarily mark nmethods that are claimed to be on the non-perm list.
460 void CodeCache::mark_scavenge_root_nmethods() {
461 FOR_ALL_ALIVE_BLOBS(cb) {
462 if (cb->is_nmethod()) {
463 nmethod *nm = (nmethod*)cb;
464 assert(nm->scavenge_root_not_marked(), "clean state");
465 if (nm->on_scavenge_root_list())
466 nm->set_scavenge_root_marked();
467 }
468 }
469 }
471 // If the closure is given, run it on the unlisted nmethods.
472 // Also make sure that the effects of mark_scavenge_root_nmethods is gone.
473 void CodeCache::verify_perm_nmethods(CodeBlobClosure* f_or_null) {
474 FOR_ALL_ALIVE_BLOBS(cb) {
475 bool call_f = (f_or_null != NULL);
476 if (cb->is_nmethod()) {
477 nmethod *nm = (nmethod*)cb;
478 assert(nm->scavenge_root_not_marked(), "must be already processed");
479 if (nm->on_scavenge_root_list())
480 call_f = false; // don't show this one to the client
481 nm->verify_scavenge_root_oops();
482 } else {
483 call_f = false; // not an nmethod
484 }
485 if (call_f) f_or_null->do_code_blob(cb);
486 }
487 }
488 #endif //PRODUCT
490 void CodeCache::verify_clean_inline_caches() {
491 #ifdef ASSERT
492 FOR_ALL_ALIVE_BLOBS(cb) {
493 if (cb->is_nmethod()) {
494 nmethod* nm = (nmethod*)cb;
495 assert(!nm->is_unloaded(), "Tautology");
496 nm->verify_clean_inline_caches();
497 nm->verify();
498 }
499 }
500 #endif
501 }
503 void CodeCache::verify_icholder_relocations() {
504 #ifdef ASSERT
505 // make sure that we aren't leaking icholders
506 int count = 0;
507 FOR_ALL_BLOBS(cb) {
508 if (cb->is_nmethod()) {
509 nmethod* nm = (nmethod*)cb;
510 count += nm->verify_icholder_relocations();
511 }
512 }
514 assert(count + InlineCacheBuffer::pending_icholder_count() + CompiledICHolder::live_not_claimed_count() ==
515 CompiledICHolder::live_count(), "must agree");
516 #endif
517 }
519 void CodeCache::gc_prologue() {
520 }
522 void CodeCache::gc_epilogue() {
523 assert_locked_or_safepoint(CodeCache_lock);
524 FOR_ALL_ALIVE_BLOBS(cb) {
525 if (cb->is_nmethod()) {
526 nmethod *nm = (nmethod*)cb;
527 assert(!nm->is_unloaded(), "Tautology");
528 if (needs_cache_clean()) {
529 nm->cleanup_inline_caches();
530 }
531 DEBUG_ONLY(nm->verify());
532 DEBUG_ONLY(nm->verify_oop_relocations());
533 }
534 }
535 set_needs_cache_clean(false);
536 prune_scavenge_root_nmethods();
538 verify_icholder_relocations();
539 }
541 void CodeCache::verify_oops() {
542 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
543 VerifyOopClosure voc;
544 FOR_ALL_ALIVE_BLOBS(cb) {
545 if (cb->is_nmethod()) {
546 nmethod *nm = (nmethod*)cb;
547 nm->oops_do(&voc);
548 nm->verify_oop_relocations();
549 }
550 }
551 }
554 address CodeCache::first_address() {
555 assert_locked_or_safepoint(CodeCache_lock);
556 return (address)_heap->low_boundary();
557 }
560 address CodeCache::last_address() {
561 assert_locked_or_safepoint(CodeCache_lock);
562 return (address)_heap->high();
563 }
565 /**
566 * Returns the reverse free ratio. E.g., if 25% (1/4) of the code cache
567 * is free, reverse_free_ratio() returns 4.
568 */
569 double CodeCache::reverse_free_ratio() {
570 double unallocated_capacity = (double)(CodeCache::unallocated_capacity() - CodeCacheMinimumFreeSpace);
571 double max_capacity = (double)CodeCache::max_capacity();
572 return max_capacity / unallocated_capacity;
573 }
575 void icache_init();
577 void CodeCache::initialize() {
578 assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points");
579 #ifdef COMPILER2
580 assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment, "CodeCacheSegmentSize must be large enough to align inner loops");
581 #endif
582 assert(CodeCacheSegmentSize >= sizeof(jdouble), "CodeCacheSegmentSize must be large enough to align constants");
583 // This was originally just a check of the alignment, causing failure, instead, round
584 // the code cache to the page size. In particular, Solaris is moving to a larger
585 // default page size.
586 CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size());
587 InitialCodeCacheSize = round_to(InitialCodeCacheSize, os::vm_page_size());
588 ReservedCodeCacheSize = round_to(ReservedCodeCacheSize, os::vm_page_size());
589 if (!_heap->reserve(ReservedCodeCacheSize, InitialCodeCacheSize, CodeCacheSegmentSize)) {
590 vm_exit_during_initialization("Could not reserve enough space for code cache");
591 }
593 MemoryService::add_code_heap_memory_pool(_heap);
595 // Initialize ICache flush mechanism
596 // This service is needed for os::register_code_area
597 icache_init();
599 // Give OS a chance to register generated code area.
600 // This is used on Windows 64 bit platforms to register
601 // Structured Exception Handlers for our generated code.
602 os::register_code_area(_heap->low_boundary(), _heap->high_boundary());
603 }
606 void codeCache_init() {
607 CodeCache::initialize();
608 }
610 //------------------------------------------------------------------------------------------------
612 int CodeCache::number_of_nmethods_with_dependencies() {
613 return _number_of_nmethods_with_dependencies;
614 }
616 void CodeCache::clear_inline_caches() {
617 assert_locked_or_safepoint(CodeCache_lock);
618 FOR_ALL_ALIVE_NMETHODS(nm) {
619 nm->clear_inline_caches();
620 }
621 }
623 #ifndef PRODUCT
624 // used to keep track of how much time is spent in mark_for_deoptimization
625 static elapsedTimer dependentCheckTime;
626 static int dependentCheckCount = 0;
627 #endif // PRODUCT
630 int CodeCache::mark_for_deoptimization(DepChange& changes) {
631 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
633 #ifndef PRODUCT
634 dependentCheckTime.start();
635 dependentCheckCount++;
636 #endif // PRODUCT
638 int number_of_marked_CodeBlobs = 0;
640 // search the hierarchy looking for nmethods which are affected by the loading of this class
642 // then search the interfaces this class implements looking for nmethods
643 // which might be dependent of the fact that an interface only had one
644 // implementor.
646 { No_Safepoint_Verifier nsv;
647 for (DepChange::ContextStream str(changes, nsv); str.next(); ) {
648 Klass* d = str.klass();
649 number_of_marked_CodeBlobs += InstanceKlass::cast(d)->mark_dependent_nmethods(changes);
650 }
651 }
653 if (VerifyDependencies) {
654 // Turn off dependency tracing while actually testing deps.
655 NOT_PRODUCT( FlagSetting fs(TraceDependencies, false) );
656 FOR_ALL_ALIVE_NMETHODS(nm) {
657 if (!nm->is_marked_for_deoptimization() &&
658 nm->check_all_dependencies()) {
659 ResourceMark rm;
660 tty->print_cr("Should have been marked for deoptimization:");
661 changes.print();
662 nm->print();
663 nm->print_dependencies();
664 }
665 }
666 }
668 #ifndef PRODUCT
669 dependentCheckTime.stop();
670 #endif // PRODUCT
672 return number_of_marked_CodeBlobs;
673 }
676 #ifdef HOTSWAP
677 int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) {
678 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
679 int number_of_marked_CodeBlobs = 0;
681 // Deoptimize all methods of the evolving class itself
682 Array<Method*>* old_methods = dependee->methods();
683 for (int i = 0; i < old_methods->length(); i++) {
684 ResourceMark rm;
685 Method* old_method = old_methods->at(i);
686 nmethod *nm = old_method->code();
687 if (nm != NULL) {
688 nm->mark_for_deoptimization();
689 number_of_marked_CodeBlobs++;
690 }
691 }
693 FOR_ALL_ALIVE_NMETHODS(nm) {
694 if (nm->is_marked_for_deoptimization()) {
695 // ...Already marked in the previous pass; don't count it again.
696 } else if (nm->is_evol_dependent_on(dependee())) {
697 ResourceMark rm;
698 nm->mark_for_deoptimization();
699 number_of_marked_CodeBlobs++;
700 } else {
701 // flush caches in case they refer to a redefined Method*
702 nm->clear_inline_caches();
703 }
704 }
706 return number_of_marked_CodeBlobs;
707 }
708 #endif // HOTSWAP
711 // Deoptimize all methods
712 void CodeCache::mark_all_nmethods_for_deoptimization() {
713 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
714 FOR_ALL_ALIVE_NMETHODS(nm) {
715 nm->mark_for_deoptimization();
716 }
717 }
720 int CodeCache::mark_for_deoptimization(Method* dependee) {
721 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
722 int number_of_marked_CodeBlobs = 0;
724 FOR_ALL_ALIVE_NMETHODS(nm) {
725 if (nm->is_dependent_on_method(dependee)) {
726 ResourceMark rm;
727 nm->mark_for_deoptimization();
728 number_of_marked_CodeBlobs++;
729 }
730 }
732 return number_of_marked_CodeBlobs;
733 }
735 void CodeCache::make_marked_nmethods_zombies() {
736 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint");
737 FOR_ALL_ALIVE_NMETHODS(nm) {
738 if (nm->is_marked_for_deoptimization()) {
740 // If the nmethod has already been made non-entrant and it can be converted
741 // then zombie it now. Otherwise make it non-entrant and it will eventually
742 // be zombied when it is no longer seen on the stack. Note that the nmethod
743 // might be "entrant" and not on the stack and so could be zombied immediately
744 // but we can't tell because we don't track it on stack until it becomes
745 // non-entrant.
747 if (nm->is_not_entrant() && nm->can_not_entrant_be_converted()) {
748 nm->make_zombie();
749 } else {
750 nm->make_not_entrant();
751 }
752 }
753 }
754 }
756 void CodeCache::make_marked_nmethods_not_entrant() {
757 assert_locked_or_safepoint(CodeCache_lock);
758 FOR_ALL_ALIVE_NMETHODS(nm) {
759 if (nm->is_marked_for_deoptimization()) {
760 nm->make_not_entrant();
761 }
762 }
763 }
765 void CodeCache::verify() {
766 _heap->verify();
767 FOR_ALL_ALIVE_BLOBS(p) {
768 p->verify();
769 }
770 }
772 void CodeCache::report_codemem_full() {
773 _codemem_full_count++;
774 EventCodeCacheFull event;
775 if (event.should_commit()) {
776 event.set_startAddress((u8)low_bound());
777 event.set_commitedTopAddress((u8)high());
778 event.set_reservedTopAddress((u8)high_bound());
779 event.set_entryCount(nof_blobs());
780 event.set_methodCount(nof_nmethods());
781 event.set_adaptorCount(nof_adapters());
782 event.set_unallocatedCapacity(unallocated_capacity()/K);
783 event.set_fullCount(_codemem_full_count);
784 event.commit();
785 }
786 }
788 //------------------------------------------------------------------------------------------------
789 // Non-product version
791 #ifndef PRODUCT
793 void CodeCache::verify_if_often() {
794 if (VerifyCodeCacheOften) {
795 _heap->verify();
796 }
797 }
799 void CodeCache::print_trace(const char* event, CodeBlob* cb, int size) {
800 if (PrintCodeCache2) { // Need to add a new flag
801 ResourceMark rm;
802 if (size == 0) size = cb->size();
803 tty->print_cr("CodeCache %s: addr: " INTPTR_FORMAT ", size: 0x%x", event, p2i(cb), size);
804 }
805 }
807 void CodeCache::print_internals() {
808 int nmethodCount = 0;
809 int runtimeStubCount = 0;
810 int adapterCount = 0;
811 int deoptimizationStubCount = 0;
812 int uncommonTrapStubCount = 0;
813 int bufferBlobCount = 0;
814 int total = 0;
815 int nmethodAlive = 0;
816 int nmethodNotEntrant = 0;
817 int nmethodZombie = 0;
818 int nmethodUnloaded = 0;
819 int nmethodJava = 0;
820 int nmethodNative = 0;
821 int maxCodeSize = 0;
822 ResourceMark rm;
824 CodeBlob *cb;
825 for (cb = first(); cb != NULL; cb = next(cb)) {
826 total++;
827 if (cb->is_nmethod()) {
828 nmethod* nm = (nmethod*)cb;
830 if (Verbose && nm->method() != NULL) {
831 ResourceMark rm;
832 char *method_name = nm->method()->name_and_sig_as_C_string();
833 tty->print("%s", method_name);
834 if(nm->is_alive()) { tty->print_cr(" alive"); }
835 if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); }
836 if(nm->is_zombie()) { tty->print_cr(" zombie"); }
837 }
839 nmethodCount++;
841 if(nm->is_alive()) { nmethodAlive++; }
842 if(nm->is_not_entrant()) { nmethodNotEntrant++; }
843 if(nm->is_zombie()) { nmethodZombie++; }
844 if(nm->is_unloaded()) { nmethodUnloaded++; }
845 if(nm->is_native_method()) { nmethodNative++; }
847 if(nm->method() != NULL && nm->is_java_method()) {
848 nmethodJava++;
849 if (nm->insts_size() > maxCodeSize) {
850 maxCodeSize = nm->insts_size();
851 }
852 }
853 } else if (cb->is_runtime_stub()) {
854 runtimeStubCount++;
855 } else if (cb->is_deoptimization_stub()) {
856 deoptimizationStubCount++;
857 } else if (cb->is_uncommon_trap_stub()) {
858 uncommonTrapStubCount++;
859 } else if (cb->is_adapter_blob()) {
860 adapterCount++;
861 } else if (cb->is_buffer_blob()) {
862 bufferBlobCount++;
863 }
864 }
866 int bucketSize = 512;
867 int bucketLimit = maxCodeSize / bucketSize + 1;
868 int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode);
869 memset(buckets,0,sizeof(int) * bucketLimit);
871 for (cb = first(); cb != NULL; cb = next(cb)) {
872 if (cb->is_nmethod()) {
873 nmethod* nm = (nmethod*)cb;
874 if(nm->is_java_method()) {
875 buckets[nm->insts_size() / bucketSize]++;
876 }
877 }
878 }
879 tty->print_cr("Code Cache Entries (total of %d)",total);
880 tty->print_cr("-------------------------------------------------");
881 tty->print_cr("nmethods: %d",nmethodCount);
882 tty->print_cr("\talive: %d",nmethodAlive);
883 tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant);
884 tty->print_cr("\tzombie: %d",nmethodZombie);
885 tty->print_cr("\tunloaded: %d",nmethodUnloaded);
886 tty->print_cr("\tjava: %d",nmethodJava);
887 tty->print_cr("\tnative: %d",nmethodNative);
888 tty->print_cr("runtime_stubs: %d",runtimeStubCount);
889 tty->print_cr("adapters: %d",adapterCount);
890 tty->print_cr("buffer blobs: %d",bufferBlobCount);
891 tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount);
892 tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount);
893 tty->print_cr("\nnmethod size distribution (non-zombie java)");
894 tty->print_cr("-------------------------------------------------");
896 for(int i=0; i<bucketLimit; i++) {
897 if(buckets[i] != 0) {
898 tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize);
899 tty->fill_to(40);
900 tty->print_cr("%d",buckets[i]);
901 }
902 }
904 FREE_C_HEAP_ARRAY(int, buckets, mtCode);
905 }
907 #endif // !PRODUCT
909 void CodeCache::print() {
910 print_summary(tty);
912 #ifndef PRODUCT
913 if (!Verbose) return;
915 CodeBlob_sizes live;
916 CodeBlob_sizes dead;
918 FOR_ALL_BLOBS(p) {
919 if (!p->is_alive()) {
920 dead.add(p);
921 } else {
922 live.add(p);
923 }
924 }
926 tty->print_cr("CodeCache:");
928 tty->print_cr("nmethod dependency checking time %f, per dependent %f", dependentCheckTime.seconds(),
929 dependentCheckTime.seconds() / dependentCheckCount);
931 if (!live.is_empty()) {
932 live.print("live");
933 }
934 if (!dead.is_empty()) {
935 dead.print("dead");
936 }
939 if (WizardMode) {
940 // print the oop_map usage
941 int code_size = 0;
942 int number_of_blobs = 0;
943 int number_of_oop_maps = 0;
944 int map_size = 0;
945 FOR_ALL_BLOBS(p) {
946 if (p->is_alive()) {
947 number_of_blobs++;
948 code_size += p->code_size();
949 OopMapSet* set = p->oop_maps();
950 if (set != NULL) {
951 number_of_oop_maps += set->size();
952 map_size += set->heap_size();
953 }
954 }
955 }
956 tty->print_cr("OopMaps");
957 tty->print_cr(" #blobs = %d", number_of_blobs);
958 tty->print_cr(" code size = %d", code_size);
959 tty->print_cr(" #oop_maps = %d", number_of_oop_maps);
960 tty->print_cr(" map size = %d", map_size);
961 }
963 #endif // !PRODUCT
964 }
966 void CodeCache::print_summary(outputStream* st, bool detailed) {
967 size_t total = (_heap->high_boundary() - _heap->low_boundary());
968 st->print_cr("CodeCache: size=" SIZE_FORMAT "Kb used=" SIZE_FORMAT
969 "Kb max_used=" SIZE_FORMAT "Kb free=" SIZE_FORMAT "Kb",
970 total/K, (total - unallocated_capacity())/K,
971 maxCodeCacheUsed/K, unallocated_capacity()/K);
973 if (detailed) {
974 st->print_cr(" bounds [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT "]",
975 p2i(_heap->low_boundary()),
976 p2i(_heap->high()),
977 p2i(_heap->high_boundary()));
978 st->print_cr(" total_blobs=" UINT32_FORMAT " nmethods=" UINT32_FORMAT
979 " adapters=" UINT32_FORMAT,
980 nof_blobs(), nof_nmethods(), nof_adapters());
981 st->print_cr(" compilation: %s", CompileBroker::should_compile_new_jobs() ?
982 "enabled" : Arguments::mode() == Arguments::_int ?
983 "disabled (interpreter mode)" :
984 "disabled (not enough contiguous free space left)");
985 }
986 }
988 void CodeCache::log_state(outputStream* st) {
989 st->print(" total_blobs='" UINT32_FORMAT "' nmethods='" UINT32_FORMAT "'"
990 " adapters='" UINT32_FORMAT "' free_code_cache='" SIZE_FORMAT "'",
991 nof_blobs(), nof_nmethods(), nof_adapters(),
992 unallocated_capacity());
993 }
