/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | concurrentMark.inline.hpp | 43 end_idx = MIN2(end_idx, card_bm->size()); 246 HeapWord* end_addr = MIN2(endWord(), mr.end()); 260 HeapWord* next_addr = MIN2(obj_addr + obj->size(), end_addr);
|
H A D | concurrentG1RefineThread.cpp | 64 _threshold = MIN2<int>(cg1r()->thread_threshold_step() * (_worker_id + 1) + cg1r()->green_zone(),
|
H A D | g1BlockOffsetTable.inline.hpp | 78 index = MIN2(index, max_index);
|
H A D | g1GCPhaseTimes.cpp | 101 min = MIN2(val, min);
|
H A D | survRateGroup.cpp | 211 size_t limit = MIN2((int) length, 10);
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | threadLocalAllocBuffer.cpp | 153 new_size = MIN2(MAX2(new_size, min_size()), max_size()); 246 init_sz = MIN2(TLABSize / HeapWordSize, max_size()); 257 init_sz = MIN2(MAX2(init_sz, min_size()), max_size());
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | advancedThresholdPolicy.cpp | 387 return MIN2(next_level, (CompLevel)TieredStopAtLevel); 392 CompLevel osr_level = MIN2((CompLevel) method->highest_osr_comp_level(), 417 CompLevel osr_level = MIN2((CompLevel)method->highest_osr_comp_level(), next_level);
|
H A D | simpleThresholdPolicy.cpp | 330 return MIN2(next_level, (CompLevel)TieredStopAtLevel); 335 CompLevel osr_level = MIN2((CompLevel) method->highest_osr_comp_level(), 361 CompLevel osr_level = MIN2((CompLevel)method->highest_osr_comp_level(), next_level);
|
H A D | simpleThresholdPolicy.hpp | 101 virtual CompLevel initial_compile_level() { return MIN2((CompLevel)TieredStopAtLevel, CompLevel_initial_compile); }
|
H A D | virtualspace.cpp | 692 MIN2(unaligned_new_high, lower_high_boundary()); 694 MIN2(unaligned_new_high, middle_high_boundary()); 696 MIN2(unaligned_new_high, upper_high_boundary());
|
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | cmsAdaptiveSizePolicy.hpp | 394 double result = MIN2(1.0, minor_gc_cost() + msc_gc_cost());
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parNew/ |
H A D | asParNewGeneration.cpp | 166 size_t desired_size = MAX2(MIN2(eden_plus_survivors, max_gen_size()), 331 eden_size = MIN2(requested_eden_size, 437 eden_size = MIN2(eden_size, cur_eden_size); 451 to_end = MIN2(from_start, to_start + requested_survivor_size);
|
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/ |
H A D | mutableNUMASpace.hpp | 104 _invalid_region.set_start(MIN2(_invalid_region.start(), r.start()));
|
H A D | mutableNUMASpace.cpp | 97 size_t words_to_fill = MIN2(words_left_to_fill, CollectedHeap::filler_array_max_size()); 106 touched_words = MIN2((size_t)align_object_size(typeArrayOopDesc::header_size(T_INT)), 117 HeapWord *end = MIN2((HeapWord*)round_to(cur_top + touched_words, page_size()), s->end()); 447 chunk_size = MIN2(chunk_size, upper_bound); 950 char* scan_end = MIN2(scan_start + page_size * page_count, range_end);
|
H A D | adaptiveSizePolicy.hpp | 232 double result = MIN2(1.0, minor_gc_cost() + major_gc_cost());
|
/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | vm_version_x86.cpp | 465 UseSSE = MIN2((intx)3,UseSSE); 467 UseSSE = MIN2((intx)2,UseSSE); 469 UseSSE = MIN2((intx)1,UseSSE); 476 UseAVX = MIN2((intx)1,UseAVX);
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | parMarkBitMap.hpp | 414 const idx_t res_bit = MIN2(find_obj_beg(beg_bit, search_end), end_bit); 424 const idx_t res_bit = MIN2(find_obj_end(beg_bit, search_end), end_bit);
|
H A D | psYoungGen.cpp | 298 size_t desired_size = MAX2(MIN2(eden_plus_survivors, max_size()), 383 HeapWord* delta_end = MIN2(s1->bottom(), s1MR.end()); 401 delta_end = MIN2(s2->bottom(), s2MR.end()); 527 eden_size = MIN2(requested_eden_size, 598 to_end = MIN2(to_end, from_start); 612 eden_size = MIN2(requested_eden_size,
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | stubs.cpp | 187 int i = MIN2(n, number_of_stubs());
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | addnode.cpp | 850 // "MIN2(x+c0,MIN2(y,x+c1))". Pick the smaller constant: "MIN2(x+c0,y)" 910 // See if covers: MIN2(x+c0,MIN2(y+c1,z)) 912 // If (y == x) transform MIN2(x+c0, MIN2(x+c1,z)) into 913 // MIN2(x+c0 or x+c1 which less, z). 914 return new (phase->C) MinINode(phase->transform(new (phase->C) AddINode(x,phase->intcon(MIN2(x_off,y_off)))),r->in(2)); 916 // See if covers: MIN2( [all...] |
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_Compilation.hpp | 191 return MIN2((unsigned int)NMethodSizeLimit,32*K);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | globalDefinitions.cpp | 333 div = MIN2(a, b);
|
H A D | globalDefinitions.hpp | 970 template<class T> inline T MIN2(T a, T b) { return (a < b) ? a : b; } function 972 template<class T> inline T MIN3(T a, T b, T c) { return MIN2(MIN2(a, b), c); } 974 template<class T> inline T MIN4(T a, T b, T c, T d) { return MIN2(MIN3(a, b, c), d); }
|
H A D | workgroup.hpp | 342 _active_workers = MIN2(v, _total_workers);
|
H A D | yieldingWorkgroup.cpp | 126 _active_workers = MIN2(requested_size, total_workers());
|