VirtualBox

source: vbox/trunk/src/VBox/ExtPacks/VBoxDTrace/onnv/common/ctf/ctf_lookup.c@ 58990

Last change on this file since 58990 was 58990, checked in by vboxsync, 9 years ago

ctf_lookup.c: Fixed read beyond end of string.

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 9.2 KB
Line 
1/*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License, Version 1.0 only
6 * (the "License"). You may not use this file except in compliance
7 * with the License.
8 *
9 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10 * or http://www.opensolaris.org/os/licensing.
11 * See the License for the specific language governing permissions
12 * and limitations under the License.
13 *
14 * When distributing Covered Code, include this CDDL HEADER in each
15 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16 * If applicable, add the following below this CDDL HEADER, with the
17 * fields enclosed by brackets "[]" replaced with your own identifying
18 * information: Portions Copyright [yyyy] [name of copyright owner]
19 *
20 * CDDL HEADER END
21 */
22
23/*
24 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
25 * Use is subject to license terms.
26 */
27
28#ifndef VBOX
29#pragma ident "%Z%%M% %I% %E% SMI"
30
31#include <sys/sysmacros.h>
32#else /* VBOX */
33# include <ctype.h>
34#endif /* VBOX */
35#include <ctf_impl.h>
36
37/*
38 * Compare the given input string and length against a table of known C storage
39 * qualifier keywords. We just ignore these in ctf_lookup_by_name, below. To
40 * do this quickly, we use a pre-computed Perfect Hash Function similar to the
41 * technique originally described in the classic paper:
42 *
43 * R.J. Cichelli, "Minimal Perfect Hash Functions Made Simple",
44 * Communications of the ACM, Volume 23, Issue 1, January 1980, pp. 17-19.
45 *
46 * For an input string S of length N, we use hash H = S[N - 1] + N - 105, which
47 * for the current set of qualifiers yields a unique H in the range [0 .. 20].
48 * The hash can be modified when the keyword set changes as necessary. We also
49 * store the length of each keyword and check it prior to the final strcmp().
50 */
51static int
52isqualifier(const char *s, size_t len)
53{
54 static const struct qual {
55 const char *q_name;
56 size_t q_len;
57 } qhash[] = {
58 { "static", 6 }, { "", 0 }, { "", 0 }, { "", 0 },
59 { "volatile", 8 }, { "", 0 }, { "", 0 }, { "", 0 }, { "", 0 },
60 { "", 0 }, { "auto", 4 }, { "extern", 6 }, { "", 0 }, { "", 0 },
61 { "", 0 }, { "", 0 }, { "const", 5 }, { "register", 8 },
62 { "", 0 }, { "restrict", 8 }, { "_Restrict", 9 }
63 };
64
65 int h = s[len - 1] + (int)len - 105;
66 const struct qual *qp = &qhash[h];
67
68 return (h >= 0 && h < sizeof (qhash) / sizeof (qhash[0]) &&
69 len == qp->q_len && strncmp(qp->q_name, s, qp->q_len) == 0);
70}
71
72/*
73 * Attempt to convert the given C type name into the corresponding CTF type ID.
74 * It is not possible to do complete and proper conversion of type names
75 * without implementing a more full-fledged parser, which is necessary to
76 * handle things like types that are function pointers to functions that
77 * have arguments that are function pointers, and fun stuff like that.
78 * Instead, this function implements a very simple conversion algorithm that
79 * finds the things that we actually care about: structs, unions, enums,
80 * integers, floats, typedefs, and pointers to any of these named types.
81 */
82ctf_id_t
83ctf_lookup_by_name(ctf_file_t *fp, const char *name)
84{
85 static const char delimiters[] = " \t\n\r\v\f*";
86
87 const ctf_lookup_t *lp;
88 const ctf_helem_t *hp;
89 const char *p, *q, *end;
90 ctf_id_t type = 0;
91 ctf_id_t ntype, ptype;
92
93 if (name == NULL)
94 return (ctf_set_errno(fp, EINVAL));
95
96 for (p = name, end = name + strlen(name); *p != '\0'; p = q) {
97 while (isspace(*p))
98 p++; /* skip leading ws */
99
100 if (p == end)
101 break;
102
103 if ((q = strpbrk(p + 1, delimiters)) == NULL)
104 q = end; /* compare until end */
105
106 if (*p == '*') {
107 /*
108 * Find a pointer to type by looking in fp->ctf_ptrtab.
109 * If we can't find a pointer to the given type, see if
110 * we can compute a pointer to the type resulting from
111 * resolving the type down to its base type and use
112 * that instead. This helps with cases where the CTF
113 * data includes "struct foo *" but not "foo_t *" and
114 * the user tries to access "foo_t *" in the debugger.
115 */
116 ntype = fp->ctf_ptrtab[CTF_TYPE_TO_INDEX(type)];
117 if (ntype == 0) {
118 ntype = ctf_type_resolve(fp, type);
119 if (ntype == CTF_ERR || (ntype = fp->ctf_ptrtab[
120 CTF_TYPE_TO_INDEX(ntype)]) == 0) {
121 (void) ctf_set_errno(fp, ECTF_NOTYPE);
122 goto err;
123 }
124 }
125
126 type = CTF_INDEX_TO_TYPE(ntype,
127 (fp->ctf_flags & LCTF_CHILD));
128
129 q = p + 1;
130 continue;
131 }
132
133 if (isqualifier(p, (size_t)(q - p)))
134 continue; /* skip qualifier keyword */
135
136 for (lp = fp->ctf_lookups; lp->ctl_prefix != NULL; lp++) {
137 if (lp->ctl_prefix[0] == '\0' ||
138#ifdef VBOX
139 ( strncmp(p, lp->ctl_prefix, (size_t)(q - p)) == 0
140 && lp->ctl_len <= (size_t)(q - p)) /* don't push 'p' to far and crash */ ) {
141#else
142 strncmp(p, lp->ctl_prefix, (size_t)(q - p)) == 0) {
143#endif
144 for (p += lp->ctl_len; isspace(*p); p++)
145 continue; /* skip prefix and next ws */
146
147 if ((q = strchr(p, '*')) == NULL)
148 q = end; /* compare until end */
149
150 while (isspace(q[-1]))
151 q--; /* exclude trailing ws */
152
153 if ((hp = ctf_hash_lookup(lp->ctl_hash, fp, p,
154 (size_t)(q - p))) == NULL) {
155 (void) ctf_set_errno(fp, ECTF_NOTYPE);
156 goto err;
157 }
158
159 type = hp->h_type;
160 break;
161 }
162 }
163
164 if (lp->ctl_prefix == NULL) {
165 (void) ctf_set_errno(fp, ECTF_NOTYPE);
166 goto err;
167 }
168 }
169
170 if (*p != '\0' || type == 0)
171 return (ctf_set_errno(fp, ECTF_SYNTAX));
172
173 return (type);
174
175err:
176 if (fp->ctf_parent != NULL &&
177 (ptype = ctf_lookup_by_name(fp->ctf_parent, name)) != CTF_ERR)
178 return (ptype);
179
180 return (CTF_ERR);
181}
182
183/*
184 * Given a symbol table index, return the type of the data object described
185 * by the corresponding entry in the symbol table.
186 */
187ctf_id_t
188ctf_lookup_by_symbol(ctf_file_t *fp, ulong_t symidx)
189{
190 const ctf_sect_t *sp = &fp->ctf_symtab;
191 ctf_id_t type;
192
193 if (sp->cts_data == NULL)
194 return (ctf_set_errno(fp, ECTF_NOSYMTAB));
195
196 if (symidx >= fp->ctf_nsyms)
197 return (ctf_set_errno(fp, EINVAL));
198
199 if (sp->cts_entsize == sizeof (Elf32_Sym)) {
200 const Elf32_Sym *symp = (Elf32_Sym *)sp->cts_data + symidx;
201 if (ELF32_ST_TYPE(symp->st_info) != STT_OBJECT)
202 return (ctf_set_errno(fp, ECTF_NOTDATA));
203 } else {
204 const Elf64_Sym *symp = (Elf64_Sym *)sp->cts_data + symidx;
205 if (ELF64_ST_TYPE(symp->st_info) != STT_OBJECT)
206 return (ctf_set_errno(fp, ECTF_NOTDATA));
207 }
208
209 if (fp->ctf_sxlate[symidx] == ~0u /*VBOX: -1u*/)
210 return (ctf_set_errno(fp, ECTF_NOTYPEDAT));
211
212 type = *(ushort_t *)((uintptr_t)fp->ctf_buf + fp->ctf_sxlate[symidx]);
213 if (type == 0)
214 return (ctf_set_errno(fp, ECTF_NOTYPEDAT));
215
216 return (type);
217}
218
219/*
220 * Return the pointer to the internal CTF type data corresponding to the
221 * given type ID. If the ID is invalid, the function returns NULL.
222 * This function is not exported outside of the library.
223 */
224const ctf_type_t *
225ctf_lookup_by_id(ctf_file_t **fpp, ctf_id_t type)
226{
227 ctf_file_t *fp = *fpp; /* caller passes in starting CTF container */
228
229 if ((fp->ctf_flags & LCTF_CHILD) && CTF_TYPE_ISPARENT(type) &&
230 (fp = fp->ctf_parent) == NULL) {
231 (void) ctf_set_errno(*fpp, ECTF_NOPARENT);
232 return (NULL);
233 }
234
235 type = CTF_TYPE_TO_INDEX(type);
236 if (type > 0 && type <= fp->ctf_typemax) {
237 *fpp = fp; /* function returns ending CTF container */
238 return (LCTF_INDEX_TO_TYPEPTR(fp, type));
239 }
240
241 (void) ctf_set_errno(fp, ECTF_BADID);
242 return (NULL);
243}
244
245/*
246 * Given a symbol table index, return the info for the function described
247 * by the corresponding entry in the symbol table.
248 */
249int
250ctf_func_info(ctf_file_t *fp, ulong_t symidx, ctf_funcinfo_t *fip)
251{
252 const ctf_sect_t *sp = &fp->ctf_symtab;
253 const ushort_t *dp;
254 ushort_t info, kind, n;
255
256 if (sp->cts_data == NULL)
257 return (ctf_set_errno(fp, ECTF_NOSYMTAB));
258
259 if (symidx >= fp->ctf_nsyms)
260 return (ctf_set_errno(fp, EINVAL));
261
262 if (sp->cts_entsize == sizeof (Elf32_Sym)) {
263 const Elf32_Sym *symp = (Elf32_Sym *)sp->cts_data + symidx;
264 if (ELF32_ST_TYPE(symp->st_info) != STT_FUNC)
265 return (ctf_set_errno(fp, ECTF_NOTFUNC));
266 } else {
267 const Elf64_Sym *symp = (Elf64_Sym *)sp->cts_data + symidx;
268 if (ELF64_ST_TYPE(symp->st_info) != STT_FUNC)
269 return (ctf_set_errno(fp, ECTF_NOTFUNC));
270 }
271
272 if (fp->ctf_sxlate[symidx] == ~0u /*VBOX: -1u*/)
273 return (ctf_set_errno(fp, ECTF_NOFUNCDAT));
274
275 dp = (ushort_t *)((uintptr_t)fp->ctf_buf + fp->ctf_sxlate[symidx]);
276
277 info = *dp++;
278 kind = LCTF_INFO_KIND(fp, info);
279 n = LCTF_INFO_VLEN(fp, info);
280
281 if (kind == CTF_K_UNKNOWN && n == 0)
282 return (ctf_set_errno(fp, ECTF_NOFUNCDAT));
283
284 if (kind != CTF_K_FUNCTION)
285 return (ctf_set_errno(fp, ECTF_CORRUPT));
286
287 fip->ctc_return = *dp++;
288 fip->ctc_argc = n;
289 fip->ctc_flags = 0;
290
291 if (n != 0 && dp[n - 1] == 0) {
292 fip->ctc_flags |= CTF_FUNC_VARARG;
293 fip->ctc_argc--;
294 }
295
296 return (0);
297}
298
299/*
300 * Given a symbol table index, return the arguments for the function described
301 * by the corresponding entry in the symbol table.
302 */
303int
304ctf_func_args(ctf_file_t *fp, ulong_t symidx, uint_t argc, ctf_id_t *argv)
305{
306 const ushort_t *dp;
307 ctf_funcinfo_t f;
308
309 if (ctf_func_info(fp, symidx, &f) == CTF_ERR)
310 return (CTF_ERR); /* errno is set for us */
311
312 /*
313 * The argument data is two ushort_t's past the translation table
314 * offset: one for the function info, and one for the return type.
315 */
316 dp = (ushort_t *)((uintptr_t)fp->ctf_buf + fp->ctf_sxlate[symidx]) + 2;
317
318 for (argc = MIN(argc, f.ctc_argc); argc != 0; argc--)
319 *argv++ = *dp++;
320
321 return (0);
322}
Note: See TracBrowser for help on using the repository browser.

© 2024 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette