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