… | |
… | |
241 | |
241 | |
242 | #define expect_false(expr) expect ((expr) != 0, 0) |
242 | #define expect_false(expr) expect ((expr) != 0, 0) |
243 | #define expect_true(expr) expect ((expr) != 0, 1) |
243 | #define expect_true(expr) expect ((expr) != 0, 1) |
244 | |
244 | |
245 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
245 | #define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
246 | #define ABSPRI(w) ((w)->priority - EV_MINPRI) |
246 | #define ABSPRI(w) (((W)w)->priority - EV_MINPRI) |
247 | |
247 | |
248 | #define EMPTY0 /* required for microsofts broken pseudo-c compiler */ |
248 | #define EMPTY /* required for microsofts broken pseudo-c compiler */ |
249 | #define EMPTY2(a,b) /* used to suppress some warnings */ |
249 | #define EMPTY2(a,b) /* used to suppress some warnings */ |
250 | |
250 | |
251 | typedef ev_watcher *W; |
251 | typedef ev_watcher *W; |
252 | typedef ev_watcher_list *WL; |
252 | typedef ev_watcher_list *WL; |
253 | typedef ev_watcher_time *WT; |
253 | typedef ev_watcher_time *WT; |
… | |
… | |
396 | { |
396 | { |
397 | return ev_rt_now; |
397 | return ev_rt_now; |
398 | } |
398 | } |
399 | #endif |
399 | #endif |
400 | |
400 | |
401 | #define array_roundsize(type,n) (((n) | 4) & ~3) |
401 | int inline_size |
|
|
402 | array_nextsize (int elem, int cur, int cnt) |
|
|
403 | { |
|
|
404 | int ncur = cur + 1; |
|
|
405 | |
|
|
406 | do |
|
|
407 | ncur <<= 1; |
|
|
408 | while (cnt > ncur); |
|
|
409 | |
|
|
410 | /* if size > 4096, round to 4096 - 4 * longs to accomodate malloc overhead */ |
|
|
411 | if (elem * ncur > 4096) |
|
|
412 | { |
|
|
413 | ncur *= elem; |
|
|
414 | ncur = (ncur + elem + 4095 + sizeof (void *) * 4) & ~4095; |
|
|
415 | ncur = ncur - sizeof (void *) * 4; |
|
|
416 | ncur /= elem; |
|
|
417 | } |
|
|
418 | |
|
|
419 | return ncur; |
|
|
420 | } |
|
|
421 | |
|
|
422 | inline_speed void * |
|
|
423 | array_realloc (int elem, void *base, int *cur, int cnt) |
|
|
424 | { |
|
|
425 | *cur = array_nextsize (elem, *cur, cnt); |
|
|
426 | return ev_realloc (base, elem * *cur); |
|
|
427 | } |
402 | |
428 | |
403 | #define array_needsize(type,base,cur,cnt,init) \ |
429 | #define array_needsize(type,base,cur,cnt,init) \ |
404 | if (expect_false ((cnt) > cur)) \ |
430 | if (expect_false ((cnt) > (cur))) \ |
405 | { \ |
431 | { \ |
406 | int newcnt = cur; \ |
432 | int ocur_ = (cur); \ |
407 | do \ |
433 | (base) = (type *)array_realloc \ |
408 | { \ |
434 | (sizeof (type), (base), &(cur), (cnt)); \ |
409 | newcnt = array_roundsize (type, newcnt << 1); \ |
435 | init ((base) + (ocur_), (cur) - ocur_); \ |
410 | } \ |
|
|
411 | while ((cnt) > newcnt); \ |
|
|
412 | \ |
|
|
413 | base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
|
|
414 | init (base + cur, newcnt - cur); \ |
|
|
415 | cur = newcnt; \ |
|
|
416 | } |
436 | } |
417 | |
437 | |
|
|
438 | #if 0 |
418 | #define array_slim(type,stem) \ |
439 | #define array_slim(type,stem) \ |
419 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
440 | if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
420 | { \ |
441 | { \ |
421 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
442 | stem ## max = array_roundsize (stem ## cnt >> 1); \ |
422 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
443 | base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
423 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
444 | fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
424 | } |
445 | } |
|
|
446 | #endif |
425 | |
447 | |
426 | #define array_free(stem, idx) \ |
448 | #define array_free(stem, idx) \ |
427 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
449 | ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
428 | |
450 | |
429 | /*****************************************************************************/ |
451 | /*****************************************************************************/ |
… | |
… | |
589 | static void noinline |
611 | static void noinline |
590 | fd_rearm_all (EV_P) |
612 | fd_rearm_all (EV_P) |
591 | { |
613 | { |
592 | int fd; |
614 | int fd; |
593 | |
615 | |
594 | /* this should be highly optimised to not do anything but set a flag */ |
|
|
595 | for (fd = 0; fd < anfdmax; ++fd) |
616 | for (fd = 0; fd < anfdmax; ++fd) |
596 | if (anfds [fd].events) |
617 | if (anfds [fd].events) |
597 | { |
618 | { |
598 | anfds [fd].events = 0; |
619 | anfds [fd].events = 0; |
599 | fd_change (EV_A_ fd); |
620 | fd_change (EV_A_ fd); |
… | |
… | |
765 | ev_child *w; |
786 | ev_child *w; |
766 | |
787 | |
767 | for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next) |
788 | for (w = (ev_child *)childs [chain & (EV_PID_HASHSIZE - 1)]; w; w = (ev_child *)((WL)w)->next) |
768 | if (w->pid == pid || !w->pid) |
789 | if (w->pid == pid || !w->pid) |
769 | { |
790 | { |
770 | ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
791 | ev_set_priority (w, ev_priority (sw)); /* need to do it *now* */ |
771 | w->rpid = pid; |
792 | w->rpid = pid; |
772 | w->rstatus = status; |
793 | w->rstatus = status; |
773 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
794 | ev_feed_event (EV_A_ (W)w, EV_CHILD); |
774 | } |
795 | } |
775 | } |
796 | } |
776 | |
797 | |
777 | #ifndef WCONTINUED |
798 | #ifndef WCONTINUED |
… | |
… | |
887 | ev_backend (EV_P) |
908 | ev_backend (EV_P) |
888 | { |
909 | { |
889 | return backend; |
910 | return backend; |
890 | } |
911 | } |
891 | |
912 | |
|
|
913 | unsigned int |
|
|
914 | ev_loop_count (EV_P) |
|
|
915 | { |
|
|
916 | return loop_count; |
|
|
917 | } |
|
|
918 | |
892 | static void noinline |
919 | static void noinline |
893 | loop_init (EV_P_ unsigned int flags) |
920 | loop_init (EV_P_ unsigned int flags) |
894 | { |
921 | { |
895 | if (!backend) |
922 | if (!backend) |
896 | { |
923 | { |
… | |
… | |
905 | ev_rt_now = ev_time (); |
932 | ev_rt_now = ev_time (); |
906 | mn_now = get_clock (); |
933 | mn_now = get_clock (); |
907 | now_floor = mn_now; |
934 | now_floor = mn_now; |
908 | rtmn_diff = ev_rt_now - mn_now; |
935 | rtmn_diff = ev_rt_now - mn_now; |
909 | |
936 | |
|
|
937 | /* pid check not overridable via env */ |
|
|
938 | #ifndef _WIN32 |
|
|
939 | if (flags & EVFLAG_FORKCHECK) |
|
|
940 | curpid = getpid (); |
|
|
941 | #endif |
|
|
942 | |
910 | if (!(flags & EVFLAG_NOENV) |
943 | if (!(flags & EVFLAG_NOENV) |
911 | && !enable_secure () |
944 | && !enable_secure () |
912 | && getenv ("LIBEV_FLAGS")) |
945 | && getenv ("LIBEV_FLAGS")) |
913 | flags = atoi (getenv ("LIBEV_FLAGS")); |
946 | flags = atoi (getenv ("LIBEV_FLAGS")); |
914 | |
947 | |
… | |
… | |
970 | #if EV_USE_SELECT |
1003 | #if EV_USE_SELECT |
971 | if (backend == EVBACKEND_SELECT) select_destroy (EV_A); |
1004 | if (backend == EVBACKEND_SELECT) select_destroy (EV_A); |
972 | #endif |
1005 | #endif |
973 | |
1006 | |
974 | for (i = NUMPRI; i--; ) |
1007 | for (i = NUMPRI; i--; ) |
|
|
1008 | { |
975 | array_free (pending, [i]); |
1009 | array_free (pending, [i]); |
|
|
1010 | #if EV_IDLE_ENABLE |
|
|
1011 | array_free (idle, [i]); |
|
|
1012 | #endif |
|
|
1013 | } |
976 | |
1014 | |
977 | /* have to use the microsoft-never-gets-it-right macro */ |
1015 | /* have to use the microsoft-never-gets-it-right macro */ |
978 | array_free (fdchange, EMPTY0); |
1016 | array_free (fdchange, EMPTY); |
979 | array_free (timer, EMPTY0); |
1017 | array_free (timer, EMPTY); |
980 | #if EV_PERIODIC_ENABLE |
1018 | #if EV_PERIODIC_ENABLE |
981 | array_free (periodic, EMPTY0); |
1019 | array_free (periodic, EMPTY); |
982 | #endif |
1020 | #endif |
983 | array_free (idle, EMPTY0); |
|
|
984 | array_free (prepare, EMPTY0); |
1021 | array_free (prepare, EMPTY); |
985 | array_free (check, EMPTY0); |
1022 | array_free (check, EMPTY); |
986 | |
1023 | |
987 | backend = 0; |
1024 | backend = 0; |
988 | } |
1025 | } |
989 | |
1026 | |
990 | void inline_size infy_fork (EV_P); |
1027 | void inline_size infy_fork (EV_P); |
… | |
… | |
1125 | if (backend) |
1162 | if (backend) |
1126 | postfork = 1; |
1163 | postfork = 1; |
1127 | } |
1164 | } |
1128 | |
1165 | |
1129 | /*****************************************************************************/ |
1166 | /*****************************************************************************/ |
1130 | |
|
|
1131 | int inline_size |
|
|
1132 | any_pending (EV_P) |
|
|
1133 | { |
|
|
1134 | int pri; |
|
|
1135 | |
|
|
1136 | for (pri = NUMPRI; pri--; ) |
|
|
1137 | if (pendingcnt [pri]) |
|
|
1138 | return 1; |
|
|
1139 | |
|
|
1140 | return 0; |
|
|
1141 | } |
|
|
1142 | |
1167 | |
1143 | void inline_speed |
1168 | void inline_speed |
1144 | call_pending (EV_P) |
1169 | call_pending (EV_P) |
1145 | { |
1170 | { |
1146 | int pri; |
1171 | int pri; |
… | |
… | |
1237 | for (i = periodiccnt >> 1; i--; ) |
1262 | for (i = periodiccnt >> 1; i--; ) |
1238 | downheap ((WT *)periodics, periodiccnt, i); |
1263 | downheap ((WT *)periodics, periodiccnt, i); |
1239 | } |
1264 | } |
1240 | #endif |
1265 | #endif |
1241 | |
1266 | |
|
|
1267 | #if EV_IDLE_ENABLE |
|
|
1268 | void inline_size |
|
|
1269 | idle_reify (EV_P) |
|
|
1270 | { |
|
|
1271 | if (expect_false (!idleall)) |
|
|
1272 | { |
|
|
1273 | int pri; |
|
|
1274 | |
|
|
1275 | for (pri = NUMPRI; pri--; ) |
|
|
1276 | { |
|
|
1277 | if (pendingcnt [pri]) |
|
|
1278 | break; |
|
|
1279 | |
|
|
1280 | if (idlecnt [pri]) |
|
|
1281 | { |
|
|
1282 | queue_events (EV_A_ (W *)idles [pri], idlecnt [pri], EV_IDLE); |
|
|
1283 | break; |
|
|
1284 | } |
|
|
1285 | } |
|
|
1286 | } |
|
|
1287 | } |
|
|
1288 | #endif |
|
|
1289 | |
1242 | int inline_size |
1290 | int inline_size |
1243 | time_update_monotonic (EV_P) |
1291 | time_update_monotonic (EV_P) |
1244 | { |
1292 | { |
1245 | mn_now = get_clock (); |
1293 | mn_now = get_clock (); |
1246 | |
1294 | |
… | |
… | |
1270 | ev_tstamp odiff = rtmn_diff; |
1318 | ev_tstamp odiff = rtmn_diff; |
1271 | |
1319 | |
1272 | /* loop a few times, before making important decisions. |
1320 | /* loop a few times, before making important decisions. |
1273 | * on the choice of "4": one iteration isn't enough, |
1321 | * on the choice of "4": one iteration isn't enough, |
1274 | * in case we get preempted during the calls to |
1322 | * in case we get preempted during the calls to |
1275 | * ev_time and get_clock. a second call is almost guarenteed |
1323 | * ev_time and get_clock. a second call is almost guaranteed |
1276 | * to succeed in that case, though. and looping a few more times |
1324 | * to succeed in that case, though. and looping a few more times |
1277 | * doesn't hurt either as we only do this on time-jumps or |
1325 | * doesn't hurt either as we only do this on time-jumps or |
1278 | * in the unlikely event of getting preempted here. |
1326 | * in the unlikely event of having been preempted here. |
1279 | */ |
1327 | */ |
1280 | for (i = 4; --i; ) |
1328 | for (i = 4; --i; ) |
1281 | { |
1329 | { |
1282 | rtmn_diff = ev_rt_now - mn_now; |
1330 | rtmn_diff = ev_rt_now - mn_now; |
1283 | |
1331 | |
… | |
… | |
1305 | { |
1353 | { |
1306 | #if EV_PERIODIC_ENABLE |
1354 | #if EV_PERIODIC_ENABLE |
1307 | periodics_reschedule (EV_A); |
1355 | periodics_reschedule (EV_A); |
1308 | #endif |
1356 | #endif |
1309 | |
1357 | |
1310 | /* adjust timers. this is easy, as the offset is the same for all */ |
1358 | /* adjust timers. this is easy, as the offset is the same for all of them */ |
1311 | for (i = 0; i < timercnt; ++i) |
1359 | for (i = 0; i < timercnt; ++i) |
1312 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
1360 | ((WT)timers [i])->at += ev_rt_now - mn_now; |
1313 | } |
1361 | } |
1314 | |
1362 | |
1315 | mn_now = ev_rt_now; |
1363 | mn_now = ev_rt_now; |
… | |
… | |
1335 | { |
1383 | { |
1336 | loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) |
1384 | loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) |
1337 | ? EVUNLOOP_ONE |
1385 | ? EVUNLOOP_ONE |
1338 | : EVUNLOOP_CANCEL; |
1386 | : EVUNLOOP_CANCEL; |
1339 | |
1387 | |
1340 | while (activecnt) |
1388 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
|
|
1389 | |
|
|
1390 | do |
1341 | { |
1391 | { |
1342 | /* we might have forked, so reify kernel state if necessary */ |
1392 | #ifndef _WIN32 |
|
|
1393 | if (expect_false (curpid)) /* penalise the forking check even more */ |
|
|
1394 | if (expect_false (getpid () != curpid)) |
|
|
1395 | { |
|
|
1396 | curpid = getpid (); |
|
|
1397 | postfork = 1; |
|
|
1398 | } |
|
|
1399 | #endif |
|
|
1400 | |
1343 | #if EV_FORK_ENABLE |
1401 | #if EV_FORK_ENABLE |
|
|
1402 | /* we might have forked, so queue fork handlers */ |
1344 | if (expect_false (postfork)) |
1403 | if (expect_false (postfork)) |
1345 | if (forkcnt) |
1404 | if (forkcnt) |
1346 | { |
1405 | { |
1347 | queue_events (EV_A_ (W *)forks, forkcnt, EV_FORK); |
1406 | queue_events (EV_A_ (W *)forks, forkcnt, EV_FORK); |
1348 | call_pending (EV_A); |
1407 | call_pending (EV_A); |
1349 | } |
1408 | } |
1350 | #endif |
1409 | #endif |
1351 | |
1410 | |
1352 | /* queue check watchers (and execute them) */ |
1411 | /* queue check watchers (and execute them) */ |
1353 | if (expect_false (preparecnt)) |
1412 | if (expect_false (preparecnt)) |
1354 | { |
1413 | { |
1355 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1414 | queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1356 | call_pending (EV_A); |
1415 | call_pending (EV_A); |
1357 | } |
1416 | } |
1358 | |
1417 | |
|
|
1418 | if (expect_false (!activecnt)) |
|
|
1419 | break; |
|
|
1420 | |
1359 | /* we might have forked, so reify kernel state if necessary */ |
1421 | /* we might have forked, so reify kernel state if necessary */ |
1360 | if (expect_false (postfork)) |
1422 | if (expect_false (postfork)) |
1361 | loop_fork (EV_A); |
1423 | loop_fork (EV_A); |
1362 | |
1424 | |
1363 | /* update fd-related kernel structures */ |
1425 | /* update fd-related kernel structures */ |
1364 | fd_reify (EV_A); |
1426 | fd_reify (EV_A); |
1365 | |
1427 | |
1366 | /* calculate blocking time */ |
1428 | /* calculate blocking time */ |
1367 | { |
1429 | { |
1368 | double block; |
1430 | ev_tstamp block; |
1369 | |
1431 | |
1370 | if (flags & EVLOOP_NONBLOCK || idlecnt) |
1432 | if (expect_false (flags & EVLOOP_NONBLOCK || idleall || !activecnt)) |
1371 | block = 0.; /* do not block at all */ |
1433 | block = 0.; /* do not block at all */ |
1372 | else |
1434 | else |
1373 | { |
1435 | { |
1374 | /* update time to cancel out callback processing overhead */ |
1436 | /* update time to cancel out callback processing overhead */ |
1375 | #if EV_USE_MONOTONIC |
1437 | #if EV_USE_MONOTONIC |
… | |
… | |
1399 | #endif |
1461 | #endif |
1400 | |
1462 | |
1401 | if (expect_false (block < 0.)) block = 0.; |
1463 | if (expect_false (block < 0.)) block = 0.; |
1402 | } |
1464 | } |
1403 | |
1465 | |
|
|
1466 | ++loop_count; |
1404 | backend_poll (EV_A_ block); |
1467 | backend_poll (EV_A_ block); |
1405 | } |
1468 | } |
1406 | |
1469 | |
1407 | /* update ev_rt_now, do magic */ |
1470 | /* update ev_rt_now, do magic */ |
1408 | time_update (EV_A); |
1471 | time_update (EV_A); |
… | |
… | |
1411 | timers_reify (EV_A); /* relative timers called last */ |
1474 | timers_reify (EV_A); /* relative timers called last */ |
1412 | #if EV_PERIODIC_ENABLE |
1475 | #if EV_PERIODIC_ENABLE |
1413 | periodics_reify (EV_A); /* absolute timers called first */ |
1476 | periodics_reify (EV_A); /* absolute timers called first */ |
1414 | #endif |
1477 | #endif |
1415 | |
1478 | |
|
|
1479 | #if EV_IDLE_ENABLE |
1416 | /* queue idle watchers unless other events are pending */ |
1480 | /* queue idle watchers unless other events are pending */ |
1417 | if (idlecnt && !any_pending (EV_A)) |
1481 | idle_reify (EV_A); |
1418 | queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1482 | #endif |
1419 | |
1483 | |
1420 | /* queue check watchers, to be executed first */ |
1484 | /* queue check watchers, to be executed first */ |
1421 | if (expect_false (checkcnt)) |
1485 | if (expect_false (checkcnt)) |
1422 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1486 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1423 | |
1487 | |
1424 | call_pending (EV_A); |
1488 | call_pending (EV_A); |
1425 | |
1489 | |
1426 | if (expect_false (loop_done)) |
|
|
1427 | break; |
|
|
1428 | } |
1490 | } |
|
|
1491 | while (expect_true (activecnt && !loop_done)); |
1429 | |
1492 | |
1430 | if (loop_done == EVUNLOOP_ONE) |
1493 | if (loop_done == EVUNLOOP_ONE) |
1431 | loop_done = EVUNLOOP_CANCEL; |
1494 | loop_done = EVUNLOOP_CANCEL; |
1432 | } |
1495 | } |
1433 | |
1496 | |
… | |
… | |
1469 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
1532 | pendings [ABSPRI (w)][w->pending - 1].w = 0; |
1470 | w->pending = 0; |
1533 | w->pending = 0; |
1471 | } |
1534 | } |
1472 | } |
1535 | } |
1473 | |
1536 | |
|
|
1537 | void inline_size |
|
|
1538 | pri_adjust (EV_P_ W w) |
|
|
1539 | { |
|
|
1540 | int pri = w->priority; |
|
|
1541 | pri = pri < EV_MINPRI ? EV_MINPRI : pri; |
|
|
1542 | pri = pri > EV_MAXPRI ? EV_MAXPRI : pri; |
|
|
1543 | w->priority = pri; |
|
|
1544 | } |
|
|
1545 | |
1474 | void inline_speed |
1546 | void inline_speed |
1475 | ev_start (EV_P_ W w, int active) |
1547 | ev_start (EV_P_ W w, int active) |
1476 | { |
1548 | { |
1477 | if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
1549 | pri_adjust (EV_A_ w); |
1478 | if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
|
|
1479 | |
|
|
1480 | w->active = active; |
1550 | w->active = active; |
1481 | ev_ref (EV_A); |
1551 | ev_ref (EV_A); |
1482 | } |
1552 | } |
1483 | |
1553 | |
1484 | void inline_size |
1554 | void inline_size |
… | |
… | |
1718 | # endif |
1788 | # endif |
1719 | |
1789 | |
1720 | #define DEF_STAT_INTERVAL 5.0074891 |
1790 | #define DEF_STAT_INTERVAL 5.0074891 |
1721 | #define MIN_STAT_INTERVAL 0.1074891 |
1791 | #define MIN_STAT_INTERVAL 0.1074891 |
1722 | |
1792 | |
1723 | void noinline stat_timer_cb (EV_P_ ev_timer *w_, int revents); |
1793 | static void noinline stat_timer_cb (EV_P_ ev_timer *w_, int revents); |
1724 | |
1794 | |
1725 | #if EV_USE_INOTIFY |
1795 | #if EV_USE_INOTIFY |
1726 | # define EV_INOTIFY_BUFSIZE 8192 |
1796 | # define EV_INOTIFY_BUFSIZE 8192 |
1727 | |
1797 | |
1728 | static void noinline |
1798 | static void noinline |
… | |
… | |
1879 | w->attr.st_nlink = 0; |
1949 | w->attr.st_nlink = 0; |
1880 | else if (!w->attr.st_nlink) |
1950 | else if (!w->attr.st_nlink) |
1881 | w->attr.st_nlink = 1; |
1951 | w->attr.st_nlink = 1; |
1882 | } |
1952 | } |
1883 | |
1953 | |
1884 | void noinline |
1954 | static void noinline |
1885 | stat_timer_cb (EV_P_ ev_timer *w_, int revents) |
1955 | stat_timer_cb (EV_P_ ev_timer *w_, int revents) |
1886 | { |
1956 | { |
1887 | ev_stat *w = (ev_stat *)(((char *)w_) - offsetof (ev_stat, timer)); |
1957 | ev_stat *w = (ev_stat *)(((char *)w_) - offsetof (ev_stat, timer)); |
1888 | |
1958 | |
1889 | /* we copy this here each the time so that */ |
1959 | /* we copy this here each the time so that */ |
… | |
… | |
1959 | |
2029 | |
1960 | ev_stop (EV_A_ (W)w); |
2030 | ev_stop (EV_A_ (W)w); |
1961 | } |
2031 | } |
1962 | #endif |
2032 | #endif |
1963 | |
2033 | |
|
|
2034 | #if EV_IDLE_ENABLE |
1964 | void |
2035 | void |
1965 | ev_idle_start (EV_P_ ev_idle *w) |
2036 | ev_idle_start (EV_P_ ev_idle *w) |
1966 | { |
2037 | { |
1967 | if (expect_false (ev_is_active (w))) |
2038 | if (expect_false (ev_is_active (w))) |
1968 | return; |
2039 | return; |
1969 | |
2040 | |
|
|
2041 | pri_adjust (EV_A_ (W)w); |
|
|
2042 | |
|
|
2043 | { |
|
|
2044 | int active = ++idlecnt [ABSPRI (w)]; |
|
|
2045 | |
|
|
2046 | ++idleall; |
1970 | ev_start (EV_A_ (W)w, ++idlecnt); |
2047 | ev_start (EV_A_ (W)w, active); |
|
|
2048 | |
1971 | array_needsize (ev_idle *, idles, idlemax, idlecnt, EMPTY2); |
2049 | array_needsize (ev_idle *, idles [ABSPRI (w)], idlemax [ABSPRI (w)], active, EMPTY2); |
1972 | idles [idlecnt - 1] = w; |
2050 | idles [ABSPRI (w)][active - 1] = w; |
|
|
2051 | } |
1973 | } |
2052 | } |
1974 | |
2053 | |
1975 | void |
2054 | void |
1976 | ev_idle_stop (EV_P_ ev_idle *w) |
2055 | ev_idle_stop (EV_P_ ev_idle *w) |
1977 | { |
2056 | { |
… | |
… | |
1979 | if (expect_false (!ev_is_active (w))) |
2058 | if (expect_false (!ev_is_active (w))) |
1980 | return; |
2059 | return; |
1981 | |
2060 | |
1982 | { |
2061 | { |
1983 | int active = ((W)w)->active; |
2062 | int active = ((W)w)->active; |
1984 | idles [active - 1] = idles [--idlecnt]; |
2063 | |
|
|
2064 | idles [ABSPRI (w)][active - 1] = idles [ABSPRI (w)][--idlecnt [ABSPRI (w)]]; |
1985 | ((W)idles [active - 1])->active = active; |
2065 | ((W)idles [ABSPRI (w)][active - 1])->active = active; |
|
|
2066 | |
|
|
2067 | ev_stop (EV_A_ (W)w); |
|
|
2068 | --idleall; |
1986 | } |
2069 | } |
1987 | |
|
|
1988 | ev_stop (EV_A_ (W)w); |
|
|
1989 | } |
2070 | } |
|
|
2071 | #endif |
1990 | |
2072 | |
1991 | void |
2073 | void |
1992 | ev_prepare_start (EV_P_ ev_prepare *w) |
2074 | ev_prepare_start (EV_P_ ev_prepare *w) |
1993 | { |
2075 | { |
1994 | if (expect_false (ev_is_active (w))) |
2076 | if (expect_false (ev_is_active (w))) |