Searched defs:codes (Results 1 - 4 of 4) sorted by relevance
| /osnet-11/usr/src/cmd/ast/msgcc/ |
| H A D | msgcvt.c | 62 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))
|
| /osnet-11/usr/src/lib/libast/common/comp/ |
| H A D | iconv.c | 94 static const _ast_iconv_list_t codes[] = variable
471 cp = codes;
1597 return (cp = ccmaplist(cp)) ? cp : (_ast_iconv_list_t*)codes;
|
| /osnet-11/usr/src/lib/libcmd/common/ |
| H A D | find.c | 81 " [+lib/find/codes?Default \blocate\b(1) database.]"
225 char* codes; member in struct:State_s
274 "codes", CODES, Str, 0, "path", 0,
1029 state->codes = b;
1818 if (fp = findopen(state.codes, state.fast, NiL, &disc))
|
| /osnet-11/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
| H A D | zlib.c | 156 /* 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
3078 *codes; member in struct:inflate_blocks_state::__anon13::__anon15
[all...] |
Completed in 29 milliseconds