Home
last modified time | relevance | path

Searched refs:i65 (Results 1 – 25 of 26) sorted by relevance

12

/external/llvm/test/ExecutionEngine/MCJIT/
D2008-06-05-APInt-OverAShr.ll8 define i65 @foo(i65 %x) {
10 %x_addr = alloca i65 ; <i65*> [#uses=2]
11 %retval = alloca i65 ; <i65*> [#uses=2]
12 %tmp = alloca i65 ; <i65*> [#uses=2]
13 %"alloca point" = bitcast i65 0 to i65 ; <i65> [#uses=0]
14 store i65 %x, i65* %x_addr
15 %tmp1 = load i65* %x_addr, align 4 ; <i65> [#uses=1]
16 %tmp2 = ashr i65 %tmp1, 65 ; <i65> [#uses=1]
17 store i65 %tmp2, i65* %tmp, align 4
18 %tmp3 = load i65* %tmp, align 4 ; <i65> [#uses=1]
[all …]
/external/llvm/test/ExecutionEngine/
D2008-06-05-APInt-OverAShr.ll8 define i65 @foo(i65 %x) {
10 %x_addr = alloca i65 ; <i65*> [#uses=2]
11 %retval = alloca i65 ; <i65*> [#uses=2]
12 %tmp = alloca i65 ; <i65*> [#uses=2]
13 %"alloca point" = bitcast i65 0 to i65 ; <i65> [#uses=0]
14 store i65 %x, i65* %x_addr
15 %tmp1 = load i65* %x_addr, align 4 ; <i65> [#uses=1]
16 %tmp2 = ashr i65 %tmp1, 65 ; <i65> [#uses=1]
17 store i65 %tmp2, i65* %tmp, align 4
18 %tmp3 = load i65* %tmp, align 4 ; <i65> [#uses=1]
[all …]
/external/llvm/test/Transforms/InstCombine/
D2008-06-05-ashr-crash.ll3 define i65 @foo(i65 %x) nounwind {
5 %tmp2 = ashr i65 %x, 65 ; <i65> [#uses=1]
6 ret i65 %tmp2
Dapint-add2.ll16 define i65 @test2(i65 %x) {
17 %tmp.0 = shl i65 1, 64
18 %tmp.2 = xor i65 %x, %tmp.0
20 %tmp.4 = add i65 %tmp.2, %tmp.0
21 ret i65 %tmp.4
Dapint-and2.ll29 define i65 @test(i65 %A, i65 %B) {
31 %NotA = xor i65 %A, -1
32 %NotB = xor i65 -1, %B
33 %C1 = and i65 %NotA, %NotB
34 ret i65 %C1
Dvector-casts.ll80 define <2 x i65> @foo(<2 x i64> %t) {
82 %b = zext <2 x i32> %a to <2 x i65>
83 ret <2 x i65> %b
85 define <2 x i64> @bar(<2 x i65> %t) {
86 %a = trunc <2 x i65> %t to <2 x i32>
90 define <2 x i65> @foos(<2 x i64> %t) {
92 %b = sext <2 x i32> %a to <2 x i65>
93 ret <2 x i65> %b
95 define <2 x i64> @bars(<2 x i65> %t) {
96 %a = trunc <2 x i65> %t to <2 x i32>
Dshift.ll854 define <2 x i65> @test_65(<2 x i64> %t) {
856 %a = zext <2 x i64> %t to <2 x i65>
857 %sext = shl <2 x i65> %a, <i65 33, i65 33>
858 %b = ashr <2 x i65> %sext, <i65 33, i65 33>
859 ret <2 x i65> %b
/external/llvm/test/Assembler/
D2007-03-19-NegValue.ll2 ; RUN: llvm-as < %s | llvm-dis | grep "add i65.*, -1"
4 define i65 @testConsts(i65 %N) {
5 %a = add i65 %N, -1
6 ret i65 %a
/external/llvm/test/CodeGen/Hexagon/
Dzextloadi1.ll10 @i65_l = external global i65
11 @i65_s = external global i65
22 %tmp = load i65* @i65_l
23 store i65 %tmp, i65* @i65_s
/external/llvm/lib/Analysis/
DREADME.txt13 …(-2 + (2 * (trunc i65 (((zext i64 (-2 + %n) to i65) * (zext i64 (-1 + %n) to i65)) /u 2) to i64)) …
15 In addition to being much more complicated, it involves i65 arithmetic,
/external/llvm/test/CodeGen/X86/
Dadd.ll109 %extleft = zext i64 %left to i65
110 %extright = zext i64 %right to i65
111 %sum = add i65 %extleft, %extright
112 %res.0 = trunc i65 %sum to i64
113 %overflow = and i65 %sum, -18446744073709551616
114 %res.1 = icmp ne i65 %overflow, 0
/external/llvm/unittests/ADT/
DAPIntTest.cpp59 APInt i65(65, 0, true); in TEST() local
60 EXPECT_EQ(65u, i65.countLeadingZeros()); in TEST()
61 EXPECT_EQ(0u, i65.countLeadingOnes()); in TEST()
62 EXPECT_EQ(0u, i65.getActiveBits()); in TEST()
63 EXPECT_EQ(1u, i65.getActiveWords()); in TEST()
64 EXPECT_EQ(65u, i65.countTrailingZeros()); in TEST()
65 EXPECT_EQ(0u, i65.countPopulation()); in TEST()
/external/llvm/test/Transforms/GlobalOpt/
D2009-06-01-RecursivePHI.ll49 br i1 undef, label %bb7.i65, label %bb8.i67
51 bb7.i65: ; preds = %bb6.i64
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
Dis_heap.pass.cpp144 int i65[] = {0, 0, 1, 0, 0, 0}; in test() local
207 assert(std::is_heap(i65, i65+6) == (std::is_heap_until(i65, i65+6) == i65+6)); in test()
Dis_heap_until.pass.cpp144 int i65[] = {0, 0, 1, 0, 0, 0}; in test() local
207 assert(std::is_heap_until(i65, i65+6) == i65+2); in test()
Dis_heap_until_comp.pass.cpp145 int i65[] = {0, 0, 1, 0, 0, 0}; in test() local
208 assert(std::is_heap_until(i65, i65+6, std::greater<int>()) == i65+5); in test()
Dis_heap_comp.pass.cpp145 int i65[] = {0, 0, 1, 0, 0, 0}; in test() local
208 …assert(std::is_heap(i65, i65+6, std::greater<int>()) == (std::is_heap_until(i65, i65+6, std::great… in test()
/external/llvm/test/Transforms/LoopUnroll/
Dscevunroll.ll26 %cmp.i65 = icmp sgt i32 %iv.narrow, 0
27 br i1 %cmp.i65, label %while.body, label %exit
/external/llvm/test/Transforms/CodeGenPrepare/
D2008-11-24-RAUW-Self.ll305 bb3.i62.mulflt.exit72_crit_edge: ; preds = %bb8.i65, %bb3.i62
312 br i1 false, label %bb8.i65, label %bb7.i64.bb12.i69_crit_edge
317 bb8.i65: ; preds = %bb7.i64
320 bb10.i66: ; preds = %bb8.i65
/external/llvm/test/Transforms/JumpThreading/
D2010-08-26-and.ll80 %tobool.i65 = icmp eq i8 %tmp14.i64, 0 ; <i1> [#uses=1]
82 %or.cond168 = and i1 %tobool.i65, %cmp.i68 ; <i1> [#uses=1]
/external/llvm/test/CodeGen/Generic/
DAPIntLoadStore.ll130 @i65_l = external global i65 ; <i65*> [#uses=1]
131 @i65_s = external global i65 ; <i65*> [#uses=1]
900 %tmp = load i65* @i65_l ; <i65> [#uses=1]
901 store i65 %tmp, i65* @i65_s
DAPIntZextParam.ll66 @i65_s = external global i65 ; <i65*> [#uses=1]
579 define void @i65_ls(i65 zeroext %x) nounwind {
580 store i65 %x, i65* @i65_s
DAPIntParam.ll66 @i65_s = external global i65 ; <i65*> [#uses=1]
579 define void @i65_ls(i65 %x) nounwind {
580 store i65 %x, i65* @i65_s
DAPIntSextParam.ll66 @i65_s = external global i65 ; <i65*> [#uses=1]
579 define void @i65_ls(i65 signext %x) nounwind {
580 store i65 %x, i65* @i65_s
/external/llvm/test/Transforms/ArgumentPromotion/
Dpr3085.ll970 br i1 false, label %bb6.i.i65, label %bb1.i.i.i63
973 br i1 false, label %sat.exit.i, label %bb6.i.i65
975 bb6.i.i65: ; preds = %bb1.i.i.i63, %bb5.i.i61
978 bb7.i.i66: ; preds = %bb6.i.i65
981 bb8.i.i67: ; preds = %bb7.i.i66, %bb6.i.i65
1856 br i1 false, label %delete.exit71.i.i, label %bb1.i65.i.i
1858 bb1.i65.i.i: ; preds = %delete.exit82.i.i
1861 delete.exit71.i.i: ; preds = %bb1.i65.i.i, %delete.exit82.i.i

12