HomeSort by relevance Sort by last modified time
    Searched refs:i2 (Results 151 - 175 of 535) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/dropbear/libtomcrypt/testprof/
pkcs_1_test.c 9 unsigned long x, y, l1, l2, l3, i1, i2, lparamlen, saltlen, modlen; local
70 buf[1][i2 = abs(rand()) % (l1 - 1)] ^= 1;
  /external/opencv/cxcore/src/
cxdxt.cpp 560 double r0, i0, r1, i1, r2, i2, r3, i3, r4, i4;
565 r2 = v0[0].re; i2 = v0[0].im;
568 r0 = r1 + r2; i0 = i1 + i2;
569 r2 -= r1; i2 -= i1;
579 v0[nx].re = r2 + r3; v0[nx].im = i2 + i3;
580 v1[nx].re = r2 - r3; v1[nx].im = i2 - i3;
588 i2 = v0[nx].re*wave[dw*2].im + v0[nx].im*wave[dw*2].re;
598 r0 = r4 + r2; i0 = i4 + i2;
599 r2 = r4 - r2; i2 = i4 - i2;
    [all...]
  /external/skia/src/pathops/
SkDQuadImplicit.cpp 115 SkDQuadImplicit i2(quad2);
116 return i1.match(i2);
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
233 // i2 and i3 loop
251 for (i2 = ipos[2]; i2 < L_CODE; i2 += step)
254 ps1 = add (ps0, dn[i2]);
257 alp1 = L_mac (alp0, rr[i2][i2], _1_16);
260 alp1 = L_mac (alp1, rr[i0][i2], _1_8);
263 alp1 = L_mac (alp1, rr[i1][i2], _1_8)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/contenttype/parser/
ContentTypeParserTokenManager.java 195 int i2 = (curChar & 0xff) >> 6; local
203 if ((jjbitVec0[i2] & l2) == 0L)
316 int i2 = (curChar & 0xff) >> 6; local
323 if ((jjbitVec0[i2] & l2) != 0L && kind > 11)
327 if ((jjbitVec0[i2] & l2) != 0L && kind > 9)
446 int i2 = (curChar & 0xff) >> 6; local
454 if ((jjbitVec0[i2] & l2) == 0L)
461 if ((jjbitVec0[i2] & l2) != 0L && kind > 17)
571 int i2 = (curChar & 0xff) >> 6; local
578 if ((jjbitVec0[i2] & l2) != 0L && kind > 15
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/rc4/asm/
rc4-ia64.pl 220 local $i2 = $iteration - 2;
251 $i0 % $NT, $i2 % $NSI, $i1 % $NSJ) if ($p & $pComT);
258 &I(\$c, "SKEY [IPr[%u]] = SJ[%u]", $i2 % $NIP, $i1%$NSJ)if ($p & $pComT);
259 &I(\$c, "SKEY [JP[%u]] = SI[%u]", $i1 % $NJP, $i2%$NSI) if ($p & $pComT);
  /external/clang/test/CodeGen/
arm-aapcs-vfp.c 70 int i2; member in struct:heterogeneous_struct
  /external/clang/test/SemaCXX/
address-of-temporary.cpp 43 void i2() { S s = { A{} }; } // expected-warning{{pointer is initialized by a temporary array}} function in namespace:PointerToArrayDecay
overload-call-copycon.cpp 10 int& i2 = copycon(xc); local
rval-references.cpp 38 int i2 = over(i1); local
conditional-expr.cpp 42 int i1, i2, b1 : 3, b2 : 3; member in struct:Fields
141 I i2(i1 ? I() : J());
151 &(i1 ? i1 : i2); // expected-error {{cannot take the address of an rvalue}}
155 int &ir1 = i1 ? flds.i1 : flds.i2;
156 (i1 ? flds.b1 : flds.i2) = 0;
  /external/clang/test/SemaTemplate/
fun-template-def.cpp 25 int i2 = u1; local
instantiate-field.cpp 16 const int &i2 = xi->y; local
  /external/javassist/src/main/javassist/bytecode/stackmap/
TypedBlock.java 194 int i2 = desc.indexOf(';', ++i); local
196 types[n] = new TypeData.ClassName(desc.substring(i0, ++i2));
198 types[n] = new TypeData.ClassName(desc.substring(i0 + 1, ++i2 - 1)
200 return i2;
  /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/
Torus.java 197 int i2 = connectionStart; local
198 int i3 = i2 + 1;
202 sib.put((short)i2);
205 sib.put((short)i2++);
209 // getIndexBuffer().put(i2);
212 // getIndexBuffer().put(i2++);
217 // getIndexBuffer().put(i2);
220 // getIndexBuffer().put(i2++);
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SafeArrayList.java 235 Iterator i2 = other.iterator(); local
236 while( i1.hasNext() && i2.hasNext() ) {
238 Object o2 = i2.next();
244 return !(i1.hasNext() || !i2.hasNext());
  /external/openssl/crypto/rc4/asm/
rc4-ia64.pl 220 local $i2 = $iteration - 2;
251 $i0 % $NT, $i2 % $NSI, $i1 % $NSJ) if ($p & $pComT);
258 &I(\$c, "SKEY [IPr[%u]] = SJ[%u]", $i2 % $NIP, $i1%$NSJ)if ($p & $pComT);
259 &I(\$c, "SKEY [JP[%u]] = SI[%u]", $i1 % $NJP, $i2%$NSI) if ($p & $pComT);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/
mock_object.hpp 82 template<int i1, typename Base1,int i2, typename Base2> \
85 mock_object<i2,Base2> const& ) \
106 template<int i1, typename Base1,int i2, typename Base2> \
109 mock_object<i2,Base2> const& ) \
  /external/chromium_org/third_party/icu/source/common/
utrie2.cpp 38 int32_t i2, block; local
45 i2=(UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2))+
48 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
51 block=trie->index2[i2];
613 int32_t i2, i2Limit; local
614 i2=(c>>UTRIE2_SHIFT_2)&UTRIE2_INDEX_2_MASK;
620 for(; i2<i2Limit; ++i2) {
622 block=(int32_t)idx[i2Block+i2]<<UTRIE2_INDEX_SHIFT;
624 block=trie->newTrie->index2[i2Block+i2];
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/
sparccpuid.S 104 clr %i2
192 .enter: ld [%i0],%i2
193 cmp %i2,-4096
195 mov -1,%i2
196 swap [%i0],%i2
197 cmp %i2,-1
199 add %i2,%i1,%i2
201 st %i2,[%i0]
202 sra %i2,%g0,%i
    [all...]
  /external/icu4c/common/
utrie2.cpp 42 int32_t i2, block; local
49 i2=(UTRIE2_LSCP_INDEX_2_OFFSET-(0xd800>>UTRIE2_SHIFT_2))+
52 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
55 block=trie->index2[i2];
619 int32_t i2, i2Limit; local
620 i2=(c>>UTRIE2_SHIFT_2)&UTRIE2_INDEX_2_MASK;
626 for(; i2<i2Limit; ++i2) {
628 block=(int32_t)idx[i2Block+i2]<<UTRIE2_INDEX_SHIFT;
630 block=trie->newTrie->index2[i2Block+i2];
    [all...]
  /external/openssl/crypto/
sparccpuid.S 104 clr %i2
192 .enter: ld [%i0],%i2
193 cmp %i2,-4096
195 mov -1,%i2
196 swap [%i0],%i2
197 cmp %i2,-1
199 add %i2,%i1,%i2
201 st %i2,[%i0]
202 sra %i2,%g0,%i
    [all...]
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 111 int i0, i1, i2, i3; local
123 i2 = buf[5] + buf[7];
128 i4 = (i0 + i2) >> 1;
130 i5 = (i0 - i2) >> 1;
141 i2 = buf[13] + buf[15];
146 t1 = (i0 + i2) >> 1;
148 t3 = (i0 - i2) >> 1;
162 i2 = i1 - r3;
166 t2 = MULHIGH(SQRT1_2, r2 - i2);
167 t3 = MULHIGH(SQRT1_2, r2 + i2);
    [all...]
  /libcore/luni/src/test/java/tests/api/java/util/
LinkedListTest.java 355 ListIterator i2 = ll.listIterator(0); local
358 while (i2.hasNext()) {
361 assertTrue("First element claimed to have a previous", !i2
364 assertTrue("Last element claimed to have next", !i2
367 elm = i2.next();
372 i2.nextIndex() == n + 1);
374 + i2.previousIndex() + ", n val: " + n, i2
383 i2 = ll.listIterator(ll.size()/2);
384 assertTrue((Integer)i2.next() == ll.size()/2)
    [all...]
  /external/clang/test/Misc/
diag-template-diffing.cpp 70 class I2{};
71 void set2(I2<int, int>) {};
73 set2(I2<double, int, int>());
76 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'I2<double, [...], int>' to 'I2<int, [...], (default) void>' for 1st argument
78 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'I2<double, int, int>' to 'I2<int, int, (default) void>' for 1st argument
81 // CHECK-ELIDE-TREE: I2<
87 // CHECK-NOELIDE-TREE: I2<
962 int i1, i2, i3; member in namespace:VariadicDefault
    [all...]

Completed in 663 milliseconds

1 2 3 4 5 67 8 91011>>