| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/ |
| ush.s | 1 # Source file used to test the ush macro.
13 ush $4,0
14 ush $4,1
15 ush $4,0x8000
16 ush $4,-0x8000
17 ush $4,0x10000
18 ush $4,0x1a5a5
19 ush $4,0($5)
20 ush $4,1($5)
21 ush $4,data_labe
[all...] |
| 24k-triple-stores-6.s | 10 ush $ra,80($sp)
11 ush $s3,88($sp)
12 ush $s8,96($sp)
|
| /external/freetype/src/gzip/ |
| zutil.c | 93 if (*(ush*)&buf != 0) return buf;
101 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
102 *(ush*)&buf = 0;
110 if (*(ush*)&ptr != 0) { /* object < 64K */
|
| /external/libpng/contrib/gregbook/ |
| readpng.h | 73 typedef unsigned short ush; typedef
|
| rpng-x.c | 107 * "ush acopy = (alpha);") */
110 ush temp = ((ush)(fg)*(ush)(alpha) + \
111 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
159 ush reds[256], greens[256], blues[256];
787 ush red, green, blue
[all...] |
| rpng2-x.c | 167 * "ush acopy = (alpha);") */
170 ush temp = ((ush)(fg)*(ush)(alpha) + \
171 (ush)(bg)*(ush)(255 - (ush)(alpha)) + (ush)128); \
264 ush type;
[all...] |
| /external/python/cpython3/Modules/zlib/ |
| deflate.h | 70 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); \
|
| trees.c | 176 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];
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits
[all...] |
| zutil.c | 229 if (*(ush*)&buf != 0) return buf;
237 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
238 *(ush*)&buf = 0;
249 if (*(ush*)&ptr != 0) { /* object < 64K */
|
| /external/zlib/src/ |
| deflate.h | 70 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); \
|
| trees.c | 176 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];
500 ush f; /* frequency */
514 tree[n].Len = (ush)bits
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| 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); \
|
| 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];
502 ush f; /* frequency */
516 tree[n].Len = (ush)bits;
[all...] |
| zutil.c | 230 if (*(ush*)&buf != 0) return buf;
238 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
239 *(ush*)&buf = 0;
247 if (*(ush*)&ptr != 0) { /* object < 64K */
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| 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.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 */
|
| 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...] |
| /external/python/cpython2/Modules/zlib/ |
| 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); \
|
| 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];
502 ush f; /* frequency */
516 tree[n].Len = (ush)bits
[all...] |
| zutil.c | 230 if (*(ush*)&buf != 0) return buf;
238 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
239 *(ush*)&buf = 0;
247 if (*(ush*)&ptr != 0) { /* object < 64K */
|
| /external/syslinux/com32/lib/zlib/ |
| 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); \
|
| 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 */
|
| /toolchain/binutils/binutils-2.27/zlib/ |
| 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); \
|
| 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];
502 ush f; /* frequency */
516 tree[n].Len = (ush)bits
[all...] |
| /device/linaro/bootloader/edk2/EmbeddedPkg/Library/ZLib/ |
| zutil.c | 226 if (*(ush*)&buf != 0) return buf;
234 *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
235 *(ush*)&buf = 0;
246 if (*(ush*)&ptr != 0) { /* object < 64K */
|
