| /external/dropbear/libtomcrypt/src/misc/base64/ |
| base64_encode.c | 21 static const char *codes = variable
51 *p++ = codes[(in[0] >> 2) & 0x3F];
52 *p++ = codes[(((in[0] & 3) << 4) + (in[1] >> 4)) & 0x3F];
53 *p++ = codes[(((in[1] & 0xf) << 2) + (in[2] >> 6)) & 0x3F];
54 *p++ = codes[in[2] & 0x3F];
62 *p++ = codes[(a >> 2) & 0x3F];
63 *p++ = codes[(((a & 3) << 4) + (b >> 4)) & 0x3F];
64 *p++ = (i+1 < inlen) ? codes[(((b & 0xf) << 2)) & 0x3F] : '=';
|
| /external/regex-re2/re2/ |
| make_unicode_groups.py | 30 def MakeRanges(codes):
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):
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...] |
| 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
[all...] |
| /external/valgrind/main/drd/scripts/ |
| 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/apps/raytrace/rltotiff/Makefile 2008-05-25 10:31:57.000000000 +020
[all...] |
| /libcore/luni/src/test/java/libcore/java/net/ |
| OldHttpRetryExceptionTest.java | 26 int [] codes = {400, 404, 200, 500, 0}; local
30 codes[i]);
33 hre.responseCode() == codes[i]);
39 int [] codes = {400, -1, Integer.MAX_VALUE, Integer.MIN_VALUE, 0}; local
45 codes[i], locations[i]);
48 hre.responseCode() == codes[i]);
|
| /dalvik/tools/ |
| deadcode.py | 67 def CallsMethod(codes, method):
69 whether or not there is method invokation line in the codes section that
76 match = codes.find(method, start)
82 startOfLine = codes.rfind("\n", 0, match) + 1
87 if codes.find("invoke", startOfLine, match) is not -1:
113 codes = sections['codes']
120 if not CallsMethod(codes, method):
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.h | 48 CODES,
54 unsigned codes, code FAR * FAR *table,
|
| /external/webp/src/utils/ |
| huffman_encode.h | 24 uint8_t extra_bits; // extra bits for escape codes
27 // Struct to represent the tree codes (depth and bits array).
31 uint16_t* codes; // Symbol Codes. member in struct:__anon16617
|
| huffman.c | 176 // Get Huffman codes from the code lengths.
177 int* const codes = local
178 (int*)WebPSafeMalloc((uint64_t)code_lengths_size, sizeof(*codes));
179 if (codes == NULL) goto End;
181 if (!HuffmanCodeLengthsToCodes(code_lengths, code_lengths_size, codes)) {
188 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) {
195 free(codes);
204 const int* const codes,
212 assert(codes != NULL);
220 if (codes[i] != NON_EXISTENT_SYMBOL)
[all...] |
| /external/zlib/src/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,
|
| /external/zlib/src/ |
| 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,
|
| /packages/inputmethods/LatinIME/native/jni/src/gesture/ |
| incremental_decoder_interface.h | 32 int *inputXs, int *inputYs, int *times, int *pointerIds, int *codes,
|
| gesture_decoder_wrapper.h | 41 int *times, int *pointerIds, int *codes, int inputSize, int commitPoint,
48 pInfo, traverseSession, inputXs, inputYs, times, pointerIds, codes,
|
| incremental_decoder_wrapper.h | 41 int *times, int *pointerIds, int *codes, int inputSize, int commitPoint,
48 pInfo, traverseSession, inputXs, inputYs, times, pointerIds, codes,
|
| /external/qemu/distrib/sdl-1.2.15/src/video/Xext/extensions/ |
| extutil.h | 51 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
66 XExtCodes* /* codes */
73 XExtCodes* /* codes */
80 XExtCodes* /* codes */
87 XExtCodes* /* codes */
94 XExtCodes* /* codes */
101 XExtCodes* /* codes */
107 XExtCodes* /* codes */
128 XExtCodes* /* codes */,
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/X11/extensions/ |
| extutil.h | 49 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
63 XExtCodes* /* codes */
68 XExtCodes* /* codes */
73 XExtCodes* /* codes */
78 XExtCodes* /* codes */
83 XExtCodes* /* codes */
88 XExtCodes* /* codes */
92 XExtCodes* /* codes */
107 XExtCodes* /* codes */,
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/X11/extensions/ |
| extutil.h | 49 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
63 XExtCodes* /* codes */
68 XExtCodes* /* codes */
73 XExtCodes* /* codes */
78 XExtCodes* /* codes */
83 XExtCodes* /* codes */
88 XExtCodes* /* codes */
92 XExtCodes* /* codes */
107 XExtCodes* /* codes */,
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/X11/extensions/ |
| extutil.h | 49 XExtCodes *codes; /* the extension protocol codes */ member in struct:_XExtDisplayInfo
63 XExtCodes* /* codes */
68 XExtCodes* /* codes */
73 XExtCodes* /* codes */
78 XExtCodes* /* codes */
83 XExtCodes* /* codes */
88 XExtCodes* /* codes */
92 XExtCodes* /* codes */
107 XExtCodes* /* codes */,
[all...] |
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| SynchronouslyLoadedContactsBinaryDictionary.java | 35 public synchronized ArrayList<SuggestedWordInfo> getSuggestions(final WordComposer codes,
38 return super.getSuggestions(codes, prevWordForBigrams, proximityInfo);
|
| SynchronouslyLoadedUserBinaryDictionary.java | 38 public synchronized ArrayList<SuggestedWordInfo> getSuggestions(final WordComposer codes,
41 return super.getSuggestions(codes, prevWordForBigrams, proximityInfo);
|
| /packages/inputmethods/LatinIME/native/jni/src/ |
| unigram_dictionary.h | 47 const int *ycoordinates, const int *codes, const int codesSize,
56 const int *ycoordinates, const int *codes, const int inputSize,
60 int getDigraphReplacement(const int *codes, const int i, const int codesSize,
71 const int *ycoordinates, const int *codes, const int codesSize,
74 const int *ycoordinates, const int *codes, const std::map<int, int> *bigramMap,
83 const int *xcoordinates, const int *ycoordinates, const int *codes,
101 const int *codes, const bool useFullEditDistance, Correction *correction,
108 const int *xcoordinates, const int *ycoordinates, const int *codes,
|
| dictionary.cpp | 59 int *codes, int codesSize, int *prevWordChars,
68 xcoordinates, ycoordinates, times, pointerIds, codes, codesSize, commitPoint,
80 ycoordinates, codes, codesSize, &bigramMap, bigramFilter,
86 int Dictionary::getBigrams(const int32_t *word, int length, int *codes, int codesSize,
89 return mBigramDictionary->getBigrams(word, length, codes, codesSize, outWords, frequencies,
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| AbstractNonStreamingHashFunctionTest.java | 35 HashCode[] codes = new HashCode[hashers.size()]; local
37 codes[i] = hashers.get(i).hash();
39 for (int i = 1; i < codes.length; i++) {
40 assertEquals(codes[i - 1], codes[i]);
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| KeyboardCodesSet.java | 31 final int[] codes = sLanguageToCodesMap.get(language); local
32 mCodes = (codes != null) ? codes : DEFAULT;
147 final int[] codes = (int[])LANGUAGE_AND_CODES[i + 1]; typedefs
148 sLanguageToCodesMap.put(language, codes);
|
