Home
last modified time | relevance | path

Searched refs:codes (Results 1 – 25 of 154) sorted by relevance

1234567

/titanic_53/usr/src/cmd/audio/utilities/
H A Dg723.c658 unsigned int codes; in g723_encode() local
697 codes = (bits > 0) ? leftover[offset] : 0; in g723_encode()
714 codes += i << bits; in g723_encode()
717 leftover[offset] = codes & 0xff; in g723_encode()
719 codes >>= 8; in g723_encode()
729 codes = 0; in g723_encode()
736 leftover[offset] = codes & 0xff; in g723_encode()
765 unsigned int codes; in g723_decode() local
786 codes = (bits > 0) ? state_ptr->leftover[0] : 0; in g723_decode()
790 codes += *in_ptr++ << bits; in g723_decode()
[all …]
/titanic_53/usr/src/boot/lib/libz/doc/
H A Drfc1951.txt81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
H A Dtxtvsbin.txt59 The first observation is that, although the full range of 7-bit codes
62 widely-used, almost universally-portable control codes are 9 (TAB),
63 10 (LF) and 13 (CR). There are a few more control codes that are
66 codes are rarely (if ever) used alone, without being accompanied by
72 detection schemes observe the presence of non-ASCII codes from the range
75 contain both control characters and codes from the upper range. On the
87 one or more black-listed codes, either by mistake or by peculiar design
89 of black-listed codes would provide an increased recall (i.e. more true
H A Dalgorithm.txt64 codes are much more common than longer codes, so pay attention to decoding the
65 short codes fast, and let the long codes take longer to decode.
79 codes are replicated many times in such a table. What inflate() does is
83 For inflate, which has 286 possible codes for the literal/length tree, the size
/titanic_53/usr/src/boot/lib/libz/
H A Dinftrees.c32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
109 for (sym = 0; sym < codes; sym++)
146 for (sym = 0; sym < codes; sym++)
H A Dinflate.c122 state->lencode = state->distcode = state->next = state->codes;
923 state->next = state->codes;
997 state->next = state->codes;
1470 if (state->lencode >= state->codes &&
1471 state->lencode <= state->codes + ENOUGH - 1) {
1472 copy->lencode = copy->codes + (state->lencode - state->codes);
1473 copy->distcode = copy->codes + (state->distcode - state->codes);
1475 copy->next = copy->codes + (state->next - state->codes);
H A Dinftrees.h61 unsigned codes, code FAR * FAR *table,
H A Dinflate.h118 code codes[ENOUGH]; /* space for code tables */ member
/titanic_53/usr/src/contrib/zlib/
H A Dinftrees.c33 unsigned codes, code FAR * FAR *table, unsigned FAR *bits, in inflate_table() argument
105 for (sym = 0; sym < codes; sym++) in inflate_table()
142 for (sym = 0; sym < codes; sym++) in inflate_table()
H A Dinflate.c136 state->lencode = state->distcode = state->next = state->codes; in inflateResetKeep()
941 state->next = state->codes; in inflate()
1016 state->next = state->codes; in inflate()
1492 if (state->lencode >= state->codes && in inflateCopy()
1493 state->lencode <= state->codes + ENOUGH - 1) { in inflateCopy()
1494 copy->lencode = copy->codes + (state->lencode - state->codes); in inflateCopy()
1495 copy->distcode = copy->codes + (state->distcode - state->codes); in inflateCopy()
1497 copy->next = copy->codes + (state->next - state->codes); in inflateCopy()
1553 return (unsigned long)(state->next - state->codes); in inflateCodesUsed()
H A Dinftrees.h61 unsigned codes, code FAR * FAR *table,
H A Dinflate.h122 code codes[ENOUGH]; /* space for code tables */ member
/titanic_53/usr/src/contrib/ast/src/cmd/msgcc/
H A Dmsgcvt.c62 static const Code_t codes[] = variable
168 for (i = 0; i < elementsof(codes); i++) in decode()
169 if (streq(codes[i].name, name)) in decode()
171 c = codes[i].code; in decode()
174 if (i >= elementsof(codes)) in decode()
/titanic_53/usr/src/cmd/fm/eversholt/files/i386/i86pc/
H A Dgcpu.esc40 * Ereports for Simple error codes.
78 * Ereports for Compound error codes. These are in pairs "foo" and "foo_uc"
90 * Ereports for Compound error codes - generic memory hierarchy errors
98 * Ereports for Compound error codes - TLB errors
116 * Ereports for Compound error codes - memory hierarchy errors
129 * Ereports for Compound error codes - bus and interconnect errors
/titanic_53/usr/src/cmd/truss/
H A DMakefile.com31 OBJS= main.o listopts.o ipc.o actions.o expound.o codes.o print.o \
/titanic_53/usr/src/cmd/csh/
H A DREADME3 This directory contains machine independent source codes of csh.
/titanic_53/usr/src/cmd/captoinfo/
H A Dcaptoinfo.c159 capsearch(char *codes[], char *ocodes[], char *cap) in capsearch() argument
161 for (; *codes; codes++) in capsearch()
162 if (((*codes)[0] == cap[0]) && ((*codes)[1] == cap[1])) in capsearch()
/titanic_53/usr/src/cmd/loadkeys/type_4/
H A Dtraditional_chinese_531 # New function keys assigned old codes
H A Dkorea_532 # New function keys assigned old codes
H A Dkorea_hobo48 # New function keys assigned old codes
H A Dtraditional_chinese_hobo49 # New function keys assigned old codes
/titanic_53/usr/src/cmd/loadkeys/type_6/
H A Dtraditional_chinese32 # New function keys assigned old codes
H A Dkorea35 # New function keys assigned old codes
/titanic_53/usr/src/cmd/sendmail/src/
H A DREAD_ME78 sysexits.c List of error messages associated with error codes
80 sysexits.h List of error codes for systems that lack their own.
/titanic_53/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1675 code codes[ENOUGH]; /* space for code tables */ member
1705 int inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
1708 unsigned codes;
1782 for (sym = 0; sym < codes; sym++)
1819 for (sym = 0; sym < codes; sym++)
2349 state->lencode = state->distcode = state->next = state->codes;
3082 state->next = state->codes;
3148 state->next = state->codes;
3576 if (state->lencode >= state->codes &&
3577 state->lencode <= state->codes + ENOUGH - 1) {
[all …]

1234567