Home | History | Annotate | Download | only in orig

Lines Matching defs:nMin

39170   int nMin = MIN(nBuf, (SQLITE_WIN32_DBG_BUF_SIZE - 1)); /* may be negative. */
39171 if( nMin<-1 ) nMin = -1; /* all negative values become -1. */
39172 assert( nMin==-1 || nMin==0 || nMin<SQLITE_WIN32_DBG_BUF_SIZE );
39180 if( nMin>0 ){
39182 memcpy(zDbgBuf, zBuf, nMin);
39191 nMin, (LPWSTR)zDbgBuf, SQLITE_WIN32_DBG_BUF_SIZE/sizeof(WCHAR))<=0 ){
39196 if( nMin>0 ){
39198 memcpy(zDbgBuf, zBuf, nMin);
45248 unsigned int nMinPage; /* Sum of nMin for purgeable caches */
45273 unsigned int nMin; /* Minimum number of pages reserved */
45892 pCache->nMin = 10;
45893 pGroup->nMinPage += pCache->nMin;
46066 ** nMin for all other purgeable caches, or
46148 assert( pCache->bPurgeable || pCache->nMin==0 );
46149 assert( pCache->bPurgeable==0 || pCache->nMin==10 );
46150 assert( pCache->nMin==0 || pCache->bPurgeable );
46262 assert( pCache->bPurgeable || (pCache->nMax==0 && pCache->nMin==0) );
46267 assert( pGroup->nMinPage >= pCache->nMin );
46268 pGroup->nMinPage -= pCache->nMin;
46357 int *pnMin, /* OUT: Sum of PCache1.nMin for purgeable caches */
67118 const int nMin = pCur->pBt->usableSize * 2 / 3;
67148 }else if( pPage->nOverflow==0 && pPage->nFree<=nMin ){
88014 int nMin = pSorter->iMemory + nReq;
88016 if( nMin>pSorter->nMemory ){
88020 while( nNew < nMin ) nNew = nNew*2;
88022 if( nNew < nMin ) nNew = nMin;
159715 ** Otherwise, if the allocation at pBlob->a is not already at least nMin
159722 static void blobGrowBuffer(Blob *pBlob, int nMin, int *pRc){
159723 if( *pRc==SQLITE_OK && nMin>pBlob->nAlloc ){
159724 int nAlloc = nMin;
160835 ** Incremental merges happen nMin segments at a time. The segments
160836 ** to be merged are the nMin oldest segments (the ones with the smallest
160838 ** at least nMin segments. Multiple merges might occur in an attempt to
160841 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
160867 ** relative level number that contains at least nMin segments, if any.
160869 ** nSeg to nMin. If no level with at least nMin segments can be found,
160873 sqlite3_bind_int(pFindLevel, 1, MAX(2, nMin));
160907 ** nMin segments and no hint in the %_stat table. No work to do.
161018 int nMin = (FTS3_MERGE_COUNT / 2);
161029 nMin = fts3Getint(&z);
161032 if( z[0]!='\0' || nMin<2 ){
161041 rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
192614 int nMin = MIN(p1->term.n, p2->term.n);
192615 int res = memcmp(p1->term.p, p2->term.p, nMin);
194422 int nMin /* Minimum number of segments to merge */
194456 if( nBest<nMin && pStruct->aLevel[iBestLvl].nMerge==0 ){
194814 int nMin = p->pConfig->nUsermerge;
194820 nMin = 2;
194824 if( fts5IndexMerge(p, &pStruct, nMerge, nMin) ){