| /external/libpng/contrib/gregbook/ |
| D | rpng-x.c | 109 ush temp = ((ush)(fg)*(ush)(alpha) + \
110 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
786 ush red, green, blue; in rpng_x_display_image()
793 red = ((ush)(*src) << 8); in rpng_x_display_image()
795 green = ((ush)(*src) << 8); in rpng_x_display_image()
797 blue = ((ush)(*src) << 8); in rpng_x_display_image()
813 red = ((ush)r << 8); in rpng_x_display_image()
814 green = ((ush)g << 8); in rpng_x_display_image()
815 blue = ((ush)b << 8); in rpng_x_display_image()
817 red = ((ush)bg_red << 8); in rpng_x_display_image()
[all …]
|
| D | rpng2-x.c | 168 ush temp = ((ush)(fg)*(ush)(alpha) + \
169 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
262 ush type;
1337 ush red, green, blue; in rpng2_x_load_bg_image()
1343 red = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1344 green = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1345 blue = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1499 ush red, green, blue; in rpng2_x_display_row()
1507 red = ((ush)(*src) << 8); in rpng2_x_display_row()
1509 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 | 158 ush temp = ((ush)(fg)*(ush)(alpha) + \
159 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
239 ush type;
|
| /external/syslinux/com32/lib/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;
|
| /external/python/cpython2/Modules/zlib/ |
| 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;
|
| /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 …]
|
| /external/pdfium/third_party/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 | 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 | 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 | 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 …]
|
| /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/syslinux/memdisk/ |
| D | inflate.c | 124 ush n; /* literal, length base, or distance base */
131 const ush *, const ush *, struct huft **, int *));
157 static const ush cplens[] = { /* Copy lengths for literal codes 257..285 */
163 static const ush cplext[] = { /* Extra bits for literal codes 257..285 */
168 static const ush cpdist[] = { /* Copy offsets for distance codes 0..29 */
174 static const ush cpdext[] = { /* Extra bits for distance codes */
213 STATIC const ush mask_bits[] = {
268 const ush *d; /* list of base values for non-simple codes */
269 const ush *e; /* list of extra bits for non-simple codes */
440 r.v.n = (ush) (*p); /* simple code is just the value */
|