44 constraint, \ |
44 constraint, \ |
45 writeable) \ |
45 writeable) \ |
46 \ |
46 \ |
47 experimental(size_t, EpsilonPrintHeapStep, 100, \ |
47 experimental(size_t, EpsilonPrintHeapStep, 100, \ |
48 "Print heap occupancy stats with this number of steps. " \ |
48 "Print heap occupancy stats with this number of steps. " \ |
49 "0 turns the printing off. ") \ |
49 "0 turns the printing off.") \ |
50 range(0, max_intx) \ |
50 range(0, max_intx) \ |
51 \ |
51 \ |
52 experimental(size_t, EpsilonUpdateCountersStep, 1 * M, \ |
52 experimental(size_t, EpsilonUpdateCountersStep, 1 * M, \ |
53 "Update heap heap occupancy counters after allocating this much " \ |
53 "Update heap heap occupancy counters after allocating this much " \ |
54 "memory. Higher values would make allocations faster at " \ |
54 "memory. Higher values would make allocations faster at " \ |
55 "the expense of lower resolution in heap counters. ") \ |
55 "the expense of lower resolution in heap counters.") \ |
56 range(1, max_intx) \ |
56 range(1, max_intx) \ |
57 \ |
57 \ |
58 experimental(size_t, EpsilonMaxTLABSize, 4 * M, \ |
58 experimental(size_t, EpsilonMaxTLABSize, 4 * M, \ |
59 "Max TLAB size to use with Epsilon GC. Larger value improves " \ |
59 "Max TLAB size to use with Epsilon GC. Larger value improves " \ |
60 "performance at the expense of per-thread memory waste. This " \ |
60 "performance at the expense of per-thread memory waste. This " \ |
61 "asks TLAB machinery to cap TLAB sizes at this value") \ |
61 "asks TLAB machinery to cap TLAB sizes at this value.") \ |
62 range(1, max_intx) \ |
62 range(1, max_intx) \ |
63 \ |
63 \ |
64 experimental(size_t, EpsilonMinHeapExpand, 128 * M, \ |
64 experimental(size_t, EpsilonMinHeapExpand, 128 * M, \ |
65 "Min expansion step for heap. Larger value improves performance " \ |
65 "Min expansion step for heap. Larger value improves performance " \ |
66 "at the potential expense of memory waste.") \ |
66 "at the potential expense of memory waste.") \ |