| /dalvik/dx/tests/074-dex-form35c-edge-case/ |
| Blort.java | 27 int i7 = 0; local
|
| /dalvik/dx/tests/084-dex-high-register-moves/ |
| Blort.java | 31 int i7 = 0; local
|
| /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;
356 // i6 and i7 loop:
362 for (i7 = ipos[7]; i7 < L_CODE; i7 += step)
364 s = L_mult (rr[i7][i7], _1_16);
365 s = L_mac (s, rr[i0][i7], _1_8);
366 s = L_mac (s, rr[i1][i7], _1_8)
568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local
[all...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 264 CodeGen::Node i7 = MakeInstruction(BPF_RET + BPF_K, 1); local
266 CodeGen::Node i5 = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, i6, i7);
314 CodeGen::Node i7 = MakeInstruction(BPF_RET + BPF_K, 1); local
316 CodeGen::Node i5 = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, i6, i7);
|
| /external/v8/test/cctest/compiler/ |
| test-instruction.cc | 161 int i7 = R.NewInstr(); local
176 CHECK_EQ(b2, R.GetBasicBlock(i7));
|
| /external/clang/test/SemaCXX/ |
| constant-expression.cpp | 54 i7 = itval, member in struct:C
|
| /frameworks/av/media/libstagefright/codecs/aacenc/src/ |
| transform.c | 113 int i4, i5, i6, i7; local
134 i7 = (i1 - r3) >> 1;
174 buf[ 3] = i7 - t2;
176 buf[11] = i7 + t2;
|
| /art/compiler/jni/ |
| jni_compiler_test.cc | 1569 jint i7 = 7; local
1639 jint i7 = 7; local
1708 jint i7 = 7; local
1767 jint i7 = 7; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOM3TreeWalker.java | 2015 int i7 = WELLFORMED; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3));
|
| is_heap_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3));
[all...] |
| is_heap_until.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap_until(i7, i7+3) == i7+1);
|
| is_heap_until_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3));
|
| is_heap_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3));
[all...] |
| is_heap_until.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap_until(i7, i7+3) == i7+1);
|
| is_heap_until_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3);
|
| /external/elfutils/tests/ |
| funcretval_test.c | 16 int i6; int i7; int i8; int i9; int i10; } large_struct2_t; member in struct:__anon12350
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 1350 int i7 = 7; local
[all...] |
| /prebuilts/tools/common/m2/repository/xalan/serializer/2.7.1/ |
| serializer-2.7.1.jar | |
