Lines Matching defs:nEntry
35859 ** The blocks are stored in a doubly-linked list. Variable PGroupBlock.nEntry
35861 ** nEntry is limited to the number of bits in bitmask mUsed. If a slot
35863 ** when (mUsed+1==(1 << nEntry)) the block is completely full.
35880 int nEntry; /* Maximum number of allocations in aData[] */
35887 /* Minimum value for PGroupBlock.nEntry */
36204 if( pBlock==0 || pBlock->mUsed==(((Bitmask)1<<pBlock->nEntry)-1) ){
36221 pBlock->nEntry = (sqlite3MallocSize(pBlock) - sizeof(PGroupBlock)) / nByte;
36222 if( pBlock->nEntry>=BMS ){
36223 pBlock->nEntry = BMS-1;
36236 for(i=0; pPg==0 && ALWAYS(i<pBlock->nEntry); i++){
36246 if( pBlock->mUsed==(((Bitmask)1<<pBlock->nEntry)-1) && pList->pLast!=pBlock ){
44843 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
45386 int nEntry = 0; /* Number of entries in the hash table */
45387 for(i=0; i<HASHTABLE_NSLOT; i++){ if( aHash[i] ) nEntry++; }
45388 assert( nEntry==idx );
45703 while( pSegment->iNext<pSegment->nEntry ){
45920 int nEntry; /* Number of entries in this segment */
45925 nEntry = (int)(iLast - iZero);
45927 nEntry = (int)((u32*)aHash - (u32*)aPgno);
45932 for(j=0; j<nEntry; j++){
45935 walMergesort((u32 *)aPgno, aTmp, aIndex, &nEntry);
45937 p->aSegment[i].nEntry = nEntry;
51291 int nEntry; /* Number of entries on one ptrmap page */
51304 nEntry = pBt->usableSize/5;
51305 nPtrmap = (nFree-nOrig+PTRMAP_PAGENO(pBt, nOrig)+nEntry)/nEntry;
55629 i64 nEntry = 0; /* Value to return in *pnEntry */
55651 nEntry += pPage->nCell;
55668 *pnEntry = nEntry;
61866 int nEntry = sqlite3PagerWalCallback(sqlite3BtreePager(pBt));
61867 if( db->xWalCallback && nEntry>0 && rc==SQLITE_OK ){
61868 rc = db->xWalCallback(db->pWalArg, db, db->aDb[i].zName, nEntry);
63792 i64 nEntry;
66118 i64 nEntry;
66124 rc = sqlite3BtreeCount(u.ap.pCrsr, &u.ap.nEntry);
66126 u.ap.nEntry = 0;
66128 pOut->u.i = u.ap.nEntry;
122451 int nEntry; /* Number of terms written to node so far */
124035 pTree->nEntry++;
124151 iNextLeaf += (pIter->nEntry+1);
126240 int nEntry = 0;
126245 if( !c ) nEntry++;
126249 return nEntry;