Lines Matching refs:node
30 rt_varea_t lchild = VAREA_ENTRY(varea->node.node.avl_left); in _print_varea()
31 rt_varea_t rchild = VAREA_ENTRY(varea->node.node.avl_right); in _print_varea()
60 rt_varea_t lchild = VAREA_ENTRY(varea->node.node.avl_left); in _is_bst()
61 rt_varea_t rchild = VAREA_ENTRY(varea->node.node.avl_right); in _is_bst()
64 RT_ASSERT(lchild->node.node.parent == &varea->node.node); in _is_bst()
69 RT_ASSERT(rchild->node.node.parent == &varea->node.node); in _is_bst()
86 rt_varea_t lchild = VAREA_ENTRY(varea->node.node.avl_left); in _is_balanced()
87 rt_varea_t rchild = VAREA_ENTRY(varea->node.node.avl_right); in _is_balanced()
364 struct util_avl_struct *node = root->root_node; in search() local
365 while (node) in search()
367 rt_varea_t varea = VAREA_ENTRY(node); in search()
373 node = node->avl_left; in search()
377 node = node->avl_right; in search()
397 struct util_avl_struct *node = root->root_node; in _aspace_bst_search_exceed() local
400 while (node) in _aspace_bst_search_exceed()
402 rt_varea_t varea = VAREA_ENTRY(node); in _aspace_bst_search_exceed()
414 node = node->avl_left; in _aspace_bst_search_exceed()
418 node = node->avl_right; in _aspace_bst_search_exceed()
465 util_avl_link(&varea->node.node, current, next); in _aspace_bst_insert()
473 struct util_avl_struct *node = &varea->node.node; in _aspace_bst_remove() local
475 util_avl_remove(node, &aspace->tree.tree); in _aspace_bst_remove()