| /external/llvm/test/CodeGen/PowerPC/ |
| 2009-03-17-LSRBug.ll | 42 br label %bb7.i161
44 bb7.i161: ; preds = %bb7.i161, %bb50
45 %pj.0.rec.i156 = phi i32 [ %indvar.next394, %bb7.i161 ], [ 0, %bb50 ] ; <i32> [#uses=2]
50 br label %bb7.i161
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 162 @i161_s = external global i161 ; <i161*> [#uses=1]
1059 define void @i161_ls(i161 %x) nounwind {
1060 store i161 %x, i161* @i161_s
[all...] |
| APIntSextParam.ll | 162 @i161_s = external global i161 ; <i161*> [#uses=1]
1059 define void @i161_ls(i161 signext %x) nounwind {
1060 store i161 %x, i161* @i161_s
[all...] |
| APIntZextParam.ll | 162 @i161_s = external global i161 ; <i161*> [#uses=1]
1059 define void @i161_ls(i161 zeroext %x) nounwind {
1060 store i161 %x, i161* @i161_s
[all...] |
| APIntLoadStore.ll | 322 @i161_l = external global i161 ; <i161*> [#uses=1]
323 @i161_s = external global i161 ; <i161*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 303 int i161[] = {0, 1, 0, 1, 0, 0, 1}; local
430 assert(std::is_heap(i161, i161+7) == (std::is_heap_until(i161, i161+7) == i161+7));
|
| is_heap_until.pass.cpp | 303 int i161[] = {0, 1, 0, 1, 0, 0, 1}; local
430 assert(std::is_heap_until(i161, i161+7) == i161+1);
|
| is_heap_until_comp.pass.cpp | 304 int i161[] = {0, 1, 0, 1, 0, 0, 1}; local
431 assert(std::is_heap_until(i161, i161+7, std::greater<int>()) == i161+4);
|
| is_heap_comp.pass.cpp | 304 int i161[] = {0, 1, 0, 1, 0, 0, 1}; local
431 assert(std::is_heap(i161, i161+7, std::greater<int>()) == (std::is_heap_until(i161, i161+7, std::greater<int>()) == i161+7));
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 436 br i1 false, label %bb12.i161, label %bb11.i160
438 bb12.i161: ; preds = %bb11.i160
441 bb15.i165.preheader: ; preds = %bb12.i161
771 bb129: ; preds = %parse.exit, %bb22.i173, %bb18.i168, %bb16.i166, %bb12.i161, %bb10.i159, %bb9.i158, %bb8.i157, %bb7.i156, %bb5.i154, %bb4.i153
[all...] |
