Subversion Repositories HelenOS

Rev

Rev 2071 | Rev 2745 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

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