Lines Matching refs:iHash

60240   int iHash,                      /* Find the iHash'th table */
60245 rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
60246 assert( rc==SQLITE_OK || iHash>0 );
60250 if( iHash==0 ){
60254 pLoc->iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
60268 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
60269 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
60270 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
60271 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
60272 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
60273 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
60275 return iHash;
60282 int iHash = walFramePage(iFrame);
60283 if( iHash==0 ){
60286 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
62284 int iHash; /* Used to loop through N hash tables */
62327 for(iHash=walFramePage(iLast); iHash>=iMinHash; iHash--){
62334 rc = walHashGet(pWal, iHash, &sLoc);
107508 u32 iHash; /* Tiebreaker hash */
107580 pTo->iHash = pFrom->iHash;
107753 if( pNew->iHash>pOld->iHash ) return 1;
107981 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
187786 int iHash;
187788 iHash = nodeHash(pNode->iNode);
187789 pNode->pNext = pRtree->aHash[iHash];
187790 pRtree->aHash[iHash] = pNode;
202463 int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
202465 p->pNext = apNew[iHash];
202466 apNew[iHash] = p;
202696 int iHash;
202741 rc = sessionPreupdateHash(pSession, pTab, op==SQLITE_INSERT, &iHash, &bNull);
202747 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
202811 pChange->pNext = pTab->apChange[iHash];
202812 pTab->apChange[iHash] = pChange;
206349 int iHash;
206403 iHash = sessionChangeHash(
206410 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
206430 pChange->pNext = pTab->apChange[iHash];
206431 pTab->apChange[iHash] = pChange;
206817 int iHash = sessionChangeHash(pTab, 0, aRec, pTab->nChange);
206819 for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
215065 unsigned int iHash;
215068 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p),
215070 p->pHashNext = apNew[iHash];
215071 apNew[iHash] = p;
215140 unsigned int iHash;
215149 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
215150 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
215171 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
215182 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
215186 p->pHashNext = pHash->aSlot[iHash];
215187 pHash->aSlot[iHash] = p;
215220 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
215385 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
215389 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){