2 @c @node POSIX Threads, , Top, Top
4 @c %MENU% The standard threads library
6 @c This chapter needs more work bigtime. -zw
8 This chapter describes the pthreads (POSIX threads) library. This
9 library provides support functions for multithreaded programs: thread
10 primitives, synchronization objects, and so forth. It also implements
11 POSIX 1003.1b semaphores (not to be confused with System V semaphores).
13 The threads operations (@samp{pthread_*}) do not use @var{errno}.
14 Instead they return an error code directly. The semaphore operations do
18 * Basic Thread Operations:: Creating, terminating, and waiting for threads.
19 * Thread Attributes:: Tuning thread scheduling.
20 * Cancellation:: Stopping a thread before it's done.
21 * Cleanup Handlers:: Deallocating resources when a thread is
23 * Mutexes:: One way to synchronize threads.
24 * Condition Variables:: Another way.
25 * POSIX Semaphores:: And a third way.
26 * Thread-Specific Data:: Variables with different values in
28 * Threads and Signal Handling:: Why you should avoid mixing the two, and
29 how to do it if you must.
30 * Threads and Fork:: Interactions between threads and the
32 * Streams and Fork:: Interactions between stdio streams and
34 * Miscellaneous Thread Functions:: A grab bag of utility routines.
37 @node Basic Thread Operations
38 @section Basic Thread Operations
40 These functions are the thread equivalents of @code{fork}, @code{exit},
45 @deftypefun int pthread_create (pthread_t * @var{thread}, pthread_attr_t * @var{attr}, void * (*@var{start_routine})(void *), void * @var{arg})
46 @code{pthread_create} creates a new thread of control that executes
47 concurrently with the calling thread. The new thread calls the
48 function @var{start_routine}, passing it @var{arg} as first argument. The
49 new thread terminates either explicitly, by calling @code{pthread_exit},
50 or implicitly, by returning from the @var{start_routine} function. The
51 latter case is equivalent to calling @code{pthread_exit} with the result
52 returned by @var{start_routine} as exit code.
54 The @var{attr} argument specifies thread attributes to be applied to the
55 new thread. @xref{Thread Attributes}, for details. The @var{attr}
56 argument can also be @code{NULL}, in which case default attributes are
57 used: the created thread is joinable (not detached) and has an ordinary
58 (not realtime) scheduling policy.
60 On success, the identifier of the newly created thread is stored in the
61 location pointed by the @var{thread} argument, and a 0 is returned. On
62 error, a non-zero error code is returned.
64 This function may return the following errors:
67 Not enough system resources to create a process for the new thread,
68 or more than @code{PTHREAD_THREADS_MAX} threads are already active.
74 @deftypefun void pthread_exit (void *@var{retval})
75 @code{pthread_exit} terminates the execution of the calling thread. All
76 cleanup handlers (@pxref{Cleanup Handlers}) that have been set for the
77 calling thread with @code{pthread_cleanup_push} are executed in reverse
78 order (the most recently pushed handler is executed first). Finalization
79 functions for thread-specific data are then called for all keys that
80 have non-@code{NULL} values associated with them in the calling thread
81 (@pxref{Thread-Specific Data}). Finally, execution of the calling
84 The @var{retval} argument is the return value of the thread. It can be
85 retrieved from another thread using @code{pthread_join}.
87 The @code{pthread_exit} function never returns.
92 @deftypefun int pthread_cancel (pthread_t @var{thread})
94 @code{pthread_cancel} sends a cancellation request to the thread denoted
95 by the @var{thread} argument. If there is no such thread,
96 @code{pthread_cancel} fails and returns @code{ESRCH}. Otherwise it
97 returns 0. @xref{Cancellation}, for details.
102 @deftypefun int pthread_join (pthread_t @var{th}, void **thread_@var{return})
103 @code{pthread_join} suspends the execution of the calling thread until
104 the thread identified by @var{th} terminates, either by calling
105 @code{pthread_exit} or by being cancelled.
107 If @var{thread_return} is not @code{NULL}, the return value of @var{th}
108 is stored in the location pointed to by @var{thread_return}. The return
109 value of @var{th} is either the argument it gave to @code{pthread_exit},
110 or @code{PTHREAD_CANCELED} if @var{th} was cancelled.
112 The joined thread @code{th} must be in the joinable state: it must not
113 have been detached using @code{pthread_detach} or the
114 @code{PTHREAD_CREATE_DETACHED} attribute to @code{pthread_create}.
116 When a joinable thread terminates, its memory resources (thread
117 descriptor and stack) are not deallocated until another thread performs
118 @code{pthread_join} on it. Therefore, @code{pthread_join} must be called
119 once for each joinable thread created to avoid memory leaks.
121 At most one thread can wait for the termination of a given
122 thread. Calling @code{pthread_join} on a thread @var{th} on which
123 another thread is already waiting for termination returns an error.
125 @code{pthread_join} is a cancellation point. If a thread is canceled
126 while suspended in @code{pthread_join}, the thread execution resumes
127 immediately and the cancellation is executed without waiting for the
128 @var{th} thread to terminate. If cancellation occurs during
129 @code{pthread_join}, the @var{th} thread remains not joined.
131 On success, the return value of @var{th} is stored in the location
132 pointed to by @var{thread_return}, and 0 is returned. On error, one of
133 the following values is returned:
136 No thread could be found corresponding to that specified by @var{th}.
138 The @var{th} thread has been detached, or another thread is already
139 waiting on termination of @var{th}.
141 The @var{th} argument refers to the calling thread.
145 @node Thread Attributes
146 @section Thread Attributes
151 Threads have a number of attributes that may be set at creation time.
152 This is done by filling a thread attribute object @var{attr} of type
153 @code{pthread_attr_t}, then passing it as second argument to
154 @code{pthread_create}. Passing @code{NULL} is equivalent to passing a
155 thread attribute object with all attributes set to their default values.
157 Attribute objects are consulted only when creating a new thread. The
158 same attribute object can be used for creating several threads.
159 Modifying an attribute object after a call to @code{pthread_create} does
160 not change the attributes of the thread previously created.
164 @deftypefun int pthread_attr_init (pthread_attr_t *@var{attr})
165 @code{pthread_attr_init} initializes the thread attribute object
166 @var{attr} and fills it with default values for the attributes. (The
167 default values are listed below for each attribute.)
169 Each attribute @var{attrname} (see below for a list of all attributes)
170 can be individually set using the function
171 @code{pthread_attr_set@var{attrname}} and retrieved using the function
172 @code{pthread_attr_get@var{attrname}}.
177 @deftypefun int pthread_attr_destroy (pthread_attr_t *@var{attr})
178 @code{pthread_attr_destroy} destroys the attribute object pointed to by
179 @var{attr} releasing any resources associated with it. @var{attr} is
180 left in an undefined state, and you must not use it again in a call to
181 any pthreads function until it has been reinitialized.
184 @findex pthread_attr_setinheritsched
185 @findex pthread_attr_setschedparam
186 @findex pthread_attr_setschedpolicy
187 @findex pthread_attr_setscope
190 @deftypefun int pthread_attr_set@var{attr} (pthread_attr_t *@var{obj}, int @var{value})
191 Set attribute @var{attr} to @var{value} in the attribute object pointed
192 to by @var{obj}. See below for a list of possible attributes and the
193 values they can take.
195 On success, these functions return 0. If @var{value} is not meaningful
196 for the @var{attr} being modified, they will return the error code
197 @code{EINVAL}. Some of the functions have other failure modes; see
201 @findex pthread_attr_getinheritsched
202 @findex pthread_attr_getschedparam
203 @findex pthread_attr_getschedpolicy
204 @findex pthread_attr_getscope
207 @deftypefun int pthread_attr_get@var{attr} (const pthread_attr_t *@var{obj}, int *@var{value})
208 Store the current setting of @var{attr} in @var{obj} into the variable
209 pointed to by @var{value}.
211 These functions always return 0.
214 The following thread attributes are supported:
217 Choose whether the thread is created in the joinable state (value
218 @code{PTHREAD_CREATE_JOINABLE}) or in the detached state
219 (@code{PTHREAD_CREATE_DETACHED}). The default is
220 @code{PTHREAD_CREATE_JOINABLE}.
222 In the joinable state, another thread can synchronize on the thread
223 termination and recover its termination code using @code{pthread_join},
224 but some of the thread resources are kept allocated after the thread
225 terminates, and reclaimed only when another thread performs
226 @code{pthread_join} on that thread.
228 In the detached state, the thread resources are immediately freed when
229 it terminates, but @code{pthread_join} cannot be used to synchronize on
230 the thread termination.
232 A thread created in the joinable state can later be put in the detached
233 thread using @code{pthread_detach}.
236 Select the scheduling policy for the thread: one of @code{SCHED_OTHER}
237 (regular, non-realtime scheduling), @code{SCHED_RR} (realtime,
238 round-robin) or @code{SCHED_FIFO} (realtime, first-in first-out).
239 The default is @code{SCHED_OTHER}.
240 @c Not doc'd in our manual: FIXME.
241 @c See @code{sched_setpolicy} for more information on scheduling policies.
243 The realtime scheduling policies @code{SCHED_RR} and @code{SCHED_FIFO}
244 are available only to processes with superuser privileges.
245 @code{pthread_attr_setschedparam} will fail and return @code{ENOTSUP} if
246 you try to set a realtime policy when you are unprivileged.
248 The scheduling policy of a thread can be changed after creation with
249 @code{pthread_setschedparam}.
252 Change the scheduling parameter (the scheduling priority)
253 for the thread. The default is 0.
255 This attribute is not significant if the scheduling policy is
256 @code{SCHED_OTHER}; it only matters for the realtime policies
257 @code{SCHED_RR} and @code{SCHED_FIFO}.
259 The scheduling priority of a thread can be changed after creation with
260 @code{pthread_setschedparam}.
263 Choose whether the scheduling policy and scheduling parameter for the
264 newly created thread are determined by the values of the
265 @var{schedpolicy} and @var{schedparam} attributes (value
266 @code{PTHREAD_EXPLICIT_SCHED}) or are inherited from the parent thread
267 (value @code{PTHREAD_INHERIT_SCHED}). The default is
268 @code{PTHREAD_EXPLICIT_SCHED}.
271 Choose the scheduling contention scope for the created thread. The
272 default is @code{PTHREAD_SCOPE_SYSTEM}, meaning that the threads contend
273 for CPU time with all processes running on the machine. In particular,
274 thread priorities are interpreted relative to the priorities of all
275 other processes on the machine. The other possibility,
276 @code{PTHREAD_SCOPE_PROCESS}, means that scheduling contention occurs
277 only between the threads of the running process: thread priorities are
278 interpreted relative to the priorities of the other threads of the
279 process, regardless of the priorities of other processes.
281 @code{PTHREAD_SCOPE_PROCESS} is not supported in LinuxThreads. If you
282 try to set the scope to this value @code{pthread_attr_setscope} will
283 fail and return @code{ENOTSUP}.
287 @section Cancellation
289 Cancellation is the mechanism by which a thread can terminate the
290 execution of another thread. More precisely, a thread can send a
291 cancellation request to another thread. Depending on its settings, the
292 target thread can then either ignore the request, honor it immediately,
293 or defer it till it reaches a cancellation point. When threads are
294 first created by @code{pthread_create}, they always defer cancellation
297 When a thread eventually honors a cancellation request, it behaves as if
298 @code{pthread_exit(PTHREAD_CANCELED)} was called. All cleanup handlers
299 are executed in reverse order, finalization functions for
300 thread-specific data are called, and finally the thread stops executing.
301 If the cancelled thread was joinable, the return value
302 @code{PTHREAD_CANCELED} is provided to whichever thread calls
303 @var{pthread_join} on it. See @code{pthread_exit} for more information.
305 Cancellation points are the points where the thread checks for pending
306 cancellation requests and performs them. The POSIX threads functions
307 @code{pthread_join}, @code{pthread_cond_wait},
308 @code{pthread_cond_timedwait}, @code{pthread_testcancel},
309 @code{sem_wait}, and @code{sigwait} are cancellation points. In
310 addition, these system calls are cancellation points:
312 @multitable @columnfractions .33 .33 .33
313 @item @t{accept} @tab @t{open} @tab @t{sendmsg}
314 @item @t{close} @tab @t{pause} @tab @t{sendto}
315 @item @t{connect} @tab @t{read} @tab @t{system}
316 @item @t{fcntl} @tab @t{recv} @tab @t{tcdrain}
317 @item @t{fsync} @tab @t{recvfrom} @tab @t{wait}
318 @item @t{lseek} @tab @t{recvmsg} @tab @t{waitpid}
319 @item @t{msync} @tab @t{send} @tab @t{write}
324 All library functions that call these functions (such as
325 @code{printf}) are also cancellation points.
329 @deftypefun int pthread_setcancelstate (int @var{state}, int *@var{oldstate})
330 @code{pthread_setcancelstate} changes the cancellation state for the
331 calling thread -- that is, whether cancellation requests are ignored or
332 not. The @var{state} argument is the new cancellation state: either
333 @code{PTHREAD_CANCEL_ENABLE} to enable cancellation, or
334 @code{PTHREAD_CANCEL_DISABLE} to disable cancellation (cancellation
335 requests are ignored).
337 If @var{oldstate} is not @code{NULL}, the previous cancellation state is
338 stored in the location pointed to by @var{oldstate}, and can thus be
339 restored later by another call to @code{pthread_setcancelstate}.
341 If the @var{state} argument is not @code{PTHREAD_CANCEL_ENABLE} or
342 @code{PTHREAD_CANCEL_DISABLE}, @code{pthread_setcancelstate} fails and
343 returns @code{EINVAL}. Otherwise it returns 0.
348 @deftypefun int pthread_setcanceltype (int @var{type}, int *@var{oldtype})
349 @code{pthread_setcanceltype} changes the type of responses to
350 cancellation requests for the calling thread: asynchronous (immediate)
351 or deferred. The @var{type} argument is the new cancellation type:
352 either @code{PTHREAD_CANCEL_ASYNCHRONOUS} to cancel the calling thread
353 as soon as the cancellation request is received, or
354 @code{PTHREAD_CANCEL_DEFERRED} to keep the cancellation request pending
355 until the next cancellation point. If @var{oldtype} is not @code{NULL},
356 the previous cancellation state is stored in the location pointed to by
357 @var{oldtype}, and can thus be restored later by another call to
358 @code{pthread_setcanceltype}.
360 If the @var{type} argument is not @code{PTHREAD_CANCEL_DEFERRED} or
361 @code{PTHREAD_CANCEL_ASYNCHRONOUS}, @code{pthread_setcanceltype} fails
362 and returns @code{EINVAL}. Otherwise it returns 0.
367 @deftypefun void pthread_testcancel (@var{void})
368 @code{pthread_testcancel} does nothing except testing for pending
369 cancellation and executing it. Its purpose is to introduce explicit
370 checks for cancellation in long sequences of code that do not call
371 cancellation point functions otherwise.
374 @node Cleanup Handlers
375 @section Cleanup Handlers
377 Cleanup handlers are functions that get called when a thread terminates,
378 either by calling @code{pthread_exit} or because of
379 cancellation. Cleanup handlers are installed and removed following a
380 stack-like discipline.
382 The purpose of cleanup handlers is to free the resources that a thread
383 may hold at the time it terminates. In particular, if a thread exits or
384 is cancelled while it owns a locked mutex, the mutex will remain locked
385 forever and prevent other threads from executing normally. The best way
386 to avoid this is, just before locking the mutex, to install a cleanup
387 handler whose effect is to unlock the mutex. Cleanup handlers can be
388 used similarly to free blocks allocated with @code{malloc} or close file
389 descriptors on thread termination.
391 Here is how to lock a mutex @var{mut} in such a way that it will be
392 unlocked if the thread is canceled while @var{mut} is locked:
395 pthread_cleanup_push(pthread_mutex_unlock, (void *) &mut);
396 pthread_mutex_lock(&mut);
398 pthread_mutex_unlock(&mut);
399 pthread_cleanup_pop(0);
402 Equivalently, the last two lines can be replaced by
405 pthread_cleanup_pop(1);
408 Notice that the code above is safe only in deferred cancellation mode
409 (see @code{pthread_setcanceltype}). In asynchronous cancellation mode, a
410 cancellation can occur between @code{pthread_cleanup_push} and
411 @code{pthread_mutex_lock}, or between @code{pthread_mutex_unlock} and
412 @code{pthread_cleanup_pop}, resulting in both cases in the thread trying
413 to unlock a mutex not locked by the current thread. This is the main
414 reason why asynchronous cancellation is difficult to use.
416 If the code above must also work in asynchronous cancellation mode,
417 then it must switch to deferred mode for locking and unlocking the
421 pthread_setcanceltype(PTHREAD_CANCEL_DEFERRED, &oldtype);
422 pthread_cleanup_push(pthread_mutex_unlock, (void *) &mut);
423 pthread_mutex_lock(&mut);
425 pthread_cleanup_pop(1);
426 pthread_setcanceltype(oldtype, NULL);
429 The code above can be rewritten in a more compact and efficient way,
430 using the non-portable functions @code{pthread_cleanup_push_defer_np}
431 and @code{pthread_cleanup_pop_restore_np}:
434 pthread_cleanup_push_defer_np(pthread_mutex_unlock, (void *) &mut);
435 pthread_mutex_lock(&mut);
437 pthread_cleanup_pop_restore_np(1);
442 @deftypefun void pthread_cleanup_push (void (*@var{routine}) (void *), void *@var{arg})
444 @code{pthread_cleanup_push} installs the @var{routine} function with
445 argument @var{arg} as a cleanup handler. From this point on to the
446 matching @code{pthread_cleanup_pop}, the function @var{routine} will be
447 called with arguments @var{arg} when the thread terminates, either
448 through @code{pthread_exit} or by cancellation. If several cleanup
449 handlers are active at that point, they are called in LIFO order: the
450 most recently installed handler is called first.
455 @deftypefun void pthread_cleanup_pop (int @var{execute})
456 @code{pthread_cleanup_pop} removes the most recently installed cleanup
457 handler. If the @var{execute} argument is not 0, it also executes the
458 handler, by calling the @var{routine} function with arguments
459 @var{arg}. If the @var{execute} argument is 0, the handler is only
460 removed but not executed.
463 Matching pairs of @code{pthread_cleanup_push} and
464 @code{pthread_cleanup_pop} must occur in the same function, at the same
465 level of block nesting. Actually, @code{pthread_cleanup_push} and
466 @code{pthread_cleanup_pop} are macros, and the expansion of
467 @code{pthread_cleanup_push} introduces an open brace @code{@{} with the
468 matching closing brace @code{@}} being introduced by the expansion of the
469 matching @code{pthread_cleanup_pop}.
473 @deftypefun void pthread_cleanup_push_defer_np (void (*@var{routine}) (void *), void *@var{arg})
474 @code{pthread_cleanup_push_defer_np} is a non-portable extension that
475 combines @code{pthread_cleanup_push} and @code{pthread_setcanceltype}.
476 It pushes a cleanup handler just as @code{pthread_cleanup_push} does,
477 but also saves the current cancellation type and sets it to deferred
478 cancellation. This ensures that the cleanup mechanism is effective even
479 if the thread was initially in asynchronous cancellation mode.
484 @deftypefun void pthread_cleanup_pop_restore_np (int @var{execute})
485 @code{pthread_cleanup_pop_restore_np} pops a cleanup handler introduced
486 by @code{pthread_cleanup_push_defer_np}, and restores the cancellation
487 type to its value at the time @code{pthread_cleanup_push_defer_np} was
491 @code{pthread_cleanup_push_defer_np} and
492 @code{pthread_cleanup_pop_restore_np} must occur in matching pairs, at
493 the same level of block nesting.
498 pthread_cleanup_push_defer_np(routine, arg);
500 pthread_cleanup_pop_defer_np(execute);
504 is functionally equivalent to (but more compact and efficient than)
509 pthread_setcanceltype(PTHREAD_CANCEL_DEFERRED, &oldtype);
510 pthread_cleanup_push(routine, arg);
512 pthread_cleanup_pop(execute);
513 pthread_setcanceltype(oldtype, NULL);
521 A mutex is a MUTual EXclusion device, and is useful for protecting
522 shared data structures from concurrent modifications, and implementing
523 critical sections and monitors.
525 A mutex has two possible states: unlocked (not owned by any thread),
526 and locked (owned by one thread). A mutex can never be owned by two
527 different threads simultaneously. A thread attempting to lock a mutex
528 that is already locked by another thread is suspended until the owning
529 thread unlocks the mutex first.
531 None of the mutex functions is a cancellation point, not even
532 @code{pthread_mutex_lock}, in spite of the fact that it can suspend a
533 thread for arbitrary durations. This way, the status of mutexes at
534 cancellation points is predictable, allowing cancellation handlers to
535 unlock precisely those mutexes that need to be unlocked before the
536 thread stops executing. Consequently, threads using deferred
537 cancellation should never hold a mutex for extended periods of time.
539 It is not safe to call mutex functions from a signal handler. In
540 particular, calling @code{pthread_mutex_lock} or
541 @code{pthread_mutex_unlock} from a signal handler may deadlock the
546 @deftypefun int pthread_mutex_init (pthread_mutex_t *@var{mutex}, const pthread_mutexattr_t *@var{mutexattr})
548 @code{pthread_mutex_init} initializes the mutex object pointed to by
549 @var{mutex} according to the mutex attributes specified in @var{mutexattr}.
550 If @var{mutexattr} is @code{NULL}, default attributes are used instead.
552 The LinuxThreads implementation supports only one mutex attribute,
553 the @var{mutex kind}, which is either ``fast'', ``recursive'', or
554 ``error checking''. The kind of a mutex determines whether
555 it can be locked again by a thread that already owns it.
556 The default kind is ``fast''.
558 Variables of type @code{pthread_mutex_t} can also be initialized
559 statically, using the constants @code{PTHREAD_MUTEX_INITIALIZER} (for
560 fast mutexes), @code{PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP} (for
561 recursive mutexes), and @code{PTHREAD_ERRORCHECK_MUTEX_INITIALIZER_NP}
562 (for error checking mutexes).
564 @code{pthread_mutex_init} always returns 0.
569 @deftypefun int pthread_mutex_lock (pthread_mutex_t *mutex))
570 @code{pthread_mutex_lock} locks the given mutex. If the mutex is
571 currently unlocked, it becomes locked and owned by the calling thread,
572 and @code{pthread_mutex_lock} returns immediately. If the mutex is
573 already locked by another thread, @code{pthread_mutex_lock} suspends the
574 calling thread until the mutex is unlocked.
576 If the mutex is already locked by the calling thread, the behavior of
577 @code{pthread_mutex_lock} depends on the kind of the mutex. If the mutex
578 is of the ``fast'' kind, the calling thread is suspended. It will
579 remain suspended forever, because no other thread can unlock the mutex.
580 If the mutex is of the ``error checking'' kind, @code{pthread_mutex_lock}
581 returns immediately with the error code @code{EDEADLK}. If the mutex is
582 of the ``recursive'' kind, @code{pthread_mutex_lock} succeeds and
583 returns immediately, recording the number of times the calling thread
584 has locked the mutex. An equal number of @code{pthread_mutex_unlock}
585 operations must be performed before the mutex returns to the unlocked
591 @deftypefun int pthread_mutex_trylock (pthread_mutex_t *@var{mutex})
592 @code{pthread_mutex_trylock} behaves identically to
593 @code{pthread_mutex_lock}, except that it does not block the calling
594 thread if the mutex is already locked by another thread (or by the
595 calling thread in the case of a ``fast'' mutex). Instead,
596 @code{pthread_mutex_trylock} returns immediately with the error code
602 @deftypefun int pthread_mutex_unlock (pthread_mutex_t *@var{mutex})
603 @code{pthread_mutex_unlock} unlocks the given mutex. The mutex is
604 assumed to be locked and owned by the calling thread on entrance to
605 @code{pthread_mutex_unlock}. If the mutex is of the ``fast'' kind,
606 @code{pthread_mutex_unlock} always returns it to the unlocked state. If
607 it is of the ``recursive'' kind, it decrements the locking count of the
608 mutex (number of @code{pthread_mutex_lock} operations performed on it by
609 the calling thread), and only when this count reaches zero is the mutex
612 On ``error checking'' mutexes, @code{pthread_mutex_unlock} actually
613 checks at run-time that the mutex is locked on entrance, and that it was
614 locked by the same thread that is now calling
615 @code{pthread_mutex_unlock}. If these conditions are not met,
616 @code{pthread_mutex_unlock} returns @code{EPERM}, and the mutex remains
617 unchanged. ``Fast'' and ``recursive'' mutexes perform no such checks,
618 thus allowing a locked mutex to be unlocked by a thread other than its
619 owner. This is non-portable behavior and must not be relied upon.
624 @deftypefun int pthread_mutex_destroy (pthread_mutex_t *@var{mutex})
625 @code{pthread_mutex_destroy} destroys a mutex object, freeing the
626 resources it might hold. The mutex must be unlocked on entrance. In the
627 LinuxThreads implementation, no resources are associated with mutex
628 objects, thus @code{pthread_mutex_destroy} actually does nothing except
629 checking that the mutex is unlocked.
631 If the mutex is locked by some thread, @code{pthread_mutex_destroy}
632 returns @code{EBUSY}. Otherwise it returns 0.
635 If any of the above functions (except @code{pthread_mutex_init})
636 is applied to an uninitialized mutex, they will simply return
637 @code{EINVAL} and do nothing.
639 A shared global variable @var{x} can be protected by a mutex as follows:
643 pthread_mutex_t mut = PTHREAD_MUTEX_INITIALIZER;
646 All accesses and modifications to @var{x} should be bracketed by calls to
647 @code{pthread_mutex_lock} and @code{pthread_mutex_unlock} as follows:
650 pthread_mutex_lock(&mut);
652 pthread_mutex_unlock(&mut);
655 Mutex attributes can be specified at mutex creation time, by passing a
656 mutex attribute object as second argument to @code{pthread_mutex_init}.
657 Passing @code{NULL} is equivalent to passing a mutex attribute object
658 with all attributes set to their default values.
662 @deftypefun int pthread_mutexattr_init (pthread_mutexattr_t *@var{attr})
663 @code{pthread_mutexattr_init} initializes the mutex attribute object
664 @var{attr} and fills it with default values for the attributes.
666 This function always returns 0.
671 @deftypefun int pthread_mutexattr_destroy (pthread_mutexattr_t *@var{attr})
672 @code{pthread_mutexattr_destroy} destroys a mutex attribute object,
673 which must not be reused until it is
674 reinitialized. @code{pthread_mutexattr_destroy} does nothing in the
675 LinuxThreads implementation.
677 This function always returns 0.
680 LinuxThreads supports only one mutex attribute: the mutex kind, which is
681 either @code{PTHREAD_MUTEX_FAST_NP} for ``fast'' mutexes,
682 @code{PTHREAD_MUTEX_RECURSIVE_NP} for ``recursive'' mutexes, or
683 @code{PTHREAD_MUTEX_ERRORCHECK_NP} for ``error checking'' mutexes. As
684 the @code{NP} suffix indicates, this is a non-portable extension to the
685 POSIX standard and should not be employed in portable programs.
687 The mutex kind determines what happens if a thread attempts to lock a
688 mutex it already owns with @code{pthread_mutex_lock}. If the mutex is of
689 the ``fast'' kind, @code{pthread_mutex_lock} simply suspends the calling
690 thread forever. If the mutex is of the ``error checking'' kind,
691 @code{pthread_mutex_lock} returns immediately with the error code
692 @code{EDEADLK}. If the mutex is of the ``recursive'' kind, the call to
693 @code{pthread_mutex_lock} returns immediately with a success return
694 code. The number of times the thread owning the mutex has locked it is
695 recorded in the mutex. The owning thread must call
696 @code{pthread_mutex_unlock} the same number of times before the mutex
697 returns to the unlocked state.
699 The default mutex kind is ``fast'', that is, @code{PTHREAD_MUTEX_FAST_NP}.
703 @deftypefun int pthread_mutexattr_setkind_np (pthread_mutexattr_t *@var{attr}, int @var{kind})
704 @code{pthread_mutexattr_setkind_np} sets the mutex kind attribute in
705 @var{attr} to the value specified by @var{kind}.
707 If @var{kind} is not @code{PTHREAD_MUTEX_FAST_NP},
708 @code{PTHREAD_MUTEX_RECURSIVE_NP}, or
709 @code{PTHREAD_MUTEX_ERRORCHECK_NP}, this function will return
710 @code{EINVAL} and leave @var{attr} unchanged.
715 @deftypefun int pthread_mutexattr_getkind_np (const pthread_mutexattr_t *@var{attr}, int *@var{kind})
716 @code{pthread_mutexattr_getkind_np} retrieves the current value of the
717 mutex kind attribute in @var{attr} and stores it in the location pointed
720 This function always returns 0.
723 @node Condition Variables
724 @section Condition Variables
726 A condition (short for ``condition variable'') is a synchronization
727 device that allows threads to suspend execution until some predicate on
728 shared data is satisfied. The basic operations on conditions are: signal
729 the condition (when the predicate becomes true), and wait for the
730 condition, suspending the thread execution until another thread signals
733 A condition variable must always be associated with a mutex, to avoid
734 the race condition where a thread prepares to wait on a condition
735 variable and another thread signals the condition just before the first
736 thread actually waits on it.
740 @deftypefun int pthread_cond_init (pthread_cond_t *@var{cond}, pthread_condattr_t *cond_@var{attr})
742 @code{pthread_cond_init} initializes the condition variable @var{cond},
743 using the condition attributes specified in @var{cond_attr}, or default
744 attributes if @var{cond_attr} is @code{NULL}. The LinuxThreads
745 implementation supports no attributes for conditions, hence the
746 @var{cond_attr} parameter is actually ignored.
748 Variables of type @code{pthread_cond_t} can also be initialized
749 statically, using the constant @code{PTHREAD_COND_INITIALIZER}.
751 This function always returns 0.
756 @deftypefun int pthread_cond_signal (pthread_cond_t *@var{cond})
757 @code{pthread_cond_signal} restarts one of the threads that are waiting
758 on the condition variable @var{cond}. If no threads are waiting on
759 @var{cond}, nothing happens. If several threads are waiting on
760 @var{cond}, exactly one is restarted, but it is not specified which.
762 This function always returns 0.
767 @deftypefun int pthread_cond_broadcast (pthread_cond_t *@var{cond})
768 @code{pthread_cond_broadcast} restarts all the threads that are waiting
769 on the condition variable @var{cond}. Nothing happens if no threads are
770 waiting on @var{cond}.
772 This function always returns 0.
777 @deftypefun int pthread_cond_wait (pthread_cond_t *@var{cond}, pthread_mutex_t *@var{mutex})
778 @code{pthread_cond_wait} atomically unlocks the @var{mutex} (as per
779 @code{pthread_unlock_mutex}) and waits for the condition variable
780 @var{cond} to be signaled. The thread execution is suspended and does
781 not consume any CPU time until the condition variable is signaled. The
782 @var{mutex} must be locked by the calling thread on entrance to
783 @code{pthread_cond_wait}. Before returning to the calling thread,
784 @code{pthread_cond_wait} re-acquires @var{mutex} (as per
785 @code{pthread_lock_mutex}).
787 Unlocking the mutex and suspending on the condition variable is done
788 atomically. Thus, if all threads always acquire the mutex before
789 signaling the condition, this guarantees that the condition cannot be
790 signaled (and thus ignored) between the time a thread locks the mutex
791 and the time it waits on the condition variable.
793 This function always returns 0.
798 @deftypefun int pthread_cond_timedwait (pthread_cond_t *@var{cond}, pthread_mutex_t *@var{mutex}, const struct timespec *@var{abstime})
799 @code{pthread_cond_timedwait} atomically unlocks @var{mutex} and waits
800 on @var{cond}, as @code{pthread_cond_wait} does, but it also bounds the
801 duration of the wait. If @var{cond} has not been signaled before time
802 @var{abstime}, the mutex @var{mutex} is re-acquired and
803 @code{pthread_cond_timedwait} returns the error code @code{ETIMEDOUT}.
804 The wait can also be interrupted by a signal; in that case
805 @code{pthread_cond_timedwait} returns @code{EINTR}.
807 The @var{abstime} parameter specifies an absolute time, with the same
808 origin as @code{time} and @code{gettimeofday}: an @var{abstime} of 0
809 corresponds to 00:00:00 GMT, January 1, 1970.
814 @deftypefun int pthread_cond_destroy (pthread_cond_t *@var{cond})
815 @code{pthread_cond_destroy} destroys the condition variable @var{cond},
816 freeing the resources it might hold. If any threads are waiting on the
817 condition variable, @code{pthread_cond_destroy} leaves @var{cond}
818 untouched and returns @code{EBUSY}. Otherwise it returns 0, and
819 @var{cond} must not be used again until it is reinitialized.
821 In the LinuxThreads implementation, no resources are associated with
822 condition variables, so @code{pthread_cond_destroy} actually does
826 @code{pthread_cond_wait} and @code{pthread_cond_timedwait} are
827 cancellation points. If a thread is cancelled while suspended in one of
828 these functions, the thread immediately resumes execution, relocks the
829 mutex specified by @var{mutex}, and finally executes the cancellation.
830 Consequently, cleanup handlers are assured that @var{mutex} is locked
831 when they are called.
833 It is not safe to call the condition variable functions from a signal
834 handler. In particular, calling @code{pthread_cond_signal} or
835 @code{pthread_cond_broadcast} from a signal handler may deadlock the
838 Consider two shared variables @var{x} and @var{y}, protected by the
839 mutex @var{mut}, and a condition variable @var{cond} that is to be
840 signaled whenever @var{x} becomes greater than @var{y}.
844 pthread_mutex_t mut = PTHREAD_MUTEX_INITIALIZER;
845 pthread_cond_t cond = PTHREAD_COND_INITIALIZER;
848 Waiting until @var{x} is greater than @var{y} is performed as follows:
851 pthread_mutex_lock(&mut);
853 pthread_cond_wait(&cond, &mut);
855 /* operate on x and y */
856 pthread_mutex_unlock(&mut);
859 Modifications on @var{x} and @var{y} that may cause @var{x} to become greater than
860 @var{y} should signal the condition if needed:
863 pthread_mutex_lock(&mut);
865 if (x > y) pthread_cond_broadcast(&cond);
866 pthread_mutex_unlock(&mut);
869 If it can be proved that at most one waiting thread needs to be waken
870 up (for instance, if there are only two threads communicating through
871 @var{x} and @var{y}), @code{pthread_cond_signal} can be used as a slightly more
872 efficient alternative to @code{pthread_cond_broadcast}. In doubt, use
873 @code{pthread_cond_broadcast}.
875 To wait for @var{x} to becomes greater than @var{y} with a timeout of 5
880 struct timespec timeout;
883 pthread_mutex_lock(&mut);
885 timeout.tv_sec = now.tv_sec + 5;
886 timeout.tv_nsec = now.tv_usec * 1000;
888 while (x <= y && retcode != ETIMEDOUT) @{
889 retcode = pthread_cond_timedwait(&cond, &mut, &timeout);
891 if (retcode == ETIMEDOUT) @{
892 /* timeout occurred */
894 /* operate on x and y */
896 pthread_mutex_unlock(&mut);
899 Condition attributes can be specified at condition creation time, by
900 passing a condition attribute object as second argument to
901 @code{pthread_cond_init}. Passing @code{NULL} is equivalent to passing
902 a condition attribute object with all attributes set to their default
905 The LinuxThreads implementation supports no attributes for
906 conditions. The functions on condition attributes are included only for
907 compliance with the POSIX standard.
911 @deftypefun int pthread_condattr_init (pthread_condattr_t *@var{attr})
912 @deftypefunx int pthread_condattr_destroy (pthread_condattr_t *@var{attr})
913 @code{pthread_condattr_init} initializes the condition attribute object
914 @var{attr} and fills it with default values for the attributes.
915 @code{pthread_condattr_destroy} destroys the condition attribute object
918 Both functions do nothing in the LinuxThreads implementation.
920 @code{pthread_condattr_init} and @code{pthread_condattr_destroy} always
924 @node POSIX Semaphores
925 @section POSIX Semaphores
927 @vindex SEM_VALUE_MAX
928 Semaphores are counters for resources shared between threads. The
929 basic operations on semaphores are: increment the counter atomically,
930 and wait until the counter is non-null and decrement it atomically.
932 Semaphores have a maximum value past which they cannot be incremented.
933 The macro @code{SEM_VALUE_MAX} is defined to be this maximum value. In
934 the GNU C library, @code{SEM_VALUE_MAX} is equal to @code{INT_MAX}
935 (@pxref{Range of Type}), but it may be much smaller on other systems.
937 The pthreads library implements POSIX 1003.1b semaphores. These should
938 not be confused with System V semaphores (@code{ipc}, @code{semctl} and
940 @c !!! SysV IPC is not doc'd at all in our manual
942 All the semaphore functions and macros are defined in @file{semaphore.h}.
946 @deftypefun int sem_init (sem_t *@var{sem}, int @var{pshared}, unsigned int @var{value})
947 @code{sem_init} initializes the semaphore object pointed to by
948 @var{sem}. The count associated with the semaphore is set initially to
949 @var{value}. The @var{pshared} argument indicates whether the semaphore
950 is local to the current process (@var{pshared} is zero) or is to be
951 shared between several processes (@var{pshared} is not zero).
953 On success @code{sem_init} returns 0. On failure it returns -1 and sets
954 @var{errno} to one of the following values:
958 @var{value} exceeds the maximal counter value @code{SEM_VALUE_MAX}
961 @var{pshared} is not zero. LinuxThreads currently does not support
962 process-shared semaphores. (This will eventually change.)
968 @deftypefun int sem_destroy (sem_t * @var{sem})
969 @code{sem_destroy} destroys a semaphore object, freeing the resources it
970 might hold. If any threads are waiting on the semaphore when
971 @code{sem_destroy} is called, it fails and sets @var{errno} to
974 In the LinuxThreads implementation, no resources are associated with
975 semaphore objects, thus @code{sem_destroy} actually does nothing except
976 checking that no thread is waiting on the semaphore. This will change
977 when process-shared semaphores are implemented.
982 @deftypefun int sem_wait (sem_t * @var{sem})
983 @code{sem_wait} suspends the calling thread until the semaphore pointed
984 to by @var{sem} has non-zero count. It then atomically decreases the
987 @code{sem_wait} is a cancellation point. It always returns 0.
992 @deftypefun int sem_trywait (sem_t * @var{sem})
993 @code{sem_trywait} is a non-blocking variant of @code{sem_wait}. If the
994 semaphore pointed to by @var{sem} has non-zero count, the count is
995 atomically decreased and @code{sem_trywait} immediately returns 0. If
996 the semaphore count is zero, @code{sem_trywait} immediately returns -1
997 and sets errno to @code{EAGAIN}.
1000 @comment semaphore.h
1002 @deftypefun int sem_post (sem_t * @var{sem})
1003 @code{sem_post} atomically increases the count of the semaphore pointed to
1004 by @var{sem}. This function never blocks.
1006 @c !!! This para appears not to agree with the code.
1007 On processors supporting atomic compare-and-swap (Intel 486, Pentium and
1008 later, Alpha, PowerPC, MIPS II, Motorola 68k, Ultrasparc), the
1009 @code{sem_post} function is can safely be called from signal handlers.
1010 This is the only thread synchronization function provided by POSIX
1011 threads that is async-signal safe. On the Intel 386 and earlier Sparc
1012 chips, the current LinuxThreads implementation of @code{sem_post} is not
1013 async-signal safe, because the hardware does not support the required
1016 @code{sem_post} always succeeds and returns 0, unless the semaphore
1017 count would exceed @code{SEM_VALUE_MAX} after being incremented. In
1018 that case @code{sem_post} returns -1 and sets @var{errno} to
1019 @code{EINVAL}. The semaphore count is left unchanged.
1022 @comment semaphore.h
1024 @deftypefun int sem_getvalue (sem_t * @var{sem}, int * @var{sval})
1025 @code{sem_getvalue} stores in the location pointed to by @var{sval} the
1026 current count of the semaphore @var{sem}. It always returns 0.
1029 @node Thread-Specific Data
1030 @section Thread-Specific Data
1032 Programs often need global or static variables that have different
1033 values in different threads. Since threads share one memory space, this
1034 cannot be achieved with regular variables. Thread-specific data is the
1035 POSIX threads answer to this need.
1037 Each thread possesses a private memory block, the thread-specific data
1038 area, or TSD area for short. This area is indexed by TSD keys. The TSD
1039 area associates values of type @code{void *} to TSD keys. TSD keys are
1040 common to all threads, but the value associated with a given TSD key can
1041 be different in each thread.
1043 For concreteness, the TSD areas can be viewed as arrays of @code{void *}
1044 pointers, TSD keys as integer indices into these arrays, and the value
1045 of a TSD key as the value of the corresponding array element in the
1048 When a thread is created, its TSD area initially associates @code{NULL}
1053 @deftypefun int pthread_key_create (pthread_key_t *@var{key}, void (*destr_function) (void *))
1054 @code{pthread_key_create} allocates a new TSD key. The key is stored in
1055 the location pointed to by @var{key}. There is a limit of
1056 @code{PTHREAD_KEYS_MAX} on the number of keys allocated at a given
1057 time. The value initially associated with the returned key is
1058 @code{NULL} in all currently executing threads.
1060 The @var{destr_function} argument, if not @code{NULL}, specifies a
1061 destructor function associated with the key. When a thread terminates
1062 via @code{pthread_exit} or by cancellation, @var{destr_function} is
1063 called on the value associated with the key in that thread. The
1064 @var{destr_function} is not called if a key is deleted with
1065 @code{pthread_key_delete} or a value is changed with
1066 @code{pthread_setspecific}. The order in which destructor functions are
1067 called at thread termination time is unspecified.
1069 Before the destructor function is called, the @code{NULL} value is
1070 associated with the key in the current thread. A destructor function
1071 might, however, re-associate non-@code{NULL} values to that key or some
1072 other key. To deal with this, if after all the destructors have been
1073 called for all non-@code{NULL} values, there are still some
1074 non-@code{NULL} values with associated destructors, then the process is
1075 repeated. The LinuxThreads implementation stops the process after
1076 @code{PTHREAD_DESTRUCTOR_ITERATIONS} iterations, even if some
1077 non-@code{NULL} values with associated descriptors remain. Other
1078 implementations may loop indefinitely.
1080 @code{pthread_key_create} returns 0 unless @code{PTHREAD_KEYS_MAX} keys
1081 have already been allocated, in which case it fails and returns
1088 @deftypefun int pthread_key_delete (pthread_key_t @var{key})
1089 @code{pthread_key_delete} deallocates a TSD key. It does not check
1090 whether non-@code{NULL} values are associated with that key in the
1091 currently executing threads, nor call the destructor function associated
1094 If there is no such key @var{key}, it returns @code{EINVAL}. Otherwise
1100 @deftypefun int pthread_setspecific (pthread_key_t @var{key}, const void *@var{pointer})
1101 @code{pthread_setspecific} changes the value associated with @var{key}
1102 in the calling thread, storing the given @var{pointer} instead.
1104 If there is no such key @var{key}, it returns @code{EINVAL}. Otherwise
1110 @deftypefun {void *} pthread_getspecific (pthread_key_t @var{key})
1111 @code{pthread_getspecific} returns the value currently associated with
1112 @var{key} in the calling thread.
1114 If there is no such key @var{key}, it returns @code{NULL}.
1117 The following code fragment allocates a thread-specific array of 100
1118 characters, with automatic reclaimation at thread exit:
1121 /* Key for the thread-specific buffer */
1122 static pthread_key_t buffer_key;
1124 /* Once-only initialisation of the key */
1125 static pthread_once_t buffer_key_once = PTHREAD_ONCE_INIT;
1127 /* Allocate the thread-specific buffer */
1128 void buffer_alloc(void)
1130 pthread_once(&buffer_key_once, buffer_key_alloc);
1131 pthread_setspecific(buffer_key, malloc(100));
1134 /* Return the thread-specific buffer */
1135 char * get_buffer(void)
1137 return (char *) pthread_getspecific(buffer_key);
1140 /* Allocate the key */
1141 static void buffer_key_alloc()
1143 pthread_key_create(&buffer_key, buffer_destroy);
1146 /* Free the thread-specific buffer */
1147 static void buffer_destroy(void * buf)
1153 @node Threads and Signal Handling
1154 @section Threads and Signal Handling
1158 @deftypefun int pthread_sigmask (int @var{how}, const sigset_t *@var{newmask}, sigset_t *@var{oldmask})
1159 @code{pthread_sigmask} changes the signal mask for the calling thread as
1160 described by the @var{how} and @var{newmask} arguments. If @var{oldmask}
1161 is not @code{NULL}, the previous signal mask is stored in the location
1162 pointed to by @var{oldmask}.
1164 The meaning of the @var{how} and @var{newmask} arguments is the same as
1165 for @code{sigprocmask}. If @var{how} is @code{SIG_SETMASK}, the signal
1166 mask is set to @var{newmask}. If @var{how} is @code{SIG_BLOCK}, the
1167 signals specified to @var{newmask} are added to the current signal mask.
1168 If @var{how} is @code{SIG_UNBLOCK}, the signals specified to
1169 @var{newmask} are removed from the current signal mask.
1171 Recall that signal masks are set on a per-thread basis, but signal
1172 actions and signal handlers, as set with @code{sigaction}, are shared
1173 between all threads.
1175 The @code{pthread_sigmask} function returns 0 on success, and one of the
1176 following error codes on error:
1179 @var{how} is not one of @code{SIG_SETMASK}, @code{SIG_BLOCK}, or @code{SIG_UNBLOCK}
1182 @var{newmask} or @var{oldmask} point to invalid addresses
1188 @deftypefun int pthread_kill (pthread_t @var{thread}, int @var{signo})
1189 @code{pthread_kill} sends signal number @var{signo} to the thread
1190 @var{thread}. The signal is delivered and handled as described in
1191 @ref{Signal Handling}.
1193 @code{pthread_kill} returns 0 on success, one of the following error codes
1197 @var{signo} is not a valid signal number
1200 The thread @var{thread} does not exist (e.g. it has already terminated)
1206 @deftypefun int sigwait (const sigset_t *@var{set}, int *@var{sig})
1207 @code{sigwait} suspends the calling thread until one of the signals in
1208 @var{set} is delivered to the calling thread. It then stores the number
1209 of the signal received in the location pointed to by @var{sig} and
1210 returns. The signals in @var{set} must be blocked and not ignored on
1211 entrance to @code{sigwait}. If the delivered signal has a signal handler
1212 function attached, that function is @emph{not} called.
1214 @code{sigwait} is a cancellation point. It always returns 0.
1217 For @code{sigwait} to work reliably, the signals being waited for must be
1218 blocked in all threads, not only in the calling thread, since
1219 otherwise the POSIX semantics for signal delivery do not guarantee
1220 that it's the thread doing the @code{sigwait} that will receive the signal.
1221 The best way to achieve this is block those signals before any threads
1222 are created, and never unblock them in the program other than by
1223 calling @code{sigwait}.
1225 Signal handling in LinuxThreads departs significantly from the POSIX
1226 standard. According to the standard, ``asynchronous'' (external) signals
1227 are addressed to the whole process (the collection of all threads),
1228 which then delivers them to one particular thread. The thread that
1229 actually receives the signal is any thread that does not currently block
1232 In LinuxThreads, each thread is actually a kernel process with its own
1233 PID, so external signals are always directed to one particular thread.
1234 If, for instance, another thread is blocked in @code{sigwait} on that
1235 signal, it will not be restarted.
1237 The LinuxThreads implementation of @code{sigwait} installs dummy signal
1238 handlers for the signals in @var{set} for the duration of the
1239 wait. Since signal handlers are shared between all threads, other
1240 threads must not attach their own signal handlers to these signals, or
1241 alternatively they should all block these signals (which is recommended
1244 @node Threads and Fork
1245 @section Threads and Fork
1247 It's not intuitively obvious what should happen when a multi-threaded POSIX
1248 process calls @code{fork}. Not only are the semantics tricky, but you may
1249 need to write code that does the right thing at fork time even if that code
1250 doesn't use the @code{fork} function. Moreover, you need to be aware of
1251 interaction between @code{fork} and some library features like
1252 @code{pthread_once} and stdio streams.
1254 When @code{fork} is called by one of the threads of a process, it creates a new
1255 process which is copy of the calling process. Effectively, in addition to
1256 copying certain system objects, the function takes a snapshot of the memory
1257 areas of the parent process, and creates identical areas in the child.
1258 To make matters more complicated, with threads it's possible for two or more
1259 threads to concurrently call fork to create two or more child processes.
1261 The child process has a copy of the address space of the parent, but it does
1262 not inherit any of its threads. Execution of the child process is carried out
1263 by a new thread which returns from @code{fork} function with a return value of
1264 zero; it is the only thread in the child process. Because threads are not
1265 inherited across fork, issues arise. At the time of the call to @code{fork},
1266 threads in the parent process other than the one calling @code{fork} may have
1267 been executing critical regions of code. As a result, the child process may
1268 get a copy of objects that are not in a well-defined state. This potential
1269 problem affects all components of the program.
1271 Any program component which will continue being used in a child process must
1272 correctly handle its state during @code{fork}. For this purpose, the POSIX
1273 interface provides the special function @code{pthread_atfork} for installing
1274 pointers to handler functions which are called from within @code{fork}.
1278 @deftypefun int pthread_atfork (void (*@var{prepare})(void), void (*@var{parent})(void), void (*@var{child})(void))
1280 @code{pthread_atfork} registers handler functions to be called just
1281 before and just after a new process is created with @code{fork}. The
1282 @var{prepare} handler will be called from the parent process, just
1283 before the new process is created. The @var{parent} handler will be
1284 called from the parent process, just before @code{fork} returns. The
1285 @var{child} handler will be called from the child process, just before
1286 @code{fork} returns.
1288 @code{pthread_atfork} returns 0 on success and a non-zero error code on
1291 One or more of the three handlers @var{prepare}, @var{parent} and
1292 @var{child} can be given as @code{NULL}, meaning that no handler needs
1293 to be called at the corresponding point.
1295 @code{pthread_atfork} can be called several times to install several
1296 sets of handlers. At @code{fork} time, the @var{prepare} handlers are
1297 called in LIFO order (last added with @code{pthread_atfork}, first
1298 called before @code{fork}), while the @var{parent} and @var{child}
1299 handlers are called in FIFO order (first added, first called).
1301 If there is insufficient memory available to register the handlers,
1302 @code{pthread_atfork} fails and returns @code{ENOMEM}. Otherwise it
1305 The functions @code{fork} and @code{pthread_atfork} must not be regarded as
1306 reentrant from the context of the handlers. That is to say, if a
1307 @code{pthread_atfork} handler invoked from within @code{fork} calls
1308 @code{pthread_atfork} or @code{fork}, the behavior is undefined.
1310 Registering a triplet of handlers is an atomic operation with respect to fork.
1311 If new handlers are registered at about the same time as a fork occurs, either
1312 all three handlers will be called, or none of them will be called.
1314 The handlers are inherited by the child process, and there is no
1315 way to remove them, short of using @code{exec} to load a new
1320 To understand the purpose of @code{pthread_atfork}, recall that
1321 @code{fork} duplicates the whole memory space, including mutexes in
1322 their current locking state, but only the calling thread: other threads
1323 are not running in the child process. Thus, if a mutex is locked by a
1324 thread other than the thread calling @code{fork}, that mutex will remain
1325 locked forever in the child process, possibly blocking the execution of
1326 the child process. Or if some shared data, such as a linked list, was in the
1327 middle of being updated by a thread in the parent process, the child
1328 will get a copy of the incompletely updated data which it cannot use.
1330 To avoid this, install handlers with @code{pthread_atfork} as follows: have the
1331 @var{prepare} handler lock the mutexes (in locking order), and the
1332 @var{parent} handler unlock the mutexes. The @var{child} handler should reset
1333 the mutexes using @code{pthread_mutex_init}, as well as any other
1334 synchronization objects such as condition variables.
1336 Locking the global mutexes before the fork ensures that all other threads are
1337 locked out of the critical regions of code protected by those mutexes. Thus
1338 when @code{fork} takes a snapshot of the parent's address space, that snapshot
1339 will copy valid, stable data. Resetting the synchronization objects in the
1340 child process will ensure they are properly cleansed of any artifacts from the
1341 threading subsystem of the parent process. For example, a mutex may inherit
1342 a wait queue of threads waiting for the lock; this wait queue makes no sense
1343 in the child process. Initializing the mutex takes care of this.
1345 @node Streams and Fork
1346 @section Streams and Fork
1348 The GNU standard I/O library has an internal mutex which guards the internal
1349 linked list of all standard C FILE objects. This mutex is properly taken care
1350 of during @code{fork} so that the child receives an intact copy of the list.
1351 This allows the @code{fopen} function, and related stream-creating functions,
1352 to work correctly in the child process, since these functions need to insert
1355 However, the individual stream locks are not completely taken care of. Thus
1356 unless the multithreaded application takes special precautions in its use of
1357 @code{fork}, the child process might not be able to safely use the streams that
1358 it inherited from the parent. In general, for any given open stream in the
1359 parent that is to be used by the child process, the application must ensure
1360 that that stream is not in use by another thread when @code{fork} is called.
1361 Otherwise an inconsistent copy of the stream object be produced. An easy way to
1362 ensure this is to use @code{flockfile} to lock the stream prior to calling
1363 @code{fork} and then unlock it with @code{funlockfile} inside the parent
1364 process, provided that the parent's threads properly honor these locks.
1365 Nothing special needs to be done in the child process, since the library
1366 internally resets all stream locks.
1368 Note that the stream locks are not shared between the parent and child.
1369 For example, even if you ensure that, say, the stream @code{stdout} is properly
1370 treated and can be safely used in the child, the stream locks do not provide
1371 an exclusion mechanism between the parent and child. If both processes write
1372 to @code{stdout}, strangely interleaved output may result regardless of
1373 the explicit use of @code{flockfile} or implicit locks.
1375 Also note that these provisions are a GNU extension; other systems might not
1376 provide any way for streams to be used in the child of a multithreaded process.
1377 POSIX requires that such a child process confines itself to calling only
1378 asynchronous safe functions, which excludes much of the library, including
1381 @node Miscellaneous Thread Functions
1382 @section Miscellaneous Thread Functions
1386 @deftypefun {pthread_t} pthread_self (@var{void})
1387 @code{pthread_self} returns the thread identifier for the calling thread.
1392 @deftypefun int pthread_equal (pthread_t thread1, pthread_t thread2)
1393 @code{pthread_equal} determines if two thread identifiers refer to the same
1396 A non-zero value is returned if @var{thread1} and @var{thread2} refer to
1397 the same thread. Otherwise, 0 is returned.
1402 @deftypefun int pthread_detach (pthread_t @var{th})
1403 @code{pthread_detach} puts the thread @var{th} in the detached
1404 state. This guarantees that the memory resources consumed by @var{th}
1405 will be freed immediately when @var{th} terminates. However, this
1406 prevents other threads from synchronizing on the termination of @var{th}
1407 using @code{pthread_join}.
1409 A thread can be created initially in the detached state, using the
1410 @code{detachstate} attribute to @code{pthread_create}. In contrast,
1411 @code{pthread_detach} applies to threads created in the joinable state,
1412 and which need to be put in the detached state later.
1414 After @code{pthread_detach} completes, subsequent attempts to perform
1415 @code{pthread_join} on @var{th} will fail. If another thread is already
1416 joining the thread @var{th} at the time @code{pthread_detach} is called,
1417 @code{pthread_detach} does nothing and leaves @var{th} in the joinable
1420 On success, 0 is returned. On error, one of the following codes is
1424 No thread could be found corresponding to that specified by @var{th}
1426 The thread @var{th} is already in the detached state
1432 @deftypefun void pthread_kill_other_threads_np (@var{void})
1433 @code{pthread_kill_other_threads_np} is a non-portable LinuxThreads extension.
1434 It causes all threads in the program to terminate immediately, except
1435 the calling thread which proceeds normally. It is intended to be
1436 called just before a thread calls one of the @code{exec} functions,
1439 Termination of the other threads is not performed through
1440 @code{pthread_cancel} and completely bypasses the cancellation
1441 mechanism. Hence, the current settings for cancellation state and
1442 cancellation type are ignored, and the cleanup handlers are not
1443 executed in the terminated threads.
1445 According to POSIX 1003.1c, a successful @code{exec*} in one of the
1446 threads should automatically terminate all other threads in the program.
1447 This behavior is not yet implemented in LinuxThreads. Calling
1448 @code{pthread_kill_other_threads_np} before @code{exec*} achieves much
1449 of the same behavior, except that if @code{exec*} ultimately fails, then
1450 all other threads are already killed.
1455 @deftypefun int pthread_once (pthread_once_t *once_@var{control}, void (*@var{init_routine}) (void))
1457 The purpose of @code{pthread_once} is to ensure that a piece of
1458 initialization code is executed at most once. The @var{once_control}
1459 argument points to a static or extern variable statically initialized
1460 to @code{PTHREAD_ONCE_INIT}.
1462 The first time @code{pthread_once} is called with a given
1463 @var{once_control} argument, it calls @var{init_routine} with no
1464 argument and changes the value of the @var{once_control} variable to
1465 record that initialization has been performed. Subsequent calls to
1466 @code{pthread_once} with the same @code{once_control} argument do
1469 If a thread is cancelled while executing @var{init_routine}
1470 the state of the @var{once_control} variable is reset so that
1471 a future call to @code{pthread_once} will call the routine again.
1473 If the process forks while one or more threads are executing
1474 @code{pthread_once} initialization routines, the states of their respective
1475 @var{once_control} variables will appear to be reset in the child process so
1476 that if the child calls @code{pthread_once}, the routines will be executed.
1478 @code{pthread_once} always returns 0.
1483 @deftypefun int pthread_setschedparam (pthread_t target_@var{thread}, int @var{policy}, const struct sched_param *@var{param})
1485 @code{pthread_setschedparam} sets the scheduling parameters for the
1486 thread @var{target_thread} as indicated by @var{policy} and
1487 @var{param}. @var{policy} can be either @code{SCHED_OTHER} (regular,
1488 non-realtime scheduling), @code{SCHED_RR} (realtime, round-robin) or
1489 @code{SCHED_FIFO} (realtime, first-in first-out). @var{param} specifies
1490 the scheduling priority for the two realtime policies. See
1491 @code{sched_setpolicy} for more information on scheduling policies.
1493 The realtime scheduling policies @code{SCHED_RR} and @code{SCHED_FIFO}
1494 are available only to processes with superuser privileges.
1496 On success, @code{pthread_setschedparam} returns 0. On error it returns
1497 one of the following codes:
1500 @var{policy} is not one of @code{SCHED_OTHER}, @code{SCHED_RR},
1501 @code{SCHED_FIFO}, or the priority value specified by @var{param} is not
1502 valid for the specified policy
1505 Realtime scheduling was requested but the calling process does not have
1506 sufficient privileges.
1509 The @var{target_thread} is invalid or has already terminated
1512 @var{param} points outside the process memory space
1518 @deftypefun int pthread_getschedparam (pthread_t target_@var{thread}, int *@var{policy}, struct sched_param *@var{param})
1520 @code{pthread_getschedparam} retrieves the scheduling policy and
1521 scheduling parameters for the thread @var{target_thread} and stores them
1522 in the locations pointed to by @var{policy} and @var{param},
1525 @code{pthread_getschedparam} returns 0 on success, or one of the
1526 following error codes on failure:
1529 The @var{target_thread} is invalid or has already terminated.
1532 @var{policy} or @var{param} point outside the process memory space.