| … | |
… | |
| 1342 | ? EVUNLOOP_ONE |
1342 | ? EVUNLOOP_ONE |
| 1343 | : EVUNLOOP_CANCEL; |
1343 | : EVUNLOOP_CANCEL; |
| 1344 | |
1344 | |
| 1345 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
1345 | call_pending (EV_A); /* in case we recurse, ensure ordering stays nice and clean */ |
| 1346 | |
1346 | |
| 1347 | while (expect_false (!activecnt)) |
1347 | do |
| 1348 | { |
1348 | { |
| 1349 | #ifndef _WIN32 |
1349 | #ifndef _WIN32 |
| 1350 | if (expect_false (curpid)) /* penalise the forking check even more */ |
1350 | if (expect_false (curpid)) /* penalise the forking check even more */ |
| 1351 | if (expect_false (getpid () != curpid)) |
1351 | if (expect_false (getpid () != curpid)) |
| 1352 | { |
1352 | { |
| … | |
… | |
| 1440 | if (expect_false (checkcnt)) |
1440 | if (expect_false (checkcnt)) |
| 1441 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1441 | queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
| 1442 | |
1442 | |
| 1443 | call_pending (EV_A); |
1443 | call_pending (EV_A); |
| 1444 | |
1444 | |
| 1445 | if (expect_false (loop_done)) |
|
|
| 1446 | break; |
|
|
| 1447 | } |
1445 | } |
|
|
1446 | while (expect_true (activecnt && !loop_done)); |
| 1448 | |
1447 | |
| 1449 | if (loop_done == EVUNLOOP_ONE) |
1448 | if (loop_done == EVUNLOOP_ONE) |
| 1450 | loop_done = EVUNLOOP_CANCEL; |
1449 | loop_done = EVUNLOOP_CANCEL; |
| 1451 | } |
1450 | } |
| 1452 | |
1451 | |
