gcc/params.def

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