Home
last modified time | relevance | path

Searched refs:avl_right (Results 1 – 10 of 10) sorted by relevance

/components/lwp/
A Dlwp_avl.c31 nodeleft->avl_right = node; in lwp_avl_rebalance()
40 nodeleftright->avl_right = node; in lwp_avl_rebalance()
53 node->avl_right = noderightleft; in lwp_avl_rebalance()
102 nodeplace = &node->avl_right; in lwp_avl_remove()
119 if (node->avl_right == AVL_EMPTY) in lwp_avl_remove()
123 nodeplace = &node->avl_right; in lwp_avl_remove()
127 node->avl_right = node_to_delete->avl_right; in lwp_avl_remove()
152 nodeplace = &node->avl_right; in lwp_avl_insert()
155 new_node->avl_right = AVL_EMPTY; in lwp_avl_insert()
174 ptree = ptree->avl_right; in lwp_avl_find()
[all …]
A Dlwp_tid.c55 lwp_tid_free_head = (struct lwp_avl_struct *)p->avl_right; in lwp_tid_get()
113 p->avl_right = lwp_tid_free_head; in lwp_tid_put()
A Dlwp_avl.h30 struct lwp_avl_struct *avl_right; member
A Dlwp_pid.c155 lwp_pid_free_head = (struct lwp_avl_struct *)p->avl_right; in lwp_pid_get_locked()
207 p->avl_right = lwp_pid_free_head; in lwp_pid_put_locked()
/components/utilities/libadt/avl/
A Davl.c30 lchild->avl_right = axis; in rotate_right()
50 axis->avl_left = lrchild->avl_right; in midmount_right()
52 lrchild->avl_right = axis; in midmount_right()
61 if (lchild->avl_right != NULL) in midmount_right()
74 axis->avl_right = rlchild; in rotate_left()
95 axis->avl_right = rlchild->avl_left; in midmount_left()
96 rlchild->avl_right = rchild; in midmount_left()
108 if (axis->avl_right != NULL) in midmount_left()
109 axis->avl_right->parent = axis; in midmount_left()
193 if (node->avl_right == NULL) in util_avl_remove()
[all …]
A Davl.h21 struct util_avl_struct *avl_right; member
43 new_node->avl_right = AVL_ROOT; in util_avl_link()
55 if (node->avl_right) in util_avl_next()
57 node = node->avl_right; in util_avl_next()
64 while ((successor = node->parent) && (node == successor->avl_right)) in util_avl_next()
80 while (node->avl_right) in util_avl_prev()
81 node = node->avl_right; in util_avl_prev()
110 while (last->avl_right) in util_avl_last()
111 last = last->avl_right; in util_avl_last()
/components/dfs/dfs_v1/filesystems/cromfs/
A Ddfs_cromfs.c120 struct cromfs_avl_struct *avl_right; member
148 nodeleft->avl_right = node; in cromfs_avl_rebalance()
157 nodeleftright->avl_right = node; in cromfs_avl_rebalance()
170 node->avl_right = noderightleft; in cromfs_avl_rebalance()
224 nodeplace = &node->avl_right; in cromfs_avl_remove()
242 if (node->avl_right == AVL_EMPTY) in cromfs_avl_remove()
248 nodeplace = &node->avl_right; in cromfs_avl_remove()
252 node->avl_right = node_to_delete->avl_right; in cromfs_avl_remove()
282 nodeplace = &node->avl_right; in cromfs_avl_insert()
286 new_node->avl_right = AVL_EMPTY; in cromfs_avl_insert()
[all …]
/components/dfs/dfs_v2/filesystems/cromfs/
A Ddfs_cromfs.c131 struct cromfs_avl_struct *avl_right; member
159 nodeleft->avl_right = node; in cromfs_avl_rebalance()
168 nodeleftright->avl_right = node; in cromfs_avl_rebalance()
181 node->avl_right = noderightleft; in cromfs_avl_rebalance()
235 nodeplace = &node->avl_right; in cromfs_avl_remove()
253 if (node->avl_right == AVL_EMPTY) in cromfs_avl_remove()
259 nodeplace = &node->avl_right; in cromfs_avl_remove()
263 node->avl_right = node_to_delete->avl_right; in cromfs_avl_remove()
293 nodeplace = &node->avl_right; in cromfs_avl_insert()
297 new_node->avl_right = AVL_EMPTY; in cromfs_avl_insert()
[all …]
/components/mm/
A Davl_adpt.c89 node = node->avl_right; in search()
132 node = node->avl_right; in _aspace_bst_search_exceed()
165 next = &(current->avl_right); in _aspace_bst_insert()
/components/dfs/dfs_v2/src/
A Ddfs_pcache.c1142 next = &(current->avl_right); in _dfs_page_insert()
1412 avl_node = avl_node->avl_right; in dfs_page_search()

Completed in 27 milliseconds