Home
last modified time | relevance | path

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

123

/freebsd-12.1/contrib/gcc/cp/
H A Dcp-tree.h194 #define NON_THUNK_FUNCTION_CHECK(NODE) (NODE) argument
195 #define THUNK_FUNCTION_CHECK(NODE) (NODE) argument
309 #define OVL_CHAIN(NODE) TREE_CHAIN (NODE) argument
312 ((TREE_CODE (NODE) == OVERLOAD) ? OVL_FUNCTION (NODE) : (NODE))
318 #define OVL_USED(NODE) TREE_USED (NODE) argument
1476 #define BV_FN(NODE) (TREE_VALUE (NODE)) argument
1981 #define FROB_CONTEXT(NODE) ((NODE) == global_namespace ? NULL_TREE : (NODE)) argument
2043 (DECL_NAMESPACE_ALIAS (NODE) ? DECL_NAMESPACE_ALIAS (NODE) : (NODE))
2163 #define TI_ARGS(NODE) (TREE_VALUE (NODE)) argument
2181 (NODE && TREE_VEC_ELT (NODE, 0) \
[all …]
H A Dname-lookup.h61 #define LOCAL_BINDING_P(NODE) ((NODE)->is_local) argument
65 #define INHERITED_VALUE_BINDING_P(NODE) ((NODE)->value_is_inherited) argument
/freebsd-12.1/contrib/gcc/
H A Dtree.h887 #define TREE_TYPE(NODE) ((NODE)->common.type) argument
906 #define TREE_CHAIN(NODE) ((NODE)->common.chain) argument
1017 (COMPLETE_TYPE_P (NODE) || VOID_TYPE_P (NODE))
1021 (COMPLETE_TYPE_P (TREE_CODE (NODE) == ARRAY_TYPE ? TREE_TYPE (NODE) : (NODE)))
1168 (DECL_P (NODE) && TREE_READONLY (NODE))
1381 ((void) TREE_VEC_CHECK (NODE), &((NODE)->vec.a[(NODE)->vec.length]))
1547 #define ASM_INPUT_P(NODE) (TREE_STATIC (NODE)) argument
2004 #define TYPE_STUB_DECL(NODE) TREE_CHAIN (NODE) argument
2438 (DECL_ABSTRACT_ORIGIN (NODE) ? DECL_ABSTRACT_ORIGIN (NODE) : (NODE))
2445 && DECL_ABSTRACT_ORIGIN (NODE) != (NODE))
[all …]
H A Dtree-chrec.h26 #define CHREC_VAR(NODE) TREE_OPERAND (NODE, 0) argument
27 #define CHREC_LEFT(NODE) TREE_OPERAND (NODE, 1) argument
28 #define CHREC_RIGHT(NODE) TREE_OPERAND (NODE, 2) argument
29 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE)) argument
H A Dc-common.h725 #define STATEMENT_LIST_STMT_EXPR(NODE) \ argument
726 TREE_LANG_FLAG_1 (STATEMENT_LIST_CHECK (NODE))
729 #define STATEMENT_LIST_HAS_LABEL(NODE) \ argument
730 TREE_LANG_FLAG_3 (STATEMENT_LIST_CHECK (NODE))
733 #define COMPOUND_LITERAL_EXPR_DECL_STMT(NODE) \ argument
735 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ argument
752 #define DECL_ANON_UNION_ELEMS(NODE) DECL_ARGUMENTS ((NODE)) argument
755 #define DECL_C_BIT_FIELD(NODE) \ argument
757 #define SET_DECL_C_BIT_FIELD(NODE) \ argument
758 (DECL_LANG_FLAG_4 (FIELD_DECL_CHECK (NODE)) = 1)
[all …]
/freebsd-12.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-12.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-12.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()
170 miss(NODE *p, char *tail) in miss()
/freebsd-12.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-12.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 Dverify.c50 static NODE *root;
53 static void miss(NODE *, char *);
78 NODE *ep, *level; in vwalk()
159 miss(NODE *p, char *tail) in miss()
H A Dextern.h35 int compare(char *, NODE *, FTSENT *);
44 NODE *mtree_readspec(FILE *fi);
/freebsd-12.1/contrib/gcclibs/libcpp/include/
H A Dsymtab.h34 #define HT_LEN(NODE) ((NODE)->len) argument
35 #define HT_STR(NODE) ((NODE)->str) argument
H A Dcpplib.h571 #define HT_NODE(NODE) ((ht_identifier *) (NODE)) argument
572 #define NODE_LEN(NODE) HT_LEN (&(NODE)->ident) argument
573 #define NODE_NAME(NODE) HT_STR (&(NODE)->ident) argument
/freebsd-12.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}
/freebsd-12.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-12.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-12.1/contrib/llvm/include/llvm/IR/
H A DSymbolTableListTraits.h50 #define DEFINE_SYMBOL_TABLE_PARENT_TYPE(NODE, PARENT) \ argument
51 template <> struct SymbolTableListParentType<NODE> { using type = PARENT; };

123