45 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s2;3; void f(int *A, int N, int p) {4; for (int i = 0; i < N; i++)5; A[i + 30] = 0;6; }7;8; The wrap function has no inbounds GEP but the nowrap function has. Therefore,9; we will add the assumption that i+1 won't overflow only to the former.10;11; Note: 2147483618 + 30 == 2 ^ 3112 13; CHECK: Function: wrap14;15; CHECK: Context:16; CHECK-NEXT: [N] -> { : -2147483648 <= N <= 2147483647 }17;18; CHECK: Invalid Context:19; CHECK-NEXT: [N] -> { : N >= 2147483619 }20 21target datalayout = "e-m:e-i32:64-f80:128-n8:16:32:64-S128"22 23define void @wrap(ptr %A, i32 %N, i32 %p) {24bb:25 br label %bb226 27bb2: ; preds = %bb7, %bb28 %indvars.iv = phi i32 [ %indvars.iv.next, %bb7 ], [ 0, %bb ]29 %tmp3 = icmp slt i32 %indvars.iv, %N30 br i1 %tmp3, label %bb4, label %bb831 32bb4: ; preds = %bb233 %tmp5 = add i32 %indvars.iv, 3034 %tmp6 = getelementptr i32, ptr %A, i32 %tmp535 store i32 0, ptr %tmp6, align 436 br label %bb737 38bb7: ; preds = %bb439 %indvars.iv.next = add nuw nsw i32 %indvars.iv, 140 br label %bb241 42bb8: ; preds = %bb243 ret void44}45