1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
; RUN: opt %loadPolly -polly-stmt-granularity=bb -polly-import-jscop -polly-import-jscop-postfix=transformed -polly-print-simplify -disable-output < %s | FileCheck -match-full-lines %s
;
; Combine four partial stores into two.
; The stores write to the same array, but never the same element.
;
; for (int j = 0; j < n; j += 1) {
; A[0] = 21.0;
; A[1] = 42.0;
; A[0] = 21.0;
; A[1] = 42.0;
; }
;
define void @coalesce_disjointelements(i32 %n, ptr noalias nonnull %A) {
entry:
br label %for
for:
%j = phi i32 [0, %entry], [%j.inc, %inc]
%j.cmp = icmp slt i32 %j, %n
br i1 %j.cmp, label %body, label %exit
body:
%A_1 = getelementptr inbounds double, ptr %A, i32 1
store double 21.0, ptr %A
store double 42.0, ptr %A_1
store double 21.0, ptr %A
store double 42.0, ptr %A_1
br label %inc
inc:
%j.inc = add nuw nsw i32 %j, 1
br label %for
exit:
br label %return
return:
ret void
}
; CHECK: Statistics {
; CHECK: Overwrites removed: 0
; CHECK: Partial writes coalesced: 2
; CHECK: }
; CHECK: After accesses {
; CHECK-NEXT: Stmt_body
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [n] -> { Stmt_body[i0] -> MemRef_A[0] };
; CHECK-NEXT: new: [n] -> { Stmt_body[i0] -> MemRef_A[0] };
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
; CHECK-NEXT: [n] -> { Stmt_body[i0] -> MemRef_A[1] };
; CHECK-NEXT: new: [n] -> { Stmt_body[i0] -> MemRef_A[1] };
; CHECK-NEXT: }
|
