compat_util.c revision 1.18 1 /* $NetBSD: compat_util.c,v 1.18 2000/11/20 20:23:07 jdolecek Exp $ */
2
3 /*-
4 * Copyright (c) 1994 The NetBSD Foundation, Inc.
5 * All rights reserved.
6 *
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Christos Zoulas and Frank van der Linden.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the NetBSD
21 * Foundation, Inc. and its contributors.
22 * 4. Neither the name of The NetBSD Foundation nor the names of its
23 * contributors may be used to endorse or promote products derived
24 * from this software without specific prior written permission.
25 *
26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 * POSSIBILITY OF SUCH DAMAGE.
37 */
38
39 #include <sys/param.h>
40 #include <sys/systm.h>
41 #include <sys/namei.h>
42 #include <sys/proc.h>
43 #include <sys/file.h>
44 #include <sys/stat.h>
45 #include <sys/filedesc.h>
46 #include <sys/exec.h>
47 #include <sys/ioctl.h>
48 #include <sys/kernel.h>
49 #include <sys/malloc.h>
50 #include <sys/vnode.h>
51 #include <sys/syslog.h>
52 #include <sys/mount.h>
53
54
55 #include <compat/common/compat_util.h>
56
57 /*
58 * Search an alternate path before passing pathname arguments on
59 * to system calls. Useful for keeping a separate 'emulation tree'.
60 *
61 * If cflag is set, we check if an attempt can be made to create
62 * the named file, i.e. we check if the directory it should
63 * be in exists.
64 *
65 * In case of success, emul_find returns 0:
66 * If sgp is provided, the path is in user space, and pbuf gets
67 * allocated in user space (in the stackgap). Otherwise the path
68 * is already in kernel space and a kernel buffer gets allocated
69 * and returned in pbuf, that must be freed by the user.
70 * In case of error, the error number is returned and *pbuf = path.
71 */
72 int
73 emul_find(p, sgp, prefix, path, pbuf, cflag)
74 struct proc *p;
75 caddr_t *sgp; /* Pointer to stackgap memory */
76 const char *prefix;
77 const char *path;
78 const char **pbuf;
79 int cflag;
80 {
81 struct nameidata nd;
82 struct nameidata ndroot;
83 struct vattr vat;
84 struct vattr vatroot;
85 int error;
86 char *ptr, *buf, *cp;
87 const char *pr;
88 size_t sz, len;
89
90 buf = (char *)malloc(MAXPATHLEN, M_TEMP, M_WAITOK);
91 *pbuf = path;
92
93 for (ptr = buf, pr = prefix; (*ptr = *pr) != '\0'; ptr++, pr++)
94 continue;
95
96 sz = MAXPATHLEN - (ptr - buf);
97
98 /*
99 * If sgp is not given then the path is already in kernel space
100 */
101 if (sgp == NULL)
102 error = copystr(path, ptr, sz, &len);
103 else
104 error = copyinstr(path, ptr, sz, &len);
105
106 if (error)
107 goto bad;
108
109 if (*ptr != '/') {
110 error = EINVAL;
111 goto bad;
112 }
113
114 /*
115 * We provide an escape method, so that the user can
116 * always specify the real root. If the path is prefixed
117 * by /../ we kill the alternate search
118 */
119 if (ptr[1] == '.' && ptr[2] == '.' && ptr[3] == '/') {
120 len -= 3;
121 (void)memcpy(buf, &ptr[3], len);
122 ptr = buf;
123 goto good;
124 }
125
126 /*
127 * We know that there is a / somewhere in this pathname.
128 * Search backwards for it, to find the file's parent dir
129 * to see if it exists in the alternate tree. If it does,
130 * and we want to create a file (cflag is set). We don't
131 * need to worry about the root comparison in this case.
132 */
133
134 if (cflag) {
135 for (cp = &ptr[len] - 1; *cp != '/'; cp--)
136 ;
137 *cp = '\0';
138
139 NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, buf, p);
140
141 if ((error = namei(&nd)) != 0)
142 goto bad;
143
144 *cp = '/';
145 }
146 else {
147 NDINIT(&nd, LOOKUP, FOLLOW, UIO_SYSSPACE, buf, p);
148
149 if ((error = namei(&nd)) != 0)
150 goto bad;
151
152 /*
153 * We now compare the vnode of the emulation root to the one
154 * vnode asked. If they resolve to be the same, then we
155 * ignore the match so that the real root gets used.
156 * This avoids the problem of traversing "../.." to find the
157 * root directory and never finding it, because "/" resolves
158 * to the emulation root directory. This is expensive :-(
159 */
160 NDINIT(&ndroot, LOOKUP, FOLLOW, UIO_SYSSPACE, prefix, p);
161
162 if ((error = namei(&ndroot)) != 0)
163 goto bad2;
164
165 if ((error = VOP_GETATTR(nd.ni_vp, &vat, p->p_ucred, p)) != 0)
166 goto bad3;
167
168 if ((error = VOP_GETATTR(ndroot.ni_vp, &vatroot, p->p_ucred, p))
169 != 0)
170 goto bad3;
171
172 if (vat.va_fsid == vatroot.va_fsid &&
173 vat.va_fileid == vatroot.va_fileid) {
174 error = ENOENT;
175 goto bad3;
176 }
177 }
178
179 vrele(nd.ni_vp);
180 if (!cflag)
181 vrele(ndroot.ni_vp);
182
183 good:
184 if (sgp == NULL)
185 *pbuf = buf;
186 else {
187 sz = &ptr[len] - buf;
188 *pbuf = stackgap_alloc(sgp, sz + 1);
189 if (*pbuf == NULL) {
190 error = ENAMETOOLONG;
191 goto bad;
192 }
193 if ((error = copyout(buf, (void *)*pbuf, sz)) != 0) {
194 *pbuf = path;
195 goto bad;
196 }
197 free(buf, M_TEMP);
198 }
199 return 0;
200
201 bad3:
202 vrele(ndroot.ni_vp);
203 bad2:
204 vrele(nd.ni_vp);
205 bad:
206 free(buf, M_TEMP);
207 return error;
208 }
209
210 /*
211 * Translate one set of flags to another, based on the entries in
212 * the given table. If 'leftover' is specified, it is filled in
213 * with any flags which could not be translated.
214 */
215 unsigned long
216 emul_flags_translate(const struct emul_flags_xtab *tab,
217 unsigned long in, unsigned long *leftover)
218 {
219 unsigned long out;
220
221 for (out = 0; tab->omask != 0; tab++) {
222 if ((in & tab->omask) == tab->oval) {
223 in &= ~tab->omask;
224 out |= tab->nval;
225 }
226 }
227 if (leftover != NULL)
228 *leftover = in;
229 return (out);
230 }
231
232 caddr_t
233 stackgap_init(e)
234 const struct emul *e;
235 {
236 struct proc *p = curproc; /* XXX */
237
238 #define szsigcode ((caddr_t)(e->e_esigcode - e->e_sigcode))
239 return (caddr_t)(((unsigned long)p->p_psstr - (unsigned long)szsigcode
240 - STACKGAPLEN) & ~ALIGNBYTES);
241 #undef szsigcode
242 }
243
244
245 void *
246 stackgap_alloc(sgp, sz)
247 caddr_t *sgp;
248 size_t sz;
249 {
250 void *n = (void *) *sgp;
251 caddr_t nsgp;
252 struct proc *p = curproc; /* XXX */
253 const struct emul *e = p->p_emul;
254 int sigsize = e->e_esigcode - e->e_sigcode;
255
256 sz = ALIGN(sz);
257 nsgp = *sgp + sz;
258 if (nsgp > (((caddr_t)p->p_psstr) - sigsize))
259 return NULL;
260 *sgp = nsgp;
261 return n;
262 }
263
264 void
265 compat_offseterr(vp, msg)
266 struct vnode *vp;
267 char *msg;
268 {
269 struct mount *mp;
270
271 mp = vp->v_mount;
272
273 log(LOG_ERR, "%s: dir offset too large on fs %s (mounted from %s)\n",
274 msg, mp->mnt_stat.f_mntonname, mp->mnt_stat.f_mntfromname);
275 uprintf("%s: dir offset too large for emulated program\n", msg);
276 }
277