Searched refs:bi_reverse (Results 1 - 7 of 7) sorted by relevance
/haiku-fatelf/src/bin/gzip/ |
H A D | bits.c | 25 * the bits must have been reversed first with bi_reverse(). 41 * int bi_reverse (int value, int length) 148 unsigned bi_reverse(code, len) function
|
H A D | gzip.h | 290 unsigned bi_reverse OF((unsigned value, int length));
|
H A D | trees.c | 397 static_dtree[n].Code = bi_reverse(n, 5); 594 tree[n].Code = bi_reverse(next_code[len]++, len);
|
/haiku-fatelf/src/bin/zip/ |
H A D | trees.c | 45 * the bits must have been reversed first with bi_reverse(). 97 * local unsigned bi_reverse (unsigned code, int len) 433 local unsigned bi_reverse OF((unsigned code, int len)); 540 static_dtree[n].Code = (ush)bi_reverse(n, 5); 741 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); 1335 local unsigned bi_reverse(code, len) function
|
H A D | zip.h | 535 unsigned bi_reverse OF((unsigned int, int));
|
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | trees.c | 157 local unsigned bi_reverse OF((unsigned value, int length)); 310 static_dtree[n].Code = bi_reverse((unsigned)n, 5); 606 tree[n].Code = bi_reverse(next_code[len]++, len); 1143 local unsigned bi_reverse( function
|
/haiku-fatelf/src/libs/zlib/ |
H A D | trees.c | 157 local unsigned bi_reverse OF((unsigned value, int length)); 311 static_dtree[n].Code = bi_reverse((unsigned)n, 5); 608 tree[n].Code = bi_reverse(next_code[len]++, len); 1171 local unsigned bi_reverse(code, len) function
|
Completed in 185 milliseconds