1d6fb4894SJohn Baldwin /*- 2d6fb4894SJohn Baldwin * Copyright (c) 1988, 1993 3d6fb4894SJohn Baldwin * The Regents of the University of California. All rights reserved. 4d6fb4894SJohn Baldwin * 5d6fb4894SJohn Baldwin * Redistribution and use in source and binary forms, with or without 6d6fb4894SJohn Baldwin * modification, are permitted provided that the following conditions 7d6fb4894SJohn Baldwin * are met: 8d6fb4894SJohn Baldwin * 1. Redistributions of source code must retain the above copyright 9d6fb4894SJohn Baldwin * notice, this list of conditions and the following disclaimer. 10d6fb4894SJohn Baldwin * 2. Redistributions in binary form must reproduce the above copyright 11d6fb4894SJohn Baldwin * notice, this list of conditions and the following disclaimer in the 12d6fb4894SJohn Baldwin * documentation and/or other materials provided with the distribution. 13d6fb4894SJohn Baldwin * 4. Neither the name of the University nor the names of its contributors 14d6fb4894SJohn Baldwin * may be used to endorse or promote products derived from this software 15d6fb4894SJohn Baldwin * without specific prior written permission. 16d6fb4894SJohn Baldwin * 17d6fb4894SJohn Baldwin * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18d6fb4894SJohn Baldwin * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19d6fb4894SJohn Baldwin * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20d6fb4894SJohn Baldwin * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21d6fb4894SJohn Baldwin * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22d6fb4894SJohn Baldwin * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23d6fb4894SJohn Baldwin * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24d6fb4894SJohn Baldwin * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25d6fb4894SJohn Baldwin * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26d6fb4894SJohn Baldwin * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27d6fb4894SJohn Baldwin * SUCH DAMAGE. 28d6fb4894SJohn Baldwin */ 29d6fb4894SJohn Baldwin 30d6fb4894SJohn Baldwin #include <sys/cdefs.h> 31d6fb4894SJohn Baldwin __FBSDID("$FreeBSD$"); 32d6fb4894SJohn Baldwin 33d6fb4894SJohn Baldwin #include <sys/param.h> 34d6fb4894SJohn Baldwin #include <dlfcn.h> 35d6fb4894SJohn Baldwin #include <stdio.h> 36*68e9b1e8SKonstantin Belousov #include <string.h> 37d6fb4894SJohn Baldwin #include <sysdecode.h> 38d6fb4894SJohn Baldwin 39d6fb4894SJohn Baldwin #define UTRACE_DLOPEN_START 1 40d6fb4894SJohn Baldwin #define UTRACE_DLOPEN_STOP 2 41d6fb4894SJohn Baldwin #define UTRACE_DLCLOSE_START 3 42d6fb4894SJohn Baldwin #define UTRACE_DLCLOSE_STOP 4 43d6fb4894SJohn Baldwin #define UTRACE_LOAD_OBJECT 5 44d6fb4894SJohn Baldwin #define UTRACE_UNLOAD_OBJECT 6 45d6fb4894SJohn Baldwin #define UTRACE_ADD_RUNDEP 7 46d6fb4894SJohn Baldwin #define UTRACE_PRELOAD_FINISHED 8 47d6fb4894SJohn Baldwin #define UTRACE_INIT_CALL 9 48d6fb4894SJohn Baldwin #define UTRACE_FINI_CALL 10 49d6fb4894SJohn Baldwin #define UTRACE_DLSYM_START 11 50d6fb4894SJohn Baldwin #define UTRACE_DLSYM_STOP 12 51d6fb4894SJohn Baldwin 52d6fb4894SJohn Baldwin struct utrace_rtld { 53d6fb4894SJohn Baldwin char sig[4]; /* 'RTLD' */ 54d6fb4894SJohn Baldwin int event; 55d6fb4894SJohn Baldwin void *handle; 56d6fb4894SJohn Baldwin void *mapbase; 57d6fb4894SJohn Baldwin size_t mapsize; 58d6fb4894SJohn Baldwin int refcnt; 59d6fb4894SJohn Baldwin char name[MAXPATHLEN]; 60d6fb4894SJohn Baldwin }; 61d6fb4894SJohn Baldwin 62*68e9b1e8SKonstantin Belousov #ifdef __LP64__ 63*68e9b1e8SKonstantin Belousov struct utrace_rtld32 { 64*68e9b1e8SKonstantin Belousov char sig[4]; /* 'RTLD' */ 65*68e9b1e8SKonstantin Belousov int event; 66*68e9b1e8SKonstantin Belousov uint32_t handle; 67*68e9b1e8SKonstantin Belousov uint32_t mapbase; 68*68e9b1e8SKonstantin Belousov uint32_t mapsize; 69*68e9b1e8SKonstantin Belousov int refcnt; 70*68e9b1e8SKonstantin Belousov char name[MAXPATHLEN]; 71*68e9b1e8SKonstantin Belousov }; 72*68e9b1e8SKonstantin Belousov #endif 73*68e9b1e8SKonstantin Belousov 74d6fb4894SJohn Baldwin static int 75d6fb4894SJohn Baldwin print_utrace_rtld(FILE *fp, void *p) 76d6fb4894SJohn Baldwin { 77d6fb4894SJohn Baldwin struct utrace_rtld *ut = p; 78d6fb4894SJohn Baldwin void *parent; 79d6fb4894SJohn Baldwin int mode; 80d6fb4894SJohn Baldwin 81d6fb4894SJohn Baldwin switch (ut->event) { 82d6fb4894SJohn Baldwin case UTRACE_DLOPEN_START: 83d6fb4894SJohn Baldwin mode = ut->refcnt; 84d6fb4894SJohn Baldwin fprintf(fp, "dlopen(%s, ", ut->name); 85d6fb4894SJohn Baldwin switch (mode & RTLD_MODEMASK) { 86d6fb4894SJohn Baldwin case RTLD_NOW: 87d6fb4894SJohn Baldwin fprintf(fp, "RTLD_NOW"); 88d6fb4894SJohn Baldwin break; 89d6fb4894SJohn Baldwin case RTLD_LAZY: 90d6fb4894SJohn Baldwin fprintf(fp, "RTLD_LAZY"); 91d6fb4894SJohn Baldwin break; 92d6fb4894SJohn Baldwin default: 93d6fb4894SJohn Baldwin fprintf(fp, "%#x", mode & RTLD_MODEMASK); 94d6fb4894SJohn Baldwin } 95d6fb4894SJohn Baldwin if (mode & RTLD_GLOBAL) 96d6fb4894SJohn Baldwin fprintf(fp, " | RTLD_GLOBAL"); 97d6fb4894SJohn Baldwin if (mode & RTLD_TRACE) 98d6fb4894SJohn Baldwin fprintf(fp, " | RTLD_TRACE"); 99d6fb4894SJohn Baldwin if (mode & ~(RTLD_MODEMASK | RTLD_GLOBAL | RTLD_TRACE)) 100d6fb4894SJohn Baldwin fprintf(fp, " | %#x", mode & 101d6fb4894SJohn Baldwin ~(RTLD_MODEMASK | RTLD_GLOBAL | RTLD_TRACE)); 102d6fb4894SJohn Baldwin fprintf(fp, ")"); 103d6fb4894SJohn Baldwin break; 104d6fb4894SJohn Baldwin case UTRACE_DLOPEN_STOP: 105d6fb4894SJohn Baldwin fprintf(fp, "%p = dlopen(%s) ref %d", ut->handle, ut->name, 106d6fb4894SJohn Baldwin ut->refcnt); 107d6fb4894SJohn Baldwin break; 108d6fb4894SJohn Baldwin case UTRACE_DLCLOSE_START: 109d6fb4894SJohn Baldwin fprintf(fp, "dlclose(%p) (%s, %d)", ut->handle, ut->name, 110d6fb4894SJohn Baldwin ut->refcnt); 111d6fb4894SJohn Baldwin break; 112d6fb4894SJohn Baldwin case UTRACE_DLCLOSE_STOP: 113d6fb4894SJohn Baldwin fprintf(fp, "dlclose(%p) finished", ut->handle); 114d6fb4894SJohn Baldwin break; 115d6fb4894SJohn Baldwin case UTRACE_LOAD_OBJECT: 116d6fb4894SJohn Baldwin fprintf(fp, "RTLD: loaded %p @ %p - %p (%s)", ut->handle, 117d6fb4894SJohn Baldwin ut->mapbase, (char *)ut->mapbase + ut->mapsize - 1, 118d6fb4894SJohn Baldwin ut->name); 119d6fb4894SJohn Baldwin break; 120d6fb4894SJohn Baldwin case UTRACE_UNLOAD_OBJECT: 121d6fb4894SJohn Baldwin fprintf(fp, "RTLD: unloaded %p @ %p - %p (%s)", ut->handle, 122d6fb4894SJohn Baldwin ut->mapbase, (char *)ut->mapbase + ut->mapsize - 1, 123d6fb4894SJohn Baldwin ut->name); 124d6fb4894SJohn Baldwin break; 125d6fb4894SJohn Baldwin case UTRACE_ADD_RUNDEP: 126d6fb4894SJohn Baldwin parent = ut->mapbase; 127d6fb4894SJohn Baldwin fprintf(fp, "RTLD: %p now depends on %p (%s, %d)", parent, 128d6fb4894SJohn Baldwin ut->handle, ut->name, ut->refcnt); 129d6fb4894SJohn Baldwin break; 130d6fb4894SJohn Baldwin case UTRACE_PRELOAD_FINISHED: 131d6fb4894SJohn Baldwin fprintf(fp, "RTLD: LD_PRELOAD finished"); 132d6fb4894SJohn Baldwin break; 133d6fb4894SJohn Baldwin case UTRACE_INIT_CALL: 134d6fb4894SJohn Baldwin fprintf(fp, "RTLD: init %p for %p (%s)", ut->mapbase, ut->handle, 135d6fb4894SJohn Baldwin ut->name); 136d6fb4894SJohn Baldwin break; 137d6fb4894SJohn Baldwin case UTRACE_FINI_CALL: 138d6fb4894SJohn Baldwin fprintf(fp, "RTLD: fini %p for %p (%s)", ut->mapbase, ut->handle, 139d6fb4894SJohn Baldwin ut->name); 140d6fb4894SJohn Baldwin break; 141d6fb4894SJohn Baldwin case UTRACE_DLSYM_START: 142d6fb4894SJohn Baldwin fprintf(fp, "RTLD: dlsym(%p, %s)", ut->handle, ut->name); 143d6fb4894SJohn Baldwin break; 144d6fb4894SJohn Baldwin case UTRACE_DLSYM_STOP: 145d6fb4894SJohn Baldwin fprintf(fp, "RTLD: %p = dlsym(%p, %s)", ut->mapbase, ut->handle, 146d6fb4894SJohn Baldwin ut->name); 147d6fb4894SJohn Baldwin break; 148d6fb4894SJohn Baldwin default: 149d6fb4894SJohn Baldwin return (0); 150d6fb4894SJohn Baldwin } 151d6fb4894SJohn Baldwin return (1); 152d6fb4894SJohn Baldwin } 153d6fb4894SJohn Baldwin 154d6fb4894SJohn Baldwin struct utrace_malloc { 155d6fb4894SJohn Baldwin void *p; 156d6fb4894SJohn Baldwin size_t s; 157d6fb4894SJohn Baldwin void *r; 158d6fb4894SJohn Baldwin }; 159d6fb4894SJohn Baldwin 160*68e9b1e8SKonstantin Belousov #ifdef __LP64__ 161*68e9b1e8SKonstantin Belousov struct utrace_malloc32 { 162*68e9b1e8SKonstantin Belousov uint32_t p; 163*68e9b1e8SKonstantin Belousov uint32_t s; 164*68e9b1e8SKonstantin Belousov uint32_t r; 165*68e9b1e8SKonstantin Belousov }; 166*68e9b1e8SKonstantin Belousov #endif 167*68e9b1e8SKonstantin Belousov 168d6fb4894SJohn Baldwin static void 169d6fb4894SJohn Baldwin print_utrace_malloc(FILE *fp, void *p) 170d6fb4894SJohn Baldwin { 171d6fb4894SJohn Baldwin struct utrace_malloc *ut = p; 172d6fb4894SJohn Baldwin 173d6fb4894SJohn Baldwin if (ut->p == (void *)(intptr_t)(-1)) 174d6fb4894SJohn Baldwin fprintf(fp, "malloc_init()"); 175d6fb4894SJohn Baldwin else if (ut->s == 0) 176d6fb4894SJohn Baldwin fprintf(fp, "free(%p)", ut->p); 177d6fb4894SJohn Baldwin else if (ut->p == NULL) 178d6fb4894SJohn Baldwin fprintf(fp, "%p = malloc(%zu)", ut->r, ut->s); 179d6fb4894SJohn Baldwin else 180d6fb4894SJohn Baldwin fprintf(fp, "%p = realloc(%p, %zu)", ut->r, ut->p, ut->s); 181d6fb4894SJohn Baldwin } 182d6fb4894SJohn Baldwin 183d6fb4894SJohn Baldwin int 184d6fb4894SJohn Baldwin sysdecode_utrace(FILE *fp, void *p, size_t len) 185d6fb4894SJohn Baldwin { 186*68e9b1e8SKonstantin Belousov #ifdef __LP64__ 187*68e9b1e8SKonstantin Belousov struct utrace_rtld ur; 188*68e9b1e8SKonstantin Belousov struct utrace_rtld32 *pr; 189*68e9b1e8SKonstantin Belousov struct utrace_malloc um; 190*68e9b1e8SKonstantin Belousov struct utrace_malloc32 *pm; 191*68e9b1e8SKonstantin Belousov #endif 192d6fb4894SJohn Baldwin 193d6fb4894SJohn Baldwin if (len == sizeof(struct utrace_rtld) && bcmp(p, "RTLD", 4) == 0) { 194d6fb4894SJohn Baldwin return (print_utrace_rtld(fp, p)); 195d6fb4894SJohn Baldwin } 196d6fb4894SJohn Baldwin 197d6fb4894SJohn Baldwin if (len == sizeof(struct utrace_malloc)) { 198d6fb4894SJohn Baldwin print_utrace_malloc(fp, p); 199d6fb4894SJohn Baldwin return (1); 200d6fb4894SJohn Baldwin } 201d6fb4894SJohn Baldwin 202*68e9b1e8SKonstantin Belousov #ifdef __LP64__ 203*68e9b1e8SKonstantin Belousov if (len == sizeof(struct utrace_rtld32) && bcmp(p, "RTLD", 4) == 0) { 204*68e9b1e8SKonstantin Belousov pr = p; 205*68e9b1e8SKonstantin Belousov memset(&ur, 0, sizeof(ur)); 206*68e9b1e8SKonstantin Belousov memcpy(ur.sig, pr->sig, sizeof(ur.sig)); 207*68e9b1e8SKonstantin Belousov ur.event = pr->event; 208*68e9b1e8SKonstantin Belousov ur.handle = (void *)(uintptr_t)pr->handle; 209*68e9b1e8SKonstantin Belousov ur.mapbase = (void *)(uintptr_t)pr->mapbase; 210*68e9b1e8SKonstantin Belousov ur.mapsize = pr->mapsize; 211*68e9b1e8SKonstantin Belousov ur.refcnt = pr->refcnt; 212*68e9b1e8SKonstantin Belousov memcpy(ur.name, pr->name, sizeof(ur.name)); 213*68e9b1e8SKonstantin Belousov return (print_utrace_rtld(fp, &ur)); 214*68e9b1e8SKonstantin Belousov } 215*68e9b1e8SKonstantin Belousov 216*68e9b1e8SKonstantin Belousov if (len == sizeof(struct utrace_malloc32)) { 217*68e9b1e8SKonstantin Belousov pm = p; 218*68e9b1e8SKonstantin Belousov memset(&um, 0, sizeof(um)); 219*68e9b1e8SKonstantin Belousov um.p = pm->p == (uint32_t)-1 ? (void *)(intptr_t)-1 : 220*68e9b1e8SKonstantin Belousov (void *)(uintptr_t)pm->p; 221*68e9b1e8SKonstantin Belousov um.s = pm->s; 222*68e9b1e8SKonstantin Belousov um.r = (void *)(uintptr_t)pm->r; 223*68e9b1e8SKonstantin Belousov print_utrace_malloc(fp, &um); 224*68e9b1e8SKonstantin Belousov return (1); 225*68e9b1e8SKonstantin Belousov } 226*68e9b1e8SKonstantin Belousov #endif 227*68e9b1e8SKonstantin Belousov 228d6fb4894SJohn Baldwin return (0); 229d6fb4894SJohn Baldwin } 230