Home
last modified time | relevance | path

Searched refs:N4 (Results 1 – 24 of 24) sorted by relevance

/llvm-project-15.0.7/clang/test/SemaTemplate/
H A Dinstantiate-expr-2.cpp25 namespace N4 { namespace
43 typedef N4::BinOpOverload<N1::X, N2::Y>::type XY; in test_bin_op_overload()
45 typedef N4::BinOpOverload<N1::X, N1::X>::type XX; in test_bin_op_overload()
47 typedef N4::BinOpOverload<N2::Y, N2::Y>::type YY; in test_bin_op_overload()
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ; in test_bin_op_overload()
57 namespace N4 { namespace
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ; in test_unary_op_overload()
H A Dinstantiate-call.cpp37 namespace N4 { namespace
46 template struct N4::call_f0<int, short&>;
47 template struct N4::call_f0<N1::X0, int&>;
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DDirectedGraphTest.cpp129 DGTestNode N4; in TEST() local
130 EXPECT_EQ(DG.findNode(N4), DG.end()); in TEST()
249 DGTestNode N1, N2, N3, N4; in TEST() local
250 DGTestEdge E1(N1), E2(N2), E3(N3), E4(N4); in TEST()
254 DG.addNode(N4); in TEST()
258 DG.connect(N3, N4, E4); in TEST()
282 EXPECT_TRUE(SCC.count(&N4) == 1); in TEST()
291 EXPECT_TRUE(SCC.count(&N4) == 0); in TEST()
/llvm-project-15.0.7/llvm/test/Transforms/SLPVectorizer/X86/
H A Dreorder_with_reordered_users.ll8 ; (N4)OrderB
17 ; (N4)OrderB
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:
26 ; (N4)NoOrder
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dxcore-stringtype.c135 struct SB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
164 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4; member
/llvm-project-15.0.7/clang/test/CodeCompletion/
H A Dusing-namespace.cpp1 namespace N4 { namespace
H A Dnamespace-alias.cpp1 namespace N4 { namespace
H A Dusing.cpp1 namespace N4 { namespace
/llvm-project-15.0.7/llvm/test/Analysis/DDG/
H A Dbasic-a.ll21 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
30 ; CHECK: Node Address:[[N4]]:single-instruction
107 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
123 ; CHECK: Node Address:[[N4]]:multi-instruction
H A Dbasic-b.ll20 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
44 ; CHECK: Node Address:[[N4]]:multi-instruction
124 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
150 ; CHECK: Node Address:[[N4]]:multi-instruction
H A Dbasic-loopnest.ll21 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
89 ; CHECK-NEXT: [def-use] to [[N4]]
91 ; CHECK: Node Address:[[N4]]:multi-instruction
217 ; CHECK-NEXT: [def-use] to [[N4:0x[0-9a-f]*]]
221 ; CHECK: Node Address:[[N4]]:single-instruction
/llvm-project-15.0.7/clang/test/PCH/Inputs/
H A Dnamespaces.h42 inline namespace N4 {
/llvm-project-15.0.7/clang/test/Parser/
H A Dusing-template.cpp39 namespace N4 { namespace
/llvm-project-15.0.7/clang/test/PCH/
H A Dnamespaces.cpp44 inline namespace N4 { } namespace
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/
H A Dunhandled-exception-at-new.cpp138 ClassSpecificNew *N4 = new (1, 2, 3) ClassSpecificNew; in f_class_specific() local
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dbitfield.cpp284 namespace N4 { namespace
H A Dreferences.cpp250 namespace N4 { namespace
/llvm-project-15.0.7/llvm/test/TableGen/GICombinerEmitter/
H A Dmatch-tree.td91 // CHECK-DAG: Node[[N4:(0x)?[0-9a-fA-F]+]] [shape=record,label="{No partitioner|Rule5}"]
124 // CHECK-DAG: Node[[N2]] -> Node[[N4]] [label="#1 * or nullptr"]
/llvm-project-15.0.7/mlir/test/Dialect/Math/
H A Dpolynomial-approximation.mlir518 // CHECK-DAG: %[[N4:.+]] = arith.constant 1.00209987
526 // CHECK-DAG: %[[P2:.+]] = math.fma %[[SEL]], %[[P1]], %[[N4]]
545 // CHECK-DAG: %[[N4:.+]] = arith.constant 1.00209987
556 // CHECK-DAG: %[[P2:.+]] = math.fma %[[SEL]], %[[P1]], %[[N4]]
/llvm-project-15.0.7/llvm/unittests/IR/
H A DMetadataTest.cpp654 MDNode *N4 = MDNode::get(Context, Ops4); in TEST_F() local
661 EXPECT_FALSE(N4->isResolved()); in TEST_F()
691 EXPECT_EQ(N4, N1->getOperand(0)); in TEST_F()
692 EXPECT_EQ(N1, N4->getOperand(0)); in TEST_F()
694 EXPECT_EQ(N4, N6->getOperand(0)); in TEST_F()
2062 auto *N4 = DICompositeType::get( in TEST_F() local
2077 EXPECT_EQ(N4, Same4); in TEST_F()
2079 EXPECT_EQ(N4->getRankConst(), RankInt1); in TEST_F()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DSelectionDAG.h1019 SDValue N2, SDValue N3, SDValue N4);
1021 SDValue N2, SDValue N3, SDValue N4, SDValue N5);
1032 SDValue N2, SDValue N3, SDValue N4);
1034 SDValue N2, SDValue N3, SDValue N4, SDValue N5);
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp566 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4")); in TEST() local
571 EXPECT_EQ(&RC, CG.lookupRefSCC(N4)); in TEST()
580 EXPECT_EQ(&C, CG.lookupSCC(N4)); in TEST()
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAG.cpp6550 SDValue N1, SDValue N2, SDValue N3, SDValue N4) { in getNode() argument
6551 SDValue Ops[] = { N1, N2, N3, N4 }; in getNode()
6556 SDValue N1, SDValue N2, SDValue N3, SDValue N4, in getNode() argument
6558 SDValue Ops[] = { N1, N2, N3, N4, N5 }; in getNode()
9202 SDValue N1, SDValue N2, SDValue N3, SDValue N4) { in getNode() argument
9203 SDValue Ops[] = { N1, N2, N3, N4 }; in getNode()
9208 SDValue N1, SDValue N2, SDValue N3, SDValue N4, in getNode() argument
9210 SDValue Ops[] = { N1, N2, N3, N4, N5 }; in getNode()
H A DDAGCombiner.cpp11105 SDValue N4 = N->getOperand(4); in visitSELECT_CC() local
11106 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get(); in visitSELECT_CC()