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

Comparing libev/ev.c (file contents):
Revision 1.222 by root, Sun Apr 6 12:45:58 2008 UTC vs.
Revision 1.249 by root, Wed May 21 23:30:52 2008 UTC

… …
235# else 235# else
236# define EV_USE_EVENTFD 0 236# define EV_USE_EVENTFD 0
237# endif 237# endif
238#endif 238#endif
239 239
240#if 0 /* debugging */
241# define EV_VERIFY 1
242# define EV_USE_4HEAP 1
243# define EV_HEAP_CACHE_AT 1
244#endif
245
246#ifndef EV_USE_4HEAP
247# define EV_USE_4HEAP !EV_MINIMAL
248#endif
249
250#ifndef EV_HEAP_CACHE_AT
251# define EV_HEAP_CACHE_AT !EV_MINIMAL
252#endif
253
240/* this block fixes any misconfiguration where we know we run into trouble otherwise */ 254/* this block fixes any misconfiguration where we know we run into trouble otherwise */
241 255
242#ifndef CLOCK_MONOTONIC 256#ifndef CLOCK_MONOTONIC
243# undef EV_USE_MONOTONIC 257# undef EV_USE_MONOTONIC
244# define EV_USE_MONOTONIC 0 258# define EV_USE_MONOTONIC 0
… …
279} 293}
280# endif 294# endif
281#endif 295#endif
282 296
283/**/ 297/**/
298
299/* EV_VERIFY: enable internal consistency checks
300 * undefined or zero: no verification done or available
301 * 1 or higher: ev_loop_verify function available
302 * 2 or higher: ev_loop_verify is called frequently
303 */
304#if EV_VERIFY >= 1
305# define EV_FREQUENT_CHECK ev_loop_verify (EV_A)
306#else
307# define EV_FREQUENT_CHECK do { } while (0)
308#endif
284 309
285/* 310/*
286 * This is used to avoid floating point rounding problems. 311 * This is used to avoid floating point rounding problems.
287 * It is added to ev_rt_now when scheduling periodics 312 * It is added to ev_rt_now when scheduling periodics
288 * to ensure progress, time-wise, even when rounding 313 * to ensure progress, time-wise, even when rounding
… …
300# define expect(expr,value) __builtin_expect ((expr),(value)) 325# define expect(expr,value) __builtin_expect ((expr),(value))
301# define noinline __attribute__ ((noinline)) 326# define noinline __attribute__ ((noinline))
302#else 327#else
303# define expect(expr,value) (expr) 328# define expect(expr,value) (expr)
304# define noinline 329# define noinline
305# if __STDC_VERSION__ < 199901L 330# if __STDC_VERSION__ < 199901L && __GNUC__ < 2
306# define inline 331# define inline
307# endif 332# endif
308#endif 333#endif
309 334
310#define expect_false(expr) expect ((expr) != 0, 0) 335#define expect_false(expr) expect ((expr) != 0, 0)
… …
325 350
326typedef ev_watcher *W; 351typedef ev_watcher *W;
327typedef ev_watcher_list *WL; 352typedef ev_watcher_list *WL;
328typedef ev_watcher_time *WT; 353typedef ev_watcher_time *WT;
329 354
355#define ev_active(w) ((W)(w))->active
356#define ev_at(w) ((WT)(w))->at
357
330#if EV_USE_MONOTONIC 358#if EV_USE_MONOTONIC
331/* sig_atomic_t is used to avoid per-thread variables or locking but still */ 359/* sig_atomic_t is used to avoid per-thread variables or locking but still */
332/* giving it a reasonably high chance of working on typical architetcures */ 360/* giving it a reasonably high chance of working on typical architetcures */
333static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ 361static EV_ATOMIC_T have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */
334#endif 362#endif
… …
360 perror (msg); 388 perror (msg);
361 abort (); 389 abort ();
362 } 390 }
363} 391}
364 392
393static void *
394ev_realloc_emul (void *ptr, long size)
395{
396 /* some systems, notably openbsd and darwin, fail to properly
397 * implement realloc (x, 0) (as required by both ansi c-98 and
398 * the single unix specification, so work around them here.
399 */
400
401 if (size)
402 return realloc (ptr, size);
403
404 free (ptr);
405 return 0;
406}
407
365static void *(*alloc)(void *ptr, long size); 408static void *(*alloc)(void *ptr, long size) = ev_realloc_emul;
366 409
367void 410void
368ev_set_allocator (void *(*cb)(void *ptr, long size)) 411ev_set_allocator (void *(*cb)(void *ptr, long size))
369{ 412{
370 alloc = cb; 413 alloc = cb;
371} 414}
372 415
373inline_speed void * 416inline_speed void *
374ev_realloc (void *ptr, long size) 417ev_realloc (void *ptr, long size)
375{ 418{
376 ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); 419 ptr = alloc (ptr, size);
377 420
378 if (!ptr && size) 421 if (!ptr && size)
379 { 422 {
380 fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); 423 fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size);
381 abort (); 424 abort ();
… …
404 W w; 447 W w;
405 int events; 448 int events;
406} ANPENDING; 449} ANPENDING;
407 450
408#if EV_USE_INOTIFY 451#if EV_USE_INOTIFY
452/* hash table entry per inotify-id */
409typedef struct 453typedef struct
410{ 454{
411 WL head; 455 WL head;
412} ANFS; 456} ANFS;
457#endif
458
459/* Heap Entry */
460#if EV_HEAP_CACHE_AT
461 typedef struct {
462 ev_tstamp at;
463 WT w;
464 } ANHE;
465
466 #define ANHE_w(he) (he).w /* access watcher, read-write */
467 #define ANHE_at(he) (he).at /* access cached at, read-only */
468 #define ANHE_at_cache(he) (he).at = (he).w->at /* update at from watcher */
469#else
470 typedef WT ANHE;
471
472 #define ANHE_w(he) (he)
473 #define ANHE_at(he) (he)->at
474 #define ANHE_at_cache(he)
413#endif 475#endif
414 476
415#if EV_MULTIPLICITY 477#if EV_MULTIPLICITY
416 478
417 struct ev_loop 479 struct ev_loop
… …
502 } 564 }
503} 565}
504 566
505/*****************************************************************************/ 567/*****************************************************************************/
506 568
569#define MALLOC_ROUND 4096 /* prefer to allocate in chunks of this size, must be 2**n and >> 4 longs */
570
507int inline_size 571int inline_size
508array_nextsize (int elem, int cur, int cnt) 572array_nextsize (int elem, int cur, int cnt)
509{ 573{
510 int ncur = cur + 1; 574 int ncur = cur + 1;
511 575
512 do 576 do
513 ncur <<= 1; 577 ncur <<= 1;
514 while (cnt > ncur); 578 while (cnt > ncur);
515 579
516 /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ 580 /* if size is large, round to MALLOC_ROUND - 4 * longs to accomodate malloc overhead */
517 if (elem * ncur > 4096) 581 if (elem * ncur > MALLOC_ROUND - sizeof (void *) * 4)
518 { 582 {
519 ncur *= elem; 583 ncur *= elem;
520 ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; 584 ncur = (ncur + elem + (MALLOC_ROUND - 1) + sizeof (void *) * 4) & ~(MALLOC_ROUND - 1);
521 ncur = ncur - sizeof (void *) * 4; 585 ncur = ncur - sizeof (void *) * 4;
522 ncur /= elem; 586 ncur /= elem;
523 } 587 }
524 588
525 return ncur; 589 return ncur;
… …
739 } 803 }
740} 804}
741 805
742/*****************************************************************************/ 806/*****************************************************************************/
743 807
808/*
809 * the heap functions want a real array index. array index 0 uis guaranteed to not
810 * be in-use at any time. the first heap entry is at array [HEAP0]. DHEAP gives
811 * the branching factor of the d-tree.
812 */
813
814/*
815 * at the moment we allow libev the luxury of two heaps,
816 * a small-code-size 2-heap one and a ~1.5kb larger 4-heap
817 * which is more cache-efficient.
818 * the difference is about 5% with 50000+ watchers.
819 */
820#if EV_USE_4HEAP
821
822#define DHEAP 4
823#define HEAP0 (DHEAP - 1) /* index of first element in heap */
824#define HPARENT(k) ((((k) - HEAP0 - 1) / DHEAP) + HEAP0)
825#define UPHEAP_DONE(p,k) ((p) == (k))
826
827/* away from the root */
744void inline_speed 828void inline_speed
745upheap (WT *heap, int k) 829downheap (ANHE *heap, int N, int k)
746{ 830{
747 WT w = heap [k]; 831 ANHE he = heap [k];
832 ANHE *E = heap + N + HEAP0;
748 833
749 while (k) 834 for (;;)
750 { 835 {
751 int p = (k - 1) >> 1; 836 ev_tstamp minat;
837 ANHE *minpos;
838 ANHE *pos = heap + DHEAP * (k - HEAP0) + HEAP0 + 1;
752 839
753 if (heap [p]->at <= w->at) 840 /* find minimum child */
841 if (expect_true (pos + DHEAP - 1 < E))
842 {
843 /* fast path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
844 if ( ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
845 if ( ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
846 if ( ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
847 }
848 else if (pos < E)
849 {
850 /* slow path */ (minpos = pos + 0), (minat = ANHE_at (*minpos));
851 if (pos + 1 < E && ANHE_at (pos [1]) < minat) (minpos = pos + 1), (minat = ANHE_at (*minpos));
852 if (pos + 2 < E && ANHE_at (pos [2]) < minat) (minpos = pos + 2), (minat = ANHE_at (*minpos));
853 if (pos + 3 < E && ANHE_at (pos [3]) < minat) (minpos = pos + 3), (minat = ANHE_at (*minpos));
854 }
855 else
754 break; 856 break;
755 857
858 if (ANHE_at (he) <= minat)
859 break;
860
861 heap [k] = *minpos;
862 ev_active (ANHE_w (*minpos)) = k;
863
864 k = minpos - heap;
865 }
866
867 heap [k] = he;
868 ev_active (ANHE_w (he)) = k;
869}
870
871#else /* 4HEAP */
872
873#define HEAP0 1
874#define HPARENT(k) ((k) >> 1)
875#define UPHEAP_DONE(p,k) (!(p))
876
877/* away from the root */
878void inline_speed
879downheap (ANHE *heap, int N, int k)
880{
881 ANHE he = heap [k];
882
883 for (;;)
884 {
885 int c = k << 1;
886
887 if (c > N + HEAP0 - 1)
888 break;
889
890 c += c + 1 < N + HEAP0 && ANHE_at (heap [c]) > ANHE_at (heap [c + 1])
891 ? 1 : 0;
892
893 if (ANHE_at (he) <= ANHE_at (heap [c]))
894 break;
895
896 heap [k] = heap [c];
897 ev_active (ANHE_w (heap [k])) = k;
898
899 k = c;
900 }
901
902 heap [k] = he;
903 ev_active (ANHE_w (he)) = k;
904}
905#endif
906
907/* towards the root */
908void inline_speed
909upheap (ANHE *heap, int k)
910{
911 ANHE he = heap [k];
912
913 for (;;)
914 {
915 int p = HPARENT (k);
916
917 if (UPHEAP_DONE (p, k) || ANHE_at (heap [p]) <= ANHE_at (he))
918 break;
919
756 heap [k] = heap [p]; 920 heap [k] = heap [p];
757 ((W)heap [k])->active = k + 1; 921 ev_active (ANHE_w (heap [k])) = k;
758 k = p; 922 k = p;
759 } 923 }
760 924
761 heap [k] = w; 925 heap [k] = he;
762 ((W)heap [k])->active = k + 1; 926 ev_active (ANHE_w (he)) = k;
763}
764
765void inline_speed
766downheap (WT *heap, int N, int k)
767{
768 WT w = heap [k];
769
770 for (;;)
771 {
772 int c = (k << 1) + 1;
773
774 if (c >= N)
775 break;
776
777 c += c + 1 < N && heap [c]->at > heap [c + 1]->at
778 ? 1 : 0;
779
780 if (w->at <= heap [c]->at)
781 break;
782
783 heap [k] = heap [c];
784 ((W)heap [k])->active = k + 1;
785
786 k = c;
787 }
788
789 heap [k] = w;
790 ((W)heap [k])->active = k + 1;
791} 927}
792 928
793void inline_size 929void inline_size
794adjustheap (WT *heap, int N, int k) 930adjustheap (ANHE *heap, int N, int k)
795{ 931{
932 if (k > HEAP0 && ANHE_at (heap [HPARENT (k)]) >= ANHE_at (heap [k]))
796 upheap (heap, k); 933 upheap (heap, k);
934 else
797 downheap (heap, N, k); 935 downheap (heap, N, k);
798} 936}
937
938/* rebuild the heap: this function is used only once and executed rarely */
939void inline_size
940reheap (ANHE *heap, int N)
941{
942 int i;
943 /* we don't use floyds algorithm, upheap is simpler and is more cache-efficient */
944 /* also, this is easy to implement and correct for both 2-heaps and 4-heaps */
945 for (i = 0; i < N; ++i)
946 upheap (heap, i + HEAP0);
947}
948
949#if EV_VERIFY
950static void
951checkheap (ANHE *heap, int N)
952{
953 int i;
954
955 for (i = HEAP0; i < N + HEAP0; ++i)
956 {
957 assert (("active index mismatch in heap", ev_active (ANHE_w (heap [i])) == i));
958 assert (("heap condition violated", i == HEAP0 || ANHE_at (heap [HPARENT (i)]) <= ANHE_at (heap [i])));
959 assert (("heap at cache mismatch", ANHE_at (heap [i]) == ev_at (ANHE_w (heap [i]))));
960 }
961}
962#endif
799 963
800/*****************************************************************************/ 964/*****************************************************************************/
801 965
802typedef struct 966typedef struct
803{ 967{
… …
891pipecb (EV_P_ ev_io *iow, int revents) 1055pipecb (EV_P_ ev_io *iow, int revents)
892{ 1056{
893#if EV_USE_EVENTFD 1057#if EV_USE_EVENTFD
894 if (evfd >= 0) 1058 if (evfd >= 0)
895 { 1059 {
896 uint64_t counter = 1; 1060 uint64_t counter;
897 read (evfd, &counter, sizeof (uint64_t)); 1061 read (evfd, &counter, sizeof (uint64_t));
898 } 1062 }
899 else 1063 else
900#endif 1064#endif
901 { 1065 {
… …
1170 if (!(flags & EVFLAG_NOENV) 1334 if (!(flags & EVFLAG_NOENV)
1171 && !enable_secure () 1335 && !enable_secure ()
1172 && getenv ("LIBEV_FLAGS")) 1336 && getenv ("LIBEV_FLAGS"))
1173 flags = atoi (getenv ("LIBEV_FLAGS")); 1337 flags = atoi (getenv ("LIBEV_FLAGS"));
1174 1338
1175 if (!(flags & 0x0000ffffUL)) 1339 if (!(flags & 0x0000ffffU))
1176 flags |= ev_recommended_backends (); 1340 flags |= ev_recommended_backends ();
1177 1341
1178#if EV_USE_PORT 1342#if EV_USE_PORT
1179 if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags); 1343 if (!backend && (flags & EVBACKEND_PORT )) backend = port_init (EV_A_ flags);
1180#endif 1344#endif
… …
1268#endif 1432#endif
1269 1433
1270 backend = 0; 1434 backend = 0;
1271} 1435}
1272 1436
1437#if EV_USE_INOTIFY
1273void inline_size infy_fork (EV_P); 1438void inline_size infy_fork (EV_P);
1439#endif
1274 1440
1275void inline_size 1441void inline_size
1276loop_fork (EV_P) 1442loop_fork (EV_P)
1277{ 1443{
1278#if EV_USE_PORT 1444#if EV_USE_PORT
… …
1345void 1511void
1346ev_loop_fork (EV_P) 1512ev_loop_fork (EV_P)
1347{ 1513{
1348 postfork = 1; /* must be in line with ev_default_fork */ 1514 postfork = 1; /* must be in line with ev_default_fork */
1349} 1515}
1516
1517#if EV_VERIFY
1518static void
1519array_check (W **ws, int cnt)
1520{
1521 while (cnt--)
1522 assert (("active index mismatch", ev_active (ws [cnt]) == cnt + 1));
1523}
1524
1525static void
1526ev_loop_verify (EV_P)
1527{
1528 int i;
1529
1530 checkheap (timers, timercnt);
1531#if EV_PERIODIC_ENABLE
1532 checkheap (periodics, periodiccnt);
1533#endif
1534
1535#if EV_IDLE_ENABLE
1536 for (i = NUMPRI; i--; )
1537 array_check ((W **)idles [i], idlecnt [i]);
1538#endif
1539#if EV_FORK_ENABLE
1540 array_check ((W **)forks, forkcnt);
1541#endif
1542 array_check ((W **)prepares, preparecnt);
1543 array_check ((W **)checks, checkcnt);
1544#if EV_ASYNC_ENABLE
1545 array_check ((W **)asyncs, asynccnt);
1546#endif
1547}
1548#endif
1350 1549
1351#endif 1550#endif
1352 1551
1353#if EV_MULTIPLICITY 1552#if EV_MULTIPLICITY
1354struct ev_loop * 1553struct ev_loop *
… …
1421void inline_speed 1620void inline_speed
1422call_pending (EV_P) 1621call_pending (EV_P)
1423{ 1622{
1424 int pri; 1623 int pri;
1425 1624
1625 EV_FREQUENT_CHECK;
1626
1426 for (pri = NUMPRI; pri--; ) 1627 for (pri = NUMPRI; pri--; )
1427 while (pendingcnt [pri]) 1628 while (pendingcnt [pri])
1428 { 1629 {
1429 ANPENDING *p = pendings [pri] + --pendingcnt [pri]; 1630 ANPENDING *p = pendings [pri] + --pendingcnt [pri];
1430 1631
… …
1434 1635
1435 p->w->pending = 0; 1636 p->w->pending = 0;
1436 EV_CB_INVOKE (p->w, p->events); 1637 EV_CB_INVOKE (p->w, p->events);
1437 } 1638 }
1438 } 1639 }
1439}
1440 1640
1441void inline_size 1641 EV_FREQUENT_CHECK;
1442timers_reify (EV_P)
1443{
1444 while (timercnt && ((WT)timers [0])->at <= mn_now)
1445 {
1446 ev_timer *w = (ev_timer *)timers [0];
1447
1448 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1449
1450 /* first reschedule or stop timer */
1451 if (w->repeat)
1452 {
1453 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1454
1455 ((WT)w)->at += w->repeat;
1456 if (((WT)w)->at < mn_now)
1457 ((WT)w)->at = mn_now;
1458
1459 downheap (timers, timercnt, 0);
1460 }
1461 else
1462 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1463
1464 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1465 }
1466} 1642}
1467
1468#if EV_PERIODIC_ENABLE
1469void inline_size
1470periodics_reify (EV_P)
1471{
1472 while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now)
1473 {
1474 ev_periodic *w = (ev_periodic *)periodics [0];
1475
1476 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1477
1478 /* first reschedule or stop timer */
1479 if (w->reschedule_cb)
1480 {
1481 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON);
1482 assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now));
1483 downheap (periodics, periodiccnt, 0);
1484 }
1485 else if (w->interval)
1486 {
1487 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1488 if (((WT)w)->at - ev_rt_now <= TIME_EPSILON) ((WT)w)->at += w->interval;
1489 assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now));
1490 downheap (periodics, periodiccnt, 0);
1491 }
1492 else
1493 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1494
1495 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1496 }
1497}
1498
1499static void noinline
1500periodics_reschedule (EV_P)
1501{
1502 int i;
1503
1504 /* adjust periodics after time jump */
1505 for (i = 0; i < periodiccnt; ++i)
1506 {
1507 ev_periodic *w = (ev_periodic *)periodics [i];
1508
1509 if (w->reschedule_cb)
1510 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now);
1511 else if (w->interval)
1512 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1513 }
1514
1515 /* now rebuild the heap */
1516 for (i = periodiccnt >> 1; i--; )
1517 downheap (periodics, periodiccnt, i);
1518}
1519#endif
1520 1643
1521#if EV_IDLE_ENABLE 1644#if EV_IDLE_ENABLE
1522void inline_size 1645void inline_size
1523idle_reify (EV_P) 1646idle_reify (EV_P)
1524{ 1647{
… …
1536 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); 1659 queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE);
1537 break; 1660 break;
1538 } 1661 }
1539 } 1662 }
1540 } 1663 }
1664}
1665#endif
1666
1667void inline_size
1668timers_reify (EV_P)
1669{
1670 EV_FREQUENT_CHECK;
1671
1672 while (timercnt && ANHE_at (timers [HEAP0]) < mn_now)
1673 {
1674 ev_timer *w = (ev_timer *)ANHE_w (timers [HEAP0]);
1675
1676 /*assert (("inactive timer on timer heap detected", ev_is_active (w)));*/
1677
1678 /* first reschedule or stop timer */
1679 if (w->repeat)
1680 {
1681 ev_at (w) += w->repeat;
1682 if (ev_at (w) < mn_now)
1683 ev_at (w) = mn_now;
1684
1685 assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.));
1686
1687 ANHE_at_cache (timers [HEAP0]);
1688 downheap (timers, timercnt, HEAP0);
1689 }
1690 else
1691 ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */
1692
1693 EV_FREQUENT_CHECK;
1694 ev_feed_event (EV_A_ (W)w, EV_TIMEOUT);
1695 }
1696}
1697
1698#if EV_PERIODIC_ENABLE
1699void inline_size
1700periodics_reify (EV_P)
1701{
1702 EV_FREQUENT_CHECK;
1703 while (periodiccnt && ANHE_at (periodics [HEAP0]) < ev_rt_now)
1704 {
1705 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [HEAP0]);
1706
1707 /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/
1708
1709 /* first reschedule or stop timer */
1710 if (w->reschedule_cb)
1711 {
1712 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1713
1714 assert (("ev_periodic reschedule callback returned time in the past", ev_at (w) >= ev_rt_now));
1715
1716 ANHE_at_cache (periodics [HEAP0]);
1717 downheap (periodics, periodiccnt, HEAP0);
1718 EV_FREQUENT_CHECK;
1719 }
1720 else if (w->interval)
1721 {
1722 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1723 /* if next trigger time is not sufficiently in the future, put it there */
1724 /* this might happen because of floating point inexactness */
1725 if (ev_at (w) - ev_rt_now < TIME_EPSILON)
1726 {
1727 ev_at (w) += w->interval;
1728
1729 /* if interval is unreasonably low we might still have a time in the past */
1730 /* so correct this. this will make the periodic very inexact, but the user */
1731 /* has effectively asked to get triggered more often than possible */
1732 if (ev_at (w) < ev_rt_now)
1733 ev_at (w) = ev_rt_now;
1734 }
1735
1736 ANHE_at_cache (periodics [HEAP0]);
1737 downheap (periodics, periodiccnt, HEAP0);
1738 }
1739 else
1740 ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */
1741
1742 EV_FREQUENT_CHECK;
1743 ev_feed_event (EV_A_ (W)w, EV_PERIODIC);
1744 }
1745}
1746
1747static void noinline
1748periodics_reschedule (EV_P)
1749{
1750 int i;
1751
1752 /* adjust periodics after time jump */
1753 for (i = HEAP0; i < periodiccnt + HEAP0; ++i)
1754 {
1755 ev_periodic *w = (ev_periodic *)ANHE_w (periodics [i]);
1756
1757 if (w->reschedule_cb)
1758 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1759 else if (w->interval)
1760 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1761
1762 ANHE_at_cache (periodics [i]);
1763 }
1764
1765 reheap (periodics, periodiccnt);
1541} 1766}
1542#endif 1767#endif
1543 1768
1544void inline_speed 1769void inline_speed
1545time_update (EV_P_ ev_tstamp max_block) 1770time_update (EV_P_ ev_tstamp max_block)
… …
1574 */ 1799 */
1575 for (i = 4; --i; ) 1800 for (i = 4; --i; )
1576 { 1801 {
1577 rtmn_diff = ev_rt_now - mn_now; 1802 rtmn_diff = ev_rt_now - mn_now;
1578 1803
1579 if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) 1804 if (expect_true (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP))
1580 return; /* all is well */ 1805 return; /* all is well */
1581 1806
1582 ev_rt_now = ev_time (); 1807 ev_rt_now = ev_time ();
1583 mn_now = get_clock (); 1808 mn_now = get_clock ();
1584 now_floor = mn_now; 1809 now_floor = mn_now;
… …
1600#if EV_PERIODIC_ENABLE 1825#if EV_PERIODIC_ENABLE
1601 periodics_reschedule (EV_A); 1826 periodics_reschedule (EV_A);
1602#endif 1827#endif
1603 /* adjust timers. this is easy, as the offset is the same for all of them */ 1828 /* adjust timers. this is easy, as the offset is the same for all of them */
1604 for (i = 0; i < timercnt; ++i) 1829 for (i = 0; i < timercnt; ++i)
1830 {
1831 ANHE *he = timers + i + HEAP0;
1605 ((WT)timers [i])->at += ev_rt_now - mn_now; 1832 ANHE_w (*he)->at += ev_rt_now - mn_now;
1833 ANHE_at_cache (*he);
1834 }
1606 } 1835 }
1607 1836
1608 mn_now = ev_rt_now; 1837 mn_now = ev_rt_now;
1609 } 1838 }
1610} 1839}
… …
1680 1909
1681 waittime = MAX_BLOCKTIME; 1910 waittime = MAX_BLOCKTIME;
1682 1911
1683 if (timercnt) 1912 if (timercnt)
1684 { 1913 {
1685 ev_tstamp to = ((WT)timers [0])->at - mn_now + backend_fudge; 1914 ev_tstamp to = ANHE_at (timers [HEAP0]) - mn_now + backend_fudge;
1686 if (waittime > to) waittime = to; 1915 if (waittime > to) waittime = to;
1687 } 1916 }
1688 1917
1689#if EV_PERIODIC_ENABLE 1918#if EV_PERIODIC_ENABLE
1690 if (periodiccnt) 1919 if (periodiccnt)
1691 { 1920 {
1692 ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + backend_fudge; 1921 ev_tstamp to = ANHE_at (periodics [HEAP0]) - ev_rt_now + backend_fudge;
1693 if (waittime > to) waittime = to; 1922 if (waittime > to) waittime = to;
1694 } 1923 }
1695#endif 1924#endif
1696 1925
1697 if (expect_false (waittime < timeout_blocktime)) 1926 if (expect_false (waittime < timeout_blocktime))
… …
1834 if (expect_false (ev_is_active (w))) 2063 if (expect_false (ev_is_active (w)))
1835 return; 2064 return;
1836 2065
1837 assert (("ev_io_start called with negative fd", fd >= 0)); 2066 assert (("ev_io_start called with negative fd", fd >= 0));
1838 2067
2068 EV_FREQUENT_CHECK;
2069
1839 ev_start (EV_A_ (W)w, 1); 2070 ev_start (EV_A_ (W)w, 1);
1840 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); 2071 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1841 wlist_add (&anfds[fd].head, (WL)w); 2072 wlist_add (&anfds[fd].head, (WL)w);
1842 2073
1843 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1); 2074 fd_change (EV_A_ fd, w->events & EV_IOFDSET | 1);
1844 w->events &= ~EV_IOFDSET; 2075 w->events &= ~EV_IOFDSET;
2076
2077 EV_FREQUENT_CHECK;
1845} 2078}
1846 2079
1847void noinline 2080void noinline
1848ev_io_stop (EV_P_ ev_io *w) 2081ev_io_stop (EV_P_ ev_io *w)
1849{ 2082{
1850 clear_pending (EV_A_ (W)w); 2083 clear_pending (EV_A_ (W)w);
1851 if (expect_false (!ev_is_active (w))) 2084 if (expect_false (!ev_is_active (w)))
1852 return; 2085 return;
1853 2086
1854 assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); 2087 assert (("ev_io_stop called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax));
2088
2089 EV_FREQUENT_CHECK;
1855 2090
1856 wlist_del (&anfds[w->fd].head, (WL)w); 2091 wlist_del (&anfds[w->fd].head, (WL)w);
1857 ev_stop (EV_A_ (W)w); 2092 ev_stop (EV_A_ (W)w);
1858 2093
1859 fd_change (EV_A_ w->fd, 1); 2094 fd_change (EV_A_ w->fd, 1);
2095
2096 EV_FREQUENT_CHECK;
1860} 2097}
1861 2098
1862void noinline 2099void noinline
1863ev_timer_start (EV_P_ ev_timer *w) 2100ev_timer_start (EV_P_ ev_timer *w)
1864{ 2101{
1865 if (expect_false (ev_is_active (w))) 2102 if (expect_false (ev_is_active (w)))
1866 return; 2103 return;
1867 2104
1868 ((WT)w)->at += mn_now; 2105 ev_at (w) += mn_now;
1869 2106
1870 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 2107 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1871 2108
2109 EV_FREQUENT_CHECK;
2110
2111 ++timercnt;
1872 ev_start (EV_A_ (W)w, ++timercnt); 2112 ev_start (EV_A_ (W)w, timercnt + HEAP0 - 1);
1873 array_needsize (WT, timers, timermax, timercnt, EMPTY2); 2113 array_needsize (ANHE, timers, timermax, ev_active (w) + 1, EMPTY2);
1874 timers [timercnt - 1] = (WT)w; 2114 ANHE_w (timers [ev_active (w)]) = (WT)w;
1875 upheap (timers, timercnt - 1); 2115 ANHE_at_cache (timers [ev_active (w)]);
2116 upheap (timers, ev_active (w));
1876 2117
2118 EV_FREQUENT_CHECK;
2119
1877 /*assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w));*/ 2120 /*assert (("internal timer heap corruption", timers [ev_active (w)] == (WT)w));*/
1878} 2121}
1879 2122
1880void noinline 2123void noinline
1881ev_timer_stop (EV_P_ ev_timer *w) 2124ev_timer_stop (EV_P_ ev_timer *w)
1882{ 2125{
1883 clear_pending (EV_A_ (W)w); 2126 clear_pending (EV_A_ (W)w);
1884 if (expect_false (!ev_is_active (w))) 2127 if (expect_false (!ev_is_active (w)))
1885 return; 2128 return;
1886 2129
1887 assert (("internal timer heap corruption", timers [((W)w)->active - 1] == (WT)w)); 2130 EV_FREQUENT_CHECK;
1888 2131
1889 { 2132 {
1890 int active = ((W)w)->active; 2133 int active = ev_active (w);
1891 2134
2135 assert (("internal timer heap corruption", ANHE_w (timers [active]) == (WT)w));
2136
2137 --timercnt;
2138
1892 if (expect_true (--active < --timercnt)) 2139 if (expect_true (active < timercnt + HEAP0))
1893 { 2140 {
1894 timers [active] = timers [timercnt]; 2141 timers [active] = timers [timercnt + HEAP0];
1895 adjustheap (timers, timercnt, active); 2142 adjustheap (timers, timercnt, active);
1896 } 2143 }
1897 } 2144 }
1898 2145
1899 ((WT)w)->at -= mn_now; 2146 EV_FREQUENT_CHECK;
2147
2148 ev_at (w) -= mn_now;
1900 2149
1901 ev_stop (EV_A_ (W)w); 2150 ev_stop (EV_A_ (W)w);
1902} 2151}
1903 2152
1904void noinline 2153void noinline
1905ev_timer_again (EV_P_ ev_timer *w) 2154ev_timer_again (EV_P_ ev_timer *w)
1906{ 2155{
2156 EV_FREQUENT_CHECK;
2157
1907 if (ev_is_active (w)) 2158 if (ev_is_active (w))
1908 { 2159 {
1909 if (w->repeat) 2160 if (w->repeat)
1910 { 2161 {
1911 ((WT)w)->at = mn_now + w->repeat; 2162 ev_at (w) = mn_now + w->repeat;
2163 ANHE_at_cache (timers [ev_active (w)]);
1912 adjustheap (timers, timercnt, ((W)w)->active - 1); 2164 adjustheap (timers, timercnt, ev_active (w));
1913 } 2165 }
1914 else 2166 else
1915 ev_timer_stop (EV_A_ w); 2167 ev_timer_stop (EV_A_ w);
1916 } 2168 }
1917 else if (w->repeat) 2169 else if (w->repeat)
1918 { 2170 {
1919 w->at = w->repeat; 2171 ev_at (w) = w->repeat;
1920 ev_timer_start (EV_A_ w); 2172 ev_timer_start (EV_A_ w);
1921 } 2173 }
2174
2175 EV_FREQUENT_CHECK;
1922} 2176}
1923 2177
1924#if EV_PERIODIC_ENABLE 2178#if EV_PERIODIC_ENABLE
1925void noinline 2179void noinline
1926ev_periodic_start (EV_P_ ev_periodic *w) 2180ev_periodic_start (EV_P_ ev_periodic *w)
1927{ 2181{
1928 if (expect_false (ev_is_active (w))) 2182 if (expect_false (ev_is_active (w)))
1929 return; 2183 return;
1930 2184
1931 if (w->reschedule_cb) 2185 if (w->reschedule_cb)
1932 ((WT)w)->at = w->reschedule_cb (w, ev_rt_now); 2186 ev_at (w) = w->reschedule_cb (w, ev_rt_now);
1933 else if (w->interval) 2187 else if (w->interval)
1934 { 2188 {
1935 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); 2189 assert (("ev_periodic_start called with negative interval value", w->interval >= 0.));
1936 /* this formula differs from the one in periodic_reify because we do not always round up */ 2190 /* this formula differs from the one in periodic_reify because we do not always round up */
1937 ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; 2191 ev_at (w) = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval;
1938 } 2192 }
1939 else 2193 else
1940 ((WT)w)->at = w->offset; 2194 ev_at (w) = w->offset;
1941 2195
2196 EV_FREQUENT_CHECK;
2197
2198 ++periodiccnt;
1942 ev_start (EV_A_ (W)w, ++periodiccnt); 2199 ev_start (EV_A_ (W)w, periodiccnt + HEAP0 - 1);
1943 array_needsize (WT, periodics, periodicmax, periodiccnt, EMPTY2); 2200 array_needsize (ANHE, periodics, periodicmax, ev_active (w) + 1, EMPTY2);
1944 periodics [periodiccnt - 1] = (WT)w; 2201 ANHE_w (periodics [ev_active (w)]) = (WT)w;
1945 upheap (periodics, periodiccnt - 1); 2202 ANHE_at_cache (periodics [ev_active (w)]);
2203 upheap (periodics, ev_active (w));
1946 2204
2205 EV_FREQUENT_CHECK;
2206
1947 /*assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));*/ 2207 /*assert (("internal periodic heap corruption", ANHE_w (periodics [ev_active (w)]) == (WT)w));*/
1948} 2208}
1949 2209
1950void noinline 2210void noinline
1951ev_periodic_stop (EV_P_ ev_periodic *w) 2211ev_periodic_stop (EV_P_ ev_periodic *w)
1952{ 2212{
1953 clear_pending (EV_A_ (W)w); 2213 clear_pending (EV_A_ (W)w);
1954 if (expect_false (!ev_is_active (w))) 2214 if (expect_false (!ev_is_active (w)))
1955 return; 2215 return;
1956 2216
1957 assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == (WT)w)); 2217 EV_FREQUENT_CHECK;
1958 2218
1959 { 2219 {
1960 int active = ((W)w)->active; 2220 int active = ev_active (w);
1961 2221
2222 assert (("internal periodic heap corruption", ANHE_w (periodics [active]) == (WT)w));
2223
2224 --periodiccnt;
2225
1962 if (expect_true (--active < --periodiccnt)) 2226 if (expect_true (active < periodiccnt + HEAP0))
1963 { 2227 {
1964 periodics [active] = periodics [periodiccnt]; 2228 periodics [active] = periodics [periodiccnt + HEAP0];
1965 adjustheap (periodics, periodiccnt, active); 2229 adjustheap (periodics, periodiccnt, active);
1966 } 2230 }
1967 } 2231 }
1968 2232
2233 EV_FREQUENT_CHECK;
2234
1969 ev_stop (EV_A_ (W)w); 2235 ev_stop (EV_A_ (W)w);
1970} 2236}
1971 2237
1972void noinline 2238void noinline
1973ev_periodic_again (EV_P_ ev_periodic *w) 2239ev_periodic_again (EV_P_ ev_periodic *w)
… …
1992 return; 2258 return;
1993 2259
1994 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 2260 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
1995 2261
1996 evpipe_init (EV_A); 2262 evpipe_init (EV_A);
2263
2264 EV_FREQUENT_CHECK;
1997 2265
1998 { 2266 {
1999#ifndef _WIN32 2267#ifndef _WIN32
2000 sigset_t full, prev; 2268 sigset_t full, prev;
2001 sigfillset (&full); 2269 sigfillset (&full);
… …
2022 sigfillset (&sa.sa_mask); 2290 sigfillset (&sa.sa_mask);
2023 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ 2291 sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */
2024 sigaction (w->signum, &sa, 0); 2292 sigaction (w->signum, &sa, 0);
2025#endif 2293#endif
2026 } 2294 }
2295
2296 EV_FREQUENT_CHECK;
2027} 2297}
2028 2298
2029void noinline 2299void noinline
2030ev_signal_stop (EV_P_ ev_signal *w) 2300ev_signal_stop (EV_P_ ev_signal *w)
2031{ 2301{
2032 clear_pending (EV_A_ (W)w); 2302 clear_pending (EV_A_ (W)w);
2033 if (expect_false (!ev_is_active (w))) 2303 if (expect_false (!ev_is_active (w)))
2034 return; 2304 return;
2035 2305
2306 EV_FREQUENT_CHECK;
2307
2036 wlist_del (&signals [w->signum - 1].head, (WL)w); 2308 wlist_del (&signals [w->signum - 1].head, (WL)w);
2037 ev_stop (EV_A_ (W)w); 2309 ev_stop (EV_A_ (W)w);
2038 2310
2039 if (!signals [w->signum - 1].head) 2311 if (!signals [w->signum - 1].head)
2040 signal (w->signum, SIG_DFL); 2312 signal (w->signum, SIG_DFL);
2313
2314 EV_FREQUENT_CHECK;
2041} 2315}
2042 2316
2043void 2317void
2044ev_child_start (EV_P_ ev_child *w) 2318ev_child_start (EV_P_ ev_child *w)
2045{ 2319{
… …
2047 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr)); 2321 assert (("child watchers are only supported in the default loop", loop == ev_default_loop_ptr));
2048#endif 2322#endif
2049 if (expect_false (ev_is_active (w))) 2323 if (expect_false (ev_is_active (w)))
2050 return; 2324 return;
2051 2325
2326 EV_FREQUENT_CHECK;
2327
2052 ev_start (EV_A_ (W)w, 1); 2328 ev_start (EV_A_ (W)w, 1);
2053 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2329 wlist_add (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2330
2331 EV_FREQUENT_CHECK;
2054} 2332}
2055 2333
2056void 2334void
2057ev_child_stop (EV_P_ ev_child *w) 2335ev_child_stop (EV_P_ ev_child *w)
2058{ 2336{
2059 clear_pending (EV_A_ (W)w); 2337 clear_pending (EV_A_ (W)w);
2060 if (expect_false (!ev_is_active (w))) 2338 if (expect_false (!ev_is_active (w)))
2061 return; 2339 return;
2062 2340
2341 EV_FREQUENT_CHECK;
2342
2063 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w); 2343 wlist_del (&childs [w->pid & (EV_PID_HASHSIZE - 1)], (WL)w);
2064 ev_stop (EV_A_ (W)w); 2344 ev_stop (EV_A_ (W)w);
2345
2346 EV_FREQUENT_CHECK;
2065} 2347}
2066 2348
2067#if EV_STAT_ENABLE 2349#if EV_STAT_ENABLE
2068 2350
2069# ifdef _WIN32 2351# ifdef _WIN32
… …
2087 if (w->wd < 0) 2369 if (w->wd < 0)
2088 { 2370 {
2089 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */ 2371 ev_timer_start (EV_A_ &w->timer); /* this is not race-free, so we still need to recheck periodically */
2090 2372
2091 /* monitor some parent directory for speedup hints */ 2373 /* monitor some parent directory for speedup hints */
2374 /* note that exceeding the hardcoded limit is not a correctness issue, */
2375 /* but an efficiency issue only */
2092 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096) 2376 if ((errno == ENOENT || errno == EACCES) && strlen (w->path) < 4096)
2093 { 2377 {
2094 char path [4096]; 2378 char path [4096];
2095 strcpy (path, w->path); 2379 strcpy (path, w->path);
2096 2380
… …
2295 else 2579 else
2296#endif 2580#endif
2297 ev_timer_start (EV_A_ &w->timer); 2581 ev_timer_start (EV_A_ &w->timer);
2298 2582
2299 ev_start (EV_A_ (W)w, 1); 2583 ev_start (EV_A_ (W)w, 1);
2584
2585 EV_FREQUENT_CHECK;
2300} 2586}
2301 2587
2302void 2588void
2303ev_stat_stop (EV_P_ ev_stat *w) 2589ev_stat_stop (EV_P_ ev_stat *w)
2304{ 2590{
2305 clear_pending (EV_A_ (W)w); 2591 clear_pending (EV_A_ (W)w);
2306 if (expect_false (!ev_is_active (w))) 2592 if (expect_false (!ev_is_active (w)))
2307 return; 2593 return;
2308 2594
2595 EV_FREQUENT_CHECK;
2596
2309#if EV_USE_INOTIFY 2597#if EV_USE_INOTIFY
2310 infy_del (EV_A_ w); 2598 infy_del (EV_A_ w);
2311#endif 2599#endif
2312 ev_timer_stop (EV_A_ &w->timer); 2600 ev_timer_stop (EV_A_ &w->timer);
2313 2601
2314 ev_stop (EV_A_ (W)w); 2602 ev_stop (EV_A_ (W)w);
2603
2604 EV_FREQUENT_CHECK;
2315} 2605}
2316#endif 2606#endif
2317 2607
2318#if EV_IDLE_ENABLE 2608#if EV_IDLE_ENABLE
2319void 2609void
… …
2321{ 2611{
2322 if (expect_false (ev_is_active (w))) 2612 if (expect_false (ev_is_active (w)))
2323 return; 2613 return;
2324 2614
2325 pri_adjust (EV_A_ (W)w); 2615 pri_adjust (EV_A_ (W)w);
2616
2617 EV_FREQUENT_CHECK;
2326 2618
2327 { 2619 {
2328 int active = ++idlecnt [ABSPRI (w)]; 2620 int active = ++idlecnt [ABSPRI (w)];
2329 2621
2330 ++idleall; 2622 ++idleall;
2331 ev_start (EV_A_ (W)w, active); 2623 ev_start (EV_A_ (W)w, active);
2332 2624
2333 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); 2625 array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2);
2334 idles [ABSPRI (w)][active - 1] = w; 2626 idles [ABSPRI (w)][active - 1] = w;
2335 } 2627 }
2628
2629 EV_FREQUENT_CHECK;
2336} 2630}
2337 2631
2338void 2632void
2339ev_idle_stop (EV_P_ ev_idle *w) 2633ev_idle_stop (EV_P_ ev_idle *w)
2340{ 2634{
2341 clear_pending (EV_A_ (W)w); 2635 clear_pending (EV_A_ (W)w);
2342 if (expect_false (!ev_is_active (w))) 2636 if (expect_false (!ev_is_active (w)))
2343 return; 2637 return;
2344 2638
2639 EV_FREQUENT_CHECK;
2640
2345 { 2641 {
2346 int active = ((W)w)->active; 2642 int active = ev_active (w);
2347 2643
2348 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; 2644 idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]];
2349 ((W)idles [ABSPRI (w)][active - 1])->active = active; 2645 ev_active (idles [ABSPRI (w)][active - 1]) = active;
2350 2646
2351 ev_stop (EV_A_ (W)w); 2647 ev_stop (EV_A_ (W)w);
2352 --idleall; 2648 --idleall;
2353 } 2649 }
2650
2651 EV_FREQUENT_CHECK;
2354} 2652}
2355#endif 2653#endif
2356 2654
2357void 2655void
2358ev_prepare_start (EV_P_ ev_prepare *w) 2656ev_prepare_start (EV_P_ ev_prepare *w)
2359{ 2657{
2360 if (expect_false (ev_is_active (w))) 2658 if (expect_false (ev_is_active (w)))
2361 return; 2659 return;
2660
2661 EV_FREQUENT_CHECK;
2362 2662
2363 ev_start (EV_A_ (W)w, ++preparecnt); 2663 ev_start (EV_A_ (W)w, ++preparecnt);
2364 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2); 2664 array_needsize (ev_prepare *, prepares, preparemax, preparecnt, EMPTY2);
2365 prepares [preparecnt - 1] = w; 2665 prepares [preparecnt - 1] = w;
2666
2667 EV_FREQUENT_CHECK;
2366} 2668}
2367 2669
2368void 2670void
2369ev_prepare_stop (EV_P_ ev_prepare *w) 2671ev_prepare_stop (EV_P_ ev_prepare *w)
2370{ 2672{
2371 clear_pending (EV_A_ (W)w); 2673 clear_pending (EV_A_ (W)w);
2372 if (expect_false (!ev_is_active (w))) 2674 if (expect_false (!ev_is_active (w)))
2373 return; 2675 return;
2374 2676
2677 EV_FREQUENT_CHECK;
2678
2375 { 2679 {
2376 int active = ((W)w)->active; 2680 int active = ev_active (w);
2681
2377 prepares [active - 1] = prepares [--preparecnt]; 2682 prepares [active - 1] = prepares [--preparecnt];
2378 ((W)prepares [active - 1])->active = active; 2683 ev_active (prepares [active - 1]) = active;
2379 } 2684 }
2380 2685
2381 ev_stop (EV_A_ (W)w); 2686 ev_stop (EV_A_ (W)w);
2687
2688 EV_FREQUENT_CHECK;
2382} 2689}
2383 2690
2384void 2691void
2385ev_check_start (EV_P_ ev_check *w) 2692ev_check_start (EV_P_ ev_check *w)
2386{ 2693{
2387 if (expect_false (ev_is_active (w))) 2694 if (expect_false (ev_is_active (w)))
2388 return; 2695 return;
2696
2697 EV_FREQUENT_CHECK;
2389 2698
2390 ev_start (EV_A_ (W)w, ++checkcnt); 2699 ev_start (EV_A_ (W)w, ++checkcnt);
2391 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2); 2700 array_needsize (ev_check *, checks, checkmax, checkcnt, EMPTY2);
2392 checks [checkcnt - 1] = w; 2701 checks [checkcnt - 1] = w;
2702
2703 EV_FREQUENT_CHECK;
2393} 2704}
2394 2705
2395void 2706void
2396ev_check_stop (EV_P_ ev_check *w) 2707ev_check_stop (EV_P_ ev_check *w)
2397{ 2708{
2398 clear_pending (EV_A_ (W)w); 2709 clear_pending (EV_A_ (W)w);
2399 if (expect_false (!ev_is_active (w))) 2710 if (expect_false (!ev_is_active (w)))
2400 return; 2711 return;
2401 2712
2713 EV_FREQUENT_CHECK;
2714
2402 { 2715 {
2403 int active = ((W)w)->active; 2716 int active = ev_active (w);
2717
2404 checks [active - 1] = checks [--checkcnt]; 2718 checks [active - 1] = checks [--checkcnt];
2405 ((W)checks [active - 1])->active = active; 2719 ev_active (checks [active - 1]) = active;
2406 } 2720 }
2407 2721
2408 ev_stop (EV_A_ (W)w); 2722 ev_stop (EV_A_ (W)w);
2723
2724 EV_FREQUENT_CHECK;
2409} 2725}
2410 2726
2411#if EV_EMBED_ENABLE 2727#if EV_EMBED_ENABLE
2412void noinline 2728void noinline
2413ev_embed_sweep (EV_P_ ev_embed *w) 2729ev_embed_sweep (EV_P_ ev_embed *w)
… …
2460 struct ev_loop *loop = w->other; 2776 struct ev_loop *loop = w->other;
2461 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ())); 2777 assert (("loop to be embedded is not embeddable", backend & ev_embeddable_backends ()));
2462 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ); 2778 ev_io_init (&w->io, embed_io_cb, backend_fd, EV_READ);
2463 } 2779 }
2464 2780
2781 EV_FREQUENT_CHECK;
2782
2465 ev_set_priority (&w->io, ev_priority (w)); 2783 ev_set_priority (&w->io, ev_priority (w));
2466 ev_io_start (EV_A_ &w->io); 2784 ev_io_start (EV_A_ &w->io);
2467 2785
2468 ev_prepare_init (&w->prepare, embed_prepare_cb); 2786 ev_prepare_init (&w->prepare, embed_prepare_cb);
2469 ev_set_priority (&w->prepare, EV_MINPRI); 2787 ev_set_priority (&w->prepare, EV_MINPRI);
2470 ev_prepare_start (EV_A_ &w->prepare); 2788 ev_prepare_start (EV_A_ &w->prepare);
2471 2789
2472 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/ 2790 /*ev_idle_init (&w->idle, e,bed_idle_cb);*/
2473 2791
2474 ev_start (EV_A_ (W)w, 1); 2792 ev_start (EV_A_ (W)w, 1);
2793
2794 EV_FREQUENT_CHECK;
2475} 2795}
2476 2796
2477void 2797void
2478ev_embed_stop (EV_P_ ev_embed *w) 2798ev_embed_stop (EV_P_ ev_embed *w)
2479{ 2799{
2480 clear_pending (EV_A_ (W)w); 2800 clear_pending (EV_A_ (W)w);
2481 if (expect_false (!ev_is_active (w))) 2801 if (expect_false (!ev_is_active (w)))
2482 return; 2802 return;
2483 2803
2804 EV_FREQUENT_CHECK;
2805
2484 ev_io_stop (EV_A_ &w->io); 2806 ev_io_stop (EV_A_ &w->io);
2485 ev_prepare_stop (EV_A_ &w->prepare); 2807 ev_prepare_stop (EV_A_ &w->prepare);
2486 2808
2487 ev_stop (EV_A_ (W)w); 2809 ev_stop (EV_A_ (W)w);
2810
2811 EV_FREQUENT_CHECK;
2488} 2812}
2489#endif 2813#endif
2490 2814
2491#if EV_FORK_ENABLE 2815#if EV_FORK_ENABLE
2492void 2816void
2493ev_fork_start (EV_P_ ev_fork *w) 2817ev_fork_start (EV_P_ ev_fork *w)
2494{ 2818{
2495 if (expect_false (ev_is_active (w))) 2819 if (expect_false (ev_is_active (w)))
2496 return; 2820 return;
2821
2822 EV_FREQUENT_CHECK;
2497 2823
2498 ev_start (EV_A_ (W)w, ++forkcnt); 2824 ev_start (EV_A_ (W)w, ++forkcnt);
2499 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2); 2825 array_needsize (ev_fork *, forks, forkmax, forkcnt, EMPTY2);
2500 forks [forkcnt - 1] = w; 2826 forks [forkcnt - 1] = w;
2827
2828 EV_FREQUENT_CHECK;
2501} 2829}
2502 2830
2503void 2831void
2504ev_fork_stop (EV_P_ ev_fork *w) 2832ev_fork_stop (EV_P_ ev_fork *w)
2505{ 2833{
2506 clear_pending (EV_A_ (W)w); 2834 clear_pending (EV_A_ (W)w);
2507 if (expect_false (!ev_is_active (w))) 2835 if (expect_false (!ev_is_active (w)))
2508 return; 2836 return;
2509 2837
2838 EV_FREQUENT_CHECK;
2839
2510 { 2840 {
2511 int active = ((W)w)->active; 2841 int active = ev_active (w);
2842
2512 forks [active - 1] = forks [--forkcnt]; 2843 forks [active - 1] = forks [--forkcnt];
2513 ((W)forks [active - 1])->active = active; 2844 ev_active (forks [active - 1]) = active;
2514 } 2845 }
2515 2846
2516 ev_stop (EV_A_ (W)w); 2847 ev_stop (EV_A_ (W)w);
2848
2849 EV_FREQUENT_CHECK;
2517} 2850}
2518#endif 2851#endif
2519 2852
2520#if EV_ASYNC_ENABLE 2853#if EV_ASYNC_ENABLE
2521void 2854void
… …
2523{ 2856{
2524 if (expect_false (ev_is_active (w))) 2857 if (expect_false (ev_is_active (w)))
2525 return; 2858 return;
2526 2859
2527 evpipe_init (EV_A); 2860 evpipe_init (EV_A);
2861
2862 EV_FREQUENT_CHECK;
2528 2863
2529 ev_start (EV_A_ (W)w, ++asynccnt); 2864 ev_start (EV_A_ (W)w, ++asynccnt);
2530 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2); 2865 array_needsize (ev_async *, asyncs, asyncmax, asynccnt, EMPTY2);
2531 asyncs [asynccnt - 1] = w; 2866 asyncs [asynccnt - 1] = w;
2867
2868 EV_FREQUENT_CHECK;
2532} 2869}
2533 2870
2534void 2871void
2535ev_async_stop (EV_P_ ev_async *w) 2872ev_async_stop (EV_P_ ev_async *w)
2536{ 2873{
2537 clear_pending (EV_A_ (W)w); 2874 clear_pending (EV_A_ (W)w);
2538 if (expect_false (!ev_is_active (w))) 2875 if (expect_false (!ev_is_active (w)))
2539 return; 2876 return;
2540 2877
2878 EV_FREQUENT_CHECK;
2879
2541 { 2880 {
2542 int active = ((W)w)->active; 2881 int active = ev_active (w);
2882
2543 asyncs [active - 1] = asyncs [--asynccnt]; 2883 asyncs [active - 1] = asyncs [--asynccnt];
2544 ((W)asyncs [active - 1])->active = active; 2884 ev_active (asyncs [active - 1]) = active;
2545 } 2885 }
2546 2886
2547 ev_stop (EV_A_ (W)w); 2887 ev_stop (EV_A_ (W)w);
2888
2889 EV_FREQUENT_CHECK;
2548} 2890}
2549 2891
2550void 2892void
2551ev_async_send (EV_P_ ev_async *w) 2893ev_async_send (EV_P_ ev_async *w)
2552{ 2894{

Diff Legend

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