| /external/llvm/test/Transforms/SCCP/ |
| apint-bigint2.ll | 3 @Y = constant [6 x i101] [ i101 12, i101 123456789000000, i101 -12,
4 i101 -123456789000000, i101 0,i101 9123456789000000]
6 define i101 @array()
9 %A = getelementptr [6 x i101]* @Y, i32 0, i32 1
10 %B = load i101* %
[all...] |
| apint-ipsccp2.ll | 1 ; RUN: opt < %s -ipsccp -S | grep -v "ret i101 0" | \
2 ; RUN: grep -v "ret i101 undef" | not grep ret
5 define internal i101 @bar(i101 %A) {
6 %x = icmp eq i101 %A, 0
9 %B = call i101 @bar(i101 0)
10 ret i101 0
12 %C = call i101 @bar(i101 1
[all...] |
| apint-array.ll | 1 ; RUN: opt < %s -sccp -S | grep "ret i101 12"
3 @Y = constant [6 x i101] [ i101 12, i101 123456789000000, i101 -12,i101
4 -123456789000000, i101 0,i101 9123456789000000]
6 define i101 @array()
9 %A = getelementptr [6 x i101]* @Y, i32 0, i32
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| remat-fold-load.ll | 86 %cmp.i.i.i.i.i.i101 = icmp sgt i32 %tmp16, 8
87 br i1 %cmp.i.i.i.i.i.i101, label %if.then.i.i.i.i.i103, label %B
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2006-06-12-InfLoop.ll | 96 br i1 false, label %no_exit.i.i101.preheader, label %hamming.exit.i104
97 no_exit.i.i101.preheader: ; preds = %no_exit.1.i87
98 br label %no_exit.i.i101
99 no_exit.i.i101: ; preds = %no_exit.i.i101, %no_exit.i.i101.preheader
100 br i1 false, label %no_exit.i.i101, label %hamming.exit.i104.loopexit
101 hamming.exit.i104.loopexit: ; preds = %no_exit.i.i101
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 102 @i101_s = external global i101 ; <i101*> [#uses=1]
759 define void @i101_ls(i101 %x) nounwind {
760 store i101 %x, i101* @i101_s
[all...] |
| APIntSextParam.ll | 102 @i101_s = external global i101 ; <i101*> [#uses=1]
759 define void @i101_ls(i101 signext %x) nounwind {
760 store i101 %x, i101* @i101_s
[all...] |
| APIntZextParam.ll | 102 @i101_s = external global i101 ; <i101*> [#uses=1]
759 define void @i101_ls(i101 zeroext %x) nounwind {
760 store i101 %x, i101* @i101_s
[all...] |
| APIntLoadStore.ll | 202 @i101_l = external global i101 ; <i101*> [#uses=1]
203 @i101_s = external global i101 ; <i101*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 180 int i101[] = {1, 0, 1, 1, 0, 0}; local
243 assert(std::is_heap(i101, i101+6) == (std::is_heap_until(i101, i101+6) == i101+6));
|
| is_heap_until.pass.cpp | 180 int i101[] = {1, 0, 1, 1, 0, 0}; local
243 assert(std::is_heap_until(i101, i101+6) == i101+3);
|
| is_heap_until_comp.pass.cpp | 181 int i101[] = {1, 0, 1, 1, 0, 0}; local
244 assert(std::is_heap_until(i101, i101+6, std::greater<int>()) == i101+1);
|
| is_heap_comp.pass.cpp | 181 int i101[] = {1, 0, 1, 1, 0, 0}; local
244 assert(std::is_heap(i101, i101+6, std::greater<int>()) == (std::is_heap_until(i101, i101+6, std::greater<int>()) == i101+6));
[all...] |
| /external/llvm/test/Transforms/JumpThreading/ |
| 2010-08-26-and.ll | 114 %tobool.i101 = icmp eq i8 %tmp14.i100, 0 ; <i1> [#uses=1]
116 %or.cond170 = and i1 %tobool.i101, %cmp.i104 ; <i1> [#uses=1]
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 172 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
207 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 172 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
207 ... i100, i101, i102, i103, i104, i105, i106, i107, i108,
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 452 int i101 = 101; local
[all...] |
