Lines Matching refs:iHash

67047   int iHash,                      /* Find the iHash'th table */
67052   rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
67053   assert( rc==SQLITE_OK || iHash>0 );
67057     if( iHash==0 ){
67061       pLoc->iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
67076   int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;  local
67077   assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
67078        && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
67079        && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
67080        && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
67081        && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
67083   assert( iHash>=0 );
67084   return iHash;
67091   int iHash = walFramePage(iFrame);  local
67093   if( iHash==0 ){
67096   return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
69390   int iHash;                      /* Used to loop through N hash tables */  local
69433   for(iHash=walFramePage(iLast); iHash>=iMinHash; iHash--){
69440     rc = walHashGet(pWal, iHash, &sLoc);
120379   u32 iHash;                      /* Tiebreaker hash */
120451   pTo->iHash = pFrom->iHash;
120623   if( pNew->iHash>pOld->iHash ) return 1;
120855     p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
214121   int iHash;
214123   iHash = nodeHash(pNode->iNode);
214124   pNode->pNext = pRtree->aHash[iHash];
214125   pRtree->aHash[iHash] = pNode;
229128         int iHash = sessionChangeHash(pTab, bPkOnly, p->aRecord, nNew);
229130         p->pNext = apNew[iHash];
229131         apNew[iHash] = p;
229845   int iHash;
229897       pSession, iRowid, pTab, op==SQLITE_INSERT, &iHash, &bNull
229904     for(pC=pTab->apChange[iHash]; pC; pC=pC->pNext){
229981       pC->pNext = pTab->apChange[iHash];
229982       pTab->apChange[iHash] = pC;
234028   int iHash = 0;
234069     iHash = sessionChangeHash(
234072     for(pp=&pTab->apChange[iHash]; *pp; pp=&(*pp)->pNext){
234094     pChange->pNext = pTab->apChange[iHash];
234095     pTab->apChange[iHash] = pChange;
234552       int iHash = sessionChangeHash(pTab, 0, aRec, pTab->nChange);
234554       for(pChange=pTab->apChange[iHash]; pChange; pChange=pChange->pNext){
243842       unsigned int iHash;
243845       iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p), p->nKey);
243846       p->pHashNext = apNew[iHash];
243847       apNew[iHash] = p;
243916   unsigned int iHash;
243925   iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
243926   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){
243947       iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
243958     assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
243962     p->pHashNext = pHash->aSlot[iHash];
243963     pHash->aSlot[iHash] = p;
243995       for(pp=&pHash->aSlot[iHash]; *pp!=p; pp=&(*pp)->pHashNext);
244163   unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
244167   for(p=pHash->aSlot[iHash]; p; p=p->pHashNext){