/freebsd/contrib/llvm-project/llvm/include/llvm/Demangle/ |
H A D | ItaniumNodes.def | 11 #ifndef NODE 16 NODE(DotSuffix) 18 NODE(QualType) 23 NODE(NameType) 24 NODE(AbiTagAttr) 30 NODE(ArrayType) 41 NODE(LocalName) 65 NODE(DtorName) 76 NODE(CastExpr) 79 NODE(NewExpr) [all …]
|
/freebsd/usr.bin/tsort/ |
H A D | tsort.c | 93 static int find_cycle(NODE *, NODE *, int, int); 194 NODE *n1; in add_arc() 195 NODE *n2; in add_arc() 226 static NODE * 230 NODE *n; in get_node() 281 NODE *n; in clear_cycle() 291 NODE *n, *next; in tsort() 352 remove_node(NODE *n) in remove_node() 354 NODE **np; in remove_node() 369 find_cycle(NODE *from, NODE *to, int longest_len, int depth) in find_cycle() [all …]
|
/freebsd/usr.bin/ctags/ |
H A D | tree.c | 41 static void add_node(NODE *, NODE *); 42 static void free_tree(NODE *); 51 NODE *np; in pfnote() 56 if (!(np = (NODE *)malloc(sizeof(NODE)))) { in pfnote() 61 if (!(head = np = (NODE *)malloc(sizeof(NODE)))) in pfnote() 89 add_node(NODE *node, NODE *cur_node) in add_node() 117 free_tree(NODE *node) in free_tree() 119 NODE *node_next; in free_tree()
|
H A D | ctags.h | 65 } NODE; typedef 68 extern NODE *head; /* head of the sorted binary tree */ 87 extern void put_entries(NODE *);
|
H A D | print.c | 91 put_entries(NODE *node) in put_entries()
|
/freebsd/contrib/mtree/ |
H A D | spec.c | 100 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 D | specspec.c | 56 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 D | extern.h | 64 int compare(NODE *, FTSENT *); 67 void dump_nodes(FILE *, const char *, NODE *, int); 69 int matchtags(NODE *);
|
H A D | mtree.h | 108 } NODE; typedef 124 NODE *spec(FILE *); 126 void free_nodes(NODE *);
|
H A D | verify.c | 60 static NODE *root; 63 static void miss(NODE *, char *); 82 NODE *ep, *level; in vwalk() 172 miss(NODE *p, char *tail) in miss()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/M68k/ |
H A D | M68kInstrShiftRotate.td | 55 class MxSR_DD<string MN, MxType TYPE, SDNode NODE, bit RODI, bits<2> ROOP> 58 [(set TYPE.VT:$dst, (NODE TYPE.VT:$src, TYPE.VT:$opd))]> { 64 class MxSR_DI<string MN, MxType TYPE, SDNode NODE, bit RODI, bits<2> ROOP> 69 (NODE TYPE.VT:$src, 75 multiclass MxSROp<string MN, SDNode NODE, bit RODI, bits<2> ROOP> { 80 def NAME#"8dd" : MxSR_DD<MN, MxType8d, NODE, RODI, ROOP>; 81 def NAME#"16dd" : MxSR_DD<MN, MxType16d, NODE, RODI, ROOP>; 82 def NAME#"32dd" : MxSR_DD<MN, MxType32d, NODE, RODI, ROOP>; 84 def NAME#"8di" : MxSR_DI<MN, MxType8d, NODE, RODI, ROOP>; 85 def NAME#"16di" : MxSR_DI<MN, MxType16d, NODE, RODI, ROOP>; [all …]
|
H A D | M68kInstrArithmetic.td | 195 multiclass MxBiArOp_DF<string MN, SDNode NODE, bit isComm, 200 def NAME#SZ#"dk" : MxBiArOp_R_RM<MN, NODE, 206 def NAME#SZ#"dq" : MxBiArOp_R_RM<MN, NODE, 212 def NAME#SZ#"dp" : MxBiArOp_R_RM<MN, NODE, 218 def NAME#SZ#"df" : MxBiArOp_R_RM<MN, NODE, 224 def NAME#SZ#"dj" : MxBiArOp_R_RM<MN, NODE, 230 def NAME#SZ#"di" : MxBiArOp_R_RI_xEA<MN, NODE, 265 def NAME#SZ#"dd" : MxBiArOp_R_RR_xEA<MN, NODE, 272 def NAME#SZ#"dr" : MxBiArOp_R_RR_xEA<MN, NODE, 380 def NAME#SZ#"dd" : MxBiArOp_R_RR_EAd<MN, NODE, [all …]
|
H A D | M68kInstrBits.td | 133 multiclass MxBITPatR<MxInst INSTd, MxInst INSTi, SDNode NODE> { 134 def : Pat<(NODE MxType32d.VT:$dst, MxType32d.VT:$bitno), 136 def : Pat<(NODE MxType32d.VT:$dst, MxType32d.IPat:$bitno), 142 multiclass MxBITPatM<MxInst INSTd, MxInst INSTi, SDNode NODE, MxType TYPE, 144 def : Pat<(NODE (TYPE.Load MEMPat:$dst), TYPE.VT:$bitno), 146 def : Pat<(NODE (TYPE.Load MEMPat:$dst), TYPE.IPat:$bitno),
|
/freebsd/sys/contrib/libsodium/dist-build/ |
H A D | emscripten.sh | 126 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/share/examples/netgraph/ |
H A D | virtual.lan | 173 for NODE in ${TARGET_TOPOLOGY}; do 179 NODE_NAME=`echo ${NODE} | awk -F"|" '{print $1}'` 180 NODE_IP=`echo ${NODE} | awk -F"|" '{print $2}'` 293 for NODE in ${OBJECTS}; do 294 jail -r ${NODE}
|
H A D | virtual.chain | 304 for NODE in ${OBJECTS}; do 305 jail -r ${NODE}
|
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyISelLowering.h | 26 #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/sbin/restore/ |
H A D | utilities.c | 68 ep = addentry(name, pathsearch(name)->d_ino, NODE); in pathcheck() 135 if (np->e_type != NODE) in newnode() 154 if (ep->e_type != NODE) in removenode() 284 if (ep == NULL || ep->e_type == NODE) in lowerbnd() 302 if (ep == NULL || ep->e_type == NODE) in upperbnd() 330 ep->e_type == NODE ? "NODE" : "LEAF"); in badentry()
|
H A D | restore.c | 82 if (type == NODE) { in addfile() 96 if (type == NODE) in addfile() 119 if (ep->e_type != NODE) in deletefile() 326 if (type == NODE) in nodeupdates() 357 if (ip->e_type == NODE) { in nodeupdates() 380 if (type == NODE) in nodeupdates() 794 if (ep->e_type == NODE) { in createlinks() 819 if (ep->e_type == NODE) in checkrestore()
|
/freebsd/contrib/libarchive/libarchive/ |
H A D | archive_ppmd7.c | 73 #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/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | SymbolTableListTraits.h | 49 #define DEFINE_SYMBOL_TABLE_PARENT_TYPE(NODE, PARENT) \ argument 50 template <> struct SymbolTableListParentType<NODE> { using type = PARENT; };
|
/freebsd/usr.sbin/makefs/ |
H A D | walk.c | 57 static void apply_specdir(const char *, NODE *, fsnode *, int); 58 static void apply_specentry(const char *, NODE *, fsnode *); 307 NODE *root; in apply_specfile() 337 apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly) in apply_specdir() 340 NODE *curnode; in apply_specdir() 471 apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode) in apply_specentry()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AVR/ |
H A D | AVRISelLowering.cpp | 250 NODE(CALL); in getTargetNodeName() 252 NODE(LSL); in getTargetNodeName() 253 NODE(LSLW); in getTargetNodeName() 254 NODE(LSR); in getTargetNodeName() 255 NODE(LSRW); in getTargetNodeName() 256 NODE(ROL); in getTargetNodeName() 257 NODE(ROR); in getTargetNodeName() 258 NODE(ASR); in getTargetNodeName() 266 NODE(CMP); in getTargetNodeName() 268 NODE(TST); in getTargetNodeName() [all …]
|
/freebsd/sys/powerpc/psim/ |
H A D | iobusvar.h | 47 IOBUS_ACCESSOR(node, NODE, phandle_t)
|
/freebsd/sys/xen/xenbus/ |
H A D | xenbusvar.h | 94 XENBUS_ACCESSOR(node, NODE, const char *)
|