Searched refs:NODE (Results 1 - 25 of 41) sorted by relevance

12

/freebsd-13-stable/usr.bin/ctags/
H A Dtree.c49 static void add_node(NODE *, NODE *);
50 static void free_tree(NODE *);
59 NODE *np;
64 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
69 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
97 add_node(NODE *node, NODE *cur_nod
[all...]
H A Dctags.h70 } NODE; typedef in typeref:struct:nd_st
73 extern NODE *head; /* head of the sorted binary tree */
92 extern void put_entries(NODE *);
H A Dprint.c99 put_entries(NODE *node)
/freebsd-13-stable/usr.bin/tsort/
H A Dtsort.c83 typedef struct node_str NODE; typedef in typeref:struct:node_str
86 NODE **n_prevp; /* pointer to previous node's n_next */
87 NODE *n_next; /* next node in graph */
88 NODE **n_arcs; /* array of arcs to other nodes */
102 static NODE *graph, **cycle_buf, **longest_cycle;
106 static int find_cycle(NODE *, NODE *, int, int);
107 static NODE *get_node(char *);
109 static void remove_node(NODE *);
205 NODE *n
[all...]
/freebsd-13-stable/usr.sbin/fmtree/
H A Dextern.h35 int compare(char *, NODE *, FTSENT *);
44 NODE *mtree_readspec(FILE *fi);
H A Dspec.c54 static void set(char *, NODE *);
55 static void unset(char *, NODE *);
57 NODE *
60 NODE *centry, *last;
62 NODE ginfo, *root;
140 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
166 set(char *t, NODE *ip)
317 unset(char *t, NODE *ip)
H A Dspecspec.c47 shownode(NODE *n, int f, char const *path)
93 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
115 compare_nodes(NODE *n1, NODE *n2, char const *path)
176 walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
179 NODE *c1, *c2, *n1, *n2;
247 NODE *root1, *root2;
H A Dmtree.h94 } NODE; typedef in typeref:struct:_node
H A Dverify.c50 static NODE *root;
53 static void miss(NODE *, char *);
78 NODE *ep, *level;
161 miss(NODE *p, char *tail)
/freebsd-13-stable/contrib/mtree/
H A Dextern.h64 int compare(NODE *, FTSENT *);
67 void dump_nodes(FILE *, const char *, NODE *, int);
69 int matchtags(NODE *);
H A Dspec.c100 static void replacenode(NODE *, NODE *);
101 static void set(char *, NODE *);
102 static void unset(char *, NODE *);
103 static void addchild(NODE *, NODE *);
104 static int nodecmp(const NODE *, const NODE *);
109 NODE *
112 NODE *centr
[all...]
H A Dspecspec.c56 shownode(NODE *n, int f, char const *path)
106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
193 walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
196 NODE *c1, *c2, *n1, *n2;
264 NODE *root1, *root2;
H A Dmtree.h108 } NODE; typedef in typeref:struct:_node
124 NODE *spec(FILE *);
126 void free_nodes(NODE *);
H A Dverify.c60 static NODE *root;
63 static void miss(NODE *, char *);
82 NODE *ep, *level;
172 miss(NODE *p, char *tail)
/freebsd-13-stable/sys/contrib/libsodium/dist-build/
H A Demscripten.sh126 if test "x$NODE" = x; then
130 NODE=$candidate
140 if test "x$NODE" = x; then
144 echo "Using [${NODE}] as a Javascript runtime"
156 fgrep -v "#! /usr/bin/env ${NODE}" "$file" > "browser/${file}"
169 echo "#! /usr/bin/env ${NODE}" > "${file}.tmp"
170 fgrep -v "#! /usr/bin/env ${NODE}" "$file" >> "${file}.tmp"
/freebsd-13-stable/sys/powerpc/psim/
H A Diobusvar.h49 IOBUS_ACCESSOR(node, NODE, phandle_t)
/freebsd-13-stable/share/examples/netgraph/
H A Dvirtual.lan174 for NODE in ${TARGET_TOPOLOGY}; do
180 NODE_NAME=`echo ${NODE} | awk -F"|" '{print $1}'`
181 NODE_IP=`echo ${NODE} | awk -F"|" '{print $2}'`
294 for NODE in ${OBJECTS}; do
295 jail -r ${NODE}
H A Dvirtual.chain305 for NODE in ${OBJECTS}; do
306 jail -r ${NODE}
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyISelLowering.h26 #define HANDLE_NODETYPE(NODE) NODE,
27 #define HANDLE_MEM_NODETYPE(NODE)
32 #define HANDLE_NODETYPE(NODE)
33 #define HANDLE_MEM_NODETYPE(NODE) NODE,
/freebsd-13-stable/sbin/restore/
H A Dutilities.c76 ep = addentry(name, pathsearch(name)->d_ino, NODE);
143 if (np->e_type != NODE)
162 if (ep->e_type != NODE)
292 if (ep == NULL || ep->e_type == NODE)
310 if (ep == NULL || ep->e_type == NODE)
338 ep->e_type == NODE ? "NODE" : "LEAF");
H A Drestore.h86 #define NODE 2 /* directory entry */ macro
H A Drestore.c91 if (type == NODE) {
105 if (type == NODE)
128 if (ep->e_type != NODE)
335 if (type == NODE)
366 if (ip->e_type == NODE) {
389 if (type == NODE)
425 badentry(ip, "NODE and LEAF links to same inode");
803 if (ep->e_type == NODE) {
828 if (ep->e_type == NODE)
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DSymbolTableListTraits.h49 #define DEFINE_SYMBOL_TABLE_PARENT_TYPE(NODE, PARENT) \
50 template <> struct SymbolTableListParentType<NODE> { using type = PARENT; };
/freebsd-13-stable/sys/xen/xenbus/
H A Dxenbusvar.h96 XENBUS_ACCESSOR(node, NODE, const char *)
/freebsd-13-stable/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c73 #define NODE(ptr) (ptr) macro
75 #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs))) macro
199 CPpmd7_Node *node = NODE(next);
201 n = NODE(n)->Prev = next;
207 NODE(head)->Stamp = 1;
208 NODE(head)->Next = n;
209 NODE(n)->Prev = head;
216 CPpmd7_Node *node = NODE(n);
220 CPpmd7_Node *node2 = NODE(n) + nu;
224 NODE(node
[all...]

Completed in 371 milliseconds

12