Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 14 of 14) sorted by relevance

/xnu-11215/bsd/miscfs/devfs/
H A DREADME28 nodes.
33 The front and back nodes are identical in type, but the back nodes
41 To start with there is a 1:1 relationship between the front nodes
43 the nodes can be moved around within that plane (or deleted).
52 Front nodes representing directories and symlinks have their own
56 e.g. remove or rename nodes
85 nodes keep their own records as to which front nodes are members
89 The front nodes may be moved to other directories (including
91 backing nodes and the front nodes. The backing node never moves. If
105 have no front nodes in that plane.
[all …]
H A Ddevfsdefs.h99 int nodes; member
235 OSAddAtomic(1, &devfs_stats.nodes); in DEVFS_INCR_NODES()
241 OSAddAtomic(-1, &devfs_stats.nodes); in DEVFS_DECR_NODES()
H A Ddevfs_vfsops.c299 + devfs_stats.nodes * sizeof(devnode_t) in devfs_statfs()
305 sbp->f_files = devfs_stats.nodes; in devfs_statfs()
316 VFSATTR_RETURN(fsap, f_objcount, devfs_stats.nodes); in devfs_vfs_getattr()
317 VFSATTR_RETURN(fsap, f_maxobjcount, devfs_stats.nodes); in devfs_vfs_getattr()
322 + devfs_stats.nodes * sizeof(devnode_t) in devfs_vfs_getattr()
332 VFSATTR_RETURN(fsap, f_files, devfs_stats.nodes); in devfs_vfs_getattr()
/xnu-11215/bsd/net/
H A Dtrie_utility.h44 #define TRIE_NODE(t, i) ((t)->nodes[(i)])
68 struct net_trie_node *nodes __counted_by(nodes_count);
H A Dtrie_utility.c150 if (os_mul_overflow(sizeof(*new_trie->nodes), (size_t)nodes_count, &nodes_mem_size) || in net_trie_init()
182 new_trie->nodes = (struct net_trie_node *)(void *)(data_memory); in net_trie_init()
185 memset(new_trie->nodes, 0, nodes_mem_size); in net_trie_init()
223 os_mul_overflow(sizeof(*new_trie->nodes), (size_t)nodes_count, &test_nodes_mem_size) || in net_trie_init_with_mem()
261 new_trie->nodes = (struct net_trie_node *)(void *)(data_memory); in net_trie_init_with_mem()
276 (unsigned int)new_trie->nodes, new_trie->nodes_mem_size, new_trie->nodes_count, in net_trie_init_with_mem()
H A Dradix.h368 struct radix_node_head *head, struct radix_node nodes[]);
371 struct radix_node_head *head, struct radix_node nodes[]);
H A Dradix.c457 rn_newpair(void *v __sized_by(vlen), uint8_t vlen, int b, struct radix_node nodes[2]) in rn_newpair()
459 struct radix_node *tt = nodes, *t = tt + 1; in rn_newpair()
480 struct radix_node nodes[2]) in rn_insert()
529 t = rn_newpair(v_arg, vlen, b, nodes); in rn_insert()
/xnu-11215/tools/trace/
H A Dparse_ipc_trace.py345 self.nodes = {}
371 for k, v in self.nodes.iteritems():
380 self.nodes[src_str] = src;
383 self.nodes[dst_str] = dst
511 for k, v in self.nodes.iteritems():
521 for k, v in self.nodes.iteritems():
540 ofile.write(' ,' + ','.join(self.nodes.keys()) + '\n')
541 for snm, src in self.nodes.iteritems():
543 for dnm, dst in self.nodes.iteritems():
572 ofile.write("Nodes:{:d}\nEdges:{:d}\n".format(len(self.nodes),len(self.edges)))
/xnu-11215/bsd/netinet/
H A Dflow_divert.h76 struct flow_divert_trie_node *nodes __counted_by(nodes_count);
H A Dflow_divert.c121 #define TRIE_NODE(t, i) ((t)->nodes[(i)])
3149 if (os_mul_overflow(sizeof(*new_trie.nodes), (size_t)nodes_count, &nodes_mem_size) || in flow_divert_handle_app_map_create()
3174 new_trie.nodes = (struct flow_divert_trie_node *)new_trie.memory; in flow_divert_handle_app_map_create()
3178 memset(new_trie.nodes, 0, nodes_mem_size); in flow_divert_handle_app_map_create()
/xnu-11215/doc/lifecycle/
H A Dstartup.md256 - Last: registrations of dummy nodes in the constant nodes to allow extension.
/xnu-11215/osfmk/kern/
H A Dprocessor.h303 pset_node_t nodes; /* list of associated subnodes */ member
/xnu-11215/osfmk/arm64/
H A Dmonotonic_arm64.c1527 #pragma mark dev nodes
/xnu-11215/doc/scheduler/
H A Dsched_clutch_edge.md216 …duling latency delta that should exist between the source and destination nodes (i.e. clusters) fo…