| 1 | /* |
1 | /* |
| 2 | * libev poll fd activity backend |
2 | * libev poll fd activity backend |
| 3 | * |
3 | * |
| 4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009 Marc Alexander Lehmann <libev@schmorp.de> |
| 5 | * All rights reserved. |
5 | * All rights reserved. |
| 6 | * |
6 | * |
| 7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
| 8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
| 9 | * |
9 | * |
| … | |
… | |
| 40 | #include <poll.h> |
40 | #include <poll.h> |
| 41 | |
41 | |
| 42 | void inline_size |
42 | void inline_size |
| 43 | pollidx_init (int *base, int count) |
43 | pollidx_init (int *base, int count) |
| 44 | { |
44 | { |
|
|
45 | /* consider using memset (.., -1, ...), which is pratically guarenteed |
|
|
46 | * to work on all systems implementing poll */ |
| 45 | while (count--) |
47 | while (count--) |
| 46 | *base++ = -1; |
48 | *base++ = -1; |
| 47 | } |
49 | } |
| 48 | |
50 | |
| 49 | static void |
51 | static void |
| … | |
… | |
| 84 | } |
86 | } |
| 85 | |
87 | |
| 86 | static void |
88 | static void |
| 87 | poll_poll (EV_P_ ev_tstamp timeout) |
89 | poll_poll (EV_P_ ev_tstamp timeout) |
| 88 | { |
90 | { |
|
|
91 | struct pollfd *p; |
| 89 | int i; |
92 | int res; |
|
|
93 | |
|
|
94 | EV_RELEASE_CB; |
| 90 | int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
95 | res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
|
|
96 | EV_ACQUIRE_CB; |
| 91 | |
97 | |
| 92 | if (expect_false (res < 0)) |
98 | if (expect_false (res < 0)) |
| 93 | { |
99 | { |
| 94 | if (errno == EBADF) |
100 | if (errno == EBADF) |
| 95 | fd_ebadf (EV_A); |
101 | fd_ebadf (EV_A); |
| 96 | else if (errno == ENOMEM && !syserr_cb) |
102 | else if (errno == ENOMEM && !syserr_cb) |
| 97 | fd_enomem (EV_A); |
103 | fd_enomem (EV_A); |
| 98 | else if (errno != EINTR) |
104 | else if (errno != EINTR) |
| 99 | syserr ("(libev) poll"); |
105 | ev_syserr ("(libev) poll"); |
|
|
106 | } |
|
|
107 | else |
|
|
108 | for (p = polls; res; ++p) |
|
|
109 | if (expect_false (p->revents)) /* this expect is debatable */ |
|
|
110 | { |
|
|
111 | --res; |
| 100 | |
112 | |
| 101 | return; |
|
|
| 102 | } |
|
|
| 103 | |
|
|
| 104 | for (i = 0; i < pollcnt; ++i) |
|
|
| 105 | if (expect_false (polls [i].revents & POLLNVAL)) |
113 | if (expect_false (p->revents & POLLNVAL)) |
| 106 | fd_kill (EV_A_ polls [i].fd); |
114 | fd_kill (EV_A_ p->fd); |
| 107 | else |
115 | else |
| 108 | fd_event ( |
116 | fd_event ( |
| 109 | EV_A_ |
117 | EV_A_ |
| 110 | polls [i].fd, |
118 | p->fd, |
| 111 | (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
119 | (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
| 112 | | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
120 | | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
| 113 | ); |
121 | ); |
|
|
122 | } |
| 114 | } |
123 | } |
| 115 | |
124 | |
| 116 | int inline_size |
125 | int inline_size |
| 117 | poll_init (EV_P_ int flags) |
126 | poll_init (EV_P_ int flags) |
| 118 | { |
127 | { |
