Searched refs:pHead (Results 1 – 2 of 2) sorted by relevance
120 BtRbNode *pHead; /* Head of the tree, or NULL */ member224 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()256 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()340 pNode = tree->pHead; in check_redblack_tree()367 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()387 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()420 while( pX != pTree->pHead && !pX->pParent->isBlack ){ in do_insert_balancing()498 pTree->pHead->isBlack = 1; in do_insert_balancing()522 while( pX != pTree->pHead && (!pX || pX->isBlack) ){ in do_delete_balancing()549 pX = pTree->pHead; in do_delete_balancing()[all …]
1921 ldapmemcacheRes *pHead = *((ldapmemcacheRes**)ppTableData);1929 for (; pHead; pHead = pHead->ldmemcr_htable_next) {1930 if ((pHead->ldmemcr_req_id).ldmemcrid_ld == pReqId->ldmemcrid_ld)1932 pPrev = pHead;1935 if (!pHead)1938 for (pCurRes = pHead; pCurRes; pCurRes = pCurRes->ldmemcr_next[LIST_TTL]) { 1954 if (pCurRes != pHead) {1965 if (pHead->ldmemcr_next[LIST_TTL]) {1966 pPrev->ldmemcr_htable_next = pHead->ldmemcr_next[LIST_TTL];1967 pHead->ldmemcr_next[LIST_TTL]->ldmemcr_htable_next = [all …]