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.

120 lines
3.1 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
  1. /*
  2. * libev epoll fd activity backend
  3. *
  4. * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de>
  5. * All rights reserved.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are
  9. * met:
  10. *
  11. * * Redistributions of source code must retain the above copyright
  12. * notice, this list of conditions and the following disclaimer.
  13. *
  14. * * Redistributions in binary form must reproduce the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer in the documentation and/or other materials provided
  17. * with the distribution.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  20. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  21. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  22. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  23. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  24. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  25. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  26. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  27. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  28. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  29. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  30. */
  31. #include <poll.h>
  32. static void
  33. pollidx_init (int *base, int count)
  34. {
  35. while (count--)
  36. *base++ = -1;
  37. }
  38. static void
  39. poll_modify (EV_P_ int fd, int oev, int nev)
  40. {
  41. int idx;
  42. if (oev == nev)
  43. return;
  44. array_needsize (pollidxs, pollidxmax, fd + 1, pollidx_init);
  45. idx = pollidxs [fd];
  46. if (idx < 0) /* need to allocate a new pollfd */
  47. {
  48. idx = pollcnt++;
  49. array_needsize (polls, pollmax, pollcnt, );
  50. polls [idx].fd = fd;
  51. }
  52. if (nev)
  53. polls [idx].events =
  54. (nev & EV_READ ? POLLIN : 0)
  55. | (nev & EV_WRITE ? POLLOUT : 0);
  56. else /* remove pollfd */
  57. {
  58. if (idx < pollcnt--)
  59. {
  60. pollidxs [fd] = -1;
  61. polls [idx] = polls [pollcnt];
  62. pollidxs [polls [idx].fd] = idx;
  63. }
  64. }
  65. }
  66. static void
  67. poll_poll (EV_P_ ev_tstamp timeout)
  68. {
  69. int i;
  70. int res = poll (polls, pollcnt, ceil (timeout * 1000.));
  71. if (res < 0)
  72. {
  73. if (errno == EBADF)
  74. fd_ebadf (EV_A);
  75. else if (errno == ENOMEM && !syserr_cb)
  76. fd_enomem (EV_A);
  77. else if (errno != EINTR)
  78. syserr ("(libev) poll");
  79. return;
  80. }
  81. for (i = 0; i < pollcnt; ++i)
  82. fd_event (
  83. EV_A_
  84. polls [i].fd,
  85. (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
  86. | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
  87. );
  88. }
  89. static int
  90. poll_init (EV_P_ int flags)
  91. {
  92. method_fudge = 1e-3; /* needed to compensate for select returning early, very conservative */
  93. method_modify = poll_modify;
  94. method_poll = poll_poll;
  95. pollidxs = 0; pollidxmax = 0;
  96. polls = 0; pollmax = 0; pollcnt = 0;
  97. return EVMETHOD_POLL;
  98. }
  99. static void
  100. poll_destroy (EV_P)
  101. {
  102. ev_free (pollidxs);
  103. ev_free (polls);
  104. }