comparison polly/test/ScopInfo/pointer-comparison.ll @ 252:1f2b6ac9f198 llvm-original

LLVM16-1
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Fri, 18 Aug 2023 09:04:13 +0900
parents c4bab56944e8
children
comparison
equal deleted inserted replaced
237:c80f45b162ad 252:1f2b6ac9f198
15 ; CHECK: Domain := 15 ; CHECK: Domain :=
16 ; CHECK-NEXT: [A, B] -> { Stmt_while_body[i0] : (-A + B) mod 4 = 0 and i0 >= 0 and 4i0 <= -4 - A + B }; 16 ; CHECK-NEXT: [A, B] -> { Stmt_while_body[i0] : (-A + B) mod 4 = 0 and i0 >= 0 and 4i0 <= -4 - A + B };
17 ; 17 ;
18 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128" 18 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
19 19
20 define void @f(i32* %A, i32* %B) { 20 define void @f(ptr %A, ptr %B) {
21 entry: 21 entry:
22 br label %while.cond 22 br label %while.cond
23 23
24 while.cond: ; preds = %while.body, %entry 24 while.cond: ; preds = %while.body, %entry
25 %A.addr.0 = phi i32* [ %A, %entry ], [ %incdec.ptr, %while.body ] 25 %A.addr.0 = phi ptr [ %A, %entry ], [ %incdec.ptr, %while.body ]
26 %cmp = icmp eq i32* %A.addr.0, %B 26 %cmp = icmp eq ptr %A.addr.0, %B
27 br i1 %cmp, label %while.end, label %while.body 27 br i1 %cmp, label %while.end, label %while.body
28 28
29 while.body: ; preds = %while.cond 29 while.body: ; preds = %while.cond
30 %tmp = load i32, i32* %A.addr.0, align 4 30 %tmp = load i32, ptr %A.addr.0, align 4
31 %add = add nsw i32 %tmp, 1 31 %add = add nsw i32 %tmp, 1
32 store i32 %add, i32* %A.addr.0, align 4 32 store i32 %add, ptr %A.addr.0, align 4
33 %incdec.ptr = getelementptr inbounds i32, i32* %A.addr.0, i64 1 33 %incdec.ptr = getelementptr inbounds i32, ptr %A.addr.0, i64 1
34 br label %while.cond 34 br label %while.cond
35 35
36 while.end: ; preds = %while.cond 36 while.end: ; preds = %while.cond
37 ret void 37 ret void
38 } 38 }