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
|
; RUN: opt -S -passes=dse < %s | FileCheck %s
declare void @f()
declare noalias ptr @malloc(i32) nounwind
define void @test_0() {
; CHECK-LABEL: @test_0(
%m = call ptr @malloc(i32 24)
tail call void @f() [ "unknown"(ptr %m) ]
; CHECK: store i8 -19, ptr %m
store i8 -19, ptr %m
ret void
}
define ptr @test_1() {
; CHECK-LABEL: @test_1(
%m = call ptr @malloc(i32 24)
tail call void @f() [ "unknown"(ptr %m) ]
store i8 -19, ptr %m
tail call void @f()
store i8 101, ptr %m
; CHECK: tail call void @f() [ "unknown"(ptr %m) ]
; CHECK: store i8 -19, ptr %m
; CHECK: tail call void @f()
; CHECK: store i8 101, ptr %m
ret ptr %m
}
define void @test_2() {
; Since the deopt operand bundle does not escape %m (see caveat below), it is
; legal to elide the final store that location.
; CHECK-LABEL: @test_2(
%m = call ptr @malloc(i32 24)
tail call void @f() [ "deopt"(ptr %m) ]
store i8 -19, ptr %m
ret void
; CHECK: tail call void @f() [ "deopt"(ptr %m) ]
; CHECK-NEXT: ret void
}
define ptr @test_3() {
; Since the deopt operand bundle does not escape %m (see caveat below), @f
; cannot observe the stores to %m
; CHECK-LABEL: @test_3(
%m = call ptr @malloc(i32 24)
tail call void @f() [ "deopt"(ptr %m) ]
store i8 -19, ptr %m
tail call void @f()
store i8 101, ptr %m
ret ptr %m
}
; Caveat: technically, %m can only escape if the calling function is deoptimized
; at the call site (i.e. the call returns to the "deopt" continuation). Since
; the calling function body will be invalidated in that case, the calling
; function can be optimized under the assumption that %m does not escape.
|
