| /external/libgsm/src/ |
| debug.c | 25 word * ptr)
71 word value )
|
| /external/llvm/test/MC/ARM/ |
| relocated-mapping.s | 6 .word somewhere
|
| /external/llvm/test/MC/AsmParser/ |
| dot-symbol-assignment.s | 14 .word (3*8)-1
|
| /external/pdfium/core/src/fpdfapi/fpdf_parser/ |
| fpdf_parser_fdf.cpp | 62 CFX_ByteString word = parser.GetNextWord(bNumber);
local
64 FX_DWORD objnum = FXSYS_atoi(word);
65 word = parser.GetNextWord(bNumber);
69 word = parser.GetNextWord(bNumber);
70 if (word != FX_BSTRC("obj")) {
78 word = parser.GetNextWord(bNumber);
79 if (word != FX_BSTRC("endobj")) {
83 if (word != FX_BSTRC("trailer")) {
|
| /external/pdfium/core/src/fpdfdoc/ |
| doc_ap.cpp | 120 FX_INT32 CPVT_Provider::GetCharWidth(FX_INT32 nFontIndex, FX_WORD word, FX_INT32 nWordStyle)
123 FX_DWORD charcode = pPDFFont->CharCodeFromUnicode(word);
144 FX_INT32 CPVT_Provider::GetWordFontIndex(FX_WORD word, FX_INT32 charset, FX_INT32 nFontIndex)
147 if (pDefFont->CharCodeFromUnicode(word) != -1) {
152 if (pSysFont->CharCodeFromUnicode(word) != -1) {
157 FX_BOOL CPVT_Provider::IsLatinWord(FX_WORD word)
159 if ((word >= 0x61 && word <= 0x7A) || (word >= 0x41 && word <= 0x5A) || word == 0x2D || word == 0x27) {
662 CPVT_Word word; local
675 CPVT_Word word; local
689 CPVT_Word word; local
[all...] |
| /external/srec/srec/crec/ |
| priority_q.c | 115 are the same word (obviously ending at the same frame), and with the
116 same word history. This happens for a digit that has multiple end nodes
125 if (token1->word != token2->word)
133 history_for_token1 += word_token_array[token1->backtrace].word * 10000;
140 history_for_token2 += word_token_array[token2->backtrace].word * 10000;
182 /*adds a word token to the priority_q. Returns the index of the word to
208 printf("WORDADD PQ token %d word %d cost %d\n", token_index, token->word, token->cost)
[all...] |
| srec_debug.c | 35 bufp += sprintf(bufp, "%d,", awtoken->word);
55 printf("%sftoken %d rec %d@%d fsmnode %d cost %d word %d(%s) word_backtrace %d next_token_index %d ", msg, token_index, rec->id, rec->current_search_frame, ftoken->FSMnode_index, ftoken->cost, ftoken->word,
60 if (ftoken->word < rec->context->olabels->num_words)
61 p = rec->context->olabels->words[ftoken->word];
99 wordID* wordids = &stoken->word[0];
|
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/asm/ |
| pvmp3_dct_16_gcc.s | 424 .word 0x404f4680
426 .word 0x519e4e00
428 .word 0x4140fb80
430 .word 0x42e13c00
432 .word 0x6e3c9300
434 .word 0x4cf8de80
436 .word 0x48919f80
438 .word 0x43e22480
440 .word 0x73326b80
442 .word 0x52cb0e8
[all...] |
| pvmp3_dct_9_gcc.s | 176 .word 0x620dbe80
178 .word 0x163a1a80
180 .word 0x7847d900
182 .word 0x87b82700
184 .word 0xd438af00
186 .word 0xadb92280
188 .word 0x91261480
190 .word 0x81f1d200
192 .word 0x6ed9eb80
|
| /frameworks/compile/libbcc/include/bcinfo/Wrap/ |
| bitcode_wrapperer.h | 116 // Returns true if we can read a word. If necessary, fills the buffer
122 // Read a (32-bit) word from the input. Return true
123 // if able to read the word.
124 bool ReadWord(uint32_t& word);
126 // Write a (32-bit) word to the output. Return true if successful
127 bool WriteWord(uint32_t word);
|
| /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/ |
| AbstractDictDecoder.java | 35 public int getTerminalPosition(final String word)
40 return BinaryDictIOUtils.getTerminalPosition(this, word);
|
| BinaryDictDecoderUtils.java | 184 * @param word the string to write.
187 static int writeString(final byte[] buffer, final int origin, final String word) {
188 final int length = word.length();
190 for (int i = 0; i < length; i = word.offsetByCodePoints(i, 1)) {
191 final int codePoint = word.codePointAt(i);
210 * @param word the string to write.
213 static int writeString(final OutputStream stream, final String word) throws IOException {
214 final int length = word.length();
216 for (int i = 0; i < length; i = word.offsetByCodePoints(i, 1)) {
217 final int codePoint = word.codePointAt(i)
[all...] |
| BinaryDictIOUtils.java | 124 if (ptNodeInfo.isTerminal()) {// found word
152 * @param words the map to store the address as a key and the word as a value.
169 * Gets the address of the last PtNode of the exact matching word in the dictionary.
173 * @param word the word we search for.
180 final String word) throws IOException, UnsupportedFormatException {
181 if (word == null) return FormatSpec.NOT_VALID_WORD;
185 final int wordLen = word.codePointCount(0, word.length());
196 for (int p = 0, j = word.offsetByCodePoints(0, wordPos)
[all...] |
| /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/ |
| CombinedInputOutput.java | 98 String word = null; local
107 if (null != word) {
108 dict.add(word, probabilityInfo, shortcuts.isEmpty() ? null : shortcuts,
111 dict.setBigram(word, s.mWord, s.mProbabilityInfo);
121 word = params[1];
191 if (null != word) {
192 dict.add(word, probabilityInfo, shortcuts.isEmpty() ? null : shortcuts, isNotAWord);
194 dict.setBigram(word, s.mWord, s.mProbabilityInfo);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/Terminal/ |
| __init__.py | 60 getbaseclasses(word)
78 'cwor' : word,
|
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/ |
| JUnitCodeGen.java | 345 StringBuilder word = new StringBuilder(); local
348 if ( word.length()>0 ) {
349 words.add(word.toString());
350 word.setLength(0);
357 // upon WS, save word
358 if ( word.length()>0 ) {
359 words.add(word.toString());
360 word.setLength(0);
375 word.append('"');
379 word.append(t.charAt(i))
[all...] |
| /art/runtime/base/ |
| bit_vector.h | 107 uint32_t word = bit_storage_[word_index]; local
108 // Mask out any bits in the first word we've already considered.
109 word &= static_cast<uint32_t>(-1) << (start_index & 0x1f);
110 while (word == 0u) {
115 word = bit_storage_[word_index];
117 return word_index * 32u + CTZ(word);
|
| /external/chromium_org/net/tools/tld_cleanup/ |
| make_dafsa.py | 8 representation of an unordered word list (dictionary).
22 a label and each word is represented by the labels in one path from
202 """Generates a DAFSA from a word list and returns the source node.
204 Each word is split into characters so that each character is represented by
205 a unique node. It is assumed the word list is not empty.
209 def ToNodes(word):
211 if not 0x1F < ord(word[0]) < 0x80:
213 if len(word) == 1:
214 return chr(ord(word[0]) & 0x0F), [None]
215 return word[0], [ToNodes(word[1:])
[all...] |
| /bootable/recovery/updater/ |
| blockimg.c | 366 char* word; local
407 word = strtok_r(NULL, " ", &wordsave);
408 RangeSet* src = parse_range(word);
409 word = strtok_r(NULL, " ", &wordsave);
410 RangeSet* tgt = parse_range(word);
440 word = strtok_r(NULL, " ", &wordsave);
441 RangeSet* tgt = parse_range(word);
463 word = strtok_r(NULL, " ", &wordsave);
464 RangeSet* tgt = parse_range(word);
491 word = strtok_r(NULL, " ", &wordsave)
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| block_idct.cpp | 630 int32 word; local
696 word = ((x7 + x1) >> 14);
697 CLIP_RESULT(word)
701 word = word | (temp << 8);
705 word = word | (temp << 16);
709 word = word | (temp << 24);
710 *((int32*)(comp)) = word;
[all...] |
| /external/zlib/src/contrib/iostream2/ |
| zstream.h | 44 size_t value() const { return val.word; }
46 struct Val { unsigned char byte; size_t word; } val; member in struct:zstringlen::Val
131 if (val.byte == 255) zs > val.word;
132 else val.word = val.byte;
278 val.byte = 255; val.word = ::strlen(x);
279 if (val.word < 255) zs < (val.byte = val.word);
|
| /packages/inputmethods/LatinIME/native/jni/src/ |
| defines.h | 114 #define DUMP_WORD(word, length) do { dumpWord(word, length); } while (0)
118 static inline void dumpWordInfo(const int *word, const int length, const int rank,
121 const int N = intArrayToCharArray(word, length, charBuf, NELEMS(charBuf));
127 static AK_FORCE_INLINE void dumpWord(const int *word, const int length) {
129 const int N = intArrayToCharArray(word, length, charBuf, NELEMS(charBuf));
168 #define DUMP_WORD(word, length)
305 // A special value to mean the first word confidence makes no sense in this case,
306 // e.g. this is not a multi-word suggestion.
397 // Create new word with space omissio
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| SimpleHTTPServer.py | 156 for word in words:
157 drive, word = os.path.splitdrive(word)
158 head, word = os.path.split(word)
159 if word in (os.curdir, os.pardir): continue
160 path = os.path.join(path, word)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| SimpleHTTPServer.py | 156 for word in words:
157 drive, word = os.path.splitdrive(word)
158 head, word = os.path.split(word)
159 if word in (os.curdir, os.pardir): continue
160 path = os.path.join(path, word)
|
| /external/openssl/crypto/ |
| armv4cpuid.S | 21 .word 0xe12fff1e @ bx lr
85 .word 0xe12fff1e @ bx lr
121 .word 0xe12fff1e @ bx lr
155 .word 0xe12fff1e @ bx lr
168 .word 0xe12fff1e @ bx lr
181 .word 0xe12fff1e @ bx lr
187 .word OPENSSL_armcap_P-.LOPENSSL_armcap
192 .word atomic_add_spinlock-.Lspinlock
198 .word 0
|
