| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Demangle/ |
| HD | ItaniumNodes.def | 11 #ifndef NODE 12 #error Define NODE to handle nodes 15 NODE(NodeArrayNode) 16 NODE(DotSuffix) 17 NODE(VendorExtQualType) 18 NODE(QualType) 19 NODE(ConversionOperatorType) 20 NODE(PostfixQualifiedType) 21 NODE(ElaboratedTypeSpefType) 22 NODE(TransformedType) [all …]
|
| /freebsd-13-stable/usr.bin/tsort/ |
| HD | tsort.c | 81 typedef struct node_str NODE; typedef 84 NODE **n_prevp; /* pointer to previous node's n_next */ 85 NODE *n_next; /* next node in graph */ 86 NODE **n_arcs; /* array of arcs to other nodes */ 100 static NODE *graph, **cycle_buf, **longest_cycle; 104 static int find_cycle(NODE *, NODE *, int, int); 105 static NODE *get_node(char *); 107 static void remove_node(NODE *); 205 NODE *n1; in add_arc() 206 NODE *n2; in add_arc() [all …]
|
| /freebsd-13-stable/usr.bin/ctags/ |
| HD | tree.c | 47 static void add_node(NODE *, NODE *); 48 static void free_tree(NODE *); 57 NODE *np; in pfnote() 62 if (!(np = (NODE *)malloc(sizeof(NODE)))) { in pfnote() 67 if (!(head = np = (NODE *)malloc(sizeof(NODE)))) in pfnote() 95 add_node(NODE *node, NODE *cur_node) in add_node() 123 free_tree(NODE *node) in free_tree() 125 NODE *node_next; in free_tree()
|
| HD | ctags.h | 68 } NODE; typedef 71 extern NODE *head; /* head of the sorted binary tree */ 90 extern void put_entries(NODE *);
|
| /freebsd-13-stable/contrib/mtree/ |
| HD | spec.c | 100 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 *centry, *last, *pathparent, *cur; in spec() 114 NODE ginfo, *root; in spec() 207 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL) in spec() 268 free_nodes(NODE *root) in free_nodes() [all …]
|
| HD | 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()
|
| HD | extern.h | 64 int compare(NODE *, FTSENT *); 67 void dump_nodes(FILE *, const char *, NODE *, int); 69 int matchtags(NODE *);
|
| HD | mtree.h | 108 } NODE; typedef 124 NODE *spec(FILE *); 126 void free_nodes(NODE *);
|
| HD | 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-13-stable/contrib/llvm-project/llvm/lib/Target/M68k/ |
| HD | 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 …]
|
| HD | M68kInstrArithmetic.td | 68 class MxBiArOp_R_RR_xEA<string MN, SDNode NODE, MxType DST_TYPE, MxType SRC_TYPE, 72 [(set DST_TYPE.VT:$dst, CCR, (NODE DST_TYPE.VT:$src, SRC_TYPE.VT:$opd))]> { 89 class MxBiArOp_R_RR_EAd<string MN, SDNode NODE, MxType TYPE, bits<4> CMD> 92 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.VT:$opd))]> { 102 class MxBiArOp_R_RM<string MN, SDNode NODE, MxType TYPE, MxOperand OPD, ComplexPattern PAT, 106 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, (TYPE.Load PAT:$opd)))]> { 130 class MxBiArOp_R_RI_xEA<string MN, SDNode NODE, MxType TYPE, bits<4> CMD> 133 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.IPat:$opd))]> { 145 class MxBiArOp_R_RI<string MN, SDNode NODE, MxType TYPE, bits<4> CMD> 148 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.IPat:$opd))]> { [all …]
|
| HD | 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-13-stable/sys/contrib/libsodium/dist-build/ |
| HD | 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-13-stable/usr.sbin/fmtree/ |
| HD | spec.c | 52 static void set(char *, NODE *); 53 static void unset(char *, NODE *); 55 NODE * 58 NODE *centry, *last; in mtree_readspec() 60 NODE ginfo, *root; in mtree_readspec() 138 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL) in mtree_readspec() 164 set(char *t, NODE *ip) in set() 315 unset(char *t, NODE *ip) in unset()
|
| HD | specspec.c | 45 shownode(NODE *n, int f, char const *path) in shownode() 91 mismatch(NODE *n1, NODE *n2, int differ, char const *path) in mismatch() 113 compare_nodes(NODE *n1, NODE *n2, char const *path) in compare_nodes() 174 walk_in_the_forest(NODE *t1, NODE *t2, char const *path) in walk_in_the_forest() 177 NODE *c1, *c2, *n1, *n2; in walk_in_the_forest() 245 NODE *root1, *root2; in mtree_specspec()
|
| HD | verify.c | 48 static NODE *root; 51 static void miss(NODE *, char *); 76 NODE *ep, *level; in vwalk() 159 miss(NODE *p, char *tail) in miss()
|
| HD | extern.h | 34 int compare(char *, NODE *, FTSENT *); 43 NODE *mtree_readspec(FILE *fi);
|
| /freebsd-13-stable/share/examples/netgraph/ |
| HD | 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}
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| HD | 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-13-stable/sbin/restore/ |
| HD | utilities.c | 74 ep = addentry(name, pathsearch(name)->d_ino, NODE); in pathcheck() 141 if (np->e_type != NODE) in newnode() 160 if (ep->e_type != NODE) in removenode() 290 if (ep == NULL || ep->e_type == NODE) in lowerbnd() 308 if (ep == NULL || ep->e_type == NODE) in upperbnd() 336 ep->e_type == NODE ? "NODE" : "LEAF"); in badentry()
|
| HD | restore.c | 89 if (type == NODE) { in addfile() 103 if (type == NODE) in addfile() 126 if (ep->e_type != NODE) in deletefile() 333 if (type == NODE) in nodeupdates() 364 if (ip->e_type == NODE) { in nodeupdates() 387 if (type == NODE) in nodeupdates() 801 if (ep->e_type == NODE) { in createlinks() 826 if (ep->e_type == NODE) in checkrestore()
|
| /freebsd-13-stable/contrib/libarchive/libarchive/ |
| HD | archive_ppmd7.c | 73 #define NODE(ptr) (ptr) macro 75 #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs))) 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() [all …]
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
| HD | SymbolTableListTraits.h | 49 #define DEFINE_SYMBOL_TABLE_PARENT_TYPE(NODE, PARENT) \ argument 50 template <> struct SymbolTableListParentType<NODE> { using type = PARENT; };
|
| /freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/notes/ |
| HD | TODO | 50 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-stable/usr.sbin/makefs/ |
| HD | walk.c | 59 static void apply_specdir(const char *, NODE *, fsnode *, int); 60 static void apply_specentry(const char *, NODE *, fsnode *); 309 NODE *root; in apply_specfile() 339 apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly) in apply_specdir() 342 NODE *curnode; in apply_specdir() 473 apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode) in apply_specentry()
|