Searched refs:bi_reverse (Results 1 - 5 of 5) sorted by relevance
| /third_party/node/deps/v8/third_party/zlib/ |
| H A D | trees.c | 152 local unsigned bi_reverse OF((unsigned code, int len));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5); in tr_static_init()
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1137 local unsigned bi_reverse(code, len) in bi_reverse() function
|
| /third_party/libwebsockets/win32port/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);
in tr_static_init()
608 tree[n].Code = bi_reverse(next_code[len]++, len);
1149 local unsigned bi_reverse(code, len)
in bi_reverse() function
|
| /third_party/skia/third_party/externals/zlib/ |
| H A D | trees.c | 152 local unsigned bi_reverse OF((unsigned value, int length));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5); in tr_static_init()
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1136 local unsigned bi_reverse(code, len) in bi_reverse() function
|
| /third_party/node/deps/zlib/ |
| H A D | trees.c | 154 local unsigned bi_reverse(unsigned code, int len) { in bi_reverse() function
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()
365 static_dtree[n].Code = bi_reverse((unsigned)n, 5); in tr_static_init()
|
| /third_party/zlib/ |
| H A D | trees.c | 163 local unsigned bi_reverse(unsigned code, int len) in bi_reverse() function
239 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()
380 static_dtree[n].Code = bi_reverse((unsigned)n, 5); in tr_static_init()
|
Completed in 11 milliseconds