/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | cmsGCAdaptivePolicyCounters.hpp | 111 // Average of the deviation of the promoted average 113 // Padded average of the bytes promoted per minor colleciton 136 (jlong) (cms_size_policy()->avg_cms_STW_time()->average() * 142 (jlong) (cms_size_policy()->avg_cms_STW_gc_cost()->average() * 100.0)); 147 (jlong) (cms_size_policy()->avg_initial_pause()->average() * 153 (jlong) (cms_size_policy()-> avg_remark_pause()->average() * 159 (jlong) (cms_size_policy()->avg_initial_pause()->average() * 177 (jlong) (cms_size_policy()->avg_concurrent_interval()->average() * 183 (jlong) (cms_size_policy()->avg_concurrent_gc_cost()->average() * 100.0)); 188 (jlong) cms_size_policy()->avg_cms_free()->average()); [all...] |
H A D | cmsGCAdaptivePolicyCounters.cpp | 63 (jlong) cms_size_policy()->avg_initial_pause()->average(), 69 (jlong) cms_size_policy()->avg_remark_pause()->average(), 76 (jlong) cms_size_policy()->avg_cms_STW_gc_cost()->average(), 83 (jlong) cms_size_policy()->avg_cms_STW_time()->average(), 91 (jlong) cms_size_policy()->avg_concurrent_time()->average(), 99 (jlong) cms_size_policy()->avg_concurrent_interval()->average(), 106 (jlong) cms_size_policy()->avg_concurrent_gc_cost()->average(), 113 (jlong) cms_size_policy()->avg_cms_free_at_sweep()->average(), 120 (jlong) cms_size_policy()->avg_cms_free()->average(), 127 (jlong) cms_size_policy()->avg_cms_promo()->average(), [all...] |
H A D | cmsAdaptiveSizePolicy.hpp | 282 // size has on average resulted in the reduction 326 // This returns the maximum average for the concurrent, ms, and 329 // average of all the different types of major collections. 380 return MAX2(0.0F, _avg_ms_gc_cost->average()); 389 return MAX2(0.0F, _avg_msc_gc_cost->average());
|
H A D | cmsAdaptiveSizePolicy.cpp | 370 "STW gc cost: %f average: %f", STW_collection_cost, 371 avg_cms_STW_gc_cost()->average()); 386 "concurrent gc cost: %f average: %f", 388 _avg_concurrent_gc_cost->average()); 411 // This estimate uses the average eden size. It could also 630 "MSC gc cost: %f average: %f", cost, 631 _avg_msc_gc_cost->average()); 759 "MS gc cost: %f average: %f", cost, _avg_ms_gc_cost->average()); 826 double cms_interval = _avg_concurrent_interval->average(); [all...] |
H A D | concurrentMarkSweepGeneration.inline.hpp | 333 // average will incorrectly lessen the average. It is, however, 340 _gc0_promoted = (size_t) _cms_gen->gc_stats()->avg_promoted()->average();
|
H A D | compactibleFreeListSpace.cpp | 2661 size_t n_blks = (size_t)_blocks_to_claim[word_sz].average(); 2696 // Need to smooth wrt historical average 2707 gclog_or_tty->print_cr("[%d]: %d", i, (size_t)_blocks_to_claim[i].average()); 2747 tid, i, num_retire, _num_blocks[i], (size_t)_blocks_to_claim[i].average());
|
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/ |
H A D | gcUtil.cpp | 31 float average) { 45 float new_avg = exp_avg(average, new_sample, adaptive_weight); 53 // Compute the new weighted average 54 float new_avg = compute_adaptive_average(new_sample, average()); 84 // Compute new adaptive weighted average based on new sample. 87 // Now update the deviation and the padded average. 88 float new_avg = average(); 100 float new_avg = average(); 139 // _intercept = _mean_y.average() - _slope * _mean_x.average(); 30 compute_adaptive_average(float new_sample, float average) argument [all...] |
H A D | gcStats.hpp | 52 return (size_t)_avg_promoted->average(); 55 // Padded average in bytes
|
H A D | gcAdaptivePolicyCounters.hpp | 97 (size_policy()->avg_minor_pause()->average() * 1000.0)); 101 (size_policy()->avg_minor_interval()->average() * 1000.0)); 117 (jlong)(size_policy()->avg_young_live()->average()) 123 (jlong)(size_policy()->_avg_survived->average())
|
H A D | gcUtil.hpp | 36 // A weighted average maintains a running, weighted average 40 // The average is adaptive in that we smooth it for the 48 float _average; // The last computed average 49 unsigned _sample_count; // How often we've sampled this average 69 // Helper function, computes an adaptive weighted average 70 // given a sample and the last average 71 float compute_adaptive_average(float new_sample, float average); 95 float average() const { return _average; } function in class:AdaptiveWeightedAverage 121 // A weighted average tha [all...] |
H A D | gcAdaptivePolicyCounters.cpp | 74 PerfData::U_Ticks, (jlong) _size_policy->_avg_minor_pause->average(), 81 (jlong) _size_policy->_avg_minor_interval->average(), 86 // (the last sample, not the average). It is useful for 87 // verifying the average pause time but not worth putting 116 PerfData::U_Bytes, (jlong) size_policy()->avg_young_live()->average(), 121 PerfData::U_Bytes, (jlong) size_policy()->avg_old_live()->average(),
|
H A D | adaptiveSizePolicy.cpp | 280 "minor gc cost: %f average: %f", collection_cost, 281 _avg_minor_gc_cost->average()); 351 // average cost but the vagaries of finite arithmetic could 360 // average-interval-between-major-gc * AdaptiveSizeMajorGCDecayTimeScale / 363 // if the average-interval-between-major-gc * AdaptiveSizeMajorGCDecayTimeScale 394 gclog_or_tty->print_cr("\ndecaying_gc_cost: major interval average:" 443 // young gen or the average of the live in the young gen. 447 // higher than the average, use the average since it represents 450 MIN2(eden_live, (size_t) avg_eden_live()->average()); [all...] |
H A D | adaptiveSizePolicy.hpp | 206 return MAX2(0.0F, _avg_major_gc_cost->average()); 221 return MAX2(0.0F, _avg_minor_gc_cost->average()); 249 return _avg_major_interval->average();
|
H A D | parGCAllocBuffer.cpp | 112 // Take historical weighted average 115 plab_sz = MAX2(min_size(), (size_t)_filter.average());
|
H A D | mutableNUMASpace.cpp | 428 alloc_rate += lgrp_spaces()->at(j)->alloc_rate()->average(); 433 chunk_size = (size_t)(ls->alloc_rate()->average() / alloc_rate * pages_available) * page_size();
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | aprofiler.hpp | 55 static int average(size_t alloc_size, int alloc_count);
|
H A D | aprofiler.cpp | 102 int AllocationProfiler::average(size_t alloc_size, int alloc_count) { function in class:AllocationProfiler 128 average(alloc_size, alloc_count), 137 average(total_alloc_size, total_alloc_count));
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psGCAdaptivePolicyCounters.hpp | 94 (jlong)(ps_size_policy()->avg_promoted()->average()) 126 (jlong)(ps_size_policy()->_avg_major_pause->average() * 1000.0) 131 (jlong)(ps_size_policy()->_avg_major_interval->average() * 1000.0) 155 (jlong)(ps_size_policy()->avg_base_footprint()->average()) 160 (jlong)(ps_size_policy()->avg_old_live()->average())
|
H A D | psAdaptiveSizePolicy.cpp | 134 "major gc cost: %f average: %f", collection_cost, 135 avg_major_gc_cost()->average()); 260 size_t promo_limit = (size_t)(max_old_gen_size - avg_old_live()->average()); 280 // adjust size of any generation with average paus exceeding 329 avg_major_gc_cost()->average() >= 0.0 && 330 avg_minor_gc_cost()->average() >= 0.0) { 347 size_t free_in_old_gen = (size_t)(max_old_gen_size - avg_old_live()->average()); 356 max_old_gen_size, (size_t) avg_old_live()->average()); 368 max_eden_size, (size_t)avg_young_live()->average()); 393 (size_t)(max_old_gen_size - avg_old_live()->average()); [all...] |
H A D | psAdaptiveSizePolicy.hpp | 184 return (size_t)(avg_base_footprint()->average() + 185 avg_young_live()->average() + 186 avg_old_live()->average()); 254 return (size_t) avg_old_live()->average(); 258 return (size_t)avg_promoted()->average();
|
H A D | psGCAdaptivePolicyCounters.cpp | 99 PerfData::U_Ticks, (jlong) ps_size_policy()->_avg_major_pause->average(), CHECK); 103 PerfData::U_Ticks, (jlong) ps_size_policy()->_avg_major_interval->average(), CHECK); 119 PerfData::U_Bytes, (jlong) ps_size_policy()->avg_base_footprint()->average(), CHECK);
|
/openjdk7/jdk/src/share/classes/java/nio/charset/ |
H A D | Charset-X-Coder.java.template | 139 private final float average$ItypesPerOtype$; 165 * @param average$ItypesPerOtype$ 183 float average$ItypesPerOtype$, 188 if (average$ItypesPerOtype$ <= 0.0f) 190 + "average$ItypesPerOtype$"); 195 if (average$ItypesPerOtype$ > max$ItypesPerOtype$) 196 throw new IllegalArgumentException("average$ItypesPerOtype$" 201 this.average$ItypesPerOtype$ = average$ItypesPerOtype$; 211 * @param average [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1GCPhaseTimes.hpp | 40 // We are caching the sum and average to only have to calculate them once. 42 // threaded code to call sum() and average() multiple times in any order 79 double average(){ 286 return _last_update_rs_times_ms.average(); 294 return _last_scan_rs_times_ms.average(); 298 return _last_obj_copy_times_ms.average(); 302 return _last_termination_times_ms.average(); 306 return _last_ext_root_scan_times_ms.average(); 310 return _last_satb_filtering_times_ms.average();
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | threadLocalAllocBuffer.cpp | 149 size_t alloc = (size_t)(_allocation_fraction.average() * 161 _target_refills, _allocation_fraction.average(), desired_size(), aligned_new_size); 224 // Assuming each thread's active tlab is, on average, 251 // Initial size is a function of the average number of allocating threads. 295 _allocation_fraction.average(), 296 _allocation_fraction.average() * tlab_used / K,
|
H A D | threadLocalAllocBuffer.hpp | 222 return MAX2((unsigned)(_allocating_threads_avg.average() + 0.5), 1U);
|