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