diff options
Diffstat (limited to 'cmd/sgs/include')
| -rw-r--r-- | cmd/sgs/include/_string_table.h | 126 | ||||
| -rw-r--r-- | cmd/sgs/include/alist.h | 280 | ||||
| -rw-r--r-- | cmd/sgs/include/debug.h | 1017 | ||||
| -rw-r--r-- | cmd/sgs/include/sgs.h | 296 | ||||
| -rw-r--r-- | cmd/sgs/include/string_table.h | 63 |
5 files changed, 1782 insertions, 0 deletions
diff --git a/cmd/sgs/include/_string_table.h b/cmd/sgs/include/_string_table.h new file mode 100644 index 000000000000..2d2963f9dab7 --- /dev/null +++ b/cmd/sgs/include/_string_table.h @@ -0,0 +1,126 @@ +/* + * CDDL HEADER START + * + * The contents of this file are subject to the terms of the + * Common Development and Distribution License (the "License"). + * You may not use this file except in compliance with the License. + * + * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE + * or http://www.opensolaris.org/os/licensing. + * See the License for the specific language governing permissions + * and limitations under the License. + * + * When distributing Covered Code, include this CDDL HEADER in each + * file and include the License file at usr/src/OPENSOLARIS.LICENSE. + * If applicable, add the following below this CDDL HEADER, with the + * fields enclosed by brackets "[]" replaced with your own identifying + * information: Portions Copyright [yyyy] [name of copyright owner] + * + * CDDL HEADER END + */ +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved. + * Use is subject to license terms. + */ + +#ifndef __STRING_TABLE_DOT_H +#define __STRING_TABLE_DOT_H + +#pragma ident "%Z%%M% %I% %E% SMI" + +#include <sys/types.h> +#include <sys/avl.h> +#include <string_table.h> + +#ifdef __cplusplus +extern "C" { +#endif + +/* + * A string is represented in a string table using two values: length, and + * value. Grouping all the strings of a given length together allows for + * efficient matching of tail strings, as each input string value is hashed. + * Each string table uses a 2-level AVL tree of AVL trees to represent this + * organization. + * + * The outer (main) AVL tree contains LenNode structures. The search key for + * nodes on this main tree is the string length. Each such node represents + * all strings of a given length, and all strings of that length are found + * within. + * + * The strings within each LenNode are maintained using a secondary AVL tree + * of StrNode structures. The search key for this inner tree is the string + * itself. The strings are maintained in lexical order. + */ +typedef struct { + avl_node_t sn_avlnode; /* AVL book-keeping */ + const char *sn_str; /* string */ + size_t sn_refcnt; /* reference count */ +} StrNode; + +typedef struct { + avl_node_t ln_avlnode; /* AVL book-keeping */ + avl_tree_t *ln_strtree; /* AVL tree of associated strings */ + size_t ln_strlen; /* length of associated strings */ +} LenNode; + +/* + * Define a master string data item. Other strings may be suffixes of this + * string. The final string table will consist of the master string values, + * laid end to end, with the other strings referencing their tails. + */ +typedef struct str_master Str_master; + +struct str_master { + const char *sm_str; /* pointer to master string */ + Str_master *sm_next; /* used for tracking master strings */ + size_t sm_strlen; /* length of master string */ + uint_t sm_hashval; /* hashval of master string */ + size_t sm_stroff; /* offset into destination strtab */ +}; + +/* + * Define a hash data item. This item represents an individual string that has + * been input into the String hash table. The string may either be a suffix of + * another string, or a master string. + */ +typedef struct str_hash Str_hash; + +struct str_hash { + size_t hi_strlen; /* string length */ + size_t hi_refcnt; /* number of references to str */ + uint_t hi_hashval; /* hash for string */ + Str_master *hi_mstr; /* pointer to master string */ + Str_hash *hi_next; /* next entry in hash bucket */ +}; + +/* + * Controlling data structure for a String Table. + */ +struct str_tbl { + avl_tree_t *st_lentree; /* AVL tree of string lengths */ + char *st_strbuf; /* string buffer */ + Str_hash **st_hashbcks; /* hash buckets */ + Str_master *st_mstrlist; /* list of all master strings */ + size_t st_fullstrsize; /* uncompressed table size */ + size_t st_nextoff; /* next available string */ + size_t st_strsize; /* compressed size */ + size_t st_strcnt; /* number of strings */ + uint_t st_hbckcnt; /* number of buckets in */ + /* hashlist */ + uint_t st_flags; +}; + +#define FLG_STTAB_COMPRESS 0x01 /* compressed string table */ +#define FLG_STTAB_COOKED 0x02 /* offset has been assigned */ + +/* + * Starting value for use with string hashing functions inside of string_table.c + */ +#define HASHSEED 5381 + +#ifdef __cplusplus +} +#endif + +#endif /* __STRING_TABLE_DOT_H */ diff --git a/cmd/sgs/include/alist.h b/cmd/sgs/include/alist.h new file mode 100644 index 000000000000..c27160bd35cc --- /dev/null +++ b/cmd/sgs/include/alist.h @@ -0,0 +1,280 @@ +/* + * CDDL HEADER START + * + * The contents of this file are subject to the terms of the + * Common Development and Distribution License (the "License"). + * You may not use this file except in compliance with the License. + * + * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE + * or http://www.opensolaris.org/os/licensing. + * See the License for the specific language governing permissions + * and limitations under the License. + * + * When distributing Covered Code, include this CDDL HEADER in each + * file and include the License file at usr/src/OPENSOLARIS.LICENSE. + * If applicable, add the following below this CDDL HEADER, with the + * fields enclosed by brackets "[]" replaced with your own identifying + * information: Portions Copyright [yyyy] [name of copyright owner] + * + * CDDL HEADER END + */ + +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved. + * Use is subject to license terms. + * + * Define an Alist, a list maintained as a reallocable array, and a for() loop + * macro to generalize its traversal. Note that the array can be reallocated + * as it is being traversed, thus the offset of each element is recomputed from + * the start of the structure. + */ + +#ifndef _ALIST_H +#define _ALIST_H + +#pragma ident "%Z%%M% %I% %E% SMI" + +#ifdef __cplusplus +extern "C" { +#endif + +#include <sys/types.h> +#if defined(sun) +#include <sys/machelf.h> +#else +#include <sys/elf.h> +#endif + +/* + * An Alist implements array lists. The functionality is similar to + * that of a linked list. However, an Alist is represented by a single + * contigious allocation of memory. The head of the memory is a header + * that contains control information for the list. Following the header + * is an array used to hold the user data. In the type definitions that + * follow, we define these as an array with a single element, but when + * we allocate the memory, we actually allocate the amount of memory needed. + * + * There are two "flavors" of array list: + * + * Alist - Contain arbitrary data, usually structs. + * APlist - Contain pointers to data allocated elsewhere. + * + * This differentiation is useful, because pointer lists are heavily + * used, and support a slightly different set of operations that are + * unique to their purpose. + * + * Array lists are initially represented by a NULL pointer. The memory + * for the list is only allocated if an item is inserted. This is very + * efficient for data structures that may or may not be needed for a + * given linker operation --- you only pay for what you use. In addition: + * + * - Array lists grow as needed (memory is reallocated as necessary) + * - Data is kept contiguously (no unused holes in between elements) + * at the beginning of the data area. This locality has + * good cache behavior, as access to adjacent items are + * highly likely to be in the same page of memory. + * - Insert/Delete operations at the end of the list are very + * efficient. However, insert/delete operations elsewhere + * will cause a relatively expensive overlapped memory + * copy of the data following the insert/delete location. + * - As with any generic memory alloctor (i.e. malloc()/free()), + * array lists are not type safe for the data they contain. + * Data is managed as (void *) pointers to data of a given + * length, so the Alist module cannot prevent the caller from + * inserting/extracting the wrong type of data. The caller + * must guard against this. + * - To free an array list, simply call the standard free() function + * on the list pointer. + */ + + + +/* + * Aliste is used to represent list indexes, offsets, and sizes. + */ +typedef size_t Aliste; + + + +/* + * Alist is used to hold non-pointer items --- usually structs: + * - There must be an even number of Aliste fields before the + * al_data field. This ensures that al_data will have + * an alignment of 8, no matter whether sizeof(Aliste) + * is 4 or 8. That means that al_data will have sufficient + * alignment for any use, just like memory allocated via + * malloc(). + * - al_nitems and al_next are redundant, in that they are + * directly related: + * al_next = al_nitems * al_size + * We do this to make ALIST_TRAVERSE_BYOFFSET maximally + * efficient. This doesn't waste space, because of the + * requirement to have an even # of Alist fields (above). + * + * Note that Alists allow the data to be referenced by 0 based array + * index, or by their byte offset from the start of the Alist memory + * allocation. The index form is preferred for most use, as it is simpler. + * However, by-offset access is used by rtld link maps, and this ability + * is convenient in that case. + */ +typedef struct { + Aliste al_arritems; /* # of items in al_data allocation */ + Aliste al_nitems; /* # items (index of next avail item) */ + Aliste al_next; /* offset of next available al_data[] */ + Aliste al_size; /* size of each al_data[] item */ + void *al_data[1]; /* data (can grow) */ +} Alist; + +/* + * APlist is a variant of Alist that contains pointers. There are several + * benefits to this special type: + * - API is simpler + * - Pointers are used directly, instead of requiring a + * pointer-to-pointer double indirection. + * - The implementation is slightly more efficient. + * - Operations that make particular sense for pointers + * can be supported without confusing the API for the + * regular Alists. + */ +typedef struct { + Aliste apl_arritems; /* # of items in apl_data allocation */ + Aliste apl_nitems; /* # items (index of next avail item) */ + void *apl_data[1]; /* data area: (arrcnt * size) bytes */ +} APlist; + + +/* + * The ALIST_OFF_DATA and APLIST_OFF_DATA macros give the byte offset + * from the start of an array list to the first byte of the data area + * used to hold user data. The same trick used by the standard offsetof() + * macro is used. + */ +#define ALIST_OFF_DATA ((size_t)(((Alist *)0)->al_data)) +#define APLIST_OFF_DATA ((size_t)(((APlist *)0)->apl_data)) + + +/* + * The TRAVERSE macros are intended to be used within a for(), and + * cause the resulting loop to iterate over each item in the loop, + * in order. + * ALIST_TRAVERSE: Traverse over the items in an Alist, + * using the zero based item array index to refer to + * each item. + * ALIST_TRAVERSE_BY_OFFSET: Traverse over the items in an + * Alist using the byte offset from the head of the + * Alist pointer to refer to each item. It should be noted + * that the first such offset is given by ALIST_OFF_DATA, + * and as such, there will never be a 0 offset. Some code + * uses this fact to treat 0 as a reserved value with + * special meaning. + * + * By-offset access is convenient for some parts of + * rtld, where a value of 0 is used to indicate an + * uninitialized link map control. + * + * APLIST_TRAVERSE: Traverse over the pointers in an APlist, using + * the zero based item array index to refer to each pointer. + */ + +/* + * Within the loop: + * + * LIST - Pointer to Alist structure for list + * IDX - The current item index + * OFF - The current item offset + * DATA - Pointer to item + */ +#define ALIST_TRAVERSE(LIST, IDX, DATA) \ + (IDX) = 0, \ + ((LIST) != NULL) && ((DATA) = (void *)(LIST)->al_data); \ + \ + ((LIST) != NULL) && ((IDX) < (LIST)->al_nitems); \ + \ + (IDX)++, \ + (DATA) = (void *) (((LIST)->al_size * (IDX)) + (char *)(LIST)->al_data) + +#define ALIST_TRAVERSE_BY_OFFSET(LIST, OFF, DATA) \ + (((LIST) != NULL) && ((OFF) = ALIST_OFF_DATA) && \ + (((DATA) = (void *)((char *)(LIST) + (OFF))))); \ + \ + (((LIST) != NULL) && ((OFF) < (LIST)->al_next)); \ + \ + (((OFF) += ((LIST)->al_size)), \ + ((DATA) = (void *)((char *)(LIST) + (OFF)))) + +/* + * Within the loop: + * + * LIST - Pointer to APlist structure for list + * IDX - The current item index + * PTR - item value + * + * Note that this macro is designed to ensure that PTR retains the + * value of the final pointer in the list after exiting the for loop, + * and to avoid dereferencing an out of range address. This is done by + * doing the dereference in the middle expression, using the comma + * operator to ensure that a NULL pointer won't stop the loop. + */ +#define APLIST_TRAVERSE(LIST, IDX, PTR) \ + (IDX) = 0; \ + \ + ((LIST) != NULL) && ((IDX) < (LIST)->apl_nitems) && \ + (((PTR) = ((LIST)->apl_data)[IDX]), 1); \ + \ + (IDX)++ + + +/* + * Possible values returned by aplist_test() + */ +typedef enum { + ALE_ALLOCFAIL = 0, /* Memory allocation error */ + ALE_EXISTS = 1, /* alist entry already exists */ + ALE_NOTFND = 2, /* item not found and insert not required */ + ALE_CREATE = 3 /* alist entry created */ +} aplist_test_t; + + +/* + * Access to an Alist item by index or offset. This is needed because the + * size of an item in an Alist is not known by the C compiler, and we + * have to do the indexing arithmetic explicitly. + * + * For an APlist, index the apl_data field directly --- No macro is needed. + */ +#define alist_item(_lp, _idx) \ + ((void *)(ALIST_OFF_DATA + ((_idx) * (_lp)->al_size) + (char *)(_lp))) +#define alist_item_by_offset(_lp, _off) \ + ((void *)((_off) + (char *)(_lp))) + +/* + * # of items currently found in a list. These macros handle the case + * where the list has not been allocated yet. + */ +#define alist_nitems(_lp) (((_lp) == NULL) ? 0 : (_lp)->al_nitems) +#define aplist_nitems(_lp) (((_lp) == NULL) ? 0 : (_lp)->apl_nitems) + + +extern void *alist_append(Alist **, const void *, size_t, Aliste); +extern void alist_delete(Alist *, Aliste *); +extern void alist_delete_by_offset(Alist *, Aliste *); +extern void *alist_insert(Alist **, const void *, size_t, + Aliste, Aliste); +extern void *alist_insert_by_offset(Alist **, const void *, size_t, + Aliste, Aliste); +extern void alist_reset(Alist *); + + +extern void *aplist_append(APlist **, const void *, Aliste); +extern void aplist_delete(APlist *, Aliste *); +extern int aplist_delete_value(APlist *, const void *); +extern void *aplist_insert(APlist **, const void *, + Aliste, Aliste idx); +extern void aplist_reset(APlist *); +extern aplist_test_t aplist_test(APlist **, const void *, Aliste); + +#ifdef __cplusplus +} +#endif + +#endif /* _ALIST_H */ diff --git a/cmd/sgs/include/debug.h b/cmd/sgs/include/debug.h new file mode 100644 index 000000000000..0a42f8dd9e9b --- /dev/null +++ b/cmd/sgs/include/debug.h @@ -0,0 +1,1017 @@ +/* + * CDDL HEADER START + * + * The contents of this file are subject to the terms of the + * Common Development and Distribution License (the "License"). + * You may not use this file except in compliance with the License. + * + * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE + * or http://www.opensolaris.org/os/licensing. + * See the License for the specific language governing permissions + * and limitations under the License. + * + * When distributing Covered Code, include this CDDL HEADER in each + * file and include the License file at usr/src/OPENSOLARIS.LICENSE. + * If applicable, add the following below this CDDL HEADER, with the + * fields enclosed by brackets "[]" replaced with your own identifying + * information: Portions Copyright [yyyy] [name of copyright owner] + * + * CDDL HEADER END + */ + +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved. + * Use is subject to license terms. + */ + +#ifndef _DEBUG_H +#define _DEBUG_H + +#pragma ident "%Z%%M% %I% %E% SMI" + +/* + * Global include file for lddbg debugging. + * + * ld(1) and ld.so.1(1) carry out all diagnostic debugging calls via lazy + * loading the library liblddbg.so. Thus debugging is always enabled. The + * utility elfdump(1) is explicitly dependent upon this library. There are two + * categories of routines defined in this library: + * + * o Debugging routines that have specific linker knowledge, and test the + * class of debugging allowable before proceeding, start with the `Dbg_' + * prefix. + * + * o Lower level routines that provide generic ELF structure interpretation + * start with the `Elf_' prefix. These latter routines are the only + * routines used by the elfdump(1) utility. + */ +#include <sgs.h> +#include <libld.h> +#include <rtld.h> +#include <gelf.h> + +#ifdef __cplusplus +extern "C" { +#endif + +/* + * Define Dbg_*() interface flags. These flags direct the debugging routine to + * generate different diagnostics, thus the strings themselves are maintained + * in the debugging library. + */ +#define DBG_SUP_ENVIRON 1 +#define DBG_SUP_CMDLINE 2 +#define DBG_SUP_DEFAULT 3 + +#define DBG_CONF_IGNORE 1 /* configuration processing errors */ +#define DBG_CONF_VERSION 2 +#define DBG_CONF_PRCFAIL 3 +#define DBG_CONF_CORRUPT 4 +#define DBG_CONF_ABIMISMATCH 5 + +#define DBG_ORDER_INFO_RANGE 1 /* sh_link out of range */ +#define DBG_ORDER_INFO_ORDER 2 /* sh_info also ordered */ +#define DBG_ORDER_LINK_OUTRANGE 3 /* sh_link out of range */ +#define DBG_ORDER_FLAGS 4 /* sh_flags do not match */ +#define DBG_ORDER_CYCLIC 5 /* sh_link cyclic */ +#define DBG_ORDER_LINK_ERROR 6 /* sh_link (one) has an error */ + +#define DBG_INIT_SORT 1 /* calling init from sorted order */ +#define DBG_INIT_PEND 2 /* calling pending init */ +#define DBG_INIT_DYN 3 /* dynamically triggered init */ +#define DBG_INIT_DONE 4 /* init completed */ + +#define DBG_DLSYM_DEF 0 +#define DBG_DLSYM_NEXT 1 +#define DBG_DLSYM_DEFAULT 2 +#define DBG_DLSYM_SELF 3 +#define DBG_DLSYM_PROBE 4 +#define DBG_DLSYM_SINGLETON 5 + +#define DBG_DLCLOSE_NULL 0 +#define DBG_DLCLOSE_IGNORE 1 +#define DBG_DLCLOSE_RESCAN 2 + +#define DBG_WAIT_INIT 1 +#define DBG_WAIT_FINI 2 +#define DBG_WAIT_SYMBOL 3 + +#define DBG_SYM_REDUCE_GLOBAL 1 /* reporting global symbols to local */ +#define DBG_SYM_REDUCE_RETAIN 2 /* reporting non reduced local syms */ + +/* + * Group handle operations - passed to Dbg_file_hdl_title(). Indicate why + * handle dependencies are being manipulated. + */ +#define DBG_HDL_CREATE 0 /* handle creation */ +#define DBG_HDL_ADD 1 /* addition to existing handle */ +#define DBG_HDL_DELETE 2 /* deletion from a handle */ +#define DBG_HDL_ORPHAN 3 /* handle being moved to orphan list */ +#define DBG_HDL_REINST 4 /* handle reinstated from orphan list */ + +/* + * Group handle dependency operations - passed to Dbg_file_hdl_action(). + * Identify the dependencies that are associated with a handle. + */ +#define DBG_DEP_ADD 0 /* dependency added */ +#define DBG_DEP_UPDATE 1 /* dependency updated */ +#define DBG_DEP_DELETE 2 /* dependency deleted */ +#define DBG_DEP_REMOVE 3 /* dependency removed from handle */ +#define DBG_DEP_REMAIN 4 /* dependency must remain on handle */ +#define DBG_DEP_ORPHAN 5 /* dependency must remain an orphan */ +#define DBG_DEP_REINST 6 /* dependency reinstated from orphan */ + +/* + * Binding information, indicating the result of a symbol binding. Can also + * indicate the reference as being EXTERN or PARENT. Binding information is + * used to augment diagnostic binding information (which in turn can be used by + * lari(1)), and to enable ldd(1) -p processing. + */ +#define DBG_BINFO_FOUND 0x0001 /* information regarding binding */ +#define DBG_BINFO_DIRECT 0x0002 /* bound directly */ +#define DBG_BINFO_COPYREF 0x0004 /* bound to copy relocated reference */ +#define DBG_BINFO_FILTEE 0x0008 /* bound to filtee */ +#define DBG_BINFO_INTERPOSE 0x0010 /* bound to an identified interposer */ +#define DBG_BINFO_PLTADDR 0x0020 /* bound to executables undefined plt */ +#define DBG_BINFO_MSK 0x0fff + +#define DBG_BINFO_REF_EXTERN 0x1000 /* reference to EXTERN */ +#define DBG_BINFO_REF_PARENT 0x2000 /* reference to PARENT */ +#define DBG_BINFO_REF_MSK 0xf000 + + +#define DBG_CAP_INITIAL 0 +#define DBG_CAP_IGNORE 1 +#define DBG_CAP_OLD 2 +#define DBG_CAP_NEW 3 +#define DBG_CAP_RESOLVED 4 + +#define DBG_REL_START 1 +#define DBG_REL_FINISH 2 +#define DBG_REL_NONE 3 + +#define DBG_NL_STD 0 /* newline controllers - standard and */ +#define DBG_NL_FRC 2 /* forced. */ + +#define DBG_BNDREJ_NODIR 0 /* bind rejected, direct to nodirect */ +#define DBG_BNDREJ_SINGLE 1 /* bind rejected, singleton without */ + /* default search model */ +#define DBG_BNDREJ_NUM DBG_BNDREJ_SINGLE + +/* + * Define a debug descriptor, and a user macro that inspects the descriptor as + * a means of triggering a class of diagnostic output. + */ +typedef struct { + uint_t d_class; /* debugging classes */ + uint_t d_extra; /* extra information for classes */ + APlist *d_list; /* associated strings */ +} Dbg_desc; + +extern Dbg_desc *dbg_desc; + +#define DBG_ENABLED (dbg_desc->d_class) +#define DBG_CALL(func) if (DBG_ENABLED) func + +/* + * Most debugging tokens are interpreted within liblddbg, and thus any flags + * within d_class are only meaningful to this library. The following flags + * extend the d_class diagnostic, and are maintained in d_extra. These flags + * may be interpreted by the debugging library itself or from the callers + * dbg_print() routine. + */ +#define DBG_E_DETAIL 0x0001 /* add detail to a class */ +#define DBG_E_LONG 0x0002 /* use long names (ie. no truncation) */ + +#define DBG_E_STDNL 0x0010 /* standard newline indicator */ + +#define DBG_E_SNAME 0x0100 /* prepend simple name (ld only) */ +#define DBG_E_FNAME 0x0200 /* prepend full name (ld only) */ +#define DBG_E_CLASS 0x0400 /* prepend ELF class (ld only) */ +#define DBG_E_LMID 0x0800 /* prepend link-map id (ld.so.1 only) */ +#define DBG_E_DEMANGLE 0x1000 /* demangle symbol names */ + +#define DBG_NOTDETAIL() !(dbg_desc->d_extra & DBG_E_DETAIL) +#define DBG_NOTLONG() !(dbg_desc->d_extra & DBG_E_LONG) + +#define DBG_ISSNAME() (dbg_desc->d_extra & DBG_E_SNAME) +#define DBG_ISFNAME() (dbg_desc->d_extra & DBG_E_FNAME) +#define DBG_ISCLASS() (dbg_desc->d_extra & DBG_E_CLASS) +#define DBG_ISLMID() (dbg_desc->d_extra & DBG_E_LMID) +#define DBG_ISDEMANGLE() \ + (dbg_desc->d_extra & DBG_E_DEMANGLE) + +/* + * Print routine, this must be supplied by the application. The initial + * argument may provide a link-map list to associate with the format statement + * that follows. + */ +/* PRINTFLIKE2 */ +extern void dbg_print(Lm_list *, const char *, ...); + +extern uintptr_t Dbg_setup(const char *, Dbg_desc *); + +/* + * Establish ELF32 and ELF64 class Dbg_*() interfaces. + */ +#if defined(_ELF64) + +#define Dbg_demangle_name Dbg64_demangle_name + +#define Dbg_bind_global Dbg64_bind_global +#define Dbg_bind_plt_summary Dbg64_bind_plt_summary +#define Dbg_bind_pltpad_from Dbg64_bind_pltpad_from +#define Dbg_bind_pltpad_to Dbg64_bind_pltpad_to +#define Dbg_bind_reject Dbg64_bind_reject +#define Dbg_bind_weak Dbg64_bind_weak + +#define Dbg_cap_val_hw1 Dbg64_cap_val_hw1 +#define Dbg_cap_hw_candidate Dbg64_cap_hw_candidate +#define Dbg_cap_hw_filter Dbg64_cap_hw_filter +#define Dbg_cap_mapfile Dbg64_cap_mapfile +#define Dbg_cap_sec_entry Dbg64_cap_sec_entry +#define Dbg_cap_sec_title Dbg64_cap_sec_title + +#define Dbg_ent_entry Dbg64_ent_entry +#define Dbg_ent_print Dbg64_ent_print + +#define Dbg_file_analyze Dbg64_file_analyze +#define Dbg_file_aout Dbg64_file_aout +#define Dbg_file_ar Dbg64_file_ar +#define Dbg_file_ar_rescan Dbg64_file_ar_rescan +#define Dbg_file_bind_entry Dbg64_file_bind_entry +#define Dbg_file_bindings Dbg64_file_bindings +#define Dbg_file_cleanup Dbg64_file_cleanup +#define Dbg_file_cntl Dbg64_file_cntl +#define Dbg_file_config_dis Dbg64_file_config_dis +#define Dbg_file_config_obj Dbg64_file_config_obj +#define Dbg_file_del_rescan Dbg64_file_del_rescan +#define Dbg_file_delete Dbg64_file_delete +#define Dbg_file_dlclose Dbg64_file_dlclose +#define Dbg_file_dldump Dbg64_file_dldump +#define Dbg_file_dlopen Dbg64_file_dlopen +#define Dbg_file_elf Dbg64_file_elf +#define Dbg_file_filtee Dbg64_file_filtee +#define Dbg_file_filter Dbg64_file_filter +#define Dbg_file_fixname Dbg64_file_fixname +#define Dbg_file_generic Dbg64_file_generic +#define Dbg_file_hdl_action Dbg64_file_hdl_action +#define Dbg_file_hdl_collect Dbg64_file_hdl_collect +#define Dbg_file_hdl_title Dbg64_file_hdl_title +#define Dbg_file_lazyload Dbg64_file_lazyload +#define Dbg_file_ldso Dbg64_file_ldso +#define Dbg_file_mode_promote Dbg64_file_mode_promote +#define Dbg_file_modified Dbg64_file_modified +#define Dbg_file_needed Dbg64_file_needed +#define Dbg_file_output Dbg64_file_output +#define Dbg_file_preload Dbg64_file_preload +#define Dbg_file_prot Dbg64_file_prot +#define Dbg_file_rejected Dbg64_file_rejected +#define Dbg_file_reuse Dbg64_file_reuse +#define Dbg_file_skip Dbg64_file_skip + +#define Dbg_got_display Dbg64_got_display + +#define Dbg_libs_audit Dbg64_libs_audit +#define Dbg_libs_find Dbg64_libs_find +#define Dbg_libs_found Dbg64_libs_found +#define Dbg_libs_ignore Dbg64_libs_ignore +#define Dbg_libs_init Dbg64_libs_init +#define Dbg_libs_l Dbg64_libs_l +#define Dbg_libs_path Dbg64_libs_path +#define Dbg_libs_req Dbg64_libs_req +#define Dbg_libs_update Dbg64_libs_update +#define Dbg_libs_yp Dbg64_libs_yp +#define Dbg_libs_ylu Dbg64_libs_ylu + +#define Dbg_map_dash Dbg64_map_dash +#define Dbg_map_ent Dbg64_map_ent +#define Dbg_map_parse Dbg64_map_parse +#define Dbg_map_pipe Dbg64_map_pipe +#define Dbg_map_seg Dbg64_map_seg +#define Dbg_map_set_atsign Dbg64_map_set_atsign +#define Dbg_map_set_equal Dbg64_map_set_equal +#define Dbg_map_size_new Dbg64_map_size_new +#define Dbg_map_size_old Dbg64_map_size_old +#define Dbg_map_sort_fini Dbg64_map_sort_fini +#define Dbg_map_sort_orig Dbg64_map_sort_orig +#define Dbg_map_symbol Dbg64_map_symbol +#define Dbg_map_version Dbg64_map_version + +#define Dbg_move_adjexpandreloc Dbg64_move_adjexpandreloc +#define Dbg_move_adjmovereloc Dbg64_move_adjmovereloc +#define Dbg_move_data Dbg64_move_data +#define Dbg_move_entry1 Dbg64_move_entry1 +#define Dbg_move_entry2 Dbg64_move_entry2 +#define Dbg_move_expand Dbg64_move_expand +#define Dbg_move_input Dbg64_move_input +#define Dbg_move_outmove Dbg64_move_outmove +#define Dbg_move_outsctadj Dbg64_move_outsctadj +#define Dbg_move_parexpn Dbg64_move_parexpn + +#define Dbg_reloc_apply_reg Dbg64_reloc_apply_reg +#define Dbg_reloc_apply_val Dbg64_reloc_apply_val +#define Dbg_reloc_ars_entry Dbg64_reloc_ars_entry +#define Dbg_reloc_copy Dbg64_reloc_copy +#define Dbg_reloc_discard Dbg64_reloc_discard +#define Dbg_reloc_doact Dbg64_reloc_doact +#define Dbg_reloc_doact_title Dbg64_reloc_doact_title +#define Dbg_reloc_dooutrel Dbg64_reloc_dooutrel +#define Dbg_reloc_entry Dbg64_reloc_entry +#define Dbg_reloc_error Dbg64_reloc_error +#define Dbg_reloc_generate Dbg64_reloc_generate +#define Dbg_reloc_in Dbg64_reloc_in +#define Dbg_reloc_ors_entry Dbg64_reloc_ors_entry +#define Dbg_reloc_out Dbg64_reloc_out +#define Dbg_reloc_proc Dbg64_reloc_proc +#define Dbg_reloc_run Dbg64_reloc_run +#define Dbg_reloc_transition Dbg64_reloc_transition +#define Dbg_reloc_sloppycomdat Dbg64_reloc_sloppycomdat + +#define Dbg_sec_added Dbg64_sec_added +#define Dbg_sec_created Dbg64_sec_created +#define Dbg_sec_discarded Dbg64_sec_discarded +#define Dbg_sec_genstr_compress Dbg64_sec_genstr_compress +#define Dbg_sec_group Dbg64_sec_group +#define Dbg_sec_in Dbg64_sec_in +#define Dbg_sec_order_error Dbg64_sec_order_error +#define Dbg_sec_order_list Dbg64_sec_order_list +#define Dbg_sec_strtab Dbg64_sec_strtab +#define Dbg_sec_unsup_strmerge Dbg64_sec_unsup_strmerge + +#define Dbg_seg_desc_entry Dbg64_seg_desc_entry +#define Dbg_seg_entry Dbg64_seg_entry +#define Dbg_seg_list Dbg64_seg_list +#define Dbg_seg_os Dbg64_seg_os +#define Dbg_seg_title Dbg64_seg_title + +#define Dbg_shdr_modified Dbg64_shdr_modified + +#define Dbg_statistics_ar Dbg64_statistics_ar +#define Dbg_statistics_ld Dbg64_statistics_ld + +#define Dbg_support_action Dbg64_support_action +#define Dbg_support_load Dbg64_support_load +#define Dbg_support_req Dbg64_support_req + +#define Dbg_syminfo_entry Dbg64_syminfo_entry +#define Dbg_syminfo_title Dbg64_syminfo_title + +#define Dbg_syms_ar_checking Dbg64_syms_ar_checking +#define Dbg_syms_ar_entry Dbg64_syms_ar_entry +#define Dbg_syms_ar_resolve Dbg64_syms_ar_resolve +#define Dbg_syms_ar_title Dbg64_syms_ar_title +#define Dbg_syms_created Dbg64_syms_created +#define Dbg_syms_discarded Dbg64_syms_discarded +#define Dbg_syms_dlsym Dbg64_syms_dlsym +#define Dbg_syms_dup_sort_addr Dbg64_syms_dup_sort_addr +#define Dbg_syms_entered Dbg64_syms_entered +#define Dbg_syms_entry Dbg64_syms_entry +#define Dbg_syms_global Dbg64_syms_global +#define Dbg_syms_ignore Dbg64_syms_ignore +#define Dbg_syms_ignore_gnuver Dbg64_syms_ignore_gnuver +#define Dbg_syms_lazy_rescan Dbg64_syms_lazy_rescan +#define Dbg_syms_lookup Dbg64_syms_lookup +#define Dbg_syms_new Dbg64_syms_new +#define Dbg_syms_old Dbg64_syms_old +#define Dbg_syms_process Dbg64_syms_process +#define Dbg_syms_reduce Dbg64_syms_reduce +#define Dbg_syms_reloc Dbg64_syms_reloc +#define Dbg_syms_resolved Dbg64_syms_resolved +#define Dbg_syms_resolving Dbg64_syms_resolving +#define Dbg_syms_sec_entry Dbg64_syms_sec_entry +#define Dbg_syms_sec_title Dbg64_syms_sec_title +#define Dbg_syms_spec_title Dbg64_syms_spec_title +#define Dbg_syms_updated Dbg64_syms_updated +#define Dbg_syms_up_title Dbg64_syms_up_title + +#define Dbg_util_broadcast Dbg64_util_broadcast +#define Dbg_util_call_array Dbg64_util_call_array +#define Dbg_util_call_fini Dbg64_util_call_fini +#define Dbg_util_call_init Dbg64_util_call_init +#define Dbg_util_call_main Dbg64_util_call_main +#define Dbg_util_collect Dbg64_util_collect +#define Dbg_util_dbnotify Dbg64_util_dbnotify +#define Dbg_util_edge_in Dbg64_util_edge_in +#define Dbg_util_edge_out Dbg64_util_edge_out +#define Dbg_util_intoolate Dbg64_util_intoolate +#define Dbg_util_lcinterface Dbg64_util_lcinterface +#define Dbg_util_nl Dbg64_util_nl +#define Dbg_util_no_init Dbg64_util_no_init +#define Dbg_util_scc_entry Dbg64_util_scc_entry +#define Dbg_util_scc_title Dbg64_util_scc_title +#define Dbg_util_str Dbg64_util_str +#define Dbg_util_wait Dbg64_util_wait + +#define Dbg_unused_file Dbg64_unused_file +#define Dbg_unused_lcinterface Dbg64_unused_lcinterface +#define Dbg_unused_path Dbg64_unused_path +#define Dbg_unused_sec Dbg64_unused_sec +#define Dbg_unused_unref Dbg64_unused_unref + +#define Dbg_ver_avail_entry Dbg64_ver_avail_entry +#define Dbg_ver_avail_title Dbg64_ver_avail_title +#define Dbg_ver_def_title Dbg64_ver_def_title +#define Dbg_ver_desc_entry Dbg64_ver_desc_entry +#define Dbg_ver_need_entry Dbg64_ver_need_entry +#define Dbg_ver_need_title Dbg64_ver_need_title +#define Dbg_ver_nointerface Dbg64_ver_nointerface +#define Dbg_ver_symbol Dbg64_ver_symbol + +#else + +#define Dbg_demangle_name Dbg32_demangle_name + +#define Dbg_bind_global Dbg32_bind_global +#define Dbg_bind_plt_summary Dbg32_bind_plt_summary +#define Dbg_bind_reject Dbg32_bind_reject +#define Dbg_bind_weak Dbg32_bind_weak + +#define Dbg_cap_val_hw1 Dbg32_cap_val_hw1 +#define Dbg_cap_hw_candidate Dbg32_cap_hw_candidate +#define Dbg_cap_hw_filter Dbg32_cap_hw_filter +#define Dbg_cap_mapfile Dbg32_cap_mapfile +#define Dbg_cap_sec_entry Dbg32_cap_sec_entry +#define Dbg_cap_sec_title Dbg32_cap_sec_title + +#define Dbg_ent_entry Dbg32_ent_entry +#define Dbg_ent_print Dbg32_ent_print + +#define Dbg_file_analyze Dbg32_file_analyze +#define Dbg_file_aout Dbg32_file_aout +#define Dbg_file_ar Dbg32_file_ar +#define Dbg_file_ar_rescan Dbg32_file_ar_rescan +#define Dbg_file_bind_entry Dbg32_file_bind_entry +#define Dbg_file_bindings Dbg32_file_bindings +#define Dbg_file_cleanup Dbg32_file_cleanup +#define Dbg_file_cntl Dbg32_file_cntl +#define Dbg_file_config_dis Dbg32_file_config_dis +#define Dbg_file_config_obj Dbg32_file_config_obj +#define Dbg_file_del_rescan Dbg32_file_del_rescan +#define Dbg_file_delete Dbg32_file_delete +#define Dbg_file_dlclose Dbg32_file_dlclose +#define Dbg_file_dldump Dbg32_file_dldump +#define Dbg_file_dlopen Dbg32_file_dlopen +#define Dbg_file_elf Dbg32_file_elf +#define Dbg_file_filtee Dbg32_file_filtee +#define Dbg_file_filter Dbg32_file_filter +#define Dbg_file_fixname Dbg32_file_fixname +#define Dbg_file_generic Dbg32_file_generic +#define Dbg_file_hdl_action Dbg32_file_hdl_action +#define Dbg_file_hdl_collect Dbg32_file_hdl_collect +#define Dbg_file_hdl_title Dbg32_file_hdl_title +#define Dbg_file_lazyload Dbg32_file_lazyload +#define Dbg_file_ldso Dbg32_file_ldso +#define Dbg_file_mode_promote Dbg32_file_mode_promote +#define Dbg_file_modified Dbg32_file_modified +#define Dbg_file_needed Dbg32_file_needed +#define Dbg_file_output Dbg32_file_output +#define Dbg_file_preload Dbg32_file_preload +#define Dbg_file_prot Dbg32_file_prot +#define Dbg_file_rejected Dbg32_file_rejected +#define Dbg_file_reuse Dbg32_file_reuse +#define Dbg_file_skip Dbg32_file_skip + +#define Dbg_got_display Dbg32_got_display + +#define Dbg_libs_audit Dbg32_libs_audit +#define Dbg_libs_find Dbg32_libs_find +#define Dbg_libs_found Dbg32_libs_found +#define Dbg_libs_ignore Dbg32_libs_ignore +#define Dbg_libs_init Dbg32_libs_init +#define Dbg_libs_l Dbg32_libs_l +#define Dbg_libs_path Dbg32_libs_path +#define Dbg_libs_req Dbg32_libs_req +#define Dbg_libs_update Dbg32_libs_update +#define Dbg_libs_yp Dbg32_libs_yp +#define Dbg_libs_ylu Dbg32_libs_ylu + +#define Dbg_map_dash Dbg32_map_dash +#define Dbg_map_ent Dbg32_map_ent +#define Dbg_map_parse Dbg32_map_parse +#define Dbg_map_pipe Dbg32_map_pipe +#define Dbg_map_seg Dbg32_map_seg +#define Dbg_map_set_atsign Dbg32_map_set_atsign +#define Dbg_map_set_equal Dbg32_map_set_equal +#define Dbg_map_size_new Dbg32_map_size_new +#define Dbg_map_size_old Dbg32_map_size_old +#define Dbg_map_sort_fini Dbg32_map_sort_fini +#define Dbg_map_sort_orig Dbg32_map_sort_orig +#define Dbg_map_symbol Dbg32_map_symbol +#define Dbg_map_version Dbg32_map_version + +#define Dbg_move_adjexpandreloc Dbg32_move_adjexpandreloc +#define Dbg_move_adjmovereloc Dbg32_move_adjmovereloc +#define Dbg_move_data Dbg32_move_data +#define Dbg_move_entry1 Dbg32_move_entry1 +#define Dbg_move_entry2 Dbg32_move_entry2 +#define Dbg_move_expand Dbg32_move_expand +#define Dbg_move_input Dbg32_move_input +#define Dbg_move_outmove Dbg32_move_outmove +#define Dbg_move_outsctadj Dbg32_move_outsctadj +#define Dbg_move_parexpn Dbg32_move_parexpn + +#define Dbg_reloc_apply_reg Dbg32_reloc_apply_reg +#define Dbg_reloc_apply_val Dbg32_reloc_apply_val +#define Dbg_reloc_ars_entry Dbg32_reloc_ars_entry +#define Dbg_reloc_copy Dbg32_reloc_copy +#define Dbg_reloc_discard Dbg32_reloc_discard +#define Dbg_reloc_doact Dbg32_reloc_doact +#define Dbg_reloc_doact_title Dbg32_reloc_doact_title +#define Dbg_reloc_dooutrel Dbg32_reloc_dooutrel +#define Dbg_reloc_entry Dbg32_reloc_entry +#define Dbg_reloc_error Dbg32_reloc_error +#define Dbg_reloc_generate Dbg32_reloc_generate +#define Dbg_reloc_in Dbg32_reloc_in +#define Dbg_reloc_ors_entry Dbg32_reloc_ors_entry +#define Dbg_reloc_out Dbg32_reloc_out +#define Dbg_reloc_proc Dbg32_reloc_proc +#define Dbg_reloc_run Dbg32_reloc_run +#define Dbg_reloc_transition Dbg32_reloc_transition +#define Dbg_reloc_sloppycomdat Dbg32_reloc_sloppycomdat + +#define Dbg_sec_added Dbg32_sec_added +#define Dbg_sec_created Dbg32_sec_created +#define Dbg_sec_discarded Dbg32_sec_discarded +#define Dbg_sec_genstr_compress Dbg32_sec_genstr_compress +#define Dbg_sec_group Dbg32_sec_group +#define Dbg_sec_in Dbg32_sec_in +#define Dbg_sec_order_error Dbg32_sec_order_error +#define Dbg_sec_order_list Dbg32_sec_order_list +#define Dbg_sec_strtab Dbg32_sec_strtab +#define Dbg_sec_unsup_strmerge Dbg32_sec_unsup_strmerge + +#define Dbg_seg_desc_entry Dbg32_seg_desc_entry +#define Dbg_seg_entry Dbg32_seg_entry +#define Dbg_seg_list Dbg32_seg_list +#define Dbg_seg_os Dbg32_seg_os +#define Dbg_seg_title Dbg32_seg_title + +#define Dbg_shdr_modified Dbg32_shdr_modified + +#define Dbg_statistics_ar Dbg32_statistics_ar +#define Dbg_statistics_ld Dbg32_statistics_ld + +#define Dbg_support_action Dbg32_support_action +#define Dbg_support_load Dbg32_support_load +#define Dbg_support_req Dbg32_support_req + +#define Dbg_syminfo_entry Dbg32_syminfo_entry +#define Dbg_syminfo_title Dbg32_syminfo_title + +#define Dbg_syms_ar_checking Dbg32_syms_ar_checking +#define Dbg_syms_ar_entry Dbg32_syms_ar_entry +#define Dbg_syms_ar_resolve Dbg32_syms_ar_resolve +#define Dbg_syms_ar_title Dbg32_syms_ar_title +#define Dbg_syms_created Dbg32_syms_created +#define Dbg_syms_discarded Dbg32_syms_discarded +#define Dbg_syms_dlsym Dbg32_syms_dlsym +#define Dbg_syms_dup_sort_addr Dbg32_syms_dup_sort_addr +#define Dbg_syms_entered Dbg32_syms_entered +#define Dbg_syms_entry Dbg32_syms_entry +#define Dbg_syms_global Dbg32_syms_global +#define Dbg_syms_ignore Dbg32_syms_ignore +#define Dbg_syms_ignore_gnuver Dbg32_syms_ignore_gnuver +#define Dbg_syms_lazy_rescan Dbg32_syms_lazy_rescan +#define Dbg_syms_lookup Dbg32_syms_lookup +#define Dbg_syms_lookup_aout Dbg32_syms_lookup_aout +#define Dbg_syms_new Dbg32_syms_new +#define Dbg_syms_old Dbg32_syms_old +#define Dbg_syms_process Dbg32_syms_process +#define Dbg_syms_reduce Dbg32_syms_reduce +#define Dbg_syms_reloc Dbg32_syms_reloc +#define Dbg_syms_resolved Dbg32_syms_resolved +#define Dbg_syms_resolving Dbg32_syms_resolving +#define Dbg_syms_sec_entry Dbg32_syms_sec_entry +#define Dbg_syms_sec_title Dbg32_syms_sec_title +#define Dbg_syms_spec_title Dbg32_syms_spec_title +#define Dbg_syms_updated Dbg32_syms_updated +#define Dbg_syms_up_title Dbg32_syms_up_title + +#define Dbg_util_broadcast Dbg32_util_broadcast +#define Dbg_util_call_array Dbg32_util_call_array +#define Dbg_util_call_fini Dbg32_util_call_fini +#define Dbg_util_call_init Dbg32_util_call_init +#define Dbg_util_call_main Dbg32_util_call_main +#define Dbg_util_collect Dbg32_util_collect +#define Dbg_util_dbnotify Dbg32_util_dbnotify +#define Dbg_util_edge_in Dbg32_util_edge_in +#define Dbg_util_edge_out Dbg32_util_edge_out +#define Dbg_util_intoolate Dbg32_util_intoolate +#define Dbg_util_lcinterface Dbg32_util_lcinterface +#define Dbg_util_nl Dbg32_util_nl +#define Dbg_util_no_init Dbg32_util_no_init +#define Dbg_util_scc_entry Dbg32_util_scc_entry +#define Dbg_util_scc_title Dbg32_util_scc_title +#define Dbg_util_str Dbg32_util_str +#define Dbg_util_wait Dbg32_util_wait + +#define Dbg_unused_file Dbg32_unused_file +#define Dbg_unused_lcinterface Dbg32_unused_lcinterface +#define Dbg_unused_path Dbg32_unused_path +#define Dbg_unused_sec Dbg32_unused_sec +#define Dbg_unused_unref Dbg32_unused_unref + +#define Dbg_ver_avail_entry Dbg32_ver_avail_entry +#define Dbg_ver_avail_title Dbg32_ver_avail_title +#define Dbg_ver_def_title Dbg32_ver_def_title +#define Dbg_ver_desc_entry Dbg32_ver_desc_entry +#define Dbg_ver_need_entry Dbg32_ver_need_entry +#define Dbg_ver_need_title Dbg32_ver_need_title +#define Dbg_ver_nointerface Dbg32_ver_nointerface +#define Dbg_ver_symbol Dbg32_ver_symbol + +#endif + +/* + * External Dbg_*() interface routines. + */ +extern void Dbg_args_files(Lm_list *, int, char *); +extern void Dbg_args_flags(Lm_list *, int, int); +extern void Dbg_audit_ignore(Rt_map *); +extern void Dbg_audit_interface(Lm_list *, const char *, const char *); +extern void Dbg_audit_lib(Lm_list *, const char *); +extern void Dbg_audit_object(Lm_list *, const char *, const char *); +extern void Dbg_audit_symval(Lm_list *, const char *, const char *, + const char *, Addr, Addr); +extern void Dbg_audit_skip(Lm_list *, const char *, const char *); +extern void Dbg_audit_terminate(Lm_list *, const char *); +extern void Dbg_audit_version(Lm_list *, const char *, ulong_t); + +extern void Dbg_bind_global(Rt_map *, Addr, Off, Xword, Pltbindtype, + Rt_map *, Addr, Off, const char *, uint_t); +extern void Dbg_bind_plt_summary(Lm_list *, Half, Word, Word, Word, Word, + Word, Word); +#if defined(_ELF64) +extern void Dbg_bind_pltpad_from(Rt_map *, Addr, const char *); +extern void Dbg_bind_pltpad_to(Rt_map *, Addr, const char *, const char *); +#endif +extern void Dbg_bind_reject(Rt_map *, Rt_map *, const char *, int); +extern void Dbg_bind_weak(Rt_map *, Addr, Addr, const char *); + +extern void Dbg_cap_hw_candidate(Lm_list *, const char *); +extern void Dbg_cap_hw_filter(Lm_list *, const char *, Rt_map *); +extern void Dbg_cap_mapfile(Lm_list *, Xword, Xword, Half); +extern void Dbg_cap_sec_entry(Lm_list *, uint_t, Xword, Xword, Half); +extern void Dbg_cap_sec_title(Ofl_desc *); +extern void Dbg_cap_val_hw1(Lm_list *, Xword, Half); + +extern const char * + Dbg_demangle_name(const char *); + +extern void Dbg_ent_entry(Lm_list *, Half, Ent_desc *); +extern void Dbg_ent_print(Lm_list *, Half, List *, Boolean); + +extern void Dbg_file_analyze(Rt_map *); +extern void Dbg_file_aout(Lm_list *, const char *, ulong_t, ulong_t, + ulong_t, const char *, Aliste); +extern void Dbg_file_ar(Lm_list *, const char *, int); +extern void Dbg_file_ar_rescan(Lm_list *); +extern void Dbg_file_bind_entry(Lm_list *, Bnd_desc *); +extern void Dbg_file_bindings(Rt_map *, int); +extern void Dbg_file_cleanup(Lm_list *, const char *, Aliste); +extern void Dbg_file_cntl(Lm_list *, Aliste, Aliste); +extern void Dbg_file_config_dis(Lm_list *, const char *, int); +extern void Dbg_file_config_obj(Lm_list *, const char *, const char *, + const char *); +extern void Dbg_file_del_rescan(Lm_list *); +extern void Dbg_file_delete(Rt_map *); +extern void Dbg_file_dlclose(Lm_list *, const char *, int); +extern void Dbg_file_dldump(Rt_map *, const char *, int); +extern void Dbg_file_dlopen(Rt_map *, const char *, int *, int); +extern void Dbg_file_elf(Lm_list *, const char *, ulong_t, ulong_t, + ulong_t, ulong_t, const char *, Aliste); +extern void Dbg_file_filtee(Lm_list *, const char *, const char *, int); +extern void Dbg_file_filter(Lm_list *, const char *, const char *, int); +extern void Dbg_file_fixname(Lm_list *, const char *, const char *); +extern void Dbg_file_generic(Lm_list *, Ifl_desc *); +extern void Dbg_file_hdl_action(Grp_hdl *, Rt_map *, int, uint_t); +extern void Dbg_file_hdl_collect(Grp_hdl *, const char *); +extern void Dbg_file_hdl_title(int); +extern void Dbg_file_lazyload(Rt_map *, const char *, const char *); +extern void Dbg_file_ldso(Rt_map *, char **, auxv_t *, const char *, + Aliste); +extern void Dbg_file_mode_promote(Rt_map *, int); +extern void Dbg_file_modified(Lm_list *, const char *, const char *, + const char *, int, int, Elf *, Elf *); +extern void Dbg_file_needed(Rt_map *, const char *); +extern void Dbg_file_output(Ofl_desc *); +extern void Dbg_file_preload(Lm_list *, const char *); +extern void Dbg_file_prot(Rt_map *, int); +extern void Dbg_file_rejected(Lm_list *, Rej_desc *, Half mach); +extern void Dbg_file_reuse(Lm_list *, const char *, const char *); +extern void Dbg_file_skip(Lm_list *, const char *, const char *); + +extern void Dbg_got_display(Ofl_desc *, Off, int, Word, size_t); + +extern void Dbg_libs_audit(Lm_list *, const char *, const char *); +extern void Dbg_libs_find(Lm_list *, const char *); +extern void Dbg_libs_found(Lm_list *, const char *, int); +extern void Dbg_libs_ignore(Lm_list *, const char *); +extern void Dbg_libs_init(Lm_list *, List *, List *); +extern void Dbg_libs_l(Lm_list *, const char *, const char *); +extern void Dbg_libs_path(Lm_list *, const char *, uint_t, const char *); +extern void Dbg_libs_req(Lm_list *, const char *, const char *, + const char *); +extern void Dbg_libs_update(Lm_list *, List *, List *); +extern void Dbg_libs_yp(Lm_list *, const char *); +extern void Dbg_libs_ylu(Lm_list *, const char *, const char *, int); + +extern void Dbg_map_dash(Lm_list *, const char *, Sdf_desc *); +extern void Dbg_map_ent(Lm_list *, Boolean, Ent_desc *, Ofl_desc *); +extern void Dbg_map_parse(Lm_list *, const char *); +extern void Dbg_map_pipe(Lm_list *, Sg_desc *, const char *, const Word); +extern void Dbg_map_seg(Ofl_desc *, int, Sg_desc *); +extern void Dbg_map_set_atsign(Boolean); +extern void Dbg_map_set_equal(Boolean); +extern void Dbg_map_size_new(Lm_list *, const char *); +extern void Dbg_map_size_old(Ofl_desc *, Sym_desc *); +extern void Dbg_map_sort_fini(Lm_list *, Sg_desc *); +extern void Dbg_map_sort_orig(Lm_list *, Sg_desc *); +extern void Dbg_map_symbol(Ofl_desc *, Sym_desc *); +extern void Dbg_map_version(Lm_list *, const char *, const char *, int); + +extern void Dbg_move_adjexpandreloc(Lm_list *, Xword, const char *); +extern void Dbg_move_adjmovereloc(Lm_list *, Xword, Xword, const char *); +extern void Dbg_move_data(Rt_map *); +extern void Dbg_move_entry1(Lm_list *, int, Move *, Sym_desc *); +extern void Dbg_move_entry2(Lm_list *, Move *, Word, const char *); +extern void Dbg_move_expand(Lm_list *, Move *, Addr); +extern void Dbg_move_input(Lm_list *, const char *); +extern void Dbg_move_outmove(Lm_list *, const char *); +extern void Dbg_move_outsctadj(Lm_list *, Sym_desc *); +extern void Dbg_move_parexpn(Lm_list *, const char *, const char *); + +extern void Dbg_reloc_apply_reg(Lm_list *, int, Half, Xword, Xword); +extern void Dbg_reloc_apply_val(Lm_list *, int, Xword, Xword); +extern void Dbg_reloc_ars_entry(Lm_list *, int, Word, Half, Rel_desc *); +extern void Dbg_reloc_copy(Rt_map *, Rt_map *, const char *, int); +extern void Dbg_reloc_discard(Lm_list *, Half, Rel_desc *); +extern void Dbg_reloc_doact(Lm_list *, int, Half, Word, Word, Xword, Xword, + const char *, Os_desc *); +extern void Dbg_reloc_doact_title(Lm_list *); +extern void Dbg_reloc_dooutrel(Lm_list *, Word); +extern void Dbg_reloc_entry(Lm_list *, const char *, Half, Word, void *, + const char *, const char *, const char *); +extern void Dbg_reloc_error(Lm_list *, int, Half, Word, void *, + const char *); +extern void Dbg_reloc_generate(Lm_list *, Os_desc *, Word); +extern void Dbg_reloc_in(Lm_list *, int, Half, Word, void *, const char *, + const char *); +extern void Dbg_reloc_ors_entry(Lm_list *, int, Word, Half, Rel_desc *); +extern void Dbg_reloc_out(Ofl_desc *, int, Word, void *, const char *, + const char *); +extern void Dbg_reloc_proc(Lm_list *, Os_desc *, Is_desc *, Is_desc *); +extern void Dbg_reloc_run(Rt_map *, uint_t, int, int); +extern void Dbg_reloc_transition(Lm_list *, Half, Word, Rel_desc *); +extern void Dbg_reloc_sloppycomdat(Lm_list *, const char *, Sym_desc *); + +extern void Dbg_sec_added(Lm_list *, Os_desc *, Sg_desc *); +extern void Dbg_sec_created(Lm_list *, Os_desc *, Sg_desc *); +extern void Dbg_sec_discarded(Lm_list *, Is_desc *, Is_desc *); +extern void Dbg_sec_genstr_compress(Lm_list *, const char *, + Xword, Xword); +extern void Dbg_sec_group(Lm_list *, Is_desc *, Group_desc *); +extern void Dbg_sec_in(Lm_list *, Is_desc *); +extern void Dbg_sec_order_error(Lm_list *, Ifl_desc *, Word, int); +extern void Dbg_sec_order_list(Ofl_desc *, int); +extern void Dbg_sec_strtab(Lm_list *, Os_desc *, Str_tbl *); +extern void Dbg_sec_unsup_strmerge(Lm_list *, Is_desc *); + +extern void Dbg_seg_desc_entry(Lm_list *, Half, int, Sg_desc *); +extern void Dbg_seg_entry(Ofl_desc *, int, Sg_desc *); +extern void Dbg_seg_list(Lm_list *, Half, List *); +extern void Dbg_seg_os(Ofl_desc *, Os_desc *, int); +extern void Dbg_seg_title(Lm_list *); + +extern void Dbg_shdr_modified(Lm_list *, const char *, Half, Shdr *, Shdr *, + const char *); + +extern void Dbg_statistics_ar(Ofl_desc *); +extern void Dbg_statistics_ld(Ofl_desc *); + +extern void Dbg_support_action(Lm_list *, const char *, const char *, + Support_ndx, const char *); +extern void Dbg_support_load(Lm_list *, const char *, const char *); +extern void Dbg_support_req(Lm_list *, const char *, int); + +extern void Dbg_syminfo_entry(Lm_list *, Word, Syminfo *, Sym *, + const char *, Dyn *); +extern void Dbg_syminfo_title(Lm_list *); + +extern void Dbg_syms_ar_checking(Lm_list *, Xword, Elf_Arsym *, + const char *); +extern void Dbg_syms_ar_entry(Lm_list *, Xword, Elf_Arsym *); +extern void Dbg_syms_ar_resolve(Lm_list *, Xword, Elf_Arsym *, + const char *, int); +extern void Dbg_syms_ar_title(Lm_list *, const char *, int); +extern void Dbg_syms_created(Lm_list *, const char *); +extern void Dbg_syms_discarded(Lm_list *, Sym_desc *); +extern void Dbg_syms_dlsym(Rt_map *, const char *, int *, const char *, + int); +extern void Dbg_syms_dup_sort_addr(Lm_list *, const char *, const char *, + const char *, Addr); +extern void Dbg_syms_entered(Ofl_desc *, Sym *, Sym_desc *); +extern void Dbg_syms_entry(Lm_list *, Word, Sym_desc *); +extern void Dbg_syms_global(Lm_list *, Word, const char *); +extern void Dbg_syms_ignore(Ofl_desc *, Sym_desc *); +extern void Dbg_syms_ignore_gnuver(Rt_map *, const char *, Word, Versym); +extern void Dbg_syms_lazy_rescan(Lm_list *, const char *); +extern void Dbg_syms_lookup(Rt_map *, const char *, const char *); +#if !(defined(_ELF64)) +extern void Dbg_syms_lookup_aout(Lm_list *, const char *); +#endif +extern void Dbg_syms_new(Ofl_desc *, Sym *, Sym_desc *); +extern void Dbg_syms_old(Ofl_desc *, Sym_desc *); +extern void Dbg_syms_process(Lm_list *, Ifl_desc *); +extern void Dbg_syms_reduce(Ofl_desc *, int, Sym_desc *, int, + const char *); +extern void Dbg_syms_reloc(Ofl_desc *, Sym_desc *); +extern void Dbg_syms_resolved(Ofl_desc *, Sym_desc *); +extern void Dbg_syms_resolving(Ofl_desc *, Word, const char *, int, int, + Sym *, Sym *, Sym_desc *, Ifl_desc *); +extern void Dbg_syms_sec_entry(Lm_list *, Word, Sg_desc *, Os_desc *); +extern void Dbg_syms_sec_title(Lm_list *); +extern void Dbg_syms_spec_title(Lm_list *); +extern void Dbg_syms_updated(Ofl_desc *, Sym_desc *, const char *); +extern void Dbg_syms_up_title(Lm_list *); + +extern void Dbg_tls_modactivity(Lm_list *, void *, uint_t); +extern void Dbg_tls_static_block(Lm_list *, void *, ulong_t, ulong_t); +extern void Dbg_tls_static_resv(Rt_map *, ulong_t, ulong_t); + +extern void Dbg_util_broadcast(Rt_map *); +extern void Dbg_util_call_array(Rt_map *, void *, int, Word); +extern void Dbg_util_call_fini(Rt_map *); +extern void Dbg_util_call_init(Rt_map *, int); +extern void Dbg_util_call_main(Rt_map *); +extern void Dbg_util_collect(Rt_map *, int, int); +extern void Dbg_util_dbnotify(Lm_list *, rd_event_e, r_state_e); +extern void Dbg_util_edge_in(Lm_list *, Rt_map *, uint_t, Rt_map *, + int, int); +extern void Dbg_util_edge_out(Rt_map *, Rt_map *); +extern void Dbg_util_intoolate(Rt_map *); +extern void Dbg_util_lcinterface(Rt_map *, int, char *); +extern void Dbg_util_nl(Lm_list *, int); +extern void Dbg_util_no_init(Rt_map *); +extern void Dbg_util_str(Lm_list *, const char *); +extern void Dbg_util_scc_entry(Rt_map *, uint_t); +extern void Dbg_util_scc_title(Lm_list *, int); +extern void Dbg_util_wait(Rt_map *, Rt_map *, int); + +extern void Dbg_unused_file(Lm_list *, const char *, int, uint_t); +extern void Dbg_unused_lcinterface(Rt_map *, Rt_map *, int); +extern void Dbg_unused_path(Lm_list *, const char *, uint_t, uint_t, + const char *); +extern void Dbg_unused_sec(Lm_list *, Is_desc *); +extern void Dbg_unused_unref(Rt_map *, const char *); + +extern void Dbg_ver_avail_entry(Lm_list *, Ver_index *, const char *); +extern void Dbg_ver_avail_title(Lm_list *, const char *); +extern void Dbg_ver_def_title(Lm_list *, const char *); +extern void Dbg_ver_desc_entry(Lm_list *, Ver_desc *); +extern void Dbg_ver_need_entry(Lm_list *, Half, const char *, + const char *); +extern void Dbg_ver_need_title(Lm_list *, const char *); +extern void Dbg_ver_nointerface(Lm_list *, const char *); +extern void Dbg_ver_symbol(Lm_list *, const char *); + +/* + * Define Elf_*() interface flags. + */ +#define ELF_DBG_ELFDUMP 1 +#define ELF_DBG_RTLD 2 +#define ELF_DBG_LD 3 + +/* + * Define generic Elf_*() interfaces. + */ +extern void Elf_syminfo_entry(Lm_list *, Word, Syminfo *, const char *, + const char *); +extern void Elf_syminfo_title(Lm_list *); + +/* + * Establish ELF32 and ELF64 class Elf_*() interfaces. + */ +#if defined(_ELF64) + +#define Elf_cap_entry Elf64_cap_entry +#define Elf_cap_title Elf64_cap_title + +#define Elf_demangle_name Elf64_demangle_name +#define Elf_dyn_entry Elf64_dyn_entry +#define Elf_dyn_null_entry Elf64_dyn_null_entry +#define Elf_dyn_title Elf64_dyn_title + +#define Elf_ehdr Elf64_ehdr + +#define Elf_got_entry Elf64_got_entry +#define Elf_got_title Elf64_got_title + +#define Elf_reloc_apply_reg Elf64_reloc_apply_reg +#define Elf_reloc_apply_val Elf64_reloc_apply_val +#define Elf_reloc_entry_1 Elf64_reloc_entry_1 +#define Elf_reloc_entry_2 Elf64_reloc_entry_2 +#define Elf_reloc_title Elf64_reloc_title + +#define Elf_phdr Elf64_phdr + +#define Elf_shdr Elf64_shdr + +#define Elf_syms_table_entry Elf64_syms_table_entry +#define Elf_syms_table_title Elf64_syms_table_title + +#define Elf_ver_def_title Elf64_ver_def_title +#define Elf_ver_line_1 Elf64_ver_line_1 +#define Elf_ver_line_2 Elf64_ver_line_2 +#define Elf_ver_line_3 Elf64_ver_line_3 +#define Elf_ver_line_4 Elf64_ver_line_4 +#define Elf_ver_line_5 Elf64_ver_line_5 +#define Elf_ver_need_title Elf64_ver_need_title + +#else + +#define Elf_cap_entry Elf32_cap_entry +#define Elf_cap_title Elf32_cap_title + +#define Elf_demangle_name Elf32_demangle_name +#define Elf_dyn_entry Elf32_dyn_entry +#define Elf_dyn_null_entry Elf32_dyn_null_entry +#define Elf_dyn_title Elf32_dyn_title + +#define Elf_ehdr Elf32_ehdr + +#define Elf_got_entry Elf32_got_entry +#define Elf_got_title Elf32_got_title + +#define Elf_reloc_apply_reg Elf32_reloc_apply_reg +#define Elf_reloc_apply_val Elf32_reloc_apply_val +#define Elf_reloc_entry_1 Elf32_reloc_entry_1 +#define Elf_reloc_entry_2 Elf32_reloc_entry_2 +#define Elf_reloc_title Elf32_reloc_title + +#define Elf_phdr Elf32_phdr + +#define Elf_shdr Elf32_shdr + +#define Elf_syms_table_entry Elf32_syms_table_entry +#define Elf_syms_table_title Elf32_syms_table_title + +#define Elf_ver_def_title Elf32_ver_def_title +#define Elf_ver_line_1 Elf32_ver_line_1 +#define Elf_ver_line_2 Elf32_ver_line_2 +#define Elf_ver_line_3 Elf32_ver_line_3 +#define Elf_ver_line_4 Elf32_ver_line_4 +#define Elf_ver_line_5 Elf32_ver_line_5 +#define Elf_ver_need_title Elf32_ver_need_title + +#endif + +extern void Elf_cap_entry(Lm_list *, Cap *, int, Half); +extern void Elf_cap_title(Lm_list *); + +extern const char \ + *Elf_demangle_name(const char *); +extern void Elf_dyn_entry(Lm_list *, Dyn *, int, const char *, Half); +extern void Elf_dyn_null_entry(Lm_list *, Dyn *, int, int); +extern void Elf_dyn_title(Lm_list *); + +extern void Elf_ehdr(Lm_list *, Ehdr *, Shdr *); + +extern void Elf_got_entry(Lm_list *, Sword, Addr, Xword, Half, + uchar_t, uchar_t, Word, void *, const char *); +extern void Elf_got_title(Lm_list *); + +extern void Elf_phdr(Lm_list *, Half, Phdr *); + +extern void Elf_reloc_apply_val(Lm_list *, int, Xword, Xword); +extern void Elf_reloc_apply_reg(Lm_list *, int, Half, Xword, Xword); +extern void Elf_reloc_entry_1(Lm_list *, int, const char *, Half, Word, + void *, const char *, const char *, const char *); +extern void Elf_reloc_entry_2(Lm_list *, int, const char *, Word, + const char *, Off, Sxword, const char *, const char *, + const char *); +extern void Elf_reloc_title(Lm_list *, int, Word); + +extern void Elf_shdr(Lm_list *, Half, Shdr *); + +extern void Elf_syms_table_entry(Lm_list *, int, const char *, Half, Sym *, + Versym, int, const char *, const char *); +extern void Elf_syms_table_title(Lm_list *, int); + +extern void Elf_ver_def_title(Lm_list *); +extern void Elf_ver_line_1(Lm_list *, const char *, const char *, + const char *, const char *); +extern void Elf_ver_line_2(Lm_list *, const char *, const char *); +extern void Elf_ver_line_3(Lm_list *, const char *, const char *, + const char *); +extern void Elf_ver_line_4(Lm_list *, const char *); +extern void Elf_ver_line_5(Lm_list *, const char *, const char *); +extern void Elf_ver_need_title(Lm_list *, int); + + +#ifdef __cplusplus +} +#endif + +#endif /* _DEBUG_H */ diff --git a/cmd/sgs/include/sgs.h b/cmd/sgs/include/sgs.h new file mode 100644 index 000000000000..34669cf60b3a --- /dev/null +++ b/cmd/sgs/include/sgs.h @@ -0,0 +1,296 @@ +/* + * CDDL HEADER START + * + * The contents of this file are subject to the terms of the + * Common Development and Distribution License (the "License"). + * You may not use this file except in compliance with the License. + * + * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE + * or http://www.opensolaris.org/os/licensing. + * See the License for the specific language governing permissions + * and limitations under the License. + * + * When distributing Covered Code, include this CDDL HEADER in each + * file and include the License file at usr/src/OPENSOLARIS.LICENSE. + * If applicable, add the following below this CDDL HEADER, with the + * fields enclosed by brackets "[]" replaced with your own identifying + * information: Portions Copyright [yyyy] [name of copyright owner] + * + * CDDL HEADER END + */ + +/* + * Copyright (c) 1988 AT&T + * All Rights Reserved + * + * + * Copyright 2008 Sun Microsystems, Inc. All rights reserved. + * Use is subject to license terms. + * + * Global include file for all sgs. + */ + +#ifndef _SGS_H +#define _SGS_H + +#pragma ident "%Z%%M% %I% %E% SMI" + +#ifdef __cplusplus +extern "C" { +#endif + +/* <assert.h> keys off of NDEBUG */ +#ifdef DEBUG +#undef NDEBUG +#else +#define NDEBUG +#endif + +#ifndef _ASM +#include <sys/types.h> +#if defined(sun) +#include <sys/machelf.h> +#else +#include <elf.h> +#endif +#include <stdlib.h> +#include <libelf.h> +#include <assert.h> +#include <alist.h> +#endif /* _ASM */ + +/* + * Software identification. + */ +#define SGS "" +#define SGU_PKG "Software Generation Utilities" +#define SGU_REL "(SGU) Solaris-ELF (4.0)" + + +#ifndef _ASM + +/* + * link_ver_string[] contains a version string for use by the link-editor + * and all other linker components. It is found in libconv, and is + * generated by sgs/libconv/common/bld_vernote.ksh. That script produces + * libconv/{plat}/vernote.s, which is in turn assembled/linked into + * libconv. + */ +extern const char link_ver_string[]; +/* + * Macro to round to next double word boundary. + */ +#define S_DROUND(x) (((x) + sizeof (double) - 1) & ~(sizeof (double) - 1)) + +/* + * General align and round macros. + */ +#define S_ALIGN(x, a) ((x) & ~(((a) ? (a) : 1) - 1)) +#define S_ROUND(x, a) ((x) + (((a) ? (a) : 1) - 1) & ~(((a) ? (a) : 1) - 1)) + +/* + * Bit manipulation macros; generic bit mask and is `v' in the range + * supportable in `n' bits? + */ +#define S_MASK(n) ((1 << (n)) -1) +#define S_INRANGE(v, n) (((-(1 << (n)) - 1) < (v)) && ((v) < (1 << (n)))) + + +/* + * Yet another definition of the OFFSETOF macro, used with the AVL routines. + */ +#define SGSOFFSETOF(s, m) ((size_t)(&(((s *)0)->m))) + +/* + * When casting between integer and pointer types, gcc will complain + * if the integer type used is not large enough to hold the pointer + * value without loss. Although a dubious practice in general, this + * is sometimes done by design. In those cases, the general solution + * is to introduce an intermediate cast to widen the integer value. The + * CAST_PTRINT macro does this, and its use documents the fact that + * the programmer is doing that sort of cast. + */ +#ifdef __GNUC__ +#define CAST_PTRINT(cast, value) ((cast)(uintptr_t)value) +#else +#define CAST_PTRINT(cast, value) ((cast)value) +#endif + +/* + * General typedefs. + */ +typedef enum { + FALSE = 0, + TRUE = 1 +} Boolean; + +/* + * Types of errors (used by eprintf()), together with a generic error return + * value. + */ +typedef enum { + ERR_NONE, + ERR_WARNING, + ERR_FATAL, + ERR_ELF, + ERR_NUM /* Must be last */ +} Error; + +#if defined(_LP64) && !defined(_ELF64) +#define S_ERROR (~(uint_t)0) +#else +#define S_ERROR (~(uintptr_t)0) +#endif + +/* + * LIST_TRAVERSE() is used as the only "argument" of a "for" loop to + * traverse a linked list. The node pointer `node' is set to each node in + * turn and the corresponding data pointer is copied to `data'. The macro + * is used as in + * for (LIST_TRAVERSE(List *list, Listnode *node, void *data)) { + * process(data); + * } + */ +#define LIST_TRAVERSE(L, N, D) \ + (void) (((N) = (L)->head) != NULL && ((D) = (N)->data) != NULL); \ + (N) != NULL; \ + (void) (((N) = (N)->next) != NULL && ((D) = (N)->data) != NULL) + +typedef struct listnode Listnode; +typedef struct list List; + +struct listnode { /* a node on a linked list */ + void *data; /* the data item */ + Listnode *next; /* the next element */ +}; + +struct list { /* a linked list */ + Listnode *head; /* the first element */ + Listnode *tail; /* the last element */ +}; + + +#ifdef _SYSCALL32 +typedef struct listnode32 Listnode32; +typedef struct list32 List32; + +struct listnode32 { /* a node on a linked list */ + Elf32_Addr data; /* the data item */ + Elf32_Addr next; /* the next element */ +}; + +struct list32 { /* a linked list */ + Elf32_Addr head; /* the first element */ + Elf32_Addr tail; /* the last element */ +}; +#endif /* _SYSCALL32 */ + + +/* + * Structure to maintain rejected files elf information. Files that are not + * applicable to the present link-edit are rejected and a search for an + * appropriate file may be resumed. The first rejected files information is + * retained so that a better error diagnostic can be given should an appropriate + * file not be located. + */ +typedef struct { + ushort_t rej_type; /* SGS_REJ_ value */ + ushort_t rej_flag; /* additional information */ + uint_t rej_info; /* numeric and string information */ + const char *rej_str; /* associated with error */ + const char *rej_name; /* object name - expanded library */ + /* name and archive members */ +} Rej_desc; + +#define SGS_REJ_NONE 0 +#define SGS_REJ_MACH 1 /* wrong ELF machine type */ +#define SGS_REJ_CLASS 2 /* wrong ELF class (32-bit/64-bit) */ +#define SGS_REJ_DATA 3 /* wrong ELF data format (MSG/LSB) */ +#define SGS_REJ_TYPE 4 /* bad ELF type */ +#define SGS_REJ_BADFLAG 5 /* bad ELF flags value */ +#define SGS_REJ_MISFLAG 6 /* mismatched ELF flags value */ +#define SGS_REJ_VERSION 7 /* mismatched ELF/lib version */ +#define SGS_REJ_HAL 8 /* HAL R1 extensions required */ +#define SGS_REJ_US3 9 /* Sun UltraSPARC III extensions */ + /* required */ +#define SGS_REJ_STR 10 /* generic error - info is a string */ +#define SGS_REJ_UNKFILE 11 /* unknown file type */ +#define SGS_REJ_HWCAP_1 12 /* hardware capabilities mismatch */ + +/* + * For those source files used both inside and outside of the + * libld source base (tools/common/string_table.c) we can + * automatically switch between the allocation models + * based off of the 'cc -DUSE_LIBLD_MALLOC' flag. + */ +#ifdef USE_LIBLD_MALLOC +#define calloc(x, a) libld_malloc(((size_t)x) * ((size_t)a)) +#define free libld_free +#define malloc libld_malloc +#define realloc libld_realloc + +#define libld_calloc(x, a) libld_malloc(((size_t)x) * ((size_t)a)) +extern void libld_free(void *); +extern void *libld_malloc(size_t); +extern void *libld_realloc(void *, size_t); +#endif + + +/* + * Data structures (defined in libld.h). + */ +typedef struct ent_desc Ent_desc; +typedef struct group_desc Group_desc; +typedef struct ifl_desc Ifl_desc; +typedef struct is_desc Is_desc; +typedef struct isa_desc Isa_desc; +typedef struct isa_opt Isa_opt; +typedef struct mv_desc Mv_desc; +typedef struct ofl_desc Ofl_desc; +typedef struct os_desc Os_desc; +typedef struct rel_cache Rel_cache; +typedef struct sdf_desc Sdf_desc; +typedef struct sdv_desc Sdv_desc; +typedef struct sg_desc Sg_desc; +typedef struct sort_desc Sort_desc; +typedef struct sec_order Sec_order; +typedef struct sym_desc Sym_desc; +typedef struct sym_aux Sym_aux; +typedef struct sym_avlnode Sym_avlnode; +typedef struct uts_desc Uts_desc; +typedef struct ver_desc Ver_desc; +typedef struct ver_index Ver_index; +typedef struct audit_desc Audit_desc; +typedef struct audit_info Audit_info; +typedef struct audit_list Audit_list; + +/* + * Data structures defined in machrel.h. + */ +typedef struct rel_desc Rel_desc; + +/* + * Data structures defined in rtld.h. + */ +typedef struct lm_list Lm_list; +#ifdef _SYSCALL32 +typedef struct lm_list32 Lm_list32; +#endif /* _SYSCALL32 */ + +/* + * For the various utilities that include sgs.h + */ +extern int assfail(const char *, const char *, int); +extern void eprintf(Lm_list *, Error, const char *, ...); +extern char *sgs_demangle(char *); +extern uint_t sgs_str_hash(const char *); +extern uint_t findprime(uint_t); + +#endif /* _ASM */ + +#ifdef __cplusplus +} +#endif + + +#endif /* _SGS_H */ diff --git a/cmd/sgs/include/string_table.h b/cmd/sgs/include/string_table.h new file mode 100644 index 000000000000..e42f81779f17 --- /dev/null +++ b/cmd/sgs/include/string_table.h @@ -0,0 +1,63 @@ +/* + * CDDL HEADER START + * + * The contents of this file are subject to the terms of the + * Common Development and Distribution License (the "License"). + * You may not use this file except in compliance with the License. + * + * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE + * or http://www.opensolaris.org/os/licensing. + * See the License for the specific language governing permissions + * and limitations under the License. + * + * When distributing Covered Code, include this CDDL HEADER in each + * file and include the License file at usr/src/OPENSOLARIS.LICENSE. + * If applicable, add the following below this CDDL HEADER, with the + * fields enclosed by brackets "[]" replaced with your own identifying + * information: Portions Copyright [yyyy] [name of copyright owner] + * + * CDDL HEADER END + */ +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved. + * Use is subject to license terms. + */ + +#ifndef _STRING_TABLE_DOT_H +#define _STRING_TABLE_DOT_H + +#pragma ident "%Z%%M% %I% %E% SMI" + +#include <sys/types.h> + +#ifdef __cplusplus +extern "C" { +#endif + +/* + * Exported, opaque string table handle. + */ +typedef struct str_tbl Str_tbl; + +/* + * Exported string table functions. + */ +extern int st_delstring(Str_tbl *, const char *); +extern void st_destroy(Str_tbl *); +extern size_t st_getstrtab_sz(Str_tbl *); +extern const char *st_getstrbuf(Str_tbl *); +extern int st_insert(Str_tbl *, const char *); +extern Str_tbl *st_new(uint_t); +extern int st_setstrbuf(Str_tbl *, char *, size_t); +extern int st_setstring(Str_tbl *, const char *, size_t *); + +/* + * Exported flags values for st_new(). + */ +#define FLG_STNEW_COMPRESS 0x01 /* compressed string table */ + +#ifdef __cplusplus +} +#endif + +#endif /* _STRING_TABLE_DOT_H */ |