Home
last modified time | relevance | path

Searched refs:deduce (Results 1 – 25 of 48) sorted by relevance

12

/llvm-project-15.0.7/llvm/test/tools/llvm-xray/X86/
H A Daccount-recursive-calls-only-tail-call-deduction.yaml21 # deduce tail calls, and account the time (potentially wrongly) to f2() when
25 # As a result, we can deduce that f2() is not recursive here.
28 # with a flag "-d" or "-deduce-sibling-calls".
H A Daccount-deduce-tail-call.yaml18 # deduce tail calls, and account the time (potentially wrongly) to f2() when
23 # with a flag "-d" or "-deduce-sibling-calls".
H A Dgraph-deduce-tail-call.yaml35 # deduce tail calls, and account the time (potentially wrongly) to f2() when
40 # with a flag "-d" or "-deduce-sibling-calls".
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dcxx0x-initializer-stdinitializerlist.cpp102 T deduce(std::initializer_list<T>); // expected-note {{conflicting types for parameter 'T' ('int' v…
114 static_assert(same_type<decltype(deduce({1, 2, 3})), int>::value, "bad deduction"); in argument_deduction()
115 static_assert(same_type<decltype(deduce({1.0, 2.0, 3.0})), double>::value, "bad deduction"); in argument_deduction()
117 deduce({1, 2.0}); // expected-error {{no matching function}} in argument_deduction()
H A Dattributed-auto-deduction.cpp4 void deduce() { in deduce() function
H A Ddecl-microsoft-call-conv.cpp254 decltype(auto) deduce(F f) { in deduce() function
263 decltype(signaturehelper(deduce(l))) p; in f()
/llvm-project-15.0.7/llvm/test/Other/
H A Dcgscc-devirt-iteration.ll50 ; to make that possible. This forces us to first deduce readonly, then
51 ; devirtualize again, and then deduce readnone.
67 ; This indirect call is the first to be resolved, allowing us to deduce
92 ; after we deduce 'readonly' for the rest of the SCC. Once it is
93 ; devirtualized, we can deduce readnone for the SCC.
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dstore-load-unaliased-gep.ll5 ; Function below should deduce just to "return length".
H A Dgep-can-replace-gep-idx-with-zero-typesize.ll9 ; If the source element is a scalable vector type, then we cannot deduce whether
/llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/
H A Dconst_phi.ll7 ; constant. However, instcombine can't deduce this, so we can
/llvm-project-15.0.7/llvm/test/Transforms/GVN/
H A Dunreachable-predecessor.ll3 ; loop.then is not reachable from loop, so we should be able to deduce that the
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dpr51878_computeAliasing.ll15 ; enough to deduce that itself yet.
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/abseil/
H A Dtime-subtraction.rst9 There are two cases of Time subtraction in which deduce additional type
/llvm-project-15.0.7/llvm/test/Transforms/Attributor/
H A Dnosync.ll83 ; TEST 4 - negative, should not deduce nosync
101 ; TEST 5 - negative, should not deduce nosync
131 ; TEST 7 - negative, should not deduce nosync
148 ; TEST 8 - negative, should not deduce nosync
183 ; TEST 10 - negative, should not deduce nosync
200 ; TEST 11 - positive, should deduce nosync
/llvm-project-15.0.7/llvm/test/Transforms/FunctionAttrs/
H A Dnosync.ll127 ; negative, should not deduce nosync
161 ; negative, should not deduce nosync
195 ; negative, should not deduce nosync
/llvm-project-15.0.7/llvm/test/Transforms/Inline/
H A Dcgscc-update.ll19 ; using that can deduce precise function attrs.
152 ; form a new SCC and should use that can deduce precise function attrs.
/llvm-project-15.0.7/llvm/test/Analysis/ValueTracking/
H A Dknown-power-of-two-urem.ll150 ; Cannot deduce induction variable is a power of 2 if it is multiplied by 3.
290 ; Cannot deduce induction variable is a power of 2 for ashr if its starting
324 ; Cannot deduce induction variable is a power of 2 for ashr if its starting
361 ; Cannot deduce induction variable is a power of 2 if the recurrence is not one
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Ddwarfdump-debug-loc-error-cases.s65 # A minimal compile unit is needed to deduce the address size of the location
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch3/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch5/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch4/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch2/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch6/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch1/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
/llvm-project-15.0.7/mlir/test/Examples/Toy/Ch7/
H A Dast.toy18 # arguments and deduce a return type of <2, 2> in initialization of `c`.

12