| … | |
… | |
| 37 | static void |
37 | static void |
| 38 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
38 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
| 39 | { |
39 | { |
| 40 | struct kevent *ke; |
40 | struct kevent *ke; |
| 41 | |
41 | |
| 42 | array_needsize (kqueue_changes, kqueue_changemax, ++kqueue_changecnt, ); |
42 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, ++kqueue_changecnt, ); |
| 43 | |
43 | |
| 44 | ke = &kqueue_changes [kqueue_changecnt - 1]; |
44 | ke = &kqueue_changes [kqueue_changecnt - 1]; |
| 45 | memset (ke, 0, sizeof (struct kevent)); |
45 | memset (ke, 0, sizeof (struct kevent)); |
| 46 | ke->ident = fd; |
46 | ke->ident = fd; |
| 47 | ke->filter = filter; |
47 | ke->filter = filter; |
| … | |
… | |
| 57 | kqueue_modify (EV_P_ int fd, int oev, int nev) |
57 | kqueue_modify (EV_P_ int fd, int oev, int nev) |
| 58 | { |
58 | { |
| 59 | if ((oev ^ nev) & EV_READ) |
59 | if ((oev ^ nev) & EV_READ) |
| 60 | { |
60 | { |
| 61 | if (nev & EV_READ) |
61 | if (nev & EV_READ) |
| 62 | kqueue_change (fd, EVFILT_READ, EV_ADD, NOTE_EOF); |
62 | kqueue_change (EV_A_ fd, EVFILT_READ, EV_ADD, NOTE_EOF); |
| 63 | else |
63 | else |
| 64 | kqueue_change (fd, EVFILT_READ, EV_DELETE, 0); |
64 | kqueue_change (EV_A_ fd, EVFILT_READ, EV_DELETE, 0); |
| 65 | } |
65 | } |
| 66 | |
66 | |
| 67 | if ((oev ^ nev) & EV_WRITE) |
67 | if ((oev ^ nev) & EV_WRITE) |
| 68 | { |
68 | { |
| 69 | if (nev & EV_WRITE) |
69 | if (nev & EV_WRITE) |
| 70 | kqueue_change (fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
70 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_ADD, NOTE_EOF); |
| 71 | else |
71 | else |
| 72 | kqueue_change (fd, EVFILT_WRITE, EV_DELETE, 0); |
72 | kqueue_change (EV_A_ fd, EVFILT_WRITE, EV_DELETE, 0); |
| 73 | } |
73 | } |
| 74 | } |
74 | } |
| 75 | |
75 | |
| 76 | static void |
76 | static void |
| 77 | kqueue_poll (EV_P_ ev_tstamp timeout) |
77 | kqueue_poll (EV_P_ ev_tstamp timeout) |
