blob: b2a1e6d3dd9e861941bda4519d84d921105df884 (
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
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
|
/*
Copyright (C) 2009 RedHat 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 2 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, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "backtrace.h"
#include <stdlib.h>
struct frame *frame_new()
{
struct frame *f = malloc(sizeof(struct frame));
if (!f)
{
puts("Error while allocating memory for backtrace frame.");
exit(5);
}
f->function = NULL;
f->args = NULL;
f->number = 0;
f->binfile = NULL;
f->sourcefile = NULL;
f->crash = false;
f->next = NULL;
return f;
}
void frame_free(struct frame *f)
{
if (f->function)
free(f->function);
if (f->args)
free(f->args);
if (f->binfile)
free(f->binfile);
if (f->sourcefile)
free(f->sourcefile);
free(f);
}
struct frame *frame_add_sibling(struct frame *a, struct frame *b)
{
struct frame *aa = a;
while (aa->next)
aa = aa->next;
aa->next = b;
return a;
}
struct thread *thread_new()
{
struct thread *t = malloc(sizeof(struct thread));
if (!t)
{
puts("Error while allocating memory for backtrace thread.");
exit(5);
}
t->number = 0;
t->frames = NULL;
t->next = NULL;
}
void thread_free(struct thread *t)
{
while (t->frames)
{
struct frame *rm = t->frames;
t->frames = rm->next;
frame_free(rm);
}
free(t);
}
struct thread *thread_add_sibling(struct thread *a, struct thread *b)
{
struct thread *aa = a;
while (aa->next)
aa = aa->next;
aa->next = b;
return a;
}
static void thread_print_tree(struct thread *thread)
{
}
struct backtrace *backtrace_new()
{
struct backtrace *bt = malloc(sizeof(struct backtrace));
if (!bt)
{
puts("Error while allocating memory for backtrace.");
exit(5);
}
bt->threads = NULL;
}
void backtrace_free(struct backtrace *bt)
{
while (bt->threads)
{
struct thread *rm = bt->threads;
bt->threads = rm->next;
thread_free(rm);
}
free(bt);
}
static int backtrace_get_thread_count(struct backtrace *bt)
{
struct thread *t = bt->threads;
int count = 0;
while (t)
{
t = t->next;
++count;
}
return count;
}
void backtrace_print_tree(struct backtrace *bt)
{
printf("Thread count: %d\n", backtrace_get_thread_count(bt));
struct thread *thread = bt->threads;
while (thread)
{
thread_print_tree(thread);
thread = thread->next;
}
}
|
