2009-01-26 18:43:59 +01:00
|
|
|
/* The kernel call implemented in this file:
|
|
|
|
|
* m_type: SYS_SYSCTL
|
|
|
|
|
*
|
|
|
|
|
* The parameters for this kernel call are:
|
|
|
|
|
* SYSCTL_CODE request
|
|
|
|
|
* and then request-specific arguments in SYSCTL_ARG1 and SYSCTL_ARG2.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "../system.h"
|
|
|
|
|
#include "../vm.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
|
|
|
|
* do_sysctl *
|
|
|
|
|
*===========================================================================*/
|
|
|
|
|
PUBLIC int do_sysctl(m_ptr)
|
|
|
|
|
register message *m_ptr; /* pointer to request message */
|
|
|
|
|
{
|
|
|
|
|
vir_bytes len, buf;
|
|
|
|
|
static char mybuf[DIAG_BUFSIZE];
|
2009-01-27 13:54:33 +01:00
|
|
|
struct proc *caller, *target;
|
|
|
|
|
int s, i, proc_nr;
|
2009-01-26 18:43:59 +01:00
|
|
|
|
|
|
|
|
caller = proc_addr(who_p);
|
|
|
|
|
|
|
|
|
|
switch (m_ptr->SYSCTL_CODE) {
|
|
|
|
|
case SYSCTL_CODE_DIAG:
|
|
|
|
|
buf = (vir_bytes) m_ptr->SYSCTL_ARG1;
|
|
|
|
|
len = (vir_bytes) m_ptr->SYSCTL_ARG2;
|
|
|
|
|
if(len < 1 || len > DIAG_BUFSIZE) {
|
|
|
|
|
kprintf("do_sysctl: diag for %d: len %d out of range\n",
|
|
|
|
|
caller->p_endpoint, len);
|
|
|
|
|
return EINVAL;
|
|
|
|
|
}
|
Primary goal for these changes is:
- no longer have kernel have its own page table that is loaded
on every kernel entry (trap, interrupt, exception). the primary
purpose is to reduce the number of required reloads.
Result:
- kernel can only access memory of process that was running when
kernel was entered
- kernel must be mapped into every process page table, so traps to
kernel keep working
Problem:
- kernel must often access memory of arbitrary processes (e.g. send
arbitrary processes messages); this can't happen directly any more;
usually because that process' page table isn't loaded at all, sometimes
because that memory isn't mapped in at all, sometimes because it isn't
mapped in read-write.
So:
- kernel must be able to map in memory of any process, in its own
address space.
Implementation:
- VM and kernel share a range of memory in which addresses of
all page tables of all processes are available. This has two purposes:
. Kernel has to know what data to copy in order to map in a range
. Kernel has to know where to write the data in order to map it in
That last point is because kernel has to write in the currently loaded
page table.
- Processes and kernel are separated through segments; kernel segments
haven't changed.
- The kernel keeps the process whose page table is currently loaded
in 'ptproc.'
- If it wants to map in a range of memory, it writes the value of the
page directory entry for that range into the page directory entry
in the currently loaded map. There is a slot reserved for such
purposes. The kernel can then access this memory directly.
- In order to do this, its segment has been increased (and the
segments of processes start where it ends).
- In the pagefault handler, detect if the kernel is doing
'trappable' memory access (i.e. a pagefault isn't a fatal
error) and if so,
- set the saved instruction pointer to phys_copy_fault,
breaking out of phys_copy
- set the saved eax register to the address of the page
fault, both for sanity checking and for checking in
which of the two ranges that phys_copy was called
with the fault occured
- Some boot-time processes do not have their own page table,
and are mapped in with the kernel, and separated with
segments. The kernel detects this using HASPT. If such a
process has to be scheduled, any page table will work and
no page table switch is done.
Major changes in kernel are
- When accessing user processes memory, kernel no longer
explicitly checks before it does so if that memory is OK.
It simply makes the mapping (if necessary), tries to do the
operation, and traps the pagefault if that memory isn't present;
if that happens, the copy function returns EFAULT.
So all of the CHECKRANGE_OR_SUSPEND macros are gone.
- Kernel no longer has to copy/read and parse page tables.
- A message copying optimisation: when messages are copied, and
the recipient isn't mapped in, they are copied into a buffer
in the kernel. This is done in QueueMess. The next time
the recipient is scheduled, this message is copied into
its memory. This happens in schedcheck().
This eliminates the mapping/copying step for messages, and makes
it easier to deliver messages. This eliminates soft_notify.
- Kernel no longer creates a page table at all, so the vm_setbuf
and pagetable writing in memory.c is gone.
Minor changes in kernel are
- ipc_stats thrown out, wasn't used
- misc flags all renamed to MF_*
- NOREC_* macros to enter and leave functions that should not
be called recursively; just sanity checks really
- code to fully decode segment selectors and descriptors
to print on exceptions
- lots of vmassert()s added, only executed if DEBUG_VMASSERT is 1
2009-09-21 16:31:52 +02:00
|
|
|
if((s=data_copy_vmcheck(who_e, buf, SYSTEM, (vir_bytes) mybuf, len)) != OK) {
|
2009-01-26 18:43:59 +01:00
|
|
|
kprintf("do_sysctl: diag for %d: len %d: copy failed: %d\n",
|
|
|
|
|
caller->p_endpoint, len, s);
|
|
|
|
|
return s;
|
|
|
|
|
}
|
|
|
|
|
for(i = 0; i < len; i++)
|
|
|
|
|
kputc(mybuf[i]);
|
|
|
|
|
kputc(END_OF_KMESS);
|
|
|
|
|
return OK;
|
2009-01-27 13:54:33 +01:00
|
|
|
case SYSCTL_CODE_STACKTRACE:
|
|
|
|
|
if(!isokendpt(m_ptr->SYSCTL_ARG2, &proc_nr))
|
|
|
|
|
return EINVAL;
|
|
|
|
|
proc_stacktrace(proc_addr(proc_nr));
|
|
|
|
|
return OK;
|
2009-01-26 18:43:59 +01:00
|
|
|
default:
|
|
|
|
|
kprintf("do_sysctl: invalid request %d\n", m_ptr->SYSCTL_CODE);
|
|
|
|
|
return(EINVAL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
minix_panic("do_sysctl: can't happen", NO_NUM);
|
|
|
|
|
|
|
|
|
|
return(OK);
|
|
|
|
|
}
|
|
|
|
|
|