File: unknown-dependence-retry-with-runtime-checks.ll

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (143 lines) | stat: -rw-r--r-- 6,373 bytes parent folder | download | duplicates (5)
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 4
; RUN: opt -passes='print<access-info>' -disable-output %s 2>&1 | FileCheck %s

target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"

declare void @llvm.assume(i1)

; FIXME: Currently we check all accesses to the same underlying objects, but
; it is sufficient to check the accesses to %A.
define void @test_dependence_with_non_constant_offset_and_other_accesses_to_noalias_pointers(ptr %A, ptr noalias %B, i64 %off) {
; CHECK-LABEL: 'test_dependence_with_non_constant_offset_and_other_accesses_to_noalias_pointers'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe with run-time checks
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Check 0:
; CHECK-NEXT:        Comparing group ([[GRP1:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
; CHECK-NEXT:        Against group ([[GRP2:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.A = getelementptr inbounds i8, ptr %A, i64 %iv
; CHECK-NEXT:      Check 1:
; CHECK-NEXT:        Comparing group ([[GRP3:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
; CHECK-NEXT:        Against group ([[GRP4:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.B.1 = getelementptr inbounds i8, ptr %B, i64 %iv.next
; CHECK-NEXT:      Grouped accesses:
; CHECK-NEXT:        Group [[GRP1]]:
; CHECK-NEXT:          (Low: (%off + %A) High: (404 + %off + %A))
; CHECK-NEXT:            Member: {(%off + %A),+,4}<nw><%loop>
; CHECK-NEXT:        Group [[GRP2]]:
; CHECK-NEXT:          (Low: %A High: (101 + %A))
; CHECK-NEXT:            Member: {%A,+,1}<nuw><%loop>
; CHECK-NEXT:        Group [[GRP3]]:
; CHECK-NEXT:          (Low: %B High: (101 + %B))
; CHECK-NEXT:            Member: {%B,+,1}<nuw><%loop>
; CHECK-NEXT:        Group [[GRP4]]:
; CHECK-NEXT:          (Low: (1 + %B)<nuw> High: (102 + %B))
; CHECK-NEXT:            Member: {(1 + %B)<nuw>,+,1}<nuw><%loop>
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %c = icmp sgt i64 %off, 0
  call void @llvm.assume(i1 %c)
  %A.off = getelementptr inbounds i8, ptr %A, i64 %off
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
  %gep.A = getelementptr inbounds i8, ptr %A, i64 %iv
  %l = load i8, ptr %gep.A, align 1
  %ext = zext i8 %l to i32
  store i32 %ext, ptr %gep.A.400, align 4
  %iv.next = add nuw nsw i64 %iv, 1
  %gep.B.1 = getelementptr inbounds i8, ptr %B, i64 %iv.next
  %l.2 = load i8, ptr %gep.B.1
  %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
  store i8 %l.2, ptr %gep.B
  %ec = icmp eq i64 %iv, 100
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}

define void @test_dependence_with_non_constant_offset_and_other_accesses_to_mayalias_pointers(ptr %A, ptr %B, i64 %off) {
; CHECK-LABEL: 'test_dependence_with_non_constant_offset_and_other_accesses_to_mayalias_pointers'
; CHECK-NEXT:    loop:
; CHECK-NEXT:      Memory dependences are safe with run-time checks
; CHECK-NEXT:      Dependences:
; CHECK-NEXT:      Run-time memory checks:
; CHECK-NEXT:      Check 0:
; CHECK-NEXT:        Comparing group ([[GRP5:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
; CHECK-NEXT:        Against group ([[GRP6:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
; CHECK-NEXT:      Check 1:
; CHECK-NEXT:        Comparing group ([[GRP5]]):
; CHECK-NEXT:          %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
; CHECK-NEXT:        Against group ([[GRP7:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.A = getelementptr inbounds i8, ptr %A, i64 %iv
; CHECK-NEXT:      Check 2:
; CHECK-NEXT:        Comparing group ([[GRP5]]):
; CHECK-NEXT:          %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
; CHECK-NEXT:        Against group ([[GRP8:0x[0-9a-f]+]]):
; CHECK-NEXT:          %gep.B.1 = getelementptr inbounds i8, ptr %B, i64 %iv.next
; CHECK-NEXT:      Check 3:
; CHECK-NEXT:        Comparing group ([[GRP6]]):
; CHECK-NEXT:          %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
; CHECK-NEXT:        Against group ([[GRP7]]):
; CHECK-NEXT:          %gep.A = getelementptr inbounds i8, ptr %A, i64 %iv
; CHECK-NEXT:      Check 4:
; CHECK-NEXT:        Comparing group ([[GRP6]]):
; CHECK-NEXT:          %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
; CHECK-NEXT:        Against group ([[GRP8]]):
; CHECK-NEXT:          %gep.B.1 = getelementptr inbounds i8, ptr %B, i64 %iv.next
; CHECK-NEXT:      Grouped accesses:
; CHECK-NEXT:        Group [[GRP5]]:
; CHECK-NEXT:          (Low: (%off + %A) High: (404 + %off + %A))
; CHECK-NEXT:            Member: {(%off + %A),+,4}<nw><%loop>
; CHECK-NEXT:        Group [[GRP6]]:
; CHECK-NEXT:          (Low: %B High: (101 + %B))
; CHECK-NEXT:            Member: {%B,+,1}<nuw><%loop>
; CHECK-NEXT:        Group [[GRP7]]:
; CHECK-NEXT:          (Low: %A High: (101 + %A))
; CHECK-NEXT:            Member: {%A,+,1}<nuw><%loop>
; CHECK-NEXT:        Group [[GRP8]]:
; CHECK-NEXT:          (Low: (1 + %B)<nuw> High: (102 + %B))
; CHECK-NEXT:            Member: {(1 + %B)<nuw>,+,1}<nuw><%loop>
; CHECK-EMPTY:
; CHECK-NEXT:      Non vectorizable stores to invariant address were not found in loop.
; CHECK-NEXT:      SCEV assumptions:
; CHECK-EMPTY:
; CHECK-NEXT:      Expressions re-written:
;
entry:
  %c = icmp sgt i64 %off, 0
  call void @llvm.assume(i1 %c)
  %A.off = getelementptr inbounds i8, ptr %A, i64 %off
  br label %loop

loop:
  %iv = phi i64 [ 0, %entry ], [ %iv.next, %loop ]
  %gep.A.400 = getelementptr inbounds i32, ptr %A.off, i64 %iv
  %gep.A = getelementptr inbounds i8, ptr %A, i64 %iv
  %l = load i8, ptr %gep.A, align 1
  %ext = zext i8 %l to i32
  store i32 %ext, ptr %gep.A.400, align 4
  %iv.next = add nuw nsw i64 %iv, 1
  %gep.B.1 = getelementptr inbounds i8, ptr %B, i64 %iv.next
  %l.2 = load i8, ptr %gep.B.1
  %gep.B = getelementptr inbounds i8, ptr %B, i64 %iv
  store i8 %l.2, ptr %gep.B
  %ec = icmp eq i64 %iv, 100
  br i1 %ec, label %exit, label %loop

exit:
  ret void
}