Home
last modified time | relevance | path

Searched refs:C2 (Results 1 – 25 of 767) sorted by relevance

12345678910>>...31

/llvm-project-15.0.7/libcxxabi/test/
H A Dcatch_class_03.pass.cpp49 struct C2 struct
55 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() argument
56 ~C2() {count--;} in ~C2() argument
59 int C2::count = 0;
62 : C1, C2
77 assert(C2::count == 0); in f1()
82 assert(C2::count == 1); in f1()
100 assert(C2::count == 0); in f2()
118 catch (const C2&) in f2()
149 catch (const C2&) in f3()
[all …]
H A Dcatch_class_04.pass.cpp49 struct C2 struct
55 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() argument
56 ~C2() {count--;} in ~C2() argument
59 int C2::count = 0;
62 : C1, C2
77 assert(C2::count == 0); in f1()
82 assert(C2::count == 1); in f1()
116 catch (const C2&) in f2()
146 catch (const C2&) in f3()
199 catch (const C2&) in f5()
[all …]
H A Dcatch_ptr.pass.cpp49 struct C2 struct
54 explicit C2(int id) : B(id-2), id_(id) {count++;} in C2() function
55 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() function
56 ~C2() {count--;} in ~C2() argument
59 int C2::count = 0;
62 : C1, C2
92 assert(static_cast<const C2*>(a)->id_ == 3); in f2()
100 catch (const C2*) in f2()
126 catch (const C2*) in f3()
139 catch (const C2* c2) // can catch C2 in f4()
[all …]
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dundefined-template.cpp13 template<typename T1> struct C2 { struct
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();
94 return C1<int>::C2<long>::s_var_2; in func_14()
103 C1<int>::C2<long>::s_func_2(); in func_16()
111 void func_18(C1<int>::C2<long> *x) { in func_18()
115 void func_19(C1<int>::C2<char> *x) { in func_19()
121 return C1<int>::C2<long>::s_tvar_2<char>; in func_20()
129 void func_22(C1<int>::C2<long> *x) { in func_22()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DPettisAndHansen.cpp36 return Lhs.C1 == Rhs.C1 && Lhs.C2 == Rhs.C2; in operator ==()
40 Cluster *const C2; member in llvm::bolt::__anon7e5cf51d0111::ClusterArc
89 C2->reverseTargets(); in orderFuncs()
92 C2->reverseTargets(); in orderFuncs()
156 Cluster *const C2 = Max.C2; in pettisAndHansen() local
166 orderFuncs(Cg, C1, C2); in pettisAndHansen()
176 if (Carc.C1 == C2) in pettisAndHansen()
178 if (Carc.C2 == C2) in pettisAndHansen()
192 for (NodeId F : C2->targets()) in pettisAndHansen()
195 C1->merge(*C2, Max.Weight); in pettisAndHansen()
[all …]
/llvm-project-15.0.7/compiler-rt/test/fuzzer/
H A Dmerge-sigusr.test10 RUN: echo a > %t/C2/a
11 RUN: echo b > %t/C2/b
12 RUN: echo c > %t/C2/c
13 RUN: echo d > %t/C2/d
14 RUN: echo e > %t/C2/e
15 RUN: echo f > %t/C2/f
16 RUN: echo g > %t/C2/g
17 RUN: echo h > %t/C2/g
18 RUN: echo i > %t/C2/g
19 RUN: echo j > %t/C2/g
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Vector/
H A Dvector-transfer-unroll.mlir5 // CHECK-DAG: %[[C2:.*]] = arith.constant 2 : index
13 // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read {{.*}}[%[[C2]], %[[C2]]], %{{.*}} : memref<4x…
26 // ORDER-NEXT: %[[VTR3:.*]] = vector.transfer_read {{.*}}[%[[C2]], %[[C2]]], %{{.*}} : memref<4x…
47 // CHECK-NEXT: vector.transfer_write %[[S3]], {{.*}}[%[[C2]], %[[C2]]] {{.*}} : vector<2x2xf32>,…
60 // ORDER-NEXT: vector.transfer_write %[[S3]], {{.*}}[%[[C2]], %[[C2]]] {{.*}} : vector<2x2xf32>,…
75 // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read {{.*}}[%[[C2]], %[[C2]]], %{{.*}} : memref<4x…
79 // CHECK-NEXT: vector.transfer_write %[[VTR3]], {{.*}}[%[[C2]], %[[C2]]] {{.*}} : vector<2x2xf32…
99 // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read {{.*}}[%[[C2]], %[[C2]]], %{{.*}} : tensor<4x…
120 // CHECK-NEXT: %[[VTW3:.*]] = vector.transfer_write %[[S3]], %[[VTW2]][%[[C2]], %[[C2]]] {{.*}} …
137 // CHECK-NEXT: %[[VTR3:.*]] = vector.transfer_read {{.*}}[%[[C2]], %[[C2]]], %{{.*}} : tensor<4x…
[all …]
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dnested-name-spec.cpp28 class C2 { class
42 void C2::m() { in m()
326 typedef int C2; typedef
341 struct S1a { int f(C1::C2); };
345 C1::C2 f(C1::C2);
348 C1::C2 f(C1:C2); // expected-error{{unexpected ':' in nested name specifier; did you mean '::'?}}
352 int f(C1::C2), C2 : N1; member
361 int f[C2::N1];
379 C1::C2 m1 : B1::B2;
385 int C2:N1; member
[all …]
/llvm-project-15.0.7/libcxx/test/support/
H A Dcontainer_debug_tests.h255 Container C2 = C1;
279 C2.erase_after(i);
282 C2.erase(i);
293 Container C2 = C1;
295 EXPECT_DEATH( C2.erase(C2.end()) ); // erase with end
308 Container C2 = C1;
309 iterator it2 = C2.begin();
315 C2.erase(it2, it2_next);
324 iterator it2 = C2.begin();
325 swap(C1, C2);
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/debug/containers/
H A Dsequence_container_iterators.pass.cpp96 Container C2; in SpliceFirstElem() local
97 C2.splice(C2.end(), C, C.begin(), ++C.begin()); in SpliceFirstElem()
101 Container C2; in SpliceFirstElem() local
102 C2.splice(C2.end(), C, C.begin()); in SpliceFirstElem()
117 Container C2; in SpliceFirstElemAfter() local
118 C2.splice_after(C2.begin(), C, C.begin(), ++C.begin()); in SpliceFirstElemAfter()
122 Container C2; in SpliceFirstElemAfter() local
123 C2.splice_after(C2.begin(), C, C.begin()); in SpliceFirstElemAfter()
233 Container C2 = C1; in InsertIterValue() local
258 Container C2 = C1; in EmplaceIterValue() local
[all …]
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dmangle-ms-md5.cpp4 #define C2(P1, P2) C_(P1, P2) macro
5 #define C4(P1, P2, P3, P4) C2(C2(P1, P2), C2(P3, P4))
7 #define X2(X) C2(X, X)
21 C2(C2( \
56 C2(C2( \
67 C2(C2( \
H A Dvtable-layout-extreme.cpp15 class C2 class
24 , public C2
32 : public C2
41 , public C2
61 , virtual public C2
72 , public C2
198 , public C2
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dcmp.ll9 %1 = call i32 @llvm.hexagon.C2.cmpeq(i32 %0, i32 1)
15 declare i32 @llvm.hexagon.C2.cmpeq(i32, i32) #1
23 %1 = call i32 @llvm.hexagon.C2.cmpgt(i32 %0, i32 2)
29 declare i32 @llvm.hexagon.C2.cmpgt(i32, i32) #1
43 declare i32 @llvm.hexagon.C2.cmpgtu(i32, i32) #1
57 declare i32 @llvm.hexagon.C2.cmplt(i32, i32) #1
71 declare i32 @llvm.hexagon.C2.cmpltu(i32, i32) #1
85 declare i32 @llvm.hexagon.C2.cmpeqi(i32, i32) #1
99 declare i32 @llvm.hexagon.C2.cmpgti(i32, i32) #1
113 declare i32 @llvm.hexagon.C2.cmpgtui(i32, i32) #1
[all …]
/llvm-project-15.0.7/clang/test/Parser/
H A Dcxx2a-constrained-template-param-with-partial-id.cpp17 concept C2 = true;
20 template<ns::C2 T1, ::ns::C2 T2>
25 template<ns::C2<int> T1, ::ns::C2<char, T1> T2>
31 template<ns::C2... T1>
35 template<ns::C2<int>... T1>
/llvm-project-15.0.7/clang/test/CXX/class/class.compare/class.compare.default/
H A Dp2.cpp83 union C2 { union
86 bool operator==(const C2&) const;
87 bool operator!=(const C2&) const = default;
89 bool operator<=>(const C2&) const;
90 bool operator<(const C2&) const = default;
91 bool operator<=(const C2&) const = default;
92 bool operator>(const C2&) const = default;
93 bool operator>=(const C2&) const = default;
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dapint-or.ll14 ;; 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
41 ;; If we have: ((V + N) & C1) | (V & C2)
42 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
44 %C1 = xor i399 274877906943, -1 ;; C2 = 274877906943
H A Dapint-xor1.ll8 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
46 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
H A Dapint-xor2.ll9 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
47 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/readability/
H A Dcontainer-contains.cpp43 auto C2 = static_cast<bool>(MyMap.count(1)); in testDifferentCheckTypes() local
58 return C1 + C2 + C3 + C4 + C5 + C6; in testDifferentCheckTypes()
66 auto C2 = MyMap.count(-2) == 0; in testNegativeChecks() local
78 return C1 + C2 + C3 + C4 + C5; in testNegativeChecks()
86 bool C2 = US.count(1002); in testDifferentTypes() local
95 return C1 + C2 + C3 + C4; in testDifferentTypes()
103 bool C2 = RefM.count(2002); in testQualifiedTypes() local
112 return C1 + C2 + C3 + C4; in testQualifiedTypes()
159 bool C2 = MyMap.count(2) < 0; in nonRewrittenCount() local
175 return C1 + C2 + C3 + C4; in nonRewrittenCount()
/llvm-project-15.0.7/clang/test/CXX/temp/temp.constr/temp.constr.normal/
H A Dp1.cpp25 concept C2 = C1<A, B...>;
28 constexpr void foo() requires C2<T, char, T> { } in foo()
44 concept C2 = C1<A, B...>;
47 constexpr void foo() requires C2<T, S1, T> { } in foo()
60 concept C2 = C1<A, B...>;
63 constexpr void foo() requires C2<T, 2, T> { } in foo()
92 template<class T> concept C2 = C1<typename T::template Y<1>::type>;
95 template<class T> requires C1<T> && C2<T> void t1() = delete; // expected-note {{candidate function…
100 template<class T> requires C2<T> void t2() {}; // expected-note 2 {{candidate function}} in t2()
/llvm-project-15.0.7/clang/test/CXX/temp/temp.constr/temp.constr.order/
H A Dclass-template-partial-specializations.cpp22 concept C2 = sizeof(T) > 1 && sizeof(T) <= 8;
45 template<typename T> requires C1<T> && C2<T>
48 template<typename T> requires C1<T> || C2<T>
58 template<typename T, typename U> requires C2<T>
61 template<typename T, typename U> requires C2<U>
64 template<typename T, typename U> requires C2<T> && C2<U>
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/GlobalISel/
H A Dcombine-udiv.mir12 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s32) = G_CONSTANT i32 2
15 ; CHECK-NEXT: [[LSHR1:%[0-9]+]]:_(s32) = G_LSHR [[UMULH]], [[C2]](s32)
42 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s16) = G_CONSTANT i16 1
43 …<8 x s16>) = G_BUILD_VECTOR [[C2]](s16), [[C2]](s16), [[C2]](s16), [[C2]](s16), [[C2]](s16), [[C2]…
73 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s16) = G_CONSTANT i16 -23
141 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s16) = G_CONSTANT i16 36
203 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s16) = G_CONSTANT i16 25
268 ; CHECK-NEXT: [[C2:%[0-9]+]]:_(s8) = G_CONSTANT i8 0
271C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2
272C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2]](s8), [[C2
[all …]
/llvm-project-15.0.7/llvm/test/Linker/
H A Dalias.ll2 ; RUN: llvm-link %S/Inputs/alias.ll %s -S -o - | FileCheck --check-prefix=C2 %s
7 ; (the C2 case), the IRMover knows to copy the aliasee as internal.
18 ; C2-DAG: @foo = alias i32, i32* @zed
23 ; C2-DAG: @foo.1 = internal global i32 0
24 ; C2-DAG: @bar = alias i32, i32* @foo.1
28 ; C2-DAG: @foo2 = alias i16, bitcast (i32* @zed to i16*)
33 ; C2-DAG: @foo2.2 = internal global i32 0
34 ; C2-DAG: @bar2 = alias i32, i32* @foo2.2
37 ; C2-DAG: @zed = global i32 42
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/intrinsics/
H A Dcr.ll23 declare i32 @llvm.hexagon.C2.any8(i32)
25 %z = call [email protected].C2.any8(i32 %a)
30 declare i32 @llvm.hexagon.C2.all8(i32)
32 %z = call [email protected].C2.all8(i32 %a)
39 declare i32 @llvm.hexagon.C2.and(i32, i32)
53 declare i32 @llvm.hexagon.C2.or(i32, i32)
67 declare i32 @llvm.hexagon.C2.xor(i32, i32)
81 declare i32 @llvm.hexagon.C2.andn(i32, i32)
109 declare i32 @llvm.hexagon.C2.not(i32)
111 %z = call [email protected].C2.not(i32 %a)
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-reduce/deltas/
H A DDelta.h41 friend bool operator!=(const Chunk &C1, const Chunk &C2) {
42 return C1.Begin != C2.Begin || C1.End != C2.End;
46 friend bool operator<(const Chunk &C1, const Chunk &C2) {
47 return std::tie(C1.Begin, C1.End) < std::tie(C2.Begin, C2.End);

12345678910>>...31