]>
Commit | Line | Data |
---|---|---|
c6d9a88c | 1 | /* params.def - Run-time parameters. |
3d8864c0 SP |
2 | Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 |
3 | Free Software Foundation, Inc. | |
c6d9a88c MM |
4 | Written by Mark Mitchell <mark@codesourcery.com>. |
5 | ||
1322177d | 6 | This file is part of GCC. |
c6d9a88c | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 2, or (at your option) any later | |
11 | version. | |
c6d9a88c | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
c6d9a88c MM |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d | 19 | along with GCC; see the file COPYING. If not, write to the Free |
366ccddb KC |
20 | Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA |
21 | 02110-1301, USA. | |
c6d9a88c MM |
22 | |
23 | */ | |
24 | ||
25 | /* This file contains definitions for language-independent | |
1eb68dca | 26 | parameters. The DEFPARAM macro takes 6 arguments: |
c6d9a88c | 27 | |
0443f602 | 28 | - The enumeral corresponding to this parameter. |
c6d9a88c MM |
29 | |
30 | - The name that can be used to set this parameter using the | |
31 | command-line option `--param <name>=<value>'. | |
32 | ||
33 | - A help string explaining how the parameter is used. | |
34 | ||
1c4c47db JO |
35 | - A default value for the parameter. |
36 | ||
9e7705cb | 37 | - The minimum acceptable value for the parameter. |
1eb68dca | 38 | |
9e7705cb | 39 | - The maximum acceptable value for the parameter (if greater than |
1eb68dca KZ |
40 | the minimum). |
41 | ||
1c4c47db | 42 | Be sure to add an entry to invoke.texi summarizing the parameter. */ |
c6d9a88c | 43 | |
31617ef1 DB |
44 | /* The maximum number of fields in a variable with only implicit uses |
45 | for which structure aliasing will consider trying to track each | |
46 | field. The default is 5. */ | |
47 | DEFPARAM (PARAM_SALIAS_MAX_IMPLICIT_FIELDS, | |
48 | "salias-max-implicit-fields", | |
49 | "The maximum number of fields in a structure variable without direct structure accesses that GCC will attempt to track separately", | |
50 | 5, 0, 0) | |
a916f21d RG |
51 | |
52 | /* The maximum number of array elements structure aliasing will decompose | |
53 | an array for. The default is 4. */ | |
54 | DEFPARAM (PARAM_SALIAS_MAX_ARRAY_ELEMENTS, | |
55 | "salias-max-array-elements", | |
56 | "The maximum number of elements in an array for wich we track its elements separately", | |
57 | 4, 0, 0) | |
58 | ||
61b58001 BE |
59 | /* The maximum structure size at which the scalar replacement of |
60 | aggregates (SRA) pass will perform block copies. The default | |
61 | value, 0, implies that GCC will select the most appropriate size | |
62 | itself. */ | |
63 | DEFPARAM (PARAM_SRA_MAX_STRUCTURE_SIZE, | |
64 | "sra-max-structure-size", | |
460f84ed RH |
65 | "The maximum structure size (in bytes) for which GCC will " |
66 | "use by-element copies", | |
67 | 0, 0, 0) | |
68 | ||
69 | /* The maximum number of structure fields which the SRA pass will | |
70 | instantiate to avoid block copies. The default value, 0, implies | |
71 | that GCC will select the appropriate value itself. */ | |
72 | DEFPARAM (PARAM_SRA_MAX_STRUCTURE_COUNT, | |
73 | "sra-max-structure-count", | |
74 | "The maximum number of structure fields for which GCC will " | |
75 | "use by-element copies", | |
e06c0feb | 76 | 0, 0, 0) |
61b58001 BE |
77 | |
78 | /* The ratio between instantiated fields and the complete structure | |
79 | size. We say that if the ratio of the number of bytes in | |
80 | instantiated fields to the number of bytes in the complete | |
460f84ed RH |
81 | structure exceeds this parameter, or if the number of instantiated |
82 | fields to the total number of fields exceeds this parameter, then | |
83 | block copies are not used. The default is 75%. */ | |
61b58001 BE |
84 | DEFPARAM (PARAM_SRA_FIELD_STRUCTURE_RATIO, |
85 | "sra-field-structure-ratio", | |
e06c0feb NS |
86 | "The threshold ratio between instantiated fields and the total structure size", |
87 | 75, 0, 100) | |
61b58001 | 88 | |
a6227154 KG |
89 | /* The single function inlining limit. This is the maximum size |
90 | of a function counted in internal gcc instructions (not in | |
91 | real machine instructions) that is eligible for inlining | |
92 | by the tree inliner. | |
e5c4f28a | 93 | The default value is 450. |
a6227154 | 94 | Only functions marked inline (or methods defined in the class |
e5c4f28a | 95 | definition for C++) are affected by this. |
a6227154 KG |
96 | There are more restrictions to inlining: If inlined functions |
97 | call other functions, the already inlined instructions are | |
98 | counted and once the recursive inline limit (see | |
99 | "max-inline-insns" parameter) is exceeded, the acceptable size | |
100 | gets decreased. */ | |
101 | DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE, | |
102 | "max-inline-insns-single", | |
bc522472 | 103 | "The maximum number of instructions in a single function eligible for inlining", |
e5c4f28a | 104 | 450, 0, 0) |
a6227154 | 105 | |
bc522472 KG |
106 | /* The single function inlining limit for functions that are |
107 | inlined by virtue of -finline-functions (-O3). | |
108 | This limit should be chosen to be below or equal to the limit | |
109 | that is applied to functions marked inlined (or defined in the | |
110 | class declaration in C++) given by the "max-inline-insns-single" | |
111 | parameter. | |
e5c4f28a | 112 | The default value is 90. */ |
bc522472 KG |
113 | DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO, |
114 | "max-inline-insns-auto", | |
115 | "The maximum number of instructions when automatically inlining", | |
e5c4f28a | 116 | 90, 0, 0) |
bc522472 | 117 | |
6de9cd9a DN |
118 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE, |
119 | "max-inline-insns-recursive", | |
120 | "The maximum number of instructions inline function can grow to via recursive inlining", | |
e5c4f28a | 121 | 450, 0, 0) |
6de9cd9a DN |
122 | |
123 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO, | |
124 | "max-inline-insns-recursive-auto", | |
125 | "The maximum number of instructions non-inline function can grow to via recursive inlining", | |
e5c4f28a | 126 | 450, 0, 0) |
6de9cd9a DN |
127 | |
128 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH, | |
129 | "max-inline-recursive-depth", | |
130 | "The maximum depth of recursive inlining for inline functions", | |
e06c0feb | 131 | 8, 0, 0) |
6de9cd9a DN |
132 | |
133 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO, | |
134 | "max-inline-recursive-depth-auto", | |
135 | "The maximum depth of recursive inlining for non-inline functions", | |
e06c0feb | 136 | 8, 0, 0) |
6de9cd9a | 137 | |
c5a4444c JH |
138 | DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY, |
139 | "min-inline-recursive-probability", | |
140 | "Inline recursively only when the probability of call being executed exceeds the parameter", | |
141 | 10, 0, 0) | |
142 | ||
f37a4f14 RE |
143 | /* Limit the number of expansions created by the variable expansion |
144 | optimization to avoid register pressure. */ | |
145 | DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS, | |
146 | "max-variable-expansions-in-unroller", | |
5fa534e3 | 147 | "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling", |
e06c0feb | 148 | 1, 0, 0) |
f37a4f14 | 149 | |
acdc40df DN |
150 | /* Limit loop autovectorization to loops with large enough iteration count. */ |
151 | DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND, | |
152 | "min-vect-loop-bound", | |
153 | "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization", | |
154 | 0, 0, 0) | |
155 | ||
0443f602 JO |
156 | /* The maximum number of instructions to consider when looking for an |
157 | instruction to fill a delay slot. If more than this arbitrary | |
158 | number of instructions is searched, the time savings from filling | |
159 | the delay slot will be minimal so stop searching. Increasing | |
160 | values mean more aggressive optimization, making the compile time | |
161 | increase with probably small improvement in executable run time. */ | |
162 | DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH, | |
163 | "max-delay-slot-insn-search", | |
164 | "The maximum number of instructions to consider to fill a delay slot", | |
e06c0feb | 165 | 100, 0, 0) |
0443f602 | 166 | |
d5d063d7 JO |
167 | /* When trying to fill delay slots, the maximum number of instructions |
168 | to consider when searching for a block with valid live register | |
169 | information. Increasing this arbitrarily chosen value means more | |
170 | aggressive optimization, increasing the compile time. This | |
171 | parameter should be removed when the delay slot code is rewritten | |
172 | to maintain the control-flow graph. */ | |
173 | DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH, | |
174 | "max-delay-slot-live-search", | |
175 | "The maximum number of instructions to consider to find accurate live register information", | |
e06c0feb | 176 | 333, 0, 0) |
d5d063d7 | 177 | |
4a121cc3 | 178 | /* This parameter limits the number of branch elements that the |
ff7cc307 | 179 | scheduler will track anti-dependencies through without resetting |
4a121cc3 | 180 | the tracking mechanism. Large functions with few calls or barriers |
ff7cc307 | 181 | can generate lists containing many 1000's of dependencies. Generally |
4a121cc3 AM |
182 | the compiler either uses all available memory, or runs for far too long. */ |
183 | DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH, | |
184 | "max-pending-list-length", | |
185 | "The maximum length of scheduling's pending operations list", | |
e06c0feb | 186 | 32, 0, 0) |
4a121cc3 | 187 | |
b58b1157 JH |
188 | DEFPARAM(PARAM_LARGE_FUNCTION_INSNS, |
189 | "large-function-insns", | |
190 | "The size of function body to be considered large", | |
e5c4f28a | 191 | 2700, 0, 0) |
b58b1157 JH |
192 | DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH, |
193 | "large-function-growth", | |
2cc98056 | 194 | "Maximal growth due to inlining of large function (in percent)", |
e06c0feb | 195 | 100, 0, 0) |
b4f32d07 JH |
196 | DEFPARAM(PARAM_LARGE_UNIT_INSNS, |
197 | "large-unit-insns", | |
198 | "The size of translation unit to be considered large", | |
199 | 10000, 0, 0) | |
b58b1157 JH |
200 | DEFPARAM(PARAM_INLINE_UNIT_GROWTH, |
201 | "inline-unit-growth", | |
2cc98056 | 202 | "how much can given compilation unit grow because of the inlining (in percent)", |
d562c668 | 203 | 30, 0, 0) |
e5c4f28a RG |
204 | DEFPARAM(PARAM_INLINE_CALL_COST, |
205 | "inline-call-cost", | |
2e0ea515 | 206 | "expense of call operation relative to ordinary arithmetic operations", |
e5c4f28a | 207 | 16, 0, 0) |
ff28a94d JH |
208 | DEFPARAM(PARAM_LARGE_STACK_FRAME, |
209 | "large-stack-frame", | |
210 | "The size of stack frame to be considered large", | |
211 | 256, 0, 0) | |
212 | DEFPARAM(PARAM_STACK_FRAME_GROWTH, | |
213 | "large-stack-frame-growth", | |
214 | "Maximal stack frame growth due to inlining (in percent)", | |
215 | 1000, 0, 0) | |
b58b1157 | 216 | |
f1fa37ff MM |
217 | /* The GCSE optimization will be disabled if it would require |
218 | significantly more memory than this value. */ | |
219 | DEFPARAM(PARAM_MAX_GCSE_MEMORY, | |
220 | "max-gcse-memory", | |
221 | "The maximum amount of memory to be allocated by GCSE", | |
e06c0feb | 222 | 50 * 1024 * 1024, 0, 0) |
991b6592 | 223 | /* The number of repetitions of copy/const prop and PRE to run. */ |
740f35a0 DB |
224 | DEFPARAM(PARAM_MAX_GCSE_PASSES, |
225 | "max-gcse-passes", | |
226 | "The maximum number of passes to make when doing GCSE", | |
e06c0feb | 227 | 1, 1, 0) |
f9957958 MH |
228 | /* This is the threshold ratio when to perform partial redundancy |
229 | elimination after reload. We perform partial redundancy elimination | |
230 | when the following holds: | |
231 | (Redundant load execution count) | |
232 | ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION | |
233 | (Added loads execution count) */ | |
234 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION, | |
235 | "gcse-after-reload-partial-fraction", | |
c85ce869 | 236 | "The threshold ratio for performing partial redundancy elimination after reload", |
e06c0feb | 237 | 3, 0, 0) |
f9957958 MH |
238 | /* This is the threshold ratio of the critical edges execution count compared to |
239 | the redundant loads execution count that permits performing the load | |
240 | redundancy elimination in gcse after reload. */ | |
241 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION, | |
242 | "gcse-after-reload-critical-fraction", | |
c85ce869 | 243 | "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload", |
e06c0feb | 244 | 10, 0, 0) |
03e9dbc9 | 245 | /* This parameter limits the number of insns in a loop that will be unrolled, |
701ad47e JH |
246 | and by how much the loop is unrolled. |
247 | ||
248 | This limit should be at most half of the peeling limits: loop unroller | |
249 | decides to not unroll loops that iterate fewer than 2*number of allowed | |
a1105617 | 250 | unrollings and thus we would have loops that are neither peeled or unrolled |
701ad47e | 251 | otherwise. */ |
03e9dbc9 MM |
252 | DEFPARAM(PARAM_MAX_UNROLLED_INSNS, |
253 | "max-unrolled-insns", | |
254 | "The maximum number of instructions to consider to unroll in a loop", | |
e06c0feb | 255 | 200, 0, 0) |
b17d5d7c ZD |
256 | /* This parameter limits how many times the loop is unrolled depending |
257 | on number of insns really executed in each iteration. */ | |
258 | DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS, | |
259 | "max-average-unrolled-insns", | |
260 | "The maximum number of instructions to consider to unroll in a loop on average", | |
e06c0feb | 261 | 80, 0, 0) |
b17d5d7c ZD |
262 | /* The maximum number of unrollings of a single loop. */ |
263 | DEFPARAM(PARAM_MAX_UNROLL_TIMES, | |
264 | "max-unroll-times", | |
265 | "The maximum number of unrollings of a single loop", | |
e06c0feb | 266 | 8, 0, 0) |
b17d5d7c ZD |
267 | /* The maximum number of insns of a peeled loop. */ |
268 | DEFPARAM(PARAM_MAX_PEELED_INSNS, | |
269 | "max-peeled-insns", | |
270 | "The maximum number of insns of a peeled loop", | |
e06c0feb | 271 | 400, 0, 0) |
b17d5d7c ZD |
272 | /* The maximum number of peelings of a single loop. */ |
273 | DEFPARAM(PARAM_MAX_PEEL_TIMES, | |
274 | "max-peel-times", | |
275 | "The maximum number of peelings of a single loop", | |
e06c0feb | 276 | 16, 0, 0) |
b17d5d7c ZD |
277 | /* The maximum number of insns of a peeled loop. */ |
278 | DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS, | |
279 | "max-completely-peeled-insns", | |
280 | "The maximum number of insns of a completely peeled loop", | |
e06c0feb | 281 | 400, 0, 0) |
b17d5d7c ZD |
282 | /* The maximum number of peelings of a single loop that is peeled completely. */ |
283 | DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES, | |
284 | "max-completely-peel-times", | |
285 | "The maximum number of peelings of a single loop that is peeled completely", | |
e06c0feb | 286 | 16, 0, 0) |
b17d5d7c ZD |
287 | /* The maximum number of insns of a peeled loop that rolls only once. */ |
288 | DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS, | |
289 | "max-once-peeled-insns", | |
290 | "The maximum number of insns of a peeled loop that rolls only once", | |
e06c0feb | 291 | 400, 0, 0) |
194734e9 | 292 | |
617b465c ZD |
293 | /* The maximum number of insns of an unswitched loop. */ |
294 | DEFPARAM(PARAM_MAX_UNSWITCH_INSNS, | |
295 | "max-unswitch-insns", | |
296 | "The maximum number of insns of an unswitched loop", | |
e06c0feb | 297 | 50, 0, 0) |
617b465c ZD |
298 | /* The maximum level of recursion in unswitch_single_loop. */ |
299 | DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL, | |
300 | "max-unswitch-level", | |
301 | "The maximum number of unswitchings in a single loop", | |
e06c0feb | 302 | 3, 0, 0) |
617b465c | 303 | |
e9eb809d ZD |
304 | /* The maximum number of iterations of a loop the brute force algorithm |
305 | for analysis of # of iterations of the loop tries to evaluate. */ | |
306 | DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK, | |
307 | "max-iterations-to-track", | |
e06c0feb NS |
308 | "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates", |
309 | 1000, 0, 0) | |
45b9a14b BS |
310 | /* A cutoff to avoid costly computations of the number of iterations in |
311 | the doloop transformation. */ | |
312 | DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST, | |
313 | "max-iterations-computation-cost", | |
314 | "Bound on the cost of an expression to compute the number of iterations", | |
315 | 10, 0, 0) | |
e9eb809d | 316 | |
e5626198 AZ |
317 | DEFPARAM(PARAM_MAX_SMS_LOOP_NUMBER, |
318 | "max-sms-loop-number", | |
e06c0feb NS |
319 | "Maximum number of loops to perform swing modulo scheduling on (mainly for debugging)", |
320 | -1, -1, -1) | |
321 | ||
e5626198 AZ |
322 | /* This parameter is used to tune SMS MAX II calculations. */ |
323 | DEFPARAM(PARAM_SMS_MAX_II_FACTOR, | |
324 | "sms-max-ii-factor", | |
e06c0feb NS |
325 | "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop", |
326 | 100, 0, 0) | |
e5626198 AZ |
327 | DEFPARAM(PARAM_SMS_DFA_HISTORY, |
328 | "sms-dfa-history", | |
5fa534e3 | 329 | "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA", |
e06c0feb | 330 | 0, 0, 0) |
e5626198 AZ |
331 | DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD, |
332 | "sms-loop-average-count-threshold", | |
e06c0feb NS |
333 | "A threshold on the average loop count considered by the swing modulo scheduler", |
334 | 0, 0, 0) | |
e5626198 | 335 | |
194734e9 JH |
336 | DEFPARAM(HOT_BB_COUNT_FRACTION, |
337 | "hot-bb-count-fraction", | |
e06c0feb NS |
338 | "Select fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hot", |
339 | 10000, 0, 0) | |
194734e9 JH |
340 | DEFPARAM(HOT_BB_FREQUENCY_FRACTION, |
341 | "hot-bb-frequency-fraction", | |
e06c0feb NS |
342 | "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot", |
343 | 1000, 0, 0) | |
95b9a3a5 JH |
344 | |
345 | /* For guessed profiles, the loops having unknown number of iterations | |
346 | are predicted to iterate relatively few (10) times at average. | |
347 | For functions containing one loop with large known number of iterations | |
348 | and other loops having unbounded loops we would end up predicting all | |
c83eecad | 349 | the other loops cold that is not usually the case. So we need to artificially |
95b9a3a5 JH |
350 | flatten the profile. |
351 | ||
6416ae7f | 352 | We need to cut the maximal predicted iterations to large enough iterations |
95b9a3a5 JH |
353 | so the loop appears important, but safely within HOT_BB_COUNT_FRACTION |
354 | range. */ | |
355 | ||
356 | DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS, | |
357 | "max-predicted-iterations", | |
358 | "The maximum number of loop iterations we predict statically", | |
359 | 100, 0, 0) | |
5c856b23 JH |
360 | DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK, |
361 | "tracer-dynamic-coverage-feedback", | |
e06c0feb NS |
362 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available", |
363 | 95, 0, 100) | |
5c856b23 JH |
364 | DEFPARAM(TRACER_DYNAMIC_COVERAGE, |
365 | "tracer-dynamic-coverage", | |
e06c0feb NS |
366 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available", |
367 | 75, 0, 100) | |
5c856b23 JH |
368 | DEFPARAM(TRACER_MAX_CODE_GROWTH, |
369 | "tracer-max-code-growth", | |
2cc98056 | 370 | "Maximal code growth caused by tail duplication (in percent)", |
e06c0feb | 371 | 100, 0, 0) |
5c856b23 JH |
372 | DEFPARAM(TRACER_MIN_BRANCH_RATIO, |
373 | "tracer-min-branch-ratio", | |
e06c0feb NS |
374 | "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)", |
375 | 10, 0, 100) | |
5c856b23 JH |
376 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK, |
377 | "tracer-min-branch-probability-feedback", | |
e06c0feb NS |
378 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available", |
379 | 80, 0, 100) | |
5c856b23 JH |
380 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY, |
381 | "tracer-min-branch-probability", | |
e06c0feb NS |
382 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available", |
383 | 50, 0, 100) | |
3788cc17 | 384 | |
5f24e0dc RH |
385 | /* The maximum number of incoming edges to consider for crossjumping. */ |
386 | DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES, | |
387 | "max-crossjump-edges", | |
388 | "The maximum number of incoming edges to consider for crossjumping", | |
e06c0feb | 389 | 100, 0, 0) |
5f24e0dc | 390 | |
12183e0f PH |
391 | /* The minimum number of matching instructions to consider for crossjumping. */ |
392 | DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS, | |
393 | "min-crossjump-insns", | |
394 | "The minimum number of matching instructions to consider for crossjumping", | |
e06c0feb | 395 | 5, 0, 0) |
12183e0f | 396 | |
f935b9e0 DE |
397 | /* The maximum number expansion factor when copying basic blocks. */ |
398 | DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS, | |
399 | "max-grow-copy-bb-insns", | |
400 | "The maximum expansion factor when copying basic blocks", | |
401 | 8, 0, 0) | |
402 | ||
bbcb0c05 SB |
403 | /* The maximum number of insns to duplicate when unfactoring computed gotos. */ |
404 | DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS, | |
405 | "max-goto-duplication-insns", | |
406 | "The maximum number of insns to duplicate when unfactoring computed gotos", | |
407 | 8, 0, 0) | |
408 | ||
9bf8cfbf ZD |
409 | /* The maximum length of path considered in cse. */ |
410 | DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH, | |
411 | "max-cse-path-length", | |
2cc98056 | 412 | "The maximum length of path considered in cse", |
e06c0feb | 413 | 10, 0, 0) |
95b9a3a5 | 414 | DEFPARAM(PARAM_MAX_CSE_INSNS, |
921b02cd | 415 | "max-cse-insns", |
95b9a3a5 JH |
416 | "The maximum instructions CSE process before flushing", |
417 | 1000, 0, 0) | |
9bf8cfbf | 418 | |
a7e5372d ZD |
419 | /* The cost of expression in loop invariant motion that is considered |
420 | expensive. */ | |
421 | DEFPARAM(PARAM_LIM_EXPENSIVE, | |
422 | "lim-expensive", | |
423 | "The minimum cost of an expensive expression in the loop invariant motion", | |
e06c0feb | 424 | 20, 0, 0) |
a7e5372d | 425 | |
8b11a64c ZD |
426 | /* Bound on number of candidates for induction variables below that |
427 | all candidates are considered for each use in induction variable | |
428 | optimizations. */ | |
429 | ||
430 | DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND, | |
431 | "iv-consider-all-candidates-bound", | |
432 | "Bound on number of candidates below that all candidates are considered in iv optimizations", | |
e06c0feb | 433 | 30, 0, 0) |
8b11a64c ZD |
434 | |
435 | /* The induction variable optimizations give up on loops that contain more | |
436 | induction variable uses. */ | |
437 | ||
438 | DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES, | |
439 | "iv-max-considered-uses", | |
440 | "Bound on number of iv uses in loop optimized in iv optimizations", | |
e06c0feb | 441 | 250, 0, 0) |
8b11a64c | 442 | |
36f5ada1 ZD |
443 | /* If there are at most this number of ivs in the set, try removing unnecessary |
444 | ivs from the set always. */ | |
445 | ||
446 | DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND, | |
447 | "iv-always-prune-cand-set-bound", | |
448 | "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization", | |
449 | 10, 0, 0) | |
450 | ||
2412d35c SP |
451 | DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE, |
452 | "scev-max-expr-size", | |
453 | "Bound on size of expressions used in the scalar evolutions analyzer", | |
454 | 20, 0, 0) | |
455 | ||
3d8864c0 SP |
456 | DEFPARAM(PARAM_OMEGA_MAX_VARS, |
457 | "omega-max-vars", | |
458 | "Bound on the number of variables in Omega constraint systems", | |
459 | 128, 0, 0) | |
460 | ||
461 | DEFPARAM(PARAM_OMEGA_MAX_GEQS, | |
462 | "omega-max-geqs", | |
463 | "Bound on the number of inequalities in Omega constraint systems", | |
464 | 256, 0, 0) | |
465 | ||
466 | DEFPARAM(PARAM_OMEGA_MAX_EQS, | |
467 | "omega-max-eqs", | |
468 | "Bound on the number of equalities in Omega constraint systems", | |
469 | 128, 0, 0) | |
470 | ||
471 | DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS, | |
472 | "omega-max-wild-cards", | |
473 | "Bound on the number of wild cards in Omega constraint systems", | |
474 | 18, 0, 0) | |
475 | ||
476 | DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE, | |
477 | "omega-hash-table-size", | |
478 | "Bound on the size of the hash table in Omega constraint systems", | |
479 | 550, 0, 0) | |
480 | ||
481 | DEFPARAM(PARAM_OMEGA_MAX_KEYS, | |
482 | "omega-max-keys", | |
483 | "Bound on the number of keys in Omega constraint systems", | |
484 | 500, 0, 0) | |
485 | ||
486 | DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS, | |
487 | "omega-eliminate-redundant-constraints", | |
488 | "When set to 1, use expensive methods to eliminate all redundant constraints", | |
489 | 0, 0, 1) | |
490 | ||
c12cc930 KB |
491 | DEFPARAM(PARAM_VECT_MAX_VERSION_CHECKS, |
492 | "vect-max-version-checks", | |
493 | "Bound on number of runtime checks inserted by the vectorizer's loop versioning", | |
494 | 6, 0, 0) | |
495 | ||
c65ecebc JH |
496 | DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS, |
497 | "max-cselib-memory-locations", | |
498 | "The maximum memory locations recorded by cselib", | |
e06c0feb | 499 | 500, 0, 0) |
95b9a3a5 JH |
500 | DEFPARAM(PARAM_MAX_FLOW_MEMORY_LOCATIONS, |
501 | "max-flow-memory-locations", | |
502 | "The maximum memory locations recorded by flow", | |
503 | 100, 0, 0) | |
c65ecebc | 504 | |
3788cc17 ZW |
505 | #ifdef ENABLE_GC_ALWAYS_COLLECT |
506 | # define GGC_MIN_EXPAND_DEFAULT 0 | |
737c38d1 | 507 | # define GGC_MIN_HEAPSIZE_DEFAULT 0 |
3788cc17 ZW |
508 | #else |
509 | # define GGC_MIN_EXPAND_DEFAULT 30 | |
737c38d1 | 510 | # define GGC_MIN_HEAPSIZE_DEFAULT 4096 |
3788cc17 ZW |
511 | #endif |
512 | ||
513 | DEFPARAM(GGC_MIN_EXPAND, | |
514 | "ggc-min-expand", | |
e06c0feb NS |
515 | "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap", |
516 | GGC_MIN_EXPAND_DEFAULT, 0, 0) | |
3788cc17 | 517 | |
3788cc17 ZW |
518 | DEFPARAM(GGC_MIN_HEAPSIZE, |
519 | "ggc-min-heapsize", | |
2cc98056 | 520 | "Minimum heap size before we start collecting garbage, in kilobytes", |
e06c0feb | 521 | GGC_MIN_HEAPSIZE_DEFAULT, 0, 0) |
737c38d1 GK |
522 | |
523 | #undef GGC_MIN_EXPAND_DEFAULT | |
524 | #undef GGC_MIN_HEAPSIZE_DEFAULT | |
3788cc17 | 525 | |
0bcf8261 JH |
526 | DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS, |
527 | "max-reload-search-insns", | |
528 | "The maximum number of instructions to search backward when looking for equivalent reload", | |
e06c0feb | 529 | 100, 0, 0) |
0bcf8261 | 530 | |
6de9cd9a DN |
531 | DEFPARAM(PARAM_MAX_ALIASED_VOPS, |
532 | "max-aliased-vops", | |
e9e0aa2c DN |
533 | "The maximum number of virtual operators that a function is allowed to have before triggering memory partitioning heuristics", |
534 | 100, 0, 0) | |
535 | ||
536 | DEFPARAM(PARAM_AVG_ALIASED_VOPS, | |
537 | "avg-aliased-vops", | |
538 | "The average number of virtual operators that memory statements are allowed to have before triggering memory partitioning heuristics", | |
539 | 1, 0, 0) | |
6de9cd9a | 540 | |
f72c6b56 DE |
541 | DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS, |
542 | "max-sched-region-blocks", | |
543 | "The maximum number of blocks in a region to be considered for interblock scheduling", | |
e06c0feb | 544 | 10, 0, 0) |
f72c6b56 DE |
545 | |
546 | DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS, | |
547 | "max-sched-region-insns", | |
548 | "The maximum number of insns in a region to be considered for interblock scheduling", | |
e06c0feb | 549 | 100, 0, 0) |
f72c6b56 | 550 | |
6f48c21a PS |
551 | DEFPARAM(PARAM_MIN_SPEC_PROB, |
552 | "min-spec-prob", | |
553 | "The minimum probability of reaching a source block for interblock speculative scheduling", | |
554 | 40, 0, 0) | |
555 | ||
d08eefb9 MK |
556 | DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS, |
557 | "max-sched-extend-regions-iters", | |
558 | "The maximum number of iterations through CFG to extend regions", | |
bb83aa4b | 559 | 0, 0, 0) |
d08eefb9 | 560 | |
496d7bb0 MK |
561 | DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY, |
562 | "max-sched-insn-conflict-delay", | |
563 | "The maximum conflict delay for an insn to be considered for speculative motion", | |
564 | 3, 1, 10) | |
565 | ||
566 | DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF, | |
567 | "sched-spec-prob-cutoff", | |
568 | "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.", | |
569 | 40, 0, 100) | |
570 | ||
49c3b9a8 JJ |
571 | DEFPARAM(PARAM_MAX_LAST_VALUE_RTL, |
572 | "max-last-value-rtl", | |
573 | "The maximum number of RTL nodes that can be recorded as combiner's last value", | |
574 | 10000, 0, 0) | |
575 | ||
89b0433e NS |
576 | /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for |
577 | {signed,unsigned} integral types. This determines N. | |
578 | Experimentation shows 256 to be a good value. */ | |
579 | DEFPARAM (PARAM_INTEGER_SHARE_LIMIT, | |
580 | "integer-share-limit", | |
581 | "The upper bound for sharing integer constants", | |
e06c0feb | 582 | 256, 2, 2) |
89b0433e | 583 | |
84d65814 DN |
584 | /* Incremental SSA updates for virtual operands may be very slow if |
585 | there is a large number of mappings to process. In those cases, it | |
586 | is faster to rewrite the virtual symbols from scratch as if they | |
587 | had been recently introduced. This heuristic cannot be applied to | |
588 | SSA mappings for real SSA names, only symbols kept in FUD chains. | |
589 | ||
590 | PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual | |
591 | mappings that should be registered to trigger the heuristic. | |
592 | ||
593 | PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between | |
594 | mappings and symbols. If the number of virtual mappings is | |
595 | PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of | |
596 | virtual symbols to be updated, then the updater switches to a full | |
597 | update for those symbols. */ | |
598 | DEFPARAM (PARAM_MIN_VIRTUAL_MAPPINGS, | |
599 | "min-virtual-mappings", | |
600 | "Minimum number of virtual mappings to consider switching to full virtual renames", | |
601 | 100, 0, 0) | |
602 | ||
603 | DEFPARAM (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO, | |
604 | "virtual-mappings-ratio", | |
605 | "Ratio between virtual mappings and virtual symbols to do full virtual renames", | |
606 | 3, 0, 0) | |
607 | ||
7d69de61 RH |
608 | DEFPARAM (PARAM_SSP_BUFFER_SIZE, |
609 | "ssp-buffer-size", | |
610 | "The lower bound for a buffer to be considered for stack smashing protection", | |
611 | 8, 1, 0) | |
612 | ||
43f31be5 JL |
613 | /* When we thread through a block we have to make copies of the |
614 | statements within the block. Clearly for large blocks the code | |
615 | duplication is bad. | |
616 | ||
617 | PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number | |
618 | of statements and PHI nodes allowed in a block which is going to | |
619 | be duplicated for thread jumping purposes. | |
620 | ||
621 | Some simple analysis showed that more than 99% of the jump | |
622 | threading opportunities are for blocks with less than 15 | |
623 | statements. So we can get the benefits of jump threading | |
624 | without excessive code bloat for pathological cases with the | |
625 | throttle set at 15 statements. */ | |
626 | DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS, | |
627 | "max-jump-thread-duplication-stmts", | |
628 | "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps", | |
629 | 15, 0, 0) | |
98035a75 DB |
630 | |
631 | /* This is the maximum number of fields a variable may have before the pointer analysis machinery | |
632 | will stop trying to treat it in a field-sensitive manner. | |
633 | There are programs out there with thousands of fields per structure, and handling them | |
634 | field-sensitively is not worth the cost. */ | |
635 | DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE, | |
636 | "max-fields-for-field-sensitive", | |
637 | "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable", | |
638 | 100, 0, 0) | |
6f8dd94b EB |
639 | |
640 | DEFPARAM(PARAM_MAX_SCHED_READY_INSNS, | |
641 | "max-sched-ready-insns", | |
642 | "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass", | |
643 | 100, 0, 0) | |
644 | ||
47eb5b32 ZD |
645 | /* Prefetching and cache-optimizations related parameters. Default values are |
646 | usually set by machine description. */ | |
647 | ||
648 | /* The number of insns executed before prefetch is completed. */ | |
649 | ||
650 | DEFPARAM (PARAM_PREFETCH_LATENCY, | |
651 | "prefetch-latency", | |
652 | "The number of insns executed before prefetch is completed", | |
653 | 200, 0, 0) | |
654 | ||
655 | /* The number of prefetches that can run at the same time. */ | |
656 | ||
657 | DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES, | |
658 | "simultaneous-prefetches", | |
659 | "The number of prefetches that can run at the same time", | |
660 | 3, 0, 0) | |
661 | ||
662 | /* The size of L1 cache in number of cache lines. */ | |
663 | ||
664 | DEFPARAM (PARAM_L1_CACHE_SIZE, | |
665 | "l1-cache-size", | |
666 | "The size of L1 cache", | |
667 | 1024, 0, 0) | |
668 | ||
669 | /* The size of L1 cache line in bytes. */ | |
670 | ||
671 | DEFPARAM (PARAM_L1_CACHE_LINE_SIZE, | |
672 | "l1-cache-line-size", | |
673 | "The size of L1 cache line", | |
674 | 32, 0, 0) | |
675 | ||
06d40de8 DG |
676 | #ifdef ENABLE_CHECKING |
677 | # define GCC_CANONICAL_TYPES_DEFAULT 1 | |
678 | #else | |
679 | # define GCC_CANONICAL_TYPES_DEFAULT 0 | |
680 | #endif | |
681 | ||
682 | /* Whether we should verify that the canonical types in the system are | |
683 | consistent with the "structural" typing. */ | |
684 | ||
685 | DEFPARAM (PARAM_VERIFY_CANONICAL_TYPES, | |
686 | "verify-canonical-types", | |
687 | "Whether to verify canonical types", | |
688 | GCC_CANONICAL_TYPES_DEFAULT, 0, 1) | |
c6d9a88c MM |
689 | /* |
690 | Local variables: | |
691 | mode:c | |
692 | End: */ |