Home
last modified time | relevance | path

Searched refs:C1 (Results 1 – 25 of 980) sorted by relevance

12345678910>>...40

/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dundefined-template.cpp4 template <class T> struct C1 { struct
22 extern template char C1<int>::s_var_2; argument
34 return C1<int>::s_var_2; in func_01()
53 C1<int>::s_func_2(); in func_05()
61 void func_07(C1<int> *x) { in func_07()
66 void func_08(C1<int> *x) { in func_08()
70 void func_09(C1<char> *x) { in func_09()
76 return C1<int>::s_tvar_2<char>; in func_10()
85 C1<int>::s_tfunc_2<char>(); in func_12()
94 return C1<int>::C2<long>::s_var_2; in func_14()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/debug/containers/
H A Dsequence_container_iterators.pass.cpp198 C1.erase(it1_back); in EraseIterIter()
209 C1.pop_back(); in PopBack()
211 C1.erase(C1.begin()); in PopBack()
212 assert(C1.size() == 0); in PopBack()
220 C1.pop_front(); in PopFront()
222 C1.erase(C1.begin()); in PopFront()
223 assert(C1.size() == 0); in PopFront()
233 Container C2 = C1; in InsertIterValue()
258 Container C2 = C1; in EmplaceIterValue()
278 Container C2 = C1; in InsertIterSizeValue()
[all …]
H A Dstring.pass.cpp76 Container C1 = makeContainer(N); in PopBack() local
77 iterator it1 = C1.end(); in PopBack()
79 C1.pop_back(); in PopBack()
80 EXPECT_DEATH( C1.erase(it1) ); in PopBack()
81 C1.erase(C1.begin(), C1.end()); in PopBack()
82 assert(C1.size() == 0); in PopBack()
83 TEST_LIBCPP_ASSERT_FAILURE(C1.pop_back(), "string::pop_back(): string is already empty"); in PopBack()
/llvm-project-15.0.7/libcxxabi/test/
H A Dcatch_class_03.pass.cpp37 struct C1 struct
43 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() function
44 ~C1() {count--;} in ~C1() argument
47 int C1::count = 0;
62 : C1, C2
76 assert(C1::count == 0); in f1()
81 assert(C1::count == 1); in f1()
99 assert(C1::count == 0); in f2()
114 catch (const C1&) in f2()
176 catch (const C1&) in f4()
[all …]
H A Dcatch_class_04.pass.cpp37 struct C1 struct
43 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() argument
44 ~C1() {count--;} in ~C1() argument
47 int C1::count = 0;
62 : C1, C2
76 assert(C1::count == 0); in f1()
81 assert(C1::count == 1); in f1()
112 catch (const C1&) in f2()
142 catch (const C1& c1) in f3()
172 catch (const C1&) in f4()
[all …]
H A Dcatch_ptr.pass.cpp37 struct C1 struct
42 explicit C1(int id) : B(id-2), id_(id) {count++;} in C1() argument
43 C1(const C1& a) : B(a.id_-2), id_(a.id_) {count++;} in C1() argument
44 ~C1() {count--;} in ~C1() argument
47 int C1::count = 0;
62 : C1, C2
91 assert(static_cast<const C1*>(a)->id_ == 4); in f2()
96 catch (const C1*) in f2()
122 catch (const C1* c1) in f3()
148 catch (const C1*) in f4()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DPettisAndHansen.cpp36 return Lhs.C1 == Rhs.C1 && Lhs.C2 == Rhs.C2; in operator ==()
39 Cluster *const C1; member in llvm::bolt::__anon7e5cf51d0111::ClusterArc
56 NodeId C1tail = C1->targets().back(); in orderFuncs()
85 C1->reverseTargets(); in orderFuncs()
88 C1->reverseTargets(); in orderFuncs()
155 Cluster *const C1 = Max.C1; in pettisAndHansen() local
161 if (C1->frozen() || C2->frozen()) in pettisAndHansen()
166 orderFuncs(Cg, C1, C2); in pettisAndHansen()
176 if (Carc.C1 == C2) in pettisAndHansen()
193 FuncCluster[F] = C1; in pettisAndHansen()
[all …]
/llvm-project-15.0.7/libcxx/test/support/
H A Dcontainer_debug_tests.h254 iterator i = C1.begin();
255 Container C2 = C1;
261 C1.erase_after(i);
266 C1.erase(i);
274 iterator i = C1.begin();
293 Container C2 = C1;
296 C1.erase(it1_next);
298 C1.erase(it1);
308 Container C2 = C1;
325 swap(C1, C2);
[all …]
/llvm-project-15.0.7/clang/test/ASTMerge/class2/Inputs/
H A Dclass3.cpp1 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 {
/llvm-project-15.0.7/clang/test/CXX/temp/temp.constr/temp.constr.normal/
H A Dp1.cpp22 concept C1 = ((sizeof(Args) >= 0) && ...);
25 concept C2 = C1<A, B...>;
31 constexpr void foo() requires C1<T, char, T> && true { } in foo()
41 concept C1 = ((sizeof(Args<int>) >= 0) && ...);
44 concept C2 = C1<A, B...>;
50 constexpr void foo() requires C1<T, S1, T> && true { } in foo()
57 concept C1 = ((Args >= 0) && ...);
60 concept C2 = C1<A, B...>;
66 constexpr void foo() requires C1<T, 2, T> && true { } in foo()
91 template<class T> concept C1 = sizeof(T) != 0;
[all …]
/llvm-project-15.0.7/clang/test/Parser/
H A Dcxx2a-constrained-template-param.cpp6 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 …
/llvm-project-15.0.7/llvm/test/Transforms/AggressiveInstCombine/
H A Dtrunc_multi_uses.ll28 %C1 = mul i64 %B1, %B1
29 %T1 = trunc i64 %C1 to i32
47 %C1 = mul i64 %B1, %B1
48 %T1 = trunc i64 %C1 to i32
66 %C1 = mul i64 %B1, %B1
67 %T1 = trunc i64 %C1 to i32
85 %C1 = mul i64 %B1, %B1
86 %T1 = trunc i64 %C1 to i32
107 %C1 = mul i64 %B1, %B1
237 %C1 = mul i64 %B1, %B1
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dapint-xor1.ll8 ;; (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
H A Dapint-xor2.ll9 ;; (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
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/readability/
H A Dcontainer-contains.cpp40 bool C1 = MyMap.count(1); in testDifferentCheckTypes() local
63 bool C1 = !MyMap.count(-1); in testNegativeChecks() local
78 return C1 + C2 + C3 + C4 + C5; in testNegativeChecks()
83 bool C1 = M.count(1001); in testDifferentTypes() local
95 return C1 + C2 + C3 + C4; in testDifferentTypes()
100 bool C1 = ValueM.count(2001); in testQualifiedTypes() local
112 return C1 + C2 + C3 + C4; in testQualifiedTypes()
134 bool C1 = MyMap.count(99); in typeAliases() local
137 return C1; in typeAliases()
153 bool C1 = MyMap.count(1) >= 2; in nonRewrittenCount() local
[all …]
/llvm-project-15.0.7/llvm/test/TableGen/
H A DMultiClassInherit.td35 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 …]
H A DDefmInherit.td10 class C1<int A, string B> {
16 def T : C1<4, "blah">;
19 def S1 : C1<a, "foo"> {
23 def S2 : C1<a, "bar">;
27 def S3 : C1<a, "moo"> {
31 def S4 : C1<a, "baz">;
36 def T4 : C1<6, "foo">;
/llvm-project-15.0.7/clang/test/CXX/temp/temp.decls/temp.class.spec/
H A Dp9.cpp5 template<char C1, char C2>
10 template<int C1>
11 struct X<C1, C1> {
22 template<unsigned char C1, unsigned char C3>
23 struct int_values<C1, 12, C3> {
/llvm-project-15.0.7/clang/test/CXX/temp/temp.constr/temp.constr.order/
H A Dvar-template-partial-specializations.cpp12 concept C1 = sizeof(T) >= 4;
14 template<typename T> requires C1<T>
17 template<typename T> requires (C1<T> && sizeof(T) <= 10)
26 template<typename T> requires C1<T>
35 template<typename T> requires C1<T>
44 template<typename T> requires C1<T> && C2<T>
47 template<typename T> requires C1<T> || C2<T>
H A Dclass-template-partial-specializations.cpp13 concept C1 = sizeof(T) >= 4;
15 template<typename T> requires C1<T>
18 template<typename T> requires (C1<T> && sizeof(T) <= 10)
27 template<typename T> requires C1<T>
36 template<typename T> requires C1<T> // expected-note{{previous template declaration is here}}
45 template<typename T> requires C1<T> && C2<T>
48 template<typename T> requires C1<T> || C2<T>
/llvm-project-15.0.7/llvm/test/tools/llvm-dwarfdump/X86/
H A Ddebug_line_short_prologue_v4.s8 # RUN: llvm-dwarfdump -debug-line %t1 2>&1 | FileCheck %s --check-prefixes=ALL,C1
11 # RUN: llvm-dwarfdump -debug-line %t2 2>&1 | FileCheck %s --check-prefixes=ALL,C1
14 # RUN: llvm-dwarfdump -debug-line %t3 2>&1 | FileCheck %s --check-prefixes=ALL,C1
17 # RUN: llvm-dwarfdump -debug-line %t4 2>&1 | FileCheck %s --check-prefixes=ALL,C1
29 # C1-NEXT: warning: file names table was not null terminated before the end of the prologue
30 # C1: include_directories[ 2] = "dir2"
31 # C1-NEXT: file_names[ 1]:
32 # C1-NEXT: name: "file1"
33 # C1-NEXT: dir_index: 1
34 # C1-NEXT: mod_time: 0x00000002
[all …]
/llvm-project-15.0.7/llvm/lib/IR/
H A DConstantFold.cpp886 return C1; in ConstantFoldBinaryInstruction()
912 return C1; in ConstantFoldBinaryInstruction()
917 return C1; in ConstantFoldBinaryInstruction()
935 return C1; in ConstantFoldBinaryInstruction()
948 return C1; in ConstantFoldBinaryInstruction()
956 return C1; in ConstantFoldBinaryInstruction()
965 return C1; in ConstantFoldBinaryInstruction()
975 return C1; in ConstantFoldBinaryInstruction()
989 return C1; in ConstantFoldBinaryInstruction()
1288 return C1; in ConstantFoldBinaryInstruction()
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Utility/
H A DIterable.h113 template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
114 friend AdaptedConstIterator<C1, E1, A1>
115 operator+(typename C1::const_iterator::difference_type,
116 AdaptedConstIterator<C1, E1, A1> &);
118 template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
119 friend typename C1::const_iterator::difference_type
120 operator-(AdaptedConstIterator<C1, E1, A1> &,
121 AdaptedConstIterator<C1, E1, A1> &);
123 template <typename C1, typename E1, E1 (*A1)(typename C1::const_iterator &)>
124 friend void swap(AdaptedConstIterator<C1, E1, A1> &,
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/
H A Dcmp_of_min_max.ll16 ; CHECK-NEXT: [[C1:%.*]] = icmp ugt i32 [[N:%.*]], 10
17 ; CHECK-NEXT: ret i1 [[C1]]
27 ; CHECK-NEXT: [[C1:%.*]] = icmp ugt i32 [[N:%.*]], 10
50 ; CHECK-NEXT: [[C1:%.*]] = icmp ult i32 [[N:%.*]], 10
51 ; CHECK-NEXT: ret i1 [[C1]]
61 ; CHECK-NEXT: [[C1:%.*]] = icmp ult i32 [[N:%.*]], 10
84 ; CHECK-NEXT: [[C1:%.*]] = icmp sgt i32 [[N:%.*]], -10
85 ; CHECK-NEXT: ret i1 [[C1]]
118 ; CHECK-NEXT: [[C1:%.*]] = icmp slt i32 [[N:%.*]], 10
119 ; CHECK-NEXT: ret i1 [[C1]]
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/GlobalISel/
H A Dcombine-udiv.mir11 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s32) = G_CONSTANT i32 818089009
14 ; CHECK-NEXT: [[UMULH:%[0-9]+]]:_(s32) = G_UMULH [[LSHR]], [[C1]]
37 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s16) = G_CONSTANT i16 4
39 …<8 x s16>) = G_BUILD_VECTOR [[C1]](s16), [[C1]](s16), [[C1]](s16), [[C1]](s16), [[C1]](s16), [[C1]…
72 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s16) = G_CONSTANT i16 34
140 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s16) = G_CONSTANT i16 35
202 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s16) = G_CONSTANT i16 23
266 ; CHECK-NEXT: [[C1:%[0-9]+]]:_(s8) = G_CONSTANT i8 1
267 …C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1…
275 …C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1]](s8), [[C1…
[all …]

12345678910>>...40