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