Wed, 11 Jan 2017 04:26:49 -0800
8164293: HotSpot leaking memory in long-running requests
Summary: Applied RMs in sweep_code_cache and related codes.
Reviewed-by: kvn, thartmann
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/codeCache.hpp"
27 #include "code/compiledIC.hpp"
28 #include "code/dependencies.hpp"
29 #include "code/nmethod.hpp"
30 #include "code/scopeDesc.hpp"
31 #include "compiler/abstractCompiler.hpp"
32 #include "compiler/compileBroker.hpp"
33 #include "compiler/compileLog.hpp"
34 #include "compiler/compilerOracle.hpp"
35 #include "compiler/disassembler.hpp"
36 #include "interpreter/bytecode.hpp"
37 #include "oops/methodData.hpp"
38 #include "prims/jvmtiRedefineClassesTrace.hpp"
39 #include "prims/jvmtiImpl.hpp"
40 #include "runtime/orderAccess.inline.hpp"
41 #include "runtime/sharedRuntime.hpp"
42 #include "runtime/sweeper.hpp"
43 #include "utilities/dtrace.hpp"
44 #include "utilities/events.hpp"
45 #include "utilities/xmlstream.hpp"
46 #ifdef SHARK
47 #include "shark/sharkCompiler.hpp"
48 #endif
50 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
52 unsigned char nmethod::_global_unloading_clock = 0;
54 #ifdef DTRACE_ENABLED
56 // Only bother with this argument setup if dtrace is available
58 #ifndef USDT2
59 HS_DTRACE_PROBE_DECL8(hotspot, compiled__method__load,
60 const char*, int, const char*, int, const char*, int, void*, size_t);
62 HS_DTRACE_PROBE_DECL6(hotspot, compiled__method__unload,
63 char*, int, char*, int, char*, int);
65 #define DTRACE_METHOD_UNLOAD_PROBE(method) \
66 { \
67 Method* m = (method); \
68 if (m != NULL) { \
69 Symbol* klass_name = m->klass_name(); \
70 Symbol* name = m->name(); \
71 Symbol* signature = m->signature(); \
72 HS_DTRACE_PROBE6(hotspot, compiled__method__unload, \
73 klass_name->bytes(), klass_name->utf8_length(), \
74 name->bytes(), name->utf8_length(), \
75 signature->bytes(), signature->utf8_length()); \
76 } \
77 }
78 #else /* USDT2 */
79 #define DTRACE_METHOD_UNLOAD_PROBE(method) \
80 { \
81 Method* m = (method); \
82 if (m != NULL) { \
83 Symbol* klass_name = m->klass_name(); \
84 Symbol* name = m->name(); \
85 Symbol* signature = m->signature(); \
86 HOTSPOT_COMPILED_METHOD_UNLOAD( \
87 (char *) klass_name->bytes(), klass_name->utf8_length(), \
88 (char *) name->bytes(), name->utf8_length(), \
89 (char *) signature->bytes(), signature->utf8_length()); \
90 } \
91 }
92 #endif /* USDT2 */
94 #else // ndef DTRACE_ENABLED
96 #define DTRACE_METHOD_UNLOAD_PROBE(method)
98 #endif
100 bool nmethod::is_compiled_by_c1() const {
101 if (compiler() == NULL) {
102 return false;
103 }
104 return compiler()->is_c1();
105 }
106 bool nmethod::is_compiled_by_c2() const {
107 if (compiler() == NULL) {
108 return false;
109 }
110 return compiler()->is_c2();
111 }
112 bool nmethod::is_compiled_by_shark() const {
113 if (compiler() == NULL) {
114 return false;
115 }
116 return compiler()->is_shark();
117 }
121 //---------------------------------------------------------------------------------
122 // NMethod statistics
123 // They are printed under various flags, including:
124 // PrintC1Statistics, PrintOptoStatistics, LogVMOutput, and LogCompilation.
125 // (In the latter two cases, they like other stats are printed to the log only.)
127 #ifndef PRODUCT
128 // These variables are put into one block to reduce relocations
129 // and make it simpler to print from the debugger.
130 static
131 struct nmethod_stats_struct {
132 int nmethod_count;
133 int total_size;
134 int relocation_size;
135 int consts_size;
136 int insts_size;
137 int stub_size;
138 int scopes_data_size;
139 int scopes_pcs_size;
140 int dependencies_size;
141 int handler_table_size;
142 int nul_chk_table_size;
143 int oops_size;
145 void note_nmethod(nmethod* nm) {
146 nmethod_count += 1;
147 total_size += nm->size();
148 relocation_size += nm->relocation_size();
149 consts_size += nm->consts_size();
150 insts_size += nm->insts_size();
151 stub_size += nm->stub_size();
152 oops_size += nm->oops_size();
153 scopes_data_size += nm->scopes_data_size();
154 scopes_pcs_size += nm->scopes_pcs_size();
155 dependencies_size += nm->dependencies_size();
156 handler_table_size += nm->handler_table_size();
157 nul_chk_table_size += nm->nul_chk_table_size();
158 }
159 void print_nmethod_stats() {
160 if (nmethod_count == 0) return;
161 tty->print_cr("Statistics for %d bytecoded nmethods:", nmethod_count);
162 if (total_size != 0) tty->print_cr(" total in heap = %d", total_size);
163 if (relocation_size != 0) tty->print_cr(" relocation = %d", relocation_size);
164 if (consts_size != 0) tty->print_cr(" constants = %d", consts_size);
165 if (insts_size != 0) tty->print_cr(" main code = %d", insts_size);
166 if (stub_size != 0) tty->print_cr(" stub code = %d", stub_size);
167 if (oops_size != 0) tty->print_cr(" oops = %d", oops_size);
168 if (scopes_data_size != 0) tty->print_cr(" scopes data = %d", scopes_data_size);
169 if (scopes_pcs_size != 0) tty->print_cr(" scopes pcs = %d", scopes_pcs_size);
170 if (dependencies_size != 0) tty->print_cr(" dependencies = %d", dependencies_size);
171 if (handler_table_size != 0) tty->print_cr(" handler table = %d", handler_table_size);
172 if (nul_chk_table_size != 0) tty->print_cr(" nul chk table = %d", nul_chk_table_size);
173 }
175 int native_nmethod_count;
176 int native_total_size;
177 int native_relocation_size;
178 int native_insts_size;
179 int native_oops_size;
180 void note_native_nmethod(nmethod* nm) {
181 native_nmethod_count += 1;
182 native_total_size += nm->size();
183 native_relocation_size += nm->relocation_size();
184 native_insts_size += nm->insts_size();
185 native_oops_size += nm->oops_size();
186 }
187 void print_native_nmethod_stats() {
188 if (native_nmethod_count == 0) return;
189 tty->print_cr("Statistics for %d native nmethods:", native_nmethod_count);
190 if (native_total_size != 0) tty->print_cr(" N. total size = %d", native_total_size);
191 if (native_relocation_size != 0) tty->print_cr(" N. relocation = %d", native_relocation_size);
192 if (native_insts_size != 0) tty->print_cr(" N. main code = %d", native_insts_size);
193 if (native_oops_size != 0) tty->print_cr(" N. oops = %d", native_oops_size);
194 }
196 int pc_desc_resets; // number of resets (= number of caches)
197 int pc_desc_queries; // queries to nmethod::find_pc_desc
198 int pc_desc_approx; // number of those which have approximate true
199 int pc_desc_repeats; // number of _pc_descs[0] hits
200 int pc_desc_hits; // number of LRU cache hits
201 int pc_desc_tests; // total number of PcDesc examinations
202 int pc_desc_searches; // total number of quasi-binary search steps
203 int pc_desc_adds; // number of LUR cache insertions
205 void print_pc_stats() {
206 tty->print_cr("PcDesc Statistics: %d queries, %.2f comparisons per query",
207 pc_desc_queries,
208 (double)(pc_desc_tests + pc_desc_searches)
209 / pc_desc_queries);
210 tty->print_cr(" caches=%d queries=%d/%d, hits=%d+%d, tests=%d+%d, adds=%d",
211 pc_desc_resets,
212 pc_desc_queries, pc_desc_approx,
213 pc_desc_repeats, pc_desc_hits,
214 pc_desc_tests, pc_desc_searches, pc_desc_adds);
215 }
216 } nmethod_stats;
217 #endif //PRODUCT
220 //---------------------------------------------------------------------------------
223 ExceptionCache::ExceptionCache(Handle exception, address pc, address handler) {
224 assert(pc != NULL, "Must be non null");
225 assert(exception.not_null(), "Must be non null");
226 assert(handler != NULL, "Must be non null");
228 _count = 0;
229 _exception_type = exception->klass();
230 _next = NULL;
232 add_address_and_handler(pc,handler);
233 }
236 address ExceptionCache::match(Handle exception, address pc) {
237 assert(pc != NULL,"Must be non null");
238 assert(exception.not_null(),"Must be non null");
239 if (exception->klass() == exception_type()) {
240 return (test_address(pc));
241 }
243 return NULL;
244 }
247 bool ExceptionCache::match_exception_with_space(Handle exception) {
248 assert(exception.not_null(),"Must be non null");
249 if (exception->klass() == exception_type() && count() < cache_size) {
250 return true;
251 }
252 return false;
253 }
256 address ExceptionCache::test_address(address addr) {
257 for (int i=0; i<count(); i++) {
258 if (pc_at(i) == addr) {
259 return handler_at(i);
260 }
261 }
262 return NULL;
263 }
266 bool ExceptionCache::add_address_and_handler(address addr, address handler) {
267 if (test_address(addr) == handler) return true;
268 if (count() < cache_size) {
269 set_pc_at(count(),addr);
270 set_handler_at(count(), handler);
271 increment_count();
272 return true;
273 }
274 return false;
275 }
278 // private method for handling exception cache
279 // These methods are private, and used to manipulate the exception cache
280 // directly.
281 ExceptionCache* nmethod::exception_cache_entry_for_exception(Handle exception) {
282 ExceptionCache* ec = exception_cache();
283 while (ec != NULL) {
284 if (ec->match_exception_with_space(exception)) {
285 return ec;
286 }
287 ec = ec->next();
288 }
289 return NULL;
290 }
293 //-----------------------------------------------------------------------------
296 // Helper used by both find_pc_desc methods.
297 static inline bool match_desc(PcDesc* pc, int pc_offset, bool approximate) {
298 NOT_PRODUCT(++nmethod_stats.pc_desc_tests);
299 if (!approximate)
300 return pc->pc_offset() == pc_offset;
301 else
302 return (pc-1)->pc_offset() < pc_offset && pc_offset <= pc->pc_offset();
303 }
305 void PcDescCache::reset_to(PcDesc* initial_pc_desc) {
306 if (initial_pc_desc == NULL) {
307 _pc_descs[0] = NULL; // native method; no PcDescs at all
308 return;
309 }
310 NOT_PRODUCT(++nmethod_stats.pc_desc_resets);
311 // reset the cache by filling it with benign (non-null) values
312 assert(initial_pc_desc->pc_offset() < 0, "must be sentinel");
313 for (int i = 0; i < cache_size; i++)
314 _pc_descs[i] = initial_pc_desc;
315 }
317 PcDesc* PcDescCache::find_pc_desc(int pc_offset, bool approximate) {
318 NOT_PRODUCT(++nmethod_stats.pc_desc_queries);
319 NOT_PRODUCT(if (approximate) ++nmethod_stats.pc_desc_approx);
321 // Note: one might think that caching the most recently
322 // read value separately would be a win, but one would be
323 // wrong. When many threads are updating it, the cache
324 // line it's in would bounce between caches, negating
325 // any benefit.
327 // In order to prevent race conditions do not load cache elements
328 // repeatedly, but use a local copy:
329 PcDesc* res;
331 // Step one: Check the most recently added value.
332 res = _pc_descs[0];
333 if (res == NULL) return NULL; // native method; no PcDescs at all
334 if (match_desc(res, pc_offset, approximate)) {
335 NOT_PRODUCT(++nmethod_stats.pc_desc_repeats);
336 return res;
337 }
339 // Step two: Check the rest of the LRU cache.
340 for (int i = 1; i < cache_size; ++i) {
341 res = _pc_descs[i];
342 if (res->pc_offset() < 0) break; // optimization: skip empty cache
343 if (match_desc(res, pc_offset, approximate)) {
344 NOT_PRODUCT(++nmethod_stats.pc_desc_hits);
345 return res;
346 }
347 }
349 // Report failure.
350 return NULL;
351 }
353 void PcDescCache::add_pc_desc(PcDesc* pc_desc) {
354 NOT_PRODUCT(++nmethod_stats.pc_desc_adds);
355 // Update the LRU cache by shifting pc_desc forward.
356 for (int i = 0; i < cache_size; i++) {
357 PcDesc* next = _pc_descs[i];
358 _pc_descs[i] = pc_desc;
359 pc_desc = next;
360 }
361 }
363 // adjust pcs_size so that it is a multiple of both oopSize and
364 // sizeof(PcDesc) (assumes that if sizeof(PcDesc) is not a multiple
365 // of oopSize, then 2*sizeof(PcDesc) is)
366 static int adjust_pcs_size(int pcs_size) {
367 int nsize = round_to(pcs_size, oopSize);
368 if ((nsize % sizeof(PcDesc)) != 0) {
369 nsize = pcs_size + sizeof(PcDesc);
370 }
371 assert((nsize % oopSize) == 0, "correct alignment");
372 return nsize;
373 }
375 //-----------------------------------------------------------------------------
378 void nmethod::add_exception_cache_entry(ExceptionCache* new_entry) {
379 assert(ExceptionCache_lock->owned_by_self(),"Must hold the ExceptionCache_lock");
380 assert(new_entry != NULL,"Must be non null");
381 assert(new_entry->next() == NULL, "Must be null");
383 if (exception_cache() != NULL) {
384 new_entry->set_next(exception_cache());
385 }
386 set_exception_cache(new_entry);
387 }
389 void nmethod::clean_exception_cache(BoolObjectClosure* is_alive) {
390 ExceptionCache* prev = NULL;
391 ExceptionCache* curr = exception_cache();
393 while (curr != NULL) {
394 ExceptionCache* next = curr->next();
396 Klass* ex_klass = curr->exception_type();
397 if (ex_klass != NULL && !ex_klass->is_loader_alive(is_alive)) {
398 if (prev == NULL) {
399 set_exception_cache(next);
400 } else {
401 prev->set_next(next);
402 }
403 delete curr;
404 // prev stays the same.
405 } else {
406 prev = curr;
407 }
409 curr = next;
410 }
411 }
413 // public method for accessing the exception cache
414 // These are the public access methods.
415 address nmethod::handler_for_exception_and_pc(Handle exception, address pc) {
416 // We never grab a lock to read the exception cache, so we may
417 // have false negatives. This is okay, as it can only happen during
418 // the first few exception lookups for a given nmethod.
419 ExceptionCache* ec = exception_cache();
420 while (ec != NULL) {
421 address ret_val;
422 if ((ret_val = ec->match(exception,pc)) != NULL) {
423 return ret_val;
424 }
425 ec = ec->next();
426 }
427 return NULL;
428 }
431 void nmethod::add_handler_for_exception_and_pc(Handle exception, address pc, address handler) {
432 // There are potential race conditions during exception cache updates, so we
433 // must own the ExceptionCache_lock before doing ANY modifications. Because
434 // we don't lock during reads, it is possible to have several threads attempt
435 // to update the cache with the same data. We need to check for already inserted
436 // copies of the current data before adding it.
438 MutexLocker ml(ExceptionCache_lock);
439 ExceptionCache* target_entry = exception_cache_entry_for_exception(exception);
441 if (target_entry == NULL || !target_entry->add_address_and_handler(pc,handler)) {
442 target_entry = new ExceptionCache(exception,pc,handler);
443 add_exception_cache_entry(target_entry);
444 }
445 }
448 //-------------end of code for ExceptionCache--------------
451 int nmethod::total_size() const {
452 return
453 consts_size() +
454 insts_size() +
455 stub_size() +
456 scopes_data_size() +
457 scopes_pcs_size() +
458 handler_table_size() +
459 nul_chk_table_size();
460 }
462 const char* nmethod::compile_kind() const {
463 if (is_osr_method()) return "osr";
464 if (method() != NULL && is_native_method()) return "c2n";
465 return NULL;
466 }
468 // Fill in default values for various flag fields
469 void nmethod::init_defaults() {
470 _state = in_use;
471 _unloading_clock = 0;
472 _marked_for_reclamation = 0;
473 _has_flushed_dependencies = 0;
474 _has_unsafe_access = 0;
475 _has_method_handle_invokes = 0;
476 _lazy_critical_native = 0;
477 _has_wide_vectors = 0;
478 _marked_for_deoptimization = 0;
479 _lock_count = 0;
480 _stack_traversal_mark = 0;
481 _unload_reported = false; // jvmti state
483 #ifdef ASSERT
484 _oops_are_stale = false;
485 #endif
487 _oops_do_mark_link = NULL;
488 _jmethod_id = NULL;
489 _osr_link = NULL;
490 if (UseG1GC) {
491 _unloading_next = NULL;
492 } else {
493 _scavenge_root_link = NULL;
494 }
495 _scavenge_root_state = 0;
496 _compiler = NULL;
497 #if INCLUDE_RTM_OPT
498 _rtm_state = NoRTM;
499 #endif
500 #ifdef HAVE_DTRACE_H
501 _trap_offset = 0;
502 #endif // def HAVE_DTRACE_H
503 }
505 nmethod* nmethod::new_native_nmethod(methodHandle method,
506 int compile_id,
507 CodeBuffer *code_buffer,
508 int vep_offset,
509 int frame_complete,
510 int frame_size,
511 ByteSize basic_lock_owner_sp_offset,
512 ByteSize basic_lock_sp_offset,
513 OopMapSet* oop_maps) {
514 code_buffer->finalize_oop_references(method);
515 // create nmethod
516 nmethod* nm = NULL;
517 {
518 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
519 int native_nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
520 CodeOffsets offsets;
521 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
522 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
523 nm = new (native_nmethod_size) nmethod(method(), native_nmethod_size,
524 compile_id, &offsets,
525 code_buffer, frame_size,
526 basic_lock_owner_sp_offset,
527 basic_lock_sp_offset, oop_maps);
528 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_native_nmethod(nm));
529 if (PrintAssembly && nm != NULL) {
530 Disassembler::decode(nm);
531 }
532 }
533 // verify nmethod
534 debug_only(if (nm) nm->verify();) // might block
536 if (nm != NULL) {
537 nm->log_new_nmethod();
538 }
540 return nm;
541 }
543 #ifdef HAVE_DTRACE_H
544 nmethod* nmethod::new_dtrace_nmethod(methodHandle method,
545 CodeBuffer *code_buffer,
546 int vep_offset,
547 int trap_offset,
548 int frame_complete,
549 int frame_size) {
550 code_buffer->finalize_oop_references(method);
551 // create nmethod
552 nmethod* nm = NULL;
553 {
554 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
555 int nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
556 CodeOffsets offsets;
557 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
558 offsets.set_value(CodeOffsets::Dtrace_trap, trap_offset);
559 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
561 nm = new (nmethod_size) nmethod(method(), nmethod_size,
562 &offsets, code_buffer, frame_size);
564 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm));
565 if (PrintAssembly && nm != NULL) {
566 Disassembler::decode(nm);
567 }
568 }
569 // verify nmethod
570 debug_only(if (nm) nm->verify();) // might block
572 if (nm != NULL) {
573 nm->log_new_nmethod();
574 }
576 return nm;
577 }
579 #endif // def HAVE_DTRACE_H
581 nmethod* nmethod::new_nmethod(methodHandle method,
582 int compile_id,
583 int entry_bci,
584 CodeOffsets* offsets,
585 int orig_pc_offset,
586 DebugInformationRecorder* debug_info,
587 Dependencies* dependencies,
588 CodeBuffer* code_buffer, int frame_size,
589 OopMapSet* oop_maps,
590 ExceptionHandlerTable* handler_table,
591 ImplicitExceptionTable* nul_chk_table,
592 AbstractCompiler* compiler,
593 int comp_level
594 )
595 {
596 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
597 code_buffer->finalize_oop_references(method);
598 // create nmethod
599 nmethod* nm = NULL;
600 { MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
601 int nmethod_size =
602 allocation_size(code_buffer, sizeof(nmethod))
603 + adjust_pcs_size(debug_info->pcs_size())
604 + round_to(dependencies->size_in_bytes() , oopSize)
605 + round_to(handler_table->size_in_bytes(), oopSize)
606 + round_to(nul_chk_table->size_in_bytes(), oopSize)
607 + round_to(debug_info->data_size() , oopSize);
609 nm = new (nmethod_size)
610 nmethod(method(), nmethod_size, compile_id, entry_bci, offsets,
611 orig_pc_offset, debug_info, dependencies, code_buffer, frame_size,
612 oop_maps,
613 handler_table,
614 nul_chk_table,
615 compiler,
616 comp_level);
618 if (nm != NULL) {
619 // To make dependency checking during class loading fast, record
620 // the nmethod dependencies in the classes it is dependent on.
621 // This allows the dependency checking code to simply walk the
622 // class hierarchy above the loaded class, checking only nmethods
623 // which are dependent on those classes. The slow way is to
624 // check every nmethod for dependencies which makes it linear in
625 // the number of methods compiled. For applications with a lot
626 // classes the slow way is too slow.
627 for (Dependencies::DepStream deps(nm); deps.next(); ) {
628 Klass* klass = deps.context_type();
629 if (klass == NULL) {
630 continue; // ignore things like evol_method
631 }
633 // record this nmethod as dependent on this klass
634 InstanceKlass::cast(klass)->add_dependent_nmethod(nm);
635 }
636 NOT_PRODUCT(nmethod_stats.note_nmethod(nm));
637 if (PrintAssembly || CompilerOracle::has_option_string(method, "PrintAssembly")) {
638 Disassembler::decode(nm);
639 }
640 }
641 }
642 // Do verification and logging outside CodeCache_lock.
643 if (nm != NULL) {
644 // Safepoints in nmethod::verify aren't allowed because nm hasn't been installed yet.
645 DEBUG_ONLY(nm->verify();)
646 nm->log_new_nmethod();
647 }
648 return nm;
649 }
652 // For native wrappers
653 nmethod::nmethod(
654 Method* method,
655 int nmethod_size,
656 int compile_id,
657 CodeOffsets* offsets,
658 CodeBuffer* code_buffer,
659 int frame_size,
660 ByteSize basic_lock_owner_sp_offset,
661 ByteSize basic_lock_sp_offset,
662 OopMapSet* oop_maps )
663 : CodeBlob("native nmethod", code_buffer, sizeof(nmethod),
664 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
665 _native_receiver_sp_offset(basic_lock_owner_sp_offset),
666 _native_basic_lock_sp_offset(basic_lock_sp_offset)
667 {
668 {
669 debug_only(No_Safepoint_Verifier nsv;)
670 assert_locked_or_safepoint(CodeCache_lock);
672 init_defaults();
673 _method = method;
674 _entry_bci = InvocationEntryBci;
675 // We have no exception handler or deopt handler make the
676 // values something that will never match a pc like the nmethod vtable entry
677 _exception_offset = 0;
678 _deoptimize_offset = 0;
679 _deoptimize_mh_offset = 0;
680 _orig_pc_offset = 0;
682 _consts_offset = data_offset();
683 _stub_offset = data_offset();
684 _oops_offset = data_offset();
685 _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize);
686 _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize);
687 _scopes_pcs_offset = _scopes_data_offset;
688 _dependencies_offset = _scopes_pcs_offset;
689 _handler_table_offset = _dependencies_offset;
690 _nul_chk_table_offset = _handler_table_offset;
691 _nmethod_end_offset = _nul_chk_table_offset;
692 _compile_id = compile_id;
693 _comp_level = CompLevel_none;
694 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
695 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
696 _osr_entry_point = NULL;
697 _exception_cache = NULL;
698 _pc_desc_cache.reset_to(NULL);
699 _hotness_counter = NMethodSweeper::hotness_counter_reset_val();
701 code_buffer->copy_values_to(this);
702 if (ScavengeRootsInCode) {
703 if (detect_scavenge_root_oops()) {
704 CodeCache::add_scavenge_root_nmethod(this);
705 }
706 Universe::heap()->register_nmethod(this);
707 }
708 debug_only(verify_scavenge_root_oops());
709 CodeCache::commit(this);
710 }
712 if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
713 ttyLocker ttyl; // keep the following output all in one block
714 // This output goes directly to the tty, not the compiler log.
715 // To enable tools to match it up with the compilation activity,
716 // be sure to tag this tty output with the compile ID.
717 if (xtty != NULL) {
718 xtty->begin_head("print_native_nmethod");
719 xtty->method(_method);
720 xtty->stamp();
721 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
722 }
723 // print the header part first
724 print();
725 // then print the requested information
726 if (PrintNativeNMethods) {
727 print_code();
728 if (oop_maps != NULL) {
729 oop_maps->print();
730 }
731 }
732 if (PrintRelocations) {
733 print_relocations();
734 }
735 if (xtty != NULL) {
736 xtty->tail("print_native_nmethod");
737 }
738 }
739 }
741 // For dtrace wrappers
742 #ifdef HAVE_DTRACE_H
743 nmethod::nmethod(
744 Method* method,
745 int nmethod_size,
746 CodeOffsets* offsets,
747 CodeBuffer* code_buffer,
748 int frame_size)
749 : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod),
750 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL),
751 _native_receiver_sp_offset(in_ByteSize(-1)),
752 _native_basic_lock_sp_offset(in_ByteSize(-1))
753 {
754 {
755 debug_only(No_Safepoint_Verifier nsv;)
756 assert_locked_or_safepoint(CodeCache_lock);
758 init_defaults();
759 _method = method;
760 _entry_bci = InvocationEntryBci;
761 // We have no exception handler or deopt handler make the
762 // values something that will never match a pc like the nmethod vtable entry
763 _exception_offset = 0;
764 _deoptimize_offset = 0;
765 _deoptimize_mh_offset = 0;
766 _unwind_handler_offset = -1;
767 _trap_offset = offsets->value(CodeOffsets::Dtrace_trap);
768 _orig_pc_offset = 0;
769 _consts_offset = data_offset();
770 _stub_offset = data_offset();
771 _oops_offset = data_offset();
772 _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize);
773 _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize);
774 _scopes_pcs_offset = _scopes_data_offset;
775 _dependencies_offset = _scopes_pcs_offset;
776 _handler_table_offset = _dependencies_offset;
777 _nul_chk_table_offset = _handler_table_offset;
778 _nmethod_end_offset = _nul_chk_table_offset;
779 _compile_id = 0; // default
780 _comp_level = CompLevel_none;
781 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
782 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
783 _osr_entry_point = NULL;
784 _exception_cache = NULL;
785 _pc_desc_cache.reset_to(NULL);
786 _hotness_counter = NMethodSweeper::hotness_counter_reset_val();
788 code_buffer->copy_values_to(this);
789 if (ScavengeRootsInCode) {
790 if (detect_scavenge_root_oops()) {
791 CodeCache::add_scavenge_root_nmethod(this);
792 }
793 Universe::heap()->register_nmethod(this);
794 }
795 DEBUG_ONLY(verify_scavenge_root_oops();)
796 CodeCache::commit(this);
797 }
799 if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
800 ttyLocker ttyl; // keep the following output all in one block
801 // This output goes directly to the tty, not the compiler log.
802 // To enable tools to match it up with the compilation activity,
803 // be sure to tag this tty output with the compile ID.
804 if (xtty != NULL) {
805 xtty->begin_head("print_dtrace_nmethod");
806 xtty->method(_method);
807 xtty->stamp();
808 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
809 }
810 // print the header part first
811 print();
812 // then print the requested information
813 if (PrintNMethods) {
814 print_code();
815 }
816 if (PrintRelocations) {
817 print_relocations();
818 }
819 if (xtty != NULL) {
820 xtty->tail("print_dtrace_nmethod");
821 }
822 }
823 }
824 #endif // def HAVE_DTRACE_H
826 void* nmethod::operator new(size_t size, int nmethod_size) throw() {
827 // Not critical, may return null if there is too little continuous memory
828 return CodeCache::allocate(nmethod_size);
829 }
831 nmethod::nmethod(
832 Method* method,
833 int nmethod_size,
834 int compile_id,
835 int entry_bci,
836 CodeOffsets* offsets,
837 int orig_pc_offset,
838 DebugInformationRecorder* debug_info,
839 Dependencies* dependencies,
840 CodeBuffer *code_buffer,
841 int frame_size,
842 OopMapSet* oop_maps,
843 ExceptionHandlerTable* handler_table,
844 ImplicitExceptionTable* nul_chk_table,
845 AbstractCompiler* compiler,
846 int comp_level
847 )
848 : CodeBlob("nmethod", code_buffer, sizeof(nmethod),
849 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
850 _native_receiver_sp_offset(in_ByteSize(-1)),
851 _native_basic_lock_sp_offset(in_ByteSize(-1))
852 {
853 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
854 {
855 debug_only(No_Safepoint_Verifier nsv;)
856 assert_locked_or_safepoint(CodeCache_lock);
858 init_defaults();
859 _method = method;
860 _entry_bci = entry_bci;
861 _compile_id = compile_id;
862 _comp_level = comp_level;
863 _compiler = compiler;
864 _orig_pc_offset = orig_pc_offset;
865 _hotness_counter = NMethodSweeper::hotness_counter_reset_val();
867 // Section offsets
868 _consts_offset = content_offset() + code_buffer->total_offset_of(code_buffer->consts());
869 _stub_offset = content_offset() + code_buffer->total_offset_of(code_buffer->stubs());
871 // Exception handler and deopt handler are in the stub section
872 assert(offsets->value(CodeOffsets::Exceptions) != -1, "must be set");
873 assert(offsets->value(CodeOffsets::Deopt ) != -1, "must be set");
874 _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions);
875 _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt);
876 if (offsets->value(CodeOffsets::DeoptMH) != -1) {
877 _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH);
878 } else {
879 _deoptimize_mh_offset = -1;
880 }
881 if (offsets->value(CodeOffsets::UnwindHandler) != -1) {
882 _unwind_handler_offset = code_offset() + offsets->value(CodeOffsets::UnwindHandler);
883 } else {
884 _unwind_handler_offset = -1;
885 }
887 _oops_offset = data_offset();
888 _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize);
889 _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize);
891 _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize);
892 _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size());
893 _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize);
894 _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize);
895 _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize);
897 _entry_point = code_begin() + offsets->value(CodeOffsets::Entry);
898 _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry);
899 _osr_entry_point = code_begin() + offsets->value(CodeOffsets::OSR_Entry);
900 _exception_cache = NULL;
901 _pc_desc_cache.reset_to(scopes_pcs_begin());
903 // Copy contents of ScopeDescRecorder to nmethod
904 code_buffer->copy_values_to(this);
905 debug_info->copy_to(this);
906 dependencies->copy_to(this);
907 if (ScavengeRootsInCode) {
908 if (detect_scavenge_root_oops()) {
909 CodeCache::add_scavenge_root_nmethod(this);
910 }
911 Universe::heap()->register_nmethod(this);
912 }
913 debug_only(verify_scavenge_root_oops());
915 CodeCache::commit(this);
917 // Copy contents of ExceptionHandlerTable to nmethod
918 handler_table->copy_to(this);
919 nul_chk_table->copy_to(this);
921 // we use the information of entry points to find out if a method is
922 // static or non static
923 assert(compiler->is_c2() ||
924 _method->is_static() == (entry_point() == _verified_entry_point),
925 " entry points must be same for static methods and vice versa");
926 }
928 bool printnmethods = PrintNMethods
929 || CompilerOracle::should_print(_method)
930 || CompilerOracle::has_option_string(_method, "PrintNMethods");
931 if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) {
932 print_nmethod(printnmethods);
933 }
934 }
937 // Print a short set of xml attributes to identify this nmethod. The
938 // output should be embedded in some other element.
939 void nmethod::log_identity(xmlStream* log) const {
940 log->print(" compile_id='%d'", compile_id());
941 const char* nm_kind = compile_kind();
942 if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind);
943 if (compiler() != NULL) {
944 log->print(" compiler='%s'", compiler()->name());
945 }
946 if (TieredCompilation) {
947 log->print(" level='%d'", comp_level());
948 }
949 }
952 #define LOG_OFFSET(log, name) \
953 if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \
954 log->print(" " XSTR(name) "_offset='%d'" , \
955 (intptr_t)name##_begin() - (intptr_t)this)
958 void nmethod::log_new_nmethod() const {
959 if (LogCompilation && xtty != NULL) {
960 ttyLocker ttyl;
961 HandleMark hm;
962 xtty->begin_elem("nmethod");
963 log_identity(xtty);
964 xtty->print(" entry='" INTPTR_FORMAT "' size='%d'", code_begin(), size());
965 xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this);
967 LOG_OFFSET(xtty, relocation);
968 LOG_OFFSET(xtty, consts);
969 LOG_OFFSET(xtty, insts);
970 LOG_OFFSET(xtty, stub);
971 LOG_OFFSET(xtty, scopes_data);
972 LOG_OFFSET(xtty, scopes_pcs);
973 LOG_OFFSET(xtty, dependencies);
974 LOG_OFFSET(xtty, handler_table);
975 LOG_OFFSET(xtty, nul_chk_table);
976 LOG_OFFSET(xtty, oops);
978 xtty->method(method());
979 xtty->stamp();
980 xtty->end_elem();
981 }
982 }
984 #undef LOG_OFFSET
987 // Print out more verbose output usually for a newly created nmethod.
988 void nmethod::print_on(outputStream* st, const char* msg) const {
989 if (st != NULL) {
990 ttyLocker ttyl;
991 if (WizardMode) {
992 CompileTask::print_compilation(st, this, msg, /*short_form:*/ true);
993 st->print_cr(" (" INTPTR_FORMAT ")", this);
994 } else {
995 CompileTask::print_compilation(st, this, msg, /*short_form:*/ false);
996 }
997 }
998 }
1001 void nmethod::print_nmethod(bool printmethod) {
1002 ttyLocker ttyl; // keep the following output all in one block
1003 if (xtty != NULL) {
1004 xtty->begin_head("print_nmethod");
1005 xtty->stamp();
1006 xtty->end_head();
1007 }
1008 // print the header part first
1009 print();
1010 // then print the requested information
1011 if (printmethod) {
1012 print_code();
1013 print_pcs();
1014 if (oop_maps()) {
1015 oop_maps()->print();
1016 }
1017 }
1018 if (PrintDebugInfo) {
1019 print_scopes();
1020 }
1021 if (PrintRelocations) {
1022 print_relocations();
1023 }
1024 if (PrintDependencies) {
1025 print_dependencies();
1026 }
1027 if (PrintExceptionHandlers) {
1028 print_handler_table();
1029 print_nul_chk_table();
1030 }
1031 if (xtty != NULL) {
1032 xtty->tail("print_nmethod");
1033 }
1034 }
1037 // Promote one word from an assembly-time handle to a live embedded oop.
1038 inline void nmethod::initialize_immediate_oop(oop* dest, jobject handle) {
1039 if (handle == NULL ||
1040 // As a special case, IC oops are initialized to 1 or -1.
1041 handle == (jobject) Universe::non_oop_word()) {
1042 (*dest) = (oop) handle;
1043 } else {
1044 (*dest) = JNIHandles::resolve_non_null(handle);
1045 }
1046 }
1049 // Have to have the same name because it's called by a template
1050 void nmethod::copy_values(GrowableArray<jobject>* array) {
1051 int length = array->length();
1052 assert((address)(oops_begin() + length) <= (address)oops_end(), "oops big enough");
1053 oop* dest = oops_begin();
1054 for (int index = 0 ; index < length; index++) {
1055 initialize_immediate_oop(&dest[index], array->at(index));
1056 }
1058 // Now we can fix up all the oops in the code. We need to do this
1059 // in the code because the assembler uses jobjects as placeholders.
1060 // The code and relocations have already been initialized by the
1061 // CodeBlob constructor, so it is valid even at this early point to
1062 // iterate over relocations and patch the code.
1063 fix_oop_relocations(NULL, NULL, /*initialize_immediates=*/ true);
1064 }
1066 void nmethod::copy_values(GrowableArray<Metadata*>* array) {
1067 int length = array->length();
1068 assert((address)(metadata_begin() + length) <= (address)metadata_end(), "big enough");
1069 Metadata** dest = metadata_begin();
1070 for (int index = 0 ; index < length; index++) {
1071 dest[index] = array->at(index);
1072 }
1073 }
1075 bool nmethod::is_at_poll_return(address pc) {
1076 RelocIterator iter(this, pc, pc+1);
1077 while (iter.next()) {
1078 if (iter.type() == relocInfo::poll_return_type)
1079 return true;
1080 }
1081 return false;
1082 }
1085 bool nmethod::is_at_poll_or_poll_return(address pc) {
1086 RelocIterator iter(this, pc, pc+1);
1087 while (iter.next()) {
1088 relocInfo::relocType t = iter.type();
1089 if (t == relocInfo::poll_return_type || t == relocInfo::poll_type)
1090 return true;
1091 }
1092 return false;
1093 }
1096 void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) {
1097 // re-patch all oop-bearing instructions, just in case some oops moved
1098 RelocIterator iter(this, begin, end);
1099 while (iter.next()) {
1100 if (iter.type() == relocInfo::oop_type) {
1101 oop_Relocation* reloc = iter.oop_reloc();
1102 if (initialize_immediates && reloc->oop_is_immediate()) {
1103 oop* dest = reloc->oop_addr();
1104 initialize_immediate_oop(dest, (jobject) *dest);
1105 }
1106 // Refresh the oop-related bits of this instruction.
1107 reloc->fix_oop_relocation();
1108 } else if (iter.type() == relocInfo::metadata_type) {
1109 metadata_Relocation* reloc = iter.metadata_reloc();
1110 reloc->fix_metadata_relocation();
1111 }
1112 }
1113 }
1116 void nmethod::verify_oop_relocations() {
1117 // Ensure sure that the code matches the current oop values
1118 RelocIterator iter(this, NULL, NULL);
1119 while (iter.next()) {
1120 if (iter.type() == relocInfo::oop_type) {
1121 oop_Relocation* reloc = iter.oop_reloc();
1122 if (!reloc->oop_is_immediate()) {
1123 reloc->verify_oop_relocation();
1124 }
1125 }
1126 }
1127 }
1130 ScopeDesc* nmethod::scope_desc_at(address pc) {
1131 PcDesc* pd = pc_desc_at(pc);
1132 guarantee(pd != NULL, "scope must be present");
1133 return new ScopeDesc(this, pd->scope_decode_offset(),
1134 pd->obj_decode_offset(), pd->should_reexecute(),
1135 pd->return_oop());
1136 }
1139 void nmethod::clear_inline_caches() {
1140 assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint");
1141 if (is_zombie()) {
1142 return;
1143 }
1145 RelocIterator iter(this);
1146 while (iter.next()) {
1147 iter.reloc()->clear_inline_cache();
1148 }
1149 }
1151 // Clear ICStubs of all compiled ICs
1152 void nmethod::clear_ic_stubs() {
1153 assert_locked_or_safepoint(CompiledIC_lock);
1154 ResourceMark rm;
1155 RelocIterator iter(this);
1156 while(iter.next()) {
1157 if (iter.type() == relocInfo::virtual_call_type) {
1158 CompiledIC* ic = CompiledIC_at(&iter);
1159 ic->clear_ic_stub();
1160 }
1161 }
1162 }
1165 void nmethod::cleanup_inline_caches() {
1166 assert_locked_or_safepoint(CompiledIC_lock);
1168 // If the method is not entrant or zombie then a JMP is plastered over the
1169 // first few bytes. If an oop in the old code was there, that oop
1170 // should not get GC'd. Skip the first few bytes of oops on
1171 // not-entrant methods.
1172 address low_boundary = verified_entry_point();
1173 if (!is_in_use()) {
1174 low_boundary += NativeJump::instruction_size;
1175 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1176 // This means that the low_boundary is going to be a little too high.
1177 // This shouldn't matter, since oops of non-entrant methods are never used.
1178 // In fact, why are we bothering to look at oops in a non-entrant method??
1179 }
1181 // Find all calls in an nmethod and clear the ones that point to non-entrant,
1182 // zombie and unloaded nmethods.
1183 ResourceMark rm;
1184 RelocIterator iter(this, low_boundary);
1185 while(iter.next()) {
1186 switch(iter.type()) {
1187 case relocInfo::virtual_call_type:
1188 case relocInfo::opt_virtual_call_type: {
1189 CompiledIC *ic = CompiledIC_at(&iter);
1190 // Ok, to lookup references to zombies here
1191 CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination());
1192 if( cb != NULL && cb->is_nmethod() ) {
1193 nmethod* nm = (nmethod*)cb;
1194 // Clean inline caches pointing to zombie, non-entrant and unloaded methods
1195 if (!nm->is_in_use() || (nm->method()->code() != nm)) ic->set_to_clean(is_alive());
1196 }
1197 break;
1198 }
1199 case relocInfo::static_call_type: {
1200 CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc());
1201 CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination());
1202 if( cb != NULL && cb->is_nmethod() ) {
1203 nmethod* nm = (nmethod*)cb;
1204 // Clean inline caches pointing to zombie, non-entrant and unloaded methods
1205 if (!nm->is_in_use() || (nm->method()->code() != nm)) csc->set_to_clean();
1206 }
1207 break;
1208 }
1209 }
1210 }
1211 }
1213 void nmethod::verify_clean_inline_caches() {
1214 assert_locked_or_safepoint(CompiledIC_lock);
1216 // If the method is not entrant or zombie then a JMP is plastered over the
1217 // first few bytes. If an oop in the old code was there, that oop
1218 // should not get GC'd. Skip the first few bytes of oops on
1219 // not-entrant methods.
1220 address low_boundary = verified_entry_point();
1221 if (!is_in_use()) {
1222 low_boundary += NativeJump::instruction_size;
1223 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1224 // This means that the low_boundary is going to be a little too high.
1225 // This shouldn't matter, since oops of non-entrant methods are never used.
1226 // In fact, why are we bothering to look at oops in a non-entrant method??
1227 }
1229 ResourceMark rm;
1230 RelocIterator iter(this, low_boundary);
1231 while(iter.next()) {
1232 switch(iter.type()) {
1233 case relocInfo::virtual_call_type:
1234 case relocInfo::opt_virtual_call_type: {
1235 CompiledIC *ic = CompiledIC_at(&iter);
1236 // Ok, to lookup references to zombies here
1237 CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination());
1238 if( cb != NULL && cb->is_nmethod() ) {
1239 nmethod* nm = (nmethod*)cb;
1240 // Verify that inline caches pointing to both zombie and not_entrant methods are clean
1241 if (!nm->is_in_use() || (nm->method()->code() != nm)) {
1242 assert(ic->is_clean(), "IC should be clean");
1243 }
1244 }
1245 break;
1246 }
1247 case relocInfo::static_call_type: {
1248 CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc());
1249 CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination());
1250 if( cb != NULL && cb->is_nmethod() ) {
1251 nmethod* nm = (nmethod*)cb;
1252 // Verify that inline caches pointing to both zombie and not_entrant methods are clean
1253 if (!nm->is_in_use() || (nm->method()->code() != nm)) {
1254 assert(csc->is_clean(), "IC should be clean");
1255 }
1256 }
1257 break;
1258 }
1259 }
1260 }
1261 }
1263 int nmethod::verify_icholder_relocations() {
1264 int count = 0;
1266 RelocIterator iter(this);
1267 while(iter.next()) {
1268 if (iter.type() == relocInfo::virtual_call_type) {
1269 if (CompiledIC::is_icholder_call_site(iter.virtual_call_reloc())) {
1270 CompiledIC *ic = CompiledIC_at(&iter);
1271 if (TraceCompiledIC) {
1272 tty->print("noticed icholder " INTPTR_FORMAT " ", p2i(ic->cached_icholder()));
1273 ic->print();
1274 }
1275 assert(ic->cached_icholder() != NULL, "must be non-NULL");
1276 count++;
1277 }
1278 }
1279 }
1281 return count;
1282 }
1284 // This is a private interface with the sweeper.
1285 void nmethod::mark_as_seen_on_stack() {
1286 assert(is_alive(), "Must be an alive method");
1287 // Set the traversal mark to ensure that the sweeper does 2
1288 // cleaning passes before moving to zombie.
1289 set_stack_traversal_mark(NMethodSweeper::traversal_count());
1290 }
1292 // Tell if a non-entrant method can be converted to a zombie (i.e.,
1293 // there are no activations on the stack, not in use by the VM,
1294 // and not in use by the ServiceThread)
1295 bool nmethod::can_convert_to_zombie() {
1296 assert(is_not_entrant(), "must be a non-entrant method");
1298 // Since the nmethod sweeper only does partial sweep the sweeper's traversal
1299 // count can be greater than the stack traversal count before it hits the
1300 // nmethod for the second time.
1301 return stack_traversal_mark()+1 < NMethodSweeper::traversal_count() &&
1302 !is_locked_by_vm();
1303 }
1305 void nmethod::inc_decompile_count() {
1306 if (!is_compiled_by_c2()) return;
1307 // Could be gated by ProfileTraps, but do not bother...
1308 Method* m = method();
1309 if (m == NULL) return;
1310 MethodData* mdo = m->method_data();
1311 if (mdo == NULL) return;
1312 // There is a benign race here. See comments in methodData.hpp.
1313 mdo->inc_decompile_count();
1314 }
1316 void nmethod::increase_unloading_clock() {
1317 _global_unloading_clock++;
1318 if (_global_unloading_clock == 0) {
1319 // _nmethods are allocated with _unloading_clock == 0,
1320 // so 0 is never used as a clock value.
1321 _global_unloading_clock = 1;
1322 }
1323 }
1325 void nmethod::set_unloading_clock(unsigned char unloading_clock) {
1326 OrderAccess::release_store((volatile jubyte*)&_unloading_clock, unloading_clock);
1327 }
1329 unsigned char nmethod::unloading_clock() {
1330 return (unsigned char)OrderAccess::load_acquire((volatile jubyte*)&_unloading_clock);
1331 }
1333 void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) {
1335 post_compiled_method_unload();
1337 // Since this nmethod is being unloaded, make sure that dependencies
1338 // recorded in instanceKlasses get flushed and pass non-NULL closure to
1339 // indicate that this work is being done during a GC.
1340 assert(Universe::heap()->is_gc_active(), "should only be called during gc");
1341 assert(is_alive != NULL, "Should be non-NULL");
1342 // A non-NULL is_alive closure indicates that this is being called during GC.
1343 flush_dependencies(is_alive);
1345 // Break cycle between nmethod & method
1346 if (TraceClassUnloading && WizardMode) {
1347 tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT
1348 " unloadable], Method*(" INTPTR_FORMAT
1349 "), cause(" INTPTR_FORMAT ")",
1350 this, (address)_method, (address)cause);
1351 if (!Universe::heap()->is_gc_active())
1352 cause->klass()->print();
1353 }
1354 // Unlink the osr method, so we do not look this up again
1355 if (is_osr_method()) {
1356 invalidate_osr_method();
1357 }
1358 // If _method is already NULL the Method* is about to be unloaded,
1359 // so we don't have to break the cycle. Note that it is possible to
1360 // have the Method* live here, in case we unload the nmethod because
1361 // it is pointing to some oop (other than the Method*) being unloaded.
1362 if (_method != NULL) {
1363 // OSR methods point to the Method*, but the Method* does not
1364 // point back!
1365 if (_method->code() == this) {
1366 _method->clear_code(); // Break a cycle
1367 }
1368 _method = NULL; // Clear the method of this dead nmethod
1369 }
1370 // Make the class unloaded - i.e., change state and notify sweeper
1371 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
1372 if (is_in_use()) {
1373 // Transitioning directly from live to unloaded -- so
1374 // we need to force a cache clean-up; remember this
1375 // for later on.
1376 CodeCache::set_needs_cache_clean(true);
1377 }
1379 // Unregister must be done before the state change
1380 Universe::heap()->unregister_nmethod(this);
1382 _state = unloaded;
1384 // Log the unloading.
1385 log_state_change();
1387 // The Method* is gone at this point
1388 assert(_method == NULL, "Tautology");
1390 set_osr_link(NULL);
1391 //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods
1392 NMethodSweeper::report_state_change(this);
1393 }
1395 void nmethod::invalidate_osr_method() {
1396 assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
1397 // Remove from list of active nmethods
1398 if (method() != NULL)
1399 method()->method_holder()->remove_osr_nmethod(this);
1400 // Set entry as invalid
1401 _entry_bci = InvalidOSREntryBci;
1402 }
1404 void nmethod::log_state_change() const {
1405 if (LogCompilation) {
1406 if (xtty != NULL) {
1407 ttyLocker ttyl; // keep the following output all in one block
1408 if (_state == unloaded) {
1409 xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'",
1410 os::current_thread_id());
1411 } else {
1412 xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s",
1413 os::current_thread_id(),
1414 (_state == zombie ? " zombie='1'" : ""));
1415 }
1416 log_identity(xtty);
1417 xtty->stamp();
1418 xtty->end_elem();
1419 }
1420 }
1421 if (PrintCompilation && _state != unloaded) {
1422 print_on(tty, _state == zombie ? "made zombie" : "made not entrant");
1423 }
1424 }
1426 /**
1427 * Common functionality for both make_not_entrant and make_zombie
1428 */
1429 bool nmethod::make_not_entrant_or_zombie(unsigned int state) {
1430 assert(state == zombie || state == not_entrant, "must be zombie or not_entrant");
1431 assert(!is_zombie(), "should not already be a zombie");
1433 // Make sure neither the nmethod nor the method is flushed in case of a safepoint in code below.
1434 nmethodLocker nml(this);
1435 methodHandle the_method(method());
1436 No_Safepoint_Verifier nsv;
1438 // during patching, depending on the nmethod state we must notify the GC that
1439 // code has been unloaded, unregistering it. We cannot do this right while
1440 // holding the Patching_lock because we need to use the CodeCache_lock. This
1441 // would be prone to deadlocks.
1442 // This flag is used to remember whether we need to later lock and unregister.
1443 bool nmethod_needs_unregister = false;
1445 {
1446 // invalidate osr nmethod before acquiring the patching lock since
1447 // they both acquire leaf locks and we don't want a deadlock.
1448 // This logic is equivalent to the logic below for patching the
1449 // verified entry point of regular methods.
1450 if (is_osr_method()) {
1451 // this effectively makes the osr nmethod not entrant
1452 invalidate_osr_method();
1453 }
1455 // Enter critical section. Does not block for safepoint.
1456 MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag);
1458 if (_state == state) {
1459 // another thread already performed this transition so nothing
1460 // to do, but return false to indicate this.
1461 return false;
1462 }
1464 // The caller can be calling the method statically or through an inline
1465 // cache call.
1466 if (!is_osr_method() && !is_not_entrant()) {
1467 NativeJump::patch_verified_entry(entry_point(), verified_entry_point(),
1468 SharedRuntime::get_handle_wrong_method_stub());
1469 }
1471 if (is_in_use()) {
1472 // It's a true state change, so mark the method as decompiled.
1473 // Do it only for transition from alive.
1474 inc_decompile_count();
1475 }
1477 // If the state is becoming a zombie, signal to unregister the nmethod with
1478 // the heap.
1479 // This nmethod may have already been unloaded during a full GC.
1480 if ((state == zombie) && !is_unloaded()) {
1481 nmethod_needs_unregister = true;
1482 }
1484 // Must happen before state change. Otherwise we have a race condition in
1485 // nmethod::can_not_entrant_be_converted(). I.e., a method can immediately
1486 // transition its state from 'not_entrant' to 'zombie' without having to wait
1487 // for stack scanning.
1488 if (state == not_entrant) {
1489 mark_as_seen_on_stack();
1490 OrderAccess::storestore();
1491 }
1493 // Change state
1494 _state = state;
1496 // Log the transition once
1497 log_state_change();
1499 // Remove nmethod from method.
1500 // We need to check if both the _code and _from_compiled_code_entry_point
1501 // refer to this nmethod because there is a race in setting these two fields
1502 // in Method* as seen in bugid 4947125.
1503 // If the vep() points to the zombie nmethod, the memory for the nmethod
1504 // could be flushed and the compiler and vtable stubs could still call
1505 // through it.
1506 if (method() != NULL && (method()->code() == this ||
1507 method()->from_compiled_entry() == verified_entry_point())) {
1508 HandleMark hm;
1509 method()->clear_code();
1510 }
1511 } // leave critical region under Patching_lock
1513 // When the nmethod becomes zombie it is no longer alive so the
1514 // dependencies must be flushed. nmethods in the not_entrant
1515 // state will be flushed later when the transition to zombie
1516 // happens or they get unloaded.
1517 if (state == zombie) {
1518 {
1519 // Flushing dependecies must be done before any possible
1520 // safepoint can sneak in, otherwise the oops used by the
1521 // dependency logic could have become stale.
1522 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
1523 if (nmethod_needs_unregister) {
1524 Universe::heap()->unregister_nmethod(this);
1525 }
1526 flush_dependencies(NULL);
1527 }
1529 // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload
1530 // event and it hasn't already been reported for this nmethod then
1531 // report it now. The event may have been reported earilier if the GC
1532 // marked it for unloading). JvmtiDeferredEventQueue support means
1533 // we no longer go to a safepoint here.
1534 post_compiled_method_unload();
1536 #ifdef ASSERT
1537 // It's no longer safe to access the oops section since zombie
1538 // nmethods aren't scanned for GC.
1539 _oops_are_stale = true;
1540 #endif
1541 // the Method may be reclaimed by class unloading now that the
1542 // nmethod is in zombie state
1543 set_method(NULL);
1544 } else {
1545 assert(state == not_entrant, "other cases may need to be handled differently");
1546 }
1548 if (TraceCreateZombies) {
1549 tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie");
1550 }
1552 NMethodSweeper::report_state_change(this);
1553 return true;
1554 }
1556 void nmethod::flush() {
1557 // Note that there are no valid oops in the nmethod anymore.
1558 assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method");
1559 assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation");
1561 assert (!is_locked_by_vm(), "locked methods shouldn't be flushed");
1562 assert_locked_or_safepoint(CodeCache_lock);
1564 // completely deallocate this method
1565 Events::log(JavaThread::current(), "flushing nmethod " INTPTR_FORMAT, this);
1566 if (PrintMethodFlushing) {
1567 tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb",
1568 _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024);
1569 }
1571 // We need to deallocate any ExceptionCache data.
1572 // Note that we do not need to grab the nmethod lock for this, it
1573 // better be thread safe if we're disposing of it!
1574 ExceptionCache* ec = exception_cache();
1575 set_exception_cache(NULL);
1576 while(ec != NULL) {
1577 ExceptionCache* next = ec->next();
1578 delete ec;
1579 ec = next;
1580 }
1582 if (on_scavenge_root_list()) {
1583 CodeCache::drop_scavenge_root_nmethod(this);
1584 }
1586 #ifdef SHARK
1587 ((SharkCompiler *) compiler())->free_compiled_method(insts_begin());
1588 #endif // SHARK
1590 ((CodeBlob*)(this))->flush();
1592 CodeCache::free(this);
1593 }
1596 //
1597 // Notify all classes this nmethod is dependent on that it is no
1598 // longer dependent. This should only be called in two situations.
1599 // First, when a nmethod transitions to a zombie all dependents need
1600 // to be clear. Since zombification happens at a safepoint there's no
1601 // synchronization issues. The second place is a little more tricky.
1602 // During phase 1 of mark sweep class unloading may happen and as a
1603 // result some nmethods may get unloaded. In this case the flushing
1604 // of dependencies must happen during phase 1 since after GC any
1605 // dependencies in the unloaded nmethod won't be updated, so
1606 // traversing the dependency information in unsafe. In that case this
1607 // function is called with a non-NULL argument and this function only
1608 // notifies instanceKlasses that are reachable
1610 void nmethod::flush_dependencies(BoolObjectClosure* is_alive) {
1611 assert_locked_or_safepoint(CodeCache_lock);
1612 assert(Universe::heap()->is_gc_active() == (is_alive != NULL),
1613 "is_alive is non-NULL if and only if we are called during GC");
1614 if (!has_flushed_dependencies()) {
1615 set_has_flushed_dependencies();
1616 for (Dependencies::DepStream deps(this); deps.next(); ) {
1617 Klass* klass = deps.context_type();
1618 if (klass == NULL) continue; // ignore things like evol_method
1620 // During GC the is_alive closure is non-NULL, and is used to
1621 // determine liveness of dependees that need to be updated.
1622 if (is_alive == NULL || klass->is_loader_alive(is_alive)) {
1623 // The GC defers deletion of this entry, since there might be multiple threads
1624 // iterating over the _dependencies graph. Other call paths are single-threaded
1625 // and may delete it immediately.
1626 bool delete_immediately = is_alive == NULL;
1627 InstanceKlass::cast(klass)->remove_dependent_nmethod(this, delete_immediately);
1628 }
1629 }
1630 }
1631 }
1634 // If this oop is not live, the nmethod can be unloaded.
1635 bool nmethod::can_unload(BoolObjectClosure* is_alive, oop* root, bool unloading_occurred) {
1636 assert(root != NULL, "just checking");
1637 oop obj = *root;
1638 if (obj == NULL || is_alive->do_object_b(obj)) {
1639 return false;
1640 }
1642 // If ScavengeRootsInCode is true, an nmethod might be unloaded
1643 // simply because one of its constant oops has gone dead.
1644 // No actual classes need to be unloaded in order for this to occur.
1645 assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading");
1646 make_unloaded(is_alive, obj);
1647 return true;
1648 }
1650 // ------------------------------------------------------------------
1651 // post_compiled_method_load_event
1652 // new method for install_code() path
1653 // Transfer information from compilation to jvmti
1654 void nmethod::post_compiled_method_load_event() {
1656 Method* moop = method();
1657 #ifndef USDT2
1658 HS_DTRACE_PROBE8(hotspot, compiled__method__load,
1659 moop->klass_name()->bytes(),
1660 moop->klass_name()->utf8_length(),
1661 moop->name()->bytes(),
1662 moop->name()->utf8_length(),
1663 moop->signature()->bytes(),
1664 moop->signature()->utf8_length(),
1665 insts_begin(), insts_size());
1666 #else /* USDT2 */
1667 HOTSPOT_COMPILED_METHOD_LOAD(
1668 (char *) moop->klass_name()->bytes(),
1669 moop->klass_name()->utf8_length(),
1670 (char *) moop->name()->bytes(),
1671 moop->name()->utf8_length(),
1672 (char *) moop->signature()->bytes(),
1673 moop->signature()->utf8_length(),
1674 insts_begin(), insts_size());
1675 #endif /* USDT2 */
1677 if (JvmtiExport::should_post_compiled_method_load() ||
1678 JvmtiExport::should_post_compiled_method_unload()) {
1679 get_and_cache_jmethod_id();
1680 }
1682 if (JvmtiExport::should_post_compiled_method_load()) {
1683 // Let the Service thread (which is a real Java thread) post the event
1684 MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag);
1685 JvmtiDeferredEventQueue::enqueue(
1686 JvmtiDeferredEvent::compiled_method_load_event(this));
1687 }
1688 }
1690 jmethodID nmethod::get_and_cache_jmethod_id() {
1691 if (_jmethod_id == NULL) {
1692 // Cache the jmethod_id since it can no longer be looked up once the
1693 // method itself has been marked for unloading.
1694 _jmethod_id = method()->jmethod_id();
1695 }
1696 return _jmethod_id;
1697 }
1699 void nmethod::post_compiled_method_unload() {
1700 if (unload_reported()) {
1701 // During unloading we transition to unloaded and then to zombie
1702 // and the unloading is reported during the first transition.
1703 return;
1704 }
1706 assert(_method != NULL && !is_unloaded(), "just checking");
1707 DTRACE_METHOD_UNLOAD_PROBE(method());
1709 // If a JVMTI agent has enabled the CompiledMethodUnload event then
1710 // post the event. Sometime later this nmethod will be made a zombie
1711 // by the sweeper but the Method* will not be valid at that point.
1712 // If the _jmethod_id is null then no load event was ever requested
1713 // so don't bother posting the unload. The main reason for this is
1714 // that the jmethodID is a weak reference to the Method* so if
1715 // it's being unloaded there's no way to look it up since the weak
1716 // ref will have been cleared.
1717 if (_jmethod_id != NULL && JvmtiExport::should_post_compiled_method_unload()) {
1718 assert(!unload_reported(), "already unloaded");
1719 JvmtiDeferredEvent event =
1720 JvmtiDeferredEvent::compiled_method_unload_event(this,
1721 _jmethod_id, insts_begin());
1722 if (SafepointSynchronize::is_at_safepoint()) {
1723 // Don't want to take the queueing lock. Add it as pending and
1724 // it will get enqueued later.
1725 JvmtiDeferredEventQueue::add_pending_event(event);
1726 } else {
1727 MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag);
1728 JvmtiDeferredEventQueue::enqueue(event);
1729 }
1730 }
1732 // The JVMTI CompiledMethodUnload event can be enabled or disabled at
1733 // any time. As the nmethod is being unloaded now we mark it has
1734 // having the unload event reported - this will ensure that we don't
1735 // attempt to report the event in the unlikely scenario where the
1736 // event is enabled at the time the nmethod is made a zombie.
1737 set_unload_reported();
1738 }
1740 void static clean_ic_if_metadata_is_dead(CompiledIC *ic, BoolObjectClosure *is_alive, bool mark_on_stack) {
1741 if (ic->is_icholder_call()) {
1742 // The only exception is compiledICHolder oops which may
1743 // yet be marked below. (We check this further below).
1744 CompiledICHolder* cichk_oop = ic->cached_icholder();
1746 if (mark_on_stack) {
1747 Metadata::mark_on_stack(cichk_oop->holder_method());
1748 Metadata::mark_on_stack(cichk_oop->holder_klass());
1749 }
1751 if (cichk_oop->holder_method()->method_holder()->is_loader_alive(is_alive) &&
1752 cichk_oop->holder_klass()->is_loader_alive(is_alive)) {
1753 return;
1754 }
1755 } else {
1756 Metadata* ic_oop = ic->cached_metadata();
1757 if (ic_oop != NULL) {
1758 if (mark_on_stack) {
1759 Metadata::mark_on_stack(ic_oop);
1760 }
1762 if (ic_oop->is_klass()) {
1763 if (((Klass*)ic_oop)->is_loader_alive(is_alive)) {
1764 return;
1765 }
1766 } else if (ic_oop->is_method()) {
1767 if (((Method*)ic_oop)->method_holder()->is_loader_alive(is_alive)) {
1768 return;
1769 }
1770 } else {
1771 ShouldNotReachHere();
1772 }
1773 }
1774 }
1776 ic->set_to_clean();
1777 }
1779 // This is called at the end of the strong tracing/marking phase of a
1780 // GC to unload an nmethod if it contains otherwise unreachable
1781 // oops.
1783 void nmethod::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) {
1784 // Make sure the oop's ready to receive visitors
1785 assert(!is_zombie() && !is_unloaded(),
1786 "should not call follow on zombie or unloaded nmethod");
1788 // If the method is not entrant then a JMP is plastered over the
1789 // first few bytes. If an oop in the old code was there, that oop
1790 // should not get GC'd. Skip the first few bytes of oops on
1791 // not-entrant methods.
1792 address low_boundary = verified_entry_point();
1793 if (is_not_entrant()) {
1794 low_boundary += NativeJump::instruction_size;
1795 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1796 // (See comment above.)
1797 }
1799 // The RedefineClasses() API can cause the class unloading invariant
1800 // to no longer be true. See jvmtiExport.hpp for details.
1801 // Also, leave a debugging breadcrumb in local flag.
1802 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1803 if (a_class_was_redefined) {
1804 // This set of the unloading_occurred flag is done before the
1805 // call to post_compiled_method_unload() so that the unloading
1806 // of this nmethod is reported.
1807 unloading_occurred = true;
1808 }
1810 // Exception cache
1811 clean_exception_cache(is_alive);
1813 // If class unloading occurred we first iterate over all inline caches and
1814 // clear ICs where the cached oop is referring to an unloaded klass or method.
1815 // The remaining live cached oops will be traversed in the relocInfo::oop_type
1816 // iteration below.
1817 if (unloading_occurred) {
1818 RelocIterator iter(this, low_boundary);
1819 while(iter.next()) {
1820 if (iter.type() == relocInfo::virtual_call_type) {
1821 CompiledIC *ic = CompiledIC_at(&iter);
1822 clean_ic_if_metadata_is_dead(ic, is_alive, false);
1823 }
1824 }
1825 }
1827 // Compiled code
1828 {
1829 RelocIterator iter(this, low_boundary);
1830 while (iter.next()) {
1831 if (iter.type() == relocInfo::oop_type) {
1832 oop_Relocation* r = iter.oop_reloc();
1833 // In this loop, we must only traverse those oops directly embedded in
1834 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1835 assert(1 == (r->oop_is_immediate()) +
1836 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1837 "oop must be found in exactly one place");
1838 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1839 if (can_unload(is_alive, r->oop_addr(), unloading_occurred)) {
1840 return;
1841 }
1842 }
1843 }
1844 }
1845 }
1848 // Scopes
1849 for (oop* p = oops_begin(); p < oops_end(); p++) {
1850 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1851 if (can_unload(is_alive, p, unloading_occurred)) {
1852 return;
1853 }
1854 }
1856 // Ensure that all metadata is still alive
1857 verify_metadata_loaders(low_boundary, is_alive);
1858 }
1860 template <class CompiledICorStaticCall>
1861 static bool clean_if_nmethod_is_unloaded(CompiledICorStaticCall *ic, address addr, BoolObjectClosure *is_alive, nmethod* from) {
1862 // Ok, to lookup references to zombies here
1863 CodeBlob *cb = CodeCache::find_blob_unsafe(addr);
1864 if (cb != NULL && cb->is_nmethod()) {
1865 nmethod* nm = (nmethod*)cb;
1867 if (nm->unloading_clock() != nmethod::global_unloading_clock()) {
1868 // The nmethod has not been processed yet.
1869 return true;
1870 }
1872 // Clean inline caches pointing to both zombie and not_entrant methods
1873 if (!nm->is_in_use() || (nm->method()->code() != nm)) {
1874 ic->set_to_clean();
1875 assert(ic->is_clean(), err_msg("nmethod " PTR_FORMAT "not clean %s", from, from->method()->name_and_sig_as_C_string()));
1876 }
1877 }
1879 return false;
1880 }
1882 static bool clean_if_nmethod_is_unloaded(CompiledIC *ic, BoolObjectClosure *is_alive, nmethod* from) {
1883 return clean_if_nmethod_is_unloaded(ic, ic->ic_destination(), is_alive, from);
1884 }
1886 static bool clean_if_nmethod_is_unloaded(CompiledStaticCall *csc, BoolObjectClosure *is_alive, nmethod* from) {
1887 return clean_if_nmethod_is_unloaded(csc, csc->destination(), is_alive, from);
1888 }
1890 bool nmethod::unload_if_dead_at(RelocIterator* iter_at_oop, BoolObjectClosure *is_alive, bool unloading_occurred) {
1891 assert(iter_at_oop->type() == relocInfo::oop_type, "Wrong relocation type");
1893 oop_Relocation* r = iter_at_oop->oop_reloc();
1894 // Traverse those oops directly embedded in the code.
1895 // Other oops (oop_index>0) are seen as part of scopes_oops.
1896 assert(1 == (r->oop_is_immediate()) +
1897 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1898 "oop must be found in exactly one place");
1899 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1900 // Unload this nmethod if the oop is dead.
1901 if (can_unload(is_alive, r->oop_addr(), unloading_occurred)) {
1902 return true;;
1903 }
1904 }
1906 return false;
1907 }
1909 void nmethod::mark_metadata_on_stack_at(RelocIterator* iter_at_metadata) {
1910 assert(iter_at_metadata->type() == relocInfo::metadata_type, "Wrong relocation type");
1912 metadata_Relocation* r = iter_at_metadata->metadata_reloc();
1913 // In this metadata, we must only follow those metadatas directly embedded in
1914 // the code. Other metadatas (oop_index>0) are seen as part of
1915 // the metadata section below.
1916 assert(1 == (r->metadata_is_immediate()) +
1917 (r->metadata_addr() >= metadata_begin() && r->metadata_addr() < metadata_end()),
1918 "metadata must be found in exactly one place");
1919 if (r->metadata_is_immediate() && r->metadata_value() != NULL) {
1920 Metadata* md = r->metadata_value();
1921 if (md != _method) Metadata::mark_on_stack(md);
1922 }
1923 }
1925 void nmethod::mark_metadata_on_stack_non_relocs() {
1926 // Visit the metadata section
1927 for (Metadata** p = metadata_begin(); p < metadata_end(); p++) {
1928 if (*p == Universe::non_oop_word() || *p == NULL) continue; // skip non-oops
1929 Metadata* md = *p;
1930 Metadata::mark_on_stack(md);
1931 }
1933 // Visit metadata not embedded in the other places.
1934 if (_method != NULL) Metadata::mark_on_stack(_method);
1935 }
1937 bool nmethod::do_unloading_parallel(BoolObjectClosure* is_alive, bool unloading_occurred) {
1938 ResourceMark rm;
1940 // Make sure the oop's ready to receive visitors
1941 assert(!is_zombie() && !is_unloaded(),
1942 "should not call follow on zombie or unloaded nmethod");
1944 // If the method is not entrant then a JMP is plastered over the
1945 // first few bytes. If an oop in the old code was there, that oop
1946 // should not get GC'd. Skip the first few bytes of oops on
1947 // not-entrant methods.
1948 address low_boundary = verified_entry_point();
1949 if (is_not_entrant()) {
1950 low_boundary += NativeJump::instruction_size;
1951 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1952 // (See comment above.)
1953 }
1955 // The RedefineClasses() API can cause the class unloading invariant
1956 // to no longer be true. See jvmtiExport.hpp for details.
1957 // Also, leave a debugging breadcrumb in local flag.
1958 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1959 if (a_class_was_redefined) {
1960 // This set of the unloading_occurred flag is done before the
1961 // call to post_compiled_method_unload() so that the unloading
1962 // of this nmethod is reported.
1963 unloading_occurred = true;
1964 }
1966 // When class redefinition is used all metadata in the CodeCache has to be recorded,
1967 // so that unused "previous versions" can be purged. Since walking the CodeCache can
1968 // be expensive, the "mark on stack" is piggy-backed on this parallel unloading code.
1969 bool mark_metadata_on_stack = a_class_was_redefined;
1971 // Exception cache
1972 clean_exception_cache(is_alive);
1974 bool is_unloaded = false;
1975 bool postponed = false;
1977 RelocIterator iter(this, low_boundary);
1978 while(iter.next()) {
1980 switch (iter.type()) {
1982 case relocInfo::virtual_call_type:
1983 if (unloading_occurred) {
1984 // If class unloading occurred we first iterate over all inline caches and
1985 // clear ICs where the cached oop is referring to an unloaded klass or method.
1986 clean_ic_if_metadata_is_dead(CompiledIC_at(&iter), is_alive, mark_metadata_on_stack);
1987 }
1989 postponed |= clean_if_nmethod_is_unloaded(CompiledIC_at(&iter), is_alive, this);
1990 break;
1992 case relocInfo::opt_virtual_call_type:
1993 postponed |= clean_if_nmethod_is_unloaded(CompiledIC_at(&iter), is_alive, this);
1994 break;
1996 case relocInfo::static_call_type:
1997 postponed |= clean_if_nmethod_is_unloaded(compiledStaticCall_at(iter.reloc()), is_alive, this);
1998 break;
2000 case relocInfo::oop_type:
2001 if (!is_unloaded) {
2002 is_unloaded = unload_if_dead_at(&iter, is_alive, unloading_occurred);
2003 }
2004 break;
2006 case relocInfo::metadata_type:
2007 if (mark_metadata_on_stack) {
2008 mark_metadata_on_stack_at(&iter);
2009 }
2010 }
2011 }
2013 if (mark_metadata_on_stack) {
2014 mark_metadata_on_stack_non_relocs();
2015 }
2017 if (is_unloaded) {
2018 return postponed;
2019 }
2021 // Scopes
2022 for (oop* p = oops_begin(); p < oops_end(); p++) {
2023 if (*p == Universe::non_oop_word()) continue; // skip non-oops
2024 if (can_unload(is_alive, p, unloading_occurred)) {
2025 is_unloaded = true;
2026 break;
2027 }
2028 }
2030 if (is_unloaded) {
2031 return postponed;
2032 }
2034 // Ensure that all metadata is still alive
2035 verify_metadata_loaders(low_boundary, is_alive);
2037 return postponed;
2038 }
2040 void nmethod::do_unloading_parallel_postponed(BoolObjectClosure* is_alive, bool unloading_occurred) {
2041 ResourceMark rm;
2043 // Make sure the oop's ready to receive visitors
2044 assert(!is_zombie(),
2045 "should not call follow on zombie nmethod");
2047 // If the method is not entrant then a JMP is plastered over the
2048 // first few bytes. If an oop in the old code was there, that oop
2049 // should not get GC'd. Skip the first few bytes of oops on
2050 // not-entrant methods.
2051 address low_boundary = verified_entry_point();
2052 if (is_not_entrant()) {
2053 low_boundary += NativeJump::instruction_size;
2054 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
2055 // (See comment above.)
2056 }
2058 RelocIterator iter(this, low_boundary);
2059 while(iter.next()) {
2061 switch (iter.type()) {
2063 case relocInfo::virtual_call_type:
2064 clean_if_nmethod_is_unloaded(CompiledIC_at(&iter), is_alive, this);
2065 break;
2067 case relocInfo::opt_virtual_call_type:
2068 clean_if_nmethod_is_unloaded(CompiledIC_at(&iter), is_alive, this);
2069 break;
2071 case relocInfo::static_call_type:
2072 clean_if_nmethod_is_unloaded(compiledStaticCall_at(iter.reloc()), is_alive, this);
2073 break;
2074 }
2075 }
2076 }
2078 #ifdef ASSERT
2080 class CheckClass : AllStatic {
2081 static BoolObjectClosure* _is_alive;
2083 // Check class_loader is alive for this bit of metadata.
2084 static void check_class(Metadata* md) {
2085 Klass* klass = NULL;
2086 if (md->is_klass()) {
2087 klass = ((Klass*)md);
2088 } else if (md->is_method()) {
2089 klass = ((Method*)md)->method_holder();
2090 } else if (md->is_methodData()) {
2091 klass = ((MethodData*)md)->method()->method_holder();
2092 } else {
2093 md->print();
2094 ShouldNotReachHere();
2095 }
2096 assert(klass->is_loader_alive(_is_alive), "must be alive");
2097 }
2098 public:
2099 static void do_check_class(BoolObjectClosure* is_alive, nmethod* nm) {
2100 assert(SafepointSynchronize::is_at_safepoint(), "this is only ok at safepoint");
2101 _is_alive = is_alive;
2102 nm->metadata_do(check_class);
2103 }
2104 };
2106 // This is called during a safepoint so can use static data
2107 BoolObjectClosure* CheckClass::_is_alive = NULL;
2108 #endif // ASSERT
2111 // Processing of oop references should have been sufficient to keep
2112 // all strong references alive. Any weak references should have been
2113 // cleared as well. Visit all the metadata and ensure that it's
2114 // really alive.
2115 void nmethod::verify_metadata_loaders(address low_boundary, BoolObjectClosure* is_alive) {
2116 #ifdef ASSERT
2117 RelocIterator iter(this, low_boundary);
2118 while (iter.next()) {
2119 // static_stub_Relocations may have dangling references to
2120 // Method*s so trim them out here. Otherwise it looks like
2121 // compiled code is maintaining a link to dead metadata.
2122 address static_call_addr = NULL;
2123 if (iter.type() == relocInfo::opt_virtual_call_type) {
2124 CompiledIC* cic = CompiledIC_at(&iter);
2125 if (!cic->is_call_to_interpreted()) {
2126 static_call_addr = iter.addr();
2127 }
2128 } else if (iter.type() == relocInfo::static_call_type) {
2129 CompiledStaticCall* csc = compiledStaticCall_at(iter.reloc());
2130 if (!csc->is_call_to_interpreted()) {
2131 static_call_addr = iter.addr();
2132 }
2133 }
2134 if (static_call_addr != NULL) {
2135 RelocIterator sciter(this, low_boundary);
2136 while (sciter.next()) {
2137 if (sciter.type() == relocInfo::static_stub_type &&
2138 sciter.static_stub_reloc()->static_call() == static_call_addr) {
2139 sciter.static_stub_reloc()->clear_inline_cache();
2140 }
2141 }
2142 }
2143 }
2144 // Check that the metadata embedded in the nmethod is alive
2145 CheckClass::do_check_class(is_alive, this);
2146 #endif
2147 }
2150 // Iterate over metadata calling this function. Used by RedefineClasses
2151 void nmethod::metadata_do(void f(Metadata*)) {
2152 address low_boundary = verified_entry_point();
2153 if (is_not_entrant()) {
2154 low_boundary += NativeJump::instruction_size;
2155 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
2156 // (See comment above.)
2157 }
2158 {
2159 // Visit all immediate references that are embedded in the instruction stream.
2160 RelocIterator iter(this, low_boundary);
2161 while (iter.next()) {
2162 if (iter.type() == relocInfo::metadata_type ) {
2163 metadata_Relocation* r = iter.metadata_reloc();
2164 // In this metadata, we must only follow those metadatas directly embedded in
2165 // the code. Other metadatas (oop_index>0) are seen as part of
2166 // the metadata section below.
2167 assert(1 == (r->metadata_is_immediate()) +
2168 (r->metadata_addr() >= metadata_begin() && r->metadata_addr() < metadata_end()),
2169 "metadata must be found in exactly one place");
2170 if (r->metadata_is_immediate() && r->metadata_value() != NULL) {
2171 Metadata* md = r->metadata_value();
2172 f(md);
2173 }
2174 } else if (iter.type() == relocInfo::virtual_call_type) {
2175 // Check compiledIC holders associated with this nmethod
2176 CompiledIC *ic = CompiledIC_at(&iter);
2177 if (ic->is_icholder_call()) {
2178 CompiledICHolder* cichk = ic->cached_icholder();
2179 f(cichk->holder_method());
2180 f(cichk->holder_klass());
2181 } else {
2182 Metadata* ic_oop = ic->cached_metadata();
2183 if (ic_oop != NULL) {
2184 f(ic_oop);
2185 }
2186 }
2187 }
2188 }
2189 }
2191 // Visit the metadata section
2192 for (Metadata** p = metadata_begin(); p < metadata_end(); p++) {
2193 if (*p == Universe::non_oop_word() || *p == NULL) continue; // skip non-oops
2194 Metadata* md = *p;
2195 f(md);
2196 }
2198 // Visit metadata not embedded in the other places.
2199 if (_method != NULL) f(_method);
2200 }
2202 void nmethod::oops_do(OopClosure* f, bool allow_zombie) {
2203 // make sure the oops ready to receive visitors
2204 assert(allow_zombie || !is_zombie(), "should not call follow on zombie nmethod");
2205 assert(!is_unloaded(), "should not call follow on unloaded nmethod");
2207 // If the method is not entrant or zombie then a JMP is plastered over the
2208 // first few bytes. If an oop in the old code was there, that oop
2209 // should not get GC'd. Skip the first few bytes of oops on
2210 // not-entrant methods.
2211 address low_boundary = verified_entry_point();
2212 if (is_not_entrant()) {
2213 low_boundary += NativeJump::instruction_size;
2214 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
2215 // (See comment above.)
2216 }
2218 RelocIterator iter(this, low_boundary);
2220 while (iter.next()) {
2221 if (iter.type() == relocInfo::oop_type ) {
2222 oop_Relocation* r = iter.oop_reloc();
2223 // In this loop, we must only follow those oops directly embedded in
2224 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
2225 assert(1 == (r->oop_is_immediate()) +
2226 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
2227 "oop must be found in exactly one place");
2228 if (r->oop_is_immediate() && r->oop_value() != NULL) {
2229 f->do_oop(r->oop_addr());
2230 }
2231 }
2232 }
2234 // Scopes
2235 // This includes oop constants not inlined in the code stream.
2236 for (oop* p = oops_begin(); p < oops_end(); p++) {
2237 if (*p == Universe::non_oop_word()) continue; // skip non-oops
2238 f->do_oop(p);
2239 }
2240 }
2242 #define NMETHOD_SENTINEL ((nmethod*)badAddress)
2244 nmethod* volatile nmethod::_oops_do_mark_nmethods;
2246 // An nmethod is "marked" if its _mark_link is set non-null.
2247 // Even if it is the end of the linked list, it will have a non-null link value,
2248 // as long as it is on the list.
2249 // This code must be MP safe, because it is used from parallel GC passes.
2250 bool nmethod::test_set_oops_do_mark() {
2251 assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
2252 nmethod* observed_mark_link = _oops_do_mark_link;
2253 if (observed_mark_link == NULL) {
2254 // Claim this nmethod for this thread to mark.
2255 observed_mark_link = (nmethod*)
2256 Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL);
2257 if (observed_mark_link == NULL) {
2259 // Atomically append this nmethod (now claimed) to the head of the list:
2260 nmethod* observed_mark_nmethods = _oops_do_mark_nmethods;
2261 for (;;) {
2262 nmethod* required_mark_nmethods = observed_mark_nmethods;
2263 _oops_do_mark_link = required_mark_nmethods;
2264 observed_mark_nmethods = (nmethod*)
2265 Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods);
2266 if (observed_mark_nmethods == required_mark_nmethods)
2267 break;
2268 }
2269 // Mark was clear when we first saw this guy.
2270 NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark"));
2271 return false;
2272 }
2273 }
2274 // On fall through, another racing thread marked this nmethod before we did.
2275 return true;
2276 }
2278 void nmethod::oops_do_marking_prologue() {
2279 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue"));
2280 assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row");
2281 // We use cmpxchg_ptr instead of regular assignment here because the user
2282 // may fork a bunch of threads, and we need them all to see the same state.
2283 void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL);
2284 guarantee(observed == NULL, "no races in this sequential code");
2285 }
2287 void nmethod::oops_do_marking_epilogue() {
2288 assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row");
2289 nmethod* cur = _oops_do_mark_nmethods;
2290 while (cur != NMETHOD_SENTINEL) {
2291 assert(cur != NULL, "not NULL-terminated");
2292 nmethod* next = cur->_oops_do_mark_link;
2293 cur->_oops_do_mark_link = NULL;
2294 cur->verify_oop_relocations();
2295 NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark"));
2296 cur = next;
2297 }
2298 void* required = _oops_do_mark_nmethods;
2299 void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required);
2300 guarantee(observed == required, "no races in this sequential code");
2301 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]"));
2302 }
2304 class DetectScavengeRoot: public OopClosure {
2305 bool _detected_scavenge_root;
2306 public:
2307 DetectScavengeRoot() : _detected_scavenge_root(false)
2308 { NOT_PRODUCT(_print_nm = NULL); }
2309 bool detected_scavenge_root() { return _detected_scavenge_root; }
2310 virtual void do_oop(oop* p) {
2311 if ((*p) != NULL && (*p)->is_scavengable()) {
2312 NOT_PRODUCT(maybe_print(p));
2313 _detected_scavenge_root = true;
2314 }
2315 }
2316 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2318 #ifndef PRODUCT
2319 nmethod* _print_nm;
2320 void maybe_print(oop* p) {
2321 if (_print_nm == NULL) return;
2322 if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root");
2323 tty->print_cr(""PTR_FORMAT"[offset=%d] detected scavengable oop "PTR_FORMAT" (found at "PTR_FORMAT")",
2324 _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm),
2325 (void *)(*p), (intptr_t)p);
2326 (*p)->print();
2327 }
2328 #endif //PRODUCT
2329 };
2331 bool nmethod::detect_scavenge_root_oops() {
2332 DetectScavengeRoot detect_scavenge_root;
2333 NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this);
2334 oops_do(&detect_scavenge_root);
2335 return detect_scavenge_root.detected_scavenge_root();
2336 }
2338 // Method that knows how to preserve outgoing arguments at call. This method must be
2339 // called with a frame corresponding to a Java invoke
2340 void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) {
2341 #ifndef SHARK
2342 if (!method()->is_native()) {
2343 SimpleScopeDesc ssd(this, fr.pc());
2344 Bytecode_invoke call(ssd.method(), ssd.bci());
2345 bool has_receiver = call.has_receiver();
2346 bool has_appendix = call.has_appendix();
2347 Symbol* signature = call.signature();
2348 fr.oops_compiled_arguments_do(signature, has_receiver, has_appendix, reg_map, f);
2349 }
2350 #endif // !SHARK
2351 }
2354 oop nmethod::embeddedOop_at(u_char* p) {
2355 RelocIterator iter(this, p, p + 1);
2356 while (iter.next())
2357 if (iter.type() == relocInfo::oop_type) {
2358 return iter.oop_reloc()->oop_value();
2359 }
2360 return NULL;
2361 }
2364 inline bool includes(void* p, void* from, void* to) {
2365 return from <= p && p < to;
2366 }
2369 void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) {
2370 assert(count >= 2, "must be sentinel values, at least");
2372 #ifdef ASSERT
2373 // must be sorted and unique; we do a binary search in find_pc_desc()
2374 int prev_offset = pcs[0].pc_offset();
2375 assert(prev_offset == PcDesc::lower_offset_limit,
2376 "must start with a sentinel");
2377 for (int i = 1; i < count; i++) {
2378 int this_offset = pcs[i].pc_offset();
2379 assert(this_offset > prev_offset, "offsets must be sorted");
2380 prev_offset = this_offset;
2381 }
2382 assert(prev_offset == PcDesc::upper_offset_limit,
2383 "must end with a sentinel");
2384 #endif //ASSERT
2386 // Search for MethodHandle invokes and tag the nmethod.
2387 for (int i = 0; i < count; i++) {
2388 if (pcs[i].is_method_handle_invoke()) {
2389 set_has_method_handle_invokes(true);
2390 break;
2391 }
2392 }
2393 assert(has_method_handle_invokes() == (_deoptimize_mh_offset != -1), "must have deopt mh handler");
2395 int size = count * sizeof(PcDesc);
2396 assert(scopes_pcs_size() >= size, "oob");
2397 memcpy(scopes_pcs_begin(), pcs, size);
2399 // Adjust the final sentinel downward.
2400 PcDesc* last_pc = &scopes_pcs_begin()[count-1];
2401 assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity");
2402 last_pc->set_pc_offset(content_size() + 1);
2403 for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) {
2404 // Fill any rounding gaps with copies of the last record.
2405 last_pc[1] = last_pc[0];
2406 }
2407 // The following assert could fail if sizeof(PcDesc) is not
2408 // an integral multiple of oopSize (the rounding term).
2409 // If it fails, change the logic to always allocate a multiple
2410 // of sizeof(PcDesc), and fill unused words with copies of *last_pc.
2411 assert(last_pc + 1 == scopes_pcs_end(), "must match exactly");
2412 }
2414 void nmethod::copy_scopes_data(u_char* buffer, int size) {
2415 assert(scopes_data_size() >= size, "oob");
2416 memcpy(scopes_data_begin(), buffer, size);
2417 }
2420 #ifdef ASSERT
2421 static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) {
2422 PcDesc* lower = nm->scopes_pcs_begin();
2423 PcDesc* upper = nm->scopes_pcs_end();
2424 lower += 1; // exclude initial sentinel
2425 PcDesc* res = NULL;
2426 for (PcDesc* p = lower; p < upper; p++) {
2427 NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc
2428 if (match_desc(p, pc_offset, approximate)) {
2429 if (res == NULL)
2430 res = p;
2431 else
2432 res = (PcDesc*) badAddress;
2433 }
2434 }
2435 return res;
2436 }
2437 #endif
2440 // Finds a PcDesc with real-pc equal to "pc"
2441 PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) {
2442 address base_address = code_begin();
2443 if ((pc < base_address) ||
2444 (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) {
2445 return NULL; // PC is wildly out of range
2446 }
2447 int pc_offset = (int) (pc - base_address);
2449 // Check the PcDesc cache if it contains the desired PcDesc
2450 // (This as an almost 100% hit rate.)
2451 PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate);
2452 if (res != NULL) {
2453 assert(res == linear_search(this, pc_offset, approximate), "cache ok");
2454 return res;
2455 }
2457 // Fallback algorithm: quasi-linear search for the PcDesc
2458 // Find the last pc_offset less than the given offset.
2459 // The successor must be the required match, if there is a match at all.
2460 // (Use a fixed radix to avoid expensive affine pointer arithmetic.)
2461 PcDesc* lower = scopes_pcs_begin();
2462 PcDesc* upper = scopes_pcs_end();
2463 upper -= 1; // exclude final sentinel
2464 if (lower >= upper) return NULL; // native method; no PcDescs at all
2466 #define assert_LU_OK \
2467 /* invariant on lower..upper during the following search: */ \
2468 assert(lower->pc_offset() < pc_offset, "sanity"); \
2469 assert(upper->pc_offset() >= pc_offset, "sanity")
2470 assert_LU_OK;
2472 // Use the last successful return as a split point.
2473 PcDesc* mid = _pc_desc_cache.last_pc_desc();
2474 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
2475 if (mid->pc_offset() < pc_offset) {
2476 lower = mid;
2477 } else {
2478 upper = mid;
2479 }
2481 // Take giant steps at first (4096, then 256, then 16, then 1)
2482 const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1);
2483 const int RADIX = (1 << LOG2_RADIX);
2484 for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) {
2485 while ((mid = lower + step) < upper) {
2486 assert_LU_OK;
2487 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
2488 if (mid->pc_offset() < pc_offset) {
2489 lower = mid;
2490 } else {
2491 upper = mid;
2492 break;
2493 }
2494 }
2495 assert_LU_OK;
2496 }
2498 // Sneak up on the value with a linear search of length ~16.
2499 while (true) {
2500 assert_LU_OK;
2501 mid = lower + 1;
2502 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
2503 if (mid->pc_offset() < pc_offset) {
2504 lower = mid;
2505 } else {
2506 upper = mid;
2507 break;
2508 }
2509 }
2510 #undef assert_LU_OK
2512 if (match_desc(upper, pc_offset, approximate)) {
2513 assert(upper == linear_search(this, pc_offset, approximate), "search ok");
2514 _pc_desc_cache.add_pc_desc(upper);
2515 return upper;
2516 } else {
2517 assert(NULL == linear_search(this, pc_offset, approximate), "search ok");
2518 return NULL;
2519 }
2520 }
2523 bool nmethod::check_all_dependencies() {
2524 bool found_check = false;
2525 // wholesale check of all dependencies
2526 for (Dependencies::DepStream deps(this); deps.next(); ) {
2527 if (deps.check_dependency() != NULL) {
2528 found_check = true;
2529 NOT_DEBUG(break);
2530 }
2531 }
2532 return found_check; // tell caller if we found anything
2533 }
2535 bool nmethod::check_dependency_on(DepChange& changes) {
2536 // What has happened:
2537 // 1) a new class dependee has been added
2538 // 2) dependee and all its super classes have been marked
2539 bool found_check = false; // set true if we are upset
2540 for (Dependencies::DepStream deps(this); deps.next(); ) {
2541 // Evaluate only relevant dependencies.
2542 if (deps.spot_check_dependency_at(changes) != NULL) {
2543 found_check = true;
2544 NOT_DEBUG(break);
2545 }
2546 }
2547 return found_check;
2548 }
2550 bool nmethod::is_evol_dependent_on(Klass* dependee) {
2551 InstanceKlass *dependee_ik = InstanceKlass::cast(dependee);
2552 Array<Method*>* dependee_methods = dependee_ik->methods();
2553 for (Dependencies::DepStream deps(this); deps.next(); ) {
2554 if (deps.type() == Dependencies::evol_method) {
2555 Method* method = deps.method_argument(0);
2556 for (int j = 0; j < dependee_methods->length(); j++) {
2557 if (dependee_methods->at(j) == method) {
2558 // RC_TRACE macro has an embedded ResourceMark
2559 RC_TRACE(0x01000000,
2560 ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)",
2561 _method->method_holder()->external_name(),
2562 _method->name()->as_C_string(),
2563 _method->signature()->as_C_string(), compile_id(),
2564 method->method_holder()->external_name(),
2565 method->name()->as_C_string(),
2566 method->signature()->as_C_string()));
2567 if (TraceDependencies || LogCompilation)
2568 deps.log_dependency(dependee);
2569 return true;
2570 }
2571 }
2572 }
2573 }
2574 return false;
2575 }
2577 // Called from mark_for_deoptimization, when dependee is invalidated.
2578 bool nmethod::is_dependent_on_method(Method* dependee) {
2579 for (Dependencies::DepStream deps(this); deps.next(); ) {
2580 if (deps.type() != Dependencies::evol_method)
2581 continue;
2582 Method* method = deps.method_argument(0);
2583 if (method == dependee) return true;
2584 }
2585 return false;
2586 }
2589 bool nmethod::is_patchable_at(address instr_addr) {
2590 assert(insts_contains(instr_addr), "wrong nmethod used");
2591 if (is_zombie()) {
2592 // a zombie may never be patched
2593 return false;
2594 }
2595 return true;
2596 }
2599 address nmethod::continuation_for_implicit_exception(address pc) {
2600 // Exception happened outside inline-cache check code => we are inside
2601 // an active nmethod => use cpc to determine a return address
2602 int exception_offset = pc - code_begin();
2603 int cont_offset = ImplicitExceptionTable(this).at( exception_offset );
2604 #ifdef ASSERT
2605 if (cont_offset == 0) {
2606 Thread* thread = ThreadLocalStorage::get_thread_slow();
2607 ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
2608 HandleMark hm(thread);
2609 ResourceMark rm(thread);
2610 CodeBlob* cb = CodeCache::find_blob(pc);
2611 assert(cb != NULL && cb == this, "");
2612 tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc);
2613 print();
2614 method()->print_codes();
2615 print_code();
2616 print_pcs();
2617 }
2618 #endif
2619 if (cont_offset == 0) {
2620 // Let the normal error handling report the exception
2621 return NULL;
2622 }
2623 return code_begin() + cont_offset;
2624 }
2628 void nmethod_init() {
2629 // make sure you didn't forget to adjust the filler fields
2630 assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word");
2631 }
2634 //-------------------------------------------------------------------------------------------
2637 // QQQ might we make this work from a frame??
2638 nmethodLocker::nmethodLocker(address pc) {
2639 CodeBlob* cb = CodeCache::find_blob(pc);
2640 guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found");
2641 _nm = (nmethod*)cb;
2642 lock_nmethod(_nm);
2643 }
2645 // Only JvmtiDeferredEvent::compiled_method_unload_event()
2646 // should pass zombie_ok == true.
2647 void nmethodLocker::lock_nmethod(nmethod* nm, bool zombie_ok) {
2648 if (nm == NULL) return;
2649 Atomic::inc(&nm->_lock_count);
2650 guarantee(zombie_ok || !nm->is_zombie(), "cannot lock a zombie method");
2651 }
2653 void nmethodLocker::unlock_nmethod(nmethod* nm) {
2654 if (nm == NULL) return;
2655 Atomic::dec(&nm->_lock_count);
2656 guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock");
2657 }
2660 // -----------------------------------------------------------------------------
2661 // nmethod::get_deopt_original_pc
2662 //
2663 // Return the original PC for the given PC if:
2664 // (a) the given PC belongs to a nmethod and
2665 // (b) it is a deopt PC
2666 address nmethod::get_deopt_original_pc(const frame* fr) {
2667 if (fr->cb() == NULL) return NULL;
2669 nmethod* nm = fr->cb()->as_nmethod_or_null();
2670 if (nm != NULL && nm->is_deopt_pc(fr->pc()))
2671 return nm->get_original_pc(fr);
2673 return NULL;
2674 }
2677 // -----------------------------------------------------------------------------
2678 // MethodHandle
2680 bool nmethod::is_method_handle_return(address return_pc) {
2681 if (!has_method_handle_invokes()) return false;
2682 PcDesc* pd = pc_desc_at(return_pc);
2683 if (pd == NULL)
2684 return false;
2685 return pd->is_method_handle_invoke();
2686 }
2689 // -----------------------------------------------------------------------------
2690 // Verification
2692 class VerifyOopsClosure: public OopClosure {
2693 nmethod* _nm;
2694 bool _ok;
2695 public:
2696 VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { }
2697 bool ok() { return _ok; }
2698 virtual void do_oop(oop* p) {
2699 if ((*p) == NULL || (*p)->is_oop()) return;
2700 if (_ok) {
2701 _nm->print_nmethod(true);
2702 _ok = false;
2703 }
2704 tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2705 (void *)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2706 }
2707 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2708 };
2710 void nmethod::verify() {
2712 // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant
2713 // seems odd.
2715 if (is_zombie() || is_not_entrant() || is_unloaded())
2716 return;
2718 // Make sure all the entry points are correctly aligned for patching.
2719 NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point());
2721 // assert(method()->is_oop(), "must be valid");
2723 ResourceMark rm;
2725 if (!CodeCache::contains(this)) {
2726 fatal(err_msg("nmethod at " INTPTR_FORMAT " not in zone", this));
2727 }
2729 if(is_native_method() )
2730 return;
2732 nmethod* nm = CodeCache::find_nmethod(verified_entry_point());
2733 if (nm != this) {
2734 fatal(err_msg("findNMethod did not find this nmethod (" INTPTR_FORMAT ")",
2735 this));
2736 }
2738 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2739 if (! p->verify(this)) {
2740 tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this);
2741 }
2742 }
2744 VerifyOopsClosure voc(this);
2745 oops_do(&voc);
2746 assert(voc.ok(), "embedded oops must be OK");
2747 verify_scavenge_root_oops();
2749 verify_scopes();
2750 }
2753 void nmethod::verify_interrupt_point(address call_site) {
2754 // Verify IC only when nmethod installation is finished.
2755 bool is_installed = (method()->code() == this) // nmethod is in state 'in_use' and installed
2756 || !this->is_in_use(); // nmethod is installed, but not in 'in_use' state
2757 if (is_installed) {
2758 Thread *cur = Thread::current();
2759 if (CompiledIC_lock->owner() == cur ||
2760 ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) &&
2761 SafepointSynchronize::is_at_safepoint())) {
2762 CompiledIC_at(this, call_site);
2763 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
2764 } else {
2765 MutexLocker ml_verify (CompiledIC_lock);
2766 CompiledIC_at(this, call_site);
2767 }
2768 }
2770 PcDesc* pd = pc_desc_at(nativeCall_at(call_site)->return_address());
2771 assert(pd != NULL, "PcDesc must exist");
2772 for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(),
2773 pd->obj_decode_offset(), pd->should_reexecute(),
2774 pd->return_oop());
2775 !sd->is_top(); sd = sd->sender()) {
2776 sd->verify();
2777 }
2778 }
2780 void nmethod::verify_scopes() {
2781 if( !method() ) return; // Runtime stubs have no scope
2782 if (method()->is_native()) return; // Ignore stub methods.
2783 // iterate through all interrupt point
2784 // and verify the debug information is valid.
2785 RelocIterator iter((nmethod*)this);
2786 while (iter.next()) {
2787 address stub = NULL;
2788 switch (iter.type()) {
2789 case relocInfo::virtual_call_type:
2790 verify_interrupt_point(iter.addr());
2791 break;
2792 case relocInfo::opt_virtual_call_type:
2793 stub = iter.opt_virtual_call_reloc()->static_stub();
2794 verify_interrupt_point(iter.addr());
2795 break;
2796 case relocInfo::static_call_type:
2797 stub = iter.static_call_reloc()->static_stub();
2798 //verify_interrupt_point(iter.addr());
2799 break;
2800 case relocInfo::runtime_call_type:
2801 address destination = iter.reloc()->value();
2802 // Right now there is no way to find out which entries support
2803 // an interrupt point. It would be nice if we had this
2804 // information in a table.
2805 break;
2806 }
2807 assert(stub == NULL || stub_contains(stub), "static call stub outside stub section");
2808 }
2809 }
2812 // -----------------------------------------------------------------------------
2813 // Non-product code
2814 #ifndef PRODUCT
2816 class DebugScavengeRoot: public OopClosure {
2817 nmethod* _nm;
2818 bool _ok;
2819 public:
2820 DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { }
2821 bool ok() { return _ok; }
2822 virtual void do_oop(oop* p) {
2823 if ((*p) == NULL || !(*p)->is_scavengable()) return;
2824 if (_ok) {
2825 _nm->print_nmethod(true);
2826 _ok = false;
2827 }
2828 tty->print_cr("*** scavengable oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2829 (void *)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2830 (*p)->print();
2831 }
2832 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2833 };
2835 void nmethod::verify_scavenge_root_oops() {
2836 if (UseG1GC) {
2837 return;
2838 }
2840 if (!on_scavenge_root_list()) {
2841 // Actually look inside, to verify the claim that it's clean.
2842 DebugScavengeRoot debug_scavenge_root(this);
2843 oops_do(&debug_scavenge_root);
2844 if (!debug_scavenge_root.ok())
2845 fatal("found an unadvertised bad scavengable oop in the code cache");
2846 }
2847 assert(scavenge_root_not_marked(), "");
2848 }
2850 #endif // PRODUCT
2852 // Printing operations
2854 void nmethod::print() const {
2855 ResourceMark rm;
2856 ttyLocker ttyl; // keep the following output all in one block
2858 tty->print("Compiled method ");
2860 if (is_compiled_by_c1()) {
2861 tty->print("(c1) ");
2862 } else if (is_compiled_by_c2()) {
2863 tty->print("(c2) ");
2864 } else if (is_compiled_by_shark()) {
2865 tty->print("(shark) ");
2866 } else {
2867 tty->print("(nm) ");
2868 }
2870 print_on(tty, NULL);
2872 if (WizardMode) {
2873 tty->print("((nmethod*) "INTPTR_FORMAT ") ", this);
2874 tty->print(" for method " INTPTR_FORMAT , (address)method());
2875 tty->print(" { ");
2876 if (is_in_use()) tty->print("in_use ");
2877 if (is_not_entrant()) tty->print("not_entrant ");
2878 if (is_zombie()) tty->print("zombie ");
2879 if (is_unloaded()) tty->print("unloaded ");
2880 if (on_scavenge_root_list()) tty->print("scavenge_root ");
2881 tty->print_cr("}:");
2882 }
2883 if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2884 (address)this,
2885 (address)this + size(),
2886 size());
2887 if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2888 relocation_begin(),
2889 relocation_end(),
2890 relocation_size());
2891 if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2892 consts_begin(),
2893 consts_end(),
2894 consts_size());
2895 if (insts_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2896 insts_begin(),
2897 insts_end(),
2898 insts_size());
2899 if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2900 stub_begin(),
2901 stub_end(),
2902 stub_size());
2903 if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2904 oops_begin(),
2905 oops_end(),
2906 oops_size());
2907 if (metadata_size () > 0) tty->print_cr(" metadata [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2908 metadata_begin(),
2909 metadata_end(),
2910 metadata_size());
2911 if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2912 scopes_data_begin(),
2913 scopes_data_end(),
2914 scopes_data_size());
2915 if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2916 scopes_pcs_begin(),
2917 scopes_pcs_end(),
2918 scopes_pcs_size());
2919 if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2920 dependencies_begin(),
2921 dependencies_end(),
2922 dependencies_size());
2923 if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2924 handler_table_begin(),
2925 handler_table_end(),
2926 handler_table_size());
2927 if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2928 nul_chk_table_begin(),
2929 nul_chk_table_end(),
2930 nul_chk_table_size());
2931 }
2933 void nmethod::print_code() {
2934 HandleMark hm;
2935 ResourceMark m;
2936 Disassembler::decode(this);
2937 }
2940 #ifndef PRODUCT
2942 void nmethod::print_scopes() {
2943 // Find the first pc desc for all scopes in the code and print it.
2944 ResourceMark rm;
2945 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2946 if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null)
2947 continue;
2949 ScopeDesc* sd = scope_desc_at(p->real_pc(this));
2950 sd->print_on(tty, p);
2951 }
2952 }
2954 void nmethod::print_dependencies() {
2955 ResourceMark rm;
2956 ttyLocker ttyl; // keep the following output all in one block
2957 tty->print_cr("Dependencies:");
2958 for (Dependencies::DepStream deps(this); deps.next(); ) {
2959 deps.print_dependency();
2960 Klass* ctxk = deps.context_type();
2961 if (ctxk != NULL) {
2962 if (ctxk->oop_is_instance() && ((InstanceKlass*)ctxk)->is_dependent_nmethod(this)) {
2963 tty->print_cr(" [nmethod<=klass]%s", ctxk->external_name());
2964 }
2965 }
2966 deps.log_dependency(); // put it into the xml log also
2967 }
2968 }
2971 void nmethod::print_relocations() {
2972 ResourceMark m; // in case methods get printed via the debugger
2973 tty->print_cr("relocations:");
2974 RelocIterator iter(this);
2975 iter.print();
2976 if (UseRelocIndex) {
2977 jint* index_end = (jint*)relocation_end() - 1;
2978 jint index_size = *index_end;
2979 jint* index_start = (jint*)( (address)index_end - index_size );
2980 tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size);
2981 if (index_size > 0) {
2982 jint* ip;
2983 for (ip = index_start; ip+2 <= index_end; ip += 2)
2984 tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT,
2985 ip[0],
2986 ip[1],
2987 header_end()+ip[0],
2988 relocation_begin()-1+ip[1]);
2989 for (; ip < index_end; ip++)
2990 tty->print_cr(" (%d ?)", ip[0]);
2991 tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip);
2992 ip++;
2993 tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip);
2994 }
2995 }
2996 }
2999 void nmethod::print_pcs() {
3000 ResourceMark m; // in case methods get printed via debugger
3001 tty->print_cr("pc-bytecode offsets:");
3002 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
3003 p->print(this);
3004 }
3005 }
3007 #endif // PRODUCT
3009 const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
3010 RelocIterator iter(this, begin, end);
3011 bool have_one = false;
3012 while (iter.next()) {
3013 have_one = true;
3014 switch (iter.type()) {
3015 case relocInfo::none: return "no_reloc";
3016 case relocInfo::oop_type: {
3017 stringStream st;
3018 oop_Relocation* r = iter.oop_reloc();
3019 oop obj = r->oop_value();
3020 st.print("oop(");
3021 if (obj == NULL) st.print("NULL");
3022 else obj->print_value_on(&st);
3023 st.print(")");
3024 return st.as_string();
3025 }
3026 case relocInfo::metadata_type: {
3027 stringStream st;
3028 metadata_Relocation* r = iter.metadata_reloc();
3029 Metadata* obj = r->metadata_value();
3030 st.print("metadata(");
3031 if (obj == NULL) st.print("NULL");
3032 else obj->print_value_on(&st);
3033 st.print(")");
3034 return st.as_string();
3035 }
3036 case relocInfo::virtual_call_type: return "virtual_call";
3037 case relocInfo::opt_virtual_call_type: return "optimized virtual_call";
3038 case relocInfo::static_call_type: return "static_call";
3039 case relocInfo::static_stub_type: return "static_stub";
3040 case relocInfo::runtime_call_type: return "runtime_call";
3041 case relocInfo::external_word_type: return "external_word";
3042 case relocInfo::internal_word_type: return "internal_word";
3043 case relocInfo::section_word_type: return "section_word";
3044 case relocInfo::poll_type: return "poll";
3045 case relocInfo::poll_return_type: return "poll_return";
3046 case relocInfo::type_mask: return "type_bit_mask";
3047 }
3048 }
3049 return have_one ? "other" : NULL;
3050 }
3052 // Return a the last scope in (begin..end]
3053 ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
3054 PcDesc* p = pc_desc_near(begin+1);
3055 if (p != NULL && p->real_pc(this) <= end) {
3056 return new ScopeDesc(this, p->scope_decode_offset(),
3057 p->obj_decode_offset(), p->should_reexecute(),
3058 p->return_oop());
3059 }
3060 return NULL;
3061 }
3063 void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) const {
3064 if (block_begin == entry_point()) stream->print_cr("[Entry Point]");
3065 if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]");
3066 if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]");
3067 if (block_begin == stub_begin()) stream->print_cr("[Stub Code]");
3068 if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]");
3070 if (has_method_handle_invokes())
3071 if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]");
3073 if (block_begin == consts_begin()) stream->print_cr("[Constants]");
3075 if (block_begin == entry_point()) {
3076 methodHandle m = method();
3077 if (m.not_null()) {
3078 stream->print(" # ");
3079 m->print_value_on(stream);
3080 stream->cr();
3081 }
3082 if (m.not_null() && !is_osr_method()) {
3083 ResourceMark rm;
3084 int sizeargs = m->size_of_parameters();
3085 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
3086 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
3087 {
3088 int sig_index = 0;
3089 if (!m->is_static())
3090 sig_bt[sig_index++] = T_OBJECT; // 'this'
3091 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
3092 BasicType t = ss.type();
3093 sig_bt[sig_index++] = t;
3094 if (type2size[t] == 2) {
3095 sig_bt[sig_index++] = T_VOID;
3096 } else {
3097 assert(type2size[t] == 1, "size is 1 or 2");
3098 }
3099 }
3100 assert(sig_index == sizeargs, "");
3101 }
3102 const char* spname = "sp"; // make arch-specific?
3103 intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false);
3104 int stack_slot_offset = this->frame_size() * wordSize;
3105 int tab1 = 14, tab2 = 24;
3106 int sig_index = 0;
3107 int arg_index = (m->is_static() ? 0 : -1);
3108 bool did_old_sp = false;
3109 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
3110 bool at_this = (arg_index == -1);
3111 bool at_old_sp = false;
3112 BasicType t = (at_this ? T_OBJECT : ss.type());
3113 assert(t == sig_bt[sig_index], "sigs in sync");
3114 if (at_this)
3115 stream->print(" # this: ");
3116 else
3117 stream->print(" # parm%d: ", arg_index);
3118 stream->move_to(tab1);
3119 VMReg fst = regs[sig_index].first();
3120 VMReg snd = regs[sig_index].second();
3121 if (fst->is_reg()) {
3122 stream->print("%s", fst->name());
3123 if (snd->is_valid()) {
3124 stream->print(":%s", snd->name());
3125 }
3126 } else if (fst->is_stack()) {
3127 int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset;
3128 if (offset == stack_slot_offset) at_old_sp = true;
3129 stream->print("[%s+0x%x]", spname, offset);
3130 } else {
3131 stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd);
3132 }
3133 stream->print(" ");
3134 stream->move_to(tab2);
3135 stream->print("= ");
3136 if (at_this) {
3137 m->method_holder()->print_value_on(stream);
3138 } else {
3139 bool did_name = false;
3140 if (!at_this && ss.is_object()) {
3141 Symbol* name = ss.as_symbol_or_null();
3142 if (name != NULL) {
3143 name->print_value_on(stream);
3144 did_name = true;
3145 }
3146 }
3147 if (!did_name)
3148 stream->print("%s", type2name(t));
3149 }
3150 if (at_old_sp) {
3151 stream->print(" (%s of caller)", spname);
3152 did_old_sp = true;
3153 }
3154 stream->cr();
3155 sig_index += type2size[t];
3156 arg_index += 1;
3157 if (!at_this) ss.next();
3158 }
3159 if (!did_old_sp) {
3160 stream->print(" # ");
3161 stream->move_to(tab1);
3162 stream->print("[%s+0x%x]", spname, stack_slot_offset);
3163 stream->print(" (%s of caller)", spname);
3164 stream->cr();
3165 }
3166 }
3167 }
3168 }
3170 void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) {
3171 // First, find an oopmap in (begin, end].
3172 // We use the odd half-closed interval so that oop maps and scope descs
3173 // which are tied to the byte after a call are printed with the call itself.
3174 address base = code_begin();
3175 OopMapSet* oms = oop_maps();
3176 if (oms != NULL) {
3177 for (int i = 0, imax = oms->size(); i < imax; i++) {
3178 OopMap* om = oms->at(i);
3179 address pc = base + om->offset();
3180 if (pc > begin) {
3181 if (pc <= end) {
3182 st->move_to(column);
3183 st->print("; ");
3184 om->print_on(st);
3185 }
3186 break;
3187 }
3188 }
3189 }
3191 // Print any debug info present at this pc.
3192 ScopeDesc* sd = scope_desc_in(begin, end);
3193 if (sd != NULL) {
3194 st->move_to(column);
3195 if (sd->bci() == SynchronizationEntryBCI) {
3196 st->print(";*synchronization entry");
3197 } else {
3198 if (sd->method() == NULL) {
3199 st->print("method is NULL");
3200 } else if (sd->method()->is_native()) {
3201 st->print("method is native");
3202 } else {
3203 Bytecodes::Code bc = sd->method()->java_code_at(sd->bci());
3204 st->print(";*%s", Bytecodes::name(bc));
3205 switch (bc) {
3206 case Bytecodes::_invokevirtual:
3207 case Bytecodes::_invokespecial:
3208 case Bytecodes::_invokestatic:
3209 case Bytecodes::_invokeinterface:
3210 {
3211 Bytecode_invoke invoke(sd->method(), sd->bci());
3212 st->print(" ");
3213 if (invoke.name() != NULL)
3214 invoke.name()->print_symbol_on(st);
3215 else
3216 st->print("<UNKNOWN>");
3217 break;
3218 }
3219 case Bytecodes::_getfield:
3220 case Bytecodes::_putfield:
3221 case Bytecodes::_getstatic:
3222 case Bytecodes::_putstatic:
3223 {
3224 Bytecode_field field(sd->method(), sd->bci());
3225 st->print(" ");
3226 if (field.name() != NULL)
3227 field.name()->print_symbol_on(st);
3228 else
3229 st->print("<UNKNOWN>");
3230 }
3231 }
3232 }
3233 }
3235 // Print all scopes
3236 for (;sd != NULL; sd = sd->sender()) {
3237 st->move_to(column);
3238 st->print("; -");
3239 if (sd->method() == NULL) {
3240 st->print("method is NULL");
3241 } else {
3242 sd->method()->print_short_name(st);
3243 }
3244 int lineno = sd->method()->line_number_from_bci(sd->bci());
3245 if (lineno != -1) {
3246 st->print("@%d (line %d)", sd->bci(), lineno);
3247 } else {
3248 st->print("@%d", sd->bci());
3249 }
3250 st->cr();
3251 }
3252 }
3254 // Print relocation information
3255 const char* str = reloc_string_for(begin, end);
3256 if (str != NULL) {
3257 if (sd != NULL) st->cr();
3258 st->move_to(column);
3259 st->print("; {%s}", str);
3260 }
3261 int cont_offset = ImplicitExceptionTable(this).at(begin - code_begin());
3262 if (cont_offset != 0) {
3263 st->move_to(column);
3264 st->print("; implicit exception: dispatches to " INTPTR_FORMAT, code_begin() + cont_offset);
3265 }
3267 }
3269 #ifndef PRODUCT
3271 void nmethod::print_value_on(outputStream* st) const {
3272 st->print("nmethod");
3273 print_on(st, NULL);
3274 }
3276 void nmethod::print_calls(outputStream* st) {
3277 RelocIterator iter(this);
3278 while (iter.next()) {
3279 switch (iter.type()) {
3280 case relocInfo::virtual_call_type:
3281 case relocInfo::opt_virtual_call_type: {
3282 VerifyMutexLocker mc(CompiledIC_lock);
3283 CompiledIC_at(&iter)->print();
3284 break;
3285 }
3286 case relocInfo::static_call_type:
3287 st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr());
3288 compiledStaticCall_at(iter.reloc())->print();
3289 break;
3290 }
3291 }
3292 }
3294 void nmethod::print_handler_table() {
3295 ExceptionHandlerTable(this).print();
3296 }
3298 void nmethod::print_nul_chk_table() {
3299 ImplicitExceptionTable(this).print(code_begin());
3300 }
3302 void nmethod::print_statistics() {
3303 ttyLocker ttyl;
3304 if (xtty != NULL) xtty->head("statistics type='nmethod'");
3305 nmethod_stats.print_native_nmethod_stats();
3306 nmethod_stats.print_nmethod_stats();
3307 DebugInformationRecorder::print_statistics();
3308 nmethod_stats.print_pc_stats();
3309 Dependencies::print_statistics();
3310 if (xtty != NULL) xtty->tail("statistics");
3311 }
3313 #endif // PRODUCT