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