Searched defs:codes (Results 1 - 11 of 11) sorted by relevance

/illumos-gate/usr/src/cmd/ast/msgcc/
H A Dmsgcvt.c62 static const Code_t codes[] = variable
168 for (i = 0; i < elementsof(codes); i++)
169 if (streq(codes[i].name, name))
171 c = codes[i].code;
174 if (i >= elementsof(codes))
/illumos-gate/usr/src/contrib/zlib/
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
33 unsigned codes, code FAR * FAR *table, unsigned FAR *bits,
42 int left; /* number of prefix codes available */
54 unsigned short count[MAXBITS+1]; /* number of codes of each length */
56 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
59 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
62 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
66 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
73 code lengths are lens[0..codes-1]. Each length corresponds to the
74 symbols 0..codes
32 inflate_table(codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work) argument
[all...]
H A Dinflate.h72 Read deflate codes in fixed or dynamic block:
109 code const FAR *lencode; /* starting table for length/literal codes */
110 code const FAR *distcode; /* starting table for distance codes */
118 code FAR *next; /* next available space in codes[] */
121 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
/illumos-gate/usr/src/cmd/audio/utilities/
H A Dg723.c109 state_ptr->leftover_cnt = 0; /* no left over codes */
462 * is adjusted by one level of A-law or Mu-law codes.
538 /* ADPCM codes : 8, 9, ... F, 0, 1, ... , 6, 7 */
542 /* u-law codes : 0, 1, ... 7E, 7F, FF, FE, ... 81, 80 */
630 * In the event that the number packed codes is shorter than a sample unit,
658 unsigned int codes; local
697 codes = (bits > 0) ? leftover[offset] : 0;
714 codes += i << bits;
717 leftover[offset] = codes & 0xff;
719 codes >>
765 unsigned int codes; local
[all...]
/illumos-gate/usr/src/lib/libast/common/comp/
H A Diconv.c94 static const _ast_iconv_list_t codes[] = variable
471 cp = codes;
1494 return (cp = ccmaplist(cp)) ? cp : (_ast_iconv_list_t*)codes;
/illumos-gate/usr/src/cmd/fm/modules/common/ses-log-transport/
H A Dses_log_transport.c128 code_operation_t *codes; member in struct:platform
137 /* This is the genesis list of codes and functions. */
590 * Searches the platform lists for target codes. If a match is found then
603 if (code == platforms.plist[i].codes[x].code) {
604 status = platforms.plist[i].codes[x].
/illumos-gate/usr/src/lib/print/libhttp-core/common/
H A Dhttp.c1989 static const char * const codes[] = local
2010 http, codes[request], uri));
2059 if (httpPrintf(http, "%s %s HTTP/1.1\r\n", codes[request], buf) < 1)
/illumos-gate/usr/src/cmd/captoinfo/
H A Dcaptoinfo.c157 capsearch(char *codes[], char *ocodes[], char *cap) argument
159 for (; *codes; codes++)
160 if (((*codes)[0] == cap[0]) && ((*codes)[1] == cap[1]))
/illumos-gate/usr/src/test/libc-tests/tests/regex/
H A Dtestregex.c273 T(" codes (with REG_ omitted) or the match array, a list of (m,n)\n");
524 static const struct { int code; char* name; } codes[] = variable in typeref:struct:__anon206
2066 for (i = 1; i < elementsof(codes); i++)
2067 if (cret==codes[i].code)
2070 skip = extract(tabs, line, re, s, ans, msg, codes[got].name, NiL, 0, 0, skip, level, test|TEST_DELIMIT);
2074 printf("%s returned: ", codes[got].name);
2081 for (i = 1; i < elementsof(codes); i++)
2083 if (streq(ans, codes[i].name))
2085 if (cret==codes[i].code)
2091 skip = extract(tabs, line, re, s, ans, msg, codes[go
[all...]
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c156 /* number of length codes, not counting the special END_BLOCK code */
162 /* number of Literal or Length codes, including the END_BLOCK code */
165 /* number of distance codes */
168 /* number of codes used to transfer the bit lengths */
174 /* All codes must not exceed MAX_BITS bits */
322 /* number of codes at each bit length for an optimal tree */
650 * output size for (length,distance) codes is <= 32 bits (worst case
1482 /* Bit length codes must not exceed MAX_BL_BITS bits */
1507 /* The lengths of the bit length codes are sent in order of decreasing
1508 * probability, to avoid transmitting the lengths for unused bit length codes
3085 *codes; member in struct:inflate_blocks_state::__anon59::__anon61
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c302 /* number of length codes, not counting the special END_BLOCK code */
308 /* number of Literal or Length codes, including the END_BLOCK code */
311 /* number of distance codes */
314 /* number of codes used to transfer the bit lengths */
320 /* All codes must not exceed MAX_BITS bits */
484 /* number of codes at each bit length for an optimal tree */
868 * the average output size for (length, distance) codes is <=
2256 /* Bit length codes must not exceed MAX_BL_BITS bits */
2288 * The lengths of the bit length codes are sent in order of decreasing
2290 * length codes
4179 inflate_codes_statef *codes; member in struct:inflate_blocks_state::__anon6504::__anon6506
[all...]

Completed in 276 milliseconds