Lines Matching refs:nSlot

16363   u32 nSlot;              /* Number of lookaside slots allocated */  member
22492   if( pHighwater ) *pHighwater = db->lookaside.nSlot - nInit;
22493   return db->lookaside.nSlot - (nInit+nFree);
50925   int nSlot;                     /* The number of pcache slots */
50979     pcache1.nSlot = pcache1.nFreeSlot = n;
51090     assert( pcache1.nFreeSlot<=pcache1.nSlot );
51233   if( pcache1.nSlot && (pCache->szPage+pCache->szExtra)<=pcache1.szSlot ){
146164   int nSlot;               /* Number of entries in a[] */
149040   if( pWC->nTerm>=pWC->nSlot ){
149043     pWC->a = sqlite3DbMallocRawNN(db, sizeof(pWC->a[0])*pWC->nSlot*2 );
149055     pWC->nSlot = sqlite3DbMallocSize(db, pWC->a)/sizeof(pWC->a[0]);
150494   pWC->nSlot = ArraySize(pWC->aStatic);
167416     db->lookaside.nSlot = nBig+nSm;
167428     db->lookaside.nSlot = 0;
222391   int nSlot;                      /* Size of aSlot[] array */
222457     pNew->nSlot = 1024;
222458     nByte = sizeof(Fts5HashEntry*) * pNew->nSlot;
222487   for(i=0; i<pHash->nSlot; i++){
222495   memset(pHash->aSlot, 0, pHash->nSlot * sizeof(Fts5HashEntry*));
222499 static unsigned int fts5HashKey(int nSlot, const u8 *p, int n){
222505   return (h % nSlot);
222508 static unsigned int fts5HashKey2(int nSlot, u8 b, const u8 *p, int n){
222515   return (h % nSlot);
222522   int nNew = pHash->nSlot*2;
222531   for(i=0; i<pHash->nSlot; i++){
222544   pHash->nSlot = nNew;
222617   iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
222636     if( (pHash->nEntry*2)>=pHash->nSlot ){
222639       iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
222650     assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
222815   for(iSlot=0; iSlot<pHash->nSlot; iSlot++){
222853   unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
225909   int nSlot;                      /* Power of two >= nSeg */
225911   for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2);
225914       sizeof(Fts5SegIter) * (nSlot-1) +   /* pNew->aSeg[] */
225915       sizeof(Fts5CResult) * nSlot         /* pNew->aFirst[] */
225918     pNew->nSeg = nSlot;
225919     pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot];