poll.c 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  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. #include "syscalls.h"
  17. #include <sys/poll.h>
  18. libc_hidden_proto(poll)
  19. #ifdef __NR_poll
  20. _syscall3(int, poll, struct pollfd *, fds,
  21. unsigned long int, nfds, int, timeout);
  22. #else
  23. #include <alloca.h>
  24. #include <sys/types.h>
  25. #include <errno.h>
  26. #include <string.h>
  27. #include <sys/time.h>
  28. #include <sys/param.h>
  29. #include <unistd.h>
  30. libc_hidden_proto(memcpy)
  31. libc_hidden_proto(memset)
  32. libc_hidden_proto(getdtablesize)
  33. libc_hidden_proto(select)
  34. /* uClinux 2.0 doesn't have poll, emulate it using select */
  35. /* Poll the file descriptors described by the NFDS structures starting at
  36. FDS. If TIMEOUT is nonzero and not -1, allow TIMEOUT milliseconds for
  37. an event to occur; if TIMEOUT is -1, block until an event occurs.
  38. Returns the number of file descriptors with events, zero if timed out,
  39. or -1 for errors. */
  40. int poll(struct pollfd *fds, nfds_t nfds, int timeout)
  41. {
  42. static int max_fd_size;
  43. struct timeval tv;
  44. fd_set *rset, *wset, *xset;
  45. struct pollfd *f;
  46. int ready;
  47. int maxfd = 0;
  48. int bytes;
  49. if (!max_fd_size)
  50. max_fd_size = getdtablesize ();
  51. bytes = howmany (max_fd_size, __NFDBITS);
  52. rset = alloca (bytes);
  53. wset = alloca (bytes);
  54. xset = alloca (bytes);
  55. /* We can't call FD_ZERO, since FD_ZERO only works with sets
  56. of exactly __FD_SETSIZE size. */
  57. memset (rset, 0, bytes);
  58. memset (wset, 0, bytes);
  59. memset (xset, 0, bytes);
  60. for (f = fds; f < &fds[nfds]; ++f)
  61. {
  62. f->revents = 0;
  63. if (f->fd >= 0)
  64. {
  65. if (f->fd >= max_fd_size)
  66. {
  67. /* The user provides a file descriptor number which is higher
  68. than the maximum we got from the `getdtablesize' call.
  69. Maybe this is ok so enlarge the arrays. */
  70. fd_set *nrset, *nwset, *nxset;
  71. int nbytes;
  72. max_fd_size = roundup (f->fd, __NFDBITS);
  73. nbytes = howmany (max_fd_size, __NFDBITS);
  74. nrset = alloca (nbytes);
  75. nwset = alloca (nbytes);
  76. nxset = alloca (nbytes);
  77. memset ((char *) nrset + bytes, 0, nbytes - bytes);
  78. memset ((char *) nwset + bytes, 0, nbytes - bytes);
  79. memset ((char *) nxset + bytes, 0, nbytes - bytes);
  80. rset = memcpy (nrset, rset, bytes);
  81. wset = memcpy (nwset, wset, bytes);
  82. xset = memcpy (nxset, xset, bytes);
  83. bytes = nbytes;
  84. }
  85. if (f->events & POLLIN)
  86. FD_SET (f->fd, rset);
  87. if (f->events & POLLOUT)
  88. FD_SET (f->fd, wset);
  89. if (f->events & POLLPRI)
  90. FD_SET (f->fd, xset);
  91. if (f->fd > maxfd && (f->events & (POLLIN|POLLOUT|POLLPRI)))
  92. maxfd = f->fd;
  93. }
  94. }
  95. tv.tv_sec = timeout / 1000;
  96. tv.tv_usec = (timeout % 1000) * 1000;
  97. while (1)
  98. {
  99. ready = select (maxfd + 1, rset, wset, xset,
  100. timeout == -1 ? NULL : &tv);
  101. /* It might be that one or more of the file descriptors is invalid.
  102. We now try to find and mark them and then try again. */
  103. if (ready == -1 && errno == EBADF)
  104. {
  105. fd_set *sngl_rset = alloca (bytes);
  106. fd_set *sngl_wset = alloca (bytes);
  107. fd_set *sngl_xset = alloca (bytes);
  108. struct timeval sngl_tv;
  109. /* Clear the original set. */
  110. memset (rset, 0, bytes);
  111. memset (wset, 0, bytes);
  112. memset (xset, 0, bytes);
  113. /* This means we don't wait for input. */
  114. sngl_tv.tv_sec = 0;
  115. sngl_tv.tv_usec = 0;
  116. maxfd = -1;
  117. /* Reset the return value. */
  118. ready = 0;
  119. for (f = fds; f < &fds[nfds]; ++f)
  120. if (f->fd != -1 && (f->events & (POLLIN|POLLOUT|POLLPRI))
  121. && (f->revents & POLLNVAL) == 0)
  122. {
  123. int n;
  124. memset (sngl_rset, 0, bytes);
  125. memset (sngl_wset, 0, bytes);
  126. memset (sngl_xset, 0, bytes);
  127. if (f->events & POLLIN)
  128. FD_SET (f->fd, sngl_rset);
  129. if (f->events & POLLOUT)
  130. FD_SET (f->fd, sngl_wset);
  131. if (f->events & POLLPRI)
  132. FD_SET (f->fd, sngl_xset);
  133. n = select (f->fd + 1, sngl_rset, sngl_wset, sngl_xset,
  134. &sngl_tv);
  135. if (n != -1)
  136. {
  137. /* This descriptor is ok. */
  138. if (f->events & POLLIN)
  139. FD_SET (f->fd, rset);
  140. if (f->events & POLLOUT)
  141. FD_SET (f->fd, wset);
  142. if (f->events & POLLPRI)
  143. FD_SET (f->fd, xset);
  144. if (f->fd > maxfd)
  145. maxfd = f->fd;
  146. if (n > 0)
  147. /* Count it as being available. */
  148. ++ready;
  149. }
  150. else if (errno == EBADF)
  151. f->revents |= POLLNVAL;
  152. }
  153. /* Try again. */
  154. continue;
  155. }
  156. break;
  157. }
  158. if (ready > 0)
  159. for (f = fds; f < &fds[nfds]; ++f)
  160. {
  161. if (f->fd >= 0)
  162. {
  163. if (FD_ISSET (f->fd, rset))
  164. f->revents |= POLLIN;
  165. if (FD_ISSET (f->fd, wset))
  166. f->revents |= POLLOUT;
  167. if (FD_ISSET (f->fd, xset))
  168. f->revents |= POLLPRI;
  169. }
  170. }
  171. return ready;
  172. }
  173. #endif
  174. libc_hidden_def(poll)