Fri, 05 Feb 2010 11:07:40 -0800
6920293: OptimizeStringConcat causing core dumps
Reviewed-by: kvn, twisti
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 _method = NULL; // Clear the method of this dead nmethod
1121 }
1122 // Make the class unloaded - i.e., change state and notify sweeper
1123 check_safepoint();
1124 if (is_in_use()) {
1125 // Transitioning directly from live to unloaded -- so
1126 // we need to force a cache clean-up; remember this
1127 // for later on.
1128 CodeCache::set_needs_cache_clean(true);
1129 }
1130 flags.state = unloaded;
1132 // Log the unloading.
1133 log_state_change();
1135 // The methodOop is gone at this point
1136 assert(_method == NULL, "Tautology");
1138 set_osr_link(NULL);
1139 //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods
1140 NMethodSweeper::notify(this);
1141 }
1143 void nmethod::invalidate_osr_method() {
1144 assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod");
1145 // Remove from list of active nmethods
1146 if (method() != NULL)
1147 instanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this);
1148 // Set entry as invalid
1149 _entry_bci = InvalidOSREntryBci;
1150 }
1152 void nmethod::log_state_change() const {
1153 if (LogCompilation) {
1154 if (xtty != NULL) {
1155 ttyLocker ttyl; // keep the following output all in one block
1156 if (flags.state == unloaded) {
1157 xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'",
1158 os::current_thread_id());
1159 } else {
1160 xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s",
1161 os::current_thread_id(),
1162 (flags.state == zombie ? " zombie='1'" : ""));
1163 }
1164 log_identity(xtty);
1165 xtty->stamp();
1166 xtty->end_elem();
1167 }
1168 }
1169 if (PrintCompilation && flags.state != unloaded) {
1170 print_on(tty, flags.state == zombie ? "made zombie " : "made not entrant ");
1171 tty->cr();
1172 }
1173 }
1175 // Common functionality for both make_not_entrant and make_zombie
1176 bool nmethod::make_not_entrant_or_zombie(unsigned int state) {
1177 assert(state == zombie || state == not_entrant, "must be zombie or not_entrant");
1179 bool was_alive = false;
1181 // Make sure the nmethod is not flushed in case of a safepoint in code below.
1182 nmethodLocker nml(this);
1184 {
1185 // If the method is already zombie there is nothing to do
1186 if (is_zombie()) {
1187 return false;
1188 }
1190 // invalidate osr nmethod before acquiring the patching lock since
1191 // they both acquire leaf locks and we don't want a deadlock.
1192 // This logic is equivalent to the logic below for patching the
1193 // verified entry point of regular methods.
1194 if (is_osr_method()) {
1195 // this effectively makes the osr nmethod not entrant
1196 invalidate_osr_method();
1197 }
1199 // Enter critical section. Does not block for safepoint.
1200 MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag);
1202 if (flags.state == state) {
1203 // another thread already performed this transition so nothing
1204 // to do, but return false to indicate this.
1205 return false;
1206 }
1208 // The caller can be calling the method statically or through an inline
1209 // cache call.
1210 if (!is_osr_method() && !is_not_entrant()) {
1211 NativeJump::patch_verified_entry(entry_point(), verified_entry_point(),
1212 SharedRuntime::get_handle_wrong_method_stub());
1213 assert (NativeJump::instruction_size == nmethod::_zombie_instruction_size, "");
1214 }
1216 // When the nmethod becomes zombie it is no longer alive so the
1217 // dependencies must be flushed. nmethods in the not_entrant
1218 // state will be flushed later when the transition to zombie
1219 // happens or they get unloaded.
1220 if (state == zombie) {
1221 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1222 flush_dependencies(NULL);
1223 } else {
1224 assert(state == not_entrant, "other cases may need to be handled differently");
1225 }
1227 was_alive = is_in_use(); // Read state under lock
1229 // Change state
1230 flags.state = state;
1232 // Log the transition once
1233 log_state_change();
1235 } // leave critical region under Patching_lock
1237 if (state == not_entrant) {
1238 Events::log("Make nmethod not entrant " INTPTR_FORMAT, this);
1239 } else {
1240 Events::log("Make nmethod zombie " INTPTR_FORMAT, this);
1241 }
1243 if (TraceCreateZombies) {
1244 tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie");
1245 }
1247 // Make sweeper aware that there is a zombie method that needs to be removed
1248 NMethodSweeper::notify(this);
1250 // not_entrant only stuff
1251 if (state == not_entrant) {
1252 mark_as_seen_on_stack();
1253 }
1255 if (was_alive) {
1256 // It's a true state change, so mark the method as decompiled.
1257 // Do it only for transition from alive.
1258 inc_decompile_count();
1259 }
1261 // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload event
1262 // and it hasn't already been reported for this nmethod then report it now.
1263 // (the event may have been reported earilier if the GC marked it for unloading).
1264 if (state == zombie) {
1266 DTRACE_METHOD_UNLOAD_PROBE(method());
1268 if (JvmtiExport::should_post_compiled_method_unload() &&
1269 !unload_reported()) {
1270 assert(method() != NULL, "checking");
1271 {
1272 HandleMark hm;
1273 JvmtiExport::post_compiled_method_unload_at_safepoint(
1274 method()->jmethod_id(), code_begin());
1275 }
1276 set_unload_reported();
1277 }
1278 }
1281 // Zombie only stuff
1282 if (state == zombie) {
1283 VTune::delete_nmethod(this);
1284 }
1286 // Check whether method got unloaded at a safepoint before this,
1287 // if so we can skip the flushing steps below
1288 if (method() == NULL) return true;
1290 // Remove nmethod from method.
1291 // We need to check if both the _code and _from_compiled_code_entry_point
1292 // refer to this nmethod because there is a race in setting these two fields
1293 // in methodOop as seen in bugid 4947125.
1294 // If the vep() points to the zombie nmethod, the memory for the nmethod
1295 // could be flushed and the compiler and vtable stubs could still call
1296 // through it.
1297 if (method()->code() == this ||
1298 method()->from_compiled_entry() == verified_entry_point()) {
1299 HandleMark hm;
1300 method()->clear_code();
1301 }
1303 return true;
1304 }
1307 #ifndef PRODUCT
1308 void nmethod::check_safepoint() {
1309 assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint");
1310 }
1311 #endif
1314 void nmethod::flush() {
1315 // Note that there are no valid oops in the nmethod anymore.
1316 assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method");
1317 assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation");
1319 assert (!is_locked_by_vm(), "locked methods shouldn't be flushed");
1320 check_safepoint();
1322 // completely deallocate this method
1323 EventMark m("flushing nmethod " INTPTR_FORMAT " %s", this, "");
1324 if (PrintMethodFlushing) {
1325 tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb",
1326 _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024);
1327 }
1329 // We need to deallocate any ExceptionCache data.
1330 // Note that we do not need to grab the nmethod lock for this, it
1331 // better be thread safe if we're disposing of it!
1332 ExceptionCache* ec = exception_cache();
1333 set_exception_cache(NULL);
1334 while(ec != NULL) {
1335 ExceptionCache* next = ec->next();
1336 delete ec;
1337 ec = next;
1338 }
1340 if (on_scavenge_root_list()) {
1341 CodeCache::drop_scavenge_root_nmethod(this);
1342 }
1344 if (is_speculatively_disconnected()) {
1345 CodeCache::remove_saved_code(this);
1346 }
1348 ((CodeBlob*)(this))->flush();
1350 CodeCache::free(this);
1351 }
1354 //
1355 // Notify all classes this nmethod is dependent on that it is no
1356 // longer dependent. This should only be called in two situations.
1357 // First, when a nmethod transitions to a zombie all dependents need
1358 // to be clear. Since zombification happens at a safepoint there's no
1359 // synchronization issues. The second place is a little more tricky.
1360 // During phase 1 of mark sweep class unloading may happen and as a
1361 // result some nmethods may get unloaded. In this case the flushing
1362 // of dependencies must happen during phase 1 since after GC any
1363 // dependencies in the unloaded nmethod won't be updated, so
1364 // traversing the dependency information in unsafe. In that case this
1365 // function is called with a non-NULL argument and this function only
1366 // notifies instanceKlasses that are reachable
1368 void nmethod::flush_dependencies(BoolObjectClosure* is_alive) {
1369 assert(SafepointSynchronize::is_at_safepoint(), "must be done at safepoint");
1370 assert(Universe::heap()->is_gc_active() == (is_alive != NULL),
1371 "is_alive is non-NULL if and only if we are called during GC");
1372 if (!has_flushed_dependencies()) {
1373 set_has_flushed_dependencies();
1374 for (Dependencies::DepStream deps(this); deps.next(); ) {
1375 klassOop klass = deps.context_type();
1376 if (klass == NULL) continue; // ignore things like evol_method
1378 // During GC the is_alive closure is non-NULL, and is used to
1379 // determine liveness of dependees that need to be updated.
1380 if (is_alive == NULL || is_alive->do_object_b(klass)) {
1381 instanceKlass::cast(klass)->remove_dependent_nmethod(this);
1382 }
1383 }
1384 }
1385 }
1388 // If this oop is not live, the nmethod can be unloaded.
1389 bool nmethod::can_unload(BoolObjectClosure* is_alive,
1390 OopClosure* keep_alive,
1391 oop* root, bool unloading_occurred) {
1392 assert(root != NULL, "just checking");
1393 oop obj = *root;
1394 if (obj == NULL || is_alive->do_object_b(obj)) {
1395 return false;
1396 }
1397 if (obj->is_compiledICHolder()) {
1398 compiledICHolderOop cichk_oop = compiledICHolderOop(obj);
1399 if (is_alive->do_object_b(
1400 cichk_oop->holder_method()->method_holder()) &&
1401 is_alive->do_object_b(cichk_oop->holder_klass())) {
1402 // The oop should be kept alive
1403 keep_alive->do_oop(root);
1404 return false;
1405 }
1406 }
1407 // If ScavengeRootsInCode is true, an nmethod might be unloaded
1408 // simply because one of its constant oops has gone dead.
1409 // No actual classes need to be unloaded in order for this to occur.
1410 assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading");
1411 make_unloaded(is_alive, obj);
1412 return true;
1413 }
1415 // ------------------------------------------------------------------
1416 // post_compiled_method_load_event
1417 // new method for install_code() path
1418 // Transfer information from compilation to jvmti
1419 void nmethod::post_compiled_method_load_event() {
1421 methodOop moop = method();
1422 HS_DTRACE_PROBE8(hotspot, compiled__method__load,
1423 moop->klass_name()->bytes(),
1424 moop->klass_name()->utf8_length(),
1425 moop->name()->bytes(),
1426 moop->name()->utf8_length(),
1427 moop->signature()->bytes(),
1428 moop->signature()->utf8_length(),
1429 code_begin(), code_size());
1431 if (JvmtiExport::should_post_compiled_method_load()) {
1432 JvmtiExport::post_compiled_method_load(this);
1433 }
1434 }
1436 void nmethod::post_compiled_method_unload() {
1437 assert(_method != NULL && !is_unloaded(), "just checking");
1438 DTRACE_METHOD_UNLOAD_PROBE(method());
1440 // If a JVMTI agent has enabled the CompiledMethodUnload event then
1441 // post the event. Sometime later this nmethod will be made a zombie by
1442 // the sweeper but the methodOop will not be valid at that point.
1443 if (JvmtiExport::should_post_compiled_method_unload()) {
1444 assert(!unload_reported(), "already unloaded");
1445 HandleMark hm;
1446 JvmtiExport::post_compiled_method_unload_at_safepoint(
1447 method()->jmethod_id(), code_begin());
1448 }
1450 // The JVMTI CompiledMethodUnload event can be enabled or disabled at
1451 // any time. As the nmethod is being unloaded now we mark it has
1452 // having the unload event reported - this will ensure that we don't
1453 // attempt to report the event in the unlikely scenario where the
1454 // event is enabled at the time the nmethod is made a zombie.
1455 set_unload_reported();
1456 }
1458 // This is called at the end of the strong tracing/marking phase of a
1459 // GC to unload an nmethod if it contains otherwise unreachable
1460 // oops.
1462 void nmethod::do_unloading(BoolObjectClosure* is_alive,
1463 OopClosure* keep_alive, bool unloading_occurred) {
1464 // Make sure the oop's ready to receive visitors
1465 assert(!is_zombie() && !is_unloaded(),
1466 "should not call follow on zombie or unloaded nmethod");
1468 // If the method is not entrant then a JMP is plastered over the
1469 // first few bytes. If an oop in the old code was there, that oop
1470 // should not get GC'd. Skip the first few bytes of oops on
1471 // not-entrant methods.
1472 address low_boundary = verified_entry_point();
1473 if (is_not_entrant()) {
1474 low_boundary += NativeJump::instruction_size;
1475 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1476 // (See comment above.)
1477 }
1479 // The RedefineClasses() API can cause the class unloading invariant
1480 // to no longer be true. See jvmtiExport.hpp for details.
1481 // Also, leave a debugging breadcrumb in local flag.
1482 bool a_class_was_redefined = JvmtiExport::has_redefined_a_class();
1483 if (a_class_was_redefined) {
1484 // This set of the unloading_occurred flag is done before the
1485 // call to post_compiled_method_unload() so that the unloading
1486 // of this nmethod is reported.
1487 unloading_occurred = true;
1488 }
1490 // Follow methodOop
1491 if (can_unload(is_alive, keep_alive, (oop*)&_method, unloading_occurred)) {
1492 return;
1493 }
1495 // Exception cache
1496 ExceptionCache* ec = exception_cache();
1497 while (ec != NULL) {
1498 oop* ex_addr = (oop*)ec->exception_type_addr();
1499 oop ex = *ex_addr;
1500 ExceptionCache* next_ec = ec->next();
1501 if (ex != NULL && !is_alive->do_object_b(ex)) {
1502 assert(!ex->is_compiledICHolder(), "Possible error here");
1503 remove_from_exception_cache(ec);
1504 }
1505 ec = next_ec;
1506 }
1508 // If class unloading occurred we first iterate over all inline caches and
1509 // clear ICs where the cached oop is referring to an unloaded klass or method.
1510 // The remaining live cached oops will be traversed in the relocInfo::oop_type
1511 // iteration below.
1512 if (unloading_occurred) {
1513 RelocIterator iter(this, low_boundary);
1514 while(iter.next()) {
1515 if (iter.type() == relocInfo::virtual_call_type) {
1516 CompiledIC *ic = CompiledIC_at(iter.reloc());
1517 oop ic_oop = ic->cached_oop();
1518 if (ic_oop != NULL && !is_alive->do_object_b(ic_oop)) {
1519 // The only exception is compiledICHolder oops which may
1520 // yet be marked below. (We check this further below).
1521 if (ic_oop->is_compiledICHolder()) {
1522 compiledICHolderOop cichk_oop = compiledICHolderOop(ic_oop);
1523 if (is_alive->do_object_b(
1524 cichk_oop->holder_method()->method_holder()) &&
1525 is_alive->do_object_b(cichk_oop->holder_klass())) {
1526 continue;
1527 }
1528 }
1529 ic->set_to_clean();
1530 assert(ic->cached_oop() == NULL, "cached oop in IC should be cleared")
1531 }
1532 }
1533 }
1534 }
1536 // Compiled code
1537 RelocIterator iter(this, low_boundary);
1538 while (iter.next()) {
1539 if (iter.type() == relocInfo::oop_type) {
1540 oop_Relocation* r = iter.oop_reloc();
1541 // In this loop, we must only traverse those oops directly embedded in
1542 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1543 assert(1 == (r->oop_is_immediate()) +
1544 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1545 "oop must be found in exactly one place");
1546 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1547 if (can_unload(is_alive, keep_alive, r->oop_addr(), unloading_occurred)) {
1548 return;
1549 }
1550 }
1551 }
1552 }
1555 // Scopes
1556 for (oop* p = oops_begin(); p < oops_end(); p++) {
1557 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1558 if (can_unload(is_alive, keep_alive, p, unloading_occurred)) {
1559 return;
1560 }
1561 }
1563 #ifndef PRODUCT
1564 // This nmethod was not unloaded; check below that all CompiledICs
1565 // refer to marked oops.
1566 {
1567 RelocIterator iter(this, low_boundary);
1568 while (iter.next()) {
1569 if (iter.type() == relocInfo::virtual_call_type) {
1570 CompiledIC *ic = CompiledIC_at(iter.reloc());
1571 oop ic_oop = ic->cached_oop();
1572 assert(ic_oop == NULL || is_alive->do_object_b(ic_oop),
1573 "Found unmarked ic_oop in reachable nmethod");
1574 }
1575 }
1576 }
1577 #endif // !PRODUCT
1578 }
1580 // This method is called twice during GC -- once while
1581 // tracing the "active" nmethods on thread stacks during
1582 // the (strong) marking phase, and then again when walking
1583 // the code cache contents during the weak roots processing
1584 // phase. The two uses are distinguished by means of the
1585 // 'do_strong_roots_only' flag, which is true in the first
1586 // case. We want to walk the weak roots in the nmethod
1587 // only in the second case. The weak roots in the nmethod
1588 // are the oops in the ExceptionCache and the InlineCache
1589 // oops.
1590 void nmethod::oops_do(OopClosure* f, bool do_strong_roots_only) {
1591 // make sure the oops ready to receive visitors
1592 assert(!is_zombie() && !is_unloaded(),
1593 "should not call follow on zombie or unloaded nmethod");
1595 // If the method is not entrant or zombie then a JMP is plastered over the
1596 // first few bytes. If an oop in the old code was there, that oop
1597 // should not get GC'd. Skip the first few bytes of oops on
1598 // not-entrant methods.
1599 address low_boundary = verified_entry_point();
1600 if (is_not_entrant()) {
1601 low_boundary += NativeJump::instruction_size;
1602 // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump.
1603 // (See comment above.)
1604 }
1606 // Compiled code
1607 f->do_oop((oop*) &_method);
1608 if (!do_strong_roots_only) {
1609 // weak roots processing phase -- update ExceptionCache oops
1610 ExceptionCache* ec = exception_cache();
1611 while(ec != NULL) {
1612 f->do_oop((oop*)ec->exception_type_addr());
1613 ec = ec->next();
1614 }
1615 } // Else strong roots phase -- skip oops in ExceptionCache
1617 RelocIterator iter(this, low_boundary);
1619 while (iter.next()) {
1620 if (iter.type() == relocInfo::oop_type ) {
1621 oop_Relocation* r = iter.oop_reloc();
1622 // In this loop, we must only follow those oops directly embedded in
1623 // the code. Other oops (oop_index>0) are seen as part of scopes_oops.
1624 assert(1 == (r->oop_is_immediate()) +
1625 (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()),
1626 "oop must be found in exactly one place");
1627 if (r->oop_is_immediate() && r->oop_value() != NULL) {
1628 f->do_oop(r->oop_addr());
1629 }
1630 }
1631 }
1633 // Scopes
1634 // This includes oop constants not inlined in the code stream.
1635 for (oop* p = oops_begin(); p < oops_end(); p++) {
1636 if (*p == Universe::non_oop_word()) continue; // skip non-oops
1637 f->do_oop(p);
1638 }
1639 }
1641 #define NMETHOD_SENTINEL ((nmethod*)badAddress)
1643 nmethod* volatile nmethod::_oops_do_mark_nmethods;
1645 // An nmethod is "marked" if its _mark_link is set non-null.
1646 // Even if it is the end of the linked list, it will have a non-null link value,
1647 // as long as it is on the list.
1648 // This code must be MP safe, because it is used from parallel GC passes.
1649 bool nmethod::test_set_oops_do_mark() {
1650 assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called");
1651 nmethod* observed_mark_link = _oops_do_mark_link;
1652 if (observed_mark_link == NULL) {
1653 // Claim this nmethod for this thread to mark.
1654 observed_mark_link = (nmethod*)
1655 Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL);
1656 if (observed_mark_link == NULL) {
1658 // Atomically append this nmethod (now claimed) to the head of the list:
1659 nmethod* observed_mark_nmethods = _oops_do_mark_nmethods;
1660 for (;;) {
1661 nmethod* required_mark_nmethods = observed_mark_nmethods;
1662 _oops_do_mark_link = required_mark_nmethods;
1663 observed_mark_nmethods = (nmethod*)
1664 Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods);
1665 if (observed_mark_nmethods == required_mark_nmethods)
1666 break;
1667 }
1668 // Mark was clear when we first saw this guy.
1669 NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark\n"));
1670 return false;
1671 }
1672 }
1673 // On fall through, another racing thread marked this nmethod before we did.
1674 return true;
1675 }
1677 void nmethod::oops_do_marking_prologue() {
1678 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue"));
1679 assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row");
1680 // We use cmpxchg_ptr instead of regular assignment here because the user
1681 // may fork a bunch of threads, and we need them all to see the same state.
1682 void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL);
1683 guarantee(observed == NULL, "no races in this sequential code");
1684 }
1686 void nmethod::oops_do_marking_epilogue() {
1687 assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row");
1688 nmethod* cur = _oops_do_mark_nmethods;
1689 while (cur != NMETHOD_SENTINEL) {
1690 assert(cur != NULL, "not NULL-terminated");
1691 nmethod* next = cur->_oops_do_mark_link;
1692 cur->_oops_do_mark_link = NULL;
1693 NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark\n"));
1694 cur = next;
1695 }
1696 void* required = _oops_do_mark_nmethods;
1697 void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required);
1698 guarantee(observed == required, "no races in this sequential code");
1699 NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]"));
1700 }
1702 class DetectScavengeRoot: public OopClosure {
1703 bool _detected_scavenge_root;
1704 public:
1705 DetectScavengeRoot() : _detected_scavenge_root(false)
1706 { NOT_PRODUCT(_print_nm = NULL); }
1707 bool detected_scavenge_root() { return _detected_scavenge_root; }
1708 virtual void do_oop(oop* p) {
1709 if ((*p) != NULL && (*p)->is_scavengable()) {
1710 NOT_PRODUCT(maybe_print(p));
1711 _detected_scavenge_root = true;
1712 }
1713 }
1714 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
1716 #ifndef PRODUCT
1717 nmethod* _print_nm;
1718 void maybe_print(oop* p) {
1719 if (_print_nm == NULL) return;
1720 if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root");
1721 tty->print_cr(""PTR_FORMAT"[offset=%d] detected non-perm oop "PTR_FORMAT" (found at "PTR_FORMAT")",
1722 _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm),
1723 (intptr_t)(*p), (intptr_t)p);
1724 (*p)->print();
1725 }
1726 #endif //PRODUCT
1727 };
1729 bool nmethod::detect_scavenge_root_oops() {
1730 DetectScavengeRoot detect_scavenge_root;
1731 NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this);
1732 oops_do(&detect_scavenge_root);
1733 return detect_scavenge_root.detected_scavenge_root();
1734 }
1736 // Method that knows how to preserve outgoing arguments at call. This method must be
1737 // called with a frame corresponding to a Java invoke
1738 void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) {
1739 if (!method()->is_native()) {
1740 SimpleScopeDesc ssd(this, fr.pc());
1741 Bytecode_invoke* call = Bytecode_invoke_at(ssd.method(), ssd.bci());
1742 bool has_receiver = call->has_receiver();
1743 symbolOop signature = call->signature();
1744 fr.oops_compiled_arguments_do(signature, has_receiver, reg_map, f);
1745 }
1746 }
1749 oop nmethod::embeddedOop_at(u_char* p) {
1750 RelocIterator iter(this, p, p + oopSize);
1751 while (iter.next())
1752 if (iter.type() == relocInfo::oop_type) {
1753 return iter.oop_reloc()->oop_value();
1754 }
1755 return NULL;
1756 }
1759 inline bool includes(void* p, void* from, void* to) {
1760 return from <= p && p < to;
1761 }
1764 void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) {
1765 assert(count >= 2, "must be sentinel values, at least");
1767 #ifdef ASSERT
1768 // must be sorted and unique; we do a binary search in find_pc_desc()
1769 int prev_offset = pcs[0].pc_offset();
1770 assert(prev_offset == PcDesc::lower_offset_limit,
1771 "must start with a sentinel");
1772 for (int i = 1; i < count; i++) {
1773 int this_offset = pcs[i].pc_offset();
1774 assert(this_offset > prev_offset, "offsets must be sorted");
1775 prev_offset = this_offset;
1776 }
1777 assert(prev_offset == PcDesc::upper_offset_limit,
1778 "must end with a sentinel");
1779 #endif //ASSERT
1781 // Search for MethodHandle invokes and tag the nmethod.
1782 for (int i = 0; i < count; i++) {
1783 if (pcs[i].is_method_handle_invoke()) {
1784 set_has_method_handle_invokes(true);
1785 break;
1786 }
1787 }
1789 int size = count * sizeof(PcDesc);
1790 assert(scopes_pcs_size() >= size, "oob");
1791 memcpy(scopes_pcs_begin(), pcs, size);
1793 // Adjust the final sentinel downward.
1794 PcDesc* last_pc = &scopes_pcs_begin()[count-1];
1795 assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity");
1796 last_pc->set_pc_offset(instructions_size() + 1);
1797 for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) {
1798 // Fill any rounding gaps with copies of the last record.
1799 last_pc[1] = last_pc[0];
1800 }
1801 // The following assert could fail if sizeof(PcDesc) is not
1802 // an integral multiple of oopSize (the rounding term).
1803 // If it fails, change the logic to always allocate a multiple
1804 // of sizeof(PcDesc), and fill unused words with copies of *last_pc.
1805 assert(last_pc + 1 == scopes_pcs_end(), "must match exactly");
1806 }
1808 void nmethod::copy_scopes_data(u_char* buffer, int size) {
1809 assert(scopes_data_size() >= size, "oob");
1810 memcpy(scopes_data_begin(), buffer, size);
1811 }
1814 #ifdef ASSERT
1815 static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) {
1816 PcDesc* lower = nm->scopes_pcs_begin();
1817 PcDesc* upper = nm->scopes_pcs_end();
1818 lower += 1; // exclude initial sentinel
1819 PcDesc* res = NULL;
1820 for (PcDesc* p = lower; p < upper; p++) {
1821 NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc
1822 if (match_desc(p, pc_offset, approximate)) {
1823 if (res == NULL)
1824 res = p;
1825 else
1826 res = (PcDesc*) badAddress;
1827 }
1828 }
1829 return res;
1830 }
1831 #endif
1834 // Finds a PcDesc with real-pc equal to "pc"
1835 PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) {
1836 address base_address = instructions_begin();
1837 if ((pc < base_address) ||
1838 (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) {
1839 return NULL; // PC is wildly out of range
1840 }
1841 int pc_offset = (int) (pc - base_address);
1843 // Check the PcDesc cache if it contains the desired PcDesc
1844 // (This as an almost 100% hit rate.)
1845 PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate);
1846 if (res != NULL) {
1847 assert(res == linear_search(this, pc_offset, approximate), "cache ok");
1848 return res;
1849 }
1851 // Fallback algorithm: quasi-linear search for the PcDesc
1852 // Find the last pc_offset less than the given offset.
1853 // The successor must be the required match, if there is a match at all.
1854 // (Use a fixed radix to avoid expensive affine pointer arithmetic.)
1855 PcDesc* lower = scopes_pcs_begin();
1856 PcDesc* upper = scopes_pcs_end();
1857 upper -= 1; // exclude final sentinel
1858 if (lower >= upper) return NULL; // native method; no PcDescs at all
1860 #define assert_LU_OK \
1861 /* invariant on lower..upper during the following search: */ \
1862 assert(lower->pc_offset() < pc_offset, "sanity"); \
1863 assert(upper->pc_offset() >= pc_offset, "sanity")
1864 assert_LU_OK;
1866 // Use the last successful return as a split point.
1867 PcDesc* mid = _pc_desc_cache.last_pc_desc();
1868 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1869 if (mid->pc_offset() < pc_offset) {
1870 lower = mid;
1871 } else {
1872 upper = mid;
1873 }
1875 // Take giant steps at first (4096, then 256, then 16, then 1)
1876 const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1);
1877 const int RADIX = (1 << LOG2_RADIX);
1878 for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) {
1879 while ((mid = lower + step) < upper) {
1880 assert_LU_OK;
1881 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1882 if (mid->pc_offset() < pc_offset) {
1883 lower = mid;
1884 } else {
1885 upper = mid;
1886 break;
1887 }
1888 }
1889 assert_LU_OK;
1890 }
1892 // Sneak up on the value with a linear search of length ~16.
1893 while (true) {
1894 assert_LU_OK;
1895 mid = lower + 1;
1896 NOT_PRODUCT(++nmethod_stats.pc_desc_searches);
1897 if (mid->pc_offset() < pc_offset) {
1898 lower = mid;
1899 } else {
1900 upper = mid;
1901 break;
1902 }
1903 }
1904 #undef assert_LU_OK
1906 if (match_desc(upper, pc_offset, approximate)) {
1907 assert(upper == linear_search(this, pc_offset, approximate), "search ok");
1908 _pc_desc_cache.add_pc_desc(upper);
1909 return upper;
1910 } else {
1911 assert(NULL == linear_search(this, pc_offset, approximate), "search ok");
1912 return NULL;
1913 }
1914 }
1917 bool nmethod::check_all_dependencies() {
1918 bool found_check = false;
1919 // wholesale check of all dependencies
1920 for (Dependencies::DepStream deps(this); deps.next(); ) {
1921 if (deps.check_dependency() != NULL) {
1922 found_check = true;
1923 NOT_DEBUG(break);
1924 }
1925 }
1926 return found_check; // tell caller if we found anything
1927 }
1929 bool nmethod::check_dependency_on(DepChange& changes) {
1930 // What has happened:
1931 // 1) a new class dependee has been added
1932 // 2) dependee and all its super classes have been marked
1933 bool found_check = false; // set true if we are upset
1934 for (Dependencies::DepStream deps(this); deps.next(); ) {
1935 // Evaluate only relevant dependencies.
1936 if (deps.spot_check_dependency_at(changes) != NULL) {
1937 found_check = true;
1938 NOT_DEBUG(break);
1939 }
1940 }
1941 return found_check;
1942 }
1944 bool nmethod::is_evol_dependent_on(klassOop dependee) {
1945 instanceKlass *dependee_ik = instanceKlass::cast(dependee);
1946 objArrayOop dependee_methods = dependee_ik->methods();
1947 for (Dependencies::DepStream deps(this); deps.next(); ) {
1948 if (deps.type() == Dependencies::evol_method) {
1949 methodOop method = deps.method_argument(0);
1950 for (int j = 0; j < dependee_methods->length(); j++) {
1951 if ((methodOop) dependee_methods->obj_at(j) == method) {
1952 // RC_TRACE macro has an embedded ResourceMark
1953 RC_TRACE(0x01000000,
1954 ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)",
1955 _method->method_holder()->klass_part()->external_name(),
1956 _method->name()->as_C_string(),
1957 _method->signature()->as_C_string(), compile_id(),
1958 method->method_holder()->klass_part()->external_name(),
1959 method->name()->as_C_string(),
1960 method->signature()->as_C_string()));
1961 if (TraceDependencies || LogCompilation)
1962 deps.log_dependency(dependee);
1963 return true;
1964 }
1965 }
1966 }
1967 }
1968 return false;
1969 }
1971 // Called from mark_for_deoptimization, when dependee is invalidated.
1972 bool nmethod::is_dependent_on_method(methodOop dependee) {
1973 for (Dependencies::DepStream deps(this); deps.next(); ) {
1974 if (deps.type() != Dependencies::evol_method)
1975 continue;
1976 methodOop method = deps.method_argument(0);
1977 if (method == dependee) return true;
1978 }
1979 return false;
1980 }
1983 bool nmethod::is_patchable_at(address instr_addr) {
1984 assert (code_contains(instr_addr), "wrong nmethod used");
1985 if (is_zombie()) {
1986 // a zombie may never be patched
1987 return false;
1988 }
1989 return true;
1990 }
1993 address nmethod::continuation_for_implicit_exception(address pc) {
1994 // Exception happened outside inline-cache check code => we are inside
1995 // an active nmethod => use cpc to determine a return address
1996 int exception_offset = pc - instructions_begin();
1997 int cont_offset = ImplicitExceptionTable(this).at( exception_offset );
1998 #ifdef ASSERT
1999 if (cont_offset == 0) {
2000 Thread* thread = ThreadLocalStorage::get_thread_slow();
2001 ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY
2002 HandleMark hm(thread);
2003 ResourceMark rm(thread);
2004 CodeBlob* cb = CodeCache::find_blob(pc);
2005 assert(cb != NULL && cb == this, "");
2006 tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc);
2007 print();
2008 method()->print_codes();
2009 print_code();
2010 print_pcs();
2011 }
2012 #endif
2013 if (cont_offset == 0) {
2014 // Let the normal error handling report the exception
2015 return NULL;
2016 }
2017 return instructions_begin() + cont_offset;
2018 }
2022 void nmethod_init() {
2023 // make sure you didn't forget to adjust the filler fields
2024 assert(sizeof(nmFlags) <= 4, "nmFlags occupies more than a word");
2025 assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word");
2026 }
2029 //-------------------------------------------------------------------------------------------
2032 // QQQ might we make this work from a frame??
2033 nmethodLocker::nmethodLocker(address pc) {
2034 CodeBlob* cb = CodeCache::find_blob(pc);
2035 guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found");
2036 _nm = (nmethod*)cb;
2037 lock_nmethod(_nm);
2038 }
2040 void nmethodLocker::lock_nmethod(nmethod* nm) {
2041 if (nm == NULL) return;
2042 Atomic::inc(&nm->_lock_count);
2043 guarantee(!nm->is_zombie(), "cannot lock a zombie method");
2044 }
2046 void nmethodLocker::unlock_nmethod(nmethod* nm) {
2047 if (nm == NULL) return;
2048 Atomic::dec(&nm->_lock_count);
2049 guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock");
2050 }
2053 // -----------------------------------------------------------------------------
2054 // nmethod::get_deopt_original_pc
2055 //
2056 // Return the original PC for the given PC if:
2057 // (a) the given PC belongs to a nmethod and
2058 // (b) it is a deopt PC
2059 address nmethod::get_deopt_original_pc(const frame* fr) {
2060 if (fr->cb() == NULL) return NULL;
2062 nmethod* nm = fr->cb()->as_nmethod_or_null();
2063 if (nm != NULL && nm->is_deopt_pc(fr->pc()))
2064 return nm->get_original_pc(fr);
2066 return NULL;
2067 }
2070 // -----------------------------------------------------------------------------
2071 // MethodHandle
2073 bool nmethod::is_method_handle_return(address return_pc) {
2074 if (!has_method_handle_invokes()) return false;
2075 PcDesc* pd = pc_desc_at(return_pc);
2076 if (pd == NULL)
2077 return false;
2078 return pd->is_method_handle_invoke();
2079 }
2082 // -----------------------------------------------------------------------------
2083 // Verification
2085 class VerifyOopsClosure: public OopClosure {
2086 nmethod* _nm;
2087 bool _ok;
2088 public:
2089 VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { }
2090 bool ok() { return _ok; }
2091 virtual void do_oop(oop* p) {
2092 if ((*p) == NULL || (*p)->is_oop()) return;
2093 if (_ok) {
2094 _nm->print_nmethod(true);
2095 _ok = false;
2096 }
2097 tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2098 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2099 }
2100 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2101 };
2103 void nmethod::verify() {
2105 // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant
2106 // seems odd.
2108 if( is_zombie() || is_not_entrant() )
2109 return;
2111 // Make sure all the entry points are correctly aligned for patching.
2112 NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point());
2114 assert(method()->is_oop(), "must be valid");
2116 ResourceMark rm;
2118 if (!CodeCache::contains(this)) {
2119 fatal1("nmethod at " INTPTR_FORMAT " not in zone", this);
2120 }
2122 if(is_native_method() )
2123 return;
2125 nmethod* nm = CodeCache::find_nmethod(verified_entry_point());
2126 if (nm != this) {
2127 fatal1("findNMethod did not find this nmethod (" INTPTR_FORMAT ")", this);
2128 }
2130 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2131 if (! p->verify(this)) {
2132 tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this);
2133 }
2134 }
2136 VerifyOopsClosure voc(this);
2137 oops_do(&voc);
2138 assert(voc.ok(), "embedded oops must be OK");
2139 verify_scavenge_root_oops();
2141 verify_scopes();
2142 }
2145 void nmethod::verify_interrupt_point(address call_site) {
2146 // This code does not work in release mode since
2147 // owns_lock only is available in debug mode.
2148 CompiledIC* ic = NULL;
2149 Thread *cur = Thread::current();
2150 if (CompiledIC_lock->owner() == cur ||
2151 ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) &&
2152 SafepointSynchronize::is_at_safepoint())) {
2153 ic = CompiledIC_at(call_site);
2154 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
2155 } else {
2156 MutexLocker ml_verify (CompiledIC_lock);
2157 ic = CompiledIC_at(call_site);
2158 }
2159 PcDesc* pd = pc_desc_at(ic->end_of_call());
2160 assert(pd != NULL, "PcDesc must exist");
2161 for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(),
2162 pd->obj_decode_offset(), pd->should_reexecute());
2163 !sd->is_top(); sd = sd->sender()) {
2164 sd->verify();
2165 }
2166 }
2168 void nmethod::verify_scopes() {
2169 if( !method() ) return; // Runtime stubs have no scope
2170 if (method()->is_native()) return; // Ignore stub methods.
2171 // iterate through all interrupt point
2172 // and verify the debug information is valid.
2173 RelocIterator iter((nmethod*)this);
2174 while (iter.next()) {
2175 address stub = NULL;
2176 switch (iter.type()) {
2177 case relocInfo::virtual_call_type:
2178 verify_interrupt_point(iter.addr());
2179 break;
2180 case relocInfo::opt_virtual_call_type:
2181 stub = iter.opt_virtual_call_reloc()->static_stub();
2182 verify_interrupt_point(iter.addr());
2183 break;
2184 case relocInfo::static_call_type:
2185 stub = iter.static_call_reloc()->static_stub();
2186 //verify_interrupt_point(iter.addr());
2187 break;
2188 case relocInfo::runtime_call_type:
2189 address destination = iter.reloc()->value();
2190 // Right now there is no way to find out which entries support
2191 // an interrupt point. It would be nice if we had this
2192 // information in a table.
2193 break;
2194 }
2195 assert(stub == NULL || stub_contains(stub), "static call stub outside stub section");
2196 }
2197 }
2200 // -----------------------------------------------------------------------------
2201 // Non-product code
2202 #ifndef PRODUCT
2204 class DebugScavengeRoot: public OopClosure {
2205 nmethod* _nm;
2206 bool _ok;
2207 public:
2208 DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { }
2209 bool ok() { return _ok; }
2210 virtual void do_oop(oop* p) {
2211 if ((*p) == NULL || !(*p)->is_scavengable()) return;
2212 if (_ok) {
2213 _nm->print_nmethod(true);
2214 _ok = false;
2215 }
2216 tty->print_cr("*** non-perm oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)",
2217 (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm));
2218 (*p)->print();
2219 }
2220 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
2221 };
2223 void nmethod::verify_scavenge_root_oops() {
2224 if (!on_scavenge_root_list()) {
2225 // Actually look inside, to verify the claim that it's clean.
2226 DebugScavengeRoot debug_scavenge_root(this);
2227 oops_do(&debug_scavenge_root);
2228 if (!debug_scavenge_root.ok())
2229 fatal("found an unadvertised bad non-perm oop in the code cache");
2230 }
2231 assert(scavenge_root_not_marked(), "");
2232 }
2234 #endif // PRODUCT
2236 // Printing operations
2238 void nmethod::print() const {
2239 ResourceMark rm;
2240 ttyLocker ttyl; // keep the following output all in one block
2242 tty->print("Compiled ");
2244 if (is_compiled_by_c1()) {
2245 tty->print("(c1) ");
2246 } else if (is_compiled_by_c2()) {
2247 tty->print("(c2) ");
2248 } else {
2249 tty->print("(nm) ");
2250 }
2252 print_on(tty, "nmethod");
2253 tty->cr();
2254 if (WizardMode) {
2255 tty->print("((nmethod*) "INTPTR_FORMAT ") ", this);
2256 tty->print(" for method " INTPTR_FORMAT , (address)method());
2257 tty->print(" { ");
2258 if (version()) tty->print("v%d ", version());
2259 if (level()) tty->print("l%d ", level());
2260 if (is_in_use()) tty->print("in_use ");
2261 if (is_not_entrant()) tty->print("not_entrant ");
2262 if (is_zombie()) tty->print("zombie ");
2263 if (is_unloaded()) tty->print("unloaded ");
2264 if (on_scavenge_root_list()) tty->print("scavenge_root ");
2265 tty->print_cr("}:");
2266 }
2267 if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2268 (address)this,
2269 (address)this + size(),
2270 size());
2271 if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2272 relocation_begin(),
2273 relocation_end(),
2274 relocation_size());
2275 if (code_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2276 code_begin(),
2277 code_end(),
2278 code_size());
2279 if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2280 stub_begin(),
2281 stub_end(),
2282 stub_size());
2283 if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2284 consts_begin(),
2285 consts_end(),
2286 consts_size());
2287 if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2288 scopes_data_begin(),
2289 scopes_data_end(),
2290 scopes_data_size());
2291 if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2292 scopes_pcs_begin(),
2293 scopes_pcs_end(),
2294 scopes_pcs_size());
2295 if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2296 dependencies_begin(),
2297 dependencies_end(),
2298 dependencies_size());
2299 if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2300 handler_table_begin(),
2301 handler_table_end(),
2302 handler_table_size());
2303 if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2304 nul_chk_table_begin(),
2305 nul_chk_table_end(),
2306 nul_chk_table_size());
2307 if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d",
2308 oops_begin(),
2309 oops_end(),
2310 oops_size());
2311 }
2313 void nmethod::print_code() {
2314 HandleMark hm;
2315 ResourceMark m;
2316 Disassembler::decode(this);
2317 }
2320 #ifndef PRODUCT
2322 void nmethod::print_scopes() {
2323 // Find the first pc desc for all scopes in the code and print it.
2324 ResourceMark rm;
2325 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2326 if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null)
2327 continue;
2329 ScopeDesc* sd = scope_desc_at(p->real_pc(this));
2330 sd->print_on(tty, p);
2331 }
2332 }
2334 void nmethod::print_dependencies() {
2335 ResourceMark rm;
2336 ttyLocker ttyl; // keep the following output all in one block
2337 tty->print_cr("Dependencies:");
2338 for (Dependencies::DepStream deps(this); deps.next(); ) {
2339 deps.print_dependency();
2340 klassOop ctxk = deps.context_type();
2341 if (ctxk != NULL) {
2342 Klass* k = Klass::cast(ctxk);
2343 if (k->oop_is_instance() && ((instanceKlass*)k)->is_dependent_nmethod(this)) {
2344 tty->print_cr(" [nmethod<=klass]%s", k->external_name());
2345 }
2346 }
2347 deps.log_dependency(); // put it into the xml log also
2348 }
2349 }
2352 void nmethod::print_relocations() {
2353 ResourceMark m; // in case methods get printed via the debugger
2354 tty->print_cr("relocations:");
2355 RelocIterator iter(this);
2356 iter.print();
2357 if (UseRelocIndex) {
2358 jint* index_end = (jint*)relocation_end() - 1;
2359 jint index_size = *index_end;
2360 jint* index_start = (jint*)( (address)index_end - index_size );
2361 tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size);
2362 if (index_size > 0) {
2363 jint* ip;
2364 for (ip = index_start; ip+2 <= index_end; ip += 2)
2365 tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT,
2366 ip[0],
2367 ip[1],
2368 header_end()+ip[0],
2369 relocation_begin()-1+ip[1]);
2370 for (; ip < index_end; ip++)
2371 tty->print_cr(" (%d ?)", ip[0]);
2372 tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip++);
2373 tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip);
2374 }
2375 }
2376 }
2379 void nmethod::print_pcs() {
2380 ResourceMark m; // in case methods get printed via debugger
2381 tty->print_cr("pc-bytecode offsets:");
2382 for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) {
2383 p->print(this);
2384 }
2385 }
2387 #endif // PRODUCT
2389 const char* nmethod::reloc_string_for(u_char* begin, u_char* end) {
2390 RelocIterator iter(this, begin, end);
2391 bool have_one = false;
2392 while (iter.next()) {
2393 have_one = true;
2394 switch (iter.type()) {
2395 case relocInfo::none: return "no_reloc";
2396 case relocInfo::oop_type: {
2397 stringStream st;
2398 oop_Relocation* r = iter.oop_reloc();
2399 oop obj = r->oop_value();
2400 st.print("oop(");
2401 if (obj == NULL) st.print("NULL");
2402 else obj->print_value_on(&st);
2403 st.print(")");
2404 return st.as_string();
2405 }
2406 case relocInfo::virtual_call_type: return "virtual_call";
2407 case relocInfo::opt_virtual_call_type: return "optimized virtual_call";
2408 case relocInfo::static_call_type: return "static_call";
2409 case relocInfo::static_stub_type: return "static_stub";
2410 case relocInfo::runtime_call_type: return "runtime_call";
2411 case relocInfo::external_word_type: return "external_word";
2412 case relocInfo::internal_word_type: return "internal_word";
2413 case relocInfo::section_word_type: return "section_word";
2414 case relocInfo::poll_type: return "poll";
2415 case relocInfo::poll_return_type: return "poll_return";
2416 case relocInfo::type_mask: return "type_bit_mask";
2417 }
2418 }
2419 return have_one ? "other" : NULL;
2420 }
2422 // Return a the last scope in (begin..end]
2423 ScopeDesc* nmethod::scope_desc_in(address begin, address end) {
2424 PcDesc* p = pc_desc_near(begin+1);
2425 if (p != NULL && p->real_pc(this) <= end) {
2426 return new ScopeDesc(this, p->scope_decode_offset(),
2427 p->obj_decode_offset(), p->should_reexecute());
2428 }
2429 return NULL;
2430 }
2432 void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) {
2433 if (block_begin == entry_point()) stream->print_cr("[Entry Point]");
2434 if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]");
2435 if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]");
2436 if (block_begin == stub_begin()) stream->print_cr("[Stub Code]");
2437 if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]");
2438 if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]");
2439 if (block_begin == consts_begin()) stream->print_cr("[Constants]");
2440 if (block_begin == entry_point()) {
2441 methodHandle m = method();
2442 if (m.not_null()) {
2443 stream->print(" # ");
2444 m->print_value_on(stream);
2445 stream->cr();
2446 }
2447 if (m.not_null() && !is_osr_method()) {
2448 ResourceMark rm;
2449 int sizeargs = m->size_of_parameters();
2450 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs);
2451 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs);
2452 {
2453 int sig_index = 0;
2454 if (!m->is_static())
2455 sig_bt[sig_index++] = T_OBJECT; // 'this'
2456 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) {
2457 BasicType t = ss.type();
2458 sig_bt[sig_index++] = t;
2459 if (type2size[t] == 2) {
2460 sig_bt[sig_index++] = T_VOID;
2461 } else {
2462 assert(type2size[t] == 1, "size is 1 or 2");
2463 }
2464 }
2465 assert(sig_index == sizeargs, "");
2466 }
2467 const char* spname = "sp"; // make arch-specific?
2468 intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false);
2469 int stack_slot_offset = this->frame_size() * wordSize;
2470 int tab1 = 14, tab2 = 24;
2471 int sig_index = 0;
2472 int arg_index = (m->is_static() ? 0 : -1);
2473 bool did_old_sp = false;
2474 for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) {
2475 bool at_this = (arg_index == -1);
2476 bool at_old_sp = false;
2477 BasicType t = (at_this ? T_OBJECT : ss.type());
2478 assert(t == sig_bt[sig_index], "sigs in sync");
2479 if (at_this)
2480 stream->print(" # this: ");
2481 else
2482 stream->print(" # parm%d: ", arg_index);
2483 stream->move_to(tab1);
2484 VMReg fst = regs[sig_index].first();
2485 VMReg snd = regs[sig_index].second();
2486 if (fst->is_reg()) {
2487 stream->print("%s", fst->name());
2488 if (snd->is_valid()) {
2489 stream->print(":%s", snd->name());
2490 }
2491 } else if (fst->is_stack()) {
2492 int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset;
2493 if (offset == stack_slot_offset) at_old_sp = true;
2494 stream->print("[%s+0x%x]", spname, offset);
2495 } else {
2496 stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd);
2497 }
2498 stream->print(" ");
2499 stream->move_to(tab2);
2500 stream->print("= ");
2501 if (at_this) {
2502 m->method_holder()->print_value_on(stream);
2503 } else {
2504 bool did_name = false;
2505 if (!at_this && ss.is_object()) {
2506 symbolOop name = ss.as_symbol_or_null();
2507 if (name != NULL) {
2508 name->print_value_on(stream);
2509 did_name = true;
2510 }
2511 }
2512 if (!did_name)
2513 stream->print("%s", type2name(t));
2514 }
2515 if (at_old_sp) {
2516 stream->print(" (%s of caller)", spname);
2517 did_old_sp = true;
2518 }
2519 stream->cr();
2520 sig_index += type2size[t];
2521 arg_index += 1;
2522 if (!at_this) ss.next();
2523 }
2524 if (!did_old_sp) {
2525 stream->print(" # ");
2526 stream->move_to(tab1);
2527 stream->print("[%s+0x%x]", spname, stack_slot_offset);
2528 stream->print(" (%s of caller)", spname);
2529 stream->cr();
2530 }
2531 }
2532 }
2533 }
2535 void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) {
2536 // First, find an oopmap in (begin, end].
2537 // We use the odd half-closed interval so that oop maps and scope descs
2538 // which are tied to the byte after a call are printed with the call itself.
2539 address base = instructions_begin();
2540 OopMapSet* oms = oop_maps();
2541 if (oms != NULL) {
2542 for (int i = 0, imax = oms->size(); i < imax; i++) {
2543 OopMap* om = oms->at(i);
2544 address pc = base + om->offset();
2545 if (pc > begin) {
2546 if (pc <= end) {
2547 st->move_to(column);
2548 st->print("; ");
2549 om->print_on(st);
2550 }
2551 break;
2552 }
2553 }
2554 }
2556 // Print any debug info present at this pc.
2557 ScopeDesc* sd = scope_desc_in(begin, end);
2558 if (sd != NULL) {
2559 st->move_to(column);
2560 if (sd->bci() == SynchronizationEntryBCI) {
2561 st->print(";*synchronization entry");
2562 } else {
2563 if (sd->method().is_null()) {
2564 st->print("method is NULL");
2565 } else if (sd->method()->is_native()) {
2566 st->print("method is native");
2567 } else {
2568 address bcp = sd->method()->bcp_from(sd->bci());
2569 Bytecodes::Code bc = Bytecodes::java_code_at(bcp);
2570 st->print(";*%s", Bytecodes::name(bc));
2571 switch (bc) {
2572 case Bytecodes::_invokevirtual:
2573 case Bytecodes::_invokespecial:
2574 case Bytecodes::_invokestatic:
2575 case Bytecodes::_invokeinterface:
2576 {
2577 Bytecode_invoke* invoke = Bytecode_invoke_at(sd->method(), sd->bci());
2578 st->print(" ");
2579 if (invoke->name() != NULL)
2580 invoke->name()->print_symbol_on(st);
2581 else
2582 st->print("<UNKNOWN>");
2583 break;
2584 }
2585 case Bytecodes::_getfield:
2586 case Bytecodes::_putfield:
2587 case Bytecodes::_getstatic:
2588 case Bytecodes::_putstatic:
2589 {
2590 methodHandle sdm = sd->method();
2591 Bytecode_field* field = Bytecode_field_at(sdm(), sdm->bcp_from(sd->bci()));
2592 constantPoolOop sdmc = sdm->constants();
2593 symbolOop name = sdmc->name_ref_at(field->index());
2594 st->print(" ");
2595 if (name != NULL)
2596 name->print_symbol_on(st);
2597 else
2598 st->print("<UNKNOWN>");
2599 }
2600 }
2601 }
2602 }
2604 // Print all scopes
2605 for (;sd != NULL; sd = sd->sender()) {
2606 st->move_to(column);
2607 st->print("; -");
2608 if (sd->method().is_null()) {
2609 st->print("method is NULL");
2610 } else {
2611 sd->method()->print_short_name(st);
2612 }
2613 int lineno = sd->method()->line_number_from_bci(sd->bci());
2614 if (lineno != -1) {
2615 st->print("@%d (line %d)", sd->bci(), lineno);
2616 } else {
2617 st->print("@%d", sd->bci());
2618 }
2619 st->cr();
2620 }
2621 }
2623 // Print relocation information
2624 const char* str = reloc_string_for(begin, end);
2625 if (str != NULL) {
2626 if (sd != NULL) st->cr();
2627 st->move_to(column);
2628 st->print("; {%s}", str);
2629 }
2630 int cont_offset = ImplicitExceptionTable(this).at(begin - instructions_begin());
2631 if (cont_offset != 0) {
2632 st->move_to(column);
2633 st->print("; implicit exception: dispatches to " INTPTR_FORMAT, instructions_begin() + cont_offset);
2634 }
2636 }
2638 #ifndef PRODUCT
2640 void nmethod::print_value_on(outputStream* st) const {
2641 print_on(st, "nmethod");
2642 }
2644 void nmethod::print_calls(outputStream* st) {
2645 RelocIterator iter(this);
2646 while (iter.next()) {
2647 switch (iter.type()) {
2648 case relocInfo::virtual_call_type:
2649 case relocInfo::opt_virtual_call_type: {
2650 VerifyMutexLocker mc(CompiledIC_lock);
2651 CompiledIC_at(iter.reloc())->print();
2652 break;
2653 }
2654 case relocInfo::static_call_type:
2655 st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr());
2656 compiledStaticCall_at(iter.reloc())->print();
2657 break;
2658 }
2659 }
2660 }
2662 void nmethod::print_handler_table() {
2663 ExceptionHandlerTable(this).print();
2664 }
2666 void nmethod::print_nul_chk_table() {
2667 ImplicitExceptionTable(this).print(instructions_begin());
2668 }
2670 void nmethod::print_statistics() {
2671 ttyLocker ttyl;
2672 if (xtty != NULL) xtty->head("statistics type='nmethod'");
2673 nmethod_stats.print_native_nmethod_stats();
2674 nmethod_stats.print_nmethod_stats();
2675 DebugInformationRecorder::print_statistics();
2676 nmethod_stats.print_pc_stats();
2677 Dependencies::print_statistics();
2678 if (xtty != NULL) xtty->tail("statistics");
2679 }
2681 #endif // PRODUCT