You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

ev_kqueue.c 6.7KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
  1. /*
  2. * libev kqueue backend
  3. *
  4. * Copyright (c) 2007,2008,2009,2010,2011,2012,2013 Marc Alexander Lehmann <libev@schmorp.de>
  5. * All rights reserved.
  6. *
  7. * Redistribution and use in source and binary forms, with or without modifica-
  8. * tion, are permitted provided that the following conditions are met:
  9. *
  10. * 1. Redistributions of source code must retain the above copyright notice,
  11. * this list of conditions and the following disclaimer.
  12. *
  13. * 2. Redistributions in binary form must reproduce the above copyright
  14. * notice, this list of conditions and the following disclaimer in the
  15. * documentation and/or other materials provided with the distribution.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
  18. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
  19. * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
  20. * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
  21. * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  22. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
  23. * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
  24. * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH-
  25. * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  26. * OF THE POSSIBILITY OF SUCH DAMAGE.
  27. *
  28. * Alternatively, the contents of this file may be used under the terms of
  29. * the GNU General Public License ("GPL") version 2 or any later version,
  30. * in which case the provisions of the GPL are applicable instead of
  31. * the above. If you wish to allow the use of your version of this file
  32. * only under the terms of the GPL and not to allow others to use your
  33. * version of this file under the BSD license, indicate your decision
  34. * by deleting the provisions above and replace them with the notice
  35. * and other provisions required by the GPL. If you do not delete the
  36. * provisions above, a recipient may use your version of this file under
  37. * either the BSD or the GPL.
  38. */
  39. #include <sys/types.h>
  40. #include <sys/time.h>
  41. #include <sys/event.h>
  42. #include <string.h>
  43. #include <errno.h>
  44. inline_speed
  45. void
  46. kqueue_change (EV_P_ int fd, int filter, int flags, int fflags)
  47. {
  48. ++kqueue_changecnt;
  49. array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2);
  50. EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0);
  51. }
  52. /* OS X at least needs this */
  53. #ifndef EV_ENABLE
  54. # define EV_ENABLE 0
  55. #endif
  56. #ifndef NOTE_EOF
  57. # define NOTE_EOF 0
  58. #endif
  59. static void
  60. kqueue_modify (EV_P_ int fd, int oev, int nev)
  61. {
  62. if (oev != nev)
  63. {
  64. if (oev & EV_READ)
  65. kqueue_change (EV_A_ fd, EVFILT_READ , EV_DELETE, 0);
  66. if (oev & EV_WRITE)
  67. kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0);
  68. }
  69. /* to detect close/reopen reliably, we have to re-add */
  70. /* event requests even when oev == nev */
  71. if (nev & EV_READ)
  72. kqueue_change (EV_A_ fd, EVFILT_READ , EV_ADD | EV_ENABLE, NOTE_EOF);
  73. if (nev & EV_WRITE)
  74. kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, NOTE_EOF);
  75. }
  76. static void
  77. kqueue_poll (EV_P_ ev_tstamp timeout)
  78. {
  79. int res, i;
  80. struct timespec ts;
  81. /* need to resize so there is enough space for errors */
  82. if (kqueue_changecnt > kqueue_eventmax)
  83. {
  84. ev_free (kqueue_events);
  85. kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_changecnt);
  86. kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
  87. }
  88. EV_RELEASE_CB;
  89. EV_TS_SET (ts, timeout);
  90. res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts);
  91. EV_ACQUIRE_CB;
  92. kqueue_changecnt = 0;
  93. if (expect_false (res < 0))
  94. {
  95. if (errno != EINTR)
  96. ev_syserr ("(libev) kevent");
  97. return;
  98. }
  99. for (i = 0; i < res; ++i)
  100. {
  101. int fd = kqueue_events [i].ident;
  102. if (expect_false (kqueue_events [i].flags & EV_ERROR))
  103. {
  104. int err = kqueue_events [i].data;
  105. /* we are only interested in errors for fds that we are interested in :) */
  106. if (anfds [fd].events)
  107. {
  108. if (err == ENOENT) /* resubmit changes on ENOENT */
  109. kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
  110. else if (err == EBADF) /* on EBADF, we re-check the fd */
  111. {
  112. if (fd_valid (fd))
  113. kqueue_modify (EV_A_ fd, 0, anfds [fd].events);
  114. else
  115. fd_kill (EV_A_ fd);
  116. }
  117. else /* on all other errors, we error out on the fd */
  118. fd_kill (EV_A_ fd);
  119. }
  120. }
  121. else
  122. fd_event (
  123. EV_A_
  124. fd,
  125. kqueue_events [i].filter == EVFILT_READ ? EV_READ
  126. : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE
  127. : 0
  128. );
  129. }
  130. if (expect_false (res == kqueue_eventmax))
  131. {
  132. ev_free (kqueue_events);
  133. kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1);
  134. kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
  135. }
  136. }
  137. inline_size
  138. int
  139. kqueue_init (EV_P_ int flags)
  140. {
  141. /* initialize the kernel queue */
  142. kqueue_fd_pid = getpid ();
  143. if ((backend_fd = kqueue ()) < 0)
  144. return 0;
  145. fcntl (backend_fd, F_SETFD, FD_CLOEXEC); /* not sure if necessary, hopefully doesn't hurt */
  146. backend_mintime = 1e-9; /* apparently, they did the right thing in freebsd */
  147. backend_modify = kqueue_modify;
  148. backend_poll = kqueue_poll;
  149. kqueue_eventmax = 64; /* initial number of events receivable per poll */
  150. kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax);
  151. kqueue_changes = 0;
  152. kqueue_changemax = 0;
  153. kqueue_changecnt = 0;
  154. return EVBACKEND_KQUEUE;
  155. }
  156. inline_size
  157. void
  158. kqueue_destroy (EV_P)
  159. {
  160. ev_free (kqueue_events);
  161. ev_free (kqueue_changes);
  162. }
  163. inline_size
  164. void
  165. kqueue_fork (EV_P)
  166. {
  167. /* some BSD kernels don't just destroy the kqueue itself,
  168. * but also close the fd, which isn't documented, and
  169. * impossible to support properly.
  170. * we remember the pid of the kqueue call and only close
  171. * the fd if the pid is still the same.
  172. * this leaks fds on sane kernels, but BSD interfaces are
  173. * notoriously buggy and rarely get fixed.
  174. */
  175. pid_t newpid = getpid ();
  176. if (newpid == kqueue_fd_pid)
  177. close (backend_fd);
  178. kqueue_fd_pid = newpid;
  179. while ((backend_fd = kqueue ()) < 0)
  180. ev_syserr ("(libev) kqueue");
  181. fcntl (backend_fd, F_SETFD, FD_CLOEXEC);
  182. /* re-register interest in fds */
  183. fd_rearm_all (EV_A);
  184. }
  185. /* sys/event.h defines EV_ERROR */
  186. #undef EV_ERROR