1 | /* |
1 | /* |
2 | * libev kqueue backend |
2 | * libev kqueue backend |
3 | * |
3 | * |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013 Marc Alexander Lehmann <libev@schmorp.de> |
4 | * Copyright (c) 2007,2008,2009,2010,2011,2012,2013,2016,2019 Marc Alexander Lehmann <libev@schmorp.de> |
5 | * All rights reserved. |
5 | * All rights reserved. |
6 | * |
6 | * |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
7 | * Redistribution and use in source and binary forms, with or without modifica- |
8 | * tion, are permitted provided that the following conditions are met: |
8 | * tion, are permitted provided that the following conditions are met: |
9 | * |
9 | * |
… | |
… | |
41 | #include <sys/time.h> |
41 | #include <sys/time.h> |
42 | #include <sys/event.h> |
42 | #include <sys/event.h> |
43 | #include <string.h> |
43 | #include <string.h> |
44 | #include <errno.h> |
44 | #include <errno.h> |
45 | |
45 | |
46 | void inline_speed |
46 | inline_speed |
|
|
47 | void |
47 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
48 | kqueue_change (EV_P_ int fd, int filter, int flags, int fflags) |
48 | { |
49 | { |
49 | ++kqueue_changecnt; |
50 | ++kqueue_changecnt; |
50 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, EMPTY2); |
51 | array_needsize (struct kevent, kqueue_changes, kqueue_changemax, kqueue_changecnt, array_needsize_noinit); |
51 | |
52 | |
52 | EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
53 | EV_SET (&kqueue_changes [kqueue_changecnt - 1], fd, filter, flags, fflags, 0, 0); |
53 | } |
54 | } |
54 | |
55 | |
55 | /* OS X at least needs this */ |
56 | /* OS X at least needs this */ |
… | |
… | |
100 | EV_TS_SET (ts, timeout); |
101 | EV_TS_SET (ts, timeout); |
101 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
102 | res = kevent (backend_fd, kqueue_changes, kqueue_changecnt, kqueue_events, kqueue_eventmax, &ts); |
102 | EV_ACQUIRE_CB; |
103 | EV_ACQUIRE_CB; |
103 | kqueue_changecnt = 0; |
104 | kqueue_changecnt = 0; |
104 | |
105 | |
105 | if (expect_false (res < 0)) |
106 | if (ecb_expect_false (res < 0)) |
106 | { |
107 | { |
107 | if (errno != EINTR) |
108 | if (errno != EINTR) |
108 | ev_syserr ("(libev) kevent"); |
109 | ev_syserr ("(libev) kqueue kevent"); |
109 | |
110 | |
110 | return; |
111 | return; |
111 | } |
112 | } |
112 | |
113 | |
113 | for (i = 0; i < res; ++i) |
114 | for (i = 0; i < res; ++i) |
114 | { |
115 | { |
115 | int fd = kqueue_events [i].ident; |
116 | int fd = kqueue_events [i].ident; |
116 | |
117 | |
117 | if (expect_false (kqueue_events [i].flags & EV_ERROR)) |
118 | if (ecb_expect_false (kqueue_events [i].flags & EV_ERROR)) |
118 | { |
119 | { |
119 | int err = kqueue_events [i].data; |
120 | int err = kqueue_events [i].data; |
120 | |
121 | |
121 | /* we are only interested in errors for fds that we are interested in :) */ |
122 | /* we are only interested in errors for fds that we are interested in :) */ |
122 | if (anfds [fd].events) |
123 | if (anfds [fd].events) |
… | |
… | |
126 | else if (err == EBADF) /* on EBADF, we re-check the fd */ |
127 | else if (err == EBADF) /* on EBADF, we re-check the fd */ |
127 | { |
128 | { |
128 | if (fd_valid (fd)) |
129 | if (fd_valid (fd)) |
129 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
130 | kqueue_modify (EV_A_ fd, 0, anfds [fd].events); |
130 | else |
131 | else |
|
|
132 | { |
|
|
133 | assert (("libev: kqueue found invalid fd", 0)); |
131 | fd_kill (EV_A_ fd); |
134 | fd_kill (EV_A_ fd); |
|
|
135 | } |
132 | } |
136 | } |
133 | else /* on all other errors, we error out on the fd */ |
137 | else /* on all other errors, we error out on the fd */ |
|
|
138 | { |
|
|
139 | assert (("libev: kqueue found invalid fd", 0)); |
134 | fd_kill (EV_A_ fd); |
140 | fd_kill (EV_A_ fd); |
|
|
141 | } |
135 | } |
142 | } |
136 | } |
143 | } |
137 | else |
144 | else |
138 | fd_event ( |
145 | fd_event ( |
139 | EV_A_ |
146 | EV_A_ |
… | |
… | |
142 | : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE |
149 | : kqueue_events [i].filter == EVFILT_WRITE ? EV_WRITE |
143 | : 0 |
150 | : 0 |
144 | ); |
151 | ); |
145 | } |
152 | } |
146 | |
153 | |
147 | if (expect_false (res == kqueue_eventmax)) |
154 | if (ecb_expect_false (res == kqueue_eventmax)) |
148 | { |
155 | { |
149 | ev_free (kqueue_events); |
156 | ev_free (kqueue_events); |
150 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
157 | kqueue_eventmax = array_nextsize (sizeof (struct kevent), kqueue_eventmax, kqueue_eventmax + 1); |
151 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
158 | kqueue_events = (struct kevent *)ev_malloc (sizeof (struct kevent) * kqueue_eventmax); |
152 | } |
159 | } |
153 | } |
160 | } |
154 | |
161 | |
155 | int inline_size |
162 | inline_size |
|
|
163 | int |
156 | kqueue_init (EV_P_ int flags) |
164 | kqueue_init (EV_P_ int flags) |
157 | { |
165 | { |
158 | /* initialize the kernel queue */ |
166 | /* initialize the kernel queue */ |
159 | kqueue_fd_pid = getpid (); |
167 | kqueue_fd_pid = getpid (); |
160 | if ((backend_fd = kqueue ()) < 0) |
168 | if ((backend_fd = kqueue ()) < 0) |
… | |
… | |
174 | kqueue_changecnt = 0; |
182 | kqueue_changecnt = 0; |
175 | |
183 | |
176 | return EVBACKEND_KQUEUE; |
184 | return EVBACKEND_KQUEUE; |
177 | } |
185 | } |
178 | |
186 | |
179 | void inline_size |
187 | inline_size |
|
|
188 | void |
180 | kqueue_destroy (EV_P) |
189 | kqueue_destroy (EV_P) |
181 | { |
190 | { |
182 | ev_free (kqueue_events); |
191 | ev_free (kqueue_events); |
183 | ev_free (kqueue_changes); |
192 | ev_free (kqueue_changes); |
184 | } |
193 | } |
185 | |
194 | |
186 | void inline_size |
195 | inline_size |
|
|
196 | void |
187 | kqueue_fork (EV_P) |
197 | kqueue_fork (EV_P) |
188 | { |
198 | { |
189 | /* some BSD kernels don't just destroy the kqueue itself, |
199 | /* some BSD kernels don't just destroy the kqueue itself, |
190 | * but also close the fd, which isn't documented, and |
200 | * but also close the fd, which isn't documented, and |
191 | * impossible to support properly. |
201 | * impossible to support properly. |