Lines Matching refs:estimated
3918 objcopy --strip-dwo %{c:%{o*:%*}%{!o*:%b%O}}%{!c:%U%O} } %{mbig-endian:-EB} %{mlittle-endian:-EL} %{march=*:-march=%*} %(asm_cpu_spec)%{mabi=*:-mabi=%*} %{static:--start-group} %G %L %{static:--end-group}%{!static:%G} %{mno-android|tno-android-cc:;:%{!fexceptions:%{!fno-exceptions: -fexceptions}} %{!frtti:%{!fno-rtti: -frtti}}} %{mno-android|tno-android-cc:%{profile:-p};:%{profile:-p} %{!mglibc:%{!muclibc:%{!mbionic: -mbionic}}} %{!fno-pic:%{!fno-PIC:%{!fpic:%{!fPIC: -fpic}}}}} %{g*:%{!g0:--gdwarf2}} %{fdebug-prefix-map=*:--debug-prefix-map %*} /tmp/ec08fa09236e3161f186f0ecaf2224fb/sysroot /buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/common/config/aarch64/aarch64-common.c /tmp/ec08fa09236e3161f186f0ecaf2224fb /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 estimatedestimated instructions) the minimum number of iterations of negative cycle cancellation in MCF cxx-max-namespaces-for-diagnostic-help Maximum number of namespaces to search for alternatives when name lookup fails gnu-cgraph-section-edge-threshold minimum call graph edge count for inclusion in .gnu.callgraph.text section Maximum number of conditional store pairs that can be sunk The smallest number of different values for which it is best to use a jump-table instead of a tree of conditional branches, if 0, use the default for the machine Allow new data races on loads to be introduced Allow new data races on stores to be introduced Allow new data races on packed data loads to be introduced Allow new data races on packed data stores to be introduced Set the maximum number of instructions executed in parallel in reassociated tree. If 0, use the target dependent heuristic. Maximum amount of similar bbs to compare a bb with Maximum amount of iterations of the pass over a function Maximum number of strings for which strlen optimization pass will track string lengths Which -fsched-pressure algorithm to apply Maximum length of candidate scans for straight-line strength reduction Enable asan globals protection Enable asan store operations protection Enable asan load operations protection Enable asan builtin functions protection Enable asan detection of use-after-return bugs asan-instrumentation-with-call-threshold Use callbacks instead of inline code if number of accesses in function becomes greater or equal to this number Maximum number of nested calls to search for control dependencies during uninitialized variable analysis Maximum number of instructions to copy when duplicating blocks on a finite state automaton jump thread path Maximum number of basic blocks on a finite state automaton jump thread path Maximum number of new jump thread paths to create for a finite state automaton Adjust the estimation of fp setting insn cost with this fraction inframepointer shrinkwrapping Adjust the estimation of fpset promotion cost with this fraction inframepointer shrinkwrapping /buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/opts.c The following options are specific to just the language The following options are supported by the language The following options are target specific The following options control compiler warning messages The following options control optimizations The following options are language-independent The --param option recognizes the following as parameters The following options are language-related The following options take separate arguments The following options take joined arguments unrecognized include_flags 0x%x passed to print_specific_help No options with the desired characteristics were found None found. Use --help=%s to show *all* the options supported by the %s front-end
