This repository has been archived by the owner on Dec 1, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 110
/
epilogue_test.go
232 lines (185 loc) · 5.75 KB
/
epilogue_test.go
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
/*
* Minio Cloud Storage, (C) 2017 Minio, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package main
import (
"strings"
"testing"
)
func equalString(a, b []string) bool {
if len(a) != len(b) {
return false
}
for i := range a {
if a[i] != b[i] {
return false
}
}
return true
}
func testEpilogue(t *testing.T, prologue, epilogue string, expected Epilogue) {
src := strings.Split(epilogue, "\n")
stack := extractEpilogueInfo(src, 0, len(src))
for _, line := range strings.Split(prologue, "\n") {
isPrologue := stack.isPrologueInstruction(line)
if !isPrologue {
t.Errorf("testEpilogue(): \nexpected true\ngot %#v", isPrologue)
}
}
if stack.StackSize != expected.StackSize || stack.AlignedStack != expected.AlignedStack ||
stack.VZeroUpper != expected.VZeroUpper || !equalString(stack.Pops, expected.Pops) ||
stack.SetRbpInstr != expected.SetRbpInstr {
t.Errorf("testEpilogue(): \nexpected %#v\ngot %#v", expected, stack)
}
}
func TestEpilogues(t *testing.T) {
asmPrologue1 := ` push rbp
mov rbp, rsp`
epilogue1 := Epilogue{SetRbpInstr: true, VZeroUpper: true}
epilogue1.Pops = append(epilogue1.Pops, "rbp")
asmEpilogue1 := ` pop rbp
vzeroupper
ret`
testEpilogue(t, asmPrologue1, asmEpilogue1, epilogue1)
/***********************************************************************************/
asmPrologue2 := ` push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx
and rsp, -32
sub rsp, 864`
epilogue2 := Epilogue{SetRbpInstr: true, StackSize: 864, AlignedStack: true, AlignValue: 32}
epilogue2.Pops = append(epilogue2.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
asmEpilogue2 := ` lea rsp, [rbp - 40]
pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp`
testEpilogue(t, asmPrologue2, asmEpilogue2, epilogue2)
/***********************************************************************************/
asmPrologue3 := `push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx`
epilogue3 := Epilogue{SetRbpInstr: true}
epilogue3.Pops = append(epilogue3.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
asmEpilogue3 := ` pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp`
testEpilogue(t, asmPrologue3, asmEpilogue3, epilogue3)
/***********************************************************************************/
asmPrologue4 := `push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx
sub rsp, 152`
epilogue4 := Epilogue{SetRbpInstr: true, StackSize: 152}
epilogue4.Pops = append(epilogue4.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
asmEpilogue4 := ` add rsp, 152
pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp`
testEpilogue(t, asmPrologue4, asmEpilogue4, epilogue4)
/***********************************************************************************/
asmPrologue5 := `push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx
and rsp, -32
sub rsp, 192`
epilogue5 := Epilogue{SetRbpInstr: true, StackSize: 192, AlignedStack: true, AlignValue: 32, VZeroUpper: true}
epilogue5.Pops = append(epilogue5.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
asmEpilogue5 := ` lea rsp, [rbp - 40]
pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp
vzeroupper
ret`
testEpilogue(t, asmPrologue5, asmEpilogue5, epilogue5)
/***********************************************************************************/
asmPrologue6 := `push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx
push rax`
epilogue6 := Epilogue{SetRbpInstr: true, VZeroUpper: true}
epilogue6.Pops = append(epilogue6.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
// `add rsp, 8` counters the additional `push rax` (there are 7 pushes and 6 pops)
asmEpilogue6 := ` add rsp, 8
pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp
vzeroupper
ret`
testEpilogue(t, asmPrologue6, asmEpilogue6, epilogue6)
asmPrologue7 := ` push rbp
mov rbp, rsp
push r15
push r14
push r13
push r12
push rbx
and rsp, -8
push rax`
asmEpilogue7 := ` lea rsp, [rbp - 40]
pop rbx
pop r12
pop r13
pop r14
pop r15
pop rbp
ret`
epilogue7 := Epilogue{SetRbpInstr: true, VZeroUpper: false, StackSize: 8}
epilogue7.Pops = append(epilogue7.Pops, "rbp", "r15", "r14", "r13", "r12", "rbx")
testEpilogue(t, asmPrologue7, asmEpilogue7, epilogue7)
asmPrologue8 := `push rbp
mov rbp, rsp
and rsp, -8`
asmEpilogue8 := `mov rsp, rbp
pop rbp
ret`
epilogue8 := Epilogue{SetRbpInstr: true, VZeroUpper: false, StackSize: 0}
epilogue8.Pops = append(epilogue8.Pops, "rbp")
testEpilogue(t, asmPrologue8, asmEpilogue8, epilogue8)
}