hfscommon/Misc/HybridAllocator.c

55  * 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_search(extent_tree_offset_t * tree, extent_node_t * key)
71  * static extent_node_t*	extent_tree_offset_nsearch(extent_tree_offset_t * tree, extent_node_t * key)
73  * Find an extent_node_t with the specified key (offset).  If it does not exist,
75  * static extent_node_t*	extent_tree_offset_psearch(extent_tree_offset_t * tree, extent_node_t * key)
78  * static void				extent_tree_offset_insert(extent_tree_offset_t * tree, extent_node_t * node)
81  * static void				extent_tree_offset_remove(extent_tree_offset_t * tree, extent_node_t * node)
89 								 u_int32_t size, u_int32_t offset, extent_node_t *node);
102 cmp_offset_node(extent_node_t *node_1, extent_node_t *node_2) {
115 __private_extern__ extent_node_t *
117 	extent_node_t *node;
118 	MALLOC(node, extent_node_t *, sizeof(extent_node_t), M_TEMP, M_WAITOK);
135 free_node(extent_node_t *node) {
142  * search functions that operate on extent_node_t's and use cmp_length_node to do length searches.
147 rb_wrap(__attribute__ ((unused)) static, extent_tree_offset_, extent_tree_offset_t, extent_node_t, offset_link, cmp_offset_node)
156 	extent_node_t *node = NULL;
174 	extent_node_t *node = NULL;
175 	extent_node_t *next = NULL;
192 __private_extern__ extent_node_t *
193 extent_tree_off_search(extent_tree_offset_t *tree, extent_node_t *key) {
203 __private_extern__ extent_node_t *
204 extent_tree_off_search_next(extent_tree_offset_t *offset_tree, extent_node_t *key) {
216 __private_extern__ extent_node_t *
217 extent_tree_off_search_nextWithSize (extent_tree_offset_t *offset_tree, extent_node_t *key) {
219 	extent_node_t *current;
243 __private_extern__ extent_node_t *
244 extent_tree_off_search_prev(extent_tree_offset_t *offset_tree, extent_node_t *key) {
254 __private_extern__ extent_node_t *
262 __private_extern__ extent_node_t *
263 extent_tree_off_next(extent_tree_offset_t * tree, extent_node_t *node)
271 __private_extern__ extent_node_t *
272 extent_tree_off_prev(extent_tree_offset_t * tree, extent_node_t *node)
291 								 u_int32_t offset, extent_node_t *node)
294 		extent_node_t *prev = NULL;
295 		extent_node_t *next = NULL;
353 	extent_node_t search_sentinel = { .offset = offset };
354 	extent_node_t *node = extent_tree_offset_search(offset_tree, &search_sentinel);
379 	extent_node_t search_sentinel = { .offset = offset };
380 	extent_node_t *node= NULL;
418 			extent_node_t* newnode = alloc_node(newlen, newoff);
421 			extent_node_t *next = extent_tree_offset_next(offset_tree, newnode);
453 __private_extern__ extent_node_t *
456 	extent_node_t *prev = NULL;
457 	extent_node_t *node = NULL;
458 	extent_node_t *next = NULL;
459 	extent_node_t search_sentinel = { .offset = size + offset };
504 extent_tree_remove_node (extent_tree_offset_t *offset_tree, extent_node_t * node) {
523 	extent_node_t *node = NULL;