Home
last modified time | relevance | path

Searched refs:ulg (Results 1 – 8 of 8) sorted by relevance

/titanic_44/usr/src/uts/common/zmod/
H A Ddeflate.h98 ulg pending_buf_size; /* size of pending_buf */
123 ulg window_size;
244 ulg opt_len; /* bit length of current block with optimal trees */
245 ulg static_len; /* bit length of current block with static trees */
250 ulg compressed_len; /* total bit length of compressed file mod 2^32 */
251 ulg bits_sent; /* bit length of compressed data sent mod 2^32 */
284 void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
287 void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
H A Dtrees.c199 s->bits_sent += (ulg)length;
527 s->opt_len += (ulg)f * (bits + xbits);
528 if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
870 ulg stored_len; /* length of input block */
875 s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
924 ulg stored_len; /* length of input block */
927 ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
1048 ulg out_length = (ulg)s->last_lit*8L;
1049 ulg in_length = (ulg)((long)s->strstart - s->block_start);
1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
[all …]
H A Dzutil.c225 ulg bsize = (ulg)items*size; in zcalloc()
H A Ddeflate.c301 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
995 s->window_size = (ulg)2L*s->w_size;
1078 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1195 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1281 more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
1374 (ulg)((long)s->strstart - s->block_start), \
1403 ulg max_block_size = 0xffff;
1404 ulg max_start;
1430 if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
H A Dzutil.h56 typedef unsigned long ulg; typedef
/titanic_44/usr/src/grub/grub-0.97/stage2/
H A Dgunzip.c261 typedef unsigned long ulg; typedef
332 crc = (ulg)0xffffffffUL; in gunzip_test_header()
475 static ulg bb; /* bit buffer */
485 #define NEEDBITS(n) do {while(k<(n)){b|=((ulg)get_byte())<<k;k+=8;}} while (0)
742 register ulg b; /* bit buffer */ in inflate_codes_in_window()
869 register ulg b; /* bit buffer */ in init_stored_block()
950 register ulg b; /* bit buffer */ in init_dynamic_block()
1087 register ulg b; /* bit buffer */ in get_new_block()
1203 ulg crc_value = 0xffffffffUL; in gunzip_read()
1288 static ulg crc_32_tab[] = {
[all …]
/titanic_44/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c103 typedef unsigned long ulg; typedef
367 ulg pending_buf_size; /* size of pending_buf */
394 ulg window_size;
541 ulg opt_len; /* bit length of current block with optimal trees */
542 ulg static_len; /* bit length of current block with static trees */
546 ulg compressed_len; /* total bit length of compressed file PPP */
548 ulg bits_sent; /* bit length of the compressed data */
586 void _tr_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
589 void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
926 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof (ush)+2L);
[all …]
/titanic_44/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c50 typedef unsigned long ulg; typedef
244 ulg window_size;
365 ulg opt_len; /* bit length of current block with optimal trees */
366 ulg static_len; /* bit length of current block with static trees */
367 ulg compressed_len; /* total bit length of compressed file */
372 ulg bits_sent; /* bit length of the compressed data */
410 local ulg ct_flush_block OF((deflate_state *s, charf *buf, ulg stored_len,
413 local void ct_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
905 s->window_size = (ulg)2L*s->w_size;
978 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
[all …]