shim_futex.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  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 ||
  77. futex_op == FUTEX_CMP_REQUEUE ||
  78. futex_op == FUTEX_REQUEUE) {
  79. list_for_each_entry(tmp, &futex_list, list)
  80. if (tmp->uaddr == uaddr2) {
  81. futex2 = tmp;
  82. break;
  83. }
  84. if (futex2) {
  85. hdl2 = container_of(futex2, struct shim_handle, info.futex);
  86. get_handle(hdl2);
  87. } else {
  88. if (!(hdl2 = get_new_handle())) {
  89. unlock(futex_list_lock);
  90. return -ENOMEM;
  91. }
  92. hdl2->type = TYPE_FUTEX;
  93. futex2 = &hdl2->info.futex;
  94. futex2->uaddr = uaddr2;
  95. get_handle(hdl2);
  96. INIT_LIST_HEAD(&futex2->waiters);
  97. INIT_LIST_HEAD(&futex2->list);
  98. list_add_tail(&futex2->list, &futex_list);
  99. }
  100. val2 = (uint32_t)(uint64_t) utime;
  101. }
  102. unlock(futex_list_lock);
  103. lock(hdl->lock);
  104. uint64_t timeout_us = NO_TIMEOUT;
  105. switch (futex_op) {
  106. case FUTEX_WAIT_BITSET:
  107. if (utime && timeout_us == NO_TIMEOUT) {
  108. struct timespec *ts = (struct timespec*) utime;
  109. // Round to microsecs
  110. timeout_us = (ts->tv_sec * 1000000) + (ts->tv_nsec / 1000);
  111. // Check for the CLOCK_REALTIME flag
  112. if (futex_op == FUTEX_WAIT_BITSET) {
  113. // DEP 1/28/17: Should really differentiate clocks, but
  114. // Graphene only has one for now.
  115. //&& 0 != (op & FUTEX_CLOCK_REALTIME)) {
  116. uint64_t current_time = DkSystemTimeQuery();
  117. if (current_time == 0) {
  118. ret = -EINVAL;
  119. break;
  120. }
  121. timeout_us -= current_time;
  122. }
  123. }
  124. /* Note: for FUTEX_WAIT, timeout is interpreted as a relative
  125. * value. This differs from other futex operations, where
  126. * timeout is interpreted as an absolute value. To obtain the
  127. * equivalent of FUTEX_WAIT with an absolute timeout, employ
  128. * FUTEX_WAIT_BITSET with val3 specified as
  129. * FUTEX_BITSET_MATCH_ANY. */
  130. case FUTEX_WAIT:
  131. if (utime && timeout_us == NO_TIMEOUT) {
  132. struct timespec *ts = (struct timespec*) utime;
  133. // Round to microsecs
  134. timeout_us = (ts->tv_sec * 1000000) + (ts->tv_nsec / 1000);
  135. }
  136. {
  137. uint32_t bitset = (futex_op == FUTEX_WAIT_BITSET) ? val3 :
  138. 0xffffffff;
  139. debug("FUTEX_WAIT: %p (val = %d) vs %d mask = %08x, timeout ptr %p\n",
  140. uaddr, *uaddr, val, bitset, utime);
  141. if (*uaddr != val) {
  142. ret = -EAGAIN;
  143. break;
  144. }
  145. struct futex_waiter waiter;
  146. thread_setwait(&waiter.thread, NULL);
  147. INIT_LIST_HEAD(&waiter.list);
  148. waiter.bitset = bitset;
  149. list_add_tail(&waiter.list, &futex->waiters);
  150. unlock(hdl->lock);
  151. ret = thread_sleep(timeout_us);
  152. /* DEP 1/28/17: Should return ETIMEDOUT, not EAGAIN, on timeout. */
  153. if (ret == -EAGAIN)
  154. ret = -ETIMEDOUT;
  155. lock(hdl->lock);
  156. if (!list_empty(&waiter.list))
  157. list_del(&waiter.list);
  158. break;
  159. }
  160. case FUTEX_WAKE:
  161. case FUTEX_WAKE_BITSET: {
  162. struct futex_waiter * waiter;
  163. int nwaken = 0;
  164. uint32_t bitset = (futex_op == FUTEX_WAKE_BITSET) ? val3 :
  165. 0xffffffff;
  166. debug("FUTEX_WAKE: %p (val = %d) count = %d mask = %08x\n",
  167. uaddr, *uaddr, val, bitset);
  168. list_for_each_entry(waiter, &futex->waiters, list) {
  169. if (!(bitset & waiter->bitset))
  170. continue;
  171. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  172. waiter->thread->tid, uaddr, *uaddr);
  173. list_del_init(&waiter->list);
  174. thread_wakeup(waiter->thread);
  175. nwaken++;
  176. if (nwaken >= val) break;
  177. }
  178. ret = nwaken;
  179. debug("FUTEX_WAKE done: %p (val = %d) woke %d threads\n", uaddr, *uaddr, ret);
  180. break;
  181. }
  182. case FUTEX_WAKE_OP: {
  183. assert(futex2);
  184. int oldval = *(int *) uaddr2, newval, cmpval;
  185. newval = (val3 >> 12) & 0xfff;
  186. switch ((val3 >> 28) & 0xf) {
  187. case FUTEX_OP_SET: break;
  188. case FUTEX_OP_ADD: newval = oldval + newval; break;
  189. case FUTEX_OP_OR: newval = oldval | newval; break;
  190. case FUTEX_OP_ANDN: newval = oldval & ~newval; break;
  191. case FUTEX_OP_XOR: newval = oldval ^ newval; break;
  192. }
  193. cmpval = val3 & 0xfff;
  194. switch ((val3 >> 24) & 0xf) {
  195. case FUTEX_OP_CMP_EQ: cmpval = (oldval == cmpval); break;
  196. case FUTEX_OP_CMP_NE: cmpval = (oldval != cmpval); break;
  197. case FUTEX_OP_CMP_LT: cmpval = (oldval < cmpval); break;
  198. case FUTEX_OP_CMP_LE: cmpval = (oldval <= cmpval); break;
  199. case FUTEX_OP_CMP_GT: cmpval = (oldval > cmpval); break;
  200. case FUTEX_OP_CMP_GE: cmpval = (oldval >= cmpval); break;
  201. }
  202. *(int *) uaddr2 = newval;
  203. int cnt, nwaken = 0;
  204. debug("FUTEX_WAKE: %p (val = %d) count = %d\n", uaddr, *uaddr, val);
  205. for (cnt = 0 ; cnt < val ; cnt++) {
  206. if (list_empty(&futex->waiters))
  207. break;
  208. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  209. struct futex_waiter,
  210. list);
  211. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  212. waiter->thread->tid, uaddr, *uaddr);
  213. list_del_init(&waiter->list);
  214. thread_wakeup(waiter->thread);
  215. nwaken++;
  216. }
  217. if (cmpval) {
  218. unlock(hdl->lock);
  219. put_handle(hdl);
  220. hdl = hdl2;
  221. lock(hdl->lock);
  222. debug("FUTEX_WAKE: %p (val = %d) count = %d\n", uaddr2,
  223. *uaddr2, val2);
  224. for (cnt = 0 ; cnt < val2 ; cnt++) {
  225. if (list_empty(&futex2->waiters))
  226. break;
  227. struct futex_waiter * waiter = list_entry(futex2->waiters.next,
  228. struct futex_waiter,
  229. list);
  230. debug("FUTEX_WAKE wake thread %d: %p (val = %d)\n",
  231. waiter->thread->tid, uaddr2, *uaddr2);
  232. list_del_init(&waiter->list);
  233. thread_wakeup(waiter->thread);
  234. nwaken++;
  235. }
  236. }
  237. ret = nwaken;
  238. break;
  239. }
  240. case FUTEX_CMP_REQUEUE:
  241. if (*uaddr != val3) {
  242. ret = -EAGAIN;
  243. break;
  244. }
  245. case FUTEX_REQUEUE: {
  246. assert(futex2);
  247. int cnt;
  248. for (cnt = 0 ; cnt < val ; cnt++) {
  249. if (list_empty(&futex->waiters))
  250. break;
  251. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  252. struct futex_waiter,
  253. list);
  254. list_del_init(&waiter->list);
  255. thread_wakeup(waiter->thread);
  256. }
  257. lock(hdl2->lock);
  258. list_splice_init(&futex->waiters, &futex2->waiters);
  259. unlock(hdl2->lock);
  260. put_handle(hdl2);
  261. ret = cnt;
  262. break;
  263. }
  264. case FUTEX_FD:
  265. ret = set_new_fd_handle(hdl, 0, NULL);
  266. break;
  267. default:
  268. debug("unsupported futex op: 0x%x\n", op);
  269. ret = -ENOSYS;
  270. break;
  271. }
  272. unlock(hdl->lock);
  273. put_handle(hdl);
  274. return ret;
  275. }
  276. int shim_do_set_robust_list (struct robust_list_head * head, size_t len)
  277. {
  278. struct shim_thread * self = get_cur_thread();
  279. assert(self);
  280. if (len != sizeof(struct robust_list_head))
  281. return -EINVAL;
  282. self->robust_list = head;
  283. return 0;
  284. }
  285. int shim_do_get_robust_list (pid_t pid, struct robust_list_head ** head,
  286. size_t * len)
  287. {
  288. if (!head)
  289. return -EFAULT;
  290. struct shim_thread * thread;
  291. if (pid) {
  292. thread = lookup_thread(pid);
  293. if (!thread)
  294. return -ESRCH;
  295. } else {
  296. thread = get_cur_thread();
  297. }
  298. *head = (struct robust_list_head *) thread->robust_list;
  299. *len = sizeof(struct robust_list_head);
  300. return 0;
  301. }
  302. void release_robust_list (struct robust_list_head * head)
  303. {
  304. long futex_offset = head->futex_offset;
  305. struct robust_list * robust, * prev = &head->list;
  306. create_lock_runtime(&futex_list_lock);
  307. for (robust = prev->next ; robust && robust != prev ;
  308. prev = robust, robust = robust->next) {
  309. void * futex_addr = (void *) robust + futex_offset;
  310. struct shim_futex_handle * tmp, * futex = NULL;
  311. lock(futex_list_lock);
  312. list_for_each_entry(tmp, &futex_list, list)
  313. if (tmp->uaddr == futex_addr) {
  314. futex = tmp;
  315. break;
  316. }
  317. unlock(futex_list_lock);
  318. if (!futex)
  319. continue;
  320. struct shim_handle * hdl =
  321. container_of(futex, struct shim_handle, info.futex);
  322. get_handle(hdl);
  323. lock(hdl->lock);
  324. debug("release robust list: %p\n", futex_addr);
  325. *(int *) futex_addr = 0;
  326. while (!list_empty(&futex->waiters)) {
  327. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  328. struct futex_waiter,
  329. list);
  330. list_del_init(&waiter->list);
  331. thread_wakeup(waiter->thread);
  332. }
  333. unlock(hdl->lock);
  334. put_handle(hdl);
  335. }
  336. }
  337. void release_clear_child_id (int * clear_child_tid)
  338. {
  339. debug("clear child tid at %p\n", clear_child_tid);
  340. *clear_child_tid = 0;
  341. create_lock_runtime(&futex_list_lock);
  342. struct shim_futex_handle * tmp, * futex = NULL;
  343. lock(futex_list_lock);
  344. list_for_each_entry(tmp, &futex_list, list)
  345. if (tmp->uaddr == (void *) clear_child_tid) {
  346. futex = tmp;
  347. break;
  348. }
  349. unlock(futex_list_lock);
  350. if (!futex)
  351. return;
  352. struct shim_handle * hdl =
  353. container_of(futex, struct shim_handle, info.futex);
  354. get_handle(hdl);
  355. lock(hdl->lock);
  356. debug("release futex at %p\n", clear_child_tid);
  357. *clear_child_tid = 0;
  358. while (!list_empty(&futex->waiters)) {
  359. struct futex_waiter * waiter = list_entry(futex->waiters.next,
  360. struct futex_waiter,
  361. list);
  362. list_del_init(&waiter->list);
  363. thread_wakeup(waiter->thread);
  364. }
  365. unlock(hdl->lock);
  366. put_handle(hdl);
  367. }