equal
deleted
inserted
replaced
1068 if (UseAdaptiveSizePolicy) { |
1068 if (UseAdaptiveSizePolicy) { |
1069 size_policy->minor_collection_end(gch->gc_cause()); |
1069 size_policy->minor_collection_end(gch->gc_cause()); |
1070 size_policy->avg_survived()->sample(from()->used()); |
1070 size_policy->avg_survived()->sample(from()->used()); |
1071 } |
1071 } |
1072 |
1072 |
1073 // We need to use a monotonically non-deccreasing time in ms |
1073 // We need to use a monotonically non-decreasing time in ms |
1074 // or we will see time-warp warnings and os::javaTimeMillis() |
1074 // or we will see time-warp warnings and os::javaTimeMillis() |
1075 // does not guarantee monotonicity. |
1075 // does not guarantee monotonicity. |
1076 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
1076 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
1077 update_time_of_last_gc(now); |
1077 update_time_of_last_gc(now); |
1078 |
1078 |
1400 } |
1400 } |
1401 |
1401 |
1402 #ifndef PRODUCT |
1402 #ifndef PRODUCT |
1403 // It's OK to call this multi-threaded; the worst thing |
1403 // It's OK to call this multi-threaded; the worst thing |
1404 // that can happen is that we'll get a bunch of closely |
1404 // that can happen is that we'll get a bunch of closely |
1405 // spaced simulated oveflows, but that's OK, in fact |
1405 // spaced simulated overflows, but that's OK, in fact |
1406 // probably good as it would exercise the overflow code |
1406 // probably good as it would exercise the overflow code |
1407 // under contention. |
1407 // under contention. |
1408 bool ParNewGeneration::should_simulate_overflow() { |
1408 bool ParNewGeneration::should_simulate_overflow() { |
1409 if (_overflow_counter-- <= 0) { // just being defensive |
1409 if (_overflow_counter-- <= 0) { // just being defensive |
1410 _overflow_counter = ParGCWorkQueueOverflowInterval; |
1410 _overflow_counter = ParGCWorkQueueOverflowInterval; |