68 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<ast>' -polly-print-ast -disable-output < %s | FileCheck %s --check-prefix=AST2; RUN: opt %loadNPMPolly -S '-passes=polly<no-default-opts>' < %s | FileCheck %s3;4; void jd(int *A, int c) {5; for (int i = 0; i < 1024; i++) {6; if (c)7; A[i] = 1;8; else9; A[i] = 2;10; }11; }12 13; AST: for (int c0 = 0; c0 <= 1023; c0 += 1) {14; AST: if (c <= -1 || c >= 1) {15; AST: Stmt_if_then(c0);16; AST: } else17; AST: Stmt_if_else(c0);18; AST: Stmt_if_end(c0);19; AST: }20;21; CHECK-LABEL: entry:22; CHECK-NEXT: %phi.phiops = alloca i3223; CHECK-LABEL: polly.stmt.if.end:24; CHECK-NEXT: %phi.phiops.reload = load i32, ptr %phi.phiops25; CHECK: %scevgep26; CHECK-NEXT: store i32 %phi.phiops.reload, ptr27; CHECK-LABEL: polly.stmt.if.then:28; CHECK-NEXT: store i32 1, ptr %phi.phiops29; CHECK-NEXT: br label %polly.merge{{[.]?}}30; CHECK-LABEL: polly.stmt.if.else:31; CHECK-NEXT: store i32 2, ptr %phi.phiops32; CHECK-NEXT: br label %polly.merge{{[.]?}}33;34target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"35 36define void @jd(ptr %A, i32 %c) {37entry:38 br label %for.cond39 40for.cond:41 %indvars.iv = phi i64 [ %indvars.iv.next, %for.inc ], [ 0, %entry ]42 %exitcond = icmp ne i64 %indvars.iv, 102443 br i1 %exitcond, label %for.body, label %for.end44 45for.body:46 %tobool = icmp eq i32 %c, 047 br i1 %tobool, label %if.else, label %if.then48 49if.then:50 br label %if.end51 52if.else:53 br label %if.end54 55if.end:56 %phi = phi i32 [ 1, %if.then], [ 2, %if.else ]57 %arrayidx = getelementptr inbounds i32, ptr %A, i64 %indvars.iv58 store i32 %phi, ptr %arrayidx, align 459 br label %for.inc60 61for.inc:62 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 163 br label %for.cond64 65for.end:66 ret void67}68