2 * threads.c request threading support
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
20 * Copyright 2000,2006 The FreeRADIUS server project
21 * Copyright 2000 Alan DeKok <aland@ox.org>
24 #include <freeradius-devel/ident.h>
27 #include <freeradius-devel/radiusd.h>
28 #include <freeradius-devel/rad_assert.h>
31 * Other OS's have sem_init, OS X doesn't.
33 #ifdef HAVE_SEMAPHORE_H
34 #include <semaphore.h>
38 #include <mach/task.h>
39 #include <mach/semaphore.h>
42 #define sem_t semaphore_t
44 #define sem_init(s,p,c) semaphore_create(mach_task_self(),s,SYNC_POLICY_FIFO,c)
46 #define sem_wait(s) semaphore_wait(*s)
48 #define sem_post(s) semaphore_signal(*s)
51 #ifdef HAVE_SYS_WAIT_H
57 #ifdef HAVE_OPENSSL_CRYPTO_H
58 #include <openssl/crypto.h>
60 #ifdef HAVE_OPENSSL_ERR_H
61 #include <openssl/err.h>
64 #define SEMAPHORE_LOCKED (0)
65 #define SEMAPHORE_UNLOCKED (1)
67 #define THREAD_RUNNING (1)
68 #define THREAD_CANCELLED (2)
69 #define THREAD_EXITED (3)
71 #define NUM_FIFOS RAD_LISTEN_MAX
75 * A data structure which contains the information about
78 * pthread_id pthread id
79 * thread_num server thread number, 1...number of threads
80 * semaphore used to block the thread until a request comes in
81 * status is the thread running or exited?
82 * request_count the number of requests that this thread has handled
83 * timestamp when the thread started executing.
85 typedef struct THREAD_HANDLE {
86 struct THREAD_HANDLE *prev;
87 struct THREAD_HANDLE *next;
91 unsigned int request_count;
97 * For the request queue.
99 typedef struct request_queue_t {
101 RAD_REQUEST_FUNP fun;
104 typedef struct thread_fork_t {
112 * A data structure to manage the thread pool. There's no real
113 * need for a data structure, but it makes things conceptually
116 typedef struct THREAD_POOL {
121 int active_threads; /* protected by queue_mutex */
125 int min_spare_threads;
126 int max_spare_threads;
127 unsigned int max_requests_per_thread;
128 unsigned long request_count;
129 time_t time_last_spawned;
133 pthread_mutex_t wait_mutex;
134 lrad_hash_table_t *waiters;
137 * All threads wait on this semaphore, for requests
138 * to enter the queue.
143 * To ensure only one thread at a time touches the queue.
145 pthread_mutex_t queue_mutex;
150 lrad_fifo_t *fifo[NUM_FIFOS];
153 static THREAD_POOL thread_pool;
154 static int pool_initialized = FALSE;
155 static time_t last_cleaned = 0;
157 static void thread_pool_manage(time_t now);
160 * A mapping of configuration file names to internal integers
162 static const CONF_PARSER thread_config[] = {
163 { "start_servers", PW_TYPE_INTEGER, 0, &thread_pool.start_threads, "5" },
164 { "max_servers", PW_TYPE_INTEGER, 0, &thread_pool.max_threads, "32" },
165 { "min_spare_servers", PW_TYPE_INTEGER, 0, &thread_pool.min_spare_threads, "3" },
166 { "max_spare_servers", PW_TYPE_INTEGER, 0, &thread_pool.max_spare_threads, "10" },
167 { "max_requests_per_server", PW_TYPE_INTEGER, 0, &thread_pool.max_requests_per_thread, "0" },
168 { "cleanup_delay", PW_TYPE_INTEGER, 0, &thread_pool.cleanup_delay, "5" },
169 { "max_queue_size", PW_TYPE_INTEGER, 0, &thread_pool.max_queue_size, "65536" },
170 { NULL, -1, 0, NULL, NULL }
174 #ifdef HAVE_OPENSSL_CRYPTO_H
177 * If we're linking against OpenSSL, then it is the
178 * duty of the application, if it is multithreaded,
179 * to provide OpenSSL with appropriate thread id
180 * and mutex locking functions
182 * Note: this only implements static callbacks.
183 * OpenSSL does not use dynamic locking callbacks
184 * right now, but may in the futiure, so we will have
185 * to add them at some point.
188 static pthread_mutex_t *ssl_mutexes = NULL;
190 static unsigned long ssl_id_function(void)
192 return (unsigned long) pthread_self();
195 static void ssl_locking_function(int mode, int n, const char *file, int line)
197 file = file; /* -Wunused */
198 line = line; /* -Wunused */
200 if (mode & CRYPTO_LOCK) {
201 pthread_mutex_lock(&(ssl_mutexes[n]));
203 pthread_mutex_unlock(&(ssl_mutexes[n]));
207 static int setup_ssl_mutexes(void)
211 ssl_mutexes = rad_malloc(CRYPTO_num_locks() * sizeof(pthread_mutex_t));
213 radlog(L_ERR, "Error allocating memory for SSL mutexes!");
217 for (i = 0; i < CRYPTO_num_locks(); i++) {
218 pthread_mutex_init(&(ssl_mutexes[i]), NULL);
221 CRYPTO_set_id_callback(ssl_id_function);
222 CRYPTO_set_locking_callback(ssl_locking_function);
230 * We don't want to catch SIGCHLD for a host of reasons.
232 * - exec_wait means that someone, somewhere, somewhen, will
233 * call waitpid(), and catch the child.
235 * - SIGCHLD is delivered to a random thread, not the one that
238 * - if another thread catches the child, we have to coordinate
239 * with the thread doing the waiting.
241 * - if we don't waitpid() for non-wait children, they'll be zombies,
242 * and will hang around forever.
245 static void reap_children(void)
249 thread_fork_t mytf, *tf;
252 pthread_mutex_lock(&thread_pool.wait_mutex);
255 pid = waitpid(0, &status, WNOHANG);
259 tf = lrad_hash_table_finddata(thread_pool.waiters, &mytf);
264 } while (lrad_hash_table_num_elements(thread_pool.waiters) > 0);
266 pthread_mutex_unlock(&thread_pool.wait_mutex);
270 * Add a request to the list of waiting requests.
271 * This function gets called ONLY from the main handler thread...
273 * This function should never fail.
275 static int request_enqueue(REQUEST *request, RAD_REQUEST_FUNP fun)
277 request_queue_t *entry;
279 pthread_mutex_lock(&thread_pool.queue_mutex);
281 thread_pool.request_count++;
283 if (thread_pool.num_queued >= thread_pool.max_queue_size) {
284 pthread_mutex_unlock(&thread_pool.queue_mutex);
287 * Mark the request as done.
289 radlog(L_ERR, "!!! ERROR !!! The server is blocked: discarding new request %d", request->number);
290 request->child_state = REQUEST_DONE;
294 entry = rad_malloc(sizeof(*entry));
295 entry->request = request;
299 * Push the request onto the appropriate fifo for that
301 if (!lrad_fifo_push(thread_pool.fifo[request->priority],
303 pthread_mutex_unlock(&thread_pool.queue_mutex);
304 radlog(L_ERR, "!!! ERROR !!! Failed inserting request %d into the queue", request->number);
305 request->child_state = REQUEST_DONE;
310 * We've added an entry that didn't come from the detail
311 * file. Note that the child thread should signal the
312 * main worker thread again when the queue becomes empty.
314 if (request->listener->type != RAD_LISTEN_DETAIL) {
315 thread_pool.can_read_detail = FALSE;
318 thread_pool.num_queued++;
320 pthread_mutex_unlock(&thread_pool.queue_mutex);
323 * There's one more request in the queue.
325 * Note that we're not touching the queue any more, so
326 * the semaphore post is outside of the mutex. This also
327 * means that when the thread wakes up and tries to lock
328 * the mutex, it will be unlocked, and there won't be
331 sem_post(&thread_pool.semaphore);
337 * Remove a request from the queue.
339 static int request_dequeue(REQUEST **request, RAD_REQUEST_FUNP *fun)
341 RAD_LISTEN_TYPE i, start;
342 request_queue_t *entry;
346 pthread_mutex_lock(&thread_pool.queue_mutex);
349 * Clear old requests from all queues.
351 * We only do one pass over the queue, in order to
352 * amortize the work across the child threads. Since we
353 * do N checks for one request de-queued, the old
354 * requests will be quickly cleared.
356 for (i = 0; i < RAD_LISTEN_MAX; i++) {
357 entry = lrad_fifo_peek(thread_pool.fifo[i]);
359 (entry->request->master_state != REQUEST_STOP_PROCESSING)) {
363 * This entry was marked to be stopped. Acknowledge it.
365 entry = lrad_fifo_pop(thread_pool.fifo[i]);
366 rad_assert(entry != NULL);
367 entry->request->child_state = REQUEST_DONE;
373 * Pop results from the top of the queue
375 for (i = start; i < RAD_LISTEN_MAX; i++) {
376 entry = lrad_fifo_pop(thread_pool.fifo[i]);
384 pthread_mutex_unlock(&thread_pool.queue_mutex);
390 rad_assert(thread_pool.num_queued > 0);
391 thread_pool.num_queued--;
392 *request = entry->request;
396 rad_assert(*request != NULL);
397 rad_assert((*request)->magic == REQUEST_MAGIC);
398 rad_assert(*fun != NULL);
401 * If the request has sat in the queue for too long,
404 * The main clean-up code can't delete the request from
405 * the queue, and therefore won't clean it up until we
406 * have acknowledged it as "done".
408 if ((*request)->master_state == REQUEST_STOP_PROCESSING) {
409 (*request)->child_state = REQUEST_DONE;
414 * The thread is currently processing a request.
416 thread_pool.active_threads++;
418 pthread_mutex_unlock(&thread_pool.queue_mutex);
425 * The main thread handler for requests.
427 * Wait on the semaphore until we have it, and process the request.
429 static void *request_handler_thread(void *arg)
431 RAD_REQUEST_FUNP fun;
432 THREAD_HANDLE *self = (THREAD_HANDLE *) arg;
435 * Loop forever, until told to exit.
441 * Wait to be signalled.
443 DEBUG2("Thread %d waiting to be assigned a request",
446 if (sem_wait(&thread_pool.semaphore) != 0) {
448 * Interrupted system call. Go back to
449 * waiting, but DON'T print out any more
452 if (errno == EINTR) {
453 DEBUG2("Re-wait %d", self->thread_num);
456 radlog(L_ERR, "Thread %d failed waiting for semaphore: %s: Exiting\n",
457 self->thread_num, strerror(errno));
461 DEBUG2("Thread %d got semaphore", self->thread_num);
464 * Try to grab a request from the queue.
466 * It may be empty, in which case we fail
469 if (!request_dequeue(&self->request, &fun)) continue;
471 self->request->child_pid = self->pthread_id;
472 self->request_count++;
474 DEBUG2("Thread %d handling request %d, (%d handled so far)",
475 self->thread_num, self->request->number,
476 self->request_count);
478 radius_handle_request(self->request, fun);
481 * Update the active threads.
483 pthread_mutex_lock(&thread_pool.queue_mutex);
484 rad_assert(thread_pool.active_threads > 0);
485 thread_pool.active_threads--;
488 * If we're not currently allowed to read the
489 * detail file, AND there are no requests queued,
490 * THEN signal the main worker thread that
491 * there's at least one waiting thread (us) who
492 * can accept a packet from the detail file.
494 can_read_detail = FALSE;
495 if (!thread_pool.can_read_detail &&
496 (thread_pool.num_queued == 0)) {
497 can_read_detail = TRUE;
500 pthread_mutex_unlock(&thread_pool.queue_mutex);
503 * Do this out of the lock to be nice to everyone.
505 if (can_read_detail) {
506 radius_signal_self(RADIUS_SIGNAL_SELF_DETAIL);
509 } while (self->status != THREAD_CANCELLED);
511 DEBUG2("Thread %d exiting...", self->thread_num);
513 #ifdef HAVE_OPENSSL_ERR_H
515 * If we linked with OpenSSL, the application
516 * must remove the thread's error queue before
517 * exiting to prevent memory leaks.
523 * Do this as the LAST thing before exiting.
525 self->request = NULL;
526 self->status = THREAD_EXITED;
532 * Take a THREAD_HANDLE, delete it from the thread pool and
533 * free its resources.
535 * This function is called ONLY from the main server thread,
536 * ONLY after the thread has exited.
538 static void delete_thread(THREAD_HANDLE *handle)
543 rad_assert(handle->request == NULL);
545 DEBUG2("Deleting thread %d", handle->thread_num);
549 rad_assert(thread_pool.total_threads > 0);
550 thread_pool.total_threads--;
553 * Remove the handle from the list.
556 rad_assert(thread_pool.head == handle);
557 thread_pool.head = next;
563 rad_assert(thread_pool.tail == handle);
564 thread_pool.tail = prev;
570 * Free the handle, now that it's no longer referencable.
577 * Spawn a new thread, and place it in the thread pool.
579 * The thread is started initially in the blocked state, waiting
582 static THREAD_HANDLE *spawn_thread(time_t now)
585 THREAD_HANDLE *handle;
589 * Ensure that we don't spawn too many threads.
591 if (thread_pool.total_threads >= thread_pool.max_threads) {
592 DEBUG2("Thread spawn failed. Maximum number of threads (%d) already running.", thread_pool.max_threads);
597 * Allocate a new thread handle.
599 handle = (THREAD_HANDLE *) rad_malloc(sizeof(THREAD_HANDLE));
600 memset(handle, 0, sizeof(THREAD_HANDLE));
603 handle->pthread_id = NO_SUCH_CHILD_PID;
604 handle->thread_num = thread_pool.max_thread_num++;
605 handle->request_count = 0;
606 handle->status = THREAD_RUNNING;
607 handle->timestamp = time(NULL);
610 * Initialize the thread's attributes to detached.
612 * We could call pthread_detach() later, but if the thread
613 * exits between the create & detach calls, it will need to
614 * be joined, which will never happen.
616 pthread_attr_init(&attr);
617 pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_DETACHED);
620 * Create the thread detached, so that it cleans up it's
621 * own memory when it exits.
623 * Note that the function returns non-zero on error, NOT
624 * -1. The return code is the error, and errno isn't set.
626 rcode = pthread_create(&handle->pthread_id, &attr,
627 request_handler_thread, handle);
629 radlog(L_ERR, "Thread create failed: %s",
633 pthread_attr_destroy(&attr);
636 * One more thread to go into the list.
638 thread_pool.total_threads++;
639 DEBUG2("Thread spawned new child %d. Total threads in pool: %d",
640 handle->thread_num, thread_pool.total_threads);
643 * Add the thread handle to the tail of the thread pool list.
645 if (thread_pool.tail) {
646 thread_pool.tail->next = handle;
647 handle->prev = thread_pool.tail;
648 thread_pool.tail = handle;
650 rad_assert(thread_pool.head == NULL);
651 thread_pool.head = thread_pool.tail = handle;
655 * Update the time we last spawned a thread.
657 thread_pool.time_last_spawned = now;
660 * And return the new handle to the caller.
666 * Temporary function to prevent server from executing a SIGHUP
667 * until all threads are finished handling requests. This returns
668 * the number of active threads to 'radiusd.c'.
670 int total_active_threads(void)
673 * We don't acquire the mutex, so this is just an estimate.
674 * We can't return with the lock held, so there's no point
675 * in getting the guaranteed correct value; by the time
676 * the caller sees it, it can be wrong again.
678 return thread_pool.active_threads;
682 static uint32_t pid_hash(const void *data)
684 const thread_fork_t *tf = data;
686 return lrad_hash(&tf->pid, sizeof(tf->pid));
689 static int pid_cmp(const void *one, const void *two)
691 const thread_fork_t *a = one;
692 const thread_fork_t *b = two;
694 return (a->pid - b->pid);
698 * Allocate the thread pool, and seed it with an initial number
701 * FIXME: What to do on a SIGHUP???
703 int thread_pool_init(CONF_SECTION *cs, int spawn_flag)
706 CONF_SECTION *pool_cf;
709 DEBUG("Initializing the thread pool...");
713 * We're not spawning new threads, don't do
716 if (!spawn_flag) return 0;
719 * After a SIGHUP, we don't over-write the previous values.
721 if (!pool_initialized) {
723 * Initialize the thread pool to some reasonable values.
725 memset(&thread_pool, 0, sizeof(THREAD_POOL));
726 thread_pool.head = NULL;
727 thread_pool.tail = NULL;
728 thread_pool.total_threads = 0;
729 thread_pool.max_thread_num = 1;
730 thread_pool.cleanup_delay = 5;
731 thread_pool.spawn_flag = spawn_flag;
733 if ((pthread_mutex_init(&thread_pool.wait_mutex,NULL) != 0)) {
734 radlog(L_ERR, "FATAL: Failed to initialize wait mutex: %s",
740 * Create the hash table of child PID's
742 thread_pool.waiters = lrad_hash_table_create(pid_hash,
745 if (!thread_pool.waiters) {
746 radlog(L_ERR, "FATAL: Failed to set up wait hash");
751 pool_cf = cf_subsection_find_next(cs, NULL, "thread");
753 radlog(L_ERR, "FATAL: Attempting to start in multi-threaded mode with no thread configuration in radiusd.conf");
757 if (cf_section_parse(pool_cf, NULL, thread_config) < 0) {
762 * Catch corner cases.
764 if (thread_pool.min_spare_threads < 1)
765 thread_pool.min_spare_threads = 1;
766 if (thread_pool.max_spare_threads < 1)
767 thread_pool.max_spare_threads = 1;
768 if (thread_pool.max_spare_threads < thread_pool.min_spare_threads)
769 thread_pool.max_spare_threads = thread_pool.min_spare_threads;
772 * The pool has already been initialized. Don't spawn
773 * new threads, and don't forget about forked children,
775 if (pool_initialized) {
780 * Initialize the queue of requests.
782 memset(&thread_pool.semaphore, 0, sizeof(thread_pool.semaphore));
783 rcode = sem_init(&thread_pool.semaphore, 0, SEMAPHORE_LOCKED);
785 radlog(L_ERR, "FATAL: Failed to initialize semaphore: %s",
790 rcode = pthread_mutex_init(&thread_pool.queue_mutex,NULL);
792 radlog(L_ERR, "FATAL: Failed to initialize queue mutex: %s",
798 * Allocate multiple fifos.
800 for (i = 0; i < RAD_LISTEN_MAX; i++) {
801 thread_pool.fifo[i] = lrad_fifo_create(65536, NULL);
802 if (!thread_pool.fifo[i]) {
803 radlog(L_ERR, "FATAL: Failed to set up request fifo");
808 #ifdef HAVE_OPENSSL_CRYPTO_H
810 * If we're linking with OpenSSL too, then we need
811 * to set up the mutexes and enable the thread callbacks.
813 if (!setup_ssl_mutexes()) {
814 radlog(L_ERR, "FATAL: Failed to set up SSL mutexes");
821 * Create a number of waiting threads.
823 * If we fail while creating them, do something intelligent.
825 for (i = 0; i < thread_pool.start_threads; i++) {
826 if (spawn_thread(now) == NULL) {
831 DEBUG2("Thread pool initialized");
832 pool_initialized = TRUE;
838 * Assign a new request to a free thread.
840 * If there isn't a free thread, then try to create a new one,
841 * up to the configured limits.
843 int thread_pool_addrequest(REQUEST *request, RAD_REQUEST_FUNP fun)
845 time_t now = request->timestamp;
848 * We've been told not to spawn threads, so don't.
850 if (!thread_pool.spawn_flag) {
851 radius_handle_request(request, fun);
854 * Requests that care about child process exit
855 * codes have already either called
856 * rad_waitpid(), or they've given up.
863 * Add the new request to the queue.
865 if (!request_enqueue(request, fun)) return 0;
868 * If we haven't checked the number of child threads
869 * in a while, OR if the thread pool appears to be full,
872 if ((last_cleaned < now) ||
873 (thread_pool.active_threads == thread_pool.total_threads)) {
874 thread_pool_manage(now);
881 * Check the min_spare_threads and max_spare_threads.
883 * If there are too many or too few threads waiting, then we
884 * either create some more, or delete some.
886 static void thread_pool_manage(time_t now)
890 THREAD_HANDLE *handle, *next;
894 * We don't need a mutex lock here, as we're reading
895 * active_threads, and not modifying it. We want a close
896 * approximation of the number of active threads, and this
899 active_threads = thread_pool.active_threads;
900 spare = thread_pool.total_threads - active_threads;
902 static int old_total = -1;
903 static int old_active = -1;
905 if ((old_total != thread_pool.total_threads) ||
906 (old_active != active_threads)) {
907 DEBUG2("Threads: total/active/spare threads = %d/%d/%d",
908 thread_pool.total_threads, active_threads, spare);
909 old_total = thread_pool.total_threads;
910 old_active = active_threads;
915 * If there are too few spare threads. Go create some more.
917 if (spare < thread_pool.min_spare_threads) {
918 total = thread_pool.min_spare_threads - spare;
920 DEBUG2("Threads: Spawning %d spares", total);
922 * Create a number of spare threads.
924 for (i = 0; i < total; i++) {
925 handle = spawn_thread(now);
926 if (handle == NULL) {
931 return; /* there aren't too many spare threads */
935 * Only delete spare threads if we haven't already done
938 if (now == last_cleaned) {
944 * Loop over the thread pool, deleting exited threads.
946 for (handle = thread_pool.head; handle; handle = next) {
950 * Maybe we've asked the thread to exit, and it
953 if (handle->status == THREAD_EXITED) {
954 delete_thread(handle);
959 * Only delete the spare threads if sufficient time has
960 * passed since we last created one. This helps to minimize
961 * the amount of create/delete cycles.
963 if ((now - thread_pool.time_last_spawned) < thread_pool.cleanup_delay) {
968 * If there are too many spare threads, delete one.
970 * Note that we only delete ONE at a time, instead of
971 * wiping out many. This allows the excess servers to
972 * be slowly reaped, just in case the load spike comes again.
974 if (spare > thread_pool.max_spare_threads) {
976 spare -= thread_pool.max_spare_threads;
978 DEBUG2("Threads: deleting 1 spare out of %d spares", spare);
981 * Walk through the thread pool, deleting the
982 * first idle thread we come across.
984 for (handle = thread_pool.head; (handle != NULL) && (spare > 0) ; handle = next) {
988 * If the thread is not handling a
989 * request, but still live, then tell it
992 * It will eventually wake up, and realize
993 * it's been told to commit suicide.
995 if ((handle->request == NULL) &&
996 (handle->status == THREAD_RUNNING)) {
997 handle->status = THREAD_CANCELLED;
999 * Post an extra semaphore, as a
1000 * signal to wake up, and exit.
1002 sem_post(&thread_pool.semaphore);
1010 * If the thread has handled too many requests, then make it
1013 if (thread_pool.max_requests_per_thread > 0) {
1014 for (handle = thread_pool.head; handle; handle = next) {
1015 next = handle->next;
1018 * Not handling a request, but otherwise
1019 * live, we can kill it.
1021 if ((handle->request == NULL) &&
1022 (handle->status == THREAD_RUNNING) &&
1023 (handle->request_count > thread_pool.max_requests_per_thread)) {
1024 handle->status = THREAD_CANCELLED;
1025 sem_post(&thread_pool.semaphore);
1031 * Otherwise everything's kosher. There are not too few,
1032 * or too many spare threads. Exit happily.
1039 * Thread wrapper for fork().
1041 pid_t rad_fork(void)
1045 if (!pool_initialized) return fork();
1047 reap_children(); /* be nice to non-wait thingies */
1049 if (lrad_hash_table_num_elements(thread_pool.waiters) >= 1024) {
1054 * Fork & save the PID for later reaping.
1057 if (child_pid > 0) {
1061 tf = rad_malloc(sizeof(*tf));
1062 memset(tf, 0, sizeof(*tf));
1064 tf->pid = child_pid;
1066 pthread_mutex_lock(&thread_pool.wait_mutex);
1067 rcode = lrad_hash_table_insert(thread_pool.waiters, tf);
1068 pthread_mutex_unlock(&thread_pool.wait_mutex);
1071 radlog(L_ERR, "Failed to store PID, creating what will be a zombie process %d",
1077 * Return whatever we were told.
1084 * Wait 10 seconds at most for a child to exit, then give up.
1086 pid_t rad_waitpid(pid_t pid, int *status)
1089 thread_fork_t mytf, *tf;
1091 if (!pool_initialized) return waitpid(pid, status, 0);
1093 if (pid <= 0) return -1;
1097 pthread_mutex_lock(&thread_pool.wait_mutex);
1098 tf = lrad_hash_table_finddata(thread_pool.waiters, &mytf);
1099 pthread_mutex_unlock(&thread_pool.wait_mutex);
1103 for (i = 0; i < 100; i++) {
1107 *status = tf->status;
1109 pthread_mutex_lock(&thread_pool.wait_mutex);
1110 lrad_hash_table_delete(thread_pool.waiters, &mytf);
1111 pthread_mutex_unlock(&thread_pool.wait_mutex);
1114 usleep(100000); /* sleep for 1/10 of a second */
1118 * 10 seconds have passed, give up on the child.
1120 pthread_mutex_lock(&thread_pool.wait_mutex);
1121 lrad_hash_table_delete(thread_pool.waiters, &mytf);
1122 pthread_mutex_unlock(&thread_pool.wait_mutex);
1127 #else /* HAVE_PTHREAD_H */
1129 * "thread" code when we don't have threads.
1131 int thread_pool_init(int spawn_flag)
1137 * call "radrespond".
1139 int thread_pool_addrequest(REQUEST *request, RAD_REQUEST_FUNP fun)
1141 radius_handle_request(request, fun);
1145 #endif /* HAVE_PTHREAD_H */