Home
last modified time | relevance | path

Searched refs:next_code (Results 1 – 6 of 6) sorted by relevance

/titanic_53/usr/src/lib/libc/amd64/unwind/
H A Deh_frame.c223 uint64_t next_code; in get_table_ent_val() local
233 next_code = (third >= data_end)? ULONG_MAX : in get_table_ent_val()
244 next_code = (third >= data_end)? ULONG_MAX : in get_table_ent_val()
255 next_code = (third >= data_end)? ULONG_MAX : in get_table_ent_val()
266 next_code = (third >= data_end)? ULONG_MAX : in get_table_ent_val()
278 if (next_code != ULONG_MAX) in get_table_ent_val()
279 next_code += (uint64_t)third + reloc; in get_table_ent_val()
284 if (next_code != ULONG_MAX) in get_table_ent_val()
285 next_code += base; in get_table_ent_val()
293 *next_codep = next_code; in get_table_ent_val()
/titanic_53/usr/src/boot/lib/libz/
H A Dtrees.c580 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));
/titanic_53/usr/src/contrib/zlib/
H A Dtrees.c577 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));
/titanic_53/usr/src/boot/lib/libz/doc/
H A Drfc1951.txt432 next_code[bits] = code;
444 tree[n].Code = next_code[len];
445 next_code[len]++;
468 Step 2 computes the following next_code values:
470 N next_code[N]
/titanic_53/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1940 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ local
1949 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
1962 tree[n].Code = bi_reverse(next_code[len]++, len);
1965 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
/titanic_53/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2760 ush next_code[MAX_BITS+1]; local
2770 next_code[bits] = code = (code + bl_count[bits-1]) << 1;
2784 tree[n].Code = bi_reverse(next_code[len]++, len);
2789 next_code[len]-1));