| /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 | 153 ush temp = ((ush)(fg)*(ush)(alpha) + \
154 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
247 ush type;
1313 ush red, green, blue; in rpng2_x_load_bg_image()
1319 red = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1320 green = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1321 blue = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1475 ush red, green, blue; in rpng2_x_display_row()
1483 red = ((ush)(*src) << 8); in rpng2_x_display_row()
1485 green = ((ush)(*src) << 8); in rpng2_x_display_row()
[all …]
|
| D | rpng-win.c | 127 ush temp = ((ush)(fg)*(ush)(alpha) + \
128 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
|
| D | rpng2-win.c | 156 ush temp = ((ush)(fg)*(ush)(alpha) + \
157 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
237 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/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| D | deflate.h | 67 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); \
|
| D | fx_zlib_trees.c | 178 put_byte(s, (uch)((ush)(w) >> 8)); \
202 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
204 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid); in send_bits()
207 s->bi_buf |= (ush)value << s->bi_valid; in send_bits()
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]; in tr_static_init()
502 ush f; /* frequency */ in gen_bitlen()
516 tree[n].Len = (ush)bits; in gen_bitlen()
[all …]
|
| D | fx_zlib_zutil.c | 232 if (*(ush*)&buf != 0) return buf;
240 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
241 *(ush*)&buf = 0;
249 if (*(ush*)&ptr != 0) { /* object < 64K */
|
| D | fx_zlib_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;
300 overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); in deflateInit2_()
302 s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L); in deflateInit2_()
311 s->d_buf = overlay + s->lit_bufsize/sizeof(ush); in deflateInit2_()
312 s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; in deflateInit2_()
479 s->bi_buf |= (ush)((value & ((1 << put) - 1)) << s->bi_valid);
1042 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2); in deflateCopy()
[all …]
|
| D | zutil.h | 45 typedef unsigned short ush; typedef
46 typedef ush FAR ushf;
|
| /external/zlib/src/ |
| D | deflate.h | 67 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); \
|
| D | trees.c | 178 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]; in tr_static_init()
502 ush f; /* frequency */
516 tree[n].Len = (ush)bits;
[all …]
|
| D | zutil.c | 230 if (*(ush*)&buf != 0) return buf; in zcalloc()
238 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
239 *(ush*)&buf = 0; in zcalloc()
247 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;
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);
1043 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
[all …]
|
| D | zutil.h | 43 typedef unsigned short ush; typedef
44 typedef ush FAR ushf;
|
| D | ChangeLog | 513 - Add ush casts in trees.c to avoid pedantic runtime errors
|
| /external/freetype/src/gzip/ |
| D | zutil.c | 93 if (*(ush*)&buf != 0) return buf; in zcalloc()
101 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
102 *(ush*)&buf = 0; in zcalloc()
110 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
|
| D | zutil.h | 36 typedef unsigned short ush; typedef
37 typedef ush FAR ushf;
|
| /external/zlib/ |
| D | zutil.h | 43 typedef unsigned short ush; typedef
44 typedef ush FAR ushf;
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/data/rbbi/ |
| D | words.txt | 1393 je'ush
|
| /external/mksh/src/ |
| D | check.t | 11380 ush
|