| /external/llvm/test/Transforms/SROA/ |
| vectors-of-pointers.ll | 17 br i1 undef, label %bb0.exit257, label %if.then.i.i.i.i.i237
19 if.then.i.i.i.i.i237:
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 238 @i237_s = external global i237 ; <i237*> [#uses=1]
1439 define void @i237_ls(i237 %x) nounwind {
1440 store i237 %x, i237* @i237_s
[all...] |
| APIntSextParam.ll | 238 @i237_s = external global i237 ; <i237*> [#uses=1]
[all...] |
| APIntZextParam.ll | 238 @i237_s = external global i237 ; <i237*> [#uses=1]
[all...] |
| APIntLoadStore.ll | 474 @i237_l = external global i237 ; <i237*> [#uses=1]
475 @i237_s = external global i237 ; <i237*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 379 int i237[] = {1, 1, 1, 0, 1, 0, 1}; local
506 assert(std::is_heap(i237, i237+7) == (std::is_heap_until(i237, i237+7) == i237+7));
|
| is_heap_until.pass.cpp | 379 int i237[] = {1, 1, 1, 0, 1, 0, 1}; local
506 assert(std::is_heap_until(i237, i237+7) == i237+7);
|
| is_heap_until_comp.pass.cpp | 380 int i237[] = {1, 1, 1, 0, 1, 0, 1}; local
507 assert(std::is_heap_until(i237, i237+7, std::greater<int>()) == i237+3);
|
| is_heap_comp.pass.cpp | 380 int i237[] = {1, 1, 1, 0, 1, 0, 1}; local
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| vmul.ll | 560 %vmovl.i237 = zext <8 x i8> undef to <8 x i16>
574 %mul.i194 = mul <8 x i16> %add.i198, %vmovl.i237
|
