Lines Matching refs:nSlot
17532 u32 nSlot; /* Number of lookaside slots allocated */ member
24013 if( pHighwater ) *pHighwater = db->lookaside.nSlot - nInit; in sqlite3LookasideUsed()
24014 return db->lookaside.nSlot - (nInit+nFree); in sqlite3LookasideUsed()
55384 int nSlot; /* The number of pcache slots */
55438 pcache1.nSlot = pcache1.nFreeSlot = n;
55549 assert( pcache1.nFreeSlot<=pcache1.nSlot );
55677 if( pcache1.nSlot && (pCache->szPage+pCache->szExtra)<=pcache1.szSlot ){
157139 int nSlot; /* Number of entries in a[] */
160305 if( pWC->nTerm>=pWC->nSlot ){
160308 pWC->a = sqlite3WhereMalloc(pWC->pWInfo, sizeof(pWC->a[0])*pWC->nSlot*2 );
160317 pWC->nSlot = pWC->nSlot*2;
161920 pWC->nSlot = ArraySize(pWC->aStatic);
180633 db->lookaside.nSlot = nBig+nSm;
180645 db->lookaside.nSlot = 0;
239965 int nSlot; /* Size of aSlot[] array */
240036 pNew->nSlot = 1024;
240037 nByte = sizeof(Fts5HashEntry*) * pNew->nSlot;
240066 for(i=0; i<pHash->nSlot; i++){
240074 memset(pHash->aSlot, 0, pHash->nSlot * sizeof(Fts5HashEntry*));
240078 static unsigned int fts5HashKey(int nSlot, const u8 *p, int n){
240084 return (h % nSlot);
240087 static unsigned int fts5HashKey2(int nSlot, u8 b, const u8 *p, int n){
240094 return (h % nSlot);
240101 int nNew = pHash->nSlot*2;
240110 for(i=0; i<pHash->nSlot; i++){
240122 pHash->nSlot = nNew;
240195 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
240214 if( (pHash->nEntry*2)>=pHash->nSlot ){
240217 iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
240228 assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
240396 for(iSlot=0; iSlot<pHash->nSlot; iSlot++){
240433 unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
240474 for(ii=0; ii<pHash->nSlot; ii++){
243774 const int nSlot = TOMBSTONE_NSLOT(pHash);
243775 int iSlot = (iRowid / nHashTable) % nSlot;
243776 int nCollide = nSlot;
243785 iSlot = (iSlot+1)%nSlot;
243792 iSlot = (iSlot+1)%nSlot;
243919 i64 nSlot; /* Power of two >= nSeg */
243921 for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2);
243924 sizeof(Fts5SegIter) * (nSlot-1) + /* pNew->aSeg[] */
243925 sizeof(Fts5CResult) * nSlot /* pNew->aFirst[] */
243928 pNew->nSeg = nSlot;
243929 pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot];
247916 const int nSlot = TOMBSTONE_NSLOT(pPg);
247918 int iSlot = (iRowid / nPg) % nSlot;
247919 int nCollide = nSlot;
247927 if( bForce==0 && nElem>=(nSlot/2) ){
247935 iSlot = (iSlot + 1) % nSlot;
247942 iSlot = (iSlot + 1) % nSlot;
248053 int nSlot = 0; /* Number of slots in each output page */
248076 nSlot = MINSLOT;
248082 nSlot = MAX(nElem*4, MINSLOT);
248083 if( nSlot>nSlotPerPage ) nOut = 0;
248088 nSlot = nSlotPerPage;
248099 assert( nSlot>=MINSLOT );
248101 szPage = 8 + nSlot*szKey;
248132 nSlot = nSlotPerPage;
249079 int nSlot = (n - 8) / szKey;
249085 for(ii=0; ii<nSlot; ii++){