Lines Matching refs:Probability
3916 predictable-branch-outcome inline-min-speedup max-inline-insns-single max-inline-insns-auto max-growth-auto-inline-func max-inline-insns-recursive max-inline-recursive-depth inline-function-overhead-size inline-hot-caller hot-caller-codesize-threshold inline-useful-cold-callee max-early-inliner-iterations comdat-sharing-probability min-vect-loop-bound max-delay-slot-insn-search max-delay-slot-live-search max-pending-list-length max-modulo-backtrack-attempts large-function-insns large-function-growth large-unit-insns inline-unit-growth ipcp-unit-growth early-inlining-insns early-inlining-insns-any early-inlining-insns-comdat large-stack-frame large-stack-frame-growth max-gcse-memory max-gcse-insertion-ratio gcse-cost-distance-ratio gcse-unrestricted-cost max-hoist-depth max-unrolled-insns max-average-unrolled-insns max-unroll-times max-peeled-insns max-peel-times max-peel-branches max-completely-peeled-insns max-completely-peel-times max-once-peeled-insns unrollpeel-codesize-threshold unrollpeel-hotness-threshold min-iter-unroll-with-branches max-unswitch-insns max-unswitch-level max-iterations-to-track sms-max-ii-factor sms-min-sc sms-dfa-history hot-bb-count-ws-permille hot-bb-frequency-fraction unlikely-bb-count-fraction align-threshold align-loop-iterations align-loop-size max-predicted-iterations builtin-expect-probability tracer-dynamic-coverage tracer-max-code-growth tracer-min-branch-ratio tracer-min-branch-probability max-crossjump-edges min-crossjump-insns max-grow-copy-bb-insns max-goto-duplication-insns max-cse-path-length max-cse-insns lim-expensive iv-max-considered-uses scev-max-expr-size scev-max-expr-complexity omega-max-vars omega-max-geqs omega-max-eqs omega-max-wild-cards omega-hash-table-size omega-max-keys max-cselib-memory-locations ggc-min-expand ggc-min-heapsize max-reload-search-insns sink-frequency-threshold max-sched-region-blocks max-sched-region-insns max-pipeline-region-blocks max-pipeline-region-insns min-spec-prob max-sched-insn-conflict-delay sched-spec-prob-cutoff sched-state-edge-prob-cutoff selsched-max-lookahead selsched-max-sched-times selsched-insns-to-rename sched-mem-true-dep-cost max-last-value-rtl integer-share-limit ssp-buffer-size min-size-for-stack-sharing max-sched-ready-insns max-dse-active-local-stores prefetch-latency simultaneous-prefetches l1-cache-size The size of L1 cache l1-cache-line-size The size of L1 cache line l2-cache-size The size of L2 cache use-canonical-types max-partial-antic-length sccvn-max-scc-size ira-max-loops-num ira-max-conflict-table-size ira-loop-reserved-regs loop-block-tile-size graphite-max-nb-scop-params graphite-max-bbs-per-function always-inline-icall-target profile-func-internal-id icall-use-hotness-heur force-lipo force LIPO compilation mode max-lipo-group maximum module group size. max-lipo-mem lipo-cutoff lipo-skip-special-sections lipo-random-seed lipo-random-group-size lipo-propagate-scale lipo-grouping-algorithm lipo-merge-modu-edges lipo-weak-inclusion lipo-comdat-algorithm inline-dump-module-id lipo-dump-cgraph lipo-sampling-period profile-values-time coverage-callback coverage-exec_once gcov-debug slp-max-insns-in-bb min-insn-to-prefetch-ratio max-vartrack-size max-vartrack-expr-depth max-vartrack-reverse-op-size min-nondebug-insn-uid ipa-sra-ptr-growth-factor tm-max-aggregate-size ipa-cp-value-list-size ipa-cp-eval-threshold ipa-max-agg-items ipa-cp-loop-hint-bonus ipa-cp-array-index-hint-bonus lto-partitions lto-min-partition min-mcf-cancel-iters max-stores-to-sink case-values-threshold allow-load-data-races allow-store-data-races allow-packed-load-data-races allow-packed-store-data-races tree-reassoc-width max-tail-merge-comparisons max-tail-merge-iterations max-tracked-strlens sched-pressure-algorithm max-slsr-cand-scan asan-stack Enable asan stack protection asan-globals asan-instrument-writes asan-instrument-reads asan-memintrin asan-use-after-return uninit-control-dep-attempts max-fsm-thread-path-insns max-fsm-thread-length max-fsm-thread-paths fpset-cost-fraction fpset-promote-fraction %-*.*s %.*s
3921 probability
4035 objcopy --strip-dwo %{c:%{o*:%*}%{!o*:%b%O}}%{!c:%U%O} } %{mno-android|tno-android-cc:%{mbig-endian:-EB} %{mlittle-endian:-EL} %(asm_cpu_spec) %{mapcs-*:-mapcs-%*} %(subtarget_asm_float_spec) %{mthumb-interwork:-mthumb-interwork} %{mfloat-abi=*} %{mfpu=*} %(subtarget_extra_asm_spec);:%{mbig-endian:-EB} %{mlittle-endian:-EL} %(asm_cpu_spec) %{mapcs-*:-mapcs-%*} %(subtarget_asm_float_spec) %{mthumb-interwork:-mthumb-interwork} %{mfloat-abi=*} %{mfpu=*} %(subtarget_extra_asm_spec) --noexecstack} %{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} %{%:sanitize(address):-funwind-tables};:%{profile:-p} %{%:sanitize(address):-funwind-tables} %{!mglibc:%{!muclibc:%{!mbionic: -mbionic}}} %{!fno-pic:%{!fno-PIC:%{!fpic:%{!fPIC: -fpic}}}}} %(subtarget_cpp_spec) %{mfloat-abi=soft:%{mfloat-abi=hard: %e-mfloat-abi=soft and -mfloat-abi=hard may not be used together}} %{mbig-endian:%{mlittle-endian: %e-mbig-endian and -mlittle-endian may not be used together}} %{!g0:%{gstabs*:--gstabs}%{!gstabs*:%{g*:--gdwarf2}}} %{fdebug-prefix-map=*:--debug-prefix-map %*} /tmp/35e600aefabe85f7f85608310ddf0c46/sysroot march=armv7-a mthumb mfloat-abi=hard /usr/local/google/buildbot/src/android/gcc/toolchain/build/../gcc/gcc-4.9/gcc/common/config/arm/arm-common.c /tmp/35e600aefabe85f7f85608310ddf0c46 /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 probabilityprobability 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
