Searched refs:nodes (Results 1 - 8 of 8) sorted by relevance
/macosx-10.5.8/xnu-1228.15.4/bsd/miscfs/devfs/ |
H A D | devfsdefs.h | 97 int nodes; member in struct:devfs_stats 134 devnode_t * dn_nextsibling; /* the list of equivalent nodes */ 169 * Rules for front nodes: 178 * particular 'plane' of front nodes. 225 OSAddAtomic(1, (SInt32 *)&devfs_stats.nodes); 231 OSAddAtomic(-1, (SInt32 *)&devfs_stats.nodes);
|
H A D | devfs_vfsops.c | 281 + devfs_stats.nodes * sizeof(devnode_t) 287 sbp->f_files = devfs_stats.nodes; 298 VFSATTR_RETURN(fsap, f_objcount, devfs_stats.nodes); 299 VFSATTR_RETURN(fsap, f_maxobjcount, devfs_stats.nodes); 304 + devfs_stats.nodes * sizeof(devnode_t) 314 VFSATTR_RETURN(fsap, f_files, devfs_stats.nodes);
|
/macosx-10.5.8/xnu-1228.15.4/bsd/net/ |
H A D | radix.h | 151 struct radix_node_head *head, struct radix_node nodes[]); 154 struct radix_node_head *head, struct radix_node nodes[]);
|
H A D | radix.c | 399 rn_newpair(void *v, int b, struct radix_node nodes[2]) argument 401 struct radix_node *tt = nodes, *t = tt + 1; 422 struct radix_node nodes[2]) 465 t = rn_newpair(v_arg, b, nodes); 612 * nodes and possibly save time in calculating indices. 1052 /* If one or more nodes got deleted, restart from top */ 1105 /* If one or more nodes got deleted, restart from top */ 421 rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry, struct radix_node nodes[2]) argument
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeNodeReserve.c | 41 * nodes. This reserve info is kept in a hash table. 56 int nr_nodecnt; /* count of nodes held in reserve */ 57 int nr_newnodes; /* nodes that were allocated */ 235 BTUpdateReserve(BTreeControlBlockPtr btreePtr, int nodes) argument 237 nr_update(btreePtr->fileRefNum, nodes);
|
/macosx-10.5.8/xnu-1228.15.4/osfmk/kern/ |
H A D | processor.h | 106 pset_node_t nodes; /* list of associated subnodes */ member in struct:pset_node 107 pset_node_t node_list; /* chain of associated nodes */
|
/macosx-10.5.8/xnu-1228.15.4/bsd/hfs/hfscommon/headers/ |
H A D | BTreesPrivate.h | 226 u_int32_t numMapNodesRead; // map nodes beyond header node 320 u_int32_t nodes ); 326 int nodes);
|
/macosx-10.5.8/xnu-1228.15.4/osfmk/ppc/ |
H A D | skiplists.s | 40 * successive list has only 1/F as many nodes on it as the previous, where F is the 41 * "fanout." With a max of n lists, up to F**n nodes can be handled optimally. 56 * 64-byte nodes with 4 list links, and 128-byte nodes with 12. Only one in every 180 ; r2 = count of nodes visited 188 ; r2 = count of nodes visited 200 add r8,r8,r2 ; count nodes visited 268 ; r2 = count of nodes visited 275 ; r2 = count of nodes visited 288 addc r9,r9,r2 ; count nodes visite [all...] |
Completed in 50 milliseconds