Lines Matching refs:pe
90 struct cache_extent *pe = malloc(sizeof(*pe)); in alloc_cache_extent() local
92 if (!pe) in alloc_cache_extent()
93 return pe; in alloc_cache_extent()
95 pe->objectid = 0; in alloc_cache_extent()
96 pe->start = start; in alloc_cache_extent()
97 pe->size = size; in alloc_cache_extent()
98 return pe; in alloc_cache_extent()
103 struct cache_extent *pe = alloc_cache_extent(start, size); in add_cache_extent() local
106 if (!pe) in add_cache_extent()
109 ret = insert_cache_extent(tree, pe); in add_cache_extent()
111 free(pe); in add_cache_extent()
116 int insert_cache_extent(struct cache_tree *tree, struct cache_extent *pe) in insert_cache_extent() argument
118 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes); in insert_cache_extent()
121 int insert_cache_extent2(struct cache_tree *tree, struct cache_extent *pe) in insert_cache_extent2() argument
123 return rb_insert(&tree->root, &pe->rb_node, cache_tree_comp_nodes2); in insert_cache_extent2()
219 struct cache_extent *prev_cache_extent(struct cache_extent *pe) in prev_cache_extent() argument
221 struct rb_node *node = rb_prev(&pe->rb_node); in prev_cache_extent()
228 struct cache_extent *next_cache_extent(struct cache_extent *pe) in next_cache_extent() argument
230 struct rb_node *node = rb_next(&pe->rb_node); in next_cache_extent()
237 void remove_cache_extent(struct cache_tree *tree, struct cache_extent *pe) in remove_cache_extent() argument
239 rb_erase(&pe->rb_node, &tree->root); in remove_cache_extent()
253 static void free_extent_cache(struct cache_extent *pe) in free_extent_cache() argument
255 free(pe); in free_extent_cache()