41 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly<no-default-opts>' -S < %s | FileCheck %s2;3; This will just check that we generate valid code here.4;5; CHECK: polly.start:6;7; void f(int *A, int *B) {8; for (int i = 0; i < 1024; i++)9; A[i % 3] = B[i / 42];10; }11;12target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"13 14define void @f(ptr %A, ptr %B, i32 %N) {15bb:16 br label %bb117 18bb1: ; preds = %bb9, %bb19 %i.0 = phi i32 [ 0, %bb ], [ %tmp10, %bb9 ]20 %exitcond = icmp ne i32 %i.0, %N21 br i1 %exitcond, label %bb2, label %bb1122 23bb2: ; preds = %bb124 %tmp = sdiv i32 %i.0, 4225 %tmp3 = sext i32 %tmp to i6426 %tmp4 = getelementptr inbounds i32, ptr %B, i64 %tmp327 %tmp5 = load i32, ptr %tmp4, align 428 %tmp6 = srem i32 %i.0, 329 %tmp7 = sext i32 %tmp6 to i6430 %tmp8 = getelementptr inbounds i32, ptr %A, i64 %tmp731 store i32 %tmp5, ptr %tmp8, align 432 br label %bb933 34bb9: ; preds = %bb235 %tmp10 = add nuw nsw i32 %i.0, 136 br label %bb137 38bb11: ; preds = %bb139 ret void40}41