| /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:__anon4779
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:__anon4783
73 for (i = 0; codes[i].code != 0; i++) {
74 if (code == codes[i].code)
75 return ((codes[i].setter)(a));
|
| /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
|
| inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 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 852, and "enough 32 6 15" for distance codes returns 594. The
54 CODES,
60 unsigned codes, code FAR * FAR *table,
|
| inftree9.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int inflate_table9(codetype type, unsigned short FAR *lens, unsigned codes,
41 int left; /* number of prefix codes available */
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */
55 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
59 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
63 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
67 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
74 code lengths are lens[0..codes-1]. Each length corresponds to th
[all...] |
| /src/common/dist/zlib/ |
| 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 852, and "enough 30 6 15" for distance codes returns 592. The
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| inftrees.c | 24 The code lengths are lens[0..codes-1]. The result starts at *table,
27 to be generated, CODES, LENS, or DISTS. On return, zero is success,
35 unsigned codes, code FAR * FAR *table,
43 int left; /* number of prefix codes available */
55 unsigned short count[MAXBITS+1]; /* number of codes of each length */
57 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
60 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
63 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
67 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
74 code lengths are lens[0..codes-1]. Each length corresponds to th
[all...] |
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| inftrees.h | 50 CODES,
56 unsigned codes, code FAR * FAR *table,
|
| 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/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
|
| inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 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 852, and "enough 32 6 15" for distance codes returns 594. The
54 CODES,
60 unsigned codes, code FAR * FAR *table,
|
| inftree9.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
32 int inflate_table9(codetype type, unsigned short FAR *lens, unsigned codes,
41 int left; /* number of prefix codes available */
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */
55 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
59 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
63 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
67 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
74 code lengths are lens[0..codes-1]. Each length corresponds to th
[all...] |
| /src/external/gpl3/binutils/dist/zlib/ |
| 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 852, and "enough 30 6 15" for distance codes returns 592. The
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
33 unsigned codes, code FAR * FAR *table,
41 int left; /* number of prefix codes available */
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */
55 static const unsigned short lbase[31] = { /* Length codes 257..285 base */
58 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
61 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
65 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
72 code lengths are lens[0..codes-1]. Each length corresponds to th
[all...] |
| /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
|
| inftree9.h | 39 1446, which is the sum of 852 for literal/length codes and 594 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 32 6 15" for distance codes returns 594.
54 CODES,
60 unsigned codes, code FAR * FAR *table,
|
| /src/external/gpl3/binutils.old/dist/zlib/ |
| 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.
55 CODES,
61 unsigned codes, code FAR * FAR *table,
|
| inftrees.c | 22 The code lengths are lens[0..codes-1]. The result starts at *table,
25 to be generated, CODES, LENS, or DISTS. On return, zero is success,
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 *
[all...] |
| /src/external/bsd/ipf/dist/perl/ |
| plog | 84 # - 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...] |
| /src/external/bsd/less/dist/ |
| mkutable | 67 my $codes = $fields[0];
68 if ($codes =~ /(\w+)\.\.(\w+)/) {
72 $lo_code = $hi_code = hex $codes;
|
| /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/external/gpl2/gettext/dist/gettext-tools/tests/ |
| msgcat-stringtable-1 | 16 /* This is an example of excape codes in the string table, codes */
47 # This is an example of excape codes in the string table, codes
|
| /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/ |
| bidiapi.txt | 9 does not yet support explicit reordering codes that the Unicode BiDi algorithm
|
| /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/external/bsd/tmux/dist/ |
| tty-term.c | 404 code = &term->codes[i];
545 term->codes = xcalloc(tty_term_ncodes(), sizeof *term->codes);
548 /* Fill in codes. */
562 code = &term->codes[j];
678 if (term->codes[i].type == TTYCODE_STRING)
679 free(term->codes[i].value.string);
681 free(term->codes);
775 return (term->codes[code].type != TTYCODE_NONE);
783 if (term->codes[code].type != TTYCODE_STRING
[all...] |
