Searched refs:pTree (Results 1 – 1 of 1) sorted by relevance
102 BtRbTree *pTree; member166 for(p=pCur->pTree->pCursors; p; p=p->pShared){ in checkReadLocks()208 static void leftRotate(BtRbTree *pTree, BtRbNode *pX) in leftRotate() argument224 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()240 static void rightRotate(BtRbTree *pTree, BtRbNode *pX) in rightRotate() argument256 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()410 static void do_insert_balancing(BtRbTree *pTree, BtRbNode *pX) in do_insert_balancing() argument420 while( pX != pTree->pHead && !pX->pParent->isBlack ){ in do_insert_balancing()467 leftRotate(pTree, pX); in do_insert_balancing()483 rightRotate( pTree, pGrandparent ); in do_insert_balancing()[all …]