/freebsd-10.0-release/bin/sh/ |
H A D | redir.h | 40 union node; 41 void redirect(union node *, int);
|
H A D | show.h | 33 void showtree(union node *);
|
H A D | eval.h | 57 union node; /* BLETCH for ansi C */ 58 void evaltree(union node *, int); 59 void evalbackcmd(union node *, struct backcmd *);
|
H A D | expand.h | 59 union node; 60 void expandarg(union node *, struct arglist *, int); 63 int casematch(union node *, const char *);
|
/freebsd-10.0-release/contrib/gcc/ |
H A D | ipa.c | 33 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 D | print-tree.c | 40 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 D | cgraph.c | 31 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 D | cgraphunit.c | 181 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 469 struct cgraph_node *node = cgraph_node (decl); local 569 cgraph_create_edges(struct cgraph_node *node, tree body) argument 599 walk_tree (bsi_stmt_ptr (bsi), record_reference, node, visited_nodes); local 613 walk_tree (&DECL_INITIAL (decl), record_reference, node, visited_nodes); local 624 initialize_inline_failed(struct cgraph_node *node) argument 648 struct cgraph_node *node = cgraph_node (current_function_decl); local 691 verify_cgraph_node(struct cgraph_node *node) argument 844 struct cgraph_node *node; local 855 cgraph_varpool_assemble_decl(struct cgraph_varpool_node *node) argument 887 struct cgraph_varpool_node *node = cgraph_varpool_nodes_queue; local 913 struct cgraph_varpool_node *node = cgraph_varpool_assembled_nodes_queue; local 945 cgraph_analyze_function(struct cgraph_node *node) argument 1001 struct cgraph_node *node; local 1057 struct cgraph_node *node, *next; local 1186 struct cgraph_node *node; local 1231 cgraph_expand_function(struct cgraph_node *node) argument 1288 struct cgraph_node *node; local 1435 struct cgraph_node *node; local 1498 struct cgraph_node *node; local 1605 struct cgraph_node *node; local 1881 save_inline_function_body(struct cgraph_node *node) argument [all...] |
/freebsd-10.0-release/contrib/gcc/cp/ |
H A D | ptree.c | 33 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.0-release/sys/mips/nlm/hal/ |
H A D | iomap.h | 45 #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.0-release/usr.sbin/makefs/cd9660/ |
H A D | cd9660_archimedes.c | 67 * 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.0-release/contrib/ofed/libibverbs/src/ |
H A D | memory.c | 123 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.0-release/contrib/groff/src/roff/troff/ |
H A D | node.h | 50 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.0-release/contrib/ofed/management/infiniband-diags/src/ |
H A D | grouping.c | 150 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 D | ibnetdiscover.c | 122 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.0-release/sys/ofed/include/linux/ |
H A D | linux_radix.c | 57 struct radix_tree_node *node; local 62 node = root->rnode; 66 while (height && node) 67 node = node->slots[radix_pos(index, height--)]; 68 if (node) 69 item = node->slots[radix_pos(index, 0)]; 79 struct radix_tree_node *node; local 85 node = root->rnode; 90 * Find the node an 125 struct radix_tree_node *node; local [all...] |
/freebsd-10.0-release/usr.bin/ctags/ |
H A D | print.c | 97 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.0-release/contrib/ipfilter/lib/ |
H A D | printpoolfield.c | 47 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.0-release/lib/libc/uuid/ |
H A D | uuid_to_string.c | 62 u->clock_seq_hi_and_reserved, u->clock_seq_low, u->node[0], 63 u->node[1], u->node[2], u->node[3], u->node[4], u->node[5]);
|
/freebsd-10.0-release/sys/kern/ |
H A D | subr_pctrie.c | 62 * 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.0-release/cddl/contrib/opensolaris/common/avl/ |
H A D | avl.c | 33 * any given node, the left and right subtrees are allowed to differ in height 61 * - The left/right children pointers of a node are in an array. 71 * int left_heavy; // -1 when left subtree is taller at some node, 86 * pointer) is set to indicate if that the new node has a value greater 112 * Walk from one node to the previous valued node (ie. an infix walk 113 * towards the left). At any given node we do one of 2 things: 121 * otherwise next node 127 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local 135 if (node 173 avl_node_t *node; local 192 avl_node_t *node; local 217 avl_node_t *node = AVL_INDEX2NODE(where); local 245 avl_node_t *node; local 291 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument 472 avl_node_t *node; local 566 avl_node_t *node; local 667 avl_node_t *node; local 942 avl_node_t *node; local [all...] |
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/common/avl/ |
H A D | avl.c | 33 * any given node, the left and right subtrees are allowed to differ in height 61 * - The left/right children pointers of a node are in an array. 71 * int left_heavy; // -1 when left subtree is taller at some node, 86 * pointer) is set to indicate if that the new node has a value greater 112 * Walk from one node to the previous valued node (ie. an infix walk 113 * towards the left). At any given node we do one of 2 things: 121 * otherwise next node 127 avl_node_t *node = AVL_DATA2NODE(oldnode, off); local 135 if (node 173 avl_node_t *node; local 192 avl_node_t *node; local 217 avl_node_t *node = AVL_INDEX2NODE(where); local 245 avl_node_t *node; local 291 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) argument 472 avl_node_t *node; local 566 avl_node_t *node; local 667 avl_node_t *node; local 942 avl_node_t *node; local [all...] |
/freebsd-10.0-release/sys/powerpc/include/ |
H A D | fdt.h | 42 #define FDT_MAP_IRQ(node, pin) powerpc_get_irq(node, pin)
|
/freebsd-10.0-release/contrib/texinfo/info/ |
H A D | man.h | 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,
|
/freebsd-10.0-release/contrib/ldns/ |
H A D | rbtree.c | 54 /** the NULL node, global alloc */ 65 static void ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 67 static void ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 68 /** Fixup node colours when insert happened */ 69 static void ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node); 70 /** Fixup node colours when delete happened */ 112 * Rotates the node to the left. 116 ldns_rbtree_rotate_left(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 118 ldns_rbnode_t *right = node->right; 119 node 143 ldns_rbtree_rotate_right(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 166 ldns_rbtree_insert_fixup(ldns_rbtree_t *rbtree, ldns_rbnode_t *node) argument 248 ldns_rbnode_t *node = rbtree->root; local 296 ldns_rbnode_t *node; local 517 ldns_rbnode_t *node; local 550 ldns_rbnode_t *node = rbtree->root; local 561 ldns_rbnode_t *node = rbtree->root; local 574 ldns_rbtree_next(ldns_rbnode_t *node) argument 595 ldns_rbtree_previous(ldns_rbnode_t *node) argument 653 traverse_post(void (*func)(ldns_rbnode_t*, void*), void* arg, ldns_rbnode_t* node) argument [all...] |