1/*-
2 * Copyright (c) 1998-1999 Andrew Gallatin
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer
10 * in this position and unchanged.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software withough specific prior written permission
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
| 1/*-
2 * Copyright (c) 1998-1999 Andrew Gallatin
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer
10 * in this position and unchanged.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 * derived from this software withough specific prior written permission
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 *
|
28 * $FreeBSD: head/sys/compat/ia32/ia32_util.h 107849 2002-12-14 01:56:26Z alfred $
| 28 * $FreeBSD: head/sys/compat/ia32/ia32_util.h 114987 2003-05-14 04:10:49Z peter $
|
29 */
30
31#include <vm/vm.h>
32#include <vm/vm_param.h>
33#include <vm/pmap.h>
34
35
36#include <sys/exec.h>
37#include <sys/sysent.h>
38#include <sys/cdefs.h>
39
40struct ia32_ps_strings {
41 u_int32_t ps_argvstr; /* first of 0 or more argument strings */
42 int ps_nargvstr; /* the number of argument strings */
43 u_int32_t ps_envstr; /* first of 0 or more environment strings */
44 int ps_nenvstr; /* the number of environment strings */
45};
46
| 29 */
30
31#include <vm/vm.h>
32#include <vm/vm_param.h>
33#include <vm/pmap.h>
34
35
36#include <sys/exec.h>
37#include <sys/sysent.h>
38#include <sys/cdefs.h>
39
40struct ia32_ps_strings {
41 u_int32_t ps_argvstr; /* first of 0 or more argument strings */
42 int ps_nargvstr; /* the number of argument strings */
43 u_int32_t ps_envstr; /* first of 0 or more environment strings */
44 int ps_nenvstr; /* the number of environment strings */
45};
46
|
47#define IA32_USRSTACK (4L*1024*1024*1024 - PAGE_SIZE)
| 47#define IA32_USRSTACK USRSTACK
|
48#define IA32_PS_STRINGS (IA32_USRSTACK - sizeof(struct ia32_ps_strings))
49
50static __inline caddr_t stackgap_init(void);
51static __inline void *stackgap_alloc(caddr_t *, size_t);
52
53static __inline caddr_t
54stackgap_init()
55{
56#define szsigcode (*(curproc->p_sysent->sv_szsigcode))
57 return (caddr_t)(((caddr_t)IA32_PS_STRINGS) - szsigcode - SPARE_USRSPACE);
58#undef szsigcode
59}
60
61static __inline void *
62stackgap_alloc(sgp, sz)
63 caddr_t *sgp;
64 size_t sz;
65{
66 void *p;
67
68 p = (void *) *sgp;
69 *sgp += ALIGN(sz);
70 return p;
71}
72
73
74extern const char ia32_emul_path[];
75int ia32_emul_find(struct thread *, caddr_t *, const char *, char *,
76 char **, int);
77
78#define CHECKALT(p, sgp, path, i) \
79 do { \
80 int _error; \
81 \
82 _error = ia32_emul_find(p, sgp, ia32_emul_path, path, \
83 &path, i); \
84 if (_error == EFAULT) \
85 return (_error); \
86 } while (0)
87
88#define CHECKALTEXIST(p, sgp, path) CHECKALT((p), (sgp), (path), 0)
89#define CHECKALTCREAT(p, sgp, path) CHECKALT((p), (sgp), (path), 1)
| 48#define IA32_PS_STRINGS (IA32_USRSTACK - sizeof(struct ia32_ps_strings))
49
50static __inline caddr_t stackgap_init(void);
51static __inline void *stackgap_alloc(caddr_t *, size_t);
52
53static __inline caddr_t
54stackgap_init()
55{
56#define szsigcode (*(curproc->p_sysent->sv_szsigcode))
57 return (caddr_t)(((caddr_t)IA32_PS_STRINGS) - szsigcode - SPARE_USRSPACE);
58#undef szsigcode
59}
60
61static __inline void *
62stackgap_alloc(sgp, sz)
63 caddr_t *sgp;
64 size_t sz;
65{
66 void *p;
67
68 p = (void *) *sgp;
69 *sgp += ALIGN(sz);
70 return p;
71}
72
73
74extern const char ia32_emul_path[];
75int ia32_emul_find(struct thread *, caddr_t *, const char *, char *,
76 char **, int);
77
78#define CHECKALT(p, sgp, path, i) \
79 do { \
80 int _error; \
81 \
82 _error = ia32_emul_find(p, sgp, ia32_emul_path, path, \
83 &path, i); \
84 if (_error == EFAULT) \
85 return (_error); \
86 } while (0)
87
88#define CHECKALTEXIST(p, sgp, path) CHECKALT((p), (sgp), (path), 0)
89#define CHECKALTCREAT(p, sgp, path) CHECKALT((p), (sgp), (path), 1)
|