| /openbsd/usr.bin/awk/ |
| H A D | proto.h | 72 extern Node *node3(int, Node *, Node *, Node *);
73 extern Node *node4(int, Node *, Node *, Node *, Node *);
74 extern Node *node5(int, Node *, Node *, Node *, Node *, Node *);
75 extern Node *stat3(int, Node *, Node *, Node *);
76 extern Node *op2(int, Node *, Node *);
79 extern Node *op3(int, Node *, Node *, Node *);
80 extern Node *op4(int, Node *, Node *, Node *, Node *);
81 extern Node *op5(int, Node *, Node *, Node *, Node *, Node *);
83 extern Node *stat4(int, Node *, Node *, Node *, Node *);
87 extern Node *pa2stat(Node *, Node *, Node *);
[all …]
|
| H A D | parse.c | 61 Node *node2(int a, Node *b, Node *c) in node2()
72 Node *node3(int a, Node *b, Node *c, Node *d) in node3()
84 Node *node4(int a, Node *b, Node *c, Node *d, Node *e) in node4()
97 Node *node5(int a, Node *b, Node *c, Node *d, Node *e, Node *f) in node5()
129 Node *stat3(int a, Node *b, Node *c, Node *d) in stat3()
138 Node *stat4(int a, Node *b, Node *c, Node *d, Node *e) in stat4()
156 Node *op2(int a, Node *b, Node *c) in op2()
165 Node *op3(int a, Node *b, Node *c, Node *d) in op3()
174 Node *op4(int a, Node *b, Node *c, Node *d, Node *e) in op4()
183 Node *op5(int a, Node *b, Node *c, Node *d, Node *e, Node *f) in op5()
[all …]
|
| /openbsd/gnu/usr.bin/cvs/doc/ |
| H A D | cvs.info | 38 Node: Top943
39 Node: Overview2750
53 Node: Attic30400
55 Node: Locks34541
85 Node: Tags97794
109 Node: Inside145378
156 Node: admin225064
164 Node: diff250223
175 Node: log265926
178 Node: rdiff270792
[all …]
|
| H A D | cvsclient.info | 17 Node: Top212
18 Node: Introduction1035
19 Node: Goals3571
22 Node: Protocol14600
25 Node: Filenames19325
27 Node: Strings22190
28 Node: Dates22873
30 Node: Requests24957
33 Node: Responses64251
35 Node: Example81983
[all …]
|
| /openbsd/gnu/llvm/clang/lib/AST/ |
| H A D | StmtPrinter.cpp | 179 PrintFPPragmas(Node); in PrintRawCompoundStmt()
361 if (Node->getInit()) in VisitSwitchStmt()
399 if (Node->getInit()) in VisitForStmt()
403 if (Node->getCond()) in VisitForStmt()
500 if (Node->getNumOutputs() != 0 || Node->getNumInputs() != 0 || in VisitGCCAsmStmt()
501 Node->getNumClobbers() != 0 || Node->getNumLabels() != 0) in VisitGCCAsmStmt()
521 if (Node->getNumInputs() != 0 || Node->getNumClobbers() != 0 || in VisitGCCAsmStmt()
542 if (Node->getNumClobbers() != 0 || Node->getNumLabels()) in VisitGCCAsmStmt()
1216 else if (Node->isObjectReceiver() && Node->getBase()) { in VisitObjCPropertyRefExpr()
1219 } else if (Node->isClassReceiver() && Node->getClassReceiver()) { in VisitObjCPropertyRefExpr()
[all …]
|
| H A D | TextNodeDumper.cpp | 125 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 …]
|
| /openbsd/gnu/llvm/lldb/include/lldb/Symbol/ |
| H A D | PostfixExpression.h | 29 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 …]
|
| /openbsd/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | LegalizeVectorOps.cpp | 575 SDLoc dl(Node); in Promote()
616 SDLoc dl(Node); in PromoteINT_TO_FP()
666 SDLoc dl(Node); in PromoteFP_TO_INT()
758 Node->getOperand(1), Node->getOperand(4)); in Expand()
969 SDLoc DL(Node); in ExpandSELECT()
1028 SDLoc DL(Node); in ExpandSEXTINREG()
1042 SDLoc DL(Node); in ExpandANY_EXTEND_VECTOR_INREG()
1077 SDLoc DL(Node); in ExpandSIGN_EXTEND_VECTOR_INREG()
1101 SDLoc DL(Node); in ExpandZERO_EXTEND_VECTOR_INREG()
1236 SDLoc DL(Node); in ExpandVSELECT()
[all …]
|
| H A D | LegalizeDAG.cpp | 493 SDLoc dl(Node); in LegalizeStoreOps()
671 SDLoc dl(Node); in LegalizeLoadOps()
1204 Node->getOpcode(), Node->getOperand(0).getValueType()); in LegalizeOp()
1224 Node->getOpcode(), Node->getOperand(1).getValueType()); in LegalizeOp()
1485 SDLoc dl(Node); in ExpandVectorBuildThroughStack()
2273 Entry.Node = Node->getOperand(0); in ExpandSinCosLibCall()
2776 Node->getOperand(0), Node->getOperand(1), Zero, Zero, in ExpandNode()
2799 Node->getOperand(0), Node->getOperand(1), Node->getOperand(2), in ExpandNode()
3993 Ops.append(Node->op_begin() + 2, Node->op_end()); in ConvertNodeToLibcall()
4001 Ops.append(Node->op_begin() + 1, Node->op_end()); in ConvertNodeToLibcall()
[all …]
|
| /openbsd/gnu/llvm/llvm/lib/BinaryFormat/ |
| H A D | AMDGPUMetadataVerifier.cpp | 31 if (!Node.isScalar()) in verifyScalar()
46 return verifyValue(Node); in verifyScalar()
60 if (!Node.isArray()) in verifyArray()
94 if (!Node.isMap()) in verifyKernelArgs()
196 if (!Node.isMap()) in verifyKernel()
222 Node, in verifyKernel()
223 [this](msgpack::DocNode &Node) { return verifyInteger(Node); }, 2); in verifyKernel() argument
227 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verifyKernel() argument
296 Node, in verify()
302 return verifyArray(Node, [this](msgpack::DocNode &Node) { in verify() argument
[all …]
|
| H A D | MsgPackDocument.cpp | 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()
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 …]
|
| /openbsd/gnu/llvm/clang/include/clang/Tooling/Syntax/ |
| H A D | Tree.h | 54 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 …]
|
| /openbsd/gnu/llvm/llvm/include/llvm/Demangle/ |
| H A D | ItaniumDemangle.h | 985 NestedName(Node *Qual_, Node *Name_) in NestedName()
1043 LocalName(Node *Encoding_, Node *Entity_) in LocalName()
1775 ConditionalExpr(const Node *Cond_, const Node *Then_, const Node *Else_, in ConditionalExpr()
2125 BracedRangeExpr(const Node *First_, const Node *Last_, const Node *Init_) in BracedRangeExpr()
2464 Node **data = new (mem) Node *[sz]; in makeNodeArray()
2582 Node *parseAbiTags(Node *N);
2739 Node *
2849 Node *
3056 Node *
3119 Node *
[all …]
|
| /openbsd/gnu/llvm/libcxxabi/src/demangle/ |
| H A D | ItaniumDemangle.h | 985 NestedName(Node *Qual_, Node *Name_) in NestedName()
1043 LocalName(Node *Encoding_, Node *Entity_) in LocalName()
1775 ConditionalExpr(const Node *Cond_, const Node *Then_, const Node *Else_, in ConditionalExpr()
2125 BracedRangeExpr(const Node *First_, const Node *Last_, const Node *Init_) in BracedRangeExpr()
2464 Node **data = new (mem) Node *[sz]; in makeNodeArray()
2582 Node *parseAbiTags(Node *N);
2739 Node *
2849 Node *
3056 Node *
3119 Node *
[all …]
|
| /openbsd/gnu/usr.bin/texinfo/util/ |
| H A D | prepinfo.awk | 127 Node[Name ".name"] = Name
171 for (i in Node)
229 Node[node ".mendesc"] = desc
262 n = Node[Name ".next"]
264 n = Node[Name ".child"]
267 Node[Name ".prev"] ? Node[Name ".prev"] : Node[Name ".up"],
268 Node[Name ".up"])
285 for (n = Node[Name ".child"]; (n ".next") in Node; n = Node[n ".next"]) {
286 if ((n ".desc") in Node)
300 for (n = Node[Name ".child"]; (n ".next") in Node; n = Node[n ".next"]) {
[all …]
|
| /openbsd/gnu/llvm/clang/include/clang/ASTMatchers/ |
| H A D | ASTMatchers.h | 738 return Node.isMain(); in AST_MATCHER()
4020 return (!Node.isNull() && Node->isAnyPointerType() && in AST_MATCHER_P()
4062 return (!Node.isNull() && Node->isReferenceType() && in AST_MATCHER_P()
4080 if (Node.isNull()) in AST_MATCHER_P()
4468 return std::distance(Node.decl_begin(), Node.decl_end()) == (ptrdiff_t)N; in AST_MATCHER_P()
5410 Predicate.Node = DynTypedNode::create(Node); in AST_POLYMORPHIC_MATCHER_P()
5598 .matchesNode(Node);
5607 .matchesNode(Node);
7467 return Node && Node.getNestedNameSpecifier()->getAsType() && in AST_MATCHER_P()
7848 if (Node.getRHS()) in AST_MATCHER_P()
[all …]
|
| H A D | ASTMatchersInternal.h | 148 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); }
198 return &Node;
1787 if (!Node)
1811 if (!Node)
1960 DynTypedNode Node;
1964 static const Stmt *get(const Ty &Node) { return Node.getBody(); }
2065 if (Node.getNumArgs() != 1 && Node.getOperator() != OO_PlusPlus &&
2161 return &Node;
2180 return Node.getOpcodeStr(Node.getOpcode());
2225 return Node.getOpcodeStr(Node.getOpcode());
[all …]
|
| /openbsd/gnu/llvm/clang/include/clang/AST/ |
| H A D | TextNodeDumper.h | 176 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 …]
|
| /openbsd/gnu/usr.bin/cvs/src/ |
| H A D | hash.c | 84 Node *p;
131 Node *
134 Node *p; in getnode()
145 p = (Node *) xmalloc (sizeof (Node)); in getnode()
160 Node *p; in delnode()
238 Node *q;
299 Node *
328 Node *
389 Node **node1 = (Node **) elem1;
390 Node **node2 = (Node **) elem2;
[all …]
|
| H A D | hash.h | 36 typedef struct node Node; typedef
40 Node *list;
41 Node *hasharray[HASHSIZE];
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));
56 void delnode PROTO((Node * p));
57 void freenode PROTO((Node * p));
58 void sortlist PROTO((List * list, int (*)(const Node *, const Node *)));
[all …]
|
| /openbsd/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | IntervalTree.h | 309 if (Node) { in deleteTree()
351 if (Node) {
474 while (Node) { in initNode()
492 Node = Node->Left; in initNode()
498 Node = Node->Right; in initNode()
519 Node = Node->Left; in nextInterval()
527 Node = Node->Right; in nextInterval()
539 Node = Point < Node->middle() ? Node->Left : Node->Right; in nextInterval()
548 : AscendingBuckets(Left), DescendingBuckets(Right), Node(Node), in find_iterator()
577 return (!LHS.Node && !RHS.Node && !LHS.Index && !RHS.Index) ||
[all …]
|
| /openbsd/gnu/llvm/llvm/lib/Demangle/ |
| H A D | ItaniumDemangle.cpp | 181 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 ()()
489 case Node::KNestedName: in getFunctionDeclContextName()
539 if (const Node *Ret = in getFunctionReturnType()
563 const Node *N = static_cast<const Node *>(RootNode); in isCtorOrDtor()
[all …]
|
| /openbsd/gnu/llvm/compiler-rt/lib/tsan/rtl/ |
| H A D | tsan_ilist.h | 77 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 …]
|
| /openbsd/gnu/llvm/llvm/lib/DebugInfo/Symbolize/ |
| H A D | MarkupFilter.cpp | 64 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 …]
|
| /openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | LazyCallGraph.h | 112 class Node;
315 class Node {
690 Node &SourceN, Node &TargetN,
732 void switchOutgoingEdgeToRef(Node &SourceN, Node &TargetN);
746 void insertInternalRefEdge(Node &SourceN, Node &TargetN);
794 void removeOutgoingEdge(Node &SourceN, Node &TargetN);
846 void insertTrivialCallEdge(Node &SourceN, Node &TargetN);
857 void insertTrivialRefEdge(Node &SourceN, Node &TargetN);
1030 void insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK);
1038 void removeEdge(Node &SourceN, Node &TargetN);
[all …]
|