| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
| |
prevent being rescheduled.
Submitted by: Dan Eischen <eischen@vigrid.com>
|
|
|
|
|
| |
Submitted by: Ralf S. Engelschall
Obtained from: PR i386/11713
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
have made the patch obsolete, as pointed out by Daniel Eischen
<eischen@vigrid.com>.
PR: bin/8872
|
|
|
|
|
|
|
|
| |
pthread_cond_timedwait() times out.
PR: bin/8872
Submitted by: Jason Evans <jasone@canonware.com>
Reviewed by: David Schwartz <davids@webmaster.com>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
o Runnable threads are now maintained in priority queues. The
implementation requires two things:
1.) The priority queues must be protected during insertion
and removal of threads. Since the kernel scheduler
must modify the priority queues, a spinlock for
protection cannot be used. The functions
_thread_kern_sched_defer() and _thread_kern_sched_undefer()
were added to {un}defer kernel scheduler activation.
2.) A thread (active) priority change can be performed only
when the thread is removed from the priority queue. The
implementation uses a threads active priority when
inserting it into the queue.
A by-product is that thread switches are much faster. A
separate queue is used for waiting and/or blocked threads,
and it is searched at most 2 times in the kernel scheduler
when there are active threads. It should be possible to
reduce this to once by combining polling of threads waiting
on I/O with the loop that looks for timed out threads and
the minimum timeout value.
o Functions to defer kernel scheduler activation were added. These
are _thread_kern_sched_defer() and _thread_kern_sched_undefer()
and may be called recursively. These routines do not block the
scheduling signal, but latch its occurrence. The signal handler
will not call the kernel scheduler when the running thread has
deferred scheduling, but it will be called when running thread
undefers scheduling.
o Added support for _POSIX_THREAD_PRIORITY_SCHEDULING. All the
POSIX routines required by this should now be implemented.
One note, SCHED_OTHER, SCHED_FIFO, and SCHED_RR are required
to be defined by including pthread.h. These defines are currently
in sched.h. I modified pthread.h to include sched.h but don't
know if this is the proper thing to do.
o Added support for priority protection and inheritence mutexes.
This allows definition of _POSIX_THREAD_PRIO_PROTECT and
_POSIX_THREAD_PRIO_INHERIT.
o Added additional error checks required by POSIX for mutexes and
condition variables.
o Provided a wrapper for sigpending which is marked as a hidden
syscall.
o Added a non-portable function as a debugging aid to allow an
application to monitor thread context switches. An application
can install a routine that gets called everytime a thread
(explicitly created by the application) gets context switched.
The routine gets passed the pthread IDs of the threads that are
being switched in and out.
Submitted by: Dan Eischen <eischen@vigrid.com>
Changes by me:
o Added a PS_SPINBLOCK state to deal with the priority inversion
problem most often (I think) seen by threads calling malloc/free/realloc.
o Dispatch signals to the running thread directly rather than at a
context switch to avoid the situation where the switch never occurs.
|
|
|
|
| |
Obtained from: OpenBSD (David Leonard)
|
| |
|
|
|
|
|
|
|
| |
thread trying to call pthread_exit() from a cleanup handler actually
works.
Submitted by: David Leonard <david.leonard@csee.uq.edu.au> OpenBSD
|
|
|
|
|
|
| |
Submitted by: Alexandre Snarskii <snar@paranoia.ru>
Approved by: John Birrell
Reminded me that I'd been sitting on this too long: snar@paranoia.ru
|
| |
|
|
|
|
| |
testing this, fix MUTEX_TYPE_COUNTING_FAST. Recursive locks now work.
|
|
|
|
| |
Submitted by: Alec Wolman <wolman@cs.washington.edu>
|
| |
|
|
|
|
|
|
| |
Made pthread_cond_wait() more similar to pthread_cond_timedwait().
PR: 8375
|
|
|
|
|
|
|
|
| |
make pthread_yield() more reliable,
threads always (I hope) preempted at least every 0.1 sec, as intended.
PR: bin/7744
Submitted by: "Richard Seaman, Jr." <dick@tar.com>
|
| |
|
|
|
|
| |
Submitted by: Daniel M. Eischen <eischen@vigrid.com>
|
|
|
|
| |
collector thread running after a fork.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
the thread kernel into a garbage collector thread which is started when
the fisrt thread is created (other than the initial thread). This
removes the window of opportunity where a context switch will cause a
thread that has locked the malloc spinlock, to enter the thread kernel,
find there is a dead thread and try to free memory, therefore trying
to lock the malloc spinlock against itself.
The garbage collector thread acts just like any other thread, so
instead of having a spinlock to control accesses to the dead thread
list, it uses a mutex and a condition variable so that it can happily
wait to be signalled when a thread exists.
|
|
|
|
|
|
|
| |
launching an application into space when someone tries to debug it.
The dead thread list now has it's own link pointer, so use that when
reporting the grateful dead.
|
|
|
|
|
|
| |
one renamed to SIGSUSPEND) to fix sigwait().
Submitted by: Daniel M. Eischen <eischen@vigrid.com>
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
- Add support of a thread being listed in the dead thread list as well
as the thread list.
- Add a new thread state to make sigwait work properly. (Submitted by
Daniel M. Eischen <eischen@vigrid.com>)
- Add global variable for the garbage collector mutex and condition
variable.
- Delete a couple of prototypes that are no longer required.
- Add a prototype for the garbage collector thread.
|
|
|
|
| |
Now all I need is an alpha SMP box to port FreeBSD to :-)
|
|
|
|
|
|
|
| |
to fork. It is difficult to do real vfork in libc_r, since almost every
operation with file descriptsor changes _thread_fd_table and friends.
popen(3) works much better with this change.
|
| |
|
|
|
|
| |
from style(9).
|
| |
|
|
|
|
|
|
|
| |
UNIX Specification.
As with our standard mutexes, process shared locks are not supported at
this time.
|
| |
|
|
|
|
| |
kernel needs.
|
| |
|
| |
|
|
|
|
|
| |
Submitted by: Daniel M. Eischen <eischen@vigrid.com>
PR: misc/7039
|
|
|
|
|
|
|
| |
are started instead of init (pid = 1). This allows an embedded
implementation quite like VxWorks, with (possibly) a single threaded
program running instead of init. The neat thing is that the same threaded
process can run in a multi-user workstation environment too.
|
| |
|
|
|
|
|
|
|
|
|
|
| |
...is expected to conform to IEEE (``POSIX'') Std 1003.1c when it is
published.
to:
...conforms to ISO/IEC 9945-1 ANSI/IEEE (``POSIX'') Std 1003.1 Second
Edition 1996-07-12.
Discussed with: jb
|
| |
|
|
|
|
|
|
|
|
|
| |
initialized mutex. Statically initialized mutexes are actually
initialized at first use (pthread_mutex_lock/pthread_mutex_trylock).
To prevent concurrent initialization by multiple threads, all
static initializations are now serialized by a spinlock.
Reviewed by: jb
|
|
|
|
|
|
|
|
| |
pthread_mutex routines. I've also tweaked pthread_create.3 to point to
pthread_cleanup_push(3) and pthread_cleanup_pop(3).
PR: 7450
Submitted by: Brian Cully <shmit@kublai.com>
|
|
|
|
| |
integral.
|
|
|
|
|
| |
had to wait for the thread to exit and if the caller didn't want the
thread exit status.
|
|
|
|
|
| |
signal handler installed for SIGCHLD. The ACE MT_SOCK_Test was hanging
as the result of being interrupted when it didn't expect to be.
|
|
|
|
|
|
| |
signal can arrive before the thread is woken from it's wait4. In this
case, don't return an EINTR, just set the thread state to running and
the wait4 wrapper will loop and get the exit status of the process.
|
|
|
|
|
| |
so much a "fix", rather a bandaid to buy time to fix it properly
within the thread engine.
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
propagates a bug (that there is no poll wrapper in libc_r), but it
prevents GNU configure scripts from trying to use it in preference
to select. libc_r really needs to change it's wait interface to use
poll instead of select because poll is more a superset of select that
the other way around.
This should allow the Roxen web server to work out-of-the-box. It's
configuration intercae is kinda neat. The code isn't. Shiver. 8-)
|