Lines Matching refs:nEntry
63945 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
64545 int nEntry = 0; /* Number of entries in the hash table */
64546 for(i=0; i<HASHTABLE_NSLOT; i++){ if( sLoc.aHash[i] ) nEntry++; }
64547 assert( nEntry==idx );
64964 while( pSegment->iNext<pSegment->nEntry ){
65184 int nEntry; /* Number of entries in this segment */
65188 nEntry = (int)(iLast - sLoc.iZero);
65190 nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
65195 for(j=0; j<nEntry; j++){
65198 walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);
65200 p->aSegment[i].nEntry = nEntry;
72612 int nEntry; /* Number of entries on one ptrmap page */
72616 nEntry = pBt->usableSize/5;
72617 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
78717 i64 nEntry = 0; /* Value to return in *pnEntry */
78739 nEntry += pPage->nCell;
78756 *pnEntry = nEntry;
88485 int nEntry;
88487 nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
88489 if( nEntry>0 && db->xWalCallback && rc==SQLITE_OK ){
88490 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zDbSName, nEntry);
93955 i64 nEntry;
93962 nEntry = sqlite3BtreeRowCountEst(pCrsr);
93964 nEntry = 0; /* Not needed. Only used to silence a warning. */
93965 rc = sqlite3BtreeCount(db, pCrsr, &nEntry);
93969 pOut->u.i = nEntry;
190108 int nEntry; /* Number of terms written to node so far */
191964 pTree->nEntry++;
192080 iNextLeaf += (pIter->nEntry+1);
193452 int nEntry = 0;
193494 nEntry++;
193501 fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
196553 int nEntry = 0;
196558 if( !c ) nEntry++;
196562 return nEntry;
197598 int nEntry = 0;
197608 nEntry++;
197612 if( nEntry ){
197616 aNew = sqlite3_realloc64(p->aiException,(p->nException+nEntry)*sizeof(int));
215642 int nEntry; /* Total number of entries in hash table */
216446 if( pTab->nChange==0 || pTab->nEntry>=(pTab->nChange/2) ){
216883 pTab->nEntry++;
218087 if( pTab->nEntry ){
218277 ret = (pTab->nEntry>0);
220747 pTab->nEntry--;
220759 pTab->nEntry++;
220802 if( pTab->nEntry==0 ) continue;
229475 int nEntry; /* Number of entries currently in hash */
229581 pHash->nEntry = 0;
229721 if( (pHash->nEntry*2)>=pHash->nSlot ){
229741 pHash->nEntry++;
229922 pHash->nEntry = 0;