| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| trees.c | 156 local unsigned bi_reverse OF((unsigned value, int length));
308 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
604 tree[n].Code = bi_reverse(next_code[len]++, len);
1146 local unsigned bi_reverse(code, len) function
|
| trees.c | 156 local unsigned bi_reverse OF((unsigned value, int length));
308 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
604 tree[n].Code = bi_reverse(next_code[len]++, len);
1146 local unsigned bi_reverse(code, len) function
|
| /src/external/gpl3/binutils/dist/zlib/ |
| trees.c | 154 local unsigned bi_reverse(unsigned code, int len) { function
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
365 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| trees.c | 154 local unsigned bi_reverse(unsigned code, int len) { function
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
365 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| /src/external/gpl3/binutils.old/dist/zlib/ |
| trees.c | 152 local unsigned bi_reverse OF((unsigned code, int len));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1137 local unsigned bi_reverse(code, len) function
|
| trees.c | 152 local unsigned bi_reverse OF((unsigned code, int len));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1137 local unsigned bi_reverse(code, len) function
|
| /src/external/gpl3/gdb.old/dist/zlib/ |
| trees.c | 152 local unsigned bi_reverse OF((unsigned code, int len));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1137 local unsigned bi_reverse(code, len) function
|
| trees.c | 152 local unsigned bi_reverse OF((unsigned code, int len));
304 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
1137 local unsigned bi_reverse(code, len) function
|
| /src/external/gpl3/gdb/dist/zlib/ |
| trees.c | 154 local unsigned bi_reverse(unsigned code, int len) { function
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
365 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| trees.c | 154 local unsigned bi_reverse(unsigned code, int len) { function
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
365 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| /src/common/dist/zlib/ |
| trees.c | 156 local unsigned bi_reverse(unsigned code, int len) { function
229 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
368 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| trees.c | 156 local unsigned bi_reverse(unsigned code, int len) { function
229 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
368 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
|
| /src/sys/net/ |
| zlib.c | 2256 local unsigned bi_reverse(unsigned value, int length);
2406 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2697 tree[n].Code = bi_reverse(next_code[len]++, len);
3235 local unsigned bi_reverse(unsigned code, /* the value to invert */ function
|
| zlib.c | 2256 local unsigned bi_reverse(unsigned value, int length);
2406 static_dtree[n].Code = bi_reverse((unsigned)n, 5);
2697 tree[n].Code = bi_reverse(next_code[len]++, len);
3235 local unsigned bi_reverse(unsigned code, /* the value to invert */ function
|
