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

Comparing libev/ev.c (file contents):
Revision 1.229 by root, Fri May 2 08:08:45 2008 UTC vs.
Revision 1.256 by root, Thu Jun 19 06:53:49 2008 UTC

126# define EV_USE_EVENTFD 1 126# define EV_USE_EVENTFD 1
127# else 127# else
128# define EV_USE_EVENTFD 0 128# define EV_USE_EVENTFD 0
129# endif 129# endif
130# endif 130# endif
131 131
132#endif 132#endif
133 133
134#include <math.h> 134#include <math.h>
135#include <stdlib.h> 135#include <stdlib.h>
136#include <fcntl.h> 136#include <fcntl.h>
154#ifndef _WIN32 154#ifndef _WIN32
155# include <sys/time.h> 155# include <sys/time.h>
156# include <sys/wait.h> 156# include <sys/wait.h>
157# include <unistd.h> 157# include <unistd.h>
158#else 158#else
159# include <io.h>
159# define WIN32_LEAN_AND_MEAN 160# define WIN32_LEAN_AND_MEAN
160# include <windows.h> 161# include <windows.h>
161# ifndef EV_SELECT_IS_WINSOCKET 162# ifndef EV_SELECT_IS_WINSOCKET
162# define EV_SELECT_IS_WINSOCKET 1 163# define EV_SELECT_IS_WINSOCKET 1
163# endif 164# endif
164#endif 165#endif
165 166
166/* this block tries to deduce configuration from header-defined symbols and defaults */ 167/* this block tries to deduce configuration from header-defined symbols and defaults */
167 168
168#ifndef EV_USE_MONOTONIC 169#ifndef EV_USE_MONOTONIC
170# if defined (_POSIX_MONOTONIC_CLOCK) && _POSIX_MONOTONIC_CLOCK >= 0
171# define EV_USE_MONOTONIC 1
172# else
169# define EV_USE_MONOTONIC 0 173# define EV_USE_MONOTONIC 0
174# endif
170#endif 175#endif
171 176
172#ifndef EV_USE_REALTIME 177#ifndef EV_USE_REALTIME
173# define EV_USE_REALTIME 0 178# define EV_USE_REALTIME 0
174#endif 179#endif
175 180
176#ifndef EV_USE_NANOSLEEP 181#ifndef EV_USE_NANOSLEEP
182# if _POSIX_C_SOURCE >= 199309L
183# define EV_USE_NANOSLEEP 1
184# else
177# define EV_USE_NANOSLEEP 0 185# define EV_USE_NANOSLEEP 0
186# endif
178#endif 187#endif
179 188
180#ifndef EV_USE_SELECT 189#ifndef EV_USE_SELECT
181# define EV_USE_SELECT 1 190# define EV_USE_SELECT 1
182#endif 191#endif
233# if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7)) 242# if __linux && (__GLIBC__ > 2 || (__GLIBC__ == 2 && __GLIBC_MINOR__ >= 7))
234# define EV_USE_EVENTFD 1 243# define EV_USE_EVENTFD 1
235# else 244# else
236# define EV_USE_EVENTFD 0 245# define EV_USE_EVENTFD 0
237# endif 246# endif
247#endif
248
249#if 0 /* debugging */
250# define EV_VERIFY 3
251# define EV_USE_4HEAP 1
252# define EV_HEAP_CACHE_AT 1
253#endif
254
255#ifndef EV_VERIFY
256# define EV_VERIFY !EV_MINIMAL
257#endif
258
259#ifndef EV_USE_4HEAP
260# define EV_USE_4HEAP !EV_MINIMAL
261#endif
262
263#ifndef EV_HEAP_CACHE_AT
264# define EV_HEAP_CACHE_AT !EV_MINIMAL
238#endif 265#endif
239 266
240/* this block fixes any misconfiguration where we know we run into trouble otherwise */ 267/* this block fixes any misconfiguration where we know we run into trouble otherwise */
241 268
242#ifndef CLOCK_MONOTONIC 269#ifndef CLOCK_MONOTONIC
279} 306}
280# endif 307# endif
281#endif 308#endif
282 309
283/**/ 310/**/
311
312#if EV_VERIFY >= 3
313# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
314#else
315# define EV_FREQUENT_CHECK do { } while (0)
316#endif
284 317
285/* 318/*
286 * This is used to avoid floating point rounding problems. 319 * This is used to avoid floating point rounding problems.
287 * It is added to ev_rt_now when scheduling periodics 320 * It is added to ev_rt_now when scheduling periodics
288 * to ensure progress, time-wise, even when rounding 321 * to ensure progress, time-wise, even when rounding
422 W w; 455 W w;
423 int events; 456 int events;
424} ANPENDING; 457} ANPENDING;
425 458
426#if EV_USE_INOTIFY 459#if EV_USE_INOTIFY
460/* hash table entry per inotify-id */
427typedef struct 461typedef struct
428{ 462{
429 WL head; 463 WL head;
430} ANFS; 464} ANFS;
465#endif
466
467/* Heap Entry */
468#if EV_HEAP_CACHE_AT
469 typedef struct {
470 ev_tstamp at;
471 WT w;
472 } ANHE;
473
474 #define ANHE_w(he) (he).w /* access watcher, read-write */
475 #define ANHE_at(he) (he).at /* access cached at, read-only */
476 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
477#else
478 typedef WT ANHE;
479
480 #define ANHE_w(he) (he)
481 #define ANHE_at(he) (he)->at
482 #define ANHE_at_cache(he)
431#endif 483#endif
432 484
433#if EV_MULTIPLICITY 485#if EV_MULTIPLICITY
434 486
435 struct ev_loop 487 struct ev_loop
520 } 572 }
521} 573}
522 574
523/*****************************************************************************/ 575/*****************************************************************************/
524 576
577#define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */
578
525int inline_size 579int inline_size
526array_nextsize (int elem, int cur, int cnt) 580array_nextsize (int elem, int cur, int cnt)
527{ 581{
528 int ncur = cur + 1; 582 int ncur = cur + 1;
529 583
530 do 584 do
531 ncur <<= 1; 585 ncur <<= 1;
532 while (cnt > ncur); 586 while (cnt > ncur);
533 587
534 /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ 588 /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */
535 if (elem * ncur > 4096) 589 if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4)
536 { 590 {
537 ncur *= elem; 591 ncur *= elem;
538 ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; 592 ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1);
539 ncur = ncur - sizeof (void *) * 4; 593 ncur = ncur - sizeof (void *) * 4;
540 ncur /= elem; 594 ncur /= elem;
541 } 595 }
542 596
543 return ncur; 597 return ncur;
654 events |= (unsigned char)w->events; 708 events |= (unsigned char)w->events;
655 709
656#if EV_SELECT_IS_WINSOCKET 710#if EV_SELECT_IS_WINSOCKET
657 if (events) 711 if (events)
658 { 712 {
659 unsigned long argp; 713 unsigned long arg;
660 #ifdef EV_FD_TO_WIN32_HANDLE 714 #ifdef EV_FD_TO_WIN32_HANDLE
661 anfd->handle = EV_FD_TO_WIN32_HANDLE (fd); 715 anfd->handle = EV_FD_TO_WIN32_HANDLE (fd);
662 #else 716 #else
663 anfd->handle = _get_osfhandle (fd); 717 anfd->handle = _get_osfhandle (fd);
664 #endif 718 #endif
665 assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &argp) == 0)); 719 assert (("libev only supports socket fds in this configuration", ioctlsocket (anfd->handle, FIONREAD, &arg) == 0));
666 } 720 }
667#endif 721#endif
668 722
669 { 723 {
670 unsigned char o_events = anfd->events; 724 unsigned char o_events = anfd->events;
723{ 777{
724 int fd; 778 int fd;
725 779
726 for (fd = 0; fd < anfdmax; ++fd) 780 for (fd = 0; fd < anfdmax; ++fd)
727 if (anfds [fd].events) 781 if (anfds [fd].events)
728 if (!fd_valid (fd) == -1 && errno == EBADF) 782 if (!fd_valid (fd) && errno == EBADF)
729 fd_kill (EV_A_ fd); 783 fd_kill (EV_A_ fd);
730} 784}
731 785
732/* called on ENOMEM in select/poll to kill some fds and retry */ 786/* called on ENOMEM in select/poll to kill some fds and retry */
733static void noinline 787static void noinline
757 } 811 }
758} 812}
759 813
760/*****************************************************************************/ 814/*****************************************************************************/
761 815
816/*
817 * the heap functions want a real array index. array index 0 uis guaranteed to not
818 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
819 * the branching factor of the d-tree.
820 */
821
822/*
823 * at the moment we allow libev the luxury of two heaps,
824 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
825 * which is more cache-efficient.
826 * the difference is about 5% with 50000+ watchers.
827 */
828#if EV_USE_4HEAP
829
830#define DHEAP 4
831#define HEAP0 (DHEAP - 1) /* index of first element in heap */
832#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
833#define UPHEAP_DONE(p,k) ((p) == (k))
834
835/* away from the root */
836void inline_speed
837downheap (ANHE *heap, int N, int k)
838{
839 ANHE he = heap [k];
840 ANHE *E = heap + N + HEAP0;
841
842 for (;;)
843 {
844 ev_tstamp minat;
845 ANHE *minpos;
846 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
847
848 /* find minimum child */
849 if (expect_true (pos + DHEAP - 1 < E))
850 {
851 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
852 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
853 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
854 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
855 }
856 else if (pos < E)
857 {
858 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
859 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
860 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
861 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
862 }
863 else
864 break;
865
866 if (ANHE_at (he) <= minat)
867 break;
868
869 heap [k] = *minpos;
870 ev_active (ANHE_w (*minpos)) = k;
871
872 k = minpos - heap;
873 }
874
875 heap [k] = he;
876 ev_active (ANHE_w (he)) = k;
877}
878
879#else /* 4HEAP */
880
881#define HEAP0 1
882#define HPARENT(k) ((k) >> 1)
883#define UPHEAP_DONE(p,k) (!(p))
884
885/* away from the root */
886void inline_speed
887downheap (ANHE *heap, int N, int k)
888{
889 ANHE he = heap [k];
890
891 for (;;)
892 {
893 int c = k << 1;
894
895 if (c > N + HEAP0 - 1)
896 break;
897
898 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
899 ? 1 : 0;
900
901 if (ANHE_at (he) <= ANHE_at (heap [c]))
902 break;
903
904 heap [k] = heap [c];
905 ev_active (ANHE_w (heap [k])) = k;
906
907 k = c;
908 }
909
910 heap [k] = he;
911 ev_active (ANHE_w (he)) = k;
912}
913#endif
914
762/* towards the root */ 915/* towards the root */
763void inline_speed 916void inline_speed
764upheap (WT *heap, int k) 917upheap (ANHE *heap, int k)
765{ 918{
766 WT w = heap [k]; 919 ANHE he = heap [k];
767 920
768 for (;;) 921 for (;;)
769 { 922 {
770 int p = k >> 1; 923 int p = HPARENT (k);
771 924
772 /* maybe we could use a dummy element at heap [0]? */ 925 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
773 if (!p || heap [p]->at <= w->at)
774 break; 926 break;
775 927
776 heap [k] = heap [p]; 928 heap [k] = heap [p];
777 ((W)heap [k])->active = k; 929 ev_active (ANHE_w (heap [k])) = k;
778 k = p; 930 k = p;
779 } 931 }
780 932
781 heap [k] = w; 933 heap [k] = he;
782 ((W)heap [k])->active = k; 934 ev_active (ANHE_w (he)) = k;
783}
784
785/* away from the root */
786void inline_speed
787downheap (WT *heap, int N, int k)
788{
789 WT w = heap [k];
790
791 for (;;)
792 {
793 int c = k << 1;
794
795 if (c > N)
796 break;
797
798 c += c < N && heap [c]->at > heap [c + 1]->at
799 ? 1 : 0;
800
801 if (w->at <= heap [c]->at)
802 break;
803
804 heap [k] = heap [c];
805 ((W)heap [k])->active = k;
806
807 k = c;
808 }
809
810 heap [k] = w;
811 ((W)heap [k])->active = k;
812} 935}
813 936
814void inline_size 937void inline_size
815adjustheap (WT *heap, int N, int k) 938adjustheap (ANHE *heap, int N, int k)
816{ 939{
940 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
817 upheap (heap, k); 941 upheap (heap, k);
942 else
818 downheap (heap, N, k); 943 downheap (heap, N, k);
944}
945
946/* rebuild the heap: this function is used only once and executed rarely */
947void inline_size
948reheap (ANHE *heap, int N)
949{
950 int i;
951
952 /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
953 /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
954 for (i = 0; i < N; ++i)
955 upheap (heap, i + HEAP0);
819} 956}
820 957
821/*****************************************************************************/ 958/*****************************************************************************/
822 959
823typedef struct 960typedef struct
847 984
848void inline_speed 985void inline_speed
849fd_intern (int fd) 986fd_intern (int fd)
850{ 987{
851#ifdef _WIN32 988#ifdef _WIN32
852 int arg = 1; 989 unsigned long arg = 1;
853 ioctlsocket (_get_osfhandle (fd), FIONBIO, &arg); 990 ioctlsocket (_get_osfhandle (fd), FIONBIO, &arg);
854#else 991#else
855 fcntl (fd, F_SETFD, FD_CLOEXEC); 992 fcntl (fd, F_SETFD, FD_CLOEXEC);
856 fcntl (fd, F_SETFL, O_NONBLOCK); 993 fcntl (fd, F_SETFL, O_NONBLOCK);
857#endif 994#endif
912pipecb (EV_P_ ev_io *iow, int revents) 1049pipecb (EV_P_ ev_io *iow, int revents)
913{ 1050{
914#if EV_USE_EVENTFD 1051#if EV_USE_EVENTFD
915 if (evfd >= 0) 1052 if (evfd >= 0)
916 { 1053 {
917 uint64_t counter = 1; 1054 uint64_t counter;
918 read (evfd, &counter, sizeof (uint64_t)); 1055 read (evfd, &counter, sizeof (uint64_t));
919 } 1056 }
920 else 1057 else
921#endif 1058#endif
922 { 1059 {
1341 1478
1342 postfork = 0; 1479 postfork = 0;
1343} 1480}
1344 1481
1345#if EV_MULTIPLICITY 1482#if EV_MULTIPLICITY
1483
1346struct ev_loop * 1484struct ev_loop *
1347ev_loop_new (unsigned int flags) 1485ev_loop_new (unsigned int flags)
1348{ 1486{
1349 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); 1487 struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop));
1350 1488
1369ev_loop_fork (EV_P) 1507ev_loop_fork (EV_P)
1370{ 1508{
1371 postfork = 1; /* must be in line with ev_default_fork */ 1509 postfork = 1; /* must be in line with ev_default_fork */
1372} 1510}
1373 1511
1512#if EV_VERIFY
1513void noinline
1514verify_watcher (EV_P_ W w)
1515{
1516 assert (("watcher has invalid priority", ABSPRI (w) >= 0 && ABSPRI (w) < NUMPRI));
1517
1518 if (w->pending)
1519 assert (("pending watcher not on pending queue", pendings [ABSPRI (w)][w->pending - 1].w == w));
1520}
1521
1522static void noinline
1523verify_heap (EV_P_ ANHE *heap, int N)
1524{
1525 int i;
1526
1527 for (i = HEAP0; i < N + HEAP0; ++i)
1528 {
1529 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
1530 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
1531 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
1532
1533 verify_watcher (EV_A_ (W)ANHE_w (heap [i]));
1534 }
1535}
1536
1537static void noinline
1538array_verify (EV_P_ W *ws, int cnt)
1539{
1540 while (cnt--)
1541 {
1542 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1543 verify_watcher (EV_A_ ws [cnt]);
1544 }
1545}
1546#endif
1547
1548void
1549ev_loop_verify (EV_P)
1550{
1551#if EV_VERIFY
1552 int i;
1553 WL w;
1554
1555 assert (activecnt >= -1);
1556
1557 assert (fdchangemax >= fdchangecnt);
1558 for (i = 0; i < fdchangecnt; ++i)
1559 assert (("negative fd in fdchanges", fdchanges [i] >= 0));
1560
1561 assert (anfdmax >= 0);
1562 for (i = 0; i < anfdmax; ++i)
1563 for (w = anfds [i].head; w; w = w->next)
1564 {
1565 verify_watcher (EV_A_ (W)w);
1566 assert (("inactive fd watcher on anfd list", ev_active (w) == 1));
1567 assert (("fd mismatch between watcher and anfd", ((ev_io *)w)->fd == i));
1568 }
1569
1570 assert (timermax >= timercnt);
1571 verify_heap (EV_A_ timers, timercnt);
1572
1573#if EV_PERIODIC_ENABLE
1574 assert (periodicmax >= periodiccnt);
1575 verify_heap (EV_A_ periodics, periodiccnt);
1576#endif
1577
1578 for (i = NUMPRI; i--; )
1579 {
1580 assert (pendingmax [i] >= pendingcnt [i]);
1581#if EV_IDLE_ENABLE
1582 assert (idleall >= 0);
1583 assert (idlemax [i] >= idlecnt [i]);
1584 array_verify (EV_A_ (W *)idles [i], idlecnt [i]);
1585#endif
1586 }
1587
1588#if EV_FORK_ENABLE
1589 assert (forkmax >= forkcnt);
1590 array_verify (EV_A_ (W *)forks, forkcnt);
1591#endif
1592
1593#if EV_ASYNC_ENABLE
1594 assert (asyncmax >= asynccnt);
1595 array_verify (EV_A_ (W *)asyncs, asynccnt);
1596#endif
1597
1598 assert (preparemax >= preparecnt);
1599 array_verify (EV_A_ (W *)prepares, preparecnt);
1600
1601 assert (checkmax >= checkcnt);
1602 array_verify (EV_A_ (W *)checks, checkcnt);
1603
1604# if 0
1605 for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next)
1606 for (signum = signalmax; signum--; ) if (signals [signum].gotsig)
1374#endif 1607# endif
1608#endif
1609}
1610
1611#endif /* multiplicity */
1375 1612
1376#if EV_MULTIPLICITY 1613#if EV_MULTIPLICITY
1377struct ev_loop * 1614struct ev_loop *
1378ev_default_loop_init (unsigned int flags) 1615ev_default_loop_init (unsigned int flags)
1379#else 1616#else
1455 { 1692 {
1456 /*assert (("non-pending watcher on pending list", p->w->pending));*/ 1693 /*assert (("non-pending watcher on pending list", p->w->pending));*/
1457 1694
1458 p->w->pending = 0; 1695 p->w->pending = 0;
1459 EV_CB_INVOKE (p->w, p->events); 1696 EV_CB_INVOKE (p->w, p->events);
1697 EV_FREQUENT_CHECK;
1460 } 1698 }
1461 } 1699 }
1462} 1700}
1463
1464void inline_size
1465timers_reify (EV_P)
1466{
1467 while (timercnt && ev_at (timers [1]) <= mn_now)
1468 {
1469 ev_timer *w = (ev_timer *)timers [1];
1470
1471 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1472
1473 /* first reschedule or stop timer */
1474 if (w->repeat)
1475 {
1476 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1477
1478 ev_at (w) += w->repeat;
1479 if (ev_at (w) < mn_now)
1480 ev_at (w) = mn_now;
1481
1482 downheap (timers, timercnt, 1);
1483 }
1484 else
1485 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1486
1487 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1488 }
1489}
1490
1491#if EV_PERIODIC_ENABLE
1492void inline_size
1493periodics_reify (EV_P)
1494{
1495 while (periodiccnt && ev_at (periodics [1]) <= ev_rt_now)
1496 {
1497 ev_periodic *w = (ev_periodic *)periodics [1];
1498
1499 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1500
1501 /* first reschedule or stop timer */
1502 if (w->reschedule_cb)
1503 {
1504 ev_at (w) = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1505 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) > ev_rt_now));
1506 downheap (periodics, periodiccnt, 1);
1507 }
1508 else if (w->interval)
1509 {
1510 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1511 if (ev_at (w) - ev_rt_now <= TIME_EPSILON) ev_at (w) += w->interval;
1512 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ev_at (w) > ev_rt_now));
1513 downheap (periodics, periodiccnt, 1);
1514 }
1515 else
1516 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1517
1518 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1519 }
1520}
1521
1522static void noinline
1523periodics_reschedule (EV_P)
1524{
1525 int i;
1526
1527 /* adjust periodics after time jump */
1528 for (i = 0; i < periodiccnt; ++i)
1529 {
1530 ev_periodic *w = (ev_periodic *)periodics [i];
1531
1532 if (w->reschedule_cb)
1533 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1534 else if (w->interval)
1535 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1536 }
1537
1538 /* now rebuild the heap */
1539 for (i = periodiccnt >> 1; i--; )
1540 downheap (periodics, periodiccnt, i);
1541}
1542#endif
1543 1701
1544#if EV_IDLE_ENABLE 1702#if EV_IDLE_ENABLE
1545void inline_size 1703void inline_size
1546idle_reify (EV_P) 1704idle_reify (EV_P)
1547{ 1705{
1559 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1717 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1560 break; 1718 break;
1561 } 1719 }
1562 } 1720 }
1563 } 1721 }
1722}
1723#endif
1724
1725void inline_size
1726timers_reify (EV_P)
1727{
1728 EV_FREQUENT_CHECK;
1729
1730 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1731 {
1732 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1733
1734 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1735
1736 /* first reschedule or stop timer */
1737 if (w->repeat)
1738 {
1739 ev_at (w) += w->repeat;
1740 if (ev_at (w) < mn_now)
1741 ev_at (w) = mn_now;
1742
1743 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1744
1745 ANHE_at_cache (timers [HEAP0]);
1746 downheap (timers, timercnt, HEAP0);
1747 }
1748 else
1749 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1750
1751 EV_FREQUENT_CHECK;
1752 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1753 }
1754}
1755
1756#if EV_PERIODIC_ENABLE
1757void inline_size
1758periodics_reify (EV_P)
1759{
1760 EV_FREQUENT_CHECK;
1761
1762 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1763 {
1764 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1765
1766 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1767
1768 /* first reschedule or stop timer */
1769 if (w->reschedule_cb)
1770 {
1771 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1772
1773 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1774
1775 ANHE_at_cache (periodics [HEAP0]);
1776 downheap (periodics, periodiccnt, HEAP0);
1777 }
1778 else if (w->interval)
1779 {
1780 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1781 /* if next trigger time is not sufficiently in the future, put it there */
1782 /* this might happen because of floating point inexactness */
1783 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1784 {
1785 ev_at (w) += w->interval;
1786
1787 /* if interval is unreasonably low we might still have a time in the past */
1788 /* so correct this. this will make the periodic very inexact, but the user */
1789 /* has effectively asked to get triggered more often than possible */
1790 if (ev_at (w) < ev_rt_now)
1791 ev_at (w) = ev_rt_now;
1792 }
1793
1794 ANHE_at_cache (periodics [HEAP0]);
1795 downheap (periodics, periodiccnt, HEAP0);
1796 }
1797 else
1798 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1799
1800 EV_FREQUENT_CHECK;
1801 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1802 }
1803}
1804
1805static void noinline
1806periodics_reschedule (EV_P)
1807{
1808 int i;
1809
1810 /* adjust periodics after time jump */
1811 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1812 {
1813 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1814
1815 if (w->reschedule_cb)
1816 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1817 else if (w->interval)
1818 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1819
1820 ANHE_at_cache (periodics [i]);
1821 }
1822
1823 reheap (periodics, periodiccnt);
1564} 1824}
1565#endif 1825#endif
1566 1826
1567void inline_speed 1827void inline_speed
1568time_update (EV_P_ ev_tstamp max_block) 1828time_update (EV_P_ ev_tstamp max_block)
1597 */ 1857 */
1598 for (i = 4; --i; ) 1858 for (i = 4; --i; )
1599 { 1859 {
1600 rtmn_diff = ev_rt_now - mn_now; 1860 rtmn_diff = ev_rt_now - mn_now;
1601 1861
1602 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1862 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1603 return; /* all is well */ 1863 return; /* all is well */
1604 1864
1605 ev_rt_now = ev_time (); 1865 ev_rt_now = ev_time ();
1606 mn_now = get_clock (); 1866 mn_now = get_clock ();
1607 now_floor = mn_now; 1867 now_floor = mn_now;
1622 { 1882 {
1623#if EV_PERIODIC_ENABLE 1883#if EV_PERIODIC_ENABLE
1624 periodics_reschedule (EV_A); 1884 periodics_reschedule (EV_A);
1625#endif 1885#endif
1626 /* adjust timers. this is easy, as the offset is the same for all of them */ 1886 /* adjust timers. this is easy, as the offset is the same for all of them */
1627 for (i = 1; i <= timercnt; ++i) 1887 for (i = 0; i < timercnt; ++i)
1628 ev_at (timers [i]) += ev_rt_now - mn_now; 1888 {
1889 ANHE *he = timers + i + HEAP0;
1890 ANHE_w (*he)->at += ev_rt_now - mn_now;
1891 ANHE_at_cache (*he);
1892 }
1629 } 1893 }
1630 1894
1631 mn_now = ev_rt_now; 1895 mn_now = ev_rt_now;
1632 } 1896 }
1633} 1897}
1653 1917
1654 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ 1918 call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */
1655 1919
1656 do 1920 do
1657 { 1921 {
1922#if EV_VERIFY >= 2
1923 ev_loop_verify (EV_A);
1924#endif
1925
1658#ifndef _WIN32 1926#ifndef _WIN32
1659 if (expect_false (curpid)) /* penalise the forking check even more */ 1927 if (expect_false (curpid)) /* penalise the forking check even more */
1660 if (expect_false (getpid () != curpid)) 1928 if (expect_false (getpid () != curpid))
1661 { 1929 {
1662 curpid = getpid (); 1930 curpid = getpid ();
1703 1971
1704 waittime = MAX_BLOCKTIME; 1972 waittime = MAX_BLOCKTIME;
1705 1973
1706 if (timercnt) 1974 if (timercnt)
1707 { 1975 {
1708 ev_tstamp to = ev_at (timers [1]) - mn_now + backend_fudge; 1976 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1709 if (waittime > to) waittime = to; 1977 if (waittime > to) waittime = to;
1710 } 1978 }
1711 1979
1712#if EV_PERIODIC_ENABLE 1980#if EV_PERIODIC_ENABLE
1713 if (periodiccnt) 1981 if (periodiccnt)
1714 { 1982 {
1715 ev_tstamp to = ev_at (periodics [1]) - ev_rt_now + backend_fudge; 1983 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1716 if (waittime > to) waittime = to; 1984 if (waittime > to) waittime = to;
1717 } 1985 }
1718#endif 1986#endif
1719 1987
1720 if (expect_false (waittime < timeout_blocktime)) 1988 if (expect_false (waittime < timeout_blocktime))
1857 if (expect_false (ev_is_active (w))) 2125 if (expect_false (ev_is_active (w)))
1858 return; 2126 return;
1859 2127
1860 assert (("ev_io_start called with negative fd", fd >= 0)); 2128 assert (("ev_io_start called with negative fd", fd >= 0));
1861 2129
2130 EV_FREQUENT_CHECK;
2131
1862 ev_start (EV_A_ (W)w, 1); 2132 ev_start (EV_A_ (W)w, 1);
1863 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2133 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1864 wlist_add (&anfds[fd].head, (WL)w); 2134 wlist_add (&anfds[fd].head, (WL)w);
1865 2135
1866 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2136 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1867 w->events &= ~EV_IOFDSET; 2137 w->events &= ~EV_IOFDSET;
2138
2139 EV_FREQUENT_CHECK;
1868} 2140}
1869 2141
1870void noinline 2142void noinline
1871ev_io_stop (EV_P_ ev_io *w) 2143ev_io_stop (EV_P_ ev_io *w)
1872{ 2144{
1873 clear_pending (EV_A_ (W)w); 2145 clear_pending (EV_A_ (W)w);
1874 if (expect_false (!ev_is_active (w))) 2146 if (expect_false (!ev_is_active (w)))
1875 return; 2147 return;
1876 2148
1877 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2149 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2150
2151 EV_FREQUENT_CHECK;
1878 2152
1879 wlist_del (&anfds[w->fd].head, (WL)w); 2153 wlist_del (&anfds[w->fd].head, (WL)w);
1880 ev_stop (EV_A_ (W)w); 2154 ev_stop (EV_A_ (W)w);
1881 2155
1882 fd_change (EV_A_ w->fd, 1); 2156 fd_change (EV_A_ w->fd, 1);
2157
2158 EV_FREQUENT_CHECK;
1883} 2159}
1884 2160
1885void noinline 2161void noinline
1886ev_timer_start (EV_P_ ev_timer *w) 2162ev_timer_start (EV_P_ ev_timer *w)
1887{ 2163{
1890 2166
1891 ev_at (w) += mn_now; 2167 ev_at (w) += mn_now;
1892 2168
1893 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2169 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1894 2170
2171 EV_FREQUENT_CHECK;
2172
2173 ++timercnt;
1895 ev_start (EV_A_ (W)w, ++timercnt); 2174 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1896 array_needsize (WT, timers, timermax, timercnt + 1, EMPTY2); 2175 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1897 timers [timercnt] = (WT)w; 2176 ANHE_w (timers [ev_active (w)]) = (WT)w;
2177 ANHE_at_cache (timers [ev_active (w)]);
1898 upheap (timers, timercnt); 2178 upheap (timers, ev_active (w));
1899 2179
2180 EV_FREQUENT_CHECK;
2181
1900 /*assert (("internal timer heap corruption", timers [((W)w)->active] == w));*/ 2182 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1901} 2183}
1902 2184
1903void noinline 2185void noinline
1904ev_timer_stop (EV_P_ ev_timer *w) 2186ev_timer_stop (EV_P_ ev_timer *w)
1905{ 2187{
1906 clear_pending (EV_A_ (W)w); 2188 clear_pending (EV_A_ (W)w);
1907 if (expect_false (!ev_is_active (w))) 2189 if (expect_false (!ev_is_active (w)))
1908 return; 2190 return;
1909 2191
1910 assert (("internal timer heap corruption", timers [((W)w)->active] == (WT)w)); 2192 EV_FREQUENT_CHECK;
1911 2193
1912 { 2194 {
1913 int active = ((W)w)->active; 2195 int active = ev_active (w);
1914 2196
2197 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2198
2199 --timercnt;
2200
1915 if (expect_true (active < timercnt)) 2201 if (expect_true (active < timercnt + HEAP0))
1916 { 2202 {
1917 timers [active] = timers [timercnt]; 2203 timers [active] = timers [timercnt + HEAP0];
1918 adjustheap (timers, timercnt, active); 2204 adjustheap (timers, timercnt, active);
1919 } 2205 }
1920
1921 --timercnt;
1922 } 2206 }
2207
2208 EV_FREQUENT_CHECK;
1923 2209
1924 ev_at (w) -= mn_now; 2210 ev_at (w) -= mn_now;
1925 2211
1926 ev_stop (EV_A_ (W)w); 2212 ev_stop (EV_A_ (W)w);
1927} 2213}
1928 2214
1929void noinline 2215void noinline
1930ev_timer_again (EV_P_ ev_timer *w) 2216ev_timer_again (EV_P_ ev_timer *w)
1931{ 2217{
2218 EV_FREQUENT_CHECK;
2219
1932 if (ev_is_active (w)) 2220 if (ev_is_active (w))
1933 { 2221 {
1934 if (w->repeat) 2222 if (w->repeat)
1935 { 2223 {
1936 ev_at (w) = mn_now + w->repeat; 2224 ev_at (w) = mn_now + w->repeat;
2225 ANHE_at_cache (timers [ev_active (w)]);
1937 adjustheap (timers, timercnt, ((W)w)->active); 2226 adjustheap (timers, timercnt, ev_active (w));
1938 } 2227 }
1939 else 2228 else
1940 ev_timer_stop (EV_A_ w); 2229 ev_timer_stop (EV_A_ w);
1941 } 2230 }
1942 else if (w->repeat) 2231 else if (w->repeat)
1943 { 2232 {
1944 ev_at (w) = w->repeat; 2233 ev_at (w) = w->repeat;
1945 ev_timer_start (EV_A_ w); 2234 ev_timer_start (EV_A_ w);
1946 } 2235 }
2236
2237 EV_FREQUENT_CHECK;
1947} 2238}
1948 2239
1949#if EV_PERIODIC_ENABLE 2240#if EV_PERIODIC_ENABLE
1950void noinline 2241void noinline
1951ev_periodic_start (EV_P_ ev_periodic *w) 2242ev_periodic_start (EV_P_ ev_periodic *w)
1962 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2253 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1963 } 2254 }
1964 else 2255 else
1965 ev_at (w) = w->offset; 2256 ev_at (w) = w->offset;
1966 2257
2258 EV_FREQUENT_CHECK;
2259
2260 ++periodiccnt;
1967 ev_start (EV_A_ (W)w, ++periodiccnt); 2261 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
1968 array_needsize (WT, periodics, periodicmax, periodiccnt + 1, EMPTY2); 2262 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
1969 periodics [periodiccnt] = (WT)w; 2263 ANHE_w (periodics [ev_active (w)]) = (WT)w;
1970 upheap (periodics, periodiccnt); 2264 ANHE_at_cache (periodics [ev_active (w)]);
2265 upheap (periodics, ev_active (w));
1971 2266
2267 EV_FREQUENT_CHECK;
2268
1972 /*assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));*/ 2269 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
1973} 2270}
1974 2271
1975void noinline 2272void noinline
1976ev_periodic_stop (EV_P_ ev_periodic *w) 2273ev_periodic_stop (EV_P_ ev_periodic *w)
1977{ 2274{
1978 clear_pending (EV_A_ (W)w); 2275 clear_pending (EV_A_ (W)w);
1979 if (expect_false (!ev_is_active (w))) 2276 if (expect_false (!ev_is_active (w)))
1980 return; 2277 return;
1981 2278
1982 assert (("internal periodic heap corruption", periodics [((W)w)->active] == (WT)w)); 2279 EV_FREQUENT_CHECK;
1983 2280
1984 { 2281 {
1985 int active = ((W)w)->active; 2282 int active = ev_active (w);
1986 2283
2284 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2285
2286 --periodiccnt;
2287
1987 if (expect_true (active < periodiccnt)) 2288 if (expect_true (active < periodiccnt + HEAP0))
1988 { 2289 {
1989 periodics [active] = periodics [periodiccnt]; 2290 periodics [active] = periodics [periodiccnt + HEAP0];
1990 adjustheap (periodics, periodiccnt, active); 2291 adjustheap (periodics, periodiccnt, active);
1991 } 2292 }
1992
1993 --periodiccnt;
1994 } 2293 }
2294
2295 EV_FREQUENT_CHECK;
1995 2296
1996 ev_stop (EV_A_ (W)w); 2297 ev_stop (EV_A_ (W)w);
1997} 2298}
1998 2299
1999void noinline 2300void noinline
2019 return; 2320 return;
2020 2321
2021 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2322 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
2022 2323
2023 evpipe_init (EV_A); 2324 evpipe_init (EV_A);
2325
2326 EV_FREQUENT_CHECK;
2024 2327
2025 { 2328 {
2026#ifndef _WIN32 2329#ifndef _WIN32
2027 sigset_t full, prev; 2330 sigset_t full, prev;
2028 sigfillset (&full); 2331 sigfillset (&full);
2049 sigfillset (&sa.sa_mask); 2352 sigfillset (&sa.sa_mask);
2050 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2353 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2051 sigaction (w->signum, &sa, 0); 2354 sigaction (w->signum, &sa, 0);
2052#endif 2355#endif
2053 } 2356 }
2357
2358 EV_FREQUENT_CHECK;
2054} 2359}
2055 2360
2056void noinline 2361void noinline
2057ev_signal_stop (EV_P_ ev_signal *w) 2362ev_signal_stop (EV_P_ ev_signal *w)
2058{ 2363{
2059 clear_pending (EV_A_ (W)w); 2364 clear_pending (EV_A_ (W)w);
2060 if (expect_false (!ev_is_active (w))) 2365 if (expect_false (!ev_is_active (w)))
2061 return; 2366 return;
2062 2367
2368 EV_FREQUENT_CHECK;
2369
2063 wlist_del (&signals [w->signum - 1].head, (WL)w); 2370 wlist_del (&signals [w->signum - 1].head, (WL)w);
2064 ev_stop (EV_A_ (W)w); 2371 ev_stop (EV_A_ (W)w);
2065 2372
2066 if (!signals [w->signum - 1].head) 2373 if (!signals [w->signum - 1].head)
2067 signal (w->signum, SIG_DFL); 2374 signal (w->signum, SIG_DFL);
2375
2376 EV_FREQUENT_CHECK;
2068} 2377}
2069 2378
2070void 2379void
2071ev_child_start (EV_P_ ev_child *w) 2380ev_child_start (EV_P_ ev_child *w)
2072{ 2381{
2074 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2383 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2075#endif 2384#endif
2076 if (expect_false (ev_is_active (w))) 2385 if (expect_false (ev_is_active (w)))
2077 return; 2386 return;
2078 2387
2388 EV_FREQUENT_CHECK;
2389
2079 ev_start (EV_A_ (W)w, 1); 2390 ev_start (EV_A_ (W)w, 1);
2080 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2391 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2392
2393 EV_FREQUENT_CHECK;
2081} 2394}
2082 2395
2083void 2396void
2084ev_child_stop (EV_P_ ev_child *w) 2397ev_child_stop (EV_P_ ev_child *w)
2085{ 2398{
2086 clear_pending (EV_A_ (W)w); 2399 clear_pending (EV_A_ (W)w);
2087 if (expect_false (!ev_is_active (w))) 2400 if (expect_false (!ev_is_active (w)))
2088 return; 2401 return;
2089 2402
2403 EV_FREQUENT_CHECK;
2404
2090 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2405 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2091 ev_stop (EV_A_ (W)w); 2406 ev_stop (EV_A_ (W)w);
2407
2408 EV_FREQUENT_CHECK;
2092} 2409}
2093 2410
2094#if EV_STAT_ENABLE 2411#if EV_STAT_ENABLE
2095 2412
2096# ifdef _WIN32 2413# ifdef _WIN32
2114 if (w->wd < 0) 2431 if (w->wd < 0)
2115 { 2432 {
2116 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ 2433 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2117 2434
2118 /* monitor some parent directory for speedup hints */ 2435 /* monitor some parent directory for speedup hints */
2436 /* note that exceeding the hardcoded limit is not a correctness issue, */
2437 /* but an efficiency issue only */
2119 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) 2438 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2120 { 2439 {
2121 char path [4096]; 2440 char path [4096];
2122 strcpy (path, w->path); 2441 strcpy (path, w->path);
2123 2442
2249 } 2568 }
2250 2569
2251 } 2570 }
2252} 2571}
2253 2572
2573#endif
2574
2575#ifdef _WIN32
2576# define EV_LSTAT(p,b) _stati64 (p, b)
2577#else
2578# define EV_LSTAT(p,b) lstat (p, b)
2254#endif 2579#endif
2255 2580
2256void 2581void
2257ev_stat_stat (EV_P_ ev_stat *w) 2582ev_stat_stat (EV_P_ ev_stat *w)
2258{ 2583{
2322 else 2647 else
2323#endif 2648#endif
2324 ev_timer_start (EV_A_ &w->timer); 2649 ev_timer_start (EV_A_ &w->timer);
2325 2650
2326 ev_start (EV_A_ (W)w, 1); 2651 ev_start (EV_A_ (W)w, 1);
2652
2653 EV_FREQUENT_CHECK;
2327} 2654}
2328 2655
2329void 2656void
2330ev_stat_stop (EV_P_ ev_stat *w) 2657ev_stat_stop (EV_P_ ev_stat *w)
2331{ 2658{
2332 clear_pending (EV_A_ (W)w); 2659 clear_pending (EV_A_ (W)w);
2333 if (expect_false (!ev_is_active (w))) 2660 if (expect_false (!ev_is_active (w)))
2334 return; 2661 return;
2335 2662
2663 EV_FREQUENT_CHECK;
2664
2336#if EV_USE_INOTIFY 2665#if EV_USE_INOTIFY
2337 infy_del (EV_A_ w); 2666 infy_del (EV_A_ w);
2338#endif 2667#endif
2339 ev_timer_stop (EV_A_ &w->timer); 2668 ev_timer_stop (EV_A_ &w->timer);
2340 2669
2341 ev_stop (EV_A_ (W)w); 2670 ev_stop (EV_A_ (W)w);
2671
2672 EV_FREQUENT_CHECK;
2342} 2673}
2343#endif 2674#endif
2344 2675
2345#if EV_IDLE_ENABLE 2676#if EV_IDLE_ENABLE
2346void 2677void
2348{ 2679{
2349 if (expect_false (ev_is_active (w))) 2680 if (expect_false (ev_is_active (w)))
2350 return; 2681 return;
2351 2682
2352 pri_adjust (EV_A_ (W)w); 2683 pri_adjust (EV_A_ (W)w);
2684
2685 EV_FREQUENT_CHECK;
2353 2686
2354 { 2687 {
2355 int active = ++idlecnt [ABSPRI (w)]; 2688 int active = ++idlecnt [ABSPRI (w)];
2356 2689
2357 ++idleall; 2690 ++idleall;
2358 ev_start (EV_A_ (W)w, active); 2691 ev_start (EV_A_ (W)w, active);
2359 2692
2360 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2693 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2361 idles [ABSPRI (w)][active - 1] = w; 2694 idles [ABSPRI (w)][active - 1] = w;
2362 } 2695 }
2696
2697 EV_FREQUENT_CHECK;
2363} 2698}
2364 2699
2365void 2700void
2366ev_idle_stop (EV_P_ ev_idle *w) 2701ev_idle_stop (EV_P_ ev_idle *w)
2367{ 2702{
2368 clear_pending (EV_A_ (W)w); 2703 clear_pending (EV_A_ (W)w);
2369 if (expect_false (!ev_is_active (w))) 2704 if (expect_false (!ev_is_active (w)))
2370 return; 2705 return;
2371 2706
2707 EV_FREQUENT_CHECK;
2708
2372 { 2709 {
2373 int active = ((W)w)->active; 2710 int active = ev_active (w);
2374 2711
2375 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2712 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2376 ((W)idles [ABSPRI (w)][active - 1])->active = active; 2713 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2377 2714
2378 ev_stop (EV_A_ (W)w); 2715 ev_stop (EV_A_ (W)w);
2379 --idleall; 2716 --idleall;
2380 } 2717 }
2718
2719 EV_FREQUENT_CHECK;
2381} 2720}
2382#endif 2721#endif
2383 2722
2384void 2723void
2385ev_prepare_start (EV_P_ ev_prepare *w) 2724ev_prepare_start (EV_P_ ev_prepare *w)
2386{ 2725{
2387 if (expect_false (ev_is_active (w))) 2726 if (expect_false (ev_is_active (w)))
2388 return; 2727 return;
2728
2729 EV_FREQUENT_CHECK;
2389 2730
2390 ev_start (EV_A_ (W)w, ++preparecnt); 2731 ev_start (EV_A_ (W)w, ++preparecnt);
2391 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2732 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2392 prepares [preparecnt - 1] = w; 2733 prepares [preparecnt - 1] = w;
2734
2735 EV_FREQUENT_CHECK;
2393} 2736}
2394 2737
2395void 2738void
2396ev_prepare_stop (EV_P_ ev_prepare *w) 2739ev_prepare_stop (EV_P_ ev_prepare *w)
2397{ 2740{
2398 clear_pending (EV_A_ (W)w); 2741 clear_pending (EV_A_ (W)w);
2399 if (expect_false (!ev_is_active (w))) 2742 if (expect_false (!ev_is_active (w)))
2400 return; 2743 return;
2401 2744
2745 EV_FREQUENT_CHECK;
2746
2402 { 2747 {
2403 int active = ((W)w)->active; 2748 int active = ev_active (w);
2749
2404 prepares [active - 1] = prepares [--preparecnt]; 2750 prepares [active - 1] = prepares [--preparecnt];
2405 ((W)prepares [active - 1])->active = active; 2751 ev_active (prepares [active - 1]) = active;
2406 } 2752 }
2407 2753
2408 ev_stop (EV_A_ (W)w); 2754 ev_stop (EV_A_ (W)w);
2755
2756 EV_FREQUENT_CHECK;
2409} 2757}
2410 2758
2411void 2759void
2412ev_check_start (EV_P_ ev_check *w) 2760ev_check_start (EV_P_ ev_check *w)
2413{ 2761{
2414 if (expect_false (ev_is_active (w))) 2762 if (expect_false (ev_is_active (w)))
2415 return; 2763 return;
2764
2765 EV_FREQUENT_CHECK;
2416 2766
2417 ev_start (EV_A_ (W)w, ++checkcnt); 2767 ev_start (EV_A_ (W)w, ++checkcnt);
2418 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2768 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2419 checks [checkcnt - 1] = w; 2769 checks [checkcnt - 1] = w;
2770
2771 EV_FREQUENT_CHECK;
2420} 2772}
2421 2773
2422void 2774void
2423ev_check_stop (EV_P_ ev_check *w) 2775ev_check_stop (EV_P_ ev_check *w)
2424{ 2776{
2425 clear_pending (EV_A_ (W)w); 2777 clear_pending (EV_A_ (W)w);
2426 if (expect_false (!ev_is_active (w))) 2778 if (expect_false (!ev_is_active (w)))
2427 return; 2779 return;
2428 2780
2781 EV_FREQUENT_CHECK;
2782
2429 { 2783 {
2430 int active = ((W)w)->active; 2784 int active = ev_active (w);
2785
2431 checks [active - 1] = checks [--checkcnt]; 2786 checks [active - 1] = checks [--checkcnt];
2432 ((W)checks [active - 1])->active = active; 2787 ev_active (checks [active - 1]) = active;
2433 } 2788 }
2434 2789
2435 ev_stop (EV_A_ (W)w); 2790 ev_stop (EV_A_ (W)w);
2791
2792 EV_FREQUENT_CHECK;
2436} 2793}
2437 2794
2438#if EV_EMBED_ENABLE 2795#if EV_EMBED_ENABLE
2439void noinline 2796void noinline
2440ev_embed_sweep (EV_P_ ev_embed *w) 2797ev_embed_sweep (EV_P_ ev_embed *w)
2487 struct ev_loop *loop = w->other; 2844 struct ev_loop *loop = w->other;
2488 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2845 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2489 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); 2846 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2490 } 2847 }
2491 2848
2849 EV_FREQUENT_CHECK;
2850
2492 ev_set_priority (&w->io, ev_priority (w)); 2851 ev_set_priority (&w->io, ev_priority (w));
2493 ev_io_start (EV_A_ &w->io); 2852 ev_io_start (EV_A_ &w->io);
2494 2853
2495 ev_prepare_init (&w->prepare, embed_prepare_cb); 2854 ev_prepare_init (&w->prepare, embed_prepare_cb);
2496 ev_set_priority (&w->prepare, EV_MINPRI); 2855 ev_set_priority (&w->prepare, EV_MINPRI);
2497 ev_prepare_start (EV_A_ &w->prepare); 2856 ev_prepare_start (EV_A_ &w->prepare);
2498 2857
2499 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2858 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2500 2859
2501 ev_start (EV_A_ (W)w, 1); 2860 ev_start (EV_A_ (W)w, 1);
2861
2862 EV_FREQUENT_CHECK;
2502} 2863}
2503 2864
2504void 2865void
2505ev_embed_stop (EV_P_ ev_embed *w) 2866ev_embed_stop (EV_P_ ev_embed *w)
2506{ 2867{
2507 clear_pending (EV_A_ (W)w); 2868 clear_pending (EV_A_ (W)w);
2508 if (expect_false (!ev_is_active (w))) 2869 if (expect_false (!ev_is_active (w)))
2509 return; 2870 return;
2510 2871
2872 EV_FREQUENT_CHECK;
2873
2511 ev_io_stop (EV_A_ &w->io); 2874 ev_io_stop (EV_A_ &w->io);
2512 ev_prepare_stop (EV_A_ &w->prepare); 2875 ev_prepare_stop (EV_A_ &w->prepare);
2513 2876
2514 ev_stop (EV_A_ (W)w); 2877 ev_stop (EV_A_ (W)w);
2878
2879 EV_FREQUENT_CHECK;
2515} 2880}
2516#endif 2881#endif
2517 2882
2518#if EV_FORK_ENABLE 2883#if EV_FORK_ENABLE
2519void 2884void
2520ev_fork_start (EV_P_ ev_fork *w) 2885ev_fork_start (EV_P_ ev_fork *w)
2521{ 2886{
2522 if (expect_false (ev_is_active (w))) 2887 if (expect_false (ev_is_active (w)))
2523 return; 2888 return;
2889
2890 EV_FREQUENT_CHECK;
2524 2891
2525 ev_start (EV_A_ (W)w, ++forkcnt); 2892 ev_start (EV_A_ (W)w, ++forkcnt);
2526 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2893 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2527 forks [forkcnt - 1] = w; 2894 forks [forkcnt - 1] = w;
2895
2896 EV_FREQUENT_CHECK;
2528} 2897}
2529 2898
2530void 2899void
2531ev_fork_stop (EV_P_ ev_fork *w) 2900ev_fork_stop (EV_P_ ev_fork *w)
2532{ 2901{
2533 clear_pending (EV_A_ (W)w); 2902 clear_pending (EV_A_ (W)w);
2534 if (expect_false (!ev_is_active (w))) 2903 if (expect_false (!ev_is_active (w)))
2535 return; 2904 return;
2536 2905
2906 EV_FREQUENT_CHECK;
2907
2537 { 2908 {
2538 int active = ((W)w)->active; 2909 int active = ev_active (w);
2910
2539 forks [active - 1] = forks [--forkcnt]; 2911 forks [active - 1] = forks [--forkcnt];
2540 ((W)forks [active - 1])->active = active; 2912 ev_active (forks [active - 1]) = active;
2541 } 2913 }
2542 2914
2543 ev_stop (EV_A_ (W)w); 2915 ev_stop (EV_A_ (W)w);
2916
2917 EV_FREQUENT_CHECK;
2544} 2918}
2545#endif 2919#endif
2546 2920
2547#if EV_ASYNC_ENABLE 2921#if EV_ASYNC_ENABLE
2548void 2922void
2550{ 2924{
2551 if (expect_false (ev_is_active (w))) 2925 if (expect_false (ev_is_active (w)))
2552 return; 2926 return;
2553 2927
2554 evpipe_init (EV_A); 2928 evpipe_init (EV_A);
2929
2930 EV_FREQUENT_CHECK;
2555 2931
2556 ev_start (EV_A_ (W)w, ++asynccnt); 2932 ev_start (EV_A_ (W)w, ++asynccnt);
2557 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2933 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2558 asyncs [asynccnt - 1] = w; 2934 asyncs [asynccnt - 1] = w;
2935
2936 EV_FREQUENT_CHECK;
2559} 2937}
2560 2938
2561void 2939void
2562ev_async_stop (EV_P_ ev_async *w) 2940ev_async_stop (EV_P_ ev_async *w)
2563{ 2941{
2564 clear_pending (EV_A_ (W)w); 2942 clear_pending (EV_A_ (W)w);
2565 if (expect_false (!ev_is_active (w))) 2943 if (expect_false (!ev_is_active (w)))
2566 return; 2944 return;
2567 2945
2946 EV_FREQUENT_CHECK;
2947
2568 { 2948 {
2569 int active = ((W)w)->active; 2949 int active = ev_active (w);
2950
2570 asyncs [active - 1] = asyncs [--asynccnt]; 2951 asyncs [active - 1] = asyncs [--asynccnt];
2571 ((W)asyncs [active - 1])->active = active; 2952 ev_active (asyncs [active - 1]) = active;
2572 } 2953 }
2573 2954
2574 ev_stop (EV_A_ (W)w); 2955 ev_stop (EV_A_ (W)w);
2956
2957 EV_FREQUENT_CHECK;
2575} 2958}
2576 2959
2577void 2960void
2578ev_async_send (EV_P_ ev_async *w) 2961ev_async_send (EV_P_ ev_async *w)
2579{ 2962{

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines