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