Lines Matching refs:iHash
51141 int iHash, /* Find the iHash'th table */
51149 rc = walIndexPage(pWal, iHash, &aPgno);
51150 assert( rc==SQLITE_OK || iHash>0 );
51157 if( iHash==0 ){
51161 iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
51178 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
51179 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
51180 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
51181 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
51182 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
51183 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
51185 return iHash;
51192 int iHash = walFramePage(iFrame);
51193 if( iHash==0 ){
51196 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
52690 int iHash; /* Used to loop through N hash tables */
52733 for(iHash=walFramePage(iLast); iHash>=iMinHash && iRead==0; iHash--){
52741 rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
90299 u32 iHash; /* Tiebreaker hash */
90365 pTo->iHash = pFrom->iHash;
90533 if( pNew->iHash>pOld->iHash ) return 1;
90564 return (nEqNew==nEqOld && pNew->iHash>pOld->iHash);
90772 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
154504 int iHash;
154506 iHash = nodeHash(pNode->iNode);
154507 pNode->pNext = pRtree->aHash[iHash];
154508 pRtree->aHash[iHash] = pNode;
172171 int iHash;
172174 iHash = fts5HashKey(nNew, (u8*)p->zKey, strlen(p->zKey));
172175 p->pHashNext = apNew[iHash];
172176 apNew[iHash] = p;
172214 unsigned int iHash;
172220 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
172221 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
172238 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
172247 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)p->zKey, nToken+1) );
172254 p->pHashNext = pHash->aSlot[iHash];
172255 pHash->aSlot[iHash] = p;
172276 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
172419 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
172422 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){