Searched refs:codes (Results 1 - 25 of 40) sorted by relevance

12

/freebsd-9.3-release/contrib/ncurses/misc/
H A Dmakedef.cmd58 * `codes' is the stem that links a code to every symbol
64 codes. = 0
134 codes.last = new_code
141 codes.last = 0
149 * Finally we scan the stem, writing out all symbols with export codes.
155 if codes.inx = 0 then
160 codes.inx = new_code
163 say ' "'names.inx'" @'codes.inx' NONAME'
H A Dchkdef.cmd53 * `codes' associates a name to a code
57 codes. = 0
86 when codes.new_name \= 0 then
88 if codes.new_name \= new_code then
102 codes.new_name = new_code
/freebsd-9.3-release/contrib/libarchive/libarchive/
H A Darchive_write_set_format.c40 /* A table that maps format codes to functions. */
42 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon1635
65 for (i = 0; codes[i].code != 0; i++) {
66 if (code == codes[i].code)
67 return ((codes[i].setter)(a));
/freebsd-9.3-release/lib/libz/
H A Dinftrees.h39 1444, which is the sum of 852 for literal/length codes and 592 for distance
40 codes. These values were found by exhaustive searches using the program
43 maximum bit length of a code. "enough 286 9 15" for literal/length codes
44 returns returns 852, and "enough 30 6 15" for distance codes returns 592.
61 unsigned codes, code FAR * FAR *table,
H A Dinflate.h72 Read deflate codes in fixed or dynamic block:
106 code const FAR *lencode; /* starting table for length/literal codes */
107 code const FAR *distcode; /* starting table for distance codes */
115 code FAR *next; /* next available space in codes[] */
118 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
35 unsigned codes;
46 int left; /* number of prefix codes available */
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
77 code lengths are lens[0..codes
[all...]
H A Dinflate.c122 state->lencode = state->distcode = state->next = state->codes;
331 puts(" /* inffixed.h -- table for decoding fixed codes");
559 if there is no input available. The decoding of variable length codes uses
845 Tracev((stderr, "inflate: fixed codes block%s\n",
847 state->mode = LEN_; /* decode codes */
854 Tracev((stderr, "inflate: dynamic codes block%s\n",
923 state->next = state->codes;
997 state->next = state->codes;
1016 Tracev((stderr, "inflate: codes ok\n"));
1470 if (state->lencode >= state->codes
[all...]
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Dinftrees.h56 unsigned codes, code FAR * FAR *table,
H A Dinflate.h70 Read deflate codes:
104 code const FAR *lencode; /* starting table for length/literal codes */
105 code const FAR *distcode; /* starting table for distance codes */
113 code FAR *next; /* next available space in codes[] */
116 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
H A Dinftrees.c24 The code lengths are lens[0..codes-1]. The result starts at *table,
34 int inflate_table(type, lens, codes, table, bits, work)
37 unsigned codes;
48 int left; /* number of prefix codes available */
60 unsigned short count[MAXBITS+1]; /* number of codes of each length */
62 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
65 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
68 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
72 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
79 code lengths are lens[0..codes
[all...]
H A Dinflate.c130 state->lencode = state->distcode = state->next = state->codes;
282 puts(" /* inffixed.h -- table for decoding fixed codes");
515 if there is no input available. The decoding of variable length codes uses
809 Tracev((stderr, "inflate: fixed codes block%s\n",
811 state->mode = LEN; /* decode codes */
814 Tracev((stderr, "inflate: dynamic codes block%s\n",
882 state->next = state->codes;
949 state->next = state->codes;
968 Tracev((stderr, "inflate: codes ok\n"));
1382 if (state->lencode >= state->codes
[all...]
/freebsd-9.3-release/contrib/com_err/
H A Dcompile_et.h66 extern struct error_code *codes;
H A Dcompile_et.c67 struct error_code *codes = NULL; variable in typeref:struct:error_code
90 for(ec = codes, n = 0; ec; ec = ec->next, n++) {
160 for(ec = codes; ec; ec = ec->next) {
H A Dparse.y135 APPEND(codes, ec);
/freebsd-9.3-release/contrib/gcc/
H A Dgensupport.h82 bool codes[NUM_RTX_CODE]; /* set of codes accepted */ member in struct:pred_data
H A Dread-rtl.c52 /* The group (modes or codes) to which the macro or attribute belongs. */
68 /* The number of "real" modes or codes (and by extension, the first
151 static struct macro_group modes, codes; variable in typeref:struct:
252 /* Implementations of the macro_group callbacks for codes. */
675 codes.attrs = htab_create (13, def_hash, def_name_eq_p, 0);
676 codes.macros = htab_create (13, def_hash, def_name_eq_p, 0);
677 codes.num_builtins = NUM_RTX_CODE;
678 codes.find_builtin = find_code;
679 codes.uses_macro_p = uses_code_macro_p;
680 codes
[all...]
H A Dgenrecog.c178 predicate to a list of the rtl codes it can possibly match. The
192 Calculating the set of rtx codes that can possibly be accepted by a
231 /* Recursively calculate the set of rtx codes accepted by the
234 compute_predicate_codes (rtx exp, char codes[NUM_RTX_CODE])
247 codes[i] = TRISTATE_AND (op0_codes[i], op1_codes[i]);
254 codes[i] = TRISTATE_OR (op0_codes[i], op1_codes[i]);
259 codes[i] = TRISTATE_NOT (op0_codes[i]);
263 /* a ? b : c accepts the same codes as (a & b) | (!a & c). */
268 codes[i] = TRISTATE_OR (TRISTATE_AND (op0_codes[i], op1_codes[i]),
274 /* MATCH_CODE allows a specified list of codes
233 compute_predicate_codes(rtx exp, char codes[NUM_RTX_CODE]) argument
370 char codes[NUM_RTX_CODE]; local
[all...]
H A Dgenpreds.c459 /* CODES is a list of RTX codes. Write out an expression which
460 determines whether the operand has one of those codes. */
462 write_match_code (const char *path, const char *codes) argument
466 while ((code = scan_comma_elt (&codes)) != 0)
471 while (code < codes)
477 if (*codes == ',')
546 const char *codes = XSTR (exp, 0); local
554 while ((code = scan_comma_elt (&codes)) != 0)
557 while (code < codes)
/freebsd-9.3-release/crypto/heimdal/lib/com_err/
H A Dcompile_et.h66 extern struct error_code *codes;
H A Dcompile_et.c65 struct error_code *codes = NULL; variable in typeref:struct:error_code
88 for(ec = codes, n = 0; ec; ec = ec->next, n++) {
158 for(ec = codes; ec; ec = ec->next) {
H A Dparse.y133 APPEND(codes, ec);
/freebsd-9.3-release/contrib/ipfilter/perl/
H A Dplog84 # - Added some more ICMP unreachable codes, and made code and type names
102 # - I had mixed up info-request and info-reply ICMP codes, and omitted the
136 # - Added parsing of icmp codes, and more types.
157 # Map of log codes for various actions. Not all of these can occur, but
169 # Map of ICMP types and their relevant codes.
173 codes => +{0 => undef},
177 codes => +{
198 codes => +{0 => undef},
202 codes => +{
211 codes
[all...]
/freebsd-9.3-release/contrib/nvi/cl/
H A Dcl_bsd.c236 static const char codes[] = { variable
252 * those codes.
254 static const char codes[] = { variable
303 keyname[1] = codes[n];
309 keyname[1] = codes[n];
/freebsd-9.3-release/sys/netinet/libalias/
H A Dalias_pptp.c306 PptpCode codes; local
355 codes = (PptpCode) (cptr + 1);
356 if (codes->resCode == 1) /* Connection
425 PptpCode codes = (PptpCode) (cptr + 1); local
427 if (codes->resCode == 1) /* Connection
/freebsd-9.3-release/crypto/openssl/crypto/dh/
H A Ddh.h150 /* DH_check error codes */
156 /* DH_check_pub_key error codes */
205 int DH_check(const DH *dh, int *codes);
206 int DH_check_pub_key(const DH *dh, const BIGNUM *pub_key, int *codes);
227 /* Error codes for the DH functions. */
229 /* Function codes. */
241 /* Reason codes. */

Completed in 235 milliseconds

12