292   int mxSample;             /* Maximum number of samples to accumulate */  member
368   if( p->mxSample ){  in statAccumDestructor()
371     for(i=0; i<p->mxSample; i++) sampleClear(p->db, p->a+i);  in statAccumDestructor()
413   int mxSample = OptimizationEnabled(db,SQLITE_Stat4) ?SQLITE_STAT4_SAMPLES :0;  in statInit()  local
430   if( mxSample ){  in statInit()
432       + sizeof(StatSample)*(nCol+mxSample)       /* StatAccum.aBest[], a[] */  in statInit()
433       + sizeof(tRowcnt)*3*nColUp*(nCol+mxSample);  in statInit()
453   p->mxSample = p->nLimit==0 ? mxSample : 0;  in statInit()
454   if( mxSample ){  in statInit()
459     p->nPSample = (tRowcnt)(p->nEst/(mxSample/3+1) + 1);  in statInit()
465     p->aBest = &p->a[mxSample];  in statInit()
466     pSpace = (u8*)(&p->a[mxSample+nCol]);  in statInit()
467     for(i=0; i<(mxSample+nCol); i++){  in statInit()
598   if( p->nSample>=p->mxSample ){  in sampleInsert()
610     p->nSample = p->mxSample-1;  in sampleInsert()
628   if( p->nSample>=p->mxSample ){  in sampleInsert()
630     for(i=0; i<p->mxSample; i++){  in sampleInsert()
657     if( p->nSample<p->mxSample || sampleIsBetter(p, pBest, &p->a[p->iMin]) ){  in samplePushPrevious()
723     if( p->mxSample ) samplePushPrevious(p, iChng);  in statPush()
734       if( p->mxSample ) p->current.anLt[i] += p->current.anEq[i];  in statPush()
742   if( p->mxSample ){  in statPush()
827   assert( eCall==STAT_GET_STAT1 || p->mxSample );  in statGet()