Lines Matching refs:iHash
51145 ** page iHash of the wal-index. The wal-index is broken into 32KB pages
51159 int iHash, /* Find the iHash'th table */
51167 rc = walIndexPage(pWal, iHash, &aPgno);
51168 assert( rc==SQLITE_OK || iHash>0 );
51175 if( iHash==0 ){
51179 iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
51196 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
51197 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
51198 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
51199 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
51200 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
51201 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
51203 return iHash;
51210 int iHash = walFramePage(iFrame);
51211 if( iHash==0 ){
51214 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
52708 int iHash; /* Used to loop through N hash tables */
52751 for(iHash=walFramePage(iLast); iHash>=iMinHash && iRead==0; iHash--){
52759 rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
90317 u32 iHash; /* Tiebreaker hash */
90383 pTo->iHash = pFrom->iHash;
90551 if( pNew->iHash>pOld->iHash ) return 1;
90582 return (nEqNew==nEqOld && pNew->iHash>pOld->iHash);
90790 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
154534 int iHash;
154536 iHash = nodeHash(pNode->iNode);
154537 pNode->pNext = pRtree->aHash[iHash];
154538 pRtree->aHash[iHash] = pNode;
172201 int iHash;
172204 iHash = fts5HashKey(nNew, (u8*)p->zKey, strlen(p->zKey));
172205 p->pHashNext = apNew[iHash];
172206 apNew[iHash] = p;
172244 unsigned int iHash;
172250 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
172251 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
172268 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
172277 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)p->zKey, nToken+1) );
172284 p->pHashNext = pHash->aSlot[iHash];
172285 pHash->aSlot[iHash] = p;
172306 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
172393 ** Extract all tokens from hash table iHash and link them into a list
172449 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
172452 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
176217 ** Flush the contents of in-memory hash table iHash to a new level-0
