| /external/llvm/test/Transforms/CodeGenPrepare/ |
| 2008-11-24-RAUW-Self.ll | 128 bb1.i5.mulflt.exit157_crit_edge: ; preds = %bb5.i148, %bb1.i5
132 br i1 false, label %bb3.i147.mulflt.exit157_crit_edge, label %bb5.i148
137 bb5.i148: ; preds = %bb3.i147
140 bb7.i149: ; preds = %bb5.i148
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 149 @i148_s = external global i148 ; <i148*> [#uses=1]
994 define void @i148_ls(i148 %x) nounwind {
995 store i148 %x, i148* @i148_s
[all...] |
| APIntSextParam.ll | 149 @i148_s = external global i148 ; <i148*> [#uses=1]
994 define void @i148_ls(i148 signext %x) nounwind {
995 store i148 %x, i148* @i148_s
[all...] |
| APIntZextParam.ll | 149 @i148_s = external global i148 ; <i148*> [#uses=1]
994 define void @i148_ls(i148 zeroext %x) nounwind {
995 store i148 %x, i148* @i148_s
[all...] |
| APIntLoadStore.ll | 296 @i148_l = external global i148 ; <i148*> [#uses=1]
297 @i148_s = external global i148 ; <i148*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 290 int i148[] = {0, 0, 1, 1, 1, 0, 0}; local
417 assert(std::is_heap(i148, i148+7) == (std::is_heap_until(i148, i148+7) == i148+7));
|
| is_heap_until.pass.cpp | 290 int i148[] = {0, 0, 1, 1, 1, 0, 0}; local
417 assert(std::is_heap_until(i148, i148+7) == i148+2);
|
| is_heap_until_comp.pass.cpp | 291 int i148[] = {0, 0, 1, 1, 1, 0, 0}; local
418 assert(std::is_heap_until(i148, i148+7, std::greater<int>()) == i148+5);
|
| is_heap_comp.pass.cpp | 291 int i148[] = {0, 0, 1, 1, 1, 0, 0}; local
418 assert(std::is_heap(i148, i148+7, std::greater<int>()) == (std::is_heap_until(i148, i148+7, std::greater<int>()) == i148+7));
[all...] |
