| /external/libpng/contrib/gregbook/ |
| rpng-x.c | 104 * "ush acopy = (alpha);") */
107 ush temp = ((ush)(fg)*(ush)(alpha) + \
108 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
156 ush reds[256], greens[256], blues[256];
780 ush red, green, blue
[all...] |
| rpng2-x.c | 149 * "ush acopy = (alpha);") */
152 ush temp = ((ush)(fg)*(ush)(alpha) + \
153 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
246 ush type;
[all...] |
| rpng-win.c | 98 * "ush acopy = (alpha);") */
101 ush temp = ((ush)(fg)*(ush)(alpha) + \
102 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
|
| readpng.h | 73 typedef unsigned short ush; typedef
|
| readpng2.h | 79 typedef unsigned short ush; typedef
|
| writepng.h | 87 typedef unsigned short ush; typedef
|
| rpng2-win.c | 126 * "ush acopy = (alpha);") */
129 ush temp = ((ush)(fg)*(ush)(alpha) + \
130 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
210 ush type;
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| zutil.c | 226 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 */
|
| deflate.h | 64 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); \
|
| zutil.h | 49 typedef unsigned short ush; typedef
50 typedef ush FAR ushf;
|
| trees.c | 182 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)node
[all...] |
| deflate.c | 124 ush good_length; /* reduce lazy search above this match length */
125 ush max_lazy; /* do not perform lazy search above this match length */
126 ush nice_length; /* quit search above this match length */
127 ush max_chain;
293 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
295 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
304 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
305 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
411 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
[all...] |
| /external/zlib/ |
| zutil.c | 226 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 */
|
| deflate.h | 64 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); \
|
| zutil.h | 49 typedef unsigned short ush; typedef
50 typedef ush FAR ushf;
|
| trees.c | 182 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)node
[all...] |
| deflate.c | 124 ush good_length; /* reduce lazy search above this match length */
125 ush max_lazy; /* do not perform lazy search above this match length */
126 ush nice_length; /* quit search above this match length */
127 ush max_chain;
293 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
295 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
304 s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
305 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
411 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
[all...] |
| /external/grub/stage2/ |
| gunzip.c | 255 typedef unsigned short ush; typedef
349 ush n; /* literal, length base, or distance base */
377 static ush cplens[] =
382 static ush cplext[] =
386 static ush cpdist[] =
391 static ush cpdext[] =
476 static ush mask_bits[] =
511 static int huft_build (unsigned *, unsigned, unsigned, ush *, ush *,
526 ush * d, /* list of base values for non-simple codes *
[all...] |
| /external/zlib/contrib/asm686/ |
| match.S | 162 /* register ush scan_start = *(ushf*)scan; */
163 /* register ush scan_end = *(ushf*)(scan+best_len-1); */
|
| /external/zlib/contrib/asm586/ |
| match.S | 166 /* register ush scan_start = *(ushf*)scan; */
167 /* register ush scan_end = *(ushf*)(scan+best_len-1); */
|
| /external/zlib/contrib/masm686/ |
| match.asm | 223 ;/* register ush scan_start = *(ushf*)scan; */
224 ;/* register ush scan_end = *(ushf*)(scan+best_len-1); */
|
| /external/zlib/contrib/masmx64/ |
| gvmat64.asm | 265 ;;; register ush scan_start = *(ushf*)scan;
266 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
|
| /external/zlib/contrib/masmx86/ |
| gvmat32.asm | 773 ;;; register ush scan_start = *(ushf*)scan;
774 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
|
