/external/llvm/test/Transforms/LCSSA/ |
invoke-dest.ll | 24 br i1 undef, label %_ZNK5cGate4sizeEv.exit, label %bb.i110 26 bb.i110: ; preds = %bb1 29 _ZNK5cGate4sizeEv.exit: ; preds = %bb.i110, %bb1
|
/external/llvm/test/Transforms/SimplifyCFG/ |
2006-06-12-InfLoop.ll | 87 loopentry.1.outer.i: ; preds = %loopexit.1.i110, %loopentry.1.preheader.i 92 br i1 false, label %no_exit.1.preheader.i, label %loopexit.1.i110.loopexit1 114 br i1 false, label %no_exit.1.i87, label %loopexit.1.i110.loopexit 115 loopexit.1.i110.loopexit: ; preds = %then.1.i107 116 br label %loopexit.1.i110 117 loopexit.1.i110.loopexit1: ; preds = %loopentry.1.i85 118 br label %loopexit.1.i110 119 loopexit.1.i110: ; preds = %loopexit.1.i110.loopexit1, %loopexit.1.i110.loopexi [all...] |
/external/llvm/test/Transforms/JumpThreading/ |
2010-08-26-and.ll | 117 br i1 %or.cond170, label %land.lhs.true5.i110, label %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115 119 land.lhs.true5.i110: ; preds = %_ZN12StringSwitchI5ColorE4CaseILj5EEERS1_RAT__KcRKS0_.exit 124 if.then.i113: ; preds = %land.lhs.true5.i110 127 _ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115: ; preds = %if.then.i113, %land.lhs.true5.i110, %_ZN12StringSwitchI5ColorE4CaseILj5EEERS1_RAT__KcRKS0_.exit 128 %retval.0.i.pre155 = phi i32 [ %retval.0.i.pre156, %_ZN12StringSwitchI5ColorE4CaseILj5EEERS1_RAT__KcRKS0_.exit ], [ %retval.0.i.pre156, %land.lhs.true5.i110 ], [ 6, %if.then.i113 ] ; <i32> [#uses=2] 129 %tmp2.i118 = phi i8 [ %tmp2.i99, %_ZN12StringSwitchI5ColorE4CaseILj5EEERS1_RAT__KcRKS0_.exit ], [ %tmp2.i99, %land.lhs.true5.i110 ], [ 1, %if.then.i113 ] ; <i8> [#uses=3]
|
/external/llvm/test/Transforms/LoopDeletion/ |
2011-06-21-phioperands.ll | 123 br i1 undef, label %_ZN4llvm15SmallVectorImplIPKcE9push_backERKS2_.exit114, label %new.notnull.i110 125 new.notnull.i110: ; preds = %Retry.i108 131 _ZN4llvm15SmallVectorImplIPKcE9push_backERKS2_.exit114: ; preds = %new.notnull.i110, %Retry.i108
|
/external/llvm/test/CodeGen/Generic/ |
APIntParam.ll | 111 @i110_s = external global i110 ; <i110*> [#uses=1] 804 define void @i110_ls(i110 %x) nounwind { 805 store i110 %x, i110* @i110_s [all...] |
APIntSextParam.ll | 111 @i110_s = external global i110 ; <i110*> [#uses=1] 804 define void @i110_ls(i110 signext %x) nounwind { 805 store i110 %x, i110* @i110_s [all...] |
APIntZextParam.ll | 111 @i110_s = external global i110 ; <i110*> [#uses=1] 804 define void @i110_ls(i110 zeroext %x) nounwind { 805 store i110 %x, i110* @i110_s [all...] |
APIntLoadStore.ll | 220 @i110_l = external global i110 ; <i110*> [#uses=1] 221 @i110_s = external global i110 ; <i110*> [#uses=1] [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
is_heap.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local 252 assert(std::is_heap(i110, i110+6) == (std::is_heap_until(i110, i110+6) == i110+6));
|
is_heap_until.pass.cpp | 189 int i110[] = {1, 1, 0, 1, 0, 1}; local 252 assert(std::is_heap_until(i110, i110+6) == i110+5);
|
is_heap_until_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local 253 assert(std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+2);
|
is_heap_comp.pass.cpp | 190 int i110[] = {1, 1, 0, 1, 0, 1}; local 253 assert(std::is_heap(i110, i110+6, std::greater<int>()) == (std::is_heap_until(i110, i110+6, std::greater<int>()) == i110+6)); [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
test_syntax.py | 173 ... i109, i110, i111, i112, i113, i114, i115, i116, i117, 208 ... i109, i110, i111, i112, i113, i114, i115, i116, i117,
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
test_syntax.py | 173 ... i109, i110, i111, i112, i113, i114, i115, i116, i117, 208 ... i109, i110, i111, i112, i113, i114, i115, i116, i117,
|
/art/test/083-compiler-regressions/src/ |
Main.java | 470 int i110 = 110; local [all...] |