gcc-4_6/gcc/params.def

   1 /* params.def - Run-time parameters.
   2    Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
   3    2011
   4    Free Software Foundation, Inc.
   5    Written by Mark Mitchell <mark@codesourcery.com>.
   6
   7 This file is part of GCC.
   8
   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
  12 version.
  13
  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
  17 for more details.
  18
  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/>.  */
  22
  23 /* This file contains definitions for language-independent
  24    parameters.  The DEFPARAM macro takes 6 arguments:
  25
  26      - The enumeral corresponding to this parameter.
  27
  28      - The name that can be used to set this parameter using the
  29        command-line option `--param <name>=<value>'.
  30
  31      - A help string explaining how the parameter is used.
  32
  33      - A default value for the parameter.
  34
  35      - The minimum acceptable value for the parameter.
  36
  37      - The maximum acceptable value for the parameter (if greater than
  38      the minimum).
  39
  40    Be sure to add an entry to invoke.texi summarizing the parameter.  */
  41
  42 /* The threshold ratio between current and hottest structure counts.
  43    We say that if the ratio of the current structure count,
  44    calculated by profiling, to the hottest structure count
  45    in the program is less than this parameter, then structure
  46    reorganization is not applied. The default is 10%.  */
  47 DEFPARAM (PARAM_STRUCT_REORG_COLD_STRUCT_RATIO,
  48           "struct-reorg-cold-struct-ratio",
  49           "The threshold ratio between current and hottest structure counts",
  50           10, 0, 100)
  51
  52 /* When branch is predicted to be taken with probability lower than this
  53    threshold (in percent), then it is considered well predictable. */
  54 DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME,
  55           "predictable-branch-outcome",
  56           "Maximal estimated outcome of branch considered predictable",
  57           2, 0, 50)
  58
  59 /* The single function inlining limit. This is the maximum size
  60    of a function counted in internal gcc instructions (not in
  61    real machine instructions) that is eligible for inlining
  62    by the tree inliner.
  63    The default value is 450.
  64    Only functions marked inline (or methods defined in the class
  65    definition for C++) are affected by this.
  66    There are more restrictions to inlining: If inlined functions
  67    call other functions, the already inlined instructions are
  68    counted and once the recursive inline limit (see
  69    "max-inline-insns" parameter) is exceeded, the acceptable size
  70    gets decreased.  */
  71 DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE,
  72           "max-inline-insns-single",
  73           "The maximum number of instructions in a single function eligible for inlining",
  74           400, 0, 0)
  75
  76 /* The single function inlining limit for functions that are
  77    inlined by virtue of -finline-functions (-O3).
  78    This limit should be chosen to be below or equal to the limit
  79    that is applied to functions marked inlined (or defined in the
  80    class declaration in C++) given by the "max-inline-insns-single"
  81    parameter.
  82    The default value is 40.  */
  83 DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO,
  84           "max-inline-insns-auto",
  85           "The maximum number of instructions when automatically inlining",
  86           40, 0, 0)
  87
  88 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE,
  89           "max-inline-insns-recursive",
  90           "The maximum number of instructions inline function can grow to via recursive inlining",
  91           450, 0, 0)
  92
  93 DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE_AUTO,
  94           "max-inline-insns-recursive-auto",
  95           "The maximum number of instructions non-inline function can grow to via recursive inlining",
  96           450, 0, 0)
  97
  98 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH,
  99           "max-inline-recursive-depth",
 100           "The maximum depth of recursive inlining for inline functions",
 101           8, 0, 0)
 102
 103 DEFPARAM (PARAM_MAX_INLINE_RECURSIVE_DEPTH_AUTO,
 104           "max-inline-recursive-depth-auto",
 105           "The maximum depth of recursive inlining for non-inline functions",
 106           8, 0, 0)
 107
 108 DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY,
 109           "min-inline-recursive-probability",
 110           "Inline recursively only when the probability of call being executed exceeds the parameter",
 111           10, 0, 0)
 112
 113 DEFPARAM (PARAM_INLINE_FUNCTION_OVERHEAD_SIZE,
 114           "inline-function-overhead-size",
 115           "Size estimate of function overhead (prologue/epilogue) for inlining purposes",
 116           7, 0, 0)
 117
 118 /* Limit of iterations of early inliner.  This basically bounds number of
 119    nested indirect calls early inliner can resolve.  Deeper chains are still
 120    handled by late inlining.  */
 121 DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS,
 122           "max-early-inliner-iterations",
 123           "The maximum number of nested indirect inlining performed by early inliner",
 124           10, 0, 0)
 125
 126 /* Limit on probability of entry BB.  */
 127 DEFPARAM (PARAM_COMDAT_SHARING_PROBABILITY,
 128           "comdat-sharing-probability",
 129           "Probability that COMDAT function will be shared with different compilatoin unit",
 130           20, 0, 0)
 131
 132 /* Limit on probability of entry BB.  */
 133 DEFPARAM (PARAM_PARTIAL_INLINING_ENTRY_PROBABILITY,
 134           "partial-inlining-entry-probability",
 135           "Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen",
 136           70, 0, 0)
 137
 138 /* Limit the number of expansions created by the variable expansion
 139    optimization to avoid register pressure.  */
 140 DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS,
 141           "max-variable-expansions-in-unroller",
 142           "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling",
 143           1, 0, 0)
 144
 145 /* Limit loop autovectorization to loops with large enough iteration count.  */
 146 DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND,
 147           "min-vect-loop-bound",
 148           "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization",
 149           1, 1, 0)
 150
 151 /* The maximum number of instructions to consider when looking for an
 152    instruction to fill a delay slot.  If more than this arbitrary
 153    number of instructions is searched, the time savings from filling
 154    the delay slot will be minimal so stop searching.  Increasing
 155    values mean more aggressive optimization, making the compile time
 156    increase with probably small improvement in executable run time.  */
 157 DEFPARAM (PARAM_MAX_DELAY_SLOT_INSN_SEARCH,
 158           "max-delay-slot-insn-search",
 159           "The maximum number of instructions to consider to fill a delay slot",
 160           100, 0, 0)
 161
 162 /* When trying to fill delay slots, the maximum number of instructions
 163    to consider when searching for a block with valid live register
 164    information.  Increasing this arbitrarily chosen value means more
 165    aggressive optimization, increasing the compile time.  This
 166    parameter should be removed when the delay slot code is rewritten
 167    to maintain the control-flow graph.  */
 168 DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH,
 169          "max-delay-slot-live-search",
 170          "The maximum number of instructions to consider to find accurate live register information",
 171          333, 0, 0)
 172
 173 /* This parameter limits the number of branch elements that the
 174    scheduler will track anti-dependencies through without resetting
 175    the tracking mechanism.  Large functions with few calls or barriers
 176    can generate lists containing many 1000's of dependencies.  Generally
 177    the compiler either uses all available memory, or runs for far too long.  */
 178 DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH,
 179          "max-pending-list-length",
 180          "The maximum length of scheduling's pending operations list",
 181          32, 0, 0)
 182
 183 DEFPARAM(PARAM_LARGE_FUNCTION_INSNS,
 184          "large-function-insns",
 185          "The size of function body to be considered large",
 186          2700, 0, 0)
 187 DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH,
 188          "large-function-growth",
 189          "Maximal growth due to inlining of large function (in percent)",
 190          100, 0, 0)
 191 DEFPARAM(PARAM_LARGE_UNIT_INSNS,
 192          "large-unit-insns",
 193          "The size of translation unit to be considered large",
 194          10000, 0, 0)
 195 DEFPARAM(PARAM_INLINE_UNIT_GROWTH,
 196          "inline-unit-growth",
 197          "How much can given compilation unit grow because of the inlining (in percent)",
 198          30, 0, 0)
 199 DEFPARAM(PARAM_IPCP_UNIT_GROWTH,
 200          "ipcp-unit-growth",
 201          "How much can given compilation unit grow because of the interprocedural constant propagation (in percent)",
 202          10, 0, 0)
 203 DEFPARAM(PARAM_EARLY_INLINING_INSNS,
 204          "early-inlining-insns",
 205          "Maximal estimated growth of function body caused by early inlining of single call",
 206          10, 0, 0)
 207 DEFPARAM(PARAM_LARGE_STACK_FRAME,
 208          "large-stack-frame",
 209          "The size of stack frame to be considered large",
 210          256, 0, 0)
 211 DEFPARAM(PARAM_STACK_FRAME_GROWTH,
 212          "large-stack-frame-growth",
 213          "Maximal stack frame growth due to inlining (in percent)",
 214          1000, 0, 0)
 215
 216 /* The GCSE optimization will be disabled if it would require
 217    significantly more memory than this value.  */
 218 DEFPARAM(PARAM_MAX_GCSE_MEMORY,
 219          "max-gcse-memory",
 220          "The maximum amount of memory to be allocated by GCSE",
 221          50 * 1024 * 1024, 0, 0)
 222
 223 /* The GCSE optimization of an expression will avoided if the ratio of
 224    insertions to deletions is greater than this value.  */
 225 DEFPARAM(PARAM_MAX_GCSE_INSERTION_RATIO,
 226          "max-gcse-insertion-ratio",
 227          "The maximum ratio of insertions to deletions of expressions in GCSE",
 228          20, 0, 0)
 229
 230 /* This is the threshold ratio when to perform partial redundancy
 231    elimination after reload. We perform partial redundancy elimination
 232    when the following holds:
 233    (Redundant load execution count)
 234    ------------------------------- >= GCSE_AFTER_RELOAD_PARTIAL_FRACTION
 235    (Added loads execution count)                                          */
 236 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_PARTIAL_FRACTION,
 237         "gcse-after-reload-partial-fraction",
 238         "The threshold ratio for performing partial redundancy elimination after reload",
 239         3, 0, 0)
 240 /* This is the threshold ratio of the critical edges execution count compared to
 241    the redundant loads execution count that permits performing the load
 242    redundancy elimination in gcse after reload.  */
 243 DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION,
 244         "gcse-after-reload-critical-fraction",
 245         "The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload",
 246         10, 0, 0)
 247
 248 /* GCSE will use GCSE_COST_DISTANCE_RATION as a scaling factor
 249    to calculate maximum distance for which an expression is allowed to move
 250    from its rtx_cost.  */
 251 DEFPARAM(PARAM_GCSE_COST_DISTANCE_RATIO,
 252          "gcse-cost-distance-ratio",
 253          "Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations",
 254          10, 0, 0)
 255 /* GCSE won't restrict distance for which an expression with rtx_cost greater
 256    than COSTS_N_INSN(GCSE_UNRESTRICTED_COST) is allowed to move.  */
 257 DEFPARAM(PARAM_GCSE_UNRESTRICTED_COST,
 258          "gcse-unrestricted-cost",
 259          "Cost at which GCSE optimizations will not constraint the distance an expression can travel",
 260          3, 0, 0)
 261
 262 /* How deep from a given basic block the dominator tree should be searched
 263    for expressions to hoist to the block.  The value of 0 will avoid limiting
 264    the search.  */
 265 DEFPARAM(PARAM_MAX_HOIST_DEPTH,
 266          "max-hoist-depth",
 267          "Maximum depth of search in the dominator tree for expressions to hoist",
 268          30, 0, 0)
 269
 270 /* This parameter limits the number of insns in a loop that will be unrolled,
 271    and by how much the loop is unrolled.
 272
 273    This limit should be at most half of the peeling limits:  loop unroller
 274    decides to not unroll loops that iterate fewer than 2*number of allowed
 275    unrollings and thus we would have loops that are neither peeled or unrolled
 276    otherwise.  */
 277 DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
 278          "max-unrolled-insns",
 279          "The maximum number of instructions to consider to unroll in a loop",
 280          200, 0, 0)
 281 /* This parameter limits how many times the loop is unrolled depending
 282    on number of insns really executed in each iteration.  */
 283 DEFPARAM(PARAM_MAX_AVERAGE_UNROLLED_INSNS,
 284          "max-average-unrolled-insns",
 285          "The maximum number of instructions to consider to unroll in a loop on average",
 286          80, 0, 0)
 287 /* The maximum number of unrollings of a single loop.  */
 288 DEFPARAM(PARAM_MAX_UNROLL_TIMES,
 289         "max-unroll-times",
 290         "The maximum number of unrollings of a single loop",
 291         8, 0, 0)
 292 /* The maximum number of insns of a peeled loop.  */
 293 DEFPARAM(PARAM_MAX_PEELED_INSNS,
 294         "max-peeled-insns",
 295         "The maximum number of insns of a peeled loop",
 296         400, 0, 0)
 297 /* The maximum number of peelings of a single loop.  */
 298 DEFPARAM(PARAM_MAX_PEEL_TIMES,
 299         "max-peel-times",
 300         "The maximum number of peelings of a single loop",
 301         16, 0, 0)
 302 /* The maximum number of insns of a peeled loop.  */
 303 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS,
 304         "max-completely-peeled-insns",
 305         "The maximum number of insns of a completely peeled loop",
 306         400, 0, 0)
 307 /* The maximum number of insns of a peeled loop, when feedback
 308    information is available.  */
 309 DEFPARAM(PARAM_MAX_COMPLETELY_PEELED_INSNS_FEEDBACK,
 310         "max-completely-peeled-insns-feedback",
 311         "The maximum number of insns of a completely peeled loop when profile "
 312          "feedback is available",
 313         600, 0, 0)
 314 /* The maximum number of peelings of a single loop that is peeled completely.  */
 315 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES,
 316         "max-completely-peel-times",
 317         "The maximum number of peelings of a single loop that is peeled completely",
 318         8, 0, 0)
 319 /* The maximum number of peelings of a single loop that is peeled
 320    completely, when feedback information is available.  */
 321 DEFPARAM(PARAM_MAX_COMPLETELY_PEEL_TIMES_FEEDBACK,
 322         "max-completely-peel-times-feedback",
 323         "The maximum number of peelings of a single loop that is peeled "
 324          "completely, when profile feedback is available",
 325         16, 0, 0)
 326 /* The maximum number of insns of a peeled loop that rolls only once.  */
 327 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS,
 328         "max-once-peeled-insns",
 329         "The maximum number of insns of a peeled loop that rolls only once",
 330         400, 0, 0)
 331 /* The maximum number of insns of a peeled loop that rolls only once,
 332    when feedback information is available.  */
 333 DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS_FEEDBACK,
 334         "max-once-peeled-insns-feedback",
 335         "The maximum number of insns of a peeled loop that rolls only once, "
 336          "when profile feedback is available",
 337          600, 0, 0)
 338 /* The maximum depth of a loop nest we completely peel.  */
 339 DEFPARAM(PARAM_MAX_UNROLL_ITERATIONS,
 340          "max-completely-peel-loop-nest-depth",
 341          "The maximum depth of a loop nest we completely peel",
 342          8, 0, 0)
 343 /* The maximum code size estimate under which loop unrolling and peeling
 344  * is allowed in a profile feedback compile. This currently applies to loops
 345  * with non-constant iteration counts and no floating point computations.  */
 346 DEFPARAM(PARAM_UNROLLPEEL_CODESIZE_THRESHOLD,
 347         "unrollpeel-codesize-threshold",
 348         "Maximum profile-based code size footprint estimate for loop unrolling "
 349         "and peeling",
 350         15000, 0, 0)
 351 /* The maximum ratio of total profiled execution counts to loop entry block
 352    count that must be exceeded to ignore most code size limits when unrolling
 353    and peeling.  */
 354 DEFPARAM(PARAM_UNROLLPEEL_HOTNESS_THRESHOLD,
 355         "unrollpeel-hotness-threshold",
 356         "Maximum ratio of total profiled execution count to loop entry "
 357         "block count under which most codesize limits for unrolling and "
 358         "peeling will be ignored",
 359         100, 1, 0)
 360
 361 DEFPARAM(PARAM_MIN_ITER_UNROLL_WITH_BRANCHES,
 362         "min-iter-unroll-with-branches",
 363         "Minimum iteration count to ignore branch effects when unrolling",
 364         50, 0, 0)
 365 DEFPARAM(PARAM_UNROLL_OUTER_LOOP_BRANCH_BUDGET,
 366         "unroll-outer-loop-branch-budget",
 367         "Maximum number of branches allowed in hot outer loop region after unroll",
 368         25, 0, 0)
 369
 370 /* The maximum number of insns of an unswitched loop.  */
 371 DEFPARAM(PARAM_MAX_UNSWITCH_INSNS,
 372         "max-unswitch-insns",
 373         "The maximum number of insns of an unswitched loop",
 374         50, 0, 0)
 375 /* The maximum level of recursion in unswitch_single_loop.  */
 376 DEFPARAM(PARAM_MAX_UNSWITCH_LEVEL,
 377         "max-unswitch-level",
 378         "The maximum number of unswitchings in a single loop",
 379         3, 0, 0)
 380
 381 /* The maximum number of iterations of a loop the brute force algorithm
 382    for analysis of # of iterations of the loop tries to evaluate.  */
 383 DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK,
 384         "max-iterations-to-track",
 385         "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates",
 386         1000, 0, 0)
 387 /* A cutoff to avoid costly computations of the number of iterations in
 388    the doloop transformation.  */
 389 DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST,
 390         "max-iterations-computation-cost",
 391         "Bound on the cost of an expression to compute the number of iterations",
 392         10, 0, 0)
 393
 394 /* This parameter is used to tune SMS MAX II calculations.  */
 395 DEFPARAM(PARAM_SMS_MAX_II_FACTOR,
 396          "sms-max-ii-factor",
 397          "A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop",
 398          100, 0, 0)
 399 DEFPARAM(PARAM_SMS_DFA_HISTORY,
 400          "sms-dfa-history",
 401          "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA",
 402          0, 0, 0)
 403 DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD,
 404          "sms-loop-average-count-threshold",
 405          "A threshold on the average loop count considered by the swing modulo scheduler",
 406          0, 0, 0)
 407
 408 DEFPARAM(HOT_BB_COUNT_FRACTION,
 409          "hot-bb-count-fraction",
 410          "Select fraction of the maximal count of repetitions of basic block in program given basic block needs to have to be considered hot",
 411          40000, 0, 0)
 412 DEFPARAM(HOT_BB_FREQUENCY_FRACTION,
 413          "hot-bb-frequency-fraction",
 414          "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot",
 415          1000, 0, 0)
 416
 417 DEFPARAM (PARAM_ALIGN_THRESHOLD,
 418           "align-threshold",
 419           "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment",
 420           100, 0, 0)
 421
 422 DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS,
 423           "align-loop-iterations",
 424           "Loops iterating at least selected number of iterations will get loop alignement.",
 425           4, 0, 0)
 426
 427 /* For guessed profiles, the loops having unknown number of iterations
 428    are predicted to iterate relatively few (10) times at average.
 429    For functions containing one loop with large known number of iterations
 430    and other loops having unbounded loops we would end up predicting all
 431    the other loops cold that is not usually the case.  So we need to artificially
 432    flatten the profile.
 433
 434    We need to cut the maximal predicted iterations to large enough iterations
 435    so the loop appears important, but safely within HOT_BB_COUNT_FRACTION
 436    range.  */
 437
 438 DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS,
 439          "max-predicted-iterations",
 440          "The maximum number of loop iterations we predict statically",
 441          100, 0, 0)
 442 DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK,
 443          "tracer-dynamic-coverage-feedback",
 444          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available",
 445          95, 0, 100)
 446 DEFPARAM(TRACER_DYNAMIC_COVERAGE,
 447          "tracer-dynamic-coverage",
 448          "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available",
 449          75, 0, 100)
 450 DEFPARAM(TRACER_MAX_CODE_GROWTH,
 451          "tracer-max-code-growth",
 452          "Maximal code growth caused by tail duplication (in percent)",
 453          100, 0, 0)
 454 DEFPARAM(TRACER_MIN_BRANCH_RATIO,
 455          "tracer-min-branch-ratio",
 456          "Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent)",
 457          10, 0, 100)
 458 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY_FEEDBACK,
 459          "tracer-min-branch-probability-feedback",
 460          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available",
 461          80, 0, 100)
 462 DEFPARAM(TRACER_MIN_BRANCH_PROBABILITY,
 463          "tracer-min-branch-probability",
 464          "Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available",
 465          50, 0, 100)
 466
 467 /* The maximum number of incoming edges to consider for crossjumping.  */
 468 DEFPARAM(PARAM_MAX_CROSSJUMP_EDGES,
 469          "max-crossjump-edges",
 470          "The maximum number of incoming edges to consider for crossjumping",
 471          100, 0, 0)
 472
 473 /* The minimum number of matching instructions to consider for crossjumping.  */
 474 DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS,
 475      "min-crossjump-insns",
 476      "The minimum number of matching instructions to consider for crossjumping",
 477      5, 0, 0)
 478
 479 /* The maximum number expansion factor when copying basic blocks.  */
 480 DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS,
 481      "max-grow-copy-bb-insns",
 482      "The maximum expansion factor when copying basic blocks",
 483      8, 0, 0)
 484
 485 /* The maximum number of insns to duplicate when unfactoring computed gotos.  */
 486 DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS,
 487      "max-goto-duplication-insns",
 488      "The maximum number of insns to duplicate when unfactoring computed gotos",
 489      8, 0, 0)
 490
 491 /* The maximum length of path considered in cse.  */
 492 DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH,
 493          "max-cse-path-length",
 494          "The maximum length of path considered in cse",
 495          10, 0, 0)
 496 DEFPARAM(PARAM_MAX_CSE_INSNS,
 497          "max-cse-insns",
 498          "The maximum instructions CSE process before flushing",
 499          1000, 0, 0)
 500
 501 /* The cost of expression in loop invariant motion that is considered
 502    expensive.  */
 503 DEFPARAM(PARAM_LIM_EXPENSIVE,
 504          "lim-expensive",
 505          "The minimum cost of an expensive expression in the loop invariant motion",
 506          20, 0, 0)
 507
 508 /* Bound on number of candidates for induction variables below that
 509    all candidates are considered for each use in induction variable
 510    optimizations.  */
 511
 512 DEFPARAM(PARAM_IV_CONSIDER_ALL_CANDIDATES_BOUND,
 513          "iv-consider-all-candidates-bound",
 514          "Bound on number of candidates below that all candidates are considered in iv optimizations",
 515          30, 0, 0)
 516
 517 /* The induction variable optimizations give up on loops that contain more
 518    induction variable uses.  */
 519
 520 DEFPARAM(PARAM_IV_MAX_CONSIDERED_USES,
 521          "iv-max-considered-uses",
 522          "Bound on number of iv uses in loop optimized in iv optimizations",
 523          250, 0, 0)
 524
 525 /* If there are at most this number of ivs in the set, try removing unnecessary
 526    ivs from the set always.  */
 527
 528 DEFPARAM(PARAM_IV_ALWAYS_PRUNE_CAND_SET_BOUND,
 529          "iv-always-prune-cand-set-bound",
 530          "If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization",
 531          10, 0, 0)
 532
 533 DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE,
 534          "scev-max-expr-size",
 535          "Bound on size of expressions used in the scalar evolutions analyzer",
 536          100, 0, 0)
 537
 538 DEFPARAM(PARAM_SCEV_MAX_EXPR_COMPLEXITY,
 539          "scev-max-expr-complexity",
 540          "Bound on the complexity of the expressions in the scalar evolutions analyzer",
 541          10, 0, 0)
 542
 543 DEFPARAM(PARAM_OMEGA_MAX_VARS,
 544          "omega-max-vars",
 545          "Bound on the number of variables in Omega constraint systems",
 546          128, 0, 0)
 547
 548 DEFPARAM(PARAM_OMEGA_MAX_GEQS,
 549          "omega-max-geqs",
 550          "Bound on the number of inequalities in Omega constraint systems",
 551          256, 0, 0)
 552
 553 DEFPARAM(PARAM_OMEGA_MAX_EQS,
 554          "omega-max-eqs",
 555          "Bound on the number of equalities in Omega constraint systems",
 556          128, 0, 0)
 557
 558 DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS,
 559          "omega-max-wild-cards",
 560          "Bound on the number of wild cards in Omega constraint systems",
 561          18, 0, 0)
 562
 563 DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE,
 564          "omega-hash-table-size",
 565          "Bound on the size of the hash table in Omega constraint systems",
 566          550, 0, 0)
 567
 568 DEFPARAM(PARAM_OMEGA_MAX_KEYS,
 569          "omega-max-keys",
 570          "Bound on the number of keys in Omega constraint systems",
 571          500, 0, 0)
 572
 573 DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS,
 574          "omega-eliminate-redundant-constraints",
 575          "When set to 1, use expensive methods to eliminate all redundant constraints",
 576          0, 0, 1)
 577
 578 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS,
 579          "vect-max-version-for-alignment-checks",
 580          "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check",
 581          6, 0, 0)
 582
 583 DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS,
 584          "vect-max-version-for-alias-checks",
 585          "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check",
 586          10, 0, 0)
 587
 588 DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS,
 589          "max-cselib-memory-locations",
 590          "The maximum memory locations recorded by cselib",
 591          500, 0, 0)
 592
 593 #ifdef ENABLE_GC_ALWAYS_COLLECT
 594 # define GGC_MIN_EXPAND_DEFAULT 0
 595 # define GGC_MIN_HEAPSIZE_DEFAULT 0
 596 #else
 597 # define GGC_MIN_EXPAND_DEFAULT 30
 598 # define GGC_MIN_HEAPSIZE_DEFAULT 4096
 599 #endif
 600
 601 DEFPARAM(GGC_MIN_EXPAND,
 602          "ggc-min-expand",
 603          "Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap",
 604          GGC_MIN_EXPAND_DEFAULT, 0, 0)
 605
 606 DEFPARAM(GGC_MIN_HEAPSIZE,
 607          "ggc-min-heapsize",
 608          "Minimum heap size before we start collecting garbage, in kilobytes",
 609          GGC_MIN_HEAPSIZE_DEFAULT, 0, 0)
 610
 611 #undef GGC_MIN_EXPAND_DEFAULT
 612 #undef GGC_MIN_HEAPSIZE_DEFAULT
 613
 614 DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS,
 615          "max-reload-search-insns",
 616          "The maximum number of instructions to search backward when looking for equivalent reload",
 617          100, 0, 0)
 618
 619 DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS,
 620          "max-sched-region-blocks",
 621          "The maximum number of blocks in a region to be considered for interblock scheduling",
 622          10, 0, 0)
 623
 624 DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS,
 625          "max-sched-region-insns",
 626          "The maximum number of insns in a region to be considered for interblock scheduling",
 627          100, 0, 0)
 628
 629 DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS,
 630          "max-pipeline-region-blocks",
 631          "The maximum number of blocks in a region to be considered for interblock scheduling",
 632          15, 0, 0)
 633
 634 DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS,
 635          "max-pipeline-region-insns",
 636          "The maximum number of insns in a region to be considered for interblock scheduling",
 637          200, 0, 0)
 638
 639 DEFPARAM(PARAM_MIN_SPEC_PROB,
 640          "min-spec-prob",
 641          "The minimum probability of reaching a source block for interblock speculative scheduling",
 642          40, 0, 0)
 643
 644 DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS,
 645          "max-sched-extend-regions-iters",
 646          "The maximum number of iterations through CFG to extend regions",
 647          0, 0, 0)
 648
 649 DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY,
 650          "max-sched-insn-conflict-delay",
 651          "The maximum conflict delay for an insn to be considered for speculative motion",
 652          3, 1, 10)
 653
 654 DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF,
 655          "sched-spec-prob-cutoff",
 656          "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.",
 657          40, 0, 100)
 658
 659 DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD,
 660          "selsched-max-lookahead",
 661          "The maximum size of the lookahead window of selective scheduling",
 662          50, 0, 0)
 663
 664 DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES,
 665          "selsched-max-sched-times",
 666          "Maximum number of times that an insn could be scheduled",
 667          2, 0, 0)
 668
 669 DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME,
 670          "selsched-insns-to-rename",
 671          "Maximum number of instructions in the ready list that are considered eligible for renaming",
 672          2, 0, 0)
 673
 674 DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST,
 675           "sched-mem-true-dep-cost",
 676           "Minimal distance between possibly conflicting store and load",
 677           1, 0, 0)
 678
 679 DEFPARAM(PARAM_MAX_LAST_VALUE_RTL,
 680          "max-last-value-rtl",
 681          "The maximum number of RTL nodes that can be recorded as combiner's last value",
 682          10000, 0, 0)
 683
 684 /* INTEGER_CST nodes are shared for values [{-1,0} .. N) for
 685    {signed,unsigned} integral types.  This determines N.
 686    Experimentation shows 256 to be a good value.  */
 687 DEFPARAM (PARAM_INTEGER_SHARE_LIMIT,
 688           "integer-share-limit",
 689           "The upper bound for sharing integer constants",
 690           256, 2, 2)
 691
 692 /* Incremental SSA updates for virtual operands may be very slow if
 693    there is a large number of mappings to process.  In those cases, it
 694    is faster to rewrite the virtual symbols from scratch as if they
 695    had been recently introduced.  This heuristic cannot be applied to
 696    SSA mappings for real SSA names, only symbols kept in FUD chains.
 697
 698    PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual
 699    mappings that should be registered to trigger the heuristic.
 700
 701    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between
 702    mappings and symbols.  If the number of virtual mappings is
 703    PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of
 704    virtual symbols to be updated, then the updater switches to a full
 705    update for those symbols.  */
 706 DEFPARAM (PARAM_MIN_VIRTUAL_MAPPINGS,
 707           "min-virtual-mappings",
 708           "Minimum number of virtual mappings to consider switching to full virtual renames",
 709           100, 0, 0)
 710
 711 DEFPARAM (PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO,
 712           "virtual-mappings-ratio",
 713           "Ratio between virtual mappings and virtual symbols to do full virtual renames",
 714           3, 0, 0)
 715
 716 DEFPARAM (PARAM_SSP_BUFFER_SIZE,
 717           "ssp-buffer-size",
 718           "The lower bound for a buffer to be considered for stack smashing protection",
 719           8, 1, 0)
 720
 721 /* When we thread through a block we have to make copies of the
 722    statements within the block.  Clearly for large blocks the code
 723    duplication is bad.
 724
 725    PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number
 726    of statements and PHI nodes allowed in a block which is going to
 727    be duplicated for thread jumping purposes.
 728
 729    Some simple analysis showed that more than 99% of the jump
 730    threading opportunities are for blocks with less than 15
 731    statements.  So we can get the benefits of jump threading
 732    without excessive code bloat for pathological cases with the
 733    throttle set at 15 statements.  */
 734 DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS,
 735           "max-jump-thread-duplication-stmts",
 736           "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps",
 737           15, 0, 0)
 738
 739 /* This is the maximum number of fields a variable may have before the pointer analysis machinery
 740    will stop trying to treat it in a field-sensitive manner.
 741    There are programs out there with thousands of fields per structure, and handling them
 742    field-sensitively is not worth the cost.  */
 743 DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE,
 744           "max-fields-for-field-sensitive",
 745           "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable",
 746           0, 0, 0)
 747
 748 DEFPARAM(PARAM_MAX_SCHED_READY_INSNS,
 749          "max-sched-ready-insns",
 750          "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass",
 751          100, 0, 0)
 752
 753 /* This is the maximum number of active local stores RTL DSE will consider.  */
 754 DEFPARAM (PARAM_MAX_DSE_ACTIVE_LOCAL_STORES,
 755           "max-dse-active-local-stores",
 756           "Maximum number of active local stores in RTL dead store elimination",
 757           5000, 0, 0)
 758
 759 /* Prefetching and cache-optimizations related parameters.  Default values are
 760    usually set by machine description.  */
 761
 762 /* The number of insns executed before prefetch is completed.  */
 763
 764 DEFPARAM (PARAM_PREFETCH_LATENCY,
 765          "prefetch-latency",
 766          "The number of insns executed before prefetch is completed",
 767          200, 0, 0)
 768
 769 /* The number of prefetches that can run at the same time.  */
 770
 771 DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES,
 772           "simultaneous-prefetches",
 773           "The number of prefetches that can run at the same time",
 774           3, 0, 0)
 775
 776 /* The size of L1 cache in kB.  */
 777
 778 DEFPARAM (PARAM_L1_CACHE_SIZE,
 779           "l1-cache-size",
 780           "The size of L1 cache",
 781           64, 0, 0)
 782
 783 /* The size of L1 cache line in bytes.  */
 784
 785 DEFPARAM (PARAM_L1_CACHE_LINE_SIZE,
 786           "l1-cache-line-size",
 787           "The size of L1 cache line",
 788           32, 0, 0)
 789
 790 /* The size of L2 cache in kB.  */
 791
 792 DEFPARAM (PARAM_L2_CACHE_SIZE,
 793           "l2-cache-size",
 794           "The size of L2 cache",
 795           512, 0, 0)
 796
 797 /* Whether we should use canonical types rather than deep "structural"
 798    type checking.  Setting this value to 1 (the default) improves
 799    compilation performance in the C++ and Objective-C++ front end;
 800    this value should only be set to zero to work around bugs in the
 801    canonical type system by disabling it.  */
 802
 803 DEFPARAM (PARAM_USE_CANONICAL_TYPES,
 804           "use-canonical-types",
 805           "Whether to use canonical types",
 806           1, 0, 1)
 807
 808 DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH,
 809           "max-partial-antic-length",
 810           "Maximum length of partial antic set when performing tree pre optimization",
 811           100, 0, 0)
 812
 813 /* The following is used as a stop-gap limit for cases where really huge
 814    SCCs blow up memory and compile-time use too much.  If we hit this limit,
 815    SCCVN and such FRE and PRE will be not done at all for the current
 816    function.  */
 817
 818 DEFPARAM (PARAM_SCCVN_MAX_SCC_SIZE,
 819           "sccvn-max-scc-size",
 820           "Maximum size of a SCC before SCCVN stops processing a function",
 821           10000, 10, 0)
 822
 823 DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM,
 824           "ira-max-loops-num",
 825           "Max loops number for regional RA",
 826           100, 0, 0)
 827
 828 DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE,
 829           "ira-max-conflict-table-size",
 830           "Max size of conflict table in MB",
 831           1000, 0, 0)
 832
 833 DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS,
 834           "ira-loop-reserved-regs",
 835           "The number of registers in each class kept unused by loop invariant motion",
 836           2, 0, 0)
 837
 838 /* Switch initialization conversion will refuse to create arrays that are
 839    bigger than this parameter times the number of switch branches.  */
 840
 841 DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO,
 842           "switch-conversion-max-branch-ratio",
 843           "The maximum ratio between array size and switch branches for "
 844           "a switch conversion to take place",
 845           8, 1, 0)
 846
 847 /* Size of tiles when doing loop blocking.  */
 848
 849 DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE,
 850           "loop-block-tile-size",
 851           "size of tiles for loop blocking",
 852           51, 0, 0)
 853
 854 /* Maximal number of parameters that we allow in a SCoP.  */
 855
 856 DEFPARAM (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS,
 857           "graphite-max-nb-scop-params",
 858           "maximum number of parameters in a SCoP",
 859           10, 0, 0)
 860
 861 /* Maximal number of basic blocks in the functions analyzed by Graphite.  */
 862
 863 DEFPARAM (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION,
 864           "graphite-max-bbs-per-function",
 865           "maximum number of basic blocks per function to be analyzed by Graphite",
 866           100, 0, 0)
 867
 868 /* Avoid doing loop invariant motion on very large loops.  */
 869
 870 DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP,
 871           "loop-invariant-max-bbs-in-loop",
 872           "Max basic blocks number in loop for loop invariant motion",
 873           10000, 0, 0)
 874
 875 /* Promote indirect call to conditional direct call only
 876    when the percentage of the target count over the total
 877    indirect call count is no smaller than the threshold.  */
 878 DEFPARAM (PARAM_ICALL_PROMOTE_PERCENT_THRESHOLD,
 879           "icall-promote-target-percent-threshold",
 880           "percentage threshold for direct call promotion"
 881           " of a callee target",
 882           33, 0, 100)
 883
 884 DEFPARAM (PARAM_ICALL_PROMOTE_COUNT_THRESHOLD,
 885           "icall-promote-target_count-threshold",
 886           "call count threshold for direct call promotion"
 887           " of a callee target",
 888           1, 0, 0)
 889
 890 /* 0: do not always inline icall target:
 891    other value: always inline icall target when call count
 892    exceeds this value.
 893 */
 894 DEFPARAM (PARAM_ALWAYS_INLINE_ICALL_TARGET,
 895           "always-inline-icall-target",
 896           "force inline indirect call target when promoted",
 897           0, 0, 0)
 898
 899 /* Force the compiler to be in LIPO mode even there is no
 900  profile data available. -fripa is also needed. */
 901 DEFPARAM (PARAM_FORCE_LIPO_MODE,
 902           "force-lipo",
 903           "force LIPO compilation mode",
 904           0, 0, 1)
 905
 906 /* Limit max module group size in LIPO mode.  When the value
 907  is set to 0 (which is the default), there is no limit.  */
 908 DEFPARAM (PARAM_MAX_LIPO_GROUP,
 909           "max-lipo-group",
 910           "maximum module group size.",
 911           0, 0, 10000)
 912
 913 /* In LIPO mode, stop processing any further auxiliary modules
 914    if current memory consumption exceeds this limit (in kb).  */
 915 DEFPARAM (PARAM_MAX_LIPO_MEMORY,
 916           "max-lipo-mem",
 917           "don't import aux files if memory consumption exceeds this value",
 918           2400000, 0, 0)
 919
 920 DEFPARAM (PARAM_PROFILE_GENERATE_SAMPLING_PERIOD,
 921          "profile-generate-sampling-period",
 922          "sampling rate with -fprofile-generate-sampling",
 923          100, 0, 2000000000)
 924
 925 /* Used for debugging purpose. Tell the compiler to find
 926    the gcda file in the current directory.  */
 927 DEFPARAM (PARAM_GCOV_DEBUG,
 928           "gcov-debug",
 929           "Looking for gcda file in current dir.",
 930           1, 0, 1)
 931
 932 DEFPARAM (PARAM_REUSEDIST_MEAN_DIST_LARGE_THRESH,
 933           "reusedist-mean-dist-large-thresh",
 934           "Generate NTA stringops only if reusedist at least this size",
 935           10000000, 0, 0)
 936
 937 DEFPARAM (PARAM_REUSEDIST_MEAN_DIST_SMALL_THRESH,
 938           "reusedist-mean-dist-small-thresh",
 939           "Force temporal stringops if reusedist at most this size",
 940           100000, 0, 0)
 941
 942 DEFPARAM (PARAM_REUSEDIST_CALL_COUNT_THRESH,
 943           "reusedist-call-count-thresh",
 944           "Generate NTA stringops only if call count at least this large",
 945           0, 0, 0)
 946
 947 DEFPARAM (PARAM_REUSEDIST_MEMCPY_SIZE_THRESH,
 948           "reusedist-memcpy-size-thresh",
 949           "Generate memcpy-nta only if size at least this large",
 950           4096, 0, 0)
 951
 952 DEFPARAM (PARAM_REUSEDIST_MEMSET_SIZE_THRESH,
 953           "reusedist-memset-size-thresh",
 954           "Generate NTA memset only if size at least this large",
 955           122880, 0, 0)
 956
 957 /* Avoid SLP vectorization of large basic blocks.  */
 958 DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB,
 959           "slp-max-insns-in-bb",
 960           "Maximum number of instructions in basic block to be considered for SLP vectorization",
 961           1000, 0, 0)
 962
 963 DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO,
 964           "min-insn-to-prefetch-ratio",
 965           "Min. ratio of insns to prefetches to enable prefetching for "
 966           "a loop with an unknown trip count",
 967           10, 0, 0)
 968
 969 DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO,
 970           "prefetch-min-insn-to-mem-ratio",
 971           "Min. ratio of insns to mem ops to enable prefetching in a loop",
 972           3, 0, 0)
 973
 974 /* Set maximum hash table size for var tracking.  */
 975
 976 DEFPARAM (PARAM_MAX_VARTRACK_SIZE,
 977           "max-vartrack-size",
 978           "Max. size of var tracking hash tables",
 979           50000000, 0, 0)
 980
 981 /* Set minimum insn uid for non-debug insns.  */
 982
 983 DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID,
 984           "min-nondebug-insn-uid",
 985           "The minimum UID to be used for a nondebug insn",
 986           0, 1, 0)
 987
 988 DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR,
 989           "ipa-sra-ptr-growth-factor",
 990           "Maximum allowed growth of size of new parameters ipa-sra replaces "
 991           "a pointer to an aggregate with",
 992           2, 0, 0)
 993
 994 DEFPARAM (PARAM_DEVIRT_TYPE_LIST_SIZE,
 995           "devirt-type-list-size",
 996           "Maximum size of a type list associated with each parameter for "
 997           "devirtualization",
 998           8, 0, 0)
 999
1000 /* WHOPR partitioning configuration.  */
1001
1002 DEFPARAM (PARAM_LTO_PARTITIONS,
1003           "lto-partitions",
1004           "Number of paritions program should be split to",
1005           32, 0, 0)
1006
1007 DEFPARAM (MIN_PARTITION_SIZE,
1008           "lto-min-partition",
1009           "Size of minimal paritition for WHOPR (in estimated instructions)",
1010           1000, 0, 0)
1011
1012 DEFPARAM (PARAM_MIN_MCF_CANCEL_ITERS,
1013           "min-mcf-cancel-iters",
1014           "the minimum number of iterations of negative cycle cancellation "
1015           "in MCF",
1016           10, 1, 0)
1017
1018 /* Diagnostic parameters.  */
1019
1020 DEFPARAM (CXX_MAX_NAMESPACES_FOR_DIAGNOSTIC_HELP,
1021           "cxx-max-namespaces-for-diagnostic-help",
1022           "Maximum number of namespaces to search for alternatives when "
1023           "name lookup fails",
1024           1000, 0, 0)
1025
1026 DEFPARAM (PARAM_NUMBER_OF_MVERSN_CLONES,
1027           "num-mversn-clones",
1028           "maximum number of functions to be cloned while doing "
1029           "multiversioning",
1030           10, 0, 1000)
1031
1032 DEFPARAM (PARAM_MVERSN_CLONE_CGRAPH_DEPTH,
1033           "mversn-clone-depth",
1034           "maximum length of the call graph path to be cloned "
1035           "while doing multiversioning",
1036           2, 0, 5)
1037
1038 /* Only output those call graph edges in .gnu.callgraph.text sections
1039    whose count is greater than this value. */
1040 DEFPARAM (PARAM_NOTE_CGRAPH_SECTION_EDGE_THRESHOLD,
1041           "note-cgraph-section-edge-threshold",
1042           "minimum call graph edge count for inclusion in "
1043           ".gnu.callgraph.text section",
1044           0, 0, 0)
1045
1046 DEFPARAM (PARAM_PMU_PROFILE_N_ADDRESS,
1047           "pmu_profile_n_addresses",
1048           "While doing PMU profiling symbolize this many top addresses.",
1049           50, 1, 10000)
1050
1051 DEFPARAM (PARAM_MAX_FUNCTION_SIZE_FOR_AUTO_CLONING,
1052           "autoclone-function-size-limit",
1053           "Do not auto clone functions beyond this size.",
1054           5000, 0, 100000)
1055
1056 /* Parameters to be used with -mpatch-functions-for-instrumentation.
1057    See config/i386/i386.opt  */
1058 DEFPARAM (PARAM_FUNCTION_PATCH_MIN_INSTRUCTIONS,
1059           "function-patch-min-instructions",
1060           "Minimum number of instructions in the function without loop before "
1061           "the function is qualified for patching for instrumentation (for use "
1062           "with -mpatch-functions-for-instrumentation)",
1063           200, 0, 0)
1064
1065 /*
1066 Local variables:
1067 mode:c
1068 End:
1069 */