Lines Matching refs:Duplicated
3990 objcopy --strip-dwo %{c:%{o*:%*}%{!o*:%b%O}}%{!c:%U%O} } %{G*} %(endian_spec) %{mips1} %{mips2} %{mips3} %{mips4} %{mips32*} %{mips64*} %{mips16} %{mno-mips16:-no-mips16} %{mmicromips} %{mno-micromips} %{mips3d} %{mno-mips3d:-no-mips3d} %{mdmx} %{mno-mdmx:-no-mdmx} %{mdsp} %{mno-dsp} %{mdspr2} %{mno-dspr2} %{mdspr3} %{mno-dspr3} %{mmcu} %{mno-mcu} %{meva} %{mno-eva} %{mvirt} %{mno-virt} %{mxpa} %{mno-xpa} %{mmsa} %{mno-msa} %{msmartmips} %{mno-smartmips} %{mmt} %{mno-mt} %{mmxu} %{mno-mxu} %{mfix-rm7000} %{mno-fix-rm7000} %{mfix-vr4120} %{mfix-vr4130} %{mfix-24k} %{noasmopt:-O0; O0|fno-delayed-branch:-O1; O*:-O2; :-O1} %(subtarget_asm_debugging_spec) %{mabi=*} %{!mabi=*: %(asm_abi_default_spec)} %{mgp32} %{mgp64} %{march=*} %{mxgot:-xgot} %{mfp32} %{mfpxx} %{mfp64} %{mnan=*} %{modd-spreg} %{mno-odd-spreg} %{mshared} %{mno-shared} %{msym32} %{mno-sym32} %{mtune=*} %{mhard-float} %{msoft-float} %{msingle-float} %{mdouble-float} %(subtarget_asm_spec) %{static:--start-group} %G %L %{static:--end-group}%{!static:%G} %{mno-android|tno-android-cc:;:%{!fexceptions:%{!fno-exceptions: -fexceptions}} %{!frtti:%{!fno-rtti: -frtti}}} %{G*} %{EB:-meb} %{EL:-mel} %{EB:%{EL:%emay not use both -EB and -EL}} %(subtarget_cc1_spec) %{!g0:%{gstabs*:--gstabs}%{!gstabs*:%{g*:--gdwarf2}}} %{fdebug-prefix-map=*:--debug-prefix-map %*} /tmp/4caf2245b7f513cbd9fbe060a482b8e8/sysroot mabi=32 mips32/mips32r2/mips32r6/mips64r6 /tmp/4caf2245b7f513cbd9fbe060a482b8e8 /usr/local/google/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/params.c minimum value of parameter %qs is %u maximum value of parameter %qs is %u Maximal estimated outcome of branch considered predictable The minimal estimated speedup allowing inliner to ignore inline-insns-single and inline-isnsns-auto The maximum number of instructions in a single function eligible for inlining The maximum number of instructions when automatically inlining The maximum size growth when inlining functions without inline declared in plain mode The maximum number of instructions inline function can grow to via recursive inlining max-inline-insns-recursive-auto The maximum number of instructions non-inline function can grow to via recursive inlining The maximum depth of recursive inlining for inline functions max-inline-recursive-depth-auto The maximum depth of recursive inlining for non-inline functions min-inline-recursive-probability Inline recursively only when the probability of call being executed exceeds the parameter Size estimate of function overhead (prologue/epilogue) for inlining purposes Consider cold callsites for inlining if caller contains hot code Maximum profile-based code size footprint estimate for hot caller heuristic Only consider cold callsites for inlining if analysis estimates downstream optimization opportunities The maximum number of nested indirect inlining performed by early inliner Probability that COMDAT function will be shared with different compilation unit partial-inlining-entry-probability Maximum probability of the entry BB of split region (in percent relative to entry BB of the function) to make partial inlining happen 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 -ftree-vectorize is used, the minimal loop bound of a loop to be considered for vectorization The maximum number of instructions to consider to fill a delay slot The maximum number of instructions to consider to find accurate live register information The maximum length of scheduling's pending operations list The maximum number of backtrack attempts the scheduler should make when modulo scheduling a loop The size of function body to be considered large Maximal growth due to inlining of large function (in percent) The size of translation unit to be considered large How much can given compilation unit grow because of the inlining (in percent) How much can given compilation unit grow because of the interprocedural constant propagation (in percent) Maximal estimated growth of function body caused by early inlining of single call Early inline calls if growth does not exceed this limit Early inline calls to comdate functions if growth does not exceed this limit The size of stack frame to be considered large Maximal stack frame growth due to inlining (in percent) The maximum amount of memory to be allocated by GCSE The maximum ratio of insertions to deletions of expressions in GCSE gcse-after-reload-partial-fraction The threshold ratio for performing partial redundancy elimination after reload gcse-after-reload-critical-fraction The threshold ratio of critical edges execution count that permit performing redundancy elimination after reload Scaling factor in calculation of maximum distance an expression can be moved by GCSE optimizations Cost at which GCSE optimizations will not constraint the distance an expression can travel Maximum depth of search in the dominator tree for expressions to hoist The maximum number of instructions to consider to unroll in a loop The maximum number of instructions to consider to unroll in a loop on average The maximum number of unrollings of a single loop The maximum number of insns of a peeled loop The maximum number of peelings of a single loop The maximum number of branches on the path through the peeled sequence The maximum number of insns of a completely peeled loop max-default-completely-peeled-insns The maximum number of peelings of a single loop that is peeled completely The maximum number of insns of a peeled loop that rolls only once max-completely-peel-loop-nest-depth The maximum depth of a loop nest we completely peel Maximum profile-based code size footprint estimate for loop unrolling and peeling Maximum ratio of total profiled execution count to loop entry block count under which most codesize limits for unrolling and peeling will be ignored Minimum iteration count to ignore branch effects when unrolling unroll-outer-loop-branch-budget Maximum number of branches allowed in hot outer loop region after unroll The maximum number of insns of an unswitched loop The maximum number of unswitchings in a single loop Bound on the number of iterations the brute force # of iterations analysis algorithm evaluates max-iterations-computation-cost Bound on the cost of an expression to compute the number of iterations A factor for tuning the upper bound that swing modulo scheduler uses for scheduling a loop The minimum value of stage count that swing modulo scheduler will generate. The number of cycles the swing modulo scheduler considers when checking conflicts using DFA sms-loop-average-count-threshold A threshold on the average loop count considered by the swing modulo scheduler A basic block profile count is considered hot if it contributes to the given permillage of the entire profiled execution Select fraction of the maximal frequency of executions of basic block in function given basic block needs to have to be considered hot The minimum fraction of profile runs a given basic block execution count must be not to be considered unlikely Select fraction of the maximal frequency of executions of basic block in function given basic block get alignment Loops iterating at least selected number of iterations will get loop alignement. For loop small enough, try to align them more strictly. The maximum number of loop iterations we predict statically max-autofdo-max-propagate-iterations The maximum number of AutoFDO profile propagation iterations Set the estimated probability in percentage for builtin expect. The default value is 90% probability. 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 The percentage of function, weighted by execution frequency, that must be covered by trace formation. Used when profile feedback is not available Maximal code growth caused by tail duplication (in percent) Stop reverse growth if the reverse probability of best edge is less than this threshold (in percent) tracer-min-branch-probability-feedback Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is available Stop forward growth if the probability of best edge is less than this threshold (in percent). Used when profile feedback is not available The maximum number of incoming edges to consider for crossjumping The minimum number of matching instructions to consider for crossjumping The maximum expansion factor when copying basic blocks The maximum number of insns to duplicate when unfactoring computed gotos The maximum length of path considered in cse The maximum instructions CSE process before flushing The minimum cost of an expensive expression in the loop invariant motion iv-consider-all-candidates-bound Bound on number of candidates below that all candidates are considered in iv optimizations Bound on number of iv uses in loop optimized in iv optimizations iv-always-prune-cand-set-bound If number of candidates in the set is smaller, we always try to remove unused ivs during its optimization Bound on size of expressions used in the scalar evolutions analyzer Bound on the complexity of the expressions in the scalar evolutions analyzer Bound on the number of variables in Omega constraint systems Bound on the number of inequalities in Omega constraint systems Bound on the number of equalities in Omega constraint systems Bound on the number of wild cards in Omega constraint systems Bound on the size of the hash table in Omega constraint systems Bound on the number of keys in Omega constraint systems omega-eliminate-redundant-constraints When set to 1, use expensive methods to eliminate all redundant constraints vect-max-version-for-alignment-checks Bound on number of runtime checks inserted by the vectorizer's loop versioning for alignment check vect-max-version-for-alias-checks Bound on number of runtime checks inserted by the vectorizer's loop versioning for alias check vect-max-peeling-for-alignment Max number of loop peels to enhancement alignment of data references in a loop The maximum memory locations recorded by cselib Minimum heap expansion to trigger garbage collection, as a percentage of the total size of the heap Minimum heap size before we start collecting garbage, in kilobytes The maximum number of instructions to search backward when looking for equivalent reload Target block's relative execution frequency (as a percentage) required to sink a statement The maximum number of blocks in a region to be considered for interblock scheduling The maximum number of insns in a region to be considered for interblock scheduling The minimum probability of reaching a source block for interblock speculative scheduling max-sched-extend-regions-iters The maximum number of iterations through CFG to extend regions The maximum conflict delay for an insn to be considered for speculative motion The minimal probability of speculation success (in percents), so that speculative insn will be scheduled. The minimum probability an edge must have for the scheduler to save its state across it. The maximum size of the lookahead window of selective scheduling Maximum number of times that an insn could be scheduled Maximum number of instructions in the ready list that are considered eligible for renaming Minimal distance between possibly conflicting store and load The maximum number of RTL nodes that can be recorded as combiner's last value The upper bound for sharing integer constants The lower bound for a buffer to be considered for stack smashing protection The minimum size of variables taking part in stack slot sharing when not optimizing max-jump-thread-duplication-stmts Maximum number of statements allowed in a block that needs to be duplicated
4011 Duplicated maps locations size: %5ld%c
