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

12

/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_write_add_filter.c40 /* A table that maps filter codes to functions. */
42 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon552
65 for (i = 0; codes[i].code != -1; i++) {
66 if (code == codes[i].code)
67 return ((codes[i].setter)(a));
H A Darchive_write_set_format.c41 /* A table that maps format codes to functions. */
43 struct { int code; int (*setter)(struct archive *); } codes[] = variable in typeref:struct:__anon12
74 for (i = 0; codes[i].code != 0; i++) {
75 if (code == codes[i].code)
76 return ((codes[i].setter)(a));
/freebsd-11-stable/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-11-stable/sys/contrib/zlib/
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 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.h72 Read deflate codes in fixed or dynamic block:
109 code const FAR *lencode; /* starting table for length/literal codes */
110 code const FAR *distcode; /* starting table for distance codes */
118 code FAR *next; /* next available space in codes[] */
121 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
/freebsd-11-stable/crypto/heimdal/lib/wind/
H A Dgen-punycode-examples.py71 codes = [] variable
75 codes.extend(string.split(m.group(1), ' '))
79 cases.append([codes, m.group(1), desc])
/freebsd-11-stable/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...]
/freebsd-11-stable/contrib/com_err/
H A Dcompile_et.h61 extern struct error_code *codes;
H A Dcompile_et.c66 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 Dparse.y134 APPEND(codes, ec);
/freebsd-11-stable/crypto/heimdal/lib/com_err/
H A Dcompile_et.h64 extern struct error_code *codes;
H A Dcompile_et.c66 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 Dparse.y134 APPEND(codes, ec);
/freebsd-11-stable/contrib/less/
H A Dmkutable66 my $codes = $fields[0];
67 if ($codes =~ /(\w+)\.\.(\w+)/) {
71 $lo_code = $hi_code = hex $codes;
/freebsd-11-stable/contrib/apr-util/include/
H A Dapr_ldap_init.h52 #error The security return codes must be added to support this LDAP toolkit.
/freebsd-11-stable/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-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/
H A DAnsiTerminal.h105 auto codes = llvm::makeArrayRef(g_color_tokens); local
122 for (const auto &code : codes) {
/freebsd-11-stable/sys/dev/gpio/
H A Dgpiokeys_codes.c34 #include <gnu/dts/include/dt-bindings/input/linux-event-codes.h>
/freebsd-11-stable/crypto/openssl/util/
H A Dmkerr.pl64 fact if any error or function codes have been added/removed.
70 function codes:
79 and function codes as extracted from the scanned header files;
155 # Scan each header file in turn and make a list of error codes
249 # Scan function and reason codes and store them: keep a note of the
305 print STDERR "!! ERROR: SSL error codes 1000+ are reserved for alerts.\n";
314 # Scan each C source file and look for function and reason codes
316 # reason codes: basically anything consisting of all upper case and
322 # Store all function and reason codes found in %ufcodes and %urcodes
367 print STDERR "$lib:\t\tNo new error codes\
[all...]

Completed in 373 milliseconds

12