ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
(Generate patch)

Comparing libev/ev.c (file contents):
Revision 1.58 by root, Sun Nov 4 16:52:52 2007 UTC vs.
Revision 1.79 by root, Fri Nov 9 15:15:20 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines