66476     int nEntry;                   /* Nr. of entries in aPgno[] and aIndex[] */  member
67224       int nEntry = 0;  /* Number of entries in the hash table */  local
67225       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
67226       assert( nEntry==idx );
67649     while( pSegment->iNext<pSegment->nEntry ){
67861       int nEntry;                 /* Number of entries in this segment */  local
67865         nEntry = (int)(iLast - sLoc.iZero);
67867         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
67872       for(j=0; j<nEntry; j++){
67875       walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);
67877       p->aSegment[i].nEntry = nEntry;
75660   int nEntry;                     /* Number of entries on one ptrmap page */  local
75664   nEntry = pBt->usableSize/5;
75665   nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
81986   i64 nEntry = 0;                      /* Value to return in *pnEntry */  local
82008       nEntry += pPage->nCell;
82025           *pnEntry = nEntry;
92190       int nEntry;  local
92192       nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
92194       if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){
92195         rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry);
98081   i64 nEntry;
98088     nEntry = sqlite3BtreeRowCountEst(pCrsr);
98090     nEntry = 0;  /* Not needed.  Only used to silence a warning. */
98091     rc = sqlite3BtreeCount(db, pCrsr, &nEntry);
98095   pOut->u.i = nEntry;
199659   int nEntry;                     /* Number of terms written to node so far */
201515       pTree->nEntry++;
201631       iNextLeaf += (pIter->nEntry+1);
203008     int nEntry = 0;
203050         nEntry++;
203057       fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
206131   int nEntry = 0;
206136     if( !c ) nEntry++;
206140   return nEntry;
207200   int nEntry = 0;
207210       nEntry++;
207214   if( nEntry ){
207218     aNew = sqlite3_realloc64(p->aiException,(p->nException+nEntry)*sizeof(int));
228285   int nEntry;                     /* Total number of entries in hash table */
229107   if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){
229916       pTab->nEntry++;
231203     if( pTab->nEntry ){
231391     ret = (pTab->nEntry>0);
234082         pTab->nEntry--;
234096     pTab->nEntry++;
234161     if( pTab->nEntry==0 ) continue;
243694   int nEntry;                     /* Number of entries currently in hash */
243805   pHash->nEntry = 0;
243944     if( (pHash->nEntry*2)>=pHash->nSlot ){
243964     pHash->nEntry++;
244202   int nEntry = 0;
244207       nEntry++;
244210   return nEntry;
244218   assert( pHash->nEntry==fts5HashCount(pHash) );
244219   return pHash->nEntry==0;
244666   u64 nEntry;                     /* Number of rows in this segment */
245415             i += fts5GetVarint(&pData[i], &pSeg->nEntry);
245677           fts5BufferAppendVarint(&p->rc, &buf, pSeg->nEntry);
249098     assert( pSeg->nEntry==0 );
249101       pSeg->nEntry += (pOld->nEntry - pOld->nEntryTombstone);
249145       i64 nEntry = 0;
249149         nEntry += pLvl->aSeg[iSeg].nEntry;
249152       assert_nc( nEntry>0 || pLvl->nSeg==0 );
249153       if( nEntry>0 ){
249154         int nPercent = (nTomb * 100) / nEntry;
249992             pSeg->nEntry = p->nPendingRow;
253615       sqlite3_result_int64(ctx, pSeg->nEntry);