Searched refs:NODE (Results 1 - 25 of 68) sorted by relevance

123

/freebsd-9.3-release/contrib/texinfo/info/
H A Dman.h30 extern NODE *make_manpage_node (char *pagename);
31 extern NODE *get_manpage_node (FILE_BUFFER *file_buffer,
34 extern long locate_manpage_xref (NODE *node, long int start, int dir);
35 extern REFERENCE **xrefs_of_manpage (NODE *node);
36 extern REFERENCE **manpage_xrefs_in_binding (NODE *node,
H A Dinfo-utils.h61 found in NODE. If there is no menu in NODE, just return a NULL pointer. */
62 extern REFERENCE **info_menu_of_node (NODE *node);
65 refrences found in NODE. If there are no cross references in NODE, just
67 extern REFERENCE **info_xrefs_of_node (NODE *node);
107 /* Return non-zero if NODE is one especially created by Info. */
108 extern int internal_info_node_p (NODE *node);
110 /* Make NODE appear to be one especially created by Info, and give it NAME. */
111 extern void name_internal_node (NODE *nod
[all...]
H A Dfootnotes.c30 NODE * make_footnotes_node (NODE *node);
51 return the manufactured node. If NODE has no footnotes, return a
53 NODE *
54 make_footnotes_node (NODE *node)
56 NODE *fn_node, *result = (NODE *)NULL;
115 return ((NODE *)NULL);
118 result = (NODE *)xmalloc (sizeof (NODE));
[all...]
H A Dwindow.h48 NODE *node; /* The node displayed in this window. */ \
50 long point /* Offset within NODE of the cursor position. */
113 /* Make a new window showing NODE, and return that window structure.
114 The new window is made to be the active window. If NODE is passed
118 extern WINDOW *window_make_window (NODE *node);
131 /* Set WINDOW to display NODE. */
132 extern void window_set_node_of_window (WINDOW *window, NODE *node);
170 extern NODE *build_message_node (char *format, void *arg1, void *arg2);
180 extern NODE *message_buffer_to_node (void);
205 /* Quickly guess the approximate number of lines to that NODE woul
[all...]
H A Dnodes.h32 be passed to free (). Note that NODE->parent is non-null if this
33 node's file is a subfile. In that case, NODE->parent is the logical
45 } NODE; typedef in typeref:struct:__anon4240
47 /* Defines that can appear in NODE->flags. All informative. */
135 /* Return a pointer to a NODE structure for the Info node (FILENAME)NODENAME.
139 extern NODE *info_get_node (char *filename, char *nodename);
141 /* Return a pointer to a NODE structure for the Info node NODENAME in
145 extern NODE *info_get_node_of_file_buffer (char *nodename,
H A Dsession.h68 extern void remember_window_and_node (WINDOW *window, NODE *node);
72 NODE *node);
77 extern long info_search_in_node (char *string, NODE *node,
79 extern long info_target_search_node (NODE *node, char *string,
83 extern void print_node (NODE *node);
84 extern void dump_node_to_file (NODE *node, char *filename,
109 extern void begin_info_session (NODE *initial_node);
110 extern void begin_info_session_with_error (NODE *initial_node,
113 extern void initialize_info_session (NODE *node, int clear_screen);
116 NODE *initial_nod
[all...]
H A Dnodemenu.c25 NODE * get_visited_nodes (Function *filter_func);
37 /* Produce a formatted line of information about NODE. Here is what we want
48 format_node_info (NODE *node)
128 of NODE, and returns non-zero if the node should appear in the listing. */
129 NODE *
134 NODE *node;
139 return ((NODE *)NULL);
227 NODE *node;
259 new = window_make_window ((NODE *)NULL);
307 NODE *nod
[all...]
/freebsd-9.3-release/contrib/gcc/cp/
H A Dcp-tree.h167 #define VAR_OR_FUNCTION_DECL_CHECK(NODE) \
168 TREE_CHECK2(NODE,VAR_DECL,FUNCTION_DECL)
170 #define VAR_FUNCTION_OR_PARM_DECL_CHECK(NODE) \
171 TREE_CHECK3(NODE,VAR_DECL,FUNCTION_DECL,PARM_DECL)
173 #define VAR_TEMPL_TYPE_OR_FUNCTION_DECL_CHECK(NODE) \
174 TREE_CHECK4(NODE,VAR_DECL,FUNCTION_DECL,TYPE_DECL,TEMPLATE_DECL)
176 #define BOUND_TEMPLATE_TEMPLATE_PARM_TYPE_CHECK(NODE) \
177 TREE_CHECK(NODE,BOUND_TEMPLATE_TEMPLATE_PARM)
180 #define NON_THUNK_FUNCTION_CHECK(NODE) __extension__ \
181 ({ const tree __t = (NODE); \
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dtree.h171 /* Returns nonzero iff NODE is an expression of some kind. */
173 #define EXPR_P(NODE) IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (TREE_CODE (NODE)))
175 /* Returns nonzero iff NODE is an OpenMP directive. */
177 #define OMP_DIRECTIVE_P(NODE) \
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)
[all...]
H A Dtree-chrec.h26 #define CHREC_VAR(NODE) TREE_OPERAND (NODE, 0)
27 #define CHREC_LEFT(NODE) TREE_OPERAND (NODE, 1)
28 #define CHREC_RIGHT(NODE) TREE_OPERAND (NODE, 2)
29 #define CHREC_VARIABLE(NODE) TREE_INT_CST_LOW (CHREC_VAR (NODE))
H A Dc-common.h718 #define STATEMENT_LIST_STMT_EXPR(NODE) \
719 TREE_LANG_FLAG_1 (STATEMENT_LIST_CHECK (NODE))
722 #define STATEMENT_LIST_HAS_LABEL(NODE) \
723 TREE_LANG_FLAG_3 (STATEMENT_LIST_CHECK (NODE))
726 #define COMPOUND_LITERAL_EXPR_DECL_STMT(NODE) \
727 TREE_OPERAND (COMPOUND_LITERAL_EXPR_CHECK (NODE), 0)
728 #define COMPOUND_LITERAL_EXPR_DECL(NODE) \
729 DECL_EXPR_DECL (COMPOUND_LITERAL_EXPR_DECL_STMT (NODE))
745 #define DECL_ANON_UNION_ELEMS(NODE) DECL_ARGUMENTS ((NODE))
[all...]
/freebsd-9.3-release/usr.bin/make/
H A Dlst.h114 #define Lst_Replace(NODE, D) ((void)((NODE)->datum = (D)))
128 #define Lst_Succ(NODE) (((NODE) == NULL) ? NULL : (NODE)->nextPtr)
129 #define LST_NEXT(NODE) ((NODE)->nextPtr)
131 #define Lst_Datum(NODE) ((NODE)->datum)
/freebsd-9.3-release/usr.bin/ctags/
H A Dtree.c47 static void add_node(NODE *, NODE *);
48 static void free_tree(NODE *);
57 NODE *np;
62 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
67 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
95 add_node(NODE *node, NODE *cur_nod
[all...]
H A Dctags.h68 } NODE; typedef in typeref:struct:nd_st
71 extern NODE *head; /* head of the sorted binary tree */
90 extern void put_entries(NODE *);
/freebsd-9.3-release/contrib/mtree/
H A Dextern.h63 int compare(NODE *, FTSENT *);
66 void dump_nodes(const char *, NODE *, int);
68 int matchtags(NODE *);
H A Dspec.c99 static void replacenode(NODE *, NODE *);
100 static void set(char *, NODE *);
101 static void unset(char *, NODE *);
102 static void addchild(NODE *, NODE *);
103 static int nodecmp(const NODE *, const NODE *);
108 NODE *
111 NODE *centr
[all...]
H A Dspecspec.c56 shownode(NODE *n, int f, char const *path)
106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
193 walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
196 NODE *c1, *c2, *n1, *n2;
264 NODE *root1, *root2;
H A Dmtree.h108 } NODE; typedef in typeref:struct:_node
124 NODE *spec(FILE *);
126 void free_nodes(NODE *);
/freebsd-9.3-release/usr.bin/tsort/
H A Dtsort.c81 typedef struct node_str NODE; typedef in typeref:struct:node_str
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 NODE *graph, **cycle_buf, **longest_cycle;
104 int find_cycle(NODE *, NODE *, int, int);
105 NODE *get_node(char *);
107 void remove_node(NODE *);
203 NODE *n
[all...]
/freebsd-9.3-release/contrib/gcclibs/libcpp/include/
H A Dsymtab.h34 #define HT_LEN(NODE) ((NODE)->len)
35 #define HT_STR(NODE) ((NODE)->str)
/freebsd-9.3-release/usr.sbin/mtree/
H A Dextern.h35 int compare(char *, NODE *, FTSENT *);
44 NODE *mtree_readspec(FILE *fi);
H A Dspec.c54 static void set(char *, NODE *);
55 static void unset(char *, NODE *);
57 NODE *
60 NODE *centry, *last;
62 NODE ginfo, *root;
140 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
166 set(char *t, NODE *ip)
317 unset(char *t, NODE *ip)
H A Dspecspec.c47 shownode(NODE *n, int f, char const *path)
93 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
115 compare_nodes(NODE *n1, NODE *n2, char const *path)
176 walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
179 NODE *c1, *c2, *n1, *n2;
247 NODE *root1, *root2;
/freebsd-9.3-release/sys/powerpc/psim/
H A Diobusvar.h47 IOBUS_ACCESSOR(node, NODE, phandle_t)
/freebsd-9.3-release/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}

Completed in 148 milliseconds

123