408   int nColUp;                     /* nCol rounded up for alignment */  in statInit()  local
420   nColUp = sizeof(tRowcnt)<8 ? (nCol+1)&~1 : nCol;  in statInit()
427     + sizeof(tRowcnt)*nColUp                  /* StatAccum.anEq */  in statInit()
428     + sizeof(tRowcnt)*nColUp;                 /* StatAccum.anDLt */  in statInit()
431     n += sizeof(tRowcnt)*nColUp                  /* StatAccum.anLt */  in statInit()
433       + sizeof(tRowcnt)*3*nColUp*(nCol+mxSample);  in statInit()
450   p->current.anEq = &p->current.anDLt[nColUp];  in statInit()
460     p->current.anLt = &p->current.anEq[nColUp];  in statInit()
464     p->a = (struct StatSample*)&p->current.anLt[nColUp];  in statInit()
468       p->a[i].anEq = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp);  in statInit()
469       p->a[i].anLt = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp);  in statInit()
470       p->a[i].anDLt = (tRowcnt *)pSpace; pSpace += (sizeof(tRowcnt) * nColUp);  in statInit()