236
|
1 ; RUN: opt %loadPolly -polly-process-unprofitable -polly-codegen -polly-invariant-load-hoisting=true -S < %s | FileCheck %s
|
|
2 ;
|
|
3 ; CHECK-LABEL: polly.preload.begin:
|
252
|
4 ; CHECK-NEXT: %polly.access.C = getelementptr i32, ptr %C, i64 0
|
|
5 ; CHECK-NEXT: %polly.access.C.load = load i32, ptr %polly.access.C
|
|
6 ; CHECK-NOT: %polly.access.C.load = load i32, ptr %polly.access.C
|
236
|
7 ;
|
|
8 ; CHECK-LABEL: polly.cond:
|
|
9 ; CHECK-NEXT: %[[R0:[0-9]*]] = sext i32 %polly.access.C.load to i64
|
|
10 ; CHECK-NEXT: %[[R1:[0-9]*]] = icmp sle i64 %[[R0]], -1
|
|
11 ; CHECK-NEXT: %[[R2:[0-9]*]] = sext i32 %polly.access.C.load to i64
|
|
12 ; CHECK-NEXT: %[[R3:[0-9]*]] = icmp sge i64 %[[R2]], 1
|
|
13 ; CHECK-NEXT: %[[R4:[0-9]*]] = or i1 %[[R1]], %[[R3]]
|
|
14 ; CHECK-NEXT: br i1 %[[R4]]
|
|
15 ;
|
|
16 ; CHECK-NOT: polly.stmt.bb2
|
|
17 ;
|
|
18 ; void f(int *A, int *C) {
|
|
19 ; for (int i = 0; i < 1024; i++)
|
|
20 ; if (*C)
|
|
21 ; A[i] = 0;
|
|
22 ; }
|
|
23 ;
|
|
24 target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
25
|
252
|
26 define void @f(ptr %A, ptr %C) {
|
236
|
27 bb:
|
|
28 br label %bb1
|
|
29
|
|
30 bb1: ; preds = %bb7, %bb
|
|
31 %indvars.iv = phi i64 [ %indvars.iv.next, %bb7 ], [ 0, %bb ]
|
|
32 %exitcond = icmp ne i64 %indvars.iv, 1024
|
|
33 br i1 %exitcond, label %bb2, label %bb8
|
|
34
|
|
35 bb2: ; preds = %bb1
|
252
|
36 %tmp = load i32, ptr %C, align 4
|
236
|
37 %tmp3 = icmp eq i32 %tmp, 0
|
|
38 br i1 %tmp3, label %bb6, label %bb4
|
|
39
|
|
40 bb4: ; preds = %bb2
|
252
|
41 %tmp5 = getelementptr inbounds i32, ptr %A, i64 %indvars.iv
|
|
42 store i32 0, ptr %tmp5, align 4
|
236
|
43 br label %bb6
|
|
44
|
|
45 bb6: ; preds = %bb2, %bb4
|
|
46 br label %bb7
|
|
47
|
|
48 bb7: ; preds = %bb6
|
|
49 %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
50 br label %bb1
|
|
51
|
|
52 bb8: ; preds = %bb1
|
|
53 ret void
|
|
54 }
|