gcc/params.def

   1 /* params.def - Run-time parameters.
   2    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
   3    Free Software Foundation, Inc.
   4    Written by Mark Mitchell <mark@codesourcery.com>.
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify it under
   9 the terms of the GNU General Public License as published by the Free
  10 Software Foundation; either version 3, or (at your option) any later
  11 version.
  12
  13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  15 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  16 for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22 /* This file contains definitions for language-independent
  23    parameters.  The DEFPARAM macro takes 6 arguments:
  24
  25      - The enumeral corresponding to this parameter.
  26
  27      - The name that can be used to set this parameter using the
  28        command-line option `--param <name>=<value>'.
  29
  30      - A help string explaining how the parameter is used.
  31
  32      - A default value for the parameter.
  33
  34      - The minimum acceptable value for the parameter.
  35
  36      - The maximum acceptable value for the parameter (if greater than
  37      the minimum).
  38
  39    Be sure to add an entry to invoke.texi summarizing the parameter.  */
  40
  41 /* The threshold ratio between current and hottest structure counts.
  42    We say that if the ratio of the current structure count,
  43    calculated by profiling, to the hottest structure count
  44    in the program is less than this parameter, then structure
  45    reorganization is not applied. The default is 10%.  */
  46 DEFPARAM (PARAM_STRUCT_REORG_COLD_STRUCT_RATIO,
  47           "struct-reorg-cold-struct-ratio",
  48           "The threshold ratio between current and hottest structure counts",
  49           10, 0, 100)
  50
  51 /* When branch is predicted to be taken with probability lower than this
  52    threshold (in percent), then it is considered well predictable. */
  53 DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME,
  54           "predictable-branch-outcome",
  55           "Maximal esitmated outcome of branch considered predictable",
  56           2, 0, 50)
  57
  58 /* The single function inlining limit. This is the maximum size
  59    of a function counted in internal gcc instructions (not in
  60    real machine instructions) that is eligible for inlining
  61    by the tree inliner.
  62    The default value is 450.
  63    Only functions marked inline (or methods defined in the class
  64    definition for C++) are affected by this.
  65    There are more restrictions to inlining: If inlined functions
  66    call other functions, the already inlined instructions are
  67    counted and once the recursive inline limit (see
  68    "max-inline-insns" parameter) is exceeded, the acceptable size
  69    gets decreased.  */
  70 DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE,
  71           "max-inline-insns-single",
  72           "The maximum number of instructions in a single function eligible for inlining",
  73           400, 0, 0)
  74
  75 /* The single function inlining limit for functions that are
  76    inlined by virtue of -finline-functions (-O3).
  77    This limit should be chosen to be below or equal to the limit
  78    that is applied to functions marked inlined (or defined in the
  79    class declaration in C++) given by the "max-inline-insns-single"
  80    parameter.
  81    The default value is 90.  */
  82 DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO,
  83           "max-inline-insns-auto",
  84           "The maximum number of instructions when automatically inlining",
  85           50, 0, 0)
  86
  87 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE,
  88           "max-inline-insns-recursive",
  89           "The maximum number of instructions inline function can grow to via recursive inlining",
  90           450, 0, 0)
  91
  92 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO,
  93           "max-inline-insns-recursive-auto",
  94           "The maximum number of instructions non-inline function can grow to via recursive inlining",
  95           450, 0, 0)
  96
  97 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH,
  98           "max-inline-recursive-depth",
  99           "The maximum depth of recursive inlining for inline functions",
 100           8, 0, 0)
 101
 102 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO,
 103           "max-inline-recursive-depth-auto",
 104           "The maximum depth of recursive inlining for non-inline functions",
 105           8, 0, 0)
 106
 107 DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY,
 108           "min-inline-recursive-probability",
 109           "Inline recursively only when the probability of call being executed exceeds the parameter",
 110           10, 0, 0)
 111
 112 /* Limit of iterations of early inliner.  This basically bounds number of
 113    nested indirect calls early inliner can resolve.  Deeper chains are still
 114    handled by late inlining.  */
 115 DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS,
 116           "max-early-inliner-iterations",
 117           "The maximum number of nested indirect inlining performed by early inliner",
 118           10, 0, 0)
 119
 120 /* Limit the number of expansions created by the variable expansion
 121    optimization to avoid register pressure.  */
 122 DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS,
 123           "max-variable-expansions-in-unroller",
 124           "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling",
 125           1, 0, 0)
 126
 127 /* Limit loop autovectorization to loops with large enough iteration count.  */
 128 DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND,
 129           "min-vect-loop-bound",
 130           "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization",
 131           1, 1, 0)
 132
 133 /* The maximum number of instructions to consider when looking for an
 134    instruction to fill a delay slot.  If more than this arbitrary
 135    number of instructions is searched, the time savings from filling
 136    the delay slot will be minimal so stop searching.  Increasing
 137    values mean more aggressive optimization, making the compile time
 138    increase with probably small improvement in executable run time.  */
 139 DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH,
 140           "max-delay-slot-insn-search",
 141           "The maximum number of instructions to consider to fill a delay slot",
 142           100, 0, 0)
 143
 144 /* When trying to fill delay slots, the maximum number of instructions
 145    to consider when searching for a block with valid live register
 146    information.  Increasing this arbitrarily chosen value means more
 147    aggressive optimization, increasing the compile time.  This
 148    parameter should be removed when the delay slot code is rewritten
 149    to maintain the control-flow graph.  */
 150 DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
 151          "max-delay-slot-live-search",
 152          "The maximum number of instructions to consider to find accurate live register information",
 153          333, 0, 0)
 154
 155 /* This parameter limits the number of branch elements that the
 156    scheduler will track anti-dependencies through without resetting
 157    the tracking mechanism.  Large functions with few calls or barriers
 158    can generate lists containing many 1000's of dependencies.  Generally
 159    the compiler either uses all available memory, or runs for far too long.  */
 160 DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
 161          "max-pending-list-length",
 162          "The maximum length of scheduling's pending operations list",
 163          32, 0, 0)
 164
 165 DEFPARAM(PARAM_LARGE_FUNCTION_INSNS,
 166          "large-function-insns",
 167          "The size of function body to be considered large",
 168          2700, 0, 0)
 169 DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH,
 170          "large-function-growth",
 171          "Maximal growth due to inlining of large function (in percent)",
 172          100, 0, 0)
 173 DEFPARAM(PARAM_LARGE_UNIT_INSNS,
 174          "large-unit-insns",
 175          "The size of translation unit to be considered large",
 176          10000, 0, 0)
 177 DEFPARAM(PARAM_INLINE_UNIT_GROWTH,
 178          "inline-unit-growth",
 179          "How much can given compilation unit grow because of the inlining (in percent)",
 180          30, 0, 0)
 181 DEFPARAM(PARAM_IPCP_UNIT_GROWTH,
 182          "ipcp-unit-growth",
 183          "How much can given compilation unit grow because of the interprocedural constant propagation (in percent)",
 184          10, 0, 0)
 185 DEFPARAM(PARAM_EARLY_INLINING_INSNS,
 186          "early-inlining-insns",
 187          "Maximal estimated growth of function body caused by early inlining of single call",
 188          8, 0, 0)
 189 DEFPARAM(PARAM_LARGE_STACK_FRAME,
 190          "large-stack-frame",
 191          "The size of stack frame to be considered large",
 192          256, 0, 0)
 193 DEFPARAM(PARAM_STACK_FRAME_GROWTH,
 194          "large-stack-frame-growth",
 195          "Maximal stack frame growth due to inlining (in percent)",
 196          1000, 0, 0)
 197
 198 /* The GCSE optimization will be disabled if it would require
 199    significantly more memory than this value.  */
 200 DEFPARAM(PARAM_MAX_GCSE_MEMORY,
 201          "max-gcse-memory",
 202          "The maximum amount of memory to be allocated by GCSE",
 203          50 * 1024 * 1024, 0, 0)
 204
 205 /* This is the threshold ratio when to perform partial redundancy
 206    elimination after reload. We perform partial redundancy elimination
 207    when the following holds:
 208    (Redundant load execution count)
 209    ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION
 210    (Added loads execution count)                                          */
 211 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION,
 212         "gcse-after-reload-partial-fraction",
 213         "The threshold ratio for performing partial redundancy elimination after reload",
 214         3, 0, 0)
 215 /* This is the threshold ratio of the critical edges execution count compared to
 216    the redundant loads execution count that permits performing the load
 217    redundancy elimination in gcse after reload.  */
 218 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
 219         "gcse-after-reload-critical-fraction",
 220         "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload",
 221         10, 0, 0)
 222 /* This parameter limits the number of insns in a loop that will be unrolled,
 223    and by how much the loop is unrolled.
 224
 225    This limit should be at most half of the peeling limits:  loop unroller
 226    decides to not unroll loops that iterate fewer than 2*number of allowed
 227    unrollings and thus we would have loops that are neither peeled or unrolled
 228    otherwise.  */
 229 DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
 230          "max-unrolled-insns",
 231          "The maximum number of instructions to consider to unroll in a loop",
 232          200, 0, 0)
 233 /* This parameter limits how many times the loop is unrolled depending
 234    on number of insns really executed in each iteration.  */
 235 DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS,
 236          "max-average-unrolled-insns",
 237          "The maximum number of instructions to consider to unroll in a loop on average",
 238          80, 0, 0)
 239 /* The maximum number of unrollings of a single loop.  */
 240 DEFPARAM(PARAM_MAX_UNROLL_TIMES,
 241         "max-unroll-times",
 242         "The maximum number of unrollings of a single loop",
 243         8, 0, 0)
 244 /* The maximum number of insns of a peeled loop.  */
 245 DEFPARAM(PARAM_MAX_PEELED_INSNS,
 246         "max-peeled-insns",
 247         "The maximum number of insns of a peeled loop",
 248         400, 0, 0)
 249 /* The maximum number of peelings of a single loop.  */
 250 DEFPARAM(PARAM_MAX_PEEL_TIMES,
 251         "max-peel-times",
 252         "The maximum number of peelings of a single loop",
 253         16, 0, 0)
 254 /* The maximum number of insns of a peeled loop.  */
 255 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS,
 256         "max-completely-peeled-insns",
 257         "The maximum number of insns of a completely peeled loop",
 258         400, 0, 0)
 259 /* The maximum number of peelings of a single loop that is peeled completely.  */
 260 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES,
 261         "max-completely-peel-times",
 262         "The maximum number of peelings of a single loop that is peeled completely",
 263         16, 0, 0)
 264 /* The maximum number of insns of a peeled loop that rolls only once.  */
 265 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS,
 266         "max-once-peeled-insns",
 267         "The maximum number of insns of a peeled loop that rolls only once",
 268         400, 0, 0)
 269
 270 /* The maximum number of insns of an unswitched loop.  */
 271 DEFPARAM(PARAM_MAX_UNSWITCH_INSNS,
 272         "max-unswitch-insns",
 273         "The maximum number of insns of an unswitched loop",
 274         50, 0, 0)
 275 /* The maximum level of recursion in unswitch_single_loop.  */
 276 DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
 277         "max-unswitch-level",
 278         "The maximum number of unswitchings in a single loop",
 279         3, 0, 0)
 280
 281 /* The maximum number of iterations of a loop the brute force algorithm
 282    for analysis of # of iterations of the loop tries to evaluate.  */
 283 DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
 284         "max-iterations-to-track",
 285         "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
 286         1000, 0, 0)
 287 /* A cutoff to avoid costly computations of the number of iterations in
 288    the doloop transformation.  */
 289 DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST,
 290         "max-iterations-computation-cost",
 291         "Bound on the cost of an expression to compute the number of iterations",
 292         10, 0, 0)
 293
 294 /* This parameter is used to tune SMS MAX II calculations.  */
 295 DEFPARAM(PARAM_SMS_MAX_II_FACTOR,
 296          "sms-max-ii-factor",
 297          "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop",
 298          100, 0, 0)
 299 DEFPARAM(PARAM_SMS_DFA_HISTORY,
 300          "sms-dfa-history",
 301          "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA",
 302          0, 0, 0)
 303 DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD,
 304          "sms-loop-average-count-threshold",
 305          "A threshold on the average loop count considered by the swing modulo scheduler",
 306          0, 0, 0)
 307
 308 DEFPARAM(HOT_BB_COUNT_FRACTION,
 309          "hot-bb-count-fraction",
 310          "Select fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hot",
 311          10000, 0, 0)
 312 DEFPARAM(HOT_BB_FREQUENCY_FRACTION,
 313          "hot-bb-frequency-fraction",
 314          "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot",
 315          1000, 0, 0)
 316
 317 DEFPARAM (PARAM_ALIGN_THRESHOLD,
 318           "align-threshold",
 319           "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment",
 320           100, 0, 0)
 321
 322 DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS,
 323           "align-loop-iterations",
 324           "Loops iterating at least selected number of iterations will get loop alignement.",
 325           4, 0, 0)
 326
 327 /* For guessed profiles, the loops having unknown number of iterations
 328    are predicted to iterate relatively few (10) times at average.
 329    For functions containing one loop with large known number of iterations
 330    and other loops having unbounded loops we would end up predicting all
 331    the other loops cold that is not usually the case.  So we need to artificially
 332    flatten the profile.
 333
 334    We need to cut the maximal predicted iterations to large enough iterations
 335    so the loop appears important, but safely within HOT_BB_COUNT_FRACTION
 336    range.  */
 337
 338 DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS,
 339          "max-predicted-iterations",
 340          "The maximum number of loop iterations we predict statically",
 341          100, 0, 0)
 342 DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK,
 343          "tracer-dynamic-coverage-feedback",
 344          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available",
 345          95, 0, 100)
 346 DEFPARAM(TRACER_DYNAMIC_COVERAGE,
 347          "tracer-dynamic-coverage",
 348          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available",
 349          75, 0, 100)
 350 DEFPARAM(TRACER_MAX_CODE_GROWTH,
 351          "tracer-max-code-growth",
 352          "Maximal code growth caused by tail duplication (in percent)",
 353          100, 0, 0)
 354 DEFPARAM(TRACER_MIN_BRANCH_RATIO,
 355          "tracer-min-branch-ratio",
 356          "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)",
 357          10, 0, 100)
 358 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK,
 359          "tracer-min-branch-probability-feedback",
 360          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available",
 361          80, 0, 100)
 362 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY,
 363          "tracer-min-branch-probability",
 364          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available",
 365          50, 0, 100)
 366
 367 /* The maximum number of incoming edges to consider for crossjumping.  */
 368 DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES,
 369          "max-crossjump-edges",
 370          "The maximum number of incoming edges to consider for crossjumping",
 371          100, 0, 0)
 372
 373 /* The minimum number of matching instructions to consider for crossjumping.  */
 374 DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS,
 375      "min-crossjump-insns",
 376      "The minimum number of matching instructions to consider for crossjumping",
 377      5, 0, 0)
 378
 379 /* The maximum number expansion factor when copying basic blocks.  */
 380 DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS,
 381      "max-grow-copy-bb-insns",
 382      "The maximum expansion factor when copying basic blocks",
 383      8, 0, 0)
 384
 385 /* The maximum number of insns to duplicate when unfactoring computed gotos.  */
 386 DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS,
 387      "max-goto-duplication-insns",
 388      "The maximum number of insns to duplicate when unfactoring computed gotos",
 389      8, 0, 0)
 390
 391 /* The maximum length of path considered in cse.  */
 392 DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH,
 393          "max-cse-path-length",
 394          "The maximum length of path considered in cse",
 395          10, 0, 0)
 396 DEFPARAM(PARAM_MAX_CSE_INSNS,
 397          "max-cse-insns",
 398          "The maximum instructions CSE process before flushing",
 399          1000, 0, 0)
 400
 401 /* The cost of expression in loop invariant motion that is considered
 402    expensive.  */
 403 DEFPARAM(PARAM_LIM_EXPENSIVE,
 404          "lim-expensive",
 405          "The minimum cost of an expensive expression in the loop invariant motion",
 406          20, 0, 0)
 407
 408 /* Bound on number of candidates for induction variables below that
 409    all candidates are considered for each use in induction variable
 410    optimizations.  */
 411
 412 DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND,
 413          "iv-consider-all-candidates-bound",
 414          "Bound on number of candidates below that all candidates are considered in iv optimizations",
 415          30, 0, 0)
 416
 417 /* The induction variable optimizations give up on loops that contain more
 418    induction variable uses.  */
 419
 420 DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES,
 421          "iv-max-considered-uses",
 422          "Bound on number of iv uses in loop optimized in iv optimizations",
 423          250, 0, 0)
 424
 425 /* If there are at most this number of ivs in the set, try removing unnecessary
 426    ivs from the set always.  */
 427
 428 DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND,
 429          "iv-always-prune-cand-set-bound",
 430          "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization",
 431          10, 0, 0)
 432
 433 DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE,
 434          "scev-max-expr-size",
 435          "Bound on size of expressions used in the scalar evolutions analyzer",
 436          20, 0, 0)
 437
 438 DEFPARAM(PARAM_OMEGA_MAX_VARS,
 439          "omega-max-vars",
 440          "Bound on the number of variables in Omega constraint systems",
 441          128, 0, 0)
 442
 443 DEFPARAM(PARAM_OMEGA_MAX_GEQS,
 444          "omega-max-geqs",
 445          "Bound on the number of inequalities in Omega constraint systems",
 446          256, 0, 0)
 447
 448 DEFPARAM(PARAM_OMEGA_MAX_EQS,
 449          "omega-max-eqs",
 450          "Bound on the number of equalities in Omega constraint systems",
 451          128, 0, 0)
 452
 453 DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS,
 454          "omega-max-wild-cards",
 455          "Bound on the number of wild cards in Omega constraint systems",
 456          18, 0, 0)
 457
 458 DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE,
 459          "omega-hash-table-size",
 460          "Bound on the size of the hash table in Omega constraint systems",
 461          550, 0, 0)
 462
 463 DEFPARAM(PARAM_OMEGA_MAX_KEYS,
 464          "omega-max-keys",
 465          "Bound on the number of keys in Omega constraint systems",
 466          500, 0, 0)
 467
 468 DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS,
 469          "omega-eliminate-redundant-constraints",
 470          "When set to 1, use expensive methods to eliminate all redundant constraints",
 471          0, 0, 1)
 472
 473 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS,
 474          "vect-max-version-for-alignment-checks",
 475          "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check",
 476          6, 0, 0)
 477
 478 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS,
 479          "vect-max-version-for-alias-checks",
 480          "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check",
 481          10, 0, 0)
 482
 483 DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS,
 484          "max-cselib-memory-locations",
 485          "The maximum memory locations recorded by cselib",
 486          500, 0, 0)
 487
 488 #ifdef ENABLE_GC_ALWAYS_COLLECT
 489 # define GGC_MIN_EXPAND_DEFAULT 0
 490 # define GGC_MIN_HEAPSIZE_DEFAULT 0
 491 #else
 492 # define GGC_MIN_EXPAND_DEFAULT 30
 493 # define GGC_MIN_HEAPSIZE_DEFAULT 4096
 494 #endif
 495
 496 DEFPARAM(GGC_MIN_EXPAND,
 497          "ggc-min-expand",
 498          "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap",
 499          GGC_MIN_EXPAND_DEFAULT, 0, 0)
 500
 501 DEFPARAM(GGC_MIN_HEAPSIZE,
 502          "ggc-min-heapsize",
 503          "Minimum heap size before we start collecting garbage, in kilobytes",
 504          GGC_MIN_HEAPSIZE_DEFAULT, 0, 0)
 505
 506 #undef GGC_MIN_EXPAND_DEFAULT
 507 #undef GGC_MIN_HEAPSIZE_DEFAULT
 508
 509 DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS,
 510          "max-reload-search-insns",
 511          "The maximum number of instructions to search backward when looking for equivalent reload",
 512          100, 0, 0)
 513
 514 DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS,
 515          "max-sched-region-blocks",
 516          "The maximum number of blocks in a region to be considered for interblock scheduling",
 517          10, 0, 0)
 518
 519 DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS,
 520          "max-sched-region-insns",
 521          "The maximum number of insns in a region to be considered for interblock scheduling",
 522          100, 0, 0)
 523
 524 DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS,
 525          "max-pipeline-region-blocks",
 526          "The maximum number of blocks in a region to be considered for interblock scheduling",
 527          15, 0, 0)
 528
 529 DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS,
 530          "max-pipeline-region-insns",
 531          "The maximum number of insns in a region to be considered for interblock scheduling",
 532          200, 0, 0)
 533
 534 DEFPARAM(PARAM_MIN_SPEC_PROB,
 535          "min-spec-prob",
 536          "The minimum probability of reaching a source block for interblock speculative scheduling",
 537          40, 0, 0)
 538
 539 DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS,
 540          "max-sched-extend-regions-iters",
 541          "The maximum number of iterations through CFG to extend regions",
 542          0, 0, 0)
 543
 544 DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY,
 545          "max-sched-insn-conflict-delay",
 546          "The maximum conflict delay for an insn to be considered for speculative motion",
 547          3, 1, 10)
 548
 549 DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF,
 550          "sched-spec-prob-cutoff",
 551          "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.",
 552          40, 0, 100)
 553
 554 DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD,
 555          "selsched-max-lookahead",
 556          "The maximum size of the lookahead window of selective scheduling",
 557          50, 0, 0)
 558
 559 DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
 560          "selsched-max-sched-times",
 561          "Maximum number of times that an insn could be scheduled",
 562          2, 0, 0)
 563
 564 DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
 565          "selsched-insns-to-rename",
 566          "Maximum number of instructions in the ready list that are considered eligible for renaming",
 567          2, 0, 0)
 568
 569 DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST,
 570           "sched-mem-true-dep-cost",
 571           "Minimal distance between possibly conflicting store and load",
 572           1, 0, 0)
 573
 574 DEFPARAM(PARAM_MAX_LAST_VALUE_RTL,
 575          "max-last-value-rtl",
 576          "The maximum number of RTL nodes that can be recorded as combiner's last value",
 577          10000, 0, 0)
 578
 579 /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for
 580    {signed,unsigned} integral types.  This determines N.
 581    Experimentation shows 256 to be a good value.  */
 582 DEFPARAM (PARAM_INTEGER_SHARE_LIMIT,
 583           "integer-share-limit",
 584           "The upper bound for sharing integer constants",
 585           256, 2, 2)
 586
 587 /* Incremental SSA updates for virtual operands may be very slow if
 588    there is a large number of mappings to process.  In those cases, it
 589    is faster to rewrite the virtual symbols from scratch as if they
 590    had been recently introduced.  This heuristic cannot be applied to
 591    SSA mappings for real SSA names, only symbols kept in FUD chains.
 592
 593    PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual
 594    mappings that should be registered to trigger the heuristic.
 595
 596    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between
 597    mappings and symbols.  If the number of virtual mappings is
 598    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of
 599    virtual symbols to be updated, then the updater switches to a full
 600    update for those symbols.  */
 601 DEFPARAM (PARAM_MIN_VIRTUAL_MAPPINGS,
 602           "min-virtual-mappings",
 603           "Minimum number of virtual mappings to consider switching to full virtual renames",
 604           100, 0, 0)
 605
 606 DEFPARAM (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO,
 607           "virtual-mappings-ratio",
 608           "Ratio between virtual mappings and virtual symbols to do full virtual renames",
 609           3, 0, 0)
 610
 611 DEFPARAM (PARAM_SSP_BUFFER_SIZE,
 612           "ssp-buffer-size",
 613           "The lower bound for a buffer to be considered for stack smashing protection",
 614           8, 1, 0)
 615
 616 /* When we thread through a block we have to make copies of the
 617    statements within the block.  Clearly for large blocks the code
 618    duplication is bad.
 619
 620    PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number
 621    of statements and PHI nodes allowed in a block which is going to
 622    be duplicated for thread jumping purposes.
 623
 624    Some simple analysis showed that more than 99% of the jump
 625    threading opportunities are for blocks with less than 15
 626    statements.  So we can get the benefits of jump threading
 627    without excessive code bloat for pathological cases with the
 628    throttle set at 15 statements.  */
 629 DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS,
 630           "max-jump-thread-duplication-stmts",
 631           "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps",
 632           15, 0, 0)
 633
 634 /* This is the maximum number of fields a variable may have before the pointer analysis machinery
 635    will stop trying to treat it in a field-sensitive manner.
 636    There are programs out there with thousands of fields per structure, and handling them
 637    field-sensitively is not worth the cost.  */
 638 DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
 639           "max-fields-for-field-sensitive",
 640           "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable",
 641           0, 0, 0)
 642
 643 DEFPARAM(PARAM_MAX_SCHED_READY_INSNS,
 644          "max-sched-ready-insns",
 645          "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass",
 646          100, 0, 0)
 647
 648 /* Prefetching and cache-optimizations related parameters.  Default values are
 649    usually set by machine description.  */
 650
 651 /* The number of insns executed before prefetch is completed.  */
 652
 653 DEFPARAM (PARAM_PREFETCH_LATENCY,
 654          "prefetch-latency",
 655          "The number of insns executed before prefetch is completed",
 656          200, 0, 0)
 657
 658 /* The number of prefetches that can run at the same time.  */
 659
 660 DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES,
 661           "simultaneous-prefetches",
 662           "The number of prefetches that can run at the same time",
 663           3, 0, 0)
 664
 665 /* The size of L1 cache in kB.  */
 666
 667 DEFPARAM (PARAM_L1_CACHE_SIZE,
 668           "l1-cache-size",
 669           "The size of L1 cache",
 670           64, 0, 0)
 671
 672 /* The size of L1 cache line in bytes.  */
 673
 674 DEFPARAM (PARAM_L1_CACHE_LINE_SIZE,
 675           "l1-cache-line-size",
 676           "The size of L1 cache line",
 677           32, 0, 0)
 678
 679 /* The size of L2 cache in kB.  */
 680
 681 DEFPARAM (PARAM_L2_CACHE_SIZE,
 682           "l2-cache-size",
 683           "The size of L2 cache",
 684           512, 0, 0)
 685
 686 /* Whether we should use canonical types rather than deep "structural"
 687    type checking.  Setting this value to 1 (the default) improves
 688    compilation performance in the C++ and Objective-C++ front end;
 689    this value should only be set to zero to work around bugs in the
 690    canonical type system by disabling it.  */
 691
 692 DEFPARAM (PARAM_USE_CANONICAL_TYPES,
 693           "use-canonical-types",
 694           "Whether to use canonical types",
 695           1, 0, 1)
 696
 697 DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH,
 698           "max-partial-antic-length",
 699           "Maximum length of partial antic set when performing tree pre optimization",
 700           100, 0, 0)
 701
 702 /* The following is used as a stop-gap limit for cases where really huge
 703    SCCs blow up memory and compile-time use too much.  If we hit this limit,
 704    SCCVN and such FRE and PRE will be not done at all for the current
 705    function.  */
 706
 707 DEFPARAM (PARAM_SCCVN_MAX_SCC_SIZE,
 708           "sccvn-max-scc-size",
 709           "Maximum size of a SCC before SCCVN stops processing a function",
 710           10000, 10, 0)
 711
 712 DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM,
 713           "ira-max-loops-num",
 714           "Max loops number for regional RA",
 715           100, 0, 0)
 716
 717 DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE,
 718           "ira-max-conflict-table-size",
 719           "Max size of conflict table in MB",
 720           1000, 0, 0)
 721
 722 DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS,
 723           "ira-loop-reserved-regs",
 724           "The number of registers in each class kept unused by loop invariant motion",
 725           2, 0, 0)
 726
 727 /* Switch initialization conversion will refuse to create arrays that are
 728    bigger than this parameter times the number of switch branches.  */
 729
 730 DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO,
 731           "switch-conversion-max-branch-ratio",
 732           "The maximum ratio between array size and switch branches for "
 733           "a switch conversion to take place",
 734           8, 1, 0)
 735
 736 /* Size of tiles when doing loop blocking.  */
 737
 738 DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE,
 739           "loop-block-tile-size",
 740           "size of tiles for loop blocking",
 741           51, 0, 0)
 742
 743 /* Avoid doing loop invariant motion on very large loops.  */
 744
 745 DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP,
 746           "loop-invariant-max-bbs-in-loop",
 747           "Max basic blocks number in loop for loop invariant motion",
 748           10000, 0, 0)
 749
 750 /* Avoid SLP vectorization of large basic blocks.  */
 751 DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB,
 752           "slp-max-insns-in-bb",
 753           "Maximum number of instructions in basic block to be considered for SLP vectorization",
 754           1000, 0, 0)
 755
 756 DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO,
 757           "min-insn-to-prefetch-ratio",
 758           "Min. ratio of insns to prefetches to enable prefetching for "
 759           "a loop with an unknown trip count",
 760           10, 0, 0)
 761
 762 DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO,
 763           "prefetch-min-insn-to-mem-ratio",
 764           "Min. ratio of insns to mem ops to enable prefetching in a loop",
 765           3, 0, 0)
 766
 767 /* Set minimum insn uid for non-debug insns.  */
 768
 769 DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID,
 770           "min-nondebug-insn-uid",
 771           "The minimum UID to be used for a nondebug insn",
 772           0, 1, 0)
 773
 774 DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR,
 775           "ipa-sra-ptr-growth-factor",
 776           "Maximum allowed growth of size of new parameters ipa-sra replaces "
 777           "a pointer to an aggregate with",
 778           2, 0, 0)
 779
 780 /*
 781 Local variables:
 782 mode:c
 783 End:
 784 */