… | |
… | |
216 | # include <sys/inotify.h> |
216 | # include <sys/inotify.h> |
217 | #endif |
217 | #endif |
218 | |
218 | |
219 | /**/ |
219 | /**/ |
220 | |
220 | |
|
|
221 | /* |
|
|
222 | * This is used to avoid floating point rounding problems. |
|
|
223 | * It is added to ev_rt_now when scheduling periodics |
|
|
224 | * to ensure progress, time-wise, even when rounding |
|
|
225 | * errors are against us. |
|
|
226 | * This value is good at least till the year 4000. |
|
|
227 | * Better solutions welcome. |
|
|
228 | */ |
|
|
229 | #define TIME_EPSILON 0.0001220703125 /* 1/8192 */ |
|
|
230 | |
221 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
231 | #define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
222 | #define MAX_BLOCKTIME 59.743 /* never wait longer than this time (to detect time jumps) */ |
232 | #define MAX_BLOCKTIME 59.743 /* never wait longer than this time (to detect time jumps) */ |
223 | /*#define CLEANUP_INTERVAL (MAX_BLOCKTIME * 5.) /* how often to try to free memory and re-check fds */ |
233 | /*#define CLEANUP_INTERVAL (MAX_BLOCKTIME * 5.) /* how often to try to free memory and re-check fds, TODO */ |
224 | |
234 | |
225 | #if __GNUC__ >= 3 |
235 | #if __GNUC__ >= 3 |
226 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
236 | # define expect(expr,value) __builtin_expect ((expr),(value)) |
227 | # define noinline __attribute__ ((noinline)) |
237 | # define noinline __attribute__ ((noinline)) |
228 | #else |
238 | #else |
… | |
… | |
466 | pendings [pri][w_->pending - 1].w = w_; |
476 | pendings [pri][w_->pending - 1].w = w_; |
467 | pendings [pri][w_->pending - 1].events = revents; |
477 | pendings [pri][w_->pending - 1].events = revents; |
468 | } |
478 | } |
469 | } |
479 | } |
470 | |
480 | |
471 | void inline_size |
481 | void inline_speed |
472 | queue_events (EV_P_ W *events, int eventcnt, int type) |
482 | queue_events (EV_P_ W *events, int eventcnt, int type) |
473 | { |
483 | { |
474 | int i; |
484 | int i; |
475 | |
485 | |
476 | for (i = 0; i < eventcnt; ++i) |
486 | for (i = 0; i < eventcnt; ++i) |
… | |
… | |
628 | void inline_speed |
638 | void inline_speed |
629 | upheap (WT *heap, int k) |
639 | upheap (WT *heap, int k) |
630 | { |
640 | { |
631 | WT w = heap [k]; |
641 | WT w = heap [k]; |
632 | |
642 | |
633 | while (k && heap [k >> 1]->at > w->at) |
643 | while (k) |
634 | { |
644 | { |
|
|
645 | int p = (k - 1) >> 1; |
|
|
646 | |
|
|
647 | if (heap [p]->at <= w->at) |
|
|
648 | break; |
|
|
649 | |
635 | heap [k] = heap [k >> 1]; |
650 | heap [k] = heap [p]; |
636 | ((W)heap [k])->active = k + 1; |
651 | ((W)heap [k])->active = k + 1; |
637 | k >>= 1; |
652 | k = p; |
638 | } |
653 | } |
639 | |
654 | |
640 | heap [k] = w; |
655 | heap [k] = w; |
641 | ((W)heap [k])->active = k + 1; |
656 | ((W)heap [k])->active = k + 1; |
642 | |
657 | |
… | |
… | |
645 | void inline_speed |
660 | void inline_speed |
646 | downheap (WT *heap, int N, int k) |
661 | downheap (WT *heap, int N, int k) |
647 | { |
662 | { |
648 | WT w = heap [k]; |
663 | WT w = heap [k]; |
649 | |
664 | |
650 | while (k < (N >> 1)) |
665 | for (;;) |
651 | { |
666 | { |
652 | int j = k << 1; |
667 | int c = (k << 1) + 1; |
653 | |
668 | |
654 | if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
669 | if (c >= N) |
655 | ++j; |
|
|
656 | |
|
|
657 | if (w->at <= heap [j]->at) |
|
|
658 | break; |
670 | break; |
659 | |
671 | |
|
|
672 | c += c + 1 < N && heap [c]->at > heap [c + 1]->at |
|
|
673 | ? 1 : 0; |
|
|
674 | |
|
|
675 | if (w->at <= heap [c]->at) |
|
|
676 | break; |
|
|
677 | |
660 | heap [k] = heap [j]; |
678 | heap [k] = heap [c]; |
661 | ((W)heap [k])->active = k + 1; |
679 | ((W)heap [k])->active = k + 1; |
|
|
680 | |
662 | k = j; |
681 | k = c; |
663 | } |
682 | } |
664 | |
683 | |
665 | heap [k] = w; |
684 | heap [k] = w; |
666 | ((W)heap [k])->active = k + 1; |
685 | ((W)heap [k])->active = k + 1; |
667 | } |
686 | } |
… | |
… | |
1231 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1250 | /*assert (("inactive timer on periodic heap detected", ev_is_active (w)));*/ |
1232 | |
1251 | |
1233 | /* first reschedule or stop timer */ |
1252 | /* first reschedule or stop timer */ |
1234 | if (w->reschedule_cb) |
1253 | if (w->reschedule_cb) |
1235 | { |
1254 | { |
1236 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + 0.0001220703125 /* 1/8192 */); |
1255 | ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + TIME_EPSILON); |
1237 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
1256 | assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
1238 | downheap ((WT *)periodics, periodiccnt, 0); |
1257 | downheap ((WT *)periodics, periodiccnt, 0); |
1239 | } |
1258 | } |
1240 | else if (w->interval) |
1259 | else if (w->interval) |
1241 | { |
1260 | { |
1242 | ((WT)w)->at = w->offset + floor ((ev_rt_now - w->offset) / w->interval + 1.) * w->interval; |
1261 | ((WT)w)->at = w->offset + ceil ((ev_rt_now - w->offset) / w->interval) * w->interval; |
|
|
1262 | if (((WT)w)->at - ev_rt_now <= TIME_EPSILON) ((WT)w)->at += w->interval; |
1243 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
1263 | assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
1244 | downheap ((WT *)periodics, periodiccnt, 0); |
1264 | downheap ((WT *)periodics, periodiccnt, 0); |
1245 | } |
1265 | } |
1246 | else |
1266 | else |
1247 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1267 | ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
… | |
… | |
1293 | } |
1313 | } |
1294 | } |
1314 | } |
1295 | } |
1315 | } |
1296 | #endif |
1316 | #endif |
1297 | |
1317 | |
1298 | int inline_size |
1318 | void inline_speed |
1299 | time_update_monotonic (EV_P) |
1319 | time_update (EV_P_ ev_tstamp max_block) |
1300 | { |
1320 | { |
|
|
1321 | int i; |
|
|
1322 | |
|
|
1323 | #if EV_USE_MONOTONIC |
|
|
1324 | if (expect_true (have_monotonic)) |
|
|
1325 | { |
|
|
1326 | ev_tstamp odiff = rtmn_diff; |
|
|
1327 | |
1301 | mn_now = get_clock (); |
1328 | mn_now = get_clock (); |
1302 | |
1329 | |
|
|
1330 | /* only fetch the realtime clock every 0.5*MIN_TIMEJUMP seconds */ |
|
|
1331 | /* interpolate in the meantime */ |
1303 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1332 | if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1304 | { |
1333 | { |
1305 | ev_rt_now = rtmn_diff + mn_now; |
1334 | ev_rt_now = rtmn_diff + mn_now; |
1306 | return 0; |
1335 | return; |
1307 | } |
1336 | } |
1308 | else |
1337 | |
1309 | { |
|
|
1310 | now_floor = mn_now; |
1338 | now_floor = mn_now; |
1311 | ev_rt_now = ev_time (); |
1339 | ev_rt_now = ev_time (); |
1312 | return 1; |
|
|
1313 | } |
|
|
1314 | } |
|
|
1315 | |
1340 | |
1316 | void inline_size |
1341 | /* loop a few times, before making important decisions. |
1317 | time_update (EV_P) |
1342 | * on the choice of "4": one iteration isn't enough, |
1318 | { |
1343 | * in case we get preempted during the calls to |
1319 | int i; |
1344 | * ev_time and get_clock. a second call is almost guaranteed |
1320 | |
1345 | * to succeed in that case, though. and looping a few more times |
1321 | #if EV_USE_MONOTONIC |
1346 | * doesn't hurt either as we only do this on time-jumps or |
1322 | if (expect_true (have_monotonic)) |
1347 | * in the unlikely event of having been preempted here. |
1323 | { |
1348 | */ |
1324 | if (time_update_monotonic (EV_A)) |
1349 | for (i = 4; --i; ) |
1325 | { |
1350 | { |
1326 | ev_tstamp odiff = rtmn_diff; |
|
|
1327 | |
|
|
1328 | /* loop a few times, before making important decisions. |
|
|
1329 | * on the choice of "4": one iteration isn't enough, |
|
|
1330 | * in case we get preempted during the calls to |
|
|
1331 | * ev_time and get_clock. a second call is almost guaranteed |
|
|
1332 | * to succeed in that case, though. and looping a few more times |
|
|
1333 | * doesn't hurt either as we only do this on time-jumps or |
|
|
1334 | * in the unlikely event of having been preempted here. |
|
|
1335 | */ |
|
|
1336 | for (i = 4; --i; ) |
|
|
1337 | { |
|
|
1338 | rtmn_diff = ev_rt_now - mn_now; |
1351 | rtmn_diff = ev_rt_now - mn_now; |
1339 | |
1352 | |
1340 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1353 | if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1341 | return; /* all is well */ |
1354 | return; /* all is well */ |
1342 | |
1355 | |
1343 | ev_rt_now = ev_time (); |
1356 | ev_rt_now = ev_time (); |
1344 | mn_now = get_clock (); |
1357 | mn_now = get_clock (); |
1345 | now_floor = mn_now; |
1358 | now_floor = mn_now; |
1346 | } |
1359 | } |
1347 | |
1360 | |
1348 | # if EV_PERIODIC_ENABLE |
1361 | # if EV_PERIODIC_ENABLE |
1349 | periodics_reschedule (EV_A); |
1362 | periodics_reschedule (EV_A); |
1350 | # endif |
1363 | # endif |
1351 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
1364 | /* no timer adjustment, as the monotonic clock doesn't jump */ |
1352 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
1365 | /* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
1353 | } |
|
|
1354 | } |
1366 | } |
1355 | else |
1367 | else |
1356 | #endif |
1368 | #endif |
1357 | { |
1369 | { |
1358 | ev_rt_now = ev_time (); |
1370 | ev_rt_now = ev_time (); |
1359 | |
1371 | |
1360 | if (expect_false (mn_now > ev_rt_now || mn_now < ev_rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
1372 | if (expect_false (mn_now > ev_rt_now || ev_rt_now > mn_now + max_block + MIN_TIMEJUMP)) |
1361 | { |
1373 | { |
1362 | #if EV_PERIODIC_ENABLE |
1374 | #if EV_PERIODIC_ENABLE |
1363 | periodics_reschedule (EV_A); |
1375 | periodics_reschedule (EV_A); |
1364 | #endif |
1376 | #endif |
1365 | |
|
|
1366 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1377 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1367 | for (i = 0; i < timercnt; ++i) |
1378 | for (i = 0; i < timercnt; ++i) |
1368 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
1379 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
1369 | } |
1380 | } |
1370 | |
1381 | |
… | |
… | |
1440 | if (expect_false (flags & EVLOOP_NONBLOCK || idleall || !activecnt)) |
1451 | if (expect_false (flags & EVLOOP_NONBLOCK || idleall || !activecnt)) |
1441 | block = 0.; /* do not block at all */ |
1452 | block = 0.; /* do not block at all */ |
1442 | else |
1453 | else |
1443 | { |
1454 | { |
1444 | /* update time to cancel out callback processing overhead */ |
1455 | /* update time to cancel out callback processing overhead */ |
1445 | #if EV_USE_MONOTONIC |
|
|
1446 | if (expect_true (have_monotonic)) |
|
|
1447 | time_update_monotonic (EV_A); |
1456 | time_update (EV_A_ 1e100); |
1448 | else |
|
|
1449 | #endif |
|
|
1450 | { |
|
|
1451 | ev_rt_now = ev_time (); |
|
|
1452 | mn_now = ev_rt_now; |
|
|
1453 | } |
|
|
1454 | |
1457 | |
1455 | block = MAX_BLOCKTIME; |
1458 | block = MAX_BLOCKTIME; |
1456 | |
1459 | |
1457 | if (timercnt) |
1460 | if (timercnt) |
1458 | { |
1461 | { |
… | |
… | |
1471 | if (expect_false (block < 0.)) block = 0.; |
1474 | if (expect_false (block < 0.)) block = 0.; |
1472 | } |
1475 | } |
1473 | |
1476 | |
1474 | ++loop_count; |
1477 | ++loop_count; |
1475 | backend_poll (EV_A_ block); |
1478 | backend_poll (EV_A_ block); |
|
|
1479 | |
|
|
1480 | /* update ev_rt_now, do magic */ |
|
|
1481 | time_update (EV_A_ block); |
1476 | } |
1482 | } |
1477 | |
|
|
1478 | /* update ev_rt_now, do magic */ |
|
|
1479 | time_update (EV_A); |
|
|
1480 | |
1483 | |
1481 | /* queue pending timers and reschedule them */ |
1484 | /* queue pending timers and reschedule them */ |
1482 | timers_reify (EV_A); /* relative timers called last */ |
1485 | timers_reify (EV_A); /* relative timers called last */ |
1483 | #if EV_PERIODIC_ENABLE |
1486 | #if EV_PERIODIC_ENABLE |
1484 | periodics_reify (EV_A); /* absolute timers called first */ |
1487 | periodics_reify (EV_A); /* absolute timers called first */ |
… | |
… | |
1749 | if (expect_false (ev_is_active (w))) |
1752 | if (expect_false (ev_is_active (w))) |
1750 | return; |
1753 | return; |
1751 | |
1754 | |
1752 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1755 | assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1753 | |
1756 | |
|
|
1757 | { |
|
|
1758 | #ifndef _WIN32 |
|
|
1759 | sigset_t full, prev; |
|
|
1760 | sigfillset (&full); |
|
|
1761 | sigprocmask (SIG_SETMASK, &full, &prev); |
|
|
1762 | #endif |
|
|
1763 | |
|
|
1764 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
|
|
1765 | |
|
|
1766 | #ifndef _WIN32 |
|
|
1767 | sigprocmask (SIG_SETMASK, &prev, 0); |
|
|
1768 | #endif |
|
|
1769 | } |
|
|
1770 | |
1754 | ev_start (EV_A_ (W)w, 1); |
1771 | ev_start (EV_A_ (W)w, 1); |
1755 | array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
|
|
1756 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1772 | wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1757 | |
1773 | |
1758 | if (!((WL)w)->next) |
1774 | if (!((WL)w)->next) |
1759 | { |
1775 | { |
1760 | #if _WIN32 |
1776 | #if _WIN32 |