Home
last modified time | relevance | path

Searched refs:Node (Results 1 – 25 of 682) sorted by relevance

12345678910>>...28

/llvm-project-15.0.7/clang/lib/AST/
H A DStmtPrinter.cpp178 PrintFPPragmas(Node); in PrintRawCompoundStmt()
360 if (Node->getInit()) in VisitSwitchStmt()
398 if (Node->getInit()) in VisitForStmt()
402 if (Node->getCond()) in VisitForStmt()
499 if (Node->getNumOutputs() != 0 || Node->getNumInputs() != 0 || in VisitGCCAsmStmt()
500 Node->getNumClobbers() != 0 || Node->getNumLabels() != 0) in VisitGCCAsmStmt()
520 if (Node->getNumInputs() != 0 || Node->getNumClobbers() != 0 || in VisitGCCAsmStmt()
541 if (Node->getNumClobbers() != 0 || Node->getNumLabels()) in VisitGCCAsmStmt()
1210 else if (Node->isObjectReceiver() && Node->getBase()) { in VisitObjCPropertyRefExpr()
1213 } else if (Node->isClassReceiver() && Node->getClassReceiver()) { in VisitObjCPropertyRefExpr()
[all …]
H A DTextNodeDumper.cpp125 if (!Node) { in Visit()
134 dumpPointer(Node); in Visit()
999 [=] { Visit(Node->getAPValueResult(), Node->getType()); }); in VisitConstantExpr()
1003 if (Node->usesADL()) in VisitCallExpr()
1014 VisitCallExpr(Node); in VisitCXXOperatorCallExpr()
1030 VisitCastExpr(Node); in VisitImplicitCastExpr()
1038 if (Node->getDecl() != Node->getFoundDecl()) { in VisitDeclRefExpr()
1143 OS << " " << (Node->isArrow() ? "->" : ".") << *Node->getMemberDecl(); in VisitMemberExpr()
1235 dumpPointer(Node); in VisitCXXBindTemporaryExpr()
1295 OS << " " << (Node->isArrow() ? "->" : ".") << Node->getMember(); in VisitCXXDependentScopeMemberExpr()
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Symbol/
H A DPostfixExpression.h29 class Node {
59 BinaryOpNode(OpType op_type, Node &left, Node &right) in BinaryOpNode()
74 Node *m_left;
75 Node *m_right;
150 Node *m_operand;
178 case Node::BinaryOp: in Dispatch()
180 case Node::InitialValue: in Dispatch()
182 case Node::Integer: in Dispatch()
184 case Node::Register: in Dispatch()
186 case Node::Symbol: in Dispatch()
[all …]
/llvm-project-15.0.7/clang/unittests/Tooling/
H A DASTSelectionTest.cpp98 const auto *ND = Node.Node.get<NamedDecl>(); in checkDeclName()
139 ForAllChildrenOf(const SelectedASTNode &Node) : Node(Node) {} in ForAllChildrenOf()
153 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST() argument
159 EXPECT_TRUE(Node); in TEST()
177 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST() argument
180 [](Optional<SelectedASTNode> Node) { EXPECT_FALSE(Node); }); in TEST() argument
201 EXPECT_TRUE(Node); in TEST()
225 EXPECT_TRUE(Node); in TEST()
281 EXPECT_TRUE(Node); in TEST()
541 EXPECT_TRUE(Node); in checkFnBody()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeVectorOps.cpp574 SDLoc dl(Node); in Promote()
614 SDLoc dl(Node); in PromoteINT_TO_FP()
664 SDLoc dl(Node); in PromoteFP_TO_INT()
746 Node->getOperand(1), Node->getOperand(4)); in Expand()
922 SDLoc DL(Node); in ExpandSELECT()
984 SDLoc DL(Node); in ExpandSEXTINREG()
998 SDLoc DL(Node); in ExpandANY_EXTEND_VECTOR_INREG()
1033 SDLoc DL(Node); in ExpandSIGN_EXTEND_VECTOR_INREG()
1057 SDLoc DL(Node); in ExpandZERO_EXTEND_VECTOR_INREG()
1192 SDLoc DL(Node); in ExpandVSELECT()
[all …]
H A DLegalizeDAG.cpp491 SDLoc dl(Node); in LegalizeStoreOps()
669 SDLoc dl(Node); in LegalizeLoadOps()
1200 Node->getOpcode(), Node->getOperand(0).getValueType()); in LegalizeOp()
1220 Node->getOpcode(), Node->getOperand(1).getValueType()); in LegalizeOp()
1481 SDLoc dl(Node); in ExpandVectorBuildThroughStack()
2276 Entry.Node = Node->getOperand(0); in ExpandSinCosLibCall()
2779 Node->getOperand(0), Node->getOperand(1), Zero, Zero, in ExpandNode()
2802 Node->getOperand(0), Node->getOperand(1), Node->getOperand(2), in ExpandNode()
3964 Ops.append(Node->op_begin() + 2, Node->op_end()); in ConvertNodeToLibcall()
3972 Ops.append(Node->op_begin() + 1, Node->op_end()); in ConvertNodeToLibcall()
[all …]
/llvm-project-15.0.7/llvm/lib/BinaryFormat/
H A DAMDGPUMetadataVerifier.cpp32 if (!Node.isScalar()) in verifyScalar()
47 return verifyValue(Node); in verifyScalar()
61 if (!Node.isArray()) in verifyArray()
95 if (!Node.isMap()) in verifyKernelArgs()
197 if (!Node.isMap()) in verifyKernel()
223 Node, in verifyKernel()
224 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel() argument
228 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verifyKernel() argument
292 Node, in verify()
298 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verify() argument
[all …]
H A DMsgPackDocument.cpp108 : Node(Node), Index(StartIndex), End(StartIndex + Length), in StackLevel()
110 DocNode Node; member
150 DocNode Node; in readFromBlob() local
153 Node = getNode(); in readFromBlob()
171 Node = getMapNode(); in readFromBlob()
174 Node = getArrayNode(); in readFromBlob()
215 *DestNode = Node; in readFromBlob()
240 DocNode Node; member
252 DocNode Node = getRoot(); in writeToBlob() local
258 {Node, DocNode::MapTy::iterator(), Node.getArray().begin(), false}); in writeToBlob()
[all …]
/llvm-project-15.0.7/clang/include/clang/Tooling/Syntax/
H A DTree.h54 class Node {
58 Node(NodeKind Kind);
60 ~Node() = default;
64 Node(const Node &) = delete;
65 Node &operator=(const Node &) = delete;
67 Node(Node &&) = delete;
68 Node &operator=(Node &&) = delete;
122 Node *NextSibling;
123 Node *PreviousSibling;
219 using Node::Node;
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h975 NestedName(Node *Qual_, Node *Name_) in NestedName()
1033 LocalName(Node *Encoding_, Node *Entity_) in LocalName()
1762 ConditionalExpr(const Node *Cond_, const Node *Then_, const Node *Else_, in ConditionalExpr()
2112 BracedRangeExpr(const Node *First_, const Node *Last_, const Node *Init_) in BracedRangeExpr()
2451 Node **data = new (mem) Node *[sz]; in makeNodeArray()
2569 Node *parseAbiTags(Node *N);
2726 Node *
2836 Node *
3036 Node *
3099 Node *
[all …]
/llvm-project-15.0.7/libcxxabi/src/demangle/
H A DItaniumDemangle.h975 NestedName(Node *Qual_, Node *Name_) in NestedName()
1033 LocalName(Node *Encoding_, Node *Entity_) in LocalName()
1762 ConditionalExpr(const Node *Cond_, const Node *Then_, const Node *Else_, in ConditionalExpr()
2112 BracedRangeExpr(const Node *First_, const Node *Last_, const Node *Init_) in BracedRangeExpr()
2451 Node **data = new (mem) Node *[sz]; in makeNodeArray()
2569 Node *parseAbiTags(Node *N);
2726 Node *
2836 Node *
3036 Node *
3099 Node *
[all …]
/llvm-project-15.0.7/clang/include/clang/ASTMatchers/
H A DASTMatchers.h737 return Node.isMain(); in AST_MATCHER()
4019 return (!Node.isNull() && Node->isAnyPointerType() && in AST_MATCHER_P()
4061 return (!Node.isNull() && Node->isReferenceType() && in AST_MATCHER_P()
4079 if (Node.isNull()) in AST_MATCHER_P()
4467 return std::distance(Node.decl_begin(), Node.decl_end()) == (ptrdiff_t)N; in AST_MATCHER_P()
5409 Predicate.Node = DynTypedNode::create(Node); in AST_POLYMORPHIC_MATCHER_P()
5599 .matchesNode(Node);
5608 .matchesNode(Node);
7470 return Node && Node.getNestedNameSpecifier()->getAsType() && in AST_MATCHER_P()
7827 if (Node.getRHS()) in AST_MATCHER_P()
[all …]
H A DASTMatchersInternal.h149 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); }
199 return &Node;
1803 if (!Node)
1827 if (!Node)
1976 DynTypedNode Node;
1980 static const Stmt *get(const Ty &Node) { return Node.getBody(); }
2081 if (Node.getNumArgs() != 1 && Node.getOperator() != OO_PlusPlus &&
2177 return &Node;
2196 return Node.getOpcodeStr(Node.getOpcode());
2241 return Node.getOpcodeStr(Node.getOpcode());
[all …]
/llvm-project-15.0.7/clang/include/clang/AST/
H A DTextNodeDumper.h176 void Visit(const Stmt *Node);
243 void VisitIfStmt(const IfStmt *Node);
244 void VisitSwitchStmt(const SwitchStmt *Node);
245 void VisitWhileStmt(const WhileStmt *Node);
246 void VisitLabelStmt(const LabelStmt *Node);
247 void VisitGotoStmt(const GotoStmt *Node);
248 void VisitCaseStmt(const CaseStmt *Node);
251 void VisitCallExpr(const CallExpr *Node);
253 void VisitCastExpr(const CastExpr *Node);
267 void VisitMemberExpr(const MemberExpr *Node);
[all …]
/llvm-project-15.0.7/llvm/test/TableGen/GICombinerEmitter/
H A Dmatch-tree.td109 // CHECK-DAG: Node[[N0]] -> Node[[N1]] [label="#0 MyTarget::SUB"]
110 // CHECK-DAG: Node[[N0]] -> Node[[N6]] [label="#1 MyTarget::MOV"]
117 // CHECK-DAG: Node[[N1]] -> Node[[N2]] [label="#0 true"]
118 // CHECK-DAG: Node[[N1]] -> Node[[N5]] [label="#1 false"]
124 // CHECK-DAG: Node[[N2]] -> Node[[N4]] [label="#1 * or nullptr"]
126 // CHECK-DAG: Node[[N6]] -> Node[[N7]] [label="#0 true"]
127 // CHECK-DAG: Node[[N6]] -> Node[[N10]] [label="#1 false"]
130 // CHECK-DAG: Node[[N7]] -> Node[[N9]] [label="#1 * or nullptr"]
132 // CHECK-DAG: Node[[N11]] -> Node[[N12]] [label="#0 true"]
133 // CHECK-DAG: Node[[N11]] -> Node[[N15]] [label="#1 false"]
[all …]
/llvm-project-15.0.7/llvm/unittests/ADT/
H A DIListTest.cpp19 struct Node : ilist_node<Node> { struct
22 Node() {} in Node() function
24 Node(const Node&) = default;
47 Node L1Nodes[] = {Node(0), Node(1)}; in TEST()
48 Node L2Nodes[] = {Node(0), Node(1)}; in TEST()
60 L3.cloneFrom(L1, [](const Node &N) { return new Node(N); }); in TEST()
99 Node N0(0); in TEST()
100 Node N1(1); in TEST()
115 Node N0(0); in TEST()
116 Node N1(1); in TEST()
[all …]
/llvm-project-15.0.7/polly/lib/Transform/
H A DMatmulOptimizer.cpp463 Node = Node.parent().parent(); in createMicroKernel()
490 Node = Node.parent().parent(); in createMacroKernel()
841 Node = Node.child(0); in optimizeDataLayoutMatrMulPattern()
842 Node = in optimizeDataLayoutMatrMulPattern()
845 Node = Node.child(0); in optimizeDataLayoutMatrMulPattern()
846 Node = in optimizeDataLayoutMatrMulPattern()
909 Node = Node.parent().parent().parent(); in isolateAndUnrollMatMulInnerLoops()
913 Node = Node.child(0).child(0).child(0); in isolateAndUnrollMatMulInnerLoops()
962 Node = getBandNodeWithOriginDimOrder(Node); in optimizeMatMulPattern()
1010 Node = Node.child(0); in isMatrMultPattern()
[all …]
/llvm-project-15.0.7/llvm/lib/Demangle/
H A DItaniumDemangle.cpp181 case Node::Prec::Unary: in print()
183 case Node::Prec::Cast: in print()
199 case Node::Prec::And: in print()
201 case Node::Prec::Xor: in print()
203 case Node::Prec::Ior: in print()
207 case Node::Prec::OrIf: in print()
267 if (Node->Ref && !Node->Printing) { in operator ()()
496 case Node::KNestedName: in getFunctionDeclContextName()
550 if (const Node *Ret = in getFunctionReturnType()
574 const Node *N = static_cast<const Node *>(RootNode); in isCtorOrDtor()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyISelDAGToDAG.cpp103 if (Node->isMachineOpcode()) { in Select()
105 Node->setNodeId(-1); in Select()
114 SDLoc DL(Node); in Select()
116 switch (Node->getOpcode()) { in Select()
149 ReplaceNode(Node, Fence); in Select()
150 CurDAG->RemoveDeadNode(Node); in Select()
161 ReplaceNode(Node, TLSSize); in Select()
185 Node->getOperand(0)); in Select()
203 ReplaceNode(Node, Catch); in Select()
224 ReplaceNode(Node, Throw); in Select()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/
H A Dtsan_ilist.h77 IList<Base, Node, Elem>::IList() { in IList()
105 void IList<Base, Node, Elem>::Remove(Elem* e) { in Remove()
119 Elem* IList<Base, Node, Elem>::PopFront() { in PopFront()
127 Elem* IList<Base, Node, Elem>::PopBack() { in PopBack()
135 Elem* IList<Base, Node, Elem>::Front() { in Front()
140 Elem* IList<Base, Node, Elem>::Back() { in Back()
145 Elem* IList<Base, Node, Elem>::Prev(Elem* e) { in Prev()
152 Elem* IList<Base, Node, Elem>::Next(Elem* e) { in Next()
159 uptr IList<Base, Node, Elem>::Size() const { in Size()
164 bool IList<Base, Node, Elem>::Empty() const { in Empty()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/
H A Dtsan_ilist.h77 IList<Base, Node, Elem>::IList() { in IList()
105 void IList<Base, Node, Elem>::Remove(Elem* e) { in Remove()
119 Elem* IList<Base, Node, Elem>::PopFront() { in PopFront()
127 Elem* IList<Base, Node, Elem>::PopBack() { in PopBack()
135 Elem* IList<Base, Node, Elem>::Front() { in Front()
140 Elem* IList<Base, Node, Elem>::Back() { in Back()
145 Elem* IList<Base, Node, Elem>::Prev(Elem* e) { in Prev()
152 Elem* IList<Base, Node, Elem>::Next(Elem* e) { in Next()
159 uptr IList<Base, Node, Elem>::Size() const { in Size()
164 bool IList<Base, Node, Elem>::Empty() const { in Empty()
[all …]
/llvm-project-15.0.7/llvm/lib/DebugInfo/Symbolize/
H A DMarkupFilter.cpp64 filterNode(Node); in filter()
70 filterNode(*Node); in finish()
117 filterNode(Node); in tryMMap()
135 filterNode(Node); in tryReset()
165 filterNode(Node); in tryModule()
205 if (!checkTag(Node)) in filterNode()
209 if (trySGR(Node)) in filterNode()
212 OS << Node.Text; in filterNode()
216 if (trySymbol(Node)) in tryPresentation()
218 if (tryPC(Node)) in tryPresentation()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DConfigYAML.cpp25 using llvm::yaml::Node;
61 bool parse(Fragment &F, Node &N) { in parse()
82 Dict.handle("PathMatch", [&](Node &N) { in parse()
95 Dict.handle("Compiler", [&](Node &N) { in parse()
99 Dict.handle("Add", [&](Node &N) { in parse()
103 Dict.handle("Remove", [&](Node &N) { in parse()
124 Dict.handle("Suppress", [&](Node &N) { in parse()
138 Dict.handle("Add", [&](Node &N) { in parse()
142 Dict.handle("Remove", [&](Node &N) { in parse()
286 void parse(Node &N) const { in parse()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h112 class Node;
315 class Node {
682 Node &SourceN, Node &TargetN,
724 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
738 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
786 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
838 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
849 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1022 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1030 void removeEdge(Node &SourceN, Node &TargetN);
[all …]
/llvm-project-15.0.7/polly/include/polly/
H A DScheduleTreeTransform.h34 RetTy visit(isl::schedule_node Node, Args... args) { in visit()
35 assert(!Node.is_null()); in visit()
36 switch (isl_schedule_node_get_type(Node.get())) { in visit()
38 assert(isl_schedule_node_n_children(Node.get()) == 1); in visit()
42 assert(isl_schedule_node_n_children(Node.get()) == 1); in visit()
145 RetTy visit(isl::schedule_node Node, Args... args) { in visit()
172 return getDerived().visitChildren(Node); in visitNode()
176 if (!Node.has_children()) in visitChildren()
177 return Node; in visitChildren()
179 isl::schedule_node It = Node.first_child(); in visitChildren()
[all …]

12345678910>>...28