1 /*
2 * Copyright (c) 2018, 2024, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2017, Red Hat, Inc. and/or its affiliates.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
24 */
25
26 #include "precompiled.hpp"
27 #include "cds/cdsConfig.hpp"
28 #include "gc/g1/g1Arguments.hpp"
29 #include "gc/g1/g1CardSet.hpp"
30 #include "gc/g1/g1CardSetContainers.inline.hpp"
31 #include "gc/g1/g1CollectedHeap.inline.hpp"
32 #include "gc/g1/g1HeapRegion.hpp"
33 #include "gc/g1/g1HeapRegionBounds.inline.hpp"
34 #include "gc/g1/g1HeapRegionRemSet.hpp"
35 #include "gc/g1/g1HeapVerifier.hpp"
36 #include "gc/shared/cardTable.hpp"
37 #include "gc/shared/gcArguments.hpp"
38 #include "gc/shared/workerPolicy.hpp"
39 #include "runtime/globals.hpp"
40 #include "runtime/globals_extension.hpp"
41 #include "runtime/java.hpp"
42
43 static size_t calculate_heap_alignment(size_t space_alignment) {
44 size_t card_table_alignment = CardTable::ct_max_alignment_constraint();
45 size_t page_size = UseLargePages ? os::large_page_size() : os::vm_page_size();
46 return MAX3(card_table_alignment, space_alignment, page_size);
47 }
48
49 void G1Arguments::initialize_alignments() {
50 // Initialize card size before initializing alignments
51 CardTable::initialize_card_size();
52
53 // Set up the region size and associated fields.
54 //
55 // There is a circular dependency here. We base the region size on the heap
56 // size, but the heap size should be aligned with the region size. To get
57 // around this we use the unaligned values for the heap.
58 G1HeapRegion::setup_heap_region_size(MaxHeapSize);
59
60 SpaceAlignment = G1HeapRegion::GrainBytes;
61 HeapAlignment = calculate_heap_alignment(SpaceAlignment);
62
63 // We need to initialize card set configuration as soon as heap region size is
64 // known as it depends on it and is used really early.
65 initialize_card_set_configuration();
66 // Needs remembered set initialization as the ergonomics are based
67 // on it.
68 if (FLAG_IS_DEFAULT(G1EagerReclaimRemSetThreshold)) {
69 FLAG_SET_ERGO(G1EagerReclaimRemSetThreshold, G1RemSetArrayOfCardsEntries);
70 }
71 }
72
73 size_t G1Arguments::conservative_max_heap_alignment() {
74 return G1HeapRegion::max_region_size();
75 }
76
77 void G1Arguments::initialize_verification_types() {
78 if (strlen(VerifyGCType) > 0) {
79 const char delimiter[] = " ,\n";
80 size_t length = strlen(VerifyGCType);
81 char* type_list = NEW_C_HEAP_ARRAY(char, length + 1, mtInternal);
82 strncpy(type_list, VerifyGCType, length + 1);
83 char* save_ptr;
84
85 char* token = strtok_r(type_list, delimiter, &save_ptr);
86 while (token != nullptr) {
87 parse_verification_type(token);
88 token = strtok_r(nullptr, delimiter, &save_ptr);
89 }
90 FREE_C_HEAP_ARRAY(char, type_list);
91 }
92 }
93
94 void G1Arguments::parse_verification_type(const char* type) {
95 if (strcmp(type, "young-normal") == 0) {
96 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyYoungNormal);
97 } else if (strcmp(type, "concurrent-start") == 0) {
98 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyConcurrentStart);
99 } else if (strcmp(type, "mixed") == 0) {
100 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyMixed);
101 } else if (strcmp(type, "young-evac-fail") == 0) {
102 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyYoungEvacFail);
103 } else if (strcmp(type, "remark") == 0) {
104 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyRemark);
105 } else if (strcmp(type, "cleanup") == 0) {
106 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyCleanup);
107 } else if (strcmp(type, "full") == 0) {
108 G1HeapVerifier::enable_verification_type(G1HeapVerifier::G1VerifyFull);
109 } else {
110 log_warning(gc, verify)("VerifyGCType: '%s' is unknown. Available types are: "
111 "young-normal, young-evac-fail, concurrent-start, mixed, remark, cleanup and full", type);
112 }
113 }
114
115 // Returns the maximum number of workers to be used in a concurrent
116 // phase based on the number of GC workers being used in a STW
117 // phase.
118 static uint scale_concurrent_worker_threads(uint num_gc_workers) {
119 return MAX2((num_gc_workers + 2) / 4, 1U);
120 }
121
122 void G1Arguments::initialize_mark_stack_size() {
123 if (FLAG_IS_DEFAULT(MarkStackSize)) {
124 size_t mark_stack_size = MIN2(MarkStackSizeMax,
125 MAX2(MarkStackSize, (size_t)ConcGCThreads * TASKQUEUE_SIZE));
126 FLAG_SET_ERGO(MarkStackSize, mark_stack_size);
127 }
128 }
129
130 void G1Arguments::initialize_card_set_configuration() {
131 assert(G1HeapRegion::LogOfHRGrainBytes != 0, "not initialized");
132 // Array of Cards card set container globals.
133 const uint LOG_M = 20;
134 assert(log2i_exact(G1HeapRegionBounds::min_size()) == LOG_M, "inv");
135 assert(G1HeapRegion::LogOfHRGrainBytes >= LOG_M, "from the above");
136 uint region_size_log_mb = G1HeapRegion::LogOfHRGrainBytes - LOG_M;
137
138 if (FLAG_IS_DEFAULT(G1RemSetArrayOfCardsEntries)) {
139 uint max_cards_in_inline_ptr = G1CardSetConfiguration::max_cards_in_inline_ptr(G1HeapRegion::LogCardsPerRegion);
140 FLAG_SET_ERGO(G1RemSetArrayOfCardsEntries, MAX2(max_cards_in_inline_ptr * 2,
141 G1RemSetArrayOfCardsEntriesBase << region_size_log_mb));
142 }
143
144 // Howl card set container globals.
145 if (FLAG_IS_DEFAULT(G1RemSetHowlNumBuckets)) {
146 FLAG_SET_ERGO(G1RemSetHowlNumBuckets, G1CardSetHowl::num_buckets(G1HeapRegion::CardsPerRegion,
147 G1RemSetArrayOfCardsEntries,
148 G1RemSetHowlMaxNumBuckets));
149 }
150
151 if (FLAG_IS_DEFAULT(G1RemSetHowlMaxNumBuckets)) {
152 FLAG_SET_ERGO(G1RemSetHowlMaxNumBuckets, MAX2(G1RemSetHowlMaxNumBuckets, G1RemSetHowlNumBuckets));
153 } else if (G1RemSetHowlMaxNumBuckets < G1RemSetHowlNumBuckets) {
154 FormatBuffer<> buf("Maximum Howl card set container bucket size %u smaller than requested bucket size %u",
155 G1RemSetHowlMaxNumBuckets, G1RemSetHowlNumBuckets);
156 vm_exit_during_initialization(buf);
157 }
158 }
159
160 void G1Arguments::initialize() {
161 GCArguments::initialize();
162 assert(UseG1GC, "Error");
163 FLAG_SET_DEFAULT(ParallelGCThreads, WorkerPolicy::parallel_worker_threads());
164 if (ParallelGCThreads == 0) {
165 assert(!FLAG_IS_DEFAULT(ParallelGCThreads), "The default value for ParallelGCThreads should not be 0.");
166 vm_exit_during_initialization("The flag -XX:+UseG1GC can not be combined with -XX:ParallelGCThreads=0", nullptr);
167 }
168
169 // When dumping the CDS heap we want to reduce fragmentation by
170 // triggering a full collection. To get as low fragmentation as
171 // possible we only use one worker thread.
172 if (CDSConfig::is_dumping_heap()) {
173 FLAG_SET_ERGO(ParallelGCThreads, 1);
174 }
175
176 if (!G1UseConcRefinement) {
177 if (!FLAG_IS_DEFAULT(G1ConcRefinementThreads)) {
178 log_warning(gc, ergo)("Ignoring -XX:G1ConcRefinementThreads "
179 "because of -XX:-G1UseConcRefinement");
180 }
181 FLAG_SET_DEFAULT(G1ConcRefinementThreads, 0);
182 } else if (FLAG_IS_DEFAULT(G1ConcRefinementThreads)) {
183 FLAG_SET_ERGO(G1ConcRefinementThreads, ParallelGCThreads);
184 }
185
186 if (FLAG_IS_DEFAULT(ConcGCThreads) || ConcGCThreads == 0) {
187 // Calculate the number of concurrent worker threads by scaling
188 // the number of parallel GC threads.
189 uint marking_thread_num = scale_concurrent_worker_threads(ParallelGCThreads);
190 FLAG_SET_ERGO(ConcGCThreads, marking_thread_num);
191 }
192
193 if (FLAG_IS_DEFAULT(GCTimeRatio) || GCTimeRatio == 0) {
194 // In G1, we want the default GC overhead goal to be higher than
195 // it is for PS, or the heap might be expanded too aggressively.
196 // We set it here to ~8%.
197 FLAG_SET_DEFAULT(GCTimeRatio, 12);
198 }
199
200 // Below, we might need to calculate the pause time interval based on
201 // the pause target. When we do so we are going to give G1 maximum
202 // flexibility and allow it to do pauses when it needs to. So, we'll
203 // arrange that the pause interval to be pause time target + 1 to
204 // ensure that a) the pause time target is maximized with respect to
205 // the pause interval and b) we maintain the invariant that pause
206 // time target < pause interval. If the user does not want this
207 // maximum flexibility, they will have to set the pause interval
208 // explicitly.
209
210 if (FLAG_IS_DEFAULT(MaxGCPauseMillis)) {
211 // The default pause time target in G1 is 200ms
212 FLAG_SET_DEFAULT(MaxGCPauseMillis, 200);
213 }
214
215 // Then, if the interval parameter was not set, set it according to
216 // the pause time target (this will also deal with the case when the
217 // pause time target is the default value).
218 if (FLAG_IS_DEFAULT(GCPauseIntervalMillis)) {
219 FLAG_SET_DEFAULT(GCPauseIntervalMillis, MaxGCPauseMillis + 1);
220 }
221
222 if (FLAG_IS_DEFAULT(ParallelRefProcEnabled) && ParallelGCThreads > 1) {
223 FLAG_SET_DEFAULT(ParallelRefProcEnabled, true);
224 }
225
226 #ifdef COMPILER2
227 // Enable loop strip mining to offer better pause time guarantees
228 if (FLAG_IS_DEFAULT(UseCountedLoopSafepoints)) {
229 FLAG_SET_DEFAULT(UseCountedLoopSafepoints, true);
230 if (FLAG_IS_DEFAULT(LoopStripMiningIter)) {
231 FLAG_SET_DEFAULT(LoopStripMiningIter, 1000);
232 }
233 }
234 #endif
235
236 initialize_mark_stack_size();
237 initialize_verification_types();
238
239 // Verify that the maximum parallelism isn't too high to eventually overflow
240 // the refcount in G1CardSetContainer.
241 uint max_parallel_refinement_threads = G1ConcRefinementThreads + G1DirtyCardQueueSet::num_par_ids();
242 uint const divisor = 3; // Safe divisor; we increment by 2 for each claim, but there is a small initial value.
243 if (max_parallel_refinement_threads > UINT_MAX / divisor) {
244 vm_exit_during_initialization("Too large parallelism for remembered sets.");
245 }
246 }
247
248 CollectedHeap* G1Arguments::create_heap() {
249 return new G1CollectedHeap();
250 }
251
252 size_t G1Arguments::heap_reserved_size_bytes() {
253 return MaxHeapSize;
254 }