| /external/clang/test/SemaCXX/ |
| D | cxx0x-initializer-stdinitializerlist.cpp | 102 T deduce(std::initializer_list<T>); // expected-note {{conflicting types for parameter 'T' ('int' v…
107 static_assert(same_type<decltype(deduce({1, 2, 3})), int>::value, "bad deduction"); in argument_deduction()
108 static_assert(same_type<decltype(deduce({1.0, 2.0, 3.0})), double>::value, "bad deduction"); in argument_deduction()
110 deduce({1, 2.0}); // expected-error {{no matching function}} in argument_deduction()
|
| D | attributed-auto-deduction.cpp | 4 void deduce() { in deduce() function
|
| D | decl-microsoft-call-conv.cpp | 254 decltype(auto) deduce(F f) { in deduce() function
263 decltype(signaturehelper(deduce(l))) p; in f()
|
| /external/llvm-project/clang/test/SemaCXX/ |
| D | cxx0x-initializer-stdinitializerlist.cpp | 102 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()
|
| D | attributed-auto-deduction.cpp | 4 void deduce() { in deduce() function
|
| D | decl-microsoft-call-conv.cpp | 254 decltype(auto) deduce(F f) { in deduce() function
263 decltype(signaturehelper(deduce(l))) p; in f()
|
| /external/llvm-project/llvm/test/Other/ |
| D | cgscc-devirt-iteration.ll | 50 ; 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.
|
| /external/llvm-project/llvm/test/Transforms/InstCombine/ |
| D | store-load-unaliased-gep.ll | 5 ; Function below should deduce just to "return length".
|
| D | gep-can-replace-gep-idx-with-zero-typesize.ll | 10 ; If the source element is a scalable vector type, then we cannot deduce whether
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | const_phi.ll | 7 ; constant. However, instcombine can't deduce this, so we can
|
| /external/llvm-project/llvm/test/Transforms/IndVarSimplify/ |
| D | const_phi.ll | 7 ; constant. However, instcombine can't deduce this, so we can
|
| /external/llvm-project/llvm/test/Transforms/GVN/ |
| D | unreachable-predecessor.ll | 3 ; loop.then is not reachable from loop, so we should be able to deduce that the
|
| /external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
| D | abseil-time-subtraction.rst | 9 There are two cases of Time subtraction in which deduce additional type
|
| /external/llvm-project/llvm/test/Transforms/Attributor/ |
| D | nosync.ll | 87 ; TEST 4 - negative, should not deduce nosync
105 ; TEST 5 - negative, should not deduce nosync
135 ; TEST 7 - negative, should not deduce nosync
152 ; TEST 8 - negative, should not deduce nosync
187 ; TEST 10 - negative, should not deduce nosync
204 ; TEST 11 - positive, should deduce nosync
|
| /external/llvm-project/llvm/test/Transforms/Inline/ |
| D | cgscc-update.ll | 19 ; using that can deduce precise function attrs.
152 ; form a new SCC and should use that can deduce precise function attrs.
|
| /external/llvm-project/llvm/test/DebugInfo/X86/ |
| D | dwarfdump-debug-loc-error-cases.s | 65 # A minimal compile unit is needed to deduce the address size of the location
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch5/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch2/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch1/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch6/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch3/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch4/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/llvm-project/mlir/test/Examples/Toy/Ch7/ |
| D | ast.toy | 18 # arguments and deduce a return type of <2, 2> in initialization of `c`.
|
| /external/walt/docs/ |
| D | DragLatency.md | 14 to deduce the delay.
|
| /external/llvm-project/clang/test/SemaOpenCLCXX/ |
| D | address-space-deduction.cl | 21 // We only deduce addr space in type alias in pointer types.
|