-
Notifications
You must be signed in to change notification settings - Fork 5
/
symbols.c
207 lines (130 loc) · 3.41 KB
/
symbols.c
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
/********************************************************************
* File: symbols.c
*
* Symbols functions. This file has functions for symbols mgmt
* (such as translating addresses to function names with
* addr2line) and also connectivity matrix functions to keep
* the function call trace counts.
*
* Author: M. Tim Jones <mtj@mtjones.com>
*
*/
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <stdlib.h>
#include "stack.h"
#include "symbols.h"
func_t functions[MAX_FUNCTIONS];
unsigned int totals[MAX_FUNCTIONS];
unsigned int calls[MAX_FUNCTIONS][MAX_FUNCTIONS];
char imageName[50];
void initSymbol( char *image )
{
int from, to;
strcpy( imageName, image );
for ( from = 0 ; from < MAX_FUNCTIONS ; from++ ) {
functions[from].address = 0;
functions[from].funcName[0] = 0;
totals[from] = 0;
for ( to = 0 ; to < MAX_FUNCTIONS ; to++ ) {
calls[from][to] = 0;
}
}
return;
}
int lookupSymbol( unsigned int address )
{
int index;
for (index = 0 ; index < MAX_FUNCTIONS ; index++) {
if (functions[index].address == 0) break;
if (functions[index].address == address) return index;
}
assert(0);
return 0;
}
int translateFunctionFromSymbol( unsigned int address, char *func )
{
FILE *p;
char line[100];
int len, i;
sprintf( line, "addr2line -e %s -f -s 0x%x", imageName, address );
p = popen( line, "r" );
if (p == NULL) return 0;
else {
len = fread( line, 99, 1, p );
i = 0;
while ( i < strlen(line) ) {
if ((line[i] == 0x0d) || (line[i] == 0x0a)) {
func[i] = 0;
break;
} else {
func[i] = line[i];
}
i++;
}
pclose(p);
}
return 1;
}
void addSymbol( unsigned int address )
{
int index;
for (index = 0 ; index < MAX_FUNCTIONS ; index++) {
if (functions[index].address == address) return;
if (functions[index].address == 0) break;
}
if (index < MAX_FUNCTIONS) {
functions[index].address = address;
translateFunctionFromSymbol( address, functions[index].funcName );
} else {
assert( 0 );
}
return;
}
void addCallTrace( unsigned int address )
{
if (stackNumElems()) {
calls[lookupSymbol(stackTop())][lookupSymbol(address)]++;
}
return;
}
void emitSymbols( void )
{
int from, to;
FILE *fp;
fp = fopen("graph.dot", "w");
if (fp == NULL) {
printf("Couldn't open graph.dot\n");
exit(0);
}
fprintf(fp, "digraph %s {\n\n", imageName );
/* Identify node shapes */
for (from = 0 ; from < MAX_FUNCTIONS ; from++) {
if (functions[from].address == 0) break;
for (to = 0 ; to < MAX_FUNCTIONS ; to++) {
if (functions[to].address == 0) break;
if (calls[from][to]) totals[from]++;
}
if (totals[from]) {
fprintf( fp, " %s [shape=rectangle]\n", functions[from].funcName );
} else {
fprintf( fp, " %s [shape=ellipse]\n", functions[from].funcName );
}
}
/* Emit call graph */
for (from = 0 ; from < MAX_FUNCTIONS ; from++) {
if (functions[from].address == 0) break;
for (to = 0 ; to < MAX_FUNCTIONS ; to++) {
if (calls[from][to]) {
fprintf( fp, " %s -> %s [label=\"%d calls\" fontsize=\"10\"]\n",
functions[from].funcName, functions[to].funcName,
calls[from][to] );
}
if (functions[to].address == 0) break;
}
}
fprintf( fp, "\n}\n" );
fclose(fp);
return;
}