Fri, 29 Jan 2010 12:13:05 +0100
6917766: JSR 292 needs its own deopt handler
Summary: We need to introduce a new MH deopt handler so we can easily determine if the deopt happened at a MH call site or not.
Reviewed-by: never, jrose
1 /*
2 * Copyright 1997-2010 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
25 # include "incls/_precompiled.incl"
26 # include "incls/_nmethod.cpp.incl"
28 #ifdef DTRACE_ENABLED
30 // Only bother with this argument setup if dtrace is available
32 HS_DTRACE_PROBE_DECL8(hotspot, compiled__method__load,
33 const char*, int, const char*, int, const char*, int, void*, size_t);
35 HS_DTRACE_PROBE_DECL6(hotspot, compiled__method__unload,
36 char*, int, char*, int, char*, int);
38 #define DTRACE_METHOD_UNLOAD_PROBE(method) \
39 { \
40 methodOop m = (method); \
41 if (m != NULL) { \
42 symbolOop klass_name = m->klass_name(); \
43 symbolOop name = m->name(); \
44 symbolOop signature = m->signature(); \
45 HS_DTRACE_PROBE6(hotspot, compiled__method__unload, \
46 klass_name->bytes(), klass_name->utf8_length(), \
47 name->bytes(), name->utf8_length(), \
48 signature->bytes(), signature->utf8_length()); \
49 } \
50 }
52 #else // ndef DTRACE_ENABLED
54 #define DTRACE_METHOD_UNLOAD_PROBE(method)
56 #endif
58 bool nmethod::is_compiled_by_c1() const {
59 if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing
60 if (is_native_method()) return false;
61 return compiler()->is_c1();
62 }
63 bool nmethod::is_compiled_by_c2() const {
64 if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing
65 if (is_native_method()) return false;
66 return compiler()->is_c2();
67 }
71 //---------------------------------------------------------------------------------
72 // NMethod statistics
73 // They are printed under various flags, including:
74 // PrintC1Statistics, PrintOptoStatistics, LogVMOutput, and LogCompilation.
75 // (In the latter two cases, they like other stats are printed to the log only.)
77 #ifndef PRODUCT
78 // These variables are put into one block to reduce relocations
79 // and make it simpler to print from the debugger.
80 static
81 struct nmethod_stats_struct {
82 int nmethod_count;
83 int total_size;
84 int relocation_size;
85 int code_size;
86 int stub_size;
87 int consts_size;
88 int scopes_data_size;
89 int scopes_pcs_size;
90 int dependencies_size;
91 int handler_table_size;
92 int nul_chk_table_size;
93 int oops_size;
95 void note_nmethod(nmethod* nm) {
96 nmethod_count += 1;
97 total_size += nm->size();
98 relocation_size += nm->relocation_size();
99 code_size += nm->code_size();
100 stub_size += nm->stub_size();
101 consts_size += nm->consts_size();
102 scopes_data_size += nm->scopes_data_size();
103 scopes_pcs_size += nm->scopes_pcs_size();
104 dependencies_size += nm->dependencies_size();
105 handler_table_size += nm->handler_table_size();
106 nul_chk_table_size += nm->nul_chk_table_size();
107 oops_size += nm->oops_size();
108 }
109 void print_nmethod_stats() {
110 if (nmethod_count == 0) return;
111 tty->print_cr("Statistics for %d bytecoded nmethods:", nmethod_count);
112 if (total_size != 0) tty->print_cr(" total in heap = %d", total_size);
113 if (relocation_size != 0) tty->print_cr(" relocation = %d", relocation_size);
114 if (code_size != 0) tty->print_cr(" main code = %d", code_size);
115 if (stub_size != 0) tty->print_cr(" stub code = %d", stub_size);
116 if (consts_size != 0) tty->print_cr(" constants = %d", consts_size);
117 if (scopes_data_size != 0) tty->print_cr(" scopes data = %d", scopes_data_size);
118 if (scopes_pcs_size != 0) tty->print_cr(" scopes pcs = %d", scopes_pcs_size);
119 if (dependencies_size != 0) tty->print_cr(" dependencies = %d", dependencies_size);
120 if (handler_table_size != 0) tty->print_cr(" handler table = %d", handler_table_size);
121 if (nul_chk_table_size != 0) tty->print_cr(" nul chk table = %d", nul_chk_table_size);
122 if (oops_size != 0) tty->print_cr(" oops = %d", oops_size);
123 }
125 int native_nmethod_count;
126 int native_total_size;
127 int native_relocation_size;
128 int native_code_size;
129 int native_oops_size;
130 void note_native_nmethod(nmethod* nm) {
131 native_nmethod_count += 1;
132 native_total_size += nm->size();
133 native_relocation_size += nm->relocation_size();
134 native_code_size += nm->code_size();
135 native_oops_size += nm->oops_size();
136 }
137 void print_native_nmethod_stats() {
138 if (native_nmethod_count == 0) return;
139 tty->print_cr("Statistics for %d native nmethods:", native_nmethod_count);
140 if (native_total_size != 0) tty->print_cr(" N. total size = %d", native_total_size);
141 if (native_relocation_size != 0) tty->print_cr(" N. relocation = %d", native_relocation_size);
142 if (native_code_size != 0) tty->print_cr(" N. main code = %d", native_code_size);
143 if (native_oops_size != 0) tty->print_cr(" N. oops = %d", native_oops_size);
144 }
146 int pc_desc_resets; // number of resets (= number of caches)
147 int pc_desc_queries; // queries to nmethod::find_pc_desc
148 int pc_desc_approx; // number of those which have approximate true
149 int pc_desc_repeats; // number of _last_pc_desc hits
150 int pc_desc_hits; // number of LRU cache hits
151 int pc_desc_tests; // total number of PcDesc examinations
152 int pc_desc_searches; // total number of quasi-binary search steps
153 int pc_desc_adds; // number of LUR cache insertions
155 void print_pc_stats() {
156 tty->print_cr("PcDesc Statistics: %d queries, %.2f comparisons per query",
157 pc_desc_queries,
158 (double)(pc_desc_tests + pc_desc_searches)
159 / pc_desc_queries);
160 tty->print_cr(" caches=%d queries=%d/%d, hits=%d+%d, tests=%d+%d, adds=%d",
161 pc_desc_resets,
162 pc_desc_queries, pc_desc_approx,
163 pc_desc_repeats, pc_desc_hits,
164 pc_desc_tests, pc_desc_searches, pc_desc_adds);
165 }
166 } nmethod_stats;
167 #endif //PRODUCT
169 //---------------------------------------------------------------------------------
172 // The _unwind_handler is a special marker address, which says that
173 // for given exception oop and address, the frame should be removed
174 // as the tuple cannot be caught in the nmethod
175 address ExceptionCache::_unwind_handler = (address) -1;
178 ExceptionCache::ExceptionCache(Handle exception, address pc, address handler) {
179 assert(pc != NULL, "Must be non null");
180 assert(exception.not_null(), "Must be non null");
181 assert(handler != NULL, "Must be non null");
183 _count = 0;
184 _exception_type = exception->klass();
185 _next = NULL;
187 add_address_and_handler(pc,handler);
188 }
191 address ExceptionCache::match(Handle exception, address pc) {
192 assert(pc != NULL,"Must be non null");
193 assert(exception.not_null(),"Must be non null");
194 if (exception->klass() == exception_type()) {
195 return (test_address(pc));
196 }
198 return NULL;
199 }
202 bool ExceptionCache::match_exception_with_space(Handle exception) {
203 assert(exception.not_null(),"Must be non null");
204 if (exception->klass() == exception_type() && count() < cache_size) {
205 return true;
206 }
207 return false;
208 }
211 address ExceptionCache::test_address(address addr) {
212 for (int i=0; i<count(); i++) {
213 if (pc_at(i) == addr) {
214 return handler_at(i);
215 }
216 }
217 return NULL;
218 }
221 bool ExceptionCache::add_address_and_handler(address addr, address handler) {
222 if (test_address(addr) == handler) return true;
223 if (count() < cache_size) {
224 set_pc_at(count(),addr);
225 set_handler_at(count(), handler);
226 increment_count();
227 return true;
228 }
229 return false;
230 }
233 // private method for handling exception cache
234 // These methods are private, and used to manipulate the exception cache
235 // directly.
236 ExceptionCache* nmethod::exception_cache_entry_for_exception(Handle exception) {
237 ExceptionCache* ec = exception_cache();
238 while (ec != NULL) {
239 if (ec->match_exception_with_space(exception)) {
240 return ec;
241 }
242 ec = ec->next();
243 }
244 return NULL;
245 }
248 //-----------------------------------------------------------------------------
251 // Helper used by both find_pc_desc methods.
252 static inline bool match_desc(PcDesc* pc, int pc_offset, bool approximate) {
253 NOT_PRODUCT(++nmethod_stats.pc_desc_tests);
254 if (!approximate)
255 return pc->pc_offset() == pc_offset;
256 else
257 return (pc-1)->pc_offset() < pc_offset && pc_offset <= pc->pc_offset();
258 }
260 void PcDescCache::reset_to(PcDesc* initial_pc_desc) {
261 if (initial_pc_desc == NULL) {
262 _last_pc_desc = NULL; // native method
263 return;
264 }
265 NOT_PRODUCT(++nmethod_stats.pc_desc_resets);
266 // reset the cache by filling it with benign (non-null) values
267 assert(initial_pc_desc->pc_offset() < 0, "must be sentinel");
268 _last_pc_desc = initial_pc_desc + 1; // first valid one is after sentinel
269 for (int i = 0; i < cache_size; i++)
270 _pc_descs[i] = initial_pc_desc;
271 }
273 PcDesc* PcDescCache::find_pc_desc(int pc_offset, bool approximate) {
274 NOT_PRODUCT(++nmethod_stats.pc_desc_queries);
275 NOT_PRODUCT(if (approximate) ++nmethod_stats.pc_desc_approx);
277 // In order to prevent race conditions do not load cache elements
278 // repeatedly, but use a local copy:
279 PcDesc* res;
281 // Step one: Check the most recently returned value.
282 res = _last_pc_desc;
283 if (res == NULL) return NULL; // native method; no PcDescs at all
284 if (match_desc(res, pc_offset, approximate)) {
285 NOT_PRODUCT(++nmethod_stats.pc_desc_repeats);
286 return res;
287 }
289 // Step two: Check the LRU cache.
290 for (int i = 0; i < cache_size; i++) {
291 res = _pc_descs[i];
292 if (res->pc_offset() < 0) break; // optimization: skip empty cache
293 if (match_desc(res, pc_offset, approximate)) {
294 NOT_PRODUCT(++nmethod_stats.pc_desc_hits);
295 _last_pc_desc = res; // record this cache hit in case of repeat
296 return res;
297 }
298 }
300 // Report failure.
301 return NULL;
302 }
304 void PcDescCache::add_pc_desc(PcDesc* pc_desc) {
305 NOT_PRODUCT(++nmethod_stats.pc_desc_adds);
306 // Update the LRU cache by shifting pc_desc forward:
307 for (int i = 0; i < cache_size; i++) {
308 PcDesc* next = _pc_descs[i];
309 _pc_descs[i] = pc_desc;
310 pc_desc = next;
311 }
312 // Note: Do not update _last_pc_desc. It fronts for the LRU cache.
313 }
315 // adjust pcs_size so that it is a multiple of both oopSize and
316 // sizeof(PcDesc) (assumes that if sizeof(PcDesc) is not a multiple
317 // of oopSize, then 2*sizeof(PcDesc) is)
318 static int adjust_pcs_size(int pcs_size) {
319 int nsize = round_to(pcs_size, oopSize);
320 if ((nsize % sizeof(PcDesc)) != 0) {
321 nsize = pcs_size + sizeof(PcDesc);
322 }
323 assert((nsize % oopSize) == 0, "correct alignment");
324 return nsize;
325 }
327 //-----------------------------------------------------------------------------
330 void nmethod::add_exception_cache_entry(ExceptionCache* new_entry) {
331 assert(ExceptionCache_lock->owned_by_self(),"Must hold the ExceptionCache_lock");
332 assert(new_entry != NULL,"Must be non null");
333 assert(new_entry->next() == NULL, "Must be null");
335 if (exception_cache() != NULL) {
336 new_entry->set_next(exception_cache());
337 }
338 set_exception_cache(new_entry);
339 }
341 void nmethod::remove_from_exception_cache(ExceptionCache* ec) {
342 ExceptionCache* prev = NULL;
343 ExceptionCache* curr = exception_cache();
344 assert(curr != NULL, "nothing to remove");
345 // find the previous and next entry of ec
346 while (curr != ec) {
347 prev = curr;
348 curr = curr->next();
349 assert(curr != NULL, "ExceptionCache not found");
350 }
351 // now: curr == ec
352 ExceptionCache* next = curr->next();
353 if (prev == NULL) {
354 set_exception_cache(next);
355 } else {
356 prev->set_next(next);
357 }
358 delete curr;
359 }
362 // public method for accessing the exception cache
363 // These are the public access methods.
364 address nmethod::handler_for_exception_and_pc(Handle exception, address pc) {
365 // We never grab a lock to read the exception cache, so we may
366 // have false negatives. This is okay, as it can only happen during
367 // the first few exception lookups for a given nmethod.
368 ExceptionCache* ec = exception_cache();
369 while (ec != NULL) {
370 address ret_val;
371 if ((ret_val = ec->match(exception,pc)) != NULL) {
372 return ret_val;
373 }
374 ec = ec->next();
375 }
376 return NULL;
377 }
380 void nmethod::add_handler_for_exception_and_pc(Handle exception, address pc, address handler) {
381 // There are potential race conditions during exception cache updates, so we
382 // must own the ExceptionCache_lock before doing ANY modifications. Because
383 // we don't lock during reads, it is possible to have several threads attempt
384 // to update the cache with the same data. We need to check for already inserted
385 // copies of the current data before adding it.
387 MutexLocker ml(ExceptionCache_lock);
388 ExceptionCache* target_entry = exception_cache_entry_for_exception(exception);
390 if (target_entry == NULL || !target_entry->add_address_and_handler(pc,handler)) {
391 target_entry = new ExceptionCache(exception,pc,handler);
392 add_exception_cache_entry(target_entry);
393 }
394 }
397 //-------------end of code for ExceptionCache--------------
400 void nmFlags::clear() {
401 assert(sizeof(nmFlags) == sizeof(int), "using more than one word for nmFlags");
402 *(jint*)this = 0;
403 }
405 int nmethod::total_size() const {
406 return
407 code_size() +
408 stub_size() +
409 consts_size() +
410 scopes_data_size() +
411 scopes_pcs_size() +
412 handler_table_size() +
413 nul_chk_table_size();
414 }
416 const char* nmethod::compile_kind() const {
417 if (is_osr_method()) return "osr";
418 if (method() != NULL && is_native_method()) return "c2n";
419 return NULL;
420 }
422 // %%% This variable is no longer used?
423 int nmethod::_zombie_instruction_size = NativeJump::instruction_size;
426 nmethod* nmethod::new_native_nmethod(methodHandle method,
427 CodeBuffer *code_buffer,
428 int vep_offset,
429 int frame_complete,
430 int frame_size,
431 ByteSize basic_lock_owner_sp_offset,
432 ByteSize basic_lock_sp_offset,
433 OopMapSet* oop_maps) {
434 // create nmethod
435 nmethod* nm = NULL;
436 {
437 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
438 int native_nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
439 CodeOffsets offsets;
440 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
441 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
442 nm = new (native_nmethod_size)
443 nmethod(method(), native_nmethod_size, &offsets,
444 code_buffer, frame_size,
445 basic_lock_owner_sp_offset, basic_lock_sp_offset,
446 oop_maps);
447 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_native_nmethod(nm));
448 if (PrintAssembly && nm != NULL)
449 Disassembler::decode(nm);
450 }
451 // verify nmethod
452 debug_only(if (nm) nm->verify();) // might block
454 if (nm != NULL) {
455 nm->log_new_nmethod();
456 }
458 return nm;
459 }
461 #ifdef HAVE_DTRACE_H
462 nmethod* nmethod::new_dtrace_nmethod(methodHandle method,
463 CodeBuffer *code_buffer,
464 int vep_offset,
465 int trap_offset,
466 int frame_complete,
467 int frame_size) {
468 // create nmethod
469 nmethod* nm = NULL;
470 {
471 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
472 int nmethod_size = allocation_size(code_buffer, sizeof(nmethod));
473 CodeOffsets offsets;
474 offsets.set_value(CodeOffsets::Verified_Entry, vep_offset);
475 offsets.set_value(CodeOffsets::Dtrace_trap, trap_offset);
476 offsets.set_value(CodeOffsets::Frame_Complete, frame_complete);
478 nm = new (nmethod_size) nmethod(method(), nmethod_size, &offsets, code_buffer, frame_size);
480 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm));
481 if (PrintAssembly && nm != NULL)
482 Disassembler::decode(nm);
483 }
484 // verify nmethod
485 debug_only(if (nm) nm->verify();) // might block
487 if (nm != NULL) {
488 nm->log_new_nmethod();
489 }
491 return nm;
492 }
494 #endif // def HAVE_DTRACE_H
496 nmethod* nmethod::new_nmethod(methodHandle method,
497 int compile_id,
498 int entry_bci,
499 CodeOffsets* offsets,
500 int orig_pc_offset,
501 DebugInformationRecorder* debug_info,
502 Dependencies* dependencies,
503 CodeBuffer* code_buffer, int frame_size,
504 OopMapSet* oop_maps,
505 ExceptionHandlerTable* handler_table,
506 ImplicitExceptionTable* nul_chk_table,
507 AbstractCompiler* compiler,
508 int comp_level
509 )
510 {
511 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
512 // create nmethod
513 nmethod* nm = NULL;
514 { MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
515 int nmethod_size =
516 allocation_size(code_buffer, sizeof(nmethod))
517 + adjust_pcs_size(debug_info->pcs_size())
518 + round_to(dependencies->size_in_bytes() , oopSize)
519 + round_to(handler_table->size_in_bytes(), oopSize)
520 + round_to(nul_chk_table->size_in_bytes(), oopSize)
521 + round_to(debug_info->data_size() , oopSize);
522 nm = new (nmethod_size)
523 nmethod(method(), nmethod_size, compile_id, entry_bci, offsets,
524 orig_pc_offset, debug_info, dependencies, code_buffer, frame_size,
525 oop_maps,
526 handler_table,
527 nul_chk_table,
528 compiler,
529 comp_level);
530 if (nm != NULL) {
531 // To make dependency checking during class loading fast, record
532 // the nmethod dependencies in the classes it is dependent on.
533 // This allows the dependency checking code to simply walk the
534 // class hierarchy above the loaded class, checking only nmethods
535 // which are dependent on those classes. The slow way is to
536 // check every nmethod for dependencies which makes it linear in
537 // the number of methods compiled. For applications with a lot
538 // classes the slow way is too slow.
539 for (Dependencies::DepStream deps(nm); deps.next(); ) {
540 klassOop klass = deps.context_type();
541 if (klass == NULL) continue; // ignore things like evol_method
543 // record this nmethod as dependent on this klass
544 instanceKlass::cast(klass)->add_dependent_nmethod(nm);
545 }
546 }
547 NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm));
548 if (PrintAssembly && nm != NULL)
549 Disassembler::decode(nm);
550 }
552 // verify nmethod
553 debug_only(if (nm) nm->verify();) // might block
555 if (nm != NULL) {
556 nm->log_new_nmethod();
557 }
559 // done
560 return nm;
561 }
564 // For native wrappers
565 nmethod::nmethod(
566 methodOop method,
567 int nmethod_size,
568 CodeOffsets* offsets,
569 CodeBuffer* code_buffer,
570 int frame_size,
571 ByteSize basic_lock_owner_sp_offset,
572 ByteSize basic_lock_sp_offset,
573 OopMapSet* oop_maps )
574 : CodeBlob("native nmethod", code_buffer, sizeof(nmethod),
575 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
576 _compiled_synchronized_native_basic_lock_owner_sp_offset(basic_lock_owner_sp_offset),
577 _compiled_synchronized_native_basic_lock_sp_offset(basic_lock_sp_offset)
578 {
579 {
580 debug_only(No_Safepoint_Verifier nsv;)
581 assert_locked_or_safepoint(CodeCache_lock);
583 NOT_PRODUCT(_has_debug_info = false);
584 _oops_do_mark_link = NULL;
585 _method = method;
586 _entry_bci = InvocationEntryBci;
587 _osr_link = NULL;
588 _scavenge_root_link = NULL;
589 _scavenge_root_state = 0;
590 _compiler = NULL;
591 // We have no exception handler or deopt handler make the
592 // values something that will never match a pc like the nmethod vtable entry
593 _exception_offset = 0;
594 _deoptimize_offset = 0;
595 _deoptimize_mh_offset = 0;
596 _orig_pc_offset = 0;
597 #ifdef HAVE_DTRACE_H
598 _trap_offset = 0;
599 #endif // def HAVE_DTRACE_H
600 _stub_offset = data_offset();
601 _consts_offset = data_offset();
602 _scopes_data_offset = data_offset();
603 _scopes_pcs_offset = _scopes_data_offset;
604 _dependencies_offset = _scopes_pcs_offset;
605 _handler_table_offset = _dependencies_offset;
606 _nul_chk_table_offset = _handler_table_offset;
607 _nmethod_end_offset = _nul_chk_table_offset;
608 _compile_id = 0; // default
609 _comp_level = CompLevel_none;
610 _entry_point = instructions_begin();
611 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
612 _osr_entry_point = NULL;
613 _exception_cache = NULL;
614 _pc_desc_cache.reset_to(NULL);
616 flags.clear();
617 flags.state = alive;
618 _markedForDeoptimization = 0;
620 _lock_count = 0;
621 _stack_traversal_mark = 0;
623 code_buffer->copy_oops_to(this);
624 debug_only(verify_scavenge_root_oops());
625 CodeCache::commit(this);
626 VTune::create_nmethod(this);
627 }
629 if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
630 ttyLocker ttyl; // keep the following output all in one block
631 // This output goes directly to the tty, not the compiler log.
632 // To enable tools to match it up with the compilation activity,
633 // be sure to tag this tty output with the compile ID.
634 if (xtty != NULL) {
635 xtty->begin_head("print_native_nmethod");
636 xtty->method(_method);
637 xtty->stamp();
638 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
639 }
640 // print the header part first
641 print();
642 // then print the requested information
643 if (PrintNativeNMethods) {
644 print_code();
645 oop_maps->print();
646 }
647 if (PrintRelocations) {
648 print_relocations();
649 }
650 if (xtty != NULL) {
651 xtty->tail("print_native_nmethod");
652 }
653 }
654 Events::log("Create nmethod " INTPTR_FORMAT, this);
655 }
657 // For dtrace wrappers
658 #ifdef HAVE_DTRACE_H
659 nmethod::nmethod(
660 methodOop method,
661 int nmethod_size,
662 CodeOffsets* offsets,
663 CodeBuffer* code_buffer,
664 int frame_size)
665 : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod),
666 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL),
667 _compiled_synchronized_native_basic_lock_owner_sp_offset(in_ByteSize(-1)),
668 _compiled_synchronized_native_basic_lock_sp_offset(in_ByteSize(-1))
669 {
670 {
671 debug_only(No_Safepoint_Verifier nsv;)
672 assert_locked_or_safepoint(CodeCache_lock);
674 NOT_PRODUCT(_has_debug_info = false);
675 _oops_do_mark_link = NULL;
676 _method = method;
677 _entry_bci = InvocationEntryBci;
678 _osr_link = NULL;
679 _scavenge_root_link = NULL;
680 _scavenge_root_state = 0;
681 _compiler = NULL;
682 // We have no exception handler or deopt handler make the
683 // values something that will never match a pc like the nmethod vtable entry
684 _exception_offset = 0;
685 _deoptimize_offset = 0;
686 _deoptimize_mh_offset = 0;
687 _trap_offset = offsets->value(CodeOffsets::Dtrace_trap);
688 _orig_pc_offset = 0;
689 _stub_offset = data_offset();
690 _consts_offset = data_offset();
691 _scopes_data_offset = data_offset();
692 _scopes_pcs_offset = _scopes_data_offset;
693 _dependencies_offset = _scopes_pcs_offset;
694 _handler_table_offset = _dependencies_offset;
695 _nul_chk_table_offset = _handler_table_offset;
696 _nmethod_end_offset = _nul_chk_table_offset;
697 _compile_id = 0; // default
698 _comp_level = CompLevel_none;
699 _entry_point = instructions_begin();
700 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
701 _osr_entry_point = NULL;
702 _exception_cache = NULL;
703 _pc_desc_cache.reset_to(NULL);
705 flags.clear();
706 flags.state = alive;
707 _markedForDeoptimization = 0;
709 _lock_count = 0;
710 _stack_traversal_mark = 0;
712 code_buffer->copy_oops_to(this);
713 debug_only(verify_scavenge_root_oops());
714 CodeCache::commit(this);
715 VTune::create_nmethod(this);
716 }
718 if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
719 ttyLocker ttyl; // keep the following output all in one block
720 // This output goes directly to the tty, not the compiler log.
721 // To enable tools to match it up with the compilation activity,
722 // be sure to tag this tty output with the compile ID.
723 if (xtty != NULL) {
724 xtty->begin_head("print_dtrace_nmethod");
725 xtty->method(_method);
726 xtty->stamp();
727 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
728 }
729 // print the header part first
730 print();
731 // then print the requested information
732 if (PrintNMethods) {
733 print_code();
734 }
735 if (PrintRelocations) {
736 print_relocations();
737 }
738 if (xtty != NULL) {
739 xtty->tail("print_dtrace_nmethod");
740 }
741 }
742 Events::log("Create nmethod " INTPTR_FORMAT, this);
743 }
744 #endif // def HAVE_DTRACE_H
746 void* nmethod::operator new(size_t size, int nmethod_size) {
747 // Always leave some room in the CodeCache for I2C/C2I adapters
748 if (CodeCache::unallocated_capacity() < CodeCacheMinimumFreeSpace) return NULL;
749 return CodeCache::allocate(nmethod_size);
750 }
753 nmethod::nmethod(
754 methodOop method,
755 int nmethod_size,
756 int compile_id,
757 int entry_bci,
758 CodeOffsets* offsets,
759 int orig_pc_offset,
760 DebugInformationRecorder* debug_info,
761 Dependencies* dependencies,
762 CodeBuffer *code_buffer,
763 int frame_size,
764 OopMapSet* oop_maps,
765 ExceptionHandlerTable* handler_table,
766 ImplicitExceptionTable* nul_chk_table,
767 AbstractCompiler* compiler,
768 int comp_level
769 )
770 : CodeBlob("nmethod", code_buffer, sizeof(nmethod),
771 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
772 _compiled_synchronized_native_basic_lock_owner_sp_offset(in_ByteSize(-1)),
773 _compiled_synchronized_native_basic_lock_sp_offset(in_ByteSize(-1))
774 {
775 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
776 {
777 debug_only(No_Safepoint_Verifier nsv;)
778 assert_locked_or_safepoint(CodeCache_lock);
780 NOT_PRODUCT(_has_debug_info = false);
781 _oops_do_mark_link = NULL;
782 _method = method;
783 _compile_id = compile_id;
784 _comp_level = comp_level;
785 _entry_bci = entry_bci;
786 _osr_link = NULL;
787 _scavenge_root_link = NULL;
788 _scavenge_root_state = 0;
789 _compiler = compiler;
790 _orig_pc_offset = orig_pc_offset;
791 #ifdef HAVE_DTRACE_H
792 _trap_offset = 0;
793 #endif // def HAVE_DTRACE_H
794 _stub_offset = instructions_offset() + code_buffer->total_offset_of(code_buffer->stubs()->start());
796 // Exception handler and deopt handler are in the stub section
797 _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions);
798 _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt);
799 _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH);
800 _consts_offset = instructions_offset() + code_buffer->total_offset_of(code_buffer->consts()->start());
801 _scopes_data_offset = data_offset();
802 _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize);
803 _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size());
804 _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize);
805 _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize);
806 _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize);
808 _entry_point = instructions_begin();
809 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
810 _osr_entry_point = instructions_begin() + offsets->value(CodeOffsets::OSR_Entry);
811 _exception_cache = NULL;
812 _pc_desc_cache.reset_to(scopes_pcs_begin());
814 flags.clear();
815 flags.state = alive;
816 _markedForDeoptimization = 0;
818 _unload_reported = false; // jvmti state
820 _lock_count = 0;
821 _stack_traversal_mark = 0;
823 // Copy contents of ScopeDescRecorder to nmethod
824 code_buffer->copy_oops_to(this);
825 debug_info->copy_to(this);
826 dependencies->copy_to(this);
827 if (ScavengeRootsInCode && detect_scavenge_root_oops()) {
828 CodeCache::add_scavenge_root_nmethod(this);
829 }
830 debug_only(verify_scavenge_root_oops());
832 CodeCache::commit(this);
834 VTune::create_nmethod(this);
836 // Copy contents of ExceptionHandlerTable to nmethod
837 handler_table->copy_to(this);
838 nul_chk_table->copy_to(this);
840 // we use the information of entry points to find out if a method is
841 // static or non static
842 assert(compiler->is_c2() ||
843 _method->is_static() == (entry_point() == _verified_entry_point),
844 " entry points must be same for static methods and vice versa");
845 }
847 bool printnmethods = PrintNMethods
848 || CompilerOracle::should_print(_method)
849 || CompilerOracle::has_option_string(_method, "PrintNMethods");
850 if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) {
851 print_nmethod(printnmethods);
852 }
854 // Note: Do not verify in here as the CodeCache_lock is
855 // taken which would conflict with the CompiledIC_lock
856 // which taken during the verification of call sites.
857 // (was bug - gri 10/25/99)
859 Events::log("Create nmethod " INTPTR_FORMAT, this);
860 }
863 // Print a short set of xml attributes to identify this nmethod. The
864 // output should be embedded in some other element.
865 void nmethod::log_identity(xmlStream* log) const {
866 log->print(" compile_id='%d'", compile_id());
867 const char* nm_kind = compile_kind();
868 if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind);
869 if (compiler() != NULL) {
870 log->print(" compiler='%s'", compiler()->name());
871 }
872 #ifdef TIERED
873 log->print(" level='%d'", comp_level());
874 #endif // TIERED
875 }
878 #define LOG_OFFSET(log, name) \
879 if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \
880 log->print(" " XSTR(name) "_offset='%d'" , \
881 (intptr_t)name##_begin() - (intptr_t)this)
884 void nmethod::log_new_nmethod() const {
885 if (LogCompilation && xtty != NULL) {
886 ttyLocker ttyl;
887 HandleMark hm;
888 xtty->begin_elem("nmethod");
889 log_identity(xtty);
890 xtty->print(" entry='" INTPTR_FORMAT "' size='%d'",
891 instructions_begin(), size());
892 xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this);
894 LOG_OFFSET(xtty, relocation);
895 LOG_OFFSET(xtty, code);
896 LOG_OFFSET(xtty, stub);
897 LOG_OFFSET(xtty, consts);
898 LOG_OFFSET(xtty, scopes_data);
899 LOG_OFFSET(xtty, scopes_pcs);
900 LOG_OFFSET(xtty, dependencies);
901 LOG_OFFSET(xtty, handler_table);
902 LOG_OFFSET(xtty, nul_chk_table);
903 LOG_OFFSET(xtty, oops);
905 xtty->method(method());
906 xtty->stamp();
907 xtty->end_elem();
908 }
909 }
911 #undef LOG_OFFSET
914 // Print out more verbose output usually for a newly created nmethod.
915 void nmethod::print_on(outputStream* st, const char* title) const {
916 if (st != NULL) {
917 ttyLocker ttyl;
918 // Print a little tag line that looks like +PrintCompilation output:
919 int tlen = (int) strlen(title);
920 bool do_nl = false;
921 if (tlen > 0 && title[tlen-1] == '\n') { tlen--; do_nl = true; }
922 st->print("%3d%c %.*s",
923 compile_id(),
924 is_osr_method() ? '%' :
925 method() != NULL &&
926 is_native_method() ? 'n' : ' ',
927 tlen, title);
928 #ifdef TIERED
929 st->print(" (%d) ", comp_level());
930 #endif // TIERED
931 if (WizardMode) st->print(" (" INTPTR_FORMAT ")", this);
932 if (Universe::heap()->is_gc_active() && method() != NULL) {
933 st->print("(method)");
934 } else if (method() != NULL) {
935 method()->print_short_name(st);
936 if (is_osr_method())
937 st->print(" @ %d", osr_entry_bci());
938 if (method()->code_size() > 0)
939 st->print(" (%d bytes)", method()->code_size());
940 }
942 if (do_nl) st->cr();
943 }
944 }
947 void nmethod::print_nmethod(bool printmethod) {
948 ttyLocker ttyl; // keep the following output all in one block
949 if (xtty != NULL) {
950 xtty->begin_head("print_nmethod");
951 xtty->stamp();
952 xtty->end_head();
953 }
954 // print the header part first
955 print();
956 // then print the requested information
957 if (printmethod) {
958 print_code();
959 print_pcs();
960 oop_maps()->print();
961 }
962 if (PrintDebugInfo) {
963 print_scopes();
964 }
965 if (PrintRelocations) {
966 print_relocations();
967 }
968 if (PrintDependencies) {
969 print_dependencies();
970 }
971 if (PrintExceptionHandlers) {
972 print_handler_table();
973 print_nul_chk_table();
974 }
975 if (xtty != NULL) {
976 xtty->tail("print_nmethod");
977 }
978 }
981 void nmethod::set_version(int v) {
982 flags.version = v;
983 }
986 ScopeDesc* nmethod::scope_desc_at(address pc) {
987 PcDesc* pd = pc_desc_at(pc);
988 guarantee(pd != NULL, "scope must be present");
989 return new ScopeDesc(this, pd->scope_decode_offset(),
990 pd->obj_decode_offset(), pd->should_reexecute());
991 }
994 void nmethod::clear_inline_caches() {
995 assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint");
996 if (is_zombie()) {
997 return;
998 }
1000 RelocIterator iter(this);
1001 while (iter.next()) {
1002 iter.reloc()->clear_inline_cache();
1003 }
1004 }
1007 void nmethod::cleanup_inline_caches() {
1009 assert(SafepointSynchronize::is_at_safepoint() &&
1010 !CompiledIC_lock->is_locked() &&
1011 !Patching_lock->is_locked(), "no threads must be updating the inline caches by them selfs");
1013 // If the method is not entrant or zombie then a JMP is plastered over the
1014 // first few bytes. If an oop in the old code was there, that oop
1015 // should not get GC'd. Skip the first few bytes of oops on
1016 // not-entrant methods.
1017 address low_boundary = verified_entry_point();
1018 if (!is_in_use()) {
1019 low_boundary += NativeJump::instruction_size;
1020 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1021 // This means that the low_boundary is going to be a little too high.
1022 // This shouldn't matter, since oops of non-entrant methods are never used.
1023 // In fact, why are we bothering to look at oops in a non-entrant method??
1024 }
1026 // Find all calls in an nmethod, and clear the ones that points to zombie methods
1027 ResourceMark rm;
1028 RelocIterator iter(this, low_boundary);
1029 while(iter.next()) {
1030 switch(iter.type()) {
1031 case relocInfo::virtual_call_type:
1032 case relocInfo::opt_virtual_call_type: {
1033 CompiledIC *ic = CompiledIC_at(iter.reloc());
1034 // Ok, to lookup references to zombies here
1035 CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination());
1036 if( cb != NULL && cb->is_nmethod() ) {
1037 nmethod* nm = (nmethod*)cb;
1038 // Clean inline caches pointing to both zombie and not_entrant methods
1039 if (!nm->is_in_use()) ic->set_to_clean();
1040 }
1041 break;
1042 }
1043 case relocInfo::static_call_type: {
1044 CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc());
1045 CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination());
1046 if( cb != NULL && cb->is_nmethod() ) {
1047 nmethod* nm = (nmethod*)cb;
1048 // Clean inline caches pointing to both zombie and not_entrant methods
1049 if (!nm->is_in_use()) csc->set_to_clean();
1050 }
1051 break;
1052 }
1053 }
1054 }
1055 }
1057 // This is a private interface with the sweeper.
1058 void nmethod::mark_as_seen_on_stack() {
1059 assert(is_not_entrant(), "must be a non-entrant method");
1060 set_stack_traversal_mark(NMethodSweeper::traversal_count());
1061 }
1063 // Tell if a non-entrant method can be converted to a zombie (i.e., there is no activations on the stack)
1064 bool nmethod::can_not_entrant_be_converted() {
1065 assert(is_not_entrant(), "must be a non-entrant method");
1066 assert(SafepointSynchronize::is_at_safepoint(), "must be called during a safepoint");
1068 // Since the nmethod sweeper only does partial sweep the sweeper's traversal
1069 // count can be greater than the stack traversal count before it hits the
1070 // nmethod for the second time.
1071 return stack_traversal_mark()+1 < NMethodSweeper::traversal_count();
1072 }
1074 void nmethod::inc_decompile_count() {
1075 // Could be gated by ProfileTraps, but do not bother...
1076 methodOop m = method();
1077 if (m == NULL) return;
1078 methodDataOop mdo = m->method_data();
1079 if (mdo == NULL) return;
1080 // There is a benign race here. See comments in methodDataOop.hpp.
1081 mdo->inc_decompile_count();
1082 }
1084 void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) {
1086 post_compiled_method_unload();
1088 // Since this nmethod is being unloaded, make sure that dependencies
1089 // recorded in instanceKlasses get flushed and pass non-NULL closure to
1090 // indicate that this work is being done during a GC.
1091 assert(Universe::heap()->is_gc_active(), "should only be called during gc");
1092 assert(is_alive != NULL, "Should be non-NULL");
1093 // A non-NULL is_alive closure indicates that this is being called during GC.
1094 flush_dependencies(is_alive);
1096 // Break cycle between nmethod & method
1097 if (TraceClassUnloading && WizardMode) {
1098 tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT
1099 " unloadable], methodOop(" INTPTR_FORMAT
1100 "), cause(" INTPTR_FORMAT ")",
1101 this, (address)_method, (address)cause);
1102 if (!Universe::heap()->is_gc_active())
1103 cause->klass()->print();
1104 }
1105 // Unlink the osr method, so we do not look this up again
1106 if (is_osr_method()) {
1107 invalidate_osr_method();
1108 }
1109 // If _method is already NULL the methodOop is about to be unloaded,
1110 // so we don't have to break the cycle. Note that it is possible to
1111 // have the methodOop live here, in case we unload the nmethod because
1112 // it is pointing to some oop (other than the methodOop) being unloaded.
1113 if (_method != NULL) {
1114 // OSR methods point to the methodOop, but the methodOop does not
1115 // point back!
1116 if (_method->code() == this) {
1117 _method->clear_code(); // Break a cycle
1118 }
1119 inc_decompile_count(); // Last chance to make a mark on the MDO
1120 _method = NULL; // Clear the method of this dead nmethod
1121 }
1122 // Make the class unloaded - i.e., change state and notify sweeper
1123 check_safepoint();
1124 if (is_in_use()) {
1125 // Transitioning directly from live to unloaded -- so
1126 // we need to force a cache clean-up; remember this
1127 // for later on.
1128 CodeCache::set_needs_cache_clean(true);
1129 }
1130 flags.state = unloaded;
1132 // Log the unloading.
1133 log_state_change();
1135 // The methodOop is gone at this point
1136 assert(_method == NULL, "Tautology");
1138 set_osr_link(NULL);
1139 //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods
1140 NMethodSweeper::notify(this);
1141 }
1143 void nmethod::invalidate_osr_method() {
1144 assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
1145 // Remove from list of active nmethods
1146 if (method() != NULL)
1147 instanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this);
1148 // Set entry as invalid
1149 _entry_bci = InvalidOSREntryBci;
1150 }
1152 void nmethod::log_state_change() const {
1153 if (LogCompilation) {
1154 if (xtty != NULL) {
1155 ttyLocker ttyl; // keep the following output all in one block
1156 if (flags.state == unloaded) {
1157 xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'",
1158 os::current_thread_id());
1159 } else {
1160 xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s",
1161 os::current_thread_id(),
1162 (flags.state == zombie ? " zombie='1'" : ""));
1163 }
1164 log_identity(xtty);
1165 xtty->stamp();
1166 xtty->end_elem();
1167 }
1168 }
1169 if (PrintCompilation && flags.state != unloaded) {
1170 print_on(tty, flags.state == zombie ? "made zombie " : "made not entrant ");
1171 tty->cr();
1172 }
1173 }
1175 // Common functionality for both make_not_entrant and make_zombie
1176 bool nmethod::make_not_entrant_or_zombie(unsigned int state) {
1177 assert(state == zombie || state == not_entrant, "must be zombie or not_entrant");
1179 // If the method is already zombie there is nothing to do
1180 if (is_zombie()) {
1181 return false;
1182 }
1184 // Make sure the nmethod is not flushed in case of a safepoint in code below.
1185 nmethodLocker nml(this);
1187 {
1188 // invalidate osr nmethod before acquiring the patching lock since
1189 // they both acquire leaf locks and we don't want a deadlock.
1190 // This logic is equivalent to the logic below for patching the
1191 // verified entry point of regular methods.
1192 if (is_osr_method()) {
1193 // this effectively makes the osr nmethod not entrant
1194 invalidate_osr_method();
1195 }
1197 // Enter critical section. Does not block for safepoint.
1198 MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag);
1200 if (flags.state == state) {
1201 // another thread already performed this transition so nothing
1202 // to do, but return false to indicate this.
1203 return false;
1204 }
1206 // The caller can be calling the method statically or through an inline
1207 // cache call.
1208 if (!is_osr_method() && !is_not_entrant()) {
1209 NativeJump::patch_verified_entry(entry_point(), verified_entry_point(),
1210 SharedRuntime::get_handle_wrong_method_stub());
1211 assert (NativeJump::instruction_size == nmethod::_zombie_instruction_size, "");
1212 }
1214 // When the nmethod becomes zombie it is no longer alive so the
1215 // dependencies must be flushed. nmethods in the not_entrant
1216 // state will be flushed later when the transition to zombie
1217 // happens or they get unloaded.
1218 if (state == zombie) {
1219 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1220 flush_dependencies(NULL);
1221 } else {
1222 assert(state == not_entrant, "other cases may need to be handled differently");
1223 }
1225 // Change state
1226 flags.state = state;
1228 // Log the transition once
1229 log_state_change();
1231 } // leave critical region under Patching_lock
1233 if (state == not_entrant) {
1234 Events::log("Make nmethod not entrant " INTPTR_FORMAT, this);
1235 } else {
1236 Events::log("Make nmethod zombie " INTPTR_FORMAT, this);
1237 }
1239 if (TraceCreateZombies) {
1240 tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie");
1241 }
1243 // Make sweeper aware that there is a zombie method that needs to be removed
1244 NMethodSweeper::notify(this);
1246 // not_entrant only stuff
1247 if (state == not_entrant) {
1248 mark_as_seen_on_stack();
1249 }
1251 // It's a true state change, so mark the method as decompiled.
1252 inc_decompile_count();
1254 // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload event
1255 // and it hasn't already been reported for this nmethod then report it now.
1256 // (the event may have been reported earilier if the GC marked it for unloading).
1257 if (state == zombie) {
1259 DTRACE_METHOD_UNLOAD_PROBE(method());
1261 if (JvmtiExport::should_post_compiled_method_unload() &&
1262 !unload_reported()) {
1263 assert(method() != NULL, "checking");
1264 {
1265 HandleMark hm;
1266 JvmtiExport::post_compiled_method_unload_at_safepoint(
1267 method()->jmethod_id(), code_begin());
1268 }
1269 set_unload_reported();
1270 }
1271 }
1274 // Zombie only stuff
1275 if (state == zombie) {
1276 VTune::delete_nmethod(this);
1277 }
1279 // Check whether method got unloaded at a safepoint before this,
1280 // if so we can skip the flushing steps below
1281 if (method() == NULL) return true;
1283 // Remove nmethod from method.
1284 // We need to check if both the _code and _from_compiled_code_entry_point
1285 // refer to this nmethod because there is a race in setting these two fields
1286 // in methodOop as seen in bugid 4947125.
1287 // If the vep() points to the zombie nmethod, the memory for the nmethod
1288 // could be flushed and the compiler and vtable stubs could still call
1289 // through it.
1290 if (method()->code() == this ||
1291 method()->from_compiled_entry() == verified_entry_point()) {
1292 HandleMark hm;
1293 method()->clear_code();
1294 }
1296 return true;
1297 }
1300 #ifndef PRODUCT
1301 void nmethod::check_safepoint() {
1302 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
1303 }
1304 #endif
1307 void nmethod::flush() {
1308 // Note that there are no valid oops in the nmethod anymore.
1309 assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method");
1310 assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation");
1312 assert (!is_locked_by_vm(), "locked methods shouldn't be flushed");
1313 check_safepoint();
1315 // completely deallocate this method
1316 EventMark m("flushing nmethod " INTPTR_FORMAT " %s", this, "");
1317 if (PrintMethodFlushing) {
1318 tty->print_cr("*flushing nmethod " INTPTR_FORMAT ". Live blobs: %d", this, CodeCache::nof_blobs());
1319 }
1321 // We need to deallocate any ExceptionCache data.
1322 // Note that we do not need to grab the nmethod lock for this, it
1323 // better be thread safe if we're disposing of it!
1324 ExceptionCache* ec = exception_cache();
1325 set_exception_cache(NULL);
1326 while(ec != NULL) {
1327 ExceptionCache* next = ec->next();
1328 delete ec;
1329 ec = next;
1330 }
1332 if (on_scavenge_root_list()) {
1333 CodeCache::drop_scavenge_root_nmethod(this);
1334 }
1336 ((CodeBlob*)(this))->flush();
1338 CodeCache::free(this);
1339 }
1342 //
1343 // Notify all classes this nmethod is dependent on that it is no
1344 // longer dependent. This should only be called in two situations.
1345 // First, when a nmethod transitions to a zombie all dependents need
1346 // to be clear. Since zombification happens at a safepoint there's no
1347 // synchronization issues. The second place is a little more tricky.
1348 // During phase 1 of mark sweep class unloading may happen and as a
1349 // result some nmethods may get unloaded. In this case the flushing
1350 // of dependencies must happen during phase 1 since after GC any
1351 // dependencies in the unloaded nmethod won't be updated, so
1352 // traversing the dependency information in unsafe. In that case this
1353 // function is called with a non-NULL argument and this function only
1354 // notifies instanceKlasses that are reachable
1356 void nmethod::flush_dependencies(BoolObjectClosure* is_alive) {
1357 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1358 assert(Universe::heap()->is_gc_active() == (is_alive != NULL),
1359 "is_alive is non-NULL if and only if we are called during GC");
1360 if (!has_flushed_dependencies()) {
1361 set_has_flushed_dependencies();
1362 for (Dependencies::DepStream deps(this); deps.next(); ) {
1363 klassOop klass = deps.context_type();
1364 if (klass == NULL) continue; // ignore things like evol_method
1366 // During GC the is_alive closure is non-NULL, and is used to
1367 // determine liveness of dependees that need to be updated.
1368 if (is_alive == NULL || is_alive->do_object_b(klass)) {
1369 instanceKlass::cast(klass)->remove_dependent_nmethod(this);
1370 }
1371 }
1372 }
1373 }
1376 // If this oop is not live, the nmethod can be unloaded.
1377 bool nmethod::can_unload(BoolObjectClosure* is_alive,
1378 OopClosure* keep_alive,
1379 oop* root, bool unloading_occurred) {
1380 assert(root != NULL, "just checking");
1381 oop obj = *root;
1382 if (obj == NULL || is_alive->do_object_b(obj)) {
1383 return false;
1384 }
1385 if (obj->is_compiledICHolder()) {
1386 compiledICHolderOop cichk_oop = compiledICHolderOop(obj);
1387 if (is_alive->do_object_b(
1388 cichk_oop->holder_method()->method_holder()) &&
1389 is_alive->do_object_b(cichk_oop->holder_klass())) {
1390 // The oop should be kept alive
1391 keep_alive->do_oop(root);
1392 return false;
1393 }
1394 }
1395 // If ScavengeRootsInCode is true, an nmethod might be unloaded
1396 // simply because one of its constant oops has gone dead.
1397 // No actual classes need to be unloaded in order for this to occur.
1398 assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading");
1399 make_unloaded(is_alive, obj);
1400 return true;
1401 }
1403 // ------------------------------------------------------------------
1404 // post_compiled_method_load_event
1405 // new method for install_code() path
1406 // Transfer information from compilation to jvmti
1407 void nmethod::post_compiled_method_load_event() {
1409 methodOop moop = method();
1410 HS_DTRACE_PROBE8(hotspot, compiled__method__load,
1411 moop->klass_name()->bytes(),
1412 moop->klass_name()->utf8_length(),
1413 moop->name()->bytes(),
1414 moop->name()->utf8_length(),
1415 moop->signature()->bytes(),
1416 moop->signature()->utf8_length(),
1417 code_begin(), code_size());
1419 if (JvmtiExport::should_post_compiled_method_load()) {
1420 JvmtiExport::post_compiled_method_load(this);
1421 }
1422 }
1424 void nmethod::post_compiled_method_unload() {
1425 assert(_method != NULL && !is_unloaded(), "just checking");
1426 DTRACE_METHOD_UNLOAD_PROBE(method());
1428 // If a JVMTI agent has enabled the CompiledMethodUnload event then
1429 // post the event. Sometime later this nmethod will be made a zombie by
1430 // the sweeper but the methodOop will not be valid at that point.
1431 if (JvmtiExport::should_post_compiled_method_unload()) {
1432 assert(!unload_reported(), "already unloaded");
1433 HandleMark hm;
1434 JvmtiExport::post_compiled_method_unload_at_safepoint(
1435 method()->jmethod_id(), code_begin());
1436 }
1438 // The JVMTI CompiledMethodUnload event can be enabled or disabled at
1439 // any time. As the nmethod is being unloaded now we mark it has
1440 // having the unload event reported - this will ensure that we don't
1441 // attempt to report the event in the unlikely scenario where the
1442 // event is enabled at the time the nmethod is made a zombie.
1443 set_unload_reported();
1444 }
1446 // This is called at the end of the strong tracing/marking phase of a
1447 // GC to unload an nmethod if it contains otherwise unreachable
1448 // oops.
1450 void nmethod::do_unloading(BoolObjectClosure* is_alive,
1451 OopClosure* keep_alive, bool unloading_occurred) {
1452 // Make sure the oop's ready to receive visitors
1453 assert(!is_zombie() && !is_unloaded(),
1454 "should not call follow on zombie or unloaded nmethod");
1456 // If the method is not entrant then a JMP is plastered over the
1457 // first few bytes. If an oop in the old code was there, that oop
1458 // should not get GC'd. Skip the first few bytes of oops on
1459 // not-entrant methods.
1460 address low_boundary = verified_entry_point();
1461 if (is_not_entrant()) {
1462 low_boundary += NativeJump::instruction_size;
1463 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1464 // (See comment above.)
1465 }
1467 // The RedefineClasses() API can cause the class unloading invariant
1468 // to no longer be true. See jvmtiExport.hpp for details.
1469 // Also, leave a debugging breadcrumb in local flag.
1470 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1471 if (a_class_was_redefined) {
1472 // This set of the unloading_occurred flag is done before the
1473 // call to post_compiled_method_unload() so that the unloading
1474 // of this nmethod is reported.
1475 unloading_occurred = true;
1476 }
1478 // Follow methodOop
1479 if (can_unload(is_alive, keep_alive, (oop*)&_method, unloading_occurred)) {
1480 return;
1481 }
1483 // Exception cache
1484 ExceptionCache* ec = exception_cache();
1485 while (ec != NULL) {
1486 oop* ex_addr = (oop*)ec->exception_type_addr();
1487 oop ex = *ex_addr;
1488 ExceptionCache* next_ec = ec->next();
1489 if (ex != NULL && !is_alive->do_object_b(ex)) {
1490 assert(!ex->is_compiledICHolder(), "Possible error here");
1491 remove_from_exception_cache(ec);
1492 }
1493 ec = next_ec;
1494 }
1496 // If class unloading occurred we first iterate over all inline caches and
1497 // clear ICs where the cached oop is referring to an unloaded klass or method.
1498 // The remaining live cached oops will be traversed in the relocInfo::oop_type
1499 // iteration below.
1500 if (unloading_occurred) {
1501 RelocIterator iter(this, low_boundary);
1502 while(iter.next()) {
1503 if (iter.type() == relocInfo::virtual_call_type) {
1504 CompiledIC *ic = CompiledIC_at(iter.reloc());
1505 oop ic_oop = ic->cached_oop();
1506 if (ic_oop != NULL && !is_alive->do_object_b(ic_oop)) {
1507 // The only exception is compiledICHolder oops which may
1508 // yet be marked below. (We check this further below).
1509 if (ic_oop->is_compiledICHolder()) {
1510 compiledICHolderOop cichk_oop = compiledICHolderOop(ic_oop);
1511 if (is_alive->do_object_b(
1512 cichk_oop->holder_method()->method_holder()) &&
1513 is_alive->do_object_b(cichk_oop->holder_klass())) {
1514 continue;
1515 }
1516 }
1517 ic->set_to_clean();
1518 assert(ic->cached_oop() == NULL, "cached oop in IC should be cleared")
1519 }
1520 }
1521 }
1522 }
1524 // Compiled code
1525 RelocIterator iter(this, low_boundary);
1526 while (iter.next()) {
1527 if (iter.type() == relocInfo::oop_type) {
1528 oop_Relocation* r = iter.oop_reloc();
1529 // In this loop, we must only traverse those oops directly embedded in
1530 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1531 assert(1 == (r->oop_is_immediate()) +
1532 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1533 "oop must be found in exactly one place");
1534 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1535 if (can_unload(is_alive, keep_alive, r->oop_addr(), unloading_occurred)) {
1536 return;
1537 }
1538 }
1539 }
1540 }
1543 // Scopes
1544 for (oop* p = oops_begin(); p < oops_end(); p++) {
1545 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1546 if (can_unload(is_alive, keep_alive, p, unloading_occurred)) {
1547 return;
1548 }
1549 }
1551 #ifndef PRODUCT
1552 // This nmethod was not unloaded; check below that all CompiledICs
1553 // refer to marked oops.
1554 {
1555 RelocIterator iter(this, low_boundary);
1556 while (iter.next()) {
1557 if (iter.type() == relocInfo::virtual_call_type) {
1558 CompiledIC *ic = CompiledIC_at(iter.reloc());
1559 oop ic_oop = ic->cached_oop();
1560 assert(ic_oop == NULL || is_alive->do_object_b(ic_oop),
1561 "Found unmarked ic_oop in reachable nmethod");
1562 }
1563 }
1564 }
1565 #endif // !PRODUCT
1566 }
1568 // This method is called twice during GC -- once while
1569 // tracing the "active" nmethods on thread stacks during
1570 // the (strong) marking phase, and then again when walking
1571 // the code cache contents during the weak roots processing
1572 // phase. The two uses are distinguished by means of the
1573 // 'do_strong_roots_only' flag, which is true in the first
1574 // case. We want to walk the weak roots in the nmethod
1575 // only in the second case. The weak roots in the nmethod
1576 // are the oops in the ExceptionCache and the InlineCache
1577 // oops.
1578 void nmethod::oops_do(OopClosure* f, bool do_strong_roots_only) {
1579 // make sure the oops ready to receive visitors
1580 assert(!is_zombie() && !is_unloaded(),
1581 "should not call follow on zombie or unloaded nmethod");
1583 // If the method is not entrant or zombie then a JMP is plastered over the
1584 // first few bytes. If an oop in the old code was there, that oop
1585 // should not get GC'd. Skip the first few bytes of oops on
1586 // not-entrant methods.
1587 address low_boundary = verified_entry_point();
1588 if (is_not_entrant()) {
1589 low_boundary += NativeJump::instruction_size;
1590 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1591 // (See comment above.)
1592 }
1594 // Compiled code
1595 f->do_oop((oop*) &_method);
1596 if (!do_strong_roots_only) {
1597 // weak roots processing phase -- update ExceptionCache oops
1598 ExceptionCache* ec = exception_cache();
1599 while(ec != NULL) {
1600 f->do_oop((oop*)ec->exception_type_addr());
1601 ec = ec->next();
1602 }
1603 } // Else strong roots phase -- skip oops in ExceptionCache
1605 RelocIterator iter(this, low_boundary);
1607 while (iter.next()) {
1608 if (iter.type() == relocInfo::oop_type ) {
1609 oop_Relocation* r = iter.oop_reloc();
1610 // In this loop, we must only follow those oops directly embedded in
1611 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1612 assert(1 == (r->oop_is_immediate()) +
1613 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1614 "oop must be found in exactly one place");
1615 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1616 f->do_oop(r->oop_addr());
1617 }
1618 }
1619 }
1621 // Scopes
1622 // This includes oop constants not inlined in the code stream.
1623 for (oop* p = oops_begin(); p < oops_end(); p++) {
1624 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1625 f->do_oop(p);
1626 }
1627 }
1629 #define NMETHOD_SENTINEL ((nmethod*)badAddress)
1631 nmethod* volatile nmethod::_oops_do_mark_nmethods;
1633 // An nmethod is "marked" if its _mark_link is set non-null.
1634 // Even if it is the end of the linked list, it will have a non-null link value,
1635 // as long as it is on the list.
1636 // This code must be MP safe, because it is used from parallel GC passes.
1637 bool nmethod::test_set_oops_do_mark() {
1638 assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
1639 nmethod* observed_mark_link = _oops_do_mark_link;
1640 if (observed_mark_link == NULL) {
1641 // Claim this nmethod for this thread to mark.
1642 observed_mark_link = (nmethod*)
1643 Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL);
1644 if (observed_mark_link == NULL) {
1646 // Atomically append this nmethod (now claimed) to the head of the list:
1647 nmethod* observed_mark_nmethods = _oops_do_mark_nmethods;
1648 for (;;) {
1649 nmethod* required_mark_nmethods = observed_mark_nmethods;
1650 _oops_do_mark_link = required_mark_nmethods;
1651 observed_mark_nmethods = (nmethod*)
1652 Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods);
1653 if (observed_mark_nmethods == required_mark_nmethods)
1654 break;
1655 }
1656 // Mark was clear when we first saw this guy.
1657 NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark\n"));
1658 return false;
1659 }
1660 }
1661 // On fall through, another racing thread marked this nmethod before we did.
1662 return true;
1663 }
1665 void nmethod::oops_do_marking_prologue() {
1666 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue"));
1667 assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row");
1668 // We use cmpxchg_ptr instead of regular assignment here because the user
1669 // may fork a bunch of threads, and we need them all to see the same state.
1670 void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL);
1671 guarantee(observed == NULL, "no races in this sequential code");
1672 }
1674 void nmethod::oops_do_marking_epilogue() {
1675 assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row");
1676 nmethod* cur = _oops_do_mark_nmethods;
1677 while (cur != NMETHOD_SENTINEL) {
1678 assert(cur != NULL, "not NULL-terminated");
1679 nmethod* next = cur->_oops_do_mark_link;
1680 cur->_oops_do_mark_link = NULL;
1681 NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark\n"));
1682 cur = next;
1683 }
1684 void* required = _oops_do_mark_nmethods;
1685 void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required);
1686 guarantee(observed == required, "no races in this sequential code");
1687 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]"));
1688 }
1690 class DetectScavengeRoot: public OopClosure {
1691 bool _detected_scavenge_root;
1692 public:
1693 DetectScavengeRoot() : _detected_scavenge_root(false)
1694 { NOT_PRODUCT(_print_nm = NULL); }
1695 bool detected_scavenge_root() { return _detected_scavenge_root; }
1696 virtual void do_oop(oop* p) {
1697 if ((*p) != NULL && (*p)->is_scavengable()) {
1698 NOT_PRODUCT(maybe_print(p));
1699 _detected_scavenge_root = true;
1700 }
1701 }
1702 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
1704 #ifndef PRODUCT
1705 nmethod* _print_nm;
1706 void maybe_print(oop* p) {
1707 if (_print_nm == NULL) return;
1708 if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root");
1709 tty->print_cr(""PTR_FORMAT"[offset=%d] detected non-perm oop "PTR_FORMAT" (found at "PTR_FORMAT")",
1710 _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm),
1711 (intptr_t)(*p), (intptr_t)p);
1712 (*p)->print();
1713 }
1714 #endif //PRODUCT
1715 };
1717 bool nmethod::detect_scavenge_root_oops() {
1718 DetectScavengeRoot detect_scavenge_root;
1719 NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this);
1720 oops_do(&detect_scavenge_root);
1721 return detect_scavenge_root.detected_scavenge_root();
1722 }
1724 // Method that knows how to preserve outgoing arguments at call. This method must be
1725 // called with a frame corresponding to a Java invoke
1726 void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) {
1727 if (!method()->is_native()) {
1728 SimpleScopeDesc ssd(this, fr.pc());
1729 Bytecode_invoke* call = Bytecode_invoke_at(ssd.method(), ssd.bci());
1730 bool has_receiver = call->has_receiver();
1731 symbolOop signature = call->signature();
1732 fr.oops_compiled_arguments_do(signature, has_receiver, reg_map, f);
1733 }
1734 }
1737 oop nmethod::embeddedOop_at(u_char* p) {
1738 RelocIterator iter(this, p, p + oopSize);
1739 while (iter.next())
1740 if (iter.type() == relocInfo::oop_type) {
1741 return iter.oop_reloc()->oop_value();
1742 }
1743 return NULL;
1744 }
1747 inline bool includes(void* p, void* from, void* to) {
1748 return from <= p && p < to;
1749 }
1752 void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) {
1753 assert(count >= 2, "must be sentinel values, at least");
1755 #ifdef ASSERT
1756 // must be sorted and unique; we do a binary search in find_pc_desc()
1757 int prev_offset = pcs[0].pc_offset();
1758 assert(prev_offset == PcDesc::lower_offset_limit,
1759 "must start with a sentinel");
1760 for (int i = 1; i < count; i++) {
1761 int this_offset = pcs[i].pc_offset();
1762 assert(this_offset > prev_offset, "offsets must be sorted");
1763 prev_offset = this_offset;
1764 }
1765 assert(prev_offset == PcDesc::upper_offset_limit,
1766 "must end with a sentinel");
1767 #endif //ASSERT
1769 // Search for MethodHandle invokes and tag the nmethod.
1770 for (int i = 0; i < count; i++) {
1771 if (pcs[i].is_method_handle_invoke()) {
1772 set_has_method_handle_invokes(true);
1773 break;
1774 }
1775 }
1777 int size = count * sizeof(PcDesc);
1778 assert(scopes_pcs_size() >= size, "oob");
1779 memcpy(scopes_pcs_begin(), pcs, size);
1781 // Adjust the final sentinel downward.
1782 PcDesc* last_pc = &scopes_pcs_begin()[count-1];
1783 assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity");
1784 last_pc->set_pc_offset(instructions_size() + 1);
1785 for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) {
1786 // Fill any rounding gaps with copies of the last record.
1787 last_pc[1] = last_pc[0];
1788 }
1789 // The following assert could fail if sizeof(PcDesc) is not
1790 // an integral multiple of oopSize (the rounding term).
1791 // If it fails, change the logic to always allocate a multiple
1792 // of sizeof(PcDesc), and fill unused words with copies of *last_pc.
1793 assert(last_pc + 1 == scopes_pcs_end(), "must match exactly");
1794 }
1796 void nmethod::copy_scopes_data(u_char* buffer, int size) {
1797 assert(scopes_data_size() >= size, "oob");
1798 memcpy(scopes_data_begin(), buffer, size);
1799 }
1802 #ifdef ASSERT
1803 static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) {
1804 PcDesc* lower = nm->scopes_pcs_begin();
1805 PcDesc* upper = nm->scopes_pcs_end();
1806 lower += 1; // exclude initial sentinel
1807 PcDesc* res = NULL;
1808 for (PcDesc* p = lower; p < upper; p++) {
1809 NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc
1810 if (match_desc(p, pc_offset, approximate)) {
1811 if (res == NULL)
1812 res = p;
1813 else
1814 res = (PcDesc*) badAddress;
1815 }
1816 }
1817 return res;
1818 }
1819 #endif
1822 // Finds a PcDesc with real-pc equal to "pc"
1823 PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) {
1824 address base_address = instructions_begin();
1825 if ((pc < base_address) ||
1826 (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) {
1827 return NULL; // PC is wildly out of range
1828 }
1829 int pc_offset = (int) (pc - base_address);
1831 // Check the PcDesc cache if it contains the desired PcDesc
1832 // (This as an almost 100% hit rate.)
1833 PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate);
1834 if (res != NULL) {
1835 assert(res == linear_search(this, pc_offset, approximate), "cache ok");
1836 return res;
1837 }
1839 // Fallback algorithm: quasi-linear search for the PcDesc
1840 // Find the last pc_offset less than the given offset.
1841 // The successor must be the required match, if there is a match at all.
1842 // (Use a fixed radix to avoid expensive affine pointer arithmetic.)
1843 PcDesc* lower = scopes_pcs_begin();
1844 PcDesc* upper = scopes_pcs_end();
1845 upper -= 1; // exclude final sentinel
1846 if (lower >= upper) return NULL; // native method; no PcDescs at all
1848 #define assert_LU_OK \
1849 /* invariant on lower..upper during the following search: */ \
1850 assert(lower->pc_offset() < pc_offset, "sanity"); \
1851 assert(upper->pc_offset() >= pc_offset, "sanity")
1852 assert_LU_OK;
1854 // Use the last successful return as a split point.
1855 PcDesc* mid = _pc_desc_cache.last_pc_desc();
1856 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1857 if (mid->pc_offset() < pc_offset) {
1858 lower = mid;
1859 } else {
1860 upper = mid;
1861 }
1863 // Take giant steps at first (4096, then 256, then 16, then 1)
1864 const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1);
1865 const int RADIX = (1 << LOG2_RADIX);
1866 for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) {
1867 while ((mid = lower + step) < upper) {
1868 assert_LU_OK;
1869 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1870 if (mid->pc_offset() < pc_offset) {
1871 lower = mid;
1872 } else {
1873 upper = mid;
1874 break;
1875 }
1876 }
1877 assert_LU_OK;
1878 }
1880 // Sneak up on the value with a linear search of length ~16.
1881 while (true) {
1882 assert_LU_OK;
1883 mid = lower + 1;
1884 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1885 if (mid->pc_offset() < pc_offset) {
1886 lower = mid;
1887 } else {
1888 upper = mid;
1889 break;
1890 }
1891 }
1892 #undef assert_LU_OK
1894 if (match_desc(upper, pc_offset, approximate)) {
1895 assert(upper == linear_search(this, pc_offset, approximate), "search ok");
1896 _pc_desc_cache.add_pc_desc(upper);
1897 return upper;
1898 } else {
1899 assert(NULL == linear_search(this, pc_offset, approximate), "search ok");
1900 return NULL;
1901 }
1902 }
1905 bool nmethod::check_all_dependencies() {
1906 bool found_check = false;
1907 // wholesale check of all dependencies
1908 for (Dependencies::DepStream deps(this); deps.next(); ) {
1909 if (deps.check_dependency() != NULL) {
1910 found_check = true;
1911 NOT_DEBUG(break);
1912 }
1913 }
1914 return found_check; // tell caller if we found anything
1915 }
1917 bool nmethod::check_dependency_on(DepChange& changes) {
1918 // What has happened:
1919 // 1) a new class dependee has been added
1920 // 2) dependee and all its super classes have been marked
1921 bool found_check = false; // set true if we are upset
1922 for (Dependencies::DepStream deps(this); deps.next(); ) {
1923 // Evaluate only relevant dependencies.
1924 if (deps.spot_check_dependency_at(changes) != NULL) {
1925 found_check = true;
1926 NOT_DEBUG(break);
1927 }
1928 }
1929 return found_check;
1930 }
1932 bool nmethod::is_evol_dependent_on(klassOop dependee) {
1933 instanceKlass *dependee_ik = instanceKlass::cast(dependee);
1934 objArrayOop dependee_methods = dependee_ik->methods();
1935 for (Dependencies::DepStream deps(this); deps.next(); ) {
1936 if (deps.type() == Dependencies::evol_method) {
1937 methodOop method = deps.method_argument(0);
1938 for (int j = 0; j < dependee_methods->length(); j++) {
1939 if ((methodOop) dependee_methods->obj_at(j) == method) {
1940 // RC_TRACE macro has an embedded ResourceMark
1941 RC_TRACE(0x01000000,
1942 ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)",
1943 _method->method_holder()->klass_part()->external_name(),
1944 _method->name()->as_C_string(),
1945 _method->signature()->as_C_string(), compile_id(),
1946 method->method_holder()->klass_part()->external_name(),
1947 method->name()->as_C_string(),
1948 method->signature()->as_C_string()));
1949 if (TraceDependencies || LogCompilation)
1950 deps.log_dependency(dependee);
1951 return true;
1952 }
1953 }
1954 }
1955 }
1956 return false;
1957 }
1959 // Called from mark_for_deoptimization, when dependee is invalidated.
1960 bool nmethod::is_dependent_on_method(methodOop dependee) {
1961 for (Dependencies::DepStream deps(this); deps.next(); ) {
1962 if (deps.type() != Dependencies::evol_method)
1963 continue;
1964 methodOop method = deps.method_argument(0);
1965 if (method == dependee) return true;
1966 }
1967 return false;
1968 }
1971 bool nmethod::is_patchable_at(address instr_addr) {
1972 assert (code_contains(instr_addr), "wrong nmethod used");
1973 if (is_zombie()) {
1974 // a zombie may never be patched
1975 return false;
1976 }
1977 return true;
1978 }
1981 address nmethod::continuation_for_implicit_exception(address pc) {
1982 // Exception happened outside inline-cache check code => we are inside
1983 // an active nmethod => use cpc to determine a return address
1984 int exception_offset = pc - instructions_begin();
1985 int cont_offset = ImplicitExceptionTable(this).at( exception_offset );
1986 #ifdef ASSERT
1987 if (cont_offset == 0) {
1988 Thread* thread = ThreadLocalStorage::get_thread_slow();
1989 ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
1990 HandleMark hm(thread);
1991 ResourceMark rm(thread);
1992 CodeBlob* cb = CodeCache::find_blob(pc);
1993 assert(cb != NULL && cb == this, "");
1994 tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc);
1995 print();
1996 method()->print_codes();
1997 print_code();
1998 print_pcs();
1999 }
2000 #endif
2001 guarantee(cont_offset != 0, "unhandled implicit exception in compiled code");
2002 return instructions_begin() + cont_offset;
2003 }
2007 void nmethod_init() {
2008 // make sure you didn't forget to adjust the filler fields
2009 assert(sizeof(nmFlags) <= 4, "nmFlags occupies more than a word");
2010 assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word");
2011 }
2014 //-------------------------------------------------------------------------------------------
2017 // QQQ might we make this work from a frame??
2018 nmethodLocker::nmethodLocker(address pc) {
2019 CodeBlob* cb = CodeCache::find_blob(pc);
2020 guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found");
2021 _nm = (nmethod*)cb;
2022 lock_nmethod(_nm);
2023 }
2025 void nmethodLocker::lock_nmethod(nmethod* nm) {
2026 if (nm == NULL) return;
2027 Atomic::inc(&nm->_lock_count);
2028 guarantee(!nm->is_zombie(), "cannot lock a zombie method");
2029 }
2031 void nmethodLocker::unlock_nmethod(nmethod* nm) {
2032 if (nm == NULL) return;
2033 Atomic::dec(&nm->_lock_count);
2034 guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock");
2035 }
2038 // -----------------------------------------------------------------------------
2039 // nmethod::get_deopt_original_pc
2040 //
2041 // Return the original PC for the given PC if:
2042 // (a) the given PC belongs to a nmethod and
2043 // (b) it is a deopt PC
2044 address nmethod::get_deopt_original_pc(const frame* fr) {
2045 if (fr->cb() == NULL) return NULL;
2047 nmethod* nm = fr->cb()->as_nmethod_or_null();
2048 if (nm != NULL && nm->is_deopt_pc(fr->pc()))
2049 return nm->get_original_pc(fr);
2051 return NULL;
2052 }
2055 // -----------------------------------------------------------------------------
2056 // MethodHandle
2058 bool nmethod::is_method_handle_return(address return_pc) {
2059 if (!has_method_handle_invokes()) return false;
2060 PcDesc* pd = pc_desc_at(return_pc);
2061 if (pd == NULL)
2062 return false;
2063 return pd->is_method_handle_invoke();
2064 }
2067 // -----------------------------------------------------------------------------
2068 // Verification
2070 class VerifyOopsClosure: public OopClosure {
2071 nmethod* _nm;
2072 bool _ok;
2073 public:
2074 VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { }
2075 bool ok() { return _ok; }
2076 virtual void do_oop(oop* p) {
2077 if ((*p) == NULL || (*p)->is_oop()) return;
2078 if (_ok) {
2079 _nm->print_nmethod(true);
2080 _ok = false;
2081 }
2082 tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2083 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2084 }
2085 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2086 };
2088 void nmethod::verify() {
2090 // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant
2091 // seems odd.
2093 if( is_zombie() || is_not_entrant() )
2094 return;
2096 // Make sure all the entry points are correctly aligned for patching.
2097 NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point());
2099 assert(method()->is_oop(), "must be valid");
2101 ResourceMark rm;
2103 if (!CodeCache::contains(this)) {
2104 fatal1("nmethod at " INTPTR_FORMAT " not in zone", this);
2105 }
2107 if(is_native_method() )
2108 return;
2110 nmethod* nm = CodeCache::find_nmethod(verified_entry_point());
2111 if (nm != this) {
2112 fatal1("findNMethod did not find this nmethod (" INTPTR_FORMAT ")", this);
2113 }
2115 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2116 if (! p->verify(this)) {
2117 tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this);
2118 }
2119 }
2121 VerifyOopsClosure voc(this);
2122 oops_do(&voc);
2123 assert(voc.ok(), "embedded oops must be OK");
2124 verify_scavenge_root_oops();
2126 verify_scopes();
2127 }
2130 void nmethod::verify_interrupt_point(address call_site) {
2131 // This code does not work in release mode since
2132 // owns_lock only is available in debug mode.
2133 CompiledIC* ic = NULL;
2134 Thread *cur = Thread::current();
2135 if (CompiledIC_lock->owner() == cur ||
2136 ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) &&
2137 SafepointSynchronize::is_at_safepoint())) {
2138 ic = CompiledIC_at(call_site);
2139 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
2140 } else {
2141 MutexLocker ml_verify (CompiledIC_lock);
2142 ic = CompiledIC_at(call_site);
2143 }
2144 PcDesc* pd = pc_desc_at(ic->end_of_call());
2145 assert(pd != NULL, "PcDesc must exist");
2146 for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(),
2147 pd->obj_decode_offset(), pd->should_reexecute());
2148 !sd->is_top(); sd = sd->sender()) {
2149 sd->verify();
2150 }
2151 }
2153 void nmethod::verify_scopes() {
2154 if( !method() ) return; // Runtime stubs have no scope
2155 if (method()->is_native()) return; // Ignore stub methods.
2156 // iterate through all interrupt point
2157 // and verify the debug information is valid.
2158 RelocIterator iter((nmethod*)this);
2159 while (iter.next()) {
2160 address stub = NULL;
2161 switch (iter.type()) {
2162 case relocInfo::virtual_call_type:
2163 verify_interrupt_point(iter.addr());
2164 break;
2165 case relocInfo::opt_virtual_call_type:
2166 stub = iter.opt_virtual_call_reloc()->static_stub();
2167 verify_interrupt_point(iter.addr());
2168 break;
2169 case relocInfo::static_call_type:
2170 stub = iter.static_call_reloc()->static_stub();
2171 //verify_interrupt_point(iter.addr());
2172 break;
2173 case relocInfo::runtime_call_type:
2174 address destination = iter.reloc()->value();
2175 // Right now there is no way to find out which entries support
2176 // an interrupt point. It would be nice if we had this
2177 // information in a table.
2178 break;
2179 }
2180 assert(stub == NULL || stub_contains(stub), "static call stub outside stub section");
2181 }
2182 }
2185 // -----------------------------------------------------------------------------
2186 // Non-product code
2187 #ifndef PRODUCT
2189 class DebugScavengeRoot: public OopClosure {
2190 nmethod* _nm;
2191 bool _ok;
2192 public:
2193 DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { }
2194 bool ok() { return _ok; }
2195 virtual void do_oop(oop* p) {
2196 if ((*p) == NULL || !(*p)->is_scavengable()) return;
2197 if (_ok) {
2198 _nm->print_nmethod(true);
2199 _ok = false;
2200 }
2201 tty->print_cr("*** non-perm oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2202 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2203 (*p)->print();
2204 }
2205 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2206 };
2208 void nmethod::verify_scavenge_root_oops() {
2209 if (!on_scavenge_root_list()) {
2210 // Actually look inside, to verify the claim that it's clean.
2211 DebugScavengeRoot debug_scavenge_root(this);
2212 oops_do(&debug_scavenge_root);
2213 if (!debug_scavenge_root.ok())
2214 fatal("found an unadvertised bad non-perm oop in the code cache");
2215 }
2216 assert(scavenge_root_not_marked(), "");
2217 }
2219 #endif // PRODUCT
2221 // Printing operations
2223 void nmethod::print() const {
2224 ResourceMark rm;
2225 ttyLocker ttyl; // keep the following output all in one block
2227 tty->print("Compiled ");
2229 if (is_compiled_by_c1()) {
2230 tty->print("(c1) ");
2231 } else if (is_compiled_by_c2()) {
2232 tty->print("(c2) ");
2233 } else {
2234 tty->print("(nm) ");
2235 }
2237 print_on(tty, "nmethod");
2238 tty->cr();
2239 if (WizardMode) {
2240 tty->print("((nmethod*) "INTPTR_FORMAT ") ", this);
2241 tty->print(" for method " INTPTR_FORMAT , (address)method());
2242 tty->print(" { ");
2243 if (version()) tty->print("v%d ", version());
2244 if (level()) tty->print("l%d ", level());
2245 if (is_in_use()) tty->print("in_use ");
2246 if (is_not_entrant()) tty->print("not_entrant ");
2247 if (is_zombie()) tty->print("zombie ");
2248 if (is_unloaded()) tty->print("unloaded ");
2249 if (on_scavenge_root_list()) tty->print("scavenge_root ");
2250 tty->print_cr("}:");
2251 }
2252 if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2253 (address)this,
2254 (address)this + size(),
2255 size());
2256 if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2257 relocation_begin(),
2258 relocation_end(),
2259 relocation_size());
2260 if (code_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2261 code_begin(),
2262 code_end(),
2263 code_size());
2264 if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2265 stub_begin(),
2266 stub_end(),
2267 stub_size());
2268 if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2269 consts_begin(),
2270 consts_end(),
2271 consts_size());
2272 if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2273 scopes_data_begin(),
2274 scopes_data_end(),
2275 scopes_data_size());
2276 if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2277 scopes_pcs_begin(),
2278 scopes_pcs_end(),
2279 scopes_pcs_size());
2280 if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2281 dependencies_begin(),
2282 dependencies_end(),
2283 dependencies_size());
2284 if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2285 handler_table_begin(),
2286 handler_table_end(),
2287 handler_table_size());
2288 if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2289 nul_chk_table_begin(),
2290 nul_chk_table_end(),
2291 nul_chk_table_size());
2292 if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2293 oops_begin(),
2294 oops_end(),
2295 oops_size());
2296 }
2298 void nmethod::print_code() {
2299 HandleMark hm;
2300 ResourceMark m;
2301 Disassembler::decode(this);
2302 }
2305 #ifndef PRODUCT
2307 void nmethod::print_scopes() {
2308 // Find the first pc desc for all scopes in the code and print it.
2309 ResourceMark rm;
2310 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2311 if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null)
2312 continue;
2314 ScopeDesc* sd = scope_desc_at(p->real_pc(this));
2315 sd->print_on(tty, p);
2316 }
2317 }
2319 void nmethod::print_dependencies() {
2320 ResourceMark rm;
2321 ttyLocker ttyl; // keep the following output all in one block
2322 tty->print_cr("Dependencies:");
2323 for (Dependencies::DepStream deps(this); deps.next(); ) {
2324 deps.print_dependency();
2325 klassOop ctxk = deps.context_type();
2326 if (ctxk != NULL) {
2327 Klass* k = Klass::cast(ctxk);
2328 if (k->oop_is_instance() && ((instanceKlass*)k)->is_dependent_nmethod(this)) {
2329 tty->print_cr(" [nmethod<=klass]%s", k->external_name());
2330 }
2331 }
2332 deps.log_dependency(); // put it into the xml log also
2333 }
2334 }
2337 void nmethod::print_relocations() {
2338 ResourceMark m; // in case methods get printed via the debugger
2339 tty->print_cr("relocations:");
2340 RelocIterator iter(this);
2341 iter.print();
2342 if (UseRelocIndex) {
2343 jint* index_end = (jint*)relocation_end() - 1;
2344 jint index_size = *index_end;
2345 jint* index_start = (jint*)( (address)index_end - index_size );
2346 tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size);
2347 if (index_size > 0) {
2348 jint* ip;
2349 for (ip = index_start; ip+2 <= index_end; ip += 2)
2350 tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT,
2351 ip[0],
2352 ip[1],
2353 header_end()+ip[0],
2354 relocation_begin()-1+ip[1]);
2355 for (; ip < index_end; ip++)
2356 tty->print_cr(" (%d ?)", ip[0]);
2357 tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip++);
2358 tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip);
2359 }
2360 }
2361 }
2364 void nmethod::print_pcs() {
2365 ResourceMark m; // in case methods get printed via debugger
2366 tty->print_cr("pc-bytecode offsets:");
2367 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2368 p->print(this);
2369 }
2370 }
2372 #endif // PRODUCT
2374 const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
2375 RelocIterator iter(this, begin, end);
2376 bool have_one = false;
2377 while (iter.next()) {
2378 have_one = true;
2379 switch (iter.type()) {
2380 case relocInfo::none: return "no_reloc";
2381 case relocInfo::oop_type: {
2382 stringStream st;
2383 oop_Relocation* r = iter.oop_reloc();
2384 oop obj = r->oop_value();
2385 st.print("oop(");
2386 if (obj == NULL) st.print("NULL");
2387 else obj->print_value_on(&st);
2388 st.print(")");
2389 return st.as_string();
2390 }
2391 case relocInfo::virtual_call_type: return "virtual_call";
2392 case relocInfo::opt_virtual_call_type: return "optimized virtual_call";
2393 case relocInfo::static_call_type: return "static_call";
2394 case relocInfo::static_stub_type: return "static_stub";
2395 case relocInfo::runtime_call_type: return "runtime_call";
2396 case relocInfo::external_word_type: return "external_word";
2397 case relocInfo::internal_word_type: return "internal_word";
2398 case relocInfo::section_word_type: return "section_word";
2399 case relocInfo::poll_type: return "poll";
2400 case relocInfo::poll_return_type: return "poll_return";
2401 case relocInfo::type_mask: return "type_bit_mask";
2402 }
2403 }
2404 return have_one ? "other" : NULL;
2405 }
2407 // Return a the last scope in (begin..end]
2408 ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
2409 PcDesc* p = pc_desc_near(begin+1);
2410 if (p != NULL && p->real_pc(this) <= end) {
2411 return new ScopeDesc(this, p->scope_decode_offset(),
2412 p->obj_decode_offset(), p->should_reexecute());
2413 }
2414 return NULL;
2415 }
2417 void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) {
2418 if (block_begin == entry_point()) stream->print_cr("[Entry Point]");
2419 if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]");
2420 if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]");
2421 if (block_begin == stub_begin()) stream->print_cr("[Stub Code]");
2422 if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]");
2423 if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]");
2424 if (block_begin == consts_begin()) stream->print_cr("[Constants]");
2425 if (block_begin == entry_point()) {
2426 methodHandle m = method();
2427 if (m.not_null()) {
2428 stream->print(" # ");
2429 m->print_value_on(stream);
2430 stream->cr();
2431 }
2432 if (m.not_null() && !is_osr_method()) {
2433 ResourceMark rm;
2434 int sizeargs = m->size_of_parameters();
2435 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
2436 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
2437 {
2438 int sig_index = 0;
2439 if (!m->is_static())
2440 sig_bt[sig_index++] = T_OBJECT; // 'this'
2441 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
2442 BasicType t = ss.type();
2443 sig_bt[sig_index++] = t;
2444 if (type2size[t] == 2) {
2445 sig_bt[sig_index++] = T_VOID;
2446 } else {
2447 assert(type2size[t] == 1, "size is 1 or 2");
2448 }
2449 }
2450 assert(sig_index == sizeargs, "");
2451 }
2452 const char* spname = "sp"; // make arch-specific?
2453 intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false);
2454 int stack_slot_offset = this->frame_size() * wordSize;
2455 int tab1 = 14, tab2 = 24;
2456 int sig_index = 0;
2457 int arg_index = (m->is_static() ? 0 : -1);
2458 bool did_old_sp = false;
2459 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
2460 bool at_this = (arg_index == -1);
2461 bool at_old_sp = false;
2462 BasicType t = (at_this ? T_OBJECT : ss.type());
2463 assert(t == sig_bt[sig_index], "sigs in sync");
2464 if (at_this)
2465 stream->print(" # this: ");
2466 else
2467 stream->print(" # parm%d: ", arg_index);
2468 stream->move_to(tab1);
2469 VMReg fst = regs[sig_index].first();
2470 VMReg snd = regs[sig_index].second();
2471 if (fst->is_reg()) {
2472 stream->print("%s", fst->name());
2473 if (snd->is_valid()) {
2474 stream->print(":%s", snd->name());
2475 }
2476 } else if (fst->is_stack()) {
2477 int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset;
2478 if (offset == stack_slot_offset) at_old_sp = true;
2479 stream->print("[%s+0x%x]", spname, offset);
2480 } else {
2481 stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd);
2482 }
2483 stream->print(" ");
2484 stream->move_to(tab2);
2485 stream->print("= ");
2486 if (at_this) {
2487 m->method_holder()->print_value_on(stream);
2488 } else {
2489 bool did_name = false;
2490 if (!at_this && ss.is_object()) {
2491 symbolOop name = ss.as_symbol_or_null();
2492 if (name != NULL) {
2493 name->print_value_on(stream);
2494 did_name = true;
2495 }
2496 }
2497 if (!did_name)
2498 stream->print("%s", type2name(t));
2499 }
2500 if (at_old_sp) {
2501 stream->print(" (%s of caller)", spname);
2502 did_old_sp = true;
2503 }
2504 stream->cr();
2505 sig_index += type2size[t];
2506 arg_index += 1;
2507 if (!at_this) ss.next();
2508 }
2509 if (!did_old_sp) {
2510 stream->print(" # ");
2511 stream->move_to(tab1);
2512 stream->print("[%s+0x%x]", spname, stack_slot_offset);
2513 stream->print(" (%s of caller)", spname);
2514 stream->cr();
2515 }
2516 }
2517 }
2518 }
2520 void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) {
2521 // First, find an oopmap in (begin, end].
2522 // We use the odd half-closed interval so that oop maps and scope descs
2523 // which are tied to the byte after a call are printed with the call itself.
2524 address base = instructions_begin();
2525 OopMapSet* oms = oop_maps();
2526 if (oms != NULL) {
2527 for (int i = 0, imax = oms->size(); i < imax; i++) {
2528 OopMap* om = oms->at(i);
2529 address pc = base + om->offset();
2530 if (pc > begin) {
2531 if (pc <= end) {
2532 st->move_to(column);
2533 st->print("; ");
2534 om->print_on(st);
2535 }
2536 break;
2537 }
2538 }
2539 }
2541 // Print any debug info present at this pc.
2542 ScopeDesc* sd = scope_desc_in(begin, end);
2543 if (sd != NULL) {
2544 st->move_to(column);
2545 if (sd->bci() == SynchronizationEntryBCI) {
2546 st->print(";*synchronization entry");
2547 } else {
2548 if (sd->method().is_null()) {
2549 st->print("method is NULL");
2550 } else if (sd->method()->is_native()) {
2551 st->print("method is native");
2552 } else {
2553 address bcp = sd->method()->bcp_from(sd->bci());
2554 Bytecodes::Code bc = Bytecodes::java_code_at(bcp);
2555 st->print(";*%s", Bytecodes::name(bc));
2556 switch (bc) {
2557 case Bytecodes::_invokevirtual:
2558 case Bytecodes::_invokespecial:
2559 case Bytecodes::_invokestatic:
2560 case Bytecodes::_invokeinterface:
2561 {
2562 Bytecode_invoke* invoke = Bytecode_invoke_at(sd->method(), sd->bci());
2563 st->print(" ");
2564 if (invoke->name() != NULL)
2565 invoke->name()->print_symbol_on(st);
2566 else
2567 st->print("<UNKNOWN>");
2568 break;
2569 }
2570 case Bytecodes::_getfield:
2571 case Bytecodes::_putfield:
2572 case Bytecodes::_getstatic:
2573 case Bytecodes::_putstatic:
2574 {
2575 methodHandle sdm = sd->method();
2576 Bytecode_field* field = Bytecode_field_at(sdm(), sdm->bcp_from(sd->bci()));
2577 constantPoolOop sdmc = sdm->constants();
2578 symbolOop name = sdmc->name_ref_at(field->index());
2579 st->print(" ");
2580 if (name != NULL)
2581 name->print_symbol_on(st);
2582 else
2583 st->print("<UNKNOWN>");
2584 }
2585 }
2586 }
2587 }
2589 // Print all scopes
2590 for (;sd != NULL; sd = sd->sender()) {
2591 st->move_to(column);
2592 st->print("; -");
2593 if (sd->method().is_null()) {
2594 st->print("method is NULL");
2595 } else {
2596 sd->method()->print_short_name(st);
2597 }
2598 int lineno = sd->method()->line_number_from_bci(sd->bci());
2599 if (lineno != -1) {
2600 st->print("@%d (line %d)", sd->bci(), lineno);
2601 } else {
2602 st->print("@%d", sd->bci());
2603 }
2604 st->cr();
2605 }
2606 }
2608 // Print relocation information
2609 const char* str = reloc_string_for(begin, end);
2610 if (str != NULL) {
2611 if (sd != NULL) st->cr();
2612 st->move_to(column);
2613 st->print("; {%s}", str);
2614 }
2615 int cont_offset = ImplicitExceptionTable(this).at(begin - instructions_begin());
2616 if (cont_offset != 0) {
2617 st->move_to(column);
2618 st->print("; implicit exception: dispatches to " INTPTR_FORMAT, instructions_begin() + cont_offset);
2619 }
2621 }
2623 #ifndef PRODUCT
2625 void nmethod::print_value_on(outputStream* st) const {
2626 print_on(st, "nmethod");
2627 }
2629 void nmethod::print_calls(outputStream* st) {
2630 RelocIterator iter(this);
2631 while (iter.next()) {
2632 switch (iter.type()) {
2633 case relocInfo::virtual_call_type:
2634 case relocInfo::opt_virtual_call_type: {
2635 VerifyMutexLocker mc(CompiledIC_lock);
2636 CompiledIC_at(iter.reloc())->print();
2637 break;
2638 }
2639 case relocInfo::static_call_type:
2640 st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr());
2641 compiledStaticCall_at(iter.reloc())->print();
2642 break;
2643 }
2644 }
2645 }
2647 void nmethod::print_handler_table() {
2648 ExceptionHandlerTable(this).print();
2649 }
2651 void nmethod::print_nul_chk_table() {
2652 ImplicitExceptionTable(this).print(instructions_begin());
2653 }
2655 void nmethod::print_statistics() {
2656 ttyLocker ttyl;
2657 if (xtty != NULL) xtty->head("statistics type='nmethod'");
2658 nmethod_stats.print_native_nmethod_stats();
2659 nmethod_stats.print_nmethod_stats();
2660 DebugInformationRecorder::print_statistics();
2661 nmethod_stats.print_pc_stats();
2662 Dependencies::print_statistics();
2663 if (xtty != NULL) xtty->tail("statistics");
2664 }
2666 #endif // PRODUCT