Searched refs:expensive (Results 1 – 25 of 418) sorted by relevance
12345678910>>...17
| /external/llvm/test/Transforms/Inline/ |
| D | nonnull.ll | 8 br i1 %cmp, label %expensive, label %done
10 ; This block is designed to be too expensive to inline. We can only inline
12 expensive:
|
| /external/llvm-project/llvm/test/Transforms/Inline/ |
| D | nonnull.ll | 9 br i1 %cmp, label %expensive, label %done
11 ; This block is designed to be too expensive to inline. We can only inline
13 expensive:
|
| /external/llvm/test/CodeGen/X86/ |
| D | or-branch.ll | 1 ; RUN: llc < %s -mtriple=i386-unknown-unknown -jump-is-expensive=0 | FileCheck %s --check-prefix=JU…
2 ; RUN: llc < %s -mtriple=i386-unknown-unknown -jump-is-expensive=1 | FileCheck %s --check-prefix=JU…
29 ; regardless of whether they are expensive or not.
|
| /external/llvm-project/llvm/test/CodeGen/X86/ |
| D | or-branch.ll | 2 ; RUN: llc < %s -mtriple=i386-unknown-unknown -jump-is-expensive=0 | FileCheck %s --check-prefix=JU…
3 ; RUN: llc < %s -mtriple=i386-unknown-unknown -jump-is-expensive=1 | FileCheck %s --check-prefix=JU…
45 ; regardless of whether they are expensive or not.
|
| /external/rust/crates/hashlink/ |
| D | README.md | 19 // Try to find my expensive to construct and hash key
27 // Insert expensive to construct key and expensive to compute value,
|
| /external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
| D | performance-unnecessary-value-param.rst | 6 Flags value parameter declarations of expensive to copy types that are copied
9 The check is only applied to parameters of types that are expensive to copy
|
| D | performance-implicit-conversion-in-loop.rst | 9 result in expensive deep copies.
|
| D | openmp-exception-escape.rst | 17 WARNING! This check may be expensive on large source files.
|
| D | darwin-dispatch-once-nonstatic.rst | 16 members of structs or classes, with the intent to lazily perform some expensive
|
| /external/llvm/test/CodeGen/ARM/ |
| D | copy-cpsr.ll | 7 ; is carried in the DAG because duplicating them can be more expensive than
17 ; + We want the chains to be long enough that duplicating them is expensive.
|
| D | vcvt-cost.ll | 2 ; instructions as expensive. If lowering is improved the cost model needs to
19 ;; We currently estimate the cost of this instruction as expensive. If lowering
66 ;; We currently estimate the cost of this instruction as expensive. If lowering
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| D | high-cost-trip-count-computation.ll | 5 ;; Check that we don't emit expensive instructions to compute trip
28 ;; it shouldn't be considered expensive, since the division already
|
| /external/llvm-project/llvm/test/Transforms/LoopUnroll/ |
| D | high-cost-trip-count-computation.ll | 5 ;; Check that we don't emit expensive instructions to compute trip
28 ;; it shouldn't be considered expensive, since the division already
|
| /external/llvm-project/llvm/test/CodeGen/ARM/ |
| D | copy-cpsr.ll | 7 ; is carried in the DAG because duplicating them can be more expensive than
17 ; + We want the chains to be long enough that duplicating them is expensive.
|
| D | vcvt-cost.ll | 2 ; instructions as expensive. If lowering is improved the cost model needs to
19 ;; We currently estimate the cost of this instruction as expensive. If lowering
66 ;; We currently estimate the cost of this instruction as expensive. If lowering
|
| /external/tensorflow/tensorflow/core/profiler/g3doc/ |
| D | advise.md | 99 * Checks the most expensive operation type.
100 * Checks the most expensive graph nodes.
101 * Checks the most expensive graph-building Python codes.
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | 2006-12-05-fp-to-int-ext.ll | 4 ; significantly more expensive than the two conversions on some targets
|
| /external/llvm-project/llvm/test/Transforms/InstCombine/ |
| D | 2006-12-05-fp-to-int-ext.ll | 4 ; significantly more expensive than the two conversions on some targets
|
| /external/selinux/mcstrans/ |
| D | TODO | 9 compute_trans_from_raw is an expensive operation that needs to be sped up or threaded so that mcstr…
|
| /external/llvm-project/llvm/utils/gn/build/ |
| D | buildflags.gni | 17 # Whether to enable expensive checks.
|
| /external/llvm-project/llvm/test/Transforms/LoopUnroll/PowerPC/ |
| D | a2-high-cost-trip-count-computation.ll | 5 ;; Check that we do emit expensive instructions to compute trip
|
| /external/llvm/test/Transforms/LoopUnroll/PowerPC/ |
| D | a2-high-cost-trip-count-computation.ll | 5 ;; Check that we do emit expensive instructions to compute trip
|
| /external/llvm/test/Analysis/CostModel/AArch64/ |
| D | store.ll | 5 ; Stores of <2 x i64> should be expensive because we don't split them and
|
| /external/python/cryptography/docs/ |
| D | limitations.rst | 15 Likelihood: unlikely, Remediation Cost: expensive to repair" and we do not
|
| /external/llvm/test/Bitcode/ |
| D | mdnodes-distinct-nodes-break-cycles.ll | 9 ; Forward references for uniqued node operands are expensive, whereas they're
|
12345678910>>...17