Searched refs:nlen (Results 1 - 5 of 5) sorted by relevance

/ast/src/lib/libz/
H A Dinflate.h108 unsigned nlen; /* number of length code lengths */ member in struct:inflate_state
H A Dinfback.c352 state->nlen = BITS(5) + 257;
359 if (state->nlen > 286 || state->ndist > 30) {
390 while (state->have < state->nlen + state->ndist) {
428 if (state->have + copy > state->nlen + state->ndist) {
445 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
454 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
H A Dinflate.c839 state->nlen = BITS(5) + 257;
846 if (state->nlen > 286 || state->ndist > 30) {
877 while (state->have < state->nlen + state->ndist) {
915 if (state->have + copy > state->nlen + state->ndist) {
932 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
941 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
/ast/src/cmd/std/
H A Dsplit.c346 register long nlen = 0; local
350 while (nlen == 0 && n > 0)
362 nlen = n + (cp - dp);
367 return nlen ? nlen : len;
/ast/src/cmd/INIT/
H A Dratz.c1669 unsigned nlen; /* number of length code lengths */ member in struct:inflate_state
3058 state->nlen = BITS(5) + 257;
3065 if (state->nlen > 286 || state->ndist > 30) {
3096 while (state->have < state->nlen + state->ndist) {
3134 if (state->have + copy > state->nlen + state->ndist) {
3151 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
3160 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,

Completed in 32 milliseconds