Mon, 01 Feb 2010 19:29:46 +0100
6921352: 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 _saved_nmethod_link = NULL;
591 _compiler = NULL;
592 // We have no exception handler or deopt handler make the
593 // values something that will never match a pc like the nmethod vtable entry
594 _exception_offset = 0;
595 _deoptimize_offset = 0;
596 _deoptimize_mh_offset = 0;
597 _orig_pc_offset = 0;
598 #ifdef HAVE_DTRACE_H
599 _trap_offset = 0;
600 #endif // def HAVE_DTRACE_H
601 _stub_offset = data_offset();
602 _consts_offset = data_offset();
603 _scopes_data_offset = data_offset();
604 _scopes_pcs_offset = _scopes_data_offset;
605 _dependencies_offset = _scopes_pcs_offset;
606 _handler_table_offset = _dependencies_offset;
607 _nul_chk_table_offset = _handler_table_offset;
608 _nmethod_end_offset = _nul_chk_table_offset;
609 _compile_id = 0; // default
610 _comp_level = CompLevel_none;
611 _entry_point = instructions_begin();
612 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
613 _osr_entry_point = NULL;
614 _exception_cache = NULL;
615 _pc_desc_cache.reset_to(NULL);
617 flags.clear();
618 flags.state = alive;
619 _markedForDeoptimization = 0;
621 _lock_count = 0;
622 _stack_traversal_mark = 0;
624 code_buffer->copy_oops_to(this);
625 debug_only(verify_scavenge_root_oops());
626 CodeCache::commit(this);
627 VTune::create_nmethod(this);
628 }
630 if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
631 ttyLocker ttyl; // keep the following output all in one block
632 // This output goes directly to the tty, not the compiler log.
633 // To enable tools to match it up with the compilation activity,
634 // be sure to tag this tty output with the compile ID.
635 if (xtty != NULL) {
636 xtty->begin_head("print_native_nmethod");
637 xtty->method(_method);
638 xtty->stamp();
639 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
640 }
641 // print the header part first
642 print();
643 // then print the requested information
644 if (PrintNativeNMethods) {
645 print_code();
646 oop_maps->print();
647 }
648 if (PrintRelocations) {
649 print_relocations();
650 }
651 if (xtty != NULL) {
652 xtty->tail("print_native_nmethod");
653 }
654 }
655 Events::log("Create nmethod " INTPTR_FORMAT, this);
656 }
658 // For dtrace wrappers
659 #ifdef HAVE_DTRACE_H
660 nmethod::nmethod(
661 methodOop method,
662 int nmethod_size,
663 CodeOffsets* offsets,
664 CodeBuffer* code_buffer,
665 int frame_size)
666 : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod),
667 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL),
668 _compiled_synchronized_native_basic_lock_owner_sp_offset(in_ByteSize(-1)),
669 _compiled_synchronized_native_basic_lock_sp_offset(in_ByteSize(-1))
670 {
671 {
672 debug_only(No_Safepoint_Verifier nsv;)
673 assert_locked_or_safepoint(CodeCache_lock);
675 NOT_PRODUCT(_has_debug_info = false);
676 _oops_do_mark_link = NULL;
677 _method = method;
678 _entry_bci = InvocationEntryBci;
679 _osr_link = NULL;
680 _scavenge_root_link = NULL;
681 _scavenge_root_state = 0;
682 _compiler = NULL;
683 // We have no exception handler or deopt handler make the
684 // values something that will never match a pc like the nmethod vtable entry
685 _exception_offset = 0;
686 _deoptimize_offset = 0;
687 _deoptimize_mh_offset = 0;
688 _trap_offset = offsets->value(CodeOffsets::Dtrace_trap);
689 _orig_pc_offset = 0;
690 _stub_offset = data_offset();
691 _consts_offset = data_offset();
692 _scopes_data_offset = data_offset();
693 _scopes_pcs_offset = _scopes_data_offset;
694 _dependencies_offset = _scopes_pcs_offset;
695 _handler_table_offset = _dependencies_offset;
696 _nul_chk_table_offset = _handler_table_offset;
697 _nmethod_end_offset = _nul_chk_table_offset;
698 _compile_id = 0; // default
699 _comp_level = CompLevel_none;
700 _entry_point = instructions_begin();
701 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
702 _osr_entry_point = NULL;
703 _exception_cache = NULL;
704 _pc_desc_cache.reset_to(NULL);
706 flags.clear();
707 flags.state = alive;
708 _markedForDeoptimization = 0;
710 _lock_count = 0;
711 _stack_traversal_mark = 0;
713 code_buffer->copy_oops_to(this);
714 debug_only(verify_scavenge_root_oops());
715 CodeCache::commit(this);
716 VTune::create_nmethod(this);
717 }
719 if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) {
720 ttyLocker ttyl; // keep the following output all in one block
721 // This output goes directly to the tty, not the compiler log.
722 // To enable tools to match it up with the compilation activity,
723 // be sure to tag this tty output with the compile ID.
724 if (xtty != NULL) {
725 xtty->begin_head("print_dtrace_nmethod");
726 xtty->method(_method);
727 xtty->stamp();
728 xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this);
729 }
730 // print the header part first
731 print();
732 // then print the requested information
733 if (PrintNMethods) {
734 print_code();
735 }
736 if (PrintRelocations) {
737 print_relocations();
738 }
739 if (xtty != NULL) {
740 xtty->tail("print_dtrace_nmethod");
741 }
742 }
743 Events::log("Create nmethod " INTPTR_FORMAT, this);
744 }
745 #endif // def HAVE_DTRACE_H
747 void* nmethod::operator new(size_t size, int nmethod_size) {
748 // Always leave some room in the CodeCache for I2C/C2I adapters
749 if (CodeCache::unallocated_capacity() < CodeCacheMinimumFreeSpace) return NULL;
750 return CodeCache::allocate(nmethod_size);
751 }
754 nmethod::nmethod(
755 methodOop method,
756 int nmethod_size,
757 int compile_id,
758 int entry_bci,
759 CodeOffsets* offsets,
760 int orig_pc_offset,
761 DebugInformationRecorder* debug_info,
762 Dependencies* dependencies,
763 CodeBuffer *code_buffer,
764 int frame_size,
765 OopMapSet* oop_maps,
766 ExceptionHandlerTable* handler_table,
767 ImplicitExceptionTable* nul_chk_table,
768 AbstractCompiler* compiler,
769 int comp_level
770 )
771 : CodeBlob("nmethod", code_buffer, sizeof(nmethod),
772 nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps),
773 _compiled_synchronized_native_basic_lock_owner_sp_offset(in_ByteSize(-1)),
774 _compiled_synchronized_native_basic_lock_sp_offset(in_ByteSize(-1))
775 {
776 assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR");
777 {
778 debug_only(No_Safepoint_Verifier nsv;)
779 assert_locked_or_safepoint(CodeCache_lock);
781 NOT_PRODUCT(_has_debug_info = false);
782 _oops_do_mark_link = NULL;
783 _method = method;
784 _compile_id = compile_id;
785 _comp_level = comp_level;
786 _entry_bci = entry_bci;
787 _osr_link = NULL;
788 _scavenge_root_link = NULL;
789 _scavenge_root_state = 0;
790 _compiler = compiler;
791 _orig_pc_offset = orig_pc_offset;
792 #ifdef HAVE_DTRACE_H
793 _trap_offset = 0;
794 #endif // def HAVE_DTRACE_H
795 _stub_offset = instructions_offset() + code_buffer->total_offset_of(code_buffer->stubs()->start());
797 // Exception handler and deopt handler are in the stub section
798 _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions);
799 _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt);
800 _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH);
801 _consts_offset = instructions_offset() + code_buffer->total_offset_of(code_buffer->consts()->start());
802 _scopes_data_offset = data_offset();
803 _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize);
804 _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size());
805 _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize);
806 _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize);
807 _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize);
809 _entry_point = instructions_begin();
810 _verified_entry_point = instructions_begin() + offsets->value(CodeOffsets::Verified_Entry);
811 _osr_entry_point = instructions_begin() + offsets->value(CodeOffsets::OSR_Entry);
812 _exception_cache = NULL;
813 _pc_desc_cache.reset_to(scopes_pcs_begin());
815 flags.clear();
816 flags.state = alive;
817 _markedForDeoptimization = 0;
819 _unload_reported = false; // jvmti state
821 _lock_count = 0;
822 _stack_traversal_mark = 0;
824 // Copy contents of ScopeDescRecorder to nmethod
825 code_buffer->copy_oops_to(this);
826 debug_info->copy_to(this);
827 dependencies->copy_to(this);
828 if (ScavengeRootsInCode && detect_scavenge_root_oops()) {
829 CodeCache::add_scavenge_root_nmethod(this);
830 }
831 debug_only(verify_scavenge_root_oops());
833 CodeCache::commit(this);
835 VTune::create_nmethod(this);
837 // Copy contents of ExceptionHandlerTable to nmethod
838 handler_table->copy_to(this);
839 nul_chk_table->copy_to(this);
841 // we use the information of entry points to find out if a method is
842 // static or non static
843 assert(compiler->is_c2() ||
844 _method->is_static() == (entry_point() == _verified_entry_point),
845 " entry points must be same for static methods and vice versa");
846 }
848 bool printnmethods = PrintNMethods
849 || CompilerOracle::should_print(_method)
850 || CompilerOracle::has_option_string(_method, "PrintNMethods");
851 if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) {
852 print_nmethod(printnmethods);
853 }
855 // Note: Do not verify in here as the CodeCache_lock is
856 // taken which would conflict with the CompiledIC_lock
857 // which taken during the verification of call sites.
858 // (was bug - gri 10/25/99)
860 Events::log("Create nmethod " INTPTR_FORMAT, this);
861 }
864 // Print a short set of xml attributes to identify this nmethod. The
865 // output should be embedded in some other element.
866 void nmethod::log_identity(xmlStream* log) const {
867 log->print(" compile_id='%d'", compile_id());
868 const char* nm_kind = compile_kind();
869 if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind);
870 if (compiler() != NULL) {
871 log->print(" compiler='%s'", compiler()->name());
872 }
873 #ifdef TIERED
874 log->print(" level='%d'", comp_level());
875 #endif // TIERED
876 }
879 #define LOG_OFFSET(log, name) \
880 if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \
881 log->print(" " XSTR(name) "_offset='%d'" , \
882 (intptr_t)name##_begin() - (intptr_t)this)
885 void nmethod::log_new_nmethod() const {
886 if (LogCompilation && xtty != NULL) {
887 ttyLocker ttyl;
888 HandleMark hm;
889 xtty->begin_elem("nmethod");
890 log_identity(xtty);
891 xtty->print(" entry='" INTPTR_FORMAT "' size='%d'",
892 instructions_begin(), size());
893 xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this);
895 LOG_OFFSET(xtty, relocation);
896 LOG_OFFSET(xtty, code);
897 LOG_OFFSET(xtty, stub);
898 LOG_OFFSET(xtty, consts);
899 LOG_OFFSET(xtty, scopes_data);
900 LOG_OFFSET(xtty, scopes_pcs);
901 LOG_OFFSET(xtty, dependencies);
902 LOG_OFFSET(xtty, handler_table);
903 LOG_OFFSET(xtty, nul_chk_table);
904 LOG_OFFSET(xtty, oops);
906 xtty->method(method());
907 xtty->stamp();
908 xtty->end_elem();
909 }
910 }
912 #undef LOG_OFFSET
915 // Print out more verbose output usually for a newly created nmethod.
916 void nmethod::print_on(outputStream* st, const char* title) const {
917 if (st != NULL) {
918 ttyLocker ttyl;
919 // Print a little tag line that looks like +PrintCompilation output:
920 int tlen = (int) strlen(title);
921 bool do_nl = false;
922 if (tlen > 0 && title[tlen-1] == '\n') { tlen--; do_nl = true; }
923 st->print("%3d%c %.*s",
924 compile_id(),
925 is_osr_method() ? '%' :
926 method() != NULL &&
927 is_native_method() ? 'n' : ' ',
928 tlen, title);
929 #ifdef TIERED
930 st->print(" (%d) ", comp_level());
931 #endif // TIERED
932 if (WizardMode) st->print(" (" INTPTR_FORMAT ")", this);
933 if (Universe::heap()->is_gc_active() && method() != NULL) {
934 st->print("(method)");
935 } else if (method() != NULL) {
936 method()->print_short_name(st);
937 if (is_osr_method())
938 st->print(" @ %d", osr_entry_bci());
939 if (method()->code_size() > 0)
940 st->print(" (%d bytes)", method()->code_size());
941 }
943 if (do_nl) st->cr();
944 }
945 }
948 void nmethod::print_nmethod(bool printmethod) {
949 ttyLocker ttyl; // keep the following output all in one block
950 if (xtty != NULL) {
951 xtty->begin_head("print_nmethod");
952 xtty->stamp();
953 xtty->end_head();
954 }
955 // print the header part first
956 print();
957 // then print the requested information
958 if (printmethod) {
959 print_code();
960 print_pcs();
961 oop_maps()->print();
962 }
963 if (PrintDebugInfo) {
964 print_scopes();
965 }
966 if (PrintRelocations) {
967 print_relocations();
968 }
969 if (PrintDependencies) {
970 print_dependencies();
971 }
972 if (PrintExceptionHandlers) {
973 print_handler_table();
974 print_nul_chk_table();
975 }
976 if (xtty != NULL) {
977 xtty->tail("print_nmethod");
978 }
979 }
982 void nmethod::set_version(int v) {
983 flags.version = v;
984 }
987 ScopeDesc* nmethod::scope_desc_at(address pc) {
988 PcDesc* pd = pc_desc_at(pc);
989 guarantee(pd != NULL, "scope must be present");
990 return new ScopeDesc(this, pd->scope_decode_offset(),
991 pd->obj_decode_offset(), pd->should_reexecute());
992 }
995 void nmethod::clear_inline_caches() {
996 assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint");
997 if (is_zombie()) {
998 return;
999 }
1001 RelocIterator iter(this);
1002 while (iter.next()) {
1003 iter.reloc()->clear_inline_cache();
1004 }
1005 }
1008 void nmethod::cleanup_inline_caches() {
1010 assert(SafepointSynchronize::is_at_safepoint() &&
1011 !CompiledIC_lock->is_locked() &&
1012 !Patching_lock->is_locked(), "no threads must be updating the inline caches by them selfs");
1014 // If the method is not entrant or zombie then a JMP is plastered over the
1015 // first few bytes. If an oop in the old code was there, that oop
1016 // should not get GC'd. Skip the first few bytes of oops on
1017 // not-entrant methods.
1018 address low_boundary = verified_entry_point();
1019 if (!is_in_use()) {
1020 low_boundary += NativeJump::instruction_size;
1021 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1022 // This means that the low_boundary is going to be a little too high.
1023 // This shouldn't matter, since oops of non-entrant methods are never used.
1024 // In fact, why are we bothering to look at oops in a non-entrant method??
1025 }
1027 // Find all calls in an nmethod, and clear the ones that points to zombie methods
1028 ResourceMark rm;
1029 RelocIterator iter(this, low_boundary);
1030 while(iter.next()) {
1031 switch(iter.type()) {
1032 case relocInfo::virtual_call_type:
1033 case relocInfo::opt_virtual_call_type: {
1034 CompiledIC *ic = CompiledIC_at(iter.reloc());
1035 // Ok, to lookup references to zombies here
1036 CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination());
1037 if( cb != NULL && cb->is_nmethod() ) {
1038 nmethod* nm = (nmethod*)cb;
1039 // Clean inline caches pointing to both zombie and not_entrant methods
1040 if (!nm->is_in_use() || (nm->method()->code() != nm)) ic->set_to_clean();
1041 }
1042 break;
1043 }
1044 case relocInfo::static_call_type: {
1045 CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc());
1046 CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination());
1047 if( cb != NULL && cb->is_nmethod() ) {
1048 nmethod* nm = (nmethod*)cb;
1049 // Clean inline caches pointing to both zombie and not_entrant methods
1050 if (!nm->is_in_use() || (nm->method()->code() != nm)) csc->set_to_clean();
1051 }
1052 break;
1053 }
1054 }
1055 }
1056 }
1058 // This is a private interface with the sweeper.
1059 void nmethod::mark_as_seen_on_stack() {
1060 assert(is_not_entrant(), "must be a non-entrant method");
1061 set_stack_traversal_mark(NMethodSweeper::traversal_count());
1062 }
1064 // Tell if a non-entrant method can be converted to a zombie (i.e., there is no activations on the stack)
1065 bool nmethod::can_not_entrant_be_converted() {
1066 assert(is_not_entrant(), "must be a non-entrant method");
1067 assert(SafepointSynchronize::is_at_safepoint(), "must be called during a safepoint");
1069 // Since the nmethod sweeper only does partial sweep the sweeper's traversal
1070 // count can be greater than the stack traversal count before it hits the
1071 // nmethod for the second time.
1072 return stack_traversal_mark()+1 < NMethodSweeper::traversal_count();
1073 }
1075 void nmethod::inc_decompile_count() {
1076 // Could be gated by ProfileTraps, but do not bother...
1077 methodOop m = method();
1078 if (m == NULL) return;
1079 methodDataOop mdo = m->method_data();
1080 if (mdo == NULL) return;
1081 // There is a benign race here. See comments in methodDataOop.hpp.
1082 mdo->inc_decompile_count();
1083 }
1085 void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) {
1087 post_compiled_method_unload();
1089 // Since this nmethod is being unloaded, make sure that dependencies
1090 // recorded in instanceKlasses get flushed and pass non-NULL closure to
1091 // indicate that this work is being done during a GC.
1092 assert(Universe::heap()->is_gc_active(), "should only be called during gc");
1093 assert(is_alive != NULL, "Should be non-NULL");
1094 // A non-NULL is_alive closure indicates that this is being called during GC.
1095 flush_dependencies(is_alive);
1097 // Break cycle between nmethod & method
1098 if (TraceClassUnloading && WizardMode) {
1099 tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT
1100 " unloadable], methodOop(" INTPTR_FORMAT
1101 "), cause(" INTPTR_FORMAT ")",
1102 this, (address)_method, (address)cause);
1103 if (!Universe::heap()->is_gc_active())
1104 cause->klass()->print();
1105 }
1106 // Unlink the osr method, so we do not look this up again
1107 if (is_osr_method()) {
1108 invalidate_osr_method();
1109 }
1110 // If _method is already NULL the methodOop is about to be unloaded,
1111 // so we don't have to break the cycle. Note that it is possible to
1112 // have the methodOop live here, in case we unload the nmethod because
1113 // it is pointing to some oop (other than the methodOop) being unloaded.
1114 if (_method != NULL) {
1115 // OSR methods point to the methodOop, but the methodOop does not
1116 // point back!
1117 if (_method->code() == this) {
1118 _method->clear_code(); // Break a cycle
1119 }
1120 inc_decompile_count(); // Last chance to make a mark on the MDO
1121 _method = NULL; // Clear the method of this dead nmethod
1122 }
1123 // Make the class unloaded - i.e., change state and notify sweeper
1124 check_safepoint();
1125 if (is_in_use()) {
1126 // Transitioning directly from live to unloaded -- so
1127 // we need to force a cache clean-up; remember this
1128 // for later on.
1129 CodeCache::set_needs_cache_clean(true);
1130 }
1131 flags.state = unloaded;
1133 // Log the unloading.
1134 log_state_change();
1136 // The methodOop is gone at this point
1137 assert(_method == NULL, "Tautology");
1139 set_osr_link(NULL);
1140 //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods
1141 NMethodSweeper::notify(this);
1142 }
1144 void nmethod::invalidate_osr_method() {
1145 assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
1146 // Remove from list of active nmethods
1147 if (method() != NULL)
1148 instanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this);
1149 // Set entry as invalid
1150 _entry_bci = InvalidOSREntryBci;
1151 }
1153 void nmethod::log_state_change() const {
1154 if (LogCompilation) {
1155 if (xtty != NULL) {
1156 ttyLocker ttyl; // keep the following output all in one block
1157 if (flags.state == unloaded) {
1158 xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'",
1159 os::current_thread_id());
1160 } else {
1161 xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s",
1162 os::current_thread_id(),
1163 (flags.state == zombie ? " zombie='1'" : ""));
1164 }
1165 log_identity(xtty);
1166 xtty->stamp();
1167 xtty->end_elem();
1168 }
1169 }
1170 if (PrintCompilation && flags.state != unloaded) {
1171 print_on(tty, flags.state == zombie ? "made zombie " : "made not entrant ");
1172 tty->cr();
1173 }
1174 }
1176 // Common functionality for both make_not_entrant and make_zombie
1177 bool nmethod::make_not_entrant_or_zombie(unsigned int state) {
1178 assert(state == zombie || state == not_entrant, "must be zombie or not_entrant");
1180 // If the method is already zombie there is nothing to do
1181 if (is_zombie()) {
1182 return false;
1183 }
1185 // Make sure the nmethod is not flushed in case of a safepoint in code below.
1186 nmethodLocker nml(this);
1188 {
1189 // invalidate osr nmethod before acquiring the patching lock since
1190 // they both acquire leaf locks and we don't want a deadlock.
1191 // This logic is equivalent to the logic below for patching the
1192 // verified entry point of regular methods.
1193 if (is_osr_method()) {
1194 // this effectively makes the osr nmethod not entrant
1195 invalidate_osr_method();
1196 }
1198 // Enter critical section. Does not block for safepoint.
1199 MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag);
1201 if (flags.state == state) {
1202 // another thread already performed this transition so nothing
1203 // to do, but return false to indicate this.
1204 return false;
1205 }
1207 // The caller can be calling the method statically or through an inline
1208 // cache call.
1209 if (!is_osr_method() && !is_not_entrant()) {
1210 NativeJump::patch_verified_entry(entry_point(), verified_entry_point(),
1211 SharedRuntime::get_handle_wrong_method_stub());
1212 assert (NativeJump::instruction_size == nmethod::_zombie_instruction_size, "");
1213 }
1215 // When the nmethod becomes zombie it is no longer alive so the
1216 // dependencies must be flushed. nmethods in the not_entrant
1217 // state will be flushed later when the transition to zombie
1218 // happens or they get unloaded.
1219 if (state == zombie) {
1220 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1221 flush_dependencies(NULL);
1222 } else {
1223 assert(state == not_entrant, "other cases may need to be handled differently");
1224 }
1226 // Change state
1227 flags.state = state;
1229 // Log the transition once
1230 log_state_change();
1232 } // leave critical region under Patching_lock
1234 if (state == not_entrant) {
1235 Events::log("Make nmethod not entrant " INTPTR_FORMAT, this);
1236 } else {
1237 Events::log("Make nmethod zombie " INTPTR_FORMAT, this);
1238 }
1240 if (TraceCreateZombies) {
1241 tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie");
1242 }
1244 // Make sweeper aware that there is a zombie method that needs to be removed
1245 NMethodSweeper::notify(this);
1247 // not_entrant only stuff
1248 if (state == not_entrant) {
1249 mark_as_seen_on_stack();
1250 }
1252 // It's a true state change, so mark the method as decompiled.
1253 inc_decompile_count();
1255 // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload event
1256 // and it hasn't already been reported for this nmethod then report it now.
1257 // (the event may have been reported earilier if the GC marked it for unloading).
1258 if (state == zombie) {
1260 DTRACE_METHOD_UNLOAD_PROBE(method());
1262 if (JvmtiExport::should_post_compiled_method_unload() &&
1263 !unload_reported()) {
1264 assert(method() != NULL, "checking");
1265 {
1266 HandleMark hm;
1267 JvmtiExport::post_compiled_method_unload_at_safepoint(
1268 method()->jmethod_id(), code_begin());
1269 }
1270 set_unload_reported();
1271 }
1272 }
1275 // Zombie only stuff
1276 if (state == zombie) {
1277 VTune::delete_nmethod(this);
1278 }
1280 // Check whether method got unloaded at a safepoint before this,
1281 // if so we can skip the flushing steps below
1282 if (method() == NULL) return true;
1284 // Remove nmethod from method.
1285 // We need to check if both the _code and _from_compiled_code_entry_point
1286 // refer to this nmethod because there is a race in setting these two fields
1287 // in methodOop as seen in bugid 4947125.
1288 // If the vep() points to the zombie nmethod, the memory for the nmethod
1289 // could be flushed and the compiler and vtable stubs could still call
1290 // through it.
1291 if (method()->code() == this ||
1292 method()->from_compiled_entry() == verified_entry_point()) {
1293 HandleMark hm;
1294 method()->clear_code();
1295 }
1297 return true;
1298 }
1301 #ifndef PRODUCT
1302 void nmethod::check_safepoint() {
1303 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
1304 }
1305 #endif
1308 void nmethod::flush() {
1309 // Note that there are no valid oops in the nmethod anymore.
1310 assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method");
1311 assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation");
1313 assert (!is_locked_by_vm(), "locked methods shouldn't be flushed");
1314 check_safepoint();
1316 // completely deallocate this method
1317 EventMark m("flushing nmethod " INTPTR_FORMAT " %s", this, "");
1318 if (PrintMethodFlushing) {
1319 tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb",
1320 _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024);
1321 }
1323 // We need to deallocate any ExceptionCache data.
1324 // Note that we do not need to grab the nmethod lock for this, it
1325 // better be thread safe if we're disposing of it!
1326 ExceptionCache* ec = exception_cache();
1327 set_exception_cache(NULL);
1328 while(ec != NULL) {
1329 ExceptionCache* next = ec->next();
1330 delete ec;
1331 ec = next;
1332 }
1334 if (on_scavenge_root_list()) {
1335 CodeCache::drop_scavenge_root_nmethod(this);
1336 }
1338 if (is_speculatively_disconnected()) {
1339 CodeCache::remove_saved_code(this);
1340 }
1342 ((CodeBlob*)(this))->flush();
1344 CodeCache::free(this);
1345 }
1348 //
1349 // Notify all classes this nmethod is dependent on that it is no
1350 // longer dependent. This should only be called in two situations.
1351 // First, when a nmethod transitions to a zombie all dependents need
1352 // to be clear. Since zombification happens at a safepoint there's no
1353 // synchronization issues. The second place is a little more tricky.
1354 // During phase 1 of mark sweep class unloading may happen and as a
1355 // result some nmethods may get unloaded. In this case the flushing
1356 // of dependencies must happen during phase 1 since after GC any
1357 // dependencies in the unloaded nmethod won't be updated, so
1358 // traversing the dependency information in unsafe. In that case this
1359 // function is called with a non-NULL argument and this function only
1360 // notifies instanceKlasses that are reachable
1362 void nmethod::flush_dependencies(BoolObjectClosure* is_alive) {
1363 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1364 assert(Universe::heap()->is_gc_active() == (is_alive != NULL),
1365 "is_alive is non-NULL if and only if we are called during GC");
1366 if (!has_flushed_dependencies()) {
1367 set_has_flushed_dependencies();
1368 for (Dependencies::DepStream deps(this); deps.next(); ) {
1369 klassOop klass = deps.context_type();
1370 if (klass == NULL) continue; // ignore things like evol_method
1372 // During GC the is_alive closure is non-NULL, and is used to
1373 // determine liveness of dependees that need to be updated.
1374 if (is_alive == NULL || is_alive->do_object_b(klass)) {
1375 instanceKlass::cast(klass)->remove_dependent_nmethod(this);
1376 }
1377 }
1378 }
1379 }
1382 // If this oop is not live, the nmethod can be unloaded.
1383 bool nmethod::can_unload(BoolObjectClosure* is_alive,
1384 OopClosure* keep_alive,
1385 oop* root, bool unloading_occurred) {
1386 assert(root != NULL, "just checking");
1387 oop obj = *root;
1388 if (obj == NULL || is_alive->do_object_b(obj)) {
1389 return false;
1390 }
1391 if (obj->is_compiledICHolder()) {
1392 compiledICHolderOop cichk_oop = compiledICHolderOop(obj);
1393 if (is_alive->do_object_b(
1394 cichk_oop->holder_method()->method_holder()) &&
1395 is_alive->do_object_b(cichk_oop->holder_klass())) {
1396 // The oop should be kept alive
1397 keep_alive->do_oop(root);
1398 return false;
1399 }
1400 }
1401 // If ScavengeRootsInCode is true, an nmethod might be unloaded
1402 // simply because one of its constant oops has gone dead.
1403 // No actual classes need to be unloaded in order for this to occur.
1404 assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading");
1405 make_unloaded(is_alive, obj);
1406 return true;
1407 }
1409 // ------------------------------------------------------------------
1410 // post_compiled_method_load_event
1411 // new method for install_code() path
1412 // Transfer information from compilation to jvmti
1413 void nmethod::post_compiled_method_load_event() {
1415 methodOop moop = method();
1416 HS_DTRACE_PROBE8(hotspot, compiled__method__load,
1417 moop->klass_name()->bytes(),
1418 moop->klass_name()->utf8_length(),
1419 moop->name()->bytes(),
1420 moop->name()->utf8_length(),
1421 moop->signature()->bytes(),
1422 moop->signature()->utf8_length(),
1423 code_begin(), code_size());
1425 if (JvmtiExport::should_post_compiled_method_load()) {
1426 JvmtiExport::post_compiled_method_load(this);
1427 }
1428 }
1430 void nmethod::post_compiled_method_unload() {
1431 assert(_method != NULL && !is_unloaded(), "just checking");
1432 DTRACE_METHOD_UNLOAD_PROBE(method());
1434 // If a JVMTI agent has enabled the CompiledMethodUnload event then
1435 // post the event. Sometime later this nmethod will be made a zombie by
1436 // the sweeper but the methodOop will not be valid at that point.
1437 if (JvmtiExport::should_post_compiled_method_unload()) {
1438 assert(!unload_reported(), "already unloaded");
1439 HandleMark hm;
1440 JvmtiExport::post_compiled_method_unload_at_safepoint(
1441 method()->jmethod_id(), code_begin());
1442 }
1444 // The JVMTI CompiledMethodUnload event can be enabled or disabled at
1445 // any time. As the nmethod is being unloaded now we mark it has
1446 // having the unload event reported - this will ensure that we don't
1447 // attempt to report the event in the unlikely scenario where the
1448 // event is enabled at the time the nmethod is made a zombie.
1449 set_unload_reported();
1450 }
1452 // This is called at the end of the strong tracing/marking phase of a
1453 // GC to unload an nmethod if it contains otherwise unreachable
1454 // oops.
1456 void nmethod::do_unloading(BoolObjectClosure* is_alive,
1457 OopClosure* keep_alive, bool unloading_occurred) {
1458 // Make sure the oop's ready to receive visitors
1459 assert(!is_zombie() && !is_unloaded(),
1460 "should not call follow on zombie or unloaded nmethod");
1462 // If the method is not entrant then a JMP is plastered over the
1463 // first few bytes. If an oop in the old code was there, that oop
1464 // should not get GC'd. Skip the first few bytes of oops on
1465 // not-entrant methods.
1466 address low_boundary = verified_entry_point();
1467 if (is_not_entrant()) {
1468 low_boundary += NativeJump::instruction_size;
1469 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1470 // (See comment above.)
1471 }
1473 // The RedefineClasses() API can cause the class unloading invariant
1474 // to no longer be true. See jvmtiExport.hpp for details.
1475 // Also, leave a debugging breadcrumb in local flag.
1476 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1477 if (a_class_was_redefined) {
1478 // This set of the unloading_occurred flag is done before the
1479 // call to post_compiled_method_unload() so that the unloading
1480 // of this nmethod is reported.
1481 unloading_occurred = true;
1482 }
1484 // Follow methodOop
1485 if (can_unload(is_alive, keep_alive, (oop*)&_method, unloading_occurred)) {
1486 return;
1487 }
1489 // Exception cache
1490 ExceptionCache* ec = exception_cache();
1491 while (ec != NULL) {
1492 oop* ex_addr = (oop*)ec->exception_type_addr();
1493 oop ex = *ex_addr;
1494 ExceptionCache* next_ec = ec->next();
1495 if (ex != NULL && !is_alive->do_object_b(ex)) {
1496 assert(!ex->is_compiledICHolder(), "Possible error here");
1497 remove_from_exception_cache(ec);
1498 }
1499 ec = next_ec;
1500 }
1502 // If class unloading occurred we first iterate over all inline caches and
1503 // clear ICs where the cached oop is referring to an unloaded klass or method.
1504 // The remaining live cached oops will be traversed in the relocInfo::oop_type
1505 // iteration below.
1506 if (unloading_occurred) {
1507 RelocIterator iter(this, low_boundary);
1508 while(iter.next()) {
1509 if (iter.type() == relocInfo::virtual_call_type) {
1510 CompiledIC *ic = CompiledIC_at(iter.reloc());
1511 oop ic_oop = ic->cached_oop();
1512 if (ic_oop != NULL && !is_alive->do_object_b(ic_oop)) {
1513 // The only exception is compiledICHolder oops which may
1514 // yet be marked below. (We check this further below).
1515 if (ic_oop->is_compiledICHolder()) {
1516 compiledICHolderOop cichk_oop = compiledICHolderOop(ic_oop);
1517 if (is_alive->do_object_b(
1518 cichk_oop->holder_method()->method_holder()) &&
1519 is_alive->do_object_b(cichk_oop->holder_klass())) {
1520 continue;
1521 }
1522 }
1523 ic->set_to_clean();
1524 assert(ic->cached_oop() == NULL, "cached oop in IC should be cleared")
1525 }
1526 }
1527 }
1528 }
1530 // Compiled code
1531 RelocIterator iter(this, low_boundary);
1532 while (iter.next()) {
1533 if (iter.type() == relocInfo::oop_type) {
1534 oop_Relocation* r = iter.oop_reloc();
1535 // In this loop, we must only traverse those oops directly embedded in
1536 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1537 assert(1 == (r->oop_is_immediate()) +
1538 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1539 "oop must be found in exactly one place");
1540 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1541 if (can_unload(is_alive, keep_alive, r->oop_addr(), unloading_occurred)) {
1542 return;
1543 }
1544 }
1545 }
1546 }
1549 // Scopes
1550 for (oop* p = oops_begin(); p < oops_end(); p++) {
1551 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1552 if (can_unload(is_alive, keep_alive, p, unloading_occurred)) {
1553 return;
1554 }
1555 }
1557 #ifndef PRODUCT
1558 // This nmethod was not unloaded; check below that all CompiledICs
1559 // refer to marked oops.
1560 {
1561 RelocIterator iter(this, low_boundary);
1562 while (iter.next()) {
1563 if (iter.type() == relocInfo::virtual_call_type) {
1564 CompiledIC *ic = CompiledIC_at(iter.reloc());
1565 oop ic_oop = ic->cached_oop();
1566 assert(ic_oop == NULL || is_alive->do_object_b(ic_oop),
1567 "Found unmarked ic_oop in reachable nmethod");
1568 }
1569 }
1570 }
1571 #endif // !PRODUCT
1572 }
1574 // This method is called twice during GC -- once while
1575 // tracing the "active" nmethods on thread stacks during
1576 // the (strong) marking phase, and then again when walking
1577 // the code cache contents during the weak roots processing
1578 // phase. The two uses are distinguished by means of the
1579 // 'do_strong_roots_only' flag, which is true in the first
1580 // case. We want to walk the weak roots in the nmethod
1581 // only in the second case. The weak roots in the nmethod
1582 // are the oops in the ExceptionCache and the InlineCache
1583 // oops.
1584 void nmethod::oops_do(OopClosure* f, bool do_strong_roots_only) {
1585 // make sure the oops ready to receive visitors
1586 assert(!is_zombie() && !is_unloaded(),
1587 "should not call follow on zombie or unloaded nmethod");
1589 // If the method is not entrant or zombie then a JMP is plastered over the
1590 // first few bytes. If an oop in the old code was there, that oop
1591 // should not get GC'd. Skip the first few bytes of oops on
1592 // not-entrant methods.
1593 address low_boundary = verified_entry_point();
1594 if (is_not_entrant()) {
1595 low_boundary += NativeJump::instruction_size;
1596 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1597 // (See comment above.)
1598 }
1600 // Compiled code
1601 f->do_oop((oop*) &_method);
1602 if (!do_strong_roots_only) {
1603 // weak roots processing phase -- update ExceptionCache oops
1604 ExceptionCache* ec = exception_cache();
1605 while(ec != NULL) {
1606 f->do_oop((oop*)ec->exception_type_addr());
1607 ec = ec->next();
1608 }
1609 } // Else strong roots phase -- skip oops in ExceptionCache
1611 RelocIterator iter(this, low_boundary);
1613 while (iter.next()) {
1614 if (iter.type() == relocInfo::oop_type ) {
1615 oop_Relocation* r = iter.oop_reloc();
1616 // In this loop, we must only follow those oops directly embedded in
1617 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1618 assert(1 == (r->oop_is_immediate()) +
1619 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1620 "oop must be found in exactly one place");
1621 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1622 f->do_oop(r->oop_addr());
1623 }
1624 }
1625 }
1627 // Scopes
1628 // This includes oop constants not inlined in the code stream.
1629 for (oop* p = oops_begin(); p < oops_end(); p++) {
1630 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1631 f->do_oop(p);
1632 }
1633 }
1635 #define NMETHOD_SENTINEL ((nmethod*)badAddress)
1637 nmethod* volatile nmethod::_oops_do_mark_nmethods;
1639 // An nmethod is "marked" if its _mark_link is set non-null.
1640 // Even if it is the end of the linked list, it will have a non-null link value,
1641 // as long as it is on the list.
1642 // This code must be MP safe, because it is used from parallel GC passes.
1643 bool nmethod::test_set_oops_do_mark() {
1644 assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
1645 nmethod* observed_mark_link = _oops_do_mark_link;
1646 if (observed_mark_link == NULL) {
1647 // Claim this nmethod for this thread to mark.
1648 observed_mark_link = (nmethod*)
1649 Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL);
1650 if (observed_mark_link == NULL) {
1652 // Atomically append this nmethod (now claimed) to the head of the list:
1653 nmethod* observed_mark_nmethods = _oops_do_mark_nmethods;
1654 for (;;) {
1655 nmethod* required_mark_nmethods = observed_mark_nmethods;
1656 _oops_do_mark_link = required_mark_nmethods;
1657 observed_mark_nmethods = (nmethod*)
1658 Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods);
1659 if (observed_mark_nmethods == required_mark_nmethods)
1660 break;
1661 }
1662 // Mark was clear when we first saw this guy.
1663 NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark\n"));
1664 return false;
1665 }
1666 }
1667 // On fall through, another racing thread marked this nmethod before we did.
1668 return true;
1669 }
1671 void nmethod::oops_do_marking_prologue() {
1672 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue"));
1673 assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row");
1674 // We use cmpxchg_ptr instead of regular assignment here because the user
1675 // may fork a bunch of threads, and we need them all to see the same state.
1676 void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL);
1677 guarantee(observed == NULL, "no races in this sequential code");
1678 }
1680 void nmethod::oops_do_marking_epilogue() {
1681 assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row");
1682 nmethod* cur = _oops_do_mark_nmethods;
1683 while (cur != NMETHOD_SENTINEL) {
1684 assert(cur != NULL, "not NULL-terminated");
1685 nmethod* next = cur->_oops_do_mark_link;
1686 cur->_oops_do_mark_link = NULL;
1687 NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark\n"));
1688 cur = next;
1689 }
1690 void* required = _oops_do_mark_nmethods;
1691 void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required);
1692 guarantee(observed == required, "no races in this sequential code");
1693 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]"));
1694 }
1696 class DetectScavengeRoot: public OopClosure {
1697 bool _detected_scavenge_root;
1698 public:
1699 DetectScavengeRoot() : _detected_scavenge_root(false)
1700 { NOT_PRODUCT(_print_nm = NULL); }
1701 bool detected_scavenge_root() { return _detected_scavenge_root; }
1702 virtual void do_oop(oop* p) {
1703 if ((*p) != NULL && (*p)->is_scavengable()) {
1704 NOT_PRODUCT(maybe_print(p));
1705 _detected_scavenge_root = true;
1706 }
1707 }
1708 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
1710 #ifndef PRODUCT
1711 nmethod* _print_nm;
1712 void maybe_print(oop* p) {
1713 if (_print_nm == NULL) return;
1714 if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root");
1715 tty->print_cr(""PTR_FORMAT"[offset=%d] detected non-perm oop "PTR_FORMAT" (found at "PTR_FORMAT")",
1716 _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm),
1717 (intptr_t)(*p), (intptr_t)p);
1718 (*p)->print();
1719 }
1720 #endif //PRODUCT
1721 };
1723 bool nmethod::detect_scavenge_root_oops() {
1724 DetectScavengeRoot detect_scavenge_root;
1725 NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this);
1726 oops_do(&detect_scavenge_root);
1727 return detect_scavenge_root.detected_scavenge_root();
1728 }
1730 // Method that knows how to preserve outgoing arguments at call. This method must be
1731 // called with a frame corresponding to a Java invoke
1732 void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) {
1733 if (!method()->is_native()) {
1734 SimpleScopeDesc ssd(this, fr.pc());
1735 Bytecode_invoke* call = Bytecode_invoke_at(ssd.method(), ssd.bci());
1736 bool has_receiver = call->has_receiver();
1737 symbolOop signature = call->signature();
1738 fr.oops_compiled_arguments_do(signature, has_receiver, reg_map, f);
1739 }
1740 }
1743 oop nmethod::embeddedOop_at(u_char* p) {
1744 RelocIterator iter(this, p, p + oopSize);
1745 while (iter.next())
1746 if (iter.type() == relocInfo::oop_type) {
1747 return iter.oop_reloc()->oop_value();
1748 }
1749 return NULL;
1750 }
1753 inline bool includes(void* p, void* from, void* to) {
1754 return from <= p && p < to;
1755 }
1758 void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) {
1759 assert(count >= 2, "must be sentinel values, at least");
1761 #ifdef ASSERT
1762 // must be sorted and unique; we do a binary search in find_pc_desc()
1763 int prev_offset = pcs[0].pc_offset();
1764 assert(prev_offset == PcDesc::lower_offset_limit,
1765 "must start with a sentinel");
1766 for (int i = 1; i < count; i++) {
1767 int this_offset = pcs[i].pc_offset();
1768 assert(this_offset > prev_offset, "offsets must be sorted");
1769 prev_offset = this_offset;
1770 }
1771 assert(prev_offset == PcDesc::upper_offset_limit,
1772 "must end with a sentinel");
1773 #endif //ASSERT
1775 // Search for MethodHandle invokes and tag the nmethod.
1776 for (int i = 0; i < count; i++) {
1777 if (pcs[i].is_method_handle_invoke()) {
1778 set_has_method_handle_invokes(true);
1779 break;
1780 }
1781 }
1783 int size = count * sizeof(PcDesc);
1784 assert(scopes_pcs_size() >= size, "oob");
1785 memcpy(scopes_pcs_begin(), pcs, size);
1787 // Adjust the final sentinel downward.
1788 PcDesc* last_pc = &scopes_pcs_begin()[count-1];
1789 assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity");
1790 last_pc->set_pc_offset(instructions_size() + 1);
1791 for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) {
1792 // Fill any rounding gaps with copies of the last record.
1793 last_pc[1] = last_pc[0];
1794 }
1795 // The following assert could fail if sizeof(PcDesc) is not
1796 // an integral multiple of oopSize (the rounding term).
1797 // If it fails, change the logic to always allocate a multiple
1798 // of sizeof(PcDesc), and fill unused words with copies of *last_pc.
1799 assert(last_pc + 1 == scopes_pcs_end(), "must match exactly");
1800 }
1802 void nmethod::copy_scopes_data(u_char* buffer, int size) {
1803 assert(scopes_data_size() >= size, "oob");
1804 memcpy(scopes_data_begin(), buffer, size);
1805 }
1808 #ifdef ASSERT
1809 static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) {
1810 PcDesc* lower = nm->scopes_pcs_begin();
1811 PcDesc* upper = nm->scopes_pcs_end();
1812 lower += 1; // exclude initial sentinel
1813 PcDesc* res = NULL;
1814 for (PcDesc* p = lower; p < upper; p++) {
1815 NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc
1816 if (match_desc(p, pc_offset, approximate)) {
1817 if (res == NULL)
1818 res = p;
1819 else
1820 res = (PcDesc*) badAddress;
1821 }
1822 }
1823 return res;
1824 }
1825 #endif
1828 // Finds a PcDesc with real-pc equal to "pc"
1829 PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) {
1830 address base_address = instructions_begin();
1831 if ((pc < base_address) ||
1832 (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) {
1833 return NULL; // PC is wildly out of range
1834 }
1835 int pc_offset = (int) (pc - base_address);
1837 // Check the PcDesc cache if it contains the desired PcDesc
1838 // (This as an almost 100% hit rate.)
1839 PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate);
1840 if (res != NULL) {
1841 assert(res == linear_search(this, pc_offset, approximate), "cache ok");
1842 return res;
1843 }
1845 // Fallback algorithm: quasi-linear search for the PcDesc
1846 // Find the last pc_offset less than the given offset.
1847 // The successor must be the required match, if there is a match at all.
1848 // (Use a fixed radix to avoid expensive affine pointer arithmetic.)
1849 PcDesc* lower = scopes_pcs_begin();
1850 PcDesc* upper = scopes_pcs_end();
1851 upper -= 1; // exclude final sentinel
1852 if (lower >= upper) return NULL; // native method; no PcDescs at all
1854 #define assert_LU_OK \
1855 /* invariant on lower..upper during the following search: */ \
1856 assert(lower->pc_offset() < pc_offset, "sanity"); \
1857 assert(upper->pc_offset() >= pc_offset, "sanity")
1858 assert_LU_OK;
1860 // Use the last successful return as a split point.
1861 PcDesc* mid = _pc_desc_cache.last_pc_desc();
1862 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1863 if (mid->pc_offset() < pc_offset) {
1864 lower = mid;
1865 } else {
1866 upper = mid;
1867 }
1869 // Take giant steps at first (4096, then 256, then 16, then 1)
1870 const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1);
1871 const int RADIX = (1 << LOG2_RADIX);
1872 for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) {
1873 while ((mid = lower + step) < upper) {
1874 assert_LU_OK;
1875 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1876 if (mid->pc_offset() < pc_offset) {
1877 lower = mid;
1878 } else {
1879 upper = mid;
1880 break;
1881 }
1882 }
1883 assert_LU_OK;
1884 }
1886 // Sneak up on the value with a linear search of length ~16.
1887 while (true) {
1888 assert_LU_OK;
1889 mid = lower + 1;
1890 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1891 if (mid->pc_offset() < pc_offset) {
1892 lower = mid;
1893 } else {
1894 upper = mid;
1895 break;
1896 }
1897 }
1898 #undef assert_LU_OK
1900 if (match_desc(upper, pc_offset, approximate)) {
1901 assert(upper == linear_search(this, pc_offset, approximate), "search ok");
1902 _pc_desc_cache.add_pc_desc(upper);
1903 return upper;
1904 } else {
1905 assert(NULL == linear_search(this, pc_offset, approximate), "search ok");
1906 return NULL;
1907 }
1908 }
1911 bool nmethod::check_all_dependencies() {
1912 bool found_check = false;
1913 // wholesale check of all dependencies
1914 for (Dependencies::DepStream deps(this); deps.next(); ) {
1915 if (deps.check_dependency() != NULL) {
1916 found_check = true;
1917 NOT_DEBUG(break);
1918 }
1919 }
1920 return found_check; // tell caller if we found anything
1921 }
1923 bool nmethod::check_dependency_on(DepChange& changes) {
1924 // What has happened:
1925 // 1) a new class dependee has been added
1926 // 2) dependee and all its super classes have been marked
1927 bool found_check = false; // set true if we are upset
1928 for (Dependencies::DepStream deps(this); deps.next(); ) {
1929 // Evaluate only relevant dependencies.
1930 if (deps.spot_check_dependency_at(changes) != NULL) {
1931 found_check = true;
1932 NOT_DEBUG(break);
1933 }
1934 }
1935 return found_check;
1936 }
1938 bool nmethod::is_evol_dependent_on(klassOop dependee) {
1939 instanceKlass *dependee_ik = instanceKlass::cast(dependee);
1940 objArrayOop dependee_methods = dependee_ik->methods();
1941 for (Dependencies::DepStream deps(this); deps.next(); ) {
1942 if (deps.type() == Dependencies::evol_method) {
1943 methodOop method = deps.method_argument(0);
1944 for (int j = 0; j < dependee_methods->length(); j++) {
1945 if ((methodOop) dependee_methods->obj_at(j) == method) {
1946 // RC_TRACE macro has an embedded ResourceMark
1947 RC_TRACE(0x01000000,
1948 ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)",
1949 _method->method_holder()->klass_part()->external_name(),
1950 _method->name()->as_C_string(),
1951 _method->signature()->as_C_string(), compile_id(),
1952 method->method_holder()->klass_part()->external_name(),
1953 method->name()->as_C_string(),
1954 method->signature()->as_C_string()));
1955 if (TraceDependencies || LogCompilation)
1956 deps.log_dependency(dependee);
1957 return true;
1958 }
1959 }
1960 }
1961 }
1962 return false;
1963 }
1965 // Called from mark_for_deoptimization, when dependee is invalidated.
1966 bool nmethod::is_dependent_on_method(methodOop dependee) {
1967 for (Dependencies::DepStream deps(this); deps.next(); ) {
1968 if (deps.type() != Dependencies::evol_method)
1969 continue;
1970 methodOop method = deps.method_argument(0);
1971 if (method == dependee) return true;
1972 }
1973 return false;
1974 }
1977 bool nmethod::is_patchable_at(address instr_addr) {
1978 assert (code_contains(instr_addr), "wrong nmethod used");
1979 if (is_zombie()) {
1980 // a zombie may never be patched
1981 return false;
1982 }
1983 return true;
1984 }
1987 address nmethod::continuation_for_implicit_exception(address pc) {
1988 // Exception happened outside inline-cache check code => we are inside
1989 // an active nmethod => use cpc to determine a return address
1990 int exception_offset = pc - instructions_begin();
1991 int cont_offset = ImplicitExceptionTable(this).at( exception_offset );
1992 #ifdef ASSERT
1993 if (cont_offset == 0) {
1994 Thread* thread = ThreadLocalStorage::get_thread_slow();
1995 ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
1996 HandleMark hm(thread);
1997 ResourceMark rm(thread);
1998 CodeBlob* cb = CodeCache::find_blob(pc);
1999 assert(cb != NULL && cb == this, "");
2000 tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc);
2001 print();
2002 method()->print_codes();
2003 print_code();
2004 print_pcs();
2005 }
2006 #endif
2007 guarantee(cont_offset != 0, "unhandled implicit exception in compiled code");
2008 return instructions_begin() + cont_offset;
2009 }
2013 void nmethod_init() {
2014 // make sure you didn't forget to adjust the filler fields
2015 assert(sizeof(nmFlags) <= 4, "nmFlags occupies more than a word");
2016 assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word");
2017 }
2020 //-------------------------------------------------------------------------------------------
2023 // QQQ might we make this work from a frame??
2024 nmethodLocker::nmethodLocker(address pc) {
2025 CodeBlob* cb = CodeCache::find_blob(pc);
2026 guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found");
2027 _nm = (nmethod*)cb;
2028 lock_nmethod(_nm);
2029 }
2031 void nmethodLocker::lock_nmethod(nmethod* nm) {
2032 if (nm == NULL) return;
2033 Atomic::inc(&nm->_lock_count);
2034 guarantee(!nm->is_zombie(), "cannot lock a zombie method");
2035 }
2037 void nmethodLocker::unlock_nmethod(nmethod* nm) {
2038 if (nm == NULL) return;
2039 Atomic::dec(&nm->_lock_count);
2040 guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock");
2041 }
2044 // -----------------------------------------------------------------------------
2045 // nmethod::get_deopt_original_pc
2046 //
2047 // Return the original PC for the given PC if:
2048 // (a) the given PC belongs to a nmethod and
2049 // (b) it is a deopt PC
2050 address nmethod::get_deopt_original_pc(const frame* fr) {
2051 if (fr->cb() == NULL) return NULL;
2053 nmethod* nm = fr->cb()->as_nmethod_or_null();
2054 if (nm != NULL && nm->is_deopt_pc(fr->pc()))
2055 return nm->get_original_pc(fr);
2057 return NULL;
2058 }
2061 // -----------------------------------------------------------------------------
2062 // MethodHandle
2064 bool nmethod::is_method_handle_return(address return_pc) {
2065 if (!has_method_handle_invokes()) return false;
2066 PcDesc* pd = pc_desc_at(return_pc);
2067 if (pd == NULL)
2068 return false;
2069 return pd->is_method_handle_invoke();
2070 }
2073 // -----------------------------------------------------------------------------
2074 // Verification
2076 class VerifyOopsClosure: public OopClosure {
2077 nmethod* _nm;
2078 bool _ok;
2079 public:
2080 VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { }
2081 bool ok() { return _ok; }
2082 virtual void do_oop(oop* p) {
2083 if ((*p) == NULL || (*p)->is_oop()) return;
2084 if (_ok) {
2085 _nm->print_nmethod(true);
2086 _ok = false;
2087 }
2088 tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2089 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2090 }
2091 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2092 };
2094 void nmethod::verify() {
2096 // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant
2097 // seems odd.
2099 if( is_zombie() || is_not_entrant() )
2100 return;
2102 // Make sure all the entry points are correctly aligned for patching.
2103 NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point());
2105 assert(method()->is_oop(), "must be valid");
2107 ResourceMark rm;
2109 if (!CodeCache::contains(this)) {
2110 fatal1("nmethod at " INTPTR_FORMAT " not in zone", this);
2111 }
2113 if(is_native_method() )
2114 return;
2116 nmethod* nm = CodeCache::find_nmethod(verified_entry_point());
2117 if (nm != this) {
2118 fatal1("findNMethod did not find this nmethod (" INTPTR_FORMAT ")", this);
2119 }
2121 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2122 if (! p->verify(this)) {
2123 tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this);
2124 }
2125 }
2127 VerifyOopsClosure voc(this);
2128 oops_do(&voc);
2129 assert(voc.ok(), "embedded oops must be OK");
2130 verify_scavenge_root_oops();
2132 verify_scopes();
2133 }
2136 void nmethod::verify_interrupt_point(address call_site) {
2137 // This code does not work in release mode since
2138 // owns_lock only is available in debug mode.
2139 CompiledIC* ic = NULL;
2140 Thread *cur = Thread::current();
2141 if (CompiledIC_lock->owner() == cur ||
2142 ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) &&
2143 SafepointSynchronize::is_at_safepoint())) {
2144 ic = CompiledIC_at(call_site);
2145 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
2146 } else {
2147 MutexLocker ml_verify (CompiledIC_lock);
2148 ic = CompiledIC_at(call_site);
2149 }
2150 PcDesc* pd = pc_desc_at(ic->end_of_call());
2151 assert(pd != NULL, "PcDesc must exist");
2152 for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(),
2153 pd->obj_decode_offset(), pd->should_reexecute());
2154 !sd->is_top(); sd = sd->sender()) {
2155 sd->verify();
2156 }
2157 }
2159 void nmethod::verify_scopes() {
2160 if( !method() ) return; // Runtime stubs have no scope
2161 if (method()->is_native()) return; // Ignore stub methods.
2162 // iterate through all interrupt point
2163 // and verify the debug information is valid.
2164 RelocIterator iter((nmethod*)this);
2165 while (iter.next()) {
2166 address stub = NULL;
2167 switch (iter.type()) {
2168 case relocInfo::virtual_call_type:
2169 verify_interrupt_point(iter.addr());
2170 break;
2171 case relocInfo::opt_virtual_call_type:
2172 stub = iter.opt_virtual_call_reloc()->static_stub();
2173 verify_interrupt_point(iter.addr());
2174 break;
2175 case relocInfo::static_call_type:
2176 stub = iter.static_call_reloc()->static_stub();
2177 //verify_interrupt_point(iter.addr());
2178 break;
2179 case relocInfo::runtime_call_type:
2180 address destination = iter.reloc()->value();
2181 // Right now there is no way to find out which entries support
2182 // an interrupt point. It would be nice if we had this
2183 // information in a table.
2184 break;
2185 }
2186 assert(stub == NULL || stub_contains(stub), "static call stub outside stub section");
2187 }
2188 }
2191 // -----------------------------------------------------------------------------
2192 // Non-product code
2193 #ifndef PRODUCT
2195 class DebugScavengeRoot: public OopClosure {
2196 nmethod* _nm;
2197 bool _ok;
2198 public:
2199 DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { }
2200 bool ok() { return _ok; }
2201 virtual void do_oop(oop* p) {
2202 if ((*p) == NULL || !(*p)->is_scavengable()) return;
2203 if (_ok) {
2204 _nm->print_nmethod(true);
2205 _ok = false;
2206 }
2207 tty->print_cr("*** non-perm oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2208 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2209 (*p)->print();
2210 }
2211 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2212 };
2214 void nmethod::verify_scavenge_root_oops() {
2215 if (!on_scavenge_root_list()) {
2216 // Actually look inside, to verify the claim that it's clean.
2217 DebugScavengeRoot debug_scavenge_root(this);
2218 oops_do(&debug_scavenge_root);
2219 if (!debug_scavenge_root.ok())
2220 fatal("found an unadvertised bad non-perm oop in the code cache");
2221 }
2222 assert(scavenge_root_not_marked(), "");
2223 }
2225 #endif // PRODUCT
2227 // Printing operations
2229 void nmethod::print() const {
2230 ResourceMark rm;
2231 ttyLocker ttyl; // keep the following output all in one block
2233 tty->print("Compiled ");
2235 if (is_compiled_by_c1()) {
2236 tty->print("(c1) ");
2237 } else if (is_compiled_by_c2()) {
2238 tty->print("(c2) ");
2239 } else {
2240 tty->print("(nm) ");
2241 }
2243 print_on(tty, "nmethod");
2244 tty->cr();
2245 if (WizardMode) {
2246 tty->print("((nmethod*) "INTPTR_FORMAT ") ", this);
2247 tty->print(" for method " INTPTR_FORMAT , (address)method());
2248 tty->print(" { ");
2249 if (version()) tty->print("v%d ", version());
2250 if (level()) tty->print("l%d ", level());
2251 if (is_in_use()) tty->print("in_use ");
2252 if (is_not_entrant()) tty->print("not_entrant ");
2253 if (is_zombie()) tty->print("zombie ");
2254 if (is_unloaded()) tty->print("unloaded ");
2255 if (on_scavenge_root_list()) tty->print("scavenge_root ");
2256 tty->print_cr("}:");
2257 }
2258 if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2259 (address)this,
2260 (address)this + size(),
2261 size());
2262 if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2263 relocation_begin(),
2264 relocation_end(),
2265 relocation_size());
2266 if (code_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2267 code_begin(),
2268 code_end(),
2269 code_size());
2270 if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2271 stub_begin(),
2272 stub_end(),
2273 stub_size());
2274 if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2275 consts_begin(),
2276 consts_end(),
2277 consts_size());
2278 if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2279 scopes_data_begin(),
2280 scopes_data_end(),
2281 scopes_data_size());
2282 if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2283 scopes_pcs_begin(),
2284 scopes_pcs_end(),
2285 scopes_pcs_size());
2286 if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2287 dependencies_begin(),
2288 dependencies_end(),
2289 dependencies_size());
2290 if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2291 handler_table_begin(),
2292 handler_table_end(),
2293 handler_table_size());
2294 if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2295 nul_chk_table_begin(),
2296 nul_chk_table_end(),
2297 nul_chk_table_size());
2298 if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2299 oops_begin(),
2300 oops_end(),
2301 oops_size());
2302 }
2304 void nmethod::print_code() {
2305 HandleMark hm;
2306 ResourceMark m;
2307 Disassembler::decode(this);
2308 }
2311 #ifndef PRODUCT
2313 void nmethod::print_scopes() {
2314 // Find the first pc desc for all scopes in the code and print it.
2315 ResourceMark rm;
2316 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2317 if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null)
2318 continue;
2320 ScopeDesc* sd = scope_desc_at(p->real_pc(this));
2321 sd->print_on(tty, p);
2322 }
2323 }
2325 void nmethod::print_dependencies() {
2326 ResourceMark rm;
2327 ttyLocker ttyl; // keep the following output all in one block
2328 tty->print_cr("Dependencies:");
2329 for (Dependencies::DepStream deps(this); deps.next(); ) {
2330 deps.print_dependency();
2331 klassOop ctxk = deps.context_type();
2332 if (ctxk != NULL) {
2333 Klass* k = Klass::cast(ctxk);
2334 if (k->oop_is_instance() && ((instanceKlass*)k)->is_dependent_nmethod(this)) {
2335 tty->print_cr(" [nmethod<=klass]%s", k->external_name());
2336 }
2337 }
2338 deps.log_dependency(); // put it into the xml log also
2339 }
2340 }
2343 void nmethod::print_relocations() {
2344 ResourceMark m; // in case methods get printed via the debugger
2345 tty->print_cr("relocations:");
2346 RelocIterator iter(this);
2347 iter.print();
2348 if (UseRelocIndex) {
2349 jint* index_end = (jint*)relocation_end() - 1;
2350 jint index_size = *index_end;
2351 jint* index_start = (jint*)( (address)index_end - index_size );
2352 tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size);
2353 if (index_size > 0) {
2354 jint* ip;
2355 for (ip = index_start; ip+2 <= index_end; ip += 2)
2356 tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT,
2357 ip[0],
2358 ip[1],
2359 header_end()+ip[0],
2360 relocation_begin()-1+ip[1]);
2361 for (; ip < index_end; ip++)
2362 tty->print_cr(" (%d ?)", ip[0]);
2363 tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip++);
2364 tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip);
2365 }
2366 }
2367 }
2370 void nmethod::print_pcs() {
2371 ResourceMark m; // in case methods get printed via debugger
2372 tty->print_cr("pc-bytecode offsets:");
2373 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2374 p->print(this);
2375 }
2376 }
2378 #endif // PRODUCT
2380 const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
2381 RelocIterator iter(this, begin, end);
2382 bool have_one = false;
2383 while (iter.next()) {
2384 have_one = true;
2385 switch (iter.type()) {
2386 case relocInfo::none: return "no_reloc";
2387 case relocInfo::oop_type: {
2388 stringStream st;
2389 oop_Relocation* r = iter.oop_reloc();
2390 oop obj = r->oop_value();
2391 st.print("oop(");
2392 if (obj == NULL) st.print("NULL");
2393 else obj->print_value_on(&st);
2394 st.print(")");
2395 return st.as_string();
2396 }
2397 case relocInfo::virtual_call_type: return "virtual_call";
2398 case relocInfo::opt_virtual_call_type: return "optimized virtual_call";
2399 case relocInfo::static_call_type: return "static_call";
2400 case relocInfo::static_stub_type: return "static_stub";
2401 case relocInfo::runtime_call_type: return "runtime_call";
2402 case relocInfo::external_word_type: return "external_word";
2403 case relocInfo::internal_word_type: return "internal_word";
2404 case relocInfo::section_word_type: return "section_word";
2405 case relocInfo::poll_type: return "poll";
2406 case relocInfo::poll_return_type: return "poll_return";
2407 case relocInfo::type_mask: return "type_bit_mask";
2408 }
2409 }
2410 return have_one ? "other" : NULL;
2411 }
2413 // Return a the last scope in (begin..end]
2414 ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
2415 PcDesc* p = pc_desc_near(begin+1);
2416 if (p != NULL && p->real_pc(this) <= end) {
2417 return new ScopeDesc(this, p->scope_decode_offset(),
2418 p->obj_decode_offset(), p->should_reexecute());
2419 }
2420 return NULL;
2421 }
2423 void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) {
2424 if (block_begin == entry_point()) stream->print_cr("[Entry Point]");
2425 if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]");
2426 if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]");
2427 if (block_begin == stub_begin()) stream->print_cr("[Stub Code]");
2428 if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]");
2429 if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]");
2430 if (block_begin == consts_begin()) stream->print_cr("[Constants]");
2431 if (block_begin == entry_point()) {
2432 methodHandle m = method();
2433 if (m.not_null()) {
2434 stream->print(" # ");
2435 m->print_value_on(stream);
2436 stream->cr();
2437 }
2438 if (m.not_null() && !is_osr_method()) {
2439 ResourceMark rm;
2440 int sizeargs = m->size_of_parameters();
2441 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
2442 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
2443 {
2444 int sig_index = 0;
2445 if (!m->is_static())
2446 sig_bt[sig_index++] = T_OBJECT; // 'this'
2447 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
2448 BasicType t = ss.type();
2449 sig_bt[sig_index++] = t;
2450 if (type2size[t] == 2) {
2451 sig_bt[sig_index++] = T_VOID;
2452 } else {
2453 assert(type2size[t] == 1, "size is 1 or 2");
2454 }
2455 }
2456 assert(sig_index == sizeargs, "");
2457 }
2458 const char* spname = "sp"; // make arch-specific?
2459 intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false);
2460 int stack_slot_offset = this->frame_size() * wordSize;
2461 int tab1 = 14, tab2 = 24;
2462 int sig_index = 0;
2463 int arg_index = (m->is_static() ? 0 : -1);
2464 bool did_old_sp = false;
2465 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
2466 bool at_this = (arg_index == -1);
2467 bool at_old_sp = false;
2468 BasicType t = (at_this ? T_OBJECT : ss.type());
2469 assert(t == sig_bt[sig_index], "sigs in sync");
2470 if (at_this)
2471 stream->print(" # this: ");
2472 else
2473 stream->print(" # parm%d: ", arg_index);
2474 stream->move_to(tab1);
2475 VMReg fst = regs[sig_index].first();
2476 VMReg snd = regs[sig_index].second();
2477 if (fst->is_reg()) {
2478 stream->print("%s", fst->name());
2479 if (snd->is_valid()) {
2480 stream->print(":%s", snd->name());
2481 }
2482 } else if (fst->is_stack()) {
2483 int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset;
2484 if (offset == stack_slot_offset) at_old_sp = true;
2485 stream->print("[%s+0x%x]", spname, offset);
2486 } else {
2487 stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd);
2488 }
2489 stream->print(" ");
2490 stream->move_to(tab2);
2491 stream->print("= ");
2492 if (at_this) {
2493 m->method_holder()->print_value_on(stream);
2494 } else {
2495 bool did_name = false;
2496 if (!at_this && ss.is_object()) {
2497 symbolOop name = ss.as_symbol_or_null();
2498 if (name != NULL) {
2499 name->print_value_on(stream);
2500 did_name = true;
2501 }
2502 }
2503 if (!did_name)
2504 stream->print("%s", type2name(t));
2505 }
2506 if (at_old_sp) {
2507 stream->print(" (%s of caller)", spname);
2508 did_old_sp = true;
2509 }
2510 stream->cr();
2511 sig_index += type2size[t];
2512 arg_index += 1;
2513 if (!at_this) ss.next();
2514 }
2515 if (!did_old_sp) {
2516 stream->print(" # ");
2517 stream->move_to(tab1);
2518 stream->print("[%s+0x%x]", spname, stack_slot_offset);
2519 stream->print(" (%s of caller)", spname);
2520 stream->cr();
2521 }
2522 }
2523 }
2524 }
2526 void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) {
2527 // First, find an oopmap in (begin, end].
2528 // We use the odd half-closed interval so that oop maps and scope descs
2529 // which are tied to the byte after a call are printed with the call itself.
2530 address base = instructions_begin();
2531 OopMapSet* oms = oop_maps();
2532 if (oms != NULL) {
2533 for (int i = 0, imax = oms->size(); i < imax; i++) {
2534 OopMap* om = oms->at(i);
2535 address pc = base + om->offset();
2536 if (pc > begin) {
2537 if (pc <= end) {
2538 st->move_to(column);
2539 st->print("; ");
2540 om->print_on(st);
2541 }
2542 break;
2543 }
2544 }
2545 }
2547 // Print any debug info present at this pc.
2548 ScopeDesc* sd = scope_desc_in(begin, end);
2549 if (sd != NULL) {
2550 st->move_to(column);
2551 if (sd->bci() == SynchronizationEntryBCI) {
2552 st->print(";*synchronization entry");
2553 } else {
2554 if (sd->method().is_null()) {
2555 st->print("method is NULL");
2556 } else if (sd->method()->is_native()) {
2557 st->print("method is native");
2558 } else {
2559 address bcp = sd->method()->bcp_from(sd->bci());
2560 Bytecodes::Code bc = Bytecodes::java_code_at(bcp);
2561 st->print(";*%s", Bytecodes::name(bc));
2562 switch (bc) {
2563 case Bytecodes::_invokevirtual:
2564 case Bytecodes::_invokespecial:
2565 case Bytecodes::_invokestatic:
2566 case Bytecodes::_invokeinterface:
2567 {
2568 Bytecode_invoke* invoke = Bytecode_invoke_at(sd->method(), sd->bci());
2569 st->print(" ");
2570 if (invoke->name() != NULL)
2571 invoke->name()->print_symbol_on(st);
2572 else
2573 st->print("<UNKNOWN>");
2574 break;
2575 }
2576 case Bytecodes::_getfield:
2577 case Bytecodes::_putfield:
2578 case Bytecodes::_getstatic:
2579 case Bytecodes::_putstatic:
2580 {
2581 methodHandle sdm = sd->method();
2582 Bytecode_field* field = Bytecode_field_at(sdm(), sdm->bcp_from(sd->bci()));
2583 constantPoolOop sdmc = sdm->constants();
2584 symbolOop name = sdmc->name_ref_at(field->index());
2585 st->print(" ");
2586 if (name != NULL)
2587 name->print_symbol_on(st);
2588 else
2589 st->print("<UNKNOWN>");
2590 }
2591 }
2592 }
2593 }
2595 // Print all scopes
2596 for (;sd != NULL; sd = sd->sender()) {
2597 st->move_to(column);
2598 st->print("; -");
2599 if (sd->method().is_null()) {
2600 st->print("method is NULL");
2601 } else {
2602 sd->method()->print_short_name(st);
2603 }
2604 int lineno = sd->method()->line_number_from_bci(sd->bci());
2605 if (lineno != -1) {
2606 st->print("@%d (line %d)", sd->bci(), lineno);
2607 } else {
2608 st->print("@%d", sd->bci());
2609 }
2610 st->cr();
2611 }
2612 }
2614 // Print relocation information
2615 const char* str = reloc_string_for(begin, end);
2616 if (str != NULL) {
2617 if (sd != NULL) st->cr();
2618 st->move_to(column);
2619 st->print("; {%s}", str);
2620 }
2621 int cont_offset = ImplicitExceptionTable(this).at(begin - instructions_begin());
2622 if (cont_offset != 0) {
2623 st->move_to(column);
2624 st->print("; implicit exception: dispatches to " INTPTR_FORMAT, instructions_begin() + cont_offset);
2625 }
2627 }
2629 #ifndef PRODUCT
2631 void nmethod::print_value_on(outputStream* st) const {
2632 print_on(st, "nmethod");
2633 }
2635 void nmethod::print_calls(outputStream* st) {
2636 RelocIterator iter(this);
2637 while (iter.next()) {
2638 switch (iter.type()) {
2639 case relocInfo::virtual_call_type:
2640 case relocInfo::opt_virtual_call_type: {
2641 VerifyMutexLocker mc(CompiledIC_lock);
2642 CompiledIC_at(iter.reloc())->print();
2643 break;
2644 }
2645 case relocInfo::static_call_type:
2646 st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr());
2647 compiledStaticCall_at(iter.reloc())->print();
2648 break;
2649 }
2650 }
2651 }
2653 void nmethod::print_handler_table() {
2654 ExceptionHandlerTable(this).print();
2655 }
2657 void nmethod::print_nul_chk_table() {
2658 ImplicitExceptionTable(this).print(instructions_begin());
2659 }
2661 void nmethod::print_statistics() {
2662 ttyLocker ttyl;
2663 if (xtty != NULL) xtty->head("statistics type='nmethod'");
2664 nmethod_stats.print_native_nmethod_stats();
2665 nmethod_stats.print_nmethod_stats();
2666 DebugInformationRecorder::print_statistics();
2667 nmethod_stats.print_pc_stats();
2668 Dependencies::print_statistics();
2669 if (xtty != NULL) xtty->tail("statistics");
2670 }
2672 #endif // PRODUCT