aboutsummaryrefslogtreecommitdiff
path: root/llvm/test/Analysis/BasicAA/recphi.ll
blob: 4b37fcedecf71b7703e5d0006435c3216f8885c7 (plain)
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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
; RUN: opt < %s -aa-pipeline=basic-aa -passes=aa-eval -print-all-alias-modref-info -disable-output 2>&1 | FileCheck %s

; CHECK-LABEL: Function: simple: 5 pointers, 0 call sites
; CHECK:         NoAlias:      float* %src1, float* %src2
; CHECK:         NoAlias:      float* %phi, float* %src1
; CHECK:         MayAlias:     float* %phi, float* %src2
; CHECK:         NoAlias:      float* %next, float* %src1
; CHECK:         MayAlias:     float* %next, float* %src2
; CHECK:         NoAlias:      float* %next, float* %phi
; CHECK:         NoAlias:      float* %g, float* %src1
; CHECK:         NoAlias:      float* %g, float* %src2
; CHECK:         NoAlias:      float* %g, float* %phi
; CHECK:         NoAlias:      float* %g, float* %next
define void @simple(ptr %src1, ptr noalias %src2, i32 %n) nounwind {
entry:
  load float, ptr %src1
  load float, ptr %src2
  br label %loop

loop:
  %phi = phi ptr [ %src2, %entry ], [ %next, %loop ]
  %idx = phi i32 [ 0, %entry ], [ %idxn, %loop ]
  %next = getelementptr inbounds float, ptr %phi, i32 1
  %g = getelementptr inbounds float, ptr %src1, i32 3
  %l = load float, ptr %phi
  load float, ptr %next
  %a = fadd float %l, 1.0
  store float %a, ptr %g
  %idxn = add nsw nuw i32 %idx, 1
  %cmp5 = icmp eq i32 %idxn, %n
  br i1 %cmp5, label %end, label %loop

end:
  ret void
}

; CHECK-LABEL: Function: notmust: 6 pointers, 0 call sites
; CHECK: MustAlias:	i8* %tab, [2 x i32]* %tab
; CHECK: PartialAlias (off -4):	i32* %arrayidx, [2 x i32]* %tab
; CHECK: NoAlias:	i32* %arrayidx, i8* %tab
; CHECK: MustAlias:	i32* %tab, [2 x i32]* %tab
; CHECK: MustAlias:	i32* %tab, i8* %tab
; CHECK: NoAlias:	i32* %arrayidx, i32* %tab
; CHECK: MayAlias:	i32* %incdec.ptr.i, [2 x i32]* %tab
; CHECK: NoAlias:	i32* %incdec.ptr.i, i8* %tab
; CHECK: MayAlias:	i32* %arrayidx, i32* %incdec.ptr.i
; CHECK: NoAlias:	i32* %incdec.ptr.i, i32* %tab
; CHECK: MayAlias:	i32* %p.addr.05.i, [2 x i32]* %tab
; CHECK: MayAlias:	i32* %p.addr.05.i, i8* %tab
; CHECK: MayAlias:	i32* %arrayidx, i32* %p.addr.05.i
; CHECK: MayAlias:	i32* %p.addr.05.i, i32* %tab
; CHECK: NoAlias:	i32* %incdec.ptr.i, i32* %p.addr.05.i
define i32 @notmust() nounwind {
entry:
  %tab = alloca [2 x i32], align 4
  %ignore1 = load [2 x i32], ptr %tab
  %ignore2 = load i8, ptr %tab
  %arrayidx = getelementptr inbounds [2 x i32], ptr %tab, i32 0, i32 1
  store i32 0, ptr %arrayidx, align 4
  store i32 0, ptr %tab, align 4
  %0 = add i32 1, 1
  %cmp4.i = icmp slt i32 %0, 2
  br i1 %cmp4.i, label %while.body.i, label %f.exit

while.body.i: ; preds = %while.body.i, %entry
  %1 = phi i32 [ 1, %while.body.i ], [ %0, %entry ]
  %foo.06.i = phi i32 [ %sub.i, %while.body.i ], [ 2, %entry ]
  %p.addr.05.i = phi ptr [ %incdec.ptr.i, %while.body.i ], [ %tab, %entry ]
  %sub.i = sub nsw i32 %foo.06.i, %1
  %incdec.ptr.i = getelementptr inbounds i32, ptr %p.addr.05.i, i32 1
  %ignore3 = load i32, ptr %incdec.ptr.i
  store i32 %sub.i, ptr %p.addr.05.i, align 4
  %cmp.i = icmp sgt i32 %sub.i, 1
  br i1 %cmp.i, label %while.body.i, label %f.exit

f.exit: ; preds = %entry, %while.body.i
  %2 = load i32, ptr %tab, align 4
  %cmp = icmp eq i32 %2, 2
  %3 = load i32, ptr %arrayidx, align 4
  %cmp4 = icmp eq i32 %3, 1
  %or.cond = and i1 %cmp, %cmp4
  br i1 %or.cond, label %if.end, label %if.then

if.then: ; preds = %f.exit
  unreachable

if.end: ; preds = %f.exit
  ret i32 0
}

; CHECK-LABEL: Function: reverse: 6 pointers, 0 call sites
; CHECK: MustAlias:	i8* %tab, [10 x i32]* %tab
; CHECK: MustAlias:	i32* %tab, [10 x i32]* %tab
; CHECK: MustAlias:	i32* %tab, i8* %tab
; CHECK: PartialAlias (off -36):	i32* %arrayidx1, [10 x i32]* %tab
; CHECK: NoAlias:	i32* %arrayidx1, i8* %tab
; CHECK: NoAlias:	i32* %arrayidx1, i32* %tab
; CHECK: MayAlias:	i32* %incdec.ptr.i, [10 x i32]* %tab
; CHECK: MayAlias:	i32* %incdec.ptr.i, i8* %tab
; CHECK: MayAlias:	i32* %incdec.ptr.i, i32* %tab
; CHECK: MayAlias:	i32* %arrayidx1, i32* %incdec.ptr.i
; CHECK: MayAlias:	i32* %p.addr.05.i, [10 x i32]* %tab
; CHECK: MayAlias:	i32* %p.addr.05.i, i8* %tab
; CHECK: MayAlias:	i32* %p.addr.05.i, i32* %tab
; CHECK: MayAlias:	i32* %arrayidx1, i32* %p.addr.05.i
; CHECK: NoAlias:	i32* %incdec.ptr.i, i32* %p.addr.05.i
define i32 @reverse() nounwind {
entry:
  %tab = alloca [10 x i32], align 4
  %ignore1 = load [10 x i32], ptr %tab
  %ignore2 = load i8, ptr %tab
  store i32 0, ptr %tab, align 4
  %arrayidx1 = getelementptr inbounds [10 x i32], ptr %tab, i32 0, i32 9
  store i32 0, ptr %arrayidx1, align 4
  %0 = add i32 1, 1
  %cmp4.i = icmp slt i32 %0, 2
  br i1 %cmp4.i, label %while.body.i, label %f.exit

while.body.i: ; preds = %while.body.i, %entry
  %1 = phi i32 [ 1, %while.body.i ], [ %0, %entry ]
  %foo.06.i = phi i32 [ %sub.i, %while.body.i ], [ 2, %entry ]
  %p.addr.05.i = phi ptr [ %incdec.ptr.i, %while.body.i ], [ %arrayidx1, %entry ]
  %sub.i = sub nsw i32 %foo.06.i, %1
  %incdec.ptr.i = getelementptr inbounds i32, ptr %p.addr.05.i, i32 -1
  %ignore3 = load i32, ptr %incdec.ptr.i
  store i32 %sub.i, ptr %p.addr.05.i, align 4
  %cmp.i = icmp sgt i32 %sub.i, 1
  br i1 %cmp.i, label %while.body.i, label %f.exit

f.exit: ; preds = %entry, %while.body.i
  %2 = load i32, ptr %arrayidx1, align 4
  %cmp = icmp eq i32 %2, 2
  %3 = load i32, ptr %tab, align 4
  %cmp4 = icmp eq i32 %3, 1
  %or.cond = and i1 %cmp, %cmp4
  br i1 %or.cond, label %if.end, label %if.then

if.then: ; preds = %f.exit
  unreachable

if.end: ; preds = %f.exit
  ret i32 0
}

; CHECK-LABEL: Function: negative: 5 pointers, 1 call sites
; CHECK: PartialAlias (off -4):	i16* %_tmp1, [3 x i16]* %int_arr.10
; CHECK: MayAlias:	[3 x i16]* %int_arr.10, i16* %ls1.9.0
; CHECK: MayAlias:	i16* %_tmp1, i16* %ls1.9.0
; CHECK: MayAlias:	i16* %_tmp7, [3 x i16]* %int_arr.10
; CHECK: MayAlias:	i16* %_tmp1, i16* %_tmp7
; CHECK: NoAlias:	i16* %_tmp7, i16* %ls1.9.0
; CHECK: PartialAlias (off -2):	i16* %_tmp11, [3 x i16]* %int_arr.10
; CHECK: NoAlias:	i16* %_tmp1, i16* %_tmp11
; CHECK: MayAlias:	i16* %_tmp11, i16* %ls1.9.0
; CHECK: MayAlias:	i16* %_tmp11, i16* %_tmp7
; CHECK: NoModRef:  Ptr: [3 x i16]* %int_arr.10	<->  %_tmp16 = call i16 @call(i32 %_tmp13)
; CHECK: NoModRef:  Ptr: i16* %_tmp1	<->  %_tmp16 = call i16 @call(i32 %_tmp13)
; CHECK: Both ModRef:  Ptr: i16* %ls1.9.0	<->  %_tmp16 = call i16 @call(i32 %_tmp13)
; CHECK: Both ModRef:  Ptr: i16* %_tmp7	<->  %_tmp16 = call i16 @call(i32 %_tmp13)
; CHECK: NoModRef:  Ptr: i16* %_tmp11	<->  %_tmp16 = call i16 @call(i32 %_tmp13)
define i16 @negative(i16 %argc.5.par) {
  %int_arr.10 = alloca [3 x i16], align 1
  load [3 x i16], ptr %int_arr.10
  %_tmp1 = getelementptr inbounds [3 x i16], ptr %int_arr.10, i16 0, i16 2
  load i16, ptr %_tmp1
  br label %bb1

bb1:                                              ; preds = %bb1, %0
  %i.7.0 = phi i16 [ 2, %0 ], [ %_tmp5, %bb1 ]
  %ls1.9.0 = phi ptr [ %_tmp1, %0 ], [ %_tmp7, %bb1 ]
  store i16 %i.7.0, ptr %ls1.9.0, align 1
  %_tmp5 = add nsw i16 %i.7.0, -1
  %_tmp7 = getelementptr i16, ptr %ls1.9.0, i16 -1
  load i16, ptr %_tmp7
  %_tmp9 = icmp sgt i16 %i.7.0, 0
  br i1 %_tmp9, label %bb1, label %bb3

bb3:                                              ; preds = %bb1
  %_tmp11 = getelementptr inbounds [3 x i16], ptr %int_arr.10, i16 0, i16 1
  %_tmp12 = load i16, ptr %_tmp11, align 1
  %_tmp13 = sext i16 %_tmp12 to i32
  %_tmp16 = call i16 @call(i32 %_tmp13)
  %_tmp18.not = icmp eq i16 %_tmp12, 1
  br i1 %_tmp18.not, label %bb5, label %bb4

bb4:                                              ; preds = %bb3
  ret i16 1

bb5:                                              ; preds = %bb3, %bb4
  ret i16 0
}

; CHECK-LABEL: Function: dynamic_offset
; CHECK: NoAlias:  i8* %a, i8* %p.base
; CHECK: MayAlias: i8* %p, i8* %p.base
; CHECK: NoAlias:  i8* %a, i8* %p
; CHECK: MayAlias: i8* %p.base, i8* %p.next
; CHECK: NoAlias:  i8* %a, i8* %p.next
; CHECK: MayAlias: i8* %p, i8* %p.next
define void @dynamic_offset(i1 %c, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %loop

loop:
  %p = phi ptr [ %p.base, %entry ], [ %p.next, %loop ]
  %offset = call i16 @call(i32 0)
  %p.next = getelementptr inbounds i8, ptr %p, i16 %offset
  load i8, ptr %p
  load i8, ptr %p.next
  br i1 %c, label %loop, label %exit

exit:
  ret void
}

; TODO: Currently yields an asymmetric result.
; CHECK-LABEL: Function: symmetry
; CHECK: MayAlias:  i32* %p, i32* %p.base
; CHECK: MayAlias:  i32* %p.base, i32* %p.next
; CHECK: NoAlias:   i32* %p, i32* %p.next
; CHECK: MayAlias:  i32* %p.base, i32* %result
; CHECK: NoAlias:   i32* %p, i32* %result
; CHECK: MustAlias: i32* %p.next, i32* %result
define ptr @symmetry(ptr %p.base, i1 %c) {
entry:
  load i32, ptr %p.base
  br label %loop

loop:
  %p = phi ptr [ %p.base, %entry ], [ %p.next, %loop ]
  %p.next = getelementptr inbounds i32, ptr %p, i32 1
  load i32, ptr %p
  load i32, ptr %p.next
  br i1 %c, label %loop, label %exit

exit:
  %result = phi ptr [ %p.next, %loop ]
  load i32, ptr %result
  ret ptr %result
}

; FIXME: %a and %p.inner do not alias.
; CHECK-LABEL: Function: nested_loop
; CHECK: NoAlias:  i8* %a, i8* %p.base
; CHECK: NoAlias:  i8* %a, i8* %p.outer
; CHECK: MayAlias: i8* %a, i8* %p.inner
; CHECK: NoAlias:  i8* %a, i8* %p.inner.next
; CHECK: NoAlias:  i8* %a, i8* %p.outer.next
define void @nested_loop(i1 %c, i1 %c2, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %outer_loop

outer_loop:
  %p.outer = phi ptr [ %p.base, %entry ], [ %p.outer.next, %outer_loop_latch ]
  load i8, ptr %p.outer
  br label %inner_loop

inner_loop:
  %p.inner = phi ptr [ %p.outer, %outer_loop ], [ %p.inner.next, %inner_loop ]
  %p.inner.next = getelementptr inbounds i8, ptr %p.inner, i64 1
  load i8, ptr %p.inner
  load i8, ptr %p.inner.next
  br i1 %c, label %inner_loop, label %outer_loop_latch

outer_loop_latch:
  %p.outer.next = getelementptr inbounds i8, ptr %p.inner, i64 10
  load i8, ptr %p.outer.next
  br i1 %c2, label %outer_loop, label %exit

exit:
  ret void
}

; Same as the previous test case, but avoiding phi of phi.
; CHECK-LABEL: Function: nested_loop2
; CHECK: NoAlias:  i8* %a, i8* %p.base
; CHECK: NoAlias:  i8* %a, i8* %p.outer
; CHECK: NoAlias:  i8* %a, i8* %p.outer.next
; CHECK: MayAlias: i8* %a, i8* %p.inner
; CHECK: NoAlias:  i8* %a, i8* %p.inner.next
; TODO: (a, p.inner) could be NoAlias
define void @nested_loop2(i1 %c, i1 %c2, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %outer_loop

outer_loop:
  %p.outer = phi ptr [ %p.base, %entry ], [ %p.outer.next, %outer_loop_latch ]
  %p.outer.next = getelementptr inbounds i8, ptr %p.outer, i64 10
  load i8, ptr %p.outer
  load i8, ptr %p.outer.next
  br label %inner_loop

inner_loop:
  %p.inner = phi ptr [ %p.outer.next, %outer_loop ], [ %p.inner.next, %inner_loop ]
  %p.inner.next = getelementptr inbounds i8, ptr %p.inner, i64 1
  load i8, ptr %p.inner
  load i8, ptr %p.inner.next
  br i1 %c, label %inner_loop, label %outer_loop_latch

outer_loop_latch:
  br i1 %c2, label %outer_loop, label %exit

exit:
  ret void
}

; CHECK-LABEL: Function: nested_loop3
; CHECK: NoAlias:	i8* %a, i8* %p.base
; CHECK: NoAlias:	i8* %a, i8* %p.outer
; CHECK: NoAlias:	i8* %a, i8* %p.outer.next
; CHECK: NoAlias:	i8* %a, i8* %p.inner
; CHECK: NoAlias:	i8* %a, i8* %p.inner.next
define void @nested_loop3(i1 %c, i1 %c2, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %outer_loop

outer_loop:
  %p.outer = phi ptr [ %p.base, %entry ], [ %p.outer.next, %outer_loop_latch ]
  %p.outer.next = getelementptr inbounds i8, ptr %p.outer, i64 10
  load i8, ptr %p.outer
  load i8, ptr %p.outer.next
  br label %inner_loop

inner_loop:
  %p.inner = phi ptr [ %p.outer, %outer_loop ], [ %p.inner.next, %inner_loop ]
  %p.inner.next = getelementptr inbounds i8, ptr %p.inner, i64 1
  load i8, ptr %p.inner
  load i8, ptr %p.inner.next
  br i1 %c, label %inner_loop, label %outer_loop_latch

outer_loop_latch:
  br i1 %c2, label %outer_loop, label %exit

exit:
  ret void
}

; CHECK-LABEL: Function: sibling_loop
; CHECK: NoAlias:	i8* %a, i8* %p.base
; CHECK: NoAlias:	i8* %a, i8* %p1
; CHECK: NoAlias:	i8* %a, i8* %p1.next
; CHECK: MayAlias:	i8* %a, i8* %p2
; CHECK: NoAlias:	i8* %a, i8* %p2.next
; TODO: %p2 does not alias %a
define void @sibling_loop(i1 %c, i1 %c2, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %loop1

loop1:
  %p1 = phi ptr [ %p.base, %entry ], [ %p1.next, %loop1 ]
  %p1.next = getelementptr inbounds i8, ptr %p1, i64 10
  load i8, ptr %p1
  load i8, ptr %p1.next
  br i1 %c, label %loop1, label %loop2

loop2:
  %p2 = phi ptr [ %p1.next, %loop1 ], [ %p2.next, %loop2 ]
  %p2.next = getelementptr inbounds i8, ptr %p2, i64 1
  load i8, ptr %p2
  load i8, ptr %p2.next
  br i1 %c2, label %loop2, label %exit

exit:
  ret void
}

; CHECK-LABEL: Function: sibling_loop2
; CHECK: NoAlias:	i8* %a, i8* %p.base
; CHECK: NoAlias:	i8* %a, i8* %p1
; CHECK: NoAlias:	i8* %a, i8* %p1.next
; CHECK: NoAlias:	i8* %a, i8* %p2
; CHECK: NoAlias:	i8* %a, i8* %p2.next
define void @sibling_loop2(i1 %c, i1 %c2, ptr noalias %p.base) {
entry:
  %a = alloca i8
  load i8, ptr %p.base
  load i8, ptr %a
  br label %loop1

loop1:
  %p1 = phi ptr [ %p.base, %entry ], [ %p1.next, %loop1 ]
  %p1.next = getelementptr inbounds i8, ptr %p1, i64 10
  load i8, ptr %p1
  load i8, ptr %p1.next
  br i1 %c, label %loop1, label %loop2

loop2:
  %p2 = phi ptr [ %p1, %loop1 ], [ %p2.next, %loop2 ]
  %p2.next = getelementptr inbounds i8, ptr %p2, i64 1
  load i8, ptr %p2
  load i8, ptr %p2.next
  br i1 %c2, label %loop2, label %exit

exit:
  ret void
}

; CHECK: MustAlias: i8* %a, i8* %phi
define void @phi_contains_self() {
entry:
  %a = alloca i32
  load i8, ptr %a
  br label %loop

loop:
  %phi = phi ptr [ %phi, %loop ], [ %a, %entry ]
  load i8, ptr %phi
  br label %loop
}

declare i16 @call(i32)