| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_write_add_filter.c | 39 /* A table that maps filter codes to functions. */
41 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon7090
64 for (i = 0; codes[i].code != -1; i++) {
65 if (code == codes[i].code)
66 return ((codes[i].setter)(a));
|
| 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:__anon7094
73 for (i = 0; codes[i].code != 0; i++) {
74 if (code == codes[i].code)
75 return ((codes[i].setter)(a));
|
| /src/crypto/external/bsd/heimdal/dist/lib/wind/ |
| gen-punycode-examples.py | 70 codes = [] variable
74 codes.extend(m.group(1).split(' '))
78 cases.append([codes, m.group(1), desc])
|
| /src/common/dist/zlib/contrib/infback9/ |
| inflate9.h | 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
| /src/external/gpl3/binutils/dist/zlib/contrib/infback9/ |
| inflate9.h | 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
| /src/external/gpl3/binutils.old/dist/zlib/contrib/infback9/ |
| inflate9.h | 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
| /src/external/gpl3/gdb/dist/zlib/contrib/infback9/ |
| inflate9.h | 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
| /src/external/gpl3/gdb.old/dist/zlib/contrib/infback9/ |
| inflate9.h | 30 Read deflate codes:
43 code FAR *next; /* next available space in codes[] */
46 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
| /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
| dh-ltm.c | 88 int codes, times = 0; local
132 if (DH_check_pubkey(dh, dh->pub_key, &codes) && codes == 0)
|
| dh-tfm.c | 88 int codes, times = 0; local
132 if (DH_check_pubkey(dh, dh->pub_key, &codes) && codes == 0)
|
| dh.c | 250 * @param codes return that the failures of the pub_key are.
252 * @return 1 on success, 0 on failure and *codes is set the the
259 DH_check_pubkey(const DH *dh, const BIGNUM *pub_key, int *codes)
264 *codes = 0;
287 *codes |= DH_CHECK_PUBKEY_TOO_SMALL;
296 *codes |= DH_CHECK_PUBKEY_TOO_LARGE;
315 *codes |= DH_CHECK_PUBKEY_TOO_SMALL;
364 int codes; local
371 if (!DH_check_pubkey(dh, peer_pub_key, &codes) || codes != 0
[all...] |
| /src/external/bsd/nvi/dist/cl/ |
| cl_bsd.c | 244 static const char codes[] = { variable
260 * those codes.
262 static const char codes[] = { variable
312 mykeyname[1] = codes[n];
318 mykeyname[1] = codes[n];
|
| /src/usr.sbin/gspa/gspa/ |
| gsp_out.c | 42 u_int16_t codes[5]; variable
87 codes[code_idx] = v;
239 fprintf(listfile, " %.4X", codes[i]);
|
| /src/crypto/external/bsd/heimdal/dist/lib/com_err/ |
| compile_et.c | 70 struct error_code *codes = NULL; variable in typeref:struct:error_code
95 for(ec = codes, n = 0; ec; ec = ec->next, n++) {
166 for(ec = codes; ec; ec = ec->next) {
|
| /src/common/dist/zlib/contrib/puff/ |
| puff.c | 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes o
436 local int codes(struct state *s, function
[all...] |
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| 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
|
| /src/external/gpl3/binutils/dist/opcodes/ |
| z8k-dis.c | 107 static char *codes[16] = variable
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
|
| /src/external/gpl3/binutils/dist/zlib/contrib/puff/ |
| puff.c | 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes o
436 local int codes(struct state *s, function
[all...] |
| /src/external/gpl3/binutils.old/dist/opcodes/ |
| z8k-dis.c | 107 static char *codes[16] = variable
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
|
| /src/external/gpl3/binutils.old/dist/zlib/contrib/puff/ |
| puff.c | 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes o
436 local int codes(struct state *s, function
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gensupport.h | 186 int num_codes; /* number of codes accepted */
189 bool codes[NUM_RTX_CODE]; /* set of codes accepted */ member in struct:pred_data
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gensupport.h | 181 int num_codes; /* number of codes accepted */
184 bool codes[NUM_RTX_CODE]; /* set of codes accepted */ member in struct:pred_data
|
| /src/external/gpl3/gdb/dist/opcodes/ |
| z8k-dis.c | 107 static char *codes[16] = variable
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
|
| /src/external/gpl3/gdb/dist/zlib/contrib/puff/ |
| puff.c | 49 * - Fix fixed codes table error
63 * 1.8 9 Jan 2004 - Added some comments on no distance codes case
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
93 #define MAXDCODES 30 /* maximum number of distance codes */
94 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
219 * - The codes as stored in the compressed data are bit-reversed relative to
220 * a simple integer ordering of codes of the same lengths. Hence below the
226 * - The first code for the shortest length is all zeros. Subsequent codes o
436 local int codes(struct state *s, function
[all...] |
| /src/external/gpl3/gdb.old/dist/opcodes/ |
| z8k-dis.c | 107 static char *codes[16] = variable
585 sprintf (tmp_str, "%s", codes[instr_data->cond_code]);
|
