2009-08-15 23:37:26 +02:00
|
|
|
/* The kernel call implemented in this file:
|
|
|
|
|
* m_type: SYS_VTIMER
|
|
|
|
|
*
|
|
|
|
|
* The parameters for this kernel call are:
|
|
|
|
|
* m2_i1: VT_WHICH (the timer: VT_VIRTUAL or VT_PROF)
|
|
|
|
|
* m2_i2: VT_SET (whether to set, or just retrieve)
|
|
|
|
|
* m2_l1: VT_VALUE (new/old expiration time, in ticks)
|
|
|
|
|
* m2_l2: VT_ENDPT (process to which the timer belongs)
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "../system.h"
|
|
|
|
|
|
|
|
|
|
#include <signal.h>
|
|
|
|
|
#include <minix/endpoint.h>
|
|
|
|
|
|
|
|
|
|
#if USE_VTIMER
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
|
|
|
|
* do_vtimer *
|
|
|
|
|
*===========================================================================*/
|
2010-02-03 10:04:48 +01:00
|
|
|
PUBLIC int do_vtimer(struct proc * caller, message * m_ptr)
|
2009-08-15 23:37:26 +02:00
|
|
|
{
|
|
|
|
|
/* Set and/or retrieve the value of one of a process' virtual timers. */
|
|
|
|
|
struct proc *rp; /* pointer to process the timer belongs to */
|
|
|
|
|
register int pt_flag; /* the misc on/off flag for the req.d timer */
|
|
|
|
|
register clock_t *pt_left; /* pointer to the process' ticks-left field */
|
|
|
|
|
clock_t old_value; /* the previous number of ticks left */
|
|
|
|
|
int proc_nr, proc_nr_e;
|
|
|
|
|
|
|
|
|
|
/* The requesting process must be privileged. */
|
2010-02-03 10:04:48 +01:00
|
|
|
if (! (priv(caller)->s_flags & SYS_PROC)) return(EPERM);
|
2009-08-15 23:37:26 +02:00
|
|
|
|
|
|
|
|
if (m_ptr->VT_WHICH != VT_VIRTUAL && m_ptr->VT_WHICH != VT_PROF)
|
|
|
|
|
return(EINVAL);
|
|
|
|
|
|
|
|
|
|
/* The target process must be valid. */
|
|
|
|
|
proc_nr_e = (m_ptr->VT_ENDPT == SELF) ? m_ptr->m_source : m_ptr->VT_ENDPT;
|
|
|
|
|
if (!isokendpt(proc_nr_e, &proc_nr)) return(EINVAL);
|
|
|
|
|
rp = proc_addr(proc_nr);
|
|
|
|
|
|
|
|
|
|
/* Determine which flag and which field in the proc structure we want to
|
|
|
|
|
* retrieve and/or modify. This saves us having to differentiate between
|
|
|
|
|
* VT_VIRTUAL and VT_PROF multiple times below.
|
|
|
|
|
*/
|
|
|
|
|
if (m_ptr->VT_WHICH == VT_VIRTUAL) {
|
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
|
|
|
pt_flag = MF_VIRT_TIMER;
|
2009-08-15 23:37:26 +02:00
|
|
|
pt_left = &rp->p_virt_left;
|
|
|
|
|
} else { /* VT_PROF */
|
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
|
|
|
pt_flag = MF_PROF_TIMER;
|
2009-08-15 23:37:26 +02:00
|
|
|
pt_left = &rp->p_prof_left;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Retrieve the old value. */
|
|
|
|
|
if (rp->p_misc_flags & pt_flag) {
|
|
|
|
|
old_value = *pt_left;
|
|
|
|
|
|
|
|
|
|
if (old_value < 0) old_value = 0;
|
|
|
|
|
} else {
|
|
|
|
|
old_value = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Set the new value, if requested. This is called from the system task, so
|
|
|
|
|
* we can be interrupted by the clock interrupt, but not by the clock task.
|
|
|
|
|
* Therefore we only have to protect against interference from clock.c's
|
|
|
|
|
* clock_handler(). We can do this without disabling interrupts, by removing
|
|
|
|
|
* the timer's flag before changing the ticks-left field; in that case the
|
|
|
|
|
* clock interrupt will not touch the latter anymore.
|
|
|
|
|
*/
|
|
|
|
|
if (m_ptr->VT_SET) {
|
|
|
|
|
rp->p_misc_flags &= ~pt_flag; /* disable virtual timer */
|
|
|
|
|
|
|
|
|
|
if (m_ptr->VT_VALUE > 0) {
|
|
|
|
|
*pt_left = m_ptr->VT_VALUE; /* set new timer value */
|
|
|
|
|
rp->p_misc_flags |= pt_flag; /* (re)enable virtual timer */
|
|
|
|
|
} else {
|
|
|
|
|
*pt_left = 0; /* clear timer value */
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
m_ptr->VT_VALUE = old_value;
|
|
|
|
|
|
|
|
|
|
return(OK);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* USE_VTIMER */
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
|
|
|
|
* vtimer_check *
|
|
|
|
|
*===========================================================================*/
|
|
|
|
|
PUBLIC void vtimer_check(rp)
|
|
|
|
|
struct proc *rp; /* pointer to the process */
|
|
|
|
|
{
|
|
|
|
|
/* This is called from the clock task, so we can be interrupted by the clock
|
|
|
|
|
* interrupt, but not by the system task. Therefore we only have to protect
|
|
|
|
|
* against interference from the clock handler. We can safely perform the
|
|
|
|
|
* following actions without locking as well though, as the clock handler
|
|
|
|
|
* never alters p_misc_flags, and only decreases p_virt_left/p_prof_left.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/* Check if the virtual timer expired. If so, send a SIGVTALRM signal. */
|
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 ((rp->p_misc_flags & MF_VIRT_TIMER) && rp->p_virt_left <= 0) {
|
|
|
|
|
rp->p_misc_flags &= ~MF_VIRT_TIMER;
|
2009-08-15 23:37:26 +02:00
|
|
|
rp->p_virt_left = 0;
|
|
|
|
|
cause_sig(rp->p_nr, SIGVTALRM);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Check if the profile timer expired. If so, send a SIGPROF signal. */
|
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 ((rp->p_misc_flags & MF_PROF_TIMER) && rp->p_prof_left <= 0) {
|
|
|
|
|
rp->p_misc_flags &= ~MF_PROF_TIMER;
|
2009-08-15 23:37:26 +02:00
|
|
|
rp->p_prof_left = 0;
|
|
|
|
|
cause_sig(rp->p_nr, SIGPROF);
|
|
|
|
|
}
|
|
|
|
|
}
|
