4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
22 * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
23 * Use is subject to license terms.
27 * DWARF to tdata conversion
29 * For the most part, conversion is straightforward, proceeding in two passes.
30 * On the first pass, we iterate through every die, creating new type nodes as
31 * necessary. Referenced tdesc_t's are created in an uninitialized state, thus
32 * allowing type reference pointers to be filled in. If the tdesc_t
33 * corresponding to a given die can be completely filled out (sizes and offsets
34 * calculated, and so forth) without using any referenced types, the tdesc_t is
35 * marked as resolved. Consider an array type. If the type corresponding to
36 * the array contents has not yet been processed, we will create a blank tdesc
37 * for the contents type (only the type ID will be filled in, relying upon the
38 * later portion of the first pass to encounter and complete the referenced
39 * type). We will then attempt to determine the size of the array. If the
40 * array has a byte size attribute, we will have completely characterized the
41 * array type, and will be able to mark it as resolved. The lack of a byte
42 * size attribute, on the other hand, will prevent us from fully resolving the
43 * type, as the size will only be calculable with reference to the contents
44 * type, which has not, as yet, been encountered. The array type will thus be
45 * left without the resolved flag, and the first pass will continue.
47 * When we begin the second pass, we will have created tdesc_t nodes for every
48 * type in the section. We will traverse the tree, from the iidescs down,
49 * processing each unresolved node. As the referenced nodes will have been
50 * populated, the array type used in our example above will be able to use the
51 * size of the referenced types (if available) to determine its own type. The
52 * traversal will be repeated until all types have been resolved or we have
53 * failed to make progress. When all tdescs have been resolved, the conversion
56 * There are, as always, a few special cases that are handled during the first
59 * 1. Empty enums - GCC will occasionally emit an enum without any members.
60 * Later on in the file, it will emit the same enum type, though this time
61 * with the full complement of members. All references to the memberless
62 * enum need to be redirected to the full definition. During the first
63 * pass, each enum is entered in dm_enumhash, along with a pointer to its
64 * corresponding tdesc_t. If, during the second pass, we encounter a
65 * memberless enum, we use the hash to locate the full definition. All
66 * tdescs referencing the empty enum are then redirected.
68 * 2. Forward declarations - If the compiler sees a forward declaration for
69 * a structure, followed by the definition of that structure, it will emit
70 * DWARF data for both the forward declaration and the definition. We need
71 * to resolve the forward declarations when possible, by redirecting
72 * forward-referencing tdescs to the actual struct/union definitions. This
73 * redirection is done completely within the first pass. We begin by
74 * recording all forward declarations in dw_fwdhash. When we define a
75 * structure, we check to see if there have been any corresponding forward
76 * declarations. If so, we redirect the tdescs which referenced the forward
77 * declarations to the structure or union definition.
79 * XXX see if a post traverser will allow the elimination of repeated pass 2
93 #include "ctf_headers.h"
99 /* The version of DWARF which we support. */
100 #define DWARF_VERSION 2
103 * We need to define a couple of our own intrinsics, to smooth out some of the
104 * differences between the GCC and DevPro DWARF emitters. See the referenced
105 * routines and the special cases in the file comment for more details.
107 * Type IDs are 32 bits wide. We're going to use the top of that field to
108 * indicate types that we've created ourselves.
110 #define TID_FILEMAX 0x3fffffff /* highest tid from file */
111 #define TID_VOID 0x40000001 /* see die_void() */
112 #define TID_LONG 0x40000002 /* see die_array() */
114 #define TID_MFGTID_BASE 0x40000003 /* first mfg'd tid */
117 * To reduce the staggering amount of error-handling code that would otherwise
118 * be required, the attribute-retrieval routines handle most of their own
119 * errors. If the following flag is supplied as the value of the `req'
120 * argument, they will also handle the absence of a requested attribute by
121 * terminating the program.
123 #define DW_ATTR_REQ 1
125 #define TDESC_HASH_BUCKETS 511
127 typedef struct dwarf {
128 Dwarf_Debug dw_dw; /* for libdwarf */
129 Dwarf_Error dw_err; /* for libdwarf */
130 Dwarf_Off dw_maxoff; /* highest legal offset in this cu */
131 tdata_t *dw_td; /* root of the tdesc/iidesc tree */
132 hash_t *dw_tidhash; /* hash of tdescs by t_id */
133 hash_t *dw_fwdhash; /* hash of fwd decls by name */
134 hash_t *dw_enumhash; /* hash of memberless enums by name */
135 tdesc_t *dw_void; /* manufactured void type */
136 tdesc_t *dw_long; /* manufactured long type for arrays */
137 size_t dw_ptrsz; /* size of a pointer in this file */
138 tid_t dw_mfgtid_last; /* last mfg'd type ID used */
139 uint_t dw_nunres; /* count of unresolved types */
140 char *dw_cuname; /* name of compilation unit */
143 static void die_create_one(dwarf_t *, Dwarf_Die);
144 static void die_create(dwarf_t *, Dwarf_Die);
147 mfgtid_next(dwarf_t *dw)
149 return (++dw->dw_mfgtid_last);
153 tdesc_add(dwarf_t *dw, tdesc_t *tdp)
155 hash_add(dw->dw_tidhash, tdp);
159 tdesc_lookup(dwarf_t *dw, int tid)
166 if (hash_find(dw->dw_tidhash, &tmpl, &tdp))
173 * Resolve a tdesc down to a node which should have a size. Returns the size,
174 * zero if the size hasn't yet been determined.
177 tdesc_size(tdesc_t *tdp)
180 switch (tdp->t_type) {
188 return (tdp->t_size);
200 case 0: /* not yet defined */
204 terminate("tdp %u: tdesc_size on unknown type %d\n",
205 tdp->t_id, tdp->t_type);
211 tdesc_bitsize(tdesc_t *tdp)
214 switch (tdp->t_type) {
216 return (tdp->t_intr->intr_nbits);
224 return (tdp->t_size * NBBY);
236 case 0: /* not yet defined */
240 terminate("tdp %u: tdesc_bitsize on unknown type %d\n",
241 tdp->t_id, tdp->t_type);
247 tdesc_basetype(tdesc_t *tdp)
250 switch (tdp->t_type) {
257 case 0: /* not yet defined */
266 die_off(dwarf_t *dw, Dwarf_Die die)
270 if (dwarf_dieoffset(die, &off, &dw->dw_err) == DW_DLV_OK)
273 terminate("failed to get offset for die: %s\n",
274 dwarf_errmsg(&dw->dw_err));
280 die_sibling(dwarf_t *dw, Dwarf_Die die)
285 if ((rc = dwarf_siblingof(dw->dw_dw, die, &sib, &dw->dw_err)) ==
288 else if (rc == DW_DLV_NO_ENTRY)
291 terminate("die %llu: failed to find type sibling: %s\n",
292 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
298 die_child(dwarf_t *dw, Dwarf_Die die)
303 if ((rc = dwarf_child(die, &child, &dw->dw_err)) == DW_DLV_OK)
305 else if (rc == DW_DLV_NO_ENTRY)
308 terminate("die %llu: failed to find type child: %s\n",
309 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
315 die_tag(dwarf_t *dw, Dwarf_Die die)
319 if (dwarf_tag(die, &tag, &dw->dw_err) == DW_DLV_OK)
322 terminate("die %llu: failed to get tag for type: %s\n",
323 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
328 static Dwarf_Attribute
329 die_attr(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, int req)
331 Dwarf_Attribute attr;
334 if ((rc = dwarf_attr(die, name, &attr, &dw->dw_err)) == DW_DLV_OK) {
336 } else if (rc == DW_DLV_NO_ENTRY) {
338 terminate("die %llu: no attr 0x%x\n", die_off(dw, die),
345 terminate("die %llu: failed to get attribute for type: %s\n",
346 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
352 die_signed(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Signed *valp,
356 if (dwarf_attrval_signed(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
358 terminate("die %llu: failed to get signed: %s\n",
359 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
367 die_unsigned(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Unsigned *valp,
371 if (dwarf_attrval_unsigned(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
373 terminate("die %llu: failed to get unsigned: %s\n",
374 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
382 die_bool(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Bool *valp, int req)
386 if (dwarf_attrval_flag(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
388 terminate("die %llu: failed to get flag: %s\n",
389 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
397 die_string(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, char **strp, int req)
399 const char *str = NULL;
401 if (dwarf_attrval_string(die, name, &str, &dw->dw_err) != DWARF_E_NONE ||
404 terminate("die %llu: failed to get string: %s\n",
405 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
410 *strp = xstrdup(str);
416 die_attr_ref(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name)
420 if (dwarf_attrval_unsigned(die, name, &off, &dw->dw_err) != DWARF_E_NONE) {
421 terminate("die %llu: failed to get ref: %s\n",
422 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
429 die_name(dwarf_t *dw, Dwarf_Die die)
433 (void) die_string(dw, die, DW_AT_name, &str, 0);
439 die_isdecl(dwarf_t *dw, Dwarf_Die die)
443 return (die_bool(dw, die, DW_AT_declaration, &val, 0) && val);
447 die_isglobal(dwarf_t *dw, Dwarf_Die die)
453 * Some compilers (gcc) use DW_AT_external to indicate function
454 * visibility. Others (Sun) use DW_AT_visibility.
456 if (die_signed(dw, die, DW_AT_visibility, &vis, 0))
457 return (vis == DW_VIS_exported);
459 return (die_bool(dw, die, DW_AT_external, &ext, 0) && ext);
463 die_add(dwarf_t *dw, Dwarf_Off off)
465 tdesc_t *tdp = xcalloc(sizeof (tdesc_t));
475 die_lookup_pass1(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name)
477 Dwarf_Off ref = die_attr_ref(dw, die, name);
480 if ((tdp = tdesc_lookup(dw, ref)) != NULL)
483 return (die_add(dw, ref));
487 die_mem_offset(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name,
488 Dwarf_Unsigned *valp, int req __unused)
490 Dwarf_Locdesc *loc = NULL;
491 Dwarf_Signed locnum = 0;
493 if (dwarf_locdesc(die, name, &loc, &locnum, &dw->dw_err) != DW_DLV_OK)
496 if (locnum != 1 || loc->ld_s->lr_atom != DW_OP_plus_uconst) {
497 terminate("die %llu: cannot parse member offset\n",
501 *valp = loc->ld_s->lr_number;
504 if (dwarf_locdesc_free(loc, &dw->dw_err) != DW_DLV_OK)
505 terminate("die %llu: cannot free location descriptor: %s\n",
506 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
512 tdesc_intr_common(dwarf_t *dw, int tid, const char *name, size_t sz)
517 intr = xcalloc(sizeof (intr_t));
518 intr->intr_type = INTR_INT;
519 intr->intr_signed = 1;
520 intr->intr_nbits = sz * NBBY;
522 tdp = xcalloc(sizeof (tdesc_t));
523 tdp->t_name = xstrdup(name);
526 tdp->t_type = INTRINSIC;
528 tdp->t_flags = TDESC_F_RESOLVED;
536 * Manufacture a void type. Used for gcc-emitted stabs, where the lack of a
537 * type reference implies a reference to a void type. A void *, for example
538 * will be represented by a pointer die without a DW_AT_type. CTF requires
539 * that pointer nodes point to something, so we'll create a void for use as
540 * the target. Note that the DWARF data may already create a void type. Ours
541 * would then be a duplicate, but it'll be removed in the self-uniquification
542 * merge performed at the completion of DWARF->tdesc conversion.
545 tdesc_intr_void(dwarf_t *dw)
547 if (dw->dw_void == NULL)
548 dw->dw_void = tdesc_intr_common(dw, TID_VOID, "void", 0);
550 return (dw->dw_void);
554 tdesc_intr_long(dwarf_t *dw)
556 if (dw->dw_long == NULL) {
557 dw->dw_long = tdesc_intr_common(dw, TID_LONG, "long",
561 return (dw->dw_long);
565 * Used for creating bitfield types. We create a copy of an existing intrinsic,
566 * adjusting the size of the copy to match what the caller requested. The
567 * caller can then use the copy as the type for a bitfield structure member.
570 tdesc_intr_clone(dwarf_t *dw, tdesc_t *old, size_t bitsz)
572 tdesc_t *new = xcalloc(sizeof (tdesc_t));
574 if (!(old->t_flags & TDESC_F_RESOLVED)) {
575 terminate("tdp %u: attempt to make a bit field from an "
576 "unresolved type\n", old->t_id);
579 new->t_name = xstrdup(old->t_name);
580 new->t_size = old->t_size;
581 new->t_id = mfgtid_next(dw);
582 new->t_type = INTRINSIC;
583 new->t_flags = TDESC_F_RESOLVED;
585 new->t_intr = xcalloc(sizeof (intr_t));
586 bcopy(old->t_intr, new->t_intr, sizeof (intr_t));
587 new->t_intr->intr_nbits = bitsz;
595 tdesc_array_create(dwarf_t *dw, Dwarf_Die dim, tdesc_t *arrtdp,
600 tdesc_t *ctdp = NULL;
604 if ((dim2 = die_sibling(dw, dim)) == NULL) {
606 } else if (die_tag(dw, dim2) == DW_TAG_subrange_type) {
607 ctdp = xcalloc(sizeof (tdesc_t));
608 ctdp->t_id = mfgtid_next(dw);
609 debug(3, "die %llu: creating new type %u for sub-dimension\n",
610 die_off(dw, dim2), ctdp->t_id);
611 tdesc_array_create(dw, dim2, arrtdp, ctdp);
613 terminate("die %llu: unexpected non-subrange node in array\n",
617 dimtdp->t_type = ARRAY;
618 dimtdp->t_ardef = ar = xcalloc(sizeof (ardef_t));
621 * Array bounds can be signed or unsigned, but there are several kinds
622 * of signless forms (data1, data2, etc) that take their sign from the
623 * routine that is trying to interpret them. That is, data1 can be
624 * either signed or unsigned, depending on whether you use the signed or
625 * unsigned accessor function. GCC will use the signless forms to store
626 * unsigned values which have their high bit set, so we need to try to
627 * read them first as unsigned to get positive values. We could also
628 * try signed first, falling back to unsigned if we got a negative
631 if (die_unsigned(dw, dim, DW_AT_upper_bound, &uval, 0))
632 ar->ad_nelems = uval + 1;
633 else if (die_signed(dw, dim, DW_AT_upper_bound, &sval, 0))
634 ar->ad_nelems = sval + 1;
639 * Different compilers use different index types. Force the type to be
640 * a common, known value (long).
642 ar->ad_idxtype = tdesc_intr_long(dw);
643 ar->ad_contents = ctdp;
645 if (ar->ad_contents->t_size != 0) {
646 dimtdp->t_size = ar->ad_contents->t_size * ar->ad_nelems;
647 dimtdp->t_flags |= TDESC_F_RESOLVED;
652 * Create a tdesc from an array node. Some arrays will come with byte size
653 * attributes, and thus can be resolved immediately. Others don't, and will
654 * need to wait until the second pass for resolution.
657 die_array_create(dwarf_t *dw, Dwarf_Die arr, Dwarf_Off off, tdesc_t *tdp)
659 tdesc_t *arrtdp = die_lookup_pass1(dw, arr, DW_AT_type);
663 debug(3, "die %llu <%llx>: creating array\n", off, off);
665 if ((dim = die_child(dw, arr)) == NULL ||
666 die_tag(dw, dim) != DW_TAG_subrange_type)
667 terminate("die %llu: failed to retrieve array bounds\n", off);
669 tdesc_array_create(dw, dim, arrtdp, tdp);
671 if (die_unsigned(dw, arr, DW_AT_byte_size, &uval, 0)) {
678 * Ensure that sub-dimensions have sizes too before marking
681 flags = TDESC_F_RESOLVED;
682 for (dimtdp = tdp->t_ardef->ad_contents;
683 dimtdp->t_type == ARRAY;
684 dimtdp = dimtdp->t_ardef->ad_contents) {
685 if (!(dimtdp->t_flags & TDESC_F_RESOLVED)) {
691 tdp->t_flags |= flags;
694 debug(3, "die %llu <%llx>: array nelems %u size %u\n", off, off,
695 tdp->t_ardef->ad_nelems, tdp->t_size);
700 die_array_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
702 dwarf_t *dw = private;
705 if (tdp->t_flags & TDESC_F_RESOLVED)
708 debug(3, "trying to resolve array %d (cont %d)\n", tdp->t_id,
709 tdp->t_ardef->ad_contents->t_id);
711 if ((sz = tdesc_size(tdp->t_ardef->ad_contents)) == 0) {
712 debug(3, "unable to resolve array %s (%d) contents %d\n",
713 tdesc_name(tdp), tdp->t_id,
714 tdp->t_ardef->ad_contents->t_id);
720 tdp->t_size = sz * tdp->t_ardef->ad_nelems;
721 tdp->t_flags |= TDESC_F_RESOLVED;
723 debug(3, "resolved array %d: %u bytes\n", tdp->t_id, tdp->t_size);
730 die_array_failed(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private __unused)
732 tdesc_t *cont = tdp->t_ardef->ad_contents;
734 if (tdp->t_flags & TDESC_F_RESOLVED)
737 fprintf(stderr, "Array %d: failed to size contents type %s (%d)\n",
738 tdp->t_id, tdesc_name(cont), cont->t_id);
744 * Most enums (those with members) will be resolved during this first pass.
745 * Others - those without members (see the file comment) - won't be, and will
746 * need to wait until the second pass when they can be matched with their full
750 die_enum_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
756 debug(3, "die %llu: creating enum\n", off);
760 (void) die_unsigned(dw, die, DW_AT_byte_size, &uval, DW_ATTR_REQ);
763 if ((mem = die_child(dw, die)) != NULL) {
764 elist_t **elastp = &tdp->t_emem;
769 if (die_tag(dw, mem) != DW_TAG_enumerator) {
770 /* Nested type declaration */
771 die_create_one(dw, mem);
775 el = xcalloc(sizeof (elist_t));
776 el->el_name = die_name(dw, mem);
778 if (die_signed(dw, mem, DW_AT_const_value, &sval, 0)) {
779 el->el_number = sval;
780 } else if (die_unsigned(dw, mem, DW_AT_const_value,
782 el->el_number = uval;
784 terminate("die %llu: enum %llu: member without "
785 "value\n", off, die_off(dw, mem));
788 debug(3, "die %llu: enum %llu: created %s = %d\n", off,
789 die_off(dw, mem), el->el_name, el->el_number);
792 elastp = &el->el_next;
794 } while ((mem = die_sibling(dw, mem)) != NULL);
796 hash_add(dw->dw_enumhash, tdp);
798 tdp->t_flags |= TDESC_F_RESOLVED;
800 if (tdp->t_name != NULL) {
801 iidesc_t *ii = xcalloc(sizeof (iidesc_t));
802 ii->ii_type = II_SOU;
803 ii->ii_name = xstrdup(tdp->t_name);
806 iidesc_add(dw->dw_td->td_iihash, ii);
812 die_enum_match(void *arg1, void *arg2)
814 tdesc_t *tdp = arg1, **fullp = arg2;
816 if (tdp->t_emem != NULL) {
818 return (-1); /* stop the iteration */
826 die_enum_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
828 dwarf_t *dw = private;
829 tdesc_t *full = NULL;
831 if (tdp->t_flags & TDESC_F_RESOLVED)
834 (void) hash_find_iter(dw->dw_enumhash, tdp, die_enum_match, &full);
837 * The answer to this one won't change from iteration to iteration,
841 terminate("tdp %u: enum %s has no members\n", tdp->t_id,
845 debug(3, "tdp %u: enum %s redirected to %u\n", tdp->t_id,
846 tdesc_name(tdp), full->t_id);
848 tdp->t_flags |= TDESC_F_RESOLVED;
854 die_fwd_map(void *arg1, void *arg2)
856 tdesc_t *fwd = arg1, *sou = arg2;
858 debug(3, "tdp %u: mapped forward %s to sou %u\n", fwd->t_id,
859 tdesc_name(fwd), sou->t_id);
866 * Structures and unions will never be resolved during the first pass, as we
867 * won't be able to fully determine the member sizes. The second pass, which
868 * have access to sizing information, will be able to complete the resolution.
871 die_sou_create(dwarf_t *dw, Dwarf_Die str, Dwarf_Off off, tdesc_t *tdp,
872 int type, const char *typename)
874 Dwarf_Unsigned sz, bitsz, bitoff;
876 mlist_t *ml, **mlastp;
879 tdp->t_type = (die_isdecl(dw, str) ? FORWARD : type);
881 debug(3, "die %llu: creating %s %s\n", off,
882 (tdp->t_type == FORWARD ? "forward decl" : typename),
885 if (tdp->t_type == FORWARD) {
886 hash_add(dw->dw_fwdhash, tdp);
890 (void) hash_find_iter(dw->dw_fwdhash, tdp, die_fwd_map, tdp);
892 (void) die_unsigned(dw, str, DW_AT_byte_size, &sz, DW_ATTR_REQ);
896 * GCC allows empty SOUs as an extension.
898 if ((mem = die_child(dw, str)) == NULL) {
902 mlastp = &tdp->t_members;
905 Dwarf_Off memoff = die_off(dw, mem);
906 Dwarf_Half tag = die_tag(dw, mem);
907 Dwarf_Unsigned mloff;
909 if (tag != DW_TAG_member) {
910 /* Nested type declaration */
911 die_create_one(dw, mem);
915 debug(3, "die %llu: mem %llu: creating member\n", off, memoff);
917 ml = xcalloc(sizeof (mlist_t));
920 * This could be a GCC anon struct/union member, so we'll allow
921 * an empty name, even though nothing can really handle them
922 * properly. Note that some versions of GCC miss out debug
923 * info for anon structs, though recent versions are fixed (gcc
926 if ((ml->ml_name = die_name(dw, mem)) == NULL)
929 ml->ml_type = die_lookup_pass1(dw, mem, DW_AT_type);
931 if (die_mem_offset(dw, mem, DW_AT_data_member_location,
933 debug(3, "die %llu: got mloff %llx\n", off,
934 (u_longlong_t)mloff);
935 ml->ml_offset = mloff * 8;
938 if (die_unsigned(dw, mem, DW_AT_bit_size, &bitsz, 0))
941 ml->ml_size = tdesc_bitsize(ml->ml_type);
943 if (die_unsigned(dw, mem, DW_AT_bit_offset, &bitoff, 0)) {
944 #if BYTE_ORDER == _BIG_ENDIAN
945 ml->ml_offset += bitoff;
947 ml->ml_offset += tdesc_bitsize(ml->ml_type) - bitoff -
952 debug(3, "die %llu: mem %llu: created \"%s\" (off %u sz %u)\n",
953 off, memoff, ml->ml_name, ml->ml_offset, ml->ml_size);
956 mlastp = &ml->ml_next;
957 } while ((mem = die_sibling(dw, mem)) != NULL);
960 * GCC will attempt to eliminate unused types, thus decreasing the
961 * size of the emitted dwarf. That is, if you declare a foo_t in your
962 * header, include said header in your source file, and neglect to
963 * actually use (directly or indirectly) the foo_t in the source file,
964 * the foo_t won't make it into the emitted DWARF. So, at least, goes
967 * Occasionally, it'll emit the DW_TAG_structure_type for the foo_t,
968 * and then neglect to emit the members. Strangely, the loner struct
969 * tag will always be followed by a proper nested declaration of
970 * something else. This is clearly a bug, but we're not going to have
971 * time to get it fixed before this goo goes back, so we'll have to work
972 * around it. If we see a no-membered struct with a nested declaration
973 * (i.e. die_child of the struct tag won't be null), we'll ignore it.
974 * Being paranoid, we won't simply remove it from the hash. Instead,
975 * we'll decline to create an iidesc for it, thus ensuring that this
976 * type won't make it into the output file. To be safe, we'll also
979 if (tdp->t_members == NULL) {
980 const char *old = tdesc_name(tdp);
981 size_t newsz = 7 + strlen(old) + 1;
982 char *new = xmalloc(newsz);
983 (void) snprintf(new, newsz, "orphan %s", old);
985 debug(3, "die %llu: worked around %s %s\n", off, typename, old);
987 if (tdp->t_name != NULL)
994 if (tdp->t_name != NULL) {
995 ii = xcalloc(sizeof (iidesc_t));
996 ii->ii_type = II_SOU;
997 ii->ii_name = xstrdup(tdp->t_name);
1000 iidesc_add(dw->dw_td->td_iihash, ii);
1005 die_struct_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1007 die_sou_create(dw, die, off, tdp, STRUCT, "struct");
1011 die_union_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1013 die_sou_create(dw, die, off, tdp, UNION, "union");
1018 die_sou_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
1020 dwarf_t *dw = private;
1024 if (tdp->t_flags & TDESC_F_RESOLVED)
1027 debug(3, "resolving sou %s\n", tdesc_name(tdp));
1029 for (ml = tdp->t_members; ml != NULL; ml = ml->ml_next) {
1030 if (ml->ml_size == 0) {
1031 mt = tdesc_basetype(ml->ml_type);
1033 if ((ml->ml_size = tdesc_bitsize(mt)) != 0)
1037 * For empty members, or GCC/C99 flexible array
1038 * members, a size of 0 is correct.
1040 if (mt->t_members == NULL)
1042 if (mt->t_type == ARRAY && mt->t_ardef->ad_nelems == 0)
1049 if ((mt = tdesc_basetype(ml->ml_type)) == NULL) {
1054 if (ml->ml_size != 0 && mt->t_type == INTRINSIC &&
1055 mt->t_intr->intr_nbits != ml->ml_size) {
1057 * This member is a bitfield, and needs to reference
1058 * an intrinsic type with the same width. If the
1059 * currently-referenced type isn't of the same width,
1060 * we'll copy it, adjusting the width of the copy to
1061 * the size we'd like.
1063 debug(3, "tdp %u: creating bitfield for %d bits\n",
1064 tdp->t_id, ml->ml_size);
1066 ml->ml_type = tdesc_intr_clone(dw, mt, ml->ml_size);
1070 tdp->t_flags |= TDESC_F_RESOLVED;
1077 die_sou_failed(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private __unused)
1079 const char *typename = (tdp->t_type == STRUCT ? "struct" : "union");
1082 if (tdp->t_flags & TDESC_F_RESOLVED)
1085 for (ml = tdp->t_members; ml != NULL; ml = ml->ml_next) {
1086 if (ml->ml_size == 0) {
1087 fprintf(stderr, "%s %d <%x>: failed to size member \"%s\" "
1088 "of type %s (%d <%x>)\n", typename, tdp->t_id,
1090 ml->ml_name, tdesc_name(ml->ml_type),
1091 ml->ml_type->t_id, ml->ml_type->t_id);
1099 die_funcptr_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1101 Dwarf_Attribute attr;
1107 debug(3, "die %llu <%llx>: creating function pointer\n", off, off);
1110 * We'll begin by processing any type definition nodes that may be
1111 * lurking underneath this one.
1113 for (arg = die_child(dw, die); arg != NULL;
1114 arg = die_sibling(dw, arg)) {
1115 if ((tag = die_tag(dw, arg)) != DW_TAG_formal_parameter &&
1116 tag != DW_TAG_unspecified_parameters) {
1117 /* Nested type declaration */
1118 die_create_one(dw, arg);
1122 if (die_isdecl(dw, die)) {
1124 * This is a prototype. We don't add prototypes to the
1125 * tree, so we're going to drop the tdesc. Unfortunately,
1126 * it has already been added to the tree. Nobody will reference
1127 * it, though, and it will be leaked.
1132 fn = xcalloc(sizeof (fndef_t));
1134 tdp->t_type = FUNCTION;
1136 if ((attr = die_attr(dw, die, DW_AT_type, 0)) != NULL) {
1137 fn->fn_ret = die_lookup_pass1(dw, die, DW_AT_type);
1139 fn->fn_ret = tdesc_intr_void(dw);
1143 * Count the arguments to the function, then read them in.
1145 for (fn->fn_nargs = 0, arg = die_child(dw, die); arg != NULL;
1146 arg = die_sibling(dw, arg)) {
1147 if ((tag = die_tag(dw, arg)) == DW_TAG_formal_parameter)
1149 else if (tag == DW_TAG_unspecified_parameters &&
1154 if (fn->fn_nargs != 0) {
1155 debug(3, "die %llu: adding %d argument%s\n", off, fn->fn_nargs,
1156 (fn->fn_nargs > 1 ? "s" : ""));
1158 fn->fn_args = xcalloc(sizeof (tdesc_t *) * fn->fn_nargs);
1159 for (i = 0, arg = die_child(dw, die);
1160 arg != NULL && i < (int) fn->fn_nargs;
1161 arg = die_sibling(dw, arg)) {
1162 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1165 fn->fn_args[i++] = die_lookup_pass1(dw, arg,
1171 tdp->t_flags |= TDESC_F_RESOLVED;
1175 * GCC and DevPro use different names for the base types. While the terms are
1176 * the same, they are arranged in a different order. Some terms, such as int,
1177 * are implied in one, and explicitly named in the other. Given a base type
1178 * as input, this routine will return a common name, along with an intr_t
1179 * that reflects said name.
1182 die_base_name_parse(const char *name, char **newp)
1187 int nlong = 0, nshort = 0, nchar = 0, nint = 0;
1192 if (strlen(name) > sizeof (buf) - 1)
1193 terminate("base type name \"%s\" is too long\n", name);
1195 strncpy(buf, name, sizeof (buf));
1197 for (c = strtok(buf, " "); c != NULL; c = strtok(NULL, " ")) {
1198 if (strcmp(c, "signed") == 0)
1200 else if (strcmp(c, "unsigned") == 0)
1202 else if (strcmp(c, "long") == 0)
1204 else if (strcmp(c, "char") == 0) {
1207 } else if (strcmp(c, "short") == 0)
1209 else if (strcmp(c, "int") == 0)
1213 * If we don't recognize any of the tokens, we'll tell
1214 * the caller to fall back to the dwarf-provided
1215 * encoding information.
1221 if (nchar > 1 || nshort > 1 || nint > 1 || nlong > 2)
1225 if (nlong > 0 || nshort > 0 || nint > 0)
1230 } else if (nshort > 0) {
1236 } else if (nlong > 0) {
1243 intr = xcalloc(sizeof (intr_t));
1244 intr->intr_type = INTR_INT;
1245 intr->intr_signed = sign;
1246 intr->intr_iformat = fmt;
1248 snprintf(buf, sizeof (buf), "%s%s%s",
1249 (sign ? "" : "unsigned "),
1250 (nlong > 1 ? "long " : ""),
1253 *newp = xstrdup(buf);
1257 typedef struct fp_size_map {
1258 size_t fsm_typesz[2]; /* size of {32,64} type */
1259 uint_t fsm_enc[3]; /* CTF_FP_* for {bare,cplx,imagry} type */
1262 static const fp_size_map_t fp_encodings[] = {
1263 { { 4, 4 }, { CTF_FP_SINGLE, CTF_FP_CPLX, CTF_FP_IMAGRY } },
1264 { { 8, 8 }, { CTF_FP_DOUBLE, CTF_FP_DCPLX, CTF_FP_DIMAGRY } },
1266 { { 16, 16 }, { CTF_FP_LDOUBLE, CTF_FP_LDCPLX, CTF_FP_LDIMAGRY } },
1268 { { 12, 16 }, { CTF_FP_LDOUBLE, CTF_FP_LDCPLX, CTF_FP_LDIMAGRY } },
1270 { { 0, 0 }, { 0, 0, 0 } }
1274 die_base_type2enc(dwarf_t *dw, Dwarf_Off off, Dwarf_Signed enc, size_t sz)
1276 const fp_size_map_t *map = fp_encodings;
1277 uint_t szidx = dw->dw_ptrsz == sizeof (uint64_t);
1278 uint_t mult = 1, col = 0;
1280 if (enc == DW_ATE_complex_float) {
1283 } else if (enc == DW_ATE_imaginary_float
1285 || enc == DW_ATE_SUN_imaginary_float
1290 while (map->fsm_typesz[szidx] != 0) {
1291 if (map->fsm_typesz[szidx] * mult == sz)
1292 return (map->fsm_enc[col]);
1296 terminate("die %llu: unrecognized real type size %u\n", off, sz);
1302 die_base_from_dwarf(dwarf_t *dw, Dwarf_Die base, Dwarf_Off off, size_t sz)
1304 intr_t *intr = xcalloc(sizeof (intr_t));
1307 (void) die_signed(dw, base, DW_AT_encoding, &enc, DW_ATTR_REQ);
1310 case DW_ATE_unsigned:
1311 case DW_ATE_address:
1312 intr->intr_type = INTR_INT;
1314 case DW_ATE_unsigned_char:
1315 intr->intr_type = INTR_INT;
1316 intr->intr_iformat = 'c';
1319 intr->intr_type = INTR_INT;
1320 intr->intr_signed = 1;
1322 case DW_ATE_signed_char:
1323 intr->intr_type = INTR_INT;
1324 intr->intr_signed = 1;
1325 intr->intr_iformat = 'c';
1327 case DW_ATE_boolean:
1328 intr->intr_type = INTR_INT;
1329 intr->intr_signed = 1;
1330 intr->intr_iformat = 'b';
1333 case DW_ATE_complex_float:
1334 case DW_ATE_imaginary_float:
1336 case DW_ATE_SUN_imaginary_float:
1337 case DW_ATE_SUN_interval_float:
1339 intr->intr_type = INTR_REAL;
1340 intr->intr_signed = 1;
1341 intr->intr_fformat = die_base_type2enc(dw, off, enc, sz);
1344 terminate("die %llu: unknown base type encoding 0x%llx\n",
1352 die_base_create(dwarf_t *dw, Dwarf_Die base, Dwarf_Off off, tdesc_t *tdp)
1358 debug(3, "die %llu: creating base type\n", off);
1361 * The compilers have their own clever (internally inconsistent) ideas
1362 * as to what base types should look like. Some times gcc will, for
1363 * example, use DW_ATE_signed_char for char. Other times, however, it
1364 * will use DW_ATE_signed. Needless to say, this causes some problems
1365 * down the road, particularly with merging. We do, however, use the
1366 * DWARF idea of type sizes, as this allows us to avoid caring about
1369 (void) die_unsigned(dw, base, DW_AT_byte_size, &sz, DW_ATTR_REQ);
1371 if (tdp->t_name == NULL)
1372 terminate("die %llu: base type without name\n", off);
1374 /* XXX make a name parser for float too */
1375 if ((intr = die_base_name_parse(tdp->t_name, &new)) != NULL) {
1376 /* Found it. We'll use the parsed version */
1377 debug(3, "die %llu: name \"%s\" remapped to \"%s\"\n", off,
1378 tdesc_name(tdp), new);
1384 * We didn't recognize the type, so we'll create an intr_t
1385 * based on the DWARF data.
1387 debug(3, "die %llu: using dwarf data for base \"%s\"\n", off,
1390 intr = die_base_from_dwarf(dw, base, off, sz);
1393 intr->intr_nbits = sz * 8;
1395 tdp->t_type = INTRINSIC;
1399 tdp->t_flags |= TDESC_F_RESOLVED;
1403 die_through_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp,
1404 int type, const char *typename)
1406 Dwarf_Attribute attr;
1408 debug(3, "die %llu <%llx>: creating %s type %d\n", off, off, typename, type);
1412 if ((attr = die_attr(dw, die, DW_AT_type, 0)) != NULL) {
1413 tdp->t_tdesc = die_lookup_pass1(dw, die, DW_AT_type);
1415 tdp->t_tdesc = tdesc_intr_void(dw);
1418 if (type == POINTER)
1419 tdp->t_size = dw->dw_ptrsz;
1421 tdp->t_flags |= TDESC_F_RESOLVED;
1423 if (type == TYPEDEF) {
1424 iidesc_t *ii = xcalloc(sizeof (iidesc_t));
1425 ii->ii_type = II_TYPE;
1426 ii->ii_name = xstrdup(tdp->t_name);
1429 iidesc_add(dw->dw_td->td_iihash, ii);
1434 die_typedef_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1436 die_through_create(dw, die, off, tdp, TYPEDEF, "typedef");
1440 die_const_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1442 die_through_create(dw, die, off, tdp, CONST, "const");
1446 die_pointer_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1448 die_through_create(dw, die, off, tdp, POINTER, "pointer");
1452 die_restrict_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1454 die_through_create(dw, die, off, tdp, RESTRICT, "restrict");
1458 die_volatile_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1460 die_through_create(dw, die, off, tdp, VOLATILE, "volatile");
1465 die_function_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp __unused)
1472 debug(3, "die %llu <%llx>: creating function definition\n", off, off);
1475 * We'll begin by processing any type definition nodes that may be
1476 * lurking underneath this one.
1478 for (arg = die_child(dw, die); arg != NULL;
1479 arg = die_sibling(dw, arg)) {
1480 if ((tag = die_tag(dw, arg)) != DW_TAG_formal_parameter &&
1481 tag != DW_TAG_variable) {
1482 /* Nested type declaration */
1483 die_create_one(dw, arg);
1487 if (die_isdecl(dw, die) || (name = die_name(dw, die)) == NULL) {
1489 * We process neither prototypes nor subprograms without
1495 ii = xcalloc(sizeof (iidesc_t));
1496 ii->ii_type = die_isglobal(dw, die) ? II_GFUN : II_SFUN;
1498 if (ii->ii_type == II_SFUN)
1499 ii->ii_owner = xstrdup(dw->dw_cuname);
1501 debug(3, "die %llu: function %s is %s\n", off, ii->ii_name,
1502 (ii->ii_type == II_GFUN ? "global" : "static"));
1504 if (die_attr(dw, die, DW_AT_type, 0) != NULL)
1505 ii->ii_dtype = die_lookup_pass1(dw, die, DW_AT_type);
1507 ii->ii_dtype = tdesc_intr_void(dw);
1509 for (arg = die_child(dw, die); arg != NULL;
1510 arg = die_sibling(dw, arg)) {
1513 debug(3, "die %llu: looking at sub member at %llu\n",
1514 off, die_off(dw, die));
1516 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1519 if ((name1 = die_name(dw, arg)) == NULL) {
1520 terminate("die %llu: func arg %d has no name\n",
1521 off, ii->ii_nargs + 1);
1524 if (strcmp(name1, "...") == 0) {
1533 if (ii->ii_nargs > 0) {
1536 debug(3, "die %llu: function has %d argument%s\n", off,
1537 ii->ii_nargs, (ii->ii_nargs == 1 ? "" : "s"));
1539 ii->ii_args = xcalloc(sizeof (tdesc_t) * ii->ii_nargs);
1541 for (arg = die_child(dw, die), i = 0;
1542 arg != NULL && i < ii->ii_nargs;
1543 arg = die_sibling(dw, arg)) {
1544 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1547 ii->ii_args[i++] = die_lookup_pass1(dw, arg,
1552 iidesc_add(dw->dw_td->td_iihash, ii);
1557 die_variable_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp __unused)
1562 debug(3, "die %llu: creating object definition\n", off);
1564 if (die_isdecl(dw, die) || (name = die_name(dw, die)) == NULL)
1565 return; /* skip prototypes and nameless objects */
1567 ii = xcalloc(sizeof (iidesc_t));
1568 ii->ii_type = die_isglobal(dw, die) ? II_GVAR : II_SVAR;
1570 ii->ii_dtype = die_lookup_pass1(dw, die, DW_AT_type);
1571 if (ii->ii_type == II_SVAR)
1572 ii->ii_owner = xstrdup(dw->dw_cuname);
1574 iidesc_add(dw->dw_td->td_iihash, ii);
1579 die_fwd_resolve(tdesc_t *fwd, tdesc_t **fwdp, void *private __unused)
1581 if (fwd->t_flags & TDESC_F_RESOLVED)
1584 if (fwd->t_tdesc != NULL) {
1585 debug(3, "tdp %u: unforwarded %s\n", fwd->t_id,
1587 *fwdp = fwd->t_tdesc;
1590 fwd->t_flags |= TDESC_F_RESOLVED;
1597 die_lexblk_descend(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off __unused, tdesc_t *tdp __unused)
1599 Dwarf_Die child = die_child(dw, die);
1602 die_create(dw, child);
1606 * Used to map the die to a routine which can parse it, using the tag to do the
1607 * mapping. While the processing of most tags entails the creation of a tdesc,
1608 * there are a few which don't - primarily those which result in the creation of
1609 * iidescs which refer to existing tdescs.
1612 #define DW_F_NOTDP 0x1 /* Don't create a tdesc for the creator */
1614 typedef struct die_creator {
1617 void (*dc_create)(dwarf_t *, Dwarf_Die, Dwarf_Off, tdesc_t *);
1620 static const die_creator_t die_creators[] = {
1621 { DW_TAG_array_type, 0, die_array_create },
1622 { DW_TAG_enumeration_type, 0, die_enum_create },
1623 { DW_TAG_lexical_block, DW_F_NOTDP, die_lexblk_descend },
1624 { DW_TAG_pointer_type, 0, die_pointer_create },
1625 { DW_TAG_structure_type, 0, die_struct_create },
1626 { DW_TAG_subroutine_type, 0, die_funcptr_create },
1627 { DW_TAG_typedef, 0, die_typedef_create },
1628 { DW_TAG_union_type, 0, die_union_create },
1629 { DW_TAG_base_type, 0, die_base_create },
1630 { DW_TAG_const_type, 0, die_const_create },
1631 { DW_TAG_subprogram, DW_F_NOTDP, die_function_create },
1632 { DW_TAG_variable, DW_F_NOTDP, die_variable_create },
1633 { DW_TAG_volatile_type, 0, die_volatile_create },
1634 { DW_TAG_restrict_type, 0, die_restrict_create },
1638 static const die_creator_t *
1639 die_tag2ctor(Dwarf_Half tag)
1641 const die_creator_t *dc;
1643 for (dc = die_creators; dc->dc_create != NULL; dc++) {
1644 if (dc->dc_tag == tag)
1652 die_create_one(dwarf_t *dw, Dwarf_Die die)
1654 Dwarf_Off off = die_off(dw, die);
1655 const die_creator_t *dc;
1659 debug(3, "die %llu <%llx>: create_one\n", off, off);
1661 if (off > dw->dw_maxoff) {
1662 terminate("illegal die offset %llu (max %llu)\n", off,
1666 tag = die_tag(dw, die);
1668 if ((dc = die_tag2ctor(tag)) == NULL) {
1669 debug(2, "die %llu: ignoring tag type %x\n", off, tag);
1673 if ((tdp = tdesc_lookup(dw, off)) == NULL &&
1674 !(dc->dc_flags & DW_F_NOTDP)) {
1675 tdp = xcalloc(sizeof (tdesc_t));
1681 tdp->t_name = die_name(dw, die);
1683 dc->dc_create(dw, die, off, tdp);
1687 die_create(dwarf_t *dw, Dwarf_Die die)
1690 die_create_one(dw, die);
1691 } while ((die = die_sibling(dw, die)) != NULL);
1694 static tdtrav_cb_f die_resolvers[] = {
1696 NULL, /* intrinsic */
1698 die_array_resolve, /* array */
1699 NULL, /* function */
1700 die_sou_resolve, /* struct */
1701 die_sou_resolve, /* union */
1702 die_enum_resolve, /* enum */
1703 die_fwd_resolve, /* forward */
1705 NULL, /* typedef unres */
1706 NULL, /* volatile */
1708 NULL, /* restrict */
1711 static tdtrav_cb_f die_fail_reporters[] = {
1713 NULL, /* intrinsic */
1715 die_array_failed, /* array */
1716 NULL, /* function */
1717 die_sou_failed, /* struct */
1718 die_sou_failed, /* union */
1722 NULL, /* typedef unres */
1723 NULL, /* volatile */
1725 NULL, /* restrict */
1729 die_resolve(dwarf_t *dw)
1738 (void) iitraverse_hash(dw->dw_td->td_iihash,
1739 &dw->dw_td->td_curvgen, NULL, NULL, die_resolvers, dw);
1741 debug(3, "resolve: pass %d, %u left\n", pass, dw->dw_nunres);
1743 if ((int) dw->dw_nunres == last) {
1744 fprintf(stderr, "%s: failed to resolve the following "
1745 "types:\n", progname);
1747 (void) iitraverse_hash(dw->dw_td->td_iihash,
1748 &dw->dw_td->td_curvgen, NULL, NULL,
1749 die_fail_reporters, dw);
1751 terminate("failed to resolve types\n");
1754 last = dw->dw_nunres;
1756 } while (dw->dw_nunres != 0);
1760 * Any object containing a function or object symbol at any scope should also
1761 * contain DWARF data.
1764 should_have_dwarf(Elf *elf)
1766 Elf_Scn *scn = NULL;
1767 Elf_Data *data = NULL;
1772 boolean_t found = B_FALSE;
1774 while ((scn = elf_nextscn(elf, scn)) != NULL) {
1775 gelf_getshdr(scn, &shdr);
1777 if (shdr.sh_type == SHT_SYMTAB) {
1784 terminate("cannot convert stripped objects\n");
1786 data = elf_getdata(scn, NULL);
1787 nsyms = shdr.sh_size / shdr.sh_entsize;
1789 for (symdx = 0; symdx < nsyms; symdx++) {
1790 gelf_getsym(data, symdx, &sym);
1792 if ((GELF_ST_TYPE(sym.st_info) == STT_FUNC) ||
1793 (GELF_ST_TYPE(sym.st_info) == STT_TLS) ||
1794 (GELF_ST_TYPE(sym.st_info) == STT_OBJECT)) {
1797 name = elf_strptr(elf, shdr.sh_link, sym.st_name);
1799 /* Studio emits these local symbols regardless */
1800 if ((strcmp(name, "Bbss.bss") != 0) &&
1801 (strcmp(name, "Ttbss.bss") != 0) &&
1802 (strcmp(name, "Ddata.data") != 0) &&
1803 (strcmp(name, "Ttdata.data") != 0) &&
1804 (strcmp(name, "Drodata.rodata") != 0))
1814 dw_read(tdata_t *td, Elf *elf, char *filename __unused)
1816 Dwarf_Unsigned abboff, hdrlen, nxthdr;
1817 Dwarf_Half vers, addrsz;
1819 Dwarf_Die child = 0;
1824 bzero(&dw, sizeof (dwarf_t));
1826 dw.dw_ptrsz = elf_ptrsz(elf);
1827 dw.dw_mfgtid_last = TID_MFGTID_BASE;
1828 dw.dw_tidhash = hash_new(TDESC_HASH_BUCKETS, tdesc_idhash, tdesc_idcmp);
1829 dw.dw_fwdhash = hash_new(TDESC_HASH_BUCKETS, tdesc_namehash,
1831 dw.dw_enumhash = hash_new(TDESC_HASH_BUCKETS, tdesc_namehash,
1834 if ((rc = dwarf_elf_init(elf, DW_DLC_READ, &dw.dw_dw,
1835 &dw.dw_err)) == DW_DLV_NO_ENTRY) {
1836 if (should_have_dwarf(elf)) {
1842 } else if (rc != DW_DLV_OK) {
1843 if (dwarf_errno(&dw.dw_err) == DW_DLE_DEBUG_INFO_NULL) {
1845 * There's no type data in the DWARF section, but
1846 * libdwarf is too clever to handle that properly.
1851 terminate("failed to initialize DWARF: %s\n",
1852 dwarf_errmsg(&dw.dw_err));
1855 if ((rc = dwarf_next_cu_header(dw.dw_dw, &hdrlen, &vers, &abboff,
1856 &addrsz, &nxthdr, &dw.dw_err)) != DW_DLV_OK)
1857 terminate("rc = %d %s\n", rc, dwarf_errmsg(&dw.dw_err));
1859 if ((cu = die_sibling(&dw, NULL)) == NULL ||
1860 (((child = die_child(&dw, cu)) == NULL) &&
1861 should_have_dwarf(elf))) {
1862 terminate("file does not contain dwarf type data "
1863 "(try compiling with -g)\n");
1864 } else if (child == NULL) {
1868 dw.dw_maxoff = nxthdr - 1;
1870 if (dw.dw_maxoff > TID_FILEMAX)
1871 terminate("file contains too many types\n");
1873 debug(1, "DWARF version: %d\n", vers);
1874 if (vers != DWARF_VERSION) {
1875 terminate("file contains incompatible version %d DWARF code "
1876 "(version 2 required)\n", vers);
1879 if (die_string(&dw, cu, DW_AT_producer, &prod, 0)) {
1880 debug(1, "DWARF emitter: %s\n", prod);
1884 if ((dw.dw_cuname = die_name(&dw, cu)) != NULL) {
1885 char *base = xstrdup(basename(dw.dw_cuname));
1887 dw.dw_cuname = base;
1889 debug(1, "CU name: %s\n", dw.dw_cuname);
1892 if ((child = die_child(&dw, cu)) != NULL)
1893 die_create(&dw, child);
1895 if ((rc = dwarf_next_cu_header(dw.dw_dw, &hdrlen, &vers, &abboff,
1896 &addrsz, &nxthdr, &dw.dw_err)) != DW_DLV_NO_ENTRY)
1897 terminate("multiple compilation units not supported\n");
1899 (void) dwarf_finish(&dw.dw_dw, &dw.dw_err);
1903 cvt_fixups(td, dw.dw_ptrsz);
1905 /* leak the dwarf_t */