Lines Matching refs:nSlot
17482 u32 nSlot; /* Number of lookaside slots allocated */ member
23925 if( pHighwater ) *pHighwater = db->lookaside.nSlot - nInit; in sqlite3LookasideUsed()
23926 return db->lookaside.nSlot - (nInit+nFree); in sqlite3LookasideUsed()
55025 int nSlot; /* The number of pcache slots */
55079 pcache1.nSlot = pcache1.nFreeSlot = n;
55190 assert( pcache1.nFreeSlot<=pcache1.nSlot );
55318 if( pcache1.nSlot && (pCache->szPage+pCache->szExtra)<=pcache1.szSlot ){
155883 int nSlot; /* Number of entries in a[] */
159011 if( pWC->nTerm>=pWC->nSlot ){
159014 pWC->a = sqlite3WhereMalloc(pWC->pWInfo, sizeof(pWC->a[0])*pWC->nSlot*2 );
159023 pWC->nSlot = pWC->nSlot*2;
160623 pWC->nSlot = ArraySize(pWC->aStatic);
179017 db->lookaside.nSlot = nBig+nSm;
179029 db->lookaside.nSlot = 0;
238032 int nSlot; /* Size of aSlot[] array */
238103 pNew->nSlot = 1024;
238104 nByte = sizeof(Fts5HashEntry*) * pNew->nSlot;
238133 for(i=0; i<pHash->nSlot; i++){
238141 memset(pHash->aSlot, 0, pHash->nSlot * sizeof(Fts5HashEntry*));
238145 static unsigned int fts5HashKey(int nSlot, const u8 *p, int n){
238151 return (h % nSlot);
238154 static unsigned int fts5HashKey2(int nSlot, u8 b, const u8 *p, int n){
238161 return (h % nSlot);
238168 int nNew = pHash->nSlot*2;
238177 for(i=0; i<pHash->nSlot; i++){
238189 pHash->nSlot = nNew;
238262 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
238281 if( (pHash->nEntry*2)>=pHash->nSlot ){
238284 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
238295 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
238463 for(iSlot=0; iSlot<pHash->nSlot; iSlot++){
238500 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
238541 for(ii=0; ii<pHash->nSlot; ii++){
241841 const int nSlot = TOMBSTONE_NSLOT(pHash);
241842 int iSlot = (iRowid / nHashTable) % nSlot;
241843 int nCollide = nSlot;
241852 iSlot = (iSlot+1)%nSlot;
241859 iSlot = (iSlot+1)%nSlot;
241986 i64 nSlot; /* Power of two >= nSeg */
241988 for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2);
241991 sizeof(Fts5SegIter) * (nSlot-1) + /* pNew->aSeg[] */
241992 sizeof(Fts5CResult) * nSlot /* pNew->aFirst[] */
241995 pNew->nSeg = nSlot;
241996 pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot];
245980 const int nSlot = TOMBSTONE_NSLOT(pPg);
245982 int iSlot = (iRowid / nPg) % nSlot;
245983 int nCollide = nSlot;
245991 if( bForce==0 && nElem>=(nSlot/2) ){
245999 iSlot = (iSlot + 1) % nSlot;
246006 iSlot = (iSlot + 1) % nSlot;
246117 int nSlot = 0; /* Number of slots in each output page */
246140 nSlot = MINSLOT;
246146 nSlot = MAX(nElem*4, MINSLOT);
246147 if( nSlot>nSlotPerPage ) nOut = 0;
246152 nSlot = nSlotPerPage;
246163 assert( nSlot>=MINSLOT );
246165 szPage = 8 + nSlot*szKey;
246196 nSlot = nSlotPerPage;
247143 int nSlot = (n - 8) / szKey;
247149 for(ii=0; ii<nSlot; ii++){