| /external/libpng/contrib/gregbook/ |
| D | rpng-x.c | 107 ush temp = ((ush)(fg)*(ush)(alpha) + \
108 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
780 ush red, green, blue; in rpng_x_display_image()
787 red = ((ush)(*src) << 8); in rpng_x_display_image()
789 green = ((ush)(*src) << 8); in rpng_x_display_image()
791 blue = ((ush)(*src) << 8); in rpng_x_display_image()
807 red = ((ush)r << 8); in rpng_x_display_image()
808 green = ((ush)g << 8); in rpng_x_display_image()
809 blue = ((ush)b << 8); in rpng_x_display_image()
811 red = ((ush)bg_red << 8); in rpng_x_display_image()
[all …]
|
| D | rpng2-x.c | 152 ush temp = ((ush)(fg)*(ush)(alpha) + \
153 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
246 ush type;
1333 ush red, green, blue; in rpng2_x_load_bg_image()
1339 red = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1340 green = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1341 blue = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1495 ush red, green, blue; in rpng2_x_display_row()
1503 red = ((ush)(*src) << 8); in rpng2_x_display_row()
1505 green = ((ush)(*src) << 8); in rpng2_x_display_row()
[all …]
|
| D | rpng-win.c | 101 ush temp = ((ush)(fg)*(ush)(alpha) + \
102 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
|
| D | rpng2-win.c | 129 ush temp = ((ush)(fg)*(ush)(alpha) + \
130 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
210 ush type;
|
| D | readpng.h | 73 typedef unsigned short ush; typedef
|
| D | readpng2.h | 79 typedef unsigned short ush; typedef
|
| D | writepng.h | 87 typedef unsigned short ush; typedef
|
| /external/qemu/distrib/zlib-1.2.3/ |
| D | 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); \
|
| D | zutil.c | 226 if (*(ush*)&buf != 0) return buf; in zcalloc()
234 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
235 *(ush*)&buf = 0; in zcalloc()
243 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
|
| D | 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]; in tr_static_init()
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 …]
|
| D | 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));
923 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
[all …]
|
| D | zutil.h | 49 typedef unsigned short ush; typedef
50 typedef ush FAR ushf;
|
| /external/zlib/ |
| D | 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;
328 ush dist = (distance); \
|
| D | trees.c | 183 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]; in tr_static_init()
508 ush f; /* frequency */
522 tree[n].Len = (ush)bits;
[all …]
|
| D | zutil.c | 226 if (*(ush*)&buf != 0) return buf; in zcalloc()
234 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
235 *(ush*)&buf = 0; in zcalloc()
243 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
|
| D | deflate.c | 118 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)+2);
[all …]
|
| D | zutil.h | 39 typedef unsigned short ush; typedef
40 typedef ush FAR ushf;
|
| D | ChangeLog | 249 - Add ush casts in trees.c to avoid pedantic runtime errors
|
| /external/grub/stage2/ |
| D | 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 */ in huft_build()
527 ush * e, /* list of extra bits for non-simple codes */ in huft_build()
[all …]
|
| /external/zlib/contrib/masmx86/ |
| D | gvmat32.asm | 773 ;;; register ush scan_start = *(ushf*)scan;
774 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
|
| /external/mksh/src/ |
| D | check.t | 7055 ush
|