/external/clang/test/SemaTemplate/ |
D | undefined-template.cpp | 3 template <class T> struct C1 { struct 21 extern template char C1<int>::s_var_2; argument 22 extern template void C1<int>::s_func_2(); 23 extern template void C1<int>::meth_2(); 24 extern template char C1<int>::s_tvar_2<char>; 25 extern template void C1<int>::s_tfunc_2<char>(); 26 extern template void C1<int>::C2<long>::s_var_2; 27 extern template void C1<int>::C2<long>::s_func_2(); 28 extern template void C1<int>::C2<long>::meth_2(); 29 extern template char C1<int>::C2<long>::s_tvar_2<char>; [all …]
|
/external/llvm-project/clang/test/SemaTemplate/ |
D | undefined-template.cpp | 4 template <class T> struct C1 { struct 22 extern template char C1<int>::s_var_2; argument 23 extern template void C1<int>::s_func_2(); 24 extern template void C1<int>::meth_2(); 25 extern template char C1<int>::s_tvar_2<char>; 26 extern template void C1<int>::s_tfunc_2<char>(); 27 extern template void C1<int>::C2<long>::s_var_2; 28 extern template void C1<int>::C2<long>::s_func_2(); 29 extern template void C1<int>::C2<long>::meth_2(); 30 extern template char C1<int>::C2<long>::s_tvar_2<char>; [all …]
|
/external/llvm-project/libcxx/test/libcxx/debug/containers/ |
D | db_sequence_container_iterators.pass.cpp | 188 Container C1 = makeContainer(3); in EraseIterIter() local 189 iterator it1 = C1.begin(); in EraseIterIter() 190 iterator it1_next = ++C1.begin(); in EraseIterIter() 191 iterator it1_after_next = ++C1.begin(); in EraseIterIter() 193 iterator it1_back = --C1.end(); in EraseIterIter() 196 EXPECT_DEATH( C1.erase(it1_next, it1) ); // bad range in EraseIterIter() 198 C1.erase(it1, it1_after_next); in EraseIterIter() 199 EXPECT_DEATH( C1.erase(it1) ); in EraseIterIter() 200 EXPECT_DEATH( C1.erase(it1_next) ); in EraseIterIter() 202 C1.erase(it1_back); in EraseIterIter() [all …]
|
D | db_string.pass.cpp | 80 Container C1 = makeContainer(N); in PopBack() local 81 iterator it1 = C1.end(); in PopBack() 83 C1.pop_back(); in PopBack() 84 EXPECT_DEATH( C1.erase(it1) ); in PopBack() 85 C1.erase(C1.begin(), C1.end()); in PopBack() 86 assert(C1.size() == 0); in PopBack() 87 …EXPECT_DEATH_MATCHES(DebugInfoMatcher("string::pop_back(): string is already empty"), C1.pop_back(… in PopBack()
|
/external/libcxx/test/libcxx/debug/containers/ |
D | db_sequence_container_iterators.pass.cpp | 180 Container C1 = makeContainer(3); in EraseIterIter() local 181 iterator it1 = C1.begin(); in EraseIterIter() 182 iterator it1_next = ++C1.begin(); in EraseIterIter() 183 iterator it1_after_next = ++C1.begin(); in EraseIterIter() 185 iterator it1_back = --C1.end(); in EraseIterIter() 188 CHECK_DEBUG_THROWS( C1.erase(it1_next, it1) ); // bad range in EraseIterIter() 190 C1.erase(it1, it1_after_next); in EraseIterIter() 191 CHECK_DEBUG_THROWS( C1.erase(it1) ); in EraseIterIter() 192 CHECK_DEBUG_THROWS( C1.erase(it1_next) ); in EraseIterIter() 194 C1.erase(it1_back); in EraseIterIter() [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
D | Row.java | 23 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable, 24 Freezable<Row<C0, C1, C2, C3, C4>>{ 31 public static <C0, C1> R2<C0,C1> of(C0 p0, C1 p1) { in of() 34 public static <C0, C1, C2> R3<C0,C1,C2> of(C0 p0, C1 p1, C2 p2) { in of() 37 public static <C0, C1, C2, C3> R4<C0,C1,C2,C3> of(C0 p0, C1 p1, C2 p2, C3 p3) { in of() 40 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { in of() 47 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> { 48 public R2(C0 a, C1 b) { in R2() 55 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> { 56 public R3(C0 a, C1 b, C2 c) { in R3() [all …]
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
D | Row.java | 19 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable, 20 Freezable<Row<C0, C1, C2, C3, C4>>{ 27 public static <C0, C1> R2<C0,C1> of(C0 p0, C1 p1) { in of() 30 public static <C0, C1, C2> R3<C0,C1,C2> of(C0 p0, C1 p1, C2 p2) { in of() 33 public static <C0, C1, C2, C3> R4<C0,C1,C2,C3> of(C0 p0, C1 p1, C2 p2, C3 p3) { in of() 36 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { in of() 40 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> { 41 public R2(C0 a, C1 b) { in R2() 45 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> { 46 public R3(C0 a, C1 b, C2 c) { in R3() [all …]
|
/external/llvm-project/libcxxabi/test/ |
D | catch_class_03.pass.cpp | 45 struct C1 struct 50 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() function 51 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() argument 52 ~C1() {count--;} in ~C1() argument 55 int C1::count = 0; 70 : C1, C2 74 explicit A(int id) : C1(id-1), C2(id-2), id_(id) {count++;} in A() 75 A(const A& a) : C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 84 assert(C1::count == 0); in f1() 89 assert(C1::count == 1); in f1() [all …]
|
D | catch_class_04.pass.cpp | 45 struct C1 struct 50 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() argument 51 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() argument 52 ~C1() {count--;} in ~C1() argument 55 int C1::count = 0; 70 : C1, C2 74 explicit A(int id) : B(id+3), C1(id-1), C2(id-2), id_(id) {count++;} in A() 75 A(const A& a) : B(a.id_+3), C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 84 assert(C1::count == 0); in f1() 89 assert(C1::count == 1); in f1() [all …]
|
D | catch_ptr.pass.cpp | 45 struct C1 struct 50 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() argument 51 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() function 52 ~C1() {count--;} in ~C1() argument 55 int C1::count = 0; 70 : C1, C2 74 explicit A(int id) : B(id+3), C1(id-1), C2(id-2), id_(id) {count++;} in A() 75 A(const A& a) : B(a.id_+3), C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 99 assert(static_cast<const C1*>(a)->id_ == 4); in f2() 104 catch (const C1*) in f2() [all …]
|
/external/libcxxabi/test/ |
D | catch_class_03.pass.cpp | 40 struct C1 struct 45 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() function 46 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() function 47 ~C1() {count--;} in ~C1() argument 50 int C1::count = 0; 65 : C1, C2 69 explicit A(int id) : C1(id-1), C2(id-2), id_(id) {count++;} in A() 70 A(const A& a) : C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 79 assert(C1::count == 0); in f1() 84 assert(C1::count == 1); in f1() [all …]
|
D | catch_class_04.pass.cpp | 40 struct C1 struct 45 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() argument 46 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() function 47 ~C1() {count--;} in ~C1() argument 50 int C1::count = 0; 65 : C1, C2 69 explicit A(int id) : B(id+3), C1(id-1), C2(id-2), id_(id) {count++;} in A() 70 A(const A& a) : B(a.id_+3), C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 79 assert(C1::count == 0); in f1() 84 assert(C1::count == 1); in f1() [all …]
|
D | catch_ptr.pass.cpp | 40 struct C1 struct 45 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() function 46 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() argument 47 ~C1() {count--;} in ~C1() argument 50 int C1::count = 0; 65 : C1, C2 69 explicit A(int id) : B(id+3), C1(id-1), C2(id-2), id_(id) {count++;} in A() 70 A(const A& a) : B(a.id_+3), C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A() 94 assert(static_cast<const C1*>(a)->id_ == 4); in f2() 99 catch (const C1*) in f2() [all …]
|
/external/llvm/test/Transforms/InstCombine/ |
D | apint-or.ll | 14 ;; If we have: ((V + N) & C1) | (V & C2) 15 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0 17 %C1 = xor i39 274877906943, -1 ;; C2 = 274877906943 20 %B = and i39 %A, %C1 34 %C1 = or i43 %NotA, %NotB 35 ret i43 %C1 37 ; CHECK-NEXT: %C1.demorgan = and i43 %A, %B 38 ; CHECK-NEXT: %C1 = xor i43 %C1.demorgan, -1 39 ; CHECK-NEXT: ret i43 %C1 53 ;; If we have: ((V + N) & C1) | (V & C2) [all …]
|
D | apint-xor2.ll | 9 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0 12 %C1 = xor i447 %A1, %B1 13 ret i447 %C1 47 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2 49 %C1 = xor i1023 %B1, 703687463 50 ret i1023 %C1
|
D | apint-xor1.ll | 8 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0 11 %C1 = xor i47 %A1, %B1 12 ret i47 %C1 46 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2 48 %C1 = xor i47 %B1, 703687463 49 ret i47 %C1
|
/external/llvm-project/clang/test/ASTMerge/class2/Inputs/ |
D | class3.cpp | 1 class C1 { class 3 C1(); 4 ~C1(); 5 C1 *method_1() { in method_1() 8 C1 method_2() { in method_2() 9 return C1(); in method_2() 12 const C1 &ref = C1(); in method_3() 16 class C11 : public C1 {
|
/external/llvm-project/libcxx/test/support/ |
D | container_debug_tests.h | 258 Container C1 = makeContainer(3); 259 iterator i = C1.begin(); 260 Container C2 = C1; 266 C1.erase_after(i); 271 C1.erase(i); 278 Container C1 = makeContainer(3); 279 iterator i = C1.begin(); 280 Container C2 = std::move(C1); 283 EXPECT_DEATH( C1.erase_after(i) ); 286 EXPECT_DEATH( C1.erase(i) ); [all …]
|
/external/llvm-project/clang/test/Parser/ |
D | cxx2a-constrained-template-param.cpp | 6 concept C1 = true; 8 template<C1 T, C1 U = int> 33 concept C1 = true; 35 template<C1 v, C1 u = 0> // expected-error{{expected a type}} // expected-note{{declared here}} 47 concept C1 = true; 49 …template<C1 TT, C1 UU = test1> // expected-error{{use of class template 'test1' requires template …
|
/external/llvm-project/llvm/test/Transforms/AggressiveInstCombine/ |
D | trunc_multi_uses.ll | 22 ; CHECK-NEXT: [[C1:%.*]] = mul i32 [[B1]], [[B1]] 23 ; CHECK-NEXT: [[TMP1:%.*]] = call i32 @use32(i32 [[C1]]) 29 %C1 = mul i64 %B1, %B1 30 %T1 = trunc i64 %C1 to i32 41 ; CHECK-NEXT: [[C1:%.*]] = mul i32 [[B1]], [[B1]] 42 ; CHECK-NEXT: [[TMP1:%.*]] = call i32 @use32(i32 [[C1]]) 48 %C1 = mul i64 %B1, %B1 49 %T1 = trunc i64 %C1 to i32 60 ; CHECK-NEXT: [[C1:%.*]] = mul i32 [[B1]], [[B1]] 61 ; CHECK-NEXT: [[TMP1:%.*]] = call i32 @use32(i32 [[C1]]) [all …]
|
/external/llvm-project/llvm/test/Transforms/InstCombine/ |
D | apint-xor2.ll | 9 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0 12 %C1 = xor i447 %A1, %B1 13 ret i447 %C1 47 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2 49 %C1 = xor i1023 %B1, 703687463 50 ret i1023 %C1
|
D | apint-xor1.ll | 8 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0 11 %C1 = xor i47 %A1, %B1 12 ret i47 %C1 46 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2 48 %C1 = xor i47 %B1, 703687463 49 ret i47 %C1
|
/external/webrtc/rtc_base/ |
D | sigslot_tester.h | 69 template <class A1, class C1> 72 SigslotTester1(sigslot::signal1<A1>* signal, C1* capture1) in SigslotTester1() 86 C1* capture1_; 91 template <class A1, class A2, class C1, class C2> 94 SigslotTester2(sigslot::signal2<A1, A2>* signal, C1* capture1, C2* capture2) in SigslotTester2() 109 C1* capture1_; 115 template <class A1, class A2, class A3, class C1, class C2, class C3> 119 C1* capture1, in SigslotTester3() 140 C1* capture1_; 151 class C1, [all …]
|
/external/llvm-project/llvm/test/TableGen/ |
D | MultiClassInherit.td | 35 class C1<int A, string B> { 41 def T : C1<4, "blah">; 44 def S1 : C1<a1, "foo"> { 48 def S2 : C1<a1, "bar">; 52 def S3 : C1<a2, "foo"> { 56 def S4 : C1<a2, "bar">; 60 def S5 : C1<bs1, "moo"> { 64 def S6 : C1<bs1, "baz">; 70 def S7 : C1<bs3, "moo"> { 74 def S8 : C1<bs3, "baz">; [all …]
|
/external/llvm/test/TableGen/ |
D | MultiClassInherit.td | 35 class C1<int A, string B> { 41 def T : C1<4, "blah">; 44 def S1 : C1<a1, "foo"> { 48 def S2 : C1<a1, "bar">; 52 def S3 : C1<a2, "foo"> { 56 def S4 : C1<a2, "bar">; 60 def S5 : C1<bs1, "moo"> { 64 def S6 : C1<bs1, "baz">; 70 def S7 : C1<bs3, "moo"> { 74 def S8 : C1<bs3, "baz">; [all …]
|