| /external/llvm/test/CodeGen/X86/ |
| selectiondag-cse.ll | 28 %tmp = or i208 undef, 0
33 %tmp7 = lshr i208 %tmp, 80
34 %tmp8 = trunc i208 %tmp7 to i32
43 %tmp16 = lshr i208 %tmp, 96
44 %tmp17 = trunc i208 %tmp16 to i32
57 %tmp28 = lshr i208 %tmp, 80
58 %tmp29 = shl nuw nsw i208 %tmp28, 1
59 %tmp30 = trunc i208 %tmp29 to i32
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 209 @i208_s = external global i208 ; <i208*> [#uses=1]
1294 define void @i208_ls(i208 %x) nounwind {
1295 store i208 %x, i208* @i208_s
[all...] |
| APIntSextParam.ll | 209 @i208_s = external global i208 ; <i208*> [#uses=1]
1294 define void @i208_ls(i208 signext %x) nounwind {
1295 store i208 %x, i208* @i208_s
[all...] |
| APIntZextParam.ll | 209 @i208_s = external global i208 ; <i208*> [#uses=1]
1294 define void @i208_ls(i208 zeroext %x) nounwind {
1295 store i208 %x, i208* @i208_s
[all...] |
| APIntLoadStore.ll | 416 @i208_l = external global i208 ; <i208*> [#uses=1]
417 @i208_s = external global i208 ; <i208*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 350 int i208[] = {1, 0, 1, 1, 0, 0, 0}; local
477 assert(std::is_heap(i208, i208+7) == (std::is_heap_until(i208, i208+7) == i208+7));
|
| is_heap_until.pass.cpp | 350 int i208[] = {1, 0, 1, 1, 0, 0, 0}; local
477 assert(std::is_heap_until(i208, i208+7) == i208+3);
|
| is_heap_until_comp.pass.cpp | 351 int i208[] = {1, 0, 1, 1, 0, 0, 0}; local
478 assert(std::is_heap_until(i208, i208+7, std::greater<int>()) == i208+1);
|
| is_heap_comp.pass.cpp | 351 int i208[] = {1, 0, 1, 1, 0, 0, 0}; local
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 592 br i1 false, label %bb7.i.i208, label %bb6.i.i207
597 bb7.i.i208: ; preds = %bb3.i11.i
600 bb.i.i.i.i210.preheader: ; preds = %bb7.i.i208
684 bb53.i.i.i.i.preheader: ; preds = %bb53.i.i.i.i.preheader.loopexit, %bb7.i.i208
[all...] |
| /external/llvm/lib/Target/ |
| README.txt | [all...] |
