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
|
// RUN: mlir-opt -test-last-modified --split-input-file %s 2>&1 | FileCheck %s
// CHECK-LABEL: test_tag: test_callsite
// CHECK: operand #0
// CHECK-NEXT: - a
func.func private @single_callsite_fn(%ptr: memref<i32>) -> memref<i32> {
return {tag = "test_callsite"} %ptr : memref<i32>
}
func.func @test_callsite() {
%ptr = memref.alloc() : memref<i32>
%c0 = arith.constant 0 : i32
memref.store %c0, %ptr[] {tag_name = "a"} : memref<i32>
%0 = func.call @single_callsite_fn(%ptr) : (memref<i32>) -> memref<i32>
return
}
// CHECK-LABEL: test_tag: test_return_site
// CHECK: operand #0
// CHECK-NEXT: - b
func.func private @single_return_site_fn(%ptr: memref<i32>) -> memref<i32> {
%c0 = arith.constant 0 : i32
memref.store %c0, %ptr[] {tag_name = "b"} : memref<i32>
return %ptr : memref<i32>
}
// CHECK-LABEL: test_tag: test_multiple_callsites
// CHECK: operand #0
// CHECK-NEXT: write0
// CHECK-NEXT: write1
func.func @test_return_site(%ptr: memref<i32>) -> memref<i32> {
%0 = func.call @single_return_site_fn(%ptr) : (memref<i32>) -> memref<i32>
return {tag = "test_return_site"} %0 : memref<i32>
}
func.func private @multiple_callsite_fn(%ptr: memref<i32>) -> memref<i32> {
return {tag = "test_multiple_callsites"} %ptr : memref<i32>
}
func.func @test_multiple_callsites(%a: i32, %ptr: memref<i32>) -> memref<i32> {
memref.store %a, %ptr[] {tag_name = "write0"} : memref<i32>
%0 = func.call @multiple_callsite_fn(%ptr) : (memref<i32>) -> memref<i32>
memref.store %a, %ptr[] {tag_name = "write1"} : memref<i32>
%1 = func.call @multiple_callsite_fn(%ptr) : (memref<i32>) -> memref<i32>
return %ptr : memref<i32>
}
// CHECK-LABEL: test_tag: test_multiple_return_sites
// CHECK: operand #0
// CHECK-NEXT: return0
// CHECK-NEXT: return1
func.func private @multiple_return_site_fn(%cond: i1, %a: i32, %ptr: memref<i32>) -> memref<i32> {
cf.cond_br %cond, ^a, ^b
^a:
memref.store %a, %ptr[] {tag_name = "return0"} : memref<i32>
return %ptr : memref<i32>
^b:
memref.store %a, %ptr[] {tag_name = "return1"} : memref<i32>
return %ptr : memref<i32>
}
func.func @test_multiple_return_sites(%cond: i1, %a: i32, %ptr: memref<i32>) -> memref<i32> {
%0 = func.call @multiple_return_site_fn(%cond, %a, %ptr) : (i1, i32, memref<i32>) -> memref<i32>
return {tag = "test_multiple_return_sites"} %0 : memref<i32>
}
// -----
func.func private @callee(%arg0: memref<f32>) -> memref<f32> {
%2 = arith.constant 2.0 : f32
memref.load %arg0[] {tag = "call_and_store_before::enter_callee"} : memref<f32>
memref.store %2, %arg0[] {tag_name = "callee"} : memref<f32>
memref.load %arg0[] {tag = "exit_callee"} : memref<f32>
return %arg0 : memref<f32>
}
// In this test, the "call" operation also stores to %arg0 itself before
// transferring control flow to the callee. Therefore, the order of accesses is
// "pre" -> "call" -> "callee" -> "post"
// CHECK-LABEL: test_tag: call_and_store_before::enter_callee:
// CHECK: operand #0
// CHECK: - call
// CHECK: test_tag: exit_callee:
// CHECK: operand #0
// CHECK: - callee
// CHECK: test_tag: before_call:
// CHECK: operand #0
// CHECK: - pre
// CHECK: test_tag: after_call:
// CHECK: operand #0
// CHECK: - callee
// CHECK: test_tag: return:
// CHECK: operand #0
// CHECK: - post
func.func @call_and_store_before(%arg0: memref<f32>) -> memref<f32> {
%0 = arith.constant 0.0 : f32
%1 = arith.constant 1.0 : f32
memref.store %0, %arg0[] {tag_name = "pre"} : memref<f32>
memref.load %arg0[] {tag = "before_call"} : memref<f32>
test.call_and_store @callee(%arg0), %arg0 {tag_name = "call", store_before_call = true} : (memref<f32>, memref<f32>) -> ()
memref.load %arg0[] {tag = "after_call"} : memref<f32>
memref.store %1, %arg0[] {tag_name = "post"} : memref<f32>
return {tag = "return"} %arg0 : memref<f32>
}
// -----
func.func private @callee(%arg0: memref<f32>) -> memref<f32> {
%2 = arith.constant 2.0 : f32
memref.load %arg0[] {tag = "call_and_store_after::enter_callee"} : memref<f32>
memref.store %2, %arg0[] {tag_name = "callee"} : memref<f32>
memref.load %arg0[] {tag = "exit_callee"} : memref<f32>
return %arg0 : memref<f32>
}
// In this test, the "call" operation also stores to %arg0 itself after getting
// control flow back from the callee. Therefore, the order of accesses is
// "pre" -> "callee" -> "call" -> "post"
// CHECK-LABEL: test_tag: call_and_store_after::enter_callee:
// CHECK: operand #0
// CHECK: - pre
// CHECK: test_tag: exit_callee:
// CHECK: operand #0
// CHECK: - callee
// CHECK: test_tag: before_call:
// CHECK: operand #0
// CHECK: - pre
// CHECK: test_tag: after_call:
// CHECK: operand #0
// CHECK: - call
// CHECK: test_tag: return:
// CHECK: operand #0
// CHECK: - post
func.func @call_and_store_after(%arg0: memref<f32>) -> memref<f32> {
%0 = arith.constant 0.0 : f32
%1 = arith.constant 1.0 : f32
memref.store %0, %arg0[] {tag_name = "pre"} : memref<f32>
memref.load %arg0[] {tag = "before_call"} : memref<f32>
test.call_and_store @callee(%arg0), %arg0 {tag_name = "call", store_before_call = false} : (memref<f32>, memref<f32>) -> ()
memref.load %arg0[] {tag = "after_call"} : memref<f32>
memref.store %1, %arg0[] {tag_name = "post"} : memref<f32>
return {tag = "return"} %arg0 : memref<f32>
}
|
