365 static void statAccumDestructor(void *pOld){  in statAccumDestructor()  argument
366   StatAccum *p = (StatAccum*)pOld;  in statAccumDestructor()
513   StatSample *pOld  in sampleIsBetterPost()  argument
517   assert( pNew->iCol==pOld->iCol );  in sampleIsBetterPost()
519     if( pNew->anEq[i]>pOld->anEq[i] ) return 1;  in sampleIsBetterPost()
520     if( pNew->anEq[i]<pOld->anEq[i] ) return 0;  in sampleIsBetterPost()
522   if( pNew->iHash>pOld->iHash ) return 1;  in sampleIsBetterPost()
537   StatSample *pOld  in sampleIsBetter()  argument
540   tRowcnt nEqOld = pOld->anEq[pOld->iCol];  in sampleIsBetter()
542   assert( pOld->isPSample==0 && pNew->isPSample==0 );  in sampleIsBetter()
543   assert( IsStat4 || (pNew->iCol==0 && pOld->iCol==0) );  in sampleIsBetter()
547     if( pNew->iCol<pOld->iCol ) return 1;  in sampleIsBetter()
548     return (pNew->iCol==pOld->iCol && sampleIsBetterPost(pAccum, pNew, pOld));  in sampleIsBetter()
580       StatSample *pOld = &p->a[i];  in sampleInsert()  local
581       if( pOld->anEq[pNew->iCol]==0 ){  in sampleInsert()
582         if( pOld->isPSample ) return;  in sampleInsert()
583         assert( pOld->iCol>pNew->iCol );  in sampleInsert()
584         assert( sampleIsBetter(p, pNew, pOld) );  in sampleInsert()
585         if( pUpgrade==0 || sampleIsBetter(p, pOld, pUpgrade) ){  in sampleInsert()
586           pUpgrade = pOld;  in sampleInsert()