| /netbsd-src/external/bsd/ipf/dist/perl/ |
| H A D | plog | 173 codes => +{0 => undef},
177 codes => +{
198 codes => +{0 => undef},
202 codes => +{
211 codes => +{
217 codes => +{0 => undef},
221 codes => +{0 => undef},
225 codes => +{0 => undef},
229 codes => +{
236 codes => +{
[all …]
|
| /netbsd-src/external/bsd/file/dist/magic/magdir/ |
| H A D | llvm | 4 # llvm: file(1) magic for LLVM byte-codes
8 0 string llvm LLVM byte-codes, uncompressed
9 0 string llvc0 LLVM byte-codes, null compression
10 0 string llvc1 LLVM byte-codes, gzip compression
11 0 string llvc2 LLVM byte-codes, bzip2 compression
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/hcrypto/ |
| H A D | dh.c | 259 DH_check_pubkey(const DH *dh, const BIGNUM *pub_key, int *codes) in DH_check_pubkey() argument
264 *codes = 0; in DH_check_pubkey()
287 *codes |= DH_CHECK_PUBKEY_TOO_SMALL; in DH_check_pubkey()
296 *codes |= DH_CHECK_PUBKEY_TOO_LARGE; in DH_check_pubkey()
315 *codes |= DH_CHECK_PUBKEY_TOO_SMALL; in DH_check_pubkey()
364 int codes; in DH_compute_key() local
371 if (!DH_check_pubkey(dh, peer_pub_key, &codes) || codes != 0) in DH_compute_key()
|
| /netbsd-src/external/bsd/libarchive/dist/libarchive/ |
| H A D | archive_write_add_filter.c | 41 struct { int code; int (*setter)(struct archive *); } codes[] = variable
64 for (i = 0; codes[i].code != -1; i++) { in archive_write_add_filter()
65 if (code == codes[i].code) in archive_write_add_filter()
66 return ((codes[i].setter)(a)); in archive_write_add_filter()
|
| H A D | archive_write_set_format.c | 42 struct { int code; int (*setter)(struct archive *); } codes[] = variable
73 for (i = 0; codes[i].code != 0; i++) { in archive_write_set_format()
74 if (code == codes[i].code) in archive_write_set_format()
75 return ((codes[i].setter)(a)); in archive_write_set_format()
|
| /netbsd-src/external/gpl3/binutils/dist/zlib/doc/ |
| H A D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| H A D | txtvsbin.txt | 59 The first observation is that, although the full range of 7-bit codes
62 widely-used, almost universally-portable control codes are 9 (TAB),
63 10 (LF) and 13 (CR). There are a few more control codes that are
66 codes are rarely (if ever) used alone, without being accompanied by
72 detection schemes observe the presence of non-ASCII codes from the range
75 contain both control characters and codes from the upper range. On the
87 one or more block-listed codes, either by mistake or by peculiar design
89 of block-listed codes would provide an increased recall (i.e. more true
|
| /netbsd-src/external/gpl3/binutils.old/dist/zlib/doc/ |
| H A D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| H A D | txtvsbin.txt | 59 The first observation is that, although the full range of 7-bit codes
62 widely-used, almost universally-portable control codes are 9 (TAB),
63 10 (LF) and 13 (CR). There are a few more control codes that are
66 codes are rarely (if ever) used alone, without being accompanied by
72 detection schemes observe the presence of non-ASCII codes from the range
75 contain both control characters and codes from the upper range. On the
87 one or more block-listed codes, either by mistake or by peculiar design
89 of block-listed codes would provide an increased recall (i.e. more true
|
| /netbsd-src/external/gpl3/gdb.old/dist/zlib/doc/ |
| H A D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| /netbsd-src/external/gpl3/gdb/dist/zlib/doc/ |
| H A D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| H A D | txtvsbin.txt | 59 The first observation is that, although the full range of 7-bit codes
62 widely-used, almost universally-portable control codes are 9 (TAB),
63 10 (LF) and 13 (CR). There are a few more control codes that are
66 codes are rarely (if ever) used alone, without being accompanied by
72 detection schemes observe the presence of non-ASCII codes from the range
75 contain both control characters and codes from the upper range. On the
87 one or more block-listed codes, either by mistake or by peculiar design
89 of block-listed codes would provide an increased recall (i.e. more true
|
| /netbsd-src/common/dist/zlib/doc/ |
| H A D | rfc1951.txt | 81 3.2.5. Compressed blocks (length and distance codes) ...... 11
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
296 * Data elements other than Huffman codes are packed
299 * Huffman codes are packed starting with the most-
307 elements in the correct MSB-to-LSB order and Huffman codes in
316 alphabet by bit sequences (codes), one code for each symbol, in
361 using the fewest bits of any possible prefix codes for that
364 information on Huffman codes.)
366 Note that in the "deflate" format, the Huffman codes for the
[all …]
|
| H A D | txtvsbin.txt | 59 The first observation is that, although the full range of 7-bit codes
62 widely-used, almost universally-portable control codes are 9 (TAB),
63 10 (LF) and 13 (CR). There are a few more control codes that are
66 codes are rarely (if ever) used alone, without being accompanied by
72 detection schemes observe the presence of non-ASCII codes from the range
75 contain both control characters and codes from the upper range. On the
87 one or more block-listed codes, either by mistake or by peculiar design
89 of block-listed codes would provide an increased recall (i.e. more true
|
| /netbsd-src/crypto/external/bsd/openssl/dist/crypto/err/ |
| H A D | README.md | 14 add all error codes used in the library to `xxx.h`.
37 generation script as the point to place new error codes, any text
46 Adding new error codes
49 Instead of manually adding error codes into `crypto/err/openssl.txt`,
51 The target will process relevant sources and generate error codes for
52 any *used* error codes.
|
| /netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/ |
| H A D | ERR_GET_LIB.pod | 6 - get information from error codes
33 B<ERR_R_...> reason codes such as B<ERR_R_MALLOC_FAILURE> are globally
34 unique. However, when checking for sub-library specific reason codes,
48 codes. Error codes are subject to change at any time (even in patch releases of
50 flow decisions if it is explicitly documented as such. New failure codes may
|
| H A D | DH_generate_parameters.pod | 21 int DH_check(DH *dh, int *codes);
22 int DH_check_params(DH *dh, int *codes);
67 The value of B<*codes> is updated with any problems found.
68 If B<*codes> is zero then no problems were found, otherwise the
96 value of B<*codes> is updated with any problems found. If B<*codes> is zero then
131 If 0 is returned or B<*codes> is set to a nonzero value the supplied
151 The error codes can be obtained by L<ERR_get_error(3)>.
|
| /netbsd-src/external/bsd/nvi/dist/cl/ |
| H A D | cl_bsd.c | 244 static const char codes[] = { variable
262 static const char codes[] = { variable
312 mykeyname[1] = codes[n];
318 mykeyname[1] = codes[n];
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/ |
| H A D | DH_generate_parameters.pod | 17 int DH_check(DH *dh, int *codes);
18 int DH_check_params(DH *dh, int *codes);
58 The value of B<*codes> is updated with any problems found.
59 If B<*codes> is zero then no problems were found, otherwise the
79 value of B<*codes> is updated with any problems found. If B<*codes> is zero then
130 The error codes can be obtained by L<ERR_get_error(3)>.
|
| H A D | ERR_GET_LIB.pod | 6 - get information from error codes
32 reason codes are unique within each sub-library. Note that different
36 B<ERR_R_...> reason codes such as B<ERR_R_MALLOC_FAILURE> are globally
37 unique. However, when checking for sub-library specific reason codes,
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/wind/ |
| H A D | gen-punycode-examples.py | 70 codes = [] variable
74 codes.extend(m.group(1).split(' '))
78 cases.append([codes, m.group(1), desc])
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | read-rtl.c | 144 static struct iterator_group modes, codes, ints, substs; variable
823 htab_traverse (codes.iterators, add_current_iterators, NULL); in apply_iterators()
951 codes.attrs = htab_create (13, leading_string_hash, leading_string_eq_p, 0); in initialize_iterators()
952 codes.iterators = htab_create (13, leading_string_hash, in initialize_iterators()
954 codes.type = "rtx_code"; in initialize_iterators()
955 codes.find_builtin = find_code; in initialize_iterators()
956 codes.apply_iterator = apply_code_iterator; in initialize_iterators()
957 codes.get_c_token = get_code_token; in initialize_iterators()
991 lower = add_mapping (&codes, codes.attrs, "code"); in initialize_iterators()
992 upper = add_mapping (&codes, codes.attrs, "CODE"); in initialize_iterators()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | read-rtl.cc | 138 static struct iterator_group modes, codes, ints, substs; variable
889 htab_traverse (codes.iterators, add_current_iterators, NULL); in apply_iterators()
1017 codes.attrs = htab_create (13, leading_string_hash, leading_string_eq_p, 0); in initialize_iterators()
1018 codes.iterators = htab_create (13, leading_string_hash, in initialize_iterators()
1020 codes.type = "rtx_code"; in initialize_iterators()
1021 codes.find_builtin = find_code; in initialize_iterators()
1022 codes.apply_iterator = apply_code_iterator; in initialize_iterators()
1023 codes.get_c_token = get_code_token; in initialize_iterators()
1057 lower = add_mapping (&codes, codes.attrs, "code"); in initialize_iterators()
1058 upper = add_mapping (&codes, codes.attrs, "CODE"); in initialize_iterators()
[all …]
|
| /netbsd-src/external/gpl3/gdb/dist/zlib/ |
| H A D | inftrees.c | 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
109 for (sym = 0; sym < codes; sym++)
146 for (sym = 0; sym < codes; sym++)
|
| /netbsd-src/external/gpl3/binutils.old/dist/zlib/ |
| H A D | inftrees.c | 32 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
35 unsigned codes;
109 for (sym = 0; sym < codes; sym++)
146 for (sym = 0; sym < codes; sym++)
|