Searched refs:pHead (Results 1 – 2 of 2) sorted by relevance
117 BtRbNode *pHead; /* Head of the tree, or NULL */ member221 if( pTree->pHead == pX ) pTree->pHead = pY; in leftRotate()253 if( pTree->pHead == pX ) pTree->pHead = pY; in rightRotate()337 pNode = tree->pHead; in check_redblack_tree()364 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()384 *msg = append_node(*msg, tree->pHead, 0); in check_redblack_tree()417 while( pX != pTree->pHead && !pX->pParent->isBlack ){ in do_insert_balancing()495 pTree->pHead->isBlack = 1; in do_insert_balancing()519 while( pX != pTree->pHead && (!pX || pX->isBlack) ){ in do_delete_balancing()546 pX = pTree->pHead; in do_delete_balancing()[all …]
1920 ldapmemcacheRes *pHead = *((ldapmemcacheRes**)ppTableData);1928 for (; pHead; pHead = pHead->ldmemcr_htable_next) {1929 if ((pHead->ldmemcr_req_id).ldmemcrid_ld == pReqId->ldmemcrid_ld)1931 pPrev = pHead;1934 if (!pHead)1937 for (pCurRes = pHead; pCurRes; pCurRes = pCurRes->ldmemcr_next[LIST_TTL]) {1953 if (pCurRes != pHead) {1964 if (pHead->ldmemcr_next[LIST_TTL]) {1965 pPrev->ldmemcr_htable_next = pHead->ldmemcr_next[LIST_TTL];1966 pHead->ldmemcr_next[LIST_TTL]->ldmemcr_htable_next =[all …]