blob: d0e631a84577efc3f300fa63f2850ada2b0d356a (
plain)
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
|
/*
* This simple classical example of recursion is useful for
* testing stack backtraces and such.
*/
#include <stdio.h>
#include <stdlib.h>
#include "unbuffer_output.c"
int factorial (int);
int
main (int argc, char **argv, char **envp)
{
gdb_unbuffer_output ();
#ifdef FAKEARGV
printf ("%d\n", factorial (1)); /* commands.exp: hw local_var out of scope */
#else
if (argc != 2) {
printf ("usage: factorial <number>\n");
return 1;
} else {
printf ("%d\n", factorial (atoi (argv[1])));
}
#endif
return 0;
}
int factorial (int value)
{
int local_var;
if (value > 1) {
value *= factorial (value - 1);
}
local_var = value;
return (value);
} /* commands.exp: local_var out of scope */
|
