Lines Matching refs:nMin

41946   int nMin = MIN(nBuf, (SQLITE_WIN32_DBG_BUF_SIZE - 1)); /* may be negative. */
41947   if( nMin<-1 ) nMin = -1; /* all negative values become -1. */
41948   assert( nMin==-1 || nMin==0 || nMin<SQLITE_WIN32_DBG_BUF_SIZE );
41956   if( nMin>0 ){
41958     memcpy(zDbgBuf, zBuf, nMin);
41967           nMin, (LPWSTR)zDbgBuf, SQLITE_WIN32_DBG_BUF_SIZE/sizeof(WCHAR))<=0 ){
41972   if( nMin>0 ){
41974     memcpy(zDbgBuf, zBuf, nMin);
48844   unsigned int nMin;                  /* Minimum number of pages reserved */
49460       pCache->nMin = 10;
49461       pGroup->nMinPage += pCache->nMin;
49719   assert( pCache->bPurgeable || pCache->nMin==0 );
49720   assert( pCache->bPurgeable==0 || pCache->nMin==10 );
49721   assert( pCache->nMin==0 || pCache->bPurgeable );
49832   assert( pCache->bPurgeable || (pCache->nMax==0 && pCache->nMin==0) );
49837   assert( pGroup->nMinPage >= pCache->nMin );
49838   pGroup->nMinPage -= pCache->nMin;
71498   const int nMin = pCur->pBt->usableSize * 2 / 3;
71531     }else if( pPage->nOverflow==0 && pPage->nFree<=nMin ){
93573     int nMin = pSorter->iMemory + nReq;
93575     if( nMin>pSorter->nMemory ){
93582       while( nNew < nMin ) nNew = nNew*2;
93584       if( nNew < nMin ) nNew = nMin;
174283 static void blobGrowBuffer(Blob *pBlob, int nMin, int *pRc){
174284   if( *pRc==SQLITE_OK && nMin>pBlob->nAlloc ){
174285     int nAlloc = nMin;
175434 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
175466     sqlite3_bind_int(pFindLevel, 1, MAX(2, nMin));
175495         nSeg = MIN(MAX(nMin,nSeg), nHintSeg);
175626   int nMin = (MergeCount(p) / 2);
175637     nMin = fts3Getint(&z);
175640   if( z[0]!='\0' || nMin<2 ){
175649       rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
211685       int nMin = MIN(p1->term.n, p2->term.n);
211686       int res = fts5Memcmp(p1->term.p, p2->term.p, nMin);
213061   int nMin = MIN(pPage->term.n, nTerm);
213104         n = 1 + fts5PrefixCompress(nMin, pPage->term.p, pTerm);
213111     nPrefix = fts5PrefixCompress(nMin, pPage->term.p, pTerm);
213507   int nMin                        /* Minimum number of segments to merge */
213541     if( nBest<nMin && pStruct->aLevel[iBestLvl].nMerge==0 ){
213901     int nMin = p->pConfig->nUsermerge;
213907       nMin = 2;
213911       if( fts5IndexMerge(p, &pStruct, nMerge, nMin) ){