| /external/llvm/test/CodeGen/Hexagon/ |
| zextloadi1.ll | 12 @i129_l = external global i129
13 @i129_s = external global i129
16 %tmp = load i129* @i129_l
17 store i129 %tmp, i129* @i129_s
|
| /external/llvm/test/Transforms/InstCombine/ |
| apint-and2.ll | 21 define i129 @tst(i129 %A, i129 %B) {
23 %NotA = xor i129 %A, -1
24 %NotB = xor i129 %B, -1
25 %C1 = and i129 %NotA, %NotB
26 ret i129 %C1
|
| or.ll | 342 %and.i129 = and <4 x i32> %vecinit6.i176, %and.i135 ; <<4 x i32>> [#uses=1]
345 %or.i = or <4 x i32> %and.i, %and.i129 ; <<4 x i32>> [#uses=1]
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| 2011-10-27-lftrnull.ll | 26 for.body.i86: ; preds = %for.end.i129, %for.body.lr.ph.i81
28 br i1 %cmp196.i, label %for.body21.lr.ph.i, label %for.end.i129
46 br i1 %cmp19.i, label %for.body21.i, label %for.end.i129
48 for.end.i129: ; preds = %if.end.i126, %for.body.i86
|
| /external/llvm/test/Transforms/JumpThreading/ |
| 2010-08-26-and.ll | 134 br i1 %or.cond171, label %land.lhs.true5.i129, label %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit134
136 land.lhs.true5.i129: ; preds = %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115
141 if.then.i132: ; preds = %land.lhs.true5.i129
144 _ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit134: ; preds = %if.then.i132, %land.lhs.true5.i129, %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115
145 %retval.0.i.pre = phi i32 [ %retval.0.i.pre155, %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115 ], [ %retval.0.i.pre155, %land.lhs.true5.i129 ], [ 7, %if.then.i132 ] ; <i32> [#uses=2]
146 %tmp2.i137 = phi i8 [ %tmp2.i118, %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115 ], [ %tmp2.i118, %land.lhs.true5.i129 ], [ 1, %if.then.i132 ] ; <i8> [#uses=1]
|
| /external/llvm/test/Transforms/CodeGenPrepare/ |
| 2008-11-24-RAUW-Self.ll | 183 br label %bb11.i129
185 bb11.i129: ; preds = %bb10.i136.bb11.i129_crit_edge, %bb4.i123.bb11.i129_crit_edge
192 br label %bb11.i129
203 base2flt.exit144: ; preds = %bb7.i137.base2flt.exit144_crit_edge, %bb11.i129, %mulflt.exit157.base2flt.exit144_crit_edge
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 130 @i129_s = external global i129 ; <i129*> [#uses=1]
899 define void @i129_ls(i129 %x) nounwind {
900 store i129 %x, i129* @i129_s
[all...] |
| APIntSextParam.ll | 130 @i129_s = external global i129 ; <i129*> [#uses=1]
899 define void @i129_ls(i129 signext %x) nounwind {
900 store i129 %x, i129* @i129_s
[all...] |
| APIntZextParam.ll | 130 @i129_s = external global i129 ; <i129*> [#uses=1]
899 define void @i129_ls(i129 zeroext %x) nounwind {
900 store i129 %x, i129* @i129_s
[all...] |
| APIntLoadStore.ll | 258 @i129_l = external global i129 ; <i129*> [#uses=1]
259 @i129_s = external global i129 ; <i129*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 271 int i129[] = {0, 0, 0, 1, 0, 0, 1}; local
398 assert(std::is_heap(i129, i129+7) == (std::is_heap_until(i129, i129+7) == i129+7));
|
| is_heap_until.pass.cpp | 271 int i129[] = {0, 0, 0, 1, 0, 0, 1}; local
398 assert(std::is_heap_until(i129, i129+7) == i129+3);
|
| is_heap_until_comp.pass.cpp | 272 int i129[] = {0, 0, 0, 1, 0, 0, 1}; local
399 assert(std::is_heap_until(i129, i129+7, std::greater<int>()) == i129+7);
|
| is_heap_comp.pass.cpp | 272 int i129[] = {0, 0, 0, 1, 0, 0, 1}; local
399 assert(std::is_heap(i129, i129+7, std::greater<int>()) == (std::is_heap_until(i129, i129+7, std::greater<int>()) == i129+7));
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 508 int i129 = 129; local
[all...] |
