2005-10-14 10:58:59 +02:00
|
|
|
/* The kernel call that is implemented in this file:
|
2005-07-19 14:21:36 +02:00
|
|
|
* m_type: SYS_SIGSEND
|
2005-07-14 17:12:12 +02:00
|
|
|
*
|
2005-10-14 10:58:59 +02:00
|
|
|
* The parameters for this kernel call are:
|
'proc number' is process slot, 'endpoint' are generation-aware process
instance numbers, encoded and decoded using macros in <minix/endpoint.h>.
proc number -> endpoint migration
. proc_nr in the interrupt hook is now an endpoint, proc_nr_e.
. m_source for messages and notifies is now an endpoint, instead of
proc number.
. isokendpt() converts an endpoint to a process number, returns
success (but fails if the process number is out of range, the
process slot is not a living process, or the given endpoint
number does not match the endpoint number in the process slot,
indicating an old process).
. okendpt() is the same as isokendpt(), but panic()s if the conversion
fails. This is mainly used for decoding message.m_source endpoints,
and other endpoint numbers in kernel data structures, which should
always be correct.
. if DEBUG_ENABLE_IPC_WARNINGS is enabled, isokendpt() and okendpt()
get passed the __FILE__ and __LINE__ of the calling lines, and
print messages about what is wrong with the endpoint number
(out of range proc, empty proc, or inconsistent endpoint number),
with the caller, making finding where the conversion failed easy
without having to include code for every call to print where things
went wrong. Sometimes this is harmless (wrong arg to a kernel call),
sometimes it's a fatal internal inconsistency (bogus m_source).
. some process table fields have been appended an _e to indicate it's
become and endpoint.
. process endpoint is stored in p_endpoint, without generation number.
it turns out the kernel never needs the generation number, except
when fork()ing, so it's decoded then.
. kernel calls all take endpoints as arguments, not proc numbers.
the one exception is sys_fork(), which needs to know in which slot
to put the child.
2006-03-03 11:00:02 +01:00
|
|
|
* m2_i1: SIG_ENDPT # process to call signal handler
|
2005-07-19 14:21:36 +02:00
|
|
|
* m2_p1: SIG_CTXT_PTR # pointer to sigcontext structure
|
|
|
|
|
* m2_i3: SIG_FLAGS # flags for S_SIGRETURN call
|
2005-07-14 17:12:12 +02:00
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include "../system.h"
|
2009-02-05 14:00:03 +01:00
|
|
|
#include "../vm.h"
|
2005-07-14 17:12:12 +02:00
|
|
|
#include <signal.h>
|
2005-07-19 17:01:47 +02:00
|
|
|
#include <string.h>
|
2005-07-14 17:12:12 +02:00
|
|
|
#include <sys/sigcontext.h>
|
|
|
|
|
|
|
|
|
|
#if USE_SIGSEND
|
|
|
|
|
|
|
|
|
|
/*===========================================================================*
|
|
|
|
|
* do_sigsend *
|
|
|
|
|
*===========================================================================*/
|
|
|
|
|
PUBLIC int do_sigsend(m_ptr)
|
|
|
|
|
message *m_ptr; /* pointer to request message */
|
|
|
|
|
{
|
|
|
|
|
/* Handle sys_sigsend, POSIX-style signal handling. */
|
|
|
|
|
|
|
|
|
|
struct sigmsg smsg;
|
|
|
|
|
register struct proc *rp;
|
|
|
|
|
struct sigcontext sc, *scp;
|
|
|
|
|
struct sigframe fr, *frp;
|
2009-09-15 11:57:22 +02:00
|
|
|
int proc_nr, r;
|
2009-12-02 14:01:48 +01:00
|
|
|
#if (_MINIX_CHIP == _CHIP_INTEL)
|
|
|
|
|
unsigned short int fp_error;
|
|
|
|
|
#endif
|
2005-07-14 17:12:12 +02:00
|
|
|
|
2009-09-15 11:57:22 +02:00
|
|
|
if (!isokendpt(m_ptr->SIG_ENDPT, &proc_nr)) return(EINVAL);
|
|
|
|
|
if (iskerneln(proc_nr)) return(EPERM);
|
|
|
|
|
rp = proc_addr(proc_nr);
|
2005-07-14 17:12:12 +02:00
|
|
|
|
|
|
|
|
/* Get the sigmsg structure into our address space. */
|
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((r=data_copy_vmcheck(who_e, (vir_bytes) m_ptr->SIG_CTXT_PTR,
|
2008-11-19 13:26:10 +01:00
|
|
|
SYSTEM, (vir_bytes) &smsg, (phys_bytes) sizeof(struct sigmsg))) != OK)
|
|
|
|
|
return r;
|
2005-07-14 17:12:12 +02:00
|
|
|
|
|
|
|
|
/* Compute the user stack pointer where sigcontext will be stored. */
|
|
|
|
|
scp = (struct sigcontext *) smsg.sm_stkptr - 1;
|
|
|
|
|
|
|
|
|
|
/* Copy the registers to the sigcontext structure. */
|
2009-12-02 14:01:48 +01:00
|
|
|
memcpy(&sc.sc_regs, (char *) &rp->p_reg, sizeof(sigregs));
|
|
|
|
|
#if (_MINIX_CHIP == _CHIP_INTEL)
|
|
|
|
|
if(rp->p_misc_flags & MF_FPU_INITIALIZED)
|
2009-12-03 00:12:46 +01:00
|
|
|
memcpy(&sc.sc_fpu_state, rp->p_fpu_state.fpu_save_area_p,
|
|
|
|
|
FPU_XFP_SIZE);
|
2009-12-02 14:01:48 +01:00
|
|
|
#endif
|
2005-07-14 17:12:12 +02:00
|
|
|
|
|
|
|
|
/* Finish the sigcontext initialization. */
|
|
|
|
|
sc.sc_mask = smsg.sm_mask;
|
2009-12-02 14:01:48 +01:00
|
|
|
sc.sc_flags = 0 | rp->p_misc_flags & MF_FPU_INITIALIZED;
|
2005-07-14 17:12:12 +02:00
|
|
|
|
|
|
|
|
/* Copy the sigcontext structure to the user's stack. */
|
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((r=data_copy_vmcheck(SYSTEM, (vir_bytes) &sc, m_ptr->SIG_ENDPT,
|
|
|
|
|
(vir_bytes) scp, (vir_bytes) sizeof(struct sigcontext))) != OK)
|
2008-11-19 13:26:10 +01:00
|
|
|
return r;
|
2005-07-14 17:12:12 +02:00
|
|
|
|
|
|
|
|
/* Initialize the sigframe structure. */
|
|
|
|
|
frp = (struct sigframe *) scp - 1;
|
|
|
|
|
fr.sf_scpcopy = scp;
|
|
|
|
|
fr.sf_retadr2= (void (*)()) rp->p_reg.pc;
|
|
|
|
|
fr.sf_fp = rp->p_reg.fp;
|
|
|
|
|
rp->p_reg.fp = (reg_t) &frp->sf_fp;
|
|
|
|
|
fr.sf_scp = scp;
|
2009-12-02 14:01:48 +01:00
|
|
|
|
|
|
|
|
#if (_MINIX_CHIP == _CHIP_INTEL)
|
|
|
|
|
if (osfxsr_feature == 1) {
|
2009-12-03 00:12:46 +01:00
|
|
|
fp_error = sc.sc_fpu_state.xfp_regs.fp_status &
|
|
|
|
|
~sc.sc_fpu_state.xfp_regs.fp_control;
|
2009-12-02 14:01:48 +01:00
|
|
|
} else {
|
2009-12-03 00:12:46 +01:00
|
|
|
fp_error = sc.sc_fpu_state.fpu_regs.fp_status &
|
|
|
|
|
~sc.sc_fpu_state.fpu_regs.fp_control;
|
2009-12-02 14:01:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (fp_error & 0x001) { /* Invalid op */
|
|
|
|
|
/*
|
|
|
|
|
* swd & 0x240 == 0x040: Stack Underflow
|
|
|
|
|
* swd & 0x240 == 0x240: Stack Overflow
|
|
|
|
|
* User must clear the SF bit (0x40) if set
|
|
|
|
|
*/
|
|
|
|
|
fr.sf_code = FPE_FLTINV;
|
|
|
|
|
} else if (fp_error & 0x004) {
|
|
|
|
|
fr.sf_code = FPE_FLTDIV; /* Divide by Zero */
|
|
|
|
|
} else if (fp_error & 0x008) {
|
|
|
|
|
fr.sf_code = FPE_FLTOVF; /* Overflow */
|
|
|
|
|
} else if (fp_error & 0x012) {
|
|
|
|
|
fr.sf_code = FPE_FLTUND; /* Denormal, Underflow */
|
|
|
|
|
} else if (fp_error & 0x020) {
|
|
|
|
|
fr.sf_code = FPE_FLTRES; /* Precision */
|
|
|
|
|
} else {
|
|
|
|
|
fr.sf_code = 0; /* XXX - probably should be used for FPE_INTOVF or
|
|
|
|
|
* FPE_INTDIV */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
fr.sf_code = 0;
|
|
|
|
|
#endif
|
|
|
|
|
|
2005-07-14 17:12:12 +02:00
|
|
|
fr.sf_signo = smsg.sm_signo;
|
|
|
|
|
fr.sf_retadr = (void (*)()) smsg.sm_sigreturn;
|
|
|
|
|
|
|
|
|
|
/* Copy the sigframe structure to the user's stack. */
|
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((r=data_copy_vmcheck(SYSTEM, (vir_bytes) &fr,
|
|
|
|
|
m_ptr->SIG_ENDPT, (vir_bytes) frp,
|
2008-11-19 13:26:10 +01:00
|
|
|
(vir_bytes) sizeof(struct sigframe))) != OK)
|
|
|
|
|
return r;
|
|
|
|
|
|
2005-07-14 17:12:12 +02:00
|
|
|
/* Reset user registers to execute the signal handler. */
|
|
|
|
|
rp->p_reg.sp = (reg_t) frp;
|
|
|
|
|
rp->p_reg.pc = (reg_t) smsg.sm_sighandler;
|
|
|
|
|
|
2009-12-02 14:01:48 +01:00
|
|
|
/* Signal handler should get clean FPU. */
|
|
|
|
|
rp->p_misc_flags &= ~MF_FPU_INITIALIZED;
|
|
|
|
|
|
2009-11-10 10:11:13 +01:00
|
|
|
if(!RTS_ISSET(rp, RTS_PROC_STOP)) {
|
2008-11-19 13:26:10 +01:00
|
|
|
struct proc *caller;
|
|
|
|
|
caller = proc_addr(who_p);
|
Mostly bugfixes of bugs triggered by the test set.
bugfixes:
SYSTEM:
. removed
rc->p_priv->s_flags = 0;
for the priv struct shared by all user processes in get_priv(). this
should only be done once. doing a SYS_PRIV_USER in sys_privctl()
caused the flags of all user processes to be reset, so they were no
longer PREEMPTIBLE. this happened when RS executed a policy script.
(this broke test1 in the test set)
VFS/MFS:
. chown can change the mode of a file, and chmod arguments are only
part of the full file mode so the full filemode is slightly magic.
changed these calls so that the final modes are returned to VFS, so
that the vnode can be kept up-to-date.
(this broke test11 in the test set)
MFS:
. lookup() checked for sizeof(string) instead of sizeof(user_path),
truncating long path names
(caught by test 23)
. truncate functions neglected to update ctime
(this broke test16)
VFS:
. corner case of an empty filename lookup caused fields of a request
not to be filled in in the lookup functions, not making it clear
that the lookup had failed, causing messages to garbage processes,
causing strange failures.
(caught by test 30)
. trust v_size in vnode when doing reads or writes on non-special
files, truncating i/o where necessary; this is necessary for pipes,
as MFS can't tell when a pipe has been truncated without it being
told explicitly each time.
when the last reader/writer on a pipe closes, tell FS about
the new size using truncate_vn().
(this broke test 25, among others)
. permission check for chdir() had disappeared; added a
forbidden() call
(caught by test 23)
new code, shouldn't change anything:
. introduced RTS_SET, RTS_UNSET, and RTS_ISSET macro's, and their
LOCK variants. These macros set and clear the p_rts_flags field,
causing a lot of duplicated logic like
old_flags = rp->p_rts_flags; /* save value of the flags */
rp->p_rts_flags &= ~NO_PRIV;
if (old_flags != 0 && rp->p_rts_flags == 0) lock_enqueue(rp);
to change into the simpler
RTS_LOCK_UNSET(rp, NO_PRIV);
so the macros take care of calling dequeue() and enqueue() (or lock_*()),
as the case may be). This makes the code a bit more readable and a
bit less fragile.
. removed return code from do_clocktick in CLOCK as it currently
never replies
. removed some debug code from VFS
. fixed grant debug message in device.c
preemptive checks, tests, changes:
. added return code checks of receive() to SYSTEM and CLOCK
. O_TRUNC should never arrive at MFS (added sanity check and removed
O_TRUNC code)
. user_path declared with PATH_MAX+1 to let it be null-terminated
. checks in MFS to see if strings passed by VFS are null-terminated
IS:
. static irq name table thrown out
2007-02-01 18:50:02 +01:00
|
|
|
kprintf("system: warning: sigsend a running process\n");
|
2008-11-19 13:26:10 +01:00
|
|
|
kprintf("caller stack: ");
|
|
|
|
|
proc_stacktrace(caller);
|
|
|
|
|
}
|
2006-10-25 15:38:31 +02:00
|
|
|
|
2005-07-14 17:12:12 +02:00
|
|
|
return(OK);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* USE_SIGSEND */
|
|
|
|
|
|
