X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fparams.def;h=35650ff91b74108c2ced80a02c1e95377001a42a;hb=ac233cc9cda8e45484364391c14b8d056c9c2a81;hp=a777efa2e1da69c9409105c00ce4f3de9fbd8254;hpb=fbf0ba359d53a43a55f5e65171b9ea318949f602;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/params.def b/gcc/params.def index a777efa2e1d..35650ff91b7 100644 --- a/gcc/params.def +++ b/gcc/params.def @@ -1,12 +1,13 @@ /* params.def - Run-time parameters. - Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc. + Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 + Free Software Foundation, Inc. Written by Mark Mitchell . This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free -Software Foundation; either version 2, or (at your option) any later +Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY @@ -15,18 +16,15 @@ FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with GCC; see the file COPYING. If not, write to the Free -Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA -02110-1301, USA. - -*/ +along with GCC; see the file COPYING3. If not see +. */ /* This file contains definitions for language-independent parameters. The DEFPARAM macro takes 6 arguments: - The enumeral corresponding to this parameter. - - The name that can be used to set this parameter using the + - The name that can be used to set this parameter using the command-line option `--param ='. - A help string explaining how the parameter is used. @@ -40,43 +38,22 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA Be sure to add an entry to invoke.texi summarizing the parameter. */ -/* The maximum number of fields in a variable with only implicit uses - for which structure aliasing will consider trying to track each - field. The default is 5. */ -DEFPARAM (PARAM_SALIAS_MAX_IMPLICIT_FIELDS, - "salias-max-implicit-fields", - "The maximum number of fields in a structure variable without direct structure accesses that GCC will attempt to track separately", - 5, 0, 0) - -/* The maximum structure size at which the scalar replacement of - aggregates (SRA) pass will perform block copies. The default - value, 0, implies that GCC will select the most appropriate size - itself. */ -DEFPARAM (PARAM_SRA_MAX_STRUCTURE_SIZE, - "sra-max-structure-size", - "The maximum structure size (in bytes) for which GCC will " - "use by-element copies", - 0, 0, 0) - -/* The maximum number of structure fields which the SRA pass will - instantiate to avoid block copies. The default value, 0, implies - that GCC will select the appropriate value itself. */ -DEFPARAM (PARAM_SRA_MAX_STRUCTURE_COUNT, - "sra-max-structure-count", - "The maximum number of structure fields for which GCC will " - "use by-element copies", - 0, 0, 0) - -/* The ratio between instantiated fields and the complete structure - size. We say that if the ratio of the number of bytes in - instantiated fields to the number of bytes in the complete - structure exceeds this parameter, or if the number of instantiated - fields to the total number of fields exceeds this parameter, then - block copies are not used. The default is 75%. */ -DEFPARAM (PARAM_SRA_FIELD_STRUCTURE_RATIO, - "sra-field-structure-ratio", - "The threshold ratio between instantiated fields and the total structure size", - 75, 0, 100) +/* The threshold ratio between current and hottest structure counts. + We say that if the ratio of the current structure count, + calculated by profiling, to the hottest structure count + in the program is less than this parameter, then structure + reorganization is not applied. The default is 10%. */ +DEFPARAM (PARAM_STRUCT_REORG_COLD_STRUCT_RATIO, + "struct-reorg-cold-struct-ratio", + "The threshold ratio between current and hottest structure counts", + 10, 0, 100) + +/* When branch is predicted to be taken with probability lower than this + threshold (in percent), then it is considered well predictable. */ +DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME, + "predictable-branch-outcome", + "Maximal estimated outcome of branch considered predictable", + 2, 0, 50) /* The single function inlining limit. This is the maximum size of a function counted in internal gcc instructions (not in @@ -87,13 +64,13 @@ DEFPARAM (PARAM_SRA_FIELD_STRUCTURE_RATIO, definition for C++) are affected by this. There are more restrictions to inlining: If inlined functions call other functions, the already inlined instructions are - counted and once the recursive inline limit (see + counted and once the recursive inline limit (see "max-inline-insns" parameter) is exceeded, the acceptable size gets decreased. */ DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE, "max-inline-insns-single", "The maximum number of instructions in a single function eligible for inlining", - 450, 0, 0) + 400, 0, 0) /* The single function inlining limit for functions that are inlined by virtue of -finline-functions (-O3). @@ -105,7 +82,7 @@ DEFPARAM (PARAM_MAX_INLINE_INSNS_SINGLE, DEFPARAM (PARAM_MAX_INLINE_INSNS_AUTO, "max-inline-insns-auto", "The maximum number of instructions when automatically inlining", - 90, 0, 0) + 50, 0, 0) DEFPARAM (PARAM_MAX_INLINE_INSNS_RECURSIVE, "max-inline-insns-recursive", @@ -132,15 +109,27 @@ DEFPARAM (PARAM_MIN_INLINE_RECURSIVE_PROBABILITY, "Inline recursively only when the probability of call being executed exceeds the parameter", 10, 0, 0) +/* Limit of iterations of early inliner. This basically bounds number of + nested indirect calls early inliner can resolve. Deeper chains are still + handled by late inlining. */ +DEFPARAM (PARAM_EARLY_INLINER_MAX_ITERATIONS, + "max-early-inliner-iterations", + "The maximum number of nested indirect inlining performed by early inliner", + 10, 0, 0) + /* Limit the number of expansions created by the variable expansion optimization to avoid register pressure. */ DEFPARAM (PARAM_MAX_VARIABLE_EXPANSIONS, "max-variable-expansions-in-unroller", - "If -fvariable-expansion-in-unroller is used, the maximum number of \ - times that an individual variable will be expanded \ - during loop unrolling", + "If -fvariable-expansion-in-unroller is used, the maximum number of times that an individual variable will be expanded during loop unrolling", 1, 0, 0) - + +/* Limit loop autovectorization to loops with large enough iteration count. */ +DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND, + "min-vect-loop-bound", + "If -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization", + 1, 1, 0) + /* The maximum number of instructions to consider when looking for an instruction to fill a delay slot. If more than this arbitrary number of instructions is searched, the time savings from filling @@ -163,10 +152,10 @@ DEFPARAM(PARAM_MAX_DELAY_SLOT_LIVE_SEARCH, "The maximum number of instructions to consider to find accurate live register information", 333, 0, 0) -/* This parameter limits the number of branch elements that the +/* This parameter limits the number of branch elements that the scheduler will track anti-dependencies through without resetting - the tracking mechanism. Large functions with few calls or barriers - can generate lists containing many 1000's of dependencies. Generally + the tracking mechanism. Large functions with few calls or barriers + can generate lists containing many 1000's of dependencies. Generally the compiler either uses all available memory, or runs for far too long. */ DEFPARAM(PARAM_MAX_PENDING_LIST_LENGTH, "max-pending-list-length", @@ -181,14 +170,30 @@ DEFPARAM(PARAM_LARGE_FUNCTION_GROWTH, "large-function-growth", "Maximal growth due to inlining of large function (in percent)", 100, 0, 0) +DEFPARAM(PARAM_LARGE_UNIT_INSNS, + "large-unit-insns", + "The size of translation unit to be considered large", + 10000, 0, 0) DEFPARAM(PARAM_INLINE_UNIT_GROWTH, "inline-unit-growth", - "how much can given compilation unit grow because of the inlining (in percent)", - 50, 0, 0) -DEFPARAM(PARAM_INLINE_CALL_COST, - "inline-call-cost", - "expense of call operation relative to ordinary arithmetic operations", - 16, 0, 0) + "How much can given compilation unit grow because of the inlining (in percent)", + 30, 0, 0) +DEFPARAM(PARAM_IPCP_UNIT_GROWTH, + "ipcp-unit-growth", + "How much can given compilation unit grow because of the interprocedural constant propagation (in percent)", + 10, 0, 0) +DEFPARAM(PARAM_EARLY_INLINING_INSNS, + "early-inlining-insns", + "Maximal estimated growth of function body caused by early inlining of single call", + 8, 0, 0) +DEFPARAM(PARAM_LARGE_STACK_FRAME, + "large-stack-frame", + "The size of stack frame to be considered large", + 256, 0, 0) +DEFPARAM(PARAM_STACK_FRAME_GROWTH, + "large-stack-frame-growth", + "Maximal stack frame growth due to inlining (in percent)", + 1000, 0, 0) /* The GCSE optimization will be disabled if it would require significantly more memory than this value. */ @@ -196,11 +201,7 @@ DEFPARAM(PARAM_MAX_GCSE_MEMORY, "max-gcse-memory", "The maximum amount of memory to be allocated by GCSE", 50 * 1024 * 1024, 0, 0) -/* The number of repetitions of copy/const prop and PRE to run. */ -DEFPARAM(PARAM_MAX_GCSE_PASSES, - "max-gcse-passes", - "The maximum number of passes to make when doing GCSE", - 1, 1, 0) + /* This is the threshold ratio when to perform partial redundancy elimination after reload. We perform partial redundancy elimination when the following holds: @@ -220,7 +221,7 @@ DEFPARAM(PARAM_GCSE_AFTER_RELOAD_CRITICAL_FRACTION, 10, 0, 0) /* This parameter limits the number of insns in a loop that will be unrolled, and by how much the loop is unrolled. - + This limit should be at most half of the peeling limits: loop unroller decides to not unroll loops that iterate fewer than 2*number of allowed unrollings and thus we would have loops that are neither peeled or unrolled @@ -265,6 +266,11 @@ DEFPARAM(PARAM_MAX_ONCE_PEELED_INSNS, "max-once-peeled-insns", "The maximum number of insns of a peeled loop that rolls only once", 400, 0, 0) +/* The maximum depth of a loop nest we completely peel. */ +DEFPARAM(PARAM_MAX_UNROLL_ITERATIONS, + "max-completely-peel-loop-nest-depth", + "The maximum depth of a loop nest we completely peel", + 8, 0, 0) /* The maximum number of insns of an unswitched loop. */ DEFPARAM(PARAM_MAX_UNSWITCH_INSNS, @@ -283,12 +289,13 @@ DEFPARAM(PARAM_MAX_ITERATIONS_TO_TRACK, "max-iterations-to-track", "Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates", 1000, 0, 0) +/* A cutoff to avoid costly computations of the number of iterations in + the doloop transformation. */ +DEFPARAM(PARAM_MAX_ITERATIONS_COMPUTATION_COST, + "max-iterations-computation-cost", + "Bound on the cost of an expression to compute the number of iterations", + 10, 0, 0) -DEFPARAM(PARAM_MAX_SMS_LOOP_NUMBER, - "max-sms-loop-number", - "Maximum number of loops to perform swing modulo scheduling on (mainly for debugging)", - -1, -1, -1) - /* This parameter is used to tune SMS MAX II calculations. */ DEFPARAM(PARAM_SMS_MAX_II_FACTOR, "sms-max-ii-factor", @@ -296,8 +303,7 @@ DEFPARAM(PARAM_SMS_MAX_II_FACTOR, 100, 0, 0) DEFPARAM(PARAM_SMS_DFA_HISTORY, "sms-dfa-history", - "The number of cycles the swing modulo scheduler considers when \ - checking conflicts using DFA", + "The number of cycles the swing modulo scheduler considers when checking conflicts using DFA", 0, 0, 0) DEFPARAM(PARAM_SMS_LOOP_AVERAGE_COUNT_THRESHOLD, "sms-loop-average-count-threshold", @@ -312,6 +318,32 @@ DEFPARAM(HOT_BB_FREQUENCY_FRACTION, "hot-bb-frequency-fraction", "Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot", 1000, 0, 0) + +DEFPARAM (PARAM_ALIGN_THRESHOLD, + "align-threshold", + "Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment", + 100, 0, 0) + +DEFPARAM (PARAM_ALIGN_LOOP_ITERATIONS, + "align-loop-iterations", + "Loops iterating at least selected number of iterations will get loop alignement.", + 4, 0, 0) + +/* For guessed profiles, the loops having unknown number of iterations + are predicted to iterate relatively few (10) times at average. + For functions containing one loop with large known number of iterations + and other loops having unbounded loops we would end up predicting all + the other loops cold that is not usually the case. So we need to artificially + flatten the profile. + + We need to cut the maximal predicted iterations to large enough iterations + so the loop appears important, but safely within HOT_BB_COUNT_FRACTION + range. */ + +DEFPARAM(PARAM_MAX_PREDICTED_ITERATIONS, + "max-predicted-iterations", + "The maximum number of loop iterations we predict statically", + 100, 0, 0) DEFPARAM(TRACER_DYNAMIC_COVERAGE_FEEDBACK, "tracer-dynamic-coverage-feedback", "The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is available", @@ -349,6 +381,12 @@ DEFPARAM(PARAM_MIN_CROSSJUMP_INSNS, "The minimum number of matching instructions to consider for crossjumping", 5, 0, 0) +/* The maximum number expansion factor when copying basic blocks. */ +DEFPARAM(PARAM_MAX_GROW_COPY_BB_INSNS, + "max-grow-copy-bb-insns", + "The maximum expansion factor when copying basic blocks", + 8, 0, 0) + /* The maximum number of insns to duplicate when unfactoring computed gotos. */ DEFPARAM(PARAM_MAX_GOTO_DUPLICATION_INSNS, "max-goto-duplication-insns", @@ -360,6 +398,10 @@ DEFPARAM(PARAM_MAX_CSE_PATH_LENGTH, "max-cse-path-length", "The maximum length of path considered in cse", 10, 0, 0) +DEFPARAM(PARAM_MAX_CSE_INSNS, + "max-cse-insns", + "The maximum instructions CSE process before flushing", + 1000, 0, 0) /* The cost of expression in loop invariant motion that is considered expensive. */ @@ -398,12 +440,50 @@ DEFPARAM(PARAM_SCEV_MAX_EXPR_SIZE, "Bound on size of expressions used in the scalar evolutions analyzer", 20, 0, 0) -/* The product of the next two is used to decide whether or not to - use .GLOBAL_VAR. See tree-dfa.c. */ -DEFPARAM(PARAM_GLOBAL_VAR_THRESHOLD, - "global-var-threshold", - "Given N calls and V call-clobbered vars in a function. Use .GLOBAL_VAR if NxV is larger than this limit", - 500000, 0, 0) +DEFPARAM(PARAM_OMEGA_MAX_VARS, + "omega-max-vars", + "Bound on the number of variables in Omega constraint systems", + 128, 0, 0) + +DEFPARAM(PARAM_OMEGA_MAX_GEQS, + "omega-max-geqs", + "Bound on the number of inequalities in Omega constraint systems", + 256, 0, 0) + +DEFPARAM(PARAM_OMEGA_MAX_EQS, + "omega-max-eqs", + "Bound on the number of equalities in Omega constraint systems", + 128, 0, 0) + +DEFPARAM(PARAM_OMEGA_MAX_WILD_CARDS, + "omega-max-wild-cards", + "Bound on the number of wild cards in Omega constraint systems", + 18, 0, 0) + +DEFPARAM(PARAM_OMEGA_HASH_TABLE_SIZE, + "omega-hash-table-size", + "Bound on the size of the hash table in Omega constraint systems", + 550, 0, 0) + +DEFPARAM(PARAM_OMEGA_MAX_KEYS, + "omega-max-keys", + "Bound on the number of keys in Omega constraint systems", + 500, 0, 0) + +DEFPARAM(PARAM_OMEGA_ELIMINATE_REDUNDANT_CONSTRAINTS, + "omega-eliminate-redundant-constraints", + "When set to 1, use expensive methods to eliminate all redundant constraints", + 0, 0, 1) + +DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIGNMENT_CHECKS, + "vect-max-version-for-alignment-checks", + "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check", + 6, 0, 0) + +DEFPARAM(PARAM_VECT_MAX_VERSION_FOR_ALIAS_CHECKS, + "vect-max-version-for-alias-checks", + "Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check", + 10, 0, 0) DEFPARAM(PARAM_MAX_CSELIB_MEMORY_LOCATIONS, "max-cselib-memory-locations", @@ -436,11 +516,6 @@ DEFPARAM(PARAM_MAX_RELOAD_SEARCH_INSNS, "The maximum number of instructions to search backward when looking for equivalent reload", 100, 0, 0) -DEFPARAM(PARAM_MAX_ALIASED_VOPS, - "max-aliased-vops", - "The maximum number of virtual operands allowed to represent aliases before triggering alias grouping", - 500, 0, 0) - DEFPARAM(PARAM_MAX_SCHED_REGION_BLOCKS, "max-sched-region-blocks", "The maximum number of blocks in a region to be considered for interblock scheduling", @@ -451,11 +526,56 @@ DEFPARAM(PARAM_MAX_SCHED_REGION_INSNS, "The maximum number of insns in a region to be considered for interblock scheduling", 100, 0, 0) +DEFPARAM(PARAM_MAX_PIPELINE_REGION_BLOCKS, + "max-pipeline-region-blocks", + "The maximum number of blocks in a region to be considered for interblock scheduling", + 15, 0, 0) + +DEFPARAM(PARAM_MAX_PIPELINE_REGION_INSNS, + "max-pipeline-region-insns", + "The maximum number of insns in a region to be considered for interblock scheduling", + 200, 0, 0) + DEFPARAM(PARAM_MIN_SPEC_PROB, "min-spec-prob", "The minimum probability of reaching a source block for interblock speculative scheduling", 40, 0, 0) +DEFPARAM(PARAM_MAX_SCHED_EXTEND_REGIONS_ITERS, + "max-sched-extend-regions-iters", + "The maximum number of iterations through CFG to extend regions", + 0, 0, 0) + +DEFPARAM(PARAM_MAX_SCHED_INSN_CONFLICT_DELAY, + "max-sched-insn-conflict-delay", + "The maximum conflict delay for an insn to be considered for speculative motion", + 3, 1, 10) + +DEFPARAM(PARAM_SCHED_SPEC_PROB_CUTOFF, + "sched-spec-prob-cutoff", + "The minimal probability of speculation success (in percents), so that speculative insn will be scheduled.", + 40, 0, 100) + +DEFPARAM(PARAM_SELSCHED_MAX_LOOKAHEAD, + "selsched-max-lookahead", + "The maximum size of the lookahead window of selective scheduling", + 50, 0, 0) + +DEFPARAM(PARAM_SELSCHED_MAX_SCHED_TIMES, + "selsched-max-sched-times", + "Maximum number of times that an insn could be scheduled", + 2, 0, 0) + +DEFPARAM(PARAM_SELSCHED_INSNS_TO_RENAME, + "selsched-insns-to-rename", + "Maximum number of instructions in the ready list that are considered eligible for renaming", + 2, 0, 0) + +DEFPARAM (PARAM_SCHED_MEM_TRUE_DEP_COST, + "sched-mem-true-dep-cost", + "Minimal distance between possibly conflicting store and load", + 1, 0, 0) + DEFPARAM(PARAM_MAX_LAST_VALUE_RTL, "max-last-value-rtl", "The maximum number of RTL nodes that can be recorded as combiner's last value", @@ -477,7 +597,7 @@ DEFPARAM (PARAM_INTEGER_SHARE_LIMIT, PARAM_MIN_VIRTUAL_MAPPINGS specifies the minimum number of virtual mappings that should be registered to trigger the heuristic. - + PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO specifies the ratio between mappings and symbols. If the number of virtual mappings is PARAM_VIRTUAL_MAPPINGS_TO_SYMS_RATIO bigger than the number of @@ -498,7 +618,193 @@ DEFPARAM (PARAM_SSP_BUFFER_SIZE, "The lower bound for a buffer to be considered for stack smashing protection", 8, 1, 0) +/* When we thread through a block we have to make copies of the + statements within the block. Clearly for large blocks the code + duplication is bad. + + PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS specifies the maximum number + of statements and PHI nodes allowed in a block which is going to + be duplicated for thread jumping purposes. + + Some simple analysis showed that more than 99% of the jump + threading opportunities are for blocks with less than 15 + statements. So we can get the benefits of jump threading + without excessive code bloat for pathological cases with the + throttle set at 15 statements. */ +DEFPARAM (PARAM_MAX_JUMP_THREAD_DUPLICATION_STMTS, + "max-jump-thread-duplication-stmts", + "Maximum number of statements allowed in a block that needs to be duplicated when threading jumps", + 15, 0, 0) + +/* This is the maximum number of fields a variable may have before the pointer analysis machinery + will stop trying to treat it in a field-sensitive manner. + There are programs out there with thousands of fields per structure, and handling them + field-sensitively is not worth the cost. */ +DEFPARAM (PARAM_MAX_FIELDS_FOR_FIELD_SENSITIVE, + "max-fields-for-field-sensitive", + "Maximum number of fields in a structure before pointer analysis treats the structure as a single variable", + 0, 0, 0) + +DEFPARAM(PARAM_MAX_SCHED_READY_INSNS, + "max-sched-ready-insns", + "The maximum number of instructions ready to be issued to be considered by the scheduler during the first scheduling pass", + 100, 0, 0) + +/* Prefetching and cache-optimizations related parameters. Default values are + usually set by machine description. */ + +/* The number of insns executed before prefetch is completed. */ + +DEFPARAM (PARAM_PREFETCH_LATENCY, + "prefetch-latency", + "The number of insns executed before prefetch is completed", + 200, 0, 0) + +/* The number of prefetches that can run at the same time. */ + +DEFPARAM (PARAM_SIMULTANEOUS_PREFETCHES, + "simultaneous-prefetches", + "The number of prefetches that can run at the same time", + 3, 0, 0) + +/* The size of L1 cache in kB. */ + +DEFPARAM (PARAM_L1_CACHE_SIZE, + "l1-cache-size", + "The size of L1 cache", + 64, 0, 0) + +/* The size of L1 cache line in bytes. */ + +DEFPARAM (PARAM_L1_CACHE_LINE_SIZE, + "l1-cache-line-size", + "The size of L1 cache line", + 32, 0, 0) + +/* The size of L2 cache in kB. */ + +DEFPARAM (PARAM_L2_CACHE_SIZE, + "l2-cache-size", + "The size of L2 cache", + 512, 0, 0) + +/* Whether we should use canonical types rather than deep "structural" + type checking. Setting this value to 1 (the default) improves + compilation performance in the C++ and Objective-C++ front end; + this value should only be set to zero to work around bugs in the + canonical type system by disabling it. */ + +DEFPARAM (PARAM_USE_CANONICAL_TYPES, + "use-canonical-types", + "Whether to use canonical types", + 1, 0, 1) + +DEFPARAM (PARAM_MAX_PARTIAL_ANTIC_LENGTH, + "max-partial-antic-length", + "Maximum length of partial antic set when performing tree pre optimization", + 100, 0, 0) + +/* The following is used as a stop-gap limit for cases where really huge + SCCs blow up memory and compile-time use too much. If we hit this limit, + SCCVN and such FRE and PRE will be not done at all for the current + function. */ + +DEFPARAM (PARAM_SCCVN_MAX_SCC_SIZE, + "sccvn-max-scc-size", + "Maximum size of a SCC before SCCVN stops processing a function", + 10000, 10, 0) + +DEFPARAM (PARAM_IRA_MAX_LOOPS_NUM, + "ira-max-loops-num", + "Max loops number for regional RA", + 100, 0, 0) + +DEFPARAM (PARAM_IRA_MAX_CONFLICT_TABLE_SIZE, + "ira-max-conflict-table-size", + "Max size of conflict table in MB", + 1000, 0, 0) + +DEFPARAM (PARAM_IRA_LOOP_RESERVED_REGS, + "ira-loop-reserved-regs", + "The number of registers in each class kept unused by loop invariant motion", + 2, 0, 0) + +/* Switch initialization conversion will refuse to create arrays that are + bigger than this parameter times the number of switch branches. */ + +DEFPARAM (PARAM_SWITCH_CONVERSION_BRANCH_RATIO, + "switch-conversion-max-branch-ratio", + "The maximum ratio between array size and switch branches for " + "a switch conversion to take place", + 8, 1, 0) + +/* Size of tiles when doing loop blocking. */ + +DEFPARAM (PARAM_LOOP_BLOCK_TILE_SIZE, + "loop-block-tile-size", + "size of tiles for loop blocking", + 51, 0, 0) + +/* Maximal number of parameters that we allow in a SCoP. */ + +DEFPARAM (PARAM_GRAPHITE_MAX_NB_SCOP_PARAMS, + "graphite-max-nb-scop-params", + "maximum number of parameters in a SCoP", + 10, 0, 0) + +/* Maximal number of basic blocks in the functions analyzed by Graphite. */ + +DEFPARAM (PARAM_GRAPHITE_MAX_BBS_PER_FUNCTION, + "graphite-max-bbs-per-function", + "maximum number of basic blocks per function to be analyzed by Graphite", + 100, 0, 0) + +/* Avoid doing loop invariant motion on very large loops. */ + +DEFPARAM (PARAM_LOOP_INVARIANT_MAX_BBS_IN_LOOP, + "loop-invariant-max-bbs-in-loop", + "Max basic blocks number in loop for loop invariant motion", + 10000, 0, 0) + +/* Avoid SLP vectorization of large basic blocks. */ +DEFPARAM (PARAM_SLP_MAX_INSNS_IN_BB, + "slp-max-insns-in-bb", + "Maximum number of instructions in basic block to be considered for SLP vectorization", + 1000, 0, 0) + +DEFPARAM (PARAM_MIN_INSN_TO_PREFETCH_RATIO, + "min-insn-to-prefetch-ratio", + "Min. ratio of insns to prefetches to enable prefetching for " + "a loop with an unknown trip count", + 10, 0, 0) + +DEFPARAM (PARAM_PREFETCH_MIN_INSN_TO_MEM_RATIO, + "prefetch-min-insn-to-mem-ratio", + "Min. ratio of insns to mem ops to enable prefetching in a loop", + 3, 0, 0) + +/* Set maximum hash table size for var tracking. */ + +DEFPARAM (PARAM_MAX_VARTRACK_SIZE, + "max-vartrack-size", + "Max. size of var tracking hash tables", + 50000000, 0, 0) + +/* Set minimum insn uid for non-debug insns. */ + +DEFPARAM (PARAM_MIN_NONDEBUG_INSN_UID, + "min-nondebug-insn-uid", + "The minimum UID to be used for a nondebug insn", + 0, 1, 0) + +DEFPARAM (PARAM_IPA_SRA_PTR_GROWTH_FACTOR, + "ipa-sra-ptr-growth-factor", + "Maximum allowed growth of size of new parameters ipa-sra replaces " + "a pointer to an aggregate with", + 2, 0, 0) + /* Local variables: mode:c -End: */ +End: +*/