Rev 4011 | Rev 4207 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4011 | Rev 4137 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2005 Ondrej Palkovsky |
2 | * Copyright (c) 2005 Ondrej Palkovsky |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericdebug |
29 | /** @addtogroup genericdebug |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file |
34 | * @file |
35 | * @brief Kernel symbol resolver. |
35 | * @brief Kernel symbol resolver. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include <symtab.h> |
38 | #include <symtab.h> |
39 | #include <byteorder.h> |
39 | #include <byteorder.h> |
40 | #include <string.h> |
40 | #include <string.h> |
41 | #include <print.h> |
41 | #include <print.h> |
42 | #include <arch/types.h> |
42 | #include <arch/types.h> |
43 | #include <typedefs.h> |
43 | #include <typedefs.h> |
- | 44 | #include <errno.h> |
|
44 | 45 | ||
45 | /** Return entry that seems most likely to correspond to argument. |
46 | /** Get name of symbol that seems most likely to correspond to address. |
46 | * |
47 | * |
47 | * Return entry that seems most likely to correspond |
48 | * @param addr Address. |
48 | * to address passed in the argument. |
49 | * @param name Place to store pointer to the symbol name. |
49 | * |
50 | * |
50 | * @param addr Address. |
51 | * @return Zero on success or negative error code, ENOENT if not found, |
51 | * |
- | |
52 | * @return Pointer to respective symbol string on success, NULL otherwise. |
52 | * ENOTSUP if symbol table not available. |
53 | */ |
53 | */ |
54 | char * get_symtab_entry(unative_t addr) |
54 | int symtab_name_lookup(unative_t addr, char **name) |
55 | { |
55 | { |
- | 56 | #ifdef CONFIG_SYMTAB |
|
56 | count_t i; |
57 | count_t i; |
57 | 58 | ||
58 | for (i = 1; symbol_table[i].address_le; ++i) { |
59 | for (i = 1; symbol_table[i].address_le; ++i) { |
59 | if (addr < uint64_t_le2host(symbol_table[i].address_le)) |
60 | if (addr < uint64_t_le2host(symbol_table[i].address_le)) |
60 | break; |
61 | break; |
61 | } |
62 | } |
62 | if (addr >= uint64_t_le2host(symbol_table[i - 1].address_le)) |
63 | if (addr >= uint64_t_le2host(symbol_table[i - 1].address_le)) { |
63 | return symbol_table[i - 1].symbol_name; |
64 | *name = symbol_table[i - 1].symbol_name; |
- | 65 | return EOK; |
|
- | 66 | } |
|
- | 67 | ||
- | 68 | *name = NULL; |
|
64 | return NULL; |
69 | return ENOENT; |
- | 70 | #else |
|
- | 71 | *name = NULL; |
|
- | 72 | return ENOTSUP; |
|
- | 73 | #endif |
|
65 | } |
74 | } |
66 | 75 | ||
- | 76 | /** Lookup symbol by address and format for display. |
|
- | 77 | * |
|
- | 78 | * Returns name of closest corresponding symbol, "Not found" if none exists |
|
- | 79 | * or "N/A" if no symbol information is available. |
|
- | 80 | * |
|
- | 81 | * @param addr Address. |
|
- | 82 | * @param name Place to store pointer to the symbol name. |
|
- | 83 | * |
|
- | 84 | * @return Pointer to a human-readable string. |
|
- | 85 | */ |
|
- | 86 | char *symtab_fmt_name_lookup(unative_t addr) |
|
- | 87 | { |
|
- | 88 | int rc; |
|
- | 89 | char *name; |
|
- | 90 | ||
- | 91 | rc = symtab_name_lookup(addr, &name); |
|
- | 92 | switch (rc) { |
|
- | 93 | case EOK: return name; |
|
- | 94 | case ENOENT: return "Not found"; |
|
- | 95 | default: return "N/A"; |
|
- | 96 | } |
|
- | 97 | } |
|
- | 98 | ||
- | 99 | #ifdef CONFIG_SYMTAB |
|
- | 100 | ||
67 | /** Find symbols that match the parameter forward and print them. |
101 | /** Find symbols that match the parameter forward and print them. |
68 | * |
102 | * |
69 | * @param name - search string |
103 | * @param name - search string |
70 | * @param startpos - starting position, changes to found position |
104 | * @param startpos - starting position, changes to found position |
71 | * @return Pointer to the part of string that should be completed or NULL |
105 | * @return Pointer to the part of string that should be completed or NULL |
72 | */ |
106 | */ |
73 | static char * symtab_search_one(const char *name, int *startpos) |
107 | static char * symtab_search_one(const char *name, int *startpos) |
74 | { |
108 | { |
75 | unsigned int namelen = strlen(name); |
109 | unsigned int namelen = strlen(name); |
76 | char *curname; |
110 | char *curname; |
77 | int i, j; |
111 | int i, j; |
78 | int colonoffset = -1; |
112 | int colonoffset = -1; |
79 | 113 | ||
80 | for (i = 0; name[i]; i++) |
114 | for (i = 0; name[i]; i++) |
81 | if (name[i] == ':') { |
115 | if (name[i] == ':') { |
82 | colonoffset = i; |
116 | colonoffset = i; |
83 | break; |
117 | break; |
84 | } |
118 | } |
85 | 119 | ||
86 | for (i = *startpos; symbol_table[i].address_le; ++i) { |
120 | for (i = *startpos; symbol_table[i].address_le; ++i) { |
87 | /* Find a ':' in name */ |
121 | /* Find a ':' in name */ |
88 | curname = symbol_table[i].symbol_name; |
122 | curname = symbol_table[i].symbol_name; |
89 | for (j = 0; curname[j] && curname[j] != ':'; j++) |
123 | for (j = 0; curname[j] && curname[j] != ':'; j++) |
90 | ; |
124 | ; |
91 | if (!curname[j]) |
125 | if (!curname[j]) |
92 | continue; |
126 | continue; |
93 | j -= colonoffset; |
127 | j -= colonoffset; |
94 | curname += j; |
128 | curname += j; |
95 | if (strlen(curname) < namelen) |
129 | if (strlen(curname) < namelen) |
96 | continue; |
130 | continue; |
97 | if (strncmp(curname, name, namelen) == 0) { |
131 | if (strncmp(curname, name, namelen) == 0) { |
98 | *startpos = i; |
132 | *startpos = i; |
99 | return curname + namelen; |
133 | return curname + namelen; |
100 | } |
134 | } |
101 | } |
135 | } |
102 | return NULL; |
136 | return NULL; |
103 | } |
137 | } |
104 | 138 | ||
- | 139 | #endif |
|
- | 140 | ||
105 | /** Return address that corresponds to the entry |
141 | /** Return address that corresponds to the entry |
106 | * |
142 | * |
107 | * Search symbol table, and if there is one match, return it |
143 | * Search symbol table, and if there is one match, return it |
108 | * |
144 | * |
109 | * @param name Name of the symbol |
145 | * @param name Name of the symbol |
- | 146 | * @param addr Place to store symbol address |
|
- | 147 | * |
|
110 | * @return 0 - Not found, -1 - Duplicate symbol, other - address of symbol |
148 | * @return Zero on success, ENOENT - not found, EOVERFLOW - duplicate |
- | 149 | * symbol, ENOTSUP - no symbol information available. |
|
111 | */ |
150 | */ |
112 | uintptr_t get_symbol_addr(const char *name) |
151 | int symtab_addr_lookup(const char *name, uintptr_t *addr) |
113 | { |
152 | { |
- | 153 | #ifdef CONFIG_SYMTAB |
|
114 | count_t found = 0; |
154 | count_t found = 0; |
115 | uintptr_t addr = NULL; |
- | |
116 | char *hint; |
155 | char *hint; |
117 | int i; |
156 | int i; |
118 | 157 | ||
119 | i = 0; |
158 | i = 0; |
120 | while ((hint = symtab_search_one(name, &i))) { |
159 | while ((hint = symtab_search_one(name, &i))) { |
121 | if (!strlen(hint)) { |
160 | if (!strlen(hint)) { |
122 | addr = uint64_t_le2host(symbol_table[i].address_le); |
161 | *addr = uint64_t_le2host(symbol_table[i].address_le); |
123 | found++; |
162 | found++; |
124 | } |
163 | } |
125 | i++; |
164 | i++; |
126 | } |
165 | } |
127 | if (found > 1) |
166 | if (found > 1) |
128 | return ((uintptr_t) -1); |
167 | return EOVERFLOW; |
- | 168 | if (found < 1) |
|
- | 169 | return ENOENT; |
|
129 | return addr; |
170 | return EOK; |
- | 171 | #else |
|
- | 172 | return ENOTSUP; |
|
- | 173 | #endif |
|
130 | } |
174 | } |
131 | 175 | ||
132 | /** Find symbols that match parameter and prints them */ |
176 | /** Find symbols that match parameter and prints them */ |
133 | void symtab_print_search(const char *name) |
177 | void symtab_print_search(const char *name) |
134 | { |
178 | { |
- | 179 | #ifdef CONFIG_SYMTAB |
|
135 | int i; |
180 | int i; |
136 | uintptr_t addr; |
181 | uintptr_t addr; |
137 | char *realname; |
182 | char *realname; |
138 | 183 | ||
139 | 184 | ||
140 | i = 0; |
185 | i = 0; |
141 | while (symtab_search_one(name, &i)) { |
186 | while (symtab_search_one(name, &i)) { |
142 | addr = uint64_t_le2host(symbol_table[i].address_le); |
187 | addr = uint64_t_le2host(symbol_table[i].address_le); |
143 | realname = symbol_table[i].symbol_name; |
188 | realname = symbol_table[i].symbol_name; |
144 | printf("%p: %s\n", addr, realname); |
189 | printf("%p: %s\n", addr, realname); |
145 | i++; |
190 | i++; |
146 | } |
191 | } |
- | 192 | #else |
|
- | 193 | printf("No symbol information available.\n"); |
|
- | 194 | #endif |
|
147 | } |
195 | } |
148 | 196 | ||
149 | /** Symtab completion |
197 | /** Symtab completion |
150 | * |
198 | * |
151 | * @param input - Search string, completes to symbol name |
199 | * @param input - Search string, completes to symbol name |
152 | * @returns - 0 - nothing found, 1 - success, >1 print duplicates |
200 | * @returns - 0 - nothing found, 1 - success, >1 print duplicates |
153 | */ |
201 | */ |
154 | int symtab_compl(char *input) |
202 | int symtab_compl(char *input) |
155 | { |
203 | { |
- | 204 | #ifdef CONFIG_SYMTAB |
|
156 | char output[MAX_SYMBOL_NAME + 1]; |
205 | char output[MAX_SYMBOL_NAME + 1]; |
157 | int startpos = 0; |
206 | int startpos = 0; |
158 | char *foundtxt; |
207 | char *foundtxt; |
159 | int found = 0; |
208 | int found = 0; |
160 | int i; |
209 | int i; |
161 | char *name = input; |
210 | char *name = input; |
162 | 211 | ||
163 | /* Allow completion of pointers */ |
212 | /* Allow completion of pointers */ |
164 | if (name[0] == '*' || name[0] == '&') |
213 | if (name[0] == '*' || name[0] == '&') |
165 | name++; |
214 | name++; |
166 | 215 | ||
167 | /* Do not print everything */ |
216 | /* Do not print everything */ |
168 | if (!strlen(name)) |
217 | if (!strlen(name)) |
169 | return 0; |
218 | return 0; |
170 | 219 | ||
171 | 220 | ||
172 | output[0] = '\0'; |
221 | output[0] = '\0'; |
173 | 222 | ||
174 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
223 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
175 | startpos++; |
224 | startpos++; |
176 | if (!found) |
225 | if (!found) |
177 | strncpy(output, foundtxt, strlen(foundtxt) + 1); |
226 | strncpy(output, foundtxt, strlen(foundtxt) + 1); |
178 | else { |
227 | else { |
179 | for (i = 0; output[i] && foundtxt[i] && |
228 | for (i = 0; output[i] && foundtxt[i] && |
180 | output[i] == foundtxt[i]; i++) |
229 | output[i] == foundtxt[i]; i++) |
181 | ; |
230 | ; |
182 | output[i] = '\0'; |
231 | output[i] = '\0'; |
183 | } |
232 | } |
184 | found++; |
233 | found++; |
185 | } |
234 | } |
186 | if (!found) |
235 | if (!found) |
187 | return 0; |
236 | return 0; |
188 | 237 | ||
189 | if (found > 1 && !strlen(output)) { |
238 | if (found > 1 && !strlen(output)) { |
190 | printf("\n"); |
239 | printf("\n"); |
191 | startpos = 0; |
240 | startpos = 0; |
192 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
241 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
193 | printf("%s\n", symbol_table[startpos].symbol_name); |
242 | printf("%s\n", symbol_table[startpos].symbol_name); |
194 | startpos++; |
243 | startpos++; |
195 | } |
244 | } |
196 | } |
245 | } |
197 | strncpy(input, output, MAX_SYMBOL_NAME); |
246 | strncpy(input, output, MAX_SYMBOL_NAME); |
198 | return found; |
247 | return found; |
199 | 248 | #else |
|
- | 249 | return 0; |
|
- | 250 | #endif |
|
200 | } |
251 | } |
201 | 252 | ||
202 | /** @} |
253 | /** @} |
203 | */ |
254 | */ |
204 | 255 |