Print this page
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/runtime/sweeper.cpp
+++ new/src/share/vm/runtime/sweeper.cpp
1 1 /*
2 2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #include "precompiled.hpp"
26 26 #include "code/codeCache.hpp"
27 27 #include "code/nmethod.hpp"
28 28 #include "compiler/compileBroker.hpp"
29 29 #include "memory/resourceArea.hpp"
30 30 #include "oops/methodOop.hpp"
31 31 #include "runtime/atomic.hpp"
32 32 #include "runtime/compilationPolicy.hpp"
33 33 #include "runtime/mutexLocker.hpp"
34 34 #include "runtime/os.hpp"
35 35 #include "runtime/sweeper.hpp"
36 36 #include "runtime/vm_operations.hpp"
37 37 #include "utilities/events.hpp"
38 38 #include "utilities/xmlstream.hpp"
39 39
40 40 #ifdef ASSERT
41 41
42 42 #define SWEEP(nm) record_sweep(nm, __LINE__)
43 43 // Sweeper logging code
44 44 class SweeperRecord {
45 45 public:
46 46 int traversal;
47 47 int invocation;
48 48 int compile_id;
49 49 long traversal_mark;
50 50 int state;
51 51 const char* kind;
52 52 address vep;
53 53 address uep;
54 54 int line;
55 55
56 56 void print() {
57 57 tty->print_cr("traversal = %d invocation = %d compile_id = %d %s uep = " PTR_FORMAT " vep = "
58 58 PTR_FORMAT " state = %d traversal_mark %d line = %d",
59 59 traversal,
60 60 invocation,
61 61 compile_id,
62 62 kind == NULL ? "" : kind,
63 63 uep,
64 64 vep,
65 65 state,
66 66 traversal_mark,
67 67 line);
68 68 }
69 69 };
70 70
71 71 static int _sweep_index = 0;
72 72 static SweeperRecord* _records = NULL;
73 73
74 74 void NMethodSweeper::report_events(int id, address entry) {
75 75 if (_records != NULL) {
76 76 for (int i = _sweep_index; i < SweeperLogEntries; i++) {
77 77 if (_records[i].uep == entry ||
78 78 _records[i].vep == entry ||
79 79 _records[i].compile_id == id) {
80 80 _records[i].print();
81 81 }
82 82 }
83 83 for (int i = 0; i < _sweep_index; i++) {
84 84 if (_records[i].uep == entry ||
85 85 _records[i].vep == entry ||
86 86 _records[i].compile_id == id) {
87 87 _records[i].print();
88 88 }
89 89 }
90 90 }
91 91 }
92 92
93 93 void NMethodSweeper::report_events() {
94 94 if (_records != NULL) {
95 95 for (int i = _sweep_index; i < SweeperLogEntries; i++) {
96 96 // skip empty records
97 97 if (_records[i].vep == NULL) continue;
98 98 _records[i].print();
99 99 }
100 100 for (int i = 0; i < _sweep_index; i++) {
101 101 // skip empty records
102 102 if (_records[i].vep == NULL) continue;
103 103 _records[i].print();
104 104 }
105 105 }
106 106 }
107 107
108 108 void NMethodSweeper::record_sweep(nmethod* nm, int line) {
109 109 if (_records != NULL) {
110 110 _records[_sweep_index].traversal = _traversals;
111 111 _records[_sweep_index].traversal_mark = nm->_stack_traversal_mark;
112 112 _records[_sweep_index].invocation = _invocations;
113 113 _records[_sweep_index].compile_id = nm->compile_id();
114 114 _records[_sweep_index].kind = nm->compile_kind();
115 115 _records[_sweep_index].state = nm->_state;
116 116 _records[_sweep_index].vep = nm->verified_entry_point();
117 117 _records[_sweep_index].uep = nm->entry_point();
118 118 _records[_sweep_index].line = line;
119 119
120 120 _sweep_index = (_sweep_index + 1) % SweeperLogEntries;
121 121 }
122 122 }
123 123 #else
124 124 #define SWEEP(nm)
125 125 #endif
126 126
127 127
128 128 long NMethodSweeper::_traversals = 0; // No. of stack traversals performed
129 129 nmethod* NMethodSweeper::_current = NULL; // Current nmethod
130 130 int NMethodSweeper::_seen = 0 ; // No. of nmethods we have currently processed in current pass of CodeCache
131 131
132 132 volatile int NMethodSweeper::_invocations = 0; // No. of invocations left until we are completed with this pass
133 133 volatile int NMethodSweeper::_sweep_started = 0; // Whether a sweep is in progress.
134 134
135 135 jint NMethodSweeper::_locked_seen = 0;
136 136 jint NMethodSweeper::_not_entrant_seen_on_stack = 0;
137 137 bool NMethodSweeper::_rescan = false;
138 138 bool NMethodSweeper::_do_sweep = false;
139 139 bool NMethodSweeper::_was_full = false;
140 140 jint NMethodSweeper::_advise_to_sweep = 0;
141 141 jlong NMethodSweeper::_last_was_full = 0;
142 142 uint NMethodSweeper::_highest_marked = 0;
143 143 long NMethodSweeper::_was_full_traversal = 0;
144 144
145 145 class MarkActivationClosure: public CodeBlobClosure {
146 146 public:
147 147 virtual void do_code_blob(CodeBlob* cb) {
148 148 // If we see an activation belonging to a non_entrant nmethod, we mark it.
149 149 if (cb->is_nmethod() && ((nmethod*)cb)->is_not_entrant()) {
150 150 ((nmethod*)cb)->mark_as_seen_on_stack();
151 151 }
152 152 }
153 153 };
154 154 static MarkActivationClosure mark_activation_closure;
155 155
156 156 void NMethodSweeper::scan_stacks() {
157 157 assert(SafepointSynchronize::is_at_safepoint(), "must be executed at a safepoint");
158 158 if (!MethodFlushing) return;
159 159 _do_sweep = true;
160 160
161 161 // No need to synchronize access, since this is always executed at a
162 162 // safepoint. If we aren't in the middle of scan and a rescan
163 163 // hasn't been requested then just return. If UseCodeCacheFlushing is on and
164 164 // code cache flushing is in progress, don't skip sweeping to help make progress
165 165 // clearing space in the code cache.
166 166 if ((_current == NULL && !_rescan) && !(UseCodeCacheFlushing && !CompileBroker::should_compile_new_jobs())) {
167 167 _do_sweep = false;
168 168 return;
169 169 }
170 170
171 171 // Make sure CompiledIC_lock in unlocked, since we might update some
172 172 // inline caches. If it is, we just bail-out and try later.
173 173 if (CompiledIC_lock->is_locked() || Patching_lock->is_locked()) return;
174 174
175 175 // Check for restart
176 176 assert(CodeCache::find_blob_unsafe(_current) == _current, "Sweeper nmethod cached state invalid");
177 177 if (_current == NULL) {
178 178 _seen = 0;
179 179 _invocations = NmethodSweepFraction;
180 180 _current = CodeCache::first_nmethod();
181 181 _traversals += 1;
182 182 if (PrintMethodFlushing) {
183 183 tty->print_cr("### Sweep: stack traversal %d", _traversals);
184 184 }
185 185 Threads::nmethods_do(&mark_activation_closure);
186 186
187 187 // reset the flags since we started a scan from the beginning.
188 188 _rescan = false;
189 189 _locked_seen = 0;
190 190 _not_entrant_seen_on_stack = 0;
191 191 }
192 192
193 193 if (UseCodeCacheFlushing) {
194 194 if (!CodeCache::needs_flushing()) {
195 195 // scan_stacks() runs during a safepoint, no race with setters
196 196 _advise_to_sweep = 0;
197 197 }
198 198
199 199 if (was_full()) {
200 200 // There was some progress so attempt to restart the compiler
201 201 jlong now = os::javaTimeMillis();
202 202 jlong max_interval = (jlong)MinCodeCacheFlushingInterval * (jlong)1000;
203 203 jlong curr_interval = now - _last_was_full;
204 204 if ((!CodeCache::needs_flushing()) && (curr_interval > max_interval)) {
205 205 CompileBroker::set_should_compile_new_jobs(CompileBroker::run_compilation);
206 206 set_was_full(false);
207 207
208 208 // Update the _last_was_full time so we can tell how fast the
209 209 // code cache is filling up
210 210 _last_was_full = os::javaTimeMillis();
211 211
212 212 log_sweep("restart_compiler");
213 213 }
214 214 }
215 215 }
216 216 }
217 217
218 218 void NMethodSweeper::possibly_sweep() {
219 219 assert(JavaThread::current()->thread_state() == _thread_in_vm, "must run in vm mode");
220 220 if ((!MethodFlushing) || (!_do_sweep)) return;
221 221
222 222 if (_invocations > 0) {
223 223 // Only one thread at a time will sweep
224 224 jint old = Atomic::cmpxchg( 1, &_sweep_started, 0 );
225 225 if (old != 0) {
226 226 return;
227 227 }
228 228 #ifdef ASSERT
229 229 if (LogSweeper && _records == NULL) {
230 230 // Create the ring buffer for the logging code
231 231 _records = NEW_C_HEAP_ARRAY(SweeperRecord, SweeperLogEntries);
232 232 memset(_records, 0, sizeof(SweeperRecord) * SweeperLogEntries);
233 233 }
234 234 #endif
235 235 if (_invocations > 0) {
236 236 sweep_code_cache();
237 237 _invocations--;
238 238 }
239 239 _sweep_started = 0;
240 240 }
241 241 }
242 242
243 243 void NMethodSweeper::sweep_code_cache() {
244 244 #ifdef ASSERT
245 245 jlong sweep_start;
246 246 if (PrintMethodFlushing) {
247 247 sweep_start = os::javaTimeMillis();
248 248 }
249 249 #endif
250 250 if (PrintMethodFlushing && Verbose) {
251 251 tty->print_cr("### Sweep at %d out of %d. Invocations left: %d", _seen, CodeCache::nof_nmethods(), _invocations);
252 252 }
253 253
254 254 // We want to visit all nmethods after NmethodSweepFraction
255 255 // invocations so divide the remaining number of nmethods by the
256 256 // remaining number of invocations. This is only an estimate since
257 257 // the number of nmethods changes during the sweep so the final
258 258 // stage must iterate until it there are no more nmethods.
|
↓ open down ↓ |
258 lines elided |
↑ open up ↑ |
259 259 int todo = (CodeCache::nof_nmethods() - _seen) / _invocations;
260 260
261 261 assert(!SafepointSynchronize::is_at_safepoint(), "should not be in safepoint when we get here");
262 262 assert(!CodeCache_lock->owned_by_self(), "just checking");
263 263
264 264 {
265 265 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
266 266
267 267 // The last invocation iterates until there are no more nmethods
268 268 for (int i = 0; (i < todo || _invocations == 1) && _current != NULL; i++) {
269 + if (SafepointSynchronize::is_synchronizing()) { // Safepoint request
270 + if (PrintMethodFlushing && Verbose) {
271 + tty->print_cr("### Sweep at %d out of %d, invocation: %d, yielding to safepoint", _seen, CodeCache::nof_nmethods(), _invocations);
272 + }
273 + MutexUnlockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
269 274
275 + assert(Thread::current()->is_Java_thread(), "should be java thread");
276 + JavaThread* thread = (JavaThread*)Thread::current();
277 + ThreadBlockInVM tbivm(thread);
278 + thread->java_suspend_self();
279 + }
270 280 // Since we will give up the CodeCache_lock, always skip ahead
271 281 // to the next nmethod. Other blobs can be deleted by other
272 282 // threads but nmethods are only reclaimed by the sweeper.
273 283 nmethod* next = CodeCache::next_nmethod(_current);
274 284
275 285 // Now ready to process nmethod and give up CodeCache_lock
276 286 {
277 287 MutexUnlockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
278 288 process_nmethod(_current);
279 289 }
280 290 _seen++;
281 291 _current = next;
282 292 }
283 293 }
284 294
285 295 assert(_invocations > 1 || _current == NULL, "must have scanned the whole cache");
286 296
287 297 if (_current == NULL && !_rescan && (_locked_seen || _not_entrant_seen_on_stack)) {
288 298 // we've completed a scan without making progress but there were
289 299 // nmethods we were unable to process either because they were
290 300 // locked or were still on stack. We don't have to aggresively
291 301 // clean them up so just stop scanning. We could scan once more
292 302 // but that complicates the control logic and it's unlikely to
293 303 // matter much.
294 304 if (PrintMethodFlushing) {
295 305 tty->print_cr("### Couldn't make progress on some nmethods so stopping sweep");
296 306 }
297 307 }
298 308
299 309 #ifdef ASSERT
300 310 if(PrintMethodFlushing) {
301 311 jlong sweep_end = os::javaTimeMillis();
302 312 tty->print_cr("### sweeper: sweep time(%d): " INT64_FORMAT, _invocations, sweep_end - sweep_start);
303 313 }
304 314 #endif
305 315
306 316 if (_invocations == 1) {
307 317 log_sweep("finished");
308 318 }
309 319 }
310 320
311 321 class NMethodMarker: public StackObj {
312 322 private:
313 323 CompilerThread* _thread;
314 324 public:
315 325 NMethodMarker(nmethod* nm) {
316 326 _thread = CompilerThread::current();
317 327 _thread->set_scanned_nmethod(nm);
318 328 }
319 329 ~NMethodMarker() {
320 330 _thread->set_scanned_nmethod(NULL);
321 331 }
322 332 };
323 333
324 334
325 335 void NMethodSweeper::process_nmethod(nmethod *nm) {
326 336 assert(!CodeCache_lock->owned_by_self(), "just checking");
327 337
328 338 // Make sure this nmethod doesn't get unloaded during the scan,
329 339 // since the locks acquired below might safepoint.
330 340 NMethodMarker nmm(nm);
331 341
332 342 SWEEP(nm);
333 343
334 344 // Skip methods that are currently referenced by the VM
335 345 if (nm->is_locked_by_vm()) {
336 346 // But still remember to clean-up inline caches for alive nmethods
337 347 if (nm->is_alive()) {
338 348 // Clean-up all inline caches that points to zombie/non-reentrant methods
339 349 MutexLocker cl(CompiledIC_lock);
340 350 nm->cleanup_inline_caches();
341 351 SWEEP(nm);
342 352 } else {
343 353 _locked_seen++;
344 354 SWEEP(nm);
345 355 }
346 356 return;
347 357 }
348 358
349 359 if (nm->is_zombie()) {
350 360 // If it is first time, we see nmethod then we mark it. Otherwise,
351 361 // we reclame it. When we have seen a zombie method twice, we know that
352 362 // there are no inline caches that refer to it.
353 363 if (nm->is_marked_for_reclamation()) {
354 364 assert(!nm->is_locked_by_vm(), "must not flush locked nmethods");
355 365 if (PrintMethodFlushing && Verbose) {
356 366 tty->print_cr("### Nmethod %3d/" PTR_FORMAT " (marked for reclamation) being flushed", nm->compile_id(), nm);
357 367 }
358 368 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
359 369 nm->flush();
360 370 } else {
361 371 if (PrintMethodFlushing && Verbose) {
362 372 tty->print_cr("### Nmethod %3d/" PTR_FORMAT " (zombie) being marked for reclamation", nm->compile_id(), nm);
363 373 }
364 374 nm->mark_for_reclamation();
365 375 _rescan = true;
366 376 SWEEP(nm);
367 377 }
368 378 } else if (nm->is_not_entrant()) {
369 379 // If there is no current activations of this method on the
370 380 // stack we can safely convert it to a zombie method
371 381 if (nm->can_not_entrant_be_converted()) {
372 382 if (PrintMethodFlushing && Verbose) {
373 383 tty->print_cr("### Nmethod %3d/" PTR_FORMAT " (not entrant) being made zombie", nm->compile_id(), nm);
374 384 }
375 385 nm->make_zombie();
376 386 _rescan = true;
377 387 SWEEP(nm);
378 388 } else {
379 389 // Still alive, clean up its inline caches
380 390 MutexLocker cl(CompiledIC_lock);
381 391 nm->cleanup_inline_caches();
382 392 // we coudn't transition this nmethod so don't immediately
383 393 // request a rescan. If this method stays on the stack for a
384 394 // long time we don't want to keep rescanning the code cache.
385 395 _not_entrant_seen_on_stack++;
386 396 SWEEP(nm);
387 397 }
388 398 } else if (nm->is_unloaded()) {
389 399 // Unloaded code, just make it a zombie
390 400 if (PrintMethodFlushing && Verbose)
391 401 tty->print_cr("### Nmethod %3d/" PTR_FORMAT " (unloaded) being made zombie", nm->compile_id(), nm);
392 402 if (nm->is_osr_method()) {
393 403 // No inline caches will ever point to osr methods, so we can just remove it
394 404 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
395 405 SWEEP(nm);
396 406 nm->flush();
397 407 } else {
398 408 nm->make_zombie();
399 409 _rescan = true;
400 410 SWEEP(nm);
401 411 }
402 412 } else {
403 413 assert(nm->is_alive(), "should be alive");
404 414
405 415 if (UseCodeCacheFlushing) {
406 416 if ((nm->method()->code() != nm) && !(nm->is_locked_by_vm()) && !(nm->is_osr_method()) &&
407 417 (_traversals > _was_full_traversal+2) && (((uint)nm->compile_id()) < _highest_marked) &&
408 418 CodeCache::needs_flushing()) {
409 419 // This method has not been called since the forced cleanup happened
410 420 nm->make_not_entrant();
411 421 }
412 422 }
413 423
414 424 // Clean-up all inline caches that points to zombie/non-reentrant methods
415 425 MutexLocker cl(CompiledIC_lock);
416 426 nm->cleanup_inline_caches();
417 427 SWEEP(nm);
418 428 }
419 429 }
420 430
421 431 // Code cache unloading: when compilers notice the code cache is getting full,
422 432 // they will call a vm op that comes here. This code attempts to speculatively
423 433 // unload the oldest half of the nmethods (based on the compile job id) by
424 434 // saving the old code in a list in the CodeCache. Then
425 435 // execution resumes. If a method so marked is not called by the second sweeper
426 436 // stack traversal after the current one, the nmethod will be marked non-entrant and
427 437 // got rid of by normal sweeping. If the method is called, the methodOop's
428 438 // _code field is restored and the methodOop/nmethod
429 439 // go back to their normal state.
430 440 void NMethodSweeper::handle_full_code_cache(bool is_full) {
431 441 // Only the first one to notice can advise us to start early cleaning
432 442 if (!is_full){
433 443 jint old = Atomic::cmpxchg( 1, &_advise_to_sweep, 0 );
434 444 if (old != 0) {
435 445 return;
436 446 }
437 447 }
438 448
439 449 if (is_full) {
440 450 // Since code cache is full, immediately stop new compiles
441 451 bool did_set = CompileBroker::set_should_compile_new_jobs(CompileBroker::stop_compilation);
442 452 if (!did_set) {
443 453 // only the first to notice can start the cleaning,
444 454 // others will go back and block
445 455 return;
446 456 }
447 457 set_was_full(true);
448 458
449 459 // If we run out within MinCodeCacheFlushingInterval of the last unload time, give up
450 460 jlong now = os::javaTimeMillis();
451 461 jlong max_interval = (jlong)MinCodeCacheFlushingInterval * (jlong)1000;
452 462 jlong curr_interval = now - _last_was_full;
453 463 if (curr_interval < max_interval) {
454 464 _rescan = true;
455 465 log_sweep("disable_compiler", "flushing_interval='" UINT64_FORMAT "'",
456 466 curr_interval/1000);
457 467 return;
458 468 }
459 469 }
460 470
461 471 VM_HandleFullCodeCache op(is_full);
462 472 VMThread::execute(&op);
463 473
464 474 // rescan again as soon as possible
465 475 _rescan = true;
466 476 }
467 477
468 478 void NMethodSweeper::speculative_disconnect_nmethods(bool is_full) {
469 479 // If there was a race in detecting full code cache, only run
470 480 // one vm op for it or keep the compiler shut off
471 481
472 482 debug_only(jlong start = os::javaTimeMillis();)
473 483
474 484 if ((!was_full()) && (is_full)) {
475 485 if (!CodeCache::needs_flushing()) {
476 486 log_sweep("restart_compiler");
477 487 CompileBroker::set_should_compile_new_jobs(CompileBroker::run_compilation);
478 488 return;
479 489 }
480 490 }
481 491
482 492 // Traverse the code cache trying to dump the oldest nmethods
483 493 uint curr_max_comp_id = CompileBroker::get_compilation_id();
484 494 uint flush_target = ((curr_max_comp_id - _highest_marked) >> 1) + _highest_marked;
485 495 log_sweep("start_cleaning");
486 496
487 497 nmethod* nm = CodeCache::alive_nmethod(CodeCache::first());
488 498 jint disconnected = 0;
489 499 jint made_not_entrant = 0;
490 500 while ((nm != NULL)){
491 501 uint curr_comp_id = nm->compile_id();
492 502
493 503 // OSR methods cannot be flushed like this. Also, don't flush native methods
494 504 // since they are part of the JDK in most cases
495 505 if (nm->is_in_use() && (!nm->is_osr_method()) && (!nm->is_locked_by_vm()) &&
496 506 (!nm->is_native_method()) && ((curr_comp_id < flush_target))) {
497 507
498 508 if ((nm->method()->code() == nm)) {
499 509 // This method has not been previously considered for
500 510 // unloading or it was restored already
501 511 CodeCache::speculatively_disconnect(nm);
502 512 disconnected++;
503 513 } else if (nm->is_speculatively_disconnected()) {
504 514 // This method was previously considered for preemptive unloading and was not called since then
505 515 CompilationPolicy::policy()->delay_compilation(nm->method());
506 516 nm->make_not_entrant();
507 517 made_not_entrant++;
508 518 }
509 519
510 520 if (curr_comp_id > _highest_marked) {
511 521 _highest_marked = curr_comp_id;
512 522 }
513 523 }
514 524 nm = CodeCache::alive_nmethod(CodeCache::next(nm));
515 525 }
516 526
517 527 log_sweep("stop_cleaning",
518 528 "disconnected='" UINT32_FORMAT "' made_not_entrant='" UINT32_FORMAT "'",
519 529 disconnected, made_not_entrant);
520 530
521 531 // Shut off compiler. Sweeper will start over with a new stack scan and
522 532 // traversal cycle and turn it back on if it clears enough space.
523 533 if (was_full()) {
524 534 _last_was_full = os::javaTimeMillis();
525 535 CompileBroker::set_should_compile_new_jobs(CompileBroker::stop_compilation);
526 536 }
527 537
528 538 // After two more traversals the sweeper will get rid of unrestored nmethods
529 539 _was_full_traversal = _traversals;
530 540 #ifdef ASSERT
531 541 jlong end = os::javaTimeMillis();
532 542 if(PrintMethodFlushing && Verbose) {
533 543 tty->print_cr("### sweeper: unload time: " INT64_FORMAT, end-start);
534 544 }
535 545 #endif
536 546 }
537 547
538 548
539 549 // Print out some state information about the current sweep and the
540 550 // state of the code cache if it's requested.
541 551 void NMethodSweeper::log_sweep(const char* msg, const char* format, ...) {
542 552 if (PrintMethodFlushing) {
543 553 stringStream s;
544 554 // Dump code cache state into a buffer before locking the tty,
545 555 // because log_state() will use locks causing lock conflicts.
546 556 CodeCache::log_state(&s);
547 557
548 558 ttyLocker ttyl;
549 559 tty->print("### sweeper: %s ", msg);
550 560 if (format != NULL) {
551 561 va_list ap;
552 562 va_start(ap, format);
553 563 tty->vprint(format, ap);
554 564 va_end(ap);
555 565 }
556 566 tty->print_cr(s.as_string());
557 567 }
558 568
559 569 if (LogCompilation && (xtty != NULL)) {
560 570 stringStream s;
561 571 // Dump code cache state into a buffer before locking the tty,
562 572 // because log_state() will use locks causing lock conflicts.
563 573 CodeCache::log_state(&s);
564 574
565 575 ttyLocker ttyl;
566 576 xtty->begin_elem("sweeper state='%s' traversals='" INTX_FORMAT "' ", msg, (intx)traversal_count());
567 577 if (format != NULL) {
568 578 va_list ap;
569 579 va_start(ap, format);
570 580 xtty->vprint(format, ap);
571 581 va_end(ap);
572 582 }
573 583 xtty->print(s.as_string());
574 584 xtty->stamp();
575 585 xtty->end_elem();
576 586 }
577 587 }
|
↓ open down ↓ |
298 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX