| /dalvik/dx/tests/044-dex-math-ops/ |
| Blort.java | 24 public void blort(int i1, int i2) {
27 i = i1 + i2;
28 i = i1 - i2;
29 i = i1 * i2;
30 i = i1 / i2;
31 i = i1 % i2;
32 i = i1 & i2;
33 i = i1 | i2;
34 i = i1 ^ i2;
35 i = i1 << i2;
[all...] |
| /cts/tools/dx-tests/src/dxc/junit/opcodes/invokestatic/jm/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/invoke_static/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /cts/tools/vm-tests/src/dot/junit/opcodes/invoke_static_range/ |
| TestClass.java | 30 public static int testArgsOrder(int i1, int i2){
33 int i = i1 / i2;
|
| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 22 int i2 = 0; local
|
| /frameworks/base/libs/rs/ |
| rsUtils.h | 107 static inline uint16_t rsBoxFilter565(uint16_t i1, uint16_t i2, uint16_t i3, uint16_t i4)
109 uint32_t r = ((i1 & 0x1f) + (i2 & 0x1f) + (i3 & 0x1f) + (i4 & 0x1f));
110 uint32_t g = ((i1 >> 5) & 0x3f) + ((i2 >> 5) & 0x3f) + ((i3 >> 5) & 0x3f) + ((i4 >> 5) & 0x3f);
111 uint32_t b = ((i1 >> 11) + (i2 >> 11) + (i3 >> 11) + (i4 >> 11));
115 static inline uint32_t rsBoxFilter8888(uint32_t i1, uint32_t i2, uint32_t i3, uint32_t i4)
117 uint32_t r = (i1 & 0xff) + (i2 & 0xff) + (i3 & 0xff) + (i4 & 0xff);
118 uint32_t g = ((i1 >> 8) & 0xff) + ((i2 >> 8) & 0xff) + ((i3 >> 8) & 0xff) + ((i4 >> 8) & 0xff);
119 uint32_t b = ((i1 >> 16) & 0xff) + ((i2 >> 16) & 0xff) + ((i3 >> 16) & 0xff) + ((i4 >> 16) & 0xff);
120 uint32_t a = ((i1 >> 24) & 0xff) + ((i2 >> 24) & 0xff) + ((i3 >> 24) & 0xff) + ((i4 >> 24) & 0xff);
|
| /external/icu4c/test/cintltst/ |
| citertst.h | 110 static void assertEqual(UCollationElements *i1, UCollationElements *i2);
|
| /external/webkit/WebKitTools/Scripts/ |
| find-extra-includes | 86 for my $i2 (keys %{ $includes{$file} }) {
87 next if $i1 eq $i2;
88 if ($totalIncludes{$i2}{$i1}) {
93 print "$paths{$file} does not need to include $i1, because $i2 does\n" if $b1 ne $b2;
|
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| umultiset.h | 43 inline multiset (const_iterator i1, const_iterator i2) : vector<T> () { insert (i1, i2); }
50 inline void assign (const_iterator i1, const_iterator i2);
54 void insert (const_iterator i1, const_iterator i2);
61 /// Copies contents of range [i1,i2)
63 inline void multiset<T>::assign (const_iterator i1, const_iterator i2)
66 insert (i1, i2);
85 /// Inserts all elements from range [i1,i2).
87 void multiset<T>::insert (const_iterator i1, const_iterator i2)
89 assert (i1 <= i2);
[all...] |
| uset.h | 43 inline set (const_iterator i1, const_iterator i2) : vector<T> () { insert (i1, i2); }
50 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); }
55 inline void insert (const_iterator i1, const_iterator i2);
74 /// Inserts the contents of range [i1,i2)
76 void set<T>::insert (const_iterator i1, const_iterator i2)
78 assert (i1 <= i2);
79 reserve (size() + distance (i1, i2));
80 for (; i1 < i2; ++i1
[all...] |
| umap.h | 48 inline map (const_iterator i1, const_iterator i2) : vector<pair<K,V> >() { insert (i1, i2); }
57 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); }
64 void insert (const_iterator i1, const_iterator i2);
143 /// Inserts elements from range [i1,i2) into the container.
145 void map<K,V>::insert (const_iterator i1, const_iterator i2)
147 assert (i1 <= i2);
148 reserve (size() + distance (i1, i2));
149 for (; i1 != i2; ++i1
[all...] |
| /external/bzip2/ |
| blocksort.c | 348 UInt32 i2,
358 AssertD ( i1 != i2, "mainGtU" );
360 c1 = block[i1]; c2 = block[i2];
362 i1++; i2++;
364 c1 = block[i1]; c2 = block[i2];
366 i1++; i2++;
368 c1 = block[i1]; c2 = block[i2];
370 i1++; i2++;
372 c1 = block[i1]; c2 = block[i2];
374 i1++; i2++
[all...] |
| /dalvik/dx/tests/084-dex-high-register-moves/ |
| Blort.java | 26 int i2 = 0; local
|
| /external/webkit/JavaScriptCore/wtf/ |
| TCPageMap.h | 130 const Number i2 = k & (LEAF_LENGTH-1); local
131 return root_[i1]->values[i2];
137 const Number i2 = k & (LEAF_LENGTH-1); local
138 root_[i1]->values[i2] = v;
232 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
234 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
240 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
242 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
248 const Number i2 = (key >> LEAF_BITS) & (INTERIOR_LENGTH-1); local
258 if (root_->ptrs[i1]->ptrs[i2] == NULL)
[all...] |
| /external/openssl/crypto/0.9.9-dev/aes/ |
| aes-armv4.pl | 33 $i2="r8";
246 and $i2,lr,$s0,lsr#8
252 ldr $t2,[$tbl,$i2,lsl#2] @ Te2[s0>>8]
256 and $i2,lr,$s1
261 ldr $i2,[$tbl,$i2,lsl#2] @ Te3[s1>>0]
265 eor $t2,$t2,$i2,ror#8
269 and $i2,lr,$s2,lsr#16 @ i1
273 ldr $i2,[$tbl,$i2,lsl#2] @ Te1[s2>>16
[all...] |
| /external/stlport/src/ |
| locale.cpp | 299 _Locale_impl* i2 = L2._M_impl; local
308 impl->insert( i2, _STLP_STD::collate<char>::id);
310 impl->insert( i2, _STLP_STD::collate<wchar_t>::id);
314 impl->insert( i2, _STLP_STD::ctype<char>::id);
315 impl->insert( i2, _STLP_STD::codecvt<char, char, mbstate_t>::id);
317 impl->insert( i2, _STLP_STD::ctype<wchar_t>::id);
318 impl->insert( i2, _STLP_STD::codecvt<wchar_t, char, mbstate_t>::id);
322 impl->insert( i2, _STLP_STD::moneypunct<char, true>::id);
323 impl->insert( i2, _STLP_STD::moneypunct<char, false>::id);
324 impl->insert( i2, _STLP_STD::money_get<char, istreambuf_iterator<char, char_traits<char> > >::id)
[all...] |
| /external/opencore/codecs_v2/audio/gsm_amr/amr_nb/enc/src/ |
| c4_17pf.cpp | 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
172 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
396 Word16 i2; local
513 * i2 loop: 8 positions. *
528 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
531 /* ps1 = add(ps0, dn[i2], pOverflow); */
532 ps1 = ps0 + dn[i2];
534 /* alp1 = alp0 + rr[i0][i2] + rr[i1][i2] + 1/2*rr[i2][i2]; *
[all...] |
| c3_14pf.cpp | 155 The code length is 40, containing 3 nonzero pulses: i0...i2.
157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
163 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
383 Word16 i2; local
460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" *
503 * i2 loop: 8 positions. *
518 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
521 /* ps1 = add(ps0, dn[i2], pOverflow); *
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
| c4_17pf.cpp | 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
172 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
396 Word16 i2; local
513 * i2 loop: 8 positions. *
528 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
531 /* ps1 = add(ps0, dn[i2], pOverflow); */
532 ps1 = ps0 + dn[i2];
534 /* alp1 = alp0 + rr[i0][i2] + rr[i1][i2] + 1/2*rr[i2][i2]; *
[all...] |
| c3_14pf.cpp | 155 The code length is 40, containing 3 nonzero pulses: i0...i2.
157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have
163 i2 : 2, 7, 12, 17, 22, 27, 32, 37.
383 Word16 i2; local
460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" *
503 * i2 loop: 8 positions. *
518 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP)
521 /* ps1 = add(ps0, dn[i2], pOverflow); *
[all...] |
| /dalvik/libcore/math/src/test/java/tests/api/java/math/ |
| BigIntegerTest.java | 1167 BigInteger i1 = element[0], i2 = element[1]; local
1189 BigInteger i1 = element[0], i2 = element[1]; local
1211 BigInteger i1 = element[0], i2 = element[1]; local
1253 BigInteger i1 = element[0], i2 = element[1]; local
1425 testDiv(i1.negate(), i2); local
[all...] |
| /dalvik/libcore/luni/src/main/java/java/lang/ |
| Math.java | 550 * @param i2
552 * @return the larger of {@code i1} and {@code i2}.
554 public static int max(int i1, int i2) {
555 return i1 > i2 ? i1 : i2;
652 * @param i2
654 * @return the smaller of {@code i1} and {@code i2}.
656 public static int min(int i1, int i2) {
657 return i1 < i2 ? i1 : i2;
[all...] |
| /external/apache-http/src/org/apache/http/message/ |
| BasicHeaderValueParser.java | 382 int i2 = pos; local
384 while (i1 < i2 && (HTTP.isWhitespace(buffer.charAt(i1)))) {
388 while ((i2 > i1) && (HTTP.isWhitespace(buffer.charAt(i2 - 1)))) {
389 i2--;
392 if (((i2 - i1) >= 2)
394 && (buffer.charAt(i2 - 1) == '"')) {
396 i2--;
398 value = buffer.substring(i1, i2);
|
| /external/apache-http/src/org/apache/http/util/ |
| ByteArrayBuffer.java | 106 for (int i1 = off, i2 = oldlen; i2 < newlen; i1++, i2++) {
107 this.buffer[i2] = (byte) b[i1];
|
| /external/icu4c/test/intltest/ |
| itercoll.h | 109 void assertEqual(CollationElementIterator &i1, CollationElementIterator &i2);
|
