| /external/llvm/test/CodeGen/X86/ |
| insert-positions.ll | 10 br i1 undef, label %if.then.i.i224.i, label %while.cond.backedge.i.i.i
15 if.then.i.i224.i: ; preds = %while.body.i.i221.i
22 sw.bb.i.i225.i: ; preds = %if.then.i.i224.i, %if.then.i.i224.i
25 sw.bb21.i.i.i: ; preds = %if.then.i.i224.i
28 for.cond.i.i226.i: ; preds = %for.body.i.i.i, %if.then.i.i224.i
29 %0 = phi i64 [ %tmp154.i.i.i, %for.body.i.i.i ], [ 0, %if.then.i.i224.i ] ; <i64> [#uses=2]
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 225 @i224_s = external global i224 ; <i224*> [#uses=1]
1374 define void @i224_ls(i224 %x) nounwind {
1375 store i224 %x, i224* @i224_s
[all...] |
| APIntSextParam.ll | 225 @i224_s = external global i224 ; <i224*> [#uses=1]
[all...] |
| APIntZextParam.ll | 225 @i224_s = external global i224 ; <i224*> [#uses=1]
[all...] |
| APIntLoadStore.ll | 448 @i224_l = external global i224 ; <i224*> [#uses=1]
449 @i224_s = external global i224 ; <i224*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 366 int i224[] = {1, 1, 0, 1, 0, 0, 0}; local
493 assert(std::is_heap(i224, i224+7) == (std::is_heap_until(i224, i224+7) == i224+7));
|
| is_heap_until.pass.cpp | 366 int i224[] = {1, 1, 0, 1, 0, 0, 0}; local
493 assert(std::is_heap_until(i224, i224+7) == i224+7);
|
| is_heap_until_comp.pass.cpp | 367 int i224[] = {1, 1, 0, 1, 0, 0, 0}; local
494 assert(std::is_heap_until(i224, i224+7, std::greater<int>()) == i224+2);
|
| is_heap_comp.pass.cpp | 367 int i224[] = {1, 1, 0, 1, 0, 0, 0}; local
[all...] |
