… | |
… | |
54 | |
54 | |
55 | #endif |
55 | #endif |
56 | |
56 | |
57 | #include <math.h> |
57 | #include <math.h> |
58 | #include <stdlib.h> |
58 | #include <stdlib.h> |
59 | #include <unistd.h> |
|
|
60 | #include <fcntl.h> |
59 | #include <fcntl.h> |
61 | #include <signal.h> |
|
|
62 | #include <stddef.h> |
60 | #include <stddef.h> |
63 | |
61 | |
64 | #include <stdio.h> |
62 | #include <stdio.h> |
65 | |
63 | |
66 | #include <assert.h> |
64 | #include <assert.h> |
67 | #include <errno.h> |
65 | #include <errno.h> |
68 | #include <sys/types.h> |
66 | #include <sys/types.h> |
|
|
67 | #include <time.h> |
|
|
68 | |
|
|
69 | #include <signal.h> |
|
|
70 | |
69 | #ifndef WIN32 |
71 | #ifndef WIN32 |
|
|
72 | # include <unistd.h> |
|
|
73 | # include <sys/time.h> |
70 | # include <sys/wait.h> |
74 | # include <sys/wait.h> |
71 | #endif |
75 | #endif |
72 | #include <sys/time.h> |
|
|
73 | #include <time.h> |
|
|
74 | |
|
|
75 | /**/ |
76 | /**/ |
76 | |
77 | |
77 | #ifndef EV_USE_MONOTONIC |
78 | #ifndef EV_USE_MONOTONIC |
78 | # define EV_USE_MONOTONIC 1 |
79 | # define EV_USE_MONOTONIC 1 |
79 | #endif |
80 | #endif |
… | |
… | |
90 | # define EV_USE_EPOLL 0 |
91 | # define EV_USE_EPOLL 0 |
91 | #endif |
92 | #endif |
92 | |
93 | |
93 | #ifndef EV_USE_KQUEUE |
94 | #ifndef EV_USE_KQUEUE |
94 | # define EV_USE_KQUEUE 0 |
95 | # define EV_USE_KQUEUE 0 |
|
|
96 | #endif |
|
|
97 | |
|
|
98 | #ifndef EV_USE_WIN32 |
|
|
99 | # ifdef WIN32 |
|
|
100 | # define EV_USE_WIN32 0 /* it does not exist, use select */ |
|
|
101 | # undef EV_USE_SELECT |
|
|
102 | # define EV_USE_SELECT 1 |
|
|
103 | # else |
|
|
104 | # define EV_USE_WIN32 0 |
|
|
105 | # endif |
95 | #endif |
106 | #endif |
96 | |
107 | |
97 | #ifndef EV_USE_REALTIME |
108 | #ifndef EV_USE_REALTIME |
98 | # define EV_USE_REALTIME 1 |
109 | # define EV_USE_REALTIME 1 |
99 | #endif |
110 | #endif |
… | |
… | |
115 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
126 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
116 | #define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
127 | #define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
117 | #define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
128 | #define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
118 | /*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
129 | /*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
119 | |
130 | |
|
|
131 | #ifdef EV_H |
|
|
132 | # include EV_H |
|
|
133 | #else |
120 | #include "ev.h" |
134 | # include "ev.h" |
|
|
135 | #endif |
121 | |
136 | |
122 | #if __GNUC__ >= 3 |
137 | #if __GNUC__ >= 3 |
123 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
138 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
124 | # define inline inline |
139 | # define inline inline |
125 | #else |
140 | #else |
… | |
… | |
137 | typedef struct ev_watcher_list *WL; |
152 | typedef struct ev_watcher_list *WL; |
138 | typedef struct ev_watcher_time *WT; |
153 | typedef struct ev_watcher_time *WT; |
139 | |
154 | |
140 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
155 | static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
141 | |
156 | |
|
|
157 | #include "ev_win32.c" |
|
|
158 | |
142 | /*****************************************************************************/ |
159 | /*****************************************************************************/ |
143 | |
160 | |
|
|
161 | static void (*syserr_cb)(const char *msg); |
|
|
162 | |
|
|
163 | void ev_set_syserr_cb (void (*cb)(const char *msg)) |
|
|
164 | { |
|
|
165 | syserr_cb = cb; |
|
|
166 | } |
|
|
167 | |
|
|
168 | static void |
|
|
169 | syserr (const char *msg) |
|
|
170 | { |
|
|
171 | if (!msg) |
|
|
172 | msg = "(libev) system error"; |
|
|
173 | |
|
|
174 | if (syserr_cb) |
|
|
175 | syserr_cb (msg); |
|
|
176 | else |
|
|
177 | { |
|
|
178 | perror (msg); |
|
|
179 | abort (); |
|
|
180 | } |
|
|
181 | } |
|
|
182 | |
|
|
183 | static void *(*alloc)(void *ptr, long size); |
|
|
184 | |
|
|
185 | void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
|
|
186 | { |
|
|
187 | alloc = cb; |
|
|
188 | } |
|
|
189 | |
|
|
190 | static void * |
|
|
191 | ev_realloc (void *ptr, long size) |
|
|
192 | { |
|
|
193 | ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
|
|
194 | |
|
|
195 | if (!ptr && size) |
|
|
196 | { |
|
|
197 | fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
|
|
198 | abort (); |
|
|
199 | } |
|
|
200 | |
|
|
201 | return ptr; |
|
|
202 | } |
|
|
203 | |
|
|
204 | #define ev_malloc(size) ev_realloc (0, (size)) |
|
|
205 | #define ev_free(ptr) ev_realloc ((ptr), 0) |
|
|
206 | |
|
|
207 | /*****************************************************************************/ |
|
|
208 | |
144 | typedef struct |
209 | typedef struct |
145 | { |
210 | { |
146 | struct ev_watcher_list *head; |
211 | WL head; |
147 | unsigned char events; |
212 | unsigned char events; |
148 | unsigned char reify; |
213 | unsigned char reify; |
149 | } ANFD; |
214 | } ANFD; |
150 | |
215 | |
151 | typedef struct |
216 | typedef struct |
… | |
… | |
154 | int events; |
219 | int events; |
155 | } ANPENDING; |
220 | } ANPENDING; |
156 | |
221 | |
157 | #if EV_MULTIPLICITY |
222 | #if EV_MULTIPLICITY |
158 | |
223 | |
159 | struct ev_loop |
224 | struct ev_loop |
160 | { |
225 | { |
161 | # define VAR(name,decl) decl; |
226 | #define VAR(name,decl) decl; |
162 | # include "ev_vars.h" |
227 | #include "ev_vars.h" |
163 | }; |
|
|
164 | # undef VAR |
228 | #undef VAR |
|
|
229 | }; |
165 | # include "ev_wrap.h" |
230 | #include "ev_wrap.h" |
|
|
231 | |
|
|
232 | struct ev_loop default_loop_struct; |
|
|
233 | static struct ev_loop *default_loop; |
166 | |
234 | |
167 | #else |
235 | #else |
168 | |
236 | |
169 | # define VAR(name,decl) static decl; |
237 | #define VAR(name,decl) static decl; |
170 | # include "ev_vars.h" |
238 | #include "ev_vars.h" |
171 | # undef VAR |
239 | #undef VAR |
|
|
240 | |
|
|
241 | static int default_loop; |
172 | |
242 | |
173 | #endif |
243 | #endif |
174 | |
244 | |
175 | /*****************************************************************************/ |
245 | /*****************************************************************************/ |
176 | |
246 | |
… | |
… | |
207 | ev_now (EV_P) |
277 | ev_now (EV_P) |
208 | { |
278 | { |
209 | return rt_now; |
279 | return rt_now; |
210 | } |
280 | } |
211 | |
281 | |
212 | #define array_roundsize(base,n) ((n) | 4 & ~3) |
282 | #define array_roundsize(type,n) ((n) | 4 & ~3) |
213 | |
283 | |
214 | #define array_needsize(base,cur,cnt,init) \ |
284 | #define array_needsize(type,base,cur,cnt,init) \ |
215 | if (expect_false ((cnt) > cur)) \ |
285 | if (expect_false ((cnt) > cur)) \ |
216 | { \ |
286 | { \ |
217 | int newcnt = cur; \ |
287 | int newcnt = cur; \ |
218 | do \ |
288 | do \ |
219 | { \ |
289 | { \ |
220 | newcnt = array_roundsize (base, newcnt << 1); \ |
290 | newcnt = array_roundsize (type, newcnt << 1); \ |
221 | } \ |
291 | } \ |
222 | while ((cnt) > newcnt); \ |
292 | while ((cnt) > newcnt); \ |
223 | \ |
293 | \ |
224 | base = realloc (base, sizeof (*base) * (newcnt)); \ |
294 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
225 | init (base + cur, newcnt - cur); \ |
295 | init (base + cur, newcnt - cur); \ |
226 | cur = newcnt; \ |
296 | cur = newcnt; \ |
227 | } |
297 | } |
|
|
298 | |
|
|
299 | #define array_slim(type,stem) \ |
|
|
300 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
|
|
301 | { \ |
|
|
302 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
|
|
303 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
|
|
304 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
|
|
305 | } |
|
|
306 | |
|
|
307 | /* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ |
|
|
308 | /* bringing us everlasting joy in form of stupid extra macros that are not required in C */ |
|
|
309 | #define array_free_microshit(stem) \ |
|
|
310 | ev_free (stem ## s); stem ## cnt = stem ## max = 0; |
|
|
311 | |
|
|
312 | #define array_free(stem, idx) \ |
|
|
313 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
228 | |
314 | |
229 | /*****************************************************************************/ |
315 | /*****************************************************************************/ |
230 | |
316 | |
231 | static void |
317 | static void |
232 | anfds_init (ANFD *base, int count) |
318 | anfds_init (ANFD *base, int count) |
… | |
… | |
239 | |
325 | |
240 | ++base; |
326 | ++base; |
241 | } |
327 | } |
242 | } |
328 | } |
243 | |
329 | |
244 | static void |
330 | void |
245 | event (EV_P_ W w, int events) |
331 | ev_feed_event (EV_P_ void *w, int revents) |
246 | { |
332 | { |
|
|
333 | W w_ = (W)w; |
|
|
334 | |
247 | if (w->pending) |
335 | if (w_->pending) |
248 | { |
336 | { |
249 | pendings [ABSPRI (w)][w->pending - 1].events |= events; |
337 | pendings [ABSPRI (w_)][w_->pending - 1].events |= revents; |
250 | return; |
338 | return; |
251 | } |
339 | } |
252 | |
340 | |
253 | w->pending = ++pendingcnt [ABSPRI (w)]; |
341 | w_->pending = ++pendingcnt [ABSPRI (w_)]; |
254 | array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], ); |
342 | array_needsize (ANPENDING, pendings [ABSPRI (w_)], pendingmax [ABSPRI (w_)], pendingcnt [ABSPRI (w_)], (void)); |
255 | pendings [ABSPRI (w)][w->pending - 1].w = w; |
343 | pendings [ABSPRI (w_)][w_->pending - 1].w = w_; |
256 | pendings [ABSPRI (w)][w->pending - 1].events = events; |
344 | pendings [ABSPRI (w_)][w_->pending - 1].events = revents; |
257 | } |
345 | } |
258 | |
346 | |
259 | static void |
347 | static void |
260 | queue_events (EV_P_ W *events, int eventcnt, int type) |
348 | queue_events (EV_P_ W *events, int eventcnt, int type) |
261 | { |
349 | { |
262 | int i; |
350 | int i; |
263 | |
351 | |
264 | for (i = 0; i < eventcnt; ++i) |
352 | for (i = 0; i < eventcnt; ++i) |
265 | event (EV_A_ events [i], type); |
353 | ev_feed_event (EV_A_ events [i], type); |
266 | } |
354 | } |
267 | |
355 | |
268 | static void |
356 | inline void |
269 | fd_event (EV_P_ int fd, int events) |
357 | fd_event (EV_P_ int fd, int revents) |
270 | { |
358 | { |
271 | ANFD *anfd = anfds + fd; |
359 | ANFD *anfd = anfds + fd; |
272 | struct ev_io *w; |
360 | struct ev_io *w; |
273 | |
361 | |
274 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
362 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
275 | { |
363 | { |
276 | int ev = w->events & events; |
364 | int ev = w->events & revents; |
277 | |
365 | |
278 | if (ev) |
366 | if (ev) |
279 | event (EV_A_ (W)w, ev); |
367 | ev_feed_event (EV_A_ (W)w, ev); |
280 | } |
368 | } |
|
|
369 | } |
|
|
370 | |
|
|
371 | void |
|
|
372 | ev_feed_fd_event (EV_P_ int fd, int revents) |
|
|
373 | { |
|
|
374 | fd_event (EV_A_ fd, revents); |
281 | } |
375 | } |
282 | |
376 | |
283 | /*****************************************************************************/ |
377 | /*****************************************************************************/ |
284 | |
378 | |
285 | static void |
379 | static void |
… | |
… | |
298 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
392 | for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
299 | events |= w->events; |
393 | events |= w->events; |
300 | |
394 | |
301 | anfd->reify = 0; |
395 | anfd->reify = 0; |
302 | |
396 | |
303 | if (anfd->events != events) |
|
|
304 | { |
|
|
305 | method_modify (EV_A_ fd, anfd->events, events); |
397 | method_modify (EV_A_ fd, anfd->events, events); |
306 | anfd->events = events; |
398 | anfd->events = events; |
307 | } |
|
|
308 | } |
399 | } |
309 | |
400 | |
310 | fdchangecnt = 0; |
401 | fdchangecnt = 0; |
311 | } |
402 | } |
312 | |
403 | |
313 | static void |
404 | static void |
314 | fd_change (EV_P_ int fd) |
405 | fd_change (EV_P_ int fd) |
315 | { |
406 | { |
316 | if (anfds [fd].reify || fdchangecnt < 0) |
407 | if (anfds [fd].reify) |
317 | return; |
408 | return; |
318 | |
409 | |
319 | anfds [fd].reify = 1; |
410 | anfds [fd].reify = 1; |
320 | |
411 | |
321 | ++fdchangecnt; |
412 | ++fdchangecnt; |
322 | array_needsize (fdchanges, fdchangemax, fdchangecnt, ); |
413 | array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void)); |
323 | fdchanges [fdchangecnt - 1] = fd; |
414 | fdchanges [fdchangecnt - 1] = fd; |
324 | } |
415 | } |
325 | |
416 | |
326 | static void |
417 | static void |
327 | fd_kill (EV_P_ int fd) |
418 | fd_kill (EV_P_ int fd) |
… | |
… | |
329 | struct ev_io *w; |
420 | struct ev_io *w; |
330 | |
421 | |
331 | while ((w = (struct ev_io *)anfds [fd].head)) |
422 | while ((w = (struct ev_io *)anfds [fd].head)) |
332 | { |
423 | { |
333 | ev_io_stop (EV_A_ w); |
424 | ev_io_stop (EV_A_ w); |
334 | event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
425 | ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
335 | } |
426 | } |
|
|
427 | } |
|
|
428 | |
|
|
429 | static int |
|
|
430 | fd_valid (int fd) |
|
|
431 | { |
|
|
432 | #ifdef WIN32 |
|
|
433 | return !!win32_get_osfhandle (fd); |
|
|
434 | #else |
|
|
435 | return fcntl (fd, F_GETFD) != -1; |
|
|
436 | #endif |
336 | } |
437 | } |
337 | |
438 | |
338 | /* called on EBADF to verify fds */ |
439 | /* called on EBADF to verify fds */ |
339 | static void |
440 | static void |
340 | fd_ebadf (EV_P) |
441 | fd_ebadf (EV_P) |
341 | { |
442 | { |
342 | int fd; |
443 | int fd; |
343 | |
444 | |
344 | for (fd = 0; fd < anfdmax; ++fd) |
445 | for (fd = 0; fd < anfdmax; ++fd) |
345 | if (anfds [fd].events) |
446 | if (anfds [fd].events) |
346 | if (fcntl (fd, F_GETFD) == -1 && errno == EBADF) |
447 | if (!fd_valid (fd) == -1 && errno == EBADF) |
347 | fd_kill (EV_A_ fd); |
448 | fd_kill (EV_A_ fd); |
348 | } |
449 | } |
349 | |
450 | |
350 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
451 | /* called on ENOMEM in select/poll to kill some fds and retry */ |
351 | static void |
452 | static void |
352 | fd_enomem (EV_P) |
453 | fd_enomem (EV_P) |
353 | { |
454 | { |
354 | int fd = anfdmax; |
455 | int fd; |
355 | |
456 | |
356 | while (fd--) |
457 | for (fd = anfdmax; fd--; ) |
357 | if (anfds [fd].events) |
458 | if (anfds [fd].events) |
358 | { |
459 | { |
359 | close (fd); |
|
|
360 | fd_kill (EV_A_ fd); |
460 | fd_kill (EV_A_ fd); |
361 | return; |
461 | return; |
362 | } |
462 | } |
363 | } |
463 | } |
364 | |
464 | |
365 | /* susually called after fork if method needs to re-arm all fds from scratch */ |
465 | /* usually called after fork if method needs to re-arm all fds from scratch */ |
366 | static void |
466 | static void |
367 | fd_rearm_all (EV_P) |
467 | fd_rearm_all (EV_P) |
368 | { |
468 | { |
369 | int fd; |
469 | int fd; |
370 | |
470 | |
… | |
… | |
385 | WT w = heap [k]; |
485 | WT w = heap [k]; |
386 | |
486 | |
387 | while (k && heap [k >> 1]->at > w->at) |
487 | while (k && heap [k >> 1]->at > w->at) |
388 | { |
488 | { |
389 | heap [k] = heap [k >> 1]; |
489 | heap [k] = heap [k >> 1]; |
390 | heap [k]->active = k + 1; |
490 | ((W)heap [k])->active = k + 1; |
391 | k >>= 1; |
491 | k >>= 1; |
392 | } |
492 | } |
393 | |
493 | |
394 | heap [k] = w; |
494 | heap [k] = w; |
395 | heap [k]->active = k + 1; |
495 | ((W)heap [k])->active = k + 1; |
396 | |
496 | |
397 | } |
497 | } |
398 | |
498 | |
399 | static void |
499 | static void |
400 | downheap (WT *heap, int N, int k) |
500 | downheap (WT *heap, int N, int k) |
… | |
… | |
410 | |
510 | |
411 | if (w->at <= heap [j]->at) |
511 | if (w->at <= heap [j]->at) |
412 | break; |
512 | break; |
413 | |
513 | |
414 | heap [k] = heap [j]; |
514 | heap [k] = heap [j]; |
415 | heap [k]->active = k + 1; |
515 | ((W)heap [k])->active = k + 1; |
416 | k = j; |
516 | k = j; |
417 | } |
517 | } |
418 | |
518 | |
419 | heap [k] = w; |
519 | heap [k] = w; |
420 | heap [k]->active = k + 1; |
520 | ((W)heap [k])->active = k + 1; |
421 | } |
521 | } |
422 | |
522 | |
423 | /*****************************************************************************/ |
523 | /*****************************************************************************/ |
424 | |
524 | |
425 | typedef struct |
525 | typedef struct |
426 | { |
526 | { |
427 | struct ev_watcher_list *head; |
527 | WL head; |
428 | sig_atomic_t volatile gotsig; |
528 | sig_atomic_t volatile gotsig; |
429 | } ANSIG; |
529 | } ANSIG; |
430 | |
530 | |
431 | static ANSIG *signals; |
531 | static ANSIG *signals; |
432 | static int signalmax; |
532 | static int signalmax; |
… | |
… | |
448 | } |
548 | } |
449 | |
549 | |
450 | static void |
550 | static void |
451 | sighandler (int signum) |
551 | sighandler (int signum) |
452 | { |
552 | { |
|
|
553 | #if WIN32 |
|
|
554 | signal (signum, sighandler); |
|
|
555 | #endif |
|
|
556 | |
453 | signals [signum - 1].gotsig = 1; |
557 | signals [signum - 1].gotsig = 1; |
454 | |
558 | |
455 | if (!gotsig) |
559 | if (!gotsig) |
456 | { |
560 | { |
457 | int old_errno = errno; |
561 | int old_errno = errno; |
458 | gotsig = 1; |
562 | gotsig = 1; |
|
|
563 | #ifdef WIN32 |
|
|
564 | send (sigpipe [1], &signum, 1, MSG_DONTWAIT); |
|
|
565 | #else |
459 | write (sigpipe [1], &signum, 1); |
566 | write (sigpipe [1], &signum, 1); |
|
|
567 | #endif |
460 | errno = old_errno; |
568 | errno = old_errno; |
461 | } |
569 | } |
462 | } |
570 | } |
463 | |
571 | |
|
|
572 | void |
|
|
573 | ev_feed_signal_event (EV_P_ int signum) |
|
|
574 | { |
|
|
575 | WL w; |
|
|
576 | |
|
|
577 | #if EV_MULTIPLICITY |
|
|
578 | assert (("feeding signal events is only supported in the default loop", loop == default_loop)); |
|
|
579 | #endif |
|
|
580 | |
|
|
581 | --signum; |
|
|
582 | |
|
|
583 | if (signum < 0 || signum >= signalmax) |
|
|
584 | return; |
|
|
585 | |
|
|
586 | signals [signum].gotsig = 0; |
|
|
587 | |
|
|
588 | for (w = signals [signum].head; w; w = w->next) |
|
|
589 | ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
|
|
590 | } |
|
|
591 | |
464 | static void |
592 | static void |
465 | sigcb (EV_P_ struct ev_io *iow, int revents) |
593 | sigcb (EV_P_ struct ev_io *iow, int revents) |
466 | { |
594 | { |
467 | struct ev_watcher_list *w; |
|
|
468 | int signum; |
595 | int signum; |
469 | |
596 | |
|
|
597 | #ifdef WIN32 |
|
|
598 | recv (sigpipe [0], &revents, 1, MSG_DONTWAIT); |
|
|
599 | #else |
470 | read (sigpipe [0], &revents, 1); |
600 | read (sigpipe [0], &revents, 1); |
|
|
601 | #endif |
471 | gotsig = 0; |
602 | gotsig = 0; |
472 | |
603 | |
473 | for (signum = signalmax; signum--; ) |
604 | for (signum = signalmax; signum--; ) |
474 | if (signals [signum].gotsig) |
605 | if (signals [signum].gotsig) |
475 | { |
606 | ev_feed_signal_event (EV_A_ signum + 1); |
476 | signals [signum].gotsig = 0; |
|
|
477 | |
|
|
478 | for (w = signals [signum].head; w; w = w->next) |
|
|
479 | event (EV_A_ (W)w, EV_SIGNAL); |
|
|
480 | } |
|
|
481 | } |
607 | } |
482 | |
608 | |
483 | static void |
609 | static void |
484 | siginit (EV_P) |
610 | siginit (EV_P) |
485 | { |
611 | { |
… | |
… | |
497 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
623 | ev_unref (EV_A); /* child watcher should not keep loop alive */ |
498 | } |
624 | } |
499 | |
625 | |
500 | /*****************************************************************************/ |
626 | /*****************************************************************************/ |
501 | |
627 | |
|
|
628 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
629 | |
502 | #ifndef WIN32 |
630 | #ifndef WIN32 |
503 | |
631 | |
504 | static struct ev_child *childs [PID_HASHSIZE]; |
|
|
505 | static struct ev_signal childev; |
632 | static struct ev_signal childev; |
506 | |
633 | |
507 | #ifndef WCONTINUED |
634 | #ifndef WCONTINUED |
508 | # define WCONTINUED 0 |
635 | # define WCONTINUED 0 |
509 | #endif |
636 | #endif |
… | |
… | |
514 | struct ev_child *w; |
641 | struct ev_child *w; |
515 | |
642 | |
516 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
643 | for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
517 | if (w->pid == pid || !w->pid) |
644 | if (w->pid == pid || !w->pid) |
518 | { |
645 | { |
519 | w->priority = sw->priority; /* need to do it *now* */ |
646 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
520 | w->rpid = pid; |
647 | w->rpid = pid; |
521 | w->rstatus = status; |
648 | w->rstatus = status; |
522 | event (EV_A_ (W)w, EV_CHILD); |
649 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
523 | } |
650 | } |
524 | } |
651 | } |
525 | |
652 | |
526 | static void |
653 | static void |
527 | childcb (EV_P_ struct ev_signal *sw, int revents) |
654 | childcb (EV_P_ struct ev_signal *sw, int revents) |
… | |
… | |
529 | int pid, status; |
656 | int pid, status; |
530 | |
657 | |
531 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
658 | if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
532 | { |
659 | { |
533 | /* make sure we are called again until all childs have been reaped */ |
660 | /* make sure we are called again until all childs have been reaped */ |
534 | event (EV_A_ (W)sw, EV_SIGNAL); |
661 | ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
535 | |
662 | |
536 | child_reap (EV_A_ sw, pid, pid, status); |
663 | child_reap (EV_A_ sw, pid, pid, status); |
537 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
664 | child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
538 | } |
665 | } |
539 | } |
666 | } |
… | |
… | |
608 | methods = atoi (getenv ("LIBEV_METHODS")); |
735 | methods = atoi (getenv ("LIBEV_METHODS")); |
609 | else |
736 | else |
610 | methods = EVMETHOD_ANY; |
737 | methods = EVMETHOD_ANY; |
611 | |
738 | |
612 | method = 0; |
739 | method = 0; |
|
|
740 | #if EV_USE_WIN32 |
|
|
741 | if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
|
|
742 | #endif |
613 | #if EV_USE_KQUEUE |
743 | #if EV_USE_KQUEUE |
614 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
744 | if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
615 | #endif |
745 | #endif |
616 | #if EV_USE_EPOLL |
746 | #if EV_USE_EPOLL |
617 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
747 | if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
… | |
… | |
620 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
750 | if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
621 | #endif |
751 | #endif |
622 | #if EV_USE_SELECT |
752 | #if EV_USE_SELECT |
623 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
753 | if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
624 | #endif |
754 | #endif |
|
|
755 | |
|
|
756 | ev_watcher_init (&sigev, sigcb); |
|
|
757 | ev_set_priority (&sigev, EV_MAXPRI); |
625 | } |
758 | } |
626 | } |
759 | } |
627 | |
760 | |
628 | void |
761 | void |
629 | loop_destroy (EV_P) |
762 | loop_destroy (EV_P) |
630 | { |
763 | { |
|
|
764 | int i; |
|
|
765 | |
|
|
766 | #if EV_USE_WIN32 |
|
|
767 | if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
|
|
768 | #endif |
631 | #if EV_USE_KQUEUE |
769 | #if EV_USE_KQUEUE |
632 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
770 | if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
633 | #endif |
771 | #endif |
634 | #if EV_USE_EPOLL |
772 | #if EV_USE_EPOLL |
635 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
773 | if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
… | |
… | |
639 | #endif |
777 | #endif |
640 | #if EV_USE_SELECT |
778 | #if EV_USE_SELECT |
641 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
779 | if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
642 | #endif |
780 | #endif |
643 | |
781 | |
|
|
782 | for (i = NUMPRI; i--; ) |
|
|
783 | array_free (pending, [i]); |
|
|
784 | |
|
|
785 | /* have to use the microsoft-never-gets-it-right macro */ |
|
|
786 | array_free_microshit (fdchange); |
|
|
787 | array_free_microshit (timer); |
|
|
788 | array_free_microshit (periodic); |
|
|
789 | array_free_microshit (idle); |
|
|
790 | array_free_microshit (prepare); |
|
|
791 | array_free_microshit (check); |
|
|
792 | |
644 | method = 0; |
793 | method = 0; |
645 | /*TODO*/ |
|
|
646 | } |
794 | } |
647 | |
795 | |
648 | void |
796 | static void |
649 | loop_fork (EV_P) |
797 | loop_fork (EV_P) |
650 | { |
798 | { |
651 | /*TODO*/ |
|
|
652 | #if EV_USE_EPOLL |
799 | #if EV_USE_EPOLL |
653 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
800 | if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
654 | #endif |
801 | #endif |
655 | #if EV_USE_KQUEUE |
802 | #if EV_USE_KQUEUE |
656 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
803 | if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
657 | #endif |
804 | #endif |
|
|
805 | |
|
|
806 | if (ev_is_active (&sigev)) |
|
|
807 | { |
|
|
808 | /* default loop */ |
|
|
809 | |
|
|
810 | ev_ref (EV_A); |
|
|
811 | ev_io_stop (EV_A_ &sigev); |
|
|
812 | close (sigpipe [0]); |
|
|
813 | close (sigpipe [1]); |
|
|
814 | |
|
|
815 | while (pipe (sigpipe)) |
|
|
816 | syserr ("(libev) error creating pipe"); |
|
|
817 | |
|
|
818 | siginit (EV_A); |
|
|
819 | } |
|
|
820 | |
|
|
821 | postfork = 0; |
658 | } |
822 | } |
659 | |
823 | |
660 | #if EV_MULTIPLICITY |
824 | #if EV_MULTIPLICITY |
661 | struct ev_loop * |
825 | struct ev_loop * |
662 | ev_loop_new (int methods) |
826 | ev_loop_new (int methods) |
663 | { |
827 | { |
664 | struct ev_loop *loop = (struct ev_loop *)calloc (1, sizeof (struct ev_loop)); |
828 | struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
|
|
829 | |
|
|
830 | memset (loop, 0, sizeof (struct ev_loop)); |
665 | |
831 | |
666 | loop_init (EV_A_ methods); |
832 | loop_init (EV_A_ methods); |
667 | |
833 | |
668 | if (ev_method (EV_A)) |
834 | if (ev_method (EV_A)) |
669 | return loop; |
835 | return loop; |
… | |
… | |
673 | |
839 | |
674 | void |
840 | void |
675 | ev_loop_destroy (EV_P) |
841 | ev_loop_destroy (EV_P) |
676 | { |
842 | { |
677 | loop_destroy (EV_A); |
843 | loop_destroy (EV_A); |
678 | free (loop); |
844 | ev_free (loop); |
679 | } |
845 | } |
680 | |
846 | |
681 | void |
847 | void |
682 | ev_loop_fork (EV_P) |
848 | ev_loop_fork (EV_P) |
683 | { |
849 | { |
684 | loop_fork (EV_A); |
850 | postfork = 1; |
685 | } |
851 | } |
686 | |
852 | |
687 | #endif |
853 | #endif |
688 | |
854 | |
689 | #if EV_MULTIPLICITY |
855 | #if EV_MULTIPLICITY |
690 | struct ev_loop default_loop_struct; |
|
|
691 | static struct ev_loop *default_loop; |
|
|
692 | |
|
|
693 | struct ev_loop * |
856 | struct ev_loop * |
694 | #else |
857 | #else |
695 | static int default_loop; |
|
|
696 | |
|
|
697 | int |
858 | int |
698 | #endif |
859 | #endif |
699 | ev_default_loop (int methods) |
860 | ev_default_loop (int methods) |
700 | { |
861 | { |
701 | if (sigpipe [0] == sigpipe [1]) |
862 | if (sigpipe [0] == sigpipe [1]) |
… | |
… | |
712 | |
873 | |
713 | loop_init (EV_A_ methods); |
874 | loop_init (EV_A_ methods); |
714 | |
875 | |
715 | if (ev_method (EV_A)) |
876 | if (ev_method (EV_A)) |
716 | { |
877 | { |
717 | ev_watcher_init (&sigev, sigcb); |
|
|
718 | ev_set_priority (&sigev, EV_MAXPRI); |
|
|
719 | siginit (EV_A); |
878 | siginit (EV_A); |
720 | |
879 | |
721 | #ifndef WIN32 |
880 | #ifndef WIN32 |
722 | ev_signal_init (&childev, childcb, SIGCHLD); |
881 | ev_signal_init (&childev, childcb, SIGCHLD); |
723 | ev_set_priority (&childev, EV_MAXPRI); |
882 | ev_set_priority (&childev, EV_MAXPRI); |
… | |
… | |
737 | { |
896 | { |
738 | #if EV_MULTIPLICITY |
897 | #if EV_MULTIPLICITY |
739 | struct ev_loop *loop = default_loop; |
898 | struct ev_loop *loop = default_loop; |
740 | #endif |
899 | #endif |
741 | |
900 | |
|
|
901 | #ifndef WIN32 |
742 | ev_ref (EV_A); /* child watcher */ |
902 | ev_ref (EV_A); /* child watcher */ |
743 | ev_signal_stop (EV_A_ &childev); |
903 | ev_signal_stop (EV_A_ &childev); |
|
|
904 | #endif |
744 | |
905 | |
745 | ev_ref (EV_A); /* signal watcher */ |
906 | ev_ref (EV_A); /* signal watcher */ |
746 | ev_io_stop (EV_A_ &sigev); |
907 | ev_io_stop (EV_A_ &sigev); |
747 | |
908 | |
748 | close (sigpipe [0]); sigpipe [0] = 0; |
909 | close (sigpipe [0]); sigpipe [0] = 0; |
… | |
… | |
756 | { |
917 | { |
757 | #if EV_MULTIPLICITY |
918 | #if EV_MULTIPLICITY |
758 | struct ev_loop *loop = default_loop; |
919 | struct ev_loop *loop = default_loop; |
759 | #endif |
920 | #endif |
760 | |
921 | |
761 | loop_fork (EV_A); |
922 | if (method) |
762 | |
923 | postfork = 1; |
763 | ev_io_stop (EV_A_ &sigev); |
|
|
764 | close (sigpipe [0]); |
|
|
765 | close (sigpipe [1]); |
|
|
766 | pipe (sigpipe); |
|
|
767 | |
|
|
768 | ev_ref (EV_A); /* signal watcher */ |
|
|
769 | siginit (EV_A); |
|
|
770 | } |
924 | } |
771 | |
925 | |
772 | /*****************************************************************************/ |
926 | /*****************************************************************************/ |
|
|
927 | |
|
|
928 | static int |
|
|
929 | any_pending (EV_P) |
|
|
930 | { |
|
|
931 | int pri; |
|
|
932 | |
|
|
933 | for (pri = NUMPRI; pri--; ) |
|
|
934 | if (pendingcnt [pri]) |
|
|
935 | return 1; |
|
|
936 | |
|
|
937 | return 0; |
|
|
938 | } |
773 | |
939 | |
774 | static void |
940 | static void |
775 | call_pending (EV_P) |
941 | call_pending (EV_P) |
776 | { |
942 | { |
777 | int pri; |
943 | int pri; |
… | |
… | |
790 | } |
956 | } |
791 | |
957 | |
792 | static void |
958 | static void |
793 | timers_reify (EV_P) |
959 | timers_reify (EV_P) |
794 | { |
960 | { |
795 | while (timercnt && timers [0]->at <= mn_now) |
961 | while (timercnt && ((WT)timers [0])->at <= mn_now) |
796 | { |
962 | { |
797 | struct ev_timer *w = timers [0]; |
963 | struct ev_timer *w = timers [0]; |
798 | |
964 | |
799 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
965 | assert (("inactive timer on timer heap detected", ev_is_active (w))); |
800 | |
966 | |
801 | /* first reschedule or stop timer */ |
967 | /* first reschedule or stop timer */ |
802 | if (w->repeat) |
968 | if (w->repeat) |
803 | { |
969 | { |
804 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
970 | assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
805 | w->at = mn_now + w->repeat; |
971 | ((WT)w)->at = mn_now + w->repeat; |
806 | downheap ((WT *)timers, timercnt, 0); |
972 | downheap ((WT *)timers, timercnt, 0); |
807 | } |
973 | } |
808 | else |
974 | else |
809 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
975 | ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
810 | |
976 | |
811 | event (EV_A_ (W)w, EV_TIMEOUT); |
977 | ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
812 | } |
978 | } |
813 | } |
979 | } |
814 | |
980 | |
815 | static void |
981 | static void |
816 | periodics_reify (EV_P) |
982 | periodics_reify (EV_P) |
817 | { |
983 | { |
818 | while (periodiccnt && periodics [0]->at <= rt_now) |
984 | while (periodiccnt && ((WT)periodics [0])->at <= rt_now) |
819 | { |
985 | { |
820 | struct ev_periodic *w = periodics [0]; |
986 | struct ev_periodic *w = periodics [0]; |
821 | |
987 | |
822 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
988 | assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
823 | |
989 | |
824 | /* first reschedule or stop timer */ |
990 | /* first reschedule or stop timer */ |
825 | if (w->interval) |
991 | if (w->reschedule_cb) |
826 | { |
992 | { |
|
|
993 | ev_tstamp at = ((WT)w)->at = w->reschedule_cb (w, rt_now + 0.0001); |
|
|
994 | |
|
|
995 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > rt_now)); |
|
|
996 | downheap ((WT *)periodics, periodiccnt, 0); |
|
|
997 | } |
|
|
998 | else if (w->interval) |
|
|
999 | { |
827 | w->at += floor ((rt_now - w->at) / w->interval + 1.) * w->interval; |
1000 | ((WT)w)->at += floor ((rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
828 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", w->at > rt_now)); |
1001 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > rt_now)); |
829 | downheap ((WT *)periodics, periodiccnt, 0); |
1002 | downheap ((WT *)periodics, periodiccnt, 0); |
830 | } |
1003 | } |
831 | else |
1004 | else |
832 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1005 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
833 | |
1006 | |
834 | event (EV_A_ (W)w, EV_PERIODIC); |
1007 | ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
835 | } |
1008 | } |
836 | } |
1009 | } |
837 | |
1010 | |
838 | static void |
1011 | static void |
839 | periodics_reschedule (EV_P) |
1012 | periodics_reschedule (EV_P) |
… | |
… | |
843 | /* adjust periodics after time jump */ |
1016 | /* adjust periodics after time jump */ |
844 | for (i = 0; i < periodiccnt; ++i) |
1017 | for (i = 0; i < periodiccnt; ++i) |
845 | { |
1018 | { |
846 | struct ev_periodic *w = periodics [i]; |
1019 | struct ev_periodic *w = periodics [i]; |
847 | |
1020 | |
|
|
1021 | if (w->reschedule_cb) |
|
|
1022 | ((WT)w)->at = w->reschedule_cb (w, rt_now); |
848 | if (w->interval) |
1023 | else if (w->interval) |
849 | { |
|
|
850 | ev_tstamp diff = ceil ((rt_now - w->at) / w->interval) * w->interval; |
1024 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
851 | |
|
|
852 | if (fabs (diff) >= 1e-4) |
|
|
853 | { |
|
|
854 | ev_periodic_stop (EV_A_ w); |
|
|
855 | ev_periodic_start (EV_A_ w); |
|
|
856 | |
|
|
857 | i = 0; /* restart loop, inefficient, but time jumps should be rare */ |
|
|
858 | } |
|
|
859 | } |
|
|
860 | } |
1025 | } |
|
|
1026 | |
|
|
1027 | /* now rebuild the heap */ |
|
|
1028 | for (i = periodiccnt >> 1; i--; ) |
|
|
1029 | downheap ((WT *)periodics, periodiccnt, i); |
861 | } |
1030 | } |
862 | |
1031 | |
863 | inline int |
1032 | inline int |
864 | time_update_monotonic (EV_P) |
1033 | time_update_monotonic (EV_P) |
865 | { |
1034 | { |
… | |
… | |
916 | { |
1085 | { |
917 | periodics_reschedule (EV_A); |
1086 | periodics_reschedule (EV_A); |
918 | |
1087 | |
919 | /* adjust timers. this is easy, as the offset is the same for all */ |
1088 | /* adjust timers. this is easy, as the offset is the same for all */ |
920 | for (i = 0; i < timercnt; ++i) |
1089 | for (i = 0; i < timercnt; ++i) |
921 | timers [i]->at += rt_now - mn_now; |
1090 | ((WT)timers [i])->at += rt_now - mn_now; |
922 | } |
1091 | } |
923 | |
1092 | |
924 | mn_now = rt_now; |
1093 | mn_now = rt_now; |
925 | } |
1094 | } |
926 | } |
1095 | } |
… | |
… | |
952 | { |
1121 | { |
953 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1122 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
954 | call_pending (EV_A); |
1123 | call_pending (EV_A); |
955 | } |
1124 | } |
956 | |
1125 | |
|
|
1126 | /* we might have forked, so reify kernel state if necessary */ |
|
|
1127 | if (expect_false (postfork)) |
|
|
1128 | loop_fork (EV_A); |
|
|
1129 | |
957 | /* update fd-related kernel structures */ |
1130 | /* update fd-related kernel structures */ |
958 | fd_reify (EV_A); |
1131 | fd_reify (EV_A); |
959 | |
1132 | |
960 | /* calculate blocking time */ |
1133 | /* calculate blocking time */ |
961 | |
1134 | |
962 | /* we only need this for !monotonic clockor timers, but as we basically |
1135 | /* we only need this for !monotonic clock or timers, but as we basically |
963 | always have timers, we just calculate it always */ |
1136 | always have timers, we just calculate it always */ |
964 | #if EV_USE_MONOTONIC |
1137 | #if EV_USE_MONOTONIC |
965 | if (expect_true (have_monotonic)) |
1138 | if (expect_true (have_monotonic)) |
966 | time_update_monotonic (EV_A); |
1139 | time_update_monotonic (EV_A); |
967 | else |
1140 | else |
… | |
… | |
977 | { |
1150 | { |
978 | block = MAX_BLOCKTIME; |
1151 | block = MAX_BLOCKTIME; |
979 | |
1152 | |
980 | if (timercnt) |
1153 | if (timercnt) |
981 | { |
1154 | { |
982 | ev_tstamp to = timers [0]->at - mn_now + method_fudge; |
1155 | ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
983 | if (block > to) block = to; |
1156 | if (block > to) block = to; |
984 | } |
1157 | } |
985 | |
1158 | |
986 | if (periodiccnt) |
1159 | if (periodiccnt) |
987 | { |
1160 | { |
988 | ev_tstamp to = periodics [0]->at - rt_now + method_fudge; |
1161 | ev_tstamp to = ((WT)periodics [0])->at - rt_now + method_fudge; |
989 | if (block > to) block = to; |
1162 | if (block > to) block = to; |
990 | } |
1163 | } |
991 | |
1164 | |
992 | if (block < 0.) block = 0.; |
1165 | if (block < 0.) block = 0.; |
993 | } |
1166 | } |
… | |
… | |
1000 | /* queue pending timers and reschedule them */ |
1173 | /* queue pending timers and reschedule them */ |
1001 | timers_reify (EV_A); /* relative timers called last */ |
1174 | timers_reify (EV_A); /* relative timers called last */ |
1002 | periodics_reify (EV_A); /* absolute timers called first */ |
1175 | periodics_reify (EV_A); /* absolute timers called first */ |
1003 | |
1176 | |
1004 | /* queue idle watchers unless io or timers are pending */ |
1177 | /* queue idle watchers unless io or timers are pending */ |
1005 | if (!pendingcnt) |
1178 | if (idlecnt && !any_pending (EV_A)) |
1006 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1179 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1007 | |
1180 | |
1008 | /* queue check watchers, to be executed first */ |
1181 | /* queue check watchers, to be executed first */ |
1009 | if (checkcnt) |
1182 | if (checkcnt) |
1010 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1183 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
… | |
… | |
1085 | return; |
1258 | return; |
1086 | |
1259 | |
1087 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1260 | assert (("ev_io_start called with negative fd", fd >= 0)); |
1088 | |
1261 | |
1089 | ev_start (EV_A_ (W)w, 1); |
1262 | ev_start (EV_A_ (W)w, 1); |
1090 | array_needsize (anfds, anfdmax, fd + 1, anfds_init); |
1263 | array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1091 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1264 | wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1092 | |
1265 | |
1093 | fd_change (EV_A_ fd); |
1266 | fd_change (EV_A_ fd); |
1094 | } |
1267 | } |
1095 | |
1268 | |
… | |
… | |
1110 | ev_timer_start (EV_P_ struct ev_timer *w) |
1283 | ev_timer_start (EV_P_ struct ev_timer *w) |
1111 | { |
1284 | { |
1112 | if (ev_is_active (w)) |
1285 | if (ev_is_active (w)) |
1113 | return; |
1286 | return; |
1114 | |
1287 | |
1115 | w->at += mn_now; |
1288 | ((WT)w)->at += mn_now; |
1116 | |
1289 | |
1117 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1290 | assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1118 | |
1291 | |
1119 | ev_start (EV_A_ (W)w, ++timercnt); |
1292 | ev_start (EV_A_ (W)w, ++timercnt); |
1120 | array_needsize (timers, timermax, timercnt, ); |
1293 | array_needsize (struct ev_timer *, timers, timermax, timercnt, (void)); |
1121 | timers [timercnt - 1] = w; |
1294 | timers [timercnt - 1] = w; |
1122 | upheap ((WT *)timers, timercnt - 1); |
1295 | upheap ((WT *)timers, timercnt - 1); |
|
|
1296 | |
|
|
1297 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1123 | } |
1298 | } |
1124 | |
1299 | |
1125 | void |
1300 | void |
1126 | ev_timer_stop (EV_P_ struct ev_timer *w) |
1301 | ev_timer_stop (EV_P_ struct ev_timer *w) |
1127 | { |
1302 | { |
1128 | ev_clear_pending (EV_A_ (W)w); |
1303 | ev_clear_pending (EV_A_ (W)w); |
1129 | if (!ev_is_active (w)) |
1304 | if (!ev_is_active (w)) |
1130 | return; |
1305 | return; |
1131 | |
1306 | |
|
|
1307 | assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
|
|
1308 | |
1132 | if (w->active < timercnt--) |
1309 | if (((W)w)->active < timercnt--) |
1133 | { |
1310 | { |
1134 | timers [w->active - 1] = timers [timercnt]; |
1311 | timers [((W)w)->active - 1] = timers [timercnt]; |
1135 | downheap ((WT *)timers, timercnt, w->active - 1); |
1312 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1136 | } |
1313 | } |
1137 | |
1314 | |
1138 | w->at = w->repeat; |
1315 | ((WT)w)->at = w->repeat; |
1139 | |
1316 | |
1140 | ev_stop (EV_A_ (W)w); |
1317 | ev_stop (EV_A_ (W)w); |
1141 | } |
1318 | } |
1142 | |
1319 | |
1143 | void |
1320 | void |
… | |
… | |
1145 | { |
1322 | { |
1146 | if (ev_is_active (w)) |
1323 | if (ev_is_active (w)) |
1147 | { |
1324 | { |
1148 | if (w->repeat) |
1325 | if (w->repeat) |
1149 | { |
1326 | { |
1150 | w->at = mn_now + w->repeat; |
1327 | ((WT)w)->at = mn_now + w->repeat; |
1151 | downheap ((WT *)timers, timercnt, w->active - 1); |
1328 | downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1152 | } |
1329 | } |
1153 | else |
1330 | else |
1154 | ev_timer_stop (EV_A_ w); |
1331 | ev_timer_stop (EV_A_ w); |
1155 | } |
1332 | } |
1156 | else if (w->repeat) |
1333 | else if (w->repeat) |
… | |
… | |
1161 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
1338 | ev_periodic_start (EV_P_ struct ev_periodic *w) |
1162 | { |
1339 | { |
1163 | if (ev_is_active (w)) |
1340 | if (ev_is_active (w)) |
1164 | return; |
1341 | return; |
1165 | |
1342 | |
|
|
1343 | if (w->reschedule_cb) |
|
|
1344 | ((WT)w)->at = w->reschedule_cb (w, rt_now); |
|
|
1345 | else if (w->interval) |
|
|
1346 | { |
1166 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1347 | assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1167 | |
|
|
1168 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1348 | /* this formula differs from the one in periodic_reify because we do not always round up */ |
1169 | if (w->interval) |
|
|
1170 | w->at += ceil ((rt_now - w->at) / w->interval) * w->interval; |
1349 | ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; |
|
|
1350 | } |
1171 | |
1351 | |
1172 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1352 | ev_start (EV_A_ (W)w, ++periodiccnt); |
1173 | array_needsize (periodics, periodicmax, periodiccnt, ); |
1353 | array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void)); |
1174 | periodics [periodiccnt - 1] = w; |
1354 | periodics [periodiccnt - 1] = w; |
1175 | upheap ((WT *)periodics, periodiccnt - 1); |
1355 | upheap ((WT *)periodics, periodiccnt - 1); |
|
|
1356 | |
|
|
1357 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1176 | } |
1358 | } |
1177 | |
1359 | |
1178 | void |
1360 | void |
1179 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1361 | ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1180 | { |
1362 | { |
1181 | ev_clear_pending (EV_A_ (W)w); |
1363 | ev_clear_pending (EV_A_ (W)w); |
1182 | if (!ev_is_active (w)) |
1364 | if (!ev_is_active (w)) |
1183 | return; |
1365 | return; |
1184 | |
1366 | |
|
|
1367 | assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
|
|
1368 | |
1185 | if (w->active < periodiccnt--) |
1369 | if (((W)w)->active < periodiccnt--) |
1186 | { |
1370 | { |
1187 | periodics [w->active - 1] = periodics [periodiccnt]; |
1371 | periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
1188 | downheap ((WT *)periodics, periodiccnt, w->active - 1); |
1372 | downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
1189 | } |
1373 | } |
1190 | |
1374 | |
1191 | ev_stop (EV_A_ (W)w); |
1375 | ev_stop (EV_A_ (W)w); |
1192 | } |
1376 | } |
1193 | |
1377 | |
1194 | void |
1378 | void |
|
|
1379 | ev_periodic_again (EV_P_ struct ev_periodic *w) |
|
|
1380 | { |
|
|
1381 | ev_periodic_stop (EV_A_ w); |
|
|
1382 | ev_periodic_start (EV_A_ w); |
|
|
1383 | } |
|
|
1384 | |
|
|
1385 | void |
1195 | ev_idle_start (EV_P_ struct ev_idle *w) |
1386 | ev_idle_start (EV_P_ struct ev_idle *w) |
1196 | { |
1387 | { |
1197 | if (ev_is_active (w)) |
1388 | if (ev_is_active (w)) |
1198 | return; |
1389 | return; |
1199 | |
1390 | |
1200 | ev_start (EV_A_ (W)w, ++idlecnt); |
1391 | ev_start (EV_A_ (W)w, ++idlecnt); |
1201 | array_needsize (idles, idlemax, idlecnt, ); |
1392 | array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void)); |
1202 | idles [idlecnt - 1] = w; |
1393 | idles [idlecnt - 1] = w; |
1203 | } |
1394 | } |
1204 | |
1395 | |
1205 | void |
1396 | void |
1206 | ev_idle_stop (EV_P_ struct ev_idle *w) |
1397 | ev_idle_stop (EV_P_ struct ev_idle *w) |
1207 | { |
1398 | { |
1208 | ev_clear_pending (EV_A_ (W)w); |
1399 | ev_clear_pending (EV_A_ (W)w); |
1209 | if (ev_is_active (w)) |
1400 | if (ev_is_active (w)) |
1210 | return; |
1401 | return; |
1211 | |
1402 | |
1212 | idles [w->active - 1] = idles [--idlecnt]; |
1403 | idles [((W)w)->active - 1] = idles [--idlecnt]; |
1213 | ev_stop (EV_A_ (W)w); |
1404 | ev_stop (EV_A_ (W)w); |
1214 | } |
1405 | } |
1215 | |
1406 | |
1216 | void |
1407 | void |
1217 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
1408 | ev_prepare_start (EV_P_ struct ev_prepare *w) |
1218 | { |
1409 | { |
1219 | if (ev_is_active (w)) |
1410 | if (ev_is_active (w)) |
1220 | return; |
1411 | return; |
1221 | |
1412 | |
1222 | ev_start (EV_A_ (W)w, ++preparecnt); |
1413 | ev_start (EV_A_ (W)w, ++preparecnt); |
1223 | array_needsize (prepares, preparemax, preparecnt, ); |
1414 | array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void)); |
1224 | prepares [preparecnt - 1] = w; |
1415 | prepares [preparecnt - 1] = w; |
1225 | } |
1416 | } |
1226 | |
1417 | |
1227 | void |
1418 | void |
1228 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1419 | ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1229 | { |
1420 | { |
1230 | ev_clear_pending (EV_A_ (W)w); |
1421 | ev_clear_pending (EV_A_ (W)w); |
1231 | if (ev_is_active (w)) |
1422 | if (ev_is_active (w)) |
1232 | return; |
1423 | return; |
1233 | |
1424 | |
1234 | prepares [w->active - 1] = prepares [--preparecnt]; |
1425 | prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
1235 | ev_stop (EV_A_ (W)w); |
1426 | ev_stop (EV_A_ (W)w); |
1236 | } |
1427 | } |
1237 | |
1428 | |
1238 | void |
1429 | void |
1239 | ev_check_start (EV_P_ struct ev_check *w) |
1430 | ev_check_start (EV_P_ struct ev_check *w) |
1240 | { |
1431 | { |
1241 | if (ev_is_active (w)) |
1432 | if (ev_is_active (w)) |
1242 | return; |
1433 | return; |
1243 | |
1434 | |
1244 | ev_start (EV_A_ (W)w, ++checkcnt); |
1435 | ev_start (EV_A_ (W)w, ++checkcnt); |
1245 | array_needsize (checks, checkmax, checkcnt, ); |
1436 | array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void)); |
1246 | checks [checkcnt - 1] = w; |
1437 | checks [checkcnt - 1] = w; |
1247 | } |
1438 | } |
1248 | |
1439 | |
1249 | void |
1440 | void |
1250 | ev_check_stop (EV_P_ struct ev_check *w) |
1441 | ev_check_stop (EV_P_ struct ev_check *w) |
1251 | { |
1442 | { |
1252 | ev_clear_pending (EV_A_ (W)w); |
1443 | ev_clear_pending (EV_A_ (W)w); |
1253 | if (ev_is_active (w)) |
1444 | if (ev_is_active (w)) |
1254 | return; |
1445 | return; |
1255 | |
1446 | |
1256 | checks [w->active - 1] = checks [--checkcnt]; |
1447 | checks [((W)w)->active - 1] = checks [--checkcnt]; |
1257 | ev_stop (EV_A_ (W)w); |
1448 | ev_stop (EV_A_ (W)w); |
1258 | } |
1449 | } |
1259 | |
1450 | |
1260 | #ifndef SA_RESTART |
1451 | #ifndef SA_RESTART |
1261 | # define SA_RESTART 0 |
1452 | # define SA_RESTART 0 |
… | |
… | |
1271 | return; |
1462 | return; |
1272 | |
1463 | |
1273 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1464 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1274 | |
1465 | |
1275 | ev_start (EV_A_ (W)w, 1); |
1466 | ev_start (EV_A_ (W)w, 1); |
1276 | array_needsize (signals, signalmax, w->signum, signals_init); |
1467 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
1277 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1468 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1278 | |
1469 | |
1279 | if (!w->next) |
1470 | if (!((WL)w)->next) |
1280 | { |
1471 | { |
|
|
1472 | #if WIN32 |
|
|
1473 | signal (w->signum, sighandler); |
|
|
1474 | #else |
1281 | struct sigaction sa; |
1475 | struct sigaction sa; |
1282 | sa.sa_handler = sighandler; |
1476 | sa.sa_handler = sighandler; |
1283 | sigfillset (&sa.sa_mask); |
1477 | sigfillset (&sa.sa_mask); |
1284 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1478 | sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1285 | sigaction (w->signum, &sa, 0); |
1479 | sigaction (w->signum, &sa, 0); |
|
|
1480 | #endif |
1286 | } |
1481 | } |
1287 | } |
1482 | } |
1288 | |
1483 | |
1289 | void |
1484 | void |
1290 | ev_signal_stop (EV_P_ struct ev_signal *w) |
1485 | ev_signal_stop (EV_P_ struct ev_signal *w) |
… | |
… | |
1340 | void (*cb)(int revents, void *arg) = once->cb; |
1535 | void (*cb)(int revents, void *arg) = once->cb; |
1341 | void *arg = once->arg; |
1536 | void *arg = once->arg; |
1342 | |
1537 | |
1343 | ev_io_stop (EV_A_ &once->io); |
1538 | ev_io_stop (EV_A_ &once->io); |
1344 | ev_timer_stop (EV_A_ &once->to); |
1539 | ev_timer_stop (EV_A_ &once->to); |
1345 | free (once); |
1540 | ev_free (once); |
1346 | |
1541 | |
1347 | cb (revents, arg); |
1542 | cb (revents, arg); |
1348 | } |
1543 | } |
1349 | |
1544 | |
1350 | static void |
1545 | static void |
… | |
… | |
1360 | } |
1555 | } |
1361 | |
1556 | |
1362 | void |
1557 | void |
1363 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1558 | ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1364 | { |
1559 | { |
1365 | struct ev_once *once = malloc (sizeof (struct ev_once)); |
1560 | struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1366 | |
1561 | |
1367 | if (!once) |
1562 | if (!once) |
1368 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1563 | cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1369 | else |
1564 | else |
1370 | { |
1565 | { |