HomeSort by relevance Sort by last modified time
    Searched defs:i3 (Results 26 - 50 of 89) sorted by null

12 3 4

  /external/clang/test/SemaTemplate/
instantiate-field.cpp 18 int i3 = xi->bitfield; local
  /external/eigen/Eigen/src/LU/
Inverse.h 189 (const MatrixBase<Derived>& matrix, int i1, int i2, int i3, int j1, int j2, int j3)
192 * (matrix.coeff(i2,j2) * matrix.coeff(i3,j3) - matrix.coeff(i2,j3) * matrix.coeff(i3,j2));
201 i3 = (i+3) % 4, enumerator in enum:Eigen::internal::__anon17891
206 return general_det3_helper(matrix, i1, i2, i3, j1, j2, j3)
207 + general_det3_helper(matrix, i2, i3, i1, j1, j2, j3)
208 + general_det3_helper(matrix, i3, i1, i2, j1, j2, j3);
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 75 loops i3-i5-i7 and i9
190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
233 // i2 and i3 loop
236 for (i3 = ipos[3]; i3 < L_CODE; i3 += step)
238 s = L_mult (rr[i3][i3], _1_8); // index incr= step+L_CODE
239 s = L_mac (s, rr[i0][i3], _1_4); // index increment = step
240 s = L_mac (s, rr[i1][i3], _1_4); // index increment = ste
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
c4_17pf.cpp 165 The code length is 40, containing 4 nonzero pulses: i0...i3.
167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have
173 i3 : 3, 8, 13, 18, 23, 28, 33, 38.
397 Word16 i3; local
472 * "rr[i0][i3]" is a pointer initialized to "&rr[i0][ipos[3]]" *
571 * i3 loop: 8 positions. *
584 for (i3 = ipos[3]; i3 < L_CODE; i3 += STEP)
586 /* ps1 = add(ps0, dn[i3], pOverflow); *
    [all...]
  /frameworks/rs/java/tests/RSTest_CompatLib/src/com/android/rs/test/
UT_instance.java 80 int i3[] = new int[1]; local
86 ai3.copyTo(i3);
92 assertEquals(3, i3[0]);
97 assertEquals(3, i3[0]);
  /external/apache-harmony/security/src/test/api/java.injected/java/security/
IdentityTest.java 67 Identity i3 = new IdentityStub("testEquals3"); local
68 assertEquals(i1.identityEquals(i3), i1.equals(i3));
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 176 int i3 = k /n2; local
178 assertTrue("non-equality: i1="+ i1 +" i2="+i2 +" i3="+i3 +" i4=" +i4,
179 bytes1[i1][i2] == bytes2[i3][i4]);
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 453 const Number i3 = k & (LEAF_LENGTH-1); local
458 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
465 const Number i3 = k & (LEAF_LENGTH-1); local
466 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
512 for (Number i3 = (k & (LEAF_LENGTH-1)); i3 < LEAF_LENGTH; i3++) {
513 if (leaf->values[i3] != NULL) {
514 return leaf->values[i3];
  /external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.constexpr/
p1.cpp 91 constexpr int i3 = ft(1); variable
  /external/clang/test/SemaCXX/
constant-expression.cpp 50 i3 = cval, member in struct:C
member-expr.cpp 16 int i3 = x.Enumerator; local
overloaded-builtin-operators.cpp 44 int i3 = ~s; local
  /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/
Torus.java 198 int i3 = i2 + 1; local
206 sib.put((short)i3++);
213 // getIndexBuffer().put(i3++);
219 // getIndexBuffer().put(i3++);
Cylinder.java 365 int i3 = i2 + 1; local
379 ib.put(index++, inverted ? vertCount - 1 : i3++);
380 ib.put(index++, inverted ? i3++ : vertCount - 1);
386 ib.put(index++, inverted ? i2++ : i3++);
387 ib.put(index++, inverted ? i3++ : i2++);
Sphere.java 321 int i3 = i2 + 1; local
328 idxBuf.put((short) i3++);
336 idxBuf.put((short) i3++);
  /external/llvm/unittests/ADT/
HashingTest.cpp 337 const int i1 = 42, i2 = 43, i3 = 123, i4 = 999, i5 = 0, i6 = 79; local
338 const int arr1[] = { i1, i2, i3, i4, i5, i6 };
341 EXPECT_EQ(hash_combine_range(arr1, arr1 + 3), hash_combine(i1, i2, i3));
342 EXPECT_EQ(hash_combine_range(arr1, arr1 + 4), hash_combine(i1, i2, i3, i4));
344 hash_combine(i1, i2, i3, i4, i5));
346 hash_combine(i1, i2, i3, i4, i5, i6));
373 EXPECT_NE(hash_combine(i1, i2, i3), hash_combine((char)i1, i2, i3));
374 EXPECT_NE(hash_combine(i1, i2, i3), hash_combine(i1, (char)i2, i3));
    [all...]
  /external/tcpdump/
print-atalk.c 554 int i1, i2, i3; local
559 if (sscanf(line, "%d.%d.%d %256s", &i1, &i2, &i3,
562 i3 |= ((i1 << 8) | i2) << 8;
566 i3 = (((i1 << 8) | i2) << 8) | 255;
570 for (tp = &hnametable[i3 & (HASHNAMESIZE-1)];
573 tp->addr = i3;
  /external/valgrind/main/perf/
ffbench.c 172 register int i1, i2, i3; local
192 for (i3 = i1; i3 <= ip3; i3 += ip2) {
193 i3rev = i2rev + i3 - i2;
194 SWAP(data[i3], data[i3rev]);
195 SWAP(data[i3 + 1], data[i3rev + 1]);
215 for (i3 = 1; i3 <= ifp1; i3 += ip1)
    [all...]
  /frameworks/base/core/java/android/net/
SntpClient.java 175 int i3 = ((b3 & 0x80) == 0x80 ? (b3 & 0x7F) + 0x80 : b3); local
177 return ((long)i0 << 24) + ((long)i1 << 16) + ((long)i2 << 8) + (long)i3;
  /libcore/luni/src/test/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 168 int i3 = k / n2; local
170 assertTrue("non-equality: i1=" + i1 + " i2=" + i2 + " i3=" + i3 + " i4=" + i4,
171 bytes1[i1][i2] == bytes2[i3][i4]);
  /libcore/luni/src/test/java/tests/java/security/
IdentityTest.java 73 Identity i3 = new IdentityStub("testEquals3"); local
74 assertEquals(i1.identityEquals(i3), i1.equals(i3));
  /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/lang/
IntegerTest.java 218 Integer i3 = new Integer(-1000); local
219 assertTrue("Equality test failed", i1.equals(i2) && !(i1.equals(i3)));
    [all...]
  /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/
p7-cxx11-nowarn.cpp 157 Agg<int> i3 = {0x80000000U}; // expected-warning {{ cannot be narrowed }} expected-note {{override}} local
  /external/opencv/cvaux/src/
cvsegment.cpp 367 char *i0, *i1, *i3, *i4 = 0; local
409 i3 = i0;
419 i4 = i3 + deltas[++s];
428 *i3 = (char) (nbd | -128);
430 else if( *i3 > 0 )
432 *i3 = nbd;
444 if( i4 == i0 && i3 == i1 )
447 i3 = i4;
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 111 int i0, i1, i2, i3; local
125 i3 = buf[5] - buf[7];
131 r6 = (r1 - i3) >> 1;
133 r7 = (r1 + i3) >> 1;
143 i3 = buf[13] - buf[15];
159 r0 = r1 - i3;
161 r2 = r1 + i3;

Completed in 1484 milliseconds

12 3 4