shim_epoll.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312
  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 <pal.h>
  27. #include <pal_error.h>
  28. #include <errno.h>
  29. #include <sys/epoll.h>
  30. #include <sys/poll.h>
  31. #define MAX_EPOLL_FDS 1024
  32. struct shim_mount epoll_builtin_fs;
  33. struct shim_epoll_fd {
  34. FDTYPE fd;
  35. unsigned int events;
  36. __u64 data;
  37. unsigned int revents;
  38. struct shim_handle * handle;
  39. PAL_HANDLE pal_handle;
  40. struct list_head list;
  41. };
  42. int shim_do_epoll_create1 (int flags)
  43. {
  44. struct shim_handle * hdl = get_new_handle();
  45. if (!hdl)
  46. return -ENOMEM;
  47. struct shim_epoll_handle * epoll = &hdl->info.epoll;
  48. hdl->type = TYPE_EPOLL;
  49. set_handle_fs(hdl, &epoll_builtin_fs);
  50. epoll->maxfds = MAX_EPOLL_FDS;
  51. epoll->nfds = 0;
  52. epoll->pal_fds = malloc(sizeof(FDTYPE) * MAX_EPOLL_FDS);
  53. epoll->pal_handles = malloc(sizeof(PAL_HANDLE) * MAX_EPOLL_FDS);
  54. create_event(&epoll->event);
  55. INIT_LIST_HEAD(&epoll->fds);
  56. int vfd = set_new_fd_handle(hdl, flags, NULL);
  57. put_handle(hdl);
  58. return vfd;
  59. }
  60. /* the 'size' argument of epoll_create is not used */
  61. int shim_do_epoll_create (int size)
  62. {
  63. return shim_do_epoll_create1(0);
  64. }
  65. static void update_epoll (struct shim_epoll_handle * epoll)
  66. {
  67. struct shim_epoll_fd * tmp;
  68. int npals = 0;
  69. epoll->nread = 0;
  70. list_for_each_entry(tmp, &epoll->fds, list) {
  71. if (!tmp->pal_handle)
  72. continue;
  73. epoll->pal_fds[npals] = tmp->fd;
  74. epoll->pal_handles[npals] = tmp->pal_handle;
  75. npals++;
  76. if (tmp->handle->acc_mode & MAY_READ)
  77. epoll->nread++;
  78. }
  79. epoll->npals = npals;
  80. if (epoll->nwaiters)
  81. set_event(&epoll->event, epoll->nwaiters);
  82. }
  83. int shim_do_epoll_ctl (int epfd, int op, int fd,
  84. struct __kernel_epoll_event * event)
  85. {
  86. struct shim_thread * cur = get_cur_thread();
  87. int ret = 0;
  88. struct shim_handle * epoll_hdl = get_fd_handle(epfd, NULL, cur->handle_map);
  89. if (!epoll_hdl)
  90. return -EBADF;
  91. if (epoll_hdl->type != TYPE_EPOLL) {
  92. put_handle(epoll_hdl);
  93. return -EINVAL;
  94. }
  95. struct shim_epoll_handle * epoll = &epoll_hdl->info.epoll;
  96. struct shim_epoll_fd * epoll_fd;
  97. lock(epoll_hdl->lock);
  98. switch (op) {
  99. case EPOLL_CTL_ADD: {
  100. list_for_each_entry(epoll_fd, &epoll->fds, list)
  101. if (epoll_fd->fd == fd) {
  102. ret = -EEXIST;
  103. goto out;
  104. }
  105. struct shim_handle * hdl = get_fd_handle(fd, NULL, cur->handle_map);
  106. if (!hdl) {
  107. ret = -EBADF;
  108. goto out;
  109. }
  110. if ((hdl->type != TYPE_PIPE && hdl->type != TYPE_SOCK) ||
  111. !hdl->pal_handle) {
  112. ret = -EPERM;
  113. put_handle(hdl);
  114. goto out;
  115. }
  116. if (epoll->nfds == MAX_EPOLL_FDS) {
  117. ret = -ENOSPC;
  118. put_handle(hdl);
  119. goto out;
  120. }
  121. epoll_fd = malloc(sizeof(struct shim_epoll_fd));
  122. epoll_fd->fd = fd;
  123. epoll_fd->events = event->events;
  124. epoll_fd->data = event->data;
  125. epoll_fd->revents = 0;
  126. epoll_fd->handle = hdl;
  127. epoll_fd->pal_handle = hdl->pal_handle;
  128. INIT_LIST_HEAD(&epoll_fd->list);
  129. list_add_tail(&epoll_fd->list, &epoll->fds);
  130. epoll->nfds++;
  131. goto update;
  132. }
  133. case EPOLL_CTL_MOD: {
  134. list_for_each_entry(epoll_fd, &epoll->fds, list)
  135. if (epoll_fd->fd == fd) {
  136. epoll_fd->events = event->events;
  137. epoll_fd->data = event->data;
  138. goto update;
  139. }
  140. ret = -ENOENT;
  141. goto out;
  142. }
  143. case EPOLL_CTL_DEL: {
  144. list_for_each_entry(epoll_fd, &epoll->fds, list)
  145. if (epoll_fd->fd == fd) {
  146. list_del(&epoll_fd->list);
  147. put_handle(epoll_fd->handle);
  148. free(epoll_fd);
  149. epoll->nfds--;
  150. goto update;
  151. }
  152. ret = -ENOENT;
  153. goto out;
  154. }
  155. default:
  156. ret = -ENOSYS;
  157. goto out;
  158. }
  159. update:
  160. update_epoll(epoll);
  161. out:
  162. unlock(epoll_hdl->lock);
  163. put_handle(epoll_hdl);
  164. return ret;
  165. }
  166. int shim_do_epoll_wait (int epfd, struct __kernel_epoll_event * events,
  167. int maxevents, int timeout)
  168. {
  169. int ret = 0;
  170. struct shim_handle * epoll_hdl = get_fd_handle(epfd, NULL, NULL);
  171. if (!epoll_hdl)
  172. return -EBADF;
  173. if (epoll_hdl->type != TYPE_EPOLL) {
  174. put_handle(epoll_hdl);
  175. return -EINVAL;
  176. }
  177. struct shim_epoll_handle * epoll = &epoll_hdl->info.epoll;
  178. struct shim_epoll_fd * epoll_fd;
  179. int nevents = 0;
  180. int npals, nread;
  181. bool need_update = false;
  182. lock(epoll_hdl->lock);
  183. retry:
  184. if (!(npals = epoll->npals))
  185. goto reply;
  186. PAL_HANDLE * pal_handles = __alloca(sizeof(PAL_HANDLE) * (npals + 1));
  187. FDTYPE * fds = __alloca(sizeof(FDTYPE) * npals);
  188. memcpy(fds, epoll->pal_fds, sizeof(FDTYPE) * npals);
  189. memcpy(pal_handles, epoll->pal_handles, sizeof(PAL_HANDLE) * npals);
  190. pal_handles[npals] = epoll->event.event;
  191. if ((nread = epoll->nread))
  192. epoll->nwaiters++;
  193. unlock(epoll_hdl->lock);
  194. PAL_HANDLE polled = DkObjectsWaitAny(nread ? npals + 1 : npals, pal_handles,
  195. nread ? NO_TIMEOUT : 0);
  196. lock(epoll_hdl->lock);
  197. if (nread)
  198. epoll->nwaiters--;
  199. if (!polled)
  200. goto reply;
  201. if (polled == epoll->event.event) {
  202. wait_event(&epoll->event);
  203. goto retry;
  204. }
  205. PAL_STREAM_ATTR attr;
  206. if (!DkStreamAttributesQuerybyHandle(polled, &attr))
  207. goto reply;
  208. list_for_each_entry(epoll_fd, &epoll->fds, list)
  209. if (polled == epoll_fd->pal_handle) {
  210. debug("epoll: fd %d polled\n", epoll_fd->fd);
  211. if (attr.disconnected) {
  212. epoll_fd->revents |= EPOLLERR|EPOLLHUP|EPOLLRDHUP;
  213. epoll_fd->pal_handle = NULL;
  214. need_update = true;
  215. }
  216. if (attr.readable)
  217. epoll_fd->revents |= EPOLLIN;
  218. if (attr.writeable)
  219. epoll_fd->revents |= EPOLLOUT;
  220. break;
  221. }
  222. reply:
  223. list_for_each_entry(epoll_fd, &epoll->fds, list) {
  224. if (nevents == maxevents)
  225. break;
  226. if ((epoll_fd->events|EPOLLERR|EPOLLHUP) & epoll_fd->revents) {
  227. events[nevents].events =
  228. (epoll_fd->events|EPOLLERR|EPOLLHUP) & epoll_fd->revents;
  229. events[nevents].data = epoll_fd->data;
  230. nevents++;
  231. epoll_fd->revents &= ~epoll_fd->events;
  232. }
  233. }
  234. if (need_update)
  235. update_epoll(epoll);
  236. unlock(epoll_hdl->lock);
  237. ret = nevents;
  238. put_handle(epoll_hdl);
  239. return ret;
  240. }
  241. int shim_do_epoll_pwait (int epfd, struct __kernel_epoll_event * events,
  242. int maxevents, int timeout, const sigset_t * sigmask,
  243. size_t sigsetsize)
  244. {
  245. int ret = shim_do_epoll_wait (epfd, events, maxevents, timeout);
  246. return ret;
  247. }
  248. static int epoll_close (struct shim_handle * hdl)
  249. {
  250. return 0;
  251. }
  252. struct shim_fs_ops epoll_fs_ops = {
  253. .close = &epoll_close,
  254. };
  255. struct shim_mount epoll_builtin_fs = { .type = "epoll",
  256. .fs_ops = &epoll_fs_ops, };