Home
last modified time | relevance | path

Searched refs:NODE (Results 1 – 25 of 47) sorted by relevance

12

/freebsd-13.1/usr.bin/tsort/
H A Dtsort.c106 static int find_cycle(NODE *, NODE *, int, int);
205 NODE *n1; in add_arc()
206 NODE *n2; in add_arc()
237 static NODE *
241 NODE *n; in get_node()
292 NODE *n; in clear_cycle()
302 NODE *n, *next; in tsort()
363 remove_node(NODE *n) in remove_node()
365 NODE **np; in remove_node()
380 find_cycle(NODE *from, NODE *to, int longest_len, int depth) in find_cycle()
[all …]
/freebsd-13.1/usr.bin/ctags/
H A Dtree.c49 static void add_node(NODE *, NODE *);
50 static void free_tree(NODE *);
59 NODE *np; in pfnote()
64 if (!(np = (NODE *)malloc(sizeof(NODE)))) { in pfnote()
69 if (!(head = np = (NODE *)malloc(sizeof(NODE)))) in pfnote()
97 add_node(NODE *node, NODE *cur_node) in add_node()
125 free_tree(NODE *node) in free_tree()
127 NODE *node_next; in free_tree()
H A Dctags.h70 } NODE; typedef
73 extern NODE *head; /* head of the sorted binary tree */
92 extern void put_entries(NODE *);
/freebsd-13.1/contrib/mtree/
H A Dspec.c100 static void replacenode(NODE *, NODE *);
103 static void addchild(NODE *, NODE *);
104 static int nodecmp(const NODE *, const NODE *);
109 NODE *
114 NODE ginfo, *root; in spec()
268 free_nodes(NODE *root) in free_nodes()
270 NODE *cur, *next; in free_nodes()
321 NODE *cur; in dump_nodes()
486 replacenode(NODE *cur, NODE *new) in replacenode()
720 addchild(NODE *pathparent, NODE *centry) in addchild()
[all …]
H A Dspecspec.c56 shownode(NODE *n, int f, char const *path) in shownode()
106 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch()
128 compare_nodes(NODE *n1, NODE *n2, char const *path) in compare_nodes()
193 walk_in_the_forest(NODE *t1, NODE *t2, char const *path) in walk_in_the_forest()
196 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest()
264 NODE *root1, *root2; in mtree_specspec()
H A Dextern.h64 int compare(NODE *, FTSENT *);
67 void dump_nodes(FILE *, const char *, NODE *, int);
69 int matchtags(NODE *);
H A Dmtree.h108 } NODE; typedef
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; in vwalk()
172 miss(NODE *p, char *tail) in miss()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/M68k/
H A DM68kInstrShiftRotate.td49 class MxSR_DD<string MN, MxType TYPE, SDNode NODE,
53 [(set TYPE.VT:$dst, (NODE TYPE.VT:$src, TYPE.VT:$opd))],
58 class MxSR_DI<string MN, MxType TYPE, SDNode NODE,
64 (NODE TYPE.VT:$src,
69 multiclass MxSROp<string MN, SDNode NODE, MxBead1Bit RODI, MxBead2Bits ROOP> {
74 def NAME#"8dd" : MxSR_DD<MN, MxType8d, NODE, RODI, ROOP>;
75 def NAME#"16dd" : MxSR_DD<MN, MxType16d, NODE, RODI, ROOP>;
76 def NAME#"32dd" : MxSR_DD<MN, MxType32d, NODE, RODI, ROOP>;
78 def NAME#"8di" : MxSR_DI<MN, MxType8d, NODE, RODI, ROOP>;
79 def NAME#"16di" : MxSR_DI<MN, MxType16d, NODE, RODI, ROOP>;
[all …]
H A DM68kInstrArithmetic.td152 class MxBiArOp_FMR<string MN, SDNode NODE, MxType TYPE,
162 class MxBiArOp_FMI<string MN, SDNode NODE, MxType TYPE,
175 multiclass MxBiArOp_DF<string MN, SDNode NODE, bit isComm,
215 def NAME#"8di" : MxBiArOp_RFRI_xEA<MN, NODE, MxType8d, CMD>;
278 multiclass MxBiArOp_AF<string MN, SDNode NODE, bit isComm,
325 def NAME#"8dd" : MxBiArOp_RFRRF<MN, NODE, MxType8d, CMD>;
326 def NAME#"16dd" : MxBiArOp_RFRRF<MN, NODE, MxType16d, CMD>;
327 def NAME#"32dd" : MxBiArOp_RFRRF<MN, NODE, MxType32d, CMD>;
355 def NAME#"8di" : MxBiArOp_RFRI<MN, NODE, MxType8d, CMDI>;
356 def NAME#"16di" : MxBiArOp_RFRI<MN, NODE, MxType16d, CMDI>;
[all …]
/freebsd-13.1/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.1/usr.sbin/fmtree/
H A Dspec.c54 static void set(char *, NODE *);
55 static void unset(char *, NODE *);
57 NODE *
60 NODE *centry, *last; in mtree_readspec()
62 NODE ginfo, *root; in mtree_readspec()
140 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL) in mtree_readspec()
166 set(char *t, NODE *ip) in set()
317 unset(char *t, NODE *ip) in unset()
H A Dspecspec.c47 shownode(NODE *n, int f, char const *path) in shownode()
93 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch()
115 compare_nodes(NODE *n1, NODE *n2, char const *path) in compare_nodes()
176 walk_in_the_forest(NODE *t1, NODE *t2, char const *path) in walk_in_the_forest()
179 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest()
247 NODE *root1, *root2; in mtree_specspec()
H A Dextern.h35 int compare(char *, NODE *, FTSENT *);
44 NODE *mtree_readspec(FILE *fi);
H A Dverify.c50 static NODE *root;
53 static void miss(NODE *, char *);
78 NODE *ep, *level; in vwalk()
161 miss(NODE *p, char *tail) in miss()
/freebsd-13.1/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.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyISelLowering.h26 #define HANDLE_NODETYPE(NODE) NODE, argument
27 #define HANDLE_MEM_NODETYPE(NODE) argument
32 #define HANDLE_NODETYPE(NODE) argument
33 #define HANDLE_MEM_NODETYPE(NODE) NODE, argument
/freebsd-13.1/sbin/restore/
H A Dutilities.c76 ep = addentry(name, pathsearch(name)->d_ino, NODE); in pathcheck()
143 if (np->e_type != NODE) in newnode()
162 if (ep->e_type != NODE) in removenode()
292 if (ep == NULL || ep->e_type == NODE) in lowerbnd()
310 if (ep == NULL || ep->e_type == NODE) in upperbnd()
338 ep->e_type == NODE ? "NODE" : "LEAF"); in badentry()
H A Drestore.c91 if (type == NODE) { in addfile()
105 if (type == NODE) in addfile()
128 if (ep->e_type != NODE) in deletefile()
335 if (type == NODE) in nodeupdates()
366 if (ip->e_type == NODE) { in nodeupdates()
389 if (type == NODE) in nodeupdates()
803 if (ep->e_type == NODE) { in createlinks()
828 if (ep->e_type == NODE) in checkrestore()
/freebsd-13.1/contrib/libarchive/libarchive/
H A Darchive_ppmd7.c73 #define NODE(ptr) (ptr) macro
199 CPpmd7_Node *node = NODE(next); in GlueFreeBlocks()
201 n = NODE(n)->Prev = next; in GlueFreeBlocks()
207 NODE(head)->Stamp = 1; in GlueFreeBlocks()
208 NODE(head)->Next = n; in GlueFreeBlocks()
209 NODE(n)->Prev = head; in GlueFreeBlocks()
216 CPpmd7_Node *node = NODE(n); in GlueFreeBlocks()
220 CPpmd7_Node *node2 = NODE(n) + nu; in GlueFreeBlocks()
224 NODE(node2->Prev)->Next = node2->Next; in GlueFreeBlocks()
232 for (n = NODE(head)->Next; n != head;) in GlueFreeBlocks()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/
H A DSymbolTableListTraits.h49 #define DEFINE_SYMBOL_TABLE_PARENT_TYPE(NODE, PARENT) \ argument
50 template <> struct SymbolTableListParentType<NODE> { using type = PARENT; };
/freebsd-13.1/contrib/subversion/subversion/libsvn_fs_base/notes/
H A DTODO50 of the NODE-REVISION skel (instead of seeing stuff like
65 We should move as much real content out of the NODE-REVISION skel as
69 The NODE-REVISION skel should simply contain a key into that table.
72 table should be of the form `NODE-ID ENTRY-NAME NODE-REVISION', and
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AVR/
H A DAVRISelLowering.cpp244 NODE(CALL); in getTargetNodeName()
246 NODE(LSL); in getTargetNodeName()
247 NODE(LSR); in getTargetNodeName()
248 NODE(ROL); in getTargetNodeName()
249 NODE(ROR); in getTargetNodeName()
250 NODE(ASR); in getTargetNodeName()
256 NODE(BRCOND); in getTargetNodeName()
257 NODE(CMP); in getTargetNodeName()
258 NODE(CMPC); in getTargetNodeName()
259 NODE(TST); in getTargetNodeName()
[all …]
/freebsd-13.1/usr.sbin/makefs/
H A Dwalk.c61 static void apply_specdir(const char *, NODE *, fsnode *, int);
62 static void apply_specentry(const char *, NODE *, fsnode *);
311 NODE *root; in apply_specfile()
341 apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly) in apply_specdir()
344 NODE *curnode; in apply_specdir()
475 apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode) in apply_specentry()

12