| /external/llvm/test/CodeGen/ARM/ |
| 2009-06-15-RegScavengerAssert.ll | 154 br i1 undef, label %dfg_DFGParser.exit, label %bb.i.i211
156 bb.i.i211: ; preds = %term_DeleteTermList621.exit.i
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 212 @i211_s = external global i211 ; <i211*> [#uses=1]
1309 define void @i211_ls(i211 %x) nounwind {
1310 store i211 %x, i211* @i211_s
[all...] |
| APIntSextParam.ll | 212 @i211_s = external global i211 ; <i211*> [#uses=1]
1309 define void @i211_ls(i211 signext %x) nounwind {
1310 store i211 %x, i211* @i211_s
[all...] |
| APIntZextParam.ll | 212 @i211_s = external global i211 ; <i211*> [#uses=1]
1309 define void @i211_ls(i211 zeroext %x) nounwind {
1310 store i211 %x, i211* @i211_s
[all...] |
| APIntLoadStore.ll | 422 @i211_l = external global i211 ; <i211*> [#uses=1]
423 @i211_s = external global i211 ; <i211*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 353 int i211[] = {1, 0, 1, 1, 0, 1, 1}; local
480 assert(std::is_heap(i211, i211+7) == (std::is_heap_until(i211, i211+7) == i211+7));
|
| is_heap_until.pass.cpp | 353 int i211[] = {1, 0, 1, 1, 0, 1, 1}; local
480 assert(std::is_heap_until(i211, i211+7) == i211+3);
|
| is_heap_until_comp.pass.cpp | 354 int i211[] = {1, 0, 1, 1, 0, 1, 1}; local
481 assert(std::is_heap_until(i211, i211+7, std::greater<int>()) == i211+1);
|
| is_heap_comp.pass.cpp | 354 int i211[] = {1, 0, 1, 1, 0, 1, 1}; local
[all...] |
