Lines Matching refs:aspace
44 static void _print_tree(rt_aspace_t aspace) in _print_tree() argument
46 rt_varea_t varea = VAREA_ENTRY(aspace->tree.tree.root_node); in _print_tree()
50 for (size_t i = 0; i < aspace->tree.tree.root_node->height; i++) { in _print_tree()
167 static int _aspace_traversal(rt_aspace_t aspace, int (*fn)(rt_varea_t varea, void *arg), void *arg) in _aspace_traversal() argument
169 rt_varea_t varea = ASPACE_VAREA_FIRST(aspace); in _aspace_traversal()
179 static int _aspace_traversal_reverse(rt_aspace_t aspace, int (*fn)(rt_varea_t varea, void *arg), vo… in _aspace_traversal_reverse() argument
181 rt_varea_t varea = ASPACE_VAREA_LAST(aspace); in _aspace_traversal_reverse()
191 static int _check_bst_before(struct rt_aspace *aspace, struct rt_varea *varea) in _check_bst_before() argument
193 rt_varea_t root = VAREA_ENTRY(aspace->tree.tree.root_node); in _check_bst_before()
204 _aspace_traversal(aspace, _check_asc_before, varea); in _check_bst_before()
206 _aspace_traversal_reverse(aspace, _check_asc_before_rev, varea); in _check_bst_before()
212 static int _check_bst_after(struct rt_aspace *aspace, struct rt_varea *varea, int isdel) in _check_bst_after() argument
214 rt_varea_t root = VAREA_ENTRY(aspace->tree.tree.root_node); in _check_bst_after()
224 _aspace_traversal(aspace, _check_asc_after, isdel ? NULL : varea); in _check_bst_after()
313 int _aspace_bst_init(struct rt_aspace *aspace) in _aspace_bst_init() argument
315 aspace->tree.tree.root_node = AVL_ROOT; in _aspace_bst_init()
387 struct rt_varea *_aspace_bst_search(struct rt_aspace *aspace, void *key) in _aspace_bst_search() argument
389 struct util_avl_root *root = &aspace->tree.tree; in _aspace_bst_search()
394 rt_varea_t _aspace_bst_search_exceed(struct rt_aspace *aspace, void *start) in _aspace_bst_search_exceed() argument
396 struct util_avl_root *root = &aspace->tree.tree; in _aspace_bst_search_exceed()
428 struct rt_varea *_aspace_bst_search_overlap(struct rt_aspace *aspace, in _aspace_bst_search_overlap() argument
431 struct util_avl_root *root = &aspace->tree.tree; in _aspace_bst_search_overlap()
442 void _aspace_bst_insert(struct rt_aspace *aspace, struct rt_varea *varea) in _aspace_bst_insert() argument
444 struct util_avl_root *root = &aspace->tree.tree; in _aspace_bst_insert()
464 _check_bst_before(aspace, varea); in _aspace_bst_insert()
467 _check_bst_after(aspace, varea, 0); in _aspace_bst_insert()
471 void _aspace_bst_remove(struct rt_aspace *aspace, struct rt_varea *varea) in _aspace_bst_remove() argument
474 _check_bst_before(aspace, varea); in _aspace_bst_remove()
475 util_avl_remove(node, &aspace->tree.tree); in _aspace_bst_remove()
476 _check_bst_after(aspace, varea, 1); in _aspace_bst_remove()
479 struct rt_aspace aspace; variable
502 _aspace_bst_init(&aspace); in init_test()
521 _aspace_bst_insert(&aspace, varea); in insert_test()
531 varea = _aspace_bst_search(&aspace, start); in search_test()
543 varea = _aspace_bst_search(&aspace, start); in delete_test()
544 _aspace_bst_remove(&aspace, varea); in delete_test()