]>
Commit | Line | Data |
---|---|---|
c6d9a88c | 1 | /* params.def - Run-time parameters. |
23a5b65a | 2 | Copyright (C) 2001-2014 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 | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 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 | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
c6d9a88c MM |
20 | |
21 | /* This file contains definitions for language-independent | |
1eb68dca | 22 | parameters. The DEFPARAM macro takes 6 arguments: |
c6d9a88c | 23 | |
0443f602 | 24 | - The enumeral corresponding to this parameter. |
c6d9a88c | 25 | |
b8698a0f | 26 | - The name that can be used to set this parameter using the |
c6d9a88c MM |
27 | command-line option `--param <name>=<value>'. |
28 | ||
29 | - A help string explaining how the parameter is used. | |
30 | ||
1c4c47db JO |
31 | - A default value for the parameter. |
32 | ||
9e7705cb | 33 | - The minimum acceptable value for the parameter. |
1eb68dca | 34 | |
9e7705cb | 35 | - The maximum acceptable value for the parameter (if greater than |
1eb68dca KZ |
36 | the minimum). |
37 | ||
1c4c47db | 38 | Be sure to add an entry to invoke.texi summarizing the parameter. */ |
c6d9a88c | 39 | |
3a4fd356 JH |
40 | /* When branch is predicted to be taken with probability lower than this |
41 | threshold (in percent), then it is considered well predictable. */ | |
42 | DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME, | |
43 | "predictable-branch-outcome", | |
67018619 | 44 | "Maximal estimated outcome of branch considered predictable", |
3a4fd356 JH |
45 | 2, 0, 50) |
46 | ||
42f7b0fa JH |
47 | DEFPARAM (PARAM_INLINE_MIN_SPEEDUP, |
48 | "inline-min-speedup", | |
49 | "The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-isnsns-auto", | |
50 | 10, 0, 0) | |
51 | ||
a6227154 KG |
52 | /* The single function inlining limit. This is the maximum size |
53 | of a function counted in internal gcc instructions (not in | |
54 | real machine instructions) that is eligible for inlining | |
55 | by the tree inliner. | |
e5c4f28a | 56 | The default value is 450. |
a6227154 | 57 | Only functions marked inline (or methods defined in the class |
e5c4f28a | 58 | definition for C++) are affected by this. |
a6227154 KG |
59 | There are more restrictions to inlining: If inlined functions |
60 | call other functions, the already inlined instructions are | |
b8698a0f | 61 | counted and once the recursive inline limit (see |
a6227154 KG |
62 | "max-inline-insns" parameter) is exceeded, the acceptable size |
63 | gets decreased. */ | |
64 | DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE, | |
65 | "max-inline-insns-single", | |
bc522472 | 66 | "The maximum number of instructions in a single function eligible for inlining", |
172d54e0 | 67 | 400, 0, 0) |
a6227154 | 68 | |
bc522472 KG |
69 | /* The single function inlining limit for functions that are |
70 | inlined by virtue of -finline-functions (-O3). | |
71 | This limit should be chosen to be below or equal to the limit | |
72 | that is applied to functions marked inlined (or defined in the | |
73 | class declaration in C++) given by the "max-inline-insns-single" | |
74 | parameter. | |
7802ca7c | 75 | The default value is 40. */ |
bc522472 KG |
76 | DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO, |
77 | "max-inline-insns-auto", | |
78 | "The maximum number of instructions when automatically inlining", | |
7802ca7c | 79 | 40, 0, 0) |
bc522472 | 80 | |
6de9cd9a DN |
81 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE, |
82 | "max-inline-insns-recursive", | |
83 | "The maximum number of instructions inline function can grow to via recursive inlining", | |
172d54e0 | 84 | 450, 0, 0) |
6de9cd9a DN |
85 | |
86 | DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO, | |
87 | "max-inline-insns-recursive-auto", | |
88 | "The maximum number of instructions non-inline function can grow to via recursive inlining", | |
172d54e0 | 89 | 450, 0, 0) |
6de9cd9a DN |
90 | |
91 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH, | |
92 | "max-inline-recursive-depth", | |
93 | "The maximum depth of recursive inlining for inline functions", | |
e06c0feb | 94 | 8, 0, 0) |
6de9cd9a DN |
95 | |
96 | DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO, | |
97 | "max-inline-recursive-depth-auto", | |
98 | "The maximum depth of recursive inlining for non-inline functions", | |
e06c0feb | 99 | 8, 0, 0) |
6de9cd9a | 100 | |
c5a4444c JH |
101 | DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY, |
102 | "min-inline-recursive-probability", | |
103 | "Inline recursively only when the probability of call being executed exceeds the parameter", | |
104 | 10, 0, 0) | |
105 | ||
796bda22 JH |
106 | /* Limit of iterations of early inliner. This basically bounds number of |
107 | nested indirect calls early inliner can resolve. Deeper chains are still | |
108 | handled by late inlining. */ | |
109 | DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS, | |
110 | "max-early-inliner-iterations", | |
111 | "The maximum number of nested indirect inlining performed by early inliner", | |
ec4224ac | 112 | 1, 0, 0) |
796bda22 | 113 | |
c5d0600d JH |
114 | /* Limit on probability of entry BB. */ |
115 | DEFPARAM (PARAM_COMDAT_SHARING_PROBABILITY, | |
116 | "comdat-sharing-probability", | |
9200b302 | 117 | "Probability that COMDAT function will be shared with different compilation unit", |
c5d0600d JH |
118 | 20, 0, 0) |
119 | ||
3e485f62 JH |
120 | /* Limit on probability of entry BB. */ |
121 | DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY, | |
122 | "partial-inlining-entry-probability", | |
123 | "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen", | |
124 | 70, 0, 0) | |
125 | ||
f37a4f14 RE |
126 | /* Limit the number of expansions created by the variable expansion |
127 | optimization to avoid register pressure. */ | |
128 | DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS, | |
129 | "max-variable-expansions-in-unroller", | |
5fa534e3 | 130 | "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling", |
e06c0feb | 131 | 1, 0, 0) |
b8698a0f | 132 | |
acdc40df DN |
133 | /* Limit loop autovectorization to loops with large enough iteration count. */ |
134 | DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND, | |
135 | "min-vect-loop-bound", | |
136 | "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization", | |
8d888559 | 137 | 1, 1, 0) |
acdc40df | 138 | |
0443f602 JO |
139 | /* The maximum number of instructions to consider when looking for an |
140 | instruction to fill a delay slot. If more than this arbitrary | |
141 | number of instructions is searched, the time savings from filling | |
142 | the delay slot will be minimal so stop searching. Increasing | |
143 | values mean more aggressive optimization, making the compile time | |
144 | increase with probably small improvement in executable run time. */ | |
145 | DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH, | |
146 | "max-delay-slot-insn-search", | |
147 | "The maximum number of instructions to consider to fill a delay slot", | |
e06c0feb | 148 | 100, 0, 0) |
0443f602 | 149 | |
d5d063d7 JO |
150 | /* When trying to fill delay slots, the maximum number of instructions |
151 | to consider when searching for a block with valid live register | |
152 | information. Increasing this arbitrarily chosen value means more | |
153 | aggressive optimization, increasing the compile time. This | |
154 | parameter should be removed when the delay slot code is rewritten | |
155 | to maintain the control-flow graph. */ | |
156 | DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH, | |
157 | "max-delay-slot-live-search", | |
158 | "The maximum number of instructions to consider to find accurate live register information", | |
e06c0feb | 159 | 333, 0, 0) |
d5d063d7 | 160 | |
b8698a0f | 161 | /* This parameter limits the number of branch elements that the |
ff7cc307 | 162 | scheduler will track anti-dependencies through without resetting |
b8698a0f L |
163 | the tracking mechanism. Large functions with few calls or barriers |
164 | can generate lists containing many 1000's of dependencies. Generally | |
4a121cc3 AM |
165 | the compiler either uses all available memory, or runs for far too long. */ |
166 | DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH, | |
167 | "max-pending-list-length", | |
168 | "The maximum length of scheduling's pending operations list", | |
e06c0feb | 169 | 32, 0, 0) |
4a121cc3 | 170 | |
06d7e8e7 BS |
171 | /* This parameter limits the number of backtracking attempts when using the |
172 | haifa scheduler for modulo scheduling. */ | |
173 | DEFPARAM(PARAM_MAX_MODULO_BACKTRACK_ATTEMPTS, | |
174 | "max-modulo-backtrack-attempts", | |
175 | "The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop", | |
176 | 40, 0, 0) | |
177 | ||
b58b1157 JH |
178 | DEFPARAM(PARAM_LARGE_FUNCTION_INSNS, |
179 | "large-function-insns", | |
180 | "The size of function body to be considered large", | |
e5c4f28a | 181 | 2700, 0, 0) |
b58b1157 JH |
182 | DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH, |
183 | "large-function-growth", | |
2cc98056 | 184 | "Maximal growth due to inlining of large function (in percent)", |
e06c0feb | 185 | 100, 0, 0) |
b4f32d07 JH |
186 | DEFPARAM(PARAM_LARGE_UNIT_INSNS, |
187 | "large-unit-insns", | |
188 | "The size of translation unit to be considered large", | |
189 | 10000, 0, 0) | |
b58b1157 JH |
190 | DEFPARAM(PARAM_INLINE_UNIT_GROWTH, |
191 | "inline-unit-growth", | |
7b98c16f | 192 | "How much can given compilation unit grow because of the inlining (in percent)", |
d562c668 | 193 | 30, 0, 0) |
5e45130d JH |
194 | DEFPARAM(PARAM_IPCP_UNIT_GROWTH, |
195 | "ipcp-unit-growth", | |
7b98c16f | 196 | "How much can given compilation unit grow because of the interprocedural constant propagation (in percent)", |
5e45130d | 197 | 10, 0, 0) |
85057983 JH |
198 | DEFPARAM(PARAM_EARLY_INLINING_INSNS, |
199 | "early-inlining-insns", | |
7b98c16f | 200 | "Maximal estimated growth of function body caused by early inlining of single call", |
632b4f8e | 201 | 11, 0, 0) |
ff28a94d JH |
202 | DEFPARAM(PARAM_LARGE_STACK_FRAME, |
203 | "large-stack-frame", | |
204 | "The size of stack frame to be considered large", | |
205 | 256, 0, 0) | |
206 | DEFPARAM(PARAM_STACK_FRAME_GROWTH, | |
207 | "large-stack-frame-growth", | |
208 | "Maximal stack frame growth due to inlining (in percent)", | |
209 | 1000, 0, 0) | |
b58b1157 | 210 | |
f1fa37ff MM |
211 | /* The GCSE optimization will be disabled if it would require |
212 | significantly more memory than this value. */ | |
213 | DEFPARAM(PARAM_MAX_GCSE_MEMORY, | |
214 | "max-gcse-memory", | |
215 | "The maximum amount of memory to be allocated by GCSE", | |
e06c0feb | 216 | 50 * 1024 * 1024, 0, 0) |
3906a4a1 | 217 | |
29fa95ed JL |
218 | /* The GCSE optimization of an expression will avoided if the ratio of |
219 | insertions to deletions is greater than this value. */ | |
220 | DEFPARAM(PARAM_MAX_GCSE_INSERTION_RATIO, | |
221 | "max-gcse-insertion-ratio", | |
222 | "The maximum ratio of insertions to deletions of expressions in GCSE", | |
223 | 20, 0, 0) | |
224 | ||
f9957958 MH |
225 | /* This is the threshold ratio when to perform partial redundancy |
226 | elimination after reload. We perform partial redundancy elimination | |
227 | when the following holds: | |
228 | (Redundant load execution count) | |
229 | ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION | |
230 | (Added loads execution count) */ | |
231 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION, | |
232 | "gcse-after-reload-partial-fraction", | |
c85ce869 | 233 | "The threshold ratio for performing partial redundancy elimination after reload", |
e06c0feb | 234 | 3, 0, 0) |
f9957958 MH |
235 | /* This is the threshold ratio of the critical edges execution count compared to |
236 | the redundant loads execution count that permits performing the load | |
237 | redundancy elimination in gcse after reload. */ | |
238 | DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION, | |
239 | "gcse-after-reload-critical-fraction", | |
c85ce869 | 240 | "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload", |
e06c0feb | 241 | 10, 0, 0) |
20160347 MK |
242 | |
243 | /* GCSE will use GCSE_COST_DISTANCE_RATION as a scaling factor | |
244 | to calculate maximum distance for which an expression is allowed to move | |
245 | from its rtx_cost. */ | |
246 | DEFPARAM(PARAM_GCSE_COST_DISTANCE_RATIO, | |
247 | "gcse-cost-distance-ratio", | |
248 | "Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations", | |
249 | 10, 0, 0) | |
250 | /* GCSE won't restrict distance for which an expression with rtx_cost greater | |
251 | than COSTS_N_INSN(GCSE_UNRESTRICTED_COST) is allowed to move. */ | |
252 | DEFPARAM(PARAM_GCSE_UNRESTRICTED_COST, | |
253 | "gcse-unrestricted-cost", | |
254 | "Cost at which GCSE optimizations will not constraint the distance an expression can travel", | |
255 | 3, 0, 0) | |
256 | ||
cad9aa15 MK |
257 | /* How deep from a given basic block the dominator tree should be searched |
258 | for expressions to hoist to the block. The value of 0 will avoid limiting | |
259 | the search. */ | |
260 | DEFPARAM(PARAM_MAX_HOIST_DEPTH, | |
261 | "max-hoist-depth", | |
262 | "Maximum depth of search in the dominator tree for expressions to hoist", | |
263 | 30, 0, 0) | |
264 | ||
03e9dbc9 | 265 | /* This parameter limits the number of insns in a loop that will be unrolled, |
701ad47e | 266 | and by how much the loop is unrolled. |
b8698a0f | 267 | |
701ad47e JH |
268 | This limit should be at most half of the peeling limits: loop unroller |
269 | decides to not unroll loops that iterate fewer than 2*number of allowed | |
a1105617 | 270 | unrollings and thus we would have loops that are neither peeled or unrolled |
701ad47e | 271 | otherwise. */ |
03e9dbc9 MM |
272 | DEFPARAM(PARAM_MAX_UNROLLED_INSNS, |
273 | "max-unrolled-insns", | |
274 | "The maximum number of instructions to consider to unroll in a loop", | |
e06c0feb | 275 | 200, 0, 0) |
b17d5d7c ZD |
276 | /* This parameter limits how many times the loop is unrolled depending |
277 | on number of insns really executed in each iteration. */ | |
278 | DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS, | |
279 | "max-average-unrolled-insns", | |
280 | "The maximum number of instructions to consider to unroll in a loop on average", | |
e06c0feb | 281 | 80, 0, 0) |
b17d5d7c ZD |
282 | /* The maximum number of unrollings of a single loop. */ |
283 | DEFPARAM(PARAM_MAX_UNROLL_TIMES, | |
284 | "max-unroll-times", | |
285 | "The maximum number of unrollings of a single loop", | |
e06c0feb | 286 | 8, 0, 0) |
b17d5d7c ZD |
287 | /* The maximum number of insns of a peeled loop. */ |
288 | DEFPARAM(PARAM_MAX_PEELED_INSNS, | |
289 | "max-peeled-insns", | |
290 | "The maximum number of insns of a peeled loop", | |
b3d0cc60 | 291 | 100, 0, 0) |
b17d5d7c ZD |
292 | /* The maximum number of peelings of a single loop. */ |
293 | DEFPARAM(PARAM_MAX_PEEL_TIMES, | |
294 | "max-peel-times", | |
295 | "The maximum number of peelings of a single loop", | |
e06c0feb | 296 | 16, 0, 0) |
519cac4a JH |
297 | /* The maximum number of peelings of a single loop that is peeled completely. */ |
298 | DEFPARAM(PARAM_MAX_PEEL_BRANCHES, | |
299 | "max-peel-branches", | |
300 | "The maximum number of branches on the path through the peeled sequence", | |
301 | 32, 0, 0) | |
b17d5d7c ZD |
302 | /* The maximum number of insns of a peeled loop. */ |
303 | DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS, | |
304 | "max-completely-peeled-insns", | |
305 | "The maximum number of insns of a completely peeled loop", | |
b3d0cc60 | 306 | 100, 0, 0) |
b17d5d7c ZD |
307 | /* The maximum number of peelings of a single loop that is peeled completely. */ |
308 | DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES, | |
309 | "max-completely-peel-times", | |
310 | "The maximum number of peelings of a single loop that is peeled completely", | |
e06c0feb | 311 | 16, 0, 0) |
b17d5d7c ZD |
312 | /* The maximum number of insns of a peeled loop that rolls only once. */ |
313 | DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS, | |
314 | "max-once-peeled-insns", | |
315 | "The maximum number of insns of a peeled loop that rolls only once", | |
e06c0feb | 316 | 400, 0, 0) |
30bc1dca RG |
317 | /* The maximum depth of a loop nest we completely peel. */ |
318 | DEFPARAM(PARAM_MAX_UNROLL_ITERATIONS, | |
319 | "max-completely-peel-loop-nest-depth", | |
320 | "The maximum depth of a loop nest we completely peel", | |
321 | 8, 0, 0) | |
194734e9 | 322 | |
617b465c ZD |
323 | /* The maximum number of insns of an unswitched loop. */ |
324 | DEFPARAM(PARAM_MAX_UNSWITCH_INSNS, | |
325 | "max-unswitch-insns", | |
326 | "The maximum number of insns of an unswitched loop", | |
e06c0feb | 327 | 50, 0, 0) |
617b465c ZD |
328 | /* The maximum level of recursion in unswitch_single_loop. */ |
329 | DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL, | |
330 | "max-unswitch-level", | |
331 | "The maximum number of unswitchings in a single loop", | |
e06c0feb | 332 | 3, 0, 0) |
617b465c | 333 | |
e9eb809d ZD |
334 | /* The maximum number of iterations of a loop the brute force algorithm |
335 | for analysis of # of iterations of the loop tries to evaluate. */ | |
336 | DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK, | |
337 | "max-iterations-to-track", | |
e06c0feb NS |
338 | "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates", |
339 | 1000, 0, 0) | |
45b9a14b BS |
340 | /* A cutoff to avoid costly computations of the number of iterations in |
341 | the doloop transformation. */ | |
342 | DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST, | |
343 | "max-iterations-computation-cost", | |
344 | "Bound on the cost of an expression to compute the number of iterations", | |
345 | 10, 0, 0) | |
e9eb809d | 346 | |
e5626198 AZ |
347 | /* This parameter is used to tune SMS MAX II calculations. */ |
348 | DEFPARAM(PARAM_SMS_MAX_II_FACTOR, | |
349 | "sms-max-ii-factor", | |
e06c0feb NS |
350 | "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop", |
351 | 100, 0, 0) | |
3e2fdd24 RE |
352 | /* The minimum value of stage count that swing modulo scheduler will generate. */ |
353 | DEFPARAM(PARAM_SMS_MIN_SC, | |
354 | "sms-min-sc", | |
355 | "The minimum value of stage count that swing modulo scheduler will generate.", | |
356 | 2, 1, 1) | |
e5626198 AZ |
357 | DEFPARAM(PARAM_SMS_DFA_HISTORY, |
358 | "sms-dfa-history", | |
5fa534e3 | 359 | "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA", |
e06c0feb | 360 | 0, 0, 0) |
e5626198 AZ |
361 | DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD, |
362 | "sms-loop-average-count-threshold", | |
e06c0feb NS |
363 | "A threshold on the average loop count considered by the swing modulo scheduler", |
364 | 0, 0, 0) | |
e5626198 | 365 | |
b131b583 TJ |
366 | DEFPARAM(HOT_BB_COUNT_WS_PERMILLE, |
367 | "hot-bb-count-ws-permille", | |
368 | "A basic block profile count is considered hot if it contributes to " | |
369 | "the given permillage of the entire profiled execution", | |
370 | 999, 0, 1000) | |
194734e9 JH |
371 | DEFPARAM(HOT_BB_FREQUENCY_FRACTION, |
372 | "hot-bb-frequency-fraction", | |
e06c0feb NS |
373 | "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot", |
374 | 1000, 0, 0) | |
95b9a3a5 | 375 | |
bfaa17c1 TJ |
376 | DEFPARAM(UNLIKELY_BB_COUNT_FRACTION, |
377 | "unlikely-bb-count-fraction", | |
378 | "The minimum fraction of profile runs a given basic block execution count must be not to be considered unlikely", | |
379 | 20, 1, 10000) | |
380 | ||
edbed3d3 JH |
381 | DEFPARAM (PARAM_ALIGN_THRESHOLD, |
382 | "align-threshold", | |
383 | "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment", | |
7b55f98f | 384 | 100, 1, 0) |
edbed3d3 JH |
385 | |
386 | DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS, | |
387 | "align-loop-iterations", | |
388 | "Loops iterating at least selected number of iterations will get loop alignement.", | |
389 | 4, 0, 0) | |
390 | ||
95b9a3a5 JH |
391 | /* For guessed profiles, the loops having unknown number of iterations |
392 | are predicted to iterate relatively few (10) times at average. | |
393 | For functions containing one loop with large known number of iterations | |
394 | and other loops having unbounded loops we would end up predicting all | |
c83eecad | 395 | the other loops cold that is not usually the case. So we need to artificially |
b8698a0f | 396 | flatten the profile. |
95b9a3a5 | 397 | |
6416ae7f | 398 | We need to cut the maximal predicted iterations to large enough iterations |
b131b583 | 399 | so the loop appears important, but safely within maximum hotness |
95b9a3a5 JH |
400 | range. */ |
401 | ||
402 | DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS, | |
403 | "max-predicted-iterations", | |
404 | "The maximum number of loop iterations we predict statically", | |
405 | 100, 0, 0) | |
942df739 RX |
406 | |
407 | /* This parameter controls the probability of builtin_expect. The default | |
408 | value is 90%. This empirical value is obtained through the weighted | |
409 | probability of FDO counters (with the FDO count value as the weight) | |
410 | in some real world programs: | |
411 | (1) Google performance test benchmarks: the probability is 0.9081. | |
412 | (2) Linux 3.3 kernel running Google search workload: the probability | |
413 | is 0.8717. */ | |
414 | ||
415 | DEFPARAM(BUILTIN_EXPECT_PROBABILITY, | |
416 | "builtin-expect-probability", | |
417 | "Set the estimated probability in percentage for builtin expect. The default value is 90% probability.", | |
418 | 90, 0, 100) | |
5c856b23 JH |
419 | DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK, |
420 | "tracer-dynamic-coverage-feedback", | |
e06c0feb NS |
421 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available", |
422 | 95, 0, 100) | |
5c856b23 JH |
423 | DEFPARAM(TRACER_DYNAMIC_COVERAGE, |
424 | "tracer-dynamic-coverage", | |
e06c0feb NS |
425 | "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available", |
426 | 75, 0, 100) | |
5c856b23 JH |
427 | DEFPARAM(TRACER_MAX_CODE_GROWTH, |
428 | "tracer-max-code-growth", | |
2cc98056 | 429 | "Maximal code growth caused by tail duplication (in percent)", |
e06c0feb | 430 | 100, 0, 0) |
5c856b23 JH |
431 | DEFPARAM(TRACER_MIN_BRANCH_RATIO, |
432 | "tracer-min-branch-ratio", | |
e06c0feb NS |
433 | "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)", |
434 | 10, 0, 100) | |
5c856b23 JH |
435 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK, |
436 | "tracer-min-branch-probability-feedback", | |
e06c0feb NS |
437 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available", |
438 | 80, 0, 100) | |
5c856b23 JH |
439 | DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY, |
440 | "tracer-min-branch-probability", | |
e06c0feb NS |
441 | "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available", |
442 | 50, 0, 100) | |
3788cc17 | 443 | |
5f24e0dc RH |
444 | /* The maximum number of incoming edges to consider for crossjumping. */ |
445 | DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES, | |
446 | "max-crossjump-edges", | |
447 | "The maximum number of incoming edges to consider for crossjumping", | |
e06c0feb | 448 | 100, 0, 0) |
5f24e0dc | 449 | |
12183e0f PH |
450 | /* The minimum number of matching instructions to consider for crossjumping. */ |
451 | DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS, | |
452 | "min-crossjump-insns", | |
453 | "The minimum number of matching instructions to consider for crossjumping", | |
781b2e62 | 454 | 5, 1, 0) |
12183e0f | 455 | |
f935b9e0 DE |
456 | /* The maximum number expansion factor when copying basic blocks. */ |
457 | DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS, | |
458 | "max-grow-copy-bb-insns", | |
459 | "The maximum expansion factor when copying basic blocks", | |
460 | 8, 0, 0) | |
461 | ||
bbcb0c05 SB |
462 | /* The maximum number of insns to duplicate when unfactoring computed gotos. */ |
463 | DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS, | |
464 | "max-goto-duplication-insns", | |
465 | "The maximum number of insns to duplicate when unfactoring computed gotos", | |
466 | 8, 0, 0) | |
467 | ||
9bf8cfbf ZD |
468 | /* The maximum length of path considered in cse. */ |
469 | DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH, | |
470 | "max-cse-path-length", | |
2cc98056 | 471 | "The maximum length of path considered in cse", |
75ef8e3d | 472 | 10, 1, 0) |
95b9a3a5 | 473 | DEFPARAM(PARAM_MAX_CSE_INSNS, |
921b02cd | 474 | "max-cse-insns", |
95b9a3a5 JH |
475 | "The maximum instructions CSE process before flushing", |
476 | 1000, 0, 0) | |
9bf8cfbf | 477 | |
a7e5372d ZD |
478 | /* The cost of expression in loop invariant motion that is considered |
479 | expensive. */ | |
480 | DEFPARAM(PARAM_LIM_EXPENSIVE, | |
481 | "lim-expensive", | |
482 | "The minimum cost of an expensive expression in the loop invariant motion", | |
e06c0feb | 483 | 20, 0, 0) |
a7e5372d | 484 | |
8b11a64c ZD |
485 | /* Bound on number of candidates for induction variables below that |
486 | all candidates are considered for each use in induction variable | |
487 | optimizations. */ | |
488 | ||
489 | DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND, | |
490 | "iv-consider-all-candidates-bound", | |
491 | "Bound on number of candidates below that all candidates are considered in iv optimizations", | |
e06c0feb | 492 | 30, 0, 0) |
8b11a64c ZD |
493 | |
494 | /* The induction variable optimizations give up on loops that contain more | |
495 | induction variable uses. */ | |
496 | ||
497 | DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES, | |
498 | "iv-max-considered-uses", | |
499 | "Bound on number of iv uses in loop optimized in iv optimizations", | |
e06c0feb | 500 | 250, 0, 0) |
8b11a64c | 501 | |
36f5ada1 ZD |
502 | /* If there are at most this number of ivs in the set, try removing unnecessary |
503 | ivs from the set always. */ | |
504 | ||
505 | DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND, | |
506 | "iv-always-prune-cand-set-bound", | |
507 | "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization", | |
508 | 10, 0, 0) | |
509 | ||
2412d35c SP |
510 | DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE, |
511 | "scev-max-expr-size", | |
512 | "Bound on size of expressions used in the scalar evolutions analyzer", | |
14dd9aab SP |
513 | 100, 0, 0) |
514 | ||
515 | DEFPARAM(PARAM_SCEV_MAX_EXPR_COMPLEXITY, | |
516 | "scev-max-expr-complexity", | |
517 | "Bound on the complexity of the expressions in the scalar evolutions analyzer", | |
518 | 10, 0, 0) | |
2412d35c | 519 | |
3d8864c0 SP |
520 | DEFPARAM(PARAM_OMEGA_MAX_VARS, |
521 | "omega-max-vars", | |
522 | "Bound on the number of variables in Omega constraint systems", | |
523 | 128, 0, 0) | |
524 | ||
525 | DEFPARAM(PARAM_OMEGA_MAX_GEQS, | |
526 | "omega-max-geqs", | |
527 | "Bound on the number of inequalities in Omega constraint systems", | |
528 | 256, 0, 0) | |
529 | ||
530 | DEFPARAM(PARAM_OMEGA_MAX_EQS, | |
531 | "omega-max-eqs", | |
532 | "Bound on the number of equalities in Omega constraint systems", | |
533 | 128, 0, 0) | |
534 | ||
535 | DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS, | |
536 | "omega-max-wild-cards", | |
537 | "Bound on the number of wild cards in Omega constraint systems", | |
538 | 18, 0, 0) | |
539 | ||
540 | DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE, | |
541 | "omega-hash-table-size", | |
542 | "Bound on the size of the hash table in Omega constraint systems", | |
543 | 550, 0, 0) | |
544 | ||
545 | DEFPARAM(PARAM_OMEGA_MAX_KEYS, | |
546 | "omega-max-keys", | |
547 | "Bound on the number of keys in Omega constraint systems", | |
548 | 500, 0, 0) | |
549 | ||
550 | DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS, | |
551 | "omega-eliminate-redundant-constraints", | |
552 | "When set to 1, use expensive methods to eliminate all redundant constraints", | |
553 | 0, 0, 1) | |
554 | ||
bc1edb77 VK |
555 | DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS, |
556 | "vect-max-version-for-alignment-checks", | |
557 | "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check", | |
c12cc930 KB |
558 | 6, 0, 0) |
559 | ||
bc1edb77 VK |
560 | DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS, |
561 | "vect-max-version-for-alias-checks", | |
562 | "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check", | |
563 | 10, 0, 0) | |
564 | ||
4f17aa0b XDL |
565 | DEFPARAM(PARAM_VECT_MAX_PEELING_FOR_ALIGNMENT, |
566 | "vect-max-peeling-for-alignment", | |
567 | "Max number of loop peels to enhancement alignment of data references in a loop", | |
568 | -1, -1, 64) | |
569 | ||
c65ecebc JH |
570 | DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS, |
571 | "max-cselib-memory-locations", | |
572 | "The maximum memory locations recorded by cselib", | |
e06c0feb | 573 | 500, 0, 0) |
c65ecebc | 574 | |
3788cc17 ZW |
575 | #ifdef ENABLE_GC_ALWAYS_COLLECT |
576 | # define GGC_MIN_EXPAND_DEFAULT 0 | |
737c38d1 | 577 | # define GGC_MIN_HEAPSIZE_DEFAULT 0 |
3788cc17 ZW |
578 | #else |
579 | # define GGC_MIN_EXPAND_DEFAULT 30 | |
737c38d1 | 580 | # define GGC_MIN_HEAPSIZE_DEFAULT 4096 |
3788cc17 ZW |
581 | #endif |
582 | ||
583 | DEFPARAM(GGC_MIN_EXPAND, | |
584 | "ggc-min-expand", | |
e06c0feb NS |
585 | "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap", |
586 | GGC_MIN_EXPAND_DEFAULT, 0, 0) | |
3788cc17 | 587 | |
3788cc17 ZW |
588 | DEFPARAM(GGC_MIN_HEAPSIZE, |
589 | "ggc-min-heapsize", | |
2cc98056 | 590 | "Minimum heap size before we start collecting garbage, in kilobytes", |
e06c0feb | 591 | GGC_MIN_HEAPSIZE_DEFAULT, 0, 0) |
737c38d1 GK |
592 | |
593 | #undef GGC_MIN_EXPAND_DEFAULT | |
594 | #undef GGC_MIN_HEAPSIZE_DEFAULT | |
3788cc17 | 595 | |
0bcf8261 JH |
596 | DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS, |
597 | "max-reload-search-insns", | |
598 | "The maximum number of instructions to search backward when looking for equivalent reload", | |
e06c0feb | 599 | 100, 0, 0) |
0bcf8261 | 600 | |
1cc17820 JL |
601 | DEFPARAM(PARAM_SINK_FREQUENCY_THRESHOLD, |
602 | "sink-frequency-threshold", | |
603 | "Target block's relative execution frequency (as a percentage) required to sink a statement", | |
604 | 75, 0, 100) | |
605 | ||
f72c6b56 DE |
606 | DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS, |
607 | "max-sched-region-blocks", | |
608 | "The maximum number of blocks in a region to be considered for interblock scheduling", | |
e06c0feb | 609 | 10, 0, 0) |
f72c6b56 DE |
610 | |
611 | DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS, | |
612 | "max-sched-region-insns", | |
613 | "The maximum number of insns in a region to be considered for interblock scheduling", | |
e06c0feb | 614 | 100, 0, 0) |
f72c6b56 | 615 | |
e855c69d AB |
616 | DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS, |
617 | "max-pipeline-region-blocks", | |
618 | "The maximum number of blocks in a region to be considered for interblock scheduling", | |
619 | 15, 0, 0) | |
620 | ||
621 | DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS, | |
622 | "max-pipeline-region-insns", | |
623 | "The maximum number of insns in a region to be considered for interblock scheduling", | |
624 | 200, 0, 0) | |
625 | ||
6f48c21a PS |
626 | DEFPARAM(PARAM_MIN_SPEC_PROB, |
627 | "min-spec-prob", | |
628 | "The minimum probability of reaching a source block for interblock speculative scheduling", | |
629 | 40, 0, 0) | |
630 | ||
d08eefb9 MK |
631 | DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS, |
632 | "max-sched-extend-regions-iters", | |
633 | "The maximum number of iterations through CFG to extend regions", | |
bb83aa4b | 634 | 0, 0, 0) |
d08eefb9 | 635 | |
496d7bb0 MK |
636 | DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY, |
637 | "max-sched-insn-conflict-delay", | |
638 | "The maximum conflict delay for an insn to be considered for speculative motion", | |
639 | 3, 1, 10) | |
640 | ||
641 | DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF, | |
642 | "sched-spec-prob-cutoff", | |
643 | "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.", | |
644 | 40, 0, 100) | |
645 | ||
975ccf22 BS |
646 | DEFPARAM(PARAM_SCHED_STATE_EDGE_PROB_CUTOFF, |
647 | "sched-state-edge-prob-cutoff", | |
648 | "The minimum probability an edge must have for the scheduler to save its state across it.", | |
649 | 10, 0, 100) | |
650 | ||
e855c69d AB |
651 | DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD, |
652 | "selsched-max-lookahead", | |
653 | "The maximum size of the lookahead window of selective scheduling", | |
654 | 50, 0, 0) | |
655 | ||
656 | DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES, | |
657 | "selsched-max-sched-times", | |
658 | "Maximum number of times that an insn could be scheduled", | |
659 | 2, 0, 0) | |
660 | ||
661 | DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME, | |
662 | "selsched-insns-to-rename", | |
663 | "Maximum number of instructions in the ready list that are considered eligible for renaming", | |
664 | 2, 0, 0) | |
665 | ||
666 | DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST, | |
667 | "sched-mem-true-dep-cost", | |
668 | "Minimal distance between possibly conflicting store and load", | |
669 | 1, 0, 0) | |
670 | ||
49c3b9a8 JJ |
671 | DEFPARAM(PARAM_MAX_LAST_VALUE_RTL, |
672 | "max-last-value-rtl", | |
673 | "The maximum number of RTL nodes that can be recorded as combiner's last value", | |
674 | 10000, 0, 0) | |
675 | ||
e9a8fc23 RB |
676 | DEFPARAM(PARAM_MAX_COMBINE_INSNS, |
677 | "max-combine-insns", | |
678 | "The maximum number of insns combine tries to combine", | |
679 | 4, 2, 4) | |
680 | ||
89b0433e NS |
681 | /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for |
682 | {signed,unsigned} integral types. This determines N. | |
c58c0d4c RG |
683 | Experimentation shows 251 to be a good value that generates the |
684 | least amount of garbage for allocating the TREE_VEC storage. */ | |
89b0433e NS |
685 | DEFPARAM (PARAM_INTEGER_SHARE_LIMIT, |
686 | "integer-share-limit", | |
687 | "The upper bound for sharing integer constants", | |
c58c0d4c | 688 | 251, 2, 2) |
89b0433e | 689 | |
7d69de61 RH |
690 | DEFPARAM (PARAM_SSP_BUFFER_SIZE, |
691 | "ssp-buffer-size", | |
692 | "The lower bound for a buffer to be considered for stack smashing protection", | |
693 | 8, 1, 0) | |
694 | ||
4d5b5e9f ER |
695 | DEFPARAM (PARAM_MIN_SIZE_FOR_STACK_SHARING, |
696 | "min-size-for-stack-sharing", | |
697 | "The minimum size of variables taking part in stack slot sharing " | |
698 | "when not optimizing", | |
699 | 32, 0, 0) | |
700 | ||
43f31be5 JL |
701 | /* When we thread through a block we have to make copies of the |
702 | statements within the block. Clearly for large blocks the code | |
703 | duplication is bad. | |
704 | ||
705 | PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number | |
706 | of statements and PHI nodes allowed in a block which is going to | |
707 | be duplicated for thread jumping purposes. | |
708 | ||
709 | Some simple analysis showed that more than 99% of the jump | |
710 | threading opportunities are for blocks with less than 15 | |
711 | statements. So we can get the benefits of jump threading | |
712 | without excessive code bloat for pathological cases with the | |
713 | throttle set at 15 statements. */ | |
714 | DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS, | |
715 | "max-jump-thread-duplication-stmts", | |
716 | "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps", | |
717 | 15, 0, 0) | |
98035a75 DB |
718 | |
719 | /* This is the maximum number of fields a variable may have before the pointer analysis machinery | |
b8698a0f | 720 | will stop trying to treat it in a field-sensitive manner. |
98035a75 DB |
721 | There are programs out there with thousands of fields per structure, and handling them |
722 | field-sensitively is not worth the cost. */ | |
723 | DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE, | |
724 | "max-fields-for-field-sensitive", | |
725 | "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable", | |
d9338cf0 | 726 | 0, 0, 0) |
6f8dd94b EB |
727 | |
728 | DEFPARAM(PARAM_MAX_SCHED_READY_INSNS, | |
729 | "max-sched-ready-insns", | |
730 | "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass", | |
731 | 100, 0, 0) | |
732 | ||
dabd47e7 JJ |
733 | /* This is the maximum number of active local stores RTL DSE will consider. */ |
734 | DEFPARAM (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES, | |
735 | "max-dse-active-local-stores", | |
736 | "Maximum number of active local stores in RTL dead store elimination", | |
737 | 5000, 0, 0) | |
738 | ||
47eb5b32 ZD |
739 | /* Prefetching and cache-optimizations related parameters. Default values are |
740 | usually set by machine description. */ | |
741 | ||
742 | /* The number of insns executed before prefetch is completed. */ | |
743 | ||
744 | DEFPARAM (PARAM_PREFETCH_LATENCY, | |
745 | "prefetch-latency", | |
746 | "The number of insns executed before prefetch is completed", | |
747 | 200, 0, 0) | |
748 | ||
749 | /* The number of prefetches that can run at the same time. */ | |
750 | ||
751 | DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES, | |
752 | "simultaneous-prefetches", | |
753 | "The number of prefetches that can run at the same time", | |
754 | 3, 0, 0) | |
755 | ||
46cb0441 | 756 | /* The size of L1 cache in kB. */ |
47eb5b32 ZD |
757 | |
758 | DEFPARAM (PARAM_L1_CACHE_SIZE, | |
759 | "l1-cache-size", | |
760 | "The size of L1 cache", | |
46cb0441 | 761 | 64, 0, 0) |
47eb5b32 ZD |
762 | |
763 | /* The size of L1 cache line in bytes. */ | |
764 | ||
765 | DEFPARAM (PARAM_L1_CACHE_LINE_SIZE, | |
766 | "l1-cache-line-size", | |
767 | "The size of L1 cache line", | |
768 | 32, 0, 0) | |
769 | ||
46cb0441 ZD |
770 | /* The size of L2 cache in kB. */ |
771 | ||
772 | DEFPARAM (PARAM_L2_CACHE_SIZE, | |
773 | "l2-cache-size", | |
774 | "The size of L2 cache", | |
775 | 512, 0, 0) | |
776 | ||
7313518b DG |
777 | /* Whether we should use canonical types rather than deep "structural" |
778 | type checking. Setting this value to 1 (the default) improves | |
779 | compilation performance in the C++ and Objective-C++ front end; | |
780 | this value should only be set to zero to work around bugs in the | |
781 | canonical type system by disabling it. */ | |
782 | ||
783 | DEFPARAM (PARAM_USE_CANONICAL_TYPES, | |
784 | "use-canonical-types", | |
785 | "Whether to use canonical types", | |
786 | 1, 0, 1) | |
f0ed4cfb NC |
787 | |
788 | DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH, | |
789 | "max-partial-antic-length", | |
790 | "Maximum length of partial antic set when performing tree pre optimization", | |
791 | 100, 0, 0) | |
792 | ||
863d2a57 RG |
793 | /* The following is used as a stop-gap limit for cases where really huge |
794 | SCCs blow up memory and compile-time use too much. If we hit this limit, | |
795 | SCCVN and such FRE and PRE will be not done at all for the current | |
796 | function. */ | |
797 | ||
798 | DEFPARAM (PARAM_SCCVN_MAX_SCC_SIZE, | |
799 | "sccvn-max-scc-size", | |
800 | "Maximum size of a SCC before SCCVN stops processing a function", | |
801 | 10000, 10, 0) | |
802 | ||
9bb06c2a RG |
803 | /* The following is used as a stop-gap limit for cases where really huge |
804 | functions blow up compile-time use too much. It limits the number of | |
805 | alias-queries we do for finding common subexpressions for memory loads and | |
806 | stores. The number of alias-queries is otherwise limited by the number of | |
807 | stores on paths to function entry. */ | |
808 | ||
809 | DEFPARAM (PARAM_SCCVN_MAX_ALIAS_QUERIES_PER_ACCESS, | |
810 | "sccvn-max-alias-queries-per-access", | |
811 | "Maximum number of disambiguations to perform per memory access", | |
812 | 1000, 0, 0) | |
813 | ||
058e97ec VM |
814 | DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM, |
815 | "ira-max-loops-num", | |
7b98c16f | 816 | "Max loops number for regional RA", |
30ea859e | 817 | 100, 0, 0) |
058e97ec | 818 | |
311aab06 VM |
819 | DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE, |
820 | "ira-max-conflict-table-size", | |
7b98c16f | 821 | "Max size of conflict table in MB", |
7cd06356 | 822 | 1000, 0, 0) |
311aab06 | 823 | |
1833192f VM |
824 | DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS, |
825 | "ira-loop-reserved-regs", | |
826 | "The number of registers in each class kept unused by loop invariant motion", | |
827 | 2, 0, 0) | |
828 | ||
88def637 VM |
829 | DEFPARAM (PARAM_LRA_MAX_CONSIDERED_RELOAD_PSEUDOS, |
830 | "lra-max-considered-reload-pseudos", | |
831 | "The max number of reload pseudos which are considered during spilling a non-reload pseudo", | |
832 | 500, 0, 0) | |
833 | ||
b6e99746 MJ |
834 | /* Switch initialization conversion will refuse to create arrays that are |
835 | bigger than this parameter times the number of switch branches. */ | |
836 | ||
837 | DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO, | |
838 | "switch-conversion-max-branch-ratio", | |
839 | "The maximum ratio between array size and switch branches for " | |
840 | "a switch conversion to take place", | |
841 | 8, 1, 0) | |
842 | ||
e797c5f2 SP |
843 | /* Size of tiles when doing loop blocking. */ |
844 | ||
845 | DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE, | |
846 | "loop-block-tile-size", | |
847 | "size of tiles for loop blocking", | |
848 | 51, 0, 0) | |
849 | ||
4e7dd376 SP |
850 | /* Maximal number of parameters that we allow in a SCoP. */ |
851 | ||
852 | DEFPARAM (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS, | |
853 | "graphite-max-nb-scop-params", | |
d97c90ae | 854 | "maximum number of parameters in a SCoP", |
4e7dd376 SP |
855 | 10, 0, 0) |
856 | ||
b6bb0094 SP |
857 | /* Maximal number of basic blocks in the functions analyzed by Graphite. */ |
858 | ||
859 | DEFPARAM (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION, | |
860 | "graphite-max-bbs-per-function", | |
d97c90ae | 861 | "maximum number of basic blocks per function to be analyzed by Graphite", |
b6bb0094 SP |
862 | 100, 0, 0) |
863 | ||
3881dee9 AB |
864 | /* Avoid data dependence analysis on very large loops. */ |
865 | DEFPARAM (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS, | |
866 | "loop-max-datarefs-for-datadeps", | |
867 | "Maximum number of datarefs in loop for building loop data dependencies", | |
868 | 1000, 0, 0) | |
869 | ||
b1fb9f56 JJ |
870 | /* Avoid doing loop invariant motion on very large loops. */ |
871 | ||
872 | DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP, | |
873 | "loop-invariant-max-bbs-in-loop", | |
7b98c16f | 874 | "Max basic blocks number in loop for loop invariant motion", |
b1fb9f56 JJ |
875 | 10000, 0, 0) |
876 | ||
a70d6342 IR |
877 | /* Avoid SLP vectorization of large basic blocks. */ |
878 | DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB, | |
879 | "slp-max-insns-in-bb", | |
880 | "Maximum number of instructions in basic block to be considered for SLP vectorization", | |
881 | 1000, 0, 0) | |
882 | ||
db34470d GS |
883 | DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO, |
884 | "min-insn-to-prefetch-ratio", | |
7b98c16f | 885 | "Min. ratio of insns to prefetches to enable prefetching for " |
db34470d | 886 | "a loop with an unknown trip count", |
fe4cd14b | 887 | 9, 0, 0) |
db34470d GS |
888 | |
889 | DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO, | |
890 | "prefetch-min-insn-to-mem-ratio", | |
7b98c16f | 891 | "Min. ratio of insns to mem ops to enable prefetching in a loop", |
db34470d GS |
892 | 3, 0, 0) |
893 | ||
ec8c3978 JJ |
894 | /* Set maximum hash table size for var tracking. */ |
895 | ||
896 | DEFPARAM (PARAM_MAX_VARTRACK_SIZE, | |
897 | "max-vartrack-size", | |
898 | "Max. size of var tracking hash tables", | |
899 | 50000000, 0, 0) | |
900 | ||
f0686e78 AO |
901 | /* Set maximum recursion depth for var tracking expression expansion |
902 | and resolution. */ | |
903 | ||
904 | DEFPARAM (PARAM_MAX_VARTRACK_EXPR_DEPTH, | |
905 | "max-vartrack-expr-depth", | |
906 | "Max. recursion depth for expanding var tracking expressions", | |
7f8925a1 | 907 | 12, 0, 0) |
f0686e78 | 908 | |
8ab1d2e9 JJ |
909 | /* Set maximum length of value location list for which var tracking |
910 | should add reverse operations. */ | |
911 | ||
912 | DEFPARAM (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE, | |
913 | "max-vartrack-reverse-op-size", | |
914 | "Max. size of loc list for which reverse ops should be added", | |
915 | 50, 0, 0) | |
916 | ||
b5b8b0ac AO |
917 | /* Set minimum insn uid for non-debug insns. */ |
918 | ||
919 | DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID, | |
920 | "min-nondebug-insn-uid", | |
921 | "The minimum UID to be used for a nondebug insn", | |
922 | 0, 1, 0) | |
923 | ||
07ffa034 MJ |
924 | DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR, |
925 | "ipa-sra-ptr-growth-factor", | |
7b98c16f | 926 | "Maximum allowed growth of size of new parameters ipa-sra replaces " |
07ffa034 MJ |
927 | "a pointer to an aggregate with", |
928 | 2, 0, 0) | |
929 | ||
0a35513e AH |
930 | DEFPARAM (PARAM_TM_MAX_AGGREGATE_SIZE, |
931 | "tm-max-aggregate-size", | |
932 | "Size in bytes after which thread-local aggregates should be " | |
933 | "instrumented with the logging functions instead of save/restore " | |
934 | "pairs", | |
935 | 9, 0, 0) | |
936 | ||
310bc633 MJ |
937 | DEFPARAM (PARAM_IPA_CP_VALUE_LIST_SIZE, |
938 | "ipa-cp-value-list-size", | |
939 | "Maximum size of a list of values associated with each parameter for " | |
940 | "interprocedural constant propagation", | |
3949c4a7 MJ |
941 | 8, 0, 0) |
942 | ||
310bc633 MJ |
943 | DEFPARAM (PARAM_IPA_CP_EVAL_THRESHOLD, |
944 | "ipa-cp-eval-threshold", | |
945 | "Threshold ipa-cp opportunity evaluation that is still considered " | |
946 | "beneficial to clone.", | |
947 | 500, 0, 0) | |
948 | ||
dfea20f1 MJ |
949 | DEFPARAM (PARAM_IPA_MAX_AGG_ITEMS, |
950 | "ipa-max-agg-items", | |
951 | "Maximum number of aggregate content items for a parameter in " | |
952 | "jump functions and lattices", | |
953 | 16, 0, 0) | |
954 | ||
2c9561b5 MJ |
955 | DEFPARAM (PARAM_IPA_CP_LOOP_HINT_BONUS, |
956 | "ipa-cp-loop-hint-bonus", | |
957 | "Compile-time bonus IPA-CP assigns to candidates which make loop " | |
958 | "bounds or strides known.", | |
959 | 64, 0, 0) | |
960 | ||
19321415 MJ |
961 | DEFPARAM (PARAM_IPA_CP_ARRAY_INDEX_HINT_BONUS, |
962 | "ipa-cp-array-index-hint-bonus", | |
963 | "Compile-time bonus IPA-CP assigns to candidates which make an array " | |
964 | "index known.", | |
965 | 48, 0, 0) | |
966 | ||
8aab5218 MJ |
967 | DEFPARAM (PARAM_IPA_MAX_AA_STEPS, |
968 | "ipa-max-aa-steps", | |
969 | "Maximum number of statements that will be visited by IPA formal " | |
970 | "parameter analysis based on alias analysis in any given function", | |
971 | 25000, 0, 0) | |
972 | ||
852e4bd2 JH |
973 | /* WHOPR partitioning configuration. */ |
974 | ||
975 | DEFPARAM (PARAM_LTO_PARTITIONS, | |
976 | "lto-partitions", | |
1cd9e416 | 977 | "Number of partitions the program should be split to", |
9bfbc1eb | 978 | 32, 1, 0) |
852e4bd2 JH |
979 | |
980 | DEFPARAM (MIN_PARTITION_SIZE, | |
981 | "lto-min-partition", | |
ac43f774 | 982 | "Minimal size of a partition for LTO (in estimated instructions)", |
852e4bd2 | 983 | 1000, 0, 0) |
501c95ff NF |
984 | |
985 | /* Diagnostic parameters. */ | |
986 | ||
987 | DEFPARAM (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP, | |
988 | "cxx-max-namespaces-for-diagnostic-help", | |
989 | "Maximum number of namespaces to search for alternatives when " | |
990 | "name lookup fails", | |
991 | 1000, 0, 0) | |
992 | ||
bfe068c3 IR |
993 | /* Maximum number of conditional store pairs that can be sunk. */ |
994 | DEFPARAM (PARAM_MAX_STORES_TO_SINK, | |
995 | "max-stores-to-sink", | |
996 | "Maximum number of conditional store pairs that can be sunk", | |
997 | 2, 0, 0) | |
998 | ||
3aa439ed MM |
999 | /* Override CASE_VALUES_THRESHOLD of when to switch from doing switch |
1000 | statements via if statements to using a table jump operation. If the value | |
1001 | is 0, the default CASE_VALUES_THRESHOLD will be used. */ | |
1002 | DEFPARAM (PARAM_CASE_VALUES_THRESHOLD, | |
1003 | "case-values-threshold", | |
1004 | "The smallest number of different values for which it is best to " | |
1005 | "use a jump-table instead of a tree of conditional branches, " | |
1006 | "if 0, use the default for the machine", | |
1007 | 0, 0, 0) | |
1008 | ||
1169e45d AH |
1009 | /* Data race flags for C++0x memory model compliance. */ |
1010 | DEFPARAM (PARAM_ALLOW_STORE_DATA_RACES, | |
1011 | "allow-store-data-races", | |
1012 | "Allow new data races on stores to be introduced", | |
680a5a7c | 1013 | 0, 0, 1) |
86951993 | 1014 | |
df7b0cc4 EI |
1015 | /* Reassociation width to be used by tree reassoc optimization. */ |
1016 | DEFPARAM (PARAM_TREE_REASSOC_WIDTH, | |
1017 | "tree-reassoc-width", | |
1018 | "Set the maximum number of instructions executed in parallel in " | |
1019 | "reassociated tree. If 0, use the target dependent heuristic.", | |
1020 | 0, 0, 0) | |
1021 | ||
c9e93168 TV |
1022 | DEFPARAM (PARAM_MAX_TAIL_MERGE_COMPARISONS, |
1023 | "max-tail-merge-comparisons", | |
1024 | "Maximum amount of similar bbs to compare a bb with", | |
1025 | 10, 0, 0) | |
1026 | ||
1027 | DEFPARAM (PARAM_MAX_TAIL_MERGE_ITERATIONS, | |
1028 | "max-tail-merge-iterations", | |
1029 | "Maximum amount of iterations of the pass over a function", | |
1030 | 2, 0, 0) | |
bfe068c3 | 1031 | |
19ecbcbc JJ |
1032 | /* Maximum number of strings for which strlen optimization pass will |
1033 | track string lenths. */ | |
1034 | DEFPARAM (PARAM_MAX_TRACKED_STRLENS, | |
1035 | "max-tracked-strlens", | |
1036 | "Maximum number of strings for which strlen optimization pass will " | |
1037 | "track string lengths", | |
1038 | 1000, 0, 0) | |
1039 | ||
c881de02 RS |
1040 | /* Keep this in sync with the sched_pressure_algorithm enum. */ |
1041 | DEFPARAM (PARAM_SCHED_PRESSURE_ALGORITHM, | |
1042 | "sched-pressure-algorithm", | |
1043 | "Which -fsched-pressure algorithm to apply", | |
1044 | 1, 1, 2) | |
1045 | ||
ccdbfe93 BS |
1046 | /* Maximum length of candidate scans in straight-line strength reduction. */ |
1047 | DEFPARAM (PARAM_MAX_SLSR_CANDIDATE_SCAN, | |
1048 | "max-slsr-cand-scan", | |
1049 | "Maximum length of candidate scans for straight-line " | |
1050 | "strength reduction", | |
1051 | 50, 1, 999999) | |
1052 | ||
b5ebc991 MO |
1053 | DEFPARAM (PARAM_ASAN_STACK, |
1054 | "asan-stack", | |
1055 | "Enable asan stack protection", | |
1056 | 1, 0, 1) | |
1057 | ||
1058 | DEFPARAM (PARAM_ASAN_GLOBALS, | |
1059 | "asan-globals", | |
1060 | "Enable asan globals protection", | |
1061 | 1, 0, 1) | |
1062 | ||
1063 | DEFPARAM (PARAM_ASAN_INSTRUMENT_WRITES, | |
1064 | "asan-instrument-writes", | |
1065 | "Enable asan store operations protection", | |
1066 | 1, 0, 1) | |
1067 | ||
1068 | DEFPARAM (PARAM_ASAN_INSTRUMENT_READS, | |
1069 | "asan-instrument-reads", | |
1070 | "Enable asan load operations protection", | |
1071 | 1, 0, 1) | |
1072 | ||
1073 | DEFPARAM (PARAM_ASAN_MEMINTRIN, | |
1074 | "asan-memintrin", | |
1075 | "Enable asan builtin functions protection", | |
1076 | 1, 0, 1) | |
1077 | ||
1078 | DEFPARAM (PARAM_ASAN_USE_AFTER_RETURN, | |
1079 | "asan-use-after-return", | |
1080 | "Enable asan builtin functions protection", | |
1081 | 1, 0, 1) | |
92261ce0 | 1082 | |
8946c29e YG |
1083 | DEFPARAM (PARAM_ASAN_INSTRUMENTATION_WITH_CALL_THRESHOLD, |
1084 | "asan-instrumentation-with-call-threshold", | |
1085 | "Use callbacks instead of inline code once number of accesses " | |
1086 | " in function becomes greater or equal than this threshold", | |
1087 | 10000, 0, INT_MAX) | |
1088 | ||
92261ce0 JJ |
1089 | DEFPARAM (PARAM_UNINIT_CONTROL_DEP_ATTEMPTS, |
1090 | "uninit-control-dep-attempts", | |
1091 | "Maximum number of nested calls to search for control dependencies " | |
1092 | "during uninitialized variable analysis", | |
1093 | 1000, 1, 0) | |
c6d9a88c | 1094 | /* |
b5ebc991 | 1095 | |
c6d9a88c MM |
1096 | Local variables: |
1097 | mode:c | |
f4b4a3e2 NC |
1098 | End: |
1099 | */ |