maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/polly/test/ScopInfo/simple_loop_unsigned.ll

35 lines
1.0 KiB
LLVM
Raw Normal View History

Allow unsigned comparisons With this patch we will optimistically assume that the result of an unsigned comparison is the same as the result of the same comparison interpreted as signed. llvm-svn: 267559
2016-04-26 22:33:12 +08:00
; RUN: opt %loadPolly -polly-scops -analyze < %s | FileCheck %s
; void f(int a[], unsigned N) {
; unsigned i;
; do {
; a[i] = i;
; } while (++i <= N);
; }
; CHECK: Assumed Context:
[FIX] Correct assumption simplification Assumptions and restrictions can both be simplified with the domain of a statement but not the same way. After this patch we will correctly distinguish them. llvm-svn: 267885
2016-04-28 22:32:58 +08:00
; CHECK-NEXT: [N] -> { : }
; CHECK-NEXT: Invalid Context:
; CHECK-NEXT: [N] -> { : N < 0 }
Allow unsigned comparisons With this patch we will optimistically assume that the result of an unsigned comparison is the same as the result of the same comparison interpreted as signed. llvm-svn: 267559
2016-04-26 22:33:12 +08:00
;
; CHECK: Domain :=
; CHECK-NEXT: [N] -> { Stmt_bb[i0] : 0 <= i0 < N; Stmt_bb[0] : N <= 0 };
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128"
define void @f(i64* nocapture %a, i64 %N) nounwind {
entry:
br label %bb
bb: ; preds = %bb, %entry
%i = phi i64 [ 0, %entry ], [ %i.inc, %bb ]
%scevgep = getelementptr inbounds i64, i64* %a, i64 %i
store i64 %i, i64* %scevgep
%i.inc = add nsw i64 %i, 1
%exitcond = icmp uge i64 %i.inc, %N
br i1 %exitcond, label %return, label %bb
return: ; preds = %bb, %entry
ret void
}