shim_epoll.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  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_epoll.c
  17. *
  18. * Implementation of system call "epoll_create", "epoll_create1", "epoll_ctl"
  19. * and "epoll_wait".
  20. */
  21. #include <shim_internal.h>
  22. #include <shim_table.h>
  23. #include <shim_thread.h>
  24. #include <shim_handle.h>
  25. #include <shim_fs.h>
  26. #include <shim_checkpoint.h>
  27. #include <pal.h>
  28. #include <pal_error.h>
  29. #include <errno.h>
  30. #include <linux/eventpoll.h>
  31. #define EPOLLIN 0x001
  32. #define EPOLLPRI 0x002
  33. #define EPOLLOUT 0x004
  34. #define EPOLLRDNORM 0x040
  35. #define EPOLLRDBAND 0x080
  36. #define EPOLLWRNORM 0x100
  37. #define EPOLLERBAND 0x200
  38. #define EPOLLERR 0x008
  39. #define EPOLLHUP 0x010
  40. #define EPOLLRDHUP 0x2000
  41. #define MAX_EPOLL_FDS 1024
  42. struct shim_mount epoll_builtin_fs;
  43. struct shim_epoll_fd {
  44. FDTYPE fd;
  45. unsigned int events;
  46. __u64 data;
  47. unsigned int revents;
  48. struct shim_handle * handle;
  49. struct shim_handle * epoll;
  50. PAL_HANDLE pal_handle;
  51. struct list_head list;
  52. struct list_head back;
  53. };
  54. int shim_do_epoll_create1 (int flags)
  55. {
  56. if ((flags & ~EPOLL_CLOEXEC))
  57. return -EINVAL;
  58. struct shim_handle * hdl = get_new_handle();
  59. if (!hdl)
  60. return -ENOMEM;
  61. struct shim_epoll_handle * epoll = &hdl->info.epoll;
  62. hdl->type = TYPE_EPOLL;
  63. set_handle_fs(hdl, &epoll_builtin_fs);
  64. epoll->maxfds = MAX_EPOLL_FDS;
  65. epoll->nfds = 0;
  66. epoll->pal_fds = malloc(sizeof(FDTYPE) * MAX_EPOLL_FDS);
  67. epoll->pal_handles = malloc(sizeof(PAL_HANDLE) * MAX_EPOLL_FDS);
  68. create_event(&epoll->event);
  69. INIT_LIST_HEAD(&epoll->fds);
  70. int vfd = set_new_fd_handle(hdl, (flags & EPOLL_CLOEXEC) ? FD_CLOEXEC : 0,
  71. NULL);
  72. put_handle(hdl);
  73. return vfd;
  74. }
  75. /* the 'size' argument of epoll_create is not used */
  76. int shim_do_epoll_create (int size)
  77. {
  78. if (size < 0)
  79. return -EINVAL;
  80. return shim_do_epoll_create1(0);
  81. }
  82. static void update_epoll (struct shim_epoll_handle * epoll)
  83. {
  84. struct shim_epoll_fd * tmp;
  85. int npals = 0;
  86. epoll->nread = 0;
  87. debug("update pal handles of epoll handle %p\n", epoll);
  88. list_for_each_entry(tmp, &epoll->fds, list) {
  89. if (!tmp->pal_handle)
  90. continue;
  91. debug("found handle %p (pal handle %p) from epoll handle %p\n",
  92. tmp->handle, tmp->pal_handle, epoll);
  93. epoll->pal_fds[npals] = tmp->fd;
  94. epoll->pal_handles[npals] = tmp->pal_handle;
  95. npals++;
  96. if (tmp->handle->acc_mode & MAY_READ)
  97. epoll->nread++;
  98. }
  99. epoll->npals = npals;
  100. if (epoll->nwaiters)
  101. set_event(&epoll->event, epoll->nwaiters);
  102. }
  103. int delete_from_epoll_handles (struct shim_handle * handle)
  104. {
  105. while (1) {
  106. lock(handle->lock);
  107. if (list_empty(&handle->epolls)) {
  108. unlock(handle->lock);
  109. break;
  110. }
  111. struct shim_epoll_fd * epoll_fd = list_first_entry(&handle->epolls,
  112. struct shim_epoll_fd, back);
  113. list_del(&epoll_fd->back);
  114. unlock(handle->lock);
  115. put_handle(handle);
  116. struct shim_handle * epoll_hdl = epoll_fd->epoll;
  117. debug("delete handle %p from epoll handle %p\n", handle,
  118. &epoll_hdl->info.epoll);
  119. lock(epoll_hdl->lock);
  120. list_del(&epoll_fd->list);
  121. free(epoll_fd);
  122. epoll_hdl->info.epoll.nfds--;
  123. update_epoll(&epoll_hdl->info.epoll);
  124. unlock(epoll_hdl->lock);
  125. put_handle(epoll_hdl);
  126. }
  127. return 0;
  128. }
  129. int shim_do_epoll_ctl (int epfd, int op, int fd,
  130. struct __kernel_epoll_event * event)
  131. {
  132. struct shim_thread * cur = get_cur_thread();
  133. int ret = 0;
  134. struct shim_handle * epoll_hdl = get_fd_handle(epfd, NULL, cur->handle_map);
  135. if (!epoll_hdl)
  136. return -EBADF;
  137. if (epoll_hdl->type != TYPE_EPOLL) {
  138. put_handle(epoll_hdl);
  139. return -EINVAL;
  140. }
  141. struct shim_epoll_handle * epoll = &epoll_hdl->info.epoll;
  142. struct shim_epoll_fd * epoll_fd;
  143. lock(epoll_hdl->lock);
  144. switch (op) {
  145. case EPOLL_CTL_ADD: {
  146. list_for_each_entry(epoll_fd, &epoll->fds, list)
  147. if (epoll_fd->fd == fd) {
  148. ret = -EEXIST;
  149. goto out;
  150. }
  151. struct shim_handle * hdl = get_fd_handle(fd, NULL, cur->handle_map);
  152. if (!hdl) {
  153. ret = -EBADF;
  154. goto out;
  155. }
  156. if ((hdl->type != TYPE_PIPE && hdl->type != TYPE_SOCK) ||
  157. !hdl->pal_handle) {
  158. ret = -EPERM;
  159. put_handle(hdl);
  160. goto out;
  161. }
  162. if (epoll->nfds == MAX_EPOLL_FDS) {
  163. ret = -ENOSPC;
  164. put_handle(hdl);
  165. goto out;
  166. }
  167. debug("add handle %p to epoll handle %p\n", hdl, epoll);
  168. epoll_fd = malloc(sizeof(struct shim_epoll_fd));
  169. epoll_fd->fd = fd;
  170. epoll_fd->events = event->events;
  171. epoll_fd->data = event->data;
  172. epoll_fd->revents = 0;
  173. epoll_fd->handle = hdl;
  174. epoll_fd->epoll = epoll_hdl;
  175. epoll_fd->pal_handle = hdl->pal_handle;
  176. lock(hdl->lock);
  177. INIT_LIST_HEAD(&epoll_fd->back);
  178. list_add_tail(&epoll_fd->back, &hdl->epolls);
  179. unlock(hdl->lock);
  180. get_handle(epoll_hdl);
  181. INIT_LIST_HEAD(&epoll_fd->list);
  182. list_add_tail(&epoll_fd->list, &epoll->fds);
  183. epoll->nfds++;
  184. goto update;
  185. }
  186. case EPOLL_CTL_MOD: {
  187. list_for_each_entry(epoll_fd, &epoll->fds, list)
  188. if (epoll_fd->fd == fd) {
  189. epoll_fd->events = event->events;
  190. epoll_fd->data = event->data;
  191. goto update;
  192. }
  193. ret = -ENOENT;
  194. goto out;
  195. }
  196. case EPOLL_CTL_DEL: {
  197. list_for_each_entry(epoll_fd, &epoll->fds, list)
  198. if (epoll_fd->fd == fd) {
  199. struct shim_handle * hdl = epoll_fd->handle;
  200. lock(hdl->lock);
  201. list_del(&epoll_fd->back);
  202. put_handle(hdl);
  203. unlock(hdl->lock);
  204. debug("delete handle %p from epoll handle %p\n",
  205. hdl, epoll);
  206. list_del(&epoll_fd->list);
  207. put_handle(epoll_hdl);
  208. epoll->nfds--;
  209. free(epoll_fd);
  210. goto update;
  211. }
  212. ret = -ENOENT;
  213. goto out;
  214. }
  215. default:
  216. ret = -ENOSYS;
  217. goto out;
  218. }
  219. update:
  220. update_epoll(epoll);
  221. out:
  222. unlock(epoll_hdl->lock);
  223. put_handle(epoll_hdl);
  224. return ret;
  225. }
  226. int shim_do_epoll_wait (int epfd, struct __kernel_epoll_event * events,
  227. int maxevents, int timeout)
  228. {
  229. int ret = 0;
  230. struct shim_handle * epoll_hdl = get_fd_handle(epfd, NULL, NULL);
  231. if (!epoll_hdl)
  232. return -EBADF;
  233. if (epoll_hdl->type != TYPE_EPOLL) {
  234. put_handle(epoll_hdl);
  235. return -EINVAL;
  236. }
  237. struct shim_epoll_handle * epoll = &epoll_hdl->info.epoll;
  238. struct shim_epoll_fd * epoll_fd;
  239. int nevents = 0;
  240. int npals, nread;
  241. bool need_update = false;
  242. lock(epoll_hdl->lock);
  243. retry:
  244. if (!(npals = epoll->npals))
  245. goto reply;
  246. PAL_HANDLE * pal_handles = __alloca(sizeof(PAL_HANDLE) * (npals + 1));
  247. FDTYPE * fds = __alloca(sizeof(FDTYPE) * npals);
  248. memcpy(fds, epoll->pal_fds, sizeof(FDTYPE) * npals);
  249. memcpy(pal_handles, epoll->pal_handles, sizeof(PAL_HANDLE) * npals);
  250. pal_handles[npals] = epoll->event.event;
  251. if ((nread = epoll->nread))
  252. epoll->nwaiters++;
  253. unlock(epoll_hdl->lock);
  254. PAL_HANDLE polled = DkObjectsWaitAny(nread ? npals + 1 : npals, pal_handles,
  255. nread ? NO_TIMEOUT : 0);
  256. lock(epoll_hdl->lock);
  257. if (nread)
  258. epoll->nwaiters--;
  259. if (!polled)
  260. goto reply;
  261. if (polled == epoll->event.event) {
  262. wait_event(&epoll->event);
  263. goto retry;
  264. }
  265. PAL_STREAM_ATTR attr;
  266. if (!DkStreamAttributesQuerybyHandle(polled, &attr))
  267. goto reply;
  268. list_for_each_entry(epoll_fd, &epoll->fds, list)
  269. if (polled == epoll_fd->pal_handle) {
  270. debug("epoll: fd %d (handle %p) polled\n", epoll_fd->fd,
  271. epoll_fd->handle);
  272. if (attr.disconnected) {
  273. epoll_fd->revents |= EPOLLERR|EPOLLHUP|EPOLLRDHUP;
  274. epoll_fd->pal_handle = NULL;
  275. need_update = true;
  276. }
  277. if (attr.readable)
  278. epoll_fd->revents |= EPOLLIN;
  279. if (attr.writeable)
  280. epoll_fd->revents |= EPOLLOUT;
  281. break;
  282. }
  283. reply:
  284. list_for_each_entry(epoll_fd, &epoll->fds, list) {
  285. if (nevents == maxevents)
  286. break;
  287. if ((epoll_fd->events|EPOLLERR|EPOLLHUP) & epoll_fd->revents) {
  288. events[nevents].events =
  289. (epoll_fd->events|EPOLLERR|EPOLLHUP) & epoll_fd->revents;
  290. events[nevents].data = epoll_fd->data;
  291. nevents++;
  292. epoll_fd->revents &= ~epoll_fd->events;
  293. }
  294. }
  295. if (need_update)
  296. update_epoll(epoll);
  297. unlock(epoll_hdl->lock);
  298. ret = nevents;
  299. put_handle(epoll_hdl);
  300. return ret;
  301. }
  302. int shim_do_epoll_pwait (int epfd, struct __kernel_epoll_event * events,
  303. int maxevents, int timeout, const __sigset_t * sigmask,
  304. size_t sigsetsize)
  305. {
  306. int ret = shim_do_epoll_wait (epfd, events, maxevents, timeout);
  307. return ret;
  308. }
  309. static int epoll_close (struct shim_handle * hdl)
  310. {
  311. return 0;
  312. }
  313. struct shim_fs_ops epoll_fs_ops = {
  314. .close = &epoll_close,
  315. };
  316. struct shim_mount epoll_builtin_fs = { .type = "epoll",
  317. .fs_ops = &epoll_fs_ops, };
  318. BEGIN_CP_FUNC(epoll_fd)
  319. {
  320. assert(size == sizeof(struct list_head));
  321. struct list_head * old_list = (struct list_head *) obj;
  322. struct list_head * new_list = (struct list_head *) objp;
  323. struct shim_epoll_fd * epoll_fd;
  324. debug("checkpoint epoll: %p -> %p (base = %p)\n", old_list, new_list, base);
  325. INIT_LIST_HEAD(new_list);
  326. list_for_each_entry(epoll_fd, old_list, list) {
  327. ptr_t off = ADD_CP_OFFSET(sizeof(struct shim_epoll_fd));
  328. struct shim_epoll_fd * new_epoll_fd =
  329. (struct shim_epoll_fd *) (base + off);
  330. new_epoll_fd->fd = epoll_fd->fd;
  331. new_epoll_fd->events = epoll_fd->events;
  332. new_epoll_fd->data = epoll_fd->data;
  333. new_epoll_fd->revents = epoll_fd->revents;
  334. new_epoll_fd->pal_handle = NULL;
  335. list_add(new_list, &new_epoll_fd->list);
  336. INIT_LIST_HEAD(&new_epoll_fd->back);
  337. DO_CP(handle, epoll_fd->handle, &new_epoll_fd->handle);
  338. }
  339. ADD_CP_FUNC_ENTRY((ptr_t) objp - base);
  340. }
  341. END_CP_FUNC(epoll_fd)
  342. BEGIN_RS_FUNC(epoll_fd)
  343. {
  344. struct list_head * list = (void *) (base + GET_CP_FUNC_ENTRY());
  345. struct list_head * e;
  346. CP_REBASE(*list);
  347. for (e = list->next ; e != list ; e = e->next) {
  348. struct shim_epoll_fd * epoll_fd =
  349. list_entry(e, struct shim_epoll_fd, list);
  350. CP_REBASE(epoll_fd->handle);
  351. CP_REBASE(epoll_fd->back);
  352. epoll_fd->pal_handle = epoll_fd->handle->pal_handle;
  353. list_add_tail(&epoll_fd->back, &epoll_fd->handle->epolls);
  354. CP_REBASE(*e);
  355. DEBUG_RS("fd=%d,path=%s,type=%s,uri=%s",
  356. epoll_fd->fd, qstrgetstr(&epoll_fd->handle->path),
  357. epoll_fd->handle->fs_type,
  358. qstrgetstr(&epoll_fd->handle->uri));
  359. }
  360. }
  361. END_RS_FUNC(epoll_fd)