Lines Matching refs:nEntry
45840 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
46383 int nEntry = 0; /* Number of entries in the hash table */
46384 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
46385 assert( nEntry==idx );
46708 while( pSegment->iNext<pSegment->nEntry ){
46925 int nEntry; /* Number of entries in this segment */
46930 nEntry = (int)(iLast - iZero);
46932 nEntry = (int)((u32*)aHash - (u32*)aPgno);
46937 for(j=0; j<nEntry; j++){
46940 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
46942 p->aSegment[i].nEntry = nEntry;
52436 int nEntry; /* Number of entries on one ptrmap page */
52449 nEntry = pBt->usableSize/5;
52450 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
56844 i64 nEntry = 0; /* Value to return in *pnEntry */
56866 nEntry += pPage->nCell;
56883 *pnEntry = nEntry;
63097 int nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
63098 if( db->xWalCallback && nEntry>0 && rc==SQLITE_OK ){
63099 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zName, nEntry);
65145 i64 nEntry;
67494 i64 nEntry;
67500 rc = sqlite3BtreeCount(u.aq.pCrsr, &u.aq.nEntry);
67502 u.aq.nEntry = 0;
67504 pOut->u.i = u.aq.nEntry;
125298 int nEntry; /* Number of terms written to node so far */
126993 pTree->nEntry++;
127109 iNextLeaf += (pIter->nEntry+1);
128216 int nEntry = 0;
128256 nEntry++;
128263 nEntry);
129371 int nEntry = 0;
129376 if( !c ) nEntry++;
129380 return nEntry;
