Searched refs:extent_node_t (Results 1 - 3 of 3) sorted by relevance

/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/
H A DHybridAllocator.h36 typedef struct extent_node extent_node_t; typedef in typeref:struct:extent_node
43 rb_node(extent_node_t) offset_link;
46 typedef rb_tree(extent_node_t) extent_tree_offset_t;
48 extern extent_node_t *
52 free_node(extent_node_t *node);
54 extern extent_node_t *
68 extent_tree_remove_node (extent_tree_offset_t *offset_tree, extent_node_t * node);
70 extern extent_node_t *
73 extern extent_node_t *
74 extent_tree_off_search(extent_tree_offset_t *offset_tree, extent_node_t *nod
[all...]
/darwin-on-arm/xnu/bsd/hfs/hfscommon/Misc/
H A DHybridAllocator.c55 * static extent_node_t* extent_tree_offset_first (extent_tree_offset_t * tree)
58 * static extent_node_t* extent_tree_offset_last (extent_tree_offset_t * tree)
60 * From a given extent_node_t, grab the next one. If no next exists, return NULL
61 * static extent_node_t* extent_tree_offset_next (extent_tree_offset_t * tree, extent_node_t * node)
63 * From a given extent_node_t, grab the previous. If no prev exists, return NULL
64 * static extent_node_t* extent_tree_offset_prev(extent_tree_offset_t * tree, extent_node_t * node)
66 * Find a extent_node_t with the specified key (search by offset). If it does not exist, return NULL
67 * static extent_node_t* extent_tree_offset_searc
[all...]
H A DVolumeAllocation.c413 extent_node_t** node1);
1585 extent_node_t search_sentinel;
1586 extent_node_t *node = NULL;
1587 extent_node_t tempnode;
1589 bzero (&tempnode, sizeof(extent_node_t));
1592 memset (&search_sentinel, 0, sizeof(extent_node_t));
1674 extent_node_t *metaend_node;
2468 extent_node_t *node = NULL;
2469 extent_node_t search_sentinel;
2942 extent_node_t *newnod
[all...]

Completed in 103 milliseconds