Home
last modified time | relevance | path

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

123

/freebsd-12-stable/contrib/gcc/cp/
Dcp-tree.h167 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \ argument
168 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
170 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \ argument
171 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
173 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \ argument
174 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
176 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \ argument
177 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM)
180 #define NON_THUNK_FUNCTION_CHECK(NODE) __extension__ \ argument
181 ({ const tree __t = (NODE); \
[all …]
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-stable/contrib/gcc/
Dtree.h173 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE))) argument
177 #define OMP_DIRECTIVE_P(NODE) \ argument
178 (TREE_CODE (NODE) == OMP_PARALLEL \
179 || TREE_CODE (NODE) == OMP_FOR \
180 || TREE_CODE (NODE) == OMP_SECTIONS \
181 || TREE_CODE (NODE) == OMP_SINGLE \
182 || TREE_CODE (NODE) == OMP_SECTION \
183 || TREE_CODE (NODE) == OMP_MASTER \
184 || TREE_CODE (NODE) == OMP_ORDERED \
185 || TREE_CODE (NODE) == OMP_CRITICAL \
[all …]
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
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
734 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
735 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \ argument
736 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_STMT (NODE))
752 #define DECL_ANON_UNION_ELEMS(NODE) DECL_ARGUMENTS ((NODE)) argument
755 #define DECL_C_BIT_FIELD(NODE) \ argument
[all …]
/freebsd-12-stable/usr.bin/tsort/
Dtsort.c83 typedef struct node_str NODE; typedef
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 *n1; in add_arc()
206 NODE *n2; in add_arc()
[all …]
/freebsd-12-stable/usr.bin/ctags/
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()
Dctags.h70 } NODE; typedef
73 extern NODE *head; /* head of the sorted binary tree */
92 extern void put_entries(NODE *);
/freebsd-12-stable/contrib/mtree/
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 *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 …]
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()
Dextern.h64 int compare(NODE *, FTSENT *);
67 void dump_nodes(FILE *, const char *, NODE *, int);
69 int matchtags(NODE *);
Dmtree.h108 } NODE; typedef
124 NODE *spec(FILE *);
126 void free_nodes(NODE *);
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-stable/contrib/llvm-project/llvm/lib/Target/M68k/
DM68kInstrArithmetic.td91 class MxBiArOp_RFRR_xEA<string MN, SDNode NODE, MxType TYPE, bits<4> CMD, MxBead REG>
94 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.VT:$opd))],
107 class MxBiArOp_RFRR_EAd<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
110 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.VT:$opd))],
116 class MxBiArOp_RFRI_xEA<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
119 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.IPat:$opd))],
128 class MxBiArOp_RFRI<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
131 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, TYPE.IPat:$opd))],
137 class MxBiArOp_RFRM<string MN, SDNode NODE, MxType TYPE, MxOperand OPD, ComplexPattern PAT,
141 [(set TYPE.VT:$dst, CCR, (NODE TYPE.VT:$src, (TYPE.Load PAT:$opd)))],
[all …]
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 …]
/freebsd-12-stable/sys/contrib/libsodium/dist-build/
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-stable/usr.sbin/fmtree/
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()
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()
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()
Dextern.h35 int compare(char *, NODE *, FTSENT *);
44 NODE *mtree_readspec(FILE *fi);
/freebsd-12-stable/contrib/gcclibs/libcpp/include/
Dsymtab.h34 #define HT_LEN(NODE) ((NODE)->len) argument
35 #define HT_STR(NODE) ((NODE)->str) argument
/freebsd-12-stable/share/examples/netgraph/
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-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
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-12-stable/sbin/restore/
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()
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()

123