/external/llvm/test/CodeGen/X86/ |
loop-strength-reduce6.ll | 49 %tmp165.i144.i = shl i32 %i.052.i.i, 5 ; <i32> [#uses=1] 50 %tmp165169.i.i = sext i32 %tmp165.i144.i to i64 ; <i64> [#uses=0]
|
fold-vector-shuffle-crash.ll | 217 %I144 = insertelement <4 x i64> %Shuff, i64 %4, i32 3 371 %Shuff246 = shufflevector <4 x i64> zeroinitializer, <4 x i64> %I144, <4 x i32> <i32 0, i32 2, i32 4, i32 6>
|
/external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
2012-01-13-phielim.ll | 37 %add.ptr.i144 = getelementptr inbounds i8, i8* %base, i64 %add.ptr.sum.i 38 %cmp2 = tail call i1 @foo(i8* %add.ptr.i144, i8* %add.ptr.i144, i8* undef) nounwind
|
/external/llvm/test/CodeGen/AArch64/ |
arm64-early-ifcvt.ll | 408 %rem.i144 = srem i32 %add8.i143, %x0 409 %add9.i145 = add i32 %rem.i144, 1
|
/external/llvm/test/CodeGen/Generic/ |
APIntParam.ll | 145 @i144_s = external global i144 ; <i144*> [#uses=1] 974 define void @i144_ls(i144 %x) nounwind { 975 store i144 %x, i144* @i144_s [all...] |
APIntSextParam.ll | 145 @i144_s = external global i144 ; <i144*> [#uses=1] 974 define void @i144_ls(i144 signext %x) nounwind { 975 store i144 %x, i144* @i144_s [all...] |
APIntZextParam.ll | 145 @i144_s = external global i144 ; <i144*> [#uses=1] 974 define void @i144_ls(i144 zeroext %x) nounwind { 975 store i144 %x, i144* @i144_s [all...] |
APIntLoadStore.ll | 288 @i144_l = external global i144 ; <i144*> [#uses=1] 289 @i144_s = external global i144 ; <i144*> [#uses=1] [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
is_heap.pass.cpp | 286 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 413 assert(std::is_heap(i144, i144+7) == (std::is_heap_until(i144, i144+7) == i144+7));
|
is_heap_until.pass.cpp | 286 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 413 assert(std::is_heap_until(i144, i144+7) == i144+2);
|
is_heap_until_comp.pass.cpp | 287 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 414 assert(std::is_heap_until(i144, i144+7, std::greater<int>()) == i144+5);
|
is_heap_comp.pass.cpp | 287 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 414 assert(std::is_heap(i144, i144+7, std::greater<int>()) == (std::is_heap_until(i144, i144+7, std::greater<int>()) == i144+7)); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
is_heap.pass.cpp | 286 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 413 assert(std::is_heap(i144, i144+7) == (std::is_heap_until(i144, i144+7) == i144+7));
|
is_heap_until.pass.cpp | 286 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 413 assert(std::is_heap_until(i144, i144+7) == i144+2);
|
is_heap_until_comp.pass.cpp | 287 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 414 assert(std::is_heap_until(i144, i144+7, std::greater<int>()) == i144+5);
|
is_heap_comp.pass.cpp | 287 int i144[] = {0, 0, 1, 1, 0, 0, 0}; local 414 assert(std::is_heap(i144, i144+7, std::greater<int>()) == (std::is_heap_until(i144, i144+7, std::greater<int>()) == i144+7)); [all...] |
/prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
test_syntax.py | 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144, 211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
|
/prebuilts/gdb/linux-x86/lib/python2.7/test/ |
test_syntax.py | 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144, 211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_syntax.py | 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144, 211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_syntax.py | 176 ... i136, i137, i138, i139, i140, i141, i142, i143, i144, 211 ... i136, i137, i138, i139, i140, i141, i142, i143, i144,
|
/external/autotest/client/site_tests/firmware_TouchMTB/tests/logs/lumpy/20130506_032659-fw_11.23-robot_sim/ |
touch_firmware_report-lumpy-fw_11.23-complete-20140116_103533.log | 3359 I144 [all...] |
/art/test/083-compiler-regressions/src/ |
Main.java | 1624 int i144 = 144; local [all...] |