Home
last modified time | relevance | path

Searched refs:ush (Results 1 – 25 of 55) sorted by relevance

123

/external/rust/crates/libz-sys/src/zlib/
Ddeflate.h70 ush freq; /* frequency count */
71 ush code; /* bit string */
74 ush dad; /* father node in Huffman tree */
75 ush len; /* length of bit string */
92 typedef ush Pos;
206 ush bl_count[MAX_BITS+1];
260 ush bi_buf;
335 ush dist = (ush)(distance); \
Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
200 s->bi_buf |= (ush)value << s->bi_valid;
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |= (ush)(value) << s->bi_valid;\
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
[all …]
Dzutil.c229 if (*(ush*)&buf != 0) return buf; in zcalloc()
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
238 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
Dzutil.h45 typedef unsigned short ush; typedef
46 typedef ush FAR ushf;
/external/python/cpython2/Modules/zlib/
Ddeflate.h70 ush freq; /* frequency count */
71 ush code; /* bit string */
74 ush dad; /* father node in Huffman tree */
75 ush len; /* length of bit string */
92 typedef ush Pos;
206 ush bl_count[MAX_BITS+1];
260 ush bi_buf;
335 ush dist = (ush)(distance); \
Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
200 s->bi_buf |= (ush)value << s->bi_valid;
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |= (ush)(value) << s->bi_valid;\
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
[all …]
Dzutil.c229 if (*(ush*)&buf != 0) return buf; in zcalloc()
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
238 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
Dzutil.h45 typedef unsigned short ush; typedef
46 typedef ush FAR ushf;
/external/libpng/contrib/gregbook/
Drpng-x.c110 ush temp = ((ush)(fg)*(ush)(alpha) + \
111 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
787 ush red, green, blue; in rpng_x_display_image()
794 red = ((ush)(*src) << 8); in rpng_x_display_image()
796 green = ((ush)(*src) << 8); in rpng_x_display_image()
798 blue = ((ush)(*src) << 8); in rpng_x_display_image()
814 red = ((ush)r << 8); in rpng_x_display_image()
815 green = ((ush)g << 8); in rpng_x_display_image()
816 blue = ((ush)b << 8); in rpng_x_display_image()
818 red = ((ush)bg_red << 8); in rpng_x_display_image()
[all …]
Drpng2-x.c170 ush temp = ((ush)(fg)*(ush)(alpha) + \
171 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
264 ush type;
1346 ush red, green, blue; in rpng2_x_load_bg_image()
1352 red = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1353 green = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1354 blue = ((ush)(*src) << 8); ++src; in rpng2_x_load_bg_image()
1508 ush red, green, blue; in rpng2_x_display_row()
1516 red = ((ush)(*src) << 8); in rpng2_x_display_row()
1518 green = ((ush)(*src) << 8); in rpng2_x_display_row()
[all …]
Drpng-win.c128 ush temp = ((ush)(fg)*(ush)(alpha) + \
129 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
Drpng2-win.c157 ush temp = ((ush)(fg)*(ush)(alpha) + \
158 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
238 ush type;
/external/zlib/
Ddeflate.h70 ush freq; /* frequency count */
71 ush code; /* bit string */
74 ush dad; /* father node in Huffman tree */
75 ush len; /* length of bit string */
92 typedef ush Pos;
206 ush bl_count[MAX_BITS+1];
255 ush bi_buf;
331 ush dist = (ush)(distance); \
Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
200 s->bi_buf |= (ush)value << s->bi_valid;
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |= (ush)(value) << s->bi_valid;\
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
[all …]
Dzutil.c229 if (*(ush*)&buf != 0) return buf; in zcalloc()
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
238 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
/external/angle/third_party/zlib/
Ddeflate.h70 ush freq; /* frequency count */
71 ush code; /* bit string */
74 ush dad; /* father node in Huffman tree */
75 ush len; /* length of bit string */
92 typedef ush Pos;
206 ush bl_count[MAX_BITS+1];
255 ush bi_buf;
331 ush dist = (ush)(distance); \
Dtrees.c176 put_byte(s, (uch)((ush)(w) >> 8)); \
200 s->bi_buf |= (ush)value << s->bi_valid;
202 s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
205 s->bi_buf |= (ush)value << s->bi_valid;
215 s->bi_buf |= (ush)val << s->bi_valid;\
217 s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
220 s->bi_buf |= (ush)(value) << s->bi_valid;\
241 ush bl_count[MAX_BITS+1]; in tr_static_init()
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits;
[all …]
Dzutil.c229 if (*(ush*)&buf != 0) return buf; in zcalloc()
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4; in zcalloc()
238 *(ush*)&buf = 0; in zcalloc()
249 if (*(ush*)&ptr != 0) { /* object < 64K */ in zcfree()
/external/libwebsockets/win32port/zlib/
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); \
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]; in tr_static_init()
508 ush f; /* frequency */
522 tree[n].Len = (ush)bits;
[all …]
Dzutil.c226 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()
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;
419 strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
971 overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
[all …]
/external/freetype/src/gzip/
Dzutil.c93 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()
Dzutil.h36 typedef unsigned short ush; typedef
37 typedef ush FAR ushf;
/external/llvm-project/llvm/test/MC/Mips/
Dmips-expansions.s909 ush $8, 0
917 ush $8, 2
926 ush $8, 0x8000
944 ush $8, -0x8000
953 ush $8, 0x10000
972 ush $8, 0x18888
993 ush $8, -32769
1013 ush $8, 32767
1030 ush $8, 0($9)
1038 ush $8, 2($9)
[all …]

123