Lines Matching refs:nEntry

56115     int nEntry;                   /* Nr. of entries in aPgno[] and aIndex[] */
56671       int nEntry = 0;  /* Number of entries in the hash table */
56672       for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
56673       assert( nEntry==idx );
57010     while( pSegment->iNext<pSegment->nEntry ){
57231       int nEntry;                 /* Number of entries in this segment */
57236         nEntry = (int)(iLast - iZero);
57238         nEntry = (int)((u32*)aHash - (u32*)aPgno);
57243       for(j=0; j<nEntry; j++){
57246       walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
57248       p->aSegment[i].nEntry = nEntry;
64137   int nEntry;                     /* Number of entries on one ptrmap page */
64141   nEntry = pBt->usableSize/5;
64142   nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
69410   i64 nEntry = 0;                      /* Value to return in *pnEntry */
69432       nEntry += pPage->nCell;
69449           *pnEntry = nEntry;
78233       int nEntry;
78235       nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
78237       if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){
78238         rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry);
82869   i64 nEntry;
82875   nEntry = 0;  /* Not needed.  Only used to silence a warning. */
82876   rc = sqlite3BtreeCount(pCrsr, &nEntry);
82879   pOut->u.i = nEntry;
159109   int nEntry;                     /* Number of terms written to node so far */
160936       pTree->nEntry++;
161052       iNextLeaf += (pIter->nEntry+1);
162395     int nEntry = 0;
162437         nEntry++;
162444       fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
165422   int nEntry = 0;
165427     if( !c ) nEntry++;
165431   return nEntry;
166431   int nEntry = 0;
166441       nEntry++;
166445   if( nEntry ){
166449     aNew = sqlite3_realloc(p->aiException, (p->nException+nEntry)*sizeof(int));
178887   int nEntry;                     /* Total number of entries in hash table */
179630   if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){
179946       pTab->nEntry++;
181115     if( pTab->nEntry ){
181294     ret = (pTab->nEntry>0);
183351         pTab->nEntry--;
183363       pTab->nEntry++;
183406     if( pTab->nEntry==0 ) continue;
193752   int nEntry;                     /* Number of entries currently in hash */
193858   pHash->nEntry = 0;
193987     if( (pHash->nEntry*2)>=pHash->nSlot ){
194007     pHash->nEntry++;
194186   pHash->nEntry = 0;