/freebsd-11-stable/contrib/netbsd-tests/fs/puffs/h_dtfs/ |
H A D | dtfs.c | 190 PUFFSOP_SET(pops, dtfs, node, lookup); 191 PUFFSOP_SET(pops, dtfs, node, access); 192 PUFFSOP_SET(pops, puffs_genfs, node, getattr); 193 PUFFSOP_SET(pops, dtfs, node, setattr); 194 PUFFSOP_SET(pops, dtfs, node, create); 195 PUFFSOP_SET(pops, dtfs, node, remove); 196 PUFFSOP_SET(pops, dtfs, node, readdir); 197 PUFFSOP_SET(pops, dtfs, node, poll); 198 PUFFSOP_SET(pops, dtfs, node, mmap); 199 PUFFSOP_SET(pops, dtfs, node, mkdi [all...] |
/freebsd-11-stable/crypto/openssl/crypto/x509v3/ |
H A D | pcy_tree.c | 78 X509_POLICY_NODE *node, int indent) 81 || !(node->data->flags & POLICY_DATA_FLAG_MAP_MASK)) 85 STACK_OF(ASN1_OBJECT) *pset = node->data->expected_policy_set; 102 X509_POLICY_NODE *node; local 116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); 117 X509_POLICY_NODE_print(err, node, 2); 118 expected_print(err, plev, node, 2); 119 BIO_printf(err, " Flags: %x\n", node->data->flags); 310 X509_POLICY_NODE *node; local 314 node 77 expected_print(BIO *err, X509_POLICY_LEVEL *lev, X509_POLICY_NODE *node, int indent) argument 366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 436 X509_POLICY_NODE *node; local 491 X509_POLICY_NODE *node; local 565 X509_POLICY_NODE *node, *anyptr; local 609 X509_POLICY_NODE *node; local 687 exnode_free(X509_POLICY_NODE *node) argument [all...] |
/freebsd-11-stable/contrib/apr/memory/unix/ |
H A D | apr_pools.c | 183 apr_memnode_t *node, **ref; local 187 while ((node = *ref) != NULL) { 188 *ref = node->next; 190 munmap((char *)node - GUARDPAGE_SIZE, 191 2 * GUARDPAGE_SIZE + ((node->index+1) << BOUNDARY_INDEX)); 193 free(node); 282 apr_memnode_t *node, **ref; local 294 /* Find the index for this node size by 304 * our node will fit into. 317 * node i 435 allocator_free(apr_allocator_t *allocator, apr_memnode_t *node) argument 518 apr_allocator_free(apr_allocator_t *allocator, apr_memnode_t *node) argument 821 apr_memnode_t *active, *node; local 1062 apr_memnode_t *node; local 1168 apr_memnode_t *node; local 1245 apr_memnode_t *node; member in struct:psprintf_data 1256 apr_memnode_t *node, *active; local 1362 apr_memnode_t *active, *node; local 1737 debug_node_t *node; local 1816 debug_node_t *node; local 2170 debug_node_t *node; local 2232 debug_node_t *node; local 2265 debug_node_t *node; local [all...] |
/freebsd-11-stable/sys/fs/tmpfs/ |
H A D | tmpfs_vnops.c | 86 /* Check accessibility of requested node as a first step. */ 91 /* We cannot be requesting the parent directory of the root node. */ 276 struct tmpfs_node *node; local 280 node = VP_TO_TMPFS_NODE(vp); 285 if (node->tn_links < 1) 289 if (node->tn_flags & APPEND && (mode & (FWRITE | O_APPEND)) == FWRITE) 294 KASSERT(vp->v_type != VREG || (node->tn_reg.tn_aobj->flags & 296 vnode_create_vobject(vp, node->tn_size, v->a_td); 308 /* Update node times. */ 322 struct tmpfs_node *node; local 374 struct tmpfs_node *node; local 467 struct tmpfs_node *node; local 485 struct tmpfs_node *node; local 554 struct tmpfs_node *node; local 605 struct tmpfs_node *node; local 1098 struct tmpfs_node *node; local 1205 struct tmpfs_node *node; local 1266 struct tmpfs_node *node; local 1284 struct tmpfs_node *node; local 1301 struct tmpfs_node *node; local 1337 struct tmpfs_node *node; local 1409 struct tmpfs_node *node; local [all...] |
/freebsd-11-stable/contrib/ntp/ntpd/ |
H A D | ntp_prio_q.c | 56 node *temp = NULL; 83 node *new_node; 96 /* Define a function to free the allocated memory for a queue node */ 101 node *old_node = my_node; 112 node *pn; 154 node *new_node = (node *)my_node - 1; 155 node *i = NULL; 156 node *j = my_queue->front; 184 node *my_nod [all...] |
/freebsd-11-stable/sys/arm/ti/ |
H A D | ti_hwmods.c | 104 phandle_t node; local 111 if ((node = ofw_bus_get_node(dev)) == 0) 114 if ((len = OF_getprop_alloc(node, "ti,hwmods", 1, (void**)&name)) <= 0) 143 phandle_t node; local 149 if ((node = ofw_bus_get_node(dev)) == 0) 152 if ((len = OF_getprop_alloc(node, "ti,hwmods", 1, (void**)&name)) <= 0) 178 phandle_t node; local 183 if ((node = ofw_bus_get_node(dev)) == 0) 186 if ((len = OF_getprop_alloc(node, "ti,hwmods", 1, (void**)&name)) <= 0)
|
/freebsd-11-stable/sys/contrib/ck/src/ |
H A D | ck_barrier_mcs.c | 101 ck_barrier_mcs_reinitialize_children(struct ck_barrier_mcs *node) argument 104 ck_pr_store_uint(&node->childnotready[0], node->havechild[0]); 105 ck_pr_store_uint(&node->childnotready[1], node->havechild[1]); 106 ck_pr_store_uint(&node->childnotready[2], node->havechild[2]); 107 ck_pr_store_uint(&node->childnotready[3], node->havechild[3]);
|
/freebsd-11-stable/contrib/unbound/util/ |
H A D | tcp_conn_limit.c | 66 tcl_list_free_node(rbnode_type* node, void* ATTR_UNUSED(arg)) argument 68 struct tcl_addr* n = (struct tcl_addr*) node; 91 struct tcl_addr* node = regional_alloc_zero(tcl->region, local 93 if(!node) 95 lock_quick_init(&node->lock); 96 node->limit = limit; 97 if(!addr_tree_insert(&tcl->tree, &node->node, addr, addrlen, net)) { 101 return node;
|
H A D | rbtree.h | 58 /** left node (smaller items) */ 60 /** right node (larger items) */ 64 /** colour of this node */ 68 /** The nullpointer, points to empty node */ 70 /** the global empty node */ 116 * @return: node that is now unlinked from the tree. User to delete it. 117 * returns 0 if node not present 125 * @return: node that fits or NULL. 133 * @param result: set to the exact node if present, otherwise to element that 142 * Returns first (smallest) node i [all...] |
/freebsd-11-stable/contrib/gcclibs/libcpp/ |
H A D | symtab.c | 109 hashnode node; local 115 node = table->entries[index]; 117 if (node != NULL) 119 if (node->hash_value == hash 120 && HT_LEN (node) == (unsigned int) len 121 && !memcmp (HT_STR (node), str, len)) 127 return node; 138 node = table->entries[index]; 139 if (node == NULL) 142 if (node [all...] |
/freebsd-11-stable/contrib/ldns/ldns/ |
H A D | rbtree.h | 63 /** left node (smaller items) */ 65 /** right node (larger items) */ 71 /** colour of this node */ 75 /** The nullpointer, points to empty node */ 77 /** the global empty node */ 137 * @return: node that is now unlinked from the tree. User to delete it. 138 * returns 0 if node not present 146 * @return: node that fits or NULL. 154 * @param result: set to the exact node if present, otherwise to element that 163 * Returns first (smallest) node i [all...] |
/freebsd-11-stable/sys/mips/nlm/hal/ |
H A D | fmn.h | 53 #define CMS_CPU_PUSHQ(node, core, thread, vc) \ 54 (((node)<<10) | ((core)<<4) | ((thread)<<2) | ((vc)<<0)) 55 #define CMS_POPQ(node, queue) (((node)<<10) | (queue)) 56 #define CMS_IO_PUSHQ(node, queue) (((node)<<10) | (queue)) 146 #define nlm_get_cms_pcibase(node) \ 147 nlm_pcicfg_base(XLP_IO_CMS_OFFSET(node)) 148 #define nlm_get_cms_regbase(node) \ 149 nlm_xkphys_map_pcibar0(nlm_get_cms_pcibase(node)) [all...] |
/freebsd-11-stable/contrib/ofed/infiniband-diags/src/ |
H A D | ibcacheedit.c | 168 static void update_switchportguids(ibnd_node_t *node) argument 173 for (p = 0; p <= node->numports; p++) { 174 port = node->ports[p]; 176 port->guid = node->guid; 180 static void replace_node_guid(ibnd_node_t *node, void *user_data) argument 186 if (node->guid == guids->before) { 188 node->guid = guids->after; 193 if (node->type == IB_NODE_SWITCH) 194 update_switchportguids(node); 200 static void replace_sysimgguid(ibnd_node_t *node, voi argument 215 replace_portguid(ibnd_node_t *node, void *user_data) argument [all...] |
/freebsd-11-stable/contrib/unbound/util/storage/ |
H A D | dnstree.h | 53 * This is the element node put as first entry in the client structure. 56 /** rbtree node, key is this struct : dclass and name */ 57 rbnode_type node; member in struct:name_tree_node 75 * This is the element node put as first entry in the client structure. 78 /** rbtree node, key is this struct : proto and subnet */ 79 rbnode_type node; member in struct:addr_tree_node 99 * @param node: node element (at start of a structure that caller 102 * this node has been allocated by the caller and it itself inserted. 108 int name_tree_insert(rbtree_type* tree, struct name_tree_node* node, [all...] |
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | dag_cache.c | 1 /* dag_cache.c : DAG walker and node cache. 24 /* The job of this layer is to take a filesystem with lots of node 233 /* the node allocated in the cache's pool. NULL for empty entries. */ 234 dag_node_t *node; 259 /* pool used for all node allocation */ 269 /* Position of the last bucket hit that actually had a DAG node in it. 306 may then set it to the corresponding DAG node allocated in CACHE->POOL. 328 /* Remember the position of the last node we found in this cache. */ 329 if (result->node) 365 in the node an 232 dag_node_t *node; member in struct:cache_entry_t 428 svn_fs_x__update_dag_cache(dag_node_t *node) argument 491 dag_node_t *node = cache_lookup_last_path(ffd->dag_node_cache, path); local 838 make_parent_path(dag_node_t *node, const svn_stringbuf_t *entry, svn_fs_x__dag_path_t *parent, apr_pool_t *result_pool) argument 1096 dag_node_t *node = NULL; local [all...] |
H A D | dag.c | 52 /* The filesystem this dag node came from. */ 55 /* The node's NODE-REVISION. */ 72 svn_fs_x__dag_node_kind(dag_node_t *node) 74 return node->node_revision->kind; 78 svn_fs_x__dag_get_id(const dag_node_t *node) 80 return &node->node_revision->noderev_id; 85 svn_fs_x__dag_get_created_path(dag_node_t *node) 87 return node->node_revision->created_path; 92 svn_fs_x__dag_get_fs(dag_node_t *node) 94 return node 70 svn_fs_x__dag_node_kind(dag_node_t *node) argument 76 svn_fs_x__dag_get_id(const dag_node_t *node) argument 83 svn_fs_x__dag_get_created_path(dag_node_t *node) argument 90 svn_fs_x__dag_get_fs(dag_node_t *node) argument 96 svn_fs_x__dag_set_fs(dag_node_t *node, svn_fs_t *fs) argument 127 svn_fs_x__dag_get_node_id(dag_node_t *node) argument 133 svn_fs_x__dag_get_copy_id(dag_node_t *node) argument 158 svn_fs_x__dag_check_mutable(const dag_node_t *node) argument 164 svn_fs_x__dag_get_node(dag_node_t **node, svn_fs_t *fs, const svn_fs_x__id_t *id, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 191 svn_fs_x__dag_get_revision(const dag_node_t *node) argument 200 svn_fs_x__dag_get_predecessor_id(dag_node_t *node) argument 206 svn_fs_x__dag_get_predecessor_count(dag_node_t *node) argument 212 svn_fs_x__dag_get_mergeinfo_count(dag_node_t *node) argument 218 svn_fs_x__dag_has_mergeinfo(dag_node_t *node) argument 224 svn_fs_x__dag_has_descendants_with_mergeinfo(dag_node_t *node) argument 375 svn_fs_x__dag_dir_entries(apr_array_header_t **entries, dag_node_t *node, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 392 svn_fs_x__dag_set_entry(dag_node_t *node, const char *entry_name, const svn_fs_x__id_t *id, svn_node_kind_t kind, svn_fs_x__txn_id_t txn_id, apr_pool_t *scratch_pool) argument 419 svn_fs_x__dag_get_proplist(apr_hash_t **proplist_p, dag_node_t *node, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 431 svn_fs_x__dag_set_proplist(dag_node_t *node, apr_hash_t *proplist, apr_pool_t *scratch_pool) argument 458 noderev_changed(dag_node_t *node, apr_pool_t *scratch_pool) argument 469 svn_fs_x__dag_increment_mergeinfo_count(dag_node_t *node, apr_int64_t increment, apr_pool_t *scratch_pool) argument 520 svn_fs_x__dag_set_has_mergeinfo(dag_node_t *node, svn_boolean_t has_mergeinfo, apr_pool_t *scratch_pool) argument 654 dag_node_t *node; local 824 svn_fs_x__dag_try_process_file_contents(svn_boolean_t *success, dag_node_t *node, svn_fs_process_contents_func_t processor, void* baton, apr_pool_t *scratch_pool) argument 914 svn_fs_x__dag_dup(const dag_node_t *node, apr_pool_t *result_pool) argument 1045 svn_fs_x__dag_get_copyroot(svn_revnum_t *rev, const char **path, dag_node_t *node) argument 1054 svn_fs_x__dag_get_copyfrom_rev(dag_node_t *node) argument 1060 svn_fs_x__dag_get_copyfrom_path(dag_node_t *node) argument [all...] |
/freebsd-11-stable/contrib/unbound/iterator/ |
H A D | iter_fwd.c | 87 struct iter_forward_zone* node = (struct iter_forward_zone*)n; local 88 fwd_zone_free(node); 112 struct iter_forward_zone* node = (struct iter_forward_zone*)malloc( local 114 if(!node) { 118 node->node.key = node; 119 node->dclass = c; 120 node->name = memdup(nm, nmlen); 121 if(!node 152 struct iter_forward_zone* node, *prev = NULL, *p; local [all...] |
/freebsd-11-stable/contrib/groff/src/roff/troff/ |
H A D | node.cpp | 36 #include "node.h" 692 virtual void really_print_line(hunits x, vunits y, node *n, 705 void print_line(hunits x, vunits y, node *n, vunits before, vunits after, hunits width); 719 void really_print_line(hunits x, vunits y, node *n, vunits, vunits, hunits width); 727 void really_print_line(hunits x, vunits y, node *n, vunits, vunits, hunits width); 793 void really_print_line(hunits x, vunits y, node *n, vunits before, vunits after, hunits width); 879 void troff_output_file::really_print_line(hunits x, vunits y, node *n, 1683 void real_output_file::print_line(hunits x, vunits y, node *n, 1738 void ascii_output_file::really_print_line(hunits, vunits, node *n, 1763 void suppress_output_file::really_print_line(hunits, vunits, node *, vunit [all...] |
/freebsd-11-stable/sys/dev/psci/ |
H A D | psci.c | 106 psci_get_callfn(phandle_t node) argument 110 if ((OF_getprop(node, "method", method, sizeof(method))) > 0) { 146 phandle_t node; local 155 node = ofw_bus_get_node(dev); 156 sc->psci_call = psci_get_callfn(node); 185 phandle_t node; local 189 node = ofw_bus_find_compatible(OF_peer(0), "arm,psci-0.2"); 190 if (node == 0) 195 callfn = psci_get_callfn(node); 237 phandle_t node; local [all...] |
/freebsd-11-stable/contrib/serf/buckets/ |
H A D | allocator.c | 175 node_header_t *node; local 182 /* just pull a node off our freelist */ 183 node = allocator->freelist; 184 allocator->freelist = node->u.next; 190 node->size = STANDARD_NODE_SIZE; 212 node = (node_header_t *)active->first_avail; 213 node->size = STANDARD_NODE_SIZE; 224 node = (node_header_t *)memnode->first_avail; 225 node->u.memnode = memnode; 226 node 250 node_header_t *node; local [all...] |
/freebsd-11-stable/sys/contrib/ipfilter/netinet/ |
H A D | ip_pool.c | 140 ip_pool_node_t node; local 151 bzero((char *)&node, sizeof(node)); 157 node.ipn_addr.adf_family = AF_INET; 159 node.ipn_addr.adf_addr.in4.s_addr = 0x0a010203; 160 node.ipn_mask.adf_addr.in4.s_addr = 0xffffffff; 161 node.ipn_info = 1; 162 ipf_pool_insert_node(ipo, &node); 164 node.ipn_addr.adf_addr.in4.s_addr = 0x0a000000; 165 node 376 ip_pool_node_t node, *m; local 471 ip_pool_node_t node, *m; local 1287 ip_pool_node_t *node, zn, *nextnode; local [all...] |
/freebsd-11-stable/lib/libc/uuid/ |
H A D | uuid_compare.c | 70 res = memcmp(a->node, b->node, sizeof(a->node));
|
/freebsd-11-stable/sys/netgraph/ |
H A D | ng_UI.c | 71 /* Netgraph node methods */ 97 * Create a newborn node. We start with an implicit reference. 101 ng_UI_constructor(node_p node) argument 107 NG_NODE_SET_PRIVATE(node, priv); 115 ng_UI_newhook(node_p node, hook_p hook, const char *name) argument 117 const priv_p priv = NG_NODE_PRIVATE(node); 136 ng_UI_rcvmsg(node_p node, item_p item, hook_p lasthook) argument 139 const priv_p priv = NG_NODE_PRIVATE(node); 170 const node_p node = NG_HOOK_NODE(hook); local 171 const priv_p priv = NG_NODE_PRIVATE(node); 210 ng_UI_shutdown(node_p node) argument [all...] |
/freebsd-11-stable/sys/fs/nandfs/ |
H A D | bmap.c | 67 bmap_lookup(struct nandfs_node *node, nandfs_lbn_t lblk, nandfs_daddr_t *vblk) argument 76 DPRINTF(BMAP, ("%s: node %p lblk %jx enter\n", __func__, node, lblk)); 77 ip = &node->nn_inode; 82 error = bmap_getlbns(node, lblk, ap, nump); 91 DPRINTF(BMAP, ("%s: node %p lblk=%jx trying ip->i_ib[%x]\n", __func__, 92 node, lblk, ap->in_off)); 96 DPRINTF(BMAP, ("%s: node %p lblk=%jx returning with " 97 "vblk 0\n", __func__, node, lblk)); 102 DPRINTF(BMAP, ("%s: node 130 bmap_dirty_meta(struct nandfs_node *node, nandfs_lbn_t lblk, int force) argument 178 bmap_insert_block(struct nandfs_node *node, nandfs_lbn_t lblk, nandfs_daddr_t vblk) argument 299 bmap_truncate_indirect(struct nandfs_node *node, int level, nandfs_lbn_t *left, int *cleaned, struct nandfs_indir *ap, struct nandfs_indir *fp, nandfs_daddr_t *copy) argument 398 bmap_truncate_mapping(struct nandfs_node *node, nandfs_lbn_t lastblk, nandfs_lbn_t todo) argument 540 bmap_getlbns(struct nandfs_node *node, nandfs_lbn_t bn, struct nandfs_indir *ap, int *nump) argument [all...] |
/freebsd-11-stable/sys/dev/sdhci/ |
H A D | sdhci_fdt_gpio.c | 77 cd_setup(struct sdhci_fdt_gpio *gpio, phandle_t node) argument 89 if (OF_hasprop(node, "non-removable")) { 105 if (gpio_pin_get_by_ofw_property(dev, node, "cd-gpios", &gpio->cd_pin)) 116 if (OF_hasprop(node, "cd-inverted")) 174 wp_setup(struct sdhci_fdt_gpio *gpio, phandle_t node) argument 180 if (OF_hasprop(node, "wp-disable")) { 187 if (gpio_pin_get_by_ofw_property(dev, node, "wp-gpios", &gpio->wp_pin)) 190 if (OF_hasprop(node, "wp-inverted")) 201 phandle_t node; local 208 node [all...] |