| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 156 @i155_s = external global i155 ; <i155*> [#uses=1]
1029 define void @i155_ls(i155 %x) nounwind {
1030 store i155 %x, i155* @i155_s
[all...] |
| APIntSextParam.ll | 156 @i155_s = external global i155 ; <i155*> [#uses=1]
1029 define void @i155_ls(i155 signext %x) nounwind {
1030 store i155 %x, i155* @i155_s
[all...] |
| APIntZextParam.ll | 156 @i155_s = external global i155 ; <i155*> [#uses=1]
1029 define void @i155_ls(i155 zeroext %x) nounwind {
1030 store i155 %x, i155* @i155_s
[all...] |
| APIntLoadStore.ll | 310 @i155_l = external global i155 ; <i155*> [#uses=1]
311 @i155_s = external global i155 ; <i155*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 297 int i155[] = {0, 1, 0, 0, 0, 1, 1}; local
424 assert(std::is_heap(i155, i155+7) == (std::is_heap_until(i155, i155+7) == i155+7));
|
| is_heap_until.pass.cpp | 297 int i155[] = {0, 1, 0, 0, 0, 1, 1}; local
424 assert(std::is_heap_until(i155, i155+7) == i155+1);
|
| is_heap_until_comp.pass.cpp | 298 int i155[] = {0, 1, 0, 0, 0, 1, 1}; local
425 assert(std::is_heap_until(i155, i155+7, std::greater<int>()) == i155+3);
|
| is_heap_comp.pass.cpp | 298 int i155[] = {0, 1, 0, 0, 0, 1, 1}; local
425 assert(std::is_heap(i155, i155+7, std::greater<int>()) == (std::is_heap_until(i155, i155+7, std::greater<int>()) == i155+7));
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 412 br i1 false, label %bb129, label %bb6.i155.preheader
414 bb6.i155.preheader: ; preds = %bb5.i154
415 br label %bb6.i155
417 bb6.i155: ; preds = %bb6.i155, %bb6.i155.preheader
418 br i1 false, label %bb7.i156, label %bb6.i155
420 bb7.i156: ; preds = %bb6.i155
[all...] |
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2006-06-12-InfLoop.ll | 411 %tmp.13.i155 = icmp slt i32 0, 0 ; <i1> [#uses=1]
412 br i1 %tmp.13.i155, label %no_exit.0.i31, label %loopentry.1.i30.loopexit
|
