2008-11-19 13:26:10 +01:00
|
|
|
|
|
|
|
|
#define _SYSTEM 1
|
|
|
|
|
|
|
|
|
|
#include <minix/callnr.h>
|
|
|
|
|
#include <minix/com.h>
|
|
|
|
|
#include <minix/config.h>
|
|
|
|
|
#include <minix/const.h>
|
|
|
|
|
#include <minix/ds.h>
|
|
|
|
|
#include <minix/endpoint.h>
|
|
|
|
|
#include <minix/keymap.h>
|
|
|
|
|
#include <minix/minlib.h>
|
|
|
|
|
#include <minix/type.h>
|
|
|
|
|
#include <minix/ipc.h>
|
|
|
|
|
#include <minix/sysutil.h>
|
|
|
|
|
#include <minix/syslib.h>
|
|
|
|
|
#include <minix/safecopies.h>
|
2009-09-21 16:49:49 +02:00
|
|
|
#include <minix/bitmap.h>
|
2008-11-19 13:26:10 +01:00
|
|
|
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
#include <env.h>
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <fcntl.h>
|
|
|
|
|
#include <signal.h>
|
2010-04-12 13:25:24 +02:00
|
|
|
#include <assert.h>
|
2008-11-19 13:26:10 +01:00
|
|
|
|
|
|
|
|
#include "glo.h"
|
|
|
|
|
#include "proto.h"
|
|
|
|
|
#include "util.h"
|
|
|
|
|
#include "region.h"
|
|
|
|
|
|
2008-12-08 17:43:20 +01:00
|
|
|
/*===========================================================================*
|
|
|
|
|
* pf_errstr *
|
|
|
|
|
*===========================================================================*/
|
|
|
|
|
char *pf_errstr(u32_t err)
|
2008-11-19 13:26:10 +01:00
|
|
|
{
|
|
|
|
|
static char buf[100];
|
|
|
|
|
|
2011-04-27 15:00:52 +02:00
|
|
|
sprintf(buf, "err 0x%lx ", (long)err);
|
2008-11-19 13:26:10 +01:00
|
|
|
if(PFERR_NOPAGE(err)) strcat(buf, "nopage ");
|
|
|
|
|
if(PFERR_PROT(err)) strcat(buf, "protection ");
|
|
|
|
|
if(PFERR_WRITE(err)) strcat(buf, "write");
|
|
|
|
|
if(PFERR_READ(err)) strcat(buf, "read");
|
|
|
|
|
|
|
|
|
|
return buf;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
2009-04-22 14:39:29 +02:00
|
|
|
* do_pagefaults *
|
2008-11-19 13:26:10 +01:00
|
|
|
*===========================================================================*/
|
2012-03-25 20:25:53 +02:00
|
|
|
void do_pagefaults(message *m)
|
2008-11-19 13:26:10 +01:00
|
|
|
{
|
2010-04-27 01:21:26 +02:00
|
|
|
endpoint_t ep = m->m_source;
|
|
|
|
|
u32_t addr = m->VPF_ADDR;
|
|
|
|
|
u32_t err = m->VPF_FLAGS;
|
2008-11-19 13:26:10 +01:00
|
|
|
struct vmproc *vmp;
|
2011-06-01 11:30:58 +02:00
|
|
|
int s;
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
struct vir_region *region;
|
|
|
|
|
vir_bytes offset;
|
|
|
|
|
int p, wr = PFERR_WRITE(err);
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
if(vm_isokendpt(ep, &p) != OK)
|
|
|
|
|
panic("do_pagefaults: endpoint wrong: %d", ep);
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
vmp = &vmproc[p];
|
|
|
|
|
assert(vmp->vm_flags & VMF_INUSE);
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
/* See if address is valid at all. */
|
2012-09-18 13:17:52 +02:00
|
|
|
if(!(region = map_lookup(vmp, addr, NULL))) {
|
2012-07-18 18:53:20 +02:00
|
|
|
if(PFERR_PROT(err)) {
|
|
|
|
|
printf("VM: pagefault: SIGSEGV %d protected addr 0x%x; %s\n",
|
No more intel/minix segments.
This commit removes all traces of Minix segments (the text/data/stack
memory map abstraction in the kernel) and significance of Intel segments
(hardware segments like CS, DS that add offsets to all addressing before
page table translation). This ultimately simplifies the memory layout
and addressing and makes the same layout possible on non-Intel
architectures.
There are only two types of addresses in the world now: virtual
and physical; even the kernel and processes have the same virtual
address space. Kernel and user processes can be distinguished at a
glance as processes won't use 0xF0000000 and above.
No static pre-allocated memory sizes exist any more.
Changes to booting:
. The pre_init.c leaves the kernel and modules exactly as
they were left by the bootloader in physical memory
. The kernel starts running using physical addressing,
loaded at a fixed location given in its linker script by the
bootloader. All code and data in this phase are linked to
this fixed low location.
. It makes a bootstrap pagetable to map itself to a
fixed high location (also in linker script) and jumps to
the high address. All code and data then use this high addressing.
. All code/data symbols linked at the low addresses is prefixed by
an objcopy step with __k_unpaged_*, so that that code cannot
reference highly-linked symbols (which aren't valid yet) or vice
versa (symbols that aren't valid any more).
. The two addressing modes are separated in the linker script by
collecting the unpaged_*.o objects and linking them with low
addresses, and linking the rest high. Some objects are linked
twice, once low and once high.
. The bootstrap phase passes a lot of information (e.g. free memory
list, physical location of the modules, etc.) using the kinfo
struct.
. After this bootstrap the low-linked part is freed.
. The kernel maps in VM into the bootstrap page table so that VM can
begin executing. Its first job is to make page tables for all other
boot processes. So VM runs before RS, and RS gets a fully dynamic,
VM-managed address space. VM gets its privilege info from RS as usual
but that happens after RS starts running.
. Both the kernel loading VM and VM organizing boot processes happen
using the libexec logic. This removes the last reason for VM to
still know much about exec() and vm/exec.c is gone.
Further Implementation:
. All segments are based at 0 and have a 4 GB limit.
. The kernel is mapped in at the top of the virtual address
space so as not to constrain the user processes.
. Processes do not use segments from the LDT at all; there are
no segments in the LDT any more, so no LLDT is needed.
. The Minix segments T/D/S are gone and so none of the
user-space or in-kernel copy functions use them. The copy
functions use a process endpoint of NONE to realize it's
a physical address, virtual otherwise.
. The umap call only makes sense to translate a virtual address
to a physical address now.
. Segments-related calls like newmap and alloc_segments are gone.
. All segments-related translation in VM is gone (vir2map etc).
. Initialization in VM is simpler as no moving around is necessary.
. VM and all other boot processes can be linked wherever they wish
and will be mapped in at the right location by the kernel and VM
respectively.
Other changes:
. The multiboot code is less special: it does not use mb_print
for its diagnostics any more but uses printf() as normal, saving
the output into the diagnostics buffer, only printing to the
screen using the direct print functions if a panic() occurs.
. The multiboot code uses the flexible 'free memory map list'
style to receive the list of free memory if available.
. The kernel determines the memory layout of the processes to
a degree: it tells VM where the kernel starts and ends and
where the kernel wants the top of the process to be. VM then
uses this entire range, i.e. the stack is right at the top,
and mmap()ped bits of memory are placed below that downwards,
and the break grows upwards.
Other Consequences:
. Every process gets its own page table as address spaces
can't be separated any more by segments.
. As all segments are 0-based, there is no distinction between
virtual and linear addresses, nor between userspace and
kernel addresses.
. Less work is done when context switching, leading to a net
performance increase. (8% faster on my machine for 'make servers'.)
. The layout and configuration of the GDT makes sysenter and syscall
possible.
2012-05-07 16:03:35 +02:00
|
|
|
ep, addr, pf_errstr(err));
|
2012-07-18 18:53:20 +02:00
|
|
|
} else {
|
|
|
|
|
assert(PFERR_NOPAGE(err));
|
|
|
|
|
printf("VM: pagefault: SIGSEGV %d bad addr 0x%x; %s\n",
|
|
|
|
|
ep, addr, pf_errstr(err));
|
|
|
|
|
}
|
2010-04-27 01:21:26 +02:00
|
|
|
if((s=sys_kill(vmp->vm_endpoint, SIGSEGV)) != OK)
|
|
|
|
|
panic("sys_kill failed: %d", s);
|
2011-06-01 11:30:58 +02:00
|
|
|
if((s=sys_vmctl(ep, VMCTL_CLEAR_PAGEFAULT, 0 /*unused*/)) != OK)
|
2010-04-27 01:21:26 +02:00
|
|
|
panic("do_pagefaults: sys_vmctl failed: %d", ep);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If process was writing, see if it's writable. */
|
|
|
|
|
if(!(region->flags & VR_WRITABLE) && wr) {
|
No more intel/minix segments.
This commit removes all traces of Minix segments (the text/data/stack
memory map abstraction in the kernel) and significance of Intel segments
(hardware segments like CS, DS that add offsets to all addressing before
page table translation). This ultimately simplifies the memory layout
and addressing and makes the same layout possible on non-Intel
architectures.
There are only two types of addresses in the world now: virtual
and physical; even the kernel and processes have the same virtual
address space. Kernel and user processes can be distinguished at a
glance as processes won't use 0xF0000000 and above.
No static pre-allocated memory sizes exist any more.
Changes to booting:
. The pre_init.c leaves the kernel and modules exactly as
they were left by the bootloader in physical memory
. The kernel starts running using physical addressing,
loaded at a fixed location given in its linker script by the
bootloader. All code and data in this phase are linked to
this fixed low location.
. It makes a bootstrap pagetable to map itself to a
fixed high location (also in linker script) and jumps to
the high address. All code and data then use this high addressing.
. All code/data symbols linked at the low addresses is prefixed by
an objcopy step with __k_unpaged_*, so that that code cannot
reference highly-linked symbols (which aren't valid yet) or vice
versa (symbols that aren't valid any more).
. The two addressing modes are separated in the linker script by
collecting the unpaged_*.o objects and linking them with low
addresses, and linking the rest high. Some objects are linked
twice, once low and once high.
. The bootstrap phase passes a lot of information (e.g. free memory
list, physical location of the modules, etc.) using the kinfo
struct.
. After this bootstrap the low-linked part is freed.
. The kernel maps in VM into the bootstrap page table so that VM can
begin executing. Its first job is to make page tables for all other
boot processes. So VM runs before RS, and RS gets a fully dynamic,
VM-managed address space. VM gets its privilege info from RS as usual
but that happens after RS starts running.
. Both the kernel loading VM and VM organizing boot processes happen
using the libexec logic. This removes the last reason for VM to
still know much about exec() and vm/exec.c is gone.
Further Implementation:
. All segments are based at 0 and have a 4 GB limit.
. The kernel is mapped in at the top of the virtual address
space so as not to constrain the user processes.
. Processes do not use segments from the LDT at all; there are
no segments in the LDT any more, so no LLDT is needed.
. The Minix segments T/D/S are gone and so none of the
user-space or in-kernel copy functions use them. The copy
functions use a process endpoint of NONE to realize it's
a physical address, virtual otherwise.
. The umap call only makes sense to translate a virtual address
to a physical address now.
. Segments-related calls like newmap and alloc_segments are gone.
. All segments-related translation in VM is gone (vir2map etc).
. Initialization in VM is simpler as no moving around is necessary.
. VM and all other boot processes can be linked wherever they wish
and will be mapped in at the right location by the kernel and VM
respectively.
Other changes:
. The multiboot code is less special: it does not use mb_print
for its diagnostics any more but uses printf() as normal, saving
the output into the diagnostics buffer, only printing to the
screen using the direct print functions if a panic() occurs.
. The multiboot code uses the flexible 'free memory map list'
style to receive the list of free memory if available.
. The kernel determines the memory layout of the processes to
a degree: it tells VM where the kernel starts and ends and
where the kernel wants the top of the process to be. VM then
uses this entire range, i.e. the stack is right at the top,
and mmap()ped bits of memory are placed below that downwards,
and the break grows upwards.
Other Consequences:
. Every process gets its own page table as address spaces
can't be separated any more by segments.
. As all segments are 0-based, there is no distinction between
virtual and linear addresses, nor between userspace and
kernel addresses.
. Less work is done when context switching, leading to a net
performance increase. (8% faster on my machine for 'make servers'.)
. The layout and configuration of the GDT makes sysenter and syscall
possible.
2012-05-07 16:03:35 +02:00
|
|
|
printf("VM: pagefault: SIGSEGV %d ro map 0x%x %s\n",
|
|
|
|
|
ep, addr, pf_errstr(err));
|
2010-04-27 01:21:26 +02:00
|
|
|
if((s=sys_kill(vmp->vm_endpoint, SIGSEGV)) != OK)
|
|
|
|
|
panic("sys_kill failed: %d", s);
|
2011-06-01 11:30:58 +02:00
|
|
|
if((s=sys_vmctl(ep, VMCTL_CLEAR_PAGEFAULT, 0 /*unused*/)) != OK)
|
2010-03-05 16:05:11 +01:00
|
|
|
panic("do_pagefaults: sys_vmctl failed: %d", ep);
|
2010-04-27 01:21:26 +02:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
assert(addr >= region->vaddr);
|
|
|
|
|
offset = addr - region->vaddr;
|
2009-09-21 16:49:49 +02:00
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
/* Access is allowed; handle it. */
|
2011-06-01 11:30:58 +02:00
|
|
|
if((map_pf(vmp, region, offset, wr)) != OK) {
|
2010-04-27 01:21:26 +02:00
|
|
|
printf("VM: pagefault: SIGSEGV %d pagefault not handled\n", ep);
|
|
|
|
|
if((s=sys_kill(vmp->vm_endpoint, SIGSEGV)) != OK)
|
|
|
|
|
panic("sys_kill failed: %d", s);
|
2011-06-01 11:30:58 +02:00
|
|
|
if((s=sys_vmctl(ep, VMCTL_CLEAR_PAGEFAULT, 0 /*unused*/)) != OK)
|
2010-04-27 01:21:26 +02:00
|
|
|
panic("do_pagefaults: sys_vmctl failed: %d", ep);
|
|
|
|
|
return;
|
2008-11-19 13:26:10 +01:00
|
|
|
}
|
|
|
|
|
|
2010-04-27 01:21:26 +02:00
|
|
|
/* Pagefault is handled, so now reactivate the process. */
|
2011-06-01 11:30:58 +02:00
|
|
|
if((s=sys_vmctl(ep, VMCTL_CLEAR_PAGEFAULT, 0 /*unused*/)) != OK)
|
2010-04-27 01:21:26 +02:00
|
|
|
panic("do_pagefaults: sys_vmctl failed: %d", ep);
|
2008-11-19 13:26:10 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
2010-01-14 16:24:16 +01:00
|
|
|
* do_memory *
|
2008-11-19 13:26:10 +01:00
|
|
|
*===========================================================================*/
|
2012-03-25 20:25:53 +02:00
|
|
|
void do_memory(void)
|
2008-11-19 13:26:10 +01:00
|
|
|
{
|
2010-01-14 16:24:16 +01:00
|
|
|
endpoint_t who, who_s, requestor;
|
|
|
|
|
vir_bytes mem, mem_s;
|
2008-11-19 13:26:10 +01:00
|
|
|
vir_bytes len;
|
|
|
|
|
int wrflag;
|
|
|
|
|
|
2010-01-14 16:24:16 +01:00
|
|
|
while(1) {
|
2008-11-19 13:26:10 +01:00
|
|
|
int p, r = OK;
|
|
|
|
|
struct vmproc *vmp;
|
|
|
|
|
|
2010-01-14 16:24:16 +01:00
|
|
|
r = sys_vmctl_get_memreq(&who, &mem, &len, &wrflag, &who_s,
|
|
|
|
|
&mem_s, &requestor);
|
|
|
|
|
|
|
|
|
|
switch(r) {
|
|
|
|
|
case VMPTYPE_CHECK:
|
|
|
|
|
if(vm_isokendpt(who, &p) != OK)
|
2010-03-05 16:05:11 +01:00
|
|
|
panic("do_memory: bad endpoint: %d", who);
|
2010-01-14 16:24:16 +01:00
|
|
|
vmp = &vmproc[p];
|
|
|
|
|
|
|
|
|
|
r = handle_memory(vmp, mem, len, wrflag);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return;
|
|
|
|
|
}
|
2008-11-19 13:26:10 +01:00
|
|
|
|
2009-09-21 16:49:49 +02:00
|
|
|
if(sys_vmctl(requestor, VMCTL_MEMREQ_REPLY, r) != OK)
|
2010-03-05 16:05:11 +01:00
|
|
|
panic("do_memory: sys_vmctl failed: %d", r);
|
2008-11-19 13:26:10 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-09-21 16:49:49 +02:00
|
|
|
int handle_memory(struct vmproc *vmp, vir_bytes mem, vir_bytes len, int wrflag)
|
|
|
|
|
{
|
|
|
|
|
struct vir_region *region;
|
|
|
|
|
vir_bytes o;
|
|
|
|
|
|
|
|
|
|
/* Page-align memory and length. */
|
|
|
|
|
o = mem % VM_PAGE_SIZE;
|
|
|
|
|
mem -= o;
|
|
|
|
|
len += o;
|
|
|
|
|
o = len % VM_PAGE_SIZE;
|
|
|
|
|
if(o > 0) len += VM_PAGE_SIZE - o;
|
|
|
|
|
|
2009-12-08 14:35:52 +01:00
|
|
|
while(len > 0) {
|
|
|
|
|
int r;
|
2012-09-18 13:17:52 +02:00
|
|
|
if(!(region = map_lookup(vmp, mem, NULL))) {
|
2009-12-29 22:35:12 +01:00
|
|
|
#if VERBOSE
|
2009-12-08 14:35:52 +01:00
|
|
|
map_printmap(vmp);
|
|
|
|
|
printf("VM: do_memory: memory doesn't exist\n");
|
2009-12-29 22:35:12 +01:00
|
|
|
#endif
|
2009-12-08 14:35:52 +01:00
|
|
|
r = EFAULT;
|
|
|
|
|
} else if(!(region->flags & VR_WRITABLE) && wrflag) {
|
2009-12-29 22:35:12 +01:00
|
|
|
#if VERBOSE
|
2009-12-08 14:35:52 +01:00
|
|
|
printf("VM: do_memory: write to unwritable map\n");
|
2009-12-29 22:35:12 +01:00
|
|
|
#endif
|
2009-12-08 14:35:52 +01:00
|
|
|
r = EFAULT;
|
|
|
|
|
} else {
|
|
|
|
|
vir_bytes offset, sublen;
|
2010-04-12 14:37:28 +02:00
|
|
|
assert(region->vaddr <= mem);
|
|
|
|
|
assert(!(region->vaddr % VM_PAGE_SIZE));
|
2009-12-08 14:35:52 +01:00
|
|
|
offset = mem - region->vaddr;
|
|
|
|
|
sublen = len;
|
|
|
|
|
if(offset + sublen > region->length)
|
|
|
|
|
sublen = region->length - offset;
|
|
|
|
|
|
|
|
|
|
r = map_handle_memory(vmp, region, offset,
|
|
|
|
|
sublen, wrflag);
|
|
|
|
|
|
|
|
|
|
len -= sublen;
|
|
|
|
|
mem += sublen;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if(r != OK) {
|
2009-12-29 22:35:12 +01:00
|
|
|
#if VERBOSE
|
2009-12-08 14:35:52 +01:00
|
|
|
printf("VM: memory range 0x%lx-0x%lx not available in %d\n",
|
No more intel/minix segments.
This commit removes all traces of Minix segments (the text/data/stack
memory map abstraction in the kernel) and significance of Intel segments
(hardware segments like CS, DS that add offsets to all addressing before
page table translation). This ultimately simplifies the memory layout
and addressing and makes the same layout possible on non-Intel
architectures.
There are only two types of addresses in the world now: virtual
and physical; even the kernel and processes have the same virtual
address space. Kernel and user processes can be distinguished at a
glance as processes won't use 0xF0000000 and above.
No static pre-allocated memory sizes exist any more.
Changes to booting:
. The pre_init.c leaves the kernel and modules exactly as
they were left by the bootloader in physical memory
. The kernel starts running using physical addressing,
loaded at a fixed location given in its linker script by the
bootloader. All code and data in this phase are linked to
this fixed low location.
. It makes a bootstrap pagetable to map itself to a
fixed high location (also in linker script) and jumps to
the high address. All code and data then use this high addressing.
. All code/data symbols linked at the low addresses is prefixed by
an objcopy step with __k_unpaged_*, so that that code cannot
reference highly-linked symbols (which aren't valid yet) or vice
versa (symbols that aren't valid any more).
. The two addressing modes are separated in the linker script by
collecting the unpaged_*.o objects and linking them with low
addresses, and linking the rest high. Some objects are linked
twice, once low and once high.
. The bootstrap phase passes a lot of information (e.g. free memory
list, physical location of the modules, etc.) using the kinfo
struct.
. After this bootstrap the low-linked part is freed.
. The kernel maps in VM into the bootstrap page table so that VM can
begin executing. Its first job is to make page tables for all other
boot processes. So VM runs before RS, and RS gets a fully dynamic,
VM-managed address space. VM gets its privilege info from RS as usual
but that happens after RS starts running.
. Both the kernel loading VM and VM organizing boot processes happen
using the libexec logic. This removes the last reason for VM to
still know much about exec() and vm/exec.c is gone.
Further Implementation:
. All segments are based at 0 and have a 4 GB limit.
. The kernel is mapped in at the top of the virtual address
space so as not to constrain the user processes.
. Processes do not use segments from the LDT at all; there are
no segments in the LDT any more, so no LLDT is needed.
. The Minix segments T/D/S are gone and so none of the
user-space or in-kernel copy functions use them. The copy
functions use a process endpoint of NONE to realize it's
a physical address, virtual otherwise.
. The umap call only makes sense to translate a virtual address
to a physical address now.
. Segments-related calls like newmap and alloc_segments are gone.
. All segments-related translation in VM is gone (vir2map etc).
. Initialization in VM is simpler as no moving around is necessary.
. VM and all other boot processes can be linked wherever they wish
and will be mapped in at the right location by the kernel and VM
respectively.
Other changes:
. The multiboot code is less special: it does not use mb_print
for its diagnostics any more but uses printf() as normal, saving
the output into the diagnostics buffer, only printing to the
screen using the direct print functions if a panic() occurs.
. The multiboot code uses the flexible 'free memory map list'
style to receive the list of free memory if available.
. The kernel determines the memory layout of the processes to
a degree: it tells VM where the kernel starts and ends and
where the kernel wants the top of the process to be. VM then
uses this entire range, i.e. the stack is right at the top,
and mmap()ped bits of memory are placed below that downwards,
and the break grows upwards.
Other Consequences:
. Every process gets its own page table as address spaces
can't be separated any more by segments.
. As all segments are 0-based, there is no distinction between
virtual and linear addresses, nor between userspace and
kernel addresses.
. Less work is done when context switching, leading to a net
performance increase. (8% faster on my machine for 'make servers'.)
. The layout and configuration of the GDT makes sysenter and syscall
possible.
2012-05-07 16:03:35 +02:00
|
|
|
mem, mem+len, vmp->vm_endpoint);
|
2009-12-29 22:35:12 +01:00
|
|
|
#endif
|
2009-12-08 14:35:52 +01:00
|
|
|
return r;
|
|
|
|
|
}
|
2009-09-21 16:49:49 +02:00
|
|
|
}
|
2009-11-22 14:06:18 +01:00
|
|
|
|
2009-12-08 14:35:52 +01:00
|
|
|
return OK;
|
2009-09-21 16:49:49 +02:00
|
|
|
}
|
New RS and new signal handling for system processes.
UPDATING INFO:
20100317:
/usr/src/etc/system.conf updated to ignore default kernel calls: copy
it (or merge it) to /etc/system.conf.
The hello driver (/dev/hello) added to the distribution:
# cd /usr/src/commands/scripts && make clean install
# cd /dev && MAKEDEV hello
KERNEL CHANGES:
- Generic signal handling support. The kernel no longer assumes PM as a signal
manager for every process. The signal manager of a given process can now be
specified in its privilege slot. When a signal has to be delivered, the kernel
performs the lookup and forwards the signal to the appropriate signal manager.
PM is the default signal manager for user processes, RS is the default signal
manager for system processes. To enable ptrace()ing for system processes, it
is sufficient to change the default signal manager to PM. This will temporarily
disable crash recovery, though.
- sys_exit() is now split into sys_exit() (i.e. exit() for system processes,
which generates a self-termination signal), and sys_clear() (i.e. used by PM
to ask the kernel to clear a process slot when a process exits).
- Added a new kernel call (i.e. sys_update()) to swap two process slots and
implement live update.
PM CHANGES:
- Posix signal handling is no longer allowed for system processes. System
signals are split into two fixed categories: termination and non-termination
signals. When a non-termination signaled is processed, PM transforms the signal
into an IPC message and delivers the message to the system process. When a
termination signal is processed, PM terminates the process.
- PM no longer assumes itself as the signal manager for system processes. It now
makes sure that every system signal goes through the kernel before being
actually processes. The kernel will then dispatch the signal to the appropriate
signal manager which may or may not be PM.
SYSLIB CHANGES:
- Simplified SEF init and LU callbacks.
- Added additional predefined SEF callbacks to debug crash recovery and
live update.
- Fixed a temporary ack in the SEF init protocol. SEF init reply is now
completely synchronous.
- Added SEF signal event type to provide a uniform interface for system
processes to deal with signals. A sef_cb_signal_handler() callback is
available for system processes to handle every received signal. A
sef_cb_signal_manager() callback is used by signal managers to process
system signals on behalf of the kernel.
- Fixed a few bugs with memory mapping and DS.
VM CHANGES:
- Page faults and memory requests coming from the kernel are now implemented
using signals.
- Added a new VM call to swap two process slots and implement live update.
- The call is used by RS at update time and in turn invokes the kernel call
sys_update().
RS CHANGES:
- RS has been reworked with a better functional decomposition.
- Better kernel call masks. com.h now defines the set of very basic kernel calls
every system service is allowed to use. This makes system.conf simpler and
easier to maintain. In addition, this guarantees a higher level of isolation
for system libraries that use one or more kernel calls internally (e.g. printf).
- RS is the default signal manager for system processes. By default, RS
intercepts every signal delivered to every system process. This makes crash
recovery possible before bringing PM and friends in the loop.
- RS now supports fast rollback when something goes wrong while initializing
the new version during a live update.
- Live update is now implemented by keeping the two versions side-by-side and
swapping the process slots when the old version is ready to update.
- Crash recovery is now implemented by keeping the two versions side-by-side
and cleaning up the old version only when the recovery process is complete.
DS CHANGES:
- Fixed a bug when the process doing ds_publish() or ds_delete() is not known
by DS.
- Fixed the completely broken support for strings. String publishing is now
implemented in the system library and simply wraps publishing of memory ranges.
Ideally, we should adopt a similar approach for other data types as well.
- Test suite fixed.
DRIVER CHANGES:
- The hello driver has been added to the Minix distribution to demonstrate basic
live update and crash recovery functionalities.
- Other drivers have been adapted to conform the new SEF interface.
2010-03-17 02:15:29 +01:00
|
|
|
|
