| /external/llvm/test/Transforms/SROA/ |
| vectors-of-pointers.ll | 11 br i1 undef, label %bb0.exit158, label %if.then.i.i.i.i.i138
13 if.then.i.i.i.i.i138:
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 139 @i138_s = external global i138 ; <i138*> [#uses=1]
944 define void @i138_ls(i138 %x) nounwind {
945 store i138 %x, i138* @i138_s
[all...] |
| APIntSextParam.ll | 139 @i138_s = external global i138 ; <i138*> [#uses=1]
944 define void @i138_ls(i138 signext %x) nounwind {
945 store i138 %x, i138* @i138_s
[all...] |
| APIntZextParam.ll | 139 @i138_s = external global i138 ; <i138*> [#uses=1]
944 define void @i138_ls(i138 zeroext %x) nounwind {
945 store i138 %x, i138* @i138_s
[all...] |
| APIntLoadStore.ll | 276 @i138_l = external global i138 ; <i138*> [#uses=1]
277 @i138_s = external global i138 ; <i138*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 280 int i138[] = {0, 0, 1, 0, 0, 1, 0}; local
407 assert(std::is_heap(i138, i138+7) == (std::is_heap_until(i138, i138+7) == i138+7));
|
| is_heap_until.pass.cpp | 280 int i138[] = {0, 0, 1, 0, 0, 1, 0}; local
407 assert(std::is_heap_until(i138, i138+7) == i138+2);
|
| is_heap_until_comp.pass.cpp | 281 int i138[] = {0, 0, 1, 0, 0, 1, 0}; local
408 assert(std::is_heap_until(i138, i138+7, std::greater<int>()) == i138+6);
|
| is_heap_comp.pass.cpp | 281 int i138[] = {0, 0, 1, 0, 0, 1, 0}; local
408 assert(std::is_heap(i138, i138+7, std::greater<int>()) == (std::is_heap_until(i138, i138+7, std::greater<int>()) == i138+7));
[all...] |
| /external/llvm/test/Transforms/JumpThreading/ |
| 2010-08-26-and.ll | 147 %tmp7.i138 = and i8 %tmp2.i137, 1 ; <i8> [#uses=1]
148 %tobool.i139 = icmp eq i8 %tmp7.i138, 0 ; <i1> [#uses=1]
|
