| /external/llvm/test/Transforms/JumpThreading/ |
| 2010-08-26-and.ll | 122 br i1 %cmp9.i109, label %if.then.i113, label %_ZN12StringSwitchI5ColorE4CaseILj7EEERS1_RAT__KcRKS0_.exit115
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 | 120 br i1 undef, label %Retry.i108, label %if.end.i113
122 Retry.i108: ; preds = %if.end.i113, %if.else
128 if.end.i113: ; preds = %if.else
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 114 @i113_s = external global i113 ; <i113*> [#uses=1]
819 define void @i113_ls(i113 %x) nounwind {
820 store i113 %x, i113* @i113_s
[all...] |
| APIntSextParam.ll | 114 @i113_s = external global i113 ; <i113*> [#uses=1]
819 define void @i113_ls(i113 signext %x) nounwind {
820 store i113 %x, i113* @i113_s
[all...] |
| APIntZextParam.ll | 114 @i113_s = external global i113 ; <i113*> [#uses=1]
819 define void @i113_ls(i113 zeroext %x) nounwind {
820 store i113 %x, i113* @i113_s
[all...] |
| APIntLoadStore.ll | 226 @i113_l = external global i113 ; <i113*> [#uses=1]
227 @i113_s = external global i113 ; <i113*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 192 int i113[] = {1, 1, 1, 0, 0, 0}; local
255 assert(std::is_heap(i113, i113+6) == (std::is_heap_until(i113, i113+6) == i113+6));
|
| is_heap_until.pass.cpp | 192 int i113[] = {1, 1, 1, 0, 0, 0}; local
255 assert(std::is_heap_until(i113, i113+6) == i113+6);
|
| is_heap_until_comp.pass.cpp | 193 int i113[] = {1, 1, 1, 0, 0, 0}; local
256 assert(std::is_heap_until(i113, i113+6, std::greater<int>()) == i113+3);
|
| is_heap_comp.pass.cpp | 193 int i113[] = {1, 1, 1, 0, 0, 0}; local
256 assert(std::is_heap(i113, i113+6, std::greater<int>()) == (std::is_heap_until(i113, i113+6, std::greater<int>()) == i113+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,
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2006-06-12-InfLoop.ll | 124 br i1 false, label %UnifiedReturnBlock.i113, label %then.2.i112
127 UnifiedReturnBlock.i113: ; preds = %loopexit.0.i
129 checkham.exit: ; preds = %UnifiedReturnBlock.i113, %then.2.i112
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 476 int i113 = 113; local
[all...] |
