Lines Matching refs:iHash
61382 int iHash, /* Find the iHash'th table */
61387 rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
61388 assert( rc==SQLITE_OK || iHash>0 );
61392 if( iHash==0 ){
61396 pLoc->iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
61411 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
61412 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
61413 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
61414 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
61415 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
61416 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
61418 assert( iHash>=0 );
61419 return iHash;
61426 int iHash = walFramePage(iFrame);
61427 if( iHash==0 ){
61430 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
63514 int iHash; /* Used to loop through N hash tables */
63557 for(iHash=walFramePage(iLast); iHash>=iMinHash; iHash--){
63564 rc = walHashGet(pWal, iHash, &sLoc);
110505 u32 iHash; /* Tiebreaker hash */
110577 pTo->iHash = pFrom->iHash;
110749 if( pNew->iHash>pOld->iHash ) return 1;
110977 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
194586 int iHash;
194588 iHash = nodeHash(pNode->iNode);
194589 pNode->pNext = pRtree->aHash[iHash];
194590 pRtree->aHash[iHash] = pNode;
209405 int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
209407 p->pNext = apNew[iHash];
209408 apNew[iHash] = p;
209758 int iHash;
209803 rc = sessionPreupdateHash(pSession, pTab, op==SQLITE_INSERT, &iHash, &bNull);
209809 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
209872 pC->pNext = pTab->apChange[iHash];
209873 pTab->apChange[iHash] = pC;
213594 int iHash;
213648 iHash = sessionChangeHash(
213655 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
213675 pChange->pNext = pTab->apChange[iHash];
213676 pTab->apChange[iHash] = pChange;
214062 int iHash = sessionChangeHash(pTab, 0, aRec, pTab->nChange);
214064 for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
222533 unsigned int iHash;
222536 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p),
222538 p->pHashNext = apNew[iHash];
222539 apNew[iHash] = p;
222608 unsigned int iHash;
222617 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
222618 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
222639 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
222650 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
222654 p->pHashNext = pHash->aSlot[iHash];
222655 pHash->aSlot[iHash] = p;
222687 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
222853 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
222857 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){