|
|
1 | /* |
|
|
2 | * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
|
|
3 | * All rights reserved. |
|
|
4 | * |
|
|
5 | * Redistribution and use in source and binary forms, with or without |
|
|
6 | * modification, are permitted provided that the following conditions are |
|
|
7 | * met: |
|
|
8 | * |
|
|
9 | * * Redistributions of source code must retain the above copyright |
|
|
10 | * notice, this list of conditions and the following disclaimer. |
|
|
11 | * |
|
|
12 | * * Redistributions in binary form must reproduce the above |
|
|
13 | * copyright notice, this list of conditions and the following |
|
|
14 | * disclaimer in the documentation and/or other materials provided |
|
|
15 | * with the distribution. |
|
|
16 | * |
|
|
17 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
|
18 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
|
|
19 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
|
|
20 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
|
|
21 | * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
|
|
22 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
|
|
23 | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
|
|
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
|
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
|
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
|
27 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
28 | */ |
|
|
29 | |
| 1 | #include <math.h> |
30 | #include <math.h> |
| 2 | #include <stdlib.h> |
31 | #include <stdlib.h> |
| 3 | #include <unistd.h> |
32 | #include <unistd.h> |
| 4 | #include <fcntl.h> |
33 | #include <fcntl.h> |
| 5 | #include <signal.h> |
34 | #include <signal.h> |
| … | |
… | |
| 387 | } |
416 | } |
| 388 | |
417 | |
| 389 | static void |
418 | static void |
| 390 | call_pending () |
419 | call_pending () |
| 391 | { |
420 | { |
| 392 | int i; |
421 | while (pendingcnt) |
| 393 | |
|
|
| 394 | for (i = 0; i < pendingcnt; ++i) |
|
|
| 395 | { |
422 | { |
| 396 | ANPENDING *p = pendings + i; |
423 | ANPENDING *p = pendings + --pendingcnt; |
| 397 | |
424 | |
| 398 | if (p->w) |
425 | if (p->w) |
| 399 | { |
426 | { |
| 400 | p->w->pending = 0; |
427 | p->w->pending = 0; |
| 401 | p->w->cb (p->w, p->events); |
428 | p->w->cb (p->w, p->events); |
| 402 | } |
429 | } |
| 403 | } |
430 | } |
| 404 | |
|
|
| 405 | pendingcnt = 0; |
|
|
| 406 | } |
431 | } |
| 407 | |
432 | |
| 408 | static void |
433 | static void |
| 409 | timers_reify () |
434 | timers_reify () |
| 410 | { |
435 | { |
