Mirror of :pserver:anonymous@cvs.schmorp.de/schmorpforge libev http://software.schmorp.de/pkg/libev.html
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.

144 lines
4.2 KiB

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