setemul.c revision 1.6
1/* $NetBSD: setemul.c,v 1.6 2001/02/02 07:41:54 mrg 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.6 2001/02/02 07:41:54 mrg 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/sunos32/sunos32_syscall.h" 101#include "../../sys/compat/sunos/sunos_syscall.h" 102#include "../../sys/compat/svr4/svr4_syscall.h" 103#include "../../sys/compat/ultrix/ultrix_syscall.h" 104 105#define KTRACE 106#include "../../sys/kern/syscalls.c" 107 108#include "../../sys/compat/netbsd32/netbsd32_syscalls.c" 109#include "../../sys/compat/freebsd/freebsd_syscalls.c" 110#include "../../sys/compat/hpux/hpux_syscalls.c" 111#include "../../sys/compat/ibcs2/ibcs2_syscalls.c" 112#include "../../sys/compat/linux/linux_syscalls.c" 113#include "../../sys/compat/osf1/osf1_syscalls.c" 114#include "../../sys/compat/sunos/sunos_syscalls.c" 115#include "../../sys/compat/sunos32/sunos32_syscalls.c" 116#include "../../sys/compat/svr4/svr4_syscalls.c" 117#include "../../sys/compat/ultrix/ultrix_syscalls.c" 118 119#include "../../sys/compat/hpux/hpux_errno.c" 120#include "../../sys/compat/svr4/svr4_errno.c" 121#include "../../sys/compat/ibcs2/ibcs2_errno.c" 122#include "../../sys/compat/linux/common/linux_errno.c" 123#undef KTRACE 124 125#define NELEM(a) (sizeof(a) / sizeof(a[0])) 126 127static const struct emulation emulations[] = { 128 { "netbsd", syscallnames, SYS_MAXSYSCALL, 129 NULL, 0 }, 130 { "netbsd32", netbsd32_syscallnames, SYS_MAXSYSCALL, 131 NULL, 0 }, 132 { "freebsd", freebsd_syscallnames, FREEBSD_SYS_MAXSYSCALL, 133 NULL, 0 }, 134 { "hpux", hpux_syscallnames, HPUX_SYS_MAXSYSCALL, 135 native_to_hpux_errno, NELEM(native_to_hpux_errno) }, 136 { "ibcs2", ibcs2_syscallnames, IBCS2_SYS_MAXSYSCALL, 137 native_to_ibcs2_errno, NELEM(native_to_ibcs2_errno) }, 138 { "linux", linux_syscallnames, LINUX_SYS_MAXSYSCALL, 139 native_to_linux_errno, NELEM(native_to_linux_errno) }, 140 { "osf1", osf1_syscallnames, OSF1_SYS_MAXSYSCALL, 141 NULL, 0 }, 142 { "sunos32",sunos32_syscallnames, SUNOS32_SYS_MAXSYSCALL, 143 NULL, 0 }, 144 { "sunos", sunos_syscallnames, SUNOS_SYS_MAXSYSCALL, 145 NULL, 0 }, 146 { "svr4", svr4_syscallnames, SVR4_SYS_MAXSYSCALL, 147 native_to_svr4_errno, NELEM(native_to_svr4_errno) }, 148 { "ultrix", ultrix_syscallnames, ULTRIX_SYS_MAXSYSCALL, 149 NULL, 0 }, 150 { "pecoff", syscallnames, SYS_MAXSYSCALL, 151 NULL, 0 }, 152 { NULL, NULL, 0, 153 NULL, 0 } 154}; 155 156struct emulation_ctx { 157 pid_t pid; 158 const struct emulation *emulation; 159 struct emulation_ctx *next; 160}; 161 162const struct emulation *current; 163 164static const struct emulation *default_emul=NULL; 165 166struct emulation_ctx *current_ctx; 167struct emulation_ctx *emul_ctx = NULL; 168 169static struct emulation_ctx *ectx_find __P((pid_t)); 170static void ectx_update __P((pid_t, const struct emulation *)); 171 172void 173setemul(name, pid, update_ectx) 174 const char *name; 175 pid_t pid; 176 int update_ectx; 177{ 178 int i; 179 const struct emulation *match = NULL; 180 181 for (i = 0; emulations[i].name != NULL; i++) { 182 if (strcmp(emulations[i].name, name) == 0) { 183 match = &emulations[i]; 184 break; 185 } 186 } 187 188 if (!match) { 189 warnx("Emulation `%s' unknown", name); 190 return; 191 } 192 193 if (update_ectx) 194 ectx_update(pid, match); 195 196 if (!default_emul) 197 default_emul = match; 198 199 current = match; 200} 201 202/* 203 * Emulation context list is very simple chained list, not even hashed. 204 * We expect the number of separate traced contexts/processes to be 205 * fairly low, so it's not worth it to optimize this. 206 */ 207 208/* 209 * Find an emulation context appropriate for the given pid. 210 */ 211static struct emulation_ctx * 212ectx_find(pid) 213 pid_t pid; 214{ 215 struct emulation_ctx *ctx; 216 217 for(ctx = emul_ctx; ctx != NULL; ctx = ctx->next) { 218 if (ctx->pid == pid) 219 return ctx; 220 } 221 222 return NULL; 223} 224 225/* 226 * Update emulation context for given pid, or create new if no context 227 * for this pid exists. 228 */ 229static void 230ectx_update(pid, emul) 231 pid_t pid; 232 const struct emulation *emul; 233{ 234 struct emulation_ctx *ctx; 235 236 237 if ((ctx = ectx_find(pid)) != NULL) { 238 /* found and entry, ensure the emulation is right (exec!) */ 239 ctx->emulation = emul; 240 return; 241 } 242 243 ctx = (struct emulation_ctx *)malloc(sizeof(struct emulation_ctx)); 244 ctx->pid = pid; 245 ctx->emulation = emul; 246 247 /* put the entry on start of emul_ctx chain */ 248 ctx->next = emul_ctx; 249 emul_ctx = ctx; 250} 251 252/* 253 * Ensure current emulation context is correct for given pid. 254 */ 255void 256ectx_sanify(pid) 257 pid_t pid; 258{ 259 struct emulation_ctx *ctx; 260 261 if ((ctx = ectx_find(pid)) != NULL) 262 current = ctx->emulation; 263 else if (default_emul) 264 current = default_emul; 265 else 266 current = &emulations[0]; /* NetBSD */ 267} 268