| /external/llvm/test/CodeGen/ARM/ |
| 2012-05-29-TailDupBug.ll | 61 br label %for.body.i146.i
63 for.body.i146.i: ; preds = %for.body.i146.i, %if.end.i20
64 br i1 undef, label %if.end20.i, label %for.body.i146.i
66 if.end20.i: ; preds = %for.body.i146.i
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 147 @i146_s = external global i146 ; <i146*> [#uses=1]
984 define void @i146_ls(i146 %x) nounwind {
985 store i146 %x, i146* @i146_s
[all...] |
| APIntSextParam.ll | 147 @i146_s = external global i146 ; <i146*> [#uses=1]
984 define void @i146_ls(i146 signext %x) nounwind {
985 store i146 %x, i146* @i146_s
[all...] |
| APIntZextParam.ll | 147 @i146_s = external global i146 ; <i146*> [#uses=1]
984 define void @i146_ls(i146 zeroext %x) nounwind {
985 store i146 %x, i146* @i146_s
[all...] |
| APIntLoadStore.ll | 292 @i146_l = external global i146 ; <i146*> [#uses=1]
293 @i146_s = external global i146 ; <i146*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 288 int i146[] = {0, 0, 1, 1, 0, 1, 0}; local
415 assert(std::is_heap(i146, i146+7) == (std::is_heap_until(i146, i146+7) == i146+7));
|
| is_heap_until.pass.cpp | 288 int i146[] = {0, 0, 1, 1, 0, 1, 0}; local
415 assert(std::is_heap_until(i146, i146+7) == i146+2);
|
| is_heap_until_comp.pass.cpp | 289 int i146[] = {0, 0, 1, 1, 0, 1, 0}; local
416 assert(std::is_heap_until(i146, i146+7, std::greater<int>()) == i146+6);
|
| is_heap_comp.pass.cpp | 289 int i146[] = {0, 0, 1, 1, 0, 1, 0}; local
416 assert(std::is_heap(i146, i146+7, std::greater<int>()) == (std::is_heap_until(i146, i146+7, std::greater<int>()) == i146+7));
[all...] |
