]>
Commit | Line | Data |
---|---|---|
c6d9a88c | 1 | /* params.def - Run-time parameters. |
e42febca | 2 | Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc. |
c6d9a88c MM |
3 | Written by Mark Mitchell <mark@codesourcery.com>. |
4 | ||
1322177d | 5 | This file is part of GCC. |
c6d9a88c | 6 | |
1322177d LB |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
9 | Software Foundation; either version 2, or (at your option) any later | |
10 | version. | |
c6d9a88c | 11 | |
1322177d LB |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
c6d9a88c MM |
16 | |
17 | You should have received a copy of the GNU General Public License | |
1322177d LB |
18 | along with GCC; see the file COPYING. If not, write to the Free |
19 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
20 | 02111-1307, USA. | |
c6d9a88c MM |
21 | |
22 | */ | |
23 | ||
24 | /* This file contains definitions for language-independent | |
25 | parameters. The DEFPARAM macro takes 4 arguments: | |
26 | ||
0443f602 | 27 | - The enumeral corresponding to this parameter. |
c6d9a88c MM |
28 | |
29 | - The name that can be used to set this parameter using the | |
30 | command-line option `--param <name>=<value>'. | |
31 | ||
32 | - A help string explaining how the parameter is used. | |
33 | ||
1c4c47db JO |
34 | - A default value for the parameter. |
35 | ||
36 | Be sure to add an entry to invoke.texi summarizing the parameter. */ | |
c6d9a88c | 37 | |
61b58001 BE |
38 | /* The maximum structure size at which the scalar replacement of |
39 | aggregates (SRA) pass will perform block copies. The default | |
40 | value, 0, implies that GCC will select the most appropriate size | |
41 | itself. */ | |
42 | DEFPARAM (PARAM_SRA_MAX_STRUCTURE_SIZE, | |
43 | "sra-max-structure-size", | |
e06c0feb NS |
44 | "The maximum structure size (in bytes) at which GCC will do block copies", |
45 | 0, 0, 0) | |
61b58001 BE |
46 | |
47 | /* The ratio between instantiated fields and the complete structure | |
48 | size. We say that if the ratio of the number of bytes in | |
49 | instantiated fields to the number of bytes in the complete | |
50 | structure exceeds this parameter, then block copies are not used. | |
51 | The default is 75%. */ | |
52 | DEFPARAM (PARAM_SRA_FIELD_STRUCTURE_RATIO, | |
53 | "sra-field-structure-ratio", | |
e06c0feb NS |
54 | "The threshold ratio between instantiated fields and the total structure size", |
55 | 75, 0, 100) | |
61b58001 | 56 | |
a6227154 KG |
57 | /* The single function inlining limit. This is the maximum size |
58 | of a function counted in internal gcc instructions (not in | |
59 | real machine instructions) that is eligible for inlining | |
60 | by the tree inliner. | |
bd04ab32 | 61 | The default value is 500. |
a6227154 KG |
62 | Only functions marked inline (or methods defined in the class |
63 | definition for C++) are affected by this, unless you set the | |
64 | -finline-functions (included in -O3) compiler option. | |
65 | There are more restrictions to inlining: If inlined functions | |
66 | call other functions, the already inlined instructions are | |
67 | counted and once the recursive inline limit (see | |
68 | "max-inline-insns" parameter) is exceeded, the acceptable size | |
69 | gets decreased. */ | |
70 | DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE, | |
71 | "max-inline-insns-single", | |
bc522472 | 72 | "The maximum number of instructions in a single function eligible for inlining", |
e06c0feb | 73 | 500, 0, 0) |
a6227154 | 74 | |
bc522472 KG |
75 | /* The single function inlining limit for functions that are |
76 | inlined by virtue of -finline-functions (-O3). | |
77 | This limit should be chosen to be below or equal to the limit | |
78 | that is applied to functions marked inlined (or defined in the | |
79 | class declaration in C++) given by the "max-inline-insns-single" | |
80 | parameter. | |
bd04ab32 | 81 | The default value is 150. */ |
bc522472 KG |
82 | DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO, |
83 | "max-inline-insns-auto", | |
84 | "The maximum number of instructions when automatically inlining", | |
e06c0feb | 85 | 120, 0, 0) |
bc522472 | 86 | |
6de9cd9a DN |
87 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE, |
88 | "max-inline-insns-recursive", | |
89 | "The maximum number of instructions inline function can grow to via recursive inlining", | |
e06c0feb | 90 | 500, 0, 0) |
6de9cd9a DN |
91 | |
92 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO, | |
93 | "max-inline-insns-recursive-auto", | |
94 | "The maximum number of instructions non-inline function can grow to via recursive inlining", | |
e06c0feb | 95 | 500, 0, 0) |
6de9cd9a DN |
96 | |
97 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH, | |
98 | "max-inline-recursive-depth", | |
99 | "The maximum depth of recursive inlining for inline functions", | |
e06c0feb | 100 | 8, 0, 0) |
6de9cd9a DN |
101 | |
102 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO, | |
103 | "max-inline-recursive-depth-auto", | |
104 | "The maximum depth of recursive inlining for non-inline functions", | |
e06c0feb | 105 | 8, 0, 0) |
6de9cd9a | 106 | |
f37a4f14 RE |
107 | /* Limit the number of expansions created by the variable expansion |
108 | optimization to avoid register pressure. */ | |
109 | DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS, | |
110 | "max-variable-expansions-in-unroller", | |
111 | "If -fvariable-expansion-in-unroller is used, the maximum number of \ | |
112 | times that an individual variable will be expanded \ | |
113 | during loop unrolling", | |
e06c0feb | 114 | 1, 0, 0) |
f37a4f14 | 115 | |
0443f602 JO |
116 | /* The maximum number of instructions to consider when looking for an |
117 | instruction to fill a delay slot. If more than this arbitrary | |
118 | number of instructions is searched, the time savings from filling | |
119 | the delay slot will be minimal so stop searching. Increasing | |
120 | values mean more aggressive optimization, making the compile time | |
121 | increase with probably small improvement in executable run time. */ | |
122 | DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH, | |
123 | "max-delay-slot-insn-search", | |
124 | "The maximum number of instructions to consider to fill a delay slot", | |
e06c0feb | 125 | 100, 0, 0) |
0443f602 | 126 | |
d5d063d7 JO |
127 | /* When trying to fill delay slots, the maximum number of instructions |
128 | to consider when searching for a block with valid live register | |
129 | information. Increasing this arbitrarily chosen value means more | |
130 | aggressive optimization, increasing the compile time. This | |
131 | parameter should be removed when the delay slot code is rewritten | |
132 | to maintain the control-flow graph. */ | |
133 | DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH, | |
134 | "max-delay-slot-live-search", | |
135 | "The maximum number of instructions to consider to find accurate live register information", | |
e06c0feb | 136 | 333, 0, 0) |
d5d063d7 | 137 | |
4a121cc3 | 138 | /* This parameter limits the number of branch elements that the |
ff7cc307 | 139 | scheduler will track anti-dependencies through without resetting |
4a121cc3 | 140 | the tracking mechanism. Large functions with few calls or barriers |
ff7cc307 | 141 | can generate lists containing many 1000's of dependencies. Generally |
4a121cc3 AM |
142 | the compiler either uses all available memory, or runs for far too long. */ |
143 | DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH, | |
144 | "max-pending-list-length", | |
145 | "The maximum length of scheduling's pending operations list", | |
e06c0feb | 146 | 32, 0, 0) |
4a121cc3 | 147 | |
b58b1157 JH |
148 | DEFPARAM(PARAM_LARGE_FUNCTION_INSNS, |
149 | "large-function-insns", | |
150 | "The size of function body to be considered large", | |
e06c0feb | 151 | 3000, 0, 0) |
b58b1157 JH |
152 | DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH, |
153 | "large-function-growth", | |
2cc98056 | 154 | "Maximal growth due to inlining of large function (in percent)", |
e06c0feb | 155 | 100, 0, 0) |
b58b1157 JH |
156 | DEFPARAM(PARAM_INLINE_UNIT_GROWTH, |
157 | "inline-unit-growth", | |
2cc98056 | 158 | "how much can given compilation unit grow because of the inlining (in percent)", |
e06c0feb | 159 | 50, 0, 0) |
b58b1157 | 160 | |
f1fa37ff MM |
161 | /* The GCSE optimization will be disabled if it would require |
162 | significantly more memory than this value. */ | |
163 | DEFPARAM(PARAM_MAX_GCSE_MEMORY, | |
164 | "max-gcse-memory", | |
165 | "The maximum amount of memory to be allocated by GCSE", | |
e06c0feb | 166 | 50 * 1024 * 1024, 0, 0) |
991b6592 | 167 | /* The number of repetitions of copy/const prop and PRE to run. */ |
740f35a0 DB |
168 | DEFPARAM(PARAM_MAX_GCSE_PASSES, |
169 | "max-gcse-passes", | |
170 | "The maximum number of passes to make when doing GCSE", | |
e06c0feb | 171 | 1, 1, 0) |
f9957958 MH |
172 | /* This is the threshold ratio when to perform partial redundancy |
173 | elimination after reload. We perform partial redundancy elimination | |
174 | when the following holds: | |
175 | (Redundant load execution count) | |
176 | ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION | |
177 | (Added loads execution count) */ | |
178 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION, | |
179 | "gcse-after-reload-partial-fraction", | |
e06c0feb NS |
180 | "The threshold ratio for performing partial redundancy elimination after reload.", |
181 | 3, 0, 0) | |
f9957958 MH |
182 | /* This is the threshold ratio of the critical edges execution count compared to |
183 | the redundant loads execution count that permits performing the load | |
184 | redundancy elimination in gcse after reload. */ | |
185 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION, | |
186 | "gcse-after-reload-critical-fraction", | |
e06c0feb NS |
187 | "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload.", |
188 | 10, 0, 0) | |
03e9dbc9 | 189 | /* This parameter limits the number of insns in a loop that will be unrolled, |
701ad47e JH |
190 | and by how much the loop is unrolled. |
191 | ||
192 | This limit should be at most half of the peeling limits: loop unroller | |
193 | decides to not unroll loops that iterate fewer than 2*number of allowed | |
a1105617 | 194 | unrollings and thus we would have loops that are neither peeled or unrolled |
701ad47e | 195 | otherwise. */ |
03e9dbc9 MM |
196 | DEFPARAM(PARAM_MAX_UNROLLED_INSNS, |
197 | "max-unrolled-insns", | |
198 | "The maximum number of instructions to consider to unroll in a loop", | |
e06c0feb | 199 | 200, 0, 0) |
b17d5d7c ZD |
200 | /* This parameter limits how many times the loop is unrolled depending |
201 | on number of insns really executed in each iteration. */ | |
202 | DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS, | |
203 | "max-average-unrolled-insns", | |
204 | "The maximum number of instructions to consider to unroll in a loop on average", | |
e06c0feb | 205 | 80, 0, 0) |
b17d5d7c ZD |
206 | /* The maximum number of unrollings of a single loop. */ |
207 | DEFPARAM(PARAM_MAX_UNROLL_TIMES, | |
208 | "max-unroll-times", | |
209 | "The maximum number of unrollings of a single loop", | |
e06c0feb | 210 | 8, 0, 0) |
b17d5d7c ZD |
211 | /* The maximum number of insns of a peeled loop. */ |
212 | DEFPARAM(PARAM_MAX_PEELED_INSNS, | |
213 | "max-peeled-insns", | |
214 | "The maximum number of insns of a peeled loop", | |
e06c0feb | 215 | 400, 0, 0) |
b17d5d7c ZD |
216 | /* The maximum number of peelings of a single loop. */ |
217 | DEFPARAM(PARAM_MAX_PEEL_TIMES, | |
218 | "max-peel-times", | |
219 | "The maximum number of peelings of a single loop", | |
e06c0feb | 220 | 16, 0, 0) |
b17d5d7c ZD |
221 | /* The maximum number of insns of a peeled loop. */ |
222 | DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS, | |
223 | "max-completely-peeled-insns", | |
224 | "The maximum number of insns of a completely peeled loop", | |
e06c0feb | 225 | 400, 0, 0) |
b17d5d7c ZD |
226 | /* The maximum number of peelings of a single loop that is peeled completely. */ |
227 | DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES, | |
228 | "max-completely-peel-times", | |
229 | "The maximum number of peelings of a single loop that is peeled completely", | |
e06c0feb | 230 | 16, 0, 0) |
b17d5d7c ZD |
231 | /* The maximum number of insns of a peeled loop that rolls only once. */ |
232 | DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS, | |
233 | "max-once-peeled-insns", | |
234 | "The maximum number of insns of a peeled loop that rolls only once", | |
e06c0feb | 235 | 400, 0, 0) |
194734e9 | 236 | |
617b465c ZD |
237 | /* The maximum number of insns of an unswitched loop. */ |
238 | DEFPARAM(PARAM_MAX_UNSWITCH_INSNS, | |
239 | "max-unswitch-insns", | |
240 | "The maximum number of insns of an unswitched loop", | |
e06c0feb | 241 | 50, 0, 0) |
617b465c ZD |
242 | /* The maximum level of recursion in unswitch_single_loop. */ |
243 | DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL, | |
244 | "max-unswitch-level", | |
245 | "The maximum number of unswitchings in a single loop", | |
e06c0feb | 246 | 3, 0, 0) |
617b465c | 247 | |
e9eb809d ZD |
248 | /* The maximum number of iterations of a loop the brute force algorithm |
249 | for analysis of # of iterations of the loop tries to evaluate. */ | |
250 | DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK, | |
251 | "max-iterations-to-track", | |
e06c0feb NS |
252 | "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates", |
253 | 1000, 0, 0) | |
e9eb809d | 254 | |
e5626198 AZ |
255 | DEFPARAM(PARAM_MAX_SMS_LOOP_NUMBER, |
256 | "max-sms-loop-number", | |
e06c0feb NS |
257 | "Maximum number of loops to perform swing modulo scheduling on (mainly for debugging)", |
258 | -1, -1, -1) | |
259 | ||
e5626198 AZ |
260 | /* This parameter is used to tune SMS MAX II calculations. */ |
261 | DEFPARAM(PARAM_SMS_MAX_II_FACTOR, | |
262 | "sms-max-ii-factor", | |
e06c0feb NS |
263 | "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop", |
264 | 100, 0, 0) | |
e5626198 AZ |
265 | DEFPARAM(PARAM_SMS_DFA_HISTORY, |
266 | "sms-dfa-history", | |
267 | "The number of cycles the swing modulo scheduler considers when \ | |
268 | checking conflicts using DFA", | |
e06c0feb | 269 | 0, 0, 0) |
e5626198 AZ |
270 | DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD, |
271 | "sms-loop-average-count-threshold", | |
e06c0feb NS |
272 | "A threshold on the average loop count considered by the swing modulo scheduler", |
273 | 0, 0, 0) | |
e5626198 | 274 | |
194734e9 JH |
275 | DEFPARAM(HOT_BB_COUNT_FRACTION, |
276 | "hot-bb-count-fraction", | |
e06c0feb NS |
277 | "Select fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hot", |
278 | 10000, 0, 0) | |
194734e9 JH |
279 | DEFPARAM(HOT_BB_FREQUENCY_FRACTION, |
280 | "hot-bb-frequency-fraction", | |
e06c0feb NS |
281 | "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot", |
282 | 1000, 0, 0) | |
5c856b23 JH |
283 | DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK, |
284 | "tracer-dynamic-coverage-feedback", | |
e06c0feb NS |
285 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available", |
286 | 95, 0, 100) | |
5c856b23 JH |
287 | DEFPARAM(TRACER_DYNAMIC_COVERAGE, |
288 | "tracer-dynamic-coverage", | |
e06c0feb NS |
289 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available", |
290 | 75, 0, 100) | |
5c856b23 JH |
291 | DEFPARAM(TRACER_MAX_CODE_GROWTH, |
292 | "tracer-max-code-growth", | |
2cc98056 | 293 | "Maximal code growth caused by tail duplication (in percent)", |
e06c0feb | 294 | 100, 0, 0) |
5c856b23 JH |
295 | DEFPARAM(TRACER_MIN_BRANCH_RATIO, |
296 | "tracer-min-branch-ratio", | |
e06c0feb NS |
297 | "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)", |
298 | 10, 0, 100) | |
5c856b23 JH |
299 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK, |
300 | "tracer-min-branch-probability-feedback", | |
e06c0feb NS |
301 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available", |
302 | 80, 0, 100) | |
5c856b23 JH |
303 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY, |
304 | "tracer-min-branch-probability", | |
e06c0feb NS |
305 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available", |
306 | 50, 0, 100) | |
3788cc17 | 307 | |
5f24e0dc RH |
308 | /* The maximum number of incoming edges to consider for crossjumping. */ |
309 | DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES, | |
310 | "max-crossjump-edges", | |
311 | "The maximum number of incoming edges to consider for crossjumping", | |
e06c0feb | 312 | 100, 0, 0) |
5f24e0dc | 313 | |
12183e0f PH |
314 | /* The minimum number of matching instructions to consider for crossjumping. */ |
315 | DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS, | |
316 | "min-crossjump-insns", | |
317 | "The minimum number of matching instructions to consider for crossjumping", | |
e06c0feb | 318 | 5, 0, 0) |
12183e0f | 319 | |
9bf8cfbf ZD |
320 | /* The maximum length of path considered in cse. */ |
321 | DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH, | |
322 | "max-cse-path-length", | |
2cc98056 | 323 | "The maximum length of path considered in cse", |
e06c0feb | 324 | 10, 0, 0) |
9bf8cfbf | 325 | |
a7e5372d ZD |
326 | /* The cost of expression in loop invariant motion that is considered |
327 | expensive. */ | |
328 | DEFPARAM(PARAM_LIM_EXPENSIVE, | |
329 | "lim-expensive", | |
330 | "The minimum cost of an expensive expression in the loop invariant motion", | |
e06c0feb | 331 | 20, 0, 0) |
a7e5372d | 332 | |
8b11a64c ZD |
333 | /* Bound on number of candidates for induction variables below that |
334 | all candidates are considered for each use in induction variable | |
335 | optimizations. */ | |
336 | ||
337 | DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND, | |
338 | "iv-consider-all-candidates-bound", | |
339 | "Bound on number of candidates below that all candidates are considered in iv optimizations", | |
e06c0feb | 340 | 30, 0, 0) |
8b11a64c ZD |
341 | |
342 | /* The induction variable optimizations give up on loops that contain more | |
343 | induction variable uses. */ | |
344 | ||
345 | DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES, | |
346 | "iv-max-considered-uses", | |
347 | "Bound on number of iv uses in loop optimized in iv optimizations", | |
e06c0feb | 348 | 250, 0, 0) |
8b11a64c | 349 | |
36f5ada1 ZD |
350 | /* If there are at most this number of ivs in the set, try removing unnecessary |
351 | ivs from the set always. */ | |
352 | ||
353 | DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND, | |
354 | "iv-always-prune-cand-set-bound", | |
355 | "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization", | |
356 | 10, 0, 0) | |
357 | ||
6de9cd9a DN |
358 | /* The product of the next two is used to decide whether or not to |
359 | use .GLOBAL_VAR. See tree-dfa.c. */ | |
360 | DEFPARAM(PARAM_GLOBAL_VAR_THRESHOLD, | |
361 | "global-var-threshold", | |
362 | "Given N calls and V call-clobbered vars in a function. Use .GLOBAL_VAR if NxV is larger than this limit", | |
e06c0feb | 363 | 500000, 0, 0) |
6de9cd9a | 364 | |
c65ecebc JH |
365 | DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS, |
366 | "max-cselib-memory-locations", | |
367 | "The maximum memory locations recorded by cselib", | |
e06c0feb | 368 | 500, 0, 0) |
c65ecebc | 369 | |
3788cc17 ZW |
370 | #ifdef ENABLE_GC_ALWAYS_COLLECT |
371 | # define GGC_MIN_EXPAND_DEFAULT 0 | |
737c38d1 | 372 | # define GGC_MIN_HEAPSIZE_DEFAULT 0 |
3788cc17 ZW |
373 | #else |
374 | # define GGC_MIN_EXPAND_DEFAULT 30 | |
737c38d1 | 375 | # define GGC_MIN_HEAPSIZE_DEFAULT 4096 |
3788cc17 ZW |
376 | #endif |
377 | ||
378 | DEFPARAM(GGC_MIN_EXPAND, | |
379 | "ggc-min-expand", | |
e06c0feb NS |
380 | "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap", |
381 | GGC_MIN_EXPAND_DEFAULT, 0, 0) | |
3788cc17 | 382 | |
3788cc17 ZW |
383 | DEFPARAM(GGC_MIN_HEAPSIZE, |
384 | "ggc-min-heapsize", | |
2cc98056 | 385 | "Minimum heap size before we start collecting garbage, in kilobytes", |
e06c0feb | 386 | GGC_MIN_HEAPSIZE_DEFAULT, 0, 0) |
737c38d1 GK |
387 | |
388 | #undef GGC_MIN_EXPAND_DEFAULT | |
389 | #undef GGC_MIN_HEAPSIZE_DEFAULT | |
3788cc17 | 390 | |
0bcf8261 JH |
391 | DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS, |
392 | "max-reload-search-insns", | |
393 | "The maximum number of instructions to search backward when looking for equivalent reload", | |
e06c0feb | 394 | 100, 0, 0) |
0bcf8261 | 395 | |
6de9cd9a DN |
396 | DEFPARAM(PARAM_MAX_ALIASED_VOPS, |
397 | "max-aliased-vops", | |
398 | "The maximum number of virtual operands allowed to represent aliases before triggering alias grouping.", | |
e06c0feb | 399 | 500, 0, 0) |
6de9cd9a | 400 | |
f72c6b56 DE |
401 | DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS, |
402 | "max-sched-region-blocks", | |
403 | "The maximum number of blocks in a region to be considered for interblock scheduling", | |
e06c0feb | 404 | 10, 0, 0) |
f72c6b56 DE |
405 | |
406 | DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS, | |
407 | "max-sched-region-insns", | |
408 | "The maximum number of insns in a region to be considered for interblock scheduling", | |
e06c0feb | 409 | 100, 0, 0) |
f72c6b56 | 410 | |
49c3b9a8 JJ |
411 | DEFPARAM(PARAM_MAX_LAST_VALUE_RTL, |
412 | "max-last-value-rtl", | |
413 | "The maximum number of RTL nodes that can be recorded as combiner's last value", | |
414 | 10000, 0, 0) | |
415 | ||
89b0433e NS |
416 | /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for |
417 | {signed,unsigned} integral types. This determines N. | |
418 | Experimentation shows 256 to be a good value. */ | |
419 | DEFPARAM (PARAM_INTEGER_SHARE_LIMIT, | |
420 | "integer-share-limit", | |
421 | "The upper bound for sharing integer constants", | |
e06c0feb | 422 | 256, 2, 2) |
89b0433e | 423 | |
c6d9a88c MM |
424 | /* |
425 | Local variables: | |
426 | mode:c | |
427 | End: */ |