Lines Matching refs:nSlot

45316   int nSlot;                     /* The number of pcache slots */
45369     pcache1.nSlot = pcache1.nFreeSlot = n;
45479     assert( pcache1.nFreeSlot<=pcache1.nSlot );
45621   if( pcache1.nSlot && (pCache->szPage+pCache->szExtra)<=pcache1.szSlot ){
126736   int nSlot;               /* Number of entries in a[] */
129153   if( pWC->nTerm>=pWC->nSlot ){
129156     pWC->a = sqlite3DbMallocRawNN(db, sizeof(pWC->a[0])*pWC->nSlot*2 );
129168     pWC->nSlot = sqlite3DbMallocSize(db, pWC->a)/sizeof(pWC->a[0]);
130429   pWC->nSlot = ArraySize(pWC->aStatic);
189611   int nSlot;                      /* Size of aSlot[] array */
189677     pNew->nSlot = 1024;
189678     nByte = sizeof(Fts5HashEntry*) * pNew->nSlot;
189707   for(i=0; i<pHash->nSlot; i++){
189715   memset(pHash->aSlot, 0, pHash->nSlot * sizeof(Fts5HashEntry*));
189719 static unsigned int fts5HashKey(int nSlot, const u8 *p, int n){
189725   return (h % nSlot);
189728 static unsigned int fts5HashKey2(int nSlot, u8 b, const u8 *p, int n){
189735   return (h % nSlot);
189742   int nNew = pHash->nSlot*2;
189751   for(i=0; i<pHash->nSlot; i++){
189763   pHash->nSlot = nNew;
189825   iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
189844     if( (pHash->nEntry*2)>=pHash->nSlot ){
189847       iHash = fts5HashKey2(pHash->nSlot, (u8)bByte, (const u8*)pToken, nToken);
189858     assert( iHash==fts5HashKey(pHash->nSlot, (u8*)zKey, nToken+1) );
190023   for(iSlot=0; iSlot<pHash->nSlot; iSlot++){
190058   unsigned int iHash = fts5HashKey(pHash->nSlot, (const u8*)pTerm, nTerm);
193027   int nSlot;                      /* Power of two >= nSeg */
193029   for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2);
193032       sizeof(Fts5SegIter) * (nSlot-1) +   /* pNew->aSeg[] */
193033       sizeof(Fts5CResult) * nSlot         /* pNew->aFirst[] */
193036     pNew->nSeg = nSlot;
193037     pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot];