| /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
|
| /external/llvm/test/tools/llvm-nm/X86/ |
| radix.s | 74 .type i9,@object # @i9
75 .globl i9
77 i9: label
79 .size i9, 4
214 //CHECK: 0000000000000032 D i9
240 //OCTAL: 0000000000000040 D i9
266 //HEX: 0000000000000020 D i9
|
| /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/r8/src/test/debugTestResources/ |
| Locals.java | 46 int i9 = 9; local
50 invokeRange(i6, i5, i4, i3, i2, i1, invokeRange(i12, i11, i10, i9, i8, i7, 0));
|
| /external/clang/test/SemaCXX/ |
| constant-expression.cpp | 56 i9 = (int)1.5, member in struct:C
|
| /external/Microsoft-GSL/tests/ |
| multi_span_tests.cpp | 1303 index<3> i9 = {}; local
1334 index<1> i9 = {}; local
[all...] |
| /prebuilts/go/darwin-x86/test/ |
| live.go | 139 var i9 interface{} var
143 x := i9
145 i9 = y // make y escape so the line above has to call convT2E
|
| /prebuilts/go/linux-x86/test/ |
| live.go | 139 var i9 interface{} var
143 x := i9
145 i9 = y // make y escape so the line above has to call convT2E
|
| /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...] |
| /art/compiler/jni/ |
| jni_compiler_test.cc | 1996 jint i9 = 9; local
2066 jint i9 = 9; local
2135 jint i9 = 9; local
[all...] |
| /external/libcxx/test/std/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);
|
| /external/python/cpython2/Modules/ |
| _cursesmodule.c | 2538 int i1=0,i2=0,i3=0,i4=0,i5=0,i6=0,i7=0,i8=0,i9=0; local
[all...] |
| /frameworks/ml/nn/runtime/test/generated/models/ |
| mobilenet_224_gender_basic_fixed.model.py | 144 i9 = Internal("op9", "TENSOR_FLOAT32", "{1, 14, 14, 128}") # intermediate result variable
[all...] |
| /frameworks/ml/nn/runtime/test/specs/ |
| mobilenet_quantized.mod.py | 145 i9 = Parameter("op9", "TENSOR_QUANT8_ASYMM", "{1, 3, 3, 32}, 0.254282623529, 129", [28, 128, 126, 132, 128, 130, 129, 128, 24, 129, 129, 130, 144, 126, 110, 109, 101, 129, 127, 129, 74, 131, 128, 130, 129, 131, 129, 129, 129, 130, 128, 128, 10, 126, 172, 147, 131, 131, 130, 125, 57, 129, 128, 127, 146, 130, 145, 131, 99, 130, 110, 133, 88, 5, 129, 129, 129, 126, 129, 130, 129, 131, 129, 128, 13, 130, 127, 211, 133, 129, 129, 130, 27, 129, 129, 135, 126, 130, 130, 111, 148, 129, 127, 126, 41, 68, 129, 129, 129, 129, 129, 129, 129, 127, 129, 128, 73, 130, 130, 129, 126, 126, 130, 132, 1, 128, 130, 132, 111, 96, 147, 112, 90, 130, 128, 102, 62, 171, 130, 177, 129, 132, 129, 134, 128, 127, 127, 128, 49, 140, 89, 86, 128, 121, 124, 139, 15, 128, 134, 140, 119, 164, 114, 115, 99, 130, 130, 149, 143, 249, 133, 79, 128, 147, 126, 119, 132, 116, 135, 128, 21, 126, 130, 87, 131, 131, 129, 127, 15, 129, 129, 125, 131, 128, 128, 122, 116, 129, 128, 136, 74, 103, 128, 129, 129, 127, 130, 129, 129, 134, 128, 128, 146, 126, 129, 115, 129, 132, 129, 125, 13, 129, 129, 136, 132, 129, 128, 109, 96, 129, 133, 121, 67, 148, 128, 127, 128, 123, 129, 129, 129, 131, 129, 129, 68, 130, 128, 119, 129, 128, 130, 131, 14, 129, 128, 135, 124, 129, 129, 116, 77, 130, 146, 141, 102, 255, 130, 130, 128, 117, 129, 131, 128, 130, 128, 129, 122, 128, 130, 119, 131, 130, 129, 127, 0, 129, 129, 124, 130, 128, 129, 126, 125, 129, 132, 125, 80, 187, 129, 130, 128, 130, 129, 129, 129, 128, 128, 130]) # parameters variable
[all...] |
| /prebuilts/ndk/r11/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);
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/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);
|
