Searched refs:pTree (Results 1 – 1 of 1) sorted by relevance
99 BtRbTree *pTree; member163 for(p=pCur->pTree->pCursors; p; p=p->pShared){ in checkReadLocks()205 static void leftRotate(BtRbTree *pTree, BtRbNode *pX) in leftRotate() argument221 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()237 static void rightRotate(BtRbTree *pTree, BtRbNode *pX) in rightRotate() argument253 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()407 static void do_insert_balancing(BtRbTree *pTree, BtRbNode *pX) in do_insert_balancing() argument417 while( pX != pTree->pHead && !pX->pParent->isBlack ){ in do_insert_balancing()464 leftRotate(pTree, pX); in do_insert_balancing()480 rightRotate( pTree, pGrandparent ); in do_insert_balancing()[all …]