Lines Matching refs:iHash
56487 int iHash, /* Find the iHash'th table */
56495 rc = walIndexPage(pWal, iHash, &aPgno);
56496 assert( rc==SQLITE_OK || iHash>0 );
56503 if( iHash==0 ){
56507 iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
56524 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
56525 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
56526 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
56527 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
56528 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
56529 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
56531 return iHash;
56538 int iHash = walFramePage(iFrame);
56539 if( iHash==0 ){
56542 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
58429 int iHash; /* Used to loop through N hash tables */
58472 for(iHash=walFramePage(iLast); iHash>=iMinHash && iRead==0; iHash--){
58480 rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
99113 u32 iHash; /* Tiebreaker hash */
99180 pTo->iHash = pFrom->iHash;
99346 if( pNew->iHash>pOld->iHash ) return 1;
99377 return (nEqNew==nEqOld && pNew->iHash>pOld->iHash);
99602 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
167615 int iHash;
167617 iHash = nodeHash(pNode->iNode);
167618 pNode->pNext = pRtree->aHash[iHash];
167619 pRtree->aHash[iHash] = pNode;
179654 int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
179656 p->pNext = apNew[iHash];
179657 apNew[iHash] = p;
179887 int iHash;
179932 rc = sessionPreupdateHash(pSession, pTab, op==SQLITE_INSERT, &iHash, &bNull);
179938 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
180002 pChange->pNext = pTab->apChange[iHash];
180003 pTab->apChange[iHash] = pChange;
183285 int iHash;
183339 iHash = sessionChangeHash(
183346 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
183366 pChange->pNext = pTab->apChange[iHash];
183367 pTab->apChange[iHash] = pChange;
193900 unsigned int iHash;
193903 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p),
193905 p->pHashNext = apNew[iHash];
193906 apNew[iHash] = p;
193964 unsigned int iHash;
193973 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
193974 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
193995 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
194006 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
194010 p->pHashNext = pHash->aSlot[iHash];
194011 pHash->aSlot[iHash] = p;
194044 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
194208 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
194212 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){