shim_thread.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_thread.c
  17. *
  18. * This file contains codes to maintain bookkeeping of threads in library OS.
  19. */
  20. #include <shim_internal.h>
  21. #include <shim_thread.h>
  22. #include <shim_handle.h>
  23. #include <shim_vma.h>
  24. #include <shim_fs.h>
  25. #include <shim_checkpoint.h>
  26. #include <shim_utils.h>
  27. #include <pal.h>
  28. #include <list.h>
  29. static IDTYPE tid_alloc_idx __attribute_migratable = 0;
  30. static LISTP_TYPE(shim_thread) thread_list = LISTP_INIT;
  31. DEFINE_LISTP(shim_simple_thread);
  32. static LISTP_TYPE(shim_simple_thread) simple_thread_list = LISTP_INIT;
  33. LOCKTYPE thread_list_lock;
  34. static IDTYPE internal_tid_alloc_idx = INTERNAL_TID_BASE;
  35. PAL_HANDLE thread_start_event = NULL;
  36. //#define DEBUG_REF
  37. int init_thread (void)
  38. {
  39. create_lock(thread_list_lock);
  40. struct shim_thread * cur_thread = get_cur_thread();
  41. if (cur_thread)
  42. return 0;
  43. if (!(cur_thread = get_new_thread(0)))
  44. return -ENOMEM;
  45. cur_thread->in_vm = cur_thread->is_alive = true;
  46. set_cur_thread(cur_thread);
  47. add_thread(cur_thread);
  48. cur_thread->pal_handle = PAL_CB(first_thread);
  49. return 0;
  50. }
  51. void dump_threads (void)
  52. {
  53. struct shim_thread * tmp;
  54. lock(thread_list_lock);
  55. listp_for_each_entry(tmp, &thread_list, list) {
  56. debug("thread %d, vmid = %d, pgid = %d, ppid = %d, tgid = %d, in_vm = %d\n",
  57. tmp->tid, tmp->vmid, tmp->pgid, tmp->ppid, tmp->tgid, tmp->in_vm);
  58. }
  59. unlock(thread_list_lock);
  60. }
  61. struct shim_thread * __lookup_thread (IDTYPE tid)
  62. {
  63. struct shim_thread * tmp;
  64. listp_for_each_entry(tmp, &thread_list, list) {
  65. if (tmp->tid == tid) {
  66. get_thread(tmp);
  67. return tmp;
  68. }
  69. }
  70. return NULL;
  71. }
  72. struct shim_thread * lookup_thread (IDTYPE tid)
  73. {
  74. lock(thread_list_lock);
  75. struct shim_thread * thread = __lookup_thread(tid);
  76. unlock(thread_list_lock);
  77. return thread;
  78. }
  79. struct shim_thread * __get_cur_thread (void)
  80. {
  81. return shim_thread_self();
  82. }
  83. shim_tcb_t * __get_cur_tcb (void)
  84. {
  85. return shim_get_tls();
  86. }
  87. IDTYPE get_pid (void)
  88. {
  89. IDTYPE idx;
  90. while (1) {
  91. IDTYPE old_idx = tid_alloc_idx;
  92. IDTYPE max = 0;
  93. idx = old_idx + 1;
  94. do {
  95. if ((idx = allocate_pid(idx, max)))
  96. break;
  97. tid_alloc_idx = idx;
  98. if (!idx) {
  99. if (max == old_idx)
  100. break;
  101. max = old_idx;
  102. }
  103. } while (idx != tid_alloc_idx);
  104. if (idx != tid_alloc_idx)
  105. break;
  106. if (ipc_pid_lease_send(NULL) < 0)
  107. return 0;
  108. }
  109. tid_alloc_idx = idx;
  110. return idx;
  111. }
  112. static IDTYPE get_internal_pid (void)
  113. {
  114. lock(thread_list_lock);
  115. internal_tid_alloc_idx++;
  116. IDTYPE idx = internal_tid_alloc_idx;
  117. unlock(thread_list_lock);
  118. assert(is_internal_tid(idx));
  119. return idx;
  120. }
  121. struct shim_thread * alloc_new_thread (void)
  122. {
  123. struct shim_thread * thread = calloc(1, sizeof(struct shim_thread));
  124. if (!thread)
  125. return NULL;
  126. REF_SET(thread->ref_count, 1);
  127. INIT_LISTP(&thread->children);
  128. INIT_LIST_HEAD(thread, siblings);
  129. INIT_LISTP(&thread->exited_children);
  130. INIT_LIST_HEAD(thread, list);
  131. return thread;
  132. }
  133. struct shim_thread * get_new_thread (IDTYPE new_tid)
  134. {
  135. if (!new_tid) {
  136. new_tid = get_pid();
  137. assert(new_tid);
  138. }
  139. struct shim_thread * thread = alloc_new_thread();
  140. if (!thread)
  141. return NULL;
  142. struct shim_thread * cur_thread = get_cur_thread();
  143. thread->tid = new_tid;
  144. if (cur_thread) {
  145. /* The newly created thread will be in the same thread group
  146. (process group as well) with its parent */
  147. thread->pgid = cur_thread->pgid;
  148. thread->ppid = cur_thread->tgid;
  149. thread->tgid = cur_thread->tgid;
  150. thread->uid = cur_thread->uid;
  151. thread->gid = cur_thread->gid;
  152. thread->euid = cur_thread->euid;
  153. thread->egid = cur_thread->egid;
  154. thread->parent = cur_thread;
  155. thread->stack = cur_thread->stack;
  156. thread->stack_top = cur_thread->stack_top;
  157. thread->stack_red = cur_thread->stack_red;
  158. thread->cwd = cur_thread->cwd;
  159. thread->root = cur_thread->root;
  160. thread->umask = cur_thread->umask;
  161. thread->exec = cur_thread->exec;
  162. get_handle(cur_thread->exec);
  163. for (int i = 0 ; i < NUM_SIGS ; i++) {
  164. if (!cur_thread->signal_handles[i].action)
  165. continue;
  166. thread->signal_handles[i].action =
  167. malloc_copy(cur_thread->signal_handles[i].action,
  168. sizeof(struct shim_signal_handle));
  169. }
  170. memcpy(&thread->signal_mask, &cur_thread->signal_mask,
  171. sizeof(sigset_t));
  172. get_dentry(cur_thread->cwd);
  173. get_dentry(cur_thread->root);
  174. struct shim_handle_map * map = get_cur_handle_map(cur_thread);
  175. assert(map);
  176. set_handle_map(thread, map);
  177. } else {
  178. /* default pid and pgid equals to tid */
  179. thread->ppid = thread->pgid = thread->tgid = new_tid;
  180. /* This case should fall back to the global root of the file system.
  181. */
  182. path_lookupat(NULL, "/", 0, &thread->root, NULL);
  183. char dir_cfg[CONFIG_MAX];
  184. if (root_config &&
  185. get_config(root_config, "fs.start_dir", dir_cfg, CONFIG_MAX) > 0) {
  186. path_lookupat(NULL, dir_cfg, 0, &thread->cwd, NULL);
  187. } else if (thread->root) {
  188. get_dentry(thread->root);
  189. thread->cwd = thread->root;
  190. }
  191. }
  192. thread->signal_logs = malloc(sizeof(struct shim_signal_log) *
  193. NUM_SIGS);
  194. thread->vmid = cur_process.vmid;
  195. create_lock(thread->lock);
  196. thread->scheduler_event = DkNotificationEventCreate(PAL_TRUE);
  197. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  198. thread->child_exit_event = DkNotificationEventCreate(PAL_FALSE);
  199. return thread;
  200. }
  201. struct shim_thread * get_new_internal_thread (void)
  202. {
  203. IDTYPE new_tid = get_internal_pid();
  204. assert(new_tid);
  205. struct shim_thread * thread = alloc_new_thread();
  206. if (!thread)
  207. return NULL;
  208. thread->vmid = cur_process.vmid;
  209. thread->tid = new_tid;
  210. thread->in_vm = thread->is_alive = true;
  211. create_lock(thread->lock);
  212. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  213. return thread;
  214. }
  215. struct shim_simple_thread * __lookup_simple_thread (IDTYPE tid)
  216. {
  217. struct shim_simple_thread * tmp;
  218. listp_for_each_entry(tmp, &simple_thread_list, list) {
  219. if (tmp->tid == tid) {
  220. get_simple_thread(tmp);
  221. return tmp;
  222. }
  223. }
  224. return NULL;
  225. }
  226. struct shim_simple_thread * lookup_simple_thread (IDTYPE tid)
  227. {
  228. lock(thread_list_lock);
  229. struct shim_simple_thread * thread = __lookup_simple_thread(tid);
  230. unlock(thread_list_lock);
  231. return thread;
  232. }
  233. struct shim_simple_thread * get_new_simple_thread (void)
  234. {
  235. struct shim_simple_thread * thread =
  236. malloc(sizeof(struct shim_simple_thread));
  237. if (!thread)
  238. return NULL;
  239. memset(thread, 0, sizeof(struct shim_simple_thread));
  240. INIT_LIST_HEAD(thread, list);
  241. create_lock(thread->lock);
  242. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  243. return thread;
  244. }
  245. void get_thread (struct shim_thread * thread)
  246. {
  247. #ifdef DEBUG_REF
  248. int ref_count = REF_INC(thread->ref_count);
  249. debug("get_thread %p(%d) (ref_count = %d)\n", thread, thread->tid,
  250. ref_count);
  251. #else
  252. REF_INC(thread->ref_count);
  253. #endif
  254. }
  255. void put_thread (struct shim_thread * thread)
  256. {
  257. int ref_count = REF_DEC(thread->ref_count);
  258. #ifdef DEBUG_REF
  259. debug("put thread %p(%d) (ref_count = %d)\n", thread, thread->tid,
  260. ref_count);
  261. #endif
  262. if (!ref_count) {
  263. if (thread->exec)
  264. put_handle(thread->exec);
  265. if (!is_internal(thread))
  266. release_pid(thread->tid);
  267. if (thread->pal_handle &&
  268. thread->pal_handle != PAL_CB(first_thread))
  269. DkObjectClose(thread->pal_handle);
  270. if (thread->scheduler_event)
  271. DkObjectClose(thread->scheduler_event);
  272. if (thread->exit_event)
  273. DkObjectClose(thread->exit_event);
  274. if (thread->child_exit_event)
  275. DkObjectClose(thread->child_exit_event);
  276. destroy_lock(thread->lock);
  277. free(thread->signal_logs);
  278. free(thread);
  279. }
  280. }
  281. void get_simple_thread (struct shim_simple_thread * thread)
  282. {
  283. REF_INC(thread->ref_count);
  284. }
  285. void put_simple_thread (struct shim_simple_thread * thread)
  286. {
  287. int ref_count = REF_DEC(thread->ref_count);
  288. if (!ref_count) {
  289. /* Simple threads always live on the simple thread list */
  290. listp_del(thread, &simple_thread_list, list);
  291. if (thread->exit_event)
  292. DkObjectClose(thread->exit_event);
  293. destroy_lock(thread->lock);
  294. free(thread);
  295. }
  296. }
  297. void set_as_child (struct shim_thread * parent,
  298. struct shim_thread * child)
  299. {
  300. if (!parent)
  301. parent = get_cur_thread();
  302. get_thread(parent);
  303. get_thread(child);
  304. lock(child->lock);
  305. child->ppid = parent->tid;
  306. child->parent = parent;
  307. lock(parent->lock);
  308. listp_add_tail(child, &parent->children, siblings);
  309. unlock(parent->lock);
  310. unlock(child->lock);
  311. }
  312. void add_thread (struct shim_thread * thread)
  313. {
  314. if (is_internal(thread) || !list_empty(thread, list))
  315. return;
  316. struct shim_thread * tmp, * prev = NULL;
  317. lock(thread_list_lock);
  318. /* keep it sorted */
  319. listp_for_each_entry_reverse(tmp, &thread_list, list) {
  320. if (tmp->tid == thread->tid) {
  321. unlock(thread_list_lock);
  322. return;
  323. }
  324. if (tmp->tid < thread->tid) {
  325. prev = tmp;
  326. break;
  327. }
  328. }
  329. get_thread(thread);
  330. listp_add_after(thread, prev, &thread_list, list);
  331. unlock(thread_list_lock);
  332. }
  333. void del_thread (struct shim_thread * thread)
  334. {
  335. debug("del_thread(%p, %d, %ld)\n", thread, thread ? thread->tid : -1,
  336. atomic_read(&thread->ref_count));
  337. if (is_internal(thread) || list_empty(thread, list)) {
  338. debug("del_thread: internal\n");
  339. return;
  340. }
  341. lock(thread_list_lock);
  342. /* thread->list goes on the thread_list */
  343. listp_del_init(thread, &thread_list, list);
  344. unlock(thread_list_lock);
  345. put_thread(thread);
  346. }
  347. void add_simple_thread (struct shim_simple_thread * thread)
  348. {
  349. if (!list_empty(thread, list))
  350. return;
  351. struct shim_simple_thread * tmp, * prev = NULL;
  352. lock(thread_list_lock);
  353. /* keep it sorted */
  354. listp_for_each_entry_reverse(tmp, &simple_thread_list, list) {
  355. if (tmp->tid == thread->tid) {
  356. unlock(thread_list_lock);
  357. return;
  358. }
  359. if (tmp->tid < thread->tid) {
  360. prev = tmp;
  361. break;
  362. }
  363. }
  364. get_simple_thread(thread);
  365. listp_add_after(thread, prev, &simple_thread_list, list);
  366. unlock(thread_list_lock);
  367. }
  368. void del_simple_thread (struct shim_simple_thread * thread)
  369. {
  370. if (list_empty(thread, list))
  371. return;
  372. lock(thread_list_lock);
  373. listp_del_init(thread, &simple_thread_list, list);
  374. unlock(thread_list_lock);
  375. put_simple_thread(thread);
  376. }
  377. int check_last_thread (struct shim_thread * self)
  378. {
  379. struct shim_thread * tmp;
  380. lock(thread_list_lock);
  381. /* find out if there is any thread that is
  382. 1) no current thread 2) in current vm
  383. 3) still alive */
  384. listp_for_each_entry(tmp, &thread_list, list) {
  385. if (tmp->tid &&
  386. (!self || tmp->tid != self->tid) && tmp->in_vm && tmp->is_alive) {
  387. debug("check_last_thread: thread %d is alive\n", tmp->tid);
  388. unlock(thread_list_lock);
  389. return tmp->tid;
  390. }
  391. }
  392. debug("this is the only thread %d\n", self->tid);
  393. unlock(thread_list_lock);
  394. return 0;
  395. }
  396. int walk_thread_list (int (*callback) (struct shim_thread *, void *, bool *),
  397. void * arg, bool may_write)
  398. {
  399. struct shim_thread * tmp, * n;
  400. bool srched = false;
  401. int ret;
  402. IDTYPE min_tid = 0;
  403. relock:
  404. lock(thread_list_lock);
  405. debug("walk_thread_list(callback=%p)\n", callback);
  406. listp_for_each_entry_safe(tmp, n, &thread_list, list) {
  407. if (tmp->tid <= min_tid)
  408. continue;
  409. bool unlocked = false;
  410. ret = (*callback) (tmp, arg, &unlocked);
  411. if (ret < 0 && ret != -ESRCH) {
  412. if (unlocked)
  413. goto out;
  414. else
  415. goto out_locked;
  416. }
  417. if (ret > 0)
  418. srched = true;
  419. if (unlocked) {
  420. min_tid = tmp->tid;
  421. goto relock;
  422. }
  423. }
  424. ret = srched ? 0 : -ESRCH;
  425. out_locked:
  426. unlock(thread_list_lock);
  427. out:
  428. return ret;
  429. }
  430. int walk_simple_thread_list (int (*callback) (struct shim_simple_thread *,
  431. void *, bool *),
  432. void * arg, bool may_write)
  433. {
  434. struct shim_simple_thread * tmp, * n;
  435. bool srched = false;
  436. int ret;
  437. IDTYPE min_tid = 0;
  438. relock:
  439. lock(thread_list_lock);
  440. listp_for_each_entry_safe(tmp, n, &simple_thread_list, list) {
  441. if (tmp->tid <= min_tid)
  442. continue;
  443. bool unlocked = false;
  444. ret = (*callback) (tmp, arg, &unlocked);
  445. if (ret < 0 && ret != -ESRCH) {
  446. if (unlocked)
  447. goto out;
  448. else
  449. goto out_locked;
  450. }
  451. if (ret > 0)
  452. srched = true;
  453. if (unlocked) {
  454. min_tid = tmp->tid;
  455. goto relock;
  456. }
  457. }
  458. ret = srched ? 0 : -ESRCH;
  459. out_locked:
  460. unlock(thread_list_lock);
  461. out:
  462. return ret;
  463. }
  464. void switch_dummy_thread (struct shim_thread * thread)
  465. {
  466. struct shim_thread * real_thread = thread->dummy;
  467. IDTYPE child = thread->tid;
  468. assert(thread->frameptr);
  469. assert(real_thread->stack);
  470. assert(real_thread->stack_top > real_thread->stack);
  471. memcpy(thread->frameptr, real_thread->stack,
  472. real_thread->stack_top - real_thread->stack);
  473. real_thread->stack = thread->stack;
  474. real_thread->stack_top = thread->stack_top;
  475. real_thread->frameptr = thread->frameptr;
  476. DkSegmentRegister(PAL_SEGMENT_FS, real_thread->tcb);
  477. set_cur_thread(real_thread);
  478. debug("set tcb to %p\n", real_thread->tcb);
  479. debug("jump to the stack %p\n", real_thread->frameptr);
  480. debug("shim_vfork success (returning %d)\n", child);
  481. /* jump onto old stack
  482. we actually pop rbp as rsp, and later we will call 'ret' */
  483. __asm__ volatile("movq %0, %%rbp\r\n"
  484. "leaveq\r\n"
  485. "retq\r\n" :
  486. : "g"(real_thread->frameptr),
  487. "a"(child)
  488. : "memory");
  489. }
  490. BEGIN_CP_FUNC(thread)
  491. {
  492. assert(size == sizeof(struct shim_thread));
  493. struct shim_thread * thread = (struct shim_thread *) obj;
  494. struct shim_thread * new_thread = NULL;
  495. ptr_t off = GET_FROM_CP_MAP(obj);
  496. if (!off) {
  497. off = ADD_CP_OFFSET(sizeof(struct shim_thread));
  498. ADD_TO_CP_MAP(obj, off);
  499. new_thread = (struct shim_thread *) (base + off);
  500. memcpy(new_thread, thread, sizeof(struct shim_thread));
  501. INIT_LISTP(&new_thread->children);
  502. INIT_LIST_HEAD(new_thread, siblings);
  503. INIT_LISTP(&new_thread->exited_children);
  504. INIT_LIST_HEAD(new_thread, list);
  505. new_thread->in_vm = false;
  506. new_thread->parent = NULL;
  507. new_thread->dummy = NULL;
  508. new_thread->handle_map = NULL;
  509. new_thread->root = NULL;
  510. new_thread->cwd = NULL;
  511. new_thread->signal_logs = NULL;
  512. new_thread->robust_list = NULL;
  513. REF_SET(new_thread->ref_count, 0);
  514. for (int i = 0 ; i < NUM_SIGS ; i++)
  515. if (thread->signal_handles[i].action) {
  516. ptr_t soff = ADD_CP_OFFSET(sizeof(struct __kernel_sigaction));
  517. new_thread->signal_handles[i].action
  518. = (struct __kernel_sigaction *) (base + soff);
  519. memcpy(new_thread->signal_handles[i].action,
  520. thread->signal_handles[i].action,
  521. sizeof(struct __kernel_sigaction));
  522. }
  523. DO_CP_MEMBER(handle, thread, new_thread, exec);
  524. DO_CP_MEMBER(handle_map, thread, new_thread, handle_map);
  525. DO_CP_MEMBER(dentry, thread, new_thread, root);
  526. DO_CP_MEMBER(dentry, thread, new_thread, cwd);
  527. ADD_CP_FUNC_ENTRY(off);
  528. } else {
  529. new_thread = (struct shim_thread *) (base + off);
  530. }
  531. if (objp)
  532. *objp = (void *) new_thread;
  533. }
  534. END_CP_FUNC(thread)
  535. BEGIN_RS_FUNC(thread)
  536. {
  537. struct shim_thread * thread = (void *) (base + GET_CP_FUNC_ENTRY());
  538. CP_REBASE(thread->children);
  539. CP_REBASE(thread->siblings);
  540. CP_REBASE(thread->exited_children);
  541. CP_REBASE(thread->list);
  542. CP_REBASE(thread->exec);
  543. CP_REBASE(thread->handle_map);
  544. CP_REBASE(thread->root);
  545. CP_REBASE(thread->cwd);
  546. CP_REBASE(thread->signal_handles);
  547. create_lock(thread->lock);
  548. thread->scheduler_event = DkNotificationEventCreate(PAL_TRUE);
  549. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  550. thread->child_exit_event = DkNotificationEventCreate(PAL_FALSE);
  551. add_thread(thread);
  552. if (thread->exec)
  553. get_handle(thread->exec);
  554. if (thread->handle_map)
  555. get_handle_map(thread->handle_map);
  556. if (thread->root)
  557. get_dentry(thread->root);
  558. if (thread->cwd)
  559. get_dentry(thread->cwd);
  560. DEBUG_RS("tid=%d,tgid=%d,parent=%d,stack=%p,frameptr=%p,tcb=%p",
  561. thread->tid, thread->tgid,
  562. thread->parent ? thread->parent->tid : thread->tid,
  563. thread->stack, thread->frameptr, thread->tcb);
  564. }
  565. END_RS_FUNC(thread)
  566. BEGIN_CP_FUNC(running_thread)
  567. {
  568. assert(size == sizeof(struct shim_thread));
  569. struct shim_thread * thread = (struct shim_thread *) obj;
  570. struct shim_thread * new_thread = NULL;
  571. DO_CP(thread, thread, &new_thread);
  572. ADD_CP_FUNC_ENTRY((ptr_t) new_thread - base);
  573. if (!thread->user_tcb && thread->tcb) {
  574. ptr_t toff = ADD_CP_OFFSET(sizeof(__libc_tcb_t));
  575. new_thread->tcb = (void *) (base + toff);
  576. memcpy(new_thread->tcb, thread->tcb, sizeof(__libc_tcb_t));
  577. }
  578. }
  579. END_CP_FUNC(running_thread)
  580. int resume_wrapper (void * param)
  581. {
  582. struct shim_thread * thread = (struct shim_thread *) param;
  583. assert(thread);
  584. __libc_tcb_t * libc_tcb = (__libc_tcb_t *) thread->tcb;
  585. assert(libc_tcb);
  586. shim_tcb_t * tcb = &libc_tcb->shim_tcb;
  587. assert(tcb->context.sp);
  588. thread->in_vm = thread->is_alive = true;
  589. allocate_tls(libc_tcb, thread->user_tcb, thread);
  590. debug_setbuf(tcb, true);
  591. debug("set tcb to %p\n", libc_tcb);
  592. DkObjectsWaitAny(1, &thread_start_event, NO_TIMEOUT);
  593. restore_context(&tcb->context);
  594. return 0;
  595. }
  596. BEGIN_RS_FUNC(running_thread)
  597. {
  598. struct shim_thread * thread = (void *) (base + GET_CP_FUNC_ENTRY());
  599. struct shim_thread * cur_thread = get_cur_thread();
  600. thread->in_vm = true;
  601. if (!thread->user_tcb)
  602. CP_REBASE(thread->tcb);
  603. thread->signal_logs = malloc(sizeof(struct shim_signal_log) *
  604. NUM_SIGS);
  605. if (cur_thread) {
  606. PAL_HANDLE handle = DkThreadCreate(resume_wrapper, thread);
  607. if (!thread)
  608. return -PAL_ERRNO;
  609. thread->pal_handle = handle;
  610. } else {
  611. __libc_tcb_t * libc_tcb = (__libc_tcb_t *) thread->tcb;
  612. if (libc_tcb) {
  613. shim_tcb_t * tcb = &libc_tcb->shim_tcb;
  614. assert(tcb->context.sp);
  615. tcb->debug_buf = shim_get_tls()->debug_buf;
  616. allocate_tls(libc_tcb, thread->user_tcb, thread);
  617. /* Temporarily disable preemption until the thread resumes. */
  618. __disable_preempt(tcb);
  619. debug_setprefix(tcb);
  620. debug("after resume, set tcb to %p\n", libc_tcb);
  621. } else {
  622. set_cur_thread(thread);
  623. }
  624. thread->in_vm = thread->is_alive = true;
  625. thread->pal_handle = PAL_CB(first_thread);
  626. }
  627. DEBUG_RS("tid=%d", thread->tid);
  628. }
  629. END_RS_FUNC(running_thread)
  630. BEGIN_CP_FUNC(all_running_threads)
  631. {
  632. struct shim_thread * thread;
  633. lock(thread_list_lock);
  634. listp_for_each_entry(thread, &thread_list, list) {
  635. if (!thread->in_vm || !thread->is_alive)
  636. continue;
  637. DO_CP(running_thread, thread, NULL);
  638. DO_CP(handle_map, thread->handle_map, NULL);
  639. }
  640. unlock(thread_list_lock);
  641. }
  642. END_CP_FUNC_NO_RS(all_running_threads)