Lines Matching refs:nEntry

59824     int nEntry;                   /* Nr. of entries in aPgno[] and aIndex[] */
60414       int nEntry = 0;  /* Number of entries in the hash table */
60415       for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
60416       assert( nEntry==idx );
60755     while( pSegment->iNext<pSegment->nEntry ){
60975       int nEntry;                 /* Number of entries in this segment */
60980         nEntry = (int)(iLast - sLoc.iZero);
60982         nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
60987       for(j=0; j<nEntry; j++){
60990       walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);
60992       p->aSegment[i].nEntry = nEntry;
68175   int nEntry;                     /* Number of entries on one ptrmap page */
68179   nEntry = pBt->usableSize/5;
68180   nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
73864   i64 nEntry = 0;                      /* Value to return in *pnEntry */
73886       nEntry += pPage->nCell;
73903           *pnEntry = nEntry;
83369       int nEntry;
83371       nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
83373       if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){
83374         rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry);
88321   i64 nEntry;
88328     nEntry = sqlite3BtreeRowCountEst(pCrsr);
88330     nEntry = 0;  /* Not needed.  Only used to silence a warning. */
88331     rc = sqlite3BtreeCount(db, pCrsr, &nEntry);
88335   pOut->u.i = nEntry;
176458   int nEntry;                     /* Number of terms written to node so far */
178304       pTree->nEntry++;
178420       iNextLeaf += (pIter->nEntry+1);
179780     int nEntry = 0;
179822         nEntry++;
179829       fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
182869   int nEntry = 0;
182874     if( !c ) nEntry++;
182878   return nEntry;
183913   int nEntry = 0;
183923       nEntry++;
183927   if( nEntry ){
183931     aNew = sqlite3_realloc64(p->aiException,(p->nException+nEntry)*sizeof(int));
201665   int nEntry;                     /* Total number of entries in hash table */
202444   if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){
202760       pTab->nEntry++;
203932     if( pTab->nEntry ){
204111     ret = (pTab->nEntry>0);
206420         pTab->nEntry--;
206432       pTab->nEntry++;
206475     if( pTab->nEntry==0 ) continue;
214922   int nEntry;                     /* Number of entries currently in hash */
215028   pHash->nEntry = 0;
215168     if( (pHash->nEntry*2)>=pHash->nSlot ){
215188     pHash->nEntry++;
215369   pHash->nEntry = 0;