Lines Matching refs:nMin

35683   int nMin = MIN(nBuf, (SQLITE_WIN32_DBG_BUF_SIZE - 1)); /* may be negative. */
35684   if( nMin<-1 ) nMin = -1; /* all negative values become -1. */
35685   assert( nMin==-1 || nMin==0 || nMin<SQLITE_WIN32_DBG_BUF_SIZE );
35687   if( nMin>0 ){
35689     memcpy(zDbgBuf, zBuf, nMin);
35698           nMin, (LPWSTR)zDbgBuf, SQLITE_WIN32_DBG_BUF_SIZE/sizeof(WCHAR))<=0 ){
35703   if( nMin>0 ){
35705     memcpy(zDbgBuf, zBuf, nMin);
41294   unsigned int nMin;                  /* Minimum number of pages reserved */
41892       pCache->nMin = 10;
41893       pGroup->nMinPage += pCache->nMin;
42148   assert( pCache->bPurgeable || pCache->nMin==0 );
42149   assert( pCache->bPurgeable==0 || pCache->nMin==10 );
42150   assert( pCache->nMin==0 || pCache->bPurgeable );
42262   assert( pCache->bPurgeable || (pCache->nMax==0 && pCache->nMin==0) );
42267   assert( pGroup->nMinPage >= pCache->nMin );
42268   pGroup->nMinPage -= pCache->nMin;
62291   const int nMin = pCur->pBt->usableSize * 2 / 3;
62320     }else if( pPage->nOverflow==0 && pPage->nFree<=nMin ){
81912     int nMin = pSorter->iMemory + nReq;
81914     if( nMin>pSorter->nMemory ){
81917       while( nNew < nMin ) nNew = nNew*2;
81919       if( nNew < nMin ) nNew = nMin;
149605 static void blobGrowBuffer(Blob *pBlob, int nMin, int *pRc){
149606   if( *pRc==SQLITE_OK && nMin>pBlob->nAlloc ){
149607     int nAlloc = nMin;
150724 SQLITE_PRIVATE int sqlite3Fts3Incrmerge(Fts3Table *p, int nMerge, int nMin){
150756     sqlite3_bind_int(pFindLevel, 1, nMin);
150759       nSeg = nMin;
150897   int nMin = (FTS3_MERGE_COUNT / 2);
150908     nMin = fts3Getint(&z);
150911   if( z[0]!='\0' || nMin<2 ){
150920       rc = sqlite3Fts3Incrmerge(p, nMerge, nMin);
174754       int nMin = MIN(p1->term.n, p2->term.n);
174755       int res = memcmp(p1->term.p, p2->term.p, nMin);