| /external/clang/test/CodeGen/ |
| 2010-07-14-overconservative-align.c | 4 int word; member in struct:s
13 s->word = 0;
|
| /bionic/libc/bionic/ |
| ptrace.c | 40 long word; local
43 ret = __ptrace(request, pid, addr, &word);
45 return word;
|
| /external/bison/lib/ |
| signbitd.c | 42 union { double value; unsigned int word[NWORDS]; } m; member in union:__anon2754
44 return (m.word[DBL_SIGNBIT_WORD] >> DBL_SIGNBIT_BIT) & 1;
|
| signbitf.c | 42 union { float value; unsigned int word[NWORDS]; } m; member in union:__anon2755
44 return (m.word[FLT_SIGNBIT_WORD] >> FLT_SIGNBIT_BIT) & 1;
|
| signbitl.c | 42 union { long double value; unsigned int word[NWORDS]; } m; member in union:__anon2756
44 return (m.word[LDBL_SIGNBIT_WORD] >> LDBL_SIGNBIT_BIT) & 1;
|
| isnan.c | 80 typedef union { DOUBLE value; unsigned int word[NWORDS]; } memory_double; member in union:__anon2738
99 exponent = (m.word[EXPBIT0_WORD] >> EXPBIT0_BIT) & EXP_MASK;
103 return 1 & (m.word[0] >> 15);
105 return (((m.word[0] ^ 0x8000U) << 16) | m.word[1] | (m.word[2] >> 16)) != 0;
107 return 1 & ~(m.word[0] >> 15);
111 return (m.word[1] >> 31);
113 return ((m.word[1] ^ 0x80000000U) | m.word[0]) != 0
[all...] |
| /external/chromium_org/chrome/browser/sync/test/integration/ |
| single_client_dictionary_sync_test.cc | 23 std::string word = "foo"; local
24 ASSERT_TRUE(dictionary_helper::AddWord(0, word));
25 ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion("Added a word"));
28 ASSERT_TRUE(dictionary_helper::RemoveWord(0, word));
29 ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion("Removed a word"));
|
| two_client_dictionary_sync_test.cc | 89 std::string word = "foo"; local
91 ASSERT_TRUE(dictionary_helper::AddWord(0, word));
93 ASSERT_TRUE(dictionary_helper::RemoveWord(0, word));
96 ASSERT_TRUE(dictionary_helper::AddWord(1, word));
109 ASSERT_TRUE(GetClient(0)->AwaitFullSyncCompletion("Added a word"));
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| basics.h | 9 typedef unsigned short word; typedef
|
| /external/v8/src/ |
| regexp-macro-assembler-irregexp-inl.h | 45 uint32_t word = ((twenty_four_bits << BYTECODE_SHIFT) | byte); local
50 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;
55 void RegExpMacroAssemblerIrregexp::Emit16(uint32_t word) {
60 *reinterpret_cast<uint16_t*>(buffer_.start() + pc_) = word;
65 void RegExpMacroAssemblerIrregexp::Emit32(uint32_t word) {
70 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;
|
| /bionic/libc/string/ |
| bcopy.c | 37 * sizeof(word) MUST BE A POWER OF TWO
40 typedef long word; /* "word" used for optimal copy speed */ typedef
42 #define wsize sizeof(word)
97 TLOOP(*(word *)dst = *(word *)src; src += wsize; dst += wsize);
118 TLOOP(src -= wsize; dst -= wsize; *(word *)dst = *(word *)src);
|
| /dalvik/vm/ |
| BitVector.cpp | 70 unsigned int word, bit; local
73 for (word = 0; word < pBits->storageSize; word++) {
74 if (pBits->storage[word] != 0xffffffff) {
76 * There are unallocated bits in this word. Return the first.
78 bit = ffs(~(pBits->storage[word])) -1;
80 pBits->storage[word] |= 1 << bit;
81 return (word << 5) | bit;
111 /* Round up to word boundaries for "num+1" bits *
[all...] |
| /external/chromium/chrome/browser/history/ |
| query_parser.h | 22 string16 word; member in struct:QueryWord
24 // The starting position of the word in the original text.
39 // Return true if this is a word node, false if it's a QueryNodeList.
45 virtual bool Matches(const string16& word, bool exact) const = 0;
48 // the node matches at least one word, an entry is added to match_positions
64 // false positives. Moreover, the current ICU word breaker gives us
65 // back every single Chinese character as a word so that there's no
69 static bool IsWordLongEnoughForPrefixSearch(const string16& word);
103 // Extracts the words from text, placing each word into words.
|
| /external/chromium_org/chrome/browser/history/ |
| query_parser.h | 19 string16 word; member in struct:QueryWord
21 // The starting position of the word in the original text.
39 // Returns true if this node matches |word|. If |exact| is true, the string
41 virtual bool Matches(const string16& word, bool exact) const = 0;
64 // false positives. Moreover, the current ICU word breaker gives us
65 // back every single Chinese character as a word so that there's no
69 static bool IsWordLongEnoughForPrefixSearch(const string16& word);
98 // Extracts the words from |text|, placing each word into |words|.
|
| /external/chromium_org/v8/src/ |
| regexp-macro-assembler-irregexp-inl.h | 45 uint32_t word = ((twenty_four_bits << BYTECODE_SHIFT) | byte); local
50 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;
55 void RegExpMacroAssemblerIrregexp::Emit16(uint32_t word) {
60 *reinterpret_cast<uint16_t*>(buffer_.start() + pc_) = word;
65 void RegExpMacroAssemblerIrregexp::Emit8(uint32_t word) {
70 *reinterpret_cast<unsigned char*>(buffer_.start() + pc_) = word;
75 void RegExpMacroAssemblerIrregexp::Emit32(uint32_t word) {
80 *reinterpret_cast<uint32_t*>(buffer_.start() + pc_) = word;
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/compat/ |
| SuggestionSpanUtils.java | 82 final String word = suggestedWords.getWord(i); local
83 if (!TextUtils.equals(pickedWord, word)) {
84 suggestionsList.add(word.toString());
|
| /dalvik/vm/alloc/ |
| HeapBitmapInlines.h | 43 const unsigned long word = *p; local
45 return word & mask;
|
| /external/chromium_org/chrome/renderer/spellchecker/ |
| spellcheck_language.cc | 46 // report the word as correctly spelled.)
60 string16 word;
72 while (text_iterator_.GetNextWord(&word, &word_start, &word_length)) {
73 // Found a word (or a contraction) that the spellchecker can check the
75 if (platform_spelling_engine_->CheckSpelling(word, tag))
78 // If the given word is a concatenated word of two or more valid words
79 // (e.g. "hello:hello"), we should treat it as a valid word.
80 if (IsValidContraction(word, tag))
88 platform_spelling_engine_->FillSuggestionList(word,
112 string16 word; local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
| standard.h | 18 typedef int word; /* fastest type available */ typedef
|
| /external/icu4c/layout/ |
| DeviceTables.cpp | 31 le_uint16 word = SWAPW(deltaValues[sizeIndex / count]); local
34 le_uint16 field = (word >> shift) & fieldMasks[format];
|
| /external/iproute2/lib/ |
| dnet_ntop.c | 12 u_int16_t word; member in union:__anon21180
15 u.word = addr;
|
| dnet_pton.c | 12 u_int16_t word; member in union:__anon21181
15 u.word = addr;
|
| /external/kernel-headers/original/asm-mips/ |
| checksum.h | 103 const unsigned int *word = iph; local
104 const unsigned int *stop = word + ihl;
108 csum = word[0];
109 csum += word[1];
110 carry = (csum < word[1]);
113 csum += word[2];
114 carry = (csum < word[2]);
117 csum += word[3];
118 carry = (csum < word[3]);
121 word += 4
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SparseBitVector.h | 85 // Return the bits that make up word Idx in our element.
86 BitWord word(unsigned Idx) const { function in struct:llvm::SparseBitVectorElement
158 && "Word Position outside of element");
339 // Current word number inside of our element.
358 Bits = Iter->word(WordNumber);
372 // See if we ran out of Bits in this word.
385 // Set up for next non zero word in bitmap.
390 Bits = Iter->word(WordNumber);
394 Bits = Iter->word(WordNumber);
|
| /external/ppp/pppd/ |
| pppcrypt.c | 42 unsigned int word; local
44 word = (unsigned)input[startBit / 8] << 8;
45 word |= (unsigned)input[startBit / 8 + 1];
47 word >>= 15 - (startBit % 8 + 7);
49 return word & 0xFE;
|
