| /external/valgrind/drd/scripts/ |
| D | download-and-build-splash2.in | 37 diff -ru orig/splash2/codes/apps/radiosity/display.C splash2/codes/apps/radiosity/display.C
38 --- orig/splash2/codes/apps/radiosity/display.C 2008-05-25 10:38:52.000000000 +0200
39 +++ splash2/codes/apps/radiosity/display.C 2008-05-25 10:37:51.000000000 +0200
48 --- orig/splash2/codes/apps/radiosity/Makefile 2008-05-25 10:38:52.000000000 +0200
49 +++ splash2/codes/apps/radiosity/Makefile 2008-05-25 13:05:36.000000000 +0200
67 diff -ru orig/splash2/codes/apps/raytrace/rltotiff/Makefile splash2/codes/apps/raytrace/rltotiff/Ma…
68 --- orig/splash2/codes/apps/raytrace/rltotiff/Makefile 2008-05-25 10:38:52.000000000 +0200
69 +++ splash2/codes/apps/raytrace/rltotiff/Makefile 2008-05-25 10:31:57.000000000 +0200
81 diff -ru orig/splash2/codes/Makefile.config splash2/codes/Makefile.config
82 --- orig/splash2/codes/Makefile.config 2008-05-25 10:38:52.000000000 +0200
[all …]
|
| /external/zlib/src/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/zlib/src/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/zlib/src/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/opencv3/3rdparty/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/src/ |
| 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/pdfium/third_party/zlib_v128/ |
| 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,
35 unsigned codes, in inflate_table() argument
46 int left; /* number of prefix codes available */ in inflate_table()
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
60 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ in inflate_table()
63 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ in inflate_table()
66 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ in inflate_table()
70 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ in inflate_table()
77 code lengths are lens[0..codes-1]. Each length corresponds to the in inflate_table()
[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/regex-re2/re2/ |
| D | make_unicode_groups.py | 30 def MakeRanges(codes): argument
34 for c in codes:
49 # def PrintCodes(type, name, codes):
50 # """Print the codes as an array of type named name."""
52 # for c in codes:
56 def PrintGroup(name, codes): argument
57 """Print the data structures for the group of codes.
62 # Split codes into 16-bit ranges and 32-bit ranges.
63 range16 = MakeRanges([c for c in codes if c < 65536])
64 range32 = MakeRanges([c for c in codes if c >= 65536])
[all …]
|
| D | unicode.py | 132 The reader calls doline(codes, fields) for each entry in the table.
184 codes = _URange(fields[0])
190 if (len(codes) != 1 or codes[0] <= first or
194 codes = range(first, codes[0] + 1)
197 fields[0] = "%04X..%04X" % (codes[0], codes[-1])
202 if len(codes) != 1:
205 first = codes[0]
208 doline(codes, fields)
236 def DoLine(codes, fields): argument
242 togroup.setdefault(lower, [lower]).extend(codes)
[all …]
|
| /external/zlib/src/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/icu/icu4c/source/i18n/unicode/ |
| D | uregion.h | 20 * * Two-letter codes defined by ISO 3166-1, with special LDML treatment of certain private-use or
21 * reserved codes;
22 * * A subset of 3-digit numeric codes defined by UN M.49.
23 * URegion objects can also provide mappings to and from additional codes. There are different types
27 * selected economic and other grouping" as defined in UN M.49. These are typically 3-digit codes,
28 * but contain some 2-letter codes for LDML extensions, such as "QO" for Outlying Oceania.
33 * TERRITORY - A Region that is not a Macroregion. These are typically codes for countries, but also
36 * codes. The codes are typically 2-letter codes aligned with ISO 3166, but BCP47 allows for the use
37 * of 3-digit codes in the future.
42 * DEPRECATED - Region codes that have been defined in the past but are no longer in modern usage,
[all …]
|
| D | ucurr.h | 257 * Select all ISO-4217 currency codes.
262 * Select only ISO-4217 commonly used currency codes.
265 * This does not include fund codes, precious metals and other
266 * various ISO-4217 codes limited to special financial products.
271 * Select ISO-4217 uncommon currency codes.
272 * These codes respresent fund codes, precious metals and other
273 * various ISO-4217 codes limited to special financial products.
279 * Select only deprecated ISO-4217 codes.
280 * These codes are no longer in general public use.
285 * Select only non-deprecated ISO-4217 codes.
[all …]
|
| D | region.h | 31 …* "regions" as "countries" when defining the characteristics of a locale. Region codes There are …
32 * types of region codes that are important to distinguish.
37 * These are typically 3-digit codes, but contain some 2-letter codes, such as the LDML code QO
38 * added for Outlying Oceania. Not all UNM.49 codes are defined in LDML, but most of them are.
43 …* TERRITORY - A Region that is not a Macroregion. These are typically codes for countries, but al…
46 …* codes. The codes are typically 2-letter codes aligned with the ISO 3166 standard, but BCP47 all…
47 * for the use of 3-digit codes in the future.
52 * DEPRECATED - Region codes that have been defined in the past but are no longer in modern usage,
56 …* that a region code has been assigned for it. Some of these are UNM.49 codes that do't fall int…
213 * codes are, any known aliases, and the territory containment data.
|
| /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/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationSettings.java | 134 int[] codes; in aliasReordering() local
136 codes = codesAndRanges; in aliasReordering()
138 // TODO: Java 6: Arrays.copyOf(codes, codesLength); in aliasReordering()
139 codes = new int[codesLength]; in aliasReordering()
140 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength); in aliasReordering()
153 reorderCodes = codes; in aliasReordering()
175 setReordering(data, codes); in aliasReordering()
178 public void setReordering(CollationData data, int[] codes) { in setReordering() argument
179 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE)) { in setReordering()
184 data.makeReorderRanges(codes, rangesList); in setReordering()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | CollationSettings.java | 136 int[] codes; in aliasReordering() local
138 codes = codesAndRanges; in aliasReordering()
140 // TODO: Java 6: Arrays.copyOf(codes, codesLength); in aliasReordering()
141 codes = new int[codesLength]; in aliasReordering()
142 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength); in aliasReordering()
155 reorderCodes = codes; in aliasReordering()
177 setReordering(data, codes); in aliasReordering()
180 public void setReordering(CollationData data, int[] codes) { in setReordering() argument
181 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE)) { in setReordering()
186 data.makeReorderRanges(codes, rangesList); in setReordering()
[all …]
|
| /external/chromium-trace/catapult/third_party/Paste/paste/ |
| D | errordocument.py | 5 Middleware to display error documents for certain status codes
8 specified status codes and internally forward the request to an appropriate
20 def forward(app, codes): argument
30 ``codes``
31 A dictionary of integer status codes and the URL to be displayed
36 ``forward`` middleware to catch all 404 status codes and display the page
41 app = forward(app, codes={404:'/error404.html'})
44 for code in codes:
46 raise TypeError('All status codes should be type int. '
49 def error_codes_mapper(code, message, environ, global_conf, codes): argument
[all …]
|
| /external/mesa3d/src/glx/ |
| D | dri2.c | 65 DRI2Error(Display *display, xError *err, XExtCodes *codes, int *ret_code);
95 switch ((wire->u.u.type & 0x7f) - info->codes->first_event) { in DRI2WireToEvent()
178 DRI2Error(Display *display, xError *err, XExtCodes *codes, int *ret_code) in DRI2Error() argument
180 if (err->majorCode == codes->major_opcode && in DRI2Error()
188 if (err->majorCode == codes->major_opcode && in DRI2Error()
195 if (err->majorCode == codes->major_opcode && in DRI2Error()
211 *eventBase = info->codes->first_event; in DRI2QueryExtension()
212 *errorBase = info->codes->first_error; in DRI2QueryExtension()
231 req->reqType = info->codes->major_opcode; in DRI2QueryVersion()
259 XESetWireToEvent (dpy, info->codes->first_event + i, DRI2WireToEvent); in DRI2QueryVersion()
[all …]
|
| /external/opencv3/3rdparty/libwebp/enc/ |
| D | vp8l.c | 191 // Iterate over all histograms and get the aggregate number of codes used. in GetHuffBitLengthsAndCodes()
194 HuffmanTreeCode* const codes = &huffman_codes[5 * i]; in GetHuffBitLengthsAndCodes() local
199 codes[k].num_symbols = num_symbols; in GetHuffBitLengthsAndCodes()
204 // Allocate and Set Huffman codes. in GetHuffBitLengthsAndCodes()
206 uint16_t* codes; in GetHuffBitLengthsAndCodes() local
209 sizeof(*lengths) + sizeof(*codes)); in GetHuffBitLengthsAndCodes()
214 codes = (uint16_t*)mem_buf; in GetHuffBitLengthsAndCodes()
215 lengths = (uint8_t*)&codes[total_length_size]; in GetHuffBitLengthsAndCodes()
218 huffman_codes[i].codes = codes; in GetHuffBitLengthsAndCodes()
220 codes += bit_length; in GetHuffBitLengthsAndCodes()
[all …]
|
| /external/webp/src/enc/ |
| D | vp8l.c | 435 // Iterate over all histograms and get the aggregate number of codes used. in GetHuffBitLengthsAndCodes()
438 HuffmanTreeCode* const codes = &huffman_codes[5 * i]; in GetHuffBitLengthsAndCodes() local
443 codes[k].num_symbols = num_symbols; in GetHuffBitLengthsAndCodes()
448 // Allocate and Set Huffman codes. in GetHuffBitLengthsAndCodes()
450 uint16_t* codes; in GetHuffBitLengthsAndCodes() local
453 sizeof(*lengths) + sizeof(*codes)); in GetHuffBitLengthsAndCodes()
456 codes = (uint16_t*)mem_buf; in GetHuffBitLengthsAndCodes()
457 lengths = (uint8_t*)&codes[total_length_size]; in GetHuffBitLengthsAndCodes()
460 huffman_codes[i].codes = codes; in GetHuffBitLengthsAndCodes()
462 codes += bit_length; in GetHuffBitLengthsAndCodes()
[all …]
|
| /external/selinux/libsepol/include/sepol/ |
| D | errcodes.h | 13 /* These first error codes are defined for compatibility with
15 * codes that don't map to system error codes should be defined
16 * outside of the range of system error codes.
22 /* Error codes that map to system error codes */
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| D | huffman.c | 178 // Get Huffman codes from the code lengths. in HuffmanTreeBuildImplicit()
179 int* const codes = in HuffmanTreeBuildImplicit() local
180 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes)); in HuffmanTreeBuildImplicit()
181 if (codes == NULL) goto End; in HuffmanTreeBuildImplicit()
183 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) { in HuffmanTreeBuildImplicit()
190 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) { in HuffmanTreeBuildImplicit()
197 free(codes); in HuffmanTreeBuildImplicit()
206 const int* const codes, in HuffmanTreeBuildExplicit() argument
214 assert(codes != NULL); in HuffmanTreeBuildExplicit()
222 if (codes[i] != NON_EXISTENT_SYMBOL) { in HuffmanTreeBuildExplicit()
[all …]
|
| /external/zlib/src/contrib/blast/ |
| D | blast.c | 112 * - The codes as stored in the compressed data are bit-reversed relative to
113 * a simple integer ordering of codes of the same lengths. Hence below the
118 * - The first code for the shortest length is all ones. Subsequent codes of
130 int count; /* number of codes of length len */ in decode()
134 short *next; /* next number of codes */ in decode()
167 return -9; /* ran out of codes */ in decode()
176 * codes. Those tables are the number of codes of each length, and the symbols
185 * codes past the end of the incomplete lengths.
191 int left; /* number of possible codes left of current length */ in construct()
207 /* count number of codes of each length */ in construct()
[all …]
|