WIN_CHARS
un += (cnt - 1) * WIN_CHARS;
unlen -= (cnt - 1) * WIN_CHARS;
i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS;
if ((wep->weCnt&WIN_LAST) && unlen > WIN_CHARS)
if ((wep->weCnt&WIN_CNT) > howmany(WIN_MAXLEN, WIN_CHARS)
dp->d_namlen = (wep->weCnt&WIN_CNT) * WIN_CHARS;
i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS;
if (WIN_MAXLEN % WIN_CHARS < sizeof(wep->wePart1) / 2
if (WIN_MAXLEN % WIN_CHARS >= sizeof(wep->wePart1) / 2
&& WIN_MAXLEN % WIN_CHARS < (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2
if (WIN_MAXLEN % WIN_CHARS >= (sizeof(wep->wePart1) + sizeof(wep->wePart2)) / 2
return howmany(unlen, WIN_CHARS);
un += (cnt - 1) * WIN_CHARS;
unlen -= (cnt - 1) * WIN_CHARS;
i = ((wep->weCnt&WIN_CNT) - 1) * WIN_CHARS;
if ((wep->weCnt&WIN_LAST) && unlen > WIN_CHARS)
return howmany(unlen, WIN_CHARS);