/* params.def - Run-time parameters.
- Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
+ Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
Written by Mark Mitchell <mark@codesourcery.com>.
- 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 <name>=<value>'.
- A help string explaining how the parameter is used.
Be sure to add an entry to invoke.texi summarizing the parameter. */
/* 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
+ 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,
threshold (in percent), then it is considered well predictable. */
DEFPARAM (PARAM_PREDICTABLE_BRANCH_OUTCOME,
"predictable-branch-outcome",
- "Maximal esitmated outcome of branch considered predictable",
+ "Maximal estimated outcome of branch considered predictable",
2, 0, 50)
/* The single function inlining limit. This is the maximum size
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-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",
1, 0, 0)
-
+
/* Limit loop autovectorization to loops with large enough iteration count. */
DEFPARAM (PARAM_MIN_VECT_LOOP_BOUND,
"min-vect-loop-bound",
"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",
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
"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,
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.
+ 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
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
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.
+ 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,
"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,
"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,
OSDN Git Service
