Lines Matching refs:iHash

66072   int iHash,                      /* Find the iHash'th table */
66077   rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
66078   assert( rc==SQLITE_OK || iHash>0 );
66082     if( iHash==0 ){
66086       pLoc->iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
66101   int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
66102   assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
66103        && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
66104        && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
66105        && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
66106        && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
66108   assert( iHash>=0 );
66109   return iHash;
66116   int iHash = walFramePage(iFrame);
66118   if( iHash==0 ){
66121   return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
68403   int iHash;                      /* Used to loop through N hash tables */
68446   for(iHash=walFramePage(iLast); iHash>=iMinHash; iHash--){
68453     rc = walHashGet(pWal, iHash, &sLoc);
118734   u32 iHash;                      /* Tiebreaker hash */
118806   pTo->iHash = pFrom->iHash;
118978   if( pNew->iHash>pOld->iHash ) return 1;
119210     p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
210965   int iHash;
210967   iHash = nodeHash(pNode->iNode);
210968   pNode->pNext = pRtree->aHash[iHash];
210969   pRtree->aHash[iHash] = pNode;
225871         int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
225873         p->pNext = apNew[iHash];
225874         apNew[iHash] = p;
226567   int iHash;
226619       pSession, iRowid, pTab, op==SQLITE_INSERT, &iHash, &bNull
226626     for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
226698       pC->pNext = pTab->apChange[iHash];
226699       pTab->apChange[iHash] = pC;
230694   int iHash = 0;
230733     iHash = sessionChangeHash(
230736     for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
230758     pChange->pNext = pTab->apChange[iHash];
230759     pTab->apChange[iHash] = pChange;
231210       int iHash = sessionChangeHash(pTab, 0, aRec, pTab->nChange);
231212       for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
240112       unsigned int iHash;
240115       iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p), p->nKey);
240116       p->pHashNext = apNew[iHash];
240117       apNew[iHash] = p;
240186   unsigned int iHash;
240195   iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
240196   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
240217       iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
240228     assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
240232     p->pHashNext = pHash->aSlot[iHash];
240233     pHash->aSlot[iHash] = p;
240265       for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
240433   unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
240437   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){