Searched refs:nSlot (Results 1 – 11 of 11) sorted by relevance
| /sqlite-3.40.0/ext/fts5/ |
| H A D | fts5_hash.c | 32 int nSlot; /* Size of aSlot[] array */ member
98 pNew->nSlot = 1024; in sqlite3Fts5HashNew()
99 nByte = sizeof(Fts5HashEntry*) * pNew->nSlot; in sqlite3Fts5HashNew()
128 for(i=0; i<pHash->nSlot; i++){ in sqlite3Fts5HashClear()
146 return (h % nSlot); in fts5HashKey()
156 return (h % nSlot); in fts5HashKey2()
163 int nNew = pHash->nSlot*2; in fts5HashResize()
172 for(i=0; i<pHash->nSlot; i++){ in fts5HashResize()
185 pHash->nSlot = nNew; in fts5HashResize()
277 if( (pHash->nEntry*2)>=pHash->nSlot ){ in sqlite3Fts5HashWrite()
[all …]
|
| H A D | fts5_tcl.c | 1035 static unsigned int f5t_fts5HashKey(int nSlot, const char *p, int n){ in f5t_fts5HashKey() argument
1041 return (h % nSlot); in f5t_fts5HashKey()
1053 int nSlot; in f5tTokenHash() local
1059 if( Tcl_GetIntFromObj(interp, objv[1], &nSlot) ){ in f5tTokenHash()
1064 iVal = f5t_fts5HashKey(nSlot, z, n); in f5tTokenHash()
|
| H A D | fts5_index.c | 2989 int nSlot; /* Power of two >= nSeg */ in fts5MultiIterAlloc() local
2991 for(nSlot=2; nSlot<nSeg; nSlot=nSlot*2); in fts5MultiIterAlloc()
2994 sizeof(Fts5SegIter) * (nSlot-1) + /* pNew->aSeg[] */ in fts5MultiIterAlloc()
2995 sizeof(Fts5CResult) * nSlot /* pNew->aFirst[] */ in fts5MultiIterAlloc()
2998 pNew->nSeg = nSlot; in fts5MultiIterAlloc()
2999 pNew->aFirst = (Fts5CResult*)&pNew->aSeg[nSlot]; in fts5MultiIterAlloc()
|
| /sqlite-3.40.0/test/ |
| H A D | dbfuzz2.c | 298 int sz, nSlot; in LLVMFuzzerInitialize() local
305 nSlot = atoi(argv[++i]); in LLVMFuzzerInitialize()
306 sqlite3_config(SQLITE_CONFIG_LOOKASIDE, sz, nSlot); in LLVMFuzzerInitialize()
|
| /sqlite-3.40.0/src/ |
| H A D | pcache1.c | 228 int nSlot; /* The number of pcache slots */ member
282 pcache1.nSlot = pcache1.nFreeSlot = n; in sqlite3PCacheBufferSetup()
393 assert( pcache1.nFreeSlot<=pcache1.nSlot ); in pcache1Free()
521 if( pcache1.nSlot && (pCache->szPage+pCache->szExtra)<=pcache1.szSlot ){ in pcache1UnderMemoryPressure()
|
| H A D | status.c | 195 if( pHighwater ) *pHighwater = db->lookaside.nSlot - nInit; in sqlite3LookasideUsed()
196 return db->lookaside.nSlot - (nInit+nFree); in sqlite3LookasideUsed()
|
| H A D | whereexpr.c | 64 if( pWC->nTerm>=pWC->nSlot ){ in whereClauseInsert()
67 pWC->a = sqlite3WhereMalloc(pWC->pWInfo, sizeof(pWC->a[0])*pWC->nSlot*2 ); in whereClauseInsert()
76 pWC->nSlot = pWC->nSlot*2; in whereClauseInsert()
1659 pWC->nSlot = ArraySize(pWC->aStatic); in sqlite3WhereClauseInit()
|
| H A D | whereInt.h | 349 int nSlot; /* Number of entries in a[] */ member
|
| H A D | main.c | 825 db->lookaside.nSlot = nBig+nSm; in setupLookaside()
837 db->lookaside.nSlot = 0; in setupLookaside()
|
| H A D | sqliteInt.h | 1436 u32 nSlot; /* Number of lookaside slots allocated */ member
|
| /sqlite-3.40.0/ext/expert/ |
| H A D | sqlite3expert.c | 1490 int nSlot; member
1515 assert( iSlot<=p->nSlot ); in idxRemFunc()
1770 pCtx->nSlot = nMax+1; in idxPopulateStat1()
1807 for(i=0; i<pCtx->nSlot; i++){ in idxPopulateStat1()
|