119 "Applies to Shenandoah GC dynamic Heuristic mode only " \
120 "(ignored otherwise). Defauls to 0%.") \
121 range(0,100) \
122 \
123 experimental(uintx, ShenandoahInitFreeThreshold, 10, \
124 "Initial remaininig free threshold for adaptive heuristics") \
125 range(0,100) \
126 \
127 experimental(uintx, ShenandoahMinFreeThreshold, 3, \
128 "Minimum remaininig free threshold for adaptive heuristics") \
129 range(0,100) \
130 \
131 experimental(uintx, ShenandoahMaxFreeThreshold, 70, \
132 "Maximum remaininig free threshold for adaptive heuristics") \
133 range(0,100) \
134 \
135 experimental(uintx, ShenandoahHappyCyclesThreshold, 5, \
136 "How many successful marking cycles before improving free " \
137 "threshold for adaptive heuristics") \
138 \
139 experimental(uint, ShenandoahMarkLoopStride, 1000, \
140 "How many items are processed during one marking step") \
141 \
142 experimental(bool, ShenandoahConcurrentCodeRoots, true, \
143 "Scan code roots concurrently, instead of during a pause") \
144 \
145 experimental(bool, ShenandoahNoBarriersForConst, true, \
146 "Constant oops don't need barriers") \
147 \
148 experimental(bool, ShenandoahDontIncreaseWBFreq, true, \
149 "Common 2 WriteBarriers or WriteBarrier and a ReadBarrier only " \
150 "if the resulting WriteBarrier isn't executed more frequently") \
151 \
152 experimental(bool, ShenandoahNoLivenessFullGC, true, \
153 "Skip liveness counting for mark during full GC.") \
154 \
155 experimental(bool, ShenandoahWriteBarrierToIR, true, \
156 "Convert write barrier to IR instead of using assembly blob") \
157 \
158 experimental(bool, ShenandoahWriteBarrierCsetTestInIR, true, \
|
119 "Applies to Shenandoah GC dynamic Heuristic mode only " \
120 "(ignored otherwise). Defauls to 0%.") \
121 range(0,100) \
122 \
123 experimental(uintx, ShenandoahInitFreeThreshold, 10, \
124 "Initial remaininig free threshold for adaptive heuristics") \
125 range(0,100) \
126 \
127 experimental(uintx, ShenandoahMinFreeThreshold, 3, \
128 "Minimum remaininig free threshold for adaptive heuristics") \
129 range(0,100) \
130 \
131 experimental(uintx, ShenandoahMaxFreeThreshold, 70, \
132 "Maximum remaininig free threshold for adaptive heuristics") \
133 range(0,100) \
134 \
135 experimental(uintx, ShenandoahHappyCyclesThreshold, 5, \
136 "How many successful marking cycles before improving free " \
137 "threshold for adaptive heuristics") \
138 \
139 experimental(uintx, ShenandoahPartialInboundThreshold, 10, \
140 "Specifies how many inbound regions a region can have maximum " \
141 "to be considered for collection set in partial collections.") \
142 range(0, 100) \
143 writeable(Always) \
144 \
145 experimental(uint, ShenandoahMarkLoopStride, 1000, \
146 "How many items are processed during one marking step") \
147 \
148 experimental(bool, ShenandoahConcurrentCodeRoots, true, \
149 "Scan code roots concurrently, instead of during a pause") \
150 \
151 experimental(bool, ShenandoahNoBarriersForConst, true, \
152 "Constant oops don't need barriers") \
153 \
154 experimental(bool, ShenandoahDontIncreaseWBFreq, true, \
155 "Common 2 WriteBarriers or WriteBarrier and a ReadBarrier only " \
156 "if the resulting WriteBarrier isn't executed more frequently") \
157 \
158 experimental(bool, ShenandoahNoLivenessFullGC, true, \
159 "Skip liveness counting for mark during full GC.") \
160 \
161 experimental(bool, ShenandoahWriteBarrierToIR, true, \
162 "Convert write barrier to IR instead of using assembly blob") \
163 \
164 experimental(bool, ShenandoahWriteBarrierCsetTestInIR, true, \
|