Home
last modified time | relevance | path

Searched refs:N3 (Results 1 – 25 of 57) sorted by relevance

123

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp96 DGTestNode N1, N2, N3; in TEST() local
141 DGTestNode N1, N2, N3; in TEST() local
145 DG.addNode(N3); in TEST()
147 DG.connect(N2, N3, E3); in TEST()
148 DG.connect(N3, N1, E1); in TEST()
187 DGTestNode N1, N2, N3; in TEST() local
191 DG.addNode(N3); in TEST()
193 DG.connect(N2, N3, E3); in TEST()
211 DGTestNode N1, N2, N3; in TEST() local
215 DG.addNode(N3); in TEST()
[all …]
/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dinstantiate-expr-2.cpp19 namespace N3 { namespace
38 namespace N3 { namespace
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ; in test_bin_op_overload()
53 namespace N3 { namespace
54 eight_bytes operator-(::N3::Z);
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ; in test_unary_op_overload()
H A Dinstantiate-call.cpp23 namespace N3 { namespace
33 template struct N3::call_f0<int, char&>; // expected-note{{instantiation}}
34 template struct N3::call_f0<N1::X0, int&>;
48 template struct N3::call_f0<int, short&>; // expected-note{{instantiation}}
H A Dinstantiate-expr-3.cpp36 namespace N3 { namespace
44 template struct N2::PlusEquals0<N3::Y, long, short&>;
46 template struct N2::PlusEquals0<N3::Y, int, short&>; // expected-note{{instantiation}}
/llvm-project-15.0.7/llvm/test/Transforms/SLPVectorizer/X86/
H A Dreorder_with_reordered_users.ll10 ; (N1)OrderA (N2)OrderA (N3)NoOrder
14 ; 1. Phi is visited along with its operands (N1,N2,N3). BestOrder is "OrderA".
15 ; 2. Phi along with all its operands (N1,N2,N3) are reordered. The result is:
19 ; (N1)NoOrder (N2)NoOrder (N3)OrderA
23 ; 3. N3 is now visited along with its operand N4. BestOrder is "OrderB".
24 ; 4. N3 and N4 are reordered. The result is this:
28 ; (N1)NoOrder (N2)NoOrder (N3)OrderB
33 ; reordered based on OrderA and N3's OrderB. This results in a crash in
34 ; vectorizeTree() on its way from N3 back to the Phi. The reason is that
35 ; N3->isSame(Phi's operand 2) returns false and vectorizeTree() skips N3.
/llvm-project-15.0.7/clang/test/CodeCompletion/
H A Dusing.cpp2 namespace N3 { } namespace
5 class N3;
14 int N3; local
H A Dusing-namespace.cpp2 namespace N3 { } namespace
5 class N3;
H A Dnamespace-alias.cpp2 namespace N3 { } namespace
5 class N3;
H A Dnamespace.cpp1 namespace N3 { namespace
/llvm-project-15.0.7/clang/test/ASTMerge/namespace/Inputs/
H A Dnamespace1.cpp15 namespace N3 { namespace
19 namespace AliasWithSameName = N3;
H A Dnamespace2.cpp15 namespace N3 { namespace
/llvm-project-15.0.7/clang/test/PCH/
H A Dnamespaces.cpp27 namespace N3 { namespace
33 N3::C *cp2;
/llvm-project-15.0.7/clang/test/Modules/
H A Dnamespaces.cpp26 int &ir3 = N3::f(1); in test()
35 double &dr2 = N3::f(1.0); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dranges_partition_copy.pass.cpp122 template <class Iter, class Sent, class OutIter1, class OutIter2, size_t N1, size_t N2, size_t N3, …
124 std::array<int, N3> expected_false) { in test_one()
125 static_assert(N2 + N3 == N1); in test_one()
133 std::array<int, N3> out2; in test_one()
149 std::array<int, N3> out2; in test_one()
/llvm-project-15.0.7/llvm/unittests/DebugInfo/PDB/
H A DHashTableTest.cpp105 uint32_t N3 = 2 * N1; in TEST() local
110 Table.set_as(N3, 13, Traits); in TEST()
114 ASSERT_NE(Table.end(), Table.find_as(N3, Traits)); in TEST()
118 EXPECT_EQ(13u, Table.get(N3, Traits)); in TEST()
/llvm-project-15.0.7/llvm/test/TableGen/GICombinerEmitter/
H A Dparse-match-pattern.td109 // CHECK-NEXT: Node[[N3:(0x)?[0-9a-fA-F]+]] [shape=record,label="{{[{]{}}<s0>#0 $dst|<s1>#1 $src1…
111 // CHECK-NEXT: Node[[N3]]:s1:n -> Node[[N1]]:d0:s [label="$s"]
118 // CHECK-NEXT: Node[[N3]]:e -> Pred[[P3]]:d1:s [style=dotted]
120 // CHECK-NEXT: Node[[N3]]:s1:n -> Pred[[P4]]:d2:s [style=dotted]
153 // CHECK-NEXT: Node[[N3:(0x)?[0-9a-fA-F]+]] [shape=record,label="{{[{]{}}<s0>#0 $dst|<s1>#1 $src1…
155 // CHECK-NEXT: Node[[N3]]:s1:n -> Node[[N1]]:d0:s [label="$s",dir=back,arrowtail=crow]
162 // CHECK-NEXT: Node[[N3]]:e -> Pred[[P3]]:d1:s [style=dotted]
164 // CHECK-NEXT: Node[[N3]]:s1:n -> Pred[[P4]]:d2:s [style=dotted]
/llvm-project-15.0.7/clang/test/Modules/Inputs/
H A Dnamespaces-top.h9 namespace N3 {
H A Dnamespaces-right.h22 namespace N3 {
/llvm-project-15.0.7/clang/test/CXX/basic/basic.lookup/basic.lookup.argdep/
H A Dp2-template-id.cpp13 namespace N3 { namespace
/llvm-project-15.0.7/llvm/test/Analysis/DDG/
H A Dbasic-a.ll20 ; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
36 ; CHECK: Node Address:[[N3]]:multi-instruction
106 ; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
131 ; CHECK: Node Address:[[N3]]:multi-instruction
H A Dbasic-b.ll11 ; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
13 ; CHECK: Node Address:[[N3]]:single-instruction
115 ; CHECK-NEXT: [def-use] to [[N3:0x[0-9a-f]*]]
117 ; CHECK: Node Address:[[N3]]:single-instruction
/llvm-project-15.0.7/clang/test/PCH/Inputs/
H A Dnamespaces.h28 namespace N3 {
/llvm-project-15.0.7/llvm/unittests/IR/
H A DMDBuilderTest.cpp87 MDNode *N3 = MDHelper.createTBAANode("Node", R); in TEST_F() local
88 EXPECT_EQ(N0, N3); in TEST_F()
/llvm-project-15.0.7/clang/test/Parser/
H A Dusing-template.cpp30 namespace N3 { namespace
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dranges_set_symmetric_difference.pass.cpp100 template <class In1, class In2, class Out, std::size_t N1, std::size_t N2, std::size_t N3>
102 testSetSymmetricDifferenceImpl(std::array<int, N1> in1, std::array<int, N2> in2, std::array<int, N3… in testSetSymmetricDifferenceImpl()
112 std::array<int, N3> out; in testSetSymmetricDifferenceImpl()
129 std::array<int, N3> out; in testSetSymmetricDifferenceImpl()

123