HomeSort by relevance Sort by last modified time
    Searched defs:i6 (Results 1 - 21 of 21) sorted by null

  /external/clang/test/CXX/lex/lex.literal/lex.ext/
p5.cpp 14 double &i6 = u\ variable
p6.cpp 14 double &i6 = L'a'_x1; // ok variable
  /dalvik/dx/tests/074-dex-form35c-edge-case/
Blort.java 26 int i6 = 0; local
  /dalvik/dx/tests/084-dex-high-register-moves/
Blort.java 30 int i6 = 0; local
  /external/clang/test/Sema/
tentative-decls.c 52 extern int i6; // expected-note {{previous definition is here}}
53 static int i6; // expected-error{{static declaration of 'i6' follows non-static declaration}} local
  /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/
s10_8pf.cpp 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
356 // i6 and i7 loop:
381 for (i6 = ipos[6]; i6 < L_CODE; i6 += step)
383 ps1 = add (ps0, dn[i6]);
385 alp1 = L_mac (alp0, rr[i6][i6], _1_64);
386 alp1 = L_mac (alp1, rr[i0][i6], _1_32);
387 alp1 = L_mac (alp1, rr[i1][i6], _1_32)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
    [all...]
  /external/clang/test/SemaCXX/
constant-expression.cpp 53 i6 = Struct::seval, member in struct:C
  /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 };
346 hash_combine(i1, i2, i3, i4, i5, i6));
  /external/qemu/
qemu-sockets.c 68 struct sockaddr_in6 *i6; local
72 i6 = (void*)e->ai_addr;
73 return ntohs(i6->sin6_port);
85 struct sockaddr_in6 *i6; local
89 i6 = (void*)e->ai_addr;
90 i6->sin6_port = htons(port);
  /external/aac/libFDK/src/
FDK_hybrid.cpp 463 FIXP_DBL i1, i6; local
473 i6 = fMultDiv2(p[6], pQmfImag[pReadIdx[6]]) ;
477 mHybridImag[1] = (i1 + i6) << 1;
480 mHybridImag[0] = (i6 - i1) << 1;
484 mHybridImag[0] = (i1 + i6) << 1;
487 mHybridImag[1] = (i6 - i1) << 1;
  /frameworks/av/media/libstagefright/codecs/aacenc/src/
transform.c 113 int i4, i5, i6, i7; local
132 i6 = (i1 + r3) >> 1;
170 buf[ 7] = i6 - t1;
172 buf[15] = i6 + t1;
  /frameworks/rs/
rsFont.cpp 593 int32_t i6 = i * 6; local
596 indexPtr[i6 + 0] = i4 + 0;
597 indexPtr[i6 + 1] = i4 + 1;
598 indexPtr[i6 + 2] = i4 + 2;
600 indexPtr[i6 + 3] = i4 + 0;
601 indexPtr[i6 + 4] = i4 + 2;
602 indexPtr[i6 + 5] = i4 + 3;
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
cs46xx_dsp_scb_types.h 1136 u32 i6; member in struct:dsp_magic_snoop_task
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/
cs46xx_dsp_scb_types.h 1136 u32 i6; member in struct:dsp_magic_snoop_task
  /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/
DOM3TreeWalker.java 2008 int i6 = SPLITCDATA; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
is_heap.pass.cpp 32 int i6[] = {0, 1, 0}; local
39 assert(std::is_heap(i6, i6+3) == (std::is_heap_until(i6, i6+3) == i6+3));
is_heap_comp.pass.cpp 33 int i6[] = {0, 1, 0}; local
40 assert(std::is_heap(i6, i6+3, std::greater<int>()) == (std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3));
    [all...]
is_heap_until.pass.cpp 32 int i6[] = {0, 1, 0}; local
39 assert(std::is_heap_until(i6, i6+3) == i6+1);
is_heap_until_comp.pass.cpp 33 int i6[] = {0, 1, 0}; local
40 assert(std::is_heap_until(i6, i6+3, std::greater<int>()) == i6+3);
  /packages/providers/ContactsProvider/tests/src/com/android/providers/contacts/
ContactsProvider2Test.java 7982 final DatabaseAsserts.ContactIdPair i6 = DatabaseAsserts.assertAndCreateContact(mResolver); local
    [all...]
  /art/test/083-compiler-regressions/src/
Main.java 262 int i6 = 6; local
    [all...]

Completed in 1245 milliseconds