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