Rev 1224 | Rev 1264 | 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 | |
601 | palkovsky | 58 | /** Find symbols that match the parameter forward and print them |
59 | * |
||
60 | * @param name - search string |
||
61 | * @param startpos - starting position, changes to found position |
||
62 | * @return Pointer to the part of string that should be completed or NULL |
||
63 | */ |
||
64 | static char * symtab_search_one(const char *name, int *startpos) |
||
65 | { |
||
66 | int namelen = strlen(name); |
||
67 | char *curname; |
||
68 | int i,j; |
||
69 | int colonoffset = -1; |
||
70 | |||
71 | for (i=0;name[i];i++) |
||
72 | if (name[i] == ':') { |
||
73 | colonoffset = i; |
||
74 | break; |
||
75 | } |
||
76 | |||
77 | for (i=*startpos;symbol_table[i].address_le;++i) { |
||
78 | /* Find a ':' in name */ |
||
79 | curname = symbol_table[i].symbol_name; |
||
80 | for (j=0; curname[j] && curname[j] != ':'; j++) |
||
81 | ; |
||
82 | if (!curname[j]) |
||
83 | continue; |
||
84 | j -= colonoffset; |
||
85 | curname += j; |
||
86 | if (strlen(curname) < namelen) |
||
87 | continue; |
||
88 | if (strncmp(curname, name, namelen) == 0) { |
||
89 | *startpos = i; |
||
90 | return curname+namelen; |
||
91 | } |
||
92 | } |
||
93 | return NULL; |
||
94 | } |
||
95 | |||
582 | palkovsky | 96 | /** Return address that corresponds to the entry |
97 | * |
||
601 | palkovsky | 98 | * Search symbol table, and if there is one match, return it |
582 | palkovsky | 99 | * |
100 | * @param name Name of the symbol |
||
101 | * @return 0 - Not found, -1 - Duplicate symbol, other - address of symbol |
||
102 | */ |
||
103 | __address get_symbol_addr(const char *name) |
||
104 | { |
||
105 | count_t found = 0; |
||
601 | palkovsky | 106 | __address addr = NULL; |
107 | char *hint; |
||
108 | int i; |
||
582 | palkovsky | 109 | |
601 | palkovsky | 110 | i = 0; |
111 | while ((hint=symtab_search_one(name, &i))) { |
||
112 | if (!strlen(hint)) { |
||
113 | addr = __u64_le2host(symbol_table[i].address_le); |
||
582 | palkovsky | 114 | found++; |
115 | } |
||
601 | palkovsky | 116 | i++; |
582 | palkovsky | 117 | } |
601 | palkovsky | 118 | if (found > 1) |
119 | return ((__address) -1); |
||
120 | return addr; |
||
582 | palkovsky | 121 | } |
122 | |||
601 | palkovsky | 123 | /** Find symbols that match parameter and prints them */ |
582 | palkovsky | 124 | void symtab_print_search(const char *name) |
125 | { |
||
126 | int i; |
||
127 | __address addr; |
||
128 | char *realname; |
||
129 | |||
601 | palkovsky | 130 | |
131 | i = 0; |
||
132 | while (symtab_search_one(name, &i)) { |
||
133 | addr = __u64_le2host(symbol_table[i].address_le); |
||
134 | realname = symbol_table[i].symbol_name; |
||
1224 | cejka | 135 | printf("%.*p: %s\n", sizeof(__address) * 2, addr, realname); |
601 | palkovsky | 136 | i++; |
137 | } |
||
138 | } |
||
139 | |||
140 | /** Symtab completion |
||
141 | * |
||
1248 | jermar | 142 | * @param input - Search string, completes to symbol name |
601 | palkovsky | 143 | * @returns - 0 - nothing found, 1 - success, >1 print duplicates |
144 | */ |
||
616 | palkovsky | 145 | int symtab_compl(char *input) |
601 | palkovsky | 146 | { |
147 | char output[MAX_SYMBOL_NAME+1]; |
||
148 | int startpos = 0; |
||
149 | char *foundtxt; |
||
150 | int found = 0; |
||
151 | int i; |
||
616 | palkovsky | 152 | char *name = input; |
601 | palkovsky | 153 | |
616 | palkovsky | 154 | /* Allow completion of pointers */ |
155 | if (name[0] == '*' || name[0] == '&') |
||
156 | name++; |
||
157 | |||
601 | palkovsky | 158 | /* Do not print everything */ |
159 | if (!strlen(name)) |
||
160 | return 0; |
||
616 | palkovsky | 161 | |
601 | palkovsky | 162 | |
163 | output[0] = '\0'; |
||
164 | |||
165 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
||
166 | startpos++; |
||
167 | if (!found) |
||
168 | strncpy(output, foundtxt, strlen(foundtxt)+1); |
||
169 | else { |
||
170 | for (i=0; output[i] && foundtxt[i] && output[i]==foundtxt[i]; i++) |
||
171 | ; |
||
172 | output[i] = '\0'; |
||
582 | palkovsky | 173 | } |
601 | palkovsky | 174 | found++; |
582 | palkovsky | 175 | } |
601 | palkovsky | 176 | if (!found) |
177 | return 0; |
||
178 | |||
602 | palkovsky | 179 | if (found > 1 && !strlen(output)) { |
601 | palkovsky | 180 | printf("\n"); |
181 | startpos = 0; |
||
182 | while ((foundtxt = symtab_search_one(name, &startpos))) { |
||
183 | printf("%s\n", symbol_table[startpos].symbol_name); |
||
184 | startpos++; |
||
185 | } |
||
186 | } |
||
616 | palkovsky | 187 | strncpy(input, output, MAX_SYMBOL_NAME); |
601 | palkovsky | 188 | return found; |
189 | |||
582 | palkovsky | 190 | } |