| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 29 int i9 = 0; local
|
| /dalvik/dx/tests/084-dex-high-register-moves/ |
| Blort.java | 33 int i9 = 0; local
|
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| s10_8pf.cpp | 75 loops i3-i5-i7 and i9
76 5. Use array Index[] to store indexes i1:i9, and then use memcpy
190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9;
424 // i8 and i9 loop:
430 for (i9 = ipos[9]; i9 < L_CODE; i9 += step)
432 s = L_mult (rr[i9][i9], _1_16);
433 s = L_mac (s, rr[i0][i9], _1_8)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
[all...] |
| /external/clang/test/SemaCXX/ |
| constant-expression.cpp | 56 i9 = (int)1.5, member in struct:C
|
| /art/compiler/jni/ |
| jni_compiler_test.cc | 1584 jint i9 = 9; local
1655 jint i9 = 9; local
1725 jint i9 = 9; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvlmeds.cpp | 585 int i3, i9, j, num3, its = 0, a, t; local
609 for( i3 = 0, i9 = 0; i3 < num3; i3 += 3, i9 += 9 )
640 U[i9 + j] = w * (double) ml[i3 + j / 3] * (double) mr[i3 + j % 3];
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 35 int i9[] = {1, 0, 1}; local
42 assert(std::is_heap(i9, i9+3) == (std::is_heap_until(i9, i9+3) == i9+3));
|
| is_heap_comp.pass.cpp | 36 int i9[] = {1, 0, 1}; local
43 assert(std::is_heap(i9, i9+3, std::greater<int>()) == (std::is_heap_until(i9, i9+3, std::greater<int>()) == i9+3));
[all...] |
| is_heap_until.pass.cpp | 35 int i9[] = {1, 0, 1}; local
42 assert(std::is_heap_until(i9, i9+3) == i9+3);
|
| is_heap_until_comp.pass.cpp | 36 int i9[] = {1, 0, 1}; local
43 assert(std::is_heap_until(i9, i9+3, std::greater<int>()) == i9+1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 35 int i9[] = {1, 0, 1}; local
42 assert(std::is_heap(i9, i9+3) == (std::is_heap_until(i9, i9+3) == i9+3));
|
| is_heap_comp.pass.cpp | 36 int i9[] = {1, 0, 1}; local
43 assert(std::is_heap(i9, i9+3, std::greater<int>()) == (std::is_heap_until(i9, i9+3, std::greater<int>()) == i9+3));
[all...] |
| is_heap_until.pass.cpp | 35 int i9[] = {1, 0, 1}; local
42 assert(std::is_heap_until(i9, i9+3) == i9+3);
|
| is_heap_until_comp.pass.cpp | 36 int i9[] = {1, 0, 1}; local
43 assert(std::is_heap_until(i9, i9+3, std::greater<int>()) == i9+1);
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 1335 int i9 = 9; local
[all...] |
