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.
26 #pragma ident "%Z%%M% %I% %E% SMI"
29 * DWARF to tdata conversion
31 * For the most part, conversion is straightforward, proceeding in two passes.
32 * On the first pass, we iterate through every die, creating new type nodes as
33 * necessary. Referenced tdesc_t's are created in an uninitialized state, thus
34 * allowing type reference pointers to be filled in. If the tdesc_t
35 * corresponding to a given die can be completely filled out (sizes and offsets
36 * calculated, and so forth) without using any referenced types, the tdesc_t is
37 * marked as resolved. Consider an array type. If the type corresponding to
38 * the array contents has not yet been processed, we will create a blank tdesc
39 * for the contents type (only the type ID will be filled in, relying upon the
40 * later portion of the first pass to encounter and complete the referenced
41 * type). We will then attempt to determine the size of the array. If the
42 * array has a byte size attribute, we will have completely characterized the
43 * array type, and will be able to mark it as resolved. The lack of a byte
44 * size attribute, on the other hand, will prevent us from fully resolving the
45 * type, as the size will only be calculable with reference to the contents
46 * type, which has not, as yet, been encountered. The array type will thus be
47 * left without the resolved flag, and the first pass will continue.
49 * When we begin the second pass, we will have created tdesc_t nodes for every
50 * type in the section. We will traverse the tree, from the iidescs down,
51 * processing each unresolved node. As the referenced nodes will have been
52 * populated, the array type used in our example above will be able to use the
53 * size of the referenced types (if available) to determine its own type. The
54 * traversal will be repeated until all types have been resolved or we have
55 * failed to make progress. When all tdescs have been resolved, the conversion
58 * There are, as always, a few special cases that are handled during the first
61 * 1. Empty enums - GCC will occasionally emit an enum without any members.
62 * Later on in the file, it will emit the same enum type, though this time
63 * with the full complement of members. All references to the memberless
64 * enum need to be redirected to the full definition. During the first
65 * pass, each enum is entered in dm_enumhash, along with a pointer to its
66 * corresponding tdesc_t. If, during the second pass, we encounter a
67 * memberless enum, we use the hash to locate the full definition. All
68 * tdescs referencing the empty enum are then redirected.
70 * 2. Forward declarations - If the compiler sees a forward declaration for
71 * a structure, followed by the definition of that structure, it will emit
72 * DWARF data for both the forward declaration and the definition. We need
73 * to resolve the forward declarations when possible, by redirecting
74 * forward-referencing tdescs to the actual struct/union definitions. This
75 * redirection is done completely within the first pass. We begin by
76 * recording all forward declarations in dw_fwdhash. When we define a
77 * structure, we check to see if there have been any corresponding forward
78 * declarations. If so, we redirect the tdescs which referenced the forward
79 * declarations to the structure or union definition.
81 * XXX see if a post traverser will allow the elimination of repeated pass 2
95 #include "ctf_headers.h"
101 /* The version of DWARF which we support. */
102 #define DWARF_VERSION 2
105 * We need to define a couple of our own intrinsics, to smooth out some of the
106 * differences between the GCC and DevPro DWARF emitters. See the referenced
107 * routines and the special cases in the file comment for more details.
109 * Type IDs are 32 bits wide. We're going to use the top of that field to
110 * indicate types that we've created ourselves.
112 #define TID_FILEMAX 0x3fffffff /* highest tid from file */
113 #define TID_VOID 0x40000001 /* see die_void() */
114 #define TID_LONG 0x40000002 /* see die_array() */
116 #define TID_MFGTID_BASE 0x40000003 /* first mfg'd tid */
119 * To reduce the staggering amount of error-handling code that would otherwise
120 * be required, the attribute-retrieval routines handle most of their own
121 * errors. If the following flag is supplied as the value of the `req'
122 * argument, they will also handle the absence of a requested attribute by
123 * terminating the program.
125 #define DW_ATTR_REQ 1
127 #define TDESC_HASH_BUCKETS 511
129 typedef struct dwarf {
130 Dwarf_Debug dw_dw; /* for libdwarf */
131 Dwarf_Error dw_err; /* for libdwarf */
132 Dwarf_Off dw_maxoff; /* highest legal offset in this cu */
133 tdata_t *dw_td; /* root of the tdesc/iidesc tree */
134 hash_t *dw_tidhash; /* hash of tdescs by t_id */
135 hash_t *dw_fwdhash; /* hash of fwd decls by name */
136 hash_t *dw_enumhash; /* hash of memberless enums by name */
137 tdesc_t *dw_void; /* manufactured void type */
138 tdesc_t *dw_long; /* manufactured long type for arrays */
139 size_t dw_ptrsz; /* size of a pointer in this file */
140 tid_t dw_mfgtid_last; /* last mfg'd type ID used */
141 uint_t dw_nunres; /* count of unresolved types */
142 char *dw_cuname; /* name of compilation unit */
145 static void die_create_one(dwarf_t *, Dwarf_Die);
146 static void die_create(dwarf_t *, Dwarf_Die);
149 mfgtid_next(dwarf_t *dw)
151 return (++dw->dw_mfgtid_last);
155 tdesc_add(dwarf_t *dw, tdesc_t *tdp)
157 hash_add(dw->dw_tidhash, tdp);
161 tdesc_lookup(dwarf_t *dw, int tid)
168 if (hash_find(dw->dw_tidhash, &tmpl, &tdp))
175 * Resolve a tdesc down to a node which should have a size. Returns the size,
176 * zero if the size hasn't yet been determined.
179 tdesc_size(tdesc_t *tdp)
182 switch (tdp->t_type) {
190 return (tdp->t_size);
202 case 0: /* not yet defined */
206 terminate("tdp %u: tdesc_size on unknown type %d\n",
207 tdp->t_id, tdp->t_type);
213 tdesc_bitsize(tdesc_t *tdp)
216 switch (tdp->t_type) {
218 return (tdp->t_intr->intr_nbits);
226 return (tdp->t_size * NBBY);
238 case 0: /* not yet defined */
242 terminate("tdp %u: tdesc_bitsize on unknown type %d\n",
243 tdp->t_id, tdp->t_type);
249 tdesc_basetype(tdesc_t *tdp)
252 switch (tdp->t_type) {
259 case 0: /* not yet defined */
268 die_off(dwarf_t *dw, Dwarf_Die die)
272 if (dwarf_dieoffset(die, &off, &dw->dw_err) == DW_DLV_OK)
275 terminate("failed to get offset for die: %s\n",
276 dwarf_errmsg(&dw->dw_err));
282 die_sibling(dwarf_t *dw, Dwarf_Die die)
287 if ((rc = dwarf_siblingof(dw->dw_dw, die, &sib, &dw->dw_err)) ==
290 else if (rc == DW_DLV_NO_ENTRY)
293 terminate("die %llu: failed to find type sibling: %s\n",
294 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
300 die_child(dwarf_t *dw, Dwarf_Die die)
305 if ((rc = dwarf_child(die, &child, &dw->dw_err)) == DW_DLV_OK)
307 else if (rc == DW_DLV_NO_ENTRY)
310 terminate("die %llu: failed to find type child: %s\n",
311 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
317 die_tag(dwarf_t *dw, Dwarf_Die die)
321 if (dwarf_tag(die, &tag, &dw->dw_err) == DW_DLV_OK)
324 terminate("die %llu: failed to get tag for type: %s\n",
325 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
330 static Dwarf_Attribute
331 die_attr(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, int req)
333 Dwarf_Attribute attr;
336 if ((rc = dwarf_attr(die, name, &attr, &dw->dw_err)) == DW_DLV_OK) {
338 } else if (rc == DW_DLV_NO_ENTRY) {
340 terminate("die %llu: no attr 0x%x\n", die_off(dw, die),
347 terminate("die %llu: failed to get attribute for type: %s\n",
348 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
354 die_signed(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Signed *valp,
358 if (dwarf_attrval_signed(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
360 terminate("die %llu: failed to get signed: %s\n",
361 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
369 die_unsigned(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Unsigned *valp,
373 if (dwarf_attrval_unsigned(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
375 terminate("die %llu: failed to get unsigned: %s\n",
376 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
384 die_bool(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, Dwarf_Bool *valp, int req)
388 if (dwarf_attrval_flag(die, name, valp, &dw->dw_err) != DWARF_E_NONE) {
390 terminate("die %llu: failed to get flag: %s\n",
391 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
399 die_string(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name, char **strp, int req)
401 const char *str = NULL;
403 if (dwarf_attrval_string(die, name, &str, &dw->dw_err) != DWARF_E_NONE ||
406 terminate("die %llu: failed to get string: %s\n",
407 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
412 *strp = xstrdup(str);
418 die_attr_ref(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name)
422 if (dwarf_attrval_unsigned(die, name, &off, &dw->dw_err) != DWARF_E_NONE) {
423 terminate("die %llu: failed to get ref: %s\n",
424 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
431 die_name(dwarf_t *dw, Dwarf_Die die)
435 (void) die_string(dw, die, DW_AT_name, &str, 0);
441 die_isdecl(dwarf_t *dw, Dwarf_Die die)
445 return (die_bool(dw, die, DW_AT_declaration, &val, 0) && val);
449 die_isglobal(dwarf_t *dw, Dwarf_Die die)
455 * Some compilers (gcc) use DW_AT_external to indicate function
456 * visibility. Others (Sun) use DW_AT_visibility.
458 if (die_signed(dw, die, DW_AT_visibility, &vis, 0))
459 return (vis == DW_VIS_exported);
461 return (die_bool(dw, die, DW_AT_external, &ext, 0) && ext);
465 die_add(dwarf_t *dw, Dwarf_Off off)
467 tdesc_t *tdp = xcalloc(sizeof (tdesc_t));
477 die_lookup_pass1(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name)
479 Dwarf_Off ref = die_attr_ref(dw, die, name);
482 if ((tdp = tdesc_lookup(dw, ref)) != NULL)
485 return (die_add(dw, ref));
489 die_mem_offset(dwarf_t *dw, Dwarf_Die die, Dwarf_Half name,
490 Dwarf_Unsigned *valp, int req __unused)
492 Dwarf_Locdesc *loc = NULL;
493 Dwarf_Signed locnum = 0;
495 if (dwarf_locdesc(die, name, &loc, &locnum, &dw->dw_err) != DW_DLV_OK)
498 if (locnum != 1 || loc->ld_s->lr_atom != DW_OP_plus_uconst) {
499 terminate("die %llu: cannot parse member offset\n",
503 *valp = loc->ld_s->lr_number;
506 if (dwarf_locdesc_free(loc, &dw->dw_err) != DW_DLV_OK)
507 terminate("die %llu: cannot free location descriptor: %s\n",
508 die_off(dw, die), dwarf_errmsg(&dw->dw_err));
514 tdesc_intr_common(dwarf_t *dw, int tid, const char *name, size_t sz)
519 intr = xcalloc(sizeof (intr_t));
520 intr->intr_type = INTR_INT;
521 intr->intr_signed = 1;
522 intr->intr_nbits = sz * NBBY;
524 tdp = xcalloc(sizeof (tdesc_t));
525 tdp->t_name = xstrdup(name);
528 tdp->t_type = INTRINSIC;
530 tdp->t_flags = TDESC_F_RESOLVED;
538 * Manufacture a void type. Used for gcc-emitted stabs, where the lack of a
539 * type reference implies a reference to a void type. A void *, for example
540 * will be represented by a pointer die without a DW_AT_type. CTF requires
541 * that pointer nodes point to something, so we'll create a void for use as
542 * the target. Note that the DWARF data may already create a void type. Ours
543 * would then be a duplicate, but it'll be removed in the self-uniquification
544 * merge performed at the completion of DWARF->tdesc conversion.
547 tdesc_intr_void(dwarf_t *dw)
549 if (dw->dw_void == NULL)
550 dw->dw_void = tdesc_intr_common(dw, TID_VOID, "void", 0);
552 return (dw->dw_void);
556 tdesc_intr_long(dwarf_t *dw)
558 if (dw->dw_long == NULL) {
559 dw->dw_long = tdesc_intr_common(dw, TID_LONG, "long",
563 return (dw->dw_long);
567 * Used for creating bitfield types. We create a copy of an existing intrinsic,
568 * adjusting the size of the copy to match what the caller requested. The
569 * caller can then use the copy as the type for a bitfield structure member.
572 tdesc_intr_clone(dwarf_t *dw, tdesc_t *old, size_t bitsz)
574 tdesc_t *new = xcalloc(sizeof (tdesc_t));
576 if (!(old->t_flags & TDESC_F_RESOLVED)) {
577 terminate("tdp %u: attempt to make a bit field from an "
578 "unresolved type\n", old->t_id);
581 new->t_name = xstrdup(old->t_name);
582 new->t_size = old->t_size;
583 new->t_id = mfgtid_next(dw);
584 new->t_type = INTRINSIC;
585 new->t_flags = TDESC_F_RESOLVED;
587 new->t_intr = xcalloc(sizeof (intr_t));
588 bcopy(old->t_intr, new->t_intr, sizeof (intr_t));
589 new->t_intr->intr_nbits = bitsz;
597 tdesc_array_create(dwarf_t *dw, Dwarf_Die dim, tdesc_t *arrtdp,
602 tdesc_t *ctdp = NULL;
606 if ((dim2 = die_sibling(dw, dim)) == NULL) {
608 } else if (die_tag(dw, dim2) == DW_TAG_subrange_type) {
609 ctdp = xcalloc(sizeof (tdesc_t));
610 ctdp->t_id = mfgtid_next(dw);
611 debug(3, "die %llu: creating new type %u for sub-dimension\n",
612 die_off(dw, dim2), ctdp->t_id);
613 tdesc_array_create(dw, dim2, arrtdp, ctdp);
615 terminate("die %llu: unexpected non-subrange node in array\n",
619 dimtdp->t_type = ARRAY;
620 dimtdp->t_ardef = ar = xcalloc(sizeof (ardef_t));
623 * Array bounds can be signed or unsigned, but there are several kinds
624 * of signless forms (data1, data2, etc) that take their sign from the
625 * routine that is trying to interpret them. That is, data1 can be
626 * either signed or unsigned, depending on whether you use the signed or
627 * unsigned accessor function. GCC will use the signless forms to store
628 * unsigned values which have their high bit set, so we need to try to
629 * read them first as unsigned to get positive values. We could also
630 * try signed first, falling back to unsigned if we got a negative
633 if (die_unsigned(dw, dim, DW_AT_upper_bound, &uval, 0))
634 ar->ad_nelems = uval + 1;
635 else if (die_signed(dw, dim, DW_AT_upper_bound, &sval, 0))
636 ar->ad_nelems = sval + 1;
641 * Different compilers use different index types. Force the type to be
642 * a common, known value (long).
644 ar->ad_idxtype = tdesc_intr_long(dw);
645 ar->ad_contents = ctdp;
647 if (ar->ad_contents->t_size != 0) {
648 dimtdp->t_size = ar->ad_contents->t_size * ar->ad_nelems;
649 dimtdp->t_flags |= TDESC_F_RESOLVED;
654 * Create a tdesc from an array node. Some arrays will come with byte size
655 * attributes, and thus can be resolved immediately. Others don't, and will
656 * need to wait until the second pass for resolution.
659 die_array_create(dwarf_t *dw, Dwarf_Die arr, Dwarf_Off off, tdesc_t *tdp)
661 tdesc_t *arrtdp = die_lookup_pass1(dw, arr, DW_AT_type);
665 debug(3, "die %llu <%llx>: creating array\n", off, off);
667 if ((dim = die_child(dw, arr)) == NULL ||
668 die_tag(dw, dim) != DW_TAG_subrange_type)
669 terminate("die %llu: failed to retrieve array bounds\n", off);
671 tdesc_array_create(dw, dim, arrtdp, tdp);
673 if (die_unsigned(dw, arr, DW_AT_byte_size, &uval, 0)) {
680 * Ensure that sub-dimensions have sizes too before marking
683 flags = TDESC_F_RESOLVED;
684 for (dimtdp = tdp->t_ardef->ad_contents;
685 dimtdp->t_type == ARRAY;
686 dimtdp = dimtdp->t_ardef->ad_contents) {
687 if (!(dimtdp->t_flags & TDESC_F_RESOLVED)) {
693 tdp->t_flags |= flags;
696 debug(3, "die %llu <%llx>: array nelems %u size %u\n", off, off,
697 tdp->t_ardef->ad_nelems, tdp->t_size);
702 die_array_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
704 dwarf_t *dw = private;
707 if (tdp->t_flags & TDESC_F_RESOLVED)
710 debug(3, "trying to resolve array %d (cont %d)\n", tdp->t_id,
711 tdp->t_ardef->ad_contents->t_id);
713 if ((sz = tdesc_size(tdp->t_ardef->ad_contents)) == 0) {
714 debug(3, "unable to resolve array %s (%d) contents %d\n",
715 tdesc_name(tdp), tdp->t_id,
716 tdp->t_ardef->ad_contents->t_id);
722 tdp->t_size = sz * tdp->t_ardef->ad_nelems;
723 tdp->t_flags |= TDESC_F_RESOLVED;
725 debug(3, "resolved array %d: %u bytes\n", tdp->t_id, tdp->t_size);
732 die_array_failed(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private __unused)
734 tdesc_t *cont = tdp->t_ardef->ad_contents;
736 if (tdp->t_flags & TDESC_F_RESOLVED)
739 fprintf(stderr, "Array %d: failed to size contents type %s (%d)\n",
740 tdp->t_id, tdesc_name(cont), cont->t_id);
746 * Most enums (those with members) will be resolved during this first pass.
747 * Others - those without members (see the file comment) - won't be, and will
748 * need to wait until the second pass when they can be matched with their full
752 die_enum_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
758 debug(3, "die %llu: creating enum\n", off);
762 (void) die_unsigned(dw, die, DW_AT_byte_size, &uval, DW_ATTR_REQ);
765 if ((mem = die_child(dw, die)) != NULL) {
766 elist_t **elastp = &tdp->t_emem;
771 if (die_tag(dw, mem) != DW_TAG_enumerator) {
772 /* Nested type declaration */
773 die_create_one(dw, mem);
777 el = xcalloc(sizeof (elist_t));
778 el->el_name = die_name(dw, mem);
780 if (die_signed(dw, mem, DW_AT_const_value, &sval, 0)) {
781 el->el_number = sval;
782 } else if (die_unsigned(dw, mem, DW_AT_const_value,
784 el->el_number = uval;
786 terminate("die %llu: enum %llu: member without "
787 "value\n", off, die_off(dw, mem));
790 debug(3, "die %llu: enum %llu: created %s = %d\n", off,
791 die_off(dw, mem), el->el_name, el->el_number);
794 elastp = &el->el_next;
796 } while ((mem = die_sibling(dw, mem)) != NULL);
798 hash_add(dw->dw_enumhash, tdp);
800 tdp->t_flags |= TDESC_F_RESOLVED;
802 if (tdp->t_name != NULL) {
803 iidesc_t *ii = xcalloc(sizeof (iidesc_t));
804 ii->ii_type = II_SOU;
805 ii->ii_name = xstrdup(tdp->t_name);
808 iidesc_add(dw->dw_td->td_iihash, ii);
814 die_enum_match(void *arg1, void *arg2)
816 tdesc_t *tdp = arg1, **fullp = arg2;
818 if (tdp->t_emem != NULL) {
820 return (-1); /* stop the iteration */
828 die_enum_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
830 dwarf_t *dw = private;
831 tdesc_t *full = NULL;
833 if (tdp->t_flags & TDESC_F_RESOLVED)
836 (void) hash_find_iter(dw->dw_enumhash, tdp, die_enum_match, &full);
839 * The answer to this one won't change from iteration to iteration,
843 terminate("tdp %u: enum %s has no members\n", tdp->t_id,
847 debug(3, "tdp %u: enum %s redirected to %u\n", tdp->t_id,
848 tdesc_name(tdp), full->t_id);
850 tdp->t_flags |= TDESC_F_RESOLVED;
856 die_fwd_map(void *arg1, void *arg2)
858 tdesc_t *fwd = arg1, *sou = arg2;
860 debug(3, "tdp %u: mapped forward %s to sou %u\n", fwd->t_id,
861 tdesc_name(fwd), sou->t_id);
868 * Structures and unions will never be resolved during the first pass, as we
869 * won't be able to fully determine the member sizes. The second pass, which
870 * have access to sizing information, will be able to complete the resolution.
873 die_sou_create(dwarf_t *dw, Dwarf_Die str, Dwarf_Off off, tdesc_t *tdp,
874 int type, const char *typename)
876 Dwarf_Unsigned sz, bitsz, bitoff;
878 mlist_t *ml, **mlastp;
881 tdp->t_type = (die_isdecl(dw, str) ? FORWARD : type);
883 debug(3, "die %llu: creating %s %s\n", off,
884 (tdp->t_type == FORWARD ? "forward decl" : typename),
887 if (tdp->t_type == FORWARD) {
888 hash_add(dw->dw_fwdhash, tdp);
892 (void) hash_find_iter(dw->dw_fwdhash, tdp, die_fwd_map, tdp);
894 (void) die_unsigned(dw, str, DW_AT_byte_size, &sz, DW_ATTR_REQ);
898 * GCC allows empty SOUs as an extension.
900 if ((mem = die_child(dw, str)) == NULL) {
904 mlastp = &tdp->t_members;
907 Dwarf_Off memoff = die_off(dw, mem);
908 Dwarf_Half tag = die_tag(dw, mem);
909 Dwarf_Unsigned mloff;
911 if (tag != DW_TAG_member) {
912 /* Nested type declaration */
913 die_create_one(dw, mem);
917 debug(3, "die %llu: mem %llu: creating member\n", off, memoff);
919 ml = xcalloc(sizeof (mlist_t));
922 * This could be a GCC anon struct/union member, so we'll allow
923 * an empty name, even though nothing can really handle them
924 * properly. Note that some versions of GCC miss out debug
925 * info for anon structs, though recent versions are fixed (gcc
928 if ((ml->ml_name = die_name(dw, mem)) == NULL)
931 ml->ml_type = die_lookup_pass1(dw, mem, DW_AT_type);
933 if (die_mem_offset(dw, mem, DW_AT_data_member_location,
935 debug(3, "die %llu: got mloff %llx\n", off,
936 (u_longlong_t)mloff);
937 ml->ml_offset = mloff * 8;
940 if (die_unsigned(dw, mem, DW_AT_bit_size, &bitsz, 0))
943 ml->ml_size = tdesc_bitsize(ml->ml_type);
945 if (die_unsigned(dw, mem, DW_AT_bit_offset, &bitoff, 0)) {
946 #if BYTE_ORDER == _BIG_ENDIAN
947 ml->ml_offset += bitoff;
949 ml->ml_offset += tdesc_bitsize(ml->ml_type) - bitoff -
954 debug(3, "die %llu: mem %llu: created \"%s\" (off %u sz %u)\n",
955 off, memoff, ml->ml_name, ml->ml_offset, ml->ml_size);
958 mlastp = &ml->ml_next;
959 } while ((mem = die_sibling(dw, mem)) != NULL);
962 * GCC will attempt to eliminate unused types, thus decreasing the
963 * size of the emitted dwarf. That is, if you declare a foo_t in your
964 * header, include said header in your source file, and neglect to
965 * actually use (directly or indirectly) the foo_t in the source file,
966 * the foo_t won't make it into the emitted DWARF. So, at least, goes
969 * Occasionally, it'll emit the DW_TAG_structure_type for the foo_t,
970 * and then neglect to emit the members. Strangely, the loner struct
971 * tag will always be followed by a proper nested declaration of
972 * something else. This is clearly a bug, but we're not going to have
973 * time to get it fixed before this goo goes back, so we'll have to work
974 * around it. If we see a no-membered struct with a nested declaration
975 * (i.e. die_child of the struct tag won't be null), we'll ignore it.
976 * Being paranoid, we won't simply remove it from the hash. Instead,
977 * we'll decline to create an iidesc for it, thus ensuring that this
978 * type won't make it into the output file. To be safe, we'll also
981 if (tdp->t_members == NULL) {
982 const char *old = tdesc_name(tdp);
983 size_t newsz = 7 + strlen(old) + 1;
984 char *new = xmalloc(newsz);
985 (void) snprintf(new, newsz, "orphan %s", old);
987 debug(3, "die %llu: worked around %s %s\n", off, typename, old);
989 if (tdp->t_name != NULL)
996 if (tdp->t_name != NULL) {
997 ii = xcalloc(sizeof (iidesc_t));
998 ii->ii_type = II_SOU;
999 ii->ii_name = xstrdup(tdp->t_name);
1002 iidesc_add(dw->dw_td->td_iihash, ii);
1007 die_struct_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1009 die_sou_create(dw, die, off, tdp, STRUCT, "struct");
1013 die_union_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1015 die_sou_create(dw, die, off, tdp, UNION, "union");
1020 die_sou_resolve(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private)
1022 dwarf_t *dw = private;
1026 if (tdp->t_flags & TDESC_F_RESOLVED)
1029 debug(3, "resolving sou %s\n", tdesc_name(tdp));
1031 for (ml = tdp->t_members; ml != NULL; ml = ml->ml_next) {
1032 if (ml->ml_size == 0) {
1033 mt = tdesc_basetype(ml->ml_type);
1035 if ((ml->ml_size = tdesc_bitsize(mt)) != 0)
1039 * For empty members, or GCC/C99 flexible array
1040 * members, a size of 0 is correct.
1042 if (mt->t_members == NULL)
1044 if (mt->t_type == ARRAY && mt->t_ardef->ad_nelems == 0)
1051 if ((mt = tdesc_basetype(ml->ml_type)) == NULL) {
1056 if (ml->ml_size != 0 && mt->t_type == INTRINSIC &&
1057 mt->t_intr->intr_nbits != ml->ml_size) {
1059 * This member is a bitfield, and needs to reference
1060 * an intrinsic type with the same width. If the
1061 * currently-referenced type isn't of the same width,
1062 * we'll copy it, adjusting the width of the copy to
1063 * the size we'd like.
1065 debug(3, "tdp %u: creating bitfield for %d bits\n",
1066 tdp->t_id, ml->ml_size);
1068 ml->ml_type = tdesc_intr_clone(dw, mt, ml->ml_size);
1072 tdp->t_flags |= TDESC_F_RESOLVED;
1079 die_sou_failed(tdesc_t *tdp, tdesc_t **tdpp __unused, void *private __unused)
1081 const char *typename = (tdp->t_type == STRUCT ? "struct" : "union");
1084 if (tdp->t_flags & TDESC_F_RESOLVED)
1087 for (ml = tdp->t_members; ml != NULL; ml = ml->ml_next) {
1088 if (ml->ml_size == 0) {
1089 fprintf(stderr, "%s %d <%x>: failed to size member \"%s\" "
1090 "of type %s (%d <%x>)\n", typename, tdp->t_id,
1092 ml->ml_name, tdesc_name(ml->ml_type),
1093 ml->ml_type->t_id, ml->ml_type->t_id);
1101 die_funcptr_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1103 Dwarf_Attribute attr;
1109 debug(3, "die %llu <%llx>: creating function pointer\n", off, off);
1112 * We'll begin by processing any type definition nodes that may be
1113 * lurking underneath this one.
1115 for (arg = die_child(dw, die); arg != NULL;
1116 arg = die_sibling(dw, arg)) {
1117 if ((tag = die_tag(dw, arg)) != DW_TAG_formal_parameter &&
1118 tag != DW_TAG_unspecified_parameters) {
1119 /* Nested type declaration */
1120 die_create_one(dw, arg);
1124 if (die_isdecl(dw, die)) {
1126 * This is a prototype. We don't add prototypes to the
1127 * tree, so we're going to drop the tdesc. Unfortunately,
1128 * it has already been added to the tree. Nobody will reference
1129 * it, though, and it will be leaked.
1134 fn = xcalloc(sizeof (fndef_t));
1136 tdp->t_type = FUNCTION;
1138 if ((attr = die_attr(dw, die, DW_AT_type, 0)) != NULL) {
1139 fn->fn_ret = die_lookup_pass1(dw, die, DW_AT_type);
1141 fn->fn_ret = tdesc_intr_void(dw);
1145 * Count the arguments to the function, then read them in.
1147 for (fn->fn_nargs = 0, arg = die_child(dw, die); arg != NULL;
1148 arg = die_sibling(dw, arg)) {
1149 if ((tag = die_tag(dw, arg)) == DW_TAG_formal_parameter)
1151 else if (tag == DW_TAG_unspecified_parameters &&
1156 if (fn->fn_nargs != 0) {
1157 debug(3, "die %llu: adding %d argument%s\n", off, fn->fn_nargs,
1158 (fn->fn_nargs > 1 ? "s" : ""));
1160 fn->fn_args = xcalloc(sizeof (tdesc_t *) * fn->fn_nargs);
1161 for (i = 0, arg = die_child(dw, die);
1162 arg != NULL && i < (int) fn->fn_nargs;
1163 arg = die_sibling(dw, arg)) {
1164 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1167 fn->fn_args[i++] = die_lookup_pass1(dw, arg,
1173 tdp->t_flags |= TDESC_F_RESOLVED;
1177 * GCC and DevPro use different names for the base types. While the terms are
1178 * the same, they are arranged in a different order. Some terms, such as int,
1179 * are implied in one, and explicitly named in the other. Given a base type
1180 * as input, this routine will return a common name, along with an intr_t
1181 * that reflects said name.
1184 die_base_name_parse(const char *name, char **newp)
1189 int nlong = 0, nshort = 0, nchar = 0, nint = 0;
1194 if (strlen(name) > sizeof (buf) - 1)
1195 terminate("base type name \"%s\" is too long\n", name);
1197 strncpy(buf, name, sizeof (buf));
1199 for (c = strtok(buf, " "); c != NULL; c = strtok(NULL, " ")) {
1200 if (strcmp(c, "signed") == 0)
1202 else if (strcmp(c, "unsigned") == 0)
1204 else if (strcmp(c, "long") == 0)
1206 else if (strcmp(c, "char") == 0) {
1209 } else if (strcmp(c, "short") == 0)
1211 else if (strcmp(c, "int") == 0)
1215 * If we don't recognize any of the tokens, we'll tell
1216 * the caller to fall back to the dwarf-provided
1217 * encoding information.
1223 if (nchar > 1 || nshort > 1 || nint > 1 || nlong > 2)
1227 if (nlong > 0 || nshort > 0 || nint > 0)
1232 } else if (nshort > 0) {
1238 } else if (nlong > 0) {
1245 intr = xcalloc(sizeof (intr_t));
1246 intr->intr_type = INTR_INT;
1247 intr->intr_signed = sign;
1248 intr->intr_iformat = fmt;
1250 snprintf(buf, sizeof (buf), "%s%s%s",
1251 (sign ? "" : "unsigned "),
1252 (nlong > 1 ? "long " : ""),
1255 *newp = xstrdup(buf);
1259 typedef struct fp_size_map {
1260 size_t fsm_typesz[2]; /* size of {32,64} type */
1261 uint_t fsm_enc[3]; /* CTF_FP_* for {bare,cplx,imagry} type */
1264 static const fp_size_map_t fp_encodings[] = {
1265 { { 4, 4 }, { CTF_FP_SINGLE, CTF_FP_CPLX, CTF_FP_IMAGRY } },
1266 { { 8, 8 }, { CTF_FP_DOUBLE, CTF_FP_DCPLX, CTF_FP_DIMAGRY } },
1268 { { 16, 16 }, { CTF_FP_LDOUBLE, CTF_FP_LDCPLX, CTF_FP_LDIMAGRY } },
1270 { { 12, 16 }, { CTF_FP_LDOUBLE, CTF_FP_LDCPLX, CTF_FP_LDIMAGRY } },
1272 { { 0, 0 }, { 0, 0, 0 } }
1276 die_base_type2enc(dwarf_t *dw, Dwarf_Off off, Dwarf_Signed enc, size_t sz)
1278 const fp_size_map_t *map = fp_encodings;
1279 uint_t szidx = dw->dw_ptrsz == sizeof (uint64_t);
1280 uint_t mult = 1, col = 0;
1282 if (enc == DW_ATE_complex_float) {
1285 } else if (enc == DW_ATE_imaginary_float
1287 || enc == DW_ATE_SUN_imaginary_float
1292 while (map->fsm_typesz[szidx] != 0) {
1293 if (map->fsm_typesz[szidx] * mult == sz)
1294 return (map->fsm_enc[col]);
1298 terminate("die %llu: unrecognized real type size %u\n", off, sz);
1304 die_base_from_dwarf(dwarf_t *dw, Dwarf_Die base, Dwarf_Off off, size_t sz)
1306 intr_t *intr = xcalloc(sizeof (intr_t));
1309 (void) die_signed(dw, base, DW_AT_encoding, &enc, DW_ATTR_REQ);
1312 case DW_ATE_unsigned:
1313 case DW_ATE_address:
1314 intr->intr_type = INTR_INT;
1316 case DW_ATE_unsigned_char:
1317 intr->intr_type = INTR_INT;
1318 intr->intr_iformat = 'c';
1321 intr->intr_type = INTR_INT;
1322 intr->intr_signed = 1;
1324 case DW_ATE_signed_char:
1325 intr->intr_type = INTR_INT;
1326 intr->intr_signed = 1;
1327 intr->intr_iformat = 'c';
1329 case DW_ATE_boolean:
1330 intr->intr_type = INTR_INT;
1331 intr->intr_signed = 1;
1332 intr->intr_iformat = 'b';
1335 case DW_ATE_complex_float:
1336 case DW_ATE_imaginary_float:
1338 case DW_ATE_SUN_imaginary_float:
1339 case DW_ATE_SUN_interval_float:
1341 intr->intr_type = INTR_REAL;
1342 intr->intr_signed = 1;
1343 intr->intr_fformat = die_base_type2enc(dw, off, enc, sz);
1346 terminate("die %llu: unknown base type encoding 0x%llx\n",
1354 die_base_create(dwarf_t *dw, Dwarf_Die base, Dwarf_Off off, tdesc_t *tdp)
1360 debug(3, "die %llu: creating base type\n", off);
1363 * The compilers have their own clever (internally inconsistent) ideas
1364 * as to what base types should look like. Some times gcc will, for
1365 * example, use DW_ATE_signed_char for char. Other times, however, it
1366 * will use DW_ATE_signed. Needless to say, this causes some problems
1367 * down the road, particularly with merging. We do, however, use the
1368 * DWARF idea of type sizes, as this allows us to avoid caring about
1371 (void) die_unsigned(dw, base, DW_AT_byte_size, &sz, DW_ATTR_REQ);
1373 if (tdp->t_name == NULL)
1374 terminate("die %llu: base type without name\n", off);
1376 /* XXX make a name parser for float too */
1377 if ((intr = die_base_name_parse(tdp->t_name, &new)) != NULL) {
1378 /* Found it. We'll use the parsed version */
1379 debug(3, "die %llu: name \"%s\" remapped to \"%s\"\n", off,
1380 tdesc_name(tdp), new);
1386 * We didn't recognize the type, so we'll create an intr_t
1387 * based on the DWARF data.
1389 debug(3, "die %llu: using dwarf data for base \"%s\"\n", off,
1392 intr = die_base_from_dwarf(dw, base, off, sz);
1395 intr->intr_nbits = sz * 8;
1397 tdp->t_type = INTRINSIC;
1401 tdp->t_flags |= TDESC_F_RESOLVED;
1405 die_through_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp,
1406 int type, const char *typename)
1408 Dwarf_Attribute attr;
1410 debug(3, "die %llu <%llx>: creating %s type %d\n", off, off, typename, type);
1414 if ((attr = die_attr(dw, die, DW_AT_type, 0)) != NULL) {
1415 tdp->t_tdesc = die_lookup_pass1(dw, die, DW_AT_type);
1417 tdp->t_tdesc = tdesc_intr_void(dw);
1420 if (type == POINTER)
1421 tdp->t_size = dw->dw_ptrsz;
1423 tdp->t_flags |= TDESC_F_RESOLVED;
1425 if (type == TYPEDEF) {
1426 iidesc_t *ii = xcalloc(sizeof (iidesc_t));
1427 ii->ii_type = II_TYPE;
1428 ii->ii_name = xstrdup(tdp->t_name);
1431 iidesc_add(dw->dw_td->td_iihash, ii);
1436 die_typedef_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1438 die_through_create(dw, die, off, tdp, TYPEDEF, "typedef");
1442 die_const_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1444 die_through_create(dw, die, off, tdp, CONST, "const");
1448 die_pointer_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1450 die_through_create(dw, die, off, tdp, POINTER, "pointer");
1454 die_restrict_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1456 die_through_create(dw, die, off, tdp, RESTRICT, "restrict");
1460 die_volatile_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp)
1462 die_through_create(dw, die, off, tdp, VOLATILE, "volatile");
1467 die_function_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp __unused)
1474 debug(3, "die %llu <%llx>: creating function definition\n", off, off);
1477 * We'll begin by processing any type definition nodes that may be
1478 * lurking underneath this one.
1480 for (arg = die_child(dw, die); arg != NULL;
1481 arg = die_sibling(dw, arg)) {
1482 if ((tag = die_tag(dw, arg)) != DW_TAG_formal_parameter &&
1483 tag != DW_TAG_variable) {
1484 /* Nested type declaration */
1485 die_create_one(dw, arg);
1489 if (die_isdecl(dw, die) || (name = die_name(dw, die)) == NULL) {
1491 * We process neither prototypes nor subprograms without
1497 ii = xcalloc(sizeof (iidesc_t));
1498 ii->ii_type = die_isglobal(dw, die) ? II_GFUN : II_SFUN;
1500 if (ii->ii_type == II_SFUN)
1501 ii->ii_owner = xstrdup(dw->dw_cuname);
1503 debug(3, "die %llu: function %s is %s\n", off, ii->ii_name,
1504 (ii->ii_type == II_GFUN ? "global" : "static"));
1506 if (die_attr(dw, die, DW_AT_type, 0) != NULL)
1507 ii->ii_dtype = die_lookup_pass1(dw, die, DW_AT_type);
1509 ii->ii_dtype = tdesc_intr_void(dw);
1511 for (arg = die_child(dw, die); arg != NULL;
1512 arg = die_sibling(dw, arg)) {
1515 debug(3, "die %llu: looking at sub member at %llu\n",
1516 off, die_off(dw, die));
1518 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1521 if ((name1 = die_name(dw, arg)) == NULL) {
1522 terminate("die %llu: func arg %d has no name\n",
1523 off, ii->ii_nargs + 1);
1526 if (strcmp(name1, "...") == 0) {
1535 if (ii->ii_nargs > 0) {
1538 debug(3, "die %llu: function has %d argument%s\n", off,
1539 ii->ii_nargs, (ii->ii_nargs == 1 ? "" : "s"));
1541 ii->ii_args = xcalloc(sizeof (tdesc_t) * ii->ii_nargs);
1543 for (arg = die_child(dw, die), i = 0;
1544 arg != NULL && i < ii->ii_nargs;
1545 arg = die_sibling(dw, arg)) {
1546 if (die_tag(dw, arg) != DW_TAG_formal_parameter)
1549 ii->ii_args[i++] = die_lookup_pass1(dw, arg,
1554 iidesc_add(dw->dw_td->td_iihash, ii);
1559 die_variable_create(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off, tdesc_t *tdp __unused)
1564 debug(3, "die %llu: creating object definition\n", off);
1566 if (die_isdecl(dw, die) || (name = die_name(dw, die)) == NULL)
1567 return; /* skip prototypes and nameless objects */
1569 ii = xcalloc(sizeof (iidesc_t));
1570 ii->ii_type = die_isglobal(dw, die) ? II_GVAR : II_SVAR;
1572 ii->ii_dtype = die_lookup_pass1(dw, die, DW_AT_type);
1573 if (ii->ii_type == II_SVAR)
1574 ii->ii_owner = xstrdup(dw->dw_cuname);
1576 iidesc_add(dw->dw_td->td_iihash, ii);
1581 die_fwd_resolve(tdesc_t *fwd, tdesc_t **fwdp, void *private __unused)
1583 if (fwd->t_flags & TDESC_F_RESOLVED)
1586 if (fwd->t_tdesc != NULL) {
1587 debug(3, "tdp %u: unforwarded %s\n", fwd->t_id,
1589 *fwdp = fwd->t_tdesc;
1592 fwd->t_flags |= TDESC_F_RESOLVED;
1599 die_lexblk_descend(dwarf_t *dw, Dwarf_Die die, Dwarf_Off off __unused, tdesc_t *tdp __unused)
1601 Dwarf_Die child = die_child(dw, die);
1604 die_create(dw, child);
1608 * Used to map the die to a routine which can parse it, using the tag to do the
1609 * mapping. While the processing of most tags entails the creation of a tdesc,
1610 * there are a few which don't - primarily those which result in the creation of
1611 * iidescs which refer to existing tdescs.
1614 #define DW_F_NOTDP 0x1 /* Don't create a tdesc for the creator */
1616 typedef struct die_creator {
1619 void (*dc_create)(dwarf_t *, Dwarf_Die, Dwarf_Off, tdesc_t *);
1622 static const die_creator_t die_creators[] = {
1623 { DW_TAG_array_type, 0, die_array_create },
1624 { DW_TAG_enumeration_type, 0, die_enum_create },
1625 { DW_TAG_lexical_block, DW_F_NOTDP, die_lexblk_descend },
1626 { DW_TAG_pointer_type, 0, die_pointer_create },
1627 { DW_TAG_structure_type, 0, die_struct_create },
1628 { DW_TAG_subroutine_type, 0, die_funcptr_create },
1629 { DW_TAG_typedef, 0, die_typedef_create },
1630 { DW_TAG_union_type, 0, die_union_create },
1631 { DW_TAG_base_type, 0, die_base_create },
1632 { DW_TAG_const_type, 0, die_const_create },
1633 { DW_TAG_subprogram, DW_F_NOTDP, die_function_create },
1634 { DW_TAG_variable, DW_F_NOTDP, die_variable_create },
1635 { DW_TAG_volatile_type, 0, die_volatile_create },
1636 { DW_TAG_restrict_type, 0, die_restrict_create },
1640 static const die_creator_t *
1641 die_tag2ctor(Dwarf_Half tag)
1643 const die_creator_t *dc;
1645 for (dc = die_creators; dc->dc_create != NULL; dc++) {
1646 if (dc->dc_tag == tag)
1654 die_create_one(dwarf_t *dw, Dwarf_Die die)
1656 Dwarf_Off off = die_off(dw, die);
1657 const die_creator_t *dc;
1661 debug(3, "die %llu <%llx>: create_one\n", off, off);
1663 if (off > dw->dw_maxoff) {
1664 terminate("illegal die offset %llu (max %llu)\n", off,
1668 tag = die_tag(dw, die);
1670 if ((dc = die_tag2ctor(tag)) == NULL) {
1671 debug(2, "die %llu: ignoring tag type %x\n", off, tag);
1675 if ((tdp = tdesc_lookup(dw, off)) == NULL &&
1676 !(dc->dc_flags & DW_F_NOTDP)) {
1677 tdp = xcalloc(sizeof (tdesc_t));
1683 tdp->t_name = die_name(dw, die);
1685 dc->dc_create(dw, die, off, tdp);
1689 die_create(dwarf_t *dw, Dwarf_Die die)
1692 die_create_one(dw, die);
1693 } while ((die = die_sibling(dw, die)) != NULL);
1696 static tdtrav_cb_f die_resolvers[] = {
1698 NULL, /* intrinsic */
1700 die_array_resolve, /* array */
1701 NULL, /* function */
1702 die_sou_resolve, /* struct */
1703 die_sou_resolve, /* union */
1704 die_enum_resolve, /* enum */
1705 die_fwd_resolve, /* forward */
1707 NULL, /* typedef unres */
1708 NULL, /* volatile */
1710 NULL, /* restrict */
1713 static tdtrav_cb_f die_fail_reporters[] = {
1715 NULL, /* intrinsic */
1717 die_array_failed, /* array */
1718 NULL, /* function */
1719 die_sou_failed, /* struct */
1720 die_sou_failed, /* union */
1724 NULL, /* typedef unres */
1725 NULL, /* volatile */
1727 NULL, /* restrict */
1731 die_resolve(dwarf_t *dw)
1740 (void) iitraverse_hash(dw->dw_td->td_iihash,
1741 &dw->dw_td->td_curvgen, NULL, NULL, die_resolvers, dw);
1743 debug(3, "resolve: pass %d, %u left\n", pass, dw->dw_nunres);
1745 if ((int) dw->dw_nunres == last) {
1746 fprintf(stderr, "%s: failed to resolve the following "
1747 "types:\n", progname);
1749 (void) iitraverse_hash(dw->dw_td->td_iihash,
1750 &dw->dw_td->td_curvgen, NULL, NULL,
1751 die_fail_reporters, dw);
1753 terminate("failed to resolve types\n");
1756 last = dw->dw_nunres;
1758 } while (dw->dw_nunres != 0);
1763 dw_read(tdata_t *td, Elf *elf, char *filename __unused)
1765 Dwarf_Unsigned abboff, hdrlen, nxthdr;
1766 Dwarf_Half vers, addrsz;
1768 Dwarf_Die child = 0;
1773 bzero(&dw, sizeof (dwarf_t));
1775 dw.dw_ptrsz = elf_ptrsz(elf);
1776 dw.dw_mfgtid_last = TID_MFGTID_BASE;
1777 dw.dw_tidhash = hash_new(TDESC_HASH_BUCKETS, tdesc_idhash, tdesc_idcmp);
1778 dw.dw_fwdhash = hash_new(TDESC_HASH_BUCKETS, tdesc_namehash,
1780 dw.dw_enumhash = hash_new(TDESC_HASH_BUCKETS, tdesc_namehash,
1783 if ((rc = dwarf_elf_init(elf, DW_DLC_READ, &dw.dw_dw,
1784 &dw.dw_err)) == DW_DLV_NO_ENTRY) {
1787 } else if (rc != DW_DLV_OK) {
1788 if (dwarf_errno(&dw.dw_err) == DW_DLE_DEBUG_INFO_NULL) {
1790 * There's no type data in the DWARF section, but
1791 * libdwarf is too clever to handle that properly.
1796 terminate("failed to initialize DWARF: %s\n",
1797 dwarf_errmsg(&dw.dw_err));
1800 if ((rc = dwarf_next_cu_header(dw.dw_dw, &hdrlen, &vers, &abboff,
1801 &addrsz, &nxthdr, &dw.dw_err)) != DW_DLV_OK)
1802 terminate("rc = %d %s\n", rc, dwarf_errmsg(&dw.dw_err));
1804 if ((cu = die_sibling(&dw, NULL)) == NULL)
1805 terminate("file does not contain dwarf type data "
1806 "(try compiling with -g)\n");
1808 dw.dw_maxoff = nxthdr - 1;
1810 if (dw.dw_maxoff > TID_FILEMAX)
1811 terminate("file contains too many types\n");
1813 debug(1, "DWARF version: %d\n", vers);
1814 if (vers != DWARF_VERSION) {
1815 terminate("file contains incompatible version %d DWARF code "
1816 "(version 2 required)\n", vers);
1819 if (die_string(&dw, cu, DW_AT_producer, &prod, 0)) {
1820 debug(1, "DWARF emitter: %s\n", prod);
1824 if ((dw.dw_cuname = die_name(&dw, cu)) != NULL) {
1825 char *base = xstrdup(basename(dw.dw_cuname));
1827 dw.dw_cuname = base;
1829 debug(1, "CU name: %s\n", dw.dw_cuname);
1832 if ((child = die_child(&dw, cu)) != NULL)
1833 die_create(&dw, child);
1835 if ((rc = dwarf_next_cu_header(dw.dw_dw, &hdrlen, &vers, &abboff,
1836 &addrsz, &nxthdr, &dw.dw_err)) != DW_DLV_NO_ENTRY)
1837 terminate("multiple compilation units not supported\n");
1839 (void) dwarf_finish(&dw.dw_dw, &dw.dw_err);
1843 cvt_fixups(td, dw.dw_ptrsz);
1845 /* leak the dwarf_t */