/external/valgrind/drd/scripts/ |
H A 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/Makefile 68 --- orig/splash2/codes/apps/raytrace/rltotiff/Makefile 2008-05-25 10:38:52.000000000 +0200 69 +++ splash2/codes/app [all...] |
/external/ltp/testcases/commands/su/ |
H A D | su01_s1 | 139 set codes [wait] 140 set pid [lindex $codes 0] 141 set exit_code [lindex $codes 3] 200 set codes [wait] 201 set pid [lindex $codes 0] 202 set exit_code [lindex $codes 3] 238 set codes [wait] 239 set pid [lindex $codes 0] 240 set exit_code [lindex $codes 3] 292 set codes [wai [all...] |
/external/python/cpython2/Tools/ssl/ |
H A 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 [all...] |
/external/python/cpython3/Tools/ssl/ |
H A 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 [all...] |
/external/brotli/csharp/org/brotli/dec/ |
H A D | HuffmanTreeGroup.cs | 15 internal int[] codes;
field in class:Org.Brotli.Dec.HuffmanTreeGroup 19 /// <see cref="codes"/>
27 /// <param name="n">number of Huffman codes</param>
31 group.codes = new int[n * Org.Brotli.Dec.Huffman.HuffmanMaxTableSize];
45 Org.Brotli.Dec.Decode.ReadHuffmanCode(group.alphabetSize, group.codes, next, br);
|
/external/icu/icu4c/source/tools/toolutil/ |
H A D | collationinfo.h | 31 static void printReorderRanges(const CollationData &data, const int32_t *codes, int32_t length);
|
/external/python/cpython2/Modules/zlib/ |
H A D | 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. 61 unsigned codes, code FAR * FAR *table,
|
/external/python/cpython3/Modules/zlib/ |
H A D | 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. 61 unsigned codes, code FAR * FAR *table,
|
/external/syslinux/com32/lib/zlib/ |
H A D | 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. 61 unsigned codes, code FAR * FAR *table,
|
/external/zlib/src/contrib/infback9/ |
H A D | 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
|
H A D | 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. 60 unsigned codes, code FAR * FAR *table,
|
/external/zlib/src/ |
H A D | 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. 61 unsigned codes, code FAR * FAR *table,
|
/external/libexif/libexif/ |
H A D | exif-log.c | 42 } codes[] = { variable in typeref:struct:__anon11431 57 for (i = 0; codes[i].title; i++) if (codes[i].code == code) break; 58 return _(codes[i].title); 66 for (i = 0; codes[i].message; i++) if (codes[i].code == code) break; 67 return _(codes[i].message);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
H A D | CollationSettings.java | 138 int[] codes; 140 codes = codesAndRanges; 142 // TODO: Java 6: Arrays.copyOf(codes, codesLength); 143 codes = new int[codesLength]; 144 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength); 157 reorderCodes = codes; 179 setReordering(data, codes); 182 public void setReordering(CollationData data, int[] codes) { argument 183 if(codes.length == 0 || (codes 240 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationSettings.java | 136 int[] codes; 138 codes = codesAndRanges; 140 // TODO: Java 6: Arrays.copyOf(codes, codesLength); 141 codes = new int[codesLength]; 142 System.arraycopy(codesAndRanges, 0, codes, 0, codesLength); 155 reorderCodes = codes; 177 setReordering(data, codes); 180 public void setReordering(CollationData data, int[] codes) { argument 181 if(codes.length == 0 || (codes 238 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument [all...] |
/external/fonttools/Lib/fontTools/ |
H A D | unicode.py | 22 self.codes = _makeunicodes(f) 26 return self.codes[charCode]
|
/external/fonttools/Tools/fontTools/ |
H A D | unicode.py | 22 self.codes = _makeunicodes(f) 26 return self.codes[charCode]
|
/external/sl4a/ScriptingLayerForAndroid/src/de/mud/terminal/ |
H A D | VDUInput.java | 68 * Override the standard key codes used by the terminal emulation. 69 * @param codes a properties object containing key code definitions 71 void setKeyCodes(Properties codes); argument
|
/external/webp/src/utils/ |
H A D | huffman_encode_utils.h | 26 uint8_t extra_bits; // extra bits for escape codes 29 // Struct to represent the tree codes (depth and bits array). 33 uint16_t* codes; // Symbol Codes. member in struct:__anon30462
|
/external/pcre/dist2/src/ |
H A D | pcre2_serialize.c | 42 a sequence of compiled codes. */ 72 pcre2_serialize_encode(const pcre2_code **codes, int32_t number_of_codes, argument 87 if (codes == NULL || serialized_bytes == NULL || serialized_size == NULL) 98 if (codes[i] == NULL) return PCRE2_ERROR_NULL; 99 re = (const pcre2_real_code *)(codes[i]); 129 re = (const pcre2_real_code *)(codes[i]); 145 pcre2_serialize_decode(pcre2_code **codes, int32_t number_of_codes, argument 159 if (data == NULL || codes == NULL) return PCRE2_ERROR_NULL; 204 memctl->free(codes[j], memctl->memory_data); 205 codes[ [all...] |
/external/python/cpython2/Tools/world/ |
H A D | world | 3 """world -- Print mappings between country names and DNS country codes. 37 Country codes are maintained by the RIPE Network Coordination Centre, 60 codes and numbers, which are also provided in the standard format 240 codes = nameorgs.keys() 241 codes.sort() 242 for code in codes: 246 codes = countries.keys() 247 codes.sort() 248 for code in codes:
|
/external/curl/docs/cmdline-opts/ |
H A D | fail.d | 13 response codes will slip through, especially when authentication is involved 14 (response codes 401 and 407).
|
/external/pdfium/core/fpdfapi/font/ |
H A D | cpdf_cmap.cpp | 184 int CheckFourByteCodeRange(uint8_t* codes, argument 193 if (codes[iChar] < ranges[seg].m_Lower[iChar] || 194 codes[iChar] > ranges[seg].m_Upper[iChar]) { 213 uint8_t codes[4]; 214 codes[0] = codes[1] = 0x00; 215 codes[2] = static_cast<uint8_t>(charcode >> 8 & 0xFF); 216 codes[3] = static_cast<uint8_t>(charcode); 225 if (codes[offset + iChar] < ranges[iSeg].m_Lower[iChar] || 226 codes[offse 359 uint8_t codes[4]; local [all...] |
/external/guava/guava-tests/test/com/google/common/hash/ |
H A D | AbstractNonStreamingHashFunctionTest.java | 49 HashCode[] codes = new HashCode[hashers.size()]; 51 codes[i] = hashers.get(i).hash(); 53 for (int i = 1; i < codes.length; i++) { 54 assertEquals(codes[i - 1], codes[i]);
|
/external/tensorflow/tensorflow/core/lib/strings/ |
H A D | base64.cc | 61 Status DecodeThreeChars(const char* codes, char* result) { argument 62 const uint32 packed = (Convert(codes[0]) << 18) | (Convert(codes[1]) << 12) | 63 (Convert(codes[2]) << 6) | (Convert(codes[3]));
|