/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | DTMStringPool.java | 143 String[] word={ 162 for(i=0;i<word.length;++i) 164 int j=pool.stringToIndex(word[i]); 170 for(i=0;i<word.length;++i) 172 int j=pool.stringToIndex(word[i]); 178 for(i=0;i<word.length;++i) 181 if(!word[i].equals(w))
|
/external/e2fsprogs/misc/ |
H A D | ismounted.c | 59 char *word, *next; local 61 word = *buf; 62 if (*word == 0) 65 word = skip_over_blank(word); 66 next = skip_over_word(word); 70 return word;
|
/external/chromium_org/tools/json_schema_compiler/ |
H A D | cpp_util.py | 134 return ('k' + ''.join(word[0].upper() + word[1:] 135 for word in feature_name.replace('.', ' ').split())) 139 return ''.join(word.capitalize() for word in unix_name.split('_'))
|
/external/llvm/utils/ |
H A D | wciia.py | 54 for word in line.split(): 55 if word == "N:": 62 if word == "E:": 65 if word == "D:": 68 if word == "F:":
|
/external/libgsm/src/ |
H A D | long_term.c | 53 register word * d, /* [0..39] IN */ 54 register word * dp, /* [-120..-1] IN */ 55 word * bc_out, /* OUT */ 56 word * Nc_out /* OUT */ 60 word Nc, bc; 61 word wt[40]; 65 word R, S, dmax, scal, best_k; 66 word ltp_cut; 68 register word temp, wt_k; 157 register word * [all...] |
/external/flac/libFLAC/ |
H A D | bitreader.c | 52 /* Things should be fastest when this matches the machine word size */ 55 /* also, some sections currently only have fast versions for 4 or 8 bytes per word */ 70 /* counts the # of zero MSBs in a word */ 71 #define COUNT_ZERO_MSBS(word) ( \ 72 (word) <= 0xffff ? \ 73 ( (word) <= 0xff? byte_to_unary_table[word] + 24 : byte_to_unary_table[(word) >> 8] + 16 ) : \ 74 ( (word) <= 0xffffff? byte_to_unary_table[word >> 1 178 crc16_update_word_(FLAC__BitReader *br, brword word) argument 461 const brword word = br->buffer[br->consumed_words]; local 480 const brword word = br->buffer[br->consumed_words]; local 661 const brword word = br->buffer[br->consumed_words++]; local 926 const brword word = br->buffer[cwords]; local [all...] |
/external/chromium_org/chrome/tools/convert_dict/ |
H A D | dic_reader.cc | 19 // Maps each unique word to the unique affix group IDs associated with it. 37 std::string word = line.substr(0, slash_index); local 38 ReplaceSubstringsAfterOffset(&word, 0, "\\/", "/"); 39 output->push_back(word); 47 // we read 'all' the words in the file, irrespective of the word count given 53 // does not, then the first line contains a word. 80 // The first part is the word, the second (optional) part is the affix. We 110 // token. (It is attached to the first token if a word doesn't have affix 157 // Add words from the dic file to the word set. 158 // Note that the first line is the word coun [all...] |
/external/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
H A D | x86-mont.pl | 280 $word="edi"; 285 &mov ($word,$_bp); 289 &sub ("edx",$word); # see if ap==bp 290 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num] 292 &mov ($word,&DWP(0,$word)); # bp[0] 300 &mul ($word); # ap[j]*bp[0] 310 &mul ($word); # ap[num-1]*bp[0] 311 &mov ($word,$_n0); 315 &imul ($word, [all...] |
/external/openssl/crypto/bn/asm/ |
H A D | x86-mont.pl | 280 $word="edi"; 285 &mov ($word,$_bp); 289 &sub ("edx",$word); # see if ap==bp 290 &lea ("eax",&DWP(4,$word,$num,4)); # &bp[num] 292 &mov ($word,&DWP(0,$word)); # bp[0] 300 &mul ($word); # ap[j]*bp[0] 310 &mul ($word); # ap[num-1]*bp[0] 311 &mov ($word,$_n0); 315 &imul ($word, [all...] |
/external/chromium_org/components/query_parser/ |
H A D | query_parser.cc | 64 // or a single word (a QueryNodeWord). 66 // A QueryNodeWord is a single word in the query. 69 explicit QueryNodeWord(const base::string16& word); 72 const base::string16& word() const { return word_; } function in class:query_parser::QueryNodeWord 79 virtual bool Matches(const base::string16& word, bool exact) const OVERRIDE; 94 QueryNodeWord::QueryNodeWord(const base::string16& word) argument 95 : word_(word), 113 bool QueryNodeWord::Matches(const base::string16& word, bool exact) const { argument 115 return word == word_; 116 return word 212 Matches(const base::string16& word, bool exact) const argument 322 IsWordLongEnoughForPrefixSearch(const base::string16& word) argument 452 base::string16 word = iter.GetString(); local [all...] |
/external/chromium_org/third_party/boringssl/linux-arm/crypto/aes/ |
H A D | aes-armv4.S | 56 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d 57 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554 58 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d 59 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a 60 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87 61 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b 62 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea 63 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b 64 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a 65 .word [all...] |
/external/openssl/crypto/aes/asm/ |
H A D | aes-armv4.S | 55 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d 56 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554 57 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d 58 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a 59 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87 60 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b 61 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea 62 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b 63 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a 64 .word [all...] |
H A D | aes-armv4.pl | 75 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d 76 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554 77 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d 78 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a 79 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87 80 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b 81 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea 82 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b 83 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a 84 .word [all...] |
/external/chromium_org/chrome/browser/spellchecker/ |
H A D | spellcheck_custom_dictionary.cc | 77 bool IsInvalidWord(const std::string& word) { argument 79 return !base::IsStringUTF8(word) || 80 word.length() > 82 word.empty() || 83 base::TRIM_NONE != base::TrimWhitespaceASCII(word, base::TRIM_ALL, &tmp); 126 // Removes duplicate and invalid words from |to_add| word list and sorts it. 127 // Looks for duplicates in both |to_add| and |existing| word lists. Returns a 151 // Removes word from |to_remove| that are missing from |existing| word list and 189 void SpellcheckCustomDictionary::Change::AddWord(const std::string& word) { argument 193 RemoveWord(const std::string& word) argument 235 AddWord(const std::string& word) argument 247 RemoveWord(const std::string& word) argument 348 std::string word; local 371 std::string word = it->sync_data().GetSpecifics().dictionary().word(); local 494 std::string word = *it; local 506 std::string word = *it; local [all...] |
H A D | spellcheck_message_filter_mac.h | 39 void OnCheckSpelling(const base::string16& word, int route_id, bool* correct); 40 void OnFillSuggestionList(const base::string16& word, 43 void OnUpdateSpellingPanelWithMisspelledWord(const base::string16& word);
|
/external/chromium_org/third_party/boringssl/src/crypto/aes/asm/ |
H A D | aes-armv4.pl | 76 .word 0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d 77 .word 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554 78 .word 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d 79 .word 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a 80 .word 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87 81 .word 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b 82 .word 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea 83 .word 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b 84 .word 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a 85 .word [all...] |
/external/chromium_org/third_party/webrtc/build/ |
H A D | version.py | 43 for index, word in enumerate(words): 44 if word == "Revision:":
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
H A D | win64-dataref2.asm | 10 cmp word [foo wrt rip], 10000
|
/external/chromium_org/ui/accessibility/extensions/caretbrowsing/ |
H A D | traverse_util.js | 7 * next (or previous) character, word, sentence, line, or paragraph, 433 * Finds the next word, starting from endCursor. Upon exit, startCursor 434 * and endCursor will surround the next word. A word is defined to be 437 * word returned. 439 * word. On exit, will point to the end of the word returned. 442 * @return {?string} The next word, or null if the bottom of the 461 // character in our word. It's safe to decrement |index| because 467 // Keep building up our word unti 471 var word = c; variable 527 var word = c; variable [all...] |
/external/chromium_org/ui/app_list/search/ |
H A D | tokenized_string.cc | 35 const base::string16 word(break_iter.GetString()); 37 TermBreakIterator term_iter(word);
|
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/syscalls/socket/ |
H A D | inet_pton.c | 82 unsigned long word = strtoul(pos, &end_pos, 16); local 83 if (word > 0xffff || pos == end_pos) 98 result[result_pos] = (word & 0xFF00) >> 8; 99 result[result_pos + 1] = word & 0xFF;
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
H A D | amd200707.asm | 14 lzcnt cx, word [0] 24 popcnt cx, word [0]
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
H A D | standard.h | 18 typedef int word; /* fastest type available */ typedef
|
/external/llvm/test/MC/ARM/ |
H A D | directive-word-diagnostics.s | 8 .word invalid(invalid) + 32
|
/external/llvm/test/MC/MachO/ARM/ |
H A D | bad-darwin-ARM-reloc.s | 8 .word 0
|