Lines Matching defs:iHash
64355 ** page iHash of the wal-index. The wal-index is broken into 32KB pages
64369 int iHash, /* Find the iHash'th table */
64374 rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
64375 assert( rc==SQLITE_OK || iHash>0 );
64379 if( iHash==0 ){
64383 pLoc->iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
64398 int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
64399 assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
64400 && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
64401 && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
64402 && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
64403 && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
64405 assert( iHash>=0 );
64406 return iHash;
64413 int iHash = walFramePage(iFrame);
64414 if( iHash==0 ){
64417 return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
66511 int iHash; /* Used to loop through N hash tables */
66554 for(iHash=walFramePage(iLast); iHash>=iMinHash; iHash--){
66561 rc = walHashGet(pWal, iHash, &sLoc);
114884 u32 iHash; /* Tiebreaker hash */
114956 pTo->iHash = pFrom->iHash;
115128 if( pNew->iHash>pOld->iHash ) return 1;
115356 p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
201587 int iHash;
201589 iHash = nodeHash(pNode->iNode);
201590 pNode->pNext = pRtree->aHash[iHash];
201591 pRtree->aHash[iHash] = pNode;
216467 int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
216469 p->pNext = apNew[iHash];
216470 apNew[iHash] = p;
216820 int iHash;
216865 rc = sessionPreupdateHash(pSession, pTab, op==SQLITE_INSERT, &iHash, &bNull);
216871 for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
216934 pC->pNext = pTab->apChange[iHash];
216935 pTab->apChange[iHash] = pC;
220676 int iHash;
220730 iHash = sessionChangeHash(
220737 for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
220757 pChange->pNext = pTab->apChange[iHash];
220758 pTab->apChange[iHash] = pChange;
221144 int iHash = sessionChangeHash(pTab, 0, aRec, pTab->nChange);
221146 for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
229618 unsigned int iHash;
229621 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p),
229623 p->pHashNext = apNew[iHash];
229624 apNew[iHash] = p;
229693 unsigned int iHash;
229702 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
229703 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
229724 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
229735 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
229739 p->pHashNext = pHash->aSlot[iHash];
229740 pHash->aSlot[iHash] = p;
229772 for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
229879 ** Extract all tokens from hash table iHash and link them into a list
229938 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
229942 for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
234572 ** Flush the contents of in-memory hash table iHash to a new level-0