1 /*
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "code/codeBlob.hpp"
27 #include "code/codeCache.hpp"
28 #include "code/compiledIC.hpp"
29 #include "code/dependencies.hpp"
30 #include "code/icBuffer.hpp"
31 #include "code/nmethod.hpp"
32 #include "code/pcDesc.hpp"
33 #include "compiler/compileBroker.hpp"
34 #include "gc_implementation/shared/markSweep.hpp"
35 #include "memory/allocation.inline.hpp"
36 #include "memory/gcLocker.hpp"
37 #include "memory/iterator.hpp"
38 #include "memory/resourceArea.hpp"
39 #include "oops/method.hpp"
40 #include "oops/objArrayOop.hpp"
41 #include "oops/oop.inline.hpp"
42 #include "runtime/handles.inline.hpp"
43 #include "runtime/arguments.hpp"
44 #include "runtime/icache.hpp"
45 #include "runtime/java.hpp"
46 #include "runtime/mutexLocker.hpp"
47 #include "services/memoryService.hpp"
48 #include "trace/tracing.hpp"
49 #include "utilities/xmlstream.hpp"
50
51 // Helper class for printing in CodeCache
52
53 class CodeBlob_sizes {
54 private:
55 int count;
56 int total_size;
57 int header_size;
58 int code_size;
59 int stub_size;
60 int relocation_size;
61 int scopes_oop_size;
62 int scopes_metadata_size;
63 int scopes_data_size;
64 int scopes_pcs_size;
65
66 public:
67 CodeBlob_sizes() {
68 count = 0;
69 total_size = 0;
70 header_size = 0;
71 code_size = 0;
72 stub_size = 0;
73 relocation_size = 0;
74 scopes_oop_size = 0;
75 scopes_metadata_size = 0;
76 scopes_data_size = 0;
77 scopes_pcs_size = 0;
78 }
79
80 int total() { return total_size; }
81 bool is_empty() { return count == 0; }
82
83 void print(const char* title) {
84 tty->print_cr(" #%d %s = %dK (hdr %d%%, loc %d%%, code %d%%, stub %d%%, [oops %d%%, data %d%%, pcs %d%%])",
85 count,
86 title,
87 total() / K,
88 header_size * 100 / total_size,
89 relocation_size * 100 / total_size,
90 code_size * 100 / total_size,
91 stub_size * 100 / total_size,
92 scopes_oop_size * 100 / total_size,
93 scopes_metadata_size * 100 / total_size,
94 scopes_data_size * 100 / total_size,
95 scopes_pcs_size * 100 / total_size);
96 }
97
98 void add(CodeBlob* cb) {
99 count++;
100 total_size += cb->size();
101 header_size += cb->header_size();
102 relocation_size += cb->relocation_size();
103 if (cb->is_nmethod()) {
104 nmethod* nm = cb->as_nmethod_or_null();
105 code_size += nm->insts_size();
106 stub_size += nm->stub_size();
107
108 scopes_oop_size += nm->oops_size();
109 scopes_metadata_size += nm->metadata_size();
110 scopes_data_size += nm->scopes_data_size();
111 scopes_pcs_size += nm->scopes_pcs_size();
112 } else {
113 code_size += cb->code_size();
114 }
115 }
116 };
117
118 // CodeCache implementation
119
120 CodeHeap * CodeCache::_heap = new CodeHeap();
121 int CodeCache::_number_of_blobs = 0;
122 int CodeCache::_number_of_adapters = 0;
123 int CodeCache::_number_of_nmethods = 0;
124 int CodeCache::_number_of_nmethods_with_dependencies = 0;
125 bool CodeCache::_needs_cache_clean = false;
126 nmethod* CodeCache::_scavenge_root_nmethods = NULL;
127
128 int CodeCache::_codemem_full_count = 0;
129
130 CodeBlob* CodeCache::first() {
131 assert_locked_or_safepoint(CodeCache_lock);
132 return (CodeBlob*)_heap->first();
133 }
134
135
136 CodeBlob* CodeCache::next(CodeBlob* cb) {
137 assert_locked_or_safepoint(CodeCache_lock);
138 return (CodeBlob*)_heap->next(cb);
139 }
140
141
142 CodeBlob* CodeCache::alive(CodeBlob *cb) {
143 assert_locked_or_safepoint(CodeCache_lock);
144 while (cb != NULL && !cb->is_alive()) cb = next(cb);
145 return cb;
146 }
147
148
149 nmethod* CodeCache::alive_nmethod(CodeBlob* cb) {
150 assert_locked_or_safepoint(CodeCache_lock);
151 while (cb != NULL && (!cb->is_alive() || !cb->is_nmethod())) cb = next(cb);
152 return (nmethod*)cb;
153 }
154
155 nmethod* CodeCache::first_nmethod() {
156 assert_locked_or_safepoint(CodeCache_lock);
157 CodeBlob* cb = first();
158 while (cb != NULL && !cb->is_nmethod()) {
159 cb = next(cb);
160 }
161 return (nmethod*)cb;
162 }
163
164 nmethod* CodeCache::next_nmethod (CodeBlob* cb) {
165 assert_locked_or_safepoint(CodeCache_lock);
166 cb = next(cb);
167 while (cb != NULL && !cb->is_nmethod()) {
168 cb = next(cb);
169 }
170 return (nmethod*)cb;
171 }
172
173 static size_t maxCodeCacheUsed = 0;
174
175 CodeBlob* CodeCache::allocate(int size, bool is_critical) {
176 // Do not seize the CodeCache lock here--if the caller has not
177 // already done so, we are going to lose bigtime, since the code
178 // cache will contain a garbage CodeBlob until the caller can
179 // run the constructor for the CodeBlob subclass he is busy
180 // instantiating.
181 guarantee(size >= 0, "allocation request must be reasonable");
182 assert_locked_or_safepoint(CodeCache_lock);
183 CodeBlob* cb = NULL;
184 _number_of_blobs++;
185 while (true) {
186 cb = (CodeBlob*)_heap->allocate(size, is_critical);
187 if (cb != NULL) break;
188 if (!_heap->expand_by(CodeCacheExpansionSize)) {
189 // Expansion failed
190 return NULL;
191 }
192 if (PrintCodeCacheExtension) {
193 ResourceMark rm;
194 tty->print_cr("code cache extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (%d bytes)",
195 (intptr_t)_heap->low_boundary(), (intptr_t)_heap->high(),
196 (address)_heap->high() - (address)_heap->low_boundary());
197 }
198 }
199 maxCodeCacheUsed = MAX2(maxCodeCacheUsed, ((address)_heap->high_boundary() -
200 (address)_heap->low_boundary()) - unallocated_capacity());
201 verify_if_often();
202 print_trace("allocation", cb, size);
203 return cb;
204 }
205
206 void CodeCache::free(CodeBlob* cb) {
207 assert_locked_or_safepoint(CodeCache_lock);
208 verify_if_often();
209
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--;
221
222 _heap->deallocate(cb);
223
224 verify_if_often();
225 assert(_number_of_blobs >= 0, "sanity check");
226 }
227
228
229 void CodeCache::commit(CodeBlob* cb) {
230 // this is called by nmethod::nmethod, which must already own CodeCache_lock
231 assert_locked_or_safepoint(CodeCache_lock);
232 if (cb->is_nmethod()) {
233 _number_of_nmethods++;
234 if (((nmethod *)cb)->has_dependencies()) {
235 _number_of_nmethods_with_dependencies++;
236 }
237 }
238 if (cb->is_adapter_blob()) {
239 _number_of_adapters++;
240 }
241
242 // flush the hardware I-cache
243 ICache::invalidate_range(cb->content_begin(), cb->content_size());
244 }
245
246
247 void CodeCache::flush() {
248 assert_locked_or_safepoint(CodeCache_lock);
249 Unimplemented();
250 }
251
252
253 // Iteration over CodeBlobs
254
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)))
258
259
260 bool CodeCache::contains(void *p) {
261 // It should be ok to call contains without holding a lock
262 return _heap->contains(p);
263 }
264
265
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 }
276
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 }
282
283
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 }
290
291
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 }
298
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 }
305
306 int CodeCache::alignment_unit() {
307 return (int)_heap->alignment_unit();
308 }
309
310
311 int CodeCache::alignment_offset() {
312 return (int)_heap->alignment_offset();
313 }
314
315
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 }
324
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);
329
330 #ifdef ASSERT
331 if (cb->is_nmethod())
332 ((nmethod*)cb)->verify_scavenge_root_oops();
333 #endif //ASSERT
334 }
335 }
336
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);
340 debug_only(mark_scavenge_root_nmethods());
341
342 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
343 debug_only(cur->clear_scavenge_root_marked());
344 assert(cur->scavenge_root_not_marked(), "");
345 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
346
347 bool is_live = (!cur->is_zombie() && !cur->is_unloaded());
348 #ifndef PRODUCT
349 if (TraceScavenge) {
350 cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr();
351 }
352 #endif //PRODUCT
353 if (is_live) {
354 // Perform cur->oops_do(f), maybe just once per nmethod.
355 f->do_code_blob(cur);
356 }
357 }
358
359 // Check for stray marks.
360 debug_only(verify_perm_nmethods(NULL));
361 }
362
363 void CodeCache::add_scavenge_root_nmethod(nmethod* nm) {
364 assert_locked_or_safepoint(CodeCache_lock);
365 nm->set_on_scavenge_root_list();
366 nm->set_scavenge_root_link(_scavenge_root_nmethods);
367 set_scavenge_root_nmethods(nm);
368 print_trace("add_scavenge_root", nm);
369 }
370
371 void CodeCache::drop_scavenge_root_nmethod(nmethod* nm) {
372 assert_locked_or_safepoint(CodeCache_lock);
373 print_trace("drop_scavenge_root", nm);
374 nmethod* last = NULL;
375 nmethod* cur = scavenge_root_nmethods();
376 while (cur != NULL) {
377 nmethod* next = cur->scavenge_root_link();
378 if (cur == nm) {
379 if (last != NULL)
380 last->set_scavenge_root_link(next);
381 else set_scavenge_root_nmethods(next);
382 nm->set_scavenge_root_link(NULL);
383 nm->clear_on_scavenge_root_list();
384 return;
385 }
386 last = cur;
387 cur = next;
388 }
389 assert(false, "should have been on list");
390 }
391
392 void CodeCache::prune_scavenge_root_nmethods() {
393 assert_locked_or_safepoint(CodeCache_lock);
394 debug_only(mark_scavenge_root_nmethods());
395
396 nmethod* last = NULL;
397 nmethod* cur = scavenge_root_nmethods();
398 while (cur != NULL) {
399 nmethod* next = cur->scavenge_root_link();
400 debug_only(cur->clear_scavenge_root_marked());
401 assert(cur->scavenge_root_not_marked(), "");
402 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
403
404 if (!cur->is_zombie() && !cur->is_unloaded()
405 && cur->detect_scavenge_root_oops()) {
406 // Keep it. Advance 'last' to prevent deletion.
407 last = cur;
408 } else {
409 // Prune it from the list, so we don't have to look at it any more.
410 print_trace("prune_scavenge_root", cur);
411 cur->set_scavenge_root_link(NULL);
412 cur->clear_on_scavenge_root_list();
413 if (last != NULL)
414 last->set_scavenge_root_link(next);
415 else set_scavenge_root_nmethods(next);
416 }
417 cur = next;
418 }
419
420 // Check for stray marks.
421 debug_only(verify_perm_nmethods(NULL));
422 }
423
424 #ifndef PRODUCT
425 void CodeCache::asserted_non_scavengable_nmethods_do(CodeBlobClosure* f) {
426 // While we are here, verify the integrity of the list.
427 mark_scavenge_root_nmethods();
428 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
429 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
430 cur->clear_scavenge_root_marked();
431 }
432 verify_perm_nmethods(f);
433 }
434
435 // Temporarily mark nmethods that are claimed to be on the non-perm list.
436 void CodeCache::mark_scavenge_root_nmethods() {
437 FOR_ALL_ALIVE_BLOBS(cb) {
438 if (cb->is_nmethod()) {
439 nmethod *nm = (nmethod*)cb;
440 assert(nm->scavenge_root_not_marked(), "clean state");
441 if (nm->on_scavenge_root_list())
442 nm->set_scavenge_root_marked();
443 }
444 }
445 }
446
447 // If the closure is given, run it on the unlisted nmethods.
448 // Also make sure that the effects of mark_scavenge_root_nmethods is gone.
449 void CodeCache::verify_perm_nmethods(CodeBlobClosure* f_or_null) {
450 FOR_ALL_ALIVE_BLOBS(cb) {
451 bool call_f = (f_or_null != NULL);
452 if (cb->is_nmethod()) {
453 nmethod *nm = (nmethod*)cb;
454 assert(nm->scavenge_root_not_marked(), "must be already processed");
455 if (nm->on_scavenge_root_list())
456 call_f = false; // don't show this one to the client
457 nm->verify_scavenge_root_oops();
458 } else {
459 call_f = false; // not an nmethod
460 }
461 if (call_f) f_or_null->do_code_blob(cb);
462 }
463 }
464 #endif //PRODUCT
465
466
467 void CodeCache::gc_prologue() {
468 assert(!nmethod::oops_do_marking_is_active(), "oops_do_marking_epilogue must be called");
469 }
470
471 void CodeCache::gc_epilogue() {
472 assert_locked_or_safepoint(CodeCache_lock);
473 FOR_ALL_ALIVE_BLOBS(cb) {
474 if (cb->is_nmethod()) {
475 nmethod *nm = (nmethod*)cb;
476 assert(!nm->is_unloaded(), "Tautology");
477 if (needs_cache_clean()) {
478 nm->cleanup_inline_caches();
479 }
480 DEBUG_ONLY(nm->verify());
481 nm->fix_oop_relocations();
482 }
483 }
484 set_needs_cache_clean(false);
485 prune_scavenge_root_nmethods();
486 assert(!nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
487
488 #ifdef ASSERT
489 // make sure that we aren't leaking icholders
490 int count = 0;
491 FOR_ALL_BLOBS(cb) {
492 if (cb->is_nmethod()) {
493 RelocIterator iter((nmethod*)cb);
494 while(iter.next()) {
495 if (iter.type() == relocInfo::virtual_call_type) {
496 if (CompiledIC::is_icholder_call_site(iter.virtual_call_reloc())) {
497 CompiledIC *ic = CompiledIC_at(iter.reloc());
498 if (TraceCompiledIC) {
499 tty->print("noticed icholder " INTPTR_FORMAT " ", ic->cached_icholder());
500 ic->print();
501 }
502 assert(ic->cached_icholder() != NULL, "must be non-NULL");
503 count++;
504 }
505 }
506 }
507 }
508 }
509
510 assert(count + InlineCacheBuffer::pending_icholder_count() + CompiledICHolder::live_not_claimed_count() ==
511 CompiledICHolder::live_count(), "must agree");
512 #endif
513 }
514
515
516 void CodeCache::verify_oops() {
517 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
518 VerifyOopClosure voc;
519 FOR_ALL_ALIVE_BLOBS(cb) {
520 if (cb->is_nmethod()) {
521 nmethod *nm = (nmethod*)cb;
522 nm->oops_do(&voc);
523 nm->verify_oop_relocations();
524 }
525 }
526 }
527
528
529 address CodeCache::first_address() {
530 assert_locked_or_safepoint(CodeCache_lock);
531 return (address)_heap->low_boundary();
532 }
533
534
535 address CodeCache::last_address() {
536 assert_locked_or_safepoint(CodeCache_lock);
537 return (address)_heap->high();
538 }
539
540 /**
541 * Returns the reverse free ratio. E.g., if 25% (1/4) of the code cache
542 * is free, reverse_free_ratio() returns 4.
543 */
544 double CodeCache::reverse_free_ratio() {
545 double unallocated_capacity = (double)(CodeCache::unallocated_capacity() - CodeCacheMinimumFreeSpace);
546 double max_capacity = (double)CodeCache::max_capacity();
547 return max_capacity / unallocated_capacity;
548 }
549
550 void icache_init();
551
552 void CodeCache::initialize() {
553 assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points");
554 #ifdef COMPILER2
555 assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment, "CodeCacheSegmentSize must be large enough to align inner loops");
556 #endif
557 assert(CodeCacheSegmentSize >= sizeof(jdouble), "CodeCacheSegmentSize must be large enough to align constants");
558 // This was originally just a check of the alignment, causing failure, instead, round
559 // the code cache to the page size. In particular, Solaris is moving to a larger
560 // default page size.
561 CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size());
562 InitialCodeCacheSize = round_to(InitialCodeCacheSize, os::vm_page_size());
563 ReservedCodeCacheSize = round_to(ReservedCodeCacheSize, os::vm_page_size());
564 if (!_heap->reserve(ReservedCodeCacheSize, InitialCodeCacheSize, CodeCacheSegmentSize)) {
565 vm_exit_during_initialization("Could not reserve enough space for code cache");
566 }
567
568 MemoryService::add_code_heap_memory_pool(_heap);
569
570 // Initialize ICache flush mechanism
571 // This service is needed for os::register_code_area
572 icache_init();
573
574 // Give OS a chance to register generated code area.
575 // This is used on Windows 64 bit platforms to register
576 // Structured Exception Handlers for our generated code.
577 os::register_code_area(_heap->low_boundary(), _heap->high_boundary());
578 }
579
580
581 void codeCache_init() {
582 CodeCache::initialize();
583 }
584
585 //------------------------------------------------------------------------------------------------
586
587 int CodeCache::number_of_nmethods_with_dependencies() {
588 return _number_of_nmethods_with_dependencies;
589 }
590
591 void CodeCache::clear_inline_caches() {
592 assert_locked_or_safepoint(CodeCache_lock);
593 FOR_ALL_ALIVE_NMETHODS(nm) {
594 nm->clear_inline_caches();
595 }
596 }
597
598 #ifndef PRODUCT
599 // used to keep track of how much time is spent in mark_for_deoptimization
600 static elapsedTimer dependentCheckTime;
601 static int dependentCheckCount = 0;
602 #endif // PRODUCT
603
604
605 int CodeCache::mark_for_deoptimization(DepChange& changes) {
606 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
607
608 #ifndef PRODUCT
609 dependentCheckTime.start();
610 dependentCheckCount++;
611 #endif // PRODUCT
612
613 int number_of_marked_CodeBlobs = 0;
614
615 // search the hierarchy looking for nmethods which are affected by the loading of this class
616
617 // then search the interfaces this class implements looking for nmethods
618 // which might be dependent of the fact that an interface only had one
619 // implementor.
620
621 { No_Safepoint_Verifier nsv;
622 for (DepChange::ContextStream str(changes, nsv); str.next(); ) {
623 Klass* d = str.klass();
624 number_of_marked_CodeBlobs += InstanceKlass::cast(d)->mark_dependent_nmethods(changes);
625 }
626 }
627
628 if (VerifyDependencies) {
629 // Turn off dependency tracing while actually testing deps.
630 NOT_PRODUCT( FlagSetting fs(TraceDependencies, false) );
631 FOR_ALL_ALIVE_NMETHODS(nm) {
632 if (!nm->is_marked_for_deoptimization() &&
633 nm->check_all_dependencies()) {
634 ResourceMark rm;
635 tty->print_cr("Should have been marked for deoptimization:");
636 changes.print();
637 nm->print();
638 nm->print_dependencies();
639 }
640 }
641 }
642
643 #ifndef PRODUCT
644 dependentCheckTime.stop();
645 #endif // PRODUCT
646
647 return number_of_marked_CodeBlobs;
648 }
649
650
651 #ifdef HOTSWAP
652 int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) {
653 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
654 int number_of_marked_CodeBlobs = 0;
655
656 // Deoptimize all methods of the evolving class itself
657 Array<Method*>* old_methods = dependee->methods();
658 for (int i = 0; i < old_methods->length(); i++) {
659 ResourceMark rm;
660 Method* old_method = old_methods->at(i);
661 nmethod *nm = old_method->code();
662 if (nm != NULL) {
663 nm->mark_for_deoptimization();
664 number_of_marked_CodeBlobs++;
665 }
666 }
667
668 FOR_ALL_ALIVE_NMETHODS(nm) {
669 if (nm->is_marked_for_deoptimization()) {
670 // ...Already marked in the previous pass; don't count it again.
671 } else if (nm->is_evol_dependent_on(dependee())) {
672 ResourceMark rm;
673 nm->mark_for_deoptimization();
674 number_of_marked_CodeBlobs++;
675 } else {
676 // flush caches in case they refer to a redefined Method*
677 nm->clear_inline_caches();
678 }
679 }
680
681 return number_of_marked_CodeBlobs;
682 }
683 #endif // HOTSWAP
684
685
686 // Deoptimize all methods
687 void CodeCache::mark_all_nmethods_for_deoptimization() {
688 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
689 FOR_ALL_ALIVE_NMETHODS(nm) {
690 nm->mark_for_deoptimization();
691 }
692 }
693
694
695 int CodeCache::mark_for_deoptimization(Method* dependee) {
696 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
697 int number_of_marked_CodeBlobs = 0;
698
699 FOR_ALL_ALIVE_NMETHODS(nm) {
700 if (nm->is_dependent_on_method(dependee)) {
701 ResourceMark rm;
702 nm->mark_for_deoptimization();
703 number_of_marked_CodeBlobs++;
704 }
705 }
706
707 return number_of_marked_CodeBlobs;
708 }
709
710 void CodeCache::make_marked_nmethods_zombies() {
711 assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint");
712 FOR_ALL_ALIVE_NMETHODS(nm) {
713 if (nm->is_marked_for_deoptimization()) {
714
715 // If the nmethod has already been made non-entrant and it can be converted
716 // then zombie it now. Otherwise make it non-entrant and it will eventually
717 // be zombied when it is no longer seen on the stack. Note that the nmethod
718 // might be "entrant" and not on the stack and so could be zombied immediately
719 // but we can't tell because we don't track it on stack until it becomes
720 // non-entrant.
721
722 if (nm->is_not_entrant() && nm->can_not_entrant_be_converted()) {
723 nm->make_zombie();
724 } else {
725 nm->make_not_entrant();
726 }
727 }
728 }
729 }
730
731 void CodeCache::make_marked_nmethods_not_entrant() {
732 assert_locked_or_safepoint(CodeCache_lock);
733 FOR_ALL_ALIVE_NMETHODS(nm) {
734 if (nm->is_marked_for_deoptimization()) {
735 nm->make_not_entrant();
736 }
737 }
738 }
739
740 void CodeCache::verify() {
741 _heap->verify();
742 FOR_ALL_ALIVE_BLOBS(p) {
743 p->verify();
744 }
745 }
746
747 void CodeCache::report_codemem_full() {
748 _codemem_full_count++;
749 EventCodeCacheFull event;
750 if (event.should_commit()) {
751 event.set_startAddress((u8)low_bound());
752 event.set_commitedTopAddress((u8)high());
753 event.set_reservedTopAddress((u8)high_bound());
754 event.set_entryCount(nof_blobs());
755 event.set_methodCount(nof_nmethods());
756 event.set_adaptorCount(nof_adapters());
757 event.set_unallocatedCapacity(unallocated_capacity()/K);
758 event.set_fullCount(_codemem_full_count);
759 event.commit();
760 }
761 }
762
763 //------------------------------------------------------------------------------------------------
764 // Non-product version
765
766 #ifndef PRODUCT
767
768 void CodeCache::verify_if_often() {
769 if (VerifyCodeCacheOften) {
770 _heap->verify();
771 }
772 }
773
774 void CodeCache::print_trace(const char* event, CodeBlob* cb, int size) {
775 if (PrintCodeCache2) { // Need to add a new flag
776 ResourceMark rm;
777 if (size == 0) size = cb->size();
778 tty->print_cr("CodeCache %s: addr: " INTPTR_FORMAT ", size: 0x%x", event, cb, size);
779 }
780 }
781
782 void CodeCache::print_internals() {
783 int nmethodCount = 0;
784 int runtimeStubCount = 0;
785 int adapterCount = 0;
786 int deoptimizationStubCount = 0;
787 int uncommonTrapStubCount = 0;
788 int bufferBlobCount = 0;
789 int total = 0;
790 int nmethodAlive = 0;
791 int nmethodNotEntrant = 0;
792 int nmethodZombie = 0;
793 int nmethodUnloaded = 0;
794 int nmethodJava = 0;
795 int nmethodNative = 0;
796 int maxCodeSize = 0;
797 ResourceMark rm;
798
799 CodeBlob *cb;
800 for (cb = first(); cb != NULL; cb = next(cb)) {
801 total++;
802 if (cb->is_nmethod()) {
803 nmethod* nm = (nmethod*)cb;
804
805 if (Verbose && nm->method() != NULL) {
806 ResourceMark rm;
807 char *method_name = nm->method()->name_and_sig_as_C_string();
808 tty->print("%s", method_name);
809 if(nm->is_alive()) { tty->print_cr(" alive"); }
810 if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); }
811 if(nm->is_zombie()) { tty->print_cr(" zombie"); }
812 }
813
814 nmethodCount++;
815
816 if(nm->is_alive()) { nmethodAlive++; }
817 if(nm->is_not_entrant()) { nmethodNotEntrant++; }
818 if(nm->is_zombie()) { nmethodZombie++; }
819 if(nm->is_unloaded()) { nmethodUnloaded++; }
820 if(nm->is_native_method()) { nmethodNative++; }
821
822 if(nm->method() != NULL && nm->is_java_method()) {
823 nmethodJava++;
824 if (nm->insts_size() > maxCodeSize) {
825 maxCodeSize = nm->insts_size();
826 }
827 }
828 } else if (cb->is_runtime_stub()) {
829 runtimeStubCount++;
830 } else if (cb->is_deoptimization_stub()) {
831 deoptimizationStubCount++;
832 } else if (cb->is_uncommon_trap_stub()) {
833 uncommonTrapStubCount++;
834 } else if (cb->is_adapter_blob()) {
835 adapterCount++;
836 } else if (cb->is_buffer_blob()) {
837 bufferBlobCount++;
838 }
839 }
840
841 int bucketSize = 512;
842 int bucketLimit = maxCodeSize / bucketSize + 1;
843 int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode);
844 memset(buckets,0,sizeof(int) * bucketLimit);
845
846 for (cb = first(); cb != NULL; cb = next(cb)) {
847 if (cb->is_nmethod()) {
848 nmethod* nm = (nmethod*)cb;
849 if(nm->is_java_method()) {
850 buckets[nm->insts_size() / bucketSize]++;
851 }
852 }
853 }
854 tty->print_cr("Code Cache Entries (total of %d)",total);
855 tty->print_cr("-------------------------------------------------");
856 tty->print_cr("nmethods: %d",nmethodCount);
857 tty->print_cr("\talive: %d",nmethodAlive);
858 tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant);
859 tty->print_cr("\tzombie: %d",nmethodZombie);
860 tty->print_cr("\tunloaded: %d",nmethodUnloaded);
861 tty->print_cr("\tjava: %d",nmethodJava);
862 tty->print_cr("\tnative: %d",nmethodNative);
863 tty->print_cr("runtime_stubs: %d",runtimeStubCount);
864 tty->print_cr("adapters: %d",adapterCount);
865 tty->print_cr("buffer blobs: %d",bufferBlobCount);
866 tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount);
867 tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount);
868 tty->print_cr("\nnmethod size distribution (non-zombie java)");
869 tty->print_cr("-------------------------------------------------");
870
871 for(int i=0; i<bucketLimit; i++) {
872 if(buckets[i] != 0) {
873 tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize);
874 tty->fill_to(40);
875 tty->print_cr("%d",buckets[i]);
876 }
877 }
878
879 FREE_C_HEAP_ARRAY(int, buckets, mtCode);
880 }
881
882 #endif // !PRODUCT
883
884 void CodeCache::print() {
885 print_summary(tty);
886
887 #ifndef PRODUCT
888 if (!Verbose) return;
889
890 CodeBlob_sizes live;
891 CodeBlob_sizes dead;
892
893 FOR_ALL_BLOBS(p) {
894 if (!p->is_alive()) {
895 dead.add(p);
896 } else {
897 live.add(p);
898 }
899 }
900
901 tty->print_cr("CodeCache:");
902
903 tty->print_cr("nmethod dependency checking time %f", dependentCheckTime.seconds(),
904 dependentCheckTime.seconds() / dependentCheckCount);
905
906 if (!live.is_empty()) {
907 live.print("live");
908 }
909 if (!dead.is_empty()) {
910 dead.print("dead");
911 }
912
913
914 if (WizardMode) {
915 // print the oop_map usage
916 int code_size = 0;
917 int number_of_blobs = 0;
918 int number_of_oop_maps = 0;
919 int map_size = 0;
920 FOR_ALL_BLOBS(p) {
921 if (p->is_alive()) {
922 number_of_blobs++;
923 code_size += p->code_size();
924 OopMapSet* set = p->oop_maps();
925 if (set != NULL) {
926 number_of_oop_maps += set->size();
927 map_size += set->heap_size();
928 }
929 }
930 }
931 tty->print_cr("OopMaps");
932 tty->print_cr(" #blobs = %d", number_of_blobs);
933 tty->print_cr(" code size = %d", code_size);
934 tty->print_cr(" #oop_maps = %d", number_of_oop_maps);
935 tty->print_cr(" map size = %d", map_size);
936 }
937
938 #endif // !PRODUCT
939 }
940
941 void CodeCache::print_summary(outputStream* st, bool detailed) {
942 size_t total = (_heap->high_boundary() - _heap->low_boundary());
943 st->print_cr("CodeCache: size=" SIZE_FORMAT "Kb used=" SIZE_FORMAT
944 "Kb max_used=" SIZE_FORMAT "Kb free=" SIZE_FORMAT "Kb",
945 total/K, (total - unallocated_capacity())/K,
946 maxCodeCacheUsed/K, unallocated_capacity()/K);
947
948 if (detailed) {
949 st->print_cr(" bounds [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT "]",
950 _heap->low_boundary(),
951 _heap->high(),
952 _heap->high_boundary());
953 st->print_cr(" total_blobs=" UINT32_FORMAT " nmethods=" UINT32_FORMAT
954 " adapters=" UINT32_FORMAT,
955 nof_blobs(), nof_nmethods(), nof_adapters());
956 st->print_cr(" compilation: %s", CompileBroker::should_compile_new_jobs() ?
957 "enabled" : Arguments::mode() == Arguments::_int ?
958 "disabled (interpreter mode)" :
959 "disabled (not enough contiguous free space left)");
960 }
961 }
962
963 void CodeCache::log_state(outputStream* st) {
964 st->print(" total_blobs='" UINT32_FORMAT "' nmethods='" UINT32_FORMAT "'"
965 " adapters='" UINT32_FORMAT "' free_code_cache='" SIZE_FORMAT "'",
966 nof_blobs(), nof_nmethods(), nof_adapters(),
967 unallocated_capacity());
968 }
969