1 /*
2 * Copyright (c) 1997, 2016, 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 "aot/aotLoader.hpp"
27 #include "code/codeBlob.hpp"
28 #include "code/codeCache.hpp"
29 #include "code/compiledIC.hpp"
30 #include "code/dependencies.hpp"
31 #include "code/icBuffer.hpp"
32 #include "code/nmethod.hpp"
33 #include "code/pcDesc.hpp"
34 #include "compiler/compileBroker.hpp"
35 #include "gc/shared/gcLocker.hpp"
36 #include "memory/allocation.inline.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 "oops/verifyOopClosure.hpp"
43 #include "runtime/arguments.hpp"
44 #include "runtime/compilationPolicy.hpp"
45 #include "runtime/deoptimization.hpp"
46 #include "runtime/handles.inline.hpp"
47 #include "runtime/icache.hpp"
48 #include "runtime/java.hpp"
49 #include "runtime/mutexLocker.hpp"
50 #include "runtime/sweeper.hpp"
51 #include "services/memoryService.hpp"
52 #include "trace/tracing.hpp"
53 #include "utilities/xmlstream.hpp"
54 #ifdef COMPILER1
55 #include "c1/c1_Compilation.hpp"
56 #include "c1/c1_Compiler.hpp"
57 #endif
58 #ifdef COMPILER2
59 #include "opto/c2compiler.hpp"
60 #include "opto/compile.hpp"
61 #include "opto/node.hpp"
62 #endif
63
64 // Helper class for printing in CodeCache
65 class CodeBlob_sizes {
66 private:
67 int count;
68 int total_size;
69 int header_size;
70 int code_size;
71 int stub_size;
72 int relocation_size;
73 int scopes_oop_size;
74 int scopes_metadata_size;
75 int scopes_data_size;
76 int scopes_pcs_size;
77
78 public:
79 CodeBlob_sizes() {
80 count = 0;
81 total_size = 0;
82 header_size = 0;
83 code_size = 0;
84 stub_size = 0;
85 relocation_size = 0;
86 scopes_oop_size = 0;
87 scopes_metadata_size = 0;
88 scopes_data_size = 0;
89 scopes_pcs_size = 0;
90 }
91
92 int total() { return total_size; }
93 bool is_empty() { return count == 0; }
94
95 void print(const char* title) {
96 tty->print_cr(" #%d %s = %dK (hdr %d%%, loc %d%%, code %d%%, stub %d%%, [oops %d%%, metadata %d%%, data %d%%, pcs %d%%])",
97 count,
98 title,
99 (int)(total() / K),
100 header_size * 100 / total_size,
101 relocation_size * 100 / total_size,
102 code_size * 100 / total_size,
103 stub_size * 100 / total_size,
104 scopes_oop_size * 100 / total_size,
105 scopes_metadata_size * 100 / total_size,
106 scopes_data_size * 100 / total_size,
107 scopes_pcs_size * 100 / total_size);
108 }
109
110 void add(CodeBlob* cb) {
111 count++;
112 total_size += cb->size();
113 header_size += cb->header_size();
114 relocation_size += cb->relocation_size();
115 if (cb->is_nmethod()) {
116 nmethod* nm = cb->as_nmethod_or_null();
117 code_size += nm->insts_size();
118 stub_size += nm->stub_size();
119
120 scopes_oop_size += nm->oops_size();
121 scopes_metadata_size += nm->metadata_size();
122 scopes_data_size += nm->scopes_data_size();
123 scopes_pcs_size += nm->scopes_pcs_size();
124 } else {
125 code_size += cb->code_size();
126 }
127 }
128 };
129
130 // Iterate over all CodeHeaps
131 #define FOR_ALL_HEAPS(heap) for (GrowableArrayIterator<CodeHeap*> heap = _heaps->begin(); heap != _heaps->end(); ++heap)
132 #define FOR_ALL_NMETHOD_HEAPS(heap) for (GrowableArrayIterator<CodeHeap*> heap = _nmethod_heaps->begin(); heap != _nmethod_heaps->end(); ++heap)
133
134 // Iterate over all CodeBlobs (cb) on the given CodeHeap
135 #define FOR_ALL_BLOBS(cb, heap) for (CodeBlob* cb = first_blob(heap); cb != NULL; cb = next_blob(heap, cb))
136
137 address CodeCache::_low_bound = 0;
138 address CodeCache::_high_bound = 0;
139 int CodeCache::_number_of_nmethods_with_dependencies = 0;
140 bool CodeCache::_needs_cache_clean = false;
141 nmethod* CodeCache::_scavenge_root_nmethods = NULL;
142
143 // Initialize array of CodeHeaps
144 GrowableArray<CodeHeap*>* CodeCache::_heaps = new(ResourceObj::C_HEAP, mtCode) GrowableArray<CodeHeap*> (CodeBlobType::All, true);
145 GrowableArray<CodeHeap*>* CodeCache::_compiled_heaps = new(ResourceObj::C_HEAP, mtCode) GrowableArray<CodeHeap*> (CodeBlobType::All, true);
146 GrowableArray<CodeHeap*>* CodeCache::_nmethod_heaps = new(ResourceObj::C_HEAP, mtCode) GrowableArray<CodeHeap*> (CodeBlobType::All, true);
147
148 void CodeCache::check_heap_sizes(size_t non_nmethod_size, size_t profiled_size, size_t non_profiled_size, size_t cache_size, bool all_set) {
149 size_t total_size = non_nmethod_size + profiled_size + non_profiled_size;
150 // Prepare error message
151 const char* error = "Invalid code heap sizes";
152 err_msg message("NonNMethodCodeHeapSize (" SIZE_FORMAT "K) + ProfiledCodeHeapSize (" SIZE_FORMAT "K)"
153 " + NonProfiledCodeHeapSize (" SIZE_FORMAT "K) = " SIZE_FORMAT "K",
154 non_nmethod_size/K, profiled_size/K, non_profiled_size/K, total_size/K);
155
156 if (total_size > cache_size) {
157 // Some code heap sizes were explicitly set: total_size must be <= cache_size
158 message.append(" is greater than ReservedCodeCacheSize (" SIZE_FORMAT "K).", cache_size/K);
159 vm_exit_during_initialization(error, message);
160 } else if (all_set && total_size != cache_size) {
161 // All code heap sizes were explicitly set: total_size must equal cache_size
162 message.append(" is not equal to ReservedCodeCacheSize (" SIZE_FORMAT "K).", cache_size/K);
163 vm_exit_during_initialization(error, message);
164 }
165 }
166
167 void CodeCache::initialize_heaps() {
168 bool non_nmethod_set = FLAG_IS_CMDLINE(NonNMethodCodeHeapSize);
169 bool profiled_set = FLAG_IS_CMDLINE(ProfiledCodeHeapSize);
170 bool non_profiled_set = FLAG_IS_CMDLINE(NonProfiledCodeHeapSize);
171 size_t min_size = os::vm_page_size();
172 size_t cache_size = ReservedCodeCacheSize;
173 size_t non_nmethod_size = NonNMethodCodeHeapSize;
174 size_t profiled_size = ProfiledCodeHeapSize;
175 size_t non_profiled_size = NonProfiledCodeHeapSize;
176 // Check if total size set via command line flags exceeds the reserved size
177 check_heap_sizes((non_nmethod_set ? non_nmethod_size : min_size),
178 (profiled_set ? profiled_size : min_size),
179 (non_profiled_set ? non_profiled_size : min_size),
180 cache_size,
181 non_nmethod_set && profiled_set && non_profiled_set);
182
183 // Determine size of compiler buffers
184 size_t code_buffers_size = 0;
185 #ifdef COMPILER1
186 // C1 temporary code buffers (see Compiler::init_buffer_blob())
187 const int c1_count = CompilationPolicy::policy()->compiler_count(CompLevel_simple);
188 code_buffers_size += c1_count * Compiler::code_buffer_size();
189 #endif
190 #ifdef COMPILER2
191 // C2 scratch buffers (see Compile::init_scratch_buffer_blob())
192 const int c2_count = CompilationPolicy::policy()->compiler_count(CompLevel_full_optimization);
193 // Initial size of constant table (this may be increased if a compiled method needs more space)
194 code_buffers_size += c2_count * C2Compiler::initial_code_buffer_size();
195 #endif
196
197 // Increase default non_nmethod_size to account for compiler buffers
198 if (!non_nmethod_set) {
199 non_nmethod_size += code_buffers_size;
200 }
201 // Calculate default CodeHeap sizes if not set by user
202 if (!non_nmethod_set && !profiled_set && !non_profiled_set) {
203 // Check if we have enough space for the non-nmethod code heap
204 if (cache_size > non_nmethod_size) {
205 // Use the default value for non_nmethod_size and one half of the
206 // remaining size for non-profiled and one half for profiled methods
207 size_t remaining_size = cache_size - non_nmethod_size;
208 profiled_size = remaining_size / 2;
209 non_profiled_size = remaining_size - profiled_size;
210 } else {
211 // Use all space for the non-nmethod heap and set other heaps to minimal size
212 non_nmethod_size = cache_size - 2 * min_size;
213 profiled_size = min_size;
214 non_profiled_size = min_size;
215 }
216 } else if (!non_nmethod_set || !profiled_set || !non_profiled_set) {
217 // The user explicitly set some code heap sizes. Increase or decrease the (default)
218 // sizes of the other code heaps accordingly. First adapt non-profiled and profiled
219 // code heap sizes and then only change non-nmethod code heap size if still necessary.
220 intx diff_size = cache_size - (non_nmethod_size + profiled_size + non_profiled_size);
221 if (non_profiled_set) {
222 if (!profiled_set) {
223 // Adapt size of profiled code heap
224 if (diff_size < 0 && ((intx)profiled_size + diff_size) <= 0) {
225 // Not enough space available, set to minimum size
226 diff_size += profiled_size - min_size;
227 profiled_size = min_size;
228 } else {
229 profiled_size += diff_size;
230 diff_size = 0;
231 }
232 }
233 } else if (profiled_set) {
234 // Adapt size of non-profiled code heap
235 if (diff_size < 0 && ((intx)non_profiled_size + diff_size) <= 0) {
236 // Not enough space available, set to minimum size
237 diff_size += non_profiled_size - min_size;
238 non_profiled_size = min_size;
239 } else {
240 non_profiled_size += diff_size;
241 diff_size = 0;
242 }
243 } else if (non_nmethod_set) {
244 // Distribute remaining size between profiled and non-profiled code heaps
245 diff_size = cache_size - non_nmethod_size;
246 profiled_size = diff_size / 2;
247 non_profiled_size = diff_size - profiled_size;
248 diff_size = 0;
249 }
250 if (diff_size != 0) {
251 // Use non-nmethod code heap for remaining space requirements
252 assert(!non_nmethod_set && ((intx)non_nmethod_size + diff_size) > 0, "sanity");
253 non_nmethod_size += diff_size;
254 }
255 }
256
257 // We do not need the profiled CodeHeap, use all space for the non-profiled CodeHeap
258 if(!heap_available(CodeBlobType::MethodProfiled)) {
259 non_profiled_size += profiled_size;
260 profiled_size = 0;
261 }
262 // We do not need the non-profiled CodeHeap, use all space for the non-nmethod CodeHeap
263 if(!heap_available(CodeBlobType::MethodNonProfiled)) {
264 non_nmethod_size += non_profiled_size;
265 non_profiled_size = 0;
266 }
267 // Make sure we have enough space for VM internal code
268 uint min_code_cache_size = CodeCacheMinimumUseSpace DEBUG_ONLY(* 3);
269 if (non_nmethod_size < (min_code_cache_size + code_buffers_size)) {
270 vm_exit_during_initialization(err_msg(
271 "Not enough space in non-nmethod code heap to run VM: " SIZE_FORMAT "K < " SIZE_FORMAT "K",
272 non_nmethod_size/K, (min_code_cache_size + code_buffers_size)/K));
273 }
274
275 // Verify sizes and update flag values
276 assert(non_profiled_size + profiled_size + non_nmethod_size == cache_size, "Invalid code heap sizes");
277 FLAG_SET_ERGO(uintx, NonNMethodCodeHeapSize, non_nmethod_size);
278 FLAG_SET_ERGO(uintx, ProfiledCodeHeapSize, profiled_size);
279 FLAG_SET_ERGO(uintx, NonProfiledCodeHeapSize, non_profiled_size);
280
281 // Align CodeHeaps
282 size_t alignment = heap_alignment();
283 non_nmethod_size = align_size_up(non_nmethod_size, alignment);
284 profiled_size = align_size_down(profiled_size, alignment);
285
286 // Reserve one continuous chunk of memory for CodeHeaps and split it into
287 // parts for the individual heaps. The memory layout looks like this:
288 // ---------- high -----------
289 // Non-profiled nmethods
290 // Profiled nmethods
291 // Non-nmethods
292 // ---------- low ------------
293 ReservedCodeSpace rs = reserve_heap_memory(cache_size);
294 ReservedSpace non_method_space = rs.first_part(non_nmethod_size);
295 ReservedSpace rest = rs.last_part(non_nmethod_size);
296 ReservedSpace profiled_space = rest.first_part(profiled_size);
297 ReservedSpace non_profiled_space = rest.last_part(profiled_size);
298
299 // Non-nmethods (stubs, adapters, ...)
300 add_heap(non_method_space, "CodeHeap 'non-nmethods'", CodeBlobType::NonNMethod);
301 // Tier 2 and tier 3 (profiled) methods
302 add_heap(profiled_space, "CodeHeap 'profiled nmethods'", CodeBlobType::MethodProfiled);
303 // Tier 1 and tier 4 (non-profiled) methods and native methods
304 add_heap(non_profiled_space, "CodeHeap 'non-profiled nmethods'", CodeBlobType::MethodNonProfiled);
305 }
306
307 size_t CodeCache::heap_alignment() {
308 // If large page support is enabled, align code heaps according to large
309 // page size to make sure that code cache is covered by large pages.
310 const size_t page_size = os::can_execute_large_page_memory() ?
311 os::page_size_for_region_unaligned(ReservedCodeCacheSize, 8) :
312 os::vm_page_size();
313 return MAX2(page_size, (size_t) os::vm_allocation_granularity());
314 }
315
316 ReservedCodeSpace CodeCache::reserve_heap_memory(size_t size) {
317 // Determine alignment
318 const size_t page_size = os::can_execute_large_page_memory() ?
319 MIN2(os::page_size_for_region_aligned(InitialCodeCacheSize, 8),
320 os::page_size_for_region_aligned(size, 8)) :
321 os::vm_page_size();
322 const size_t granularity = os::vm_allocation_granularity();
323 const size_t r_align = MAX2(page_size, granularity);
324 const size_t r_size = align_size_up(size, r_align);
325 const size_t rs_align = page_size == (size_t) os::vm_page_size() ? 0 :
326 MAX2(page_size, granularity);
327
328 ReservedCodeSpace rs(r_size, rs_align, rs_align > 0);
329
330 if (!rs.is_reserved()) {
331 vm_exit_during_initialization("Could not reserve enough space for code cache");
332 }
333
334 // Initialize bounds
335 _low_bound = (address)rs.base();
336 _high_bound = _low_bound + rs.size();
337
338 return rs;
339 }
340
341 bool CodeCache::heap_available(int code_blob_type) {
342 if (!SegmentedCodeCache) {
343 // No segmentation: use a single code heap
344 return (code_blob_type == CodeBlobType::All);
345 } else if (Arguments::is_interpreter_only()) {
346 // Interpreter only: we don't need any method code heaps
347 return (code_blob_type == CodeBlobType::NonNMethod);
348 } else if (TieredCompilation && (TieredStopAtLevel > CompLevel_simple)) {
349 // Tiered compilation: use all code heaps
350 return (code_blob_type < CodeBlobType::All);
351 } else {
352 // No TieredCompilation: we only need the non-nmethod and non-profiled code heap
353 return (code_blob_type == CodeBlobType::NonNMethod) ||
354 (code_blob_type == CodeBlobType::MethodNonProfiled);
355 }
356 }
357
358 const char* CodeCache::get_code_heap_flag_name(int code_blob_type) {
359 switch(code_blob_type) {
360 case CodeBlobType::NonNMethod:
361 return "NonNMethodCodeHeapSize";
362 break;
363 case CodeBlobType::MethodNonProfiled:
364 return "NonProfiledCodeHeapSize";
365 break;
366 case CodeBlobType::MethodProfiled:
367 return "ProfiledCodeHeapSize";
368 break;
369 }
370 ShouldNotReachHere();
371 return NULL;
372 }
373
374 int CodeCache::code_heap_compare(CodeHeap* const &lhs, CodeHeap* const &rhs) {
375 if (lhs->code_blob_type() == rhs->code_blob_type()) {
376 return (lhs > rhs) ? 1 : ((lhs < rhs) ? -1 : 0);
377 } else {
378 return lhs->code_blob_type() - rhs->code_blob_type();
379 }
380 }
381
382 void CodeCache::add_heap(CodeHeap* heap) {
383 assert(!Universe::is_fully_initialized(), "late heap addition?");
384
385 _heaps->insert_sorted<code_heap_compare>(heap);
386
387 int type = heap->code_blob_type();
388 if (code_blob_type_accepts_compiled(type)) {
389 _compiled_heaps->insert_sorted<code_heap_compare>(heap);
390 }
391 if (code_blob_type_accepts_nmethod(type)) {
392 _nmethod_heaps->insert_sorted<code_heap_compare>(heap);
393 }
394 }
395
396 void CodeCache::add_heap(ReservedSpace rs, const char* name, int code_blob_type) {
397 // Check if heap is needed
398 if (!heap_available(code_blob_type)) {
399 return;
400 }
401
402 // Create CodeHeap
403 CodeHeap* heap = new CodeHeap(name, code_blob_type);
404 add_heap(heap);
405
406 // Reserve Space
407 size_t size_initial = MIN2(InitialCodeCacheSize, rs.size());
408 size_initial = round_to(size_initial, os::vm_page_size());
409 if (!heap->reserve(rs, size_initial, CodeCacheSegmentSize)) {
410 vm_exit_during_initialization("Could not reserve enough space for code cache");
411 }
412
413 // Register the CodeHeap
414 MemoryService::add_code_heap_memory_pool(heap, name);
415 }
416
417 CodeHeap* CodeCache::get_code_heap(const CodeBlob* cb) {
418 assert(cb != NULL, "CodeBlob is null");
419 FOR_ALL_HEAPS(heap) {
420 if ((*heap)->contains(cb)) {
421 guarantee((char*) cb >= (*heap)->low_boundary() && (char*) cb < (*heap)->high(),
422 "Code blob " INTPTR_FORMAT " should be after "
423 "heap low boundary " INTPTR_FORMAT " "
424 "and before heap high boundary " INTPTR_FORMAT,
425 p2i(cb), p2i((*heap)->low_boundary()), p2i((*heap)->high()));
426 return *heap;
427 }
428 }
429 ShouldNotReachHere();
430 return NULL;
431 }
432
433 CodeHeap* CodeCache::get_code_heap(int code_blob_type) {
434 FOR_ALL_HEAPS(heap) {
435 if ((*heap)->accepts(code_blob_type)) {
436 return *heap;
437 }
438 }
439 return NULL;
440 }
441
442 CodeBlob* CodeCache::first_blob(CodeHeap* heap) {
443 assert_locked_or_safepoint(CodeCache_lock);
444 assert(heap != NULL, "heap is null");
445 return (CodeBlob*)heap->first();
446 }
447
448 CodeBlob* CodeCache::first_blob(int code_blob_type) {
449 if (heap_available(code_blob_type)) {
450 return first_blob(get_code_heap(code_blob_type));
451 } else {
452 return NULL;
453 }
454 }
455
456 CodeBlob* CodeCache::next_blob(CodeHeap* heap, CodeBlob* cb) {
457 assert_locked_or_safepoint(CodeCache_lock);
458 assert(heap != NULL, "heap is null");
459 return (CodeBlob*)heap->next(cb);
460 }
461
462 /**
463 * Do not seize the CodeCache lock here--if the caller has not
464 * already done so, we are going to lose bigtime, since the code
465 * cache will contain a garbage CodeBlob until the caller can
466 * run the constructor for the CodeBlob subclass he is busy
467 * instantiating.
468 */
469 CodeBlob* CodeCache::allocate(int size, int code_blob_type, int orig_code_blob_type) {
470 // Possibly wakes up the sweeper thread.
471 NMethodSweeper::notify(code_blob_type);
472 assert_locked_or_safepoint(CodeCache_lock);
473 assert(size > 0, "Code cache allocation request must be > 0 but is %d", size);
474 if (size <= 0) {
475 return NULL;
476 }
477 CodeBlob* cb = NULL;
478
479 // Get CodeHeap for the given CodeBlobType
480 CodeHeap* heap = get_code_heap(code_blob_type);
481 assert(heap != NULL, "heap is null");
482
483 while (true) {
484 cb = (CodeBlob*)heap->allocate(size);
485 if (cb != NULL) break;
486 if (!heap->expand_by(CodeCacheExpansionSize)) {
487 // Save original type for error reporting
488 if (orig_code_blob_type == CodeBlobType::All) {
489 orig_code_blob_type = code_blob_type;
490 }
491 // Expansion failed
492 if (SegmentedCodeCache) {
493 // Fallback solution: Try to store code in another code heap.
494 // NonNMethod -> MethodNonProfiled -> MethodProfiled (-> MethodNonProfiled)
495 // Note that in the sweeper, we check the reverse_free_ratio of the code heap
496 // and force stack scanning if less than 10% of the code heap are free.
497 int type = code_blob_type;
498 switch (type) {
499 case CodeBlobType::NonNMethod:
500 type = CodeBlobType::MethodNonProfiled;
501 break;
502 case CodeBlobType::MethodNonProfiled:
503 type = CodeBlobType::MethodProfiled;
504 break;
505 case CodeBlobType::MethodProfiled:
506 // Avoid loop if we already tried that code heap
507 if (type == orig_code_blob_type) {
508 type = CodeBlobType::MethodNonProfiled;
509 }
510 break;
511 }
512 if (type != code_blob_type && type != orig_code_blob_type && heap_available(type)) {
513 if (PrintCodeCacheExtension) {
514 tty->print_cr("Extension of %s failed. Trying to allocate in %s.",
515 heap->name(), get_code_heap(type)->name());
516 }
517 return allocate(size, type, orig_code_blob_type);
518 }
519 }
520 MutexUnlockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
521 CompileBroker::handle_full_code_cache(orig_code_blob_type);
522 return NULL;
523 }
524 if (PrintCodeCacheExtension) {
525 ResourceMark rm;
526 if (_nmethod_heaps->length() >= 1) {
527 tty->print("%s", heap->name());
528 } else {
529 tty->print("CodeCache");
530 }
531 tty->print_cr(" extended to [" INTPTR_FORMAT ", " INTPTR_FORMAT "] (" SSIZE_FORMAT " bytes)",
532 (intptr_t)heap->low_boundary(), (intptr_t)heap->high(),
533 (address)heap->high() - (address)heap->low_boundary());
534 }
535 }
536 print_trace("allocation", cb, size);
537 return cb;
538 }
539
540 void CodeCache::free(CodeBlob* cb) {
541 assert_locked_or_safepoint(CodeCache_lock);
542 CodeHeap* heap = get_code_heap(cb);
543 print_trace("free", cb);
544 if (cb->is_nmethod()) {
545 heap->set_nmethod_count(heap->nmethod_count() - 1);
546 if (((nmethod *)cb)->has_dependencies()) {
547 _number_of_nmethods_with_dependencies--;
548 }
549 }
550 if (cb->is_adapter_blob()) {
551 heap->set_adapter_count(heap->adapter_count() - 1);
552 }
553
554 // Get heap for given CodeBlob and deallocate
555 get_code_heap(cb)->deallocate(cb);
556
557 assert(heap->blob_count() >= 0, "sanity check");
558 }
559
560 void CodeCache::commit(CodeBlob* cb) {
561 // this is called by nmethod::nmethod, which must already own CodeCache_lock
562 assert_locked_or_safepoint(CodeCache_lock);
563 CodeHeap* heap = get_code_heap(cb);
564 if (cb->is_nmethod()) {
565 heap->set_nmethod_count(heap->nmethod_count() + 1);
566 if (((nmethod *)cb)->has_dependencies()) {
567 _number_of_nmethods_with_dependencies++;
568 }
569 }
570 if (cb->is_adapter_blob()) {
571 heap->set_adapter_count(heap->adapter_count() + 1);
572 }
573
574 // flush the hardware I-cache
575 ICache::invalidate_range(cb->content_begin(), cb->content_size());
576 }
577
578 bool CodeCache::contains(void *p) {
579 // S390 uses contains() in current_frame(), which is used before
580 // code cache initialization if NativeMemoryTracking=detail is set.
581 S390_ONLY(if (_heaps == NULL) return false;)
582 // It should be ok to call contains without holding a lock.
583 FOR_ALL_HEAPS(heap) {
584 if ((*heap)->contains(p)) {
585 return true;
586 }
587 }
588 return false;
589 }
590
591 bool CodeCache::contains(nmethod *nm) {
592 return contains((void *)nm);
593 }
594
595 // This method is safe to call without holding the CodeCache_lock, as long as a dead CodeBlob is not
596 // looked up (i.e., one that has been marked for deletion). It only depends on the _segmap to contain
597 // valid indices, which it will always do, as long as the CodeBlob is not in the process of being recycled.
598 CodeBlob* CodeCache::find_blob(void* start) {
599 CodeBlob* result = find_blob_unsafe(start);
600 // We could potentially look up non_entrant methods
601 guarantee(result == NULL || !result->is_zombie() || result->is_locked_by_vm() || is_error_reported(), "unsafe access to zombie method");
602 return result;
603 }
604
605 // Lookup that does not fail if you lookup a zombie method (if you call this, be sure to know
606 // what you are doing)
607 CodeBlob* CodeCache::find_blob_unsafe(void* start) {
608 // NMT can walk the stack before code cache is created
609 if (_heaps != NULL && !_heaps->is_empty()) {
610 FOR_ALL_HEAPS(heap) {
611 CodeBlob* result = (*heap)->find_blob_unsafe(start);
612 if (result != NULL) {
613 return result;
614 }
615 }
616 }
617 return NULL;
618 }
619
620 nmethod* CodeCache::find_nmethod(void* start) {
621 CodeBlob* cb = find_blob(start);
622 assert(cb->is_nmethod(), "did not find an nmethod");
623 return (nmethod*)cb;
624 }
625
626 void CodeCache::blobs_do(void f(CodeBlob* nm)) {
627 assert_locked_or_safepoint(CodeCache_lock);
628 FOR_ALL_NMETHOD_HEAPS(heap) {
629 FOR_ALL_BLOBS(cb, *heap) {
630 f(cb);
631 }
632 }
633 }
634
635 void CodeCache::nmethods_do(void f(nmethod* nm)) {
636 assert_locked_or_safepoint(CodeCache_lock);
637 NMethodIterator iter;
638 while(iter.next()) {
639 f(iter.method());
640 }
641 }
642
643 void CodeCache::metadata_do(void f(Metadata* m)) {
644 assert_locked_or_safepoint(CodeCache_lock);
645 NMethodIterator iter;
646 while(iter.next_alive()) {
647 iter.method()->metadata_do(f);
648 }
649 AOTLoader::metadata_do(f);
650 }
651
652 int CodeCache::alignment_unit() {
653 return (int)_heaps->first()->alignment_unit();
654 }
655
656 int CodeCache::alignment_offset() {
657 return (int)_heaps->first()->alignment_offset();
658 }
659
660 // Mark nmethods for unloading if they contain otherwise unreachable oops.
661 void CodeCache::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) {
662 assert_locked_or_safepoint(CodeCache_lock);
663 CompiledMethodIterator iter;
664 while(iter.next_alive()) {
665 iter.method()->do_unloading(is_alive, unloading_occurred);
666 }
667 }
668
669 void CodeCache::blobs_do(CodeBlobClosure* f) {
670 assert_locked_or_safepoint(CodeCache_lock);
671 FOR_ALL_NMETHOD_HEAPS(heap) {
672 FOR_ALL_BLOBS(cb, *heap) {
673 if (cb->is_alive()) {
674 f->do_code_blob(cb);
675 #ifdef ASSERT
676 if (cb->is_nmethod())
677 ((nmethod*)cb)->verify_scavenge_root_oops();
678 #endif //ASSERT
679 }
680 }
681 }
682 }
683
684 // Walk the list of methods which might contain non-perm oops.
685 void CodeCache::scavenge_root_nmethods_do(CodeBlobToOopClosure* f) {
686 assert_locked_or_safepoint(CodeCache_lock);
687
688 if (UseG1GC) {
689 return;
690 }
691
692 const bool fix_relocations = f->fix_relocations();
693 debug_only(mark_scavenge_root_nmethods());
694
695 nmethod* prev = NULL;
696 nmethod* cur = scavenge_root_nmethods();
697 while (cur != NULL) {
698 debug_only(cur->clear_scavenge_root_marked());
699 assert(cur->scavenge_root_not_marked(), "");
700 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
701
702 bool is_live = (!cur->is_zombie() && !cur->is_unloaded());
703 if (TraceScavenge) {
704 cur->print_on(tty, is_live ? "scavenge root" : "dead scavenge root"); tty->cr();
705 }
706 if (is_live) {
707 // Perform cur->oops_do(f), maybe just once per nmethod.
708 f->do_code_blob(cur);
709 }
710 nmethod* const next = cur->scavenge_root_link();
711 // The scavengable nmethod list must contain all methods with scavengable
712 // oops. It is safe to include more nmethod on the list, but we do not
713 // expect any live non-scavengable nmethods on the list.
714 if (fix_relocations) {
715 if (!is_live || !cur->detect_scavenge_root_oops()) {
716 unlink_scavenge_root_nmethod(cur, prev);
717 } else {
718 prev = cur;
719 }
720 }
721 cur = next;
722 }
723
724 // Check for stray marks.
725 debug_only(verify_perm_nmethods(NULL));
726 }
727
728 void CodeCache::add_scavenge_root_nmethod(nmethod* nm) {
729 assert_locked_or_safepoint(CodeCache_lock);
730
731 if (UseG1GC) {
732 return;
733 }
734
735 nm->set_on_scavenge_root_list();
736 nm->set_scavenge_root_link(_scavenge_root_nmethods);
737 set_scavenge_root_nmethods(nm);
738 print_trace("add_scavenge_root", nm);
739 }
740
741 void CodeCache::unlink_scavenge_root_nmethod(nmethod* nm, nmethod* prev) {
742 assert_locked_or_safepoint(CodeCache_lock);
743
744 assert((prev == NULL && scavenge_root_nmethods() == nm) ||
745 (prev != NULL && prev->scavenge_root_link() == nm), "precondition");
746
747 assert(!UseG1GC, "G1 does not use the scavenge_root_nmethods list");
748
749 print_trace("unlink_scavenge_root", nm);
750 if (prev == NULL) {
751 set_scavenge_root_nmethods(nm->scavenge_root_link());
752 } else {
753 prev->set_scavenge_root_link(nm->scavenge_root_link());
754 }
755 nm->set_scavenge_root_link(NULL);
756 nm->clear_on_scavenge_root_list();
757 }
758
759 void CodeCache::drop_scavenge_root_nmethod(nmethod* nm) {
760 assert_locked_or_safepoint(CodeCache_lock);
761
762 if (UseG1GC) {
763 return;
764 }
765
766 print_trace("drop_scavenge_root", nm);
767 nmethod* prev = NULL;
768 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
769 if (cur == nm) {
770 unlink_scavenge_root_nmethod(cur, prev);
771 return;
772 }
773 prev = cur;
774 }
775 assert(false, "should have been on list");
776 }
777
778 void CodeCache::prune_scavenge_root_nmethods() {
779 assert_locked_or_safepoint(CodeCache_lock);
780
781 if (UseG1GC) {
782 return;
783 }
784
785 debug_only(mark_scavenge_root_nmethods());
786
787 nmethod* last = NULL;
788 nmethod* cur = scavenge_root_nmethods();
789 while (cur != NULL) {
790 nmethod* next = cur->scavenge_root_link();
791 debug_only(cur->clear_scavenge_root_marked());
792 assert(cur->scavenge_root_not_marked(), "");
793 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
794
795 if (!cur->is_zombie() && !cur->is_unloaded()
796 && cur->detect_scavenge_root_oops()) {
797 // Keep it. Advance 'last' to prevent deletion.
798 last = cur;
799 } else {
800 // Prune it from the list, so we don't have to look at it any more.
801 print_trace("prune_scavenge_root", cur);
802 unlink_scavenge_root_nmethod(cur, last);
803 }
804 cur = next;
805 }
806
807 // Check for stray marks.
808 debug_only(verify_perm_nmethods(NULL));
809 }
810
811 #ifndef PRODUCT
812 void CodeCache::asserted_non_scavengable_nmethods_do(CodeBlobClosure* f) {
813 if (UseG1GC) {
814 return;
815 }
816
817 // While we are here, verify the integrity of the list.
818 mark_scavenge_root_nmethods();
819 for (nmethod* cur = scavenge_root_nmethods(); cur != NULL; cur = cur->scavenge_root_link()) {
820 assert(cur->on_scavenge_root_list(), "else shouldn't be on this list");
821 cur->clear_scavenge_root_marked();
822 }
823 verify_perm_nmethods(f);
824 }
825
826 // Temporarily mark nmethods that are claimed to be on the non-perm list.
827 void CodeCache::mark_scavenge_root_nmethods() {
828 NMethodIterator iter;
829 while(iter.next_alive()) {
830 nmethod* nm = iter.method();
831 assert(nm->scavenge_root_not_marked(), "clean state");
832 if (nm->on_scavenge_root_list())
833 nm->set_scavenge_root_marked();
834 }
835 }
836
837 // If the closure is given, run it on the unlisted nmethods.
838 // Also make sure that the effects of mark_scavenge_root_nmethods is gone.
839 void CodeCache::verify_perm_nmethods(CodeBlobClosure* f_or_null) {
840 NMethodIterator iter;
841 while(iter.next_alive()) {
842 nmethod* nm = iter.method();
843 bool call_f = (f_or_null != NULL);
844 assert(nm->scavenge_root_not_marked(), "must be already processed");
845 if (nm->on_scavenge_root_list())
846 call_f = false; // don't show this one to the client
847 nm->verify_scavenge_root_oops();
848 if (call_f) f_or_null->do_code_blob(nm);
849 }
850 }
851 #endif //PRODUCT
852
853 void CodeCache::verify_clean_inline_caches() {
854 #ifdef ASSERT
855 NMethodIterator iter;
856 while(iter.next_alive()) {
857 nmethod* nm = iter.method();
858 assert(!nm->is_unloaded(), "Tautology");
859 nm->verify_clean_inline_caches();
860 nm->verify();
861 }
862 #endif
863 }
864
865 void CodeCache::verify_icholder_relocations() {
866 #ifdef ASSERT
867 // make sure that we aren't leaking icholders
868 int count = 0;
869 FOR_ALL_HEAPS(heap) {
870 FOR_ALL_BLOBS(cb, *heap) {
871 CompiledMethod *nm = cb->as_compiled_method_or_null();
872 if (nm != NULL) {
873 count += nm->verify_icholder_relocations();
874 }
875 }
876 }
877 assert(count + InlineCacheBuffer::pending_icholder_count() + CompiledICHolder::live_not_claimed_count() ==
878 CompiledICHolder::live_count(), "must agree");
879 #endif
880 }
881
882 void CodeCache::gc_prologue() {
883 }
884
885 void CodeCache::gc_epilogue() {
886 assert_locked_or_safepoint(CodeCache_lock);
887 NOT_DEBUG(if (needs_cache_clean())) {
888 CompiledMethodIterator iter;
889 while(iter.next_alive()) {
890 CompiledMethod* cm = iter.method();
891 assert(!cm->is_unloaded(), "Tautology");
892 DEBUG_ONLY(if (needs_cache_clean())) {
893 cm->cleanup_inline_caches();
894 }
895 DEBUG_ONLY(cm->verify());
896 DEBUG_ONLY(cm->verify_oop_relocations());
897 }
898 }
899
900 set_needs_cache_clean(false);
901 prune_scavenge_root_nmethods();
902
903 verify_icholder_relocations();
904 }
905
906 void CodeCache::verify_oops() {
907 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
908 VerifyOopClosure voc;
909 NMethodIterator iter;
910 while(iter.next_alive()) {
911 nmethod* nm = iter.method();
912 nm->oops_do(&voc);
913 nm->verify_oop_relocations();
914 }
915 }
916
917 int CodeCache::blob_count(int code_blob_type) {
918 CodeHeap* heap = get_code_heap(code_blob_type);
919 return (heap != NULL) ? heap->blob_count() : 0;
920 }
921
922 int CodeCache::blob_count() {
923 int count = 0;
924 FOR_ALL_HEAPS(heap) {
925 count += (*heap)->blob_count();
926 }
927 return count;
928 }
929
930 int CodeCache::nmethod_count(int code_blob_type) {
931 CodeHeap* heap = get_code_heap(code_blob_type);
932 return (heap != NULL) ? heap->nmethod_count() : 0;
933 }
934
935 int CodeCache::nmethod_count() {
936 int count = 0;
937 FOR_ALL_NMETHOD_HEAPS(heap) {
938 count += (*heap)->nmethod_count();
939 }
940 return count;
941 }
942
943 int CodeCache::adapter_count(int code_blob_type) {
944 CodeHeap* heap = get_code_heap(code_blob_type);
945 return (heap != NULL) ? heap->adapter_count() : 0;
946 }
947
948 int CodeCache::adapter_count() {
949 int count = 0;
950 FOR_ALL_HEAPS(heap) {
951 count += (*heap)->adapter_count();
952 }
953 return count;
954 }
955
956 address CodeCache::low_bound(int code_blob_type) {
957 CodeHeap* heap = get_code_heap(code_blob_type);
958 return (heap != NULL) ? (address)heap->low_boundary() : NULL;
959 }
960
961 address CodeCache::high_bound(int code_blob_type) {
962 CodeHeap* heap = get_code_heap(code_blob_type);
963 return (heap != NULL) ? (address)heap->high_boundary() : NULL;
964 }
965
966 size_t CodeCache::capacity() {
967 size_t cap = 0;
968 FOR_ALL_NMETHOD_HEAPS(heap) {
969 cap += (*heap)->capacity();
970 }
971 return cap;
972 }
973
974 size_t CodeCache::unallocated_capacity(int code_blob_type) {
975 CodeHeap* heap = get_code_heap(code_blob_type);
976 return (heap != NULL) ? heap->unallocated_capacity() : 0;
977 }
978
979 size_t CodeCache::unallocated_capacity() {
980 size_t unallocated_cap = 0;
981 FOR_ALL_NMETHOD_HEAPS(heap) {
982 unallocated_cap += (*heap)->unallocated_capacity();
983 }
984 return unallocated_cap;
985 }
986
987 size_t CodeCache::max_capacity() {
988 size_t max_cap = 0;
989 FOR_ALL_NMETHOD_HEAPS(heap) {
990 max_cap += (*heap)->max_capacity();
991 }
992 return max_cap;
993 }
994
995 /**
996 * Returns the reverse free ratio. E.g., if 25% (1/4) of the code heap
997 * is free, reverse_free_ratio() returns 4.
998 */
999 double CodeCache::reverse_free_ratio(int code_blob_type) {
1000 CodeHeap* heap = get_code_heap(code_blob_type);
1001 if (heap == NULL) {
1002 return 0;
1003 }
1004
1005 double unallocated_capacity = MAX2((double)heap->unallocated_capacity(), 1.0); // Avoid division by 0;
1006 double max_capacity = (double)heap->max_capacity();
1007 double result = max_capacity / unallocated_capacity;
1008 assert (max_capacity >= unallocated_capacity, "Must be");
1009 assert (result >= 1.0, "reverse_free_ratio must be at least 1. It is %f", result);
1010 return result;
1011 }
1012
1013 size_t CodeCache::bytes_allocated_in_freelists() {
1014 size_t allocated_bytes = 0;
1015 FOR_ALL_NMETHOD_HEAPS(heap) {
1016 allocated_bytes += (*heap)->allocated_in_freelist();
1017 }
1018 return allocated_bytes;
1019 }
1020
1021 int CodeCache::allocated_segments() {
1022 int number_of_segments = 0;
1023 FOR_ALL_NMETHOD_HEAPS(heap) {
1024 number_of_segments += (*heap)->allocated_segments();
1025 }
1026 return number_of_segments;
1027 }
1028
1029 size_t CodeCache::freelists_length() {
1030 size_t length = 0;
1031 FOR_ALL_NMETHOD_HEAPS(heap) {
1032 length += (*heap)->freelist_length();
1033 }
1034 return length;
1035 }
1036
1037 void icache_init();
1038
1039 void CodeCache::initialize() {
1040 assert(CodeCacheSegmentSize >= (uintx)CodeEntryAlignment, "CodeCacheSegmentSize must be large enough to align entry points");
1041 #ifdef COMPILER2
1042 assert(CodeCacheSegmentSize >= (uintx)OptoLoopAlignment, "CodeCacheSegmentSize must be large enough to align inner loops");
1043 #endif
1044 assert(CodeCacheSegmentSize >= sizeof(jdouble), "CodeCacheSegmentSize must be large enough to align constants");
1045 // This was originally just a check of the alignment, causing failure, instead, round
1046 // the code cache to the page size. In particular, Solaris is moving to a larger
1047 // default page size.
1048 CodeCacheExpansionSize = round_to(CodeCacheExpansionSize, os::vm_page_size());
1049
1050 if (SegmentedCodeCache) {
1051 // Use multiple code heaps
1052 initialize_heaps();
1053 } else {
1054 // Use a single code heap
1055 FLAG_SET_ERGO(uintx, NonNMethodCodeHeapSize, 0);
1056 FLAG_SET_ERGO(uintx, ProfiledCodeHeapSize, 0);
1057 FLAG_SET_ERGO(uintx, NonProfiledCodeHeapSize, 0);
1058 ReservedCodeSpace rs = reserve_heap_memory(ReservedCodeCacheSize);
1059 add_heap(rs, "CodeCache", CodeBlobType::All);
1060 }
1061
1062 // Initialize ICache flush mechanism
1063 // This service is needed for os::register_code_area
1064 icache_init();
1065
1066 // Give OS a chance to register generated code area.
1067 // This is used on Windows 64 bit platforms to register
1068 // Structured Exception Handlers for our generated code.
1069 os::register_code_area((char*)low_bound(), (char*)high_bound());
1070 }
1071
1072 void codeCache_init() {
1073 CodeCache::initialize();
1074 // Load AOT libraries and add AOT code heaps.
1075 AOTLoader::initialize();
1076 }
1077
1078 //------------------------------------------------------------------------------------------------
1079
1080 int CodeCache::number_of_nmethods_with_dependencies() {
1081 return _number_of_nmethods_with_dependencies;
1082 }
1083
1084 void CodeCache::clear_inline_caches() {
1085 assert_locked_or_safepoint(CodeCache_lock);
1086 CompiledMethodIterator iter;
1087 while(iter.next_alive()) {
1088 iter.method()->clear_inline_caches();
1089 }
1090 }
1091
1092 void CodeCache::cleanup_inline_caches() {
1093 assert_locked_or_safepoint(CodeCache_lock);
1094 NMethodIterator iter;
1095 while(iter.next_alive()) {
1096 iter.method()->cleanup_inline_caches(/*clean_all=*/true);
1097 }
1098 }
1099
1100 // Keeps track of time spent for checking dependencies
1101 NOT_PRODUCT(static elapsedTimer dependentCheckTime;)
1102
1103 int CodeCache::mark_for_deoptimization(KlassDepChange& changes) {
1104 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1105 int number_of_marked_CodeBlobs = 0;
1106
1107 // search the hierarchy looking for nmethods which are affected by the loading of this class
1108
1109 // then search the interfaces this class implements looking for nmethods
1110 // which might be dependent of the fact that an interface only had one
1111 // implementor.
1112 // nmethod::check_all_dependencies works only correctly, if no safepoint
1113 // can happen
1114 NoSafepointVerifier nsv;
1115 for (DepChange::ContextStream str(changes, nsv); str.next(); ) {
1116 Klass* d = str.klass();
1117 number_of_marked_CodeBlobs += InstanceKlass::cast(d)->mark_dependent_nmethods(changes);
1118 }
1119
1120 #ifndef PRODUCT
1121 if (VerifyDependencies) {
1122 // Object pointers are used as unique identifiers for dependency arguments. This
1123 // is only possible if no safepoint, i.e., GC occurs during the verification code.
1124 dependentCheckTime.start();
1125 nmethod::check_all_dependencies(changes);
1126 dependentCheckTime.stop();
1127 }
1128 #endif
1129
1130 return number_of_marked_CodeBlobs;
1131 }
1132
1133 CompiledMethod* CodeCache::find_compiled(void* start) {
1134 CodeBlob *cb = find_blob(start);
1135 assert(cb == NULL || cb->is_compiled(), "did not find an compiled_method");
1136 return (CompiledMethod*)cb;
1137 }
1138
1139 bool CodeCache::is_far_target(address target) {
1140 #if INCLUDE_AOT
1141 return NativeCall::is_far_call(_low_bound, target) ||
1142 NativeCall::is_far_call(_high_bound, target);
1143 #else
1144 return false;
1145 #endif
1146 }
1147
1148 #ifdef HOTSWAP
1149 int CodeCache::mark_for_evol_deoptimization(instanceKlassHandle dependee) {
1150 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1151 int number_of_marked_CodeBlobs = 0;
1152
1153 // Deoptimize all methods of the evolving class itself
1154 Array<Method*>* old_methods = dependee->methods();
1155 for (int i = 0; i < old_methods->length(); i++) {
1156 ResourceMark rm;
1157 Method* old_method = old_methods->at(i);
1158 CompiledMethod* nm = old_method->code();
1159 if (nm != NULL) {
1160 nm->mark_for_deoptimization();
1161 number_of_marked_CodeBlobs++;
1162 }
1163 }
1164
1165 CompiledMethodIterator iter;
1166 while(iter.next_alive()) {
1167 CompiledMethod* nm = iter.method();
1168 if (nm->is_marked_for_deoptimization()) {
1169 // ...Already marked in the previous pass; don't count it again.
1170 } else if (nm->is_evol_dependent_on(dependee())) {
1171 ResourceMark rm;
1172 nm->mark_for_deoptimization();
1173 number_of_marked_CodeBlobs++;
1174 } else {
1175 // flush caches in case they refer to a redefined Method*
1176 nm->clear_inline_caches();
1177 }
1178 }
1179
1180 return number_of_marked_CodeBlobs;
1181 }
1182 #endif // HOTSWAP
1183
1184
1185 // Deoptimize all methods
1186 void CodeCache::mark_all_nmethods_for_deoptimization() {
1187 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1188 CompiledMethodIterator iter;
1189 while(iter.next_alive()) {
1190 CompiledMethod* nm = iter.method();
1191 if (!nm->method()->is_method_handle_intrinsic()) {
1192 nm->mark_for_deoptimization();
1193 }
1194 }
1195 }
1196
1197 int CodeCache::mark_for_deoptimization(Method* dependee) {
1198 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1199 int number_of_marked_CodeBlobs = 0;
1200
1201 CompiledMethodIterator iter;
1202 while(iter.next_alive()) {
1203 CompiledMethod* nm = iter.method();
1204 if (nm->is_dependent_on_method(dependee)) {
1205 ResourceMark rm;
1206 nm->mark_for_deoptimization();
1207 number_of_marked_CodeBlobs++;
1208 }
1209 }
1210
1211 return number_of_marked_CodeBlobs;
1212 }
1213
1214 void CodeCache::make_marked_nmethods_not_entrant() {
1215 assert_locked_or_safepoint(CodeCache_lock);
1216 CompiledMethodIterator iter;
1217 while(iter.next_alive()) {
1218 CompiledMethod* nm = iter.method();
1219 if (nm->is_marked_for_deoptimization() && !nm->is_not_entrant()) {
1220 nm->make_not_entrant();
1221 }
1222 }
1223 }
1224
1225 // Flushes compiled methods dependent on dependee.
1226 void CodeCache::flush_dependents_on(instanceKlassHandle dependee) {
1227 assert_lock_strong(Compile_lock);
1228
1229 if (number_of_nmethods_with_dependencies() == 0) return;
1230
1231 // CodeCache can only be updated by a thread_in_VM and they will all be
1232 // stopped during the safepoint so CodeCache will be safe to update without
1233 // holding the CodeCache_lock.
1234
1235 KlassDepChange changes(dependee);
1236
1237 // Compute the dependent nmethods
1238 if (mark_for_deoptimization(changes) > 0) {
1239 // At least one nmethod has been marked for deoptimization
1240 VM_Deoptimize op;
1241 VMThread::execute(&op);
1242 }
1243 }
1244
1245 #ifdef HOTSWAP
1246 // Flushes compiled methods dependent on dependee in the evolutionary sense
1247 void CodeCache::flush_evol_dependents_on(instanceKlassHandle ev_k_h) {
1248 // --- Compile_lock is not held. However we are at a safepoint.
1249 assert_locked_or_safepoint(Compile_lock);
1250 if (number_of_nmethods_with_dependencies() == 0 && !UseAOT) return;
1251
1252 // CodeCache can only be updated by a thread_in_VM and they will all be
1253 // stopped during the safepoint so CodeCache will be safe to update without
1254 // holding the CodeCache_lock.
1255
1256 // Compute the dependent nmethods
1257 if (mark_for_evol_deoptimization(ev_k_h) > 0) {
1258 // At least one nmethod has been marked for deoptimization
1259
1260 // All this already happens inside a VM_Operation, so we'll do all the work here.
1261 // Stuff copied from VM_Deoptimize and modified slightly.
1262
1263 // We do not want any GCs to happen while we are in the middle of this VM operation
1264 ResourceMark rm;
1265 DeoptimizationMarker dm;
1266
1267 // Deoptimize all activations depending on marked nmethods
1268 Deoptimization::deoptimize_dependents();
1269
1270 // Make the dependent methods not entrant
1271 make_marked_nmethods_not_entrant();
1272 }
1273 }
1274 #endif // HOTSWAP
1275
1276
1277 // Flushes compiled methods dependent on dependee
1278 void CodeCache::flush_dependents_on_method(methodHandle m_h) {
1279 // --- Compile_lock is not held. However we are at a safepoint.
1280 assert_locked_or_safepoint(Compile_lock);
1281
1282 // CodeCache can only be updated by a thread_in_VM and they will all be
1283 // stopped dring the safepoint so CodeCache will be safe to update without
1284 // holding the CodeCache_lock.
1285
1286 // Compute the dependent nmethods
1287 if (mark_for_deoptimization(m_h()) > 0) {
1288 // At least one nmethod has been marked for deoptimization
1289
1290 // All this already happens inside a VM_Operation, so we'll do all the work here.
1291 // Stuff copied from VM_Deoptimize and modified slightly.
1292
1293 // We do not want any GCs to happen while we are in the middle of this VM operation
1294 ResourceMark rm;
1295 DeoptimizationMarker dm;
1296
1297 // Deoptimize all activations depending on marked nmethods
1298 Deoptimization::deoptimize_dependents();
1299
1300 // Make the dependent methods not entrant
1301 make_marked_nmethods_not_entrant();
1302 }
1303 }
1304
1305 void CodeCache::verify() {
1306 assert_locked_or_safepoint(CodeCache_lock);
1307 FOR_ALL_HEAPS(heap) {
1308 (*heap)->verify();
1309 FOR_ALL_BLOBS(cb, *heap) {
1310 if (cb->is_alive()) {
1311 cb->verify();
1312 }
1313 }
1314 }
1315 }
1316
1317 // A CodeHeap is full. Print out warning and report event.
1318 void CodeCache::report_codemem_full(int code_blob_type, bool print) {
1319 // Get nmethod heap for the given CodeBlobType and build CodeCacheFull event
1320 CodeHeap* heap = get_code_heap(code_blob_type);
1321 assert(heap != NULL, "heap is null");
1322
1323 if ((heap->full_count() == 0) || print) {
1324 // Not yet reported for this heap, report
1325 if (SegmentedCodeCache) {
1326 warning("%s is full. Compiler has been disabled.", get_code_heap_name(code_blob_type));
1327 warning("Try increasing the code heap size using -XX:%s=", get_code_heap_flag_name(code_blob_type));
1328 } else {
1329 warning("CodeCache is full. Compiler has been disabled.");
1330 warning("Try increasing the code cache size using -XX:ReservedCodeCacheSize=");
1331 }
1332 ResourceMark rm;
1333 stringStream s;
1334 // Dump code cache into a buffer before locking the tty,
1335 {
1336 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1337 print_summary(&s);
1338 }
1339 ttyLocker ttyl;
1340 tty->print("%s", s.as_string());
1341 }
1342
1343 heap->report_full();
1344
1345 EventCodeCacheFull event;
1346 if (event.should_commit()) {
1347 event.set_codeBlobType((u1)code_blob_type);
1348 event.set_startAddress((u8)heap->low_boundary());
1349 event.set_commitedTopAddress((u8)heap->high());
1350 event.set_reservedTopAddress((u8)heap->high_boundary());
1351 event.set_entryCount(heap->blob_count());
1352 event.set_methodCount(heap->nmethod_count());
1353 event.set_adaptorCount(heap->adapter_count());
1354 event.set_unallocatedCapacity(heap->unallocated_capacity());
1355 event.set_fullCount(heap->full_count());
1356 event.commit();
1357 }
1358 }
1359
1360 void CodeCache::print_memory_overhead() {
1361 size_t wasted_bytes = 0;
1362 FOR_ALL_NMETHOD_HEAPS(heap) {
1363 CodeHeap* curr_heap = *heap;
1364 for (CodeBlob* cb = (CodeBlob*)curr_heap->first(); cb != NULL; cb = (CodeBlob*)curr_heap->next(cb)) {
1365 HeapBlock* heap_block = ((HeapBlock*)cb) - 1;
1366 wasted_bytes += heap_block->length() * CodeCacheSegmentSize - cb->size();
1367 }
1368 }
1369 // Print bytes that are allocated in the freelist
1370 ttyLocker ttl;
1371 tty->print_cr("Number of elements in freelist: " SSIZE_FORMAT, freelists_length());
1372 tty->print_cr("Allocated in freelist: " SSIZE_FORMAT "kB", bytes_allocated_in_freelists()/K);
1373 tty->print_cr("Unused bytes in CodeBlobs: " SSIZE_FORMAT "kB", (wasted_bytes/K));
1374 tty->print_cr("Segment map size: " SSIZE_FORMAT "kB", allocated_segments()/K); // 1 byte per segment
1375 }
1376
1377 //------------------------------------------------------------------------------------------------
1378 // Non-product version
1379
1380 #ifndef PRODUCT
1381
1382 void CodeCache::print_trace(const char* event, CodeBlob* cb, int size) {
1383 if (PrintCodeCache2) { // Need to add a new flag
1384 ResourceMark rm;
1385 if (size == 0) size = cb->size();
1386 tty->print_cr("CodeCache %s: addr: " INTPTR_FORMAT ", size: 0x%x", event, p2i(cb), size);
1387 }
1388 }
1389
1390 void CodeCache::print_internals() {
1391 int nmethodCount = 0;
1392 int runtimeStubCount = 0;
1393 int adapterCount = 0;
1394 int deoptimizationStubCount = 0;
1395 int uncommonTrapStubCount = 0;
1396 int bufferBlobCount = 0;
1397 int total = 0;
1398 int nmethodAlive = 0;
1399 int nmethodNotEntrant = 0;
1400 int nmethodZombie = 0;
1401 int nmethodUnloaded = 0;
1402 int nmethodJava = 0;
1403 int nmethodNative = 0;
1404 int max_nm_size = 0;
1405 ResourceMark rm;
1406
1407 int i = 0;
1408 FOR_ALL_NMETHOD_HEAPS(heap) {
1409 if ((_nmethod_heaps->length() >= 1) && Verbose) {
1410 tty->print_cr("-- %s --", (*heap)->name());
1411 }
1412 FOR_ALL_BLOBS(cb, *heap) {
1413 total++;
1414 if (cb->is_nmethod()) {
1415 nmethod* nm = (nmethod*)cb;
1416
1417 if (Verbose && nm->method() != NULL) {
1418 ResourceMark rm;
1419 char *method_name = nm->method()->name_and_sig_as_C_string();
1420 tty->print("%s", method_name);
1421 if(nm->is_alive()) { tty->print_cr(" alive"); }
1422 if(nm->is_not_entrant()) { tty->print_cr(" not-entrant"); }
1423 if(nm->is_zombie()) { tty->print_cr(" zombie"); }
1424 }
1425
1426 nmethodCount++;
1427
1428 if(nm->is_alive()) { nmethodAlive++; }
1429 if(nm->is_not_entrant()) { nmethodNotEntrant++; }
1430 if(nm->is_zombie()) { nmethodZombie++; }
1431 if(nm->is_unloaded()) { nmethodUnloaded++; }
1432 if(nm->method() != NULL && nm->is_native_method()) { nmethodNative++; }
1433
1434 if(nm->method() != NULL && nm->is_java_method()) {
1435 nmethodJava++;
1436 max_nm_size = MAX2(max_nm_size, nm->size());
1437 }
1438 } else if (cb->is_runtime_stub()) {
1439 runtimeStubCount++;
1440 } else if (cb->is_deoptimization_stub()) {
1441 deoptimizationStubCount++;
1442 } else if (cb->is_uncommon_trap_stub()) {
1443 uncommonTrapStubCount++;
1444 } else if (cb->is_adapter_blob()) {
1445 adapterCount++;
1446 } else if (cb->is_buffer_blob()) {
1447 bufferBlobCount++;
1448 }
1449 }
1450 }
1451
1452 int bucketSize = 512;
1453 int bucketLimit = max_nm_size / bucketSize + 1;
1454 int *buckets = NEW_C_HEAP_ARRAY(int, bucketLimit, mtCode);
1455 memset(buckets, 0, sizeof(int) * bucketLimit);
1456
1457 NMethodIterator iter;
1458 while(iter.next()) {
1459 nmethod* nm = iter.method();
1460 if(nm->method() != NULL && nm->is_java_method()) {
1461 buckets[nm->size() / bucketSize]++;
1462 }
1463 }
1464
1465 tty->print_cr("Code Cache Entries (total of %d)",total);
1466 tty->print_cr("-------------------------------------------------");
1467 tty->print_cr("nmethods: %d",nmethodCount);
1468 tty->print_cr("\talive: %d",nmethodAlive);
1469 tty->print_cr("\tnot_entrant: %d",nmethodNotEntrant);
1470 tty->print_cr("\tzombie: %d",nmethodZombie);
1471 tty->print_cr("\tunloaded: %d",nmethodUnloaded);
1472 tty->print_cr("\tjava: %d",nmethodJava);
1473 tty->print_cr("\tnative: %d",nmethodNative);
1474 tty->print_cr("runtime_stubs: %d",runtimeStubCount);
1475 tty->print_cr("adapters: %d",adapterCount);
1476 tty->print_cr("buffer blobs: %d",bufferBlobCount);
1477 tty->print_cr("deoptimization_stubs: %d",deoptimizationStubCount);
1478 tty->print_cr("uncommon_traps: %d",uncommonTrapStubCount);
1479 tty->print_cr("\nnmethod size distribution (non-zombie java)");
1480 tty->print_cr("-------------------------------------------------");
1481
1482 for(int i=0; i<bucketLimit; i++) {
1483 if(buckets[i] != 0) {
1484 tty->print("%d - %d bytes",i*bucketSize,(i+1)*bucketSize);
1485 tty->fill_to(40);
1486 tty->print_cr("%d",buckets[i]);
1487 }
1488 }
1489
1490 FREE_C_HEAP_ARRAY(int, buckets);
1491 print_memory_overhead();
1492 }
1493
1494 #endif // !PRODUCT
1495
1496 void CodeCache::print() {
1497 print_summary(tty);
1498
1499 #ifndef PRODUCT
1500 if (!Verbose) return;
1501
1502 CodeBlob_sizes live;
1503 CodeBlob_sizes dead;
1504
1505 FOR_ALL_NMETHOD_HEAPS(heap) {
1506 FOR_ALL_BLOBS(cb, *heap) {
1507 if (!cb->is_alive()) {
1508 dead.add(cb);
1509 } else {
1510 live.add(cb);
1511 }
1512 }
1513 }
1514
1515 tty->print_cr("CodeCache:");
1516 tty->print_cr("nmethod dependency checking time %fs", dependentCheckTime.seconds());
1517
1518 if (!live.is_empty()) {
1519 live.print("live");
1520 }
1521 if (!dead.is_empty()) {
1522 dead.print("dead");
1523 }
1524
1525 if (WizardMode) {
1526 // print the oop_map usage
1527 int code_size = 0;
1528 int number_of_blobs = 0;
1529 int number_of_oop_maps = 0;
1530 int map_size = 0;
1531 FOR_ALL_NMETHOD_HEAPS(heap) {
1532 FOR_ALL_BLOBS(cb, *heap) {
1533 if (cb->is_alive()) {
1534 number_of_blobs++;
1535 code_size += cb->code_size();
1536 ImmutableOopMapSet* set = cb->oop_maps();
1537 if (set != NULL) {
1538 number_of_oop_maps += set->count();
1539 map_size += set->nr_of_bytes();
1540 }
1541 }
1542 }
1543 }
1544 tty->print_cr("OopMaps");
1545 tty->print_cr(" #blobs = %d", number_of_blobs);
1546 tty->print_cr(" code size = %d", code_size);
1547 tty->print_cr(" #oop_maps = %d", number_of_oop_maps);
1548 tty->print_cr(" map size = %d", map_size);
1549 }
1550
1551 #endif // !PRODUCT
1552 }
1553
1554 void CodeCache::print_summary(outputStream* st, bool detailed) {
1555 FOR_ALL_HEAPS(heap_iterator) {
1556 CodeHeap* heap = (*heap_iterator);
1557 size_t total = (heap->high_boundary() - heap->low_boundary());
1558 if (_heaps->length() >= 1) {
1559 st->print("%s:", heap->name());
1560 } else {
1561 st->print("CodeCache:");
1562 }
1563 st->print_cr(" size=" SIZE_FORMAT "Kb used=" SIZE_FORMAT
1564 "Kb max_used=" SIZE_FORMAT "Kb free=" SIZE_FORMAT "Kb",
1565 total/K, (total - heap->unallocated_capacity())/K,
1566 heap->max_allocated_capacity()/K, heap->unallocated_capacity()/K);
1567
1568 if (detailed) {
1569 st->print_cr(" bounds [" INTPTR_FORMAT ", " INTPTR_FORMAT ", " INTPTR_FORMAT "]",
1570 p2i(heap->low_boundary()),
1571 p2i(heap->high()),
1572 p2i(heap->high_boundary()));
1573 }
1574 }
1575
1576 if (detailed) {
1577 st->print_cr(" total_blobs=" UINT32_FORMAT " nmethods=" UINT32_FORMAT
1578 " adapters=" UINT32_FORMAT,
1579 blob_count(), nmethod_count(), adapter_count());
1580 st->print_cr(" compilation: %s", CompileBroker::should_compile_new_jobs() ?
1581 "enabled" : Arguments::mode() == Arguments::_int ?
1582 "disabled (interpreter mode)" :
1583 "disabled (not enough contiguous free space left)");
1584 }
1585 }
1586
1587 void CodeCache::print_codelist(outputStream* st) {
1588 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1589
1590 NMethodIterator iter;
1591 while(iter.next_alive()) {
1592 nmethod* nm = iter.method();
1593 ResourceMark rm;
1594 char *method_name = nm->method()->name_and_sig_as_C_string();
1595 st->print_cr("%d %d %s [" INTPTR_FORMAT ", " INTPTR_FORMAT " - " INTPTR_FORMAT "]",
1596 nm->compile_id(), nm->comp_level(), method_name, (intptr_t)nm->header_begin(),
1597 (intptr_t)nm->code_begin(), (intptr_t)nm->code_end());
1598 }
1599 }
1600
1601 void CodeCache::print_layout(outputStream* st) {
1602 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1603 ResourceMark rm;
1604 print_summary(st, true);
1605 }
1606
1607 void CodeCache::log_state(outputStream* st) {
1608 st->print(" total_blobs='" UINT32_FORMAT "' nmethods='" UINT32_FORMAT "'"
1609 " adapters='" UINT32_FORMAT "' free_code_cache='" SIZE_FORMAT "'",
1610 blob_count(), nmethod_count(), adapter_count(),
1611 unallocated_capacity());
1612 }
1613