blob: 9993d66729df15f461532caeb73800cde63aa0cf (
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
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
|
/* Test backtrace and backtrace_symbols for recursive calls.
Copyright (C) 2010-2015 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
#include <execinfo.h>
#include <search.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "tst-backtrace.h"
static int do_test (void);
#define TEST_FUNCTION do_test ()
#include "../test-skeleton.c"
/* The backtrace should include at least 3 * fn, and do_test. */
#define NUM_FUNCTIONS 4
NO_INLINE int
fn (int c)
{
void *addresses[NUM_FUNCTIONS];
char **symbols;
int n;
int i;
if (c > 0)
{
fn (c - 1);
return x;
}
/* Get the backtrace addresses. */
n = backtrace (addresses, sizeof (addresses) / sizeof (addresses[0]));
printf ("Obtained backtrace with %d functions\n", n);
/* Check that there are at least four functions. */
if (n < NUM_FUNCTIONS)
{
FAIL ();
return 1;
}
/* Convert them to symbols. */
symbols = backtrace_symbols (addresses, n);
/* Check that symbols were obtained. */
if (symbols == NULL)
{
FAIL ();
return 1;
}
for (i = 0; i < n; ++i)
printf ("Function %d: %s\n", i, symbols[i]);
/* Check that the function names obtained are accurate. */
for (i = 0; i < n - 1; ++i)
if (!match (symbols[i], "fn"))
{
FAIL ();
return 1;
}
/* Symbol names are not available for static functions, so we do not
check do_test. */
return x;
}
NO_INLINE static int
do_test (void)
{
fn (2);
return ret;
}
|
