| /external/chromium_org/third_party/skia/forth/ |
| ForthTests.cpp | 29 static void drop_test0(ForthWord* word, ForthEngine* fe, Reporter* reporter) {
31 word->exec(fe);
35 static void drop_test1(ForthWord* word, ForthEngine* fe, Reporter* reporter) {
38 word->exec(fe);
43 static void dup_test(ForthWord* word, ForthEngine* fe, Reporter* reporter) {
45 word->exec(fe);
51 static void swap_test(ForthWord* word, ForthEngine* fe, Reporter* reporter) {
54 word->exec(fe);
60 static void over_test(ForthWord* word, ForthEngine* fe, Reporter* reporter) {
63 word->exec(fe)
389 ForthWord* word = env.findWord(gRecs[i].fName); local
[all...] |
| /external/chromium_org/ui/views/corewm/ |
| tooltip_aura.cc | 87 // We break the line at word boundaries, then stuff as many words as we can
96 base::string16 word = *w; local
98 word.push_back(' ');
99 int word_width = gfx::GetStringWidth(word, font_list);
108 line.append(word);
129 // Since we only break at word boundaries, it could happen that due to some
130 // very long word, line_width is greater than the available_width. In such
|
| /external/icu/icu4c/source/test/intltest/ |
| strtest.cpp | 32 uint16_t word; member in union:__anon1705
34 u.word=0x0100;
|
| /external/libgsm/inc/ |
| private.h | 12 typedef short word; /* 16 bit signed int */ typedef
15 typedef unsigned short uword; /* unsigned word */
20 word dp0[ 280 ];
21 word e[ 50 ]; /* code.c */
23 word z1; /* preprocessing.c, Offset_com. */
27 word u[8]; /* short_term_aly_filter.c */
28 word LARpp[2][8]; /* */
29 word j; /* */
31 word ltp_cut; /* long_term.c, LTP crosscorr. */
32 word nrp; /* 40 */ /* long_term.c, synthesis *
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| color.c | 64 const char *word = ptr; local
67 while (len > 0 && !isspace(word[wordlen])) {
72 ptr = word + wordlen;
78 val = parse_color(word, wordlen);
90 val = parse_attr(word, wordlen);
|
| /external/netperf/ |
| netcpu_pstat.c | 65 long word[2]; member in union:overlay_u
77 overlay->word[0] = psp[i].psp_idlecycles.psc_hi;
78 overlay->word[1] = psp[i].psp_idlecycles.psc_lo;
145 long word[2]; member in union:overlay_u
148 overlay->word[0] = psp[j].psp_idlecycles.psc_hi;
149 overlay->word[1] = psp[j].psp_idlecycles.psc_lo;
181 long word[2]; member in union:overlay_u
184 overlay->word[0] = psp[j].psp_idlecycles.psc_hi;
185 overlay->word[1] = psp[j].psp_idlecycles.psc_lo;
|
| /external/openfst/src/extensions/ngram/ |
| bitmap-index.cc | 83 uint32 word = find_secondary_block(offset, rembits); local
84 if (word > 0) {
85 rembits -= secondary_index_[offset + word - 1];
86 offset += word;
104 uint32 word = find_inverted_secondary_block(offset, remzeros); local
105 if (word > 0) {
108 remzeros -= *secondary_index_inverted(block_begin + word - 1, block_begin);
109 offset += word;
|
| /external/oprofile/gui/ |
| oprof_start_util.cpp | 205 string word; local
207 while (oss >> word) {
208 if (line.size() + word.size() > maxlen) {
212 line += 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...] |
| /bionic/libc/kernel/uapi/linux/ |
| i2c.h | 74 __u16 word; member in union:i2c_smbus_data
|
| /build/tools/atree/ |
| files.cpp | 273 const string& word = *it; local
274 if (word == "rm") {
280 } else if (word == "strip") {
288 paths[pcount++] = replace_variables(word, variables, &error);
|
| /cts/tests/tests/provider/src/android/provider/cts/ |
| UserDictionary_WordsTest.java | 36 UserDictionary.Words.WORD,
64 String word = "UserDictionary_WordsTest"; local
66 UserDictionary.Words.addWord(getContext(), word, frequency, local
70 UserDictionary.Words.WORD + "='" + word + "'", null, null);
76 assertEquals(word, cursor.getString(WORD_INDEX));
88 private void assertWord(String word, int frequency, String shortcut, Locale locale,
91 UserDictionary.Words.addWord(mContext, word, frequency, shortcut, locale);
94 UserDictionary.Words.WORD + "='" + word + "'", null, null)
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| i2c.h | 62 __u16 word; member in union:i2c_smbus_data
|
| /development/ndk/platforms/android-L/include/linux/ |
| i2c.h | 74 __u16 word; member in union:i2c_smbus_data
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3bitset.c | 381 ANTLR3_UINT32 word; local
383 word = wordNumber(bit);
385 if (word >= bitset->blist.length)
390 bitset->blist.bits[word] |= bitMask(bit);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| BitSet.java | 50 /** Construct a bitset of size one word (64 bits) */
182 long word = bits[i]; local
183 if (word != 0L) {
185 if ((word & (1L << bit)) != 0) {
259 return bits.length << LOG_BITS; // num words * bits per word
|
| /external/arduino/hardware/arduino/cores/arduino/ |
| wiring.h | 102 typedef unsigned int word; typedef
|
| /external/bison/lib/ |
| abitset.c | 29 of words. Any unused bits in the last word must be zero. */
55 bitset_word word; local
57 word = ABITSET_WORDS (src)[0];
60 if (!word)
68 word >>= bitno;
71 of the word of interest. */
75 for (count = 0; word; bitno++)
77 if (word & 1)
79 word >>= 1;
84 for (count = 0; word; bitno++
172 bitset_word word; local
211 bitset_word word; local
[all...] |
| vbitset.c | 28 length array of words. Any unused bits in the last word must be
180 of the word of interest. */
195 bitset_word word; local
197 word = srcp[windex] << (BITSET_WORD_BITS - 1 - bitcnt);
198 for (; word; bitcnt--)
200 if (word & BITSET_MSB)
209 word <<= 1;
237 bitset_word word; local
251 of the current word. */
265 /* Handle the case where we start within a word
[all...] |
| /external/chromium_org/chrome/browser/autocomplete/ |
| shortcuts_provider.cc | 321 // |match_class| should start at position 0. If the first matching word is
331 // matching word found (which should be the longest possible match at this
333 // |match_class|, moving |last_position| to be after the matching word. If we
340 const base::string16& word = i->second; local
341 size_t word_end = last_position + word.length();
343 !text_lowercase.compare(last_position, word.length(), word)) {
|
| /external/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary_unittest.cc | 47 std::string word; local
50 word = *it;
52 specifics.mutable_dictionary()->set_word(word);
53 data.push_back(syncer::SyncData::CreateLocalData(word, word, specifics));
164 // The custom word list should be empty now.
176 // The custom word list should include written words.
268 // Write to dictionary should backup previous version and write the word to the
315 EXPECT_EQ(words[i], data[i].GetSpecifics().dictionary().word());
372 // Add existing word
373 std::string word = "foo"; local
383 std::string word = "01234567890123456789012345678901234567890123456789" local
394 std::string word = "baz"; local
404 std::string word = "snafoo"; local
414 std::string word = "bar"; local
[all...] |
| /external/chromium_org/chrome/renderer/spellchecker/ |
| spellcheck_unittest.cc | 78 bool CheckSpelling(const std::string& word, int tag) {
80 base::ASCIIToUTF16(word), tag);
133 // * Tests for the function with a valid English word;
134 // * Tests for the function with a valid non-English word;
135 // * Tests for the function with a valid English word with a preceding
137 // * Tests for the function with a valid English word with a preceding
138 // non-English word;
139 // * Tests for the function with a valid English word with a following
141 // * Tests for the function with a valid English word with a following
142 // non-English word;
1313 const char* word; member in struct:__anon10484
[all...] |
| /external/chromium_org/components/query_parser/ |
| 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)
95 : word_(word),
113 bool QueryNodeWord::Matches(const base::string16& word, bool exact) const {
115 return word == word_;
116 return word.size() >= word_.size() &
452 base::string16 word = iter.GetString(); local
[all...] |
| /external/chromium_org/net/disk_cache/blockfile/ |
| bitmap.cc | 14 int FindLSBSetNonZero(uint32 word) {
17 float f = static_cast<float>(word & -static_cast<int>(word));
29 // Returns the index of the first bit set to |value| from |word|. This code
31 int FindLSBNonEmpty(uint32 word, bool value) {
32 // If we are looking for 0, negate |word| and look for 1.
34 word = ~word;
36 return FindLSBSetNonZero(word);
76 // Always clear the unused bits in the last word
173 int word = begin \/ kIntBits; local
299 int word = start \/ kIntBits; local
[all...] |
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| convert.c | 34 * The word 'cryptographic' can be left out if the rouines from the library
70 BN_ULONG word = 0; local
99 word = (word << 8) | *(in++);
101 ret->d[--num_words] = word;
102 word = 0;
140 /* read_word_padded returns the |i|'th word of |in|, if it is not out of
143 * the access would be out of bounds, it reads the last word of |in|. |in| must
146 /* Read |in->d[i]| if valid. Otherwise, read the last word. */
179 * RSA key of size a multiple of the word size, the probability of BN_BYTE
[all...] |
