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

12

/macosx-10.10/zip-14/unzip/
H A Dpatch-unix_unix.c4 ush z_uidgid[2];
/macosx-10.10/rsync-45/rsync/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;
317 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.c182 put_byte(s, (uch)((ush)(w) >> 8)); \
208 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
223 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
247 ush bl_count[MAX_BITS+1];
504 ush f; /* frequency */
518 tree[n].Len = (ush)bits;
562 tree[m].Len = (ush)bits;
582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
583 ush code = 0; /* running code value */
679 tree[n].Dad = tree[m].Dad = (ush)nod
[all...]
H A Dzutil.h52 typedef unsigned short ush; typedef
53 typedef ush FAR ushf;
H A Ddeflate.c126 ush good_length; /* reduce lazy search above this match length */
127 ush max_lazy; /* do not perform lazy search above this match length */
128 ush nice_length; /* quit search above this match length */
129 ush max_chain;
295 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
297 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
306 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
307 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
413 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
925 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]
/macosx-10.10/sudo-73/src/zlib/
H A Ddeflate.h67 ush freq; /* frequency count */
68 ush code; /* bit string */
71 ush dad; /* father node in Huffman tree */
72 ush len; /* length of bit string */
89 typedef ush Pos;
203 ush bl_count[MAX_BITS+1];
257 ush bi_buf;
332 ush dist = (distance); \
H A Dzutil.c207 if (*(ush*)&buf != 0) return buf;
215 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
216 *(ush*)&buf = 0;
224 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c178 put_byte(s, (uch)((ush)(w) >> 8)); \
202 s->bi_buf |= (ush)value << s->bi_valid;
204 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
207 s->bi_buf |= (ush)value << s->bi_valid;
217 s->bi_buf |= (ush)val << s->bi_valid;\
219 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
222 s->bi_buf |= (ush)(value) << s->bi_valid;\
243 ush bl_count[MAX_BITS+1];
502 ush f; /* frequency */
516 tree[n].Len = (ush)bit
[all...]
H A Dzutil.h43 typedef unsigned short ush; typedef
44 typedef ush FAR ushf;
H A Ddeflate.c118 ush good_length; /* reduce lazy search above this match length */
119 ush max_lazy; /* do not perform lazy search above this match length */
120 ush nice_length; /* quit search above this match length */
121 ush max_chain;
301 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
303 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
312 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
313 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
480 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1041 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]
/macosx-10.10/xnu-2782.1.97/libkern/zlib/
H A Ddeflate.h91 ush freq; /* frequency count */
92 ush code; /* bit string */
95 ush dad; /* father node in Huffman tree */
96 ush len; /* length of bit string */
113 typedef ush Pos;
227 ush bl_count[MAX_BITS+1];
281 ush bi_buf;
344 ush dist = (distance); \
H A Dzutil.c254 if (*(ush*)&buf != 0) return buf;
262 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
263 *(ush*)&buf = 0;
271 if (*(ush*)&ptr != 0) { /* object < 64K */
H A Dtrees.c209 put_byte(s, (uch)((ush)(w) >> 8)); \
235 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
250 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
274 ush bl_count[MAX_BITS+1];
531 ush f; /* frequency */
545 tree[n].Len = (ush)bits;
589 tree[m].Len = (ush)bits;
609 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
610 ush code = 0; /* running code value */
706 tree[n].Dad = tree[m].Dad = (ush)nod
[all...]
H A Dzutil.h88 typedef unsigned short ush; typedef
89 typedef ush FAR ushf;
H A Ddeflate.c151 ush good_length; /* reduce lazy search above this match length */
152 ush max_lazy; /* do not perform lazy search above this match length */
153 ush nice_length; /* quit search above this match length */
154 ush max_chain;
322 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
324 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
333 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
334 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
440 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
952 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]
/macosx-10.10/zlib-55/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...]
H A Dzutil.h39 typedef unsigned short ush; typedef
40 typedef ush FAR ushf;
H A Ddeflate.c118 ush good_length; /* reduce lazy search above this match length */
119 ush max_lazy; /* do not perform lazy search above this match length */
120 ush nice_length; /* quit search above this match length */
121 ush max_chain;
289 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
291 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
300 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
301 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
407 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
959 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)
[all...]
/macosx-10.10/ppp-786.1.1/Helpers/pppdump/
H A Dzlib.c70 typedef unsigned short ush; typedef
71 typedef ush FAR ushf;
208 ush freq; /* frequency count */
209 ush code; /* bit string */
212 ush dad; /* father node in Huffman tree */
213 ush len; /* length of bit string */
230 typedef ush Pos;
343 ush bl_count[MAX_BITS+1];
397 ush bi_buf;
520 ush good_lengt
[all...]
/macosx-10.10/ksh-23/ksh/src/cmd/INIT/
H A Dratz.c598 typedef unsigned short ush; typedef
599 typedef ush FAR ushf;
896 if (*(ush*)&buf != 0) return buf;
904 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
905 *(ush*)&buf = 0;
913 if (*(ush*)&ptr != 0) { /* object < 64K */
1274 ush freq; /* frequency count */
1275 ush code; /* bit string */
1278 ush da
[all...]
/macosx-10.10/vim-55/src/
H A Dmisc2.c3711 typedef unsigned short ush; /* unsigned 16-bit value */ typedef
3747 ush temp; \
3749 temp = (ush)keys[2] | 2; \
3889 ush temp;
3891 temp = (ush)keys[2] | 2;
/macosx-10.10/zlib-55/zlib/contrib/masmx64/
H A Dgvmat64.asm304 ;;; register ush scan_start = *(ushf*)scan;
305 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);

Completed in 405 milliseconds

12