/* Count the number of each code length for a Huffman tree. */
STATIC VOID CountLen(IN INT32 i)
/* Count the number of each code length for a Huffman tree. */
STATIC VOID CountLen(IN INT32 i)
{
  STATIC INT32 Depth = 0;
  if (i < mN) {
    mLenCnt[(Depth < 16) ? Depth : 16]++;
  } else {
    Depth++;
    CountLen(mLeft [i]);
    CountLen(mRight[i]);
    Depth--;
  }
}