| /src/usr.bin/ctags/ |
| ctags.h | 64 } NODE;
67 extern NODE *head; /* head of the sorted binary tree */
86 extern void put_entries(NODE *);
|
| /src/external/bsd/pcc/dist/pcc/arch/m68k/ |
| code.c | 35 #define NODE P1ND
106 NODE *p, *q;
129 NODE *n, *p;
197 NODE *
198 funcode(NODE *p)
200 NODE *r, *l;
241 NODE *
242 builtin_return_address(const struct bitable *bt, NODE *a)
245 NODE *f;
266 NODE *
[all...] |
| local.c | 35 #define P1ND NODE
41 #define NODE P1ND
75 static NODE *
76 picext(NODE *p)
78 NODE *q, *r;
120 static NODE *
121 picstatic(NODE *p)
123 NODE *q, *r;
159 NODE *
160 clocal(NODE *p
[all...] |
| /src/external/bsd/pcc/dist/pcc/cc/ccom/ |
| optim.c | 39 #define NODE P1ND
51 /* remove left node */
52 static NODE *
53 zapleft(NODE *p)
55 NODE *q;
66 static NODE *
67 fortarg(NODE *p)
88 NODE *
89 optim(NODE *p)
92 NODE *sp, *q
[all...] |
| symtabs.c | 35 #define NODE P1ND
135 /* Create new node */
267 * Need a new node. If type is SNORMAL and inside a function
268 * the node must be allocated as permanent anyway.
608 * Save string (if needed) and return NODE for it.
611 NODE *
615 NODE *p;
|
| gcc_compat.c | 40 #define NODE P1ND
113 NODE *p = block(TYPE, 0, 0, 0, 0, 0);
129 NODE *p = block(NAME, NIL, NIL, FLOAT, 0, 0);
131 NODE *q;
158 NODE *p;
430 setaarg(int str, union aarg *aa, NODE *p)
449 gcc_attribs(NODE *p)
451 NODE *q, *r;
550 * Extract attributes from a node tree and return attribute entries
554 gcc_attr_parse(NODE *p
[all...] |
| init.c | 69 #define NODE P1ND
81 * ninval(CONSZ off, int fsz, NODE *)
148 NODE *n; /* node containing this data info */
170 getil(struct ilist *next, CONSZ b, int sz, NODE *n)
225 inval(CONSZ off, int fsz, NODE *p)
234 NODE *r = p->n_left->n_right->n_right;
619 * Insert the node p with size fsz at position off.
620 * Bit fields are already dealt with, so a node of correct type
624 nsetval(CONSZ off, int fsz, NODE *p
[all...] |
| /src/external/bsd/pcc/dist/pcc/arch/pdp11/ |
| code.c | 33 #define NODE P1ND
98 NODE *p, *q;
121 NODE *n;
165 NODE *
166 funcode(NODE *p)
168 NODE *r, *l;
205 NODE *
206 builtin_cfa(const struct bitable *bt, NODE *a)
212 NODE *
213 builtin_return_address(const struct bitable *bt, NODE *a
[all...] |
| local.c | 31 #define NODE P1ND
50 NODE *
51 clocal(NODE *p)
55 register NODE *r, *l;
139 myp2tree(NODE *p)
166 andable(NODE *p)
185 * is the multiply count for off, t is a storeable node where to write
189 spalloc(NODE *t, NODE *p, OFFSZ off)
191 NODE *sp
[all...] |
| /src/external/bsd/pcc/dist/pcc/arch/vax/ |
| local.c | 40 #define NODE P1ND
47 static void r1arg(NODE *p, NODE *q);
52 NODE *
53 clocal(p) NODE *p; {
68 register NODE *r, *l;
167 r1arg(NODE *p, NODE *q)
169 NODE *r;
187 myp2tree(NODE *p
[all...] |
| code.c | 40 #define NODE P1ND
129 NODE *p, *q;
156 NODE *p, *q;
363 NODE *
364 funcode(NODE *p)
366 NODE *r, *l;
391 NODE *
392 builtin_ffs(const struct bitable *bt, NODE *a)
394 NODE *p, *q, *r;
408 NODE *
[all...] |
| /src/sbin/restore/ |
| restore.h | 103 #define NODE 2 /* directory entry */
|
| /src/usr.bin/tsort/ |
| tsort.c | 76 * sometimes says a node is in a cycle when it isn't).
82 #define NF_ACYCLIC 0x2 /* this node is cycle free */
85 typedef struct node_str NODE;
88 NODE **n_prevp; /* pointer to previous node's n_next */
89 NODE *n_next; /* next node in graph */
90 NODE **n_arcs; /* array of arcs to other nodes */
93 size_t n_refcnt; /* # of arcs pointing to this node */
95 char n_name[1]; /* name of this node */
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| Nodes.cpp | 20 llvm_unreachable("unknown node kind");
439 #define NODE(Kind, Parent) \
440 static_assert(sizeof(syntax::Kind) > 0, "Missing Node subclass definition");
|
| /src/external/bsd/pcc/dist/pcc/arch/i386/ |
| code.c | 37 #define NODE P1ND
137 NODE *p, *q;
211 NODE *n, *p;
265 /* Function returns struct, create return arg node */
455 addreg(NODE *p)
458 NODE *q;
507 NODE *
508 funcode(NODE *p)
512 NODE *r, *l;
578 /* Create an ASSIGN node for ebx *
[all...] |
| /src/external/bsd/pcc/dist/pcc/arch/mips/ |
| code.c | 42 #define NODE P1ND
127 NODE *p, *q;
164 NODE *p;
177 NODE *p, *q;
194 NODE *p, *q;
225 NODE *p, *q;
263 NODE *p, *q;
287 NODE *p, *q, *t;
334 NODE *p, *q, *t;
411 NODE *p, *q
[all...] |
| local.c | 36 #define NODE P1ND
51 NODE *
52 clocal(NODE *p)
55 NODE *r, *l;
366 myp2tree(NODE *p)
395 andable(NODE *p)
413 * is the multiply count for off, t is a NAME node where to write
417 spalloc(NODE *t, NODE *p, OFFSZ off)
419 NODE *sp
[all...] |
| /src/external/gpl2/texinfo/dist/info/ |
| nodes.h | 31 /* Callers generally only want the node itself. This structure is used
32 to pass node information around. None of the information in this
34 be passed to free (). Note that NODE->parent is non-null if this
35 node's file is a subfile. In that case, NODE->parent is the logical
36 name of the file containing this node. Both names are given as full
37 paths, so you might have: node->filename = "/usr/gnu/info/emacs-1",
38 with node->parent = "/usr/gnu/info/emacs". */
40 char *filename; /* The physical file containing this node. */
42 char *nodename; /* The name of this node. *
[all...] |
| /src/usr.sbin/mtree/ |
| mtree.h | 108 } NODE;
124 NODE *spec(FILE *);
126 void free_nodes(NODE *);
|
| /src/external/bsd/pcc/dist/pcc/arch/amd64/ |
| local.c | 33 #define NODE P1ND
111 static NODE *
112 picext(NODE *p)
116 NODE *q;
146 static NODE *
147 cmop(NODE *l, NODE *r)
152 static NODE *
153 mkx(char *s, NODE *p)
177 static NODE *
[all...] |
| code.c | 37 #define NODE P1ND
78 static NODE *movtomem(NODE *p, int off, int reg);
79 static NODE *movtoreg(NODE *p, int rno);
171 NODE *p, *r, *l;
241 NODE *p, *r;
534 NODE *p, *q;
587 static NODE *
590 NODE *p
[all...] |
| /src/external/bsd/pcc/dist/pcc/mip/ |
| node.h | 1 /* Id: node.h,v 1.43 2015/11/17 19:19:40 ragge Exp */
2 /* $NetBSD: node.h,v 1.1.1.5 2016/02/09 20:29:16 plunky Exp $ */
54 * The node structure is the basic element in the compiler.
61 #define NIL (NODE *)0
65 typedef struct node { struct
87 struct node *_left;
91 struct node *_right;
114 } NODE;
134 * Node types.
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_ppmd7.c | 73 #define NODE(ptr) (ptr)
75 #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs)))
152 static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
154 *((CPpmd_Void_Ref *)node) = p->FreeList[indx];
155 p->FreeList[indx] = REF(node);
160 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); local
161 p->FreeList[indx] = *node;
162 return node;
199 CPpmd7_Node *node = NODE(next) local
216 CPpmd7_Node *node = NODE(n); local
234 CPpmd7_Node *node = NODE(n); local
[all...] |
| archive_ppmd8.c | 57 #define NODE(ptr) (ptr)
59 #define NODE(offs) ((CPpmd8_Node *)(p->Base + (offs)))
117 static void InsertNode(CPpmd8 *p, void *node, unsigned indx)
119 ((CPpmd8_Node *)node)->Stamp = EMPTY_NODE;
120 ((CPpmd8_Node *)node)->Next = (CPpmd8_Node_Ref)p->FreeList[indx];
121 ((CPpmd8_Node *)node)->NU = I2U(indx);
122 p->FreeList[indx] = REF(node);
128 CPpmd8_Node *node = NODE((CPpmd8_Node_Ref)p->FreeList[indx]); local
129 p->FreeList[indx] = node->Next
167 CPpmd8_Node *node = NODE(next); local
187 CPpmd8_Node *node = NODE(head); local
313 CPpmd8_Node *node = (CPpmd8_Node *)p->UnitsStart; local
327 CPpmd8_Node *node = NODE(*next); local
[all...] |
| /src/external/bsd/pcc/dist/pcc/arch/arm/ |
| macdefs.h | 221 /* Return a register class based on the type of the node */
255 #define NODE struct node
256 struct node;
258 NODE *arm_builtin_stdarg_start(const struct bitable *bt, NODE *a);
259 NODE *arm_builtin_va_arg(const struct bitable *bt, NODE *a);
260 NODE *arm_builtin_va_end(const struct bitable *bt, NODE *a)
[all...] |
