/freebsd-11-stable/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 *);
|
/freebsd-11-stable/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 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-11-stable/contrib/jemalloc/include/jemalloc/internal/ |
H A D | extent.h | 15 /* Pointer to the extent that this tree node is responsible for. */ 73 arena_t *extent_node_arena_get(const extent_node_t *node); 74 void *extent_node_addr_get(const extent_node_t *node); 75 size_t extent_node_size_get(const extent_node_t *node); 76 bool extent_node_zeroed_get(const extent_node_t *node); 77 bool extent_node_committed_get(const extent_node_t *node); 78 bool extent_node_achunk_get(const extent_node_t *node); 79 prof_tctx_t *extent_node_prof_tctx_get(const extent_node_t *node); 80 void extent_node_arena_set(extent_node_t *node, arena_t *arena); 81 void extent_node_addr_set(extent_node_t *node, voi 97 extent_node_arena_get(const extent_node_t *node) argument 104 extent_node_addr_get(const extent_node_t *node) argument 111 extent_node_size_get(const extent_node_t *node) argument 118 extent_node_zeroed_get(const extent_node_t *node) argument 125 extent_node_committed_get(const extent_node_t *node) argument 133 extent_node_achunk_get(const extent_node_t *node) argument 140 extent_node_prof_tctx_get(const extent_node_t *node) argument 147 extent_node_arena_set(extent_node_t *node, arena_t *arena) argument 154 extent_node_addr_set(extent_node_t *node, void *addr) argument 161 extent_node_size_set(extent_node_t *node, size_t size) argument 168 extent_node_zeroed_set(extent_node_t *node, bool zeroed) argument 175 extent_node_committed_set(extent_node_t *node, bool committed) argument 182 extent_node_achunk_set(extent_node_t *node, bool achunk) argument 189 extent_node_prof_tctx_set(extent_node_t *node, prof_tctx_t *tctx) argument 196 extent_node_init(extent_node_t *node, arena_t *arena, void *addr, size_t size, bool zeroed, bool committed) argument 211 extent_node_dirty_linkage_init(extent_node_t *node) argument 219 extent_node_dirty_insert(extent_node_t *node, arena_runs_dirty_link_t *runs_dirty, extent_node_t *chunks_dirty) argument 228 extent_node_dirty_remove(extent_node_t *node) argument [all...] |
/freebsd-11-stable/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-11-stable/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-11-stable/usr.sbin/makefs/cd9660/ |
H A D | cd9660_archimedes.c | 70 * Add "ARCHIMEDES" metadata to a node if that seems appropriate. 76 archimedes_convert_node(cd9660node *node) argument 83 if (node->su_tail_data != NULL) 87 len = strlen(node->node->name); 90 if (len >= 4 && node->node->name[len-4] == ',') 92 type = strtoul(node->node->name + len - 3, NULL, 16); 93 if (type == -1 && node 115 archimedes_convert_tree(cd9660node *node) argument [all...] |
/freebsd-11-stable/contrib/netbsd-tests/usr.bin/xlint/lint1/ |
H A D | d_c9x_recursive_init.c | 2 union node { union 8 union node n;
|
/freebsd-11-stable/contrib/ofed/libibverbs/ |
H A D | memory.c | 177 static struct ibv_mem_node *__mm_prev(struct ibv_mem_node *node) argument 179 if (node->left) { 180 node = node->left; 181 while (node->right) 182 node = node->right; 184 while (node->parent && node == node 193 __mm_next(struct ibv_mem_node *node) argument 209 __mm_rotate_right(struct ibv_mem_node *node) argument 233 __mm_rotate_left(struct ibv_mem_node *node) argument 285 __mm_add_rebalance(struct ibv_mem_node *node) argument 343 struct ibv_mem_node *node, *parent = NULL; local 367 __mm_remove(struct ibv_mem_node *node) argument 499 struct ibv_mem_node *node = mm_root; local 514 merge_ranges(struct ibv_mem_node *node, struct ibv_mem_node *prev) argument 524 split_range(struct ibv_mem_node *node, uintptr_t cut_line) argument 544 struct ibv_mem_node *node, *tmp = NULL; local 561 undo_node(struct ibv_mem_node *node, uintptr_t start, int inc) argument 593 struct ibv_mem_node *node, *tmp; local [all...] |
/freebsd-11-stable/sys/dev/ocs_fc/ |
H A D | ocs_node.c | 36 * OCS driver remote node handler. This file contains code that is shared 55 io->node->display_name, SCSI_IOFMT_ARGS(io), ##__VA_ARGS__) 57 void ocs_mgmt_node_list(ocs_textbuf_t *textbuf, void *node); 58 void ocs_mgmt_node_get_all(ocs_textbuf_t *textbuf, void *node); 59 int ocs_mgmt_node_get(ocs_textbuf_t *textbuf, char *parent, char *name, void *node); 60 int ocs_mgmt_node_set(char *parent, char *name, char *value, void *node); 62 void *arg_out, uint32_t arg_out_length, void *node); 74 * @brief Device node state machine wait for all ELS's to 77 * Abort all ELS's for given node. 79 * @param node nod 83 ocs_node_abort_all_els(ocs_node_t *node) argument 120 ocs_node_t *node = rnode->node; local 187 ocs_node_t *node; local 208 ocs_node_t *node = NULL;; local 240 ocs_node_t *node; local 311 ocs_node_t *node; local 350 ocs_node_t *node = NULL; local 376 ocs_node_t *node = NULL; local 467 ocs_node_free(ocs_node_t *node) argument 569 ocs_node_force_free(ocs_node_t *node) argument 626 ocs_node_attach(ocs_node_t *node) argument 710 ocs_node_update_display_name(ocs_node_t *node) argument 734 ocs_node_send_ls_io_cleanup(ocs_node_t *node) argument 888 ocs_node_check_els_quiesced(ocs_node_t *node) argument 923 ocs_node_initiate_cleanup(ocs_node_t *node) argument 1231 ocs_node_t *node = NULL; local 1358 ocs_node_save_sparms(ocs_node_t *node, void *payload) argument 1379 ocs_node_post_event(ocs_node_t *node, ocs_sm_event_t evt, void *arg) argument 1428 ocs_node_transition(ocs_node_t *node, ocs_sm_function_t state, void *data) argument 1478 ocs_node_get_wwpn(ocs_node_t *node) argument 1498 ocs_node_get_wwnn(ocs_node_t *node) argument 1517 ocs_ddump_node(ocs_textbuf_t *textbuf, ocs_node_t *node) argument 1620 ocs_node_t *node = NULL; local 1670 ocs_node_t *node = NULL; local 1705 ocs_node_t *node = (ocs_node_t *)object; local 1745 ocs_node_t *node = (ocs_node_t *)object; local 1849 ocs_node_t *node = (ocs_node_t *)object; local 1902 ocs_node_t *node = (ocs_node_t *)object; local 1934 ocs_node_t *node = (ocs_node_t *)object; local 1982 ocs_node_active_ios_empty(ocs_node_t *node) argument 2005 ocs_node_pause(ocs_node_t *node, ocs_sm_function_t state) argument 2069 ocs_node_resume(ocs_node_t *node) argument 2096 ocs_node_recv_els_frame(ocs_node_t *node, ocs_hw_sequence_t *seq) argument 2183 ocs_node_recv_abts_frame(ocs_node_t *node, ocs_hw_sequence_t *seq) argument 2261 ocs_node_recv_ct_frame(ocs_node_t *node, ocs_hw_sequence_t *seq) argument 2336 ocs_node_recv_fcp_cmd(ocs_node_t *node, ocs_hw_sequence_t *seq) argument 2363 ocs_node_recv_bls_no_sit(ocs_node_t *node, ocs_hw_sequence_t *seq) argument [all...] |
H A D | ocs_device.c | 70 ocs_node_t *node = io->node; local 73 if (ocs->fc_type != node->fc_type) { 74 node_printf(node, "PRLI rejected by target-server, fc-type not supported\n"); 77 node->shutdown_reason = OCS_NODE_SHUTDOWN_DEFAULT; 78 ocs_node_transition(node, __ocs_d_initiate_shutdown, NULL); 82 if (node->sport->enable_tgt && (ocs_scsi_validate_initiator(node) == 0)) { 83 node_printf(node, "PRLI rejected by target-server\n"); 86 node 240 ocs_node_t *node = NULL; local 478 ocs_node_t *node = io->node; local 503 ocs_process_prli_payload(ocs_node_t *node, fc_prli_payload_t *prli) argument 528 ocs_node_t *node = io->node; local 741 ocs_node_init_device(ocs_node_t *node, int send_plogi) argument [all...] |
H A D | ocs_node.h | 36 * OCS linux driver remote node callback declarations 45 if (OCS_LOG_ENABLE_SM_TRACE(node->ocs)) \ 46 ocs_log_info(node->ocs, "[%s] %-20s\n", node->display_name, ocs_sm_event_name(evt)); \ 49 #define node_printf(node, fmt, ...) ocs_log_debug(node->ocs, "[%s] " fmt, node->display_name, ##__VA_ARGS__) 52 ocs_node_t *node = NULL; \ 54 node = ctx->app; \ 55 ocs_assert(node, NUL 98 ocs_node_hold_frames(ocs_node_t *node) argument 116 ocs_node_accept_frames(ocs_node_t *node) argument 127 ocs_node_lock_init(ocs_node_t *node) argument 133 ocs_node_lock_free(ocs_node_t *node) argument 139 ocs_node_lock_try(ocs_node_t *node) argument 145 ocs_node_lock(ocs_node_t *node) argument 150 ocs_node_unlock(ocs_node_t *node) argument 182 ocs_node_get_enable(ocs_node_t *node) argument [all...] |
/freebsd-11-stable/usr.sbin/autofs/ |
H A D | common.h | 45 struct node { struct 46 TAILQ_ENTRY(node) n_next; 47 TAILQ_HEAD(nodehead, node) n_children; 48 struct node *n_parent; 78 struct node *node_new_root(void); 79 struct node *node_new(struct node *parent, char *key, char *options, 81 struct node *node_new_map(struct node *parent, char *key, char *options, 83 struct node *node_fin [all...] |
/freebsd-11-stable/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-11-stable/stand/powerpc/ofw/ |
H A D | ofwfdt.c | 39 OF_hasprop(phandle_t node, const char *prop) argument 41 return (OF_getproplen(node, (char *)prop) > 0); 45 add_node_to_fdt(void *buffer, phandle_t node, int fdt_offset) argument 53 while (OF_nextprop(node, lastprop, name) > 0) { 54 proplen = OF_getproplen(node, name); 67 OF_getprop(node, name, propbuf, proplen); 73 "node %d\n", error, name, fdt_offset); 76 if (!OF_hasprop(node, "phandle") && !OF_hasprop(node, "linux,phandle") 77 && !OF_hasprop(node, "ib 99 phandle_t node; local [all...] |
/freebsd-11-stable/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-11-stable/sys/contrib/ck/include/spinlock/ |
H A D | mcs.h | 58 struct ck_spinlock_mcs *node) 62 node->locked = true; 63 node->next = NULL; 66 r = ck_pr_cas_ptr(queue, NULL, node); 83 struct ck_spinlock_mcs *node) 91 node->locked = true; 92 node->next = NULL; 100 previous = ck_pr_fas_ptr(queue, node); 106 ck_pr_store_ptr(&previous->next, node); 107 while (ck_pr_load_uint(&node 57 ck_spinlock_mcs_trylock(struct ck_spinlock_mcs **queue, struct ck_spinlock_mcs *node) argument 82 ck_spinlock_mcs_lock(struct ck_spinlock_mcs **queue, struct ck_spinlock_mcs *node) argument 116 ck_spinlock_mcs_unlock(struct ck_spinlock_mcs **queue, struct ck_spinlock_mcs *node) argument [all...] |
/freebsd-11-stable/sys/compat/linuxkpi/common/src/ |
H A D | linux_radix.c | 61 /* Check if the root node should be freed */ 72 struct radix_tree_node *node; local 77 node = root->rnode; 81 while (height && node) 82 node = node->slots[radix_pos(index, height--)]; 83 if (node) 84 item = node->slots[radix_pos(index, 0)]; 94 struct radix_tree_node *node; local 99 node 133 struct radix_tree_node *node; local 186 struct radix_tree_node *node; local 285 struct radix_tree_node *node; local [all...] |
/freebsd-11-stable/contrib/libucl/src/ |
H A D | tree.h | 24 * 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. 76 #define TREE_DEFINE(node, field) \ 78 static struct node *_HU_FUNCTION(TREE_BALANCE_##node##_##field)(struct node *); \ 80 static struct node *_HU_FUNCTIO [all...] |
/freebsd-11-stable/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-11-stable/sys/kern/ |
H A D | subr_pctrie.c | 64 /* Flag bits stored in node pointers. */ 81 * Allocate a node. Pre-allocation should ensure that the request 88 struct pctrie_node *node; local 90 node = allocfn(ptree); 91 if (node == NULL) 93 node->pn_owner = owner; 94 node->pn_count = count; 95 node->pn_clev = clevel; 97 return (node); 101 * Free radix node 104 pctrie_node_put(struct pctrie *ptree, struct pctrie_node *node, pctrie_free_t freefn) argument 158 pctrie_setroot(struct pctrie *ptree, struct pctrie_node *node) argument 168 pctrie_isleaf(struct pctrie_node *node) argument 178 pctrie_toval(struct pctrie_node *node) argument 188 pctrie_addval(struct pctrie_node *node, uint64_t index, uint16_t clev, uint64_t *val) argument 220 pctrie_keybarr(struct pctrie_node *node, uint64_t idx) argument 235 pctrie_reclaim_allnodes_int(struct pctrie *ptree, struct pctrie_node *node, pctrie_free_t freefn) argument 260 struct pctrie_node *node; local 283 struct pctrie_node *node, *tmp; local 353 struct pctrie_node *node; local 382 struct pctrie_node *child, *node; local 493 struct pctrie_node *child, *node; local 604 struct pctrie_node *node, *parent; local 676 struct pctrie_node *node; local [all...] |
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/ |
H A D | avl.c | 38 * 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...] |