/freebsd-10.1-release/contrib/ncurses/misc/ |
H A D | makedef.cmd | 58 * `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 D | chkdef.cmd | 53 * `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-10.1-release/contrib/libarchive/libarchive/ |
H A D | archive_write_add_filter.c | 40 /* A table that maps filter codes to functions. */ 42 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon1647 63 for (i = 0; codes[i].code != -1; i++) { 64 if (code == codes[i].code) 65 return ((codes[i].setter)(a));
|
H A D | archive_write_set_format.c | 40 /* A table that maps format codes to functions. */ 42 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon1652 69 for (i = 0; codes[i].code != 0; i++) { 70 if (code == codes[i].code) 71 return ((codes[i].setter)(a));
|
/freebsd-10.1-release/lib/libz/ |
H A D | inftrees.h | 39 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 D | inflate.h | 72 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 D | inftrees.c | 22 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 D | inflate.c | 122 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-10.1-release/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
H A D | inftrees.h | 56 unsigned codes, code FAR * FAR *table,
|
H A D | inflate.h | 70 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 D | inftrees.c | 24 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 D | inflate.c | 130 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-10.1-release/crypto/heimdal/lib/wind/ |
H A D | gen-punycode-examples.py | 71 codes = [] variable 75 codes.extend(string.split(m.group(1), ' ')) 79 cases.append([codes, m.group(1), desc])
|
/freebsd-10.1-release/contrib/com_err/ |
H A D | compile_et.h | 61 extern struct error_code *codes;
|
H A D | compile_et.c | 66 struct error_code *codes = NULL; variable in typeref:struct:error_code 91 for(ec = codes, n = 0; ec; ec = ec->next, n++) { 162 for(ec = codes; ec; ec = ec->next) {
|
H A D | parse.y | 134 APPEND(codes, ec);
|
/freebsd-10.1-release/contrib/gcc/ |
H A D | gensupport.h | 82 bool codes[NUM_RTX_CODE]; /* set of codes accepted */ member in struct:pred_data
|
H A D | read-rtl.c | 52 /* 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 D | genrecog.c | 178 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...] |
/freebsd-10.1-release/crypto/heimdal/lib/com_err/ |
H A D | compile_et.h | 64 extern struct error_code *codes;
|
H A D | compile_et.c | 66 struct error_code *codes = NULL; variable in typeref:struct:error_code 91 for(ec = codes, n = 0; ec; ec = ec->next, n++) { 162 for(ec = codes; ec; ec = ec->next) {
|
H A D | parse.y | 134 APPEND(codes, ec);
|
/freebsd-10.1-release/contrib/apr-util/include/ |
H A D | apr_ldap_init.h | 52 #error The security return codes must be added to support this LDAP toolkit.
|
/freebsd-10.1-release/sys/netinet/libalias/ |
H A D | alias_pptp.c | 306 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-10.1-release/crypto/openssl/crypto/dh/ |
H A D | dh.h | 165 /* DH_check error codes */ 171 /* DH_check_pub_key error codes */ 216 int DH_check(const DH *dh, int *codes); 217 int DH_check_pub_key(const DH *dh, const BIGNUM *pub_key, int *codes); 249 /* Error codes for the DH functions. */ 251 /* Function codes. */ 270 /* Reason codes. */
|