Lines Matching refs:AvlNode
51 // AvlNode* node -> +---------------+ V
53 // | AvlNode |
70 // an AvlNode.
92 typedef OSetNode AvlNode;
98 AvlNode* left;
99 AvlNode* right;
118 AvlNode* root; // root node
120 AvlNode* nodeStack[STACK_MAX]; // Iterator node stack
129 // Given a pointer to the node's element, return the pointer to the AvlNode
133 AvlNode* node_of_elem(const void *elem)
135 AvlNode* n = (AvlNode*)((Addr)elem - sizeof(AvlNode));
145 // Given an AvlNode, return the pointer to the element.
147 void* elem_of_node(const AvlNode *n)
154 return (void*)((Addr)n + sizeof(AvlNode));
159 void* elem_of_node_no_check(const AvlNode *n)
161 return (void*)((Addr)n + sizeof(AvlNode));
165 void* slow_key_of_node(AvlTree* t, AvlNode* n)
171 void* fast_key_of_node(AvlNode* n)
177 static inline Word fast_cmp(const void* k, const AvlNode* n)
194 inline Word slow_cmp(const AvlTree* t, const void* k, const AvlNode* n)
201 static void avl_swl ( AvlNode** root )
203 AvlNode* a = *root;
204 AvlNode* b = a->right;
211 static void avl_swr ( AvlNode** root )
213 AvlNode* a = *root;
214 AvlNode* b = a->left;
221 static void avl_nasty ( AvlNode* root )
253 static inline void stackPush(AvlTree* t, AvlNode* n, Int i)
263 static inline Bool stackPop(AvlTree* t, AvlNode** n, Int* i)
291 // Check the padding is right and the AvlNode is the expected size.
292 vg_assert(sizeof(AvlNode) == 3*sizeof(void*));
321 AvlNode* n = NULL;
362 Int nodeSize = sizeof(AvlNode) + elemSize;
363 AvlNode* n = t->alloc( t->cc, nodeSize );
379 static inline Word cmp_key_root(AvlTree* t, AvlNode* n)
388 static Bool avl_insert(AvlTree* t, AvlNode* n)
465 AvlNode* n;
500 static AvlNode* avl_lookup(const AvlTree* t, const void* k)
503 AvlNode* curr = t->root;
534 AvlNode* n;
574 static Bool avl_remove(AvlTree* t, AvlNode* n)
661 AvlNode* n;
698 AvlNode* n = avl_lookup(t, k);
791 AvlNode *n, *t;
860 static void OSet_Print2( AvlTree* t, AvlNode* n,
