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.
13*fbbd9655SWarner Losh * 3. 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/param.h>
31d6fb4894SJohn Baldwin #include <dlfcn.h>
329289f547SJohn Baldwin #include <stdbool.h>
33d6fb4894SJohn Baldwin #include <stdio.h>
3468e9b1e8SKonstantin Belousov #include <string.h>
35d6fb4894SJohn Baldwin #include <sysdecode.h>
36f214036eSKonstantin Belousov #include "rtld_utrace.h"
37d6fb4894SJohn Baldwin
3868e9b1e8SKonstantin Belousov #ifdef __LP64__
3968e9b1e8SKonstantin Belousov struct utrace_rtld32 {
40f214036eSKonstantin Belousov char sig[4];
4168e9b1e8SKonstantin Belousov int event;
4268e9b1e8SKonstantin Belousov uint32_t handle;
4368e9b1e8SKonstantin Belousov uint32_t mapbase;
4468e9b1e8SKonstantin Belousov uint32_t mapsize;
4568e9b1e8SKonstantin Belousov int refcnt;
4668e9b1e8SKonstantin Belousov char name[MAXPATHLEN];
4768e9b1e8SKonstantin Belousov };
4868e9b1e8SKonstantin Belousov #endif
4968e9b1e8SKonstantin Belousov
50d6fb4894SJohn Baldwin static int
print_utrace_rtld(FILE * fp,void * p)51d6fb4894SJohn Baldwin print_utrace_rtld(FILE *fp, void *p)
52d6fb4894SJohn Baldwin {
53d6fb4894SJohn Baldwin struct utrace_rtld *ut = p;
54d6fb4894SJohn Baldwin void *parent;
55d6fb4894SJohn Baldwin int mode;
56d6fb4894SJohn Baldwin
57d6fb4894SJohn Baldwin switch (ut->event) {
58d6fb4894SJohn Baldwin case UTRACE_DLOPEN_START:
59d6fb4894SJohn Baldwin mode = ut->refcnt;
60d6fb4894SJohn Baldwin fprintf(fp, "dlopen(%s, ", ut->name);
61d6fb4894SJohn Baldwin switch (mode & RTLD_MODEMASK) {
62d6fb4894SJohn Baldwin case RTLD_NOW:
63d6fb4894SJohn Baldwin fprintf(fp, "RTLD_NOW");
64d6fb4894SJohn Baldwin break;
65d6fb4894SJohn Baldwin case RTLD_LAZY:
66d6fb4894SJohn Baldwin fprintf(fp, "RTLD_LAZY");
67d6fb4894SJohn Baldwin break;
68d6fb4894SJohn Baldwin default:
69d6fb4894SJohn Baldwin fprintf(fp, "%#x", mode & RTLD_MODEMASK);
70d6fb4894SJohn Baldwin }
71d6fb4894SJohn Baldwin if (mode & RTLD_GLOBAL)
72d6fb4894SJohn Baldwin fprintf(fp, " | RTLD_GLOBAL");
73d6fb4894SJohn Baldwin if (mode & RTLD_TRACE)
74d6fb4894SJohn Baldwin fprintf(fp, " | RTLD_TRACE");
75d6fb4894SJohn Baldwin if (mode & ~(RTLD_MODEMASK | RTLD_GLOBAL | RTLD_TRACE))
76d6fb4894SJohn Baldwin fprintf(fp, " | %#x", mode &
77d6fb4894SJohn Baldwin ~(RTLD_MODEMASK | RTLD_GLOBAL | RTLD_TRACE));
78d6fb4894SJohn Baldwin fprintf(fp, ")");
79d6fb4894SJohn Baldwin break;
80d6fb4894SJohn Baldwin case UTRACE_DLOPEN_STOP:
81d6fb4894SJohn Baldwin fprintf(fp, "%p = dlopen(%s) ref %d", ut->handle, ut->name,
82d6fb4894SJohn Baldwin ut->refcnt);
83d6fb4894SJohn Baldwin break;
84d6fb4894SJohn Baldwin case UTRACE_DLCLOSE_START:
85d6fb4894SJohn Baldwin fprintf(fp, "dlclose(%p) (%s, %d)", ut->handle, ut->name,
86d6fb4894SJohn Baldwin ut->refcnt);
87d6fb4894SJohn Baldwin break;
88d6fb4894SJohn Baldwin case UTRACE_DLCLOSE_STOP:
89d6fb4894SJohn Baldwin fprintf(fp, "dlclose(%p) finished", ut->handle);
90d6fb4894SJohn Baldwin break;
91d6fb4894SJohn Baldwin case UTRACE_LOAD_OBJECT:
92d6fb4894SJohn Baldwin fprintf(fp, "RTLD: loaded %p @ %p - %p (%s)", ut->handle,
93d6fb4894SJohn Baldwin ut->mapbase, (char *)ut->mapbase + ut->mapsize - 1,
94d6fb4894SJohn Baldwin ut->name);
95d6fb4894SJohn Baldwin break;
96d6fb4894SJohn Baldwin case UTRACE_UNLOAD_OBJECT:
97d6fb4894SJohn Baldwin fprintf(fp, "RTLD: unloaded %p @ %p - %p (%s)", ut->handle,
98d6fb4894SJohn Baldwin ut->mapbase, (char *)ut->mapbase + ut->mapsize - 1,
99d6fb4894SJohn Baldwin ut->name);
100d6fb4894SJohn Baldwin break;
101d6fb4894SJohn Baldwin case UTRACE_ADD_RUNDEP:
102d6fb4894SJohn Baldwin parent = ut->mapbase;
103d6fb4894SJohn Baldwin fprintf(fp, "RTLD: %p now depends on %p (%s, %d)", parent,
104d6fb4894SJohn Baldwin ut->handle, ut->name, ut->refcnt);
105d6fb4894SJohn Baldwin break;
106d6fb4894SJohn Baldwin case UTRACE_PRELOAD_FINISHED:
107d6fb4894SJohn Baldwin fprintf(fp, "RTLD: LD_PRELOAD finished");
108d6fb4894SJohn Baldwin break;
109d6fb4894SJohn Baldwin case UTRACE_INIT_CALL:
110d6fb4894SJohn Baldwin fprintf(fp, "RTLD: init %p for %p (%s)", ut->mapbase, ut->handle,
111d6fb4894SJohn Baldwin ut->name);
112d6fb4894SJohn Baldwin break;
113d6fb4894SJohn Baldwin case UTRACE_FINI_CALL:
114d6fb4894SJohn Baldwin fprintf(fp, "RTLD: fini %p for %p (%s)", ut->mapbase, ut->handle,
115d6fb4894SJohn Baldwin ut->name);
116d6fb4894SJohn Baldwin break;
117d6fb4894SJohn Baldwin case UTRACE_DLSYM_START:
118d6fb4894SJohn Baldwin fprintf(fp, "RTLD: dlsym(%p, %s)", ut->handle, ut->name);
119d6fb4894SJohn Baldwin break;
120d6fb4894SJohn Baldwin case UTRACE_DLSYM_STOP:
121d6fb4894SJohn Baldwin fprintf(fp, "RTLD: %p = dlsym(%p, %s)", ut->mapbase, ut->handle,
122d6fb4894SJohn Baldwin ut->name);
123d6fb4894SJohn Baldwin break;
12487879285SPeter Jeremy case UTRACE_RTLD_ERROR:
12587879285SPeter Jeremy fprintf(fp, "RTLD: error: %s\n", ut->name);
12687879285SPeter Jeremy break;
12787879285SPeter Jeremy
128d6fb4894SJohn Baldwin default:
129d6fb4894SJohn Baldwin return (0);
130d6fb4894SJohn Baldwin }
131d6fb4894SJohn Baldwin return (1);
132d6fb4894SJohn Baldwin }
133d6fb4894SJohn Baldwin
134d6fb4894SJohn Baldwin struct utrace_malloc {
135d6fb4894SJohn Baldwin void *p;
136d6fb4894SJohn Baldwin size_t s;
137d6fb4894SJohn Baldwin void *r;
138d6fb4894SJohn Baldwin };
139d6fb4894SJohn Baldwin
14068e9b1e8SKonstantin Belousov #ifdef __LP64__
14168e9b1e8SKonstantin Belousov struct utrace_malloc32 {
14268e9b1e8SKonstantin Belousov uint32_t p;
14368e9b1e8SKonstantin Belousov uint32_t s;
14468e9b1e8SKonstantin Belousov uint32_t r;
14568e9b1e8SKonstantin Belousov };
14668e9b1e8SKonstantin Belousov #endif
14768e9b1e8SKonstantin Belousov
148d6fb4894SJohn Baldwin static void
print_utrace_malloc(FILE * fp,void * p)149d6fb4894SJohn Baldwin print_utrace_malloc(FILE *fp, void *p)
150d6fb4894SJohn Baldwin {
151d6fb4894SJohn Baldwin struct utrace_malloc *ut = p;
152d6fb4894SJohn Baldwin
153d6fb4894SJohn Baldwin if (ut->p == (void *)(intptr_t)(-1))
154d6fb4894SJohn Baldwin fprintf(fp, "malloc_init()");
155d6fb4894SJohn Baldwin else if (ut->s == 0)
156d6fb4894SJohn Baldwin fprintf(fp, "free(%p)", ut->p);
157d6fb4894SJohn Baldwin else if (ut->p == NULL)
158d6fb4894SJohn Baldwin fprintf(fp, "%p = malloc(%zu)", ut->r, ut->s);
159d6fb4894SJohn Baldwin else
160d6fb4894SJohn Baldwin fprintf(fp, "%p = realloc(%p, %zu)", ut->r, ut->p, ut->s);
161d6fb4894SJohn Baldwin }
162d6fb4894SJohn Baldwin
163d6fb4894SJohn Baldwin int
sysdecode_utrace(FILE * fp,void * p,size_t len)164d6fb4894SJohn Baldwin sysdecode_utrace(FILE *fp, void *p, size_t len)
165d6fb4894SJohn Baldwin {
16668e9b1e8SKonstantin Belousov #ifdef __LP64__
16768e9b1e8SKonstantin Belousov struct utrace_rtld ur;
16868e9b1e8SKonstantin Belousov struct utrace_rtld32 *pr;
16968e9b1e8SKonstantin Belousov struct utrace_malloc um;
17068e9b1e8SKonstantin Belousov struct utrace_malloc32 *pm;
17168e9b1e8SKonstantin Belousov #endif
172f214036eSKonstantin Belousov static const char rtld_utrace_sig[RTLD_UTRACE_SIG_SZ] = RTLD_UTRACE_SIG;
173d6fb4894SJohn Baldwin
174f214036eSKonstantin Belousov if (len == sizeof(struct utrace_rtld) && bcmp(p, rtld_utrace_sig,
175f214036eSKonstantin Belousov sizeof(rtld_utrace_sig)) == 0)
176d6fb4894SJohn Baldwin return (print_utrace_rtld(fp, p));
177d6fb4894SJohn Baldwin
178d6fb4894SJohn Baldwin if (len == sizeof(struct utrace_malloc)) {
179d6fb4894SJohn Baldwin print_utrace_malloc(fp, p);
180d6fb4894SJohn Baldwin return (1);
181d6fb4894SJohn Baldwin }
182d6fb4894SJohn Baldwin
18368e9b1e8SKonstantin Belousov #ifdef __LP64__
184f214036eSKonstantin Belousov if (len == sizeof(struct utrace_rtld32) && bcmp(p, rtld_utrace_sig,
185f214036eSKonstantin Belousov sizeof(rtld_utrace_sig)) == 0) {
18668e9b1e8SKonstantin Belousov pr = p;
18768e9b1e8SKonstantin Belousov memset(&ur, 0, sizeof(ur));
18868e9b1e8SKonstantin Belousov memcpy(ur.sig, pr->sig, sizeof(ur.sig));
18968e9b1e8SKonstantin Belousov ur.event = pr->event;
19068e9b1e8SKonstantin Belousov ur.handle = (void *)(uintptr_t)pr->handle;
19168e9b1e8SKonstantin Belousov ur.mapbase = (void *)(uintptr_t)pr->mapbase;
19268e9b1e8SKonstantin Belousov ur.mapsize = pr->mapsize;
19368e9b1e8SKonstantin Belousov ur.refcnt = pr->refcnt;
19468e9b1e8SKonstantin Belousov memcpy(ur.name, pr->name, sizeof(ur.name));
19568e9b1e8SKonstantin Belousov return (print_utrace_rtld(fp, &ur));
19668e9b1e8SKonstantin Belousov }
19768e9b1e8SKonstantin Belousov
19868e9b1e8SKonstantin Belousov if (len == sizeof(struct utrace_malloc32)) {
19968e9b1e8SKonstantin Belousov pm = p;
20068e9b1e8SKonstantin Belousov memset(&um, 0, sizeof(um));
20168e9b1e8SKonstantin Belousov um.p = pm->p == (uint32_t)-1 ? (void *)(intptr_t)-1 :
20268e9b1e8SKonstantin Belousov (void *)(uintptr_t)pm->p;
20368e9b1e8SKonstantin Belousov um.s = pm->s;
20468e9b1e8SKonstantin Belousov um.r = (void *)(uintptr_t)pm->r;
20568e9b1e8SKonstantin Belousov print_utrace_malloc(fp, &um);
20668e9b1e8SKonstantin Belousov return (1);
20768e9b1e8SKonstantin Belousov }
20868e9b1e8SKonstantin Belousov #endif
20968e9b1e8SKonstantin Belousov
210d6fb4894SJohn Baldwin return (0);
211d6fb4894SJohn Baldwin }
212