manager.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928
  1. /* Linuxthreads - a simple clone()-based implementation of Posix */
  2. /* threads for Linux. */
  3. /* Copyright (C) 1996 Xavier Leroy (Xavier.Leroy@inria.fr) */
  4. /* */
  5. /* This program is free software; you can redistribute it and/or */
  6. /* modify it under the terms of the GNU Library General Public License */
  7. /* as published by the Free Software Foundation; either version 2 */
  8. /* of the License, or (at your option) any later version. */
  9. /* */
  10. /* This program is distributed in the hope that it will be useful, */
  11. /* but WITHOUT ANY WARRANTY; without even the implied warranty of */
  12. /* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
  13. /* GNU Library General Public License for more details. */
  14. /* The "thread manager" thread: manages creation and termination of threads */
  15. #include <features.h>
  16. #include <errno.h>
  17. #include <sched.h>
  18. #include <stddef.h>
  19. #include <stdio.h>
  20. #include <stdlib.h>
  21. #include <string.h>
  22. #include <unistd.h>
  23. #include <sys/poll.h> /* for poll */
  24. #include <sys/mman.h> /* for mmap */
  25. #include <sys/param.h>
  26. #include <sys/time.h>
  27. #include <sys/wait.h> /* for waitpid macros */
  28. #include "pthread.h"
  29. #include "internals.h"
  30. #include "spinlock.h"
  31. #include "restart.h"
  32. #include "semaphore.h"
  33. #include "debug.h" /* PDEBUG, added by StS */
  34. /* poll() is not supported in kernel <= 2.0, therefore is __NR_poll is
  35. * not available, we assume an old Linux kernel is in use and we will
  36. * use select() instead. */
  37. #include <sys/syscall.h>
  38. #ifndef __NR_poll
  39. # define USE_SELECT
  40. #endif
  41. libpthread_hidden_proto(waitpid)
  42. libpthread_hidden_proto(raise)
  43. /* Array of active threads. Entry 0 is reserved for the initial thread. */
  44. struct pthread_handle_struct __pthread_handles[PTHREAD_THREADS_MAX] =
  45. { { __LOCK_INITIALIZER, &__pthread_initial_thread, 0},
  46. { __LOCK_INITIALIZER, &__pthread_manager_thread, 0}, /* All NULLs */ };
  47. /* For debugging purposes put the maximum number of threads in a variable. */
  48. const int __linuxthreads_pthread_threads_max = PTHREAD_THREADS_MAX;
  49. /* Indicate whether at least one thread has a user-defined stack (if 1),
  50. or if all threads have stacks supplied by LinuxThreads (if 0). */
  51. int __pthread_nonstandard_stacks;
  52. /* Number of active entries in __pthread_handles (used by gdb) */
  53. volatile int __pthread_handles_num = 2;
  54. /* Whether to use debugger additional actions for thread creation
  55. (set to 1 by gdb) */
  56. volatile int __pthread_threads_debug;
  57. /* Globally enabled events. */
  58. volatile td_thr_events_t __pthread_threads_events;
  59. /* Pointer to thread descriptor with last event. */
  60. volatile pthread_descr __pthread_last_event;
  61. /* Mapping from stack segment to thread descriptor. */
  62. /* Stack segment numbers are also indices into the __pthread_handles array. */
  63. /* Stack segment number 0 is reserved for the initial thread. */
  64. static __inline__ pthread_descr thread_segment(int seg)
  65. {
  66. return (pthread_descr)(THREAD_STACK_START_ADDRESS - (seg - 1) * STACK_SIZE)
  67. - 1;
  68. }
  69. /* Flag set in signal handler to record child termination */
  70. static volatile int terminated_children = 0;
  71. /* Flag set when the initial thread is blocked on pthread_exit waiting
  72. for all other threads to terminate */
  73. static int main_thread_exiting = 0;
  74. /* Counter used to generate unique thread identifier.
  75. Thread identifier is pthread_threads_counter + segment. */
  76. static pthread_t pthread_threads_counter = 0;
  77. /* Forward declarations */
  78. static int pthread_handle_create(pthread_t *thread, const pthread_attr_t *attr,
  79. void * (*start_routine)(void *), void *arg,
  80. sigset_t *mask, int father_pid,
  81. int report_events,
  82. td_thr_events_t *event_maskp);
  83. static void pthread_handle_free(pthread_t th_id);
  84. static void pthread_handle_exit(pthread_descr issuing_thread, int exitcode) attribute_noreturn;
  85. static void pthread_reap_children(void);
  86. static void pthread_kill_all_threads(int sig, int main_thread_also);
  87. /* The server thread managing requests for thread creation and termination */
  88. int attribute_noreturn __pthread_manager(void *arg)
  89. {
  90. int reqfd = (int) (long int) arg;
  91. #ifdef USE_SELECT
  92. struct timeval tv;
  93. fd_set fd;
  94. #else
  95. struct pollfd ufd;
  96. #endif
  97. sigset_t manager_mask;
  98. int n;
  99. struct pthread_request request;
  100. /* If we have special thread_self processing, initialize it. */
  101. #ifdef INIT_THREAD_SELF
  102. INIT_THREAD_SELF(&__pthread_manager_thread, 1);
  103. #endif
  104. /* Set the error variable. */
  105. __pthread_manager_thread.p_errnop = &__pthread_manager_thread.p_errno;
  106. __pthread_manager_thread.p_h_errnop = &__pthread_manager_thread.p_h_errno;
  107. #ifdef __UCLIBC_HAS_XLOCALE__
  108. /* Initialize thread's locale to the global locale. */
  109. __pthread_manager_thread.locale = __global_locale;
  110. #endif /* __UCLIBC_HAS_XLOCALE__ */
  111. /* Block all signals except __pthread_sig_cancel and SIGTRAP */
  112. sigfillset(&manager_mask);
  113. sigdelset(&manager_mask, __pthread_sig_cancel); /* for thread termination */
  114. sigdelset(&manager_mask, SIGTRAP); /* for debugging purposes */
  115. if (__pthread_threads_debug && __pthread_sig_debug > 0)
  116. sigdelset(&manager_mask, __pthread_sig_debug);
  117. sigprocmask(SIG_SETMASK, &manager_mask, NULL);
  118. /* Raise our priority to match that of main thread */
  119. __pthread_manager_adjust_prio(__pthread_main_thread->p_priority);
  120. /* Synchronize debugging of the thread manager */
  121. n = TEMP_FAILURE_RETRY(__libc_read(reqfd, (char *)&request,
  122. sizeof(request)));
  123. #ifndef USE_SELECT
  124. ufd.fd = reqfd;
  125. ufd.events = POLLIN;
  126. #endif
  127. /* Enter server loop */
  128. while(1) {
  129. #ifdef USE_SELECT
  130. tv.tv_sec = 2;
  131. tv.tv_usec = 0;
  132. FD_ZERO (&fd);
  133. FD_SET (reqfd, &fd);
  134. n = select (reqfd + 1, &fd, NULL, NULL, &tv);
  135. #else
  136. PDEBUG("before poll\n");
  137. n = poll(&ufd, 1, 2000);
  138. PDEBUG("after poll\n");
  139. #endif
  140. /* Check for termination of the main thread */
  141. if (getppid() == 1) {
  142. pthread_kill_all_threads(SIGKILL, 0);
  143. _exit(0);
  144. }
  145. /* Check for dead children */
  146. if (terminated_children) {
  147. terminated_children = 0;
  148. pthread_reap_children();
  149. }
  150. /* Read and execute request */
  151. #ifdef USE_SELECT
  152. if (n == 1)
  153. #else
  154. if (n == 1 && (ufd.revents & POLLIN))
  155. #endif
  156. {
  157. PDEBUG("before __libc_read\n");
  158. n = __libc_read(reqfd, (char *)&request, sizeof(request));
  159. PDEBUG("after __libc_read, n=%d\n", n);
  160. switch(request.req_kind) {
  161. case REQ_CREATE:
  162. PDEBUG("got REQ_CREATE\n");
  163. request.req_thread->p_retcode =
  164. pthread_handle_create((pthread_t *) &request.req_thread->p_retval,
  165. request.req_args.create.attr,
  166. request.req_args.create.fn,
  167. request.req_args.create.arg,
  168. &request.req_args.create.mask,
  169. request.req_thread->p_pid,
  170. request.req_thread->p_report_events,
  171. &request.req_thread->p_eventbuf.eventmask);
  172. PDEBUG("restarting %d\n", request.req_thread);
  173. restart(request.req_thread);
  174. break;
  175. case REQ_FREE:
  176. PDEBUG("got REQ_FREE\n");
  177. pthread_handle_free(request.req_args.free.thread_id);
  178. break;
  179. case REQ_PROCESS_EXIT:
  180. PDEBUG("got REQ_PROCESS_EXIT from %d, exit code = %d\n",
  181. request.req_thread, request.req_args.exit.code);
  182. pthread_handle_exit(request.req_thread,
  183. request.req_args.exit.code);
  184. break;
  185. case REQ_MAIN_THREAD_EXIT:
  186. PDEBUG("got REQ_MAIN_THREAD_EXIT\n");
  187. main_thread_exiting = 1;
  188. /* Reap children in case all other threads died and the signal handler
  189. went off before we set main_thread_exiting to 1, and therefore did
  190. not do REQ_KICK. */
  191. pthread_reap_children();
  192. if (__pthread_main_thread->p_nextlive == __pthread_main_thread) {
  193. restart(__pthread_main_thread);
  194. /* The main thread will now call exit() which will trigger an
  195. __on_exit handler, which in turn will send REQ_PROCESS_EXIT
  196. to the thread manager. In case you are wondering how the
  197. manager terminates from its loop here. */
  198. }
  199. break;
  200. case REQ_POST:
  201. PDEBUG("got REQ_POST\n");
  202. __new_sem_post(request.req_args.post);
  203. break;
  204. case REQ_DEBUG:
  205. PDEBUG("got REQ_DEBUG\n");
  206. /* Make gdb aware of new thread and gdb will restart the
  207. new thread when it is ready to handle the new thread. */
  208. if (__pthread_threads_debug && __pthread_sig_debug > 0) {
  209. PDEBUG("about to call raise(__pthread_sig_debug)\n");
  210. raise(__pthread_sig_debug);
  211. }
  212. case REQ_KICK:
  213. /* This is just a prod to get the manager to reap some
  214. threads right away, avoiding a potential delay at shutdown. */
  215. break;
  216. }
  217. }
  218. }
  219. }
  220. int __pthread_manager_event(void *arg)
  221. {
  222. /* If we have special thread_self processing, initialize it. */
  223. #ifdef INIT_THREAD_SELF
  224. INIT_THREAD_SELF(&__pthread_manager_thread, 1);
  225. #endif
  226. /* Get the lock the manager will free once all is correctly set up. */
  227. __pthread_lock (THREAD_GETMEM((&__pthread_manager_thread), p_lock), NULL);
  228. /* Free it immediately. */
  229. __pthread_unlock (THREAD_GETMEM((&__pthread_manager_thread), p_lock));
  230. return __pthread_manager(arg);
  231. }
  232. /* Process creation */
  233. static int
  234. attribute_noreturn
  235. pthread_start_thread(void *arg)
  236. {
  237. pthread_descr self = (pthread_descr) arg;
  238. struct pthread_request request;
  239. void * outcome;
  240. /* Initialize special thread_self processing, if any. */
  241. #ifdef INIT_THREAD_SELF
  242. INIT_THREAD_SELF(self, self->p_nr);
  243. #endif
  244. PDEBUG("\n");
  245. /* Make sure our pid field is initialized, just in case we get there
  246. before our father has initialized it. */
  247. THREAD_SETMEM(self, p_pid, getpid());
  248. /* Initial signal mask is that of the creating thread. (Otherwise,
  249. we'd just inherit the mask of the thread manager.) */
  250. sigprocmask(SIG_SETMASK, &self->p_start_args.mask, NULL);
  251. /* Set the scheduling policy and priority for the new thread, if needed */
  252. if (THREAD_GETMEM(self, p_start_args.schedpolicy) >= 0)
  253. /* Explicit scheduling attributes were provided: apply them */
  254. sched_setscheduler(THREAD_GETMEM(self, p_pid),
  255. THREAD_GETMEM(self, p_start_args.schedpolicy),
  256. &self->p_start_args.schedparam);
  257. else if (__pthread_manager_thread.p_priority > 0)
  258. /* Default scheduling required, but thread manager runs in realtime
  259. scheduling: switch new thread to SCHED_OTHER policy */
  260. {
  261. struct sched_param default_params;
  262. default_params.sched_priority = 0;
  263. sched_setscheduler(THREAD_GETMEM(self, p_pid),
  264. SCHED_OTHER, &default_params);
  265. }
  266. /* Make gdb aware of new thread */
  267. if (__pthread_threads_debug && __pthread_sig_debug > 0) {
  268. request.req_thread = self;
  269. request.req_kind = REQ_DEBUG;
  270. TEMP_FAILURE_RETRY(__libc_write(__pthread_manager_request,
  271. (char *) &request, sizeof(request)));
  272. suspend(self);
  273. }
  274. /* Run the thread code */
  275. outcome = self->p_start_args.start_routine(THREAD_GETMEM(self,
  276. p_start_args.arg));
  277. /* Exit with the given return value */
  278. __pthread_do_exit(outcome, CURRENT_STACK_FRAME);
  279. }
  280. static int
  281. attribute_noreturn
  282. pthread_start_thread_event(void *arg)
  283. {
  284. pthread_descr self = (pthread_descr) arg;
  285. #ifdef INIT_THREAD_SELF
  286. INIT_THREAD_SELF(self, self->p_nr);
  287. #endif
  288. /* Make sure our pid field is initialized, just in case we get there
  289. before our father has initialized it. */
  290. THREAD_SETMEM(self, p_pid, getpid());
  291. /* Get the lock the manager will free once all is correctly set up. */
  292. __pthread_lock (THREAD_GETMEM(self, p_lock), NULL);
  293. /* Free it immediately. */
  294. __pthread_unlock (THREAD_GETMEM(self, p_lock));
  295. /* Continue with the real function. */
  296. pthread_start_thread (arg);
  297. }
  298. static int pthread_allocate_stack(const pthread_attr_t *attr,
  299. pthread_descr default_new_thread,
  300. int pagesize,
  301. pthread_descr * out_new_thread,
  302. char ** out_new_thread_bottom,
  303. char ** out_guardaddr,
  304. size_t * out_guardsize)
  305. {
  306. pthread_descr new_thread;
  307. char * new_thread_bottom;
  308. char * guardaddr;
  309. size_t stacksize, guardsize;
  310. if (attr != NULL && attr->__stackaddr_set)
  311. {
  312. /* The user provided a stack. */
  313. new_thread =
  314. (pthread_descr) ((long)(attr->__stackaddr) & -sizeof(void *)) - 1;
  315. new_thread_bottom = (char *) attr->__stackaddr - attr->__stacksize;
  316. guardaddr = NULL;
  317. guardsize = 0;
  318. __pthread_nonstandard_stacks = 1;
  319. #ifndef __ARCH_USE_MMU__
  320. /* check the initial thread stack boundaries so they don't overlap */
  321. NOMMU_INITIAL_THREAD_BOUNDS((char *) new_thread, (char *) new_thread_bottom);
  322. PDEBUG("initial stack: bos=%p, tos=%p\n", __pthread_initial_thread_bos,
  323. __pthread_initial_thread_tos);
  324. #endif
  325. }
  326. else
  327. {
  328. #ifdef __ARCH_USE_MMU__
  329. stacksize = STACK_SIZE - pagesize;
  330. if (attr != NULL)
  331. stacksize = MIN (stacksize, roundup(attr->__stacksize, pagesize));
  332. /* Allocate space for stack and thread descriptor at default address */
  333. new_thread = default_new_thread;
  334. new_thread_bottom = (char *) (new_thread + 1) - stacksize;
  335. if (mmap((caddr_t)((char *)(new_thread + 1) - INITIAL_STACK_SIZE),
  336. INITIAL_STACK_SIZE, PROT_READ | PROT_WRITE | PROT_EXEC,
  337. MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED | MAP_GROWSDOWN,
  338. -1, 0) == MAP_FAILED)
  339. /* Bad luck, this segment is already mapped. */
  340. return -1;
  341. /* We manage to get a stack. Now see whether we need a guard
  342. and allocate it if necessary. Notice that the default
  343. attributes (stack_size = STACK_SIZE - pagesize) do not need
  344. a guard page, since the RLIMIT_STACK soft limit prevents stacks
  345. from running into one another. */
  346. if (stacksize == (size_t) (STACK_SIZE - pagesize))
  347. {
  348. /* We don't need a guard page. */
  349. guardaddr = NULL;
  350. guardsize = 0;
  351. }
  352. else
  353. {
  354. /* Put a bad page at the bottom of the stack */
  355. guardsize = attr->__guardsize;
  356. guardaddr = (void *)new_thread_bottom - guardsize;
  357. if (mmap ((caddr_t) guardaddr, guardsize, 0, MAP_FIXED, -1, 0)
  358. == MAP_FAILED)
  359. {
  360. /* We don't make this an error. */
  361. guardaddr = NULL;
  362. guardsize = 0;
  363. }
  364. }
  365. #else
  366. /* We cannot mmap to this huge chunk of stack space when we don't have
  367. * an MMU. Pretend we are using a user provided stack even if there was
  368. * none provided by the user. Thus, we get around the mmap and reservation
  369. * of a huge stack segment. -StS */
  370. stacksize = INITIAL_STACK_SIZE;
  371. /* The user may want to use a non-default stacksize */
  372. if (attr != NULL)
  373. {
  374. stacksize = attr->__stacksize;
  375. }
  376. /* malloc a stack - memory from the bottom up */
  377. if ((new_thread_bottom = malloc(stacksize)) == NULL)
  378. {
  379. /* bad luck, we cannot malloc any more */
  380. return -1 ;
  381. }
  382. PDEBUG("malloced chunk: base=%p, size=0x%04x\n", new_thread_bottom, stacksize);
  383. /* Set up the pointers. new_thread marks the TOP of the stack frame and
  384. * the address of the pthread_descr struct at the same time. Therefore we
  385. * must account for its size and fit it in the malloc()'ed block. The
  386. * value of `new_thread' is then passed to clone() as the stack argument.
  387. *
  388. * ^ +------------------------+
  389. * | | pthread_descr struct |
  390. * | +------------------------+ <- new_thread
  391. * malloc block | | |
  392. * | | thread stack |
  393. * | | |
  394. * v +------------------------+ <- new_thread_bottom
  395. *
  396. * Note: The calculated value of new_thread must be word aligned otherwise
  397. * the kernel chokes on a non-aligned stack frame. Choose the lower
  398. * available word boundary.
  399. */
  400. new_thread = ((pthread_descr) ((int)(new_thread_bottom + stacksize) & -sizeof(void*))) - 1;
  401. guardaddr = NULL;
  402. guardsize = 0;
  403. PDEBUG("thread stack: bos=%p, tos=%p\n", new_thread_bottom, new_thread);
  404. /* check the initial thread stack boundaries so they don't overlap */
  405. NOMMU_INITIAL_THREAD_BOUNDS((char *) new_thread, (char *) new_thread_bottom);
  406. PDEBUG("initial stack: bos=%p, tos=%p\n", __pthread_initial_thread_bos,
  407. __pthread_initial_thread_tos);
  408. /* on non-MMU systems we always have non-standard stack frames */
  409. __pthread_nonstandard_stacks = 1;
  410. #endif /* __ARCH_USE_MMU__ */
  411. }
  412. /* Clear the thread data structure. */
  413. memset (new_thread, '\0', sizeof (*new_thread));
  414. *out_new_thread = new_thread;
  415. *out_new_thread_bottom = new_thread_bottom;
  416. *out_guardaddr = guardaddr;
  417. *out_guardsize = guardsize;
  418. return 0;
  419. }
  420. static int pthread_handle_create(pthread_t *thread, const pthread_attr_t *attr,
  421. void * (*start_routine)(void *), void *arg,
  422. sigset_t * mask, int father_pid,
  423. int report_events,
  424. td_thr_events_t *event_maskp)
  425. {
  426. size_t sseg;
  427. int pid;
  428. pthread_descr new_thread;
  429. char * new_thread_bottom;
  430. pthread_t new_thread_id;
  431. char *guardaddr = NULL;
  432. size_t guardsize = 0;
  433. int pagesize = getpagesize();
  434. int saved_errno = 0;
  435. /* First check whether we have to change the policy and if yes, whether
  436. we can do this. Normally this should be done by examining the
  437. return value of the sched_setscheduler call in pthread_start_thread
  438. but this is hard to implement. FIXME */
  439. if (attr != NULL && attr->__schedpolicy != SCHED_OTHER && geteuid () != 0)
  440. return EPERM;
  441. /* Find a free segment for the thread, and allocate a stack if needed */
  442. for (sseg = 2; ; sseg++)
  443. {
  444. if (sseg >= PTHREAD_THREADS_MAX)
  445. return EAGAIN;
  446. if (__pthread_handles[sseg].h_descr != NULL)
  447. continue;
  448. if (pthread_allocate_stack(attr, thread_segment(sseg), pagesize,
  449. &new_thread, &new_thread_bottom,
  450. &guardaddr, &guardsize) == 0)
  451. break;
  452. #ifndef __ARCH_USE_MMU__
  453. else
  454. /* When there is MMU, mmap () is used to allocate the stack. If one
  455. * segment is already mapped, we should continue to see if we can
  456. * use the next one. However, when there is no MMU, malloc () is used.
  457. * It's waste of CPU cycles to continue to try if it fails. */
  458. return EAGAIN;
  459. #endif
  460. }
  461. __pthread_handles_num++;
  462. /* Allocate new thread identifier */
  463. pthread_threads_counter += PTHREAD_THREADS_MAX;
  464. new_thread_id = sseg + pthread_threads_counter;
  465. /* Initialize the thread descriptor. Elements which have to be
  466. initialized to zero already have this value. */
  467. new_thread->p_tid = new_thread_id;
  468. new_thread->p_lock = &(__pthread_handles[sseg].h_lock);
  469. new_thread->p_cancelstate = PTHREAD_CANCEL_ENABLE;
  470. new_thread->p_canceltype = PTHREAD_CANCEL_DEFERRED;
  471. new_thread->p_errnop = &new_thread->p_errno;
  472. new_thread->p_h_errnop = &new_thread->p_h_errno;
  473. #ifdef __UCLIBC_HAS_XLOCALE__
  474. /* Initialize thread's locale to the global locale. */
  475. new_thread->locale = __global_locale;
  476. #endif /* __UCLIBC_HAS_XLOCALE__ */
  477. new_thread->p_guardaddr = guardaddr;
  478. new_thread->p_guardsize = guardsize;
  479. new_thread->p_self = new_thread;
  480. new_thread->p_nr = sseg;
  481. /* Initialize the thread handle */
  482. __pthread_init_lock(&__pthread_handles[sseg].h_lock);
  483. __pthread_handles[sseg].h_descr = new_thread;
  484. __pthread_handles[sseg].h_bottom = new_thread_bottom;
  485. /* Determine scheduling parameters for the thread */
  486. new_thread->p_start_args.schedpolicy = -1;
  487. if (attr != NULL) {
  488. new_thread->p_detached = attr->__detachstate;
  489. new_thread->p_userstack = attr->__stackaddr_set;
  490. switch(attr->__inheritsched) {
  491. case PTHREAD_EXPLICIT_SCHED:
  492. new_thread->p_start_args.schedpolicy = attr->__schedpolicy;
  493. memcpy (&new_thread->p_start_args.schedparam, &attr->__schedparam,
  494. sizeof (struct sched_param));
  495. break;
  496. case PTHREAD_INHERIT_SCHED:
  497. new_thread->p_start_args.schedpolicy = sched_getscheduler(father_pid);
  498. sched_getparam(father_pid, &new_thread->p_start_args.schedparam);
  499. break;
  500. }
  501. new_thread->p_priority =
  502. new_thread->p_start_args.schedparam.sched_priority;
  503. }
  504. /* Finish setting up arguments to pthread_start_thread */
  505. new_thread->p_start_args.start_routine = start_routine;
  506. new_thread->p_start_args.arg = arg;
  507. new_thread->p_start_args.mask = *mask;
  508. /* Raise priority of thread manager if needed */
  509. __pthread_manager_adjust_prio(new_thread->p_priority);
  510. /* Do the cloning. We have to use two different functions depending
  511. on whether we are debugging or not. */
  512. pid = 0; /* Note that the thread never can have PID zero. */
  513. /* ******************************************************** */
  514. /* This code was moved from below to cope with running threads
  515. * on uClinux systems. See comment below...
  516. * Insert new thread in doubly linked list of active threads */
  517. new_thread->p_prevlive = __pthread_main_thread;
  518. new_thread->p_nextlive = __pthread_main_thread->p_nextlive;
  519. __pthread_main_thread->p_nextlive->p_prevlive = new_thread;
  520. __pthread_main_thread->p_nextlive = new_thread;
  521. /* ********************************************************* */
  522. if (report_events)
  523. {
  524. /* See whether the TD_CREATE event bit is set in any of the
  525. masks. */
  526. int idx = __td_eventword (TD_CREATE);
  527. uint32_t mask = __td_eventmask (TD_CREATE);
  528. if ((mask & (__pthread_threads_events.event_bits[idx]
  529. | event_maskp->event_bits[idx])) != 0)
  530. {
  531. /* Lock the mutex the child will use now so that it will stop. */
  532. __pthread_lock(new_thread->p_lock, NULL);
  533. /* We have to report this event. */
  534. #ifdef __ia64__
  535. pid = __clone2(pthread_start_thread_event, (void **) new_thread,
  536. (char *)new_thread - new_thread_bottom,
  537. CLONE_VM | CLONE_FS | CLONE_FILES | CLONE_SIGHAND |
  538. __pthread_sig_cancel, new_thread);
  539. #else
  540. pid = clone(pthread_start_thread_event, (void **) new_thread,
  541. CLONE_VM | CLONE_FS | CLONE_FILES | CLONE_SIGHAND |
  542. __pthread_sig_cancel, new_thread);
  543. #endif
  544. saved_errno = errno;
  545. if (pid != -1)
  546. {
  547. /* Now fill in the information about the new thread in
  548. the newly created thread's data structure. We cannot let
  549. the new thread do this since we don't know whether it was
  550. already scheduled when we send the event. */
  551. new_thread->p_eventbuf.eventdata = new_thread;
  552. new_thread->p_eventbuf.eventnum = TD_CREATE;
  553. __pthread_last_event = new_thread;
  554. /* We have to set the PID here since the callback function
  555. in the debug library will need it and we cannot guarantee
  556. the child got scheduled before the debugger. */
  557. new_thread->p_pid = pid;
  558. /* Now call the function which signals the event. */
  559. __linuxthreads_create_event ();
  560. /* Now restart the thread. */
  561. __pthread_unlock(new_thread->p_lock);
  562. }
  563. }
  564. }
  565. if (pid == 0)
  566. {
  567. PDEBUG("cloning new_thread = %p\n", new_thread);
  568. #ifdef __ia64__
  569. pid = __clone2(pthread_start_thread, (void **) new_thread,
  570. (char *)new_thread - new_thread_bottom,
  571. CLONE_VM | CLONE_FS | CLONE_FILES | CLONE_SIGHAND |
  572. __pthread_sig_cancel, new_thread);
  573. #else
  574. pid = clone(pthread_start_thread, (void **) new_thread,
  575. CLONE_VM | CLONE_FS | CLONE_FILES | CLONE_SIGHAND |
  576. __pthread_sig_cancel, new_thread);
  577. #endif
  578. saved_errno = errno;
  579. }
  580. /* Check if cloning succeeded */
  581. if (pid == -1) {
  582. /********************************************************
  583. * Code inserted to remove the thread from our list of active
  584. * threads in case of failure (needed to cope with uClinux),
  585. * See comment below. */
  586. new_thread->p_nextlive->p_prevlive = new_thread->p_prevlive;
  587. new_thread->p_prevlive->p_nextlive = new_thread->p_nextlive;
  588. /********************************************************/
  589. /* Free the stack if we allocated it */
  590. if (attr == NULL || !attr->__stackaddr_set)
  591. {
  592. #ifdef __ARCH_USE_MMU__
  593. if (new_thread->p_guardsize != 0)
  594. munmap(new_thread->p_guardaddr, new_thread->p_guardsize);
  595. munmap((caddr_t)((char *)(new_thread+1) - INITIAL_STACK_SIZE),
  596. INITIAL_STACK_SIZE);
  597. #else
  598. free(new_thread_bottom);
  599. #endif /* __ARCH_USE_MMU__ */
  600. }
  601. __pthread_handles[sseg].h_descr = NULL;
  602. __pthread_handles[sseg].h_bottom = NULL;
  603. __pthread_handles_num--;
  604. return errno;
  605. }
  606. PDEBUG("new thread pid = %d\n", pid);
  607. #if 0
  608. /* ***********************************************************
  609. This code has been moved before the call to clone(). In uClinux,
  610. the use of wait on a semaphore is dependant upon that the child so
  611. the child must be in the active threads list. This list is used in
  612. pthread_find_self() to get the pthread_descr of self. So, if the
  613. child calls sem_wait before this code is executed , it will hang
  614. forever and initial_thread will instead be posted by a sem_post
  615. call. */
  616. /* Insert new thread in doubly linked list of active threads */
  617. new_thread->p_prevlive = __pthread_main_thread;
  618. new_thread->p_nextlive = __pthread_main_thread->p_nextlive;
  619. __pthread_main_thread->p_nextlive->p_prevlive = new_thread;
  620. __pthread_main_thread->p_nextlive = new_thread;
  621. /************************************************************/
  622. #endif
  623. /* Set pid field of the new thread, in case we get there before the
  624. child starts. */
  625. new_thread->p_pid = pid;
  626. /* We're all set */
  627. *thread = new_thread_id;
  628. return 0;
  629. }
  630. /* Try to free the resources of a thread when requested by pthread_join
  631. or pthread_detach on a terminated thread. */
  632. static void pthread_free(pthread_descr th)
  633. {
  634. pthread_handle handle;
  635. pthread_readlock_info *iter, *next;
  636. char *h_bottom_save;
  637. /* Make the handle invalid */
  638. handle = thread_handle(th->p_tid);
  639. __pthread_lock(&handle->h_lock, NULL);
  640. h_bottom_save = handle->h_bottom;
  641. handle->h_descr = NULL;
  642. handle->h_bottom = (char *)(-1L);
  643. __pthread_unlock(&handle->h_lock);
  644. #ifdef FREE_THREAD_SELF
  645. FREE_THREAD_SELF(th, th->p_nr);
  646. #endif
  647. /* One fewer threads in __pthread_handles */
  648. __pthread_handles_num--;
  649. /* Destroy read lock list, and list of free read lock structures.
  650. If the former is not empty, it means the thread exited while
  651. holding read locks! */
  652. for (iter = th->p_readlock_list; iter != NULL; iter = next)
  653. {
  654. next = iter->pr_next;
  655. free(iter);
  656. }
  657. for (iter = th->p_readlock_free; iter != NULL; iter = next)
  658. {
  659. next = iter->pr_next;
  660. free(iter);
  661. }
  662. /* If initial thread, nothing to free */
  663. if (th == &__pthread_initial_thread) return;
  664. #ifdef __ARCH_USE_MMU__
  665. if (!th->p_userstack)
  666. {
  667. /* Free the stack and thread descriptor area */
  668. if (th->p_guardsize != 0)
  669. munmap(th->p_guardaddr, th->p_guardsize);
  670. munmap((caddr_t) ((char *)(th+1) - STACK_SIZE), STACK_SIZE);
  671. }
  672. #else
  673. /* For non-MMU systems we always malloc the stack, so free it here. -StS */
  674. if (!th->p_userstack) {
  675. free(h_bottom_save);
  676. }
  677. #endif /* __ARCH_USE_MMU__ */
  678. }
  679. /* Handle threads that have exited */
  680. static void pthread_exited(pid_t pid)
  681. {
  682. pthread_descr th;
  683. int detached;
  684. /* Find thread with that pid */
  685. for (th = __pthread_main_thread->p_nextlive;
  686. th != __pthread_main_thread;
  687. th = th->p_nextlive) {
  688. if (th->p_pid == pid) {
  689. /* Remove thread from list of active threads */
  690. th->p_nextlive->p_prevlive = th->p_prevlive;
  691. th->p_prevlive->p_nextlive = th->p_nextlive;
  692. /* Mark thread as exited, and if detached, free its resources */
  693. __pthread_lock(th->p_lock, NULL);
  694. th->p_exited = 1;
  695. /* If we have to signal this event do it now. */
  696. if (th->p_report_events)
  697. {
  698. /* See whether TD_REAP is in any of the mask. */
  699. int idx = __td_eventword (TD_REAP);
  700. uint32_t mask = __td_eventmask (TD_REAP);
  701. if ((mask & (__pthread_threads_events.event_bits[idx]
  702. | th->p_eventbuf.eventmask.event_bits[idx])) != 0)
  703. {
  704. /* Yep, we have to signal the reapage. */
  705. th->p_eventbuf.eventnum = TD_REAP;
  706. th->p_eventbuf.eventdata = th;
  707. __pthread_last_event = th;
  708. /* Now call the function to signal the event. */
  709. __linuxthreads_reap_event();
  710. }
  711. }
  712. detached = th->p_detached;
  713. __pthread_unlock(th->p_lock);
  714. if (detached)
  715. pthread_free(th);
  716. break;
  717. }
  718. }
  719. /* If all threads have exited and the main thread is pending on a
  720. pthread_exit, wake up the main thread and terminate ourselves. */
  721. if (main_thread_exiting &&
  722. __pthread_main_thread->p_nextlive == __pthread_main_thread) {
  723. restart(__pthread_main_thread);
  724. /* Same logic as REQ_MAIN_THREAD_EXIT. */
  725. }
  726. }
  727. static void pthread_reap_children(void)
  728. {
  729. pid_t pid;
  730. int status;
  731. PDEBUG("\n");
  732. while ((pid = __libc_waitpid(-1, &status, WNOHANG | __WCLONE)) > 0) {
  733. pthread_exited(pid);
  734. if (WIFSIGNALED(status)) {
  735. /* If a thread died due to a signal, send the same signal to
  736. all other threads, including the main thread. */
  737. pthread_kill_all_threads(WTERMSIG(status), 1);
  738. _exit(0);
  739. }
  740. }
  741. }
  742. /* Try to free the resources of a thread when requested by pthread_join
  743. or pthread_detach on a terminated thread. */
  744. static void pthread_handle_free(pthread_t th_id)
  745. {
  746. pthread_handle handle = thread_handle(th_id);
  747. pthread_descr th;
  748. __pthread_lock(&handle->h_lock, NULL);
  749. if (invalid_handle(handle, th_id)) {
  750. /* pthread_reap_children has deallocated the thread already,
  751. nothing needs to be done */
  752. __pthread_unlock(&handle->h_lock);
  753. return;
  754. }
  755. th = handle->h_descr;
  756. if (th->p_exited) {
  757. __pthread_unlock(&handle->h_lock);
  758. pthread_free(th);
  759. } else {
  760. /* The Unix process of the thread is still running.
  761. Mark the thread as detached so that the thread manager will
  762. deallocate its resources when the Unix process exits. */
  763. th->p_detached = 1;
  764. __pthread_unlock(&handle->h_lock);
  765. }
  766. }
  767. /* Send a signal to all running threads */
  768. static void pthread_kill_all_threads(int sig, int main_thread_also)
  769. {
  770. pthread_descr th;
  771. for (th = __pthread_main_thread->p_nextlive;
  772. th != __pthread_main_thread;
  773. th = th->p_nextlive) {
  774. kill(th->p_pid, sig);
  775. }
  776. if (main_thread_also) {
  777. kill(__pthread_main_thread->p_pid, sig);
  778. }
  779. }
  780. /* Process-wide exit() */
  781. static void pthread_handle_exit(pthread_descr issuing_thread, int exitcode)
  782. {
  783. pthread_descr th;
  784. __pthread_exit_requested = 1;
  785. __pthread_exit_code = exitcode;
  786. /* Send the CANCEL signal to all running threads, including the main
  787. thread, but excluding the thread from which the exit request originated
  788. (that thread must complete the exit, e.g. calling atexit functions
  789. and flushing stdio buffers). */
  790. for (th = issuing_thread->p_nextlive;
  791. th != issuing_thread;
  792. th = th->p_nextlive) {
  793. kill(th->p_pid, __pthread_sig_cancel);
  794. }
  795. /* Now, wait for all these threads, so that they don't become zombies
  796. and their times are properly added to the thread manager's times. */
  797. for (th = issuing_thread->p_nextlive;
  798. th != issuing_thread;
  799. th = th->p_nextlive) {
  800. waitpid(th->p_pid, NULL, __WCLONE);
  801. }
  802. restart(issuing_thread);
  803. _exit(0);
  804. }
  805. /* Handler for __pthread_sig_cancel in thread manager thread */
  806. void __pthread_manager_sighandler(int sig attribute_unused)
  807. {
  808. int kick_manager = terminated_children == 0 && main_thread_exiting;
  809. terminated_children = 1;
  810. /* If the main thread is terminating, kick the thread manager loop
  811. each time some threads terminate. This eliminates a two second
  812. shutdown delay caused by the thread manager sleeping in the
  813. call to __poll(). Instead, the thread manager is kicked into
  814. action, reaps the outstanding threads and resumes the main thread
  815. so that it can complete the shutdown. */
  816. if (kick_manager) {
  817. struct pthread_request request;
  818. request.req_thread = 0;
  819. request.req_kind = REQ_KICK;
  820. TEMP_FAILURE_RETRY(__libc_write(__pthread_manager_request,
  821. (char *) &request, sizeof(request)));
  822. }
  823. }
  824. /* Adjust priority of thread manager so that it always run at a priority
  825. higher than all threads */
  826. void __pthread_manager_adjust_prio(int thread_prio)
  827. {
  828. struct sched_param param;
  829. if (thread_prio <= __pthread_manager_thread.p_priority) return;
  830. param.sched_priority =
  831. thread_prio < sched_get_priority_max(SCHED_FIFO)
  832. ? thread_prio + 1 : thread_prio;
  833. sched_setscheduler(__pthread_manager_thread.p_pid, SCHED_FIFO, &param);
  834. __pthread_manager_thread.p_priority = thread_prio;
  835. }