setemul.c revision 1.1
1/*	$NetBSD: setemul.c,v 1.1 2000/04/10 09:13:45 jdolecek Exp $	*/
2
3/*-
4 * Copyright (c) 2000 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 *    notice, this list of conditions and the following disclaimer in the
14 *    documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 *    must display the following acknowledgement:
17 *	This product includes software developed by the NetBSD
18 *	Foundation, Inc. and its contributors.
19 * 4. Neither the name of The NetBSD Foundation nor the names of its
20 *    contributors may be used to endorse or promote products derived
21 *    from this software without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
24 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
25 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
26 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
27 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
29 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
30 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
31 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
32 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
34 */
35
36/*
37 * Copyright (c) 1988, 1993
38 *	The Regents of the University of California.  All rights reserved.
39 * (c) UNIX System Laboratories, Inc.
40 * All or some portions of this file are derived from material licensed
41 * to the University of California by American Telephone and Telegraph
42 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
43 * the permission of UNIX System Laboratories, Inc.
44 *
45 * Redistribution and use in source and binary forms, with or without
46 * modification, are permitted provided that the following conditions
47 * are met:
48 * 1. Redistributions of source code must retain the above copyright
49 *    notice, this list of conditions and the following disclaimer.
50 * 2. Redistributions in binary form must reproduce the above copyright
51 *    notice, this list of conditions and the following disclaimer in the
52 *    documentation and/or other materials provided with the distribution.
53 * 3. All advertising materials mentioning features or use of this software
54 *    must display the following acknowledgement:
55 *	This product includes software developed by the University of
56 *	California, Berkeley and its contributors.
57 * 4. Neither the name of the University nor the names of its contributors
58 *    may be used to endorse or promote products derived from this software
59 *    without specific prior written permission.
60 *
61 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
62 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
63 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
64 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
65 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
66 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
67 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
68 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
69 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
70 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
71 * SUCH DAMAGE.
72 */
73
74#include <sys/cdefs.h>
75#ifndef lint
76__RCSID("$NetBSD: setemul.c,v 1.1 2000/04/10 09:13:45 jdolecek Exp $");
77#endif /* not lint */
78
79#include <sys/param.h>
80#include <sys/errno.h>
81#include <sys/time.h>
82
83#include <err.h>
84#include <stdio.h>
85#include <stdlib.h>
86#include <string.h>
87#include <unistd.h>
88#include <vis.h>
89
90#include "setemul.h"
91
92#include <sys/syscall.h>
93
94#include "../../sys/compat/netbsd32/netbsd32_syscall.h"
95#include "../../sys/compat/freebsd/freebsd_syscall.h"
96#include "../../sys/compat/hpux/hpux_syscall.h"
97#include "../../sys/compat/ibcs2/ibcs2_syscall.h"
98#include "../../sys/compat/linux/linux_syscall.h"
99#include "../../sys/compat/osf1/osf1_syscall.h"
100#include "../../sys/compat/sunos/sunos_syscall.h"
101#include "../../sys/compat/svr4/svr4_syscall.h"
102#include "../../sys/compat/ultrix/ultrix_syscall.h"
103
104#define KTRACE
105#include "../../sys/kern/syscalls.c"
106
107#include "../../sys/compat/netbsd32/netbsd32_syscalls.c"
108#include "../../sys/compat/freebsd/freebsd_syscalls.c"
109#include "../../sys/compat/hpux/hpux_syscalls.c"
110#include "../../sys/compat/ibcs2/ibcs2_syscalls.c"
111#include "../../sys/compat/linux/linux_syscalls.c"
112#include "../../sys/compat/osf1/osf1_syscalls.c"
113#include "../../sys/compat/sunos/sunos_syscalls.c"
114#include "../../sys/compat/svr4/svr4_syscalls.c"
115#include "../../sys/compat/ultrix/ultrix_syscalls.c"
116
117#include "../../sys/compat/hpux/hpux_errno.c"
118#include "../../sys/compat/svr4/svr4_errno.c"
119#include "../../sys/compat/ibcs2/ibcs2_errno.c"
120#include "../../sys/compat/linux/common/linux_errno.c"
121#undef KTRACE
122
123#define NELEM(a) (sizeof(a) / sizeof(a[0]))
124
125static struct emulation emulations[] = {
126	{   "netbsd",	       syscallnames,         SYS_MAXSYSCALL,
127	        NULL,		        0 },
128	{   "netbsd32", netbsd32_syscallnames,	     SYS_MAXSYSCALL,
129	        NULL,		        0 },
130	{  "freebsd",  freebsd_syscallnames, FREEBSD_SYS_MAXSYSCALL,
131	        NULL,		        0 },
132	{     "hpux",	  hpux_syscallnames,    HPUX_SYS_MAXSYSCALL,
133	  native_to_hpux_errno,  NELEM(native_to_hpux_errno)  },
134	{    "ibcs2",    ibcs2_syscallnames,   IBCS2_SYS_MAXSYSCALL,
135	 native_to_ibcs2_errno,  NELEM(native_to_ibcs2_errno) },
136	{    "linux",    linux_syscallnames,   LINUX_SYS_MAXSYSCALL,
137	 native_to_linux_errno,  NELEM(native_to_linux_errno) },
138	{     "osf1",     osf1_syscallnames,    OSF1_SYS_MAXSYSCALL,
139	        NULL,		        0 },
140	{    "sunos",    sunos_syscallnames,   SUNOS_SYS_MAXSYSCALL,
141	        NULL,		        0 },
142	{     "svr4",     svr4_syscallnames,    SVR4_SYS_MAXSYSCALL,
143	  native_to_svr4_errno,  NELEM(native_to_svr4_errno)  },
144	{   "ultrix",   ultrix_syscallnames,  ULTRIX_SYS_MAXSYSCALL,
145	        NULL,			0 },
146	{       NULL,		       NULL,		          0,
147	        NULL,			0 }
148};
149
150struct emulation_ctx {
151	pid_t	pid;
152	struct emulation *emulation;
153	struct emulation_ctx *next;
154};
155
156struct emulation *current;
157
158static struct emulation *default_emul;
159
160struct emulation_ctx *current_ctx;
161struct emulation_ctx *emul_ctx = NULL;
162
163static struct emulation_ctx *ectx_find __P((pid_t));
164static void	ectx_update __P((pid_t, struct emulation *));
165
166void
167setemul(name, pid, update_ectx)
168	const char *name;
169	pid_t pid;
170	int update_ectx;
171{
172	int i;
173	struct emulation *match = NULL;
174
175	for (i = 0; emulations[i].name != NULL; i++) {
176		if (strcmp(emulations[i].name, name) == 0) {
177			match = &emulations[i];
178			break;
179		}
180	}
181
182	if (!match) {
183		warnx("Emulation `%s' unknown", name);
184		return;
185	}
186
187	if (update_ectx)
188		ectx_update(pid, match);
189
190	if (!default_emul)
191		default_emul = match;
192
193	current = match;
194}
195
196/*
197 * Emulation context list is very simple chained list, not even hashed.
198 * We expect the number of separate traced contexts/processes to be
199 * fairly low, so it's not worth it to optimize this.
200 */
201
202/*
203 * Find an emulation context appropriate for the given pid.
204 */
205static struct emulation_ctx *
206ectx_find(pid)
207	pid_t pid;
208{
209	struct emulation_ctx *ctx;
210
211	for(ctx = emul_ctx; ctx != NULL; ctx = ctx->next) {
212		if (ctx->pid == pid)
213			return ctx;
214	}
215
216	return NULL;
217}
218
219/*
220 * Update emulation context for given pid, or create new if no context
221 * for this pid exists.
222 */
223static void
224ectx_update(pid, emul)
225	pid_t pid;
226	struct emulation *emul;
227{
228	struct emulation_ctx *ctx;
229
230
231	if ((ctx = ectx_find(pid)) != NULL) {
232		/* found and entry, ensure the emulation is right (exec!) */
233		ctx->emulation = emul;
234		return;
235	}
236
237	ctx = (struct emulation_ctx *)malloc(sizeof(struct emulation_ctx));
238	ctx->pid = pid;
239	ctx->emulation = emul;
240
241	/* put the entry on start of emul_ctx chain */
242	ctx->next = emul_ctx;
243	emul_ctx = ctx;
244}
245
246/*
247 * Ensure current emulation context is correct for given pid.
248 */
249void
250ectx_sanify(pid)
251	pid_t pid;
252{
253	struct emulation_ctx *ctx;
254
255	if ((ctx = ectx_find(pid)) != NULL && ctx->emulation != current)
256		current = ctx->emulation;
257	else
258		current = default_emul;
259}
260