Lines Matching refs:nMin

43803   int nMin = MIN(nBuf, (SQLITE_WIN32_DBG_BUF_SIZE - 1)); /* may be negative. */
43804   if( nMin<-1 ) nMin = -1; /* all negative values become -1. */
43805   assert( nMin==-1 || nMin==0 || nMin<SQLITE_WIN32_DBG_BUF_SIZE );
43813   if( nMin>0 ){
43815     memcpy(zDbgBuf, zBuf, nMin);
43824           nMin, (LPWSTR)zDbgBuf, SQLITE_WIN32_DBG_BUF_SIZE/sizeof(WCHAR))<=0 ){
43829   if( nMin>0 ){
43831     memcpy(zDbgBuf, zBuf, nMin);
50982   unsigned int nMin;                  /* Minimum number of pages reserved */
51602       pCache->nMin = 10;
51603       pGroup->nMinPage += pCache->nMin;
51867   assert( pCache->bPurgeable || pCache->nMin==0 );
51868   assert( pCache->bPurgeable==0 || pCache->nMin==10 );
51869   assert( pCache->nMin==0 || pCache->bPurgeable );
51980   assert( pCache->bPurgeable || (pCache->nMax==0 && pCache->nMin==0) );
51985   assert( pGroup->nMinPage >= pCache->nMin );
51986   pGroup->nMinPage -= pCache->nMin;
74373   const int nMin = pCur->pBt->usableSize * 2 / 3;
74385     if( pPage->nOverflow==0 && pPage->nFree<=nMin ){
97937     int nMin = pSorter->iMemory + nReq;
97939     if( nMin>pSorter->nMemory ){
97946       while( nNew < nMin ) nNew = nNew*2;
97948       if( nNew < nMin ) nNew = nMin;
187294 static void blobGrowBuffer(Blob *pBlob, int nMin, int *pRc){
187295   if( *pRc==SQLITE_OK && nMin>pBlob->nAlloc ){
187296     int nAlloc = nMin;
188452 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
188484     sqlite3_bind_int(pFindLevel, 1, MAX(2, nMin));
188513         nSeg = MIN(MAX(nMin,nSeg), nHintSeg);
188650   int nMin = (MergeCount(p) / 2);
188661     nMin = fts3Getint(&z);
188664   if( z[0]!='\0' || nMin<2 ){
188673       rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
226196       int nMin = MIN(p1->term.n, p2->term.n);
226197       int res = fts5Memcmp(p1->term.p, p2->term.p, nMin);
227587   int nMin = MIN(pPage->term.n, nTerm);
227630         n = 1 + fts5PrefixCompress(nMin, pPage->term.p, pTerm);
227637     nPrefix = fts5PrefixCompress(nMin, pPage->term.p, pTerm);
228034   int nMin                        /* Minimum number of segments to merge */
228068     if( nBest<nMin && pStruct->aLevel[iBestLvl].nMerge==0 ){
228428     int nMin = p->pConfig->nUsermerge;
228434       nMin = 2;
228438       if( fts5IndexMerge(p, &pStruct, nMerge, nMin) ){