Lines Matching refs:iHash

48353   int iHash,                      /* Find the iHash'th table */
48361   rc = walIndexPage(pWal, iHash, &aPgno);
48362   assert( rc==SQLITE_OK || iHash>0 );
48369     if( iHash==0 ){
48373       iZero = HASHTABLE_NPAGE_ONE + (iHash-1)*HASHTABLE_NPAGE;
48390   int iHash = (iFrame+HASHTABLE_NPAGE-HASHTABLE_NPAGE_ONE-1) / HASHTABLE_NPAGE;
48391   assert( (iHash==0 || iFrame>HASHTABLE_NPAGE_ONE)
48392        && (iHash>=1 || iFrame<=HASHTABLE_NPAGE_ONE)
48393        && (iHash<=1 || iFrame>(HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE))
48394        && (iHash>=2 || iFrame<=HASHTABLE_NPAGE_ONE+HASHTABLE_NPAGE)
48395        && (iHash<=2 || iFrame>(HASHTABLE_NPAGE_ONE+2*HASHTABLE_NPAGE))
48397   return iHash;
48404   int iHash = walFramePage(iFrame);
48405   if( iHash==0 ){
48408   return pWal->apWiData[iHash][(iFrame-1-HASHTABLE_NPAGE_ONE)%HASHTABLE_NPAGE];
49820   int iHash;                      /* Used to loop through N hash tables */
49861   for(iHash=walFramePage(iLast); iHash>=0 && iRead==0; iHash--){
49869     rc = walHashGet(pWal, iHash, &aHash, &aPgno, &iZero);
83737   u32 iHash;                      /* Tiebreaker hash */
83803   pTo->iHash = pFrom->iHash;
83967   if( pNew->iHash>pOld->iHash ) return 1;
83998   return (nEqNew==nEqOld && pNew->iHash>pOld->iHash);
84206   p->current.iHash = p->iPrn = p->iPrn*1103515245 + 12345;
145199   int iHash;
145201   iHash = nodeHash(pNode->iNode);
145202   pNode->pNext = pRtree->aHash[iHash];
145203   pRtree->aHash[iHash] = pNode;