Home
last modified time | relevance | path

Searched refs:i23 (Results 1 – 25 of 37) sorted by relevance

12

/external/llvm/test/Transforms/InstCombine/
Dapint-and-xor-merge.ll16 define i23 @test2(i23 %x, i23 %y, i23 %z) {
17 %tmp3 = and i23 %y, %x
18 %tmp6 = or i23 %y, %x
19 %tmp7 = xor i23 %tmp3, %tmp6
20 ret i23 %tmp7
Dapint-and1.ll25 define i23 @test3(i23 %x) {
26 %tmp.0 = and i23 %x, 127
27 %tmp.2 = and i23 %tmp.0, 128
28 ret i23 %tmp.2
Dapint-or.ll4 define i23 @test1(i23 %A) {
6 %NotA = xor i23 -1, %A
7 %B = or i23 %A, %NotA
8 ret i23 %B
10 ; CHECK-NEXT: ret i23 -1
Dapint-xor1.ll20 define i23 @test3(i23 %x) {
21 %tmp.2 = xor i23 %x, %x
22 ret i23 %tmp.2
Dapint-shift.ll100 define i23 @test11(i23 %A) {
101 %a = mul i23 %A, 3 ; <i23> [#uses=1]
102 %B = lshr i23 %a, 11 ; <i23> [#uses=1]
103 %C = shl i23 %B, 12 ; <i23> [#uses=1]
104 ret i23 %C
Dapint-sub.ll9 define i23 @test1(i23 %A) {
10 %B = sub i23 %A, %A ; <i23> [#uses=1]
11 ret i23 %B
/external/clang/test/CodeGen/
D2005-01-02-ConstantInits.c9 static int i23 = (int) &(((struct X *)0)->a[1]); in test() local
10 return i23; in test()
20 static int i23 = (int) &( ((struct X *)0) -> a[0]); in foo2() local
/external/v8/test/mjsunit/asm/embenchen/
Dzlib.js5772 …0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 =…
7143 …if (((i66 | 0) != 0 ? (i23 = HEAP32[i66 + 28 >> 2] | 0, (i23 | 0) != 0) : 0) ? (i21 = HEAP32[i42 >…
7145 HEAP8[i23 + i21 | 0] = i67;
7507 …0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 =…
8241 …if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 …
8254 i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
8257 i23 = i26 ? i13 : -1;
8272 i23 = _sbrk(0) | 0;
8273 if ((i23 | 0) != (-1 | 0)) {
8274 i24 = i23;
[all …]
Dlua_binarytrees.js7386 …0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 =…
8120 …if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 …
8133 i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
8136 i23 = i26 ? i13 : -1;
8151 i23 = _sbrk(0) | 0;
8152 if ((i23 | 0) != (-1 | 0)) {
8153 i24 = i23;
8170 i13 = (i22 | 0) == (i23 | 0);
8172 i23 = i13 ? i23 : -1;
8186 if ((i23 | 0) != (-1 | 0)) {
[all …]
Dbox2d.js6152 …0, i15 = 0, i16 = 0, i17 = 0, i18 = 0, i19 = 0, i20 = 0, i21 = 0, i22 = 0, i23 = 0, i24 = 0, i25 =…
6886 …if (!(i27 >>> 0 > i26 >>> 0) ? (i23 = i24 + 4 | 0, (i27 + (HEAP32[i23 >> 2] | 0) | 0) >>> 0 > i26 …
6899 i26 = (i13 | 0) == ((HEAP32[i24 >> 2] | 0) + (HEAP32[i23 >> 2] | 0) | 0);
6902 i23 = i26 ? i13 : -1;
6917 i23 = _sbrk(0) | 0;
6918 if ((i23 | 0) != (-1 | 0)) {
6919 i24 = i23;
6936 i13 = (i22 | 0) == (i23 | 0);
6938 i23 = i13 ? i23 : -1;
6952 if ((i23 | 0) != (-1 | 0)) {
[all …]
/external/llvm/test/Transforms/LoopDeletion/
D2011-06-21-phioperands.ll27 br i1 true, label %for.cond.i50.us-lcssa.us, label %if.end.i23.us
29 for.inc.i38.us: ; preds = %if.end.i23.us
32 if.end.i23.us: ; preds = %for.cond.i14.us
35 for.cond.i50.us-lcssa.us: ; preds = %if.end.i23.us, %for.cond.i14.us
42 br i1 undef, label %for.cond.i50.us-lcssa, label %if.end.i23
44 if.end.i23: ; preds = %for.cond.i14
47 for.inc.i38: ; preds = %if.end.i23
50 for.cond.i50.us-lcssa: ; preds = %if.end.i23, %for.cond.i14
/external/llvm/test/Transforms/GlobalOpt/
D2008-01-03-Crash.ll17 br i1 false, label %cond_next21.i.i23.i, label %stack_restore
22 cond_next21.i.i23.i: ; preds = %cond_next20.i
/external/llvm/test/CodeGen/X86/
D2010-02-23-SingleDefPhiJoin.ll57 br label %bb1.i23
59 bb1.i23: ; preds = %meshBB110, %bb9
130 …hBB106: ; preds = %skip_to_newline.exit26.fragment, %bb1.i23
133 meshBB110: ; preds = %skip_to_newline.exit, %bb1.i23
134 br i1 false, label %bb15, label %bb1.i23
Dsetcc-lowering.ll25 %0 = trunc <8 x i32> %a to <8 x i23>
26 %1 = icmp eq <8 x i23> %0, zeroinitializer
D2008-09-09-LinearScanBug.ll13 %p_86.addr.06.i.i4 = phi i32 [ 0, %entry ], [ %sub.i.i.i23, %forinc6.i.i25 ] ; <i32> [#uses=1]
38 %sub.i.i.i23 = add i32 %conv.i.i.i22, -1 ; <i32> [#uses=2]
39 %phitmp.i.i24 = icmp eq i32 %sub.i.i.i23, 0 ; <i1> [#uses=1]
D2008-02-27-DeadSlotElimBug.ll40 %tmp20.i23 = fadd double %tmp20.i39, %tmp17.i76 ; <double> [#uses=1]
58 %tmp6.i = fadd double 0.000000e+00, %tmp20.i23 ; <double> [#uses=0]
Davx-basic.ll62 %ptrcast.i23.i = bitcast float* %ptroffset.i22.i992 to i32*
63 %val.i24.i = load i32, i32* %ptrcast.i23.i, align 4
D2007-11-30-LoadFolding-Bug.ll45 %tmp1213.i23.i = sitofp i32 %x.0.i21.i to double ; <double> [#uses=1]
46 %tmp15.i24.i = fsub double 0.000000e+00, %tmp1213.i23.i ; <double> [#uses=1]
/external/llvm/test/CodeGen/AArch64/
Darm64-andCmpBrToTBZ.ll44 br i1 %cmp.i.i.i18, label %if.then7, label %lor.rhs.i.i.i23
46 lor.rhs.i.i.i23: ; preds = %land.rhs.i19
50 _ZNK7WebCore4Node10hasTagNameERKNS_13QualifiedNameE.exit28: ; preds = %lor.rhs.i.i.i23
63 …7, %_ZNK7WebCore4Node10hasTagNameERKNS_13QualifiedNameE.exit28, %lor.rhs.i.i.i23, %if.end5, %if.end
Darm64-promote-const.ll158 %mul.i23 = mul <16 x i8> %mul.i24, %mul.i24
159 %mul.i = mul <16 x i8> %mul.i23, %mul.i23
/external/llvm/test/CodeGen/PowerPC/
Dsubsumes-pred-regs.ll24 %lnot.i.i16.i23 = icmp eq i32 %0, 0
25 br i1 %lnot.i.i16.i23, label %if.end7.i37, label %test.exit27.i34
35 br i1 %lnot.i.i16.i23, label %return, label %lor.rhs.i.i49
Dvsx-ldst-builtin-le.ll29 %__a.addr.i23 = alloca i32, align 4
94 store i32 0, i32* %__a.addr.i23, align 4
96 %28 = load i32, i32* %__a.addr.i23, align 4
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/
Dis_heap.pass.cpp56 int i23[] = {1, 1, 0, 0}; in test() local
71 assert(std::is_heap(i23, i23+4) == (std::is_heap_until(i23, i23+4) == i23+4)); in test()
Dis_heap_until.pass.cpp56 int i23[] = {1, 1, 0, 0}; in test() local
71 assert(std::is_heap_until(i23, i23+4) == i23+4); in test()
Dis_heap_until_comp.pass.cpp57 int i23[] = {1, 1, 0, 0}; in test() local
72 assert(std::is_heap_until(i23, i23+4, std::greater<int>()) == i23+2); in test()

12