Added YUV routines needed for v4l driver, and in the future possibly
[wine/gsoc-2012-control.git] / dlls / dbghelp / stabs.c
blobdba254f7ad06825b98eca3d2168e6d7c551c3694
1 /*
2 * File stabs.c - read stabs information from the modules
4 * Copyright (C) 1996, Eric Youngdale.
5 * 1999-2004, Eric Pouech
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * Maintenance Information
23 * -----------------------
25 * For documentation on the stabs format see for example
26 * The "stabs" debug format
27 * by Julia Menapace, Jim Kingdon, David Mackenzie
28 * of Cygnus Support
29 * available (hopefully) from http:\\sources.redhat.com\gdb\onlinedocs
32 #include "config.h"
34 #include <sys/types.h>
35 #include <fcntl.h>
36 #ifdef HAVE_SYS_STAT_H
37 # include <sys/stat.h>
38 #endif
39 #ifdef HAVE_SYS_MMAN_H
40 #include <sys/mman.h>
41 #endif
42 #include <limits.h>
43 #include <stdlib.h>
44 #include <string.h>
45 #ifdef HAVE_UNISTD_H
46 # include <unistd.h>
47 #endif
48 #include <stdio.h>
49 #ifndef PATH_MAX
50 #define PATH_MAX MAX_PATH
51 #endif
52 #include <assert.h>
53 #include <stdarg.h>
55 #include "windef.h"
56 #include "winbase.h"
57 #include "winreg.h"
58 #include "winnls.h"
60 #include "dbghelp_private.h"
62 #include "wine/debug.h"
64 WINE_DEFAULT_DEBUG_CHANNEL(dbghelp_stabs);
66 #ifndef N_UNDF
67 #define N_UNDF 0x00
68 #endif
70 #define N_GSYM 0x20
71 #define N_FUN 0x24
72 #define N_STSYM 0x26
73 #define N_LCSYM 0x28
74 #define N_MAIN 0x2a
75 #define N_ROSYM 0x2c
76 #define N_BNSYM 0x2e
77 #define N_OPT 0x3c
78 #define N_RSYM 0x40
79 #define N_SLINE 0x44
80 #define N_ENSYM 0x4e
81 #define N_SO 0x64
82 #define N_LSYM 0x80
83 #define N_BINCL 0x82
84 #define N_SOL 0x84
85 #define N_PSYM 0xa0
86 #define N_EINCL 0xa2
87 #define N_LBRAC 0xc0
88 #define N_EXCL 0xc2
89 #define N_RBRAC 0xe0
91 struct stab_nlist
93 union
95 char* n_name;
96 struct stab_nlist* n_next;
97 long n_strx;
98 } n_un;
99 unsigned char n_type;
100 char n_other;
101 short n_desc;
102 unsigned long n_value;
105 static void stab_strcpy(char* dest, int sz, const char* source)
107 char* ptr = dest;
109 * A strcpy routine that stops when we hit the ':' character.
110 * Faster than copying the whole thing, and then nuking the
111 * ':'.
112 * Takes also care of (valid) a::b constructs
114 while (*source != '\0')
116 if (source[0] != ':' && sz-- > 0) *ptr++ = *source++;
117 else if (source[1] == ':' && (sz -= 2) > 0)
119 *ptr++ = *source++;
120 *ptr++ = *source++;
122 else break;
124 *ptr-- = '\0';
125 /* GCC emits, in some cases, a .<digit>+ suffix.
126 * This is used for static variable inside functions, so
127 * that we can have several such variables with same name in
128 * the same compilation unit
129 * We simply ignore that suffix when present (we also get rid
130 * of it in ELF symtab parsing)
132 if (ptr >= dest && isdigit(*ptr))
134 while (ptr > dest && isdigit(*ptr)) ptr--;
135 if (*ptr == '.') *ptr = '\0';
137 assert(sz > 0);
140 typedef struct
142 char* name;
143 unsigned long value;
144 struct symt** vector;
145 int nrofentries;
146 } include_def;
148 #define MAX_INCLUDES 5120
150 static include_def* include_defs = NULL;
151 static int num_include_def = 0;
152 static int num_alloc_include_def = 0;
153 static int cu_include_stack[MAX_INCLUDES];
154 static int cu_include_stk_idx = 0;
155 static struct symt** cu_vector = NULL;
156 static int cu_nrofentries = 0;
157 static struct symt_basic* stabs_basic[36];
159 static int stabs_new_include(const char* file, unsigned long val)
161 if (num_include_def == num_alloc_include_def)
163 num_alloc_include_def += 256;
164 if (!include_defs)
165 include_defs = HeapAlloc(GetProcessHeap(), 0,
166 sizeof(include_defs[0]) * num_alloc_include_def);
167 else
168 include_defs = HeapReAlloc(GetProcessHeap(), 0, include_defs,
169 sizeof(include_defs[0]) * num_alloc_include_def);
170 memset(include_defs + num_include_def, 0, sizeof(include_defs[0]) * 256);
172 include_defs[num_include_def].name = strcpy(HeapAlloc(GetProcessHeap(), 0, strlen(file) + 1), file);
173 include_defs[num_include_def].value = val;
174 include_defs[num_include_def].vector = NULL;
175 include_defs[num_include_def].nrofentries = 0;
177 return num_include_def++;
180 static int stabs_find_include(const char* file, unsigned long val)
182 int i;
184 for (i = 0; i < num_include_def; i++)
186 if (val == include_defs[i].value &&
187 strcmp(file, include_defs[i].name) == 0)
188 return i;
190 return -1;
193 static int stabs_add_include(int idx)
195 if (idx < 0) return -1;
196 cu_include_stk_idx++;
198 /* if this happens, just bump MAX_INCLUDES */
199 /* we could also handle this as another dynarray */
200 assert(cu_include_stk_idx < MAX_INCLUDES);
201 cu_include_stack[cu_include_stk_idx] = idx;
202 return cu_include_stk_idx;
205 static void stabs_reset_includes(void)
208 * The struct symt:s that we would need to use are reset when
209 * we start a new file. (at least the ones in filenr == 0)
211 cu_include_stk_idx = 0;/* keep 0 as index for the .c file itself */
212 memset(cu_vector, 0, sizeof(cu_vector[0]) * cu_nrofentries);
215 static void stabs_free_includes(void)
217 int i;
219 stabs_reset_includes();
220 for (i = 0; i < num_include_def; i++)
222 HeapFree(GetProcessHeap(), 0, include_defs[i].name);
223 HeapFree(GetProcessHeap(), 0, include_defs[i].vector);
225 HeapFree(GetProcessHeap(), 0, include_defs);
226 include_defs = NULL;
227 num_include_def = 0;
228 num_alloc_include_def = 0;
229 HeapFree(GetProcessHeap(), 0, cu_vector);
230 cu_vector = NULL;
231 cu_nrofentries = 0;
234 static struct symt** stabs_find_ref(long filenr, long subnr)
236 struct symt** ret;
238 /* FIXME: I could perhaps create a dummy include_def for each compilation
239 * unit which would allow not to handle those two cases separately
241 if (filenr == 0)
243 if (cu_nrofentries <= subnr)
245 if (!cu_vector)
246 cu_vector = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY,
247 sizeof(cu_vector[0]) * (subnr+1));
248 else
249 cu_vector = HeapReAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY,
250 cu_vector, sizeof(cu_vector[0]) * (subnr+1));
251 cu_nrofentries = subnr + 1;
253 ret = &cu_vector[subnr];
255 else
257 include_def* idef;
259 assert(filenr <= cu_include_stk_idx);
260 idef = &include_defs[cu_include_stack[filenr]];
262 if (idef->nrofentries <= subnr)
264 if (!idef->vector)
265 idef->vector = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY,
266 sizeof(idef->vector[0]) * (subnr+1));
267 else
268 idef->vector = HeapReAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY,
269 idef->vector, sizeof(idef->vector[0]) * (subnr+1));
270 idef->nrofentries = subnr + 1;
272 ret = &idef->vector[subnr];
274 TRACE("(%ld,%ld) => %p (%p)\n", filenr, subnr, ret, *ret);
275 return ret;
278 static struct symt** stabs_read_type_enum(const char** x)
280 long filenr, subnr;
282 if (**x == '(')
284 (*x)++; /* '(' */
285 filenr = strtol(*x, (char**)x, 10); /* <int> */
286 (*x)++; /* ',' */
287 subnr = strtol(*x, (char**)x, 10); /* <int> */
288 (*x)++; /* ')' */
290 else
292 filenr = 0;
293 subnr = strtol(*x, (char**)x, 10); /* <int> */
295 return stabs_find_ref(filenr, subnr);
298 #define PTS_DEBUG
299 struct ParseTypedefData
301 const char* ptr;
302 char buf[1024];
303 int idx;
304 struct module* module;
305 #ifdef PTS_DEBUG
306 struct PTS_Error
308 const char* ptr;
309 unsigned line;
310 } errors[16];
311 int err_idx;
312 #endif
315 #ifdef PTS_DEBUG
316 static void stabs_pts_push(struct ParseTypedefData* ptd, unsigned line)
318 assert(ptd->err_idx < sizeof(ptd->errors) / sizeof(ptd->errors[0]));
319 ptd->errors[ptd->err_idx].line = line;
320 ptd->errors[ptd->err_idx].ptr = ptd->ptr;
321 ptd->err_idx++;
323 #define PTS_ABORTIF(ptd, t) do { if (t) { stabs_pts_push((ptd), __LINE__); return -1;} } while (0)
324 #else
325 #define PTS_ABORTIF(ptd, t) do { if (t) return -1; } while (0)
326 #endif
328 static int stabs_get_basic(struct ParseTypedefData* ptd, unsigned basic, struct symt** symt)
330 PTS_ABORTIF(ptd, basic >= sizeof(stabs_basic) / sizeof(stabs_basic[0]));
332 if (!stabs_basic[basic])
334 switch (basic)
336 case 1: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "int", 4); break;
337 case 2: stabs_basic[basic] = symt_new_basic(ptd->module, btChar, "char", 1); break;
338 case 3: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "short int", 2); break;
339 case 4: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "long int", 4); break;
340 case 5: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "unsigned char", 1); break;
341 case 6: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "signed char", 1); break;
342 case 7: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "unsigned short int", 2); break;
343 case 8: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "unsigned int", 4); break;
344 case 9: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "unsigned", 2); break;
345 case 10: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "unsigned long int", 2); break;
346 case 11: stabs_basic[basic] = symt_new_basic(ptd->module, btVoid, "void", 0); break;
347 case 12: stabs_basic[basic] = symt_new_basic(ptd->module, btFloat, "float", 4); break;
348 case 13: stabs_basic[basic] = symt_new_basic(ptd->module, btFloat, "double", 8); break;
349 case 14: stabs_basic[basic] = symt_new_basic(ptd->module, btFloat, "long double", 12); break;
350 case 15: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "integer", 4); break;
351 case 16: stabs_basic[basic] = symt_new_basic(ptd->module, btBool, "bool", 1); break;
352 /* case 17: short real */
353 /* case 18: real */
354 case 25: stabs_basic[basic] = symt_new_basic(ptd->module, btComplex, "float complex", 8); break;
355 case 26: stabs_basic[basic] = symt_new_basic(ptd->module, btComplex, "double complex", 16); break;
356 case 30: stabs_basic[basic] = symt_new_basic(ptd->module, btWChar, "wchar_t", 2); break;
357 case 31: stabs_basic[basic] = symt_new_basic(ptd->module, btInt, "long long int", 8); break;
358 case 32: stabs_basic[basic] = symt_new_basic(ptd->module, btUInt, "long long unsigned", 8); break;
359 /* starting at 35 are wine extensions (especially for R implementation) */
360 case 35: stabs_basic[basic] = symt_new_basic(ptd->module, btComplex, "long double complex", 24); break;
361 default: PTS_ABORTIF(ptd, 1);
364 *symt = &stabs_basic[basic]->symt;
365 return 0;
368 static int stabs_pts_read_type_def(struct ParseTypedefData* ptd,
369 const char* typename, struct symt** dt);
371 static int stabs_pts_read_id(struct ParseTypedefData* ptd)
373 const char* first = ptd->ptr;
374 unsigned int template = 0;
375 char ch;
377 while ((ch = *ptd->ptr++) != '\0')
379 switch (ch)
381 case ':':
382 if (template == 0)
384 unsigned int len = ptd->ptr - first - 1;
385 PTS_ABORTIF(ptd, len >= sizeof(ptd->buf) - ptd->idx);
386 memcpy(ptd->buf + ptd->idx, first, len);
387 ptd->buf[ptd->idx + len] = '\0';
388 ptd->idx += len + 1;
389 return 0;
391 break;
392 case '<': template++; break;
393 case '>': PTS_ABORTIF(ptd, template == 0); template--; break;
396 return -1;
399 static int stabs_pts_read_number(struct ParseTypedefData* ptd, long* v)
401 char* last;
403 *v = strtol(ptd->ptr, &last, 10);
404 PTS_ABORTIF(ptd, last == ptd->ptr);
405 ptd->ptr = last;
406 return 0;
409 static int stabs_pts_read_type_reference(struct ParseTypedefData* ptd,
410 long* filenr, long* subnr)
412 if (*ptd->ptr == '(')
414 /* '(' <int> ',' <int> ')' */
415 ptd->ptr++;
416 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, filenr) == -1);
417 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
418 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, subnr) == -1);
419 PTS_ABORTIF(ptd, *ptd->ptr++ != ')');
421 else
423 *filenr = 0;
424 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, subnr) == -1);
426 return 0;
429 struct pts_range_value
431 unsigned long long val;
432 int sign;
435 static int stabs_pts_read_range_value(struct ParseTypedefData* ptd, struct pts_range_value* prv)
437 char* last;
439 switch (*ptd->ptr)
441 case '0':
442 while (*ptd->ptr == '0') ptd->ptr++;
443 if (*ptd->ptr >= '1' && *ptd->ptr <= '7')
445 switch (ptd->ptr[1])
447 case '0':
448 PTS_ABORTIF(ptd, ptd->ptr[0] != '1');
449 prv->sign = -1;
450 prv->val = 0;
451 while (isdigit(*ptd->ptr)) prv->val = (prv->val << 3) + *ptd->ptr++ - '0';
452 break;
453 case '7':
454 prv->sign = 1;
455 prv->val = 0;
456 while (isdigit(*ptd->ptr)) prv->val = (prv->val << 3) + *ptd->ptr++ - '0';
457 break;
458 default: PTS_ABORTIF(ptd, 1); break;
460 } else prv->sign = 0;
461 break;
462 case '-':
463 prv->sign = -1;
464 prv->val = strtoull(++ptd->ptr, &last, 10);
465 ptd->ptr = last;
466 break;
467 case '+':
468 default:
469 prv->sign = 1;
470 prv->val = strtoull(ptd->ptr, &last, 10);
471 ptd->ptr = last;
472 break;
474 return 0;
477 static int stabs_pts_read_range(struct ParseTypedefData* ptd, const char* typename,
478 struct symt** dt)
480 struct symt* ref;
481 struct pts_range_value lo;
482 struct pts_range_value hi;
483 unsigned size;
484 enum BasicType bt;
485 int i;
486 unsigned long long v;
488 /* type ';' <int> ';' <int> ';' */
489 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &ref) == -1);
490 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
491 PTS_ABORTIF(ptd, stabs_pts_read_range_value(ptd, &lo) == -1);
492 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
493 PTS_ABORTIF(ptd, stabs_pts_read_range_value(ptd, &hi) == -1);
494 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
496 /* basically, we don't use ref... in some cases, for example, float is declared
497 * as a derivated type of int... which won't help us... so we guess the types
498 * from the various formats
500 if (lo.sign == 0 && hi.sign < 0)
502 bt = btUInt;
503 size = hi.val;
505 else if (lo.sign < 0 && hi.sign == 0)
507 bt = btUInt;
508 size = lo.val;
510 else if (lo.sign > 0 && hi.sign == 0)
512 bt = btFloat;
513 size = lo.val;
515 else if (lo.sign < 0 && hi.sign > 0)
517 v = 1 << 7;
518 for (i = 7; i < 64; i += 8)
520 if (lo.val == v && hi.val == v - 1)
522 bt = btInt;
523 size = (i + 1) / 8;
524 break;
526 v <<= 8;
528 PTS_ABORTIF(ptd, i >= 64);
530 else if (lo.sign == 0 && hi.sign > 0)
532 if (hi.val == 127) /* specific case for char... */
534 bt = btChar;
535 size = 1;
537 else
539 v = 1;
540 for (i = 8; i <= 64; i += 8)
542 v <<= 8;
543 if (hi.val + 1 == v)
545 bt = btUInt;
546 size = (i + 1) / 8;
547 break;
550 PTS_ABORTIF(ptd, i > 64);
553 else PTS_ABORTIF(ptd, 1);
555 *dt = &symt_new_basic(ptd->module, bt, typename, size)->symt;
556 return 0;
559 static inline int stabs_pts_read_method_info(struct ParseTypedefData* ptd)
561 struct symt* dt;
562 char* tmp;
563 char mthd;
567 /* get type of return value */
568 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
569 if (*ptd->ptr == ';') ptd->ptr++;
571 /* get types of parameters */
572 if (*ptd->ptr == ':')
574 PTS_ABORTIF(ptd, !(tmp = strchr(ptd->ptr + 1, ';')));
575 ptd->ptr = tmp + 1;
577 PTS_ABORTIF(ptd, !(*ptd->ptr >= '0' && *ptd->ptr <= '9'));
578 ptd->ptr++;
579 PTS_ABORTIF(ptd, !(ptd->ptr[0] >= 'A' && *ptd->ptr <= 'D'));
580 mthd = *++ptd->ptr;
581 PTS_ABORTIF(ptd, mthd != '.' && mthd != '?' && mthd != '*');
582 ptd->ptr++;
583 if (mthd == '*')
585 long int ofs;
586 struct symt* dt;
588 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &ofs) == -1);
589 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
590 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
591 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
593 } while (*ptd->ptr != ';');
594 ptd->ptr++;
596 return 0;
599 static inline int stabs_pts_read_aggregate(struct ParseTypedefData* ptd,
600 struct symt_udt* sdt)
602 long sz, ofs;
603 struct symt* adt;
604 struct symt* dt = NULL;
605 int idx;
606 int doadd;
608 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &sz) == -1);
610 doadd = symt_set_udt_size(ptd->module, sdt, sz);
611 if (*ptd->ptr == '!') /* C++ inheritence */
613 long num_classes;
615 ptd->ptr++;
616 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &num_classes) == -1);
617 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
618 while (--num_classes >= 0)
620 ptd->ptr += 2; /* skip visibility and inheritence */
621 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &ofs) == -1);
622 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
624 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &adt) == -1);
626 if (doadd)
628 char tmp[256];
629 WCHAR* name;
630 DWORD size;
632 symt_get_info(adt, TI_GET_SYMNAME, &name);
633 strcpy(tmp, "__inherited_class_");
634 WideCharToMultiByte(CP_ACP, 0, name, -1,
635 tmp + strlen(tmp), sizeof(tmp) - strlen(tmp),
636 NULL, NULL);
637 HeapFree(GetProcessHeap(), 0, name);
638 /* FIXME: TI_GET_LENGTH will not always work, especially when adt
639 * has just been seen as a forward definition and not the real stuff
640 * yet.
641 * As we don't use much the size of members in structs, this may not
642 * be much of a problem
644 symt_get_info(adt, TI_GET_LENGTH, &size);
645 symt_add_udt_element(ptd->module, sdt, tmp, adt, ofs, size * 8);
647 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
651 /* if the structure has already been filled, just redo the parsing
652 * but don't store results into the struct
653 * FIXME: there's a quite ugly memory leak in there...
656 /* Now parse the individual elements of the structure/union. */
657 while (*ptd->ptr != ';')
659 /* agg_name : type ',' <int:offset> ',' <int:size> */
660 idx = ptd->idx;
662 if (ptd->ptr[0] == '$' && ptd->ptr[1] == 'v')
664 long x;
666 if (ptd->ptr[2] == 'f')
668 /* C++ virtual method table */
669 ptd->ptr += 3;
670 stabs_read_type_enum(&ptd->ptr);
671 PTS_ABORTIF(ptd, *ptd->ptr++ != ':');
672 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
673 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
674 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &x) == -1);
675 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
676 ptd->idx = idx;
677 continue;
679 else if (ptd->ptr[2] == 'b')
681 ptd->ptr += 3;
682 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
683 PTS_ABORTIF(ptd, *ptd->ptr++ != ':');
684 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
685 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
686 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &x) == -1);
687 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
688 ptd->idx = idx;
689 continue;
693 PTS_ABORTIF(ptd, stabs_pts_read_id(ptd) == -1);
694 /* Ref. TSDF R2.130 Section 7.4. When the field name is a method name
695 * it is followed by two colons rather than one.
697 if (*ptd->ptr == ':')
699 ptd->ptr++;
700 stabs_pts_read_method_info(ptd);
701 ptd->idx = idx;
702 continue;
704 else
706 /* skip C++ member protection /0 /1 or /2 */
707 if (*ptd->ptr == '/') ptd->ptr += 2;
709 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &adt) == -1);
711 switch (*ptd->ptr++)
713 case ',':
714 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &ofs) == -1);
715 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
716 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &sz) == -1);
717 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
719 if (doadd) symt_add_udt_element(ptd->module, sdt, ptd->buf + idx, adt, ofs, sz);
720 break;
721 case ':':
723 char* tmp;
724 /* method parameters... terminated by ';' */
725 PTS_ABORTIF(ptd, !(tmp = strchr(ptd->ptr, ';')));
726 ptd->ptr = tmp + 1;
728 break;
729 default:
730 PTS_ABORTIF(ptd, TRUE);
732 ptd->idx = idx;
734 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
735 if (*ptd->ptr == '~')
737 ptd->ptr++;
738 PTS_ABORTIF(ptd, *ptd->ptr++ != '%');
739 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &dt) == -1);
740 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
742 return 0;
745 static inline int stabs_pts_read_enum(struct ParseTypedefData* ptd,
746 struct symt_enum* edt)
748 long value;
749 int idx;
751 while (*ptd->ptr != ';')
753 idx = ptd->idx;
754 PTS_ABORTIF(ptd, stabs_pts_read_id(ptd) == -1);
755 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &value) == -1);
756 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
757 symt_add_enum_element(ptd->module, edt, ptd->buf + idx, value);
758 ptd->idx = idx;
760 ptd->ptr++;
761 return 0;
764 static inline int stabs_pts_read_array(struct ParseTypedefData* ptd,
765 struct symt** adt)
767 long lo, hi;
768 struct symt* rdt;
770 /* ar<typeinfo_nodef>;<int>;<int>;<typeinfo> */
772 PTS_ABORTIF(ptd, *ptd->ptr++ != 'r');
773 /* FIXME: range type is lost, always assume int */
774 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &rdt) == -1);
775 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
776 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &lo) == -1);
777 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
778 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &hi) == -1);
779 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
781 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &rdt) == -1);
783 *adt = &symt_new_array(ptd->module, lo, hi, rdt)->symt;
784 return 0;
787 static int stabs_pts_read_type_def(struct ParseTypedefData* ptd, const char* typename,
788 struct symt** ret_dt)
790 int idx;
791 long sz = -1;
792 struct symt* new_dt = NULL; /* newly created data type */
793 struct symt* ref_dt; /* referenced data type (pointer...) */
794 long filenr1, subnr1, tmp;
796 /* things are a bit complicated because of the way the typedefs are stored inside
797 * the file, because addresses can change when realloc is done, so we must call
798 * over and over stabs_find_ref() to keep the correct values around
800 PTS_ABORTIF(ptd, stabs_pts_read_type_reference(ptd, &filenr1, &subnr1) == -1);
802 while (*ptd->ptr == '=')
804 ptd->ptr++;
805 PTS_ABORTIF(ptd, new_dt != btNoType);
807 /* first handle attribute if any */
808 switch (*ptd->ptr)
810 case '@':
811 if (*++ptd->ptr == 's')
813 ptd->ptr++;
814 if (stabs_pts_read_number(ptd, &sz) == -1)
816 ERR("Not an attribute... NIY\n");
817 ptd->ptr -= 2;
818 return -1;
820 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
822 break;
824 /* then the real definitions */
825 switch (*ptd->ptr++)
827 case '*':
828 case '&':
829 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &ref_dt) == -1);
830 new_dt = &symt_new_pointer(ptd->module, ref_dt)->symt;
831 break;
832 case 'k': /* 'const' modifier */
833 case 'B': /* 'volatile' modifier */
834 /* just kinda ignore the modifier, I guess -gmt */
835 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, typename, &new_dt) == -1);
836 break;
837 case '(':
838 ptd->ptr--;
839 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, typename, &new_dt) == -1);
840 break;
841 case 'a':
842 PTS_ABORTIF(ptd, stabs_pts_read_array(ptd, &new_dt) == -1);
843 break;
844 case 'r':
845 PTS_ABORTIF(ptd, stabs_pts_read_range(ptd, typename, &new_dt) == -1);
846 assert(!*stabs_find_ref(filenr1, subnr1));
847 *stabs_find_ref(filenr1, subnr1) = new_dt;
848 break;
849 case 'f':
850 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &ref_dt) == -1);
851 new_dt = &symt_new_function_signature(ptd->module, ref_dt)->symt;
852 break;
853 case 'e':
854 new_dt = &symt_new_enum(ptd->module, typename)->symt;
855 PTS_ABORTIF(ptd, stabs_pts_read_enum(ptd, (struct symt_enum*)new_dt) == -1);
856 break;
857 case 's':
858 case 'u':
860 struct symt_udt* udt;
861 enum UdtKind kind = (ptd->ptr[-1] == 's') ? UdtStruct : UdtUnion;
862 /* udt can have been already defined in a forward definition */
863 udt = (struct symt_udt*)*stabs_find_ref(filenr1, subnr1);
864 if (!udt)
866 udt = symt_new_udt(ptd->module, typename, 0, kind);
867 /* we need to set it here, because a struct can hold a pointer
868 * to itself
870 new_dt = *stabs_find_ref(filenr1, subnr1) = &udt->symt;
872 else
874 unsigned l1, l2;
875 if (udt->symt.tag != SymTagUDT)
877 ERR("Forward declaration (%p/%s) is not an aggregate (%u)\n",
878 udt, symt_get_name(&udt->symt), udt->symt.tag);
879 return -1;
881 /* FIXME: we currently don't correctly construct nested C++
882 * classes names. Therefore, we could be here with either:
883 * - typename and udt->hash_elt.name being the same string
884 * (non embedded case)
885 * - typename being foo::bar while udt->hash_elt.name being
886 * just bar
887 * So, we twist the comparison to test both occurrences. When
888 * we have proper C++ types in this file, this twist has to be
889 * removed
891 l1 = strlen(udt->hash_elt.name);
892 l2 = strlen(typename);
893 if (l1 > l2 || strcmp(udt->hash_elt.name, typename + l2 - l1))
894 ERR("Forward declaration name mismatch %s <> %s\n",
895 udt->hash_elt.name, typename);
896 new_dt = &udt->symt;
898 PTS_ABORTIF(ptd, stabs_pts_read_aggregate(ptd, udt) == -1);
900 break;
901 case 'x':
902 idx = ptd->idx;
903 tmp = *ptd->ptr++;
904 PTS_ABORTIF(ptd, stabs_pts_read_id(ptd) == -1);
905 switch (tmp)
907 case 'e':
908 new_dt = &symt_new_enum(ptd->module, ptd->buf + idx)->symt;
909 break;
910 case 's':
911 new_dt = &symt_new_udt(ptd->module, ptd->buf + idx, 0, UdtStruct)->symt;
912 break;
913 case 'u':
914 new_dt = &symt_new_udt(ptd->module, ptd->buf + idx, 0, UdtUnion)->symt;
915 break;
916 default:
917 return -1;
919 ptd->idx = idx;
920 break;
921 case '-':
923 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &tmp) == -1);
924 PTS_ABORTIF(ptd, stabs_get_basic(ptd, tmp, &new_dt) == -1);
925 PTS_ABORTIF(ptd, *ptd->ptr++ != ';');
927 break;
928 case '#':
929 if (*ptd->ptr == '#')
931 ptd->ptr++;
932 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &ref_dt) == -1);
933 new_dt = &symt_new_function_signature(ptd->module, ref_dt)->symt;
935 else
937 struct symt* cls_dt;
938 struct symt* pmt_dt;
940 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &cls_dt) == -1);
941 PTS_ABORTIF(ptd, *ptd->ptr++ != ',');
942 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &ref_dt) == -1);
943 new_dt = &symt_new_function_signature(ptd->module, ref_dt)->symt;
944 while (*ptd->ptr == ',')
946 ptd->ptr++;
947 PTS_ABORTIF(ptd, stabs_pts_read_type_def(ptd, NULL, &pmt_dt) == -1);
950 break;
951 case 'R':
953 long type, len, unk;
954 int basic;
956 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &type) == -1);
957 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
958 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &len) == -1);
959 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
960 PTS_ABORTIF(ptd, stabs_pts_read_number(ptd, &unk) == -1);
961 PTS_ABORTIF(ptd, *ptd->ptr++ != ';'); /* ';' */
963 switch (type) /* see stabs_get_basic for the details */
965 case 1: basic = 12; break;
966 case 2: basic = 13; break;
967 case 3: basic = 25; break;
968 case 4: basic = 26; break;
969 case 5: basic = 35; break;
970 case 6: basic = 14; break;
971 default: PTS_ABORTIF(ptd, 1);
973 PTS_ABORTIF(ptd, stabs_get_basic(ptd, basic, &new_dt) == -1);
975 break;
976 default:
977 ERR("Unknown type '%c'\n", ptd->ptr[-1]);
978 return -1;
982 if (!new_dt)
984 /* is it a forward declaration that has been filled ? */
985 new_dt = *stabs_find_ref(filenr1, subnr1);
986 /* if not, this should be void (which is defined as a ref to itself, but we
987 * don't correctly catch it)
989 if (!new_dt && typename)
991 new_dt = &symt_new_basic(ptd->module, btVoid, typename, 0)->symt;
992 PTS_ABORTIF(ptd, strcmp(typename, "void"));
996 *stabs_find_ref(filenr1, subnr1) = *ret_dt = new_dt;
998 TRACE("Adding (%ld,%ld) %s\n", filenr1, subnr1, typename);
1000 return 0;
1003 static int stabs_parse_typedef(struct module* module, const char* ptr,
1004 const char* typename)
1006 struct ParseTypedefData ptd;
1007 struct symt* dt;
1008 int ret = -1;
1010 /* check for already existing definition */
1012 TRACE("%s => %s\n", typename, debugstr_a(ptr));
1013 ptd.module = module;
1014 ptd.idx = 0;
1015 #ifdef PTS_DEBUG
1016 ptd.err_idx = 0;
1017 #endif
1018 for (ptd.ptr = ptr - 1; ;)
1020 ptd.ptr = strchr(ptd.ptr + 1, ':');
1021 if (ptd.ptr == NULL || *++ptd.ptr != ':') break;
1023 if (ptd.ptr)
1025 if (*ptd.ptr != '(') ptd.ptr++;
1026 /* most of type definitions take one char, except Tt */
1027 if (*ptd.ptr != '(') ptd.ptr++;
1028 ret = stabs_pts_read_type_def(&ptd, typename, &dt);
1031 if (ret == -1 || *ptd.ptr)
1033 #ifdef PTS_DEBUG
1034 int i;
1035 TRACE("Failure on %s\n", debugstr_a(ptr));
1036 if (ret == -1)
1038 for (i = 0; i < ptd.err_idx; i++)
1040 TRACE("[%d]: line %d => %s\n",
1041 i, ptd.errors[i].line, debugstr_a(ptd.errors[i].ptr));
1044 else
1045 TRACE("[0]: => %s\n", debugstr_a(ptd.ptr));
1047 #else
1048 ERR("Failure on %s at %s\n", debugstr_a(ptr), debugstr_a(ptd.ptr));
1049 #endif
1050 return FALSE;
1053 return TRUE;
1056 static struct symt* stabs_parse_type(const char* stab)
1058 const char* c = stab - 1;
1061 * Look through the stab definition, and figure out what struct symt
1062 * this represents. If we have something we know about, assign the
1063 * type.
1064 * According to "The \"stabs\" debug format" (Rev 2.130) the name may be
1065 * a C++ name and contain double colons e.g. foo::bar::baz:t5=*6.
1069 if ((c = strchr(c + 1, ':')) == NULL) return NULL;
1070 } while (*++c == ':');
1073 * The next characters say more about the type (i.e. data, function, etc)
1074 * of symbol. Skip them. (C++ for example may have Tt).
1075 * Actually this is a very weak description; I think Tt is the only
1076 * multiple combination we should see.
1078 while (*c && *c != '(' && !isdigit(*c))
1079 c++;
1081 * The next is either an integer or a (integer,integer).
1082 * The stabs_read_type_enum() takes care that stab_types is large enough.
1084 return *stabs_read_type_enum(&c);
1087 struct pending_loc_var
1089 char name[256];
1090 struct symt* type;
1091 unsigned offset;
1092 unsigned regno;
1095 /******************************************************************
1096 * stabs_finalize_function
1098 * Ends function creation: mainly:
1099 * - cleans up line number information
1100 * - tries to set up a debug-start tag (FIXME: heuristic to be enhanced)
1101 * - for stabs which have abolute address in them, initializes the size of the
1102 * function (assuming that current function ends where next function starts)
1104 static void stabs_finalize_function(struct module* module, struct symt_function* func,
1105 unsigned long size)
1107 IMAGEHLP_LINE il;
1109 if (!func) return;
1110 symt_normalize_function(module, func);
1111 /* To define the debug-start of the function, we use the second line number.
1112 * Not 100% bullet proof, but better than nothing
1114 if (symt_fill_func_line_info(module, func, func->address, &il) &&
1115 symt_get_func_line_next(module, &il))
1117 symt_add_function_point(module, func, SymTagFuncDebugStart,
1118 il.Address - func->address, NULL);
1120 if (size) func->size = size;
1123 BOOL stabs_parse(struct module* module, unsigned long load_offset,
1124 const void* pv_stab_ptr, int stablen,
1125 const char* strs, int strtablen)
1127 struct symt_function* curr_func = NULL;
1128 struct symt_block* block = NULL;
1129 struct symt_compiland* compiland = NULL;
1130 char currpath[PATH_MAX]; /* path to current file */
1131 char srcpath[PATH_MAX]; /* path to directory source file is in */
1132 int i, j;
1133 int nstab;
1134 const char* ptr;
1135 char* stabbuff;
1136 unsigned int stabbufflen;
1137 const struct stab_nlist* stab_ptr = pv_stab_ptr;
1138 const char* strs_end;
1139 int strtabinc;
1140 char symname[4096];
1141 unsigned incl[32];
1142 int incl_stk = -1;
1143 int source_idx = -1;
1144 struct pending_loc_var* pending_vars = NULL;
1145 unsigned num_pending_vars = 0;
1146 unsigned num_allocated_pending_vars = 0;
1147 BOOL ret = TRUE;
1149 nstab = stablen / sizeof(struct stab_nlist);
1150 strs_end = strs + strtablen;
1152 memset(srcpath, 0, sizeof(srcpath));
1153 memset(stabs_basic, 0, sizeof(stabs_basic));
1156 * Allocate a buffer into which we can build stab strings for cases
1157 * where the stab is continued over multiple lines.
1159 stabbufflen = 65536;
1160 stabbuff = HeapAlloc(GetProcessHeap(), 0, stabbufflen);
1162 strtabinc = 0;
1163 stabbuff[0] = '\0';
1164 for (i = 0; i < nstab; i++, stab_ptr++)
1166 ptr = strs + stab_ptr->n_un.n_strx;
1167 if ((ptr > strs_end) || (ptr + strlen(ptr) > strs_end))
1169 WARN("Bad stabs string %p\n", ptr);
1170 continue;
1172 if (ptr[strlen(ptr) - 1] == '\\')
1175 * Indicates continuation. Append this to the buffer, and go onto the
1176 * next record. Repeat the process until we find a stab without the
1177 * '/' character, as this indicates we have the whole thing.
1179 unsigned len = strlen(ptr);
1180 if (strlen(stabbuff) + len > stabbufflen)
1182 stabbufflen += 65536;
1183 stabbuff = HeapReAlloc(GetProcessHeap(), 0, stabbuff, stabbufflen);
1185 strncat(stabbuff, ptr, len - 1);
1186 continue;
1188 else if (stabbuff[0] != '\0')
1190 strcat(stabbuff, ptr);
1191 ptr = stabbuff;
1194 /* only symbol entries contain a typedef */
1195 switch (stab_ptr->n_type)
1197 case N_GSYM:
1198 case N_LCSYM:
1199 case N_STSYM:
1200 case N_RSYM:
1201 case N_LSYM:
1202 case N_ROSYM:
1203 if (strchr(ptr, '=') != NULL)
1206 * The stabs aren't in writable memory, so copy it over so we are
1207 * sure we can scribble on it.
1209 if (ptr != stabbuff)
1211 strcpy(stabbuff, ptr);
1212 ptr = stabbuff;
1214 stab_strcpy(symname, sizeof(symname), ptr);
1215 if (!stabs_parse_typedef(module, ptr, symname))
1217 /* skip this definition */
1218 stabbuff[0] = '\0';
1219 continue;
1224 #if 0
1225 const char* defs[] = {"","","","", /* 00 */
1226 "","","","", /* 08 */
1227 "","","","", /* 10 */
1228 "","","","", /* 18 */
1229 "gsym","","fun","stsym", /* 20 */
1230 "lcsym","main","rosym","", /* 28 */
1231 "","","","", /* 30 */
1232 "","","opt","", /* 38 */
1233 "rsym","","sline","", /* 40 */
1234 "","","","", /* 48 */
1235 "","","","", /* 50 */
1236 "","","","", /* 58 */
1237 "","","so","", /* 60 */
1238 "","","","", /* 68 */
1239 "","","","", /* 70 */
1240 "","","","", /* 78 */
1241 "lsym","bincl","sol","", /* 80 */
1242 "","","","", /* 88 */
1243 "","","","", /* 90 */
1244 "","","","", /* 98 */
1245 "psym","eincl","","", /* a0 */
1246 "","","","", /* a8 */
1247 "","","","", /* b0 */
1248 "","","","", /* b8 */
1249 "lbrac","excl","","", /* c0 */
1250 "","","","", /* c8 */
1251 "","","","", /* d0 */
1252 "","","","", /* d8 */
1253 "rbrac","","","", /* e0 */
1256 FIXME("Got %s<%u> %u/%lu (%s)\n",
1257 defs[stab_ptr->n_type / 2], stab_ptr->n_type, stab_ptr->n_desc, stab_ptr->n_value, debugstr_a(ptr));
1258 #endif
1260 switch (stab_ptr->n_type)
1262 case N_GSYM:
1264 * These are useless with ELF. They have no value, and you have to
1265 * read the normal symbol table to get the address. Thus we
1266 * ignore them, and when we process the normal symbol table
1267 * we should do the right thing.
1269 * With a.out or mingw, they actually do make some amount of sense.
1271 stab_strcpy(symname, sizeof(symname), ptr);
1272 symt_new_global_variable(module, compiland, symname, TRUE /* FIXME */,
1273 load_offset + stab_ptr->n_value, 0,
1274 stabs_parse_type(ptr));
1275 break;
1276 case N_LCSYM:
1277 case N_STSYM:
1278 /* These are static symbols and BSS symbols. */
1279 stab_strcpy(symname, sizeof(symname), ptr);
1280 symt_new_global_variable(module, compiland, symname, TRUE /* FIXME */,
1281 load_offset + stab_ptr->n_value, 0,
1282 stabs_parse_type(ptr));
1283 break;
1284 case N_LBRAC:
1285 block = symt_open_func_block(module, curr_func, block,
1286 stab_ptr->n_value, 0);
1287 for (j = 0; j < num_pending_vars; j++)
1289 symt_add_func_local(module, curr_func, pending_vars[j].regno,
1290 pending_vars[j].offset,
1291 block, pending_vars[j].type, pending_vars[j].name);
1293 num_pending_vars = 0;
1294 break;
1295 case N_RBRAC:
1296 block = symt_close_func_block(module, curr_func, block,
1297 stab_ptr->n_value);
1298 break;
1299 case N_PSYM:
1300 /* These are function parameters. */
1301 if (curr_func != NULL)
1303 struct symt* param_type = stabs_parse_type(ptr);
1304 stab_strcpy(symname, sizeof(symname), ptr);
1305 symt_add_func_local(module, curr_func, 0, stab_ptr->n_value,
1306 NULL, param_type, symname);
1307 symt_add_function_signature_parameter(module,
1308 (struct symt_function_signature*)curr_func->type,
1309 param_type);
1311 break;
1312 case N_RSYM:
1313 /* These are registers (as local variables) */
1314 if (curr_func != NULL)
1316 unsigned reg;
1318 if (num_pending_vars == num_allocated_pending_vars)
1320 num_allocated_pending_vars += 8;
1321 if (!pending_vars)
1322 pending_vars = HeapAlloc(GetProcessHeap(), 0,
1323 num_allocated_pending_vars * sizeof(pending_vars[0]));
1324 else
1325 pending_vars = HeapReAlloc(GetProcessHeap(), 0, pending_vars,
1326 num_allocated_pending_vars * sizeof(pending_vars[0]));
1328 switch (stab_ptr->n_value)
1330 case 0: reg = CV_REG_EAX; break;
1331 case 1: reg = CV_REG_ECX; break;
1332 case 2: reg = CV_REG_EDX; break;
1333 case 3: reg = CV_REG_EBX; break;
1334 case 4: reg = CV_REG_ESP; break;
1335 case 5: reg = CV_REG_EBP; break;
1336 case 6: reg = CV_REG_ESI; break;
1337 case 7: reg = CV_REG_EDI; break;
1338 case 11:
1339 case 12:
1340 case 13:
1341 case 14:
1342 case 15:
1343 case 16:
1344 case 17:
1345 case 18:
1346 case 19: reg = CV_REG_ST0 + stab_ptr->n_value - 12; break;
1347 default:
1348 FIXME("Unknown register value (%lu)\n", stab_ptr->n_value);
1349 reg = CV_REG_NONE;
1350 break;
1353 stab_strcpy(pending_vars[num_pending_vars].name,
1354 sizeof(pending_vars[num_pending_vars].name), ptr);
1355 pending_vars[num_pending_vars].type = stabs_parse_type(ptr);
1356 pending_vars[num_pending_vars].offset = 0;
1357 pending_vars[num_pending_vars].regno = reg;
1358 num_pending_vars++;
1360 break;
1361 case N_LSYM:
1362 /* These are local variables */
1363 if (curr_func != NULL)
1365 if (num_pending_vars == num_allocated_pending_vars)
1367 num_allocated_pending_vars += 8;
1368 if (!pending_vars)
1369 pending_vars = HeapAlloc(GetProcessHeap(), 0,
1370 num_allocated_pending_vars * sizeof(pending_vars[0]));
1371 else
1372 pending_vars = HeapReAlloc(GetProcessHeap(), 0, pending_vars,
1373 num_allocated_pending_vars * sizeof(pending_vars[0]));
1375 stab_strcpy(pending_vars[num_pending_vars].name,
1376 sizeof(pending_vars[num_pending_vars].name), ptr);
1377 pending_vars[num_pending_vars].type = stabs_parse_type(ptr);
1378 pending_vars[num_pending_vars].offset = stab_ptr->n_value;
1379 pending_vars[num_pending_vars].regno = 0;
1380 num_pending_vars++;
1382 break;
1383 case N_SLINE:
1385 * This is a line number. These are always relative to the start
1386 * of the function (N_FUN), and this makes the lookup easier.
1388 if (curr_func != NULL)
1390 assert(source_idx >= 0);
1391 symt_add_func_line(module, curr_func, source_idx,
1392 stab_ptr->n_desc, stab_ptr->n_value);
1394 break;
1395 case N_FUN:
1397 * For now, just declare the various functions. Later
1398 * on, we will add the line number information and the
1399 * local symbols.
1402 * Copy the string to a temp buffer so we
1403 * can kill everything after the ':'. We do
1404 * it this way because otherwise we end up dirtying
1405 * all of the pages related to the stabs, and that
1406 * sucks up swap space like crazy.
1408 stab_strcpy(symname, sizeof(symname), ptr);
1409 if (*symname)
1411 struct symt_function_signature* func_type;
1413 if (curr_func)
1415 /* First, clean up the previous function we were working on.
1416 * Assume size of the func is the delta between current offset
1417 * and offset of last function
1419 stabs_finalize_function(module, curr_func,
1420 stab_ptr->n_value ?
1421 (load_offset + stab_ptr->n_value - curr_func->address) : 0);
1423 func_type = symt_new_function_signature(module,
1424 stabs_parse_type(ptr));
1425 curr_func = symt_new_function(module, compiland, symname,
1426 load_offset + stab_ptr->n_value, 0,
1427 &func_type->symt);
1429 else
1431 /* some versions of GCC to use a N_FUN "" to mark the end of a function
1432 * and n_value contains the size of the func
1434 stabs_finalize_function(module, curr_func, stab_ptr->n_value);
1435 curr_func = NULL;
1437 break;
1438 case N_SO:
1440 * This indicates a new source file. Append the records
1441 * together, to build the correct path name.
1443 if (*ptr == '\0') /* end of N_SO file */
1445 /* Nuke old path. */
1446 srcpath[0] = '\0';
1447 stabs_finalize_function(module, curr_func, 0);
1448 curr_func = NULL;
1449 source_idx = -1;
1450 incl_stk = -1;
1451 assert(block == NULL);
1452 compiland = NULL;
1454 else
1456 int len = strlen(ptr);
1457 if (ptr[len-1] != '/')
1459 strcpy(currpath, srcpath);
1460 strcat(currpath, ptr);
1461 stabs_reset_includes();
1462 compiland = symt_new_compiland(module, currpath);
1463 source_idx = source_new(module, currpath);
1465 else
1466 strcpy(srcpath, ptr);
1468 break;
1469 case N_SOL:
1470 if (*ptr != '/')
1472 strcpy(currpath, srcpath);
1473 strcat(currpath, ptr);
1475 else
1476 strcpy(currpath, ptr);
1477 source_idx = source_new(module, currpath);
1478 break;
1479 case N_UNDF:
1480 strs += strtabinc;
1481 strtabinc = stab_ptr->n_value;
1482 /* I'm not sure this is needed, so trace it before we obsolete it */
1483 if (curr_func)
1485 FIXME("UNDF: curr_func %s\n", curr_func->hash_elt.name);
1486 stabs_finalize_function(module, curr_func, 0); /* FIXME */
1487 curr_func = NULL;
1489 break;
1490 case N_OPT:
1491 /* Ignore this. We don't care what it points to. */
1492 break;
1493 case N_BINCL:
1494 stabs_add_include(stabs_new_include(ptr, stab_ptr->n_value));
1495 assert(incl_stk < (int)(sizeof(incl) / sizeof(incl[0])) - 1);
1496 incl[++incl_stk] = source_idx;
1497 source_idx = source_new(module, ptr);
1498 break;
1499 case N_EINCL:
1500 assert(incl_stk >= 0);
1501 source_idx = incl[incl_stk--];
1502 break;
1503 case N_EXCL:
1504 if (stabs_add_include(stabs_find_include(ptr, stab_ptr->n_value)) < 0)
1506 ERR("Excluded header not found (%s,%ld)\n", ptr, stab_ptr->n_value);
1507 module_reset_debug_info(module);
1508 ret = FALSE;
1509 goto done;
1511 break;
1512 case N_MAIN:
1513 /* Always ignore these. GCC doesn't even generate them. */
1514 break;
1515 case N_BNSYM:
1516 case N_ENSYM:
1517 /* Always ignore these, they seem to be used only on Darwin. */
1518 break;
1519 default:
1520 ERR("Unknown stab type 0x%02x\n", stab_ptr->n_type);
1521 break;
1523 stabbuff[0] = '\0';
1524 TRACE("0x%02x %lx %s\n",
1525 stab_ptr->n_type, stab_ptr->n_value, debugstr_a(strs + stab_ptr->n_un.n_strx));
1527 module->module.SymType = SymDia;
1528 done:
1529 HeapFree(GetProcessHeap(), 0, stabbuff);
1530 stabs_free_includes();
1531 HeapFree(GetProcessHeap(), 0, pending_vars);
1533 return ret;