Lines Matching refs:hoist
3799 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
3804 hoist
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
3919 hoist
