Lines Matching defs:nEntry
45812 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
46355 int nEntry = 0; /* Number of entries in the hash table */
46356 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
46357 assert( nEntry==idx );
46680 while( pSegment->iNext<pSegment->nEntry ){
46897 int nEntry; /* Number of entries in this segment */
46902 nEntry = (int)(iLast - iZero);
46904 nEntry = (int)((u32*)aHash - (u32*)aPgno);
46909 for(j=0; j<nEntry; j++){
46912 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
46914 p->aSegment[i].nEntry = nEntry;
52408 int nEntry; /* Number of entries on one ptrmap page */
52421 nEntry = pBt->usableSize/5;
52422 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
56816 i64 nEntry = 0; /* Value to return in *pnEntry */
56838 nEntry += pPage->nCell;
56855 *pnEntry = nEntry;
63069 int nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
63070 if( db->xWalCallback && nEntry>0 && rc==SQLITE_OK ){
63071 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zName, nEntry);
65117 i64 nEntry;
67466 i64 nEntry;
67472 rc = sqlite3BtreeCount(u.aq.pCrsr, &u.aq.nEntry);
67474 u.aq.nEntry = 0;
67476 pOut->u.i = u.aq.nEntry;
125250 int nEntry; /* Number of terms written to node so far */
126945 pTree->nEntry++;
127061 iNextLeaf += (pIter->nEntry+1);
128168 int nEntry = 0;
128208 nEntry++;
128215 fts3UpdateDocTotals(&rc, p, aSzIns, aSzDel, nEntry);
129323 int nEntry = 0;
129328 if( !c ) nEntry++;
129332 return nEntry;
