Searched refs:OldNode (Results 1 - 5 of 5) sorted by relevance

/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/samba-3.0.13/source/ubiqx/
H A Dubi_SplayTree.c260 ubi_btNodePtr *OldNode )
274 * OldNode - a pointer to an ubi_btNodePtr. When searching
283 * *OldNode will point to the duplicate that is
286 * function will swap **OldNode for *NewNode.
287 * In this case, *OldNode will point to the node
308 if( !(OldNode) )
309 OldNode = &OtherP;
311 if( ubi_btInsert( RootPtr, NewNode, ItemPtr, OldNode ) )
318 RootPtr->root = Splay( (*OldNode) );
H A Dubi_Cache.c302 ubi_trNodePtr OldNode; local
306 (void)ubi_trInsert( CachePtr, EntryPtr, Key, &OldNode );
307 if( OldNode )
308 free_entry( CachePtr, (ubi_cacheEntryPtr)OldNode );
H A Dubi_BinTree.c580 ubi_btNodePtr *OldNode )
594 * OldNode - a pointer to an ubi_btNodePtr. When searching
603 * *OldNode will point to the duplicate that is
606 * function will swap **OldNode for *NewNode.
607 * In this case, *OldNode will point to the node
630 if( NULL == OldNode ) /* If they didn't give us a pointer, supply our own. */
631 OldNode = &OtherP;
636 *OldNode = TreeFind(ItemPtr, (RootPtr->root), &parent, &tmp, (RootPtr->cmp));
639 if( NULL == (*OldNode) ) /* The easy one: we have a space for a new node! */
661 q = (*OldNode);
[all...]
H A Dubi_SplayTree.h166 ubi_btNodePtr *OldNode );
180 * OldNode - a pointer to an ubi_btNodePtr. When searching
189 * *OldNode will point to the duplicate that is
192 * function will swap **OldNode for *NewNode.
193 * In this case, *OldNode will point to the node
H A Dubi_BinTree.h483 ubi_btNodePtr *OldNode );
497 * OldNode - a pointer to an ubi_btNodePtr. When searching
506 * *OldNode will point to the duplicate that is
509 * function will swap **OldNode for *NewNode.
510 * In this case, *OldNode will point to the node

Completed in 106 milliseconds