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_poll.c 4.3KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. /*
  2. * libev poll fd activity backend
  3. *
  4. * Copyright (c) 2007,2008,2009,2010,2011 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 <poll.h>
  40. inline_size
  41. void
  42. pollidx_init (int *base, int count)
  43. {
  44. /* consider using memset (.., -1, ...), which is practically guaranteed
  45. * to work on all systems implementing poll */
  46. while (count--)
  47. *base++ = -1;
  48. }
  49. static void
  50. poll_modify (EV_P_ int fd, int oev, int nev)
  51. {
  52. int idx;
  53. if (oev == nev)
  54. return;
  55. array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init);
  56. idx = pollidxs [fd];
  57. if (idx < 0) /* need to allocate a new pollfd */
  58. {
  59. pollidxs [fd] = idx = pollcnt++;
  60. array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2);
  61. polls [idx].fd = fd;
  62. }
  63. assert (polls [idx].fd == fd);
  64. if (nev)
  65. polls [idx].events =
  66. (nev & EV_READ ? POLLIN : 0)
  67. | (nev & EV_WRITE ? POLLOUT : 0);
  68. else /* remove pollfd */
  69. {
  70. pollidxs [fd] = -1;
  71. if (expect_true (idx < --pollcnt))
  72. {
  73. polls [idx] = polls [pollcnt];
  74. pollidxs [polls [idx].fd] = idx;
  75. }
  76. }
  77. }
  78. static void
  79. poll_poll (EV_P_ ev_tstamp timeout)
  80. {
  81. struct pollfd *p;
  82. int res;
  83. EV_RELEASE_CB;
  84. res = poll (polls, pollcnt, timeout * 1e3);
  85. EV_ACQUIRE_CB;
  86. if (expect_false (res < 0))
  87. {
  88. if (errno == EBADF)
  89. fd_ebadf (EV_A);
  90. else if (errno == ENOMEM && !syserr_cb)
  91. fd_enomem (EV_A);
  92. else if (errno != EINTR)
  93. ev_syserr ("(libev) poll");
  94. }
  95. else
  96. for (p = polls; res; ++p)
  97. {
  98. assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
  99. if (expect_false (p->revents)) /* this expect is debatable */
  100. {
  101. --res;
  102. if (expect_false (p->revents & POLLNVAL))
  103. fd_kill (EV_A_ p->fd);
  104. else
  105. fd_event (
  106. EV_A_
  107. p->fd,
  108. (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
  109. | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
  110. );
  111. }
  112. }
  113. }
  114. inline_size
  115. int
  116. poll_init (EV_P_ int flags)
  117. {
  118. backend_mintime = 1e-3;
  119. backend_modify = poll_modify;
  120. backend_poll = poll_poll;
  121. pollidxs = 0; pollidxmax = 0;
  122. polls = 0; pollmax = 0; pollcnt = 0;
  123. return EVBACKEND_POLL;
  124. }
  125. inline_size
  126. void
  127. poll_destroy (EV_P)
  128. {
  129. ev_free (pollidxs);
  130. ev_free (polls);
  131. }