shim_thread.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785
  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. return idx;
  119. }
  120. struct shim_thread * alloc_new_thread (void)
  121. {
  122. struct shim_thread * thread = calloc(1, sizeof(struct shim_thread));
  123. if (!thread)
  124. return NULL;
  125. REF_SET(thread->ref_count, 1);
  126. INIT_LISTP(&thread->children);
  127. INIT_LIST_HEAD(thread, siblings);
  128. INIT_LISTP(&thread->exited_children);
  129. INIT_LIST_HEAD(thread, list);
  130. return thread;
  131. }
  132. struct shim_thread * get_new_thread (IDTYPE new_tid)
  133. {
  134. if (!new_tid) {
  135. new_tid = get_pid();
  136. assert(new_tid);
  137. }
  138. struct shim_thread * thread = alloc_new_thread();
  139. if (!thread)
  140. return NULL;
  141. struct shim_thread * cur_thread = get_cur_thread();
  142. thread->tid = new_tid;
  143. if (cur_thread) {
  144. /* The newly created thread will be in the same thread group
  145. (process group as well) with its parent */
  146. thread->pgid = cur_thread->pgid;
  147. thread->ppid = cur_thread->tgid;
  148. thread->tgid = cur_thread->tgid;
  149. thread->uid = cur_thread->uid;
  150. thread->gid = cur_thread->gid;
  151. thread->euid = cur_thread->euid;
  152. thread->egid = cur_thread->egid;
  153. thread->parent = cur_thread;
  154. thread->stack = cur_thread->stack;
  155. thread->stack_top = cur_thread->stack_top;
  156. thread->stack_red = cur_thread->stack_red;
  157. thread->cwd = cur_thread->cwd;
  158. thread->root = cur_thread->root;
  159. thread->umask = cur_thread->umask;
  160. thread->exec = cur_thread->exec;
  161. get_handle(cur_thread->exec);
  162. for (int i = 0 ; i < NUM_SIGS ; i++) {
  163. if (!cur_thread->signal_handles[i].action)
  164. continue;
  165. thread->signal_handles[i].action =
  166. malloc_copy(cur_thread->signal_handles[i].action,
  167. sizeof(struct shim_signal_handle));
  168. }
  169. memcpy(&thread->signal_mask, &cur_thread->signal_mask,
  170. sizeof(sigset_t));
  171. get_dentry(cur_thread->cwd);
  172. get_dentry(cur_thread->root);
  173. struct shim_handle_map * map = get_cur_handle_map(cur_thread);
  174. assert(map);
  175. set_handle_map(thread, map);
  176. } else {
  177. /* default pid and pgid equals to tid */
  178. thread->ppid = thread->pgid = thread->tgid = new_tid;
  179. /* This case should fall back to the global root of the file system.
  180. */
  181. path_lookupat(NULL, "/", 0, &thread->root, NULL);
  182. char dir_cfg[CONFIG_MAX];
  183. if (root_config &&
  184. get_config(root_config, "fs.start_dir", dir_cfg, CONFIG_MAX) > 0) {
  185. path_lookupat(NULL, dir_cfg, 0, &thread->cwd, NULL);
  186. } else if (thread->root) {
  187. get_dentry(thread->root);
  188. thread->cwd = thread->root;
  189. }
  190. }
  191. thread->signal_logs = malloc(sizeof(struct shim_signal_log) *
  192. NUM_SIGS);
  193. thread->vmid = cur_process.vmid;
  194. create_lock(thread->lock);
  195. thread->scheduler_event = DkNotificationEventCreate(PAL_TRUE);
  196. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  197. thread->child_exit_event = DkNotificationEventCreate(PAL_FALSE);
  198. return thread;
  199. }
  200. struct shim_thread * get_new_internal_thread (void)
  201. {
  202. IDTYPE new_tid = get_internal_pid();
  203. assert(new_tid);
  204. struct shim_thread * thread = alloc_new_thread();
  205. if (!thread)
  206. return NULL;
  207. thread->vmid = cur_process.vmid;
  208. thread->tid = new_tid;
  209. thread->in_vm = thread->is_alive = true;
  210. create_lock(thread->lock);
  211. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  212. return thread;
  213. }
  214. struct shim_simple_thread * __lookup_simple_thread (IDTYPE tid)
  215. {
  216. struct shim_simple_thread * tmp;
  217. listp_for_each_entry(tmp, &simple_thread_list, list) {
  218. if (tmp->tid == tid) {
  219. get_simple_thread(tmp);
  220. return tmp;
  221. }
  222. }
  223. return NULL;
  224. }
  225. struct shim_simple_thread * lookup_simple_thread (IDTYPE tid)
  226. {
  227. lock(thread_list_lock);
  228. struct shim_simple_thread * thread = __lookup_simple_thread(tid);
  229. unlock(thread_list_lock);
  230. return thread;
  231. }
  232. struct shim_simple_thread * get_new_simple_thread (void)
  233. {
  234. struct shim_simple_thread * thread =
  235. malloc(sizeof(struct shim_simple_thread));
  236. if (!thread)
  237. return NULL;
  238. memset(thread, 0, sizeof(struct shim_simple_thread));
  239. INIT_LIST_HEAD(thread, list);
  240. create_lock(thread->lock);
  241. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  242. return thread;
  243. }
  244. void get_thread (struct shim_thread * thread)
  245. {
  246. #ifdef DEBUG_REF
  247. int ref_count = REF_INC(thread->ref_count);
  248. debug("get_thread %p(%d) (ref_count = %d)\n", thread, thread->tid,
  249. ref_count);
  250. #else
  251. REF_INC(thread->ref_count);
  252. #endif
  253. }
  254. void put_thread (struct shim_thread * thread)
  255. {
  256. int ref_count = REF_DEC(thread->ref_count);
  257. #ifdef DEBUG_REF
  258. debug("put thread %p(%d) (ref_count = %d)\n", thread, thread->tid,
  259. ref_count);
  260. #endif
  261. if (!ref_count) {
  262. if (thread->exec)
  263. put_handle(thread->exec);
  264. if (!IS_INTERNAL(thread))
  265. release_pid(thread->tid);
  266. if (thread->pal_handle &&
  267. thread->pal_handle != PAL_CB(first_thread))
  268. DkObjectClose(thread->pal_handle);
  269. if (thread->scheduler_event)
  270. DkObjectClose(thread->scheduler_event);
  271. if (thread->exit_event)
  272. DkObjectClose(thread->exit_event);
  273. if (thread->child_exit_event)
  274. DkObjectClose(thread->child_exit_event);
  275. destroy_lock(thread->lock);
  276. free(thread->signal_logs);
  277. free(thread);
  278. }
  279. }
  280. void get_simple_thread (struct shim_simple_thread * thread)
  281. {
  282. REF_INC(thread->ref_count);
  283. }
  284. void put_simple_thread (struct shim_simple_thread * thread)
  285. {
  286. int ref_count = REF_DEC(thread->ref_count);
  287. if (!ref_count) {
  288. /* Simple threads always live on the simple thread list */
  289. listp_del(thread, &simple_thread_list, list);
  290. if (thread->exit_event)
  291. DkObjectClose(thread->exit_event);
  292. destroy_lock(thread->lock);
  293. free(thread);
  294. }
  295. }
  296. void set_as_child (struct shim_thread * parent,
  297. struct shim_thread * child)
  298. {
  299. if (!parent)
  300. parent = get_cur_thread();
  301. get_thread(parent);
  302. get_thread(child);
  303. lock(child->lock);
  304. child->ppid = parent->tid;
  305. child->parent = parent;
  306. lock(parent->lock);
  307. listp_add_tail(child, &parent->children, siblings);
  308. unlock(parent->lock);
  309. unlock(child->lock);
  310. }
  311. void add_thread (struct shim_thread * thread)
  312. {
  313. if (IS_INTERNAL(thread) || !list_empty(thread, list))
  314. return;
  315. struct shim_thread * tmp, * prev = NULL;
  316. lock(thread_list_lock);
  317. /* keep it sorted */
  318. listp_for_each_entry_reverse(tmp, &thread_list, list) {
  319. if (tmp->tid == thread->tid) {
  320. unlock(thread_list_lock);
  321. return;
  322. }
  323. if (tmp->tid < thread->tid) {
  324. prev = tmp;
  325. break;
  326. }
  327. }
  328. get_thread(thread);
  329. listp_add_after(thread, prev, &thread_list, list);
  330. unlock(thread_list_lock);
  331. }
  332. void del_thread (struct shim_thread * thread)
  333. {
  334. debug("del_thread(%p, %d, %d)\n", thread, thread ? thread->tid : -1,
  335. thread->ref_count);
  336. if (IS_INTERNAL(thread) || list_empty(thread, list)) {
  337. debug("del_thread: internal\n");
  338. return;
  339. }
  340. lock(thread_list_lock);
  341. /* thread->list goes on the thread_list */
  342. listp_del_init(thread, &thread_list, list);
  343. unlock(thread_list_lock);
  344. put_thread(thread);
  345. }
  346. void add_simple_thread (struct shim_simple_thread * thread)
  347. {
  348. if (!list_empty(thread, list))
  349. return;
  350. struct shim_simple_thread * tmp, * prev = NULL;
  351. lock(thread_list_lock);
  352. /* keep it sorted */
  353. listp_for_each_entry_reverse(tmp, &simple_thread_list, list) {
  354. if (tmp->tid == thread->tid) {
  355. unlock(thread_list_lock);
  356. return;
  357. }
  358. if (tmp->tid < thread->tid) {
  359. prev = tmp;
  360. break;
  361. }
  362. }
  363. get_simple_thread(thread);
  364. listp_add_after(thread, prev, &simple_thread_list, list);
  365. unlock(thread_list_lock);
  366. }
  367. void del_simple_thread (struct shim_simple_thread * thread)
  368. {
  369. if (list_empty(thread, list))
  370. return;
  371. lock(thread_list_lock);
  372. listp_del_init(thread, &simple_thread_list, list);
  373. unlock(thread_list_lock);
  374. put_simple_thread(thread);
  375. }
  376. int check_last_thread (struct shim_thread * self)
  377. {
  378. struct shim_thread * tmp;
  379. lock(thread_list_lock);
  380. /* find out if there is any thread that is
  381. 1) no current thread 2) in current vm
  382. 3) still alive */
  383. listp_for_each_entry(tmp, &thread_list, list) {
  384. if (tmp->tid &&
  385. (!self || tmp->tid != self->tid) && tmp->in_vm && tmp->is_alive) {
  386. debug("check_last_thread: thread %d is alive\n", tmp->tid);
  387. unlock(thread_list_lock);
  388. return tmp->tid;
  389. }
  390. }
  391. debug("this is the only thread\n", self->tid);
  392. unlock(thread_list_lock);
  393. return 0;
  394. }
  395. int walk_thread_list (int (*callback) (struct shim_thread *, void *, bool *),
  396. void * arg, bool may_write)
  397. {
  398. struct shim_thread * tmp, * n;
  399. bool srched = false;
  400. int ret;
  401. IDTYPE min_tid = 0;
  402. relock:
  403. lock(thread_list_lock);
  404. debug("walk_thread_list(callback=%p)\n", callback);
  405. listp_for_each_entry_safe(tmp, n, &thread_list, list) {
  406. if (tmp->tid <= min_tid)
  407. continue;
  408. bool unlocked = false;
  409. ret = (*callback) (tmp, arg, &unlocked);
  410. if (ret < 0 && ret != -ESRCH) {
  411. if (unlocked)
  412. goto out;
  413. else
  414. goto out_locked;
  415. }
  416. if (ret > 0)
  417. srched = true;
  418. if (unlocked) {
  419. min_tid = tmp->tid;
  420. goto relock;
  421. }
  422. }
  423. ret = srched ? 0 : -ESRCH;
  424. out_locked:
  425. unlock(thread_list_lock);
  426. out:
  427. return ret;
  428. }
  429. int walk_simple_thread_list (int (*callback) (struct shim_simple_thread *,
  430. void *, bool *),
  431. void * arg, bool may_write)
  432. {
  433. struct shim_simple_thread * tmp, * n;
  434. bool srched = false;
  435. int ret;
  436. IDTYPE min_tid = 0;
  437. relock:
  438. lock(thread_list_lock);
  439. listp_for_each_entry_safe(tmp, n, &simple_thread_list, list) {
  440. if (tmp->tid <= min_tid)
  441. continue;
  442. bool unlocked = false;
  443. ret = (*callback) (tmp, arg, &unlocked);
  444. if (ret < 0 && ret != -ESRCH) {
  445. if (unlocked)
  446. goto out;
  447. else
  448. goto out_locked;
  449. }
  450. if (ret > 0)
  451. srched = true;
  452. if (unlocked) {
  453. min_tid = tmp->tid;
  454. goto relock;
  455. }
  456. }
  457. ret = srched ? 0 : -ESRCH;
  458. out_locked:
  459. unlock(thread_list_lock);
  460. out:
  461. return ret;
  462. }
  463. void switch_dummy_thread (struct shim_thread * thread)
  464. {
  465. struct shim_thread * real_thread = thread->dummy;
  466. IDTYPE child = thread->tid;
  467. assert(thread->frameptr);
  468. assert(real_thread->stack);
  469. assert(real_thread->stack_top > real_thread->stack);
  470. memcpy(thread->frameptr, real_thread->stack,
  471. real_thread->stack_top - real_thread->stack);
  472. real_thread->stack = thread->stack;
  473. real_thread->stack_top = thread->stack_top;
  474. real_thread->frameptr = thread->frameptr;
  475. DkSegmentRegister(PAL_SEGMENT_FS, real_thread->tcb);
  476. set_cur_thread(real_thread);
  477. debug("set tcb to %p\n", real_thread->tcb);
  478. debug("jump to the stack %p\n", real_thread->frameptr);
  479. debug("shim_vfork success (returning %d)\n", child);
  480. /* jump onto old stack
  481. we actually pop rbp as rsp, and later we will call 'ret' */
  482. asm volatile("movq %0, %%rbp\r\n"
  483. "leaveq\r\n"
  484. "retq\r\n" :
  485. : "g"(real_thread->frameptr),
  486. "a"(child)
  487. : "memory");
  488. }
  489. BEGIN_CP_FUNC(thread)
  490. {
  491. assert(size == sizeof(struct shim_thread));
  492. struct shim_thread * thread = (struct shim_thread *) obj;
  493. struct shim_thread * new_thread = NULL;
  494. ptr_t off = GET_FROM_CP_MAP(obj);
  495. if (!off) {
  496. off = ADD_CP_OFFSET(sizeof(struct shim_thread));
  497. ADD_TO_CP_MAP(obj, off);
  498. new_thread = (struct shim_thread *) (base + off);
  499. memcpy(new_thread, thread, sizeof(struct shim_thread));
  500. INIT_LISTP(&new_thread->children);
  501. INIT_LIST_HEAD(new_thread, siblings);
  502. INIT_LISTP(&new_thread->exited_children);
  503. INIT_LIST_HEAD(new_thread, list);
  504. new_thread->in_vm = false;
  505. new_thread->parent = NULL;
  506. new_thread->dummy = NULL;
  507. new_thread->handle_map = NULL;
  508. new_thread->root = NULL;
  509. new_thread->cwd = NULL;
  510. new_thread->signal_logs = NULL;
  511. new_thread->robust_list = NULL;
  512. REF_SET(new_thread->ref_count, 0);
  513. for (int i = 0 ; i < NUM_SIGS ; i++)
  514. if (thread->signal_handles[i].action) {
  515. ptr_t soff = ADD_CP_OFFSET(sizeof(struct __kernel_sigaction));
  516. new_thread->signal_handles[i].action
  517. = (struct __kernel_sigaction *) (base + soff);
  518. memcpy(new_thread->signal_handles[i].action,
  519. thread->signal_handles[i].action,
  520. sizeof(struct __kernel_sigaction));
  521. }
  522. DO_CP_MEMBER(handle, thread, new_thread, exec);
  523. DO_CP_MEMBER(handle_map, thread, new_thread, handle_map);
  524. DO_CP_MEMBER(dentry, thread, new_thread, root);
  525. DO_CP_MEMBER(dentry, thread, new_thread, cwd);
  526. ADD_CP_FUNC_ENTRY(off);
  527. } else {
  528. new_thread = (struct shim_thread *) (base + off);
  529. }
  530. if (objp)
  531. *objp = (void *) new_thread;
  532. }
  533. END_CP_FUNC(thread)
  534. BEGIN_RS_FUNC(thread)
  535. {
  536. struct shim_thread * thread = (void *) (base + GET_CP_FUNC_ENTRY());
  537. CP_REBASE(thread->children);
  538. CP_REBASE(thread->siblings);
  539. CP_REBASE(thread->exited_children);
  540. CP_REBASE(thread->list);
  541. CP_REBASE(thread->exec);
  542. CP_REBASE(thread->handle_map);
  543. CP_REBASE(thread->root);
  544. CP_REBASE(thread->cwd);
  545. CP_REBASE(thread->signal_handles);
  546. create_lock(thread->lock);
  547. thread->scheduler_event = DkNotificationEventCreate(PAL_TRUE);
  548. thread->exit_event = DkNotificationEventCreate(PAL_FALSE);
  549. thread->child_exit_event = DkNotificationEventCreate(PAL_FALSE);
  550. add_thread(thread);
  551. if (thread->exec)
  552. get_handle(thread->exec);
  553. if (thread->handle_map)
  554. get_handle_map(thread->handle_map);
  555. if (thread->root)
  556. get_dentry(thread->root);
  557. if (thread->cwd)
  558. get_dentry(thread->cwd);
  559. DEBUG_RS("tid=%d,tgid=%d,parent=%d,stack=%p,frameptr=%p,tcb=%p",
  560. thread->tid, thread->tgid,
  561. thread->parent ? thread->parent->tid : thread->tid,
  562. thread->stack, thread->frameptr, thread->tcb);
  563. }
  564. END_RS_FUNC(thread)
  565. BEGIN_CP_FUNC(running_thread)
  566. {
  567. assert(size == sizeof(struct shim_thread));
  568. struct shim_thread * thread = (struct shim_thread *) obj;
  569. struct shim_thread * new_thread = NULL;
  570. DO_CP(thread, thread, &new_thread);
  571. ADD_CP_FUNC_ENTRY((ptr_t) new_thread - base);
  572. if (!thread->user_tcb && thread->tcb) {
  573. ptr_t toff = ADD_CP_OFFSET(sizeof(__libc_tcb_t));
  574. new_thread->tcb = (void *) (base + toff);
  575. memcpy(new_thread->tcb, thread->tcb, sizeof(__libc_tcb_t));
  576. }
  577. }
  578. END_CP_FUNC(running_thread)
  579. int resume_wrapper (void * param)
  580. {
  581. struct shim_thread * thread = (struct shim_thread *) param;
  582. assert(thread);
  583. __libc_tcb_t * libc_tcb = (__libc_tcb_t *) thread->tcb;
  584. assert(libc_tcb);
  585. shim_tcb_t * tcb = &libc_tcb->shim_tcb;
  586. assert(tcb->context.sp);
  587. thread->in_vm = thread->is_alive = true;
  588. allocate_tls(libc_tcb, thread->user_tcb, thread);
  589. debug_setbuf(tcb, true);
  590. debug("set tcb to %p\n", libc_tcb);
  591. DkObjectsWaitAny(1, &thread_start_event, NO_TIMEOUT);
  592. restore_context(&tcb->context);
  593. return 0;
  594. }
  595. BEGIN_RS_FUNC(running_thread)
  596. {
  597. struct shim_thread * thread = (void *) (base + GET_CP_FUNC_ENTRY());
  598. struct shim_thread * cur_thread = get_cur_thread();
  599. thread->in_vm = true;
  600. if (!thread->user_tcb)
  601. CP_REBASE(thread->tcb);
  602. thread->signal_logs = malloc(sizeof(struct shim_signal_log) *
  603. NUM_SIGS);
  604. if (cur_thread) {
  605. PAL_HANDLE handle = DkThreadCreate(resume_wrapper, thread, 0);
  606. if (!thread)
  607. return -PAL_ERRNO;
  608. thread->pal_handle = handle;
  609. } else {
  610. __libc_tcb_t * libc_tcb = (__libc_tcb_t *) thread->tcb;
  611. if (libc_tcb) {
  612. shim_tcb_t * tcb = &libc_tcb->shim_tcb;
  613. assert(tcb->context.sp);
  614. tcb->debug_buf = SHIM_GET_TLS()->debug_buf;
  615. allocate_tls(libc_tcb, thread->user_tcb, thread);
  616. debug_setprefix(tcb);
  617. debug("after resume, set tcb to %p\n", libc_tcb);
  618. } else {
  619. set_cur_thread(thread);
  620. }
  621. thread->in_vm = thread->is_alive = true;
  622. thread->pal_handle = PAL_CB(first_thread);
  623. }
  624. DEBUG_RS("tid=%d", thread->tid);
  625. }
  626. END_RS_FUNC(running_thread)
  627. BEGIN_CP_FUNC(all_running_threads)
  628. {
  629. struct shim_thread * thread;
  630. lock(thread_list_lock);
  631. listp_for_each_entry(thread, &thread_list, list) {
  632. if (!thread->in_vm || !thread->is_alive)
  633. continue;
  634. DO_CP(running_thread, thread, NULL);
  635. DO_CP(handle_map, thread->handle_map, NULL);
  636. }
  637. unlock(thread_list_lock);
  638. }
  639. END_CP_FUNC_NO_RS(all_running_threads)