shim_futex.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410
  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 OSCAR lab, 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 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 General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_futex.c
  17. *
  18. * Implementation of system call "futex", "set_robust_list" and
  19. * "get_robust_list".
  20. */
  21. #include <shim_internal.h>
  22. #include <shim_table.h>
  23. #include <shim_thread.h>
  24. #include <shim_checkpoint.h>
  25. #include <shim_utils.h>
  26. #include <pal.h>
  27. #include <pal_error.h>
  28. #include <linux_list.h>
  29. #include <sys/syscall.h>
  30. #include <sys/mman.h>
  31. #include <asm/prctl.h>
  32. #include <linux/futex.h>
  33. #include <errno.h>
  34. #define FUTEX_MIN_VALUE 0
  35. #define FUTEX_MAX_VALUE 255
  36. struct futex_waiter {
  37. struct shim_thread * thread;
  38. uint32_t bitset;
  39. struct list_head list;
  40. };
  41. static LIST_HEAD(futex_list);
  42. static LOCKTYPE futex_list_lock;
  43. int shim_do_futex (unsigned int * uaddr, int op, int val, void * utime,
  44. unsigned int * uaddr2, int val3)
  45. {
  46. struct shim_futex_handle * tmp = NULL, * futex = NULL, * futex2 = NULL;
  47. struct shim_handle * hdl = NULL, * hdl2 = NULL;
  48. uint32_t futex_op = (op & FUTEX_CMD_MASK);
  49. uint32_t val2 = 0;
  50. int ret = 0;
  51. if (!uaddr || ((uintptr_t) uaddr % sizeof(unsigned int)))
  52. return -EINVAL;
  53. create_lock_runtime(&futex_list_lock);
  54. lock(futex_list_lock);
  55. list_for_each_entry(tmp, &futex_list, list)
  56. if (tmp->uaddr == uaddr) {
  57. futex = tmp;
  58. break;
  59. }
  60. if (futex) {
  61. hdl = container_of(futex, struct shim_handle, info.futex);
  62. get_handle(hdl);
  63. } else {
  64. if (!(hdl = get_new_handle())) {
  65. unlock(futex_list_lock);
  66. return -ENOMEM;
  67. }
  68. hdl->type = TYPE_FUTEX;
  69. futex = &hdl->info.futex;
  70. futex->uaddr = uaddr;
  71. get_handle(hdl);
  72. INIT_LIST_HEAD(&futex->waiters);
  73. INIT_LIST_HEAD(&futex->list);
  74. list_add_tail(&futex->list, &futex_list);
  75. }
  76. if (futex_op == FUTEX_WAKE_OP || futex_op == FUTEX_REQUEUE) {
  77. list_for_each_entry(tmp, &futex_list, list)
  78. if (tmp->uaddr == uaddr2) {
  79. futex2 = tmp;
  80. break;
  81. }
  82. if (futex2) {
  83. hdl2 = container_of(futex2, struct shim_handle, info.futex);
  84. get_handle(hdl2);
  85. } else {
  86. if (!(hdl2 = get_new_handle())) {
  87. unlock(futex_list_lock);
  88. return -ENOMEM;
  89. }
  90. hdl2->type = TYPE_FUTEX;
  91. futex2 = &hdl2->info.futex;
  92. futex2->uaddr = uaddr2;
  93. get_handle(hdl2);
  94. INIT_LIST_HEAD(&futex2->waiters);
  95. INIT_LIST_HEAD(&futex2->list);
  96. list_add_tail(&futex2->list, &futex_list);
  97. }
  98. val2 = (uint32_t)(uint64_t) utime;
  99. }
  100. unlock(futex_list_lock);
  101. lock(hdl->lock);
  102. switch (futex_op) {
  103. case FUTEX_WAIT:
  104. case FUTEX_WAIT_BITSET: {
  105. uint32_t bitset = (futex_op == FUTEX_WAIT_BITSET) ? val3 :
  106. 0xffffffff;
  107. debug("FUTEX_WAIT: %p (val = %d) vs %d mask = %08x\n",
  108. uaddr, *uaddr, val, bitset);
  109. if (*uaddr != val) {
  110. ret = -EAGAIN;
  111. break;
  112. }
  113. struct futex_waiter waiter;
  114. thread_setwait(&waiter.thread, NULL);
  115. INIT_LIST_HEAD(&waiter.list);
  116. waiter.bitset = (futex_op == FUTEX_WAIT_BITSET) ? val3 : 0xffffffff;
  117. list_add_tail(&waiter.list, &futex->waiters);
  118. unlock(hdl->lock);
  119. thread_sleep();
  120. lock(hdl->lock);
  121. break;
  122. }
  123. case FUTEX_WAKE:
  124. case FUTEX_WAKE_BITSET: {
  125. uint32_t bitset = (futex_op == FUTEX_WAKE_BITSET) ? val3 :
  126. 0xffffffff;
  127. debug("FUTEX_WAKE: %p (val = %d) count = %d mask = %08x\n",
  128. uaddr, *uaddr, val, bitset);
  129. int cnt, nwaken = 0;
  130. for (cnt = 0 ; cnt < val ; cnt++) {
  131. if (list_empty(&futex->waiters))
  132. break;
  133. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  134. struct futex_waiter,
  135. list);
  136. if (!(bitset & waiter->bitset))
  137. continue;
  138. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  139. waiter->thread->tid, uaddr, *uaddr);
  140. list_del(&waiter->list);
  141. thread_wakeup(waiter->thread);
  142. nwaken++;
  143. }
  144. ret = nwaken;
  145. debug("FUTEX_WAKE done: %p (val = %d)\n", uaddr, *uaddr);
  146. break;
  147. }
  148. case FUTEX_WAKE_OP: {
  149. assert(futex2);
  150. int oldval = *(int *) uaddr2, newval, cmpval;
  151. newval = (val3 >> 12) & 0xfff;
  152. switch ((val3 >> 28) & 0xf) {
  153. case FUTEX_OP_SET: break;
  154. case FUTEX_OP_ADD: newval = oldval + newval; break;
  155. case FUTEX_OP_OR: newval = oldval | newval; break;
  156. case FUTEX_OP_ANDN: newval = oldval & ~newval; break;
  157. case FUTEX_OP_XOR: newval = oldval ^ newval; break;
  158. }
  159. cmpval = val3 & 0xfff;
  160. switch ((val3 >> 24) & 0xf) {
  161. case FUTEX_OP_CMP_EQ: cmpval = (oldval == cmpval); break;
  162. case FUTEX_OP_CMP_NE: cmpval = (oldval != cmpval); break;
  163. case FUTEX_OP_CMP_LT: cmpval = (oldval < cmpval); break;
  164. case FUTEX_OP_CMP_LE: cmpval = (oldval <= cmpval); break;
  165. case FUTEX_OP_CMP_GT: cmpval = (oldval > cmpval); break;
  166. case FUTEX_OP_CMP_GE: cmpval = (oldval >= cmpval); break;
  167. }
  168. *(int *) uaddr2 = newval;
  169. int cnt, nwaken = 0;
  170. debug("FUTEX_WAKE: %p (val = %d) count = %d\n", uaddr, *uaddr, val);
  171. for (cnt = 0 ; cnt < val ; cnt++) {
  172. if (list_empty(&futex->waiters))
  173. break;
  174. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  175. struct futex_waiter,
  176. list);
  177. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  178. waiter->thread->tid, uaddr, *uaddr);
  179. list_del(&waiter->list);
  180. thread_wakeup(waiter->thread);
  181. nwaken++;
  182. }
  183. if (cmpval) {
  184. unlock(hdl->lock);
  185. put_handle(hdl);
  186. hdl = hdl2;
  187. lock(hdl->lock);
  188. debug("FUTEX_WAKE: %p (val = %d) count = %d\n", uaddr2,
  189. *uaddr2, val2);
  190. for (cnt = 0 ; cnt < val2 ; cnt++) {
  191. if (list_empty(&futex2->waiters))
  192. break;
  193. struct futex_waiter * waiter = list_entry(futex2->waiters.next,
  194. struct futex_waiter,
  195. list);
  196. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  197. waiter->thread->tid, uaddr2, *uaddr2);
  198. list_del(&waiter->list);
  199. thread_wakeup(waiter->thread);
  200. nwaken++;
  201. }
  202. }
  203. ret = nwaken;
  204. break;
  205. }
  206. case FUTEX_CMP_REQUEUE:
  207. if (*uaddr != val3) {
  208. ret = -EAGAIN;
  209. break;
  210. }
  211. case FUTEX_REQUEUE: {
  212. assert(futex2);
  213. int cnt;
  214. for (cnt = 0 ; cnt < val ; cnt++) {
  215. if (list_empty(&futex->waiters))
  216. break;
  217. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  218. struct futex_waiter,
  219. list);
  220. list_del(&waiter->list);
  221. thread_wakeup(waiter->thread);
  222. }
  223. lock(hdl2->lock);
  224. list_splice_init(&futex->waiters, &futex2->waiters);
  225. unlock(hdl2->lock);
  226. put_handle(hdl2);
  227. ret = cnt;
  228. break;
  229. }
  230. case FUTEX_FD:
  231. ret = set_new_fd_handle(hdl, 0, NULL);
  232. break;
  233. default:
  234. debug("unsupported futex op: 0x%x\n", op);
  235. ret = -ENOSYS;
  236. break;
  237. }
  238. unlock(hdl->lock);
  239. put_handle(hdl);
  240. return ret;
  241. }
  242. int shim_do_set_robust_list (struct robust_list_head * head, size_t len)
  243. {
  244. struct shim_thread * self = get_cur_thread();
  245. assert(self);
  246. if (len != sizeof(struct robust_list_head))
  247. return -EINVAL;
  248. self->robust_list = head;
  249. return 0;
  250. }
  251. int shim_do_get_robust_list (pid_t pid, struct robust_list_head ** head,
  252. size_t * len)
  253. {
  254. if (!head)
  255. return -EFAULT;
  256. struct shim_thread * thread;
  257. if (pid) {
  258. thread = lookup_thread(pid);
  259. if (!thread)
  260. return -ESRCH;
  261. } else {
  262. thread = get_cur_thread();
  263. }
  264. *head = (struct robust_list_head *) thread->robust_list;
  265. *len = sizeof(struct robust_list_head);
  266. return 0;
  267. }
  268. void release_robust_list (struct robust_list_head * head)
  269. {
  270. long futex_offset = head->futex_offset;
  271. struct robust_list * robust, * prev = &head->list;
  272. create_lock_runtime(&futex_list_lock);
  273. for (robust = prev->next ; robust && robust != prev ;
  274. prev = robust, robust = robust->next) {
  275. void * futex_addr = (void *) robust + futex_offset;
  276. struct shim_futex_handle * tmp, * futex = NULL;
  277. lock(futex_list_lock);
  278. list_for_each_entry(tmp, &futex_list, list)
  279. if (tmp->uaddr == futex_addr) {
  280. futex = tmp;
  281. break;
  282. }
  283. unlock(futex_list_lock);
  284. if (!futex)
  285. continue;
  286. struct shim_handle * hdl =
  287. container_of(futex, struct shim_handle, info.futex);
  288. get_handle(hdl);
  289. lock(hdl->lock);
  290. debug("release robust list: %p\n", futex_addr);
  291. *(int *) futex_addr = 0;
  292. while (!list_empty(&futex->waiters)) {
  293. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  294. struct futex_waiter,
  295. list);
  296. list_del(&waiter->list);
  297. thread_wakeup(waiter->thread);
  298. }
  299. unlock(hdl->lock);
  300. put_handle(hdl);
  301. }
  302. }
  303. void release_clear_child_id (int * clear_child_tid)
  304. {
  305. debug("clear child tid at %p\n", clear_child_tid);
  306. *clear_child_tid = 0;
  307. create_lock_runtime(&futex_list_lock);
  308. struct shim_futex_handle * tmp, * futex = NULL;
  309. lock(futex_list_lock);
  310. list_for_each_entry(tmp, &futex_list, list)
  311. if (tmp->uaddr == (void *) clear_child_tid) {
  312. futex = tmp;
  313. break;
  314. }
  315. unlock(futex_list_lock);
  316. if (!futex)
  317. return;
  318. struct shim_handle * hdl =
  319. container_of(futex, struct shim_handle, info.futex);
  320. get_handle(hdl);
  321. lock(hdl->lock);
  322. debug("release futex at %p\n", clear_child_tid);
  323. *clear_child_tid = 0;
  324. while (!list_empty(&futex->waiters)) {
  325. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  326. struct futex_waiter,
  327. list);
  328. list_del(&waiter->list);
  329. thread_wakeup(waiter->thread);
  330. }
  331. unlock(hdl->lock);
  332. put_handle(hdl);
  333. }