HomeSort by relevance Sort by last modified time
    Searched refs:word1 (Results 1 - 25 of 26) sorted by null

1 2

  /frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/
get_pred_adv_b_add.cpp 91 uint32 pred_word, word1, word2; local
118 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */
120 word1 >>= 8; /* 0 b4 b3 b2 */
121 pred_word = word1 | (word2 << 24); /* b5 b4 b3 b2 */
124 word1 = *((uint32*)(prev += 4)); /* b12 b11 b10 b9 */
126 pred_word = word2 | (word1 << 24); /* b9 b8 b7 b6 */
136 prev -= 2; /* word1-aligned */
140 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */
142 word1 >>= 16; /* 0 0 b4 b3 */
143 pred_word = word1 | (word2 << 16); /* b6 b5 b4 b3 *
191 uint32 word1, word2, word3, word12; local
520 uint32 word1, word2, word3, word12, word22; local
    [all...]
  /frameworks/base/media/libstagefright/codecs/m4v_h263/enc/src/
motion_comp.cpp 358 ULong pred_word, word1, word2; local
388 word1 = *((ULong*)(prev += lx)); /* read 4 bytes, b4 b3 b2 b1 */
390 word1 >>= 8; /* 0 b4 b3 b2 */
391 pred_word = word1 | (word2 << 24); /* b5 b4 b3 b2 */
394 word1 = *((ULong*)(prev + 8)); /* b12 b11 b10 b9 */
396 pred_word = word2 | (word1 << 24); /* b9 b8 b7 b6 */
404 prev -= 2; /* word1-aligned */
410 word1 = *((ULong*)(prev += lx)); /* read 4 bytes, b4 b3 b2 b1 */
412 word1 >>= 16; /* 0 0 b4 b3 */
413 pred_word = word1 | (word2 << 16); /* b6 b5 b4 b3 *
458 ULong word1, word2, word3, word12; local
783 ULong word1, word2, word3, word12, word22; local
    [all...]
  /external/stlport/test/unit/
setdiff_test.cpp 74 const char* word1 = "ABCDEFGHIJKLMNO"; local
78 set_symmetric_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
125 const char* word1 = "ABCDEFGHIJKLMNO"; local
129 set_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), back_inserter(diff), less<char>());
setinter_test.cpp 68 const char* word1 = "ABCDEFGHIJKLMNO"; local
72 set_intersection(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
setunion_test.cpp 71 const char* word1 = "ABCDEFGHIJKLMNO"; local
75 set_union(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
swap_test.cpp 57 char word1[] = "World"; local
59 swap_ranges((char*)word1, (char*)word1 + ::strlen(word1), (char*)word2);
60 CPPUNIT_ASSERT(!strcmp(word1, "Hello"));
  /ndk/sources/android/stlport/test/unit/
setdiff_test.cpp 74 const char* word1 = "ABCDEFGHIJKLMNO"; local
78 set_symmetric_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
125 const char* word1 = "ABCDEFGHIJKLMNO"; local
129 set_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), back_inserter(diff), less<char>());
setinter_test.cpp 68 const char* word1 = "ABCDEFGHIJKLMNO"; local
72 set_intersection(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
setunion_test.cpp 71 const char* word1 = "ABCDEFGHIJKLMNO"; local
75 set_union(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2),
swap_test.cpp 57 char word1[] = "World"; local
59 swap_ranges((char*)word1, (char*)word1 + ::strlen(word1), (char*)word2);
60 CPPUNIT_ASSERT(!strcmp(word1, "Hello"));
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/
UserBigramDictionary.java 75 private static final String MAIN_COLUMN_WORD1 = "word1";
111 String word1; field in class:UserBigramDictionary.Bigram
115 Bigram(String word1, String word2, int frequency) {
116 this.word1 = word1;
124 return (word1.equals(bigram2.word1) && word2.equals(bigram2.word2));
129 return (word1 + " " + word2).hashCode();
166 public int addBigrams(String word1, String word2) {
172 int freq = super.addBigram(word1, word2, FREQUENCY_FOR_TYPED)
224 String word1 = cursor.getString(word1Index); local
    [all...]
ExpandableDictionary.java 326 protected int setBigram(String word1, String word2, int frequency) {
327 return addOrSetBigram(word1, word2, frequency, false);
330 protected int addBigram(String word1, String word2, int frequency) {
331 return addOrSetBigram(word1, word2, frequency, true);
340 private int addOrSetBigram(String word1, String word2, int frequency, boolean addFrequency) {
341 Node firstWord = searchWord(mRoots, word1, 0, null);
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/EN/
UserDictionaryToolsListEN.java 70 public int compare(WnnWord word1, WnnWord word2) {
71 return word1.stroke.compareTo(word2.stroke);
  /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/
UserDictionaryToolsListJAJP.java 67 public int compare(WnnWord word1, WnnWord word2) {
68 return word1.stroke.compareTo(word2.stroke);
  /frameworks/base/media/libstagefright/codecs/avc/enc/src/
intra_est.cpp 219 uint32 word1, word2, word3, word4; local
234 word1 = *((uint32*)(top)); /* read 4 bytes from top */
241 *((uint32*)(pred += 16)) = word1;
248 sum = word1 & 0xFF00FF;
249 word1 = (word1 >> 8) & 0xFF00FF;
250 sum += word1;
251 word1 = (word2 & 0xFF00FF);
252 sum += word1;
255 word1 = (word3 & 0xFF00FF)
    [all...]
motion_comp.cpp 1706 uint32 word1, word2, word3; local
    [all...]
  /external/v8/src/third_party/dtoa/
dtoa.c 273 #define word1(x) ((ULong *)&x)[0] macro
276 #define word1(x) ((ULong *)&x)[1] macro
281 #define word1(x) ((U*)&x)->L[0] macro
284 #define word1(x) ((U*)&x)->L[1] macro
1125 word1(a) = 0;
1133 word1(a) = 0;
1138 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
1161 #define d1 word1(d)
1208 word1(d) = d1 >> 16 | d1 << 16;
1233 d1 = word1(d) >> 16 | word1(d) << 16
    [all...]
  /external/webkit/JavaScriptCore/wtf/
dtoa.cpp 188 #define word1(x) ((uint32_t*)&x)[0] macro
191 #define word1(x) ((uint32_t*)&x)[1] macro
196 #define word1(x) (x)->L[0] macro
199 #define word1(x) (x)->L[1] macro
803 word1(&u) = 0;
810 word1(&u) = 0;
814 word1(&u) = L >= 31 ? 1 : 1 << 31 - L;
833 #define d1 word1(&d)
887 #define d1 word1(d)
1093 word1(rvp) = x[1]
    [all...]
  /external/chromium/base/third_party/dmg_fp/
dtoa.cc 308 #define word1(x) (x)->L[0] macro
311 #define word1(x) (x)->L[1] macro
1173 word1(&u) = 0;
1181 word1(&u) = 0;
1186 word1(&u) = L >= 31 ? 1 : 1 << 31 - L;
1209 #define d1 word1(&d)
1256 word1(&d) = d1 >> 16 | d1 << 16;
1281 d1 = word1(d) >> 16 | word1(d) << 16;
1284 #define d1 word1(d
    [all...]
  /bionic/libc/stdlib/
strtod.c 216 #define word1(x) ((x).ul[0]) macro
219 #define word1(x) ((x).ul[1]) macro
1028 word1(a) = 0;
1035 word1(a) = 0;
1040 word1(a) = L >= 31 ? 1 : 1 << (31 - L);
1062 #define d1 word1(d)
1112 word1(d) = d1 >> 16 | d1 << 16;
1139 d1 = word1(d) >> 16 | word1(d) << 16;
1142 #define d1 word1(d
    [all...]
  /external/chromium/base/i18n/
word_iterator_unittest.cc 77 const std::wstring word1(str.substr(0, 10));
83 EXPECT_EQ(word1, iter.GetWord());
  /packages/apps/Email/src/org/apache/james/mime4j/codec/
EncoderUtil.java 525 String word1 = encodeB(prefix, part1, usedCharacters, charset, local
532 return word1 + " " + word2;
553 String word1 = encodeQ(prefix, part1, usage, usedCharacters, local
560 return word1 + " " + word2;
  /external/chromium/sdch/open-vcdiff/src/
blockhash.cc 251 inline bool CompareWholeWordValues<1>(const char* word1,
254 memcpy(&aligned_word1, word1, sizeof(aligned_word1));
  /external/ipsec-tools/src/racoon/
eaytest.c 843 char *word1 = "1234567890", *word2 = "12345678901234567890"; local
850 buf = vmalloc(strlen(word1));
851 memcpy(buf->v, word1, buf->l);
880 char *word1 = "1234567890", *word2 = "12345678901234567890"; local
887 buf = vmalloc(strlen(word1));
888 memcpy(buf->v, word1, buf->l);
  /external/chromium/third_party/icu/source/tools/gennames/
gennames.c 283 compareWords(const void *context, const void *word1, const void *word2);
916 compareWords(const void *context, const void *word1, const void *word2) {
918 return ((Word *)word2)->weight-((Word *)word1)->weight;
    [all...]

Completed in 304 milliseconds

1 2