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
|
/* This testcase is part of GDB, the GNU debugger.
Copyright 1998-2014 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* Test GDB's ability to restore saved registers from stack frames
when using the `return' command.
Jim Blandy <jimb@cygnus.com> --- December 1998 */
#include <stdio.h>
/* This is the Emacs Lisp expression I used to generate the functions
in this file. If people modify the functions manually, instead of
changing this expression and re-running it, then evaluating this
expression could wipe out their work, so you probably shouldn't
re-run it. But I leave it here for reference.
(defun callee (n) (format "callee%d" n))
(defun caller (n) (format "caller%d" n))
(defun local (n) (format "l%d" n))
(defun local-sum (n)
(if (zerop n) (insert "0")
(let ((j 1))
(while (<= j n)
(insert (local j))
(if (< j n) (insert "+"))
(setq j (1+ j))))))
(defun local-chain (n previous first-end)
(let ((j 1))
(while (<= j n)
(insert " register int " (local j)
" = increment (" previous ");")
(if first-end
(progn
(insert " /" "* " first-end " prologue *" "/")
(setq first-end nil)))
(insert "\n")
(setq previous (local j))
(setq j (1+ j))))
previous)
(save-excursion
(let ((limit 5))
(goto-char (point-max))
(search-backward "generated code starts here")
(forward-line 1)
(let ((start (point)))
(search-forward "generated code ends here")
(forward-line 0)
(delete-region start (point)))
;; Generate callee functions.
(let ((i 0))
(while (<= i limit)
(insert (format "/%s Returns n * %d + %d %s/\n"
"*" i (/ (+ i (* i i)) 2) "*"))
(insert "int\n")
(insert (callee i) " (int n)\n")
(insert "{\n")
(local-chain i "n" (callee i))
(insert " return ")
(local-sum i)
(insert ";\n")
(insert "}\n\n")
(setq i (1+ i))))
;; Generate caller functions.
(let ((i 1))
(while (<= i limit)
(insert "int\n")
(insert (caller i) " (void)\n")
(insert "{\n")
(let ((last (local-chain i "0x7eeb" (caller i))))
(insert " register int n;\n")
(let ((j 0))
(while (<= j limit)
(insert " n = " (callee j) " ("
(if (> j 0) "n + " "")
last ");\n")
(setq j (1+ j)))))
(insert " return n+")
(local-sum i)
(insert ";\n")
(insert "}\n\n")
(setq i (1+ i))))
;; Generate driver function.
(insert "void\n")
(insert "driver (void)\n")
(insert "{\n")
(let ((i 1))
(while (<= i limit)
(insert " printf (\"" (caller i) " () => %d\\n\", "
(caller i) " ());\n")
(setq i (1+ i))))
(insert "}\n\n")))
*/
int
increment (int n)
{
return n + 1;
}
/* generated code starts here */
/* Returns n * 0 + 0 */
int
callee0 (int n)
{
return 0;
}
/* Returns n * 1 + 1 */
int
callee1 (int n)
{
register int l1 = increment (n); /* callee1 prologue */
return l1;
}
/* Returns n * 2 + 3 */
int
callee2 (int n)
{
register int l1 = increment (n); /* callee2 prologue */
register int l2 = increment (l1);
return l1+l2;
}
/* Returns n * 3 + 6 */
int
callee3 (int n)
{
register int l1 = increment (n); /* callee3 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
return l1+l2+l3;
}
/* Returns n * 4 + 10 */
int
callee4 (int n)
{
register int l1 = increment (n); /* callee4 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
register int l4 = increment (l3);
return l1+l2+l3+l4;
}
/* Returns n * 5 + 15 */
int
callee5 (int n)
{
register int l1 = increment (n); /* callee5 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
register int l4 = increment (l3);
register int l5 = increment (l4);
return l1+l2+l3+l4+l5;
}
int
caller1 (void)
{
register int l1 = increment (0x7eeb); /* caller1 prologue */
register int n;
n = callee0 (l1);
n = callee1 (n + l1);
n = callee2 (n + l1);
n = callee3 (n + l1);
n = callee4 (n + l1);
n = callee5 (n + l1);
return n+l1;
}
int
caller2 (void)
{
register int l1 = increment (0x7eeb); /* caller2 prologue */
register int l2 = increment (l1);
register int n;
n = callee0 (l2);
n = callee1 (n + l2);
n = callee2 (n + l2);
n = callee3 (n + l2);
n = callee4 (n + l2);
n = callee5 (n + l2);
return n+l1+l2;
}
int
caller3 (void)
{
register int l1 = increment (0x7eeb); /* caller3 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
register int n;
n = callee0 (l3);
n = callee1 (n + l3);
n = callee2 (n + l3);
n = callee3 (n + l3);
n = callee4 (n + l3);
n = callee5 (n + l3);
return n+l1+l2+l3;
}
int
caller4 (void)
{
register int l1 = increment (0x7eeb); /* caller4 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
register int l4 = increment (l3);
register int n;
n = callee0 (l4);
n = callee1 (n + l4);
n = callee2 (n + l4);
n = callee3 (n + l4);
n = callee4 (n + l4);
n = callee5 (n + l4);
return n+l1+l2+l3+l4;
}
int
caller5 (void)
{
register int l1 = increment (0x7eeb); /* caller5 prologue */
register int l2 = increment (l1);
register int l3 = increment (l2);
register int l4 = increment (l3);
register int l5 = increment (l4);
register int n;
n = callee0 (l5);
n = callee1 (n + l5);
n = callee2 (n + l5);
n = callee3 (n + l5);
n = callee4 (n + l5);
n = callee5 (n + l5);
return n+l1+l2+l3+l4+l5;
}
void
driver (void)
{
printf ("caller1 () => %d\n", caller1 ());
printf ("caller2 () => %d\n", caller2 ());
printf ("caller3 () => %d\n", caller3 ());
printf ("caller4 () => %d\n", caller4 ());
printf ("caller5 () => %d\n", caller5 ());
}
/* generated code ends here */
int main ()
{
register int local;
driver ();
printf("exiting\n");
return 0;
}
|
