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