Psymtab.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (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
* 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 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <unistd.h>
#include <ctype.h>
#include <fcntl.h>
#include <string.h>
#include <strings.h>
#include <memory.h>
#include <errno.h>
#include <dirent.h>
#include <signal.h>
#include <limits.h>
#include <libgen.h>
#include <zone.h>
#include <sys/systeminfo.h>
#include <sys/sysmacros.h>
#include "libproc.h"
#include "Pcontrol.h"
#include "Putil.h"
Lmid_t, const char *);
#ifdef _LP64
#endif
#define DATA_TYPES \
typedef enum {
} pr_order_t;
static int
{
if (a > b)
return (1);
if (a < b)
return (-1);
return (0);
}
/*
* Allocation function for a new file_info_t
*/
static file_info_t *
{
map_info_t *mp;
return (NULL);
P->num_files++;
/*
* To figure out which map_info_t instances correspond to the mappings
* for this load object, we look at the in-memory ELF image in the
* base mapping (usually the program text). We examine the program
* headers to find the addresses at the beginning and end of each
* section and store them in a list which we then sort. Finally, we
* walk down the list of addresses and the list of map_info_t
* instances in lock step to correctly find the mappings that
* correspond to this load object.
*/
return (fptr);
goto out;
continue;
unordered = 1;
}
#ifdef _LP64
} else {
return (fptr);
goto out;
continue;
unordered = 1;
}
#endif
}
if (unordered)
i = j = 0;
}
i++;
} else {
mp++;
j++;
}
}
out:
return (fptr);
}
/*
* Deallocation function for a file_info_t
*/
static void
{
}
}
if (fptr->file_lname)
}
P->num_files--;
}
}
/*
* Deallocation function for a map_info_t
*/
static void
{
file_info_free(P, fptr);
}
}
P->nauxv = 0;
}
}
/*
* Call-back function for librtld_db to iterate through all of its shared
* libraries. We use this to get the load object names for the mappings.
*/
static int
{
struct ps_prochandle *P = cd;
return (1); /* Base address does not match any mapping */
return (1); /* Failed to allocate a new file_info_t */
file_info_free(P, fptr);
return (1); /* Failed to allocate rd_loadobj_t */
}
if (fptr->file_lname) {
}
}
dprintf("loaded rd object %s lmid %lx\n",
return (1);
}
static void
{
return; /* Failed to allocate a new file_info_t */
file_info_free(P, fptr);
return; /* Failed to allocate rd_loadobj_t */
}
if (fptr->file_lname) {
}
}
static void
load_static_maps(struct ps_prochandle *P)
{
/*
* Construct the map for the a.out.
*/
/*
* If the dynamic linker exists for this process,
* construct the map for it.
*/
}
/*
* Go through all the address space mappings, validating or updating
* the information already gathered, or gathering new information.
*
* This function is only called when we suspect that the mappings have changed
* because this is the first time we're calling it or because of rtld activity.
*/
void
Pupdate_maps(struct ps_prochandle *P)
{
char mapfile[64];
int mapfd;
int i;
if (P->info_valid)
return;
Preadauxvec(P);
if (mapfd >= 0)
Preset_maps(P); /* utter failure; destroy tables */
return;
}
return;
/*
* We try to merge any file information we may have for existing
* mappings, to avoid having to rebuild the file info.
*/
oldmapcount = P->map_count;
if (oldmapcount == 0) {
/*
* We've exhausted all the old mappings. Every new
* mapping should be added.
*/
/*
* This mapping matches exactly. Copy over the old
* mapping, taking care to get the latest flags.
* Make sure the associated file_info_t is updated
* appropriately.
*/
oldmapcount--;
mptr++;
/*
* The old mapping doesn't exist any more, remove it
* from the list.
*/
map_info_free(P, mptr);
oldmapcount--;
i--;
newp--;
pmap--;
mptr++;
} else {
/*
* This is a new mapping, add it directly.
*/
}
}
/*
* Free any old maps
*/
while (oldmapcount) {
map_info_free(P, mptr);
oldmapcount--;
mptr++;
}
P->info_valid = 1;
/*
* Consult librtld_db to get the load object
* names for all of the shared libraries.
*/
}
/*
* Update all of the mappings and rtld_db as if by Pupdate_maps(), and then
* forcibly cache all of the symbol tables associated with all object files.
*/
void
Pupdate_syms(struct ps_prochandle *P)
{
int i;
Pupdate_maps(P);
Pbuild_file_symtab(P, fptr);
(void) Pbuild_file_ctf(P, fptr);
}
}
/*
* Return the librtld_db agent handle for the victim process.
* The handle will become invalid at the next successful exec() and the
* client (caller of proc_rd_agent()) must not use it beyond that point.
* If the process is already dead, we've already tried our best to
* create the agent during core file initialization.
*/
Prd_agent(struct ps_prochandle *P)
{
Pupdate_maps(P);
if (P->num_files == 0)
load_static_maps(P);
}
return (P->rap);
}
/*
* Return the prmap_t structure containing 'addr', but only if it
* is in the dynamic linker's link map and is the text section.
*/
const prmap_t *
{
if (!P->info_valid)
Pupdate_maps(P);
return (pmp);
}
return (NULL);
}
/*
* Return the prmap_t structure containing 'addr' (no restrictions on
* the type of mapping).
*/
const prmap_t *
{
if (!P->info_valid)
Pupdate_maps(P);
return (NULL);
}
/*
* Convert a full or partial load object name to the prmap_t for its
* corresponding primary text mapping.
*/
const prmap_t *
{
if (name == PR_OBJ_EVERY)
return (NULL); /* A reasonable mistake */
return (NULL);
}
const prmap_t *
{
}
const rd_loadobj_t *
{
if (!P->info_valid)
Pupdate_maps(P);
return (NULL);
/*
* By building the symbol table, we implicitly bring the PLT
* information up to date in the load object.
*/
(void) build_map_symtab(P, mptr);
}
const rd_loadobj_t *
{
if (name == PR_OBJ_EVERY)
return (NULL);
return (NULL);
/*
* By building the symbol table, we implicitly bring the PLT
* information up to date in the load object.
*/
(void) build_map_symtab(P, mptr);
}
const rd_loadobj_t *
{
}
{
int err;
Pbuild_file_symtab(P, fptr);
if (fptr->file_ctf_size == 0)
return (NULL);
return (NULL);
/*
* The buffer may alread be allocated if this is a core file that
* contained CTF data for this file.
*/
dprintf("failed to allocate ctf buffer\n");
return (NULL);
}
fptr->file_ctf_size) {
dprintf("failed to read ctf data\n");
return (NULL);
}
}
ctdata.cts_offset = 0;
return (NULL);
}
dprintf("loaded %lu bytes of CTF data for %s\n",
}
{
if (!P->info_valid)
Pupdate_maps(P);
return (NULL);
return (Pbuild_file_ctf(P, fptr));
}
{
if (name == PR_OBJ_EVERY)
return (NULL);
return (NULL);
return (Pbuild_file_ctf(P, fptr));
}
{
}
/*
* If we're not a core file, re-read the /proc/<pid>/auxv file and store
* its contents in P->auxv. In the case of a core file, we either
* initialized P->auxv in Pcore() from the NT_AUXV, or we don't have an
* auxv because the note was missing.
*/
void
Preadauxvec(struct ps_prochandle *P)
{
char auxfile[64];
int fd;
return; /* Already read during Pgrab_core() */
return; /* No aux vec for Pgrab_file() */
P->nauxv = 0;
}
return;
} else {
}
}
}
/*
* Return a requested element from the process's aux vector.
* Return -1 on failure (this is adequate for our purposes).
*/
long
{
Preadauxvec(P);
return (-1);
}
return (-1);
}
/*
* Return a pointer to our internal copy of the process's aux vector.
* The caller should not hold on to this pointer across any libproc calls.
*/
const auxv_t *
Pgetauxvec(struct ps_prochandle *P)
{
Preadauxvec(P);
return (&empty);
return (P->auxv);
}
/*
* Find or build the symbol table for the given mapping.
*/
static file_info_t *
{
uint_t i;
Pbuild_file_symtab(P, fptr);
return (fptr);
}
return (NULL);
/*
* Attempt to find a matching file.
* (A file can be mapped at several different addresses.)
*/
Pbuild_file_symtab(P, fptr);
return (fptr);
}
}
/*
* If we need to create a new file_info structure, iterate
* through the load objects in order to attempt to connect
* this new file with its primary text mapping. We again
* need to handle ld.so as a special case because we need
* to be able to bootstrap librtld_db.
*/
return (NULL);
else
(void) Prd_agent(P);
} else {
}
/*
* If librtld_db wasn't able to help us connect the file to a primary
* text mapping, set file_map to the current mapping because we require
* fptr->file_map to be set in Pbuild_file_symtab. librtld_db may be
* unaware of what's going on in the rare case that a legitimate ELF
* file has been mmap(2)ed into the process address space *without*
* the use of dlopen(3x). Why would this happen? See pwdx ... :)
*/
Pbuild_file_symtab(P, fptr);
return (fptr);
}
static int
{
return (-1);
#ifdef _BIG_ENDIAN
#else
#endif
return (-1);
return (0);
}
static int
{
uint_t i;
return (-1);
return (0);
}
return (-1);
}
#ifdef _LP64
static int
{
return (-1);
#ifdef _BIG_ENDIAN
#else
#endif
return (-1);
return (0);
}
static int
{
uint_t i;
return (-1);
return (0);
}
return (-1);
}
#endif /* _LP64 */
/*
* The text segment for each load object contains the elf header and
* program headers. We can use this information to determine if the
* file that corresponds to the load object is the same file that
* was loaded into the process's address space. There can be a discrepency
* if a file is recompiled after the process is started or if the target
* represents a core file from a differently configured system -- two
* common examples. The DT_CHECKSUM entry in the dynamic section
* provides an easy method of comparison. It is important to note that
* the dynamic section usually lives in the data segment, but the meta
* data we use to find the dynamic section lives in the text segment so
* if either of those segments is absent we can't proceed.
*
* We're looking through the elf file for several items: the symbol tables
* (both dynsym and symtab), the procedure linkage table (PLT) base,
* size, and relocation base, and the CTF information. Most of this can
* be recovered from the loaded image of the file itself, the exceptions
* being the symtab and CTF data.
*
* First we try to open the file that we think corresponds to the load
* object, if the DT_CHECKSUM values match, we're all set, and can simply
* recover all the information we need from the file. If the values of
* DT_CHECKSUM don't match, or if we can't access the file for whatever
* reasaon, we fake up a elf file to use in its stead. If we can't read
* the elf data in the process's address space, we fall back to using
* the file even though it may give inaccurate information.
*
* The elf file that we fake up has to consist of sections for the
* dynsym, the PLT and the dynamic section. Note that in the case of a
* core file, we'll get the CTF data in the file_info_t later on from
* a section embedded the core file (if it's present).
*
* file_differs() conservatively looks for mismatched files, identifying
* a match when there is any ambiguity (since that's the legacy behavior).
*/
static int
{
return (0);
return (0);
/*
* First, we find the checksum value in the elf file.
*/
goto found_shdr;
}
return (0);
return (0);
#ifdef _LP64
#endif
else
return (0);
for (i = 0; i < ndyn; i++) {
goto found_cksum;
}
return (0);
/*
* Get the base of the text mapping that corresponds to this file.
*/
uint_t i;
return (0);
return (0);
return (0);
}
}
return (0);
dprintf("image cksum value is %llx\n",
#ifdef _LP64
uint_t i;
return (0);
return (0);
return (0);
}
}
return (0);
dprintf("image cksum value is %llx\n",
#endif /* _LP64 */
}
return (0);
}
static Elf *
{
enum {
DI_PLTGOT = 0,
};
static char shstr[] = ".shstrtab\0.dynsym\0.dynstr\0.dynamic\0.plt";
return (NULL);
return (NULL);
/*
* We're building a in memory elf file that will let us use libelf
* for most of the work we need to later (e.g. symbol table lookups).
* We need sections for the dynsym, dynstr, and plt, and we need
* the program headers from the text section. The former is used in
* Pbuild_file_symtab(); the latter is used in several functions in
* Pcore.c to reconstruct the origin of each mapping from the load
* object that spawned it.
*
* Here are some useful pieces of elf trivia that will help
* to elucidate this code.
*
* All the information we need about the dynstr can be found in these
* two entries in the dynamic section:
*
* DT_STRTAB base of dynstr
* DT_STRSZ size of dynstr
*
* So deciphering the dynstr is pretty straightforward.
*
* The dynsym is a little trickier.
*
* DT_SYMTAB base of dynsym
* DT_SYMENT size of a dynstr entry (Elf{32,64}_Sym)
* DT_HASH base of hash table for dynamic lookups
*
* The DT_SYMTAB entry gives us any easy way of getting to the base
* of the dynsym, but getting the size involves rooting around in the
* dynamic lookup hash table. Here's the layout of the hash table:
*
* +-------------------+
* | nbucket | All values are of type
* +-------------------+ Elf32_Word
* | nchain |
* +-------------------+
* | bucket[0] |
* | . . . |
* | bucket[nbucket-1] |
* +-------------------+
* | chain[0] |
* | . . . |
* | chain[nchain-1] |
* +-------------------+
* (figure 5-12 from the SYS V Generic ABI)
*
* Symbols names are hashed into a particular bucket which contains
* an index into the symbol table. Each entry in the symbol table
* has a corresponding entry in the chain table which tells the
* consumer where the next entry in the hash chain is. We can use
* the nchain field to find out the size of the dynsym.
*
* We can figure out the size of the .plt section, but it takes some
* doing. We need to use the following information:
*
* DT_PLTGOT base of the PLT
* DT_JMPREL base of the PLT's relocation section
* DT_PLTRELSZ size of the PLT's relocation section
* DT_PLTREL type of the PLT's relocation section
*
* We can use the relocation section to figure out the address of the
* last entry and subtract off the value of DT_PLTGOT to calculate
* the size of the PLT.
*
* For more information, check out the System V Generic ABI.
*/
Elf32_Shdr *sp;
return (NULL);
return (NULL);
return (NULL);
}
/*
* For the .plt section.
*/
case DT_PLTGOT:
continue;
case DT_JMPREL:
continue;
case DT_PLTRELSZ:
d[DI_PLTRELSZ] = &dp[i];
continue;
case DT_PLTREL:
continue;
default:
continue;
/*
* For the .dynsym section.
*/
case DT_SYMTAB:
break;
case DT_HASH:
break;
case DT_SYMENT:
break;
/*
* For the .dynstr section.
*/
case DT_STRTAB:
break;
case DT_STRSZ:
break;
}
dcount++;
}
/*
* We need all of those dynamic entries in order to put
* together a complete set of elf sections, but we'll
* let the PLT section slide if need be. The dynsym- and
* dynstr-related dynamic entries are mandatory in both
* executables and shared objects so if one of those is
* missing, we're in some trouble and should abort.
*/
dprintf("text section missing required dynamic "
"entries\n");
return (NULL);
}
}
/* elf header */
size = sizeof (Elf32_Ehdr);
/* program headers from in-core elf fragment */
/* unused shdr, and .shstrtab section */
size += sizeof (Elf32_Shdr);
size += sizeof (Elf32_Shdr);
/* .dynsym section */
size += sizeof (Elf32_Shdr);
goto bad32;
/* .dynstr section */
size += sizeof (Elf32_Shdr);
/* .dynamic section */
size += sizeof (Elf32_Shdr);
/* .plt section */
Elf32_Rela r[2];
sizeof (r[0]) * ndx) != sizeof (r))
goto bad32;
Elf32_Rel r[2];
sizeof (r[0]) * ndx) != sizeof (r))
goto bad32;
} else {
goto bad32;
}
size += sizeof (Elf32_Shdr);
}
goto bad32;
/* LINTED - alignment */
/* LINTED - alignment */
/*
* Copying the program headers directly from the process's
* address space is a little suspect, but since we only
* use them for their address and size values, this is fine.
*/
goto bad32;
}
/*
* The first elf section is always skipped.
*/
sp++;
/*
* Section Header[1] sh_name: .shstrtab
*/
sp->sh_entsize = 0;
sp++;
/*
* Section Header[2] sh_name: .dynsym
*/
goto bad32;
}
sp++;
/*
* Section Header[3] sh_name: .dynstr
*/
sp->sh_entsize = 0;
goto bad32;
}
sp++;
/*
* Section Header[4] sh_name: .dynamic
*/
sp++;
/*
* Section Header[5] sh_name: .plt
*/
if (pltsz != 0) {
goto bad32;
}
sp++;
}
goto good;
return (NULL);
#ifdef _LP64
Elf64_Shdr *sp;
return (NULL);
return (NULL);
return (NULL);
}
/*
* For the .plt section.
*/
case DT_PLTGOT:
continue;
case DT_JMPREL:
continue;
case DT_PLTRELSZ:
d[DI_PLTRELSZ] = &dp[i];
continue;
case DT_PLTREL:
continue;
default:
continue;
/*
* For the .dynsym section.
*/
case DT_SYMTAB:
break;
case DT_HASH:
break;
case DT_SYMENT:
break;
/*
* For the .dynstr section.
*/
case DT_STRTAB:
break;
case DT_STRSZ:
break;
}
dcount++;
}
/*
* We need all of those dynamic entries in order to put
* together a complete set of elf sections, but we'll
* let the PLT section slide if need be. The dynsym- and
* dynstr-related dynamic entries are mandatory in both
* executables and shared objects so if one of those is
* missing, we're in some trouble and should abort.
*/
dprintf("text section missing required dynamic "
"entries\n");
return (NULL);
}
}
/* elf header */
size = sizeof (Elf64_Ehdr);
/* program headers from in-core elf fragment */
/* unused shdr, and .shstrtab section */
size += sizeof (Elf64_Shdr);
size += sizeof (Elf64_Shdr);
/* .dynsym section */
size += sizeof (Elf64_Shdr);
goto bad64;
/* .dynstr section */
size += sizeof (Elf64_Shdr);
/* .dynamic section */
size += sizeof (Elf64_Shdr);
/* .plt section */
Elf64_Rela r[2];
sizeof (r[0]) * ndx) != sizeof (r))
goto bad64;
Elf64_Rel r[2];
sizeof (r[0]) * ndx) != sizeof (r))
goto bad64;
} else {
goto bad64;
}
size += sizeof (Elf64_Shdr);
}
goto bad64;
/* LINTED - alignment */
/* LINTED - alignment */
/*
* Copying the program headers directly from the process's
* address space is a little suspect, but since we only
* use them for their address and size values, this is fine.
*/
goto bad64;
}
/*
* The first elf section is always skipped.
*/
sp++;
/*
* Section Header[1] sh_name: .shstrtab
*/
sp->sh_entsize = 0;
sp++;
/*
* Section Header[2] sh_name: .dynsym
*/
goto bad64;
}
sp++;
/*
* Section Header[3] sh_name: .dynstr
*/
sp->sh_entsize = 0;
goto bad64;
}
sp++;
/*
* Section Header[4] sh_name: .dynamic
*/
sp++;
/*
* Section Header[5] sh_name: .plt
*/
if (pltsz != 0) {
goto bad64;
}
sp++;
}
goto good;
return (NULL);
#endif /* _LP64 */
}
good:
return (NULL);
}
return (elf);
}
/*
* We wouldn't need these if qsort(3C) took an argument for the callback...
*/
static char *sort_strs;
int
{
return (-1);
return (1);
/*
* Prefer the function to the non-function.
*/
return (-1);
return (1);
}
/*
* Prefer the weak or strong global symbol to the local symbol.
*/
return (-1);
return (1);
}
/*
* Prefer the name with fewer leading underscores in the name.
*/
aname++;
bname++;
}
if (*bname == '_')
return (-1);
if (*aname == '_')
return (1);
/*
* Prefer the symbol with the smaller size.
*/
return (-1);
return (1);
/*
* All other factors being equal, fall back to lexicographic order.
*/
}
static int
{
}
static int
{
}
void
{
return;
/*
* First record all the symbols into a table and count up the ones
* that we're interested in. We mark symbols as invalid by setting
* the st_name to an illegal value.
*/
count++;
else
}
/*
* Allocate sufficient space for both tables and populate them
* with the same symbols we just counted.
*/
}
/*
* Sort the two tables according to the appropriate criteria.
*/
(void) mutex_lock(&sort_mtx);
(void) mutex_unlock(&sort_mtx);
}
/*
* Build the symbol table for the given mapped file.
*/
void
{
char objectfile[PATH_MAX];
uint_t i;
GElf_Sym s;
struct {
const char *c_name;
return; /* We've already processed this file */
/*
* Mark the file_info struct as having the symbol table initialized
* even if we fail below. We tried once; we don't try again.
*/
dprintf("libproc ELF version is more recent than libelf\n");
return;
}
/*
* If we're a not live, we can't open files from the /proc
* object directory; we have only the mapping and file names
* to guide us. We prefer the file_lname, but need to handle
* the case of it being NULL in order to bootstrap: we first
* come here during rd_new() when the only information we have
* is interpreter name associated with the AT_BASE mapping.
*/
} else {
}
/*
* Open the object file, create the elf file, and then get the elf
* header and .shstrtab data buffer so we can process sections by
* name. If anything goes wrong try to fake up an elf file from
* the in-core elf image.
*/
dprintf("Pbuild_file_symtab: failed to open %s: %s\n",
dprintf("failed to fake up ELF file\n");
return;
}
dprintf("failed to process ELF file %s: %s\n",
dprintf("failed to fake up ELF file\n");
goto bad;
}
/*
* Before we get too excited about this elf file, we'll check
* its checksum value against the value we have in memory. If
* they don't agree, we try to fake up a new elf file and
* proceed with that instead.
*/
dprintf("ELF file %s (%lx) doesn't match in-core image\n",
dprintf("failed to fake up ELF file\n");
} else {
dprintf("switched to faked up ELF file\n");
}
}
goto bad;
}
/*
* Iterate through each section, caching its section header, data
* pointer, and name. We use this for handling sh_link values below.
*/
goto bad; /* Failed to get section header */
goto bad; /* Failed to get section data */
goto bad; /* Corrupt section name */
}
/*
* Now iterate through the section cache in order to locate info
* for the .symtab, .dynsym, .dynamic, .plt, and .SUNW_ctf sections:
*/
/*
* It's possible that the we already got the symbol
* table from the core file itself. Either the file
* differs in which case our faked up elf file will
* only contain the dynsym (not the symtab) or the
* file matches in which case we'll just be replacing
* the symbol table we pulled out of the core file
* with an equivalent one. In either case, this
* check isn't essential, but it's a good idea.
*/
}
/*
* Skip over bogus CTF sections so they don't come back
* to haunt us later.
*/
dprintf("Bad sh_link %d for "
continue;
}
}
}
/*
* At this point, we've found all the symbol tables we're ever going
* to find: the ones in the loop above and possibly the symtab that
* was included in the core file. Before we perform any lookups, we
* create sorted versions to optimize for lookups.
*/
/*
* Fill in the base address of the text mapping for shared libraries.
* This allows us to translate symbols before librtld_db is ready.
*/
dprintf("setting file_dyn_base for %s to %p\n",
}
/*
* Record the CTF section information in the file info structure.
*/
}
goto done; /* Nothing else to do if no load object info */
/*
* If the object is a shared library and we have a different rl_base
* value, reset file_dyn_base according to librtld_db's information.
*/
dprintf("resetting file_dyn_base for %s to %p\n",
}
/*
* Fill in the PLT information for this file if a PLT symbol is found.
*/
/*
* Bring the load object up to date; it is the only way the
* user has to access the PLT data. The PLT information in the
* rd_loadobj_t is not set in the call to map_iter() (the
* callback for rd_loadobj_iter) where we set file_lo.
*/
dprintf("PLT found at %p, size = %lu\n",
}
/*
* Fill in the PLT information.
*/
GElf_Dyn d;
for (i = 0; i < ndyn; i++) {
fptr->file_jmp_rel =
break;
}
}
dprintf("_DYNAMIC found at %p, %lu entries, DT_JMPREL = %p\n",
}
done:
return;
bad:
}
}
/*
* Given a process virtual address, return the map_info_t containing it.
* If none found, return NULL.
*/
{
int lo = 0;
int mid;
map_info_t *mp;
/* check that addr is in [vaddr, vaddr + size) */
return (mp);
else
}
return (NULL);
}
/*
* Return the map_info_t for the executable file.
* If not found, return NULL.
*/
static map_info_t *
exec_map(struct ps_prochandle *P)
{
uint_t i;
continue;
return (mptr);
continue;
}
/* This is a poor way to test for text space */
continue;
}
return (mptr);
}
}
return (mold);
}
/*
* Given a shared object name, return the map_info_t for it. If no matching
* object is found, return NULL. Normally, the link maps contain the full
* take one of the following forms:
*
* 2. An exact basename match: "libc.so.1"
* 3. An initial basename match up to a '.' suffix: "libc.so" or "libc"
* 4. The literal string "a.out" is an alias for the executable mapping
*
* The third case is a convenience for callers and may not be necessary.
*
* As the exact same object name may be loaded on different link maps (see
* dlmopen(3DL)), we also allow the caller to resolve the object name by
* specifying a particular link map id. If lmid is PR_LMID_EVERY, the
* first matching name will be returned, regardless of the link map id.
*/
static map_info_t *
{
map_info_t *mp;
uint_t i;
/*
* First pass: look for exact matches of the entire pathname or
* basename (cases 1 and 2 above):
*/
continue;
if (lmid != PR_LMID_EVERY &&
continue;
/*
* If we match, return the primary text mapping; otherwise
* just return the mapping we matched.
*/
}
/*
* Second pass: look for partial matches (case 3 above):
*/
continue;
if (lmid != PR_LMID_EVERY &&
continue;
/*
* If we match, return the primary text mapping; otherwise
* just return the mapping we matched.
*/
}
/*
* One last check: we allow "a.out" to always alias the executable,
* assuming this name was not in use for something else.
*/
return (P->map_exec);
return (NULL);
}
static map_info_t *
{
if (!P->info_valid)
Pupdate_maps(P);
if (name == PR_OBJ_EXEC)
else if (name == PR_OBJ_LDSO)
else
return (mptr);
}
/*
* When two symbols are found by address, decide which one is to be preferred.
*/
static GElf_Sym *
{
/*
* Prefer the non-NULL symbol.
*/
return (sym2);
return (sym1);
/*
* Defer to the sort ordering...
*/
}
/*
* Look up a symbol by address in the specified symbol table.
* Adjustment to 'addr' must already have been made for the
* offset of the symbol if this is a dynamic library symbol table.
*/
static GElf_Sym *
{
return (NULL);
min = 0;
/*
* We can't return when we've found a match, we have to continue
* searching for the closest matching symbol.
*/
oid = i;
found = 1;
}
else
}
if (!found)
return (NULL);
/*
* There may be many symbols with identical values so we walk
* backward in the byaddr table to find the best match.
*/
do {
i = oid;
if (omid == 0)
break;
*idp = i;
return (symp);
}
/*
* Look up a symbol by name in the specified symbol table.
*/
static GElf_Sym *
{
return (NULL);
min = 0;
*idp = i;
return (symp);
}
if (cmp < 0)
else
}
return (NULL);
}
/*
* Search the process symbol tables looking for a symbol whose
* value to value+size contain the address specified by addr.
* Return values are:
* sym_name_buffer containing the symbol name
* GElf_Sym symbol table entry
* prsyminfo_t ancillary symbol information
* Returns 0 on success, -1 on failure.
*/
int
struct ps_prochandle *P,
char *sym_name_buffer, /* buffer for the symbol name */
{
char *name;
(void) Prd_agent(P);
return (-1);
/*
* Adjust the address by the load object base address in
* case the address turns out to be in a shared library.
*/
/*
* Search both symbol tables, symtab first, then dynsym.
*/
return (-1);
if (bufsize > 0) {
}
}
return (0);
}
int
{
}
/*
* Search the process symbol tables looking for a symbol whose name matches the
* specified name and whose object and link map optionally match the specified
* parameters. On success, the function returns 0 and fills in the GElf_Sym
* symbol table entry. On failure, -1 is returned.
*/
int
struct ps_prochandle *P,
const char *oname, /* load object name */
const char *sname, /* symbol name */
{
int cnt;
int rv = -1;
if (oname == PR_OBJ_EVERY) {
/* create all the file_info_t's for all the mappings */
(void) Prd_agent(P);
} else {
cnt = 1;
return (-1);
}
/*
* Iterate through the loaded object files and look for the symbol
* name in the .symtab and .dynsym of each. If we encounter a match
* with SHN_UNDEF, keep looking in hopes of finding a better match.
* This means that a name such as "puts" will match the puts function
* in libc instead of matching the puts PLT entry in the a.out file.
*/
Pbuild_file_symtab(P, fptr);
continue;
continue;
}
}
} else {
continue;
}
return (0);
if (rv != 0) {
rv = 0;
}
}
if (rv == 0) {
}
return (rv);
}
/*
* Search the process symbol tables looking for a symbol whose name matches the
* specified name, but without any restriction on the link map id.
*/
int
{
}
/*
* Iterate over the process's address space mappings.
*/
int
{
char *object_name;
int rc = 0;
int i;
/* create all the file_info_t's for all the mappings */
(void) Prd_agent(P);
object_name = NULL;
else
return (rc);
}
return (0);
}
/*
* Iterate over the process's mapped objects.
*/
int
{
int rc = 0;
(void) Prd_agent(P); /* create file_info_t's for all the mappings */
Pupdate_maps(P);
continue;
return (rc);
}
return (0);
}
/*
* Given a virtual address, return the name of the underlying
* mapped object (file), as provided by the dynamic linker.
* Return NULL on failure (no underlying shared library).
*/
char *
{
/* create all the file_info_t's for all the mappings */
(void) Prd_agent(P);
return (buffer);
}
return (NULL);
}
/*
* Given a virtual address, return the link map id of the underlying mapped
* object (file), as provided by the dynamic linker. Return -1 on failure.
*/
int
{
/* create all the file_info_t's for all the mappings */
(void) Prd_agent(P);
return (0);
}
return (-1);
}
/*
* Given an object name and optional lmid, iterate over the object's symbols.
* If which == PR_SYMTAB, search the normal symbol table.
* If which == PR_DYNSYM, search the dynamic symbol table.
*/
static int
{
const char *strs;
int rv;
return (-1);
return (-1);
/*
* Search the specified symbol table.
*/
switch (which) {
case PR_SYMTAB:
break;
case PR_DYNSYM:
break;
default:
return (-1);
}
return (-1);
switch (order) {
case PRO_NATURAL:
break;
case PRO_BYNAME:
break;
case PRO_BYADDR:
break;
default:
return (-1);
}
rv = 0;
for (i = 0; i < count; i++) {
continue;
/*
* In case you haven't already guessed, this relies on
* the bitmask used in <libproc.h> for encoding symbol
* type and binding matching the order of STB and STT
* breaking binary compatibility, so I think this is
* reasonably fair game.
*/
continue;
} else
continue; /* Invalid type or binding */
break;
}
}
return (rv);
}
int
{
}
int
{
}
int
Psymbol_iter(struct ps_prochandle *P,
{
}
int
Psymbol_iter_by_addr(struct ps_prochandle *P,
{
}
int
Psymbol_iter_by_name(struct ps_prochandle *P,
{
}
/*
* Get the platform string from the core file if we have it;
* just perform the system call for the caller if this is a live process.
*/
char *
{
return (NULL);
}
return (NULL);
}
s[n - 1] = '\0';
return (NULL);
return (s);
}
/*
* Get the uname(2) information from the core file if we have it;
* just perform the system call for the caller if this is a live process.
*/
int
{
return (-1);
}
return (-1);
}
return (0);
}
return (uname(u));
}
/*
* Get the zone name from the core file if we have it; look up the
* name based on the zone id if this is a live process.
*/
char *
{
return (NULL);
}
return (NULL);
}
} else {
return (NULL);
s[n - 1] = '\0';
}
return (s);
}
/*
* Called from Pcreate(), Pgrab(), and Pfgrab_core() to initialize
* the symbol table heads in the new ps_prochandle.
*/
void
Pinitsym(struct ps_prochandle *P)
{
P->num_files = 0;
}
/*
* Called from Prelease() to destroy the symbol tables.
* Must be called by the client after an exec() in the victim process.
*/
void
Preset_maps(struct ps_prochandle *P)
{
int i;
}
}
P->nauxv = 0;
}
for (i = 0; i < P->map_count; i++)
map_info_free(P, &P->mappings[i]);
}
P->info_valid = 0;
}
typedef struct getenv_data {
char *buf;
const char *search;
/*ARGSUSED*/
static int
const char *nameval)
{
getenv_data_t *d = data;
return (0);
return (1);
}
return (0);
}
char *
{
return (buf);
}
}
return (NULL);
}
/* number of argument or environment pointers to read all at once */
#define NARG 100
int
{
int ret;
/*
* Attempt to find the "_environ" variable in the process.
* Failing that, use the original value provided by Ppsinfo().
*/
return (-1);
else
}
}
buflen = 128;
ret = 0;
for (;;) {
ret = -1;
break;
}
int i;
ret = -1;
break;
}
for (i = 0; i < NARG; i++)
}
nenv = 0;
}
break;
/*
* Attempt to read the string from the process.
*/
if (ret <= 0) {
/*
* Bail if we have a corrupted environment
*/
return (-1);
buflen *= 2;
goto again;
} else {
}
break;
}
return (ret);
}