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