1999-07-01 13:21:46 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1999 Peter Wemm <peter@FreeBSD.org>
|
|
|
|
* 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.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``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 OR CONTRIBUTORS 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 <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/kthread.h>
|
2000-12-23 19:43:10 +00:00
|
|
|
#include <sys/lock.h>
|
2001-03-28 11:52:56 +00:00
|
|
|
#include <sys/mutex.h>
|
|
|
|
#include <sys/proc.h>
|
2000-01-10 08:00:58 +00:00
|
|
|
#include <sys/resourcevar.h>
|
2000-01-07 08:36:44 +00:00
|
|
|
#include <sys/signalvar.h>
|
2001-03-28 11:52:56 +00:00
|
|
|
#include <sys/sx.h>
|
1999-07-01 13:21:46 +00:00
|
|
|
#include <sys/unistd.h>
|
|
|
|
#include <sys/wait.h>
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
#include <sys/ksiginfo.h>
|
1999-07-01 13:21:46 +00:00
|
|
|
|
|
|
|
#include <machine/stdarg.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Start a kernel process. This is called after a fork() call in
|
|
|
|
* mi_startup() in the file kern/init_main.c.
|
|
|
|
*
|
|
|
|
* This function is used to start "internal" daemons and intended
|
|
|
|
* to be called from SYSINIT().
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
kproc_start(udata)
|
|
|
|
const void *udata;
|
|
|
|
{
|
|
|
|
const struct kproc_desc *kp = udata;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
error = kthread_create((void (*)(void *))kp->func, NULL,
|
2001-07-19 02:18:54 +00:00
|
|
|
kp->global_procpp, 0, "%s", kp->arg0);
|
1999-07-01 13:21:46 +00:00
|
|
|
if (error)
|
|
|
|
panic("kproc_start: %s: error %d", kp->arg0, error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2000-09-07 01:33:02 +00:00
|
|
|
* Create a kernel process/thread/whatever. It shares its address space
|
1999-07-01 13:21:46 +00:00
|
|
|
* with proc0 - ie: kernel only.
|
2000-09-07 01:33:02 +00:00
|
|
|
*
|
|
|
|
* func is the function to start.
|
|
|
|
* arg is the parameter to pass to function on first startup.
|
|
|
|
* newpp is the return value pointing to the thread's struct proc.
|
|
|
|
* flags are flags to fork1 (in unistd.h)
|
|
|
|
* fmt and following will be *printf'd into (*newpp)->p_comm (for ps, etc.).
|
1999-07-01 13:21:46 +00:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
kthread_create(void (*func)(void *), void *arg,
|
2000-09-07 01:33:02 +00:00
|
|
|
struct proc **newpp, int flags, const char *fmt, ...)
|
1999-07-01 13:21:46 +00:00
|
|
|
{
|
|
|
|
int error;
|
|
|
|
va_list ap;
|
2002-09-11 08:13:56 +00:00
|
|
|
struct thread *td;
|
1999-07-01 13:21:46 +00:00
|
|
|
struct proc *p2;
|
|
|
|
|
2000-09-07 01:33:02 +00:00
|
|
|
if (!proc0.p_stats /* || proc0.p_stats->p_start.tv_sec == 0 */)
|
|
|
|
panic("kthread_create called too soon");
|
|
|
|
|
2002-02-07 23:06:26 +00:00
|
|
|
error = fork1(&thread0, RFMEM | RFFDG | RFPROC | RFSTOPPED | flags,
|
|
|
|
&p2);
|
1999-07-01 13:21:46 +00:00
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
/* save a global descriptor, if desired */
|
|
|
|
if (newpp != NULL)
|
|
|
|
*newpp = p2;
|
|
|
|
|
|
|
|
/* this is a non-swapped system process */
|
2001-01-24 10:47:50 +00:00
|
|
|
PROC_LOCK(p2);
|
|
|
|
p2->p_flag |= P_SYSTEM | P_KTHREAD;
|
1999-10-11 20:33:17 +00:00
|
|
|
p2->p_procsig->ps_flag |= PS_NOCLDWAIT;
|
2001-03-07 02:36:47 +00:00
|
|
|
_PHOLD(p2);
|
2001-01-24 10:47:50 +00:00
|
|
|
PROC_UNLOCK(p2);
|
1999-07-01 13:21:46 +00:00
|
|
|
|
|
|
|
/* set up arg0 for 'ps', et al */
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vsnprintf(p2->p_comm, sizeof(p2->p_comm), fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
|
|
|
|
/* call the processes' main()... */
|
2002-09-11 08:13:56 +00:00
|
|
|
td = FIRST_THREAD_IN_PROC(p2);
|
|
|
|
cpu_set_fork_handler(td, func, arg);
|
|
|
|
TD_SET_CAN_RUN(td);
|
1999-07-01 13:21:46 +00:00
|
|
|
|
2000-12-06 03:45:15 +00:00
|
|
|
/* Delay putting it on the run queue until now. */
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2001-01-24 10:47:50 +00:00
|
|
|
p2->p_sflag |= PS_INMEM;
|
2000-12-06 03:45:15 +00:00
|
|
|
if (!(flags & RFSTOPPED)) {
|
2002-09-11 08:13:56 +00:00
|
|
|
setrunqueue(td);
|
2000-12-06 03:45:15 +00:00
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
2000-12-06 03:45:15 +00:00
|
|
|
|
1999-07-01 13:21:46 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
kthread_exit(int ecode)
|
|
|
|
{
|
2001-11-12 08:53:34 +00:00
|
|
|
struct thread *td;
|
|
|
|
struct proc *p;
|
2000-12-23 19:43:10 +00:00
|
|
|
|
2001-11-12 08:53:34 +00:00
|
|
|
td = curthread;
|
|
|
|
p = td->td_proc;
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_xlock(&proctree_lock);
|
2001-11-12 08:42:20 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
proc_reparent(p, initproc);
|
|
|
|
PROC_UNLOCK(p);
|
2001-03-28 11:52:56 +00:00
|
|
|
sx_xunlock(&proctree_lock);
|
2001-11-12 08:53:34 +00:00
|
|
|
exit1(td, W_EXITCODE(ecode, 0));
|
1999-07-01 13:21:46 +00:00
|
|
|
}
|
|
|
|
|
2000-01-07 08:36:44 +00:00
|
|
|
/*
|
|
|
|
* Advise a kernel process to suspend (or resume) in its main loop.
|
|
|
|
* Participation is voluntary.
|
|
|
|
*/
|
|
|
|
int
|
2000-12-15 20:08:20 +00:00
|
|
|
kthread_suspend(struct proc *p, int timo)
|
2000-01-07 08:36:44 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Make sure this is indeed a system process and we can safely
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
* use the signal queue.
|
2000-01-07 08:36:44 +00:00
|
|
|
*/
|
2001-03-07 02:36:47 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
if ((p->p_flag & P_KTHREAD) == 0) {
|
|
|
|
PROC_UNLOCK(p);
|
2000-01-07 08:36:44 +00:00
|
|
|
return (EINVAL);
|
2001-03-07 02:36:47 +00:00
|
|
|
}
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
signal_add(p, NULL, SIGSTOP);
|
2001-12-19 01:31:12 +00:00
|
|
|
wakeup(p);
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
return msleep(&p->p_sigq, &p->p_mtx, PPAUSE | PDROP, "suspkt", timo);
|
2000-01-07 08:36:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2000-12-15 20:08:20 +00:00
|
|
|
kthread_resume(struct proc *p)
|
2000-01-07 08:36:44 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Make sure this is indeed a system process and we can safely
|
|
|
|
* use the p_siglist field.
|
|
|
|
*/
|
2001-03-07 02:36:47 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
if ((p->p_flag & P_KTHREAD) == 0) {
|
|
|
|
PROC_UNLOCK(p);
|
2000-01-07 08:36:44 +00:00
|
|
|
return (EINVAL);
|
2001-03-07 02:36:47 +00:00
|
|
|
}
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
signal_delete(p, NULL, SIGSTOP);
|
2001-03-07 02:36:47 +00:00
|
|
|
PROC_UNLOCK(p);
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
wakeup(&p->p_sigq);
|
2000-01-07 08:36:44 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2000-12-15 20:08:20 +00:00
|
|
|
kthread_suspend_check(struct proc *p)
|
2000-01-07 08:36:44 +00:00
|
|
|
{
|
2001-03-07 02:36:47 +00:00
|
|
|
PROC_LOCK(p);
|
First half of implementation of ksiginfo, signal queues, and such. This
gets signals operating based on a TailQ, and is good enough to run X11,
GNOME, and do job control. There are some intricate parts which could be
more refined to match the sigset_t versions, but those require further
evaluation of directions in which our signal system can expand and contract
to fit our needs.
After this has been in the tree for a while, I will make in kernel API
changes, most notably to trapsignal(9) and sendsig(9), to use ksiginfo
more robustly, such that we can actually pass information with our
(queued) signals to the userland. That will also result in using a
struct ksiginfo pointer, rather than a signal number, in a lot of
kern_sig.c, to refer to an individual pending signal queue member, but
right now there is no defined behaviour for such.
CODAFS is unfinished in this regard because the logic is unclear in
some places.
Sponsored by: New Gold Technology
Reviewed by: bde, tjr, jake [an older version, logic similar]
2002-09-30 20:20:22 +00:00
|
|
|
while (signal_queued(p, SIGSTOP)) {
|
|
|
|
wakeup(&p->p_sigq);
|
|
|
|
msleep(&p->p_sigq, &p->p_mtx, PPAUSE, "ktsusp", 0);
|
2000-01-07 08:36:44 +00:00
|
|
|
}
|
2001-03-07 02:36:47 +00:00
|
|
|
PROC_UNLOCK(p);
|
2000-01-07 08:36:44 +00:00
|
|
|
}
|