1 | /* |
1 | /* |
2 | * libevent compatibility layer |
2 | * libevent compatibility layer |
3 | * |
3 | * |
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008 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 |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * modification, are permitted provided that the following conditions are |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * met: |
9 | * |
|
|
10 | * 1. Redistributions of source code must retain the above copyright notice, |
|
|
11 | * this list of conditions and the following disclaimer. |
|
|
12 | * |
|
|
13 | * 2. Redistributions in binary form must reproduce the above copyright |
|
|
14 | * notice, this list of conditions and the following disclaimer in the |
|
|
15 | * documentation and/or other materials provided with the distribution. |
|
|
16 | * |
|
|
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- |
|
|
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- |
|
|
21 | * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
|
|
22 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
|
|
23 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
|
|
24 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTH- |
|
|
25 | * ERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED |
|
|
26 | * OF THE POSSIBILITY OF SUCH DAMAGE. |
10 | * |
27 | * |
11 | * * Redistributions of source code must retain the above copyright |
28 | * Alternatively, the contents of this file may be used under the terms of |
12 | * notice, this list of conditions and the following disclaimer. |
29 | * the GNU General Public License ("GPL") version 2 or any later version, |
13 | * |
30 | * in which case the provisions of the GPL are applicable instead of |
14 | * * Redistributions in binary form must reproduce the above |
31 | * the above. If you wish to allow the use of your version of this file |
15 | * copyright notice, this list of conditions and the following |
32 | * only under the terms of the GPL and not to allow others to use your |
16 | * disclaimer in the documentation and/or other materials provided |
33 | * version of this file under the BSD license, indicate your decision |
17 | * with the distribution. |
34 | * by deleting the provisions above and replace them with the notice |
18 | * |
35 | * and other provisions required by the GPL. If you do not delete the |
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
36 | * provisions above, a recipient may use your version of this file under |
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
37 | * either the BSD or the GPL. |
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 | */ |
38 | */ |
31 | |
39 | |
32 | #include <stddef.h> |
40 | #include <stddef.h> |
33 | #include <stdlib.h> |
41 | #include <stdlib.h> |
34 | #include <assert.h> |
42 | #include <assert.h> |
… | |
… | |
158 | static void |
166 | static void |
159 | x_cb_io (EV_P_ struct ev_io *w, int revents) |
167 | x_cb_io (EV_P_ struct ev_io *w, int revents) |
160 | { |
168 | { |
161 | struct event *ev = (struct event *)(((char *)w) - offsetof (struct event, iosig.io)); |
169 | struct event *ev = (struct event *)(((char *)w) - offsetof (struct event, iosig.io)); |
162 | |
170 | |
163 | if (revents & EV_ERROR) |
171 | if ((revents & EV_ERROR) || !(ev->ev_events & EV_PERSIST)) |
164 | event_del (ev); |
172 | event_del (ev); |
165 | else if (!(ev->ev_events & EV_PERSIST) && ev_is_active (w)) |
|
|
166 | { |
|
|
167 | ev_io_stop (EV_A_ w); |
|
|
168 | ev->ev_flags &= ~EVLIST_INSERTED; |
|
|
169 | } |
|
|
170 | |
173 | |
171 | x_cb (ev, revents); |
174 | x_cb (ev, revents); |
172 | } |
175 | } |
173 | |
176 | |
174 | static void |
177 | static void |
… | |
… | |
235 | ev->to.repeat = tv_get (tv); |
238 | ev->to.repeat = tv_get (tv); |
236 | ev_timer_again (EV_A_ &ev->to); |
239 | ev_timer_again (EV_A_ &ev->to); |
237 | ev->ev_flags |= EVLIST_TIMEOUT; |
240 | ev->ev_flags |= EVLIST_TIMEOUT; |
238 | } |
241 | } |
239 | else |
242 | else |
240 | if (ev_is_active (&ev->to)) |
243 | { |
241 | ev_timer_stop (EV_A_ &ev->to); |
244 | ev_timer_stop (EV_A_ &ev->to); |
|
|
245 | ev->ev_flags &= ~EVLIST_TIMEOUT; |
|
|
246 | } |
242 | |
247 | |
243 | ev->ev_flags |= EVLIST_ACTIVE; |
248 | ev->ev_flags |= EVLIST_ACTIVE; |
244 | |
249 | |
245 | return 0; |
250 | return 0; |
246 | } |
251 | } |
… | |
… | |
248 | int event_del (struct event *ev) |
253 | int event_del (struct event *ev) |
249 | { |
254 | { |
250 | dLOOPev; |
255 | dLOOPev; |
251 | |
256 | |
252 | if (ev->ev_events & EV_SIGNAL) |
257 | if (ev->ev_events & EV_SIGNAL) |
253 | { |
|
|
254 | /* sig */ |
|
|
255 | if (ev_is_active (&ev->iosig.sig)) |
|
|
256 | ev_signal_stop (EV_A_ &ev->iosig.sig); |
258 | ev_signal_stop (EV_A_ &ev->iosig.sig); |
257 | } |
|
|
258 | else if (ev->ev_events & (EV_READ | EV_WRITE)) |
259 | else if (ev->ev_events & (EV_READ | EV_WRITE)) |
259 | { |
|
|
260 | /* io */ |
|
|
261 | if (ev_is_active (&ev->iosig.io)) |
|
|
262 | ev_io_stop (EV_A_ &ev->iosig.io); |
260 | ev_io_stop (EV_A_ &ev->iosig.io); |
263 | } |
|
|
264 | |
261 | |
265 | if (ev_is_active (&ev->to)) |
262 | if (ev_is_active (&ev->to)) |
266 | ev_timer_stop (EV_A_ &ev->to); |
263 | ev_timer_stop (EV_A_ &ev->to); |
267 | |
264 | |
268 | ev->ev_flags = EVLIST_INIT; |
265 | ev->ev_flags = EVLIST_INIT; |
… | |
… | |
286 | |
283 | |
287 | int event_pending (struct event *ev, short events, struct timeval *tv) |
284 | int event_pending (struct event *ev, short events, struct timeval *tv) |
288 | { |
285 | { |
289 | short revents = 0; |
286 | short revents = 0; |
290 | dLOOPev; |
287 | dLOOPev; |
291 | |
|
|
292 | |
288 | |
293 | if (ev->ev_events & EV_SIGNAL) |
289 | if (ev->ev_events & EV_SIGNAL) |
294 | { |
290 | { |
295 | /* sig */ |
291 | /* sig */ |
296 | if (ev_is_active (&ev->iosig.sig) || ev_is_pending (&ev->iosig.sig)) |
292 | if (ev_is_active (&ev->iosig.sig) || ev_is_pending (&ev->iosig.sig)) |
… | |
… | |
360 | ev_tstamp after = tv_get (tv); |
356 | ev_tstamp after = tv_get (tv); |
361 | dLOOPbase; |
357 | dLOOPbase; |
362 | |
358 | |
363 | ev_once (EV_A_ -1, 0, after >= 0. ? after : 0., x_loopexit_cb, (void *)base); |
359 | ev_once (EV_A_ -1, 0, after >= 0. ? after : 0., x_loopexit_cb, (void *)base); |
364 | |
360 | |
365 | return -1; |
361 | return 0; |
366 | } |
362 | } |
367 | |
363 | |
368 | struct x_once |
364 | struct x_once |
369 | { |
365 | { |
370 | int fd; |
366 | int fd; |