Searched refs:ush (Results 1 - 25 of 41) sorted by relevance

12

/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Ddeflate.h55 ush freq; /* frequency count */
56 ush code; /* bit string */
59 ush dad; /* father node in Huffman tree */
60 ush len; /* length of bit string */
77 typedef ush Pos;
190 ush bl_count[MAX_BITS+1];
244 ush bi_buf;
307 ush dist = (distance); \
H A Dzutil.c139 if (*(ush*)&buf != 0) return buf;
147 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
148 *(ush*)&buf = 0;
156 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c183 put_byte(s, (uch)((ush)(w) >> 8)); \
209 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
224 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
249 ush bl_count[MAX_BITS+1];
506 ush f; /* frequency */
520 tree[n].Len = (ush)bits;
564 tree[m].Len = (ush)bits;
584 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
585 ush code = 0; /* running code value */
680 tree[n].Dad = tree[m].Dad = (ush)nod
[all...]
H A Dzutil.h39 typedef unsigned short ush; typedef
40 typedef ush FAR ushf;
/haiku-fatelf/src/bin/gzip/
H A Dbits.c135 bi_buf = (ush)value >> (Buf_size - bi_valid);
189 put_short((ush)len);
190 put_short((ush)~len);
H A Ddeflate.c55 * void lm_init (int pack_level, ush *flags)
128 typedef ush Pos;
213 ush good_length; /* reduce lazy search above this match length */
214 ush max_lazy; /* do not perform lazy search above this match length */
215 ush nice_length; /* quit search above this match length */
216 ush max_chain;
288 ush *flags; /* general purpose bit flag */
382 register ush scan_start = *(ush*)scan;
383 register ush scan_en
[all...]
H A Dgzip.h45 typedef unsigned short ush; typedef
117 EXTERN(ush, d_buf); /* buffer for distances, see trees.c */
123 EXTERN(ush, tab_prefix); /* prefix code (see unlzw.c) */
127 EXTERN(ush, tab_prefix0); /* prefix for even codes */
128 EXTERN(ush, tab_prefix1); /* prefix for odd codes */
219 outbuf[outcnt++] = (uch) ((ush)(w) >> 8); \
222 put_byte((uch)((ush)(w) >> 8)); \
238 #define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
279 void lm_init OF((int pack_level, ush *flag
[all...]
H A Dzip.c37 ush attr = 0; /* ascii/binary flag */
38 ush deflate_flags = 0; /* pkzip -es, -en or -ex equivalent */
H A Dtrees.c41 * void ct_init (ush *attr, int *methodp)
162 ush freq; /* frequency count */
163 ush code; /* bit string */
166 ush dad; /* father node in Huffman tree */
167 ush len; /* length of bit string */
217 local ush near bl_count[MAX_BITS+1];
254 /* DECLARE(ush, d_buf, DIST_BUFSIZE); buffer for distances */
279 ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
333 ush *attr; /* pointer to internal file attribute */
496 ush
[all...]
H A Dinflate.c125 ush n; /* literal, length base, or distance base */
132 int huft_build OF((unsigned *, unsigned, unsigned, ush *, ush *,
158 static ush cplens[] = { /* Copy lengths for literal codes 257..285 */
162 static ush cplext[] = { /* Extra bits for literal codes 257..285 */
165 static ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
169 static ush cpdext[] = { /* Extra bits for distance codes */
209 ush mask_bits[] = {
275 ush *d; /* list of base values for non-simple codes */
276 ush *
[all...]
H A Dunlzh.c36 int tablebits, ush table[]));
77 /* local ush left[2 * NC - 1]; */
78 /* local ush right[2 * NC - 1]; */
93 local ush pt_table[256];
95 /* local ush c_table[4096]; */
105 local ush bitbuf;
145 ush table[];
147 ush count[17], weight[17], start[18], *p;
/haiku-fatelf/src/bin/unzip/
H A Dcrypt.c223 ush flag; /* previous flags */
276 ush flag; /* previous flags */
305 if ((ush)(c0 | (c1<<8)) !=
306 (z->flg & 8 ? (ush) z->tim & 0xffff : (ush)(z->crc >> 16))) {
309 if ((ush)c1 != (z->flg & 8 ? (ush) z->tim >> 8 : (ush)(z->crc >> 24))) {
387 ush b;
519 ush
[all...]
H A Dcryptf.c226 ush flag; /* previous flags */
279 ush flag; /* previous flags */
308 if ((ush)(c0 | (c1<<8)) !=
309 (z->flg & 8 ? (ush) z->tim & 0xffff : (ush)(z->crc >> 16))) {
312 if ((ush)c1 != (z->flg & 8 ? (ush) z->tim >> 8 : (ush)(z->crc >> 24))) {
390 ush b;
522 ush
[all...]
H A Dconsts.h20 ZCONST ush near mask_bits[] = {
H A Dunzip.h339 typedef unsigned short ush; /* defs replace byte/UWORD/ULONG (which are */ typedef
506 ush general_purpose_bit_flag;
507 ush compression_method;
512 ush filename_length;
513 ush extra_field_length;
514 ush file_comment_length;
515 ush disk_number_start;
516 ush internal_file_attributes;
H A Dfunzip.c43 1.9 17 Oct 92 G. Roelofs changed ULONG/UWORD/byte to ulg/ush/uch;
163 ush SH(uch* p) { return ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8)); }
167 #define SH(p) ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8))
184 ZCONST ush near mask_bits[] = {
301 ush n;
446 ush i, e;
461 if (e != (ush)(
[all...]
H A Dunzpriv.h1512 ush uidgid[2];
1521 ush diskstart; /* no of volume where this entry starts */
1620 ush general_purpose_bit_flag;
1621 ush compression_method;
1626 ush filename_length;
1627 ush extra_field_length;
1634 ush general_purpose_bit_flag;
1635 ush compression_method;
1640 ush filename_length;
1641 ush extra_field_lengt
[all...]
/haiku-fatelf/src/bin/zip/
H A Dcrypt.c224 ush flag; /* previous flags */
284 ush flag; /* previous flags */
315 if ((ush)(c0 | (c1<<8)) !=
316 (z->flg & 8 ? (ush) z->tim & 0xffff : (ush)(z->crc >> 16))) {
318 if ((ush)c1 != (z->flg & 8 ? (ush) z->tim >> 8 : (ush)(z->crc >> 24))) {
402 ush b;
534 ush
[all...]
H A Ddeflate.c59 * void lm_init (int pack_level, ush *flags)
129 typedef ush Pos;
226 ush good_length; /* reduce lazy search above this match length */
227 ush max_lazy; /* do not perform lazy search above this match length */
228 ush nice_length; /* quit search above this match length */
229 ush max_chain;
302 ush *flags; /* general purpose bit flag */
438 register ush scan_start = *(ush far *)scan;
439 register ush scan_en
[all...]
H A Dtrees.c74 * void ct_init (ush *attr, int *method)
215 ush freq; /* frequency count */
216 ush code; /* bit string */
219 ush dad; /* father node in Huffman tree */
220 ush len; /* length of bit string */
270 local ush near bl_count[MAX_BITS+1];
306 local ush far d_buf[DIST_BUFSIZE]; /* buffer for distances */
309 local ush far *d_buf;
338 local ush *file_type; /* pointer to UNKNOWN, BINARY or ASCII */
398 out_buf[out_offset++] = (char) ((ush)(
[all...]
H A Dzipup.c321 z->att = (ush)UNKNOWN; /* will be changed later */
485 z->vem = (ush)(z->dosflag ? (dosify ? 20 : /* Made under MSDOS by PKZIP 2.0 */
492 z->vem = (ush)(dosify ? 20 : OS_CODE + Z_MAJORVER * 10 + Z_MINORVER);
495 z->ver = (ush)(m == STORE ? 10 : 20); /* Need PKUNZIP 2.0 except for store */
509 z->how = (ush)m; /* may be changed later */
513 if (z->att == (ush)UNKNOWN) {
559 if (set_type) z->att = (ush)UNKNOWN; /* is finally set in filecompress() */
562 if (z->att == (ush)BINARY && translate_eol) {
656 if (z->how != (ush) m)
672 z->how = (ush)
[all...]
H A Dzipfile.c32 ush SH(uch* p) { return ((ush)(uch)((p)[0]) | ((ush)(uch)((p)[1]) << 8)); }
36 #define SH(a) ((ush)(((ush)(uch)(a)[0]) | (((ush)(uch)(a)[1]) << 8)))
272 (ush)(z->vem & 0xff) / (ush)10, (ush)(z->vem & 0xff) % (ush)1
[all...]
/haiku-fatelf/src/libs/zlib/
H A Ddeflate.h64 ush freq; /* frequency count */
65 ush code; /* bit string */
68 ush dad; /* father node in Huffman tree */
69 ush len; /* length of bit string */
86 typedef ush Pos;
200 ush bl_count[MAX_BITS+1];
254 ush bi_buf;
328 ush dist = (distance); \
H A Dzutil.c226 if (*(ush*)&buf != 0) return buf;
234 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
235 *(ush*)&buf = 0;
243 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c183 put_byte(s, (uch)((ush)(w) >> 8)); \
207 s->bi_buf |= (ush)value << s->bi_valid;
209 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
212 s->bi_buf |= (ush)value << s->bi_valid;
222 s->bi_buf |= (ush)val << s->bi_valid;\
224 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
227 s->bi_buf |= (ush)(value) << s->bi_valid;\
248 ush bl_count[MAX_BITS+1];
508 ush f; /* frequency */
522 tree[n].Len = (ush)bit
[all...]

Completed in 154 milliseconds

12