| /external/chromium_org/third_party/brotli/src/brotli/enc/ |
| transform.h | 201 const Transform& t, const uint8_t* word, int len) {
210 ret += std::string(word + skip, word + len);
213 ret += std::string(word, word + len);
236 const uint8_t* word = &kBrotliDictionary[offset]; local
237 return ApplyTransform(kTransforms[t], word, len_code);
|
| /external/chromium_org/third_party/icu/source/common/ |
| ucnv_ext.cpp | 37 uint32_t word0, word; local
52 /* word0 is suitable for <=toUSection[] comparison, word for <toUSection[] */
56 * Shift byte once instead of each section word and add 0xffffff.
61 * so we need not mask off the lower 24 bits of each section word.
63 word=word0|UCNV_EXT_TO_U_VALUE_MASK;
92 if(word<toUSection[i]) {
100 if(start<limit && byte==UCNV_EXT_TO_U_GET_BYTE(word=toUSection[start])) {
101 return UCNV_EXT_TO_U_GET_VALUE(word); /* never 0 */
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| thcoll.cpp | 91 // Loop through each word in the dictionary and compare it to the previous
92 // word. They should be in sorted order.
94 UnicodeString lastWord, word; local
97 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) {
103 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str));
107 Collator::EComparisonResult result = coll->compare(lastWord, word);
108 doTest(coll, lastWord, word, result);
110 lastWord = word;
138 // Loop through each word in the dictionary and compare it to the previou
141 UnicodeString lastWord, word; local
[all...] |
| /external/chromium_org/third_party/libsrtp/srtp/crypto/include/ |
| datatypes.h | 250 /* bit 0 is first 32-bit word, low order bit. in little-endian, that's
251 the first byte of the first 32-bit word. In big-endian, that's
252 the 3rd byte of the first 32-bit word */
440 * of word[0], while the most significant bit is the nth most
441 * significant bit of word[m], where length = bits_per_word * m + n.
450 uint32_t *word; member in struct:__anon17441
456 ((((v)->word[((bit_index) >> 5)]) >> ((bit_index) & 31)) & 1) \
462 (((v)->word[((bit_index) >> 5)] |= ((uint32_t)1 << ((bit_index) & 31)))) \
467 (((v)->word[((bit_index) >> 5)] &= ~((uint32_t)1 << ((bit_index) & 31)))) \
|
| /external/chromium_org/third_party/libsrtp/srtp/test/ |
| rtpw.c | 4 * rtp word sender/receiver
10 * libsrtp. It reads one word at a time from /usr/dict/words (or
11 * whatever file is specified as DICT_FILE), and sends one word out
144 char word[MAX_WORD_LEN]; local
167 WORD wVersionRequested = MAKEWORD(2, 0);
455 while (!interrupted && fgets(word, MAX_WORD_LEN, dict) != NULL) {
456 len = strlen(word) + 1; /* plus one for null */
459 printf("error: word %s too large to send\n", word);
461 rtp_sendto(snd, word, len)
[all...] |
| /external/chromium_org/third_party/webrtc/base/ |
| win32.cc | 286 uint16 word; local
288 if (sscanf(readcursor, "%hx%n", &word, &bytesread) != 1) {
291 *addr_cursor = HostToNetwork16(word);
|
| /external/chromium_org/ui/accessibility/extensions/caretbrowsing/ |
| 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 until we reach a whitespace character o
471 var word = c; variable
527 var word = c; variable
[all...] |
| /external/deqp/modules/gles31/functional/ |
| es31fIntegerStateQueryTests.cpp | 382 // mask word count ok?
396 glw::GLint word = 0; local
397 gl.glGetIntegeri_v(GL_SAMPLE_MASK_VALUE, ndx, &word);
399 if (word != -1)
401 m_testCtx.getLog() << tcu::TestLog::Message << "ERROR: Expected all bits set (-1), got " << word << tcu::TestLog::EndMessage;
|
| /external/e2fsprogs/misc/ |
| e2initrd_helper.c | 184 char *word, *next; local
186 word = *buf;
187 if (*word == 0)
190 word = skip_over_blank(word);
191 next = skip_over_word(word);
195 return word;
198 static void parse_escape(char *word)
203 if (!word)
206 for (p = word, q = word; *p; p++, q++)
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/scripts_cvs/searchcvs/www/projectName/ |
| searchcvs.php | 251 foreach ($regs[1] as $word)
253 $word = addslashes($word); variable
254 $list[] = $word;
255 $str = preg_replace("/\Q$word\E/", "", $str);
260 foreach ($regs[1] as $word)
262 $list[] = addslashes($word);
|
| /external/icu/icu4c/source/common/ |
| ucnv_ext.cpp | 37 uint32_t word0, word; local
52 /* word0 is suitable for <=toUSection[] comparison, word for <toUSection[] */
56 * Shift byte once instead of each section word and add 0xffffff.
61 * so we need not mask off the lower 24 bits of each section word.
63 word=word0|UCNV_EXT_TO_U_VALUE_MASK;
92 if(word<toUSection[i]) {
100 if(start<limit && byte==UCNV_EXT_TO_U_GET_BYTE(word=toUSection[start])) {
101 return UCNV_EXT_TO_U_GET_VALUE(word); /* never 0 */
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| thcoll.cpp | 92 // Loop through each word in the dictionary and compare it to the previous
93 // word. They should be in sorted order.
95 UnicodeString lastWord, word; local
98 while (names.readLineSkippingComments(word, ec, FALSE) && U_SUCCESS(ec)) {
104 logln((UnicodeString)"Word " + wordCount + ": " + IntlTest::prettify(word, str));
108 Collator::EComparisonResult result = coll->compare(lastWord, word);
109 doTest(coll, lastWord, word, result);
111 lastWord = word;
139 // Loop through each word in the dictionary and compare it to the previou
142 UnicodeString lastWord, word; local
[all...] |
| /external/javassist/sample/preproc/ |
| Compiler.java | 129 int word[] = new int[5]; local
132 word[i] = reader.read();
133 output.write(word[i]);
136 if (word[0] != 'm' || word[1] != 'p' || word[2] != 'o'
137 || word[3] != 'r' || word[4] != 't')
|
| /external/kernel-headers/original/uapi/linux/ |
| i2c.h | 130 __u16 word; member in union:i2c_smbus_data
|
| /external/libedit/examples/ |
| fileman.c | 148 char *word; local
150 /* Isolate the command word. */
154 word = line + i;
162 command = find_command (word);
166 fprintf (stderr, "%s: No such command for FileMan.\n", word);
174 word = line + i;
177 return ((*(command->func)) (word));
225 complete on command names if this is the first word in the line, or
238 bound the region of rl_line_buffer that contains the word to
239 complete. TEXT is the word to complete. We can use the entir
[all...] |
| /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| traverse_util.js | 7 * next (or previous) character, word, sentence, line, or paragraph,
427 * Finds the next word, starting from endCursor. Upon exit, startCursor
428 * and endCursor will surround the next word. A word is defined to be
431 * word returned.
433 * word. On exit, will point to the end of the word returned.
436 * @return {?string} The next word, or null if the bottom of the
455 // character in our word. It's safe to decrement |index| because
461 // Keep building up our word until we reach a whitespace character o
465 var word = c; variable
525 var word = c; variable
[all...] |
| /external/chromium_org/chrome/browser/spellchecker/ |
| spellcheck_custom_dictionary.cc | 77 bool IsInvalidWord(const std::string& word) {
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) {
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...] |
| /external/chromium_org/net/websockets/ |
| websocket_deflate_stream_test.cc | 272 const std::string word = "Chromium"; local
273 const std::string payload = word + std::string(256, 'a') + word;
[all...] |
| /external/chromium_org/third_party/re2/re2/testing/ |
| re2_test.cc | 237 RE2 r("\\s*(\\w+)"); // matches a word, possibly proceeded by whitespace
238 string word; local
243 CHECK(RE2::Consume(&input, r, &word));
244 CHECK_EQ(word, "aaa") << " input: " << input;
245 CHECK(RE2::Consume(&input, r, &word));
246 CHECK_EQ(word, "b") << " input: " << input;
247 CHECK(! RE2::Consume(&input, r, &word)) << " input: " << input;
261 string word; local
262 argv[0] = &word;
264 EXPECT_EQ("two", word);
278 string word; local
310 string word; local
[all...] |
| /external/chromium_org/third_party/skia/forth/ |
| Forth.cpp | 84 // now invoke the word
107 Those last two bits are always 0 for a word, so we set those bits for other
110 00 -- execute this word
182 void FCode::appendWord(ForthWord* word) {
183 SkASSERT((reinterpret_cast<intptr_t>(word) & 3) == 0);
184 *fData.append() = reinterpret_cast<intptr_t>(word);
288 ForthWord* word; local
289 while (iter.next(&word)) {
290 delete word;
447 ForthWord* word = this->find(token, len) local
[all...] |
| /external/compiler-rt/lib/builtins/ |
| fp_lib.h | 126 uint64_t word; local
130 word = uu.s.high;
134 word = uu.s.low;
137 return __builtin_clzll(word) + add;
|
| /external/flac/libFLAC/ |
| 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 >> 16] + 8 : byte_to_unary_table[(word) >> 24] )
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/icu/icu4c/source/i18n/ |
| collationruleparser.cpp | 693 CharString word; local
695 ++i; // skip the word-separating space
698 word.clear().appendInvariantChars(raw.tempSubStringBetween(i, limit), errorCode);
700 int32_t code = getReorderCode(word.data());
728 CollationRuleParser::getReorderCode(const char *word) {
730 if(uprv_stricmp(word, gSpecialReorderCodes[i]) == 0) {
734 int32_t script = u_getPropertyValueEnum(UCHAR_SCRIPT, word);
738 if(uprv_stricmp(word, "default") == 0) {
|
| /external/iputils/ |
| clockdiff.c | 50 union word { union
62 /* word is not aligned */
|
| /external/libnl/lib/ |
| addr.c | 40 uint16_t word; member in union:__anon4055
42 .word = addr,
|
