0.4.1/src/symbol.c

/*
 *  Copyright (C) 2003-2006  Anders Gavare.  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *  1. Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *  2. Redistributions in binary form must reproduce the above copyright  
 *     notice, this list of conditions and the following disclaimer in the 
 *     documentation and/or other materials provided with the distribution.
 *  3. The name of the author may not be used to endorse or promote products
 *     derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 *  ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 *  ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE   
 *  FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 *  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 *  OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 *  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 *  OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 *  SUCH DAMAGE.
 *
 *
 *  $Id: symbol.c,v 1.35 2006/03/22 21:39:23 debug Exp $
 *
 *  Address to symbol translation routines.
 *
 *  This module is (probably) independent from the rest of the emulator.
 *  symbol_init() must be called before any other function in this file is used.
 */

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "symbol.h"


#define SYMBOLBUF_MAX   100


/*
 *  symbol_nsymbols():
 *
 *  Return n_symbols.
 */
int symbol_nsymbols(struct symbol_context *sc)
{
        return sc->n_symbols;
}


/*
 *  get_symbol_addr():
 *
 *  Find a symbol by name. If addr is non-NULL, *addr is set to the symbol's
 *  address. Return value is 1 if the symbol is found, 0 otherwise.
 *
 *  NOTE:  This is O(n).
 */
int get_symbol_addr(struct symbol_context *sc, char *symbol, uint64_t *addr)
{
        struct symbol *s;

        if (sc->sorted_array) {
                int i;
                for (i=0; i<sc->n_symbols; i++)
                        if (strcmp(symbol, sc->first_symbol[i].name) == 0) {
                                if (addr != NULL)
                                        *addr = sc->first_symbol[i].addr;
                                return 1;
                        }
        } else {
                s = sc->first_symbol;
                while (s != NULL) {
                        if (strcmp(symbol, s->name) == 0) {
                                if (addr != NULL)
                                        *addr = s->addr;
                                return 1;
                        }
                        s = s->next;
                }
        }

        return 0;
}


/*
 *  get_symbol_name_and_n_args():
 *
 *  Translate an address into a symbol name.  The return value is a pointer
 *  to a static char array, containing the symbol name.  (In other words,
 *  this function is not reentrant. This removes the need for memory allocation
 *  at the caller's side.)
 *
 *  If offset is not a NULL pointer, *offset is set to the offset within
 *  the symbol. For example, if there is a symbol at address 0x1000 with
 *  length 0x100, and a caller wants to know the symbol name of address
 *  0x1008, the symbol's name will be found in the static char array, and
 *  *offset will be set to 0x8.
 *
 *  If n_argsp is non-NULL, *n_argsp is set to the symbol's n_args value.
 *
 *  If no symbol was found, NULL is returned instead.
 */
static char symbol_buf[SYMBOLBUF_MAX+1];
char *get_symbol_name_and_n_args(struct symbol_context *sc, uint64_t addr,
        uint64_t *offset, int *n_argsp)
{
        struct symbol *s;
        int stepsize, ofs;

        if (sc->n_symbols == 0)
                return NULL;

        if ((addr >> 32) == 0 && (addr & 0x80000000ULL))
                addr |= 0xffffffff00000000ULL;

        symbol_buf[0] = symbol_buf[SYMBOLBUF_MAX] = '\0';
        if (offset != NULL)
                *offset = 0;

        if (!sc->sorted_array) {
                /*  Slow, linear O(n) search:  */
                s = sc->first_symbol;
                while (s != NULL) {
                        /*  Found a match?  */
                        if (addr >= s->addr && addr < s->addr + s->len) {
                                if (addr == s->addr)
                                        snprintf(symbol_buf, SYMBOLBUF_MAX,
                                            "%s", s->name);
                                else
                                        snprintf(symbol_buf, SYMBOLBUF_MAX,
                                            "%s+0x%lx", s->name, (long)
                                            (addr - s->addr));
                                if (offset != NULL)
                                        *offset = addr - s->addr;
                                if (n_argsp != NULL)
                                        *n_argsp = s->n_args;
                                return symbol_buf;
                        }
                        s = s->next;
                }
        } else {
                /*  Faster, O(log n) search:  */
                stepsize = sc->n_symbols / 2;
                ofs = stepsize;
                while (stepsize > 0 || (stepsize == 0 && ofs == 0)) {
                        s = sc->first_symbol + ofs;

                        /*  Found a match?  */
                        if (addr >= s->addr && addr < s->addr + s->len) {
                                if (addr == s->addr)
                                        snprintf(symbol_buf, SYMBOLBUF_MAX,
                                            "%s", s->name);
                                else
                                        snprintf(symbol_buf, SYMBOLBUF_MAX,
                                            "%s+0x%lx", s->name, (long)
                                            (addr - s->addr));
                                if (offset != NULL)
                                        *offset = addr - s->addr;
                                if (n_argsp != NULL)
                                        *n_argsp = s->n_args;
                                return symbol_buf;
                        }

                        if (ofs == 0)
                                break;

                        stepsize >>= 1;

                        /*  Special case for offset 0 (end of search in
                            the Left direction  */
                        if (stepsize == 0)
                                ofs = 0;
                        else {
                                if (addr < s->addr)
                                        ofs -= stepsize;
                                else
                                        ofs += stepsize;
                        }
                }
        }

        /*  Not found? Then return NULL.  */
        return NULL;
}


/*
 *  get_symbol_name():
 *
 *  See get_symbol_name_and_n_args().
 */
char *get_symbol_name(struct symbol_context *sc, uint64_t addr, uint64_t *offs)
{
        return get_symbol_name_and_n_args(sc, addr, offs, NULL);
}


/*
 *  add_symbol_name():
 *
 *  Add a symbol to the symbol list.
 */
void add_symbol_name(struct symbol_context *sc,
        uint64_t addr, uint64_t len, char *name, int type, int n_args)
{
        struct symbol *s;

        if (sc->sorted_array) {
                fprintf(stderr, "add_symbol_name(): Internal error: the "
                    "symbol array is already sorted\n");
                exit(1);
        }

        if (name == NULL) {
                fprintf(stderr, "add_symbol_name(): name = NULL\n");
                exit(1);
        }

        if (name[0] == '\0')
                return;

        /*  TODO: Maybe this should be optional?  */
        if (name[0] == '.' || name[0] == '$')
                return;

        /*  Quick test-hack:  */
        if (n_args < 0) {
                if (strcmp(name, "strlen") == 0)
                        n_args = 1;
                if (strcmp(name, "strcmp") == 0)
                        n_args = 2;
                if (strcmp(name, "strcpy") == 0)
                        n_args = 2;
                if (strcmp(name, "strncpy") == 0)
                        n_args = 3;
                if (strcmp(name, "strlcpy") == 0)
                        n_args = 3;
                if (strcmp(name, "strlcat") == 0)
                        n_args = 3;
                if (strcmp(name, "strncmp") == 0)
                        n_args = 3;
                if (strcmp(name, "memset") == 0)
                        n_args = 3;
                if (strcmp(name, "memcpy") == 0)
                        n_args = 3;
                if (strcmp(name, "bzero") == 0)
                        n_args = 2;
                if (strcmp(name, "bcopy") == 0)
                        n_args = 3;
        }

        if ((addr >> 32) == 0 && (addr & 0x80000000ULL))
                addr |= 0xffffffff00000000ULL;

        s = malloc(sizeof(struct symbol));
        if (s == NULL) {
                fprintf(stderr, "out of memory\n");
                exit(1);
        }

        memset(s, 0, sizeof(struct symbol));

        s->name = symbol_demangle_cplusplus(name);

        if (s->name == NULL) {
                s->name = strdup(name);
                if (s->name == NULL) {
                        fprintf(stderr, "out of memory\n");
                        exit(1);
                }
        }

        s->addr   = addr;
        s->len    = len;
        s->type   = type;
        s->n_args = n_args;

        sc->n_symbols ++;

        /*  Add first in list:  */
        s->next = sc->first_symbol;
        sc->first_symbol = s;
}


/*
 *  symbol_readfile():
 *
 *  Read 'nm -S' style symbols from a file.
 *
 *  TODO: This function is an ugly hack, and should be replaced
 *  with something that reads symbols directly from the executable
 *  images.
 */
void symbol_readfile(struct symbol_context *sc, char *fname)
{
        FILE *f;
        char b1[80]; uint64_t addr;
        char b2[80]; uint64_t len;
        char b3[80]; int type;
        char b4[80];
        int cur_n_symbols = sc->n_symbols;

        f = fopen(fname, "r");
        if (f == NULL) {
                perror(fname);
                exit(1);
        }

        while (!feof(f)) {
                memset(b1, 0, sizeof(b1));
                memset(b2, 0, sizeof(b2));
                memset(b3, 0, sizeof(b3));
                memset(b4, 0, sizeof(b4));
                fscanf(f, "%s %s\n", b1,b2);
                if (strlen(b2) < 2 && !(b2[0]>='0' && b2[0]<='9')) {
                        strlcpy(b3, b2, sizeof(b3));
                        strlcpy(b2, "0", sizeof(b2));
                        fscanf(f, "%s\n", b4);
                } else {
                        fscanf(f, "%s %s\n", b3,b4);
                }

                /*  printf("b1='%s' b2='%s' b3='%s' b4='%s'\n",
                    b1,b2,b3,b4);  */
                addr = strtoull(b1, NULL, 16);
                len  = strtoull(b2, NULL, 16);
                type = b3[0];
                /*  printf("addr=%016llx len=%016llx type=%i\n",
                    addr, len, type);  */

                if (type == 't' || type == 'r' || type == 'g')
                        continue;

                add_symbol_name(sc, addr, len, b4, type, -1);
        }

        fclose(f);

        debug("%i symbols\n", sc->n_symbols - cur_n_symbols);
}


/*
 *  sym_addr_compare():
 *
 *  Helper function for sorting symbols according to their address.
 */
int sym_addr_compare(const void *a, const void *b)
{
        struct symbol *p1 = (struct symbol *) a;
        struct symbol *p2 = (struct symbol *) b;

        if (p1->addr < p2->addr)
                return -1;
        if (p1->addr > p2->addr)
                return 1;

        return 0;
}


/*
 *  symbol_recalc_sizes():
 *
 *  Recalculate sizes of symbols that have size = 0, by creating an array
 *  containing all symbols, qsort()-ing that array according to address, and
 *  recalculating the size fields if necessary.
 */
void symbol_recalc_sizes(struct symbol_context *sc)
{
        struct symbol *tmp_array;
        struct symbol *last_ptr;
        struct symbol *tmp_ptr;
        int i;

        tmp_array = malloc(sizeof (struct symbol) * sc->n_symbols);
        if (tmp_array == NULL) {
                fprintf(stderr, "out of memory\n");
                exit(1);
        }

        /*  Copy first_symbol --> tmp_array, and remove the old
                first_symbol at the same time:  */
        tmp_ptr = sc->first_symbol;
        i = 0;
        while (tmp_ptr != NULL) {
                tmp_array[i] = *tmp_ptr;
                last_ptr = tmp_ptr;
                tmp_ptr = tmp_ptr->next;
                free(last_ptr);
                i++;
        }

        qsort(tmp_array, sc->n_symbols, sizeof(struct symbol),
            sym_addr_compare);
        sc->sorted_array = 1;

        /*  Recreate the first_symbol chain:  */
        sc->first_symbol = NULL;
        for (i=0; i<sc->n_symbols; i++) {
                /*  Recalculate size, if 0:  */
                if (tmp_array[i].len == 0) {
                        uint64_t len;
                        if (i != sc->n_symbols-1)
                                len = tmp_array[i+1].addr
                                    - tmp_array[i].addr;
                        else
                                len = 1;
                        tmp_array[i].len = len;
                }

                tmp_array[i].next = &tmp_array[i+1];
        }

        sc->first_symbol = tmp_array;
}


/*
 *  symbol_init():
 *
 *  Initialize the symbol hashtables.
 */
void symbol_init(struct symbol_context *sc)
{
        sc->first_symbol = NULL;
        sc->sorted_array = 0;
        sc->n_symbols = 0;
}

1	/*
2	* Copyright (C) 2003-2006 Anders Gavare. All rights reserved.
3	*
4	* Redistribution and use in source and binary forms, with or without
5	* modification, are permitted provided that the following conditions are met:
6	*
7	* 1. Redistributions of source code must retain the above copyright
8	* notice, this list of conditions and the following disclaimer.
9	* 2. Redistributions in binary form must reproduce the above copyright
10	* notice, this list of conditions and the following disclaimer in the
11	* documentation and/or other materials provided with the distribution.
12	* 3. The name of the author may not be used to endorse or promote products
13	* derived from this software without specific prior written permission.
14	*
15	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18	* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25	* SUCH DAMAGE.
26	*
27	*
28	* $Id: symbol.c,v 1.35 2006/03/22 21:39:23 debug Exp $
29	*
30	* Address to symbol translation routines.
31	*
32	* This module is (probably) independent from the rest of the emulator.
33	* symbol_init() must be called before any other function in this file is used.
34	*/
35
36	#include <stdio.h>
37	#include <stdlib.h>
38	#include <string.h>
39
40	#include "symbol.h"
41
42
43	#define SYMBOLBUF_MAX 100
44
45
46	/*
47	* symbol_nsymbols():
48	*
49	* Return n_symbols.
50	*/
51	int symbol_nsymbols(struct symbol_context *sc)
52	{
53	return sc->n_symbols;
54	}
55
56
57	/*
58	* get_symbol_addr():
59	*
60	* Find a symbol by name. If addr is non-NULL, *addr is set to the symbol's
61	* address. Return value is 1 if the symbol is found, 0 otherwise.
62	*
63	* NOTE: This is O(n).
64	*/
65	int get_symbol_addr(struct symbol_context sc, char symbol, uint64_t *addr)
66	{
67	struct symbol *s;
68
69	if (sc->sorted_array) {
70	int i;
71	for (i=0; i<sc->n_symbols; i++)
72	if (strcmp(symbol, sc->first_symbol[i].name) == 0) {
73	if (addr != NULL)
74	*addr = sc->first_symbol[i].addr;
75	return 1;
76	}
77	} else {
78	s = sc->first_symbol;
79	while (s != NULL) {
80	if (strcmp(symbol, s->name) == 0) {
81	if (addr != NULL)
82	*addr = s->addr;
83	return 1;
84	}
85	s = s->next;
86	}
87	}
88
89	return 0;
90	}
91
92
93	/*
94	* get_symbol_name_and_n_args():
95	*
96	* Translate an address into a symbol name. The return value is a pointer
97	* to a static char array, containing the symbol name. (In other words,
98	* this function is not reentrant. This removes the need for memory allocation
99	* at the caller's side.)
100	*
101	* If offset is not a NULL pointer, *offset is set to the offset within
102	* the symbol. For example, if there is a symbol at address 0x1000 with
103	* length 0x100, and a caller wants to know the symbol name of address
104	* 0x1008, the symbol's name will be found in the static char array, and
105	* *offset will be set to 0x8.
106	*
107	* If n_argsp is non-NULL, *n_argsp is set to the symbol's n_args value.
108	*
109	* If no symbol was found, NULL is returned instead.
110	*/
111	static char symbol_buf[SYMBOLBUF_MAX+1];
112	char get_symbol_name_and_n_args(struct symbol_context sc, uint64_t addr,
113	uint64_t offset, int n_argsp)
114	{
115	struct symbol *s;
116	int stepsize, ofs;
117
118	if (sc->n_symbols == 0)
119	return NULL;
120
121	if ((addr >> 32) == 0 && (addr & 0x80000000ULL))
122	addr \|= 0xffffffff00000000ULL;
123
124	symbol_buf[0] = symbol_buf[SYMBOLBUF_MAX] = '\0';
125	if (offset != NULL)
126	*offset = 0;
127
128	if (!sc->sorted_array) {
129	/* Slow, linear O(n) search: */
130	s = sc->first_symbol;
131	while (s != NULL) {
132	/* Found a match? */
133	if (addr >= s->addr && addr < s->addr + s->len) {
134	if (addr == s->addr)
135	snprintf(symbol_buf, SYMBOLBUF_MAX,
136	"%s", s->name);
137	else
138	snprintf(symbol_buf, SYMBOLBUF_MAX,
139	"%s+0x%lx", s->name, (long)
140	(addr - s->addr));
141	if (offset != NULL)
142	*offset = addr - s->addr;
143	if (n_argsp != NULL)
144	*n_argsp = s->n_args;
145	return symbol_buf;
146	}
147	s = s->next;
148	}
149	} else {
150	/* Faster, O(log n) search: */
151	stepsize = sc->n_symbols / 2;
152	ofs = stepsize;
153	while (stepsize > 0 \|\| (stepsize == 0 && ofs == 0)) {
154	s = sc->first_symbol + ofs;
155
156	/* Found a match? */
157	if (addr >= s->addr && addr < s->addr + s->len) {
158	if (addr == s->addr)
159	snprintf(symbol_buf, SYMBOLBUF_MAX,
160	"%s", s->name);
161	else
162	snprintf(symbol_buf, SYMBOLBUF_MAX,
163	"%s+0x%lx", s->name, (long)
164	(addr - s->addr));
165	if (offset != NULL)
166	*offset = addr - s->addr;
167	if (n_argsp != NULL)
168	*n_argsp = s->n_args;
169	return symbol_buf;
170	}
171
172	if (ofs == 0)
173	break;
174
175	stepsize >>= 1;
176
177	/* Special case for offset 0 (end of search in
178	the Left direction */
179	if (stepsize == 0)
180	ofs = 0;
181	else {
182	if (addr < s->addr)
183	ofs -= stepsize;
184	else
185	ofs += stepsize;
186	}
187	}
188	}
189
190	/* Not found? Then return NULL. */
191	return NULL;
192	}
193
194
195	/*
196	* get_symbol_name():
197	*
198	* See get_symbol_name_and_n_args().
199	*/
200	char get_symbol_name(struct symbol_context sc, uint64_t addr, uint64_t *offs)
201	{
202	return get_symbol_name_and_n_args(sc, addr, offs, NULL);
203	}
204
205
206	/*
207	* add_symbol_name():
208	*
209	* Add a symbol to the symbol list.
210	*/
211	void add_symbol_name(struct symbol_context *sc,
212	uint64_t addr, uint64_t len, char *name, int type, int n_args)
213	{
214	struct symbol *s;
215
216	if (sc->sorted_array) {
217	fprintf(stderr, "add_symbol_name(): Internal error: the "
218	"symbol array is already sorted\n");
219	exit(1);
220	}
221
222	if (name == NULL) {
223	fprintf(stderr, "add_symbol_name(): name = NULL\n");
224	exit(1);
225	}
226
227	if (name[0] == '\0')
228	return;
229
230	/* TODO: Maybe this should be optional? */
231	if (name[0] == '.' \|\| name[0] == '$')
232	return;
233
234	/* Quick test-hack: */
235	if (n_args < 0) {
236	if (strcmp(name, "strlen") == 0)
237	n_args = 1;
238	if (strcmp(name, "strcmp") == 0)
239	n_args = 2;
240	if (strcmp(name, "strcpy") == 0)
241	n_args = 2;
242	if (strcmp(name, "strncpy") == 0)
243	n_args = 3;
244	if (strcmp(name, "strlcpy") == 0)
245	n_args = 3;
246	if (strcmp(name, "strlcat") == 0)
247	n_args = 3;
248	if (strcmp(name, "strncmp") == 0)
249	n_args = 3;
250	if (strcmp(name, "memset") == 0)
251	n_args = 3;
252	if (strcmp(name, "memcpy") == 0)
253	n_args = 3;
254	if (strcmp(name, "bzero") == 0)
255	n_args = 2;
256	if (strcmp(name, "bcopy") == 0)
257	n_args = 3;
258	}
259
260	if ((addr >> 32) == 0 && (addr & 0x80000000ULL))
261	addr \|= 0xffffffff00000000ULL;
262
263	s = malloc(sizeof(struct symbol));
264	if (s == NULL) {
265	fprintf(stderr, "out of memory\n");
266	exit(1);
267	}
268
269	memset(s, 0, sizeof(struct symbol));
270
271	s->name = symbol_demangle_cplusplus(name);
272
273	if (s->name == NULL) {
274	s->name = strdup(name);
275	if (s->name == NULL) {
276	fprintf(stderr, "out of memory\n");
277	exit(1);
278	}
279	}
280
281	s->addr = addr;
282	s->len = len;
283	s->type = type;
284	s->n_args = n_args;
285
286	sc->n_symbols ++;
287
288	/* Add first in list: */
289	s->next = sc->first_symbol;
290	sc->first_symbol = s;
291	}
292
293
294	/*
295	* symbol_readfile():
296	*
297	* Read 'nm -S' style symbols from a file.
298	*
299	* TODO: This function is an ugly hack, and should be replaced
300	* with something that reads symbols directly from the executable
301	* images.
302	*/
303	void symbol_readfile(struct symbol_context sc, char fname)
304	{
305	FILE *f;
306	char b1[80]; uint64_t addr;
307	char b2[80]; uint64_t len;
308	char b3[80]; int type;
309	char b4[80];
310	int cur_n_symbols = sc->n_symbols;
311
312	f = fopen(fname, "r");
313	if (f == NULL) {
314	perror(fname);
315	exit(1);
316	}
317
318	while (!feof(f)) {
319	memset(b1, 0, sizeof(b1));
320	memset(b2, 0, sizeof(b2));
321	memset(b3, 0, sizeof(b3));
322	memset(b4, 0, sizeof(b4));
323	fscanf(f, "%s %s\n", b1,b2);
324	if (strlen(b2) < 2 && !(b2[0]>='0' && b2[0]<='9')) {
325	strlcpy(b3, b2, sizeof(b3));
326	strlcpy(b2, "0", sizeof(b2));
327	fscanf(f, "%s\n", b4);
328	} else {
329	fscanf(f, "%s %s\n", b3,b4);
330	}
331
332	/* printf("b1='%s' b2='%s' b3='%s' b4='%s'\n",
333	b1,b2,b3,b4); */
334	addr = strtoull(b1, NULL, 16);
335	len = strtoull(b2, NULL, 16);
336	type = b3[0];
337	/* printf("addr=%016llx len=%016llx type=%i\n",
338	addr, len, type); */
339
340	if (type == 't' \|\| type == 'r' \|\| type == 'g')
341	continue;
342
343	add_symbol_name(sc, addr, len, b4, type, -1);
344	}
345
346	fclose(f);
347
348	debug("%i symbols\n", sc->n_symbols - cur_n_symbols);
349	}
350
351
352	/*
353	* sym_addr_compare():
354	*
355	* Helper function for sorting symbols according to their address.
356	*/
357	int sym_addr_compare(const void a, const void b)
358	{
359	struct symbol p1 = (struct symbol ) a;
360	struct symbol p2 = (struct symbol ) b;
361
362	if (p1->addr < p2->addr)
363	return -1;
364	if (p1->addr > p2->addr)
365	return 1;
366
367	return 0;
368	}
369
370
371	/*
372	* symbol_recalc_sizes():
373	*
374	* Recalculate sizes of symbols that have size = 0, by creating an array
375	* containing all symbols, qsort()-ing that array according to address, and
376	* recalculating the size fields if necessary.
377	*/
378	void symbol_recalc_sizes(struct symbol_context *sc)
379	{
380	struct symbol *tmp_array;
381	struct symbol *last_ptr;
382	struct symbol *tmp_ptr;
383	int i;
384
385	tmp_array = malloc(sizeof (struct symbol) * sc->n_symbols);
386	if (tmp_array == NULL) {
387	fprintf(stderr, "out of memory\n");
388	exit(1);
389	}
390
391	/* Copy first_symbol --> tmp_array, and remove the old
392	first_symbol at the same time: */
393	tmp_ptr = sc->first_symbol;
394	i = 0;
395	while (tmp_ptr != NULL) {
396	tmp_array[i] = *tmp_ptr;
397	last_ptr = tmp_ptr;
398	tmp_ptr = tmp_ptr->next;
399	free(last_ptr);
400	i++;
401	}
402
403	qsort(tmp_array, sc->n_symbols, sizeof(struct symbol),
404	sym_addr_compare);
405	sc->sorted_array = 1;
406
407	/* Recreate the first_symbol chain: */
408	sc->first_symbol = NULL;
409	for (i=0; i<sc->n_symbols; i++) {
410	/* Recalculate size, if 0: */
411	if (tmp_array[i].len == 0) {
412	uint64_t len;
413	if (i != sc->n_symbols-1)
414	len = tmp_array[i+1].addr
415	- tmp_array[i].addr;
416	else
417	len = 1;
418	tmp_array[i].len = len;
419	}
420
421	tmp_array[i].next = &tmp_array[i+1];
422	}
423
424	sc->first_symbol = tmp_array;
425	}
426
427
428	/*
429	* symbol_init():
430	*
431	* Initialize the symbol hashtables.
432	*/
433	void symbol_init(struct symbol_context *sc)
434	{
435	sc->first_symbol = NULL;
436	sc->sorted_array = 0;
437	sc->n_symbols = 0;
438	}
439