Lines Matching refs:nEntry

60958     int nEntry;                   /* Nr. of entries in aPgno[] and aIndex[] */
61558       int nEntry = 0;  /* Number of entries in the hash table */
61559       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
61560       assert( nEntry==idx );
61977     while( pSegment->iNext<pSegment->nEntry ){
62197       int nEntry;                 /* Number of entries in this segment */
62201         nEntry = (int)(iLast - sLoc.iZero);
62203         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
62208       for(j=0; j<nEntry; j++){
62211       walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);
62213       p->aSegment[i].nEntry = nEntry;
69455   int nEntry;                     /* Number of entries on one ptrmap page */
69459   nEntry = pBt->usableSize/5;
69460   nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
75435   i64 nEntry = 0;                      /* Value to return in *pnEntry */
75457       nEntry += pPage->nCell;
75474           *pnEntry = nEntry;
85042       int nEntry;
85044       nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
85046       if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){
85047         rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry);
90064   i64 nEntry;
90071     nEntry = sqlite3BtreeRowCountEst(pCrsr);
90073     nEntry = 0;  /* Not needed.  Only used to silence a warning. */
90074     rc = sqlite3BtreeCount(db, pCrsr, &nEntry);
90078   pOut->u.i = nEntry;
183090   int nEntry;                     /* Number of terms written to node so far */
184946       pTree->nEntry++;
185062       iNextLeaf += (pIter->nEntry+1);
186432     int nEntry = 0;
186474         nEntry++;
186481       fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
189530   int nEntry = 0;
189535     if( !c ) nEntry++;
189539   return nEntry;
190575   int nEntry = 0;
190585       nEntry++;
190589   if( nEntry ){
190593     aNew = sqlite3_realloc64(p->aiException,(p->nException+nEntry)*sizeof(int));
208580   int nEntry;                     /* Total number of entries in hash table */
209384   if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){
209821       pTab->nEntry++;
211025     if( pTab->nEntry ){
211215     ret = (pTab->nEntry>0);
213665         pTab->nEntry--;
213677       pTab->nEntry++;
213720     if( pTab->nEntry==0 ) continue;
222390   int nEntry;                     /* Number of entries currently in hash */
222496   pHash->nEntry = 0;
222636     if( (pHash->nEntry*2)>=pHash->nSlot ){
222656     pHash->nEntry++;
222837   pHash->nEntry = 0;