f2c49dd248
prime objectives are: o Implement a syscall path based on the epc inststruction (see sys/ia64/ia64/syscall.s). o Revisit the places were we need to save and restore registers and define those contexts in terms of the register sets (see sys/ia64/include/_regset.h). Secundairy objectives: o Remove the requirement to use contigmalloc for kernel stacks. o Better handling of the high FP registers for SMP systems. o Switch to the new cpu_switch() and cpu_throw() semantics. o Add a good unwinder to reconstruct contexts for the rare cases we need to (see sys/contrib/ia64/libuwx) Many files are affected by this change. Functionally it boils down to: o The EPC syscall doesn't preserve registers it does not need to preserve and places the arguments differently on the stack. This affects libc and truss. o The address of the kernel page directory (kptdir) had to be unstaticized for use by the nested TLB fault handler. The name has been changed to ia64_kptdir to avoid conflicts. The renaming affects libkvm. o The trapframe only contains the special registers and the scratch registers. For syscalls using the EPC syscall path no scratch registers are saved. This affects all places where the trapframe is accessed. Most notably the unaligned access handler, the signal delivery code and the debugger. o Context switching only partly saves the special registers and the preserved registers. This affects cpu_switch() and triggered the move to the new semantics, which additionally affects cpu_throw(). o The high FP registers are either in the PCB or on some CPU. context switching for them is done lazily. This affects trap(). o The mcontext has room for all registers, but not all of them have to be defined in all cases. This mostly affects signal delivery code now. The *context syscalls are as of yet still unimplemented. Many details went into the removal of the requirement to use contigmalloc for kernel stacks. The details are mostly CPU specific and limited to exception_save() and exception_restore(). The few places where we create, destroy or switch stacks were mostly simplified by not having to construct physical addresses and additionally saving the virtual addresses for later use. Besides more efficient context saving and restoring, which of course yields a noticable speedup, this also fixes the dreaded SMP bootup problem as a side-effect. The details of which are still not fully understood. This change includes all the necessary backward compatibility code to have it handle older userland binaries that use the break instruction for syscalls. Support for break-based syscalls has been pessimized in favor of a clean implementation. Due to the overall better performance of the kernel, this will still be notived as an improvement if it's noticed at all. Approved by: re@ (jhb)
93 lines
3.0 KiB
C
93 lines
3.0 KiB
C
/*-
|
|
* Copyright (c) 1998-1999 Andrew Gallatin
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer
|
|
* in this position and unchanged.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software withough specific prior written permission
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <vm/vm.h>
|
|
#include <vm/vm_param.h>
|
|
#include <vm/pmap.h>
|
|
|
|
|
|
#include <sys/exec.h>
|
|
#include <sys/sysent.h>
|
|
#include <sys/cdefs.h>
|
|
|
|
struct ia32_ps_strings {
|
|
u_int32_t ps_argvstr; /* first of 0 or more argument strings */
|
|
int ps_nargvstr; /* the number of argument strings */
|
|
u_int32_t ps_envstr; /* first of 0 or more environment strings */
|
|
int ps_nenvstr; /* the number of environment strings */
|
|
};
|
|
|
|
#define IA32_MINSIGSTKSZ 2048
|
|
#define IA32_PAGE_SIZE 4096
|
|
#define IA32_USRSTACK (2L*1024*1024*1024 - IA32_PAGE_SIZE*2)
|
|
#define IA32_PS_STRINGS (IA32_USRSTACK - sizeof(struct ia32_ps_strings))
|
|
#define IA32_USRSPACE IA32_PAGE_SIZE
|
|
|
|
static __inline caddr_t stackgap_init(void);
|
|
static __inline void *stackgap_alloc(caddr_t *, size_t);
|
|
|
|
static __inline caddr_t
|
|
stackgap_init()
|
|
{
|
|
#define szsigcode (*(curproc->p_sysent->sv_szsigcode))
|
|
return (((caddr_t)IA32_PS_STRINGS) - szsigcode - IA32_USRSPACE);
|
|
#undef szsigcode
|
|
}
|
|
|
|
static __inline void *
|
|
stackgap_alloc(sgp, sz)
|
|
caddr_t *sgp;
|
|
size_t sz;
|
|
{
|
|
void *p;
|
|
|
|
p = (void *) *sgp;
|
|
*sgp += ALIGN(sz);
|
|
return p;
|
|
}
|
|
|
|
|
|
extern const char ia32_emul_path[];
|
|
int ia32_emul_find(struct thread *, caddr_t *, const char *, char *,
|
|
char **, int);
|
|
|
|
#define CHECKALT(p, sgp, path, i) \
|
|
do { \
|
|
int _error; \
|
|
\
|
|
_error = ia32_emul_find(p, sgp, ia32_emul_path, path, \
|
|
&path, i); \
|
|
if (_error == EFAULT) \
|
|
return (_error); \
|
|
} while (0)
|
|
|
|
#define CHECKALTEXIST(p, sgp, path) CHECKALT((p), (sgp), (path), 0)
|
|
#define CHECKALTCREAT(p, sgp, path) CHECKALT((p), (sgp), (path), 1)
|