| /src/external/zlib/pigz/dist/zopfli/ |
| tree.c | 33 size_t* next_code = (size_t*)malloc(sizeof(size_t) * (maxbits + 1)); local
55 next_code[bits] = code;
62 symbols[i] = next_code[len];
63 next_code[len]++;
68 free(next_code);
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_read_support_filter_compress.c | 140 static int next_code(struct archive_read_filter *);
264 next_code(self);
292 ret = next_code(self);
323 next_code(struct archive_read_filter *self) function
|
| /src/common/dist/zlib/ |
| trees.c | 205 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
215 next_code[bits] = (ush)code;
228 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
231 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
|
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| trees.c | 582 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
591 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
604 tree[n].Code = bi_reverse(next_code[len]++, len);
607 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /src/external/gpl3/binutils/dist/zlib/ |
| trees.c | 203 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
213 next_code[bits] = (ush)code;
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
229 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
|
| /src/external/gpl3/binutils.old/dist/zlib/ |
| trees.c | 577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
587 next_code[bits] = (ush)code;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /src/external/gpl3/gdb.old/dist/zlib/ |
| trees.c | 577 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
587 next_code[bits] = (ush)code;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
| /src/external/gpl3/gdb/dist/zlib/ |
| trees.c | 203 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
213 next_code[bits] = (ush)code;
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
229 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gensupport.cc | 280 const char *next_code = XSTR (exp, 0);
283 if (*next_code == '\0')
289 while ((code = scan_comma_elt (&next_code)) != 0)
291 size_t n = next_code - code;
278 const char *next_code = XSTR (exp, 0); local
|
| combine.cc | 8043 enum rtx_code next_code = *next_code_ptr;
8074 new_rtx = make_compound_operation (XEXP (x, 0), next_code);
8088 lhs = make_compound_operation (lhs, next_code);
8089 rhs = make_compound_operation (rhs, next_code);
8116 lhs = make_compound_operation (lhs, next_code);
8117 rhs = make_compound_operation (rhs, next_code);
8151 new_rtx = make_compound_operation (XEXP (XEXP (x, 0), 0), next_code);
8165 new_rtx = make_compound_operation (XEXP (inner_x0, 0), next_code);
8178 new_rtx = make_compound_operation (XEXP (x, 0), next_code);
8207 new_rtx = make_compound_operation (XEXP (XEXP (x, 0), 0), next_code);
8017 enum rtx_code next_code = *next_code_ptr; local
8452 enum rtx_code next_code; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gensupport.cc | 276 const char *next_code = XSTR (exp, 0);
279 if (*next_code == '\0')
285 while ((code = scan_comma_elt (&next_code)) != 0)
287 size_t n = next_code - code;
274 const char *next_code = XSTR (exp, 0); local
|
| combine.cc | 8001 enum rtx_code next_code = *next_code_ptr;
8032 new_rtx = make_compound_operation (XEXP (x, 0), next_code);
8046 lhs = make_compound_operation (lhs, next_code);
8047 rhs = make_compound_operation (rhs, next_code);
8074 lhs = make_compound_operation (lhs, next_code);
8075 rhs = make_compound_operation (rhs, next_code);
8109 new_rtx = make_compound_operation (XEXP (XEXP (x, 0), 0), next_code);
8123 new_rtx = make_compound_operation (XEXP (inner_x0, 0), next_code);
8136 new_rtx = make_compound_operation (XEXP (x, 0), next_code);
8165 new_rtx = make_compound_operation (XEXP (XEXP (x, 0), 0), next_code);
7975 enum rtx_code next_code = *next_code_ptr; local
8399 enum rtx_code next_code; local
[all...] |
| /src/sys/dev/stbi/ |
| stb_image.c | 2220 int code, next_code[16], sizes[17]; local
2232 next_code[i] = code;
2246 int c = next_code[s] - z->firstcode[s] + z->firstsymbol[s];
2250 int m = bit_reverse(next_code[s],s);
2256 ++next_code[s];
|
| /src/sys/net/ |
| zlib.c | 2675 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
2684 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2697 tree[n].Code = bi_reverse(next_code[len]++, len);
2700 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
