584     int nEntry;                   /* Nr. of entries in aPgno[] and aIndex[] */  member
1184       int nEntry = 0;  /* Number of entries in the hash table */  in walIndexAppend()  local
1185       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }  in walIndexAppend()
1186       assert( nEntry==idx );  in walIndexAppend()
1603     while( pSegment->iNext<pSegment->nEntry ){  in walIteratorNext()
1823       int nEntry;                 /* Number of entries in this segment */  in walIteratorInit()  local
1827         nEntry = (int)(iLast - sLoc.iZero);  in walIteratorInit()
1829         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);  in walIteratorInit()
1834       for(j=0; j<nEntry; j++){  in walIteratorInit()
1837       walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);  in walIteratorInit()
1839       p->aSegment[i].nEntry = nEntry;  in walIteratorInit()