1 /* params.def
- Run
-time parameters.
2 Copyright (C
) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 Free Software Foundation
, Inc.
5 Written by Mark Mitchell
<mark@codesourcery.com
>.
7 This file is part of GCC.
9 GCC is free software
; you can redistribute it and
/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation
; either version
3, or (at your option
) any later
14 GCC is distributed in the hope that it will be useful
, but WITHOUT ANY
15 WARRANTY
; without even the implied warranty of MERCHANTABILITY or
16 FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC
; see the file COPYING3. If not see
21 <http
://www.gnu.org
/licenses
/>.
*/
23 /* This file contains definitions for language
-independent
24 parameters. The DEFPARAM macro takes
6 arguments
:
26 - The enumeral corresponding to this parameter.
28 - The name that can be used to set this parameter using the
29 command
-line option `
--param
<name
>=<value
>'.
31 - A help string explaining how the parameter is used.
33 - A default value for the parameter.
35 - The minimum acceptable value for the parameter.
37 - The maximum acceptable value for the parameter (if greater than
40 Be sure to add an entry to invoke.texi summarizing the parameter. */
42 /* When branch is predicted to be taken with probability lower than this
43 threshold (in percent), then it is considered well predictable. */
44 DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME,
45 "predictable-branch-outcome",
46 "Maximal estimated outcome of branch considered predictable",
49 /* The single function inlining limit. This is the maximum size
50 of a function counted in internal gcc instructions (not in
51 real machine instructions) that is eligible for inlining
53 The default value is 450.
54 Only functions marked inline (or methods defined in the class
55 definition for C++) are affected by this.
56 There are more restrictions to inlining: If inlined functions
57 call other functions, the already inlined instructions are
58 counted and once the recursive inline limit (see
59 "max-inline-insns" parameter) is exceeded, the acceptable size
61 DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE,
62 "max-inline-insns-single",
63 "The maximum number of instructions in a single function eligible for inlining",
66 /* The single function inlining limit for functions that are
67 inlined by virtue of -finline-functions (-O3).
68 This limit should be chosen to be below or equal to the limit
69 that is applied to functions marked inlined (or defined in the
70 class declaration in C++) given by the "max-inline-insns-single"
72 The default value is 40. */
73 DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO,
74 "max-inline-insns-auto",
75 "The maximum number of instructions when automatically inlining",
78 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE,
79 "max-inline-insns-recursive",
80 "The maximum number of instructions inline function can grow to via recursive inlining",
83 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO,
84 "max-inline-insns-recursive-auto",
85 "The maximum number of instructions non-inline function can grow to via recursive inlining",
88 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH,
89 "max-inline-recursive-depth",
90 "The maximum depth of recursive inlining for inline functions",
93 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO,
94 "max-inline-recursive-depth-auto",
95 "The maximum depth of recursive inlining for non-inline functions",
98 DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY,
99 "min-inline-recursive-probability",
100 "Inline recursively only when the probability of call being executed exceeds the parameter",
103 DEFPARAM (PARAM_INLINE_FUNCTION_OVERHEAD_SIZE,
104 "inline-function-overhead-size",
105 "Size estimate of function overhead (prologue/epilogue) for inlining purposes",
108 DEFPARAM (PARAM_INLINE_HOT_CALLER,
110 "Consider cold callsites for inlining if caller contains hot code",
113 /* Limit of iterations of early inliner. This basically bounds number of
114 nested indirect calls early inliner can resolve. Deeper chains are still
115 handled by late inlining. */
116 DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS,
117 "max-early-inliner-iterations",
118 "The maximum number of nested indirect inlining performed by early inliner",
121 /* Limit on probability of entry BB. */
122 DEFPARAM (PARAM_COMDAT_SHARING_PROBABILITY,
123 "comdat-sharing-probability",
124 "Probability that COMDAT function will be shared with different compilation unit",
127 /* Limit on probability of entry BB. */
128 DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY,
129 "partial-inlining-entry-probability",
130 "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen",
133 /* Limit the number of expansions created by the variable expansion
134 optimization to avoid register pressure. */
135 DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS,
136 "max-variable-expansions-in-unroller",
137 "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling",
140 /* Limit loop autovectorization to loops with large enough iteration count. */
141 DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND,
142 "min-vect-loop-bound",
143 "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization",
146 /* The maximum number of instructions to consider when looking for an
147 instruction to fill a delay slot. If more than this arbitrary
148 number of instructions is searched, the time savings from filling
149 the delay slot will be minimal so stop searching. Increasing
150 values mean more aggressive optimization, making the compile time
151 increase with probably small improvement in executable run time. */
152 DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH,
153 "max-delay-slot-insn-search",
154 "The maximum number of instructions to consider to fill a delay slot",
157 /* When trying to fill delay slots, the maximum number of instructions
158 to consider when searching for a block with valid live register
159 information. Increasing this arbitrarily chosen value means more
160 aggressive optimization, increasing the compile time. This
161 parameter should be removed when the delay slot code is rewritten
162 to maintain the control-flow graph. */
163 DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
164 "max-delay-slot-live-search",
165 "The maximum number of instructions to consider to find accurate live register information",
168 /* This parameter limits the number of branch elements that the
169 scheduler will track anti-dependencies through without resetting
170 the tracking mechanism. Large functions with few calls or barriers
171 can generate lists containing many 1000's of dependencies. Generally
172 the compiler either uses all available memory
, or runs for far too long.
*/
173 DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH
,
174 "max-pending-list-length",
175 "The maximum length of scheduling's pending operations list",
178 /* This parameter limits the number of backtracking attempts when using the
179 haifa scheduler for modulo scheduling.
*/
180 DEFPARAM(PARAM_MAX_MODULO_BACKTRACK_ATTEMPTS
,
181 "max-modulo-backtrack-attempts",
182 "The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop",
185 DEFPARAM(PARAM_LARGE_FUNCTION_INSNS
,
186 "large-function-insns",
187 "The size of function body to be considered large",
189 DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH
,
190 "large-function-growth",
191 "Maximal growth due to inlining of large function (in percent)",
193 DEFPARAM(PARAM_LARGE_UNIT_INSNS
,
195 "The size of translation unit to be considered large",
197 DEFPARAM(PARAM_INLINE_UNIT_GROWTH
,
198 "inline-unit-growth",
199 "How much can given compilation unit grow because of the inlining (in percent)",
201 DEFPARAM(PARAM_IPCP_UNIT_GROWTH
,
203 "How much can given compilation unit grow because of the interprocedural constant propagation (in percent)",
205 DEFPARAM(PARAM_EARLY_INLINING_INSNS
,
206 "early-inlining-insns",
207 "Maximal estimated growth of function body caused by early inlining of single call",
209 DEFPARAM(PARAM_EARLY_INLINING_INSNS_NON_LEAF
,
210 "early-inlining-insns-non-leaf",
211 "Maximal allowed growth of a non-leaf function body caused by early inlining of single call",
213 DEFPARAM(PARAM_EARLY_INLINING_INSNS_ANY
,
214 "early-inlining-insns-any",
215 "Early inline calls if growth does not exceed this limit",
217 DEFPARAM(PARAM_EARLY_INLINING_INSNS_COMDAT
,
218 "early-inlining-insns-comdat",
219 "Early inline calls to comdate functions if growth does not exceed this limit",
221 DEFPARAM(PARAM_LARGE_STACK_FRAME
,
223 "The size of stack frame to be considered large",
225 DEFPARAM(PARAM_STACK_FRAME_GROWTH
,
226 "large-stack-frame-growth",
227 "Maximal stack frame growth due to inlining (in percent)",
230 /* The GCSE optimization will be disabled if it would require
231 significantly more memory than this value.
*/
232 DEFPARAM(PARAM_MAX_GCSE_MEMORY
,
234 "The maximum amount of memory to be allocated by GCSE",
235 50 * 1024 * 1024, 0, 0)
237 /* The GCSE optimization of an expression will avoided if the ratio of
238 insertions to deletions is greater than this value.
*/
239 DEFPARAM(PARAM_MAX_GCSE_INSERTION_RATIO
,
240 "max-gcse-insertion-ratio",
241 "The maximum ratio of insertions to deletions of expressions in GCSE",
244 /* This is the threshold ratio when to perform partial redundancy
245 elimination after reload. We perform partial redundancy elimination
246 when the following holds
:
247 (Redundant load execution count
)
248 ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION
249 (Added loads execution count
) */
250 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION
,
251 "gcse-after-reload-partial-fraction",
252 "The threshold ratio for performing partial redundancy elimination after reload",
254 /* This is the threshold ratio of the critical edges execution count compared to
255 the redundant loads execution count that permits performing the load
256 redundancy elimination in gcse after reload.
*/
257 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION
,
258 "gcse-after-reload-critical-fraction",
259 "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload",
262 /* GCSE will use GCSE_COST_DISTANCE_RATION as a scaling factor
263 to calculate maximum distance for which an expression is allowed to move
264 from its rtx_cost.
*/
265 DEFPARAM(PARAM_GCSE_COST_DISTANCE_RATIO
,
266 "gcse-cost-distance-ratio",
267 "Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations",
269 /* GCSE won
't restrict distance for which an expression with rtx_cost greater
270 than COSTS_N_INSN(GCSE_UNRESTRICTED_COST) is allowed to move. */
271 DEFPARAM(PARAM_GCSE_UNRESTRICTED_COST,
272 "gcse-unrestricted-cost",
273 "Cost at which GCSE optimizations will not constraint the distance an expression can travel",
276 /* How deep from a given basic block the dominator tree should be searched
277 for expressions to hoist to the block. The value of 0 will avoid limiting
279 DEFPARAM(PARAM_MAX_HOIST_DEPTH,
281 "Maximum depth of search in the dominator tree for expressions to hoist",
284 /* This parameter limits the number of insns in a loop that will be unrolled,
285 and by how much the loop is unrolled.
287 This limit should be at most half of the peeling limits: loop unroller
288 decides to not unroll loops that iterate fewer than 2*number of allowed
289 unrollings and thus we would have loops that are neither peeled or unrolled
291 DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
292 "max-unrolled-insns",
293 "The maximum number of instructions to consider to unroll in a loop",
295 /* This parameter limits how many times the loop is unrolled depending
296 on number of insns really executed in each iteration. */
297 DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS,
298 "max-average-unrolled-insns",
299 "The maximum number of instructions to consider to unroll in a loop on average",
301 /* The maximum number of unrollings of a single loop. */
302 DEFPARAM(PARAM_MAX_UNROLL_TIMES,
304 "The maximum number of unrollings of a single loop",
306 /* The maximum number of insns of a peeled loop. */
307 DEFPARAM(PARAM_MAX_PEELED_INSNS,
309 "The maximum number of insns of a peeled loop",
311 /* The maximum number of peelings of a single loop. */
312 DEFPARAM(PARAM_MAX_PEEL_TIMES,
314 "The maximum number of peelings of a single loop",
316 /* The maximum number of insns of a peeled loop. */
317 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS,
318 "max-completely-peeled-insns",
319 "The maximum number of insns of a completely peeled loop",
321 /* The maximum number of insns of a peeled loop, when feedback
322 information is available. */
323 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS_FEEDBACK,
324 "max-completely-peeled-insns-feedback",
325 "The maximum number of insns of a completely peeled loop when profile "
326 "feedback is available",
328 /* The maximum number of peelings of a single loop that is peeled completely. */
329 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES,
330 "max-completely-peel-times",
331 "The maximum number of peelings of a single loop that is peeled completely",
333 /* The maximum number of peelings of a single loop that is peeled
334 completely, when feedback information is available. */
335 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES_FEEDBACK,
336 "max-completely-peel-times-feedback",
337 "The maximum number of peelings of a single loop that is peeled "
338 "completely, when profile feedback is available",
340 /* The maximum number of insns of a peeled loop that rolls only once. */
341 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS,
342 "max-once-peeled-insns",
343 "The maximum number of insns of a peeled loop that rolls only once",
345 /* The maximum number of insns of a peeled loop that rolls only once,
346 when feedback information is available. */
347 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS_FEEDBACK,
348 "max-once-peeled-insns-feedback",
349 "The maximum number of insns of a peeled loop that rolls only once, "
350 "when profile feedback is available",
352 /* The maximum depth of a loop nest we completely peel. */
353 DEFPARAM(PARAM_MAX_UNROLL_ITERATIONS,
354 "max-completely-peel-loop-nest-depth",
355 "The maximum depth of a loop nest we completely peel",
357 /* The maximum code size estimate under which loop unrolling and peeling
358 * is allowed in a profile feedback compile. This currently applies to loops
359 * with non-constant iteration counts and no floating point computations. */
360 DEFPARAM(PARAM_UNROLLPEEL_CODESIZE_THRESHOLD,
361 "unrollpeel-codesize-threshold",
362 "Maximum profile-based code size footprint estimate for loop unrolling "
365 /* The maximum ratio of total profiled execution counts to loop entry block
366 count that must be exceeded to ignore most code size limits when unrolling
368 DEFPARAM(PARAM_UNROLLPEEL_HOTNESS_THRESHOLD,
369 "unrollpeel-hotness-threshold",
370 "Maximum ratio of total profiled execution count to loop entry "
371 "block count under which most codesize limits for unrolling and "
372 "peeling will be ignored",
375 DEFPARAM(PARAM_MIN_ITER_UNROLL_WITH_BRANCHES,
376 "min-iter-unroll-with-branches",
377 "Minimum iteration count to ignore branch effects when unrolling",
379 DEFPARAM(PARAM_UNROLL_OUTER_LOOP_BRANCH_BUDGET,
380 "unroll-outer-loop-branch-budget",
381 "Maximum number of branches allowed in hot outer loop region after unroll",
384 /* The maximum number of insns of an unswitched loop. */
385 DEFPARAM(PARAM_MAX_UNSWITCH_INSNS,
386 "max-unswitch-insns",
387 "The maximum number of insns of an unswitched loop",
389 /* The maximum level of recursion in unswitch_single_loop. */
390 DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
391 "max-unswitch-level",
392 "The maximum number of unswitchings in a single loop",
395 /* The maximum number of iterations of a loop the brute force algorithm
396 for analysis of # of iterations of the loop tries to evaluate. */
397 DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
398 "max-iterations-to-track",
399 "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
401 /* A cutoff to avoid costly computations of the number of iterations in
402 the doloop transformation. */
403 DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST,
404 "max-iterations-computation-cost",
405 "Bound on the cost of an expression to compute the number of iterations",
408 /* This parameter is used to tune SMS MAX II calculations. */
409 DEFPARAM(PARAM_SMS_MAX_II_FACTOR,
411 "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop",
413 /* The minimum value of stage count that swing modulo scheduler will generate. */
414 DEFPARAM(PARAM_SMS_MIN_SC,
416 "The minimum value of stage count that swing modulo scheduler will generate.",
418 DEFPARAM(PARAM_SMS_DFA_HISTORY,
420 "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA",
422 DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD,
423 "sms-loop-average-count-threshold",
424 "A threshold on the average loop count considered by the swing modulo scheduler",
427 DEFPARAM(HOT_BB_COUNT_WS_PERMILLE,
428 "hot-bb-count-ws-permille",
429 "A basic block profile count is considered hot if it contributes to "
430 "the given permillage of the entire profiled execution",
432 DEFPARAM(HOT_BB_FREQUENCY_FRACTION,
433 "hot-bb-frequency-fraction",
434 "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot",
437 DEFPARAM (PARAM_ALIGN_THRESHOLD,
439 "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment",
442 DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS,
443 "align-loop-iterations",
444 "Loops iterating at least selected number of iterations will get loop alignement.",
447 /* For guessed profiles, the loops having unknown number of iterations
448 are predicted to iterate relatively few (10) times at average.
449 For functions containing one loop with large known number of iterations
450 and other loops having unbounded loops we would end up predicting all
451 the other loops cold that is not usually the case. So we need to artificially
454 We need to cut the maximal predicted iterations to large enough iterations
455 so the loop appears important, but safely within maximum hotness
458 DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS,
459 "max-predicted-iterations",
460 "The maximum number of loop iterations we predict statically",
462 DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK,
463 "tracer-dynamic-coverage-feedback",
464 "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available",
466 DEFPARAM(TRACER_DYNAMIC_COVERAGE,
467 "tracer-dynamic-coverage",
468 "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available",
470 DEFPARAM(TRACER_MAX_CODE_GROWTH,
471 "tracer-max-code-growth",
472 "Maximal code growth caused by tail duplication (in percent)",
474 DEFPARAM(TRACER_MIN_BRANCH_RATIO,
475 "tracer-min-branch-ratio",
476 "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)",
478 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK,
479 "tracer-min-branch-probability-feedback",
480 "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available",
482 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY,
483 "tracer-min-branch-probability",
484 "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available",
487 /* The maximum number of incoming edges to consider for crossjumping. */
488 DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES,
489 "max-crossjump-edges",
490 "The maximum number of incoming edges to consider for crossjumping",
493 /* The minimum number of matching instructions to consider for crossjumping. */
494 DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS,
495 "min-crossjump-insns",
496 "The minimum number of matching instructions to consider for crossjumping",
499 /* The maximum number expansion factor when copying basic blocks. */
500 DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS,
501 "max-grow-copy-bb-insns",
502 "The maximum expansion factor when copying basic blocks",
505 /* The maximum number of insns to duplicate when unfactoring computed gotos. */
506 DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS,
507 "max-goto-duplication-insns",
508 "The maximum number of insns to duplicate when unfactoring computed gotos",
511 /* The maximum length of path considered in cse. */
512 DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH,
513 "max-cse-path-length",
514 "The maximum length of path considered in cse",
516 DEFPARAM(PARAM_MAX_CSE_INSNS,
518 "The maximum instructions CSE process before flushing",
521 /* The cost of expression in loop invariant motion that is considered
523 DEFPARAM(PARAM_LIM_EXPENSIVE,
525 "The minimum cost of an expensive expression in the loop invariant motion",
528 /* Bound on number of candidates for induction variables below that
529 all candidates are considered for each use in induction variable
532 DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND,
533 "iv-consider-all-candidates-bound",
534 "Bound on number of candidates below that all candidates are considered in iv optimizations",
537 /* The induction variable optimizations give up on loops that contain more
538 induction variable uses. */
540 DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES,
541 "iv-max-considered-uses",
542 "Bound on number of iv uses in loop optimized in iv optimizations",
545 /* If there are at most this number of ivs in the set, try removing unnecessary
546 ivs from the set always. */
548 DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND,
549 "iv-always-prune-cand-set-bound",
550 "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization",
553 DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE,
554 "scev-max-expr-size",
555 "Bound on size of expressions used in the scalar evolutions analyzer",
558 DEFPARAM(PARAM_SCEV_MAX_EXPR_COMPLEXITY,
559 "scev-max-expr-complexity",
560 "Bound on the complexity of the expressions in the scalar evolutions analyzer",
563 DEFPARAM(PARAM_OMEGA_MAX_VARS,
565 "Bound on the number of variables in Omega constraint systems",
568 DEFPARAM(PARAM_OMEGA_MAX_GEQS,
570 "Bound on the number of inequalities in Omega constraint systems",
573 DEFPARAM(PARAM_OMEGA_MAX_EQS,
575 "Bound on the number of equalities in Omega constraint systems",
578 DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS,
579 "omega-max-wild-cards",
580 "Bound on the number of wild cards in Omega constraint systems",
583 DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE,
584 "omega-hash-table-size",
585 "Bound on the size of the hash table in Omega constraint systems",
588 DEFPARAM(PARAM_OMEGA_MAX_KEYS,
590 "Bound on the number of keys in Omega constraint systems",
593 DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS,
594 "omega-eliminate-redundant-constraints",
595 "When set to 1, use expensive methods to eliminate all redundant constraints",
598 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS,
599 "vect-max-version-for-alignment-checks",
600 "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check
",
603 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS,
604 "vect
-max
-version
-for
-alias
-checks
",
605 "Bound on number of runtime checks inserted by the vectorizer
's loop versioning for alias check",
608 DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS,
609 "max-cselib-memory-locations",
610 "The maximum memory locations recorded by cselib",
613 #ifdef ENABLE_GC_ALWAYS_COLLECT
614 # define GGC_MIN_EXPAND_DEFAULT 0
615 # define GGC_MIN_HEAPSIZE_DEFAULT 0
617 # define GGC_MIN_EXPAND_DEFAULT 30
618 # define GGC_MIN_HEAPSIZE_DEFAULT 4096
621 DEFPARAM(GGC_MIN_EXPAND,
623 "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap",
624 GGC_MIN_EXPAND_DEFAULT, 0, 0)
626 DEFPARAM(GGC_MIN_HEAPSIZE,
628 "Minimum heap size before we start collecting garbage, in kilobytes",
629 GGC_MIN_HEAPSIZE_DEFAULT, 0, 0)
631 #undef GGC_MIN_EXPAND_DEFAULT
632 #undef GGC_MIN_HEAPSIZE_DEFAULT
634 DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS,
635 "max-reload-search-insns",
636 "The maximum number of instructions to search backward when looking for equivalent reload",
639 DEFPARAM(PARAM_SINK_FREQUENCY_THRESHOLD,
640 "sink-frequency-threshold",
641 "Target block's relative execution
frequency (as a percentage
) required to sink a statement
",
644 DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS,
645 "max
-sched
-region
-blocks
",
646 "The maximum number of blocks in a region to be considered for interblock scheduling
",
649 DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS,
650 "max
-sched
-region
-insns
",
651 "The maximum number of insns in a region to be considered for interblock scheduling
",
654 DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS,
655 "max
-pipeline
-region
-blocks
",
656 "The maximum number of blocks in a region to be considered for interblock scheduling
",
659 DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS,
660 "max
-pipeline
-region
-insns
",
661 "The maximum number of insns in a region to be considered for interblock scheduling
",
664 DEFPARAM(PARAM_MIN_SPEC_PROB,
666 "The minimum probability of reaching a source block for interblock speculative scheduling
",
669 DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS,
670 "max
-sched
-extend
-regions
-iters
",
671 "The maximum number of iterations through CFG to extend regions
",
674 DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY,
675 "max
-sched
-insn
-conflict
-delay
",
676 "The maximum conflict delay for an insn to be considered for speculative motion
",
679 DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF,
680 "sched
-spec
-prob
-cutoff
",
681 "The minimal probability of speculation
success (in percents
), so that speculative insn will be scheduled.
",
684 DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD,
685 "selsched
-max
-lookahead
",
686 "The maximum size of the lookahead window of selective scheduling
",
689 DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
690 "selsched
-max
-sched
-times
",
691 "Maximum number of times that an insn could be scheduled
",
694 DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
695 "selsched
-insns
-to
-rename
",
696 "Maximum number of instructions in the ready list that are considered eligible for renaming
",
699 DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST,
700 "sched
-mem
-true
-dep
-cost
",
701 "Minimal distance between possibly conflicting store and load
",
704 DEFPARAM(PARAM_MAX_LAST_VALUE_RTL,
705 "max
-last
-value
-rtl
",
706 "The maximum number of RTL nodes that can be recorded as combiner
's last value",
709 /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for
710 {signed,unsigned} integral types. This determines N.
711 Experimentation shows 251 to be a good value that generates the
712 least amount of garbage for allocating the TREE_VEC storage. */
713 DEFPARAM (PARAM_INTEGER_SHARE_LIMIT,
714 "integer-share-limit",
715 "The upper bound for sharing integer constants",
718 /* Incremental SSA updates for virtual operands may be very slow if
719 there is a large number of mappings to process. In those cases, it
720 is faster to rewrite the virtual symbols from scratch as if they
721 had been recently introduced. This heuristic cannot be applied to
722 SSA mappings for real SSA names, only symbols kept in FUD chains.
724 PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual
725 mappings that should be registered to trigger the heuristic.
727 PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between
728 mappings and symbols. If the number of virtual mappings is
729 PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of
730 virtual symbols to be updated, then the updater switches to a full
731 update for those symbols. */
732 DEFPARAM (PARAM_MIN_VIRTUAL_MAPPINGS,
733 "min-virtual-mappings",
734 "Minimum number of virtual mappings to consider switching to full virtual renames",
737 DEFPARAM (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO,
738 "virtual-mappings-ratio",
739 "Ratio between virtual mappings and virtual symbols to do full virtual renames",
742 DEFPARAM (PARAM_SSP_BUFFER_SIZE,
744 "The lower bound for a buffer to be considered for stack smashing protection",
747 /* When we thread through a block we have to make copies of the
748 statements within the block. Clearly for large blocks the code
751 PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number
752 of statements and PHI nodes allowed in a block which is going to
753 be duplicated for thread jumping purposes.
755 Some simple analysis showed that more than 99% of the jump
756 threading opportunities are for blocks with less than 15
757 statements. So we can get the benefits of jump threading
758 without excessive code bloat for pathological cases with the
759 throttle set at 15 statements. */
760 DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS,
761 "max-jump-thread-duplication-stmts",
762 "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps",
765 /* This is the maximum number of fields a variable may have before the pointer analysis machinery
766 will stop trying to treat it in a field-sensitive manner.
767 There are programs out there with thousands of fields per structure, and handling them
768 field-sensitively is not worth the cost. */
769 DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
770 "max-fields-for-field-sensitive",
771 "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable",
774 DEFPARAM(PARAM_MAX_SCHED_READY_INSNS,
775 "max-sched-ready-insns",
776 "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass",
779 /* This is the maximum number of active local stores RTL DSE will consider. */
780 DEFPARAM (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES,
781 "max-dse-active-local-stores",
782 "Maximum number of active local stores in RTL dead store elimination",
785 /* Prefetching and cache-optimizations related parameters. Default values are
786 usually set by machine description. */
788 /* The number of insns executed before prefetch is completed. */
790 DEFPARAM (PARAM_PREFETCH_LATENCY,
792 "The number of insns executed before prefetch is completed",
795 /* The number of prefetches that can run at the same time. */
797 DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES,
798 "simultaneous-prefetches",
799 "The number of prefetches that can run at the same time",
802 /* The size of L1 cache in kB. */
804 DEFPARAM (PARAM_L1_CACHE_SIZE,
806 "The size of L1 cache",
809 /* The size of L1 cache line in bytes. */
811 DEFPARAM (PARAM_L1_CACHE_LINE_SIZE,
812 "l1-cache-line-size",
813 "The size of L1 cache line",
816 /* The size of L2 cache in kB. */
818 DEFPARAM (PARAM_L2_CACHE_SIZE,
820 "The size of L2 cache",
823 /* Whether we should use canonical types rather than deep "structural"
824 type checking. Setting this value to 1 (the default) improves
825 compilation performance in the C++ and Objective-C++ front end;
826 this value should only be set to zero to work around bugs in the
827 canonical type system by disabling it. */
829 DEFPARAM (PARAM_USE_CANONICAL_TYPES,
830 "use-canonical-types",
831 "Whether to use canonical types",
834 DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH,
835 "max-partial-antic-length",
836 "Maximum length of partial antic set when performing tree pre optimization",
839 /* The following is used as a stop-gap limit for cases where really huge
840 SCCs blow up memory and compile-time use too much. If we hit this limit,
841 SCCVN and such FRE and PRE will be not done at all for the current
844 DEFPARAM (PARAM_SCCVN_MAX_SCC_SIZE,
845 "sccvn-max-scc-size",
846 "Maximum size of a SCC before SCCVN stops processing a function",
849 DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM,
851 "Max loops number for regional RA",
854 DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE,
855 "ira-max-conflict-table-size",
856 "Max size of conflict table in MB",
859 DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS,
860 "ira-loop-reserved-regs",
861 "The number of registers in each class kept unused by loop invariant motion",
864 /* Switch initialization conversion will refuse to create arrays that are
865 bigger than this parameter times the number of switch branches. */
867 DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO,
868 "switch-conversion-max-branch-ratio",
869 "The maximum ratio between array size and switch branches for "
870 "a switch conversion to take place",
873 /* Size of tiles when doing loop blocking. */
875 DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE,
876 "loop-block-tile-size",
877 "size of tiles for loop blocking",
880 /* Maximal number of parameters that we allow in a SCoP. */
882 DEFPARAM (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS,
883 "graphite-max-nb-scop-params",
884 "maximum number of parameters in a SCoP",
887 /* Maximal number of basic blocks in the functions analyzed by Graphite. */
889 DEFPARAM (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION,
890 "graphite-max-bbs-per-function",
891 "maximum number of basic blocks per function to be analyzed by Graphite",
894 /* Avoid data dependence analysis on very large loops. */
895 DEFPARAM (PARAM_LOOP_MAX_DATAREFS_FOR_DATADEPS,
896 "loop-max-datarefs-for-datadeps",
897 "Maximum number of datarefs in loop for building loop data dependencies",
900 /* Avoid doing loop invariant motion on very large loops. */
902 DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP,
903 "loop-invariant-max-bbs-in-loop",
904 "Max basic blocks number in loop for loop invariant motion",
907 /* Promote indirect call to conditional direct call only
908 when the percentage of the target count over the total
909 indirect call count is no smaller than the threshold. */
910 /* For multi-targ indirect_call. */
911 DEFPARAM (PARAM_ICALL_PROMOTE_PERCENT_THRESHOLD,
912 "icall-promote-target-percent-threshold",
913 "percentage threshold for direct call promotion"
914 " of a callee target",
917 DEFPARAM (PARAM_ICALL_PROMOTE_COUNT_THRESHOLD,
918 "icall-promote-target_count-threshold",
919 "call count threshold for direct call promotion"
920 " of a callee target",
923 /* For single-targ indirect_call. */
924 DEFPARAM (PARAM_SINGLE_ICALL_PROMOTE_PERCENT_THRESHOLD,
925 "single_icall-promote-target-percent-threshold",
926 "percentage threshold for direct call promotion"
927 " of a callee target",
930 DEFPARAM (PARAM_SINGLE_ICALL_PROMOTE_COUNT_THRESHOLD,
931 "single_icall-promote-target_count-threshold",
932 "call count threshold for direct call promotion"
933 " of a callee target",
936 /* 0: do not always inline icall target:
937 other value: always inline icall target when call count
940 DEFPARAM (PARAM_ALWAYS_INLINE_ICALL_TARGET,
941 "always-inline-icall-target",
942 "force inline indirect call target when promoted",
945 /* Force the compiler to be in LIPO mode even there is no
946 profile data available. -fripa is also needed. */
947 DEFPARAM (PARAM_FORCE_LIPO_MODE,
949 "force LIPO compilation mode",
952 /* Limit max module group size in LIPO mode. When the value
953 is set to 0 (which is the default), there is no limit. */
954 DEFPARAM (PARAM_MAX_LIPO_GROUP,
956 "maximum module group size.",
959 /* In LIPO mode, stop processing any further auxiliary modules
960 if current memory consumption exceeds this limit (in kb). */
961 DEFPARAM (PARAM_MAX_LIPO_MEMORY,
963 "don't import aux files if memory consumption exceeds this value
",
966 /* In LIPO profile-gen, use this parameter to record the cutoff value used at
967 profile collection runtime. */
968 DEFPARAM (PARAM_LIPO_CUTOFF,
970 "The cutoff value of cumulative profile count. The value is between
"
971 "0-99.
100 is reserved as a special value indicating default cutoff
"
972 "which is set at runtime. When the parameter is used and if its value
"
973 "is not
100, it overrides the dafault as well as the value set by the
"
974 " enviornment variable
",
977 /* In LIPO profile-gen, use this parameter to limit IPA inline. */
978 DEFPARAM (PARAM_LIPO_GEN_LIMIT_IPA_INLINE,
979 "lipo
-gen
-limit
-ipa
-inline
",
980 "In LIPO profile gen compilation
, the inline of a function that
"
981 "has hot indirect call can result in imprecise dynamic call graph due
"
982 "to phrase ordering issues. This parameter is used to disable
"
983 "the inline of function that has a indirect call
, only in LIPO
-gen
"
984 "compilation. Default is
0. If the value is
1, limit is on
",
987 /* In LIPO profile-gen, use this parameter to limit IPA inline. */
988 DEFPARAM (PARAM_LIPO_SKIP_SPECIAL_SECTIONS,
989 "lipo
-skip
-special
-sections
",
990 "In LIPO profile gen compilation
, do not generate direct call
"
991 "profiling to functions marked with
__attribute__((section(...
))"
992 "Those functions can not be inlined so there is no point tracking
"
996 /* In LIPO profile-gen, use this parameter to set random group generation
998 DEFPARAM (PARAM_LIPO_RANDOM_SEED,
1000 "random seed value used in random group testing
",
1003 /* In LIPO profile-gen, use this parmaeter to set random group max size at profile
1004 collection runtime. */
1005 DEFPARAM (PARAM_LIPO_RANDOM_GROUP_SIZE,
1006 "lipo
-random
-group
-size
",
1007 "In LIPO random group testing
, this parameter is used to set max group
"
1008 " size. The default value is
0 which is treated specially and specifies
"
1009 " no random grouping.
",
1012 /* In LIPO profile-gen, use this parameter to specify the scale factor to propagate
1013 callee module groups to caller. */
1014 DEFPARAM (PARAM_LIPO_PROPAGATE_SCALE,
1015 "lipo
-propagate
-scale
",
1016 "The scale factor to propagate callee module group
's weight to the caller.",
1019 /* In LIPO profile-use, use this parameter to enable the dumping of module id
1020 in inline message. */
1021 DEFPARAM (PARAM_INLINE_DUMP_MODULE_ID,
1022 "inline-dump-module-id",
1023 "Default is 0. If the value is 1, dumping is enabled.",
1026 /* Choose different module grouping algorithms. This only affects
1027 LIPO profile-gen. */
1028 DEFPARAM (PARAM_LIPO_GROUPING_ALGORITHM,
1029 "lipo-grouping-algorithm",
1030 "Algorithm 0 uses the eager propagation algorithm."
1031 "Algorithm 1 uses the inclusion_based priority algorithm."
1032 "The default algorithm is 1.",
1035 /* In the inclusion_based_priority grouping algorithm, specify if we combine the
1036 the edges b/w modules. */
1037 DEFPARAM (PARAM_LIPO_MERGE_MODU_EDGES,
1038 "lipo-merge-modu-edges",
1039 "Default is 0 which not merge."
1040 "If the value is 1, merge the edges.",
1043 /* In the inclusion_based_priority grouping algorithm, specify if we force
1044 strict inclusion of modules. */
1045 DEFPARAM (PARAM_LIPO_WEAK_INCLUSION,
1046 "lipo-weak-inclusion",
1047 "0: force strict inclusion; 1: weak inclusion."
1051 /* In LIPO profile-gen, use this parameter to enable cgraph dumping. */
1052 DEFPARAM (PARAM_LIPO_DUMP_CGRAPH,
1054 "Default is 0. If the value is 1, text dump is used. If the value "
1055 "is 2, .dot dump is enabled. ",
1058 DEFPARAM (PARAM_PROFILE_GENERATE_SAMPLING_PERIOD,
1059 "profile-generate-sampling-period",
1060 "sampling rate with -fprofile-generate-sampling",
1063 DEFPARAM (PARAM_COVERAGE_CALLBACK,
1064 "coverage-callback",
1065 "callback a user-define function when for arc counter increments.",
1068 DEFPARAM (PARAM_COVERAGE_EXEC_ONCE,
1069 "coverage-exec_once",
1070 "Stop incrementing arc counts once they become 1.",
1073 /* Used for debugging purpose. Tell the compiler to find
1074 the gcda file in the current directory. */
1075 DEFPARAM (PARAM_GCOV_DEBUG,
1077 "Looking for gcda file in current dir.",
1080 DEFPARAM (PARAM_REUSEDIST_MEAN_DIST_LARGE_THRESH,
1081 "reusedist-mean-dist-large-thresh",
1082 "Generate NTA stringops only if reusedist at least this size",
1085 DEFPARAM (PARAM_REUSEDIST_MEAN_DIST_SMALL_THRESH,
1086 "reusedist-mean-dist-small-thresh",
1087 "Force temporal stringops if reusedist at most this size",
1090 DEFPARAM (PARAM_REUSEDIST_CALL_COUNT_THRESH,
1091 "reusedist-call-count-thresh",
1092 "Generate NTA stringops only if call count at least this large",
1095 DEFPARAM (PARAM_REUSEDIST_MEMCPY_SIZE_THRESH,
1096 "reusedist-memcpy-size-thresh",
1097 "Generate memcpy-nta only if size at least this large",
1100 DEFPARAM (PARAM_REUSEDIST_MEMSET_SIZE_THRESH,
1101 "reusedist-memset-size-thresh",
1102 "Generate NTA memset only if size at least this large",
1105 /* Avoid SLP vectorization of large basic blocks. */
1106 DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB,
1107 "slp-max-insns-in-bb",
1108 "Maximum number of instructions in basic block to be considered for SLP vectorization",
1111 DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO,
1112 "min-insn-to-prefetch-ratio",
1113 "Min. ratio of insns to prefetches to enable prefetching for "
1114 "a loop with an unknown trip count",
1117 DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO,
1118 "prefetch-min-insn-to-mem-ratio",
1119 "Min. ratio of insns to mem ops to enable prefetching in a loop",
1122 /* Set maximum hash table size for var tracking. */
1124 DEFPARAM (PARAM_MAX_VARTRACK_SIZE,
1125 "max-vartrack-size",
1126 "Max. size of var tracking hash tables",
1129 /* Set maximum recursion depth for var tracking expression expansion
1132 DEFPARAM (PARAM_MAX_VARTRACK_EXPR_DEPTH,
1133 "max-vartrack-expr-depth",
1134 "Max. recursion depth for expanding var tracking expressions",
1137 /* Set minimum insn uid for non-debug insns. */
1139 DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID,
1140 "min-nondebug-insn-uid",
1141 "The minimum UID to be used for a nondebug insn",
1144 DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR,
1145 "ipa-sra-ptr-growth-factor",
1146 "Maximum allowed growth of size of new parameters ipa-sra replaces "
1147 "a pointer to an aggregate with",
1150 DEFPARAM (PARAM_TM_MAX_AGGREGATE_SIZE,
1151 "tm-max-aggregate-size",
1152 "Size in bytes after which thread-local aggregates should be "
1153 "instrumented with the logging functions instead of save/restore "
1157 DEFPARAM (PARAM_IPA_CP_VALUE_LIST_SIZE,
1158 "ipa-cp-value-list-size",
1159 "Maximum size of a list of values associated with each parameter for "
1160 "interprocedural constant propagation",
1163 DEFPARAM (PARAM_IPA_CP_EVAL_THRESHOLD,
1164 "ipa-cp-eval-threshold",
1165 "Threshold ipa-cp opportunity evaluation that is still considered "
1166 "beneficial to clone.",
1169 /* WHOPR partitioning configuration. */
1171 DEFPARAM (PARAM_LTO_PARTITIONS,
1173 "Number of partitions the program should be split to",
1176 DEFPARAM (MIN_PARTITION_SIZE,
1177 "lto-min-partition",
1178 "Minimal size of a partition for LTO (in estimated instructions)",
1181 DEFPARAM (PARAM_MIN_MCF_CANCEL_ITERS,
1182 "min-mcf-cancel-iters",
1183 "the minimum number of iterations of negative cycle cancellation "
1187 /* Diagnostic parameters. */
1189 DEFPARAM (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP,
1190 "cxx-max-namespaces-for-diagnostic-help",
1191 "Maximum number of namespaces to search for alternatives when "
1192 "name lookup fails",
1195 DEFPARAM (PARAM_NUMBER_OF_MVERSN_CLONES,
1196 "num-mversn-clones",
1197 "maximum number of functions to be cloned while doing "
1201 DEFPARAM (PARAM_MVERSN_CLONE_CGRAPH_DEPTH,
1202 "mversn-clone-depth",
1203 "maximum length of the call graph path to be cloned "
1204 "while doing multiversioning",
1207 /* Only output those call graph edges in .gnu.callgraph.text sections
1208 whose count is greater than this value. */
1209 DEFPARAM (PARAM_GNU_CGRAPH_SECTION_EDGE_THRESHOLD,
1210 "gnu-cgraph-section-edge-threshold",
1211 "minimum call graph edge count for inclusion in "
1212 ".gnu.callgraph.text section",
1215 DEFPARAM (PARAM_PMU_PROFILE_N_ADDRESS,
1216 "pmu_profile_n_addresses",
1217 "While doing PMU profiling symbolize this many top addresses.",
1220 /* Maximum number of conditional store pairs that can be sunk. */
1221 DEFPARAM (PARAM_MAX_STORES_TO_SINK,
1222 "max-stores-to-sink",
1223 "Maximum number of conditional store pairs that can be sunk",
1226 /* Override CASE_VALUES_THRESHOLD of when to switch from doing switch
1227 statements via if statements to using a table jump operation. If the value
1228 is 0, the default CASE_VALUES_THRESHOLD will be used. */
1229 DEFPARAM (PARAM_CASE_VALUES_THRESHOLD,
1230 "case-values-threshold",
1231 "The smallest number of different values for which it is best to "
1232 "use a jump-table instead of a tree of conditional branches, "
1233 "if 0, use the default for the machine",
1236 /* Data race flags for C++0x memory model compliance. */
1237 DEFPARAM (PARAM_ALLOW_LOAD_DATA_RACES,
1238 "allow-load-data-races",
1239 "Allow new data races on loads to be introduced",
1242 DEFPARAM (PARAM_ALLOW_STORE_DATA_RACES,
1243 "allow-store-data-races",
1244 "Allow new data races on stores to be introduced",
1247 DEFPARAM (PARAM_ALLOW_PACKED_LOAD_DATA_RACES,
1248 "allow-packed-load-data-races",
1249 "Allow new data races on packed data loads to be introduced",
1252 DEFPARAM (PARAM_ALLOW_PACKED_STORE_DATA_RACES,
1253 "allow-packed-store-data-races",
1254 "Allow new data races on packed data stores to be introduced",
1257 /* Reassociation width to be used by tree reassoc optimization. */
1258 DEFPARAM (PARAM_TREE_REASSOC_WIDTH,
1259 "tree-reassoc-width",
1260 "Set the maximum number of instructions executed in parallel in "
1261 "reassociated tree. If 0, use the target dependent heuristic.",
1264 DEFPARAM (PARAM_MAX_TAIL_MERGE_COMPARISONS,
1265 "max-tail-merge-comparisons",
1266 "Maximum amount of similar bbs to compare a bb with",
1269 DEFPARAM (PARAM_MAX_TAIL_MERGE_ITERATIONS,
1270 "max-tail-merge-iterations",
1271 "Maximum amount of iterations of the pass over a function",
1274 /* Maximum number of strings for which strlen optimization pass will
1275 track string lenths. */
1276 DEFPARAM (PARAM_MAX_TRACKED_STRLENS,
1277 "max-tracked-strlens",
1278 "Maximum number of strings for which strlen optimization pass will "
1279 "track string lengths",
1282 /* Parameters to be used with -mpatch-functions-for-instrumentation.
1283 See config/i386/i386.opt */
1284 DEFPARAM (PARAM_FUNCTION_PATCH_MIN_INSTRUCTIONS,
1285 "function-patch-min-instructions",
1286 "Minimum number of instructions in the function without loop before "
1287 "the function is qualified for patching for instrumentation (for use "
1288 "with -mpatch-functions-for-instrumentation)",