Searched refs:next_code (Results 1 - 7 of 7) sorted by relevance
/macosx-10.10.1/libarchive-30/libarchive/libarchive/ |
H A D | archive_read_support_compression_compress.c | 141 static int next_code(struct archive_read_filter *); 252 next_code(self); 280 ret = next_code(self); 321 next_code(struct archive_read_filter *self) function 361 return (next_code(self));
|
/macosx-10.10.1/bind9-45.101/bind9/contrib/idn/idnkit-1.0-src/lib/ |
H A D | punycode.c | 209 unsigned long cur_code, next_code, delta; local 298 for (next_code = MAX_UCS, uidx = fromlen - 1; 300 if (from[uidx] >= cur_code && from[uidx] < next_code) { 301 next_code = from[uidx]; 308 delta += (next_code - cur_code) * (ucsdone + 1); 309 cur_code = next_code;
|
/macosx-10.10.1/rsync-45/rsync/zlib/ |
H A D | 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));
|
/macosx-10.10.1/sudo-73/src/zlib/ |
H A D | trees.c | 580 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 589 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 602 tree[n].Code = bi_reverse(next_code[len]++, len); 605 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
/macosx-10.10.1/xnu-2782.1.97/libkern/zlib/ |
H A D | trees.c | 609 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 618 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 631 tree[n].Code = bi_reverse(next_code[len]++, len); 634 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
/macosx-10.10.1/zlib-55/zlib/ |
H A D | trees.c | 586 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 595 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 608 tree[n].Code = bi_reverse(next_code[len]++, len); 611 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
/macosx-10.10.1/ppp-786.1.1/Helpers/pppdump/ |
H A D | zlib.c | 1962 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local 1971 next_code[bits] = code = (code + bl_count[bits-1]) << 1; 1984 tree[n].Code = bi_reverse(next_code[len]++, len); 1987 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
Completed in 146 milliseconds