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,2010,2011 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 | * |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
10 | * 1. Redistributions of source code must retain the above copyright notice, |
11 | * this list of conditions and the following disclaimer. |
11 | * this list of conditions and the following disclaimer. |
12 | * |
12 | * |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
13 | * 2. Redistributions in binary form must reproduce the above copyright |
14 | * notice, this list of conditions and the following disclaimer in the |
14 | * notice, this list of conditions and the following disclaimer in the |
15 | * documentation and/or other materials provided with the distribution. |
15 | * documentation and/or other materials provided with the distribution. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
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- |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
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- |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
… | |
… | |
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 practically guaranteed |
|
|
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; |
90 | int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); |
93 | |
|
|
94 | EV_RELEASE_CB; |
|
|
95 | res = poll (polls, pollcnt, ev_timeout_to_ms (timeout)); |
|
|
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"); |
100 | } |
106 | } |
101 | else if (res > 0) |
107 | else |
102 | for (i = 0; i < pollcnt; ++i) |
108 | for (p = polls; res; ++p) |
|
|
109 | { |
|
|
110 | assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt)); |
|
|
111 | |
|
|
112 | if (expect_false (p->revents)) /* this expect is debatable */ |
|
|
113 | { |
|
|
114 | --res; |
|
|
115 | |
103 | if (expect_false (polls [i].revents & POLLNVAL)) |
116 | if (expect_false (p->revents & POLLNVAL)) |
104 | fd_kill (EV_A_ polls [i].fd); |
117 | fd_kill (EV_A_ p->fd); |
105 | else |
118 | else |
106 | fd_event ( |
119 | fd_event ( |
107 | EV_A_ |
120 | EV_A_ |
108 | polls [i].fd, |
121 | p->fd, |
109 | (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
122 | (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) |
110 | | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
123 | | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) |
111 | ); |
124 | ); |
|
|
125 | } |
|
|
126 | } |
112 | } |
127 | } |
113 | |
128 | |
114 | int inline_size |
129 | int inline_size |
115 | poll_init (EV_P_ int flags) |
130 | poll_init (EV_P_ int flags) |
116 | { |
131 | { |
117 | backend_fudge = 0.; /* posix says this is zero */ |
132 | backend_fudge = 1e-3; |
118 | backend_modify = poll_modify; |
133 | backend_modify = poll_modify; |
119 | backend_poll = poll_poll; |
134 | backend_poll = poll_poll; |
120 | |
135 | |
121 | pollidxs = 0; pollidxmax = 0; |
136 | pollidxs = 0; pollidxmax = 0; |
122 | polls = 0; pollmax = 0; pollcnt = 0; |
137 | polls = 0; pollmax = 0; pollcnt = 0; |