Searched refs:util_avl_struct (Results 1 – 6 of 6) sorted by relevance
18 struct util_avl_struct struct20 struct util_avl_struct *avl_left; argument21 struct util_avl_struct *avl_right; argument22 struct util_avl_struct *parent; argument26 #define AVL_ROOT ((struct util_avl_struct *)0) argument30 struct util_avl_struct *root_node;33 void util_avl_rebalance(struct util_avl_struct *node,50 struct util_avl_struct *node) in util_avl_next()52 struct util_avl_struct *successor = 0; in util_avl_next()72 struct util_avl_struct *node) in util_avl_prev()[all …]
23 static inline void rotate_right(struct util_avl_struct *axis, in rotate_right()24 struct util_avl_struct *lchild, in rotate_right()68 static inline void rotate_left(struct util_avl_struct *axis, in rotate_left()120 void util_avl_rebalance(struct util_avl_struct *node, in util_avl_rebalance()126 struct util_avl_struct *axis = node; in util_avl_rebalance()127 struct util_avl_struct **nodeplace; in util_avl_rebalance()130 struct util_avl_struct *lchild = axis->avl_left; in util_avl_rebalance()131 struct util_avl_struct *rchild = axis->avl_right; in util_avl_rebalance()178 struct util_avl_struct **nodeplace; in util_avl_remove()202 struct util_avl_struct *rchild = node->avl_right; in util_avl_remove()[all …]
76 struct util_avl_struct *node = root->root_node; in search()109 struct util_avl_struct *node = root->root_node; in _aspace_bst_search_exceed()152 struct util_avl_struct *current = NULL; in _aspace_bst_insert()153 struct util_avl_struct **next = &(root->root_node); in _aspace_bst_insert()178 struct util_avl_struct *node = &varea->node.node; in _aspace_bst_remove()
32 struct util_avl_struct node;
45 struct util_avl_struct avl_node; /* Node for AVL tree in address space */
1130 struct util_avl_struct *current = NULL; in _dfs_page_insert()1131 struct util_avl_struct **next = &(aspace->avl_root.root_node); in _dfs_page_insert()1387 struct util_avl_struct *avl_node; in dfs_page_search()
Completed in 14 milliseconds