Rev 534 | Rev 601 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
268 | palkovsky | 1 | /* |
2 | * Copyright (C) 2005 Ondrej Palkovsky |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | |||
30 | #include <symtab.h> |
||
31 | #include <typedefs.h> |
||
292 | jermar | 32 | #include <arch/byteorder.h> |
582 | palkovsky | 33 | #include <func.h> |
34 | #include <print.h> |
||
268 | palkovsky | 35 | |
404 | jermar | 36 | /** Return entry that seems most likely to correspond to address |
268 | palkovsky | 37 | * |
404 | jermar | 38 | * Return entry that seems most likely to correspond |
39 | * to address passed in the argument. |
||
40 | * |
||
41 | * @param addr Address. |
||
42 | * |
||
43 | * @return Pointer to respective symbol string on success, NULL otherwise. |
||
268 | palkovsky | 44 | */ |
45 | char * get_symtab_entry(__native addr) |
||
46 | { |
||
47 | count_t i; |
||
48 | |||
292 | jermar | 49 | for (i=1;symbol_table[i].address_le;++i) { |
338 | jermar | 50 | if (addr < __u64_le2host(symbol_table[i].address_le)) |
268 | palkovsky | 51 | break; |
52 | } |
||
338 | jermar | 53 | if (addr >= __u64_le2host(symbol_table[i-1].address_le)) |
268 | palkovsky | 54 | return symbol_table[i-1].symbol_name; |
55 | return NULL; |
||
56 | } |
||
582 | palkovsky | 57 | |
58 | /** Return address that corresponds to the entry |
||
59 | * |
||
60 | * Search symbol table, and if the address ENDS with |
||
61 | * the parameter, return value |
||
62 | * |
||
63 | * @param name Name of the symbol |
||
64 | * @return 0 - Not found, -1 - Duplicate symbol, other - address of symbol |
||
65 | */ |
||
66 | __address get_symbol_addr(const char *name) |
||
67 | { |
||
68 | count_t i; |
||
69 | count_t found = 0; |
||
70 | count_t found_pos; |
||
71 | |||
72 | count_t nmlen = strlen(name); |
||
73 | count_t slen; |
||
74 | |||
75 | for (i=0;symbol_table[i].address_le;++i) { |
||
76 | slen = strlen(symbol_table[i].symbol_name); |
||
77 | if (slen < nmlen) |
||
78 | continue; |
||
79 | if (strncmp(name, symbol_table[i].symbol_name + (slen-nmlen), |
||
80 | nmlen) == 0) { |
||
81 | found++; |
||
82 | found_pos = i; |
||
83 | } |
||
84 | } |
||
85 | if (found == 0) |
||
86 | return NULL; |
||
87 | if (found == 1) |
||
88 | return __u64_le2host(symbol_table[found_pos].address_le); |
||
89 | return ((__address) -1); |
||
90 | } |
||
91 | |||
92 | void symtab_print_search(const char *name) |
||
93 | { |
||
94 | int i; |
||
95 | count_t nmlen = strlen(name); |
||
96 | count_t slen; |
||
97 | __address addr; |
||
98 | char *realname; |
||
99 | |||
100 | for (i=0;symbol_table[i].address_le;++i) { |
||
101 | slen = strlen(symbol_table[i].symbol_name); |
||
102 | if (slen < nmlen) |
||
103 | continue; |
||
104 | if (strncmp(name, symbol_table[i].symbol_name + (slen-nmlen), |
||
105 | nmlen) == 0) { |
||
106 | addr = __u64_le2host(symbol_table[i].address_le); |
||
107 | realname = symbol_table[i].symbol_name; |
||
108 | printf("0x%p: %s\n", addr, realname); |
||
109 | } |
||
110 | } |
||
111 | } |