Home
last modified time | relevance | path

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

12345678910>>...22

/openbsd-src/usr.bin/awk/
H A Dproto.h28 extern int constnode(Node *);
29 extern char *strnode(Node *);
30 extern Node *notnull(Node *);
42 extern void penter(Node *);
43 extern void freetr(Node *);
47 extern void cfoll(fa *, Node *);
48 extern int first(Node *);
49 extern void follow(Node *);
55 extern Node *reparse(const char *);
56 extern Node *regexp(void);
[all …]
H A Dparse.c33 Node *nodealloc(size_t n) in nodealloc()
35 Node *x; in nodealloc()
37 x = (Node *) malloc(sizeof(*x) + (n-1) * sizeof(x)); in nodealloc()
45 Node *exptostat(Node *a) in exptostat()
51 Node *node1(int a, Node *b) in node1()
53 Node *x; in node1()
61 Node *node2(int a, Node *b, Node *c) in node2()
63 Node *x; in node2()
72 Node *node3(int a, Node *b, Node *c, Node *d) in node3()
74 Node *x; in node3()
[all …]
/openbsd-src/gnu/usr.bin/cvs/doc/
H A Dcvs.info38 Node: Top943
39 Node: Overview2750
40 Node: What is CVS?3314
41 Node: What is CVS not?5911
42 Node: A sample session11467
43 Node: Getting the source12289
44 Node: Committing your changes13166
45 Node: Cleaning up15324
46 Node: Viewing differences17028
47 Node: Repository17924
[all …]
H A Dcvsclient.info17 Node: Top212
18 Node: Introduction1035
19 Node: Goals3571
20 Node: Connection and Authentication6495
21 Node: Password scrambling12733
22 Node: Protocol14600
23 Node: Entries Lines16685
24 Node: File Modes17787
25 Node: Filenames19325
26 Node: File transmissions20632
[all …]
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DStmtPrinter.cpp153 void VisitStmt(Stmt *Node) LLVM_ATTRIBUTE_UNUSED { in VisitStmt() argument
157 void VisitExpr(Expr *Node) LLVM_ATTRIBUTE_UNUSED { in VisitExpr() argument
161 void VisitCXXNamedCastExpr(CXXNamedCastExpr *Node);
165 void Visit##CLASS(CLASS *Node);
177 void StmtPrinter::PrintRawCompoundStmt(CompoundStmt *Node) { in PrintRawCompoundStmt() argument
179 PrintFPPragmas(Node); in PrintRawCompoundStmt()
180 for (auto *I : Node->body()) in PrintRawCompoundStmt()
255 void StmtPrinter::VisitNullStmt(NullStmt *Node) { in VisitNullStmt() argument
259 void StmtPrinter::VisitDeclStmt(DeclStmt *Node) { in VisitDeclStmt() argument
261 PrintRawDeclStmt(Node); in VisitDeclStmt()
[all …]
H A DTextNodeDumper.cpp124 void TextNodeDumper::Visit(const Stmt *Node) { in Visit() argument
125 if (!Node) { in Visit()
132 OS << Node->getStmtClassName(); in Visit()
134 dumpPointer(Node); in Visit()
135 dumpSourceRange(Node->getSourceRange()); in Visit()
137 if (const auto *E = dyn_cast<Expr>(Node)) { in Visit()
183 ConstStmtVisitor<TextNodeDumper>::Visit(Node); in Visit()
926 static void dumpBasePath(raw_ostream &OS, const CastExpr *Node) { in dumpBasePath() argument
927 if (Node->path_empty()) in dumpBasePath()
932 for (CastExpr::path_const_iterator I = Node->path_begin(), in dumpBasePath()
[all …]
/openbsd-src/gnu/llvm/lldb/include/lldb/Symbol/
H A DPostfixExpression.h29 class Node {
41 Node(Kind kind) : m_kind(kind) {} in Node() function
51 class BinaryOpNode : public Node {
59 BinaryOpNode(OpType op_type, Node &left, Node &right) in BinaryOpNode()
60 : Node(BinaryOp), m_op_type(op_type), m_left(&left), m_right(&right) {} in BinaryOpNode()
64 const Node *Left() const { return m_left; } in Left()
65 Node *&Left() { return m_left; } in Left()
67 const Node *Right() const { return m_right; } in Right()
68 Node *&Right() { return m_right; } in Right()
70 static bool classof(const Node *node) { return node->GetKind() == BinaryOp; } in classof()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeVectorOps.cpp88 SDValue UnrollVSETCC(SDNode *Node);
94 void Expand(SDNode *Node, SmallVectorImpl<SDValue> &Results);
98 void ExpandFP_TO_UINT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
102 void ExpandUINT_TO_FLOAT(SDNode *Node, SmallVectorImpl<SDValue> &Results);
105 SDValue ExpandSEXTINREG(SDNode *Node);
112 SDValue ExpandANY_EXTEND_VECTOR_INREG(SDNode *Node);
119 SDValue ExpandSIGN_EXTEND_VECTOR_INREG(SDNode *Node);
125 SDValue ExpandZERO_EXTEND_VECTOR_INREG(SDNode *Node);
128 SDValue ExpandBSWAP(SDNode *Node);
132 SDValue ExpandVSELECT(SDNode *Node);
[all …]
H A DLegalizeDAG.cpp111 void LegalizeOp(SDNode *Node);
116 void LegalizeLoadOps(SDNode *Node);
117 void LegalizeStoreOps(SDNode *Node);
136 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
138 void ExpandFPLibCall(SDNode *Node, RTLIB::Libcall LC,
140 void ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
145 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
151 void ExpandArgFPLibCall(SDNode *Node,
156 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
157 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
[all …]
/openbsd-src/gnu/llvm/llvm/lib/BinaryFormat/
H A DAMDGPUMetadataVerifier.cpp29 msgpack::DocNode &Node, msgpack::Type SKind, in verifyScalar() argument
31 if (!Node.isScalar()) in verifyScalar()
33 if (Node.getKind() != SKind) { in verifyScalar()
38 if (Node.getKind() != msgpack::Type::String) in verifyScalar()
40 StringRef StringValue = Node.getString(); in verifyScalar()
41 Node.fromString(StringValue); in verifyScalar()
42 if (Node.getKind() != SKind) in verifyScalar()
46 return verifyValue(Node); in verifyScalar()
50 bool MetadataVerifier::verifyInteger(msgpack::DocNode &Node) { in verifyInteger() argument
51 if (!verifyScalar(Node, msgpack::Type::UInt)) in verifyInteger()
[all …]
H A DMsgPackDocument.cpp106 StackLevel(DocNode Node, size_t StartIndex, size_t Length, in StackLevel()
108 : Node(Node), Index(StartIndex), End(StartIndex + Length), in StackLevel()
110 DocNode Node; member
150 DocNode Node; in readFromBlob() local
153 Node = getNode(); in readFromBlob()
156 Node = getNode(Obj.Int); in readFromBlob()
159 Node = getNode(Obj.UInt); in readFromBlob()
162 Node = getNode(Obj.Bool); in readFromBlob()
165 Node = getNode(Obj.Float); in readFromBlob()
168 Node = getNode(Obj.Raw); in readFromBlob()
[all …]
/openbsd-src/gnu/llvm/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;
93 const Node *getNextSibling() const { return NextSibling; } in getNextSibling()
94 Node *getNextSibling() { return NextSibling; } in getNextSibling()
95 const Node *getPreviousSibling() const { return PreviousSibling; } in getPreviousSibling()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Demangle/
H A DItaniumDemangle.h156 class Node {
212 Node(Kind K_, Prec Precedence_ = Prec::Primary,
217 Node(Kind K_, Cache RHSComponentCache_, Cache ArrayCache_ = Cache::No,
219 : Node(K_, Prec::Primary, RHSComponentCache_, ArrayCache_, in Node() function
259 virtual const Node *getSyntaxNode(OutputBuffer &) const { return this; } in getSyntaxNode()
292 virtual ~Node() = default;
300 Node **Elements;
305 NodeArray(Node **Elements_, size_t NumElements_) in NodeArray()
311 Node **begin() const { return Elements; } in begin()
312 Node **end() const { return Elements + NumElements; } in end()
[all …]
/openbsd-src/gnu/llvm/libcxxabi/src/demangle/
H A DItaniumDemangle.h156 class Node {
212 Node(Kind K_, Prec Precedence_ = Prec::Primary,
217 Node(Kind K_, Cache RHSComponentCache_, Cache ArrayCache_ = Cache::No,
219 : Node(K_, Prec::Primary, RHSComponentCache_, ArrayCache_, in Node() function
259 virtual const Node *getSyntaxNode(OutputBuffer &) const { return this; } in getSyntaxNode()
292 virtual ~Node() = default;
300 Node **Elements;
305 NodeArray(Node **Elements_, size_t NumElements_) in NodeArray()
311 Node **begin() const { return Elements; } in begin()
312 Node **end() const { return Elements + NumElements; } in end()
[all …]
/openbsd-src/gnu/usr.bin/texinfo/util/
H A Dprepinfo.awk126 Node[Name ".level"] = levelnum
127 Node[Name ".name"] = Name
129 printf("Node[%s\".level\"] = %s\n", Name, Node[Name ".level"]) > "/dev/stderr"
130 printf("Node[%s\".name\"] = %s\n", Name, Node[Name ".name"]) > "/dev/stderr"
134 Node[Name ".up"] = Up[levelnum - 1]
136 Node[Prev[levelnum] ".next"] = Name
137 Node[Name ".prev"] = Prev[levelnum]
143 Node[Name ".up"] = Up[levelnum - 1]
145 Node[Name ".prev"] = Prev[levelnum]
146 Node[Prev[levelnum] ".next"] = Name
[all …]
/openbsd-src/gnu/llvm/clang/include/clang/ASTMatchers/
H A DASTMatchers.h250 SourceManager.getExpansionLoc(Node.getBeginLoc())); in AST_POLYMORPHIC_MATCHER()
270 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getBeginLoc()); in AST_POLYMORPHIC_MATCHER()
297 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getBeginLoc()); in AST_POLYMORPHIC_MATCHER_REGEX()
322 internal::getExpansionLocOfMacro(MacroName, Node.getBeginLoc(), Context); in AST_POLYMORPHIC_MATCHER_P()
325 internal::getExpansionLocOfMacro(MacroName, Node.getEndLoc(), Context); in AST_POLYMORPHIC_MATCHER_P()
633 return getAccessSpecifier(Node) == AS_public; in AST_POLYMORPHIC_MATCHER()
655 return getAccessSpecifier(Node) == AS_protected; in AST_POLYMORPHIC_MATCHER()
678 return getAccessSpecifier(Node) == AS_private; in AST_POLYMORPHIC_MATCHER()
693 return Node.isBitField(); in AST_MATCHER()
710 return Node.isBitField() && in AST_MATCHER_P()
[all …]
H A DASTMatchersInternal.h148 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); }
150 inline QualType getUnderlyingType(const ValueDecl &Node) {
151 return Node.getType();
153 inline QualType getUnderlyingType(const TypedefNameDecl &Node) {
154 return Node.getUnderlyingType();
156 inline QualType getUnderlyingType(const FriendDecl &Node) {
157 if (const TypeSourceInfo *TSI = Node.getFriendType())
161 inline QualType getUnderlyingType(const CXXBaseSpecifier &Node) {
162 return Node.getType();
173 inline TypeSourceInfo *GetTypeSourceInfo(const T &Node) {
[all …]
/openbsd-src/gnu/llvm/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);
249 void VisitCompoundStmt(const CompoundStmt *Node);
250 void VisitConstantExpr(const ConstantExpr *Node);
251 void VisitCallExpr(const CallExpr *Node);
[all …]
/openbsd-src/gnu/usr.bin/cvs/src/
H A Dhash.c18 static Node *nodecache = NULL;
20 static void freenode_mem PROTO((Node * p));
52 Node *node; in getlist()
61 list->hasharray[i] = (Node *) NULL; in getlist()
84 Node *p;
101 if ((p = (*listp)->hasharray[i]) != (Node *) NULL)
131 Node *
134 Node *p; in getnode()
136 if (nodecache != (Node *) NULL) in getnode()
145 p = (Node *) xmalloc (sizeof (Node)); in getnode()
[all …]
H A Dhash.h36 typedef struct node Node; typedef
40 Node *list;
41 Node *hasharray[HASHSIZE];
47 Node *findnode PROTO((List * list, const char *key));
48 Node *findnode_fn PROTO((List * list, const char *key));
49 Node *getnode PROTO((void));
50 int insert_before PROTO((List * list, Node * marker, Node * p));
51 int addnode PROTO((List * list, Node * p));
52 int addnode_at_front PROTO((List * list, Node * p));
53 int walklist PROTO((List * list, int (*)(Node *n, void *closure), void *closure));
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DIntervalTree.h308 void deleteTree(IntervalNode *Node) { in deleteTree() argument
309 if (Node) { in deleteTree()
310 deleteTree(Node->Left); in deleteTree()
311 deleteTree(Node->Right); in deleteTree()
312 Node->~IntervalNode(); in deleteTree()
313 NodeAllocator.Deallocate(Node); in deleteTree()
334 void printNode(raw_ostream &OS, unsigned Level, IntervalNode *Node,
340 OS << format(Format, Node->middle()) << Text << " ";
341 printList(OS, IntervalSet, Node->start(), Node->size(), HexFormat);
349 void printTree(raw_ostream &OS, unsigned Level, IntervalNode *Node,
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Demangle/
H A DItaniumDemangle.cpp84 void print(const Node *N) { in print()
94 for (const Node *N : A) { in print()
175 void print(Node::Prec P) { in print()
177 case Node::Prec::Primary: in print()
179 case Node::Prec::Postfix: in print()
181 case Node::Prec::Unary: in print()
183 case Node::Prec::Cast: in print()
185 case Node::Prec::PtrMem: in print()
187 case Node::Prec::Multiplicative: in print()
189 case Node::Prec::Additive: in print()
[all …]
/openbsd-src/gnu/llvm/compiler-rt/lib/tsan/rtl/
H A Dtsan_ilist.h27 template <typename Base, INode Base::*Node, typename Elem>
41 template <typename Base, INode Base::*Node, typename Elem = Base>
76 template <typename Base, INode Base::*Node, typename Elem>
77 IList<Base, Node, Elem>::IList() { in IList()
81 template <typename Base, INode Base::*Node, typename Elem>
82 void IList<Base, Node, Elem>::PushFront(Elem* e) { in PushFront()
86 template <typename Base, INode Base::*Node, typename Elem>
87 void IList<Base, Node, Elem>::PushBack(Elem* e) { in PushBack()
91 template <typename Base, INode Base::*Node, typename Elem>
92 void IList<Base, Node, Elem>::Push(Elem* e, INode* after) { in Push()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/Symbolize/
H A DMarkupFilter.cpp53 while (std::optional<MarkupNode> Node = Parser.nextNode()) { in filter() local
55 if (tryContextualElement(*Node, DeferredNodes)) in filter()
58 DeferredNodes.push_back(*Node); in filter()
63 for (const MarkupNode &Node : DeferredNodes) in filter() local
64 filterNode(Node); in filter()
69 while (std::optional<MarkupNode> Node = Parser.nextNode()) in finish() local
70 filterNode(*Node); in finish()
86 const MarkupNode &Node, const SmallVector<MarkupNode> &DeferredNodes) { in tryContextualElement() argument
87 if (tryMMap(Node, DeferredNodes)) in tryContextualElement()
89 if (tryReset(Node, DeferredNodes)) in tryContextualElement()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h112 class Node;
137 explicit Edge(Node &N, Kind K);
156 Node &getNode() const;
167 PointerIntPair<Node *, 1, Kind> Value;
184 friend class LazyCallGraph::Node;
196 friend class LazyCallGraph::Node;
227 friend class LazyCallGraph::Node;
257 Edge &operator[](Node &N) {
264 Edge *lookup(Node &N) { in lookup()
291 DenseMap<Node *, int> EdgeIndexMap;
[all …]

12345678910>>...22