File: early-cse.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (98 lines) | stat: -rw-r--r-- 2,567 bytes parent folder | download | duplicates (12)
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
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt -S -passes=early-cse -earlycse-debug-hash < %s | FileCheck %s

; While it is normally okay to do memory optimizations over calls to
; @readonly_function and @readnone_function, we cannot do that if
; they're carrying unknown operand bundles since the presence of
; unknown operand bundles implies arbitrary memory effects.

declare void @readonly_function() readonly nounwind willreturn
declare void @readnone_function() readnone nounwind willreturn

define i32 @test0(ptr %x) {
; CHECK-LABEL: @test0(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 100, ptr [[X:%.*]], align 4
; CHECK-NEXT:    call void @readonly_function() [ "tag"() ]
; CHECK-NEXT:    [[V:%.*]] = load i32, ptr [[X]], align 4
; CHECK-NEXT:    ret i32 [[V]]
;
  entry:
  store i32 100, ptr %x
  call void @readonly_function() [ "tag"() ]

  %v = load i32, ptr %x
  ret i32 %v
}

define i32 @test1(ptr %x) {
; CHECK-LABEL: @test1(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 100, ptr [[X:%.*]], align 4
; CHECK-NEXT:    ret i32 100
;
  entry:
  store i32 100, ptr %x
  call void @readonly_function() readonly [ "tag"() ]
  %v = load i32, ptr %x
  ret i32 %v
}

define i32 @test3(ptr %x) {
; CHECK-LABEL: @test3(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 100, ptr [[X:%.*]], align 4
; CHECK-NEXT:    ret i32 100
;
  entry:
  store i32 100, ptr %x
  call void @readonly_function()
  %v = load i32, ptr %x
  ret i32 %v
}

define void @test4(ptr %x) {
; CHECK-LABEL: @test4(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 100, ptr [[X:%.*]], align 4
; CHECK-NEXT:    call void @readnone_function() [ "tag"() ]
; CHECK-NEXT:    store i32 200, ptr [[X]], align 4
; CHECK-NEXT:    ret void
;
  entry:
  store i32 100, ptr %x
  call void @readnone_function() [ "tag"() ]
  store i32 200, ptr %x
  ret void
}

define void @test5(ptr %x) {
; CHECK-LABEL: @test5(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 200, ptr [[X:%.*]], align 4
; CHECK-NEXT:    ret void
;
  entry:
  store i32 100, ptr %x
  call void @readnone_function() readnone [ "tag"() ]
  store i32 200, ptr %x
  ret void
}

define void @test6(ptr %x) {
; The "deopt" operand bundle does not make the call to
; @readonly_function read-write; and so the nounwind readonly call can
; be deleted.
; CHECK-LABEL: @test6(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    store i32 200, ptr [[X:%.*]], align 4
; CHECK-NEXT:    ret void
;
  entry:


  store i32 100, ptr %x
  call void @readonly_function() [ "deopt"() ]
  store i32 200, ptr %x
  ret void
}