| /external/grpc-grpc/src/ruby/lib/grpc/ |
| D | errors.rb | 55 codes = {}
56 codes[OK] = Ok
57 codes[CANCELLED] = Cancelled
58 codes[UNKNOWN] = Unknown
59 codes[INVALID_ARGUMENT] = InvalidArgument
60 codes[DEADLINE_EXCEEDED] = DeadlineExceeded
61 codes[NOT_FOUND] = NotFound
62 codes[ALREADY_EXISTS] = AlreadyExists
63 codes[PERMISSION_DENIED] = PermissionDenied
64 codes[UNAUTHENTICATED] = Unauthenticated
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/src/core/lib/slice/ |
| D | b64.cc | 130 static void decode_one_char(const unsigned char* codes, unsigned char* result, in decode_one_char() argument
132 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 2) | in decode_one_char()
133 (static_cast<uint32_t>(codes[1]) >> 4); in decode_one_char()
137 static void decode_two_chars(const unsigned char* codes, unsigned char* result, in decode_two_chars() argument
139 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 10) | in decode_two_chars()
140 (static_cast<uint32_t>(codes[1]) << 4) | in decode_two_chars()
141 (static_cast<uint32_t>(codes[2]) >> 2); in decode_two_chars()
146 static int decode_group(const unsigned char* codes, size_t num_codes, in decode_group() argument
156 decode_one_char(codes, result, result_offset); in decode_group()
160 decode_two_chars(codes, result, result_offset); in decode_group()
[all …]
|
| /external/grpc-grpc/src/core/lib/slice/ |
| D | b64.cc | 131 static void decode_one_char(const unsigned char* codes, unsigned char* result, in decode_one_char() argument
133 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 2) | in decode_one_char()
134 (static_cast<uint32_t>(codes[1]) >> 4); in decode_one_char()
138 static void decode_two_chars(const unsigned char* codes, unsigned char* result, in decode_two_chars() argument
140 uint32_t packed = (static_cast<uint32_t>(codes[0]) << 10) | in decode_two_chars()
141 (static_cast<uint32_t>(codes[1]) << 4) | in decode_two_chars()
142 (static_cast<uint32_t>(codes[2]) >> 2); in decode_two_chars()
147 static int decode_group(const unsigned char* codes, size_t num_codes, in decode_group() argument
157 decode_one_char(codes, result, result_offset); in decode_group()
161 decode_two_chars(codes, result, result_offset); in decode_group()
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/contrib/infback9/ |
| D | 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(type, lens, codes, table, bits, work) in inflate_table9() argument
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 */
64 static const unsigned short lext[31] = { /* Length codes 257..285 extra */
68 static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
72 static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
[all …]
|
| /external/python/cpython2/Modules/zlib/ |
| D | 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) in inflate_table() argument
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 …]
|
| /external/rust/crates/libz-sys/src/zlib/ |
| D | 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) in inflate_table() argument
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 …]
|
| /external/zlib/ |
| D | 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) in inflate_table() argument
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 …]
|
| /external/rust/crates/libz-sys/src/zlib/contrib/puff/ |
| D | 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 of
[all …]
|
| /external/libwebsockets/win32port/zlib/ |
| D | 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) in inflate_table() argument
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 …]
|
| /external/rust/crates/libz-sys/src/zlib/examples/ |
| D | enough.c | 2 * all possible valid and complete Huffman codes, subject to a length limit.
12 As inflate does, decrease root for short codes
23 Examine all possible Huffman codes for a given number of symbols and a
25 inflate. Only complete Huffman codes are counted.
27 Two codes are considered distinct if the vectors of the number of codes per
30 the bit values to the codes (i.e. only canonical codes are counted).
44 speed. There is a single first-level table to decode codes up to root bits
46 has 1 << root entries and is indexed by the next root bits of input. Codes
53 codes. Each subsequent root-bit prefix then has its own sub-table. The
55 incrementally as the number of codes at each bit length is populated. When
[all …]
|
| /external/rust/crates/libz-sys/src/zlib-ng/ |
| D | 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 Z_INTERNAL zng_inflate_table(codetype type, uint16_t *lens, unsigned codes, in zng_inflate_table() argument
40 int left; /* number of prefix codes available */ in zng_inflate_table()
52 uint16_t count[MAXBITS+1]; /* number of codes of each length */ in zng_inflate_table()
54 static const uint16_t lbase[31] = { /* Length codes 257..285 base */ in zng_inflate_table()
57 static const uint16_t lext[31] = { /* Length codes 257..285 extra */ in zng_inflate_table()
60 static const uint16_t dbase[32] = { /* Distance codes 0..29 base */ in zng_inflate_table()
64 static const uint16_t dext[32] = { /* Distance codes 0..29 extra */ in zng_inflate_table()
71 code lengths are lens[0..codes-1]. Each length corresponds to the in zng_inflate_table()
[all …]
|
| /external/fastrpc/inc/ |
| D | AEEStdErr.h | 34 // Basic Error Codes
229 Error Codes
232 This topic lists the categories of error codes that Brew MP returns. The topic for each
240 The categories of error codes include: ~
243 AddrBook error codes ~
244 AddrInfo error codes ~
247 Basic AEE Error Codes ~
248 Database error codes ~
249 dbc Error Codes ~
250 DNS Resolver error codes ~
[all …]
|
| /external/freetype/src/gzip/ |
| D | infblock.c | 31 codes exist, they are coded using one bit each (0 and 1).
32 5. There is no way of sending zero distance codes--a dummy must be
34 store blocks with no distance codes, but this was discovered to be
36 zero distance codes, which is sent as one code of zero bits in
38 6. There are up to 286 literal/length codes. Code 256 represents the
40 288 codes just to fill out the Huffman codes. Codes 286 and 287
42 defined for them. Similarily, there are up to 30 distance codes.
43 However, static trees define 32 codes (all 5 bits) to fill out the
44 Huffman codes, but the last two had better not show up in the data.
48 literal codes sent minus 257.
[all …]
|
| D | inftrees.c | 32 uInt, /* number of codes */
33 uInt, /* number of "simple" codes */
34 const uIntf *, /* list of base values for non-simple codes */
35 const uIntf *, /* list of extra bits for non-simple codes */
43 local const uInt cplens[31] = { /* Copy lengths for literal codes 257..285 */
47 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
50 local const uInt cpdist[30] = { /* Copy offsets for distance codes 0..29 */
54 local const uInt cpdext[30] = { /* Extra bits for distance codes */
64 is not very long. The most common codes are necessarily the
65 shortest codes, so those codes dominate the decoding time, and hence
[all …]
|
| /external/python/cpython3/Tools/ssl/ |
| D | make_ssl_data.py | 23 codes = []
31 codes.append((code, (libcode, name, num)))
32 assert codes, f"no codes found in {h_file}"
33 return codes
57 # Read codes from libraries
64 # Merge with existing codes (in case some old codes disappeared).
65 codes = {} variable
70 # Only keep it if the numeric codes weren't reused
72 codes[errcode] = libcode, errname, errnum
73 codes.update(dict(new_codes))
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | unicode.py | 136 The reader calls doline(codes, fields) for each entry in the table.
190 codes = _URange(fields[0])
196 if (len(codes) != 1 or codes[0] <= first or
200 codes = range(first, codes[0] + 1)
203 fields[0] = "%04X..%04X" % (codes[0], codes[-1])
208 if len(codes) != 1:
211 first = codes[0]
214 doline(codes, fields)
242 def DoLine(codes, fields): argument
248 togroup.setdefault(lower, [lower]).extend(codes)
[all …]
|
| /external/rust/crates/libz-sys/src/zlib/doc/ |
| 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 …]
|
| /external/rust/crates/libz-sys/src/zlib-ng/doc/ |
| 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 …]
|
| /external/geonames/export/dump/ |
| D | readme.txt | 21 …nateNamesV2.zip : alternate names with language codes and geonameId, file with iso language co…
24 …or administrative subdivision 'admin2 code' (UTF8), Format : concatenated codes <tab>name <tab> as…
25 iso-languagecodes.txt : iso 639 language codes, as used for alternate names in file alternateNam…
26 featureCodes.txt : name and description for feature classes and feature codes
28 countryInfo.txt : country information : iso codes, fips codes, languages, capital ,...
38 …pe. The type 'ADM' stands for the admin hierarchy modeled by the admin1-4 codes. The other entries…
50 feature class : see http://www.geonames.org/export/codes.html, char(1)
51 feature code : see http://www.geonames.org/export/codes.html, varchar(10)
53 cc2 : alternate country codes, comma separated, ISO-3166 2-letter country code, 200 c…
66 Most adm1 are FIPS codes. ISO codes are used for US, CH, BE and ME. UK and Greece are using an addi…
[all …]
|
| /external/python/cpython2/Tools/ssl/ |
| D | make_ssl_data.py | 22 codes = []
30 codes.append((code, (libcode, name, num)))
31 return codes
45 # Read codes from libraries
53 # Merge with existing codes (in case some old codes disappeared).
54 codes = {} variable
59 # Only keep it if the numeric codes weren't reused
61 codes[errcode] = libcode, errname, errnum
62 codes.update(dict(new_codes))
78 for errcode, (libcode, name, num) in sorted(codes.items()):
|
| /external/llvm-project/llvm/test/tools/llvm-objdump/COFF/ |
| D | win64-unwind-data.test | 15 OBJ-NEXT: Number of Codes: 8
18 OBJ-NEXT: Unwind Codes:
32 OBJ-NEXT: Number of Codes: 0
41 OBJ-NEXT: Number of Codes: 0
50 OBJ-NEXT: Number of Codes: 6
52 OBJ-NEXT: Unwind Codes:
64 EXE-NEXT: Number of Codes: 8
67 EXE-NEXT: Unwind Codes:
82 EXE-NEXT: Number of Codes: 0
92 EXE-NEXT: Number of Codes: 0
[all …]
|
| /external/llvm/test/tools/llvm-objdump/ |
| D | win64-unwind-data.test | 15 OBJ-NEXT: Number of Codes: 8
18 OBJ-NEXT: Unwind Codes:
32 OBJ-NEXT: Number of Codes: 0
41 OBJ-NEXT: Number of Codes: 0
50 OBJ-NEXT: Number of Codes: 6
52 OBJ-NEXT: Unwind Codes:
64 EXE-NEXT: Number of Codes: 8
67 EXE-NEXT: Unwind Codes:
82 EXE-NEXT: Number of Codes: 0
92 EXE-NEXT: Number of Codes: 0
[all …]
|
| /external/icu/libandroidicu/include/unicode/ |
| D | uregion.h | 22 * * Two-letter codes defined by ISO 3166-1, with special LDML treatment of certain private-use or
23 * reserved codes;
24 * * A subset of 3-digit numeric codes defined by UN M.49.
25 * URegion objects can also provide mappings to and from additional codes. There are different types
29 * selected economic and other grouping" as defined in UN M.49. These are typically 3-digit codes,
30 * but contain some 2-letter codes for LDML extensions, such as "QO" for Outlying Oceania.
35 * TERRITORY - A Region that is not a Macroregion. These are typically codes for countries, but also
38 * codes. The codes are typically 2-letter codes aligned with ISO 3166, but BCP47 allows for the use
39 * of 3-digit codes in the future.
44 * DEPRECATED - Region codes that have been defined in the past but are no longer in modern usage,
[all …]
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | uregion.h | 22 * * Two-letter codes defined by ISO 3166-1, with special LDML treatment of certain private-use or
23 * reserved codes;
24 * * A subset of 3-digit numeric codes defined by UN M.49.
25 * URegion objects can also provide mappings to and from additional codes. There are different types
29 * selected economic and other grouping" as defined in UN M.49. These are typically 3-digit codes,
30 * but contain some 2-letter codes for LDML extensions, such as "QO" for Outlying Oceania.
35 * TERRITORY - A Region that is not a Macroregion. These are typically codes for countries, but also
38 * codes. The codes are typically 2-letter codes aligned with ISO 3166, but BCP47 allows for the use
39 * of 3-digit codes in the future.
44 * DEPRECATED - Region codes that have been defined in the past but are no longer in modern usage,
[all …]
|
| /external/icu/libicu/cts_headers/unicode/ |
| D | uregion.h | 22 * * Two-letter codes defined by ISO 3166-1, with special LDML treatment of certain private-use or
23 * reserved codes;
24 * * A subset of 3-digit numeric codes defined by UN M.49.
25 * URegion objects can also provide mappings to and from additional codes. There are different types
29 * selected economic and other grouping" as defined in UN M.49. These are typically 3-digit codes,
30 * but contain some 2-letter codes for LDML extensions, such as "QO" for Outlying Oceania.
35 * TERRITORY - A Region that is not a Macroregion. These are typically codes for countries, but also
38 * codes. The codes are typically 2-letter codes aligned with ISO 3166, but BCP47 allows for the use
39 * of 3-digit codes in the future.
44 * DEPRECATED - Region codes that have been defined in the past but are no longer in modern usage,
[all …]
|