| /src/sys/net/ |
| ppp-deflate.c | 78 static void *z_comp_alloc(u_char *options, int opt_len);
79 static void *z_decomp_alloc(u_char *options, int opt_len);
82 static int z_comp_init(void *state, u_char *options, int opt_len,
84 static int z_decomp_init(void *state, u_char *options, int opt_len,
152 z_comp_alloc(u_char *options, int opt_len)
157 if (opt_len != CILEN_DEFLATE
195 z_comp_init(void *arg, u_char *options, int opt_len, int unit, int hdrlen,
200 if (opt_len < CILEN_DEFLATE
370 z_decomp_alloc(u_char *options, int opt_len)
375 if (opt_len != CILEN_DEFLAT
[all...] |
| bsd-comp.c | 133 static void *bsd_comp_alloc(u_char *options, int opt_len);
134 static void *bsd_decomp_alloc(u_char *options, int opt_len);
136 static int bsd_comp_init(void *state, u_char *options, int opt_len,
138 static int bsd_decomp_init(void *state, u_char *options, int opt_len,
303 bsd_alloc(u_char *options, int opt_len, int decomp)
309 if (opt_len < CILEN_BSD_COMPRESS || options[0] != CI_BSD_COMPRESS
379 bsd_comp_alloc(u_char *options, int opt_len)
381 return bsd_alloc(options, opt_len, 0);
385 bsd_decomp_alloc(u_char *options, int opt_len)
387 return bsd_alloc(options, opt_len, 1)
[all...] |
| zlib.c | 517 ulg opt_len; /* bit length of current block with optimal trees */ member in struct:deflate_state
2518 s->opt_len = s->static_len = 0L;
2582 * The length opt_len is updated; static_len is also updated if stree is
2621 s->opt_len += (ulg)f * (bits + xbits);
2654 s->opt_len += ((long)bits - (long)tree[m].Len)
2709 * and corresponding code. The length opt_len is updated; static_len is
2746 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
2902 /* opt_len now includes the length of the tree representations, except
2913 /* Update opt_len to include the bit length tree and counts */
2914 s->opt_len += 3*(max_blindex+1) + 5+5+4
[all...] |
| /src/lib/librefuse/ |
| refuse_opt.c | 397 size_t i, opt_len = 0; local in function:parse_opts
406 opt[opt_len] = '\0';
413 opt_len = 0;
417 opt[opt_len++] = arg[i+1];
421 opt[opt_len++] = arg[i];
426 opt[opt_len] = '\0';
|
| /src/common/dist/zlib/ |
| trees.c | 450 s->opt_len = s->static_len = 0L;
537 * The length opt_len is updated; static_len is also updated if stree is
574 s->opt_len += (ulg)f * (unsigned)(bits + xbits);
607 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;
624 * and corresponding code. The length opt_len is updated; static_len is
659 s->opt_len--; if (stree) s->static_len -= stree[node].Len;
809 /* opt_len now includes the length of the tree representations, except the
820 /* Update opt_len to include the bit length tree and counts */
821 s->opt_len += 3*((ulg)max_blindex + 1) + 5 + 5 + 4;
823 s->opt_len, s->static_len))
[all...] |
| deflate.h | 258 ulg opt_len; /* bit length of current block with optimal trees */ member in struct:internal_state
|
