poll.c 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207
  1. /* Copyright (C) 1994,1996,1997,1998,1999,2001,2002
  2. Free Software Foundation, Inc.
  3. This file is part of the GNU C Library.
  4. The GNU C Library is free software; you can redistribute it and/or
  5. modify it under the terms of the GNU Lesser General Public
  6. License as published by the Free Software Foundation; either
  7. version 2.1 of the License, or (at your option) any later version.
  8. The GNU C Library is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. Lesser General Public License for more details.
  12. You should have received a copy of the GNU Lesser General Public
  13. License along with the GNU C Library; if not, write to the Free
  14. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  15. 02111-1307 USA. */
  16. #define getdtablesize __getdtablesize
  17. #define select __select
  18. #include "syscalls.h"
  19. #include <sys/poll.h>
  20. #ifdef __NR_poll
  21. _syscall3(int, poll, struct pollfd *, fds,
  22. unsigned long int, nfds, int, timeout);
  23. #else
  24. #include <alloca.h>
  25. #include <sys/types.h>
  26. #include <errno.h>
  27. #include <string.h>
  28. #include <sys/time.h>
  29. #include <sys/param.h>
  30. #include <unistd.h>
  31. /* uClinux 2.0 doesn't have poll, emulate it using select */
  32. /* Poll the file descriptors described by the NFDS structures starting at
  33. FDS. If TIMEOUT is nonzero and not -1, allow TIMEOUT milliseconds for
  34. an event to occur; if TIMEOUT is -1, block until an event occurs.
  35. Returns the number of file descriptors with events, zero if timed out,
  36. or -1 for errors. */
  37. int poll(struct pollfd *fds, nfds_t nfds, int timeout)
  38. {
  39. static int max_fd_size;
  40. struct timeval tv;
  41. fd_set *rset, *wset, *xset;
  42. struct pollfd *f;
  43. int ready;
  44. int maxfd = 0;
  45. int bytes;
  46. if (!max_fd_size)
  47. max_fd_size = getdtablesize ();
  48. bytes = howmany (max_fd_size, __NFDBITS);
  49. rset = alloca (bytes);
  50. wset = alloca (bytes);
  51. xset = alloca (bytes);
  52. /* We can't call FD_ZERO, since FD_ZERO only works with sets
  53. of exactly __FD_SETSIZE size. */
  54. __memset (rset, 0, bytes);
  55. __memset (wset, 0, bytes);
  56. __memset (xset, 0, bytes);
  57. for (f = fds; f < &fds[nfds]; ++f)
  58. {
  59. f->revents = 0;
  60. if (f->fd >= 0)
  61. {
  62. if (f->fd >= max_fd_size)
  63. {
  64. /* The user provides a file descriptor number which is higher
  65. than the maximum we got from the `getdtablesize' call.
  66. Maybe this is ok so enlarge the arrays. */
  67. fd_set *nrset, *nwset, *nxset;
  68. int nbytes;
  69. max_fd_size = roundup (f->fd, __NFDBITS);
  70. nbytes = howmany (max_fd_size, __NFDBITS);
  71. nrset = alloca (nbytes);
  72. nwset = alloca (nbytes);
  73. nxset = alloca (nbytes);
  74. __memset ((char *) nrset + bytes, 0, nbytes - bytes);
  75. __memset ((char *) nwset + bytes, 0, nbytes - bytes);
  76. __memset ((char *) nxset + bytes, 0, nbytes - bytes);
  77. rset = __memcpy (nrset, rset, bytes);
  78. wset = __memcpy (nwset, wset, bytes);
  79. xset = __memcpy (nxset, xset, bytes);
  80. bytes = nbytes;
  81. }
  82. if (f->events & POLLIN)
  83. FD_SET (f->fd, rset);
  84. if (f->events & POLLOUT)
  85. FD_SET (f->fd, wset);
  86. if (f->events & POLLPRI)
  87. FD_SET (f->fd, xset);
  88. if (f->fd > maxfd && (f->events & (POLLIN|POLLOUT|POLLPRI)))
  89. maxfd = f->fd;
  90. }
  91. }
  92. tv.tv_sec = timeout / 1000;
  93. tv.tv_usec = (timeout % 1000) * 1000;
  94. while (1)
  95. {
  96. ready = select (maxfd + 1, rset, wset, xset,
  97. timeout == -1 ? NULL : &tv);
  98. /* It might be that one or more of the file descriptors is invalid.
  99. We now try to find and mark them and then try again. */
  100. if (ready == -1 && errno == EBADF)
  101. {
  102. fd_set *sngl_rset = alloca (bytes);
  103. fd_set *sngl_wset = alloca (bytes);
  104. fd_set *sngl_xset = alloca (bytes);
  105. struct timeval sngl_tv;
  106. /* Clear the original set. */
  107. __memset (rset, 0, bytes);
  108. __memset (wset, 0, bytes);
  109. __memset (xset, 0, bytes);
  110. /* This means we don't wait for input. */
  111. sngl_tv.tv_sec = 0;
  112. sngl_tv.tv_usec = 0;
  113. maxfd = -1;
  114. /* Reset the return value. */
  115. ready = 0;
  116. for (f = fds; f < &fds[nfds]; ++f)
  117. if (f->fd != -1 && (f->events & (POLLIN|POLLOUT|POLLPRI))
  118. && (f->revents & POLLNVAL) == 0)
  119. {
  120. int n;
  121. __memset (sngl_rset, 0, bytes);
  122. __memset (sngl_wset, 0, bytes);
  123. __memset (sngl_xset, 0, bytes);
  124. if (f->events & POLLIN)
  125. FD_SET (f->fd, sngl_rset);
  126. if (f->events & POLLOUT)
  127. FD_SET (f->fd, sngl_wset);
  128. if (f->events & POLLPRI)
  129. FD_SET (f->fd, sngl_xset);
  130. n = select (f->fd + 1, sngl_rset, sngl_wset, sngl_xset,
  131. &sngl_tv);
  132. if (n != -1)
  133. {
  134. /* This descriptor is ok. */
  135. if (f->events & POLLIN)
  136. FD_SET (f->fd, rset);
  137. if (f->events & POLLOUT)
  138. FD_SET (f->fd, wset);
  139. if (f->events & POLLPRI)
  140. FD_SET (f->fd, xset);
  141. if (f->fd > maxfd)
  142. maxfd = f->fd;
  143. if (n > 0)
  144. /* Count it as being available. */
  145. ++ready;
  146. }
  147. else if (errno == EBADF)
  148. f->revents |= POLLNVAL;
  149. }
  150. /* Try again. */
  151. continue;
  152. }
  153. break;
  154. }
  155. if (ready > 0)
  156. for (f = fds; f < &fds[nfds]; ++f)
  157. {
  158. if (f->fd >= 0)
  159. {
  160. if (FD_ISSET (f->fd, rset))
  161. f->revents |= POLLIN;
  162. if (FD_ISSET (f->fd, wset))
  163. f->revents |= POLLOUT;
  164. if (FD_ISSET (f->fd, xset))
  165. f->revents |= POLLPRI;
  166. }
  167. }
  168. return ready;
  169. }
  170. #endif