Searched refs:node (Results 1 - 25 of 871) sorted by relevance

1234567891011>>

/freebsd-10-stable/bin/sh/
H A Dredir.h40 union node;
41 void redirect(union node *, int);
H A Dshow.h33 void showtree(union node *);
/freebsd-10-stable/contrib/gcc/
H A Dipa.c33 struct cgraph_node *node, *node2; local
45 for (node = cgraph_nodes; node; node = node->next)
46 node->aux = NULL;
47 for (node = cgraph_nodes; node; node = node
100 struct cgraph_node *node, *next; local
[all...]
H A Dprint-tree.c40 tree node; member in struct:bucket
46 /* Print the node NODE on standard error, for debugging.
51 debug_tree (tree node) argument
54 print_node (stderr, "", node, 0);
70 /* Print a node in brief fashion, with just the code, address and name. */
73 print_node_brief (FILE *file, const char *prefix, tree node, int indent) argument
77 if (node == 0)
80 class = TREE_CODE_CLASS (TREE_CODE (node));
82 /* Always print the slot this node is in, and its code, address and
86 fprintf (file, "%s <%s", prefix, tree_code_name[(int) TREE_CODE (node)]);
171 print_node(FILE *file, const char *prefix, tree node, int indent) argument
[all...]
H A Dcgraph.c31 Each function (external or not) corresponds to the unique node (in
46 from other compilation unit. Flag NEEDED is set for each node that may
63 For each inlined call, the callee's node is cloned to represent the
65 Each inlined call gets a unique corresponding clone node of the callee
103 static void cgraph_node_remove_callers (struct cgraph_node *node);
148 /* Last node in cgraph_asm_nodes. */
151 /* The order index of the next cgraph node to be created. This is
178 /* Allocate new callgraph node and insert it into basic data structures. */
182 struct cgraph_node *node; local
184 node
201 struct cgraph_node key, *node, **slot; local
236 cgraph_insert_node_to_hashtable(struct cgraph_node *node) argument
287 struct cgraph_node *node; local
314 cgraph_edge(struct cgraph_node *node, tree call_stmt) argument
494 cgraph_node_remove_callees(struct cgraph_node *node) argument
514 cgraph_node_remove_callers(struct cgraph_node *node) argument
529 cgraph_remove_node(struct cgraph_node *node) argument
617 cgraph_mark_reachable_node(struct cgraph_node *node) argument
634 cgraph_mark_needed_node(struct cgraph_node *node) argument
645 struct cgraph_node *node; local
657 struct cgraph_node *node; local
669 struct cgraph_node *node; local
681 cgraph_node_name(struct cgraph_node *node) argument
688 cgraph_varpool_node_name(struct cgraph_varpool_node *node) argument
699 dump_cgraph_node(FILE *f, struct cgraph_node *node) argument
777 struct cgraph_node *node; local
786 dump_cgraph_varpool_node(FILE *f, struct cgraph_varpool_node *node) argument
813 struct cgraph_varpool_node *node; local
845 struct cgraph_varpool_node key, *node, **slot; local
869 struct cgraph_varpool_node *node; local
900 cgraph_varpool_enqueue_needed_node(struct cgraph_varpool_node *node) argument
925 cgraph_varpool_mark_needed_node(struct cgraph_varpool_node *node) argument
939 decide_is_variable_needed(struct cgraph_varpool_node *node, tree decl) argument
980 struct cgraph_varpool_node *node = cgraph_varpool_node (decl); local
1012 struct cgraph_asm_node *node; local
1132 cgraph_unnest_node(struct cgraph_node *node) argument
1146 cgraph_function_body_availability(struct cgraph_node *node) argument
1183 cgraph_variable_initializer_availability(struct cgraph_varpool_node *node) argument
[all...]
H A Dcgraphunit.c181 walk_tree_without_duplicates doesn't guarantee each node is visited
194 decide_is_function_needed (struct cgraph_node *node, tree decl) argument
200 node->local.externally_visible = true;
205 if (node->local.externally_visible)
221 if (node->needed)
233 || (!optimize && !node->local.disregard_inline_limits
235 && !node->origin))
264 || (!node->local.disregard_inline_limits
268 && (!node->local.inlinable || !cgraph_default_inline_p (node, NUL
317 struct cgraph_varpool_node *next, *node = cgraph_varpool_nodes_queue; local
406 cgraph_reset_node(struct cgraph_node *node) argument
453 cgraph_lower_function(struct cgraph_node *node) argument
482 struct cgraph_node *node = cgraph_node (decl); local
583 cgraph_create_edges(struct cgraph_node *node, tree body) argument
613 walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes); local
627 walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes); local
638 initialize_inline_failed(struct cgraph_node *node) argument
662 struct cgraph_node *node = cgraph_node (current_function_decl); local
705 verify_cgraph_node(struct cgraph_node *node) argument
858 struct cgraph_node *node; local
869 cgraph_varpool_assemble_decl(struct cgraph_varpool_node *node) argument
901 struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue; local
927 struct cgraph_varpool_node *node = cgraph_varpool_assembled_nodes_queue; local
959 cgraph_analyze_function(struct cgraph_node *node) argument
1015 struct cgraph_node *node; local
1071 struct cgraph_node *node, *next; local
1200 struct cgraph_node *node; local
1245 cgraph_expand_function(struct cgraph_node *node) argument
1302 struct cgraph_node *node; local
1449 struct cgraph_node *node; local
1512 struct cgraph_node *node; local
1619 struct cgraph_node *node; local
1895 save_inline_function_body(struct cgraph_node *node) argument
[all...]
/freebsd-10-stable/contrib/gcc/cp/
H A Dptree.c33 cxx_print_decl (FILE *file, tree node, int indent) argument
35 if (TREE_CODE (node) == FIELD_DECL)
37 if (DECL_MUTABLE_P (node))
45 if (!CODE_CONTAINS_STRUCT (TREE_CODE (node), TS_DECL_COMMON)
46 || !DECL_LANG_SPECIFIC (node))
49 if (TREE_CODE (node) == FUNCTION_DECL
50 && DECL_PENDING_INLINE_INFO (node))
52 (void *) DECL_PENDING_INLINE_INFO (node));
53 if (TREE_CODE (node) == TYPE_DECL
54 && DECL_SORTED_FIELDS (node))
64 cxx_print_type(FILE *file, tree node, int indent) argument
152 cxx_print_identifier(FILE *file, tree node, int indent) argument
169 cxx_print_xnode(FILE *file, tree node, int indent) argument
[all...]
/freebsd-10-stable/sys/mips/nlm/hal/
H A Diomap.h45 #define XLP_IO_DEV(node, dev) ((dev) + (node) * 8)
46 #define XLP_HDR_OFFSET(node, bus, dev, fn) (((bus) << 20) | \
47 ((XLP_IO_DEV(node, dev)) << 15) | ((fn) << 12))
49 #define XLP_IO_BRIDGE_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 0)
51 #define XLP_IO_CIC0_OFFSET(node) XLP_HDR_OFFSET(node, 0, 0, 1)
52 #define XLP_IO_CIC1_OFFSET(node) XLP_HDR_OFFSET(node,
[all...]
/freebsd-10-stable/usr.sbin/makefs/cd9660/
H A Dcd9660_archimedes.c67 * Add "ARCHIMEDES" metadata to a node if that seems appropriate.
73 archimedes_convert_node(cd9660node *node) argument
80 if (node->su_tail_data != NULL)
84 len = strlen(node->node->name);
87 if (len >= 4 && node->node->name[len-4] == ',')
89 type = strtoul(node->node->name + len - 3, NULL, 16);
90 if (type == -1 && node
115 archimedes_convert_tree(cd9660node *node) argument
[all...]
/freebsd-10-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_c9x_recursive_init.c2 union node { union
8 union node n;
/freebsd-10-stable/sys/ofed/include/linux/
H A Dlinux_radix.c58 struct radix_tree_node *node; local
63 node = root->rnode;
67 while (height && node)
68 node = node->slots[radix_pos(index, height--)];
69 if (node)
70 item = node->slots[radix_pos(index, 0)];
80 struct radix_tree_node *node; local
86 node = root->rnode;
91 * Find the node an
126 struct radix_tree_node *node; local
[all...]
/freebsd-10-stable/contrib/ofed/libibverbs/src/
H A Dmemory.c123 static struct ibv_mem_node *__mm_prev(struct ibv_mem_node *node) argument
125 if (node->left) {
126 node = node->left;
127 while (node->right)
128 node = node->right;
130 while (node->parent && node == node
139 __mm_next(struct ibv_mem_node *node) argument
155 __mm_rotate_right(struct ibv_mem_node *node) argument
179 __mm_rotate_left(struct ibv_mem_node *node) argument
203 verify(struct ibv_mem_node *node) argument
229 __mm_add_rebalance(struct ibv_mem_node *node) argument
287 struct ibv_mem_node *node, *parent = NULL; local
311 __mm_remove(struct ibv_mem_node *node) argument
443 struct ibv_mem_node *node = mm_root; local
458 merge_ranges(struct ibv_mem_node *node, struct ibv_mem_node *prev) argument
468 split_range(struct ibv_mem_node *node, uintptr_t cut_line) argument
488 struct ibv_mem_node *node, *tmp = NULL; local
505 undo_node(struct ibv_mem_node *node, uintptr_t start, int inc) argument
537 struct ibv_mem_node *node, *tmp; local
[all...]
/freebsd-10-stable/usr.sbin/autofs/
H A Dcommon.h43 struct node { struct
44 TAILQ_ENTRY(node) n_next;
45 TAILQ_HEAD(nodehead, node) n_children;
46 struct node *n_parent;
76 struct node *node_new_root(void);
77 struct node *node_new(struct node *parent, char *key, char *options,
79 struct node *node_new_map(struct node *parent, char *key, char *options,
81 struct node *node_fin
[all...]
/freebsd-10-stable/contrib/groff/src/roff/troff/
H A Dnode.h50 struct node { struct
51 node *next;
52 node *last;
57 node();
58 node(node *);
59 node(node *, statem *, int);
60 node *add_char(charinfo *, environment *, hunits *, int *, node **
116 inline node::node() function in class:node
121 inline node::node(node *n) function in class:node
126 inline node::node(node *n, statem *s, int divlevel) function in class:node
[all...]
/freebsd-10-stable/contrib/ofed/management/infiniband-diags/src/
H A Dgrouping.c150 static uint64_t xsigo_chassisguid(Node *node) argument
152 if (!is_xsigo_ca(node->sysimgguid)) {
155 if (is_xsigo_switch(node->sysimgguid))
156 return node->sysimgguid & 0xffffffff00ffffffULL;
158 return node->sysimgguid;
161 if (!node->ports->remoteport)
162 return node->sysimgguid;
165 if (is_xsigo_leafone(node->ports->remoteport->node->sysimgguid))
166 return node
173 get_chassisguid(Node *node) argument
183 find_chassisguid(Node *node) argument
208 is_router(Node *node) argument
214 is_spine_9096(Node *node) argument
220 is_spine_9288(Node *node) argument
226 is_spine_2004(Node *node) argument
231 is_spine_2012(Node *node) argument
236 is_spine(Node *node) argument
242 is_line_24(Node *node) argument
249 is_line_8(Node *node) argument
254 is_line_2024(Node *node) argument
259 is_line(Node *node) argument
264 is_chassis_switch(Node *node) argument
285 get_sfb_slot(Node *node, Port *lineport) argument
311 get_router_slot(Node *node, Port *spineport) argument
383 fill_chassis_record(Node *node) argument
434 get_line_index(Node *node) argument
443 get_spine_index(Node *node) argument
457 insert_line_router(Node *node, ChassisList *chassislist) argument
468 insert_spine(Node *node, ChassisList *chassislist) argument
481 Node *node, *remnode; local
508 Node *node, *remnode; local
534 Node *node; local
553 build_chassis(Node *node, ChassisList *chassislist) argument
656 Node *node = port->node; local
707 Node *node; local
[all...]
H A Dibnetdiscover.c122 node_type_str2(Node *node) argument
124 switch(node->type) {
161 * Returns 0 if non switch node is found, 1 if switch is found, -1 if error.
164 get_node(Node *node, Port *port, ib_portid_t *portid) argument
168 void *pi = portinfo, *ni = node->nodeinfo, *nd = node->nodedesc;
174 mad_decode_field(ni, IB_NODE_GUID_F, &node->nodeguid);
175 mad_decode_field(ni, IB_NODE_TYPE_F, &node->type);
176 mad_decode_field(ni, IB_NODE_NPORTS_F, &node->numports);
177 mad_decode_field(ni, IB_NODE_DEVID_F, &node
226 dump_endnode(ib_portid_t *path, char *prompt, Node *node, Port *port) argument
248 Node *node; local
260 Node *node; local
284 find_port(Node *node, Port *port) argument
296 create_port(Node *node, Port *temp) argument
313 link_ports(Node *node, Port *port, Node *remotenode, Port *remoteport) argument
327 handle_port(Node *node, Port *port, ib_portid_t *path, int portnum, int dist) argument
382 Node *node; local
451 node_name(Node *node) argument
475 list_node(Node *node) argument
504 out_ids(Node *node, int group, char *chname) argument
534 out_switch(Node *node, int group, char *chname) argument
568 out_ca(Node *node, int group, char *chname) argument
688 Node *node; local
873 Node *node; local
[all...]
/freebsd-10-stable/usr.bin/ctags/
H A Dprint.c97 put_entries(NODE *node) argument
100 if (node->left)
101 put_entries(node->left);
104 node->entry, node->file, (node->lno + 63) / 64);
107 node->entry, node->lno, node->file, node
[all...]
/freebsd-10-stable/contrib/libucl/src/
H A Dtree.h24 * An AVL tree is headed by pointers to the root node and to a function defining
25 * the ordering relation between nodes. Each node contains an arbitrary payload
28 * the expense of direct access to the parent node given a pointer to one of the
34 * necessary to define a number of helper functions for each type of tree node.
37 * thereby defining the necessary functions, once per node tag in the program.
69 #define TREE_DEFINE(node, field) \
71 struct node *TREE_BALANCE_##node##_##field(struct node *); \
73 struct node *TREE_ROTL
[all...]
/freebsd-10-stable/contrib/ipfilter/lib/
H A Dprintpoolfield.c47 ip_pool_node_t *node = (ip_pool_node_t *)p; local
49 if (node->ipn_info)
51 a = &node->ipn_addr;
55 iphtent_t *node = (iphtent_t *)p; local
57 PRINTF("%s", inet_ntop(node->ipe_family,
58 &node->ipe_addr,
61 ipf_dstnode_t *node = (ipf_dstnode_t *)p; local
63 a = &node->ipfd_dest.fd_addr;
71 ip_pool_node_t *node = (ip_pool_node_t *)p; local
73 a = &node
77 iphtent_t *node = (iphtent_t *)p; local
93 ipf_dstnode_t *node = (ipf_dstnode_t *)p; local
106 ip_pool_node_t *node = (ip_pool_node_t *)p; local
114 iphtent_t *node = (iphtent_t *)p; local
128 ip_pool_node_t *node = (ip_pool_node_t *)p; local
136 iphtent_t *node = (iphtent_t *)p; local
150 ip_pool_node_t *node = (ip_pool_node_t *)p; local
154 iphtent_t *node = (iphtent_t *)p; local
158 ipf_dstnode_t *node = (ipf_dstnode_t *)p; local
[all...]
/freebsd-10-stable/sys/kern/
H A Dsubr_pctrie.c62 * These widths should allow the pointers to a node's children to fit within
76 /* Flag bits stored in node pointers. */
93 * Allocate a node. Pre-allocation should ensure that the request
100 struct pctrie_node *node; local
102 node = allocfn(ptree);
103 if (node == NULL)
105 node->pn_owner = owner;
106 node->pn_count = count;
107 node->pn_clev = clevel;
109 return (node);
116 pctrie_node_put(struct pctrie *ptree, struct pctrie_node *node, pctrie_free_t freefn) argument
170 pctrie_setroot(struct pctrie *ptree, struct pctrie_node *node) argument
180 pctrie_isleaf(struct pctrie_node *node) argument
190 pctrie_toval(struct pctrie_node *node) argument
200 pctrie_addval(struct pctrie_node *node, uint64_t index, uint16_t clev, uint64_t *val) argument
232 pctrie_keybarr(struct pctrie_node *node, uint64_t idx) argument
247 pctrie_reclaim_allnodes_int(struct pctrie *ptree, struct pctrie_node *node, pctrie_free_t freefn) argument
272 struct pctrie_node *node; local
295 struct pctrie_node *node, *tmp; local
365 struct pctrie_node *node; local
394 struct pctrie_node *child, *node; local
505 struct pctrie_node *child, *node; local
616 struct pctrie_node *node, *parent; local
688 struct pctrie_node *node; local
[all...]
/freebsd-10-stable/contrib/dtc/
H A Ddtc.h145 struct node { struct
149 struct node *children;
151 struct node *parent;
152 struct node *next_sibling;
192 struct node *build_node(struct property *proplist, struct node *children);
193 struct node *build_node_delete(void);
194 struct node *name_node(struct node *node, cha
[all...]
H A Dlivetree.c100 struct node *build_node(struct property *proplist, struct node *children)
102 struct node *new = xmalloc(sizeof(*new));
103 struct node *child;
117 struct node *build_node_delete(void)
119 struct node *new = xmalloc(sizeof(*new));
128 struct node *name_node(struct node *node, char *name) argument
130 assert(node
227 add_property(struct node *node, struct property *prop) argument
240 delete_property_by_name(struct node *node, char *name) argument
275 struct node *node = parent->children; local
286 delete_node(struct node *node) argument
355 get_unitname(struct node *node) argument
363 get_property(struct node *node, const char *propname) argument
380 get_property_by_label(struct node *tree, const char *label, struct node **node) argument
406 get_marker_label(struct node *tree, const char *label, struct node **node, struct property **prop) argument
434 get_subnode(struct node *node, const char *nodename) argument
473 struct node *child, *node; local
493 struct node *child, *node; local
520 get_node_phandle(struct node *root, struct node *node) argument
633 sort_properties(struct node *node) argument
669 sort_subnodes(struct node *node) argument
695 sort_node(struct node *node) argument
[all...]
/freebsd-10-stable/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c38 * any given node, the left and right subtrees are allowed to differ in height
66 * - The left/right children pointers of a node are in an array.
76 * int left_heavy; // -1 when left subtree is taller at some node,
91 * pointer) is set to indicate if that the new node has a value greater
123 * Walk from one node to the previous valued node (ie. an infix walk
124 * towards the left). At any given node we do one of 2 things:
133 * otherwise next node
139 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local
147 if (node
185 avl_node_t *node; local
204 avl_node_t *node; local
229 avl_node_t *node = AVL_INDEX2NODE(where); local
257 avl_node_t *node; local
303 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument
484 avl_node_t *node; local
578 avl_node_t *node; local
682 avl_node_t *node; local
975 avl_node_t *node; local
[all...]
/freebsd-10-stable/contrib/ldns/
H A Dradix.c54 static int ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte);
55 static int ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need);
67 static ldns_radix_node_t* ldns_radix_next_in_subtree(ldns_radix_node_t* node);
68 static ldns_radix_node_t* ldns_radix_prev_from_index(ldns_radix_node_t* node,
71 ldns_radix_node_t* node);
72 static ldns_radix_node_t* ldns_radix_last_in_subtree(ldns_radix_node_t* node);
73 static void ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node);
74 static void ldns_radix_cleanup_onechild(ldns_radix_node_t* node);
75 static void ldns_radix_cleanup_leaf(ldns_radix_node_t* node);
76 static void ldns_radix_node_free(ldns_radix_node_t* node, voi
92 ldns_radix_node_t* node = LDNS_MALLOC(ldns_radix_node_t); local
336 ldns_radix_node_t* node = NULL; local
383 ldns_radix_node_t* node = NULL; local
513 ldns_radix_next(ldns_radix_node_t* node) argument
554 ldns_radix_prev(ldns_radix_node_t* node) argument
583 ldns_radix_node_print(FILE* fd, ldns_radix_node_t* node, uint8_t i, uint8_t* str, radix_strlen_t len, unsigned d) argument
740 ldns_radix_traverse_postorder(ldns_radix_node_t* node, void (*func)(ldns_radix_node_t*, void*), void* arg) argument
837 ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte) argument
916 ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need) argument
1232 ldns_radix_next_in_subtree(ldns_radix_node_t* node) argument
1262 ldns_radix_prev_from_index(ldns_radix_node_t* node, uint8_t index) argument
1286 ldns_radix_last_in_subtree_incl_self(ldns_radix_node_t* node) argument
1305 ldns_radix_last_in_subtree(ldns_radix_node_t* node) argument
1337 ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node) argument
1378 ldns_radix_cleanup_onechild(ldns_radix_node_t* node) argument
1424 ldns_radix_cleanup_leaf(ldns_radix_node_t* node) argument
1454 ldns_radix_node_free(ldns_radix_node_t* node, void* arg) argument
1478 ldns_radix_node_array_free(ldns_radix_node_t* node) argument
1495 ldns_radix_node_array_free_front(ldns_radix_node_t* node) argument
1531 ldns_radix_node_array_free_end(ldns_radix_node_t* node) argument
1558 ldns_radix_array_reduce(ldns_radix_node_t* node) argument
1582 ldns_radix_self_or_prev(ldns_radix_node_t* node, ldns_radix_node_t** result) argument
[all...]
/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/
H A Dprefix_string.c26 /* A node in the tree represents a common prefix. The root node is the
56 /* A node inside the tree, i.e. not a string and not a leaf (unless this is
57 * the root node).
69 * 0 for the root node. Only then will key.prefix be NULL. */
92 /* Return TRUE, iff NODE is a leaf node.
95 is_leaf(node_t *node) argument
97 return node->key.data[7] == 0;
105 node_t *node)
107 if (node
104 auto_realloc_sub_nodes(svn_prefix_tree__t *tree, node_t *node) argument
168 node_t *node = tree->root; local
[all...]

Completed in 300 milliseconds

1234567891011>>