|
|
1 | /* |
|
|
2 | * libev event processing core, watcher management |
|
|
3 | * |
|
|
4 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
|
|
5 | * All rights reserved. |
|
|
6 | * |
|
|
7 | * Redistribution and use in source and binary forms, with or without |
|
|
8 | * modification, are permitted provided that the following conditions are |
|
|
9 | * met: |
|
|
10 | * |
|
|
11 | * * Redistributions of source code must retain the above copyright |
|
|
12 | * notice, this list of conditions and the following disclaimer. |
|
|
13 | * |
|
|
14 | * * Redistributions in binary form must reproduce the above |
|
|
15 | * copyright notice, this list of conditions and the following |
|
|
16 | * disclaimer in the documentation and/or other materials provided |
|
|
17 | * with the distribution. |
|
|
18 | * |
|
|
19 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
20 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
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 | */ |
|
|
31 | #ifndef EV_STANDALONE |
|
|
32 | # include "config.h" |
|
|
33 | |
|
|
34 | # if HAVE_CLOCK_GETTIME |
|
|
35 | # define EV_USE_MONOTONIC 1 |
|
|
36 | # define EV_USE_REALTIME 1 |
|
|
37 | # endif |
|
|
38 | |
|
|
39 | # if HAVE_SELECT && HAVE_SYS_SELECT_H |
|
|
40 | # define EV_USE_SELECT 1 |
|
|
41 | # endif |
|
|
42 | |
|
|
43 | # if HAVE_POLL && HAVE_POLL_H |
|
|
44 | # define EV_USE_POLL 1 |
|
|
45 | # endif |
|
|
46 | |
|
|
47 | # if HAVE_EPOLL && HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H |
|
|
48 | # define EV_USE_EPOLL 1 |
|
|
49 | # endif |
|
|
50 | |
|
|
51 | # if HAVE_KQUEUE && HAVE_WORKING_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H |
|
|
52 | # define EV_USE_KQUEUE 1 |
|
|
53 | # endif |
|
|
54 | |
|
|
55 | #endif |
|
|
56 | |
1 | #include <math.h> |
57 | #include <math.h> |
2 | #include <stdlib.h> |
58 | #include <stdlib.h> |
3 | #include <unistd.h> |
59 | #include <unistd.h> |
4 | #include <fcntl.h> |
60 | #include <fcntl.h> |
5 | #include <signal.h> |
61 | #include <signal.h> |
|
|
62 | #include <stddef.h> |
6 | |
63 | |
7 | #include <stdio.h> |
64 | #include <stdio.h> |
8 | |
65 | |
9 | #include <assert.h> |
66 | #include <assert.h> |
10 | #include <errno.h> |
67 | #include <errno.h> |
|
|
68 | #include <sys/types.h> |
|
|
69 | #ifndef WIN32 |
|
|
70 | # include <sys/wait.h> |
|
|
71 | #endif |
11 | #include <sys/time.h> |
72 | #include <sys/time.h> |
12 | #include <time.h> |
73 | #include <time.h> |
13 | |
74 | |
|
|
75 | /**/ |
|
|
76 | |
|
|
77 | #ifndef EV_USE_MONOTONIC |
|
|
78 | # define EV_USE_MONOTONIC 1 |
|
|
79 | #endif |
|
|
80 | |
|
|
81 | #ifndef EV_USE_SELECT |
|
|
82 | # define EV_USE_SELECT 1 |
|
|
83 | #endif |
|
|
84 | |
|
|
85 | #ifndef EV_USE_POLL |
|
|
86 | # define EV_USE_POLL 0 /* poll is usually slower than select, and not as well tested */ |
|
|
87 | #endif |
|
|
88 | |
|
|
89 | #ifndef EV_USE_EPOLL |
|
|
90 | # define EV_USE_EPOLL 0 |
|
|
91 | #endif |
|
|
92 | |
|
|
93 | #ifndef EV_USE_KQUEUE |
|
|
94 | # define EV_USE_KQUEUE 0 |
|
|
95 | #endif |
|
|
96 | |
|
|
97 | #ifndef EV_USE_WIN32 |
|
|
98 | # ifdef WIN32 |
|
|
99 | # define EV_USE_WIN32 1 |
|
|
100 | # else |
|
|
101 | # define EV_USE_WIN32 0 |
|
|
102 | # endif |
|
|
103 | #endif |
|
|
104 | |
|
|
105 | #ifndef EV_USE_REALTIME |
|
|
106 | # define EV_USE_REALTIME 1 |
|
|
107 | #endif |
|
|
108 | |
|
|
109 | /**/ |
|
|
110 | |
14 | #ifdef CLOCK_MONOTONIC |
111 | #ifndef CLOCK_MONOTONIC |
|
|
112 | # undef EV_USE_MONOTONIC |
15 | # define HAVE_MONOTONIC 1 |
113 | # define EV_USE_MONOTONIC 0 |
16 | #endif |
114 | #endif |
17 | |
115 | |
|
|
116 | #ifndef CLOCK_REALTIME |
|
|
117 | # undef EV_USE_REALTIME |
18 | #define HAVE_REALTIME 1 |
118 | # define EV_USE_REALTIME 0 |
19 | #define HAVE_EPOLL 1 |
119 | #endif |
20 | #define HAVE_SELECT 1 |
120 | |
|
|
121 | /**/ |
21 | |
122 | |
22 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
123 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
23 | #define MAX_BLOCKTIME 60. |
124 | #define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
|
|
125 | #define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
|
|
126 | /*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
24 | |
127 | |
25 | #include "ev.h" |
128 | #include "ev.h" |
26 | |
129 | |
|
|
130 | #if __GNUC__ >= 3 |
|
|
131 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
|
|
132 | # define inline inline |
|
|
133 | #else |
|
|
134 | # define expect(expr,value) (expr) |
|
|
135 | # define inline static |
|
|
136 | #endif |
|
|
137 | |
|
|
138 | #define expect_false(expr) expect ((expr) != 0, 0) |
|
|
139 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
140 | |
|
|
141 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
|
|
142 | #define ABSPRI(w) ((w)->priority - EV_MINPRI) |
|
|
143 | |
27 | struct ev_watcher { |
144 | typedef struct ev_watcher *W; |
28 | EV_WATCHER (ev_watcher); |
145 | typedef struct ev_watcher_list *WL; |
|
|
146 | typedef struct ev_watcher_time *WT; |
|
|
147 | |
|
|
148 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
|
|
149 | |
|
|
150 | /*****************************************************************************/ |
|
|
151 | |
|
|
152 | typedef struct |
|
|
153 | { |
|
|
154 | struct ev_watcher_list *head; |
|
|
155 | unsigned char events; |
|
|
156 | unsigned char reify; |
|
|
157 | } ANFD; |
|
|
158 | |
|
|
159 | typedef struct |
|
|
160 | { |
|
|
161 | W w; |
|
|
162 | int events; |
|
|
163 | } ANPENDING; |
|
|
164 | |
|
|
165 | #if EV_MULTIPLICITY |
|
|
166 | |
|
|
167 | struct ev_loop |
|
|
168 | { |
|
|
169 | # define VAR(name,decl) decl; |
|
|
170 | # include "ev_vars.h" |
29 | }; |
171 | }; |
|
|
172 | # undef VAR |
|
|
173 | # include "ev_wrap.h" |
30 | |
174 | |
31 | struct ev_watcher_list { |
175 | #else |
32 | EV_WATCHER_LIST (ev_watcher_list); |
|
|
33 | }; |
|
|
34 | |
176 | |
35 | static ev_tstamp now, diff; /* monotonic clock */ |
177 | # define VAR(name,decl) static decl; |
36 | ev_tstamp ev_now; |
178 | # include "ev_vars.h" |
37 | int ev_method; |
179 | # undef VAR |
38 | |
180 | |
39 | static int have_monotonic; /* runtime */ |
181 | #endif |
40 | |
182 | |
41 | static ev_tstamp method_fudge; /* stupid epoll-returns-early bug */ |
183 | /*****************************************************************************/ |
42 | static void (*method_modify)(int fd, int oev, int nev); |
|
|
43 | static void (*method_poll)(ev_tstamp timeout); |
|
|
44 | |
184 | |
45 | ev_tstamp |
185 | inline ev_tstamp |
46 | ev_time (void) |
186 | ev_time (void) |
47 | { |
187 | { |
48 | #if HAVE_REALTIME |
188 | #if EV_USE_REALTIME |
49 | struct timespec ts; |
189 | struct timespec ts; |
50 | clock_gettime (CLOCK_REALTIME, &ts); |
190 | clock_gettime (CLOCK_REALTIME, &ts); |
51 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
191 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
52 | #else |
192 | #else |
53 | struct timeval tv; |
193 | struct timeval tv; |
54 | gettimeofday (&tv, 0); |
194 | gettimeofday (&tv, 0); |
55 | return tv.tv_sec + tv.tv_usec * 1e-6; |
195 | return tv.tv_sec + tv.tv_usec * 1e-6; |
56 | #endif |
196 | #endif |
57 | } |
197 | } |
58 | |
198 | |
59 | static ev_tstamp |
199 | inline ev_tstamp |
60 | get_clock (void) |
200 | get_clock (void) |
61 | { |
201 | { |
62 | #if HAVE_MONOTONIC |
202 | #if EV_USE_MONOTONIC |
63 | if (have_monotonic) |
203 | if (expect_true (have_monotonic)) |
64 | { |
204 | { |
65 | struct timespec ts; |
205 | struct timespec ts; |
66 | clock_gettime (CLOCK_MONOTONIC, &ts); |
206 | clock_gettime (CLOCK_MONOTONIC, &ts); |
67 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
207 | return ts.tv_sec + ts.tv_nsec * 1e-9; |
68 | } |
208 | } |
69 | #endif |
209 | #endif |
70 | |
210 | |
71 | return ev_time (); |
211 | return ev_time (); |
72 | } |
212 | } |
73 | |
213 | |
|
|
214 | ev_tstamp |
|
|
215 | ev_now (EV_P) |
|
|
216 | { |
|
|
217 | return rt_now; |
|
|
218 | } |
|
|
219 | |
|
|
220 | #define array_roundsize(base,n) ((n) | 4 & ~3) |
|
|
221 | |
74 | #define array_needsize(base,cur,cnt,init) \ |
222 | #define array_needsize(base,cur,cnt,init) \ |
75 | if ((cnt) > cur) \ |
223 | if (expect_false ((cnt) > cur)) \ |
76 | { \ |
224 | { \ |
77 | int newcnt = cur ? cur << 1 : 16; \ |
225 | int newcnt = cur; \ |
78 | fprintf (stderr, "resize(" # base ") from %d to %d\n", cur, newcnt);\ |
226 | do \ |
|
|
227 | { \ |
|
|
228 | newcnt = array_roundsize (base, newcnt << 1); \ |
|
|
229 | } \ |
|
|
230 | while ((cnt) > newcnt); \ |
|
|
231 | \ |
79 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
232 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
80 | init (base + cur, newcnt - cur); \ |
233 | init (base + cur, newcnt - cur); \ |
81 | cur = newcnt; \ |
234 | cur = newcnt; \ |
82 | } |
235 | } |
83 | |
236 | |
84 | typedef struct |
237 | /*****************************************************************************/ |
85 | { |
|
|
86 | struct ev_io *head; |
|
|
87 | unsigned char wev, rev; /* want, received event set */ |
|
|
88 | } ANFD; |
|
|
89 | |
|
|
90 | static ANFD *anfds; |
|
|
91 | static int anfdmax; |
|
|
92 | |
|
|
93 | static int *fdchanges; |
|
|
94 | static int fdchangemax, fdchangecnt; |
|
|
95 | |
238 | |
96 | static void |
239 | static void |
97 | anfds_init (ANFD *base, int count) |
240 | anfds_init (ANFD *base, int count) |
98 | { |
241 | { |
99 | while (count--) |
242 | while (count--) |
100 | { |
243 | { |
101 | base->head = 0; |
244 | base->head = 0; |
102 | base->wev = base->rev = EV_NONE; |
245 | base->events = EV_NONE; |
|
|
246 | base->reify = 0; |
|
|
247 | |
103 | ++base; |
248 | ++base; |
104 | } |
249 | } |
105 | } |
250 | } |
106 | |
251 | |
107 | typedef struct |
|
|
108 | { |
|
|
109 | struct ev_watcher *w; |
|
|
110 | int events; |
|
|
111 | } ANPENDING; |
|
|
112 | |
|
|
113 | static ANPENDING *pendings; |
|
|
114 | static int pendingmax, pendingcnt; |
|
|
115 | |
|
|
116 | static void |
252 | static void |
117 | event (struct ev_watcher *w, int events) |
253 | event (EV_P_ W w, int events) |
118 | { |
254 | { |
|
|
255 | if (w->pending) |
|
|
256 | { |
|
|
257 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
|
|
258 | return; |
|
|
259 | } |
|
|
260 | |
119 | w->pending = ++pendingcnt; |
261 | w->pending = ++pendingcnt [ABSPRI (w)]; |
120 | array_needsize (pendings, pendingmax, pendingcnt, ); |
262 | array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], ); |
121 | pendings [pendingcnt - 1].w = w; |
263 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
122 | pendings [pendingcnt - 1].events = events; |
264 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
123 | } |
265 | } |
124 | |
266 | |
125 | static void |
267 | static void |
|
|
268 | queue_events (EV_P_ W *events, int eventcnt, int type) |
|
|
269 | { |
|
|
270 | int i; |
|
|
271 | |
|
|
272 | for (i = 0; i < eventcnt; ++i) |
|
|
273 | event (EV_A_ events [i], type); |
|
|
274 | } |
|
|
275 | |
|
|
276 | static void |
126 | fd_event (int fd, int events) |
277 | fd_event (EV_P_ int fd, int events) |
127 | { |
278 | { |
128 | ANFD *anfd = anfds + fd; |
279 | ANFD *anfd = anfds + fd; |
129 | struct ev_io *w; |
280 | struct ev_io *w; |
130 | |
281 | |
131 | for (w = anfd->head; w; w = w->next) |
282 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
132 | { |
283 | { |
133 | int ev = w->events & events; |
284 | int ev = w->events & events; |
134 | |
285 | |
135 | if (ev) |
286 | if (ev) |
136 | event ((struct ev_watcher *)w, ev); |
287 | event (EV_A_ (W)w, ev); |
|
|
288 | } |
|
|
289 | } |
|
|
290 | |
|
|
291 | /*****************************************************************************/ |
|
|
292 | |
|
|
293 | static void |
|
|
294 | fd_reify (EV_P) |
|
|
295 | { |
|
|
296 | int i; |
|
|
297 | |
|
|
298 | for (i = 0; i < fdchangecnt; ++i) |
|
|
299 | { |
|
|
300 | int fd = fdchanges [i]; |
|
|
301 | ANFD *anfd = anfds + fd; |
|
|
302 | struct ev_io *w; |
|
|
303 | |
|
|
304 | int events = 0; |
|
|
305 | |
|
|
306 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
|
|
307 | events |= w->events; |
|
|
308 | |
|
|
309 | anfd->reify = 0; |
|
|
310 | |
|
|
311 | if (anfd->events != events) |
|
|
312 | { |
|
|
313 | method_modify (EV_A_ fd, anfd->events, events); |
|
|
314 | anfd->events = events; |
|
|
315 | } |
|
|
316 | } |
|
|
317 | |
|
|
318 | fdchangecnt = 0; |
|
|
319 | } |
|
|
320 | |
|
|
321 | static void |
|
|
322 | fd_change (EV_P_ int fd) |
|
|
323 | { |
|
|
324 | if (anfds [fd].reify || fdchangecnt < 0) |
|
|
325 | return; |
|
|
326 | |
|
|
327 | anfds [fd].reify = 1; |
|
|
328 | |
|
|
329 | ++fdchangecnt; |
|
|
330 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
|
|
331 | fdchanges [fdchangecnt - 1] = fd; |
|
|
332 | } |
|
|
333 | |
|
|
334 | static void |
|
|
335 | fd_kill (EV_P_ int fd) |
|
|
336 | { |
|
|
337 | struct ev_io *w; |
|
|
338 | |
|
|
339 | while ((w = (struct ev_io *)anfds [fd].head)) |
|
|
340 | { |
|
|
341 | ev_io_stop (EV_A_ w); |
|
|
342 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
|
|
343 | } |
|
|
344 | } |
|
|
345 | |
|
|
346 | /* called on EBADF to verify fds */ |
|
|
347 | static void |
|
|
348 | fd_ebadf (EV_P) |
|
|
349 | { |
|
|
350 | int fd; |
|
|
351 | |
|
|
352 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
353 | if (anfds [fd].events) |
|
|
354 | if (fcntl (fd, F_GETFD) == -1 && errno == EBADF) |
|
|
355 | fd_kill (EV_A_ fd); |
|
|
356 | } |
|
|
357 | |
|
|
358 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
|
|
359 | static void |
|
|
360 | fd_enomem (EV_P) |
|
|
361 | { |
|
|
362 | int fd; |
|
|
363 | |
|
|
364 | for (fd = anfdmax; fd--; ) |
|
|
365 | if (anfds [fd].events) |
|
|
366 | { |
|
|
367 | close (fd); |
|
|
368 | fd_kill (EV_A_ fd); |
|
|
369 | return; |
137 | } |
370 | } |
138 | } |
371 | } |
139 | |
372 | |
140 | static struct ev_timer **atimers; |
373 | /* susually called after fork if method needs to re-arm all fds from scratch */ |
141 | static int atimermax, atimercnt; |
|
|
142 | |
|
|
143 | static struct ev_timer **rtimers; |
|
|
144 | static int rtimermax, rtimercnt; |
|
|
145 | |
|
|
146 | static void |
374 | static void |
147 | upheap (struct ev_timer **timers, int k) |
375 | fd_rearm_all (EV_P) |
148 | { |
376 | { |
149 | struct ev_timer *w = timers [k]; |
377 | int fd; |
150 | |
378 | |
|
|
379 | /* this should be highly optimised to not do anything but set a flag */ |
|
|
380 | for (fd = 0; fd < anfdmax; ++fd) |
|
|
381 | if (anfds [fd].events) |
|
|
382 | { |
|
|
383 | anfds [fd].events = 0; |
|
|
384 | fd_change (EV_A_ fd); |
|
|
385 | } |
|
|
386 | } |
|
|
387 | |
|
|
388 | /*****************************************************************************/ |
|
|
389 | |
|
|
390 | static void |
|
|
391 | upheap (WT *heap, int k) |
|
|
392 | { |
|
|
393 | WT w = heap [k]; |
|
|
394 | |
151 | while (k && timers [k >> 1]->at > w->at) |
395 | while (k && heap [k >> 1]->at > w->at) |
152 | { |
396 | { |
153 | timers [k] = timers [k >> 1]; |
397 | heap [k] = heap [k >> 1]; |
154 | timers [k]->active = k + 1; |
398 | ((W)heap [k])->active = k + 1; |
155 | k >>= 1; |
399 | k >>= 1; |
156 | } |
400 | } |
157 | |
401 | |
158 | timers [k] = w; |
402 | heap [k] = w; |
159 | timers [k]->active = k + 1; |
403 | ((W)heap [k])->active = k + 1; |
160 | |
404 | |
161 | } |
405 | } |
162 | |
406 | |
163 | static void |
407 | static void |
164 | downheap (struct ev_timer **timers, int N, int k) |
408 | downheap (WT *heap, int N, int k) |
165 | { |
409 | { |
166 | struct ev_timer *w = timers [k]; |
410 | WT w = heap [k]; |
167 | |
411 | |
168 | while (k < (N >> 1)) |
412 | while (k < (N >> 1)) |
169 | { |
413 | { |
170 | int j = k << 1; |
414 | int j = k << 1; |
171 | |
415 | |
172 | if (j + 1 < N && timers [j]->at > timers [j + 1]->at) |
416 | if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
173 | ++j; |
417 | ++j; |
174 | |
418 | |
175 | if (w->at <= timers [j]->at) |
419 | if (w->at <= heap [j]->at) |
176 | break; |
420 | break; |
177 | |
421 | |
178 | timers [k] = timers [j]; |
422 | heap [k] = heap [j]; |
179 | timers [k]->active = k + 1; |
423 | ((W)heap [k])->active = k + 1; |
180 | k = j; |
424 | k = j; |
181 | } |
425 | } |
182 | |
426 | |
183 | timers [k] = w; |
427 | heap [k] = w; |
184 | timers [k]->active = k + 1; |
428 | ((W)heap [k])->active = k + 1; |
185 | } |
429 | } |
|
|
430 | |
|
|
431 | /*****************************************************************************/ |
186 | |
432 | |
187 | typedef struct |
433 | typedef struct |
188 | { |
434 | { |
189 | struct ev_signal *head; |
435 | struct ev_watcher_list *head; |
190 | sig_atomic_t gotsig; |
436 | sig_atomic_t volatile gotsig; |
191 | } ANSIG; |
437 | } ANSIG; |
192 | |
438 | |
193 | static ANSIG *signals; |
439 | static ANSIG *signals; |
194 | static int signalmax; |
440 | static int signalmax; |
195 | |
441 | |
196 | static int sigpipe [2]; |
442 | static int sigpipe [2]; |
197 | static sig_atomic_t gotsig; |
443 | static sig_atomic_t volatile gotsig; |
198 | static struct ev_io sigev; |
444 | static struct ev_io sigev; |
199 | |
445 | |
200 | static void |
446 | static void |
201 | signals_init (ANSIG *base, int count) |
447 | signals_init (ANSIG *base, int count) |
202 | { |
448 | { |
203 | while (count--) |
449 | while (count--) |
204 | { |
450 | { |
205 | base->head = 0; |
451 | base->head = 0; |
206 | base->gotsig = 0; |
452 | base->gotsig = 0; |
|
|
453 | |
207 | ++base; |
454 | ++base; |
208 | } |
455 | } |
209 | } |
456 | } |
210 | |
457 | |
211 | static void |
458 | static void |
… | |
… | |
213 | { |
460 | { |
214 | signals [signum - 1].gotsig = 1; |
461 | signals [signum - 1].gotsig = 1; |
215 | |
462 | |
216 | if (!gotsig) |
463 | if (!gotsig) |
217 | { |
464 | { |
|
|
465 | int old_errno = errno; |
218 | gotsig = 1; |
466 | gotsig = 1; |
219 | write (sigpipe [1], &gotsig, 1); |
467 | write (sigpipe [1], &signum, 1); |
|
|
468 | errno = old_errno; |
220 | } |
469 | } |
221 | } |
470 | } |
222 | |
471 | |
223 | static void |
472 | static void |
224 | sigcb (struct ev_io *iow, int revents) |
473 | sigcb (EV_P_ struct ev_io *iow, int revents) |
225 | { |
474 | { |
226 | struct ev_signal *w; |
475 | struct ev_watcher_list *w; |
227 | int sig; |
476 | int signum; |
228 | |
477 | |
|
|
478 | read (sigpipe [0], &revents, 1); |
229 | gotsig = 0; |
479 | gotsig = 0; |
230 | read (sigpipe [0], &revents, 1); |
|
|
231 | |
480 | |
232 | for (sig = signalmax; sig--; ) |
481 | for (signum = signalmax; signum--; ) |
233 | if (signals [sig].gotsig) |
482 | if (signals [signum].gotsig) |
234 | { |
483 | { |
235 | signals [sig].gotsig = 0; |
484 | signals [signum].gotsig = 0; |
236 | |
485 | |
237 | for (w = signals [sig].head; w; w = w->next) |
486 | for (w = signals [signum].head; w; w = w->next) |
238 | event ((struct ev_watcher *)w, EV_SIGNAL); |
487 | event (EV_A_ (W)w, EV_SIGNAL); |
239 | } |
488 | } |
240 | } |
489 | } |
241 | |
490 | |
242 | static void |
491 | static void |
243 | siginit (void) |
492 | siginit (EV_P) |
244 | { |
493 | { |
|
|
494 | #ifndef WIN32 |
245 | fcntl (sigpipe [0], F_SETFD, FD_CLOEXEC); |
495 | fcntl (sigpipe [0], F_SETFD, FD_CLOEXEC); |
246 | fcntl (sigpipe [1], F_SETFD, FD_CLOEXEC); |
496 | fcntl (sigpipe [1], F_SETFD, FD_CLOEXEC); |
247 | |
497 | |
248 | /* rather than sort out wether we really need nb, set it */ |
498 | /* rather than sort out wether we really need nb, set it */ |
249 | fcntl (sigpipe [0], F_SETFL, O_NONBLOCK); |
499 | fcntl (sigpipe [0], F_SETFL, O_NONBLOCK); |
250 | fcntl (sigpipe [1], F_SETFL, O_NONBLOCK); |
500 | fcntl (sigpipe [1], F_SETFL, O_NONBLOCK); |
|
|
501 | #endif |
251 | |
502 | |
252 | evio_set (&sigev, sigpipe [0], EV_READ); |
503 | ev_io_set (&sigev, sigpipe [0], EV_READ); |
253 | evio_start (&sigev); |
504 | ev_io_start (EV_A_ &sigev); |
|
|
505 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
254 | } |
506 | } |
255 | |
507 | |
|
|
508 | /*****************************************************************************/ |
|
|
509 | |
|
|
510 | #ifndef WIN32 |
|
|
511 | |
|
|
512 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
513 | static struct ev_signal childev; |
|
|
514 | |
|
|
515 | #ifndef WCONTINUED |
|
|
516 | # define WCONTINUED 0 |
|
|
517 | #endif |
|
|
518 | |
|
|
519 | static void |
|
|
520 | child_reap (EV_P_ struct ev_signal *sw, int chain, int pid, int status) |
|
|
521 | { |
|
|
522 | struct ev_child *w; |
|
|
523 | |
|
|
524 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
|
|
525 | if (w->pid == pid || !w->pid) |
|
|
526 | { |
|
|
527 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
|
|
528 | w->rpid = pid; |
|
|
529 | w->rstatus = status; |
|
|
530 | event (EV_A_ (W)w, EV_CHILD); |
|
|
531 | } |
|
|
532 | } |
|
|
533 | |
|
|
534 | static void |
|
|
535 | childcb (EV_P_ struct ev_signal *sw, int revents) |
|
|
536 | { |
|
|
537 | int pid, status; |
|
|
538 | |
|
|
539 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
|
|
540 | { |
|
|
541 | /* make sure we are called again until all childs have been reaped */ |
|
|
542 | event (EV_A_ (W)sw, EV_SIGNAL); |
|
|
543 | |
|
|
544 | child_reap (EV_A_ sw, pid, pid, status); |
|
|
545 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
|
|
546 | } |
|
|
547 | } |
|
|
548 | |
|
|
549 | #endif |
|
|
550 | |
|
|
551 | /*****************************************************************************/ |
|
|
552 | |
|
|
553 | #if EV_USE_KQUEUE |
|
|
554 | # include "ev_kqueue.c" |
|
|
555 | #endif |
256 | #if HAVE_EPOLL |
556 | #if EV_USE_EPOLL |
257 | # include "ev_epoll.c" |
557 | # include "ev_epoll.c" |
258 | #endif |
558 | #endif |
|
|
559 | #if EV_USE_POLL |
|
|
560 | # include "ev_poll.c" |
|
|
561 | #endif |
259 | #if HAVE_SELECT |
562 | #if EV_USE_SELECT |
260 | # include "ev_select.c" |
563 | # include "ev_select.c" |
261 | #endif |
564 | #endif |
262 | |
565 | |
263 | int ev_init (int flags) |
566 | int |
|
|
567 | ev_version_major (void) |
264 | { |
568 | { |
|
|
569 | return EV_VERSION_MAJOR; |
|
|
570 | } |
|
|
571 | |
|
|
572 | int |
|
|
573 | ev_version_minor (void) |
|
|
574 | { |
|
|
575 | return EV_VERSION_MINOR; |
|
|
576 | } |
|
|
577 | |
|
|
578 | /* return true if we are running with elevated privileges and should ignore env variables */ |
|
|
579 | static int |
|
|
580 | enable_secure (void) |
|
|
581 | { |
|
|
582 | #ifdef WIN32 |
|
|
583 | return 0; |
|
|
584 | #else |
|
|
585 | return getuid () != geteuid () |
|
|
586 | || getgid () != getegid (); |
|
|
587 | #endif |
|
|
588 | } |
|
|
589 | |
|
|
590 | int |
|
|
591 | ev_method (EV_P) |
|
|
592 | { |
|
|
593 | return method; |
|
|
594 | } |
|
|
595 | |
|
|
596 | static void |
|
|
597 | loop_init (EV_P_ int methods) |
|
|
598 | { |
|
|
599 | if (!method) |
|
|
600 | { |
265 | #if HAVE_MONOTONIC |
601 | #if EV_USE_MONOTONIC |
266 | { |
602 | { |
267 | struct timespec ts; |
603 | struct timespec ts; |
268 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
604 | if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
269 | have_monotonic = 1; |
605 | have_monotonic = 1; |
270 | } |
606 | } |
271 | #endif |
607 | #endif |
272 | |
608 | |
273 | ev_now = ev_time (); |
609 | rt_now = ev_time (); |
274 | now = get_clock (); |
610 | mn_now = get_clock (); |
275 | diff = ev_now - now; |
611 | now_floor = mn_now; |
|
|
612 | rtmn_diff = rt_now - mn_now; |
276 | |
613 | |
|
|
614 | if (methods == EVMETHOD_AUTO) |
|
|
615 | if (!enable_secure () && getenv ("LIBEV_METHODS")) |
|
|
616 | methods = atoi (getenv ("LIBEV_METHODS")); |
|
|
617 | else |
|
|
618 | methods = EVMETHOD_ANY; |
|
|
619 | |
|
|
620 | method = 0; |
|
|
621 | #if EV_USE_WIN32 |
|
|
622 | if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
|
|
623 | #endif |
|
|
624 | #if EV_USE_KQUEUE |
|
|
625 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
|
|
626 | #endif |
|
|
627 | #if EV_USE_EPOLL |
|
|
628 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
|
|
629 | #endif |
|
|
630 | #if EV_USE_POLL |
|
|
631 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
|
|
632 | #endif |
|
|
633 | #if EV_USE_SELECT |
|
|
634 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
|
|
635 | #endif |
|
|
636 | } |
|
|
637 | } |
|
|
638 | |
|
|
639 | void |
|
|
640 | loop_destroy (EV_P) |
|
|
641 | { |
|
|
642 | #if EV_USE_WIN32 |
|
|
643 | if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
|
|
644 | #endif |
|
|
645 | #if EV_USE_KQUEUE |
|
|
646 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
|
|
647 | #endif |
|
|
648 | #if EV_USE_EPOLL |
|
|
649 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
|
|
650 | #endif |
|
|
651 | #if EV_USE_POLL |
|
|
652 | if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
|
|
653 | #endif |
|
|
654 | #if EV_USE_SELECT |
|
|
655 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
|
|
656 | #endif |
|
|
657 | |
|
|
658 | method = 0; |
|
|
659 | /*TODO*/ |
|
|
660 | } |
|
|
661 | |
|
|
662 | void |
|
|
663 | loop_fork (EV_P) |
|
|
664 | { |
|
|
665 | /*TODO*/ |
|
|
666 | #if EV_USE_EPOLL |
|
|
667 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
|
|
668 | #endif |
|
|
669 | #if EV_USE_KQUEUE |
|
|
670 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
|
|
671 | #endif |
|
|
672 | } |
|
|
673 | |
|
|
674 | #if EV_MULTIPLICITY |
|
|
675 | struct ev_loop * |
|
|
676 | ev_loop_new (int methods) |
|
|
677 | { |
|
|
678 | struct ev_loop *loop = (struct ev_loop *)calloc (1, sizeof (struct ev_loop)); |
|
|
679 | |
|
|
680 | loop_init (EV_A_ methods); |
|
|
681 | |
|
|
682 | if (ev_method (EV_A)) |
|
|
683 | return loop; |
|
|
684 | |
|
|
685 | return 0; |
|
|
686 | } |
|
|
687 | |
|
|
688 | void |
|
|
689 | ev_loop_destroy (EV_P) |
|
|
690 | { |
|
|
691 | loop_destroy (EV_A); |
|
|
692 | free (loop); |
|
|
693 | } |
|
|
694 | |
|
|
695 | void |
|
|
696 | ev_loop_fork (EV_P) |
|
|
697 | { |
|
|
698 | loop_fork (EV_A); |
|
|
699 | } |
|
|
700 | |
|
|
701 | #endif |
|
|
702 | |
|
|
703 | #if EV_MULTIPLICITY |
|
|
704 | struct ev_loop default_loop_struct; |
|
|
705 | static struct ev_loop *default_loop; |
|
|
706 | |
|
|
707 | struct ev_loop * |
|
|
708 | #else |
|
|
709 | static int default_loop; |
|
|
710 | |
|
|
711 | int |
|
|
712 | #endif |
|
|
713 | ev_default_loop (int methods) |
|
|
714 | { |
|
|
715 | if (sigpipe [0] == sigpipe [1]) |
277 | if (pipe (sigpipe)) |
716 | if (pipe (sigpipe)) |
278 | return 0; |
717 | return 0; |
279 | |
718 | |
280 | ev_method = EVMETHOD_NONE; |
719 | if (!default_loop) |
281 | #if HAVE_EPOLL |
|
|
282 | if (ev_method == EVMETHOD_NONE) epoll_init (flags); |
|
|
283 | #endif |
|
|
284 | #if HAVE_SELECT |
|
|
285 | if (ev_method == EVMETHOD_NONE) select_init (flags); |
|
|
286 | #endif |
|
|
287 | |
|
|
288 | if (ev_method) |
|
|
289 | { |
720 | { |
|
|
721 | #if EV_MULTIPLICITY |
|
|
722 | struct ev_loop *loop = default_loop = &default_loop_struct; |
|
|
723 | #else |
|
|
724 | default_loop = 1; |
|
|
725 | #endif |
|
|
726 | |
|
|
727 | loop_init (EV_A_ methods); |
|
|
728 | |
|
|
729 | if (ev_method (EV_A)) |
|
|
730 | { |
290 | evw_init (&sigev, sigcb, 0); |
731 | ev_watcher_init (&sigev, sigcb); |
|
|
732 | ev_set_priority (&sigev, EV_MAXPRI); |
291 | siginit (); |
733 | siginit (EV_A); |
292 | } |
|
|
293 | |
734 | |
294 | return ev_method; |
735 | #ifndef WIN32 |
295 | } |
736 | ev_signal_init (&childev, childcb, SIGCHLD); |
296 | |
737 | ev_set_priority (&childev, EV_MAXPRI); |
297 | void ev_prefork (void) |
738 | ev_signal_start (EV_A_ &childev); |
298 | { |
739 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
299 | } |
|
|
300 | |
|
|
301 | void ev_postfork_parent (void) |
|
|
302 | { |
|
|
303 | } |
|
|
304 | |
|
|
305 | void ev_postfork_child (void) |
|
|
306 | { |
|
|
307 | #if HAVE_EPOLL |
|
|
308 | if (ev_method == EVMETHOD_EPOLL) |
|
|
309 | epoll_postfork_child (); |
|
|
310 | #endif |
740 | #endif |
|
|
741 | } |
|
|
742 | else |
|
|
743 | default_loop = 0; |
|
|
744 | } |
311 | |
745 | |
|
|
746 | return default_loop; |
|
|
747 | } |
|
|
748 | |
|
|
749 | void |
|
|
750 | ev_default_destroy (void) |
|
|
751 | { |
|
|
752 | #if EV_MULTIPLICITY |
|
|
753 | struct ev_loop *loop = default_loop; |
|
|
754 | #endif |
|
|
755 | |
|
|
756 | ev_ref (EV_A); /* child watcher */ |
|
|
757 | ev_signal_stop (EV_A_ &childev); |
|
|
758 | |
|
|
759 | ev_ref (EV_A); /* signal watcher */ |
312 | evio_stop (&sigev); |
760 | ev_io_stop (EV_A_ &sigev); |
|
|
761 | |
|
|
762 | close (sigpipe [0]); sigpipe [0] = 0; |
|
|
763 | close (sigpipe [1]); sigpipe [1] = 0; |
|
|
764 | |
|
|
765 | loop_destroy (EV_A); |
|
|
766 | } |
|
|
767 | |
|
|
768 | void |
|
|
769 | ev_default_fork (void) |
|
|
770 | { |
|
|
771 | #if EV_MULTIPLICITY |
|
|
772 | struct ev_loop *loop = default_loop; |
|
|
773 | #endif |
|
|
774 | |
|
|
775 | loop_fork (EV_A); |
|
|
776 | |
|
|
777 | ev_io_stop (EV_A_ &sigev); |
313 | close (sigpipe [0]); |
778 | close (sigpipe [0]); |
314 | close (sigpipe [1]); |
779 | close (sigpipe [1]); |
315 | pipe (sigpipe); |
780 | pipe (sigpipe); |
|
|
781 | |
|
|
782 | ev_ref (EV_A); /* signal watcher */ |
316 | siginit (); |
783 | siginit (EV_A); |
317 | } |
784 | } |
318 | |
785 | |
|
|
786 | /*****************************************************************************/ |
|
|
787 | |
319 | static void |
788 | static void |
320 | fd_reify (void) |
789 | call_pending (EV_P) |
321 | { |
790 | { |
322 | int i; |
791 | int pri; |
323 | |
792 | |
324 | for (i = 0; i < fdchangecnt; ++i) |
793 | for (pri = NUMPRI; pri--; ) |
325 | { |
794 | while (pendingcnt [pri]) |
326 | int fd = fdchanges [i]; |
|
|
327 | ANFD *anfd = anfds + fd; |
|
|
328 | struct ev_io *w; |
|
|
329 | |
|
|
330 | int wev = 0; |
|
|
331 | |
|
|
332 | for (w = anfd->head; w; w = w->next) |
|
|
333 | wev |= w->events; |
|
|
334 | |
|
|
335 | if (anfd->wev != wev) |
|
|
336 | { |
795 | { |
337 | method_modify (fd, anfd->wev, wev); |
796 | ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
338 | anfd->wev = wev; |
|
|
339 | } |
|
|
340 | } |
|
|
341 | |
797 | |
342 | fdchangecnt = 0; |
|
|
343 | } |
|
|
344 | |
|
|
345 | static void |
|
|
346 | call_pending () |
|
|
347 | { |
|
|
348 | int i; |
|
|
349 | |
|
|
350 | for (i = 0; i < pendingcnt; ++i) |
|
|
351 | { |
|
|
352 | ANPENDING *p = pendings + i; |
|
|
353 | |
|
|
354 | if (p->w) |
798 | if (p->w) |
355 | { |
799 | { |
356 | p->w->pending = 0; |
800 | p->w->pending = 0; |
357 | p->w->cb (p->w, p->events); |
801 | |
|
|
802 | (*(void (**)(EV_P_ W, int))&p->w->cb) (EV_A_ p->w, p->events); |
358 | } |
803 | } |
359 | } |
804 | } |
360 | |
|
|
361 | pendingcnt = 0; |
|
|
362 | } |
805 | } |
363 | |
806 | |
364 | static void |
807 | static void |
365 | timers_reify (struct ev_timer **timers, int timercnt, ev_tstamp now) |
808 | timers_reify (EV_P) |
366 | { |
809 | { |
367 | while (timercnt && timers [0]->at <= now) |
810 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
368 | { |
811 | { |
369 | struct ev_timer *w = timers [0]; |
812 | struct ev_timer *w = timers [0]; |
|
|
813 | |
|
|
814 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
370 | |
815 | |
371 | /* first reschedule or stop timer */ |
816 | /* first reschedule or stop timer */ |
372 | if (w->repeat) |
817 | if (w->repeat) |
373 | { |
818 | { |
374 | if (w->is_abs) |
819 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
375 | w->at += floor ((now - w->at) / w->repeat + 1.) * w->repeat; |
|
|
376 | else |
|
|
377 | w->at = now + w->repeat; |
820 | ((WT)w)->at = mn_now + w->repeat; |
378 | |
|
|
379 | assert (w->at > now); |
|
|
380 | |
|
|
381 | downheap (timers, timercnt, 0); |
821 | downheap ((WT *)timers, timercnt, 0); |
382 | } |
822 | } |
383 | else |
823 | else |
|
|
824 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
|
|
825 | |
|
|
826 | event (EV_A_ (W)w, EV_TIMEOUT); |
|
|
827 | } |
|
|
828 | } |
|
|
829 | |
|
|
830 | static void |
|
|
831 | periodics_reify (EV_P) |
|
|
832 | { |
|
|
833 | while (periodiccnt && ((WT)periodics [0])->at <= rt_now) |
|
|
834 | { |
|
|
835 | struct ev_periodic *w = periodics [0]; |
|
|
836 | |
|
|
837 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
|
|
838 | |
|
|
839 | /* first reschedule or stop timer */ |
|
|
840 | if (w->interval) |
384 | { |
841 | { |
385 | evtimer_stop (w); /* nonrepeating: stop timer */ |
842 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
386 | --timercnt; /* maybe pass by reference instead? */ |
843 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
|
|
844 | downheap ((WT *)periodics, periodiccnt, 0); |
387 | } |
845 | } |
|
|
846 | else |
|
|
847 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
388 | |
848 | |
389 | event ((struct ev_watcher *)w, EV_TIMEOUT); |
849 | event (EV_A_ (W)w, EV_PERIODIC); |
390 | } |
850 | } |
391 | } |
851 | } |
392 | |
852 | |
393 | static void |
853 | static void |
394 | time_update () |
854 | periodics_reschedule (EV_P) |
395 | { |
855 | { |
396 | int i; |
856 | int i; |
397 | ev_now = ev_time (); |
|
|
398 | |
857 | |
399 | if (have_monotonic) |
858 | /* adjust periodics after time jump */ |
|
|
859 | for (i = 0; i < periodiccnt; ++i) |
400 | { |
860 | { |
401 | ev_tstamp odiff = diff; |
861 | struct ev_periodic *w = periodics [i]; |
402 | |
862 | |
403 | /* detecting time jumps is much more difficult */ |
863 | if (w->interval) |
404 | for (i = 2; --i; ) /* loop a few times, before making important decisions */ |
|
|
405 | { |
864 | { |
406 | now = get_clock (); |
865 | ev_tstamp diff = ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
407 | diff = ev_now - now; |
|
|
408 | |
866 | |
409 | if (fabs (odiff - diff) < MIN_TIMEJUMP) |
867 | if (fabs (diff) >= 1e-4) |
410 | return; /* all is well */ |
868 | { |
|
|
869 | ev_periodic_stop (EV_A_ w); |
|
|
870 | ev_periodic_start (EV_A_ w); |
411 | |
871 | |
412 | ev_now = ev_time (); |
872 | i = 0; /* restart loop, inefficient, but time jumps should be rare */ |
|
|
873 | } |
413 | } |
874 | } |
|
|
875 | } |
|
|
876 | } |
414 | |
877 | |
415 | /* time jump detected, reschedule atimers */ |
878 | inline int |
416 | for (i = 0; i < atimercnt; ++i) |
879 | time_update_monotonic (EV_P) |
|
|
880 | { |
|
|
881 | mn_now = get_clock (); |
|
|
882 | |
|
|
883 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
|
|
884 | { |
|
|
885 | rt_now = rtmn_diff + mn_now; |
|
|
886 | return 0; |
|
|
887 | } |
|
|
888 | else |
|
|
889 | { |
|
|
890 | now_floor = mn_now; |
|
|
891 | rt_now = ev_time (); |
|
|
892 | return 1; |
|
|
893 | } |
|
|
894 | } |
|
|
895 | |
|
|
896 | static void |
|
|
897 | time_update (EV_P) |
|
|
898 | { |
|
|
899 | int i; |
|
|
900 | |
|
|
901 | #if EV_USE_MONOTONIC |
|
|
902 | if (expect_true (have_monotonic)) |
|
|
903 | { |
|
|
904 | if (time_update_monotonic (EV_A)) |
417 | { |
905 | { |
418 | struct ev_timer *w = atimers [i]; |
906 | ev_tstamp odiff = rtmn_diff; |
419 | w->at += ceil ((ev_now - w->at) / w->repeat + 1.) * w->repeat; |
907 | |
|
|
908 | for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
|
|
909 | { |
|
|
910 | rtmn_diff = rt_now - mn_now; |
|
|
911 | |
|
|
912 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
|
|
913 | return; /* all is well */ |
|
|
914 | |
|
|
915 | rt_now = ev_time (); |
|
|
916 | mn_now = get_clock (); |
|
|
917 | now_floor = mn_now; |
|
|
918 | } |
|
|
919 | |
|
|
920 | periodics_reschedule (EV_A); |
|
|
921 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
|
|
922 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
420 | } |
923 | } |
421 | } |
924 | } |
422 | else |
925 | else |
|
|
926 | #endif |
423 | { |
927 | { |
424 | if (now > ev_now || now < ev_now - MAX_BLOCKTIME - MIN_TIMEJUMP) |
928 | rt_now = ev_time (); |
425 | /* time jump detected, adjust rtimers */ |
929 | |
|
|
930 | if (expect_false (mn_now > rt_now || mn_now < rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
|
|
931 | { |
|
|
932 | periodics_reschedule (EV_A); |
|
|
933 | |
|
|
934 | /* adjust timers. this is easy, as the offset is the same for all */ |
426 | for (i = 0; i < rtimercnt; ++i) |
935 | for (i = 0; i < timercnt; ++i) |
427 | rtimers [i]->at += ev_now - now; |
936 | ((WT)timers [i])->at += rt_now - mn_now; |
|
|
937 | } |
428 | |
938 | |
429 | now = ev_now; |
939 | mn_now = rt_now; |
430 | } |
940 | } |
431 | } |
941 | } |
432 | |
942 | |
433 | int ev_loop_done; |
943 | void |
|
|
944 | ev_ref (EV_P) |
|
|
945 | { |
|
|
946 | ++activecnt; |
|
|
947 | } |
434 | |
948 | |
|
|
949 | void |
|
|
950 | ev_unref (EV_P) |
|
|
951 | { |
|
|
952 | --activecnt; |
|
|
953 | } |
|
|
954 | |
|
|
955 | static int loop_done; |
|
|
956 | |
|
|
957 | void |
435 | void ev_loop (int flags) |
958 | ev_loop (EV_P_ int flags) |
436 | { |
959 | { |
437 | double block; |
960 | double block; |
438 | ev_loop_done = flags & EVLOOP_ONESHOT; |
961 | loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
439 | |
962 | |
440 | do |
963 | do |
441 | { |
964 | { |
|
|
965 | /* queue check watchers (and execute them) */ |
|
|
966 | if (expect_false (preparecnt)) |
|
|
967 | { |
|
|
968 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
|
|
969 | call_pending (EV_A); |
|
|
970 | } |
|
|
971 | |
442 | /* update fd-related kernel structures */ |
972 | /* update fd-related kernel structures */ |
443 | fd_reify (); |
973 | fd_reify (EV_A); |
444 | |
974 | |
445 | /* calculate blocking time */ |
975 | /* calculate blocking time */ |
|
|
976 | |
|
|
977 | /* we only need this for !monotonic clockor timers, but as we basically |
|
|
978 | always have timers, we just calculate it always */ |
|
|
979 | #if EV_USE_MONOTONIC |
|
|
980 | if (expect_true (have_monotonic)) |
|
|
981 | time_update_monotonic (EV_A); |
|
|
982 | else |
|
|
983 | #endif |
|
|
984 | { |
|
|
985 | rt_now = ev_time (); |
|
|
986 | mn_now = rt_now; |
|
|
987 | } |
|
|
988 | |
446 | if (flags & EVLOOP_NONBLOCK) |
989 | if (flags & EVLOOP_NONBLOCK || idlecnt) |
447 | block = 0.; |
990 | block = 0.; |
448 | else |
991 | else |
449 | { |
992 | { |
450 | block = MAX_BLOCKTIME; |
993 | block = MAX_BLOCKTIME; |
451 | |
994 | |
452 | if (rtimercnt) |
995 | if (timercnt) |
453 | { |
996 | { |
454 | ev_tstamp to = rtimers [0]->at - get_clock () + method_fudge; |
997 | ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
455 | if (block > to) block = to; |
998 | if (block > to) block = to; |
456 | } |
999 | } |
457 | |
1000 | |
458 | if (atimercnt) |
1001 | if (periodiccnt) |
459 | { |
1002 | { |
460 | ev_tstamp to = atimers [0]->at - ev_time () + method_fudge; |
1003 | ev_tstamp to = ((WT)periodics [0])->at - rt_now + method_fudge; |
461 | if (block > to) block = to; |
1004 | if (block > to) block = to; |
462 | } |
1005 | } |
463 | |
1006 | |
464 | if (block < 0.) block = 0.; |
1007 | if (block < 0.) block = 0.; |
465 | } |
1008 | } |
466 | |
1009 | |
467 | method_poll (block); |
1010 | method_poll (EV_A_ block); |
468 | |
1011 | |
469 | /* update ev_now, do magic */ |
1012 | /* update rt_now, do magic */ |
470 | time_update (); |
1013 | time_update (EV_A); |
471 | |
1014 | |
472 | /* put pending timers into pendign queue and reschedule them */ |
1015 | /* queue pending timers and reschedule them */ |
473 | /* absolute timers first */ |
1016 | timers_reify (EV_A); /* relative timers called last */ |
474 | timers_reify (atimers, atimercnt, ev_now); |
1017 | periodics_reify (EV_A); /* absolute timers called first */ |
475 | /* relative timers second */ |
|
|
476 | timers_reify (rtimers, rtimercnt, now); |
|
|
477 | |
1018 | |
|
|
1019 | /* queue idle watchers unless io or timers are pending */ |
|
|
1020 | if (!pendingcnt) |
|
|
1021 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
|
|
1022 | |
|
|
1023 | /* queue check watchers, to be executed first */ |
|
|
1024 | if (checkcnt) |
|
|
1025 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
|
|
1026 | |
478 | call_pending (); |
1027 | call_pending (EV_A); |
479 | } |
1028 | } |
480 | while (!ev_loop_done); |
1029 | while (activecnt && !loop_done); |
481 | } |
|
|
482 | |
1030 | |
483 | static void |
1031 | if (loop_done != 2) |
484 | wlist_add (struct ev_watcher_list **head, struct ev_watcher_list *elem) |
1032 | loop_done = 0; |
|
|
1033 | } |
|
|
1034 | |
|
|
1035 | void |
|
|
1036 | ev_unloop (EV_P_ int how) |
|
|
1037 | { |
|
|
1038 | loop_done = how; |
|
|
1039 | } |
|
|
1040 | |
|
|
1041 | /*****************************************************************************/ |
|
|
1042 | |
|
|
1043 | inline void |
|
|
1044 | wlist_add (WL *head, WL elem) |
485 | { |
1045 | { |
486 | elem->next = *head; |
1046 | elem->next = *head; |
487 | *head = elem; |
1047 | *head = elem; |
488 | } |
1048 | } |
489 | |
1049 | |
490 | static void |
1050 | inline void |
491 | wlist_del (struct ev_watcher_list **head, struct ev_watcher_list *elem) |
1051 | wlist_del (WL *head, WL elem) |
492 | { |
1052 | { |
493 | while (*head) |
1053 | while (*head) |
494 | { |
1054 | { |
495 | if (*head == elem) |
1055 | if (*head == elem) |
496 | { |
1056 | { |
… | |
… | |
500 | |
1060 | |
501 | head = &(*head)->next; |
1061 | head = &(*head)->next; |
502 | } |
1062 | } |
503 | } |
1063 | } |
504 | |
1064 | |
505 | static void |
1065 | inline void |
506 | ev_start (struct ev_watcher *w, int active) |
1066 | ev_clear_pending (EV_P_ W w) |
507 | { |
1067 | { |
|
|
1068 | if (w->pending) |
|
|
1069 | { |
|
|
1070 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
508 | w->pending = 0; |
1071 | w->pending = 0; |
|
|
1072 | } |
|
|
1073 | } |
|
|
1074 | |
|
|
1075 | inline void |
|
|
1076 | ev_start (EV_P_ W w, int active) |
|
|
1077 | { |
|
|
1078 | if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
|
|
1079 | if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
|
|
1080 | |
509 | w->active = active; |
1081 | w->active = active; |
|
|
1082 | ev_ref (EV_A); |
510 | } |
1083 | } |
511 | |
1084 | |
512 | static void |
1085 | inline void |
513 | ev_stop (struct ev_watcher *w) |
1086 | ev_stop (EV_P_ W w) |
514 | { |
1087 | { |
515 | if (w->pending) |
1088 | ev_unref (EV_A); |
516 | pendings [w->pending - 1].w = 0; |
|
|
517 | |
|
|
518 | w->active = 0; |
1089 | w->active = 0; |
519 | /* nop */ |
|
|
520 | } |
1090 | } |
521 | |
1091 | |
|
|
1092 | /*****************************************************************************/ |
|
|
1093 | |
522 | void |
1094 | void |
523 | evio_start (struct ev_io *w) |
1095 | ev_io_start (EV_P_ struct ev_io *w) |
524 | { |
1096 | { |
|
|
1097 | int fd = w->fd; |
|
|
1098 | |
525 | if (ev_is_active (w)) |
1099 | if (ev_is_active (w)) |
526 | return; |
1100 | return; |
527 | |
1101 | |
528 | int fd = w->fd; |
1102 | assert (("ev_io_start called with negative fd", fd >= 0)); |
529 | |
1103 | |
530 | ev_start ((struct ev_watcher *)w, 1); |
1104 | ev_start (EV_A_ (W)w, 1); |
531 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
1105 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
532 | wlist_add ((struct ev_watcher_list **)&anfds[fd].head, (struct ev_watcher_list *)w); |
1106 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
533 | |
1107 | |
534 | ++fdchangecnt; |
1108 | fd_change (EV_A_ fd); |
535 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
|
|
536 | fdchanges [fdchangecnt - 1] = fd; |
|
|
537 | } |
1109 | } |
538 | |
1110 | |
539 | void |
1111 | void |
540 | evio_stop (struct ev_io *w) |
1112 | ev_io_stop (EV_P_ struct ev_io *w) |
541 | { |
1113 | { |
|
|
1114 | ev_clear_pending (EV_A_ (W)w); |
542 | if (!ev_is_active (w)) |
1115 | if (!ev_is_active (w)) |
543 | return; |
1116 | return; |
544 | |
1117 | |
545 | wlist_del ((struct ev_watcher_list **)&anfds[w->fd].head, (struct ev_watcher_list *)w); |
1118 | wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
546 | ev_stop ((struct ev_watcher *)w); |
1119 | ev_stop (EV_A_ (W)w); |
547 | |
1120 | |
548 | ++fdchangecnt; |
1121 | fd_change (EV_A_ w->fd); |
549 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
|
|
550 | fdchanges [fdchangecnt - 1] = w->fd; |
|
|
551 | } |
1122 | } |
552 | |
1123 | |
553 | void |
1124 | void |
554 | evtimer_start (struct ev_timer *w) |
1125 | ev_timer_start (EV_P_ struct ev_timer *w) |
555 | { |
1126 | { |
556 | if (ev_is_active (w)) |
1127 | if (ev_is_active (w)) |
557 | return; |
1128 | return; |
558 | |
1129 | |
559 | if (w->is_abs) |
1130 | ((WT)w)->at += mn_now; |
|
|
1131 | |
|
|
1132 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
|
|
1133 | |
|
|
1134 | ev_start (EV_A_ (W)w, ++timercnt); |
|
|
1135 | array_needsize (timers, timermax, timercnt, ); |
|
|
1136 | timers [timercnt - 1] = w; |
|
|
1137 | upheap ((WT *)timers, timercnt - 1); |
|
|
1138 | |
|
|
1139 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1140 | } |
|
|
1141 | |
|
|
1142 | void |
|
|
1143 | ev_timer_stop (EV_P_ struct ev_timer *w) |
|
|
1144 | { |
|
|
1145 | ev_clear_pending (EV_A_ (W)w); |
|
|
1146 | if (!ev_is_active (w)) |
|
|
1147 | return; |
|
|
1148 | |
|
|
1149 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1150 | |
|
|
1151 | if (((W)w)->active < timercnt--) |
|
|
1152 | { |
|
|
1153 | timers [((W)w)->active - 1] = timers [timercnt]; |
|
|
1154 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
560 | { |
1155 | } |
561 | /* this formula differs from the one in timer_reify becuse we do not round up */ |
1156 | |
|
|
1157 | ((WT)w)->at = w->repeat; |
|
|
1158 | |
|
|
1159 | ev_stop (EV_A_ (W)w); |
|
|
1160 | } |
|
|
1161 | |
|
|
1162 | void |
|
|
1163 | ev_timer_again (EV_P_ struct ev_timer *w) |
|
|
1164 | { |
|
|
1165 | if (ev_is_active (w)) |
|
|
1166 | { |
562 | if (w->repeat) |
1167 | if (w->repeat) |
563 | w->at += ceil ((ev_now - w->at) / w->repeat) * w->repeat; |
1168 | { |
564 | |
1169 | ((WT)w)->at = mn_now + w->repeat; |
565 | ev_start ((struct ev_watcher *)w, ++atimercnt); |
1170 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
566 | array_needsize (atimers, atimermax, atimercnt, ); |
1171 | } |
567 | atimers [atimercnt - 1] = w; |
|
|
568 | upheap (atimers, atimercnt - 1); |
|
|
569 | } |
|
|
570 | else |
1172 | else |
|
|
1173 | ev_timer_stop (EV_A_ w); |
571 | { |
1174 | } |
572 | w->at += now; |
1175 | else if (w->repeat) |
573 | |
1176 | ev_timer_start (EV_A_ w); |
574 | ev_start ((struct ev_watcher *)w, ++rtimercnt); |
|
|
575 | array_needsize (rtimers, rtimermax, rtimercnt, ); |
|
|
576 | rtimers [rtimercnt - 1] = w; |
|
|
577 | upheap (rtimers, rtimercnt - 1); |
|
|
578 | } |
|
|
579 | |
|
|
580 | } |
1177 | } |
581 | |
1178 | |
582 | void |
1179 | void |
583 | evtimer_stop (struct ev_timer *w) |
1180 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
584 | { |
1181 | { |
|
|
1182 | if (ev_is_active (w)) |
|
|
1183 | return; |
|
|
1184 | |
|
|
1185 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
|
|
1186 | |
|
|
1187 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
|
|
1188 | if (w->interval) |
|
|
1189 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
|
|
1190 | |
|
|
1191 | ev_start (EV_A_ (W)w, ++periodiccnt); |
|
|
1192 | array_needsize (periodics, periodicmax, periodiccnt, ); |
|
|
1193 | periodics [periodiccnt - 1] = w; |
|
|
1194 | upheap ((WT *)periodics, periodiccnt - 1); |
|
|
1195 | |
|
|
1196 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
|
|
1197 | } |
|
|
1198 | |
|
|
1199 | void |
|
|
1200 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
|
|
1201 | { |
|
|
1202 | ev_clear_pending (EV_A_ (W)w); |
585 | if (!ev_is_active (w)) |
1203 | if (!ev_is_active (w)) |
586 | return; |
1204 | return; |
587 | |
1205 | |
588 | if (w->is_abs) |
1206 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
589 | { |
1207 | |
590 | if (w->active < atimercnt--) |
1208 | if (((W)w)->active < periodiccnt--) |
591 | { |
|
|
592 | atimers [w->active - 1] = atimers [atimercnt]; |
|
|
593 | downheap (atimers, atimercnt, w->active - 1); |
|
|
594 | } |
|
|
595 | } |
1209 | { |
596 | else |
1210 | periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
|
|
1211 | downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
597 | { |
1212 | } |
598 | if (w->active < rtimercnt--) |
|
|
599 | { |
|
|
600 | rtimers [w->active - 1] = rtimers [rtimercnt]; |
|
|
601 | downheap (rtimers, rtimercnt, w->active - 1); |
|
|
602 | } |
|
|
603 | } |
|
|
604 | |
1213 | |
605 | ev_stop ((struct ev_watcher *)w); |
1214 | ev_stop (EV_A_ (W)w); |
606 | } |
1215 | } |
607 | |
1216 | |
608 | void |
1217 | void |
609 | evsignal_start (struct ev_signal *w) |
1218 | ev_idle_start (EV_P_ struct ev_idle *w) |
610 | { |
1219 | { |
611 | if (ev_is_active (w)) |
1220 | if (ev_is_active (w)) |
612 | return; |
1221 | return; |
613 | |
1222 | |
614 | ev_start ((struct ev_watcher *)w, 1); |
1223 | ev_start (EV_A_ (W)w, ++idlecnt); |
|
|
1224 | array_needsize (idles, idlemax, idlecnt, ); |
|
|
1225 | idles [idlecnt - 1] = w; |
|
|
1226 | } |
|
|
1227 | |
|
|
1228 | void |
|
|
1229 | ev_idle_stop (EV_P_ struct ev_idle *w) |
|
|
1230 | { |
|
|
1231 | ev_clear_pending (EV_A_ (W)w); |
|
|
1232 | if (ev_is_active (w)) |
|
|
1233 | return; |
|
|
1234 | |
|
|
1235 | idles [((W)w)->active - 1] = idles [--idlecnt]; |
|
|
1236 | ev_stop (EV_A_ (W)w); |
|
|
1237 | } |
|
|
1238 | |
|
|
1239 | void |
|
|
1240 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
|
|
1241 | { |
|
|
1242 | if (ev_is_active (w)) |
|
|
1243 | return; |
|
|
1244 | |
|
|
1245 | ev_start (EV_A_ (W)w, ++preparecnt); |
|
|
1246 | array_needsize (prepares, preparemax, preparecnt, ); |
|
|
1247 | prepares [preparecnt - 1] = w; |
|
|
1248 | } |
|
|
1249 | |
|
|
1250 | void |
|
|
1251 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
|
|
1252 | { |
|
|
1253 | ev_clear_pending (EV_A_ (W)w); |
|
|
1254 | if (ev_is_active (w)) |
|
|
1255 | return; |
|
|
1256 | |
|
|
1257 | prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
|
|
1258 | ev_stop (EV_A_ (W)w); |
|
|
1259 | } |
|
|
1260 | |
|
|
1261 | void |
|
|
1262 | ev_check_start (EV_P_ struct ev_check *w) |
|
|
1263 | { |
|
|
1264 | if (ev_is_active (w)) |
|
|
1265 | return; |
|
|
1266 | |
|
|
1267 | ev_start (EV_A_ (W)w, ++checkcnt); |
|
|
1268 | array_needsize (checks, checkmax, checkcnt, ); |
|
|
1269 | checks [checkcnt - 1] = w; |
|
|
1270 | } |
|
|
1271 | |
|
|
1272 | void |
|
|
1273 | ev_check_stop (EV_P_ struct ev_check *w) |
|
|
1274 | { |
|
|
1275 | ev_clear_pending (EV_A_ (W)w); |
|
|
1276 | if (ev_is_active (w)) |
|
|
1277 | return; |
|
|
1278 | |
|
|
1279 | checks [((W)w)->active - 1] = checks [--checkcnt]; |
|
|
1280 | ev_stop (EV_A_ (W)w); |
|
|
1281 | } |
|
|
1282 | |
|
|
1283 | #ifndef SA_RESTART |
|
|
1284 | # define SA_RESTART 0 |
|
|
1285 | #endif |
|
|
1286 | |
|
|
1287 | void |
|
|
1288 | ev_signal_start (EV_P_ struct ev_signal *w) |
|
|
1289 | { |
|
|
1290 | #if EV_MULTIPLICITY |
|
|
1291 | assert (("signal watchers are only supported in the default loop", loop == default_loop)); |
|
|
1292 | #endif |
|
|
1293 | if (ev_is_active (w)) |
|
|
1294 | return; |
|
|
1295 | |
|
|
1296 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
|
|
1297 | |
|
|
1298 | ev_start (EV_A_ (W)w, 1); |
615 | array_needsize (signals, signalmax, w->signum, signals_init); |
1299 | array_needsize (signals, signalmax, w->signum, signals_init); |
616 | wlist_add ((struct ev_watcher_list **)&signals [w->signum - 1].head, (struct ev_watcher_list *)w); |
1300 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
617 | |
1301 | |
618 | if (!w->next) |
1302 | if (!((WL)w)->next) |
619 | { |
1303 | { |
620 | struct sigaction sa; |
1304 | struct sigaction sa; |
621 | sa.sa_handler = sighandler; |
1305 | sa.sa_handler = sighandler; |
622 | sigfillset (&sa.sa_mask); |
1306 | sigfillset (&sa.sa_mask); |
623 | sa.sa_flags = 0; |
1307 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
624 | sigaction (w->signum, &sa, 0); |
1308 | sigaction (w->signum, &sa, 0); |
625 | } |
1309 | } |
626 | } |
1310 | } |
627 | |
1311 | |
628 | void |
1312 | void |
629 | evsignal_stop (struct ev_signal *w) |
1313 | ev_signal_stop (EV_P_ struct ev_signal *w) |
630 | { |
1314 | { |
|
|
1315 | ev_clear_pending (EV_A_ (W)w); |
631 | if (!ev_is_active (w)) |
1316 | if (!ev_is_active (w)) |
632 | return; |
1317 | return; |
633 | |
1318 | |
634 | wlist_del ((struct ev_watcher_list **)&signals [w->signum - 1].head, (struct ev_watcher_list *)w); |
1319 | wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
635 | ev_stop ((struct ev_watcher *)w); |
1320 | ev_stop (EV_A_ (W)w); |
636 | |
1321 | |
637 | if (!signals [w->signum - 1].head) |
1322 | if (!signals [w->signum - 1].head) |
638 | signal (w->signum, SIG_DFL); |
1323 | signal (w->signum, SIG_DFL); |
639 | } |
1324 | } |
640 | |
1325 | |
|
|
1326 | void |
|
|
1327 | ev_child_start (EV_P_ struct ev_child *w) |
|
|
1328 | { |
|
|
1329 | #if EV_MULTIPLICITY |
|
|
1330 | assert (("child watchers are only supported in the default loop", loop == default_loop)); |
|
|
1331 | #endif |
|
|
1332 | if (ev_is_active (w)) |
|
|
1333 | return; |
|
|
1334 | |
|
|
1335 | ev_start (EV_A_ (W)w, 1); |
|
|
1336 | wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
|
|
1337 | } |
|
|
1338 | |
|
|
1339 | void |
|
|
1340 | ev_child_stop (EV_P_ struct ev_child *w) |
|
|
1341 | { |
|
|
1342 | ev_clear_pending (EV_A_ (W)w); |
|
|
1343 | if (ev_is_active (w)) |
|
|
1344 | return; |
|
|
1345 | |
|
|
1346 | wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
|
|
1347 | ev_stop (EV_A_ (W)w); |
|
|
1348 | } |
|
|
1349 | |
641 | /*****************************************************************************/ |
1350 | /*****************************************************************************/ |
642 | #if 1 |
|
|
643 | |
1351 | |
644 | static void |
1352 | struct ev_once |
645 | sin_cb (struct ev_io *w, int revents) |
|
|
646 | { |
1353 | { |
647 | fprintf (stderr, "sin %d, revents %d\n", w->fd, revents); |
|
|
648 | } |
|
|
649 | |
|
|
650 | static void |
|
|
651 | ocb (struct ev_timer *w, int revents) |
|
|
652 | { |
|
|
653 | //fprintf (stderr, "timer %f,%f (%x) (%f) d%p\n", w->at, w->repeat, revents, w->at - ev_time (), w->data); |
|
|
654 | evtimer_stop (w); |
|
|
655 | evtimer_start (w); |
|
|
656 | } |
|
|
657 | |
|
|
658 | static void |
|
|
659 | scb (struct ev_signal *w, int revents) |
|
|
660 | { |
|
|
661 | fprintf (stderr, "signal %x,%d\n", revents, w->signum); |
|
|
662 | } |
|
|
663 | |
|
|
664 | int main (void) |
|
|
665 | { |
|
|
666 | struct ev_io sin; |
1354 | struct ev_io io; |
667 | |
|
|
668 | ev_init (0); |
|
|
669 | |
|
|
670 | evw_init (&sin, sin_cb, 55); |
|
|
671 | evio_set (&sin, 0, EV_READ); |
|
|
672 | evio_start (&sin); |
|
|
673 | |
|
|
674 | struct ev_timer t[10000]; |
|
|
675 | |
|
|
676 | #if 0 |
|
|
677 | int i; |
|
|
678 | for (i = 0; i < 10000; ++i) |
|
|
679 | { |
|
|
680 | struct ev_timer *w = t + i; |
|
|
681 | evw_init (w, ocb, i); |
|
|
682 | evtimer_set_abs (w, drand48 (), 0.99775533); |
|
|
683 | evtimer_start (w); |
|
|
684 | if (drand48 () < 0.5) |
|
|
685 | evtimer_stop (w); |
|
|
686 | } |
|
|
687 | #endif |
|
|
688 | |
|
|
689 | struct ev_timer t1; |
1355 | struct ev_timer to; |
690 | evw_init (&t1, ocb, 0); |
1356 | void (*cb)(int revents, void *arg); |
691 | evtimer_set_abs (&t1, 5, 10); |
1357 | void *arg; |
692 | evtimer_start (&t1); |
1358 | }; |
693 | |
1359 | |
694 | struct ev_signal sig; |
1360 | static void |
695 | evw_init (&sig, scb, 65535); |
1361 | once_cb (EV_P_ struct ev_once *once, int revents) |
696 | evsignal_set (&sig, SIGQUIT); |
1362 | { |
697 | evsignal_start (&sig); |
1363 | void (*cb)(int revents, void *arg) = once->cb; |
|
|
1364 | void *arg = once->arg; |
698 | |
1365 | |
699 | ev_loop (0); |
1366 | ev_io_stop (EV_A_ &once->io); |
|
|
1367 | ev_timer_stop (EV_A_ &once->to); |
|
|
1368 | free (once); |
700 | |
1369 | |
701 | return 0; |
1370 | cb (revents, arg); |
702 | } |
1371 | } |
703 | |
1372 | |
704 | #endif |
1373 | static void |
|
|
1374 | once_cb_io (EV_P_ struct ev_io *w, int revents) |
|
|
1375 | { |
|
|
1376 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
|
|
1377 | } |
705 | |
1378 | |
|
|
1379 | static void |
|
|
1380 | once_cb_to (EV_P_ struct ev_timer *w, int revents) |
|
|
1381 | { |
|
|
1382 | once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
|
|
1383 | } |
706 | |
1384 | |
|
|
1385 | void |
|
|
1386 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
|
|
1387 | { |
|
|
1388 | struct ev_once *once = malloc (sizeof (struct ev_once)); |
707 | |
1389 | |
|
|
1390 | if (!once) |
|
|
1391 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
|
|
1392 | else |
|
|
1393 | { |
|
|
1394 | once->cb = cb; |
|
|
1395 | once->arg = arg; |
708 | |
1396 | |
|
|
1397 | ev_watcher_init (&once->io, once_cb_io); |
|
|
1398 | if (fd >= 0) |
|
|
1399 | { |
|
|
1400 | ev_io_set (&once->io, fd, events); |
|
|
1401 | ev_io_start (EV_A_ &once->io); |
|
|
1402 | } |
|
|
1403 | |
|
|
1404 | ev_watcher_init (&once->to, once_cb_to); |
|
|
1405 | if (timeout >= 0.) |
|
|
1406 | { |
|
|
1407 | ev_timer_set (&once->to, timeout, 0.); |
|
|
1408 | ev_timer_start (EV_A_ &once->to); |
|
|
1409 | } |
|
|
1410 | } |
|
|
1411 | } |
|
|
1412 | |