1 |
root |
1.17 |
/* |
2 |
root |
1.36 |
* libev event processing core, watcher management |
3 |
|
|
* |
4 |
root |
1.17 |
* Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> |
5 |
|
|
* All rights reserved. |
6 |
|
|
* |
7 |
|
|
* Redistribution and use in source and binary forms, with or without |
8 |
|
|
* modification, are permitted provided that the following conditions are |
9 |
|
|
* met: |
10 |
|
|
* |
11 |
|
|
* * Redistributions of source code must retain the above copyright |
12 |
|
|
* notice, this list of conditions and the following disclaimer. |
13 |
|
|
* |
14 |
|
|
* * Redistributions in binary form must reproduce the above |
15 |
|
|
* copyright notice, this list of conditions and the following |
16 |
|
|
* disclaimer in the documentation and/or other materials provided |
17 |
|
|
* with the distribution. |
18 |
|
|
* |
19 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
20 |
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
21 |
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
22 |
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
23 |
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
24 |
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
25 |
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
26 |
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
27 |
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
28 |
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
29 |
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
30 |
|
|
*/ |
31 |
root |
1.87 |
|
32 |
|
|
#ifdef __cplusplus |
33 |
|
|
extern "C" { |
34 |
|
|
#endif |
35 |
|
|
|
36 |
root |
1.59 |
#ifndef EV_STANDALONE |
37 |
root |
1.29 |
# include "config.h" |
38 |
root |
1.60 |
|
39 |
|
|
# if HAVE_CLOCK_GETTIME |
40 |
root |
1.97 |
# ifndef EV_USE_MONOTONIC |
41 |
|
|
# define EV_USE_MONOTONIC 1 |
42 |
|
|
# endif |
43 |
|
|
# ifndef EV_USE_REALTIME |
44 |
|
|
# define EV_USE_REALTIME 1 |
45 |
|
|
# endif |
46 |
root |
1.60 |
# endif |
47 |
|
|
|
48 |
root |
1.96 |
# if HAVE_SELECT && HAVE_SYS_SELECT_H && !defined (EV_USE_SELECT) |
49 |
root |
1.60 |
# define EV_USE_SELECT 1 |
50 |
|
|
# endif |
51 |
|
|
|
52 |
root |
1.96 |
# if HAVE_POLL && HAVE_POLL_H && !defined (EV_USE_POLL) |
53 |
root |
1.60 |
# define EV_USE_POLL 1 |
54 |
|
|
# endif |
55 |
|
|
|
56 |
root |
1.96 |
# if HAVE_EPOLL && HAVE_EPOLL_CTL && HAVE_SYS_EPOLL_H && !defined (EV_USE_EPOLL) |
57 |
root |
1.60 |
# define EV_USE_EPOLL 1 |
58 |
|
|
# endif |
59 |
|
|
|
60 |
root |
1.96 |
# if HAVE_KQUEUE && HAVE_SYS_EVENT_H && HAVE_SYS_QUEUE_H && !defined (EV_USE_KQUEUE) |
61 |
root |
1.60 |
# define EV_USE_KQUEUE 1 |
62 |
|
|
# endif |
63 |
|
|
|
64 |
root |
1.29 |
#endif |
65 |
root |
1.17 |
|
66 |
root |
1.1 |
#include <math.h> |
67 |
|
|
#include <stdlib.h> |
68 |
root |
1.7 |
#include <fcntl.h> |
69 |
root |
1.16 |
#include <stddef.h> |
70 |
root |
1.1 |
|
71 |
|
|
#include <stdio.h> |
72 |
|
|
|
73 |
root |
1.4 |
#include <assert.h> |
74 |
root |
1.1 |
#include <errno.h> |
75 |
root |
1.22 |
#include <sys/types.h> |
76 |
root |
1.71 |
#include <time.h> |
77 |
|
|
|
78 |
root |
1.72 |
#include <signal.h> |
79 |
root |
1.71 |
|
80 |
root |
1.45 |
#ifndef WIN32 |
81 |
root |
1.71 |
# include <unistd.h> |
82 |
|
|
# include <sys/time.h> |
83 |
root |
1.45 |
# include <sys/wait.h> |
84 |
|
|
#endif |
85 |
root |
1.40 |
/**/ |
86 |
|
|
|
87 |
root |
1.29 |
#ifndef EV_USE_MONOTONIC |
88 |
root |
1.37 |
# define EV_USE_MONOTONIC 1 |
89 |
|
|
#endif |
90 |
|
|
|
91 |
root |
1.29 |
#ifndef EV_USE_SELECT |
92 |
|
|
# define EV_USE_SELECT 1 |
93 |
root |
1.10 |
#endif |
94 |
|
|
|
95 |
root |
1.59 |
#ifndef EV_USE_POLL |
96 |
|
|
# define EV_USE_POLL 0 /* poll is usually slower than select, and not as well tested */ |
97 |
root |
1.41 |
#endif |
98 |
|
|
|
99 |
root |
1.29 |
#ifndef EV_USE_EPOLL |
100 |
|
|
# define EV_USE_EPOLL 0 |
101 |
root |
1.10 |
#endif |
102 |
|
|
|
103 |
root |
1.44 |
#ifndef EV_USE_KQUEUE |
104 |
|
|
# define EV_USE_KQUEUE 0 |
105 |
|
|
#endif |
106 |
|
|
|
107 |
root |
1.62 |
#ifndef EV_USE_WIN32 |
108 |
|
|
# ifdef WIN32 |
109 |
root |
1.71 |
# define EV_USE_WIN32 0 /* it does not exist, use select */ |
110 |
|
|
# undef EV_USE_SELECT |
111 |
|
|
# define EV_USE_SELECT 1 |
112 |
root |
1.62 |
# else |
113 |
|
|
# define EV_USE_WIN32 0 |
114 |
|
|
# endif |
115 |
|
|
#endif |
116 |
|
|
|
117 |
root |
1.40 |
#ifndef EV_USE_REALTIME |
118 |
|
|
# define EV_USE_REALTIME 1 |
119 |
|
|
#endif |
120 |
|
|
|
121 |
|
|
/**/ |
122 |
|
|
|
123 |
|
|
#ifndef CLOCK_MONOTONIC |
124 |
|
|
# undef EV_USE_MONOTONIC |
125 |
|
|
# define EV_USE_MONOTONIC 0 |
126 |
|
|
#endif |
127 |
|
|
|
128 |
root |
1.31 |
#ifndef CLOCK_REALTIME |
129 |
root |
1.40 |
# undef EV_USE_REALTIME |
130 |
root |
1.31 |
# define EV_USE_REALTIME 0 |
131 |
|
|
#endif |
132 |
root |
1.40 |
|
133 |
|
|
/**/ |
134 |
root |
1.1 |
|
135 |
root |
1.4 |
#define MIN_TIMEJUMP 1. /* minimum timejump that gets detected (if monotonic clock available) */ |
136 |
root |
1.40 |
#define MAX_BLOCKTIME 59.731 /* never wait longer than this time (to detect time jumps) */ |
137 |
root |
1.31 |
#define PID_HASHSIZE 16 /* size of pid hash table, must be power of two */ |
138 |
root |
1.40 |
/*#define CLEANUP_INTERVAL 300. /* how often to try to free memory and re-check fds */ |
139 |
root |
1.1 |
|
140 |
root |
1.81 |
#ifdef EV_H |
141 |
|
|
# include EV_H |
142 |
|
|
#else |
143 |
|
|
# include "ev.h" |
144 |
|
|
#endif |
145 |
root |
1.1 |
|
146 |
root |
1.40 |
#if __GNUC__ >= 3 |
147 |
|
|
# define expect(expr,value) __builtin_expect ((expr),(value)) |
148 |
|
|
# define inline inline |
149 |
|
|
#else |
150 |
|
|
# define expect(expr,value) (expr) |
151 |
|
|
# define inline static |
152 |
|
|
#endif |
153 |
|
|
|
154 |
|
|
#define expect_false(expr) expect ((expr) != 0, 0) |
155 |
|
|
#define expect_true(expr) expect ((expr) != 0, 1) |
156 |
|
|
|
157 |
root |
1.42 |
#define NUMPRI (EV_MAXPRI - EV_MINPRI + 1) |
158 |
|
|
#define ABSPRI(w) ((w)->priority - EV_MINPRI) |
159 |
|
|
|
160 |
root |
1.10 |
typedef struct ev_watcher *W; |
161 |
|
|
typedef struct ev_watcher_list *WL; |
162 |
root |
1.12 |
typedef struct ev_watcher_time *WT; |
163 |
root |
1.10 |
|
164 |
root |
1.54 |
static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ |
165 |
|
|
|
166 |
root |
1.98 |
#ifdef WIN32 |
167 |
|
|
# include "ev_win32.c" |
168 |
|
|
#endif |
169 |
root |
1.67 |
|
170 |
root |
1.53 |
/*****************************************************************************/ |
171 |
root |
1.1 |
|
172 |
root |
1.70 |
static void (*syserr_cb)(const char *msg); |
173 |
root |
1.69 |
|
174 |
root |
1.70 |
void ev_set_syserr_cb (void (*cb)(const char *msg)) |
175 |
root |
1.69 |
{ |
176 |
|
|
syserr_cb = cb; |
177 |
|
|
} |
178 |
|
|
|
179 |
|
|
static void |
180 |
root |
1.70 |
syserr (const char *msg) |
181 |
root |
1.69 |
{ |
182 |
root |
1.70 |
if (!msg) |
183 |
|
|
msg = "(libev) system error"; |
184 |
|
|
|
185 |
root |
1.69 |
if (syserr_cb) |
186 |
root |
1.70 |
syserr_cb (msg); |
187 |
root |
1.69 |
else |
188 |
|
|
{ |
189 |
root |
1.70 |
perror (msg); |
190 |
root |
1.69 |
abort (); |
191 |
|
|
} |
192 |
|
|
} |
193 |
|
|
|
194 |
|
|
static void *(*alloc)(void *ptr, long size); |
195 |
|
|
|
196 |
|
|
void ev_set_allocator (void *(*cb)(void *ptr, long size)) |
197 |
|
|
{ |
198 |
|
|
alloc = cb; |
199 |
|
|
} |
200 |
|
|
|
201 |
|
|
static void * |
202 |
|
|
ev_realloc (void *ptr, long size) |
203 |
|
|
{ |
204 |
|
|
ptr = alloc ? alloc (ptr, size) : realloc (ptr, size); |
205 |
|
|
|
206 |
|
|
if (!ptr && size) |
207 |
|
|
{ |
208 |
|
|
fprintf (stderr, "libev: cannot allocate %ld bytes, aborting.", size); |
209 |
|
|
abort (); |
210 |
|
|
} |
211 |
|
|
|
212 |
|
|
return ptr; |
213 |
|
|
} |
214 |
|
|
|
215 |
|
|
#define ev_malloc(size) ev_realloc (0, (size)) |
216 |
|
|
#define ev_free(ptr) ev_realloc ((ptr), 0) |
217 |
|
|
|
218 |
|
|
/*****************************************************************************/ |
219 |
|
|
|
220 |
root |
1.53 |
typedef struct |
221 |
|
|
{ |
222 |
root |
1.68 |
WL head; |
223 |
root |
1.53 |
unsigned char events; |
224 |
|
|
unsigned char reify; |
225 |
|
|
} ANFD; |
226 |
root |
1.1 |
|
227 |
root |
1.53 |
typedef struct |
228 |
|
|
{ |
229 |
|
|
W w; |
230 |
|
|
int events; |
231 |
|
|
} ANPENDING; |
232 |
root |
1.51 |
|
233 |
root |
1.55 |
#if EV_MULTIPLICITY |
234 |
root |
1.54 |
|
235 |
root |
1.80 |
struct ev_loop |
236 |
|
|
{ |
237 |
root |
1.86 |
ev_tstamp ev_rt_now; |
238 |
root |
1.80 |
#define VAR(name,decl) decl; |
239 |
|
|
#include "ev_vars.h" |
240 |
|
|
#undef VAR |
241 |
|
|
}; |
242 |
|
|
#include "ev_wrap.h" |
243 |
|
|
|
244 |
|
|
struct ev_loop default_loop_struct; |
245 |
|
|
static struct ev_loop *default_loop; |
246 |
root |
1.54 |
|
247 |
root |
1.53 |
#else |
248 |
root |
1.54 |
|
249 |
root |
1.86 |
ev_tstamp ev_rt_now; |
250 |
root |
1.80 |
#define VAR(name,decl) static decl; |
251 |
|
|
#include "ev_vars.h" |
252 |
|
|
#undef VAR |
253 |
|
|
|
254 |
|
|
static int default_loop; |
255 |
root |
1.54 |
|
256 |
root |
1.51 |
#endif |
257 |
root |
1.1 |
|
258 |
root |
1.8 |
/*****************************************************************************/ |
259 |
|
|
|
260 |
root |
1.92 |
ev_tstamp |
261 |
root |
1.1 |
ev_time (void) |
262 |
|
|
{ |
263 |
root |
1.29 |
#if EV_USE_REALTIME |
264 |
root |
1.1 |
struct timespec ts; |
265 |
|
|
clock_gettime (CLOCK_REALTIME, &ts); |
266 |
|
|
return ts.tv_sec + ts.tv_nsec * 1e-9; |
267 |
|
|
#else |
268 |
|
|
struct timeval tv; |
269 |
|
|
gettimeofday (&tv, 0); |
270 |
|
|
return tv.tv_sec + tv.tv_usec * 1e-6; |
271 |
|
|
#endif |
272 |
|
|
} |
273 |
|
|
|
274 |
root |
1.51 |
inline ev_tstamp |
275 |
root |
1.1 |
get_clock (void) |
276 |
|
|
{ |
277 |
root |
1.29 |
#if EV_USE_MONOTONIC |
278 |
root |
1.40 |
if (expect_true (have_monotonic)) |
279 |
root |
1.1 |
{ |
280 |
|
|
struct timespec ts; |
281 |
|
|
clock_gettime (CLOCK_MONOTONIC, &ts); |
282 |
|
|
return ts.tv_sec + ts.tv_nsec * 1e-9; |
283 |
|
|
} |
284 |
|
|
#endif |
285 |
|
|
|
286 |
|
|
return ev_time (); |
287 |
|
|
} |
288 |
|
|
|
289 |
root |
1.85 |
#if EV_MULTIPLICITY |
290 |
root |
1.51 |
ev_tstamp |
291 |
|
|
ev_now (EV_P) |
292 |
|
|
{ |
293 |
root |
1.85 |
return ev_rt_now; |
294 |
root |
1.51 |
} |
295 |
root |
1.85 |
#endif |
296 |
root |
1.51 |
|
297 |
root |
1.74 |
#define array_roundsize(type,n) ((n) | 4 & ~3) |
298 |
root |
1.29 |
|
299 |
root |
1.74 |
#define array_needsize(type,base,cur,cnt,init) \ |
300 |
root |
1.69 |
if (expect_false ((cnt) > cur)) \ |
301 |
|
|
{ \ |
302 |
|
|
int newcnt = cur; \ |
303 |
|
|
do \ |
304 |
|
|
{ \ |
305 |
root |
1.74 |
newcnt = array_roundsize (type, newcnt << 1); \ |
306 |
root |
1.69 |
} \ |
307 |
|
|
while ((cnt) > newcnt); \ |
308 |
|
|
\ |
309 |
root |
1.74 |
base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\ |
310 |
root |
1.69 |
init (base + cur, newcnt - cur); \ |
311 |
|
|
cur = newcnt; \ |
312 |
root |
1.1 |
} |
313 |
|
|
|
314 |
root |
1.74 |
#define array_slim(type,stem) \ |
315 |
root |
1.67 |
if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ |
316 |
|
|
{ \ |
317 |
|
|
stem ## max = array_roundsize (stem ## cnt >> 1); \ |
318 |
root |
1.74 |
base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\ |
319 |
root |
1.67 |
fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ |
320 |
|
|
} |
321 |
|
|
|
322 |
root |
1.71 |
/* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ |
323 |
|
|
/* bringing us everlasting joy in form of stupid extra macros that are not required in C */ |
324 |
|
|
#define array_free_microshit(stem) \ |
325 |
|
|
ev_free (stem ## s); stem ## cnt = stem ## max = 0; |
326 |
|
|
|
327 |
root |
1.65 |
#define array_free(stem, idx) \ |
328 |
root |
1.69 |
ev_free (stem ## s idx); stem ## cnt idx = stem ## max idx = 0; |
329 |
root |
1.65 |
|
330 |
root |
1.8 |
/*****************************************************************************/ |
331 |
|
|
|
332 |
root |
1.1 |
static void |
333 |
|
|
anfds_init (ANFD *base, int count) |
334 |
|
|
{ |
335 |
|
|
while (count--) |
336 |
|
|
{ |
337 |
root |
1.27 |
base->head = 0; |
338 |
|
|
base->events = EV_NONE; |
339 |
root |
1.33 |
base->reify = 0; |
340 |
|
|
|
341 |
root |
1.1 |
++base; |
342 |
|
|
} |
343 |
|
|
} |
344 |
|
|
|
345 |
root |
1.78 |
void |
346 |
|
|
ev_feed_event (EV_P_ void *w, int revents) |
347 |
root |
1.1 |
{ |
348 |
root |
1.78 |
W w_ = (W)w; |
349 |
|
|
|
350 |
|
|
if (w_->pending) |
351 |
root |
1.32 |
{ |
352 |
root |
1.78 |
pendings [ABSPRI (w_)][w_->pending - 1].events |= revents; |
353 |
root |
1.32 |
return; |
354 |
|
|
} |
355 |
|
|
|
356 |
root |
1.78 |
w_->pending = ++pendingcnt [ABSPRI (w_)]; |
357 |
|
|
array_needsize (ANPENDING, pendings [ABSPRI (w_)], pendingmax [ABSPRI (w_)], pendingcnt [ABSPRI (w_)], (void)); |
358 |
|
|
pendings [ABSPRI (w_)][w_->pending - 1].w = w_; |
359 |
|
|
pendings [ABSPRI (w_)][w_->pending - 1].events = revents; |
360 |
root |
1.1 |
} |
361 |
|
|
|
362 |
|
|
static void |
363 |
root |
1.51 |
queue_events (EV_P_ W *events, int eventcnt, int type) |
364 |
root |
1.27 |
{ |
365 |
|
|
int i; |
366 |
|
|
|
367 |
|
|
for (i = 0; i < eventcnt; ++i) |
368 |
root |
1.78 |
ev_feed_event (EV_A_ events [i], type); |
369 |
root |
1.27 |
} |
370 |
|
|
|
371 |
root |
1.79 |
inline void |
372 |
|
|
fd_event (EV_P_ int fd, int revents) |
373 |
root |
1.1 |
{ |
374 |
|
|
ANFD *anfd = anfds + fd; |
375 |
|
|
struct ev_io *w; |
376 |
|
|
|
377 |
root |
1.50 |
for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
378 |
root |
1.1 |
{ |
379 |
root |
1.79 |
int ev = w->events & revents; |
380 |
root |
1.1 |
|
381 |
|
|
if (ev) |
382 |
root |
1.78 |
ev_feed_event (EV_A_ (W)w, ev); |
383 |
root |
1.1 |
} |
384 |
|
|
} |
385 |
|
|
|
386 |
root |
1.79 |
void |
387 |
|
|
ev_feed_fd_event (EV_P_ int fd, int revents) |
388 |
|
|
{ |
389 |
|
|
fd_event (EV_A_ fd, revents); |
390 |
|
|
} |
391 |
|
|
|
392 |
root |
1.27 |
/*****************************************************************************/ |
393 |
|
|
|
394 |
root |
1.9 |
static void |
395 |
root |
1.51 |
fd_reify (EV_P) |
396 |
root |
1.9 |
{ |
397 |
|
|
int i; |
398 |
|
|
|
399 |
root |
1.27 |
for (i = 0; i < fdchangecnt; ++i) |
400 |
|
|
{ |
401 |
|
|
int fd = fdchanges [i]; |
402 |
|
|
ANFD *anfd = anfds + fd; |
403 |
|
|
struct ev_io *w; |
404 |
|
|
|
405 |
|
|
int events = 0; |
406 |
|
|
|
407 |
root |
1.50 |
for (w = (struct ev_io *)anfd->head; w; w = (struct ev_io *)((WL)w)->next) |
408 |
root |
1.27 |
events |= w->events; |
409 |
|
|
|
410 |
root |
1.33 |
anfd->reify = 0; |
411 |
root |
1.27 |
|
412 |
root |
1.64 |
method_modify (EV_A_ fd, anfd->events, events); |
413 |
|
|
anfd->events = events; |
414 |
root |
1.27 |
} |
415 |
|
|
|
416 |
|
|
fdchangecnt = 0; |
417 |
|
|
} |
418 |
|
|
|
419 |
|
|
static void |
420 |
root |
1.51 |
fd_change (EV_P_ int fd) |
421 |
root |
1.27 |
{ |
422 |
root |
1.70 |
if (anfds [fd].reify) |
423 |
root |
1.27 |
return; |
424 |
|
|
|
425 |
root |
1.33 |
anfds [fd].reify = 1; |
426 |
root |
1.27 |
|
427 |
|
|
++fdchangecnt; |
428 |
root |
1.74 |
array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void)); |
429 |
root |
1.27 |
fdchanges [fdchangecnt - 1] = fd; |
430 |
root |
1.9 |
} |
431 |
|
|
|
432 |
root |
1.41 |
static void |
433 |
root |
1.51 |
fd_kill (EV_P_ int fd) |
434 |
root |
1.41 |
{ |
435 |
|
|
struct ev_io *w; |
436 |
|
|
|
437 |
root |
1.50 |
while ((w = (struct ev_io *)anfds [fd].head)) |
438 |
root |
1.41 |
{ |
439 |
root |
1.51 |
ev_io_stop (EV_A_ w); |
440 |
root |
1.78 |
ev_feed_event (EV_A_ (W)w, EV_ERROR | EV_READ | EV_WRITE); |
441 |
root |
1.41 |
} |
442 |
|
|
} |
443 |
|
|
|
444 |
root |
1.71 |
static int |
445 |
|
|
fd_valid (int fd) |
446 |
|
|
{ |
447 |
|
|
#ifdef WIN32 |
448 |
|
|
return !!win32_get_osfhandle (fd); |
449 |
|
|
#else |
450 |
|
|
return fcntl (fd, F_GETFD) != -1; |
451 |
|
|
#endif |
452 |
|
|
} |
453 |
|
|
|
454 |
root |
1.19 |
/* called on EBADF to verify fds */ |
455 |
|
|
static void |
456 |
root |
1.51 |
fd_ebadf (EV_P) |
457 |
root |
1.19 |
{ |
458 |
|
|
int fd; |
459 |
|
|
|
460 |
|
|
for (fd = 0; fd < anfdmax; ++fd) |
461 |
root |
1.27 |
if (anfds [fd].events) |
462 |
root |
1.71 |
if (!fd_valid (fd) == -1 && errno == EBADF) |
463 |
root |
1.51 |
fd_kill (EV_A_ fd); |
464 |
root |
1.41 |
} |
465 |
|
|
|
466 |
|
|
/* called on ENOMEM in select/poll to kill some fds and retry */ |
467 |
|
|
static void |
468 |
root |
1.51 |
fd_enomem (EV_P) |
469 |
root |
1.41 |
{ |
470 |
root |
1.62 |
int fd; |
471 |
root |
1.41 |
|
472 |
root |
1.62 |
for (fd = anfdmax; fd--; ) |
473 |
root |
1.41 |
if (anfds [fd].events) |
474 |
|
|
{ |
475 |
root |
1.51 |
fd_kill (EV_A_ fd); |
476 |
root |
1.41 |
return; |
477 |
|
|
} |
478 |
root |
1.19 |
} |
479 |
|
|
|
480 |
root |
1.70 |
/* usually called after fork if method needs to re-arm all fds from scratch */ |
481 |
root |
1.56 |
static void |
482 |
|
|
fd_rearm_all (EV_P) |
483 |
|
|
{ |
484 |
|
|
int fd; |
485 |
|
|
|
486 |
|
|
/* this should be highly optimised to not do anything but set a flag */ |
487 |
|
|
for (fd = 0; fd < anfdmax; ++fd) |
488 |
|
|
if (anfds [fd].events) |
489 |
|
|
{ |
490 |
|
|
anfds [fd].events = 0; |
491 |
root |
1.60 |
fd_change (EV_A_ fd); |
492 |
root |
1.56 |
} |
493 |
|
|
} |
494 |
|
|
|
495 |
root |
1.8 |
/*****************************************************************************/ |
496 |
|
|
|
497 |
root |
1.1 |
static void |
498 |
root |
1.54 |
upheap (WT *heap, int k) |
499 |
root |
1.1 |
{ |
500 |
root |
1.54 |
WT w = heap [k]; |
501 |
root |
1.1 |
|
502 |
root |
1.54 |
while (k && heap [k >> 1]->at > w->at) |
503 |
root |
1.1 |
{ |
504 |
root |
1.54 |
heap [k] = heap [k >> 1]; |
505 |
root |
1.62 |
((W)heap [k])->active = k + 1; |
506 |
root |
1.1 |
k >>= 1; |
507 |
|
|
} |
508 |
|
|
|
509 |
root |
1.54 |
heap [k] = w; |
510 |
root |
1.62 |
((W)heap [k])->active = k + 1; |
511 |
root |
1.1 |
|
512 |
|
|
} |
513 |
|
|
|
514 |
|
|
static void |
515 |
root |
1.54 |
downheap (WT *heap, int N, int k) |
516 |
root |
1.1 |
{ |
517 |
root |
1.54 |
WT w = heap [k]; |
518 |
root |
1.1 |
|
519 |
root |
1.4 |
while (k < (N >> 1)) |
520 |
root |
1.1 |
{ |
521 |
|
|
int j = k << 1; |
522 |
|
|
|
523 |
root |
1.54 |
if (j + 1 < N && heap [j]->at > heap [j + 1]->at) |
524 |
root |
1.1 |
++j; |
525 |
|
|
|
526 |
root |
1.54 |
if (w->at <= heap [j]->at) |
527 |
root |
1.1 |
break; |
528 |
|
|
|
529 |
root |
1.54 |
heap [k] = heap [j]; |
530 |
root |
1.62 |
((W)heap [k])->active = k + 1; |
531 |
root |
1.1 |
k = j; |
532 |
|
|
} |
533 |
|
|
|
534 |
root |
1.54 |
heap [k] = w; |
535 |
root |
1.62 |
((W)heap [k])->active = k + 1; |
536 |
root |
1.1 |
} |
537 |
|
|
|
538 |
root |
1.84 |
inline void |
539 |
|
|
adjustheap (WT *heap, int N, int k, ev_tstamp at) |
540 |
|
|
{ |
541 |
|
|
ev_tstamp old_at = heap [k]->at; |
542 |
|
|
heap [k]->at = at; |
543 |
|
|
|
544 |
|
|
if (old_at < at) |
545 |
|
|
downheap (heap, N, k); |
546 |
|
|
else |
547 |
|
|
upheap (heap, k); |
548 |
|
|
} |
549 |
|
|
|
550 |
root |
1.8 |
/*****************************************************************************/ |
551 |
|
|
|
552 |
root |
1.7 |
typedef struct |
553 |
|
|
{ |
554 |
root |
1.68 |
WL head; |
555 |
root |
1.34 |
sig_atomic_t volatile gotsig; |
556 |
root |
1.7 |
} ANSIG; |
557 |
|
|
|
558 |
|
|
static ANSIG *signals; |
559 |
root |
1.4 |
static int signalmax; |
560 |
root |
1.1 |
|
561 |
root |
1.7 |
static int sigpipe [2]; |
562 |
root |
1.34 |
static sig_atomic_t volatile gotsig; |
563 |
root |
1.59 |
static struct ev_io sigev; |
564 |
root |
1.7 |
|
565 |
root |
1.1 |
static void |
566 |
root |
1.7 |
signals_init (ANSIG *base, int count) |
567 |
root |
1.1 |
{ |
568 |
|
|
while (count--) |
569 |
root |
1.7 |
{ |
570 |
|
|
base->head = 0; |
571 |
|
|
base->gotsig = 0; |
572 |
root |
1.33 |
|
573 |
root |
1.7 |
++base; |
574 |
|
|
} |
575 |
|
|
} |
576 |
|
|
|
577 |
|
|
static void |
578 |
|
|
sighandler (int signum) |
579 |
|
|
{ |
580 |
root |
1.67 |
#if WIN32 |
581 |
|
|
signal (signum, sighandler); |
582 |
|
|
#endif |
583 |
|
|
|
584 |
root |
1.7 |
signals [signum - 1].gotsig = 1; |
585 |
|
|
|
586 |
|
|
if (!gotsig) |
587 |
|
|
{ |
588 |
root |
1.48 |
int old_errno = errno; |
589 |
root |
1.7 |
gotsig = 1; |
590 |
root |
1.75 |
#ifdef WIN32 |
591 |
|
|
send (sigpipe [1], &signum, 1, MSG_DONTWAIT); |
592 |
|
|
#else |
593 |
root |
1.34 |
write (sigpipe [1], &signum, 1); |
594 |
root |
1.75 |
#endif |
595 |
root |
1.48 |
errno = old_errno; |
596 |
root |
1.7 |
} |
597 |
|
|
} |
598 |
|
|
|
599 |
root |
1.79 |
void |
600 |
|
|
ev_feed_signal_event (EV_P_ int signum) |
601 |
|
|
{ |
602 |
root |
1.80 |
WL w; |
603 |
|
|
|
604 |
root |
1.79 |
#if EV_MULTIPLICITY |
605 |
|
|
assert (("feeding signal events is only supported in the default loop", loop == default_loop)); |
606 |
|
|
#endif |
607 |
|
|
|
608 |
|
|
--signum; |
609 |
|
|
|
610 |
|
|
if (signum < 0 || signum >= signalmax) |
611 |
|
|
return; |
612 |
|
|
|
613 |
|
|
signals [signum].gotsig = 0; |
614 |
|
|
|
615 |
|
|
for (w = signals [signum].head; w; w = w->next) |
616 |
|
|
ev_feed_event (EV_A_ (W)w, EV_SIGNAL); |
617 |
|
|
} |
618 |
|
|
|
619 |
root |
1.7 |
static void |
620 |
root |
1.51 |
sigcb (EV_P_ struct ev_io *iow, int revents) |
621 |
root |
1.7 |
{ |
622 |
root |
1.38 |
int signum; |
623 |
root |
1.7 |
|
624 |
root |
1.75 |
#ifdef WIN32 |
625 |
|
|
recv (sigpipe [0], &revents, 1, MSG_DONTWAIT); |
626 |
|
|
#else |
627 |
root |
1.34 |
read (sigpipe [0], &revents, 1); |
628 |
root |
1.75 |
#endif |
629 |
root |
1.7 |
gotsig = 0; |
630 |
|
|
|
631 |
root |
1.38 |
for (signum = signalmax; signum--; ) |
632 |
|
|
if (signals [signum].gotsig) |
633 |
root |
1.80 |
ev_feed_signal_event (EV_A_ signum + 1); |
634 |
root |
1.7 |
} |
635 |
|
|
|
636 |
|
|
static void |
637 |
root |
1.51 |
siginit (EV_P) |
638 |
root |
1.7 |
{ |
639 |
root |
1.45 |
#ifndef WIN32 |
640 |
root |
1.7 |
fcntl (sigpipe [0], F_SETFD, FD_CLOEXEC); |
641 |
|
|
fcntl (sigpipe [1], F_SETFD, FD_CLOEXEC); |
642 |
|
|
|
643 |
|
|
/* rather than sort out wether we really need nb, set it */ |
644 |
|
|
fcntl (sigpipe [0], F_SETFL, O_NONBLOCK); |
645 |
|
|
fcntl (sigpipe [1], F_SETFL, O_NONBLOCK); |
646 |
root |
1.45 |
#endif |
647 |
root |
1.7 |
|
648 |
root |
1.28 |
ev_io_set (&sigev, sigpipe [0], EV_READ); |
649 |
root |
1.54 |
ev_io_start (EV_A_ &sigev); |
650 |
root |
1.52 |
ev_unref (EV_A); /* child watcher should not keep loop alive */ |
651 |
root |
1.1 |
} |
652 |
|
|
|
653 |
root |
1.8 |
/*****************************************************************************/ |
654 |
|
|
|
655 |
root |
1.71 |
static struct ev_child *childs [PID_HASHSIZE]; |
656 |
|
|
|
657 |
root |
1.45 |
#ifndef WIN32 |
658 |
|
|
|
659 |
root |
1.59 |
static struct ev_signal childev; |
660 |
|
|
|
661 |
root |
1.22 |
#ifndef WCONTINUED |
662 |
|
|
# define WCONTINUED 0 |
663 |
|
|
#endif |
664 |
|
|
|
665 |
|
|
static void |
666 |
root |
1.51 |
child_reap (EV_P_ struct ev_signal *sw, int chain, int pid, int status) |
667 |
root |
1.47 |
{ |
668 |
|
|
struct ev_child *w; |
669 |
|
|
|
670 |
root |
1.50 |
for (w = (struct ev_child *)childs [chain & (PID_HASHSIZE - 1)]; w; w = (struct ev_child *)((WL)w)->next) |
671 |
root |
1.47 |
if (w->pid == pid || !w->pid) |
672 |
|
|
{ |
673 |
root |
1.63 |
ev_priority (w) = ev_priority (sw); /* need to do it *now* */ |
674 |
|
|
w->rpid = pid; |
675 |
|
|
w->rstatus = status; |
676 |
root |
1.78 |
ev_feed_event (EV_A_ (W)w, EV_CHILD); |
677 |
root |
1.47 |
} |
678 |
|
|
} |
679 |
|
|
|
680 |
|
|
static void |
681 |
root |
1.51 |
childcb (EV_P_ struct ev_signal *sw, int revents) |
682 |
root |
1.22 |
{ |
683 |
|
|
int pid, status; |
684 |
|
|
|
685 |
root |
1.47 |
if (0 < (pid = waitpid (-1, &status, WNOHANG | WUNTRACED | WCONTINUED))) |
686 |
|
|
{ |
687 |
|
|
/* make sure we are called again until all childs have been reaped */ |
688 |
root |
1.78 |
ev_feed_event (EV_A_ (W)sw, EV_SIGNAL); |
689 |
root |
1.47 |
|
690 |
root |
1.51 |
child_reap (EV_A_ sw, pid, pid, status); |
691 |
|
|
child_reap (EV_A_ sw, 0, pid, status); /* this might trigger a watcher twice, but event catches that */ |
692 |
root |
1.47 |
} |
693 |
root |
1.22 |
} |
694 |
|
|
|
695 |
root |
1.45 |
#endif |
696 |
|
|
|
697 |
root |
1.22 |
/*****************************************************************************/ |
698 |
|
|
|
699 |
root |
1.44 |
#if EV_USE_KQUEUE |
700 |
|
|
# include "ev_kqueue.c" |
701 |
|
|
#endif |
702 |
root |
1.29 |
#if EV_USE_EPOLL |
703 |
root |
1.1 |
# include "ev_epoll.c" |
704 |
|
|
#endif |
705 |
root |
1.59 |
#if EV_USE_POLL |
706 |
root |
1.41 |
# include "ev_poll.c" |
707 |
|
|
#endif |
708 |
root |
1.29 |
#if EV_USE_SELECT |
709 |
root |
1.1 |
# include "ev_select.c" |
710 |
|
|
#endif |
711 |
|
|
|
712 |
root |
1.24 |
int |
713 |
|
|
ev_version_major (void) |
714 |
|
|
{ |
715 |
|
|
return EV_VERSION_MAJOR; |
716 |
|
|
} |
717 |
|
|
|
718 |
|
|
int |
719 |
|
|
ev_version_minor (void) |
720 |
|
|
{ |
721 |
|
|
return EV_VERSION_MINOR; |
722 |
|
|
} |
723 |
|
|
|
724 |
root |
1.49 |
/* return true if we are running with elevated privileges and should ignore env variables */ |
725 |
root |
1.41 |
static int |
726 |
root |
1.51 |
enable_secure (void) |
727 |
root |
1.41 |
{ |
728 |
root |
1.49 |
#ifdef WIN32 |
729 |
|
|
return 0; |
730 |
|
|
#else |
731 |
root |
1.41 |
return getuid () != geteuid () |
732 |
|
|
|| getgid () != getegid (); |
733 |
root |
1.49 |
#endif |
734 |
root |
1.41 |
} |
735 |
|
|
|
736 |
root |
1.51 |
int |
737 |
|
|
ev_method (EV_P) |
738 |
root |
1.1 |
{ |
739 |
root |
1.51 |
return method; |
740 |
|
|
} |
741 |
|
|
|
742 |
root |
1.56 |
static void |
743 |
root |
1.54 |
loop_init (EV_P_ int methods) |
744 |
root |
1.51 |
{ |
745 |
|
|
if (!method) |
746 |
root |
1.23 |
{ |
747 |
root |
1.29 |
#if EV_USE_MONOTONIC |
748 |
root |
1.23 |
{ |
749 |
|
|
struct timespec ts; |
750 |
|
|
if (!clock_gettime (CLOCK_MONOTONIC, &ts)) |
751 |
|
|
have_monotonic = 1; |
752 |
|
|
} |
753 |
root |
1.1 |
#endif |
754 |
|
|
|
755 |
root |
1.85 |
ev_rt_now = ev_time (); |
756 |
root |
1.51 |
mn_now = get_clock (); |
757 |
|
|
now_floor = mn_now; |
758 |
root |
1.85 |
rtmn_diff = ev_rt_now - mn_now; |
759 |
root |
1.1 |
|
760 |
root |
1.41 |
if (methods == EVMETHOD_AUTO) |
761 |
root |
1.56 |
if (!enable_secure () && getenv ("LIBEV_METHODS")) |
762 |
|
|
methods = atoi (getenv ("LIBEV_METHODS")); |
763 |
root |
1.50 |
else |
764 |
|
|
methods = EVMETHOD_ANY; |
765 |
root |
1.41 |
|
766 |
root |
1.51 |
method = 0; |
767 |
root |
1.62 |
#if EV_USE_WIN32 |
768 |
|
|
if (!method && (methods & EVMETHOD_WIN32 )) method = win32_init (EV_A_ methods); |
769 |
|
|
#endif |
770 |
root |
1.44 |
#if EV_USE_KQUEUE |
771 |
root |
1.51 |
if (!method && (methods & EVMETHOD_KQUEUE)) method = kqueue_init (EV_A_ methods); |
772 |
root |
1.44 |
#endif |
773 |
root |
1.29 |
#if EV_USE_EPOLL |
774 |
root |
1.51 |
if (!method && (methods & EVMETHOD_EPOLL )) method = epoll_init (EV_A_ methods); |
775 |
root |
1.41 |
#endif |
776 |
root |
1.59 |
#if EV_USE_POLL |
777 |
root |
1.51 |
if (!method && (methods & EVMETHOD_POLL )) method = poll_init (EV_A_ methods); |
778 |
root |
1.1 |
#endif |
779 |
root |
1.29 |
#if EV_USE_SELECT |
780 |
root |
1.51 |
if (!method && (methods & EVMETHOD_SELECT)) method = select_init (EV_A_ methods); |
781 |
root |
1.1 |
#endif |
782 |
root |
1.70 |
|
783 |
root |
1.83 |
ev_init (&sigev, sigcb); |
784 |
root |
1.70 |
ev_set_priority (&sigev, EV_MAXPRI); |
785 |
root |
1.56 |
} |
786 |
|
|
} |
787 |
|
|
|
788 |
|
|
void |
789 |
|
|
loop_destroy (EV_P) |
790 |
|
|
{ |
791 |
root |
1.65 |
int i; |
792 |
|
|
|
793 |
root |
1.62 |
#if EV_USE_WIN32 |
794 |
|
|
if (method == EVMETHOD_WIN32 ) win32_destroy (EV_A); |
795 |
|
|
#endif |
796 |
root |
1.56 |
#if EV_USE_KQUEUE |
797 |
|
|
if (method == EVMETHOD_KQUEUE) kqueue_destroy (EV_A); |
798 |
|
|
#endif |
799 |
|
|
#if EV_USE_EPOLL |
800 |
|
|
if (method == EVMETHOD_EPOLL ) epoll_destroy (EV_A); |
801 |
|
|
#endif |
802 |
root |
1.59 |
#if EV_USE_POLL |
803 |
root |
1.56 |
if (method == EVMETHOD_POLL ) poll_destroy (EV_A); |
804 |
|
|
#endif |
805 |
|
|
#if EV_USE_SELECT |
806 |
|
|
if (method == EVMETHOD_SELECT) select_destroy (EV_A); |
807 |
|
|
#endif |
808 |
root |
1.1 |
|
809 |
root |
1.65 |
for (i = NUMPRI; i--; ) |
810 |
|
|
array_free (pending, [i]); |
811 |
|
|
|
812 |
root |
1.71 |
/* have to use the microsoft-never-gets-it-right macro */ |
813 |
|
|
array_free_microshit (fdchange); |
814 |
|
|
array_free_microshit (timer); |
815 |
root |
1.93 |
#if EV_PERIODICS |
816 |
root |
1.71 |
array_free_microshit (periodic); |
817 |
root |
1.93 |
#endif |
818 |
root |
1.71 |
array_free_microshit (idle); |
819 |
|
|
array_free_microshit (prepare); |
820 |
|
|
array_free_microshit (check); |
821 |
root |
1.65 |
|
822 |
root |
1.56 |
method = 0; |
823 |
|
|
} |
824 |
root |
1.22 |
|
825 |
root |
1.70 |
static void |
826 |
root |
1.56 |
loop_fork (EV_P) |
827 |
|
|
{ |
828 |
|
|
#if EV_USE_EPOLL |
829 |
|
|
if (method == EVMETHOD_EPOLL ) epoll_fork (EV_A); |
830 |
|
|
#endif |
831 |
|
|
#if EV_USE_KQUEUE |
832 |
|
|
if (method == EVMETHOD_KQUEUE) kqueue_fork (EV_A); |
833 |
root |
1.45 |
#endif |
834 |
root |
1.70 |
|
835 |
|
|
if (ev_is_active (&sigev)) |
836 |
|
|
{ |
837 |
|
|
/* default loop */ |
838 |
|
|
|
839 |
|
|
ev_ref (EV_A); |
840 |
|
|
ev_io_stop (EV_A_ &sigev); |
841 |
|
|
close (sigpipe [0]); |
842 |
|
|
close (sigpipe [1]); |
843 |
|
|
|
844 |
root |
1.73 |
while (pipe (sigpipe)) |
845 |
root |
1.70 |
syserr ("(libev) error creating pipe"); |
846 |
|
|
|
847 |
|
|
siginit (EV_A); |
848 |
|
|
} |
849 |
|
|
|
850 |
|
|
postfork = 0; |
851 |
root |
1.1 |
} |
852 |
|
|
|
853 |
root |
1.55 |
#if EV_MULTIPLICITY |
854 |
root |
1.54 |
struct ev_loop * |
855 |
|
|
ev_loop_new (int methods) |
856 |
|
|
{ |
857 |
root |
1.69 |
struct ev_loop *loop = (struct ev_loop *)ev_malloc (sizeof (struct ev_loop)); |
858 |
|
|
|
859 |
|
|
memset (loop, 0, sizeof (struct ev_loop)); |
860 |
root |
1.54 |
|
861 |
root |
1.56 |
loop_init (EV_A_ methods); |
862 |
|
|
|
863 |
root |
1.60 |
if (ev_method (EV_A)) |
864 |
root |
1.55 |
return loop; |
865 |
root |
1.54 |
|
866 |
root |
1.55 |
return 0; |
867 |
root |
1.54 |
} |
868 |
|
|
|
869 |
|
|
void |
870 |
root |
1.56 |
ev_loop_destroy (EV_P) |
871 |
root |
1.54 |
{ |
872 |
root |
1.56 |
loop_destroy (EV_A); |
873 |
root |
1.69 |
ev_free (loop); |
874 |
root |
1.54 |
} |
875 |
|
|
|
876 |
root |
1.56 |
void |
877 |
|
|
ev_loop_fork (EV_P) |
878 |
|
|
{ |
879 |
root |
1.70 |
postfork = 1; |
880 |
root |
1.56 |
} |
881 |
|
|
|
882 |
|
|
#endif |
883 |
|
|
|
884 |
|
|
#if EV_MULTIPLICITY |
885 |
|
|
struct ev_loop * |
886 |
root |
1.54 |
#else |
887 |
|
|
int |
888 |
root |
1.56 |
#endif |
889 |
|
|
ev_default_loop (int methods) |
890 |
root |
1.54 |
{ |
891 |
root |
1.56 |
if (sigpipe [0] == sigpipe [1]) |
892 |
root |
1.73 |
if (pipe (sigpipe)) |
893 |
root |
1.56 |
return 0; |
894 |
root |
1.54 |
|
895 |
root |
1.56 |
if (!default_loop) |
896 |
|
|
{ |
897 |
|
|
#if EV_MULTIPLICITY |
898 |
|
|
struct ev_loop *loop = default_loop = &default_loop_struct; |
899 |
|
|
#else |
900 |
|
|
default_loop = 1; |
901 |
root |
1.54 |
#endif |
902 |
|
|
|
903 |
root |
1.56 |
loop_init (EV_A_ methods); |
904 |
|
|
|
905 |
|
|
if (ev_method (EV_A)) |
906 |
|
|
{ |
907 |
|
|
siginit (EV_A); |
908 |
|
|
|
909 |
|
|
#ifndef WIN32 |
910 |
|
|
ev_signal_init (&childev, childcb, SIGCHLD); |
911 |
|
|
ev_set_priority (&childev, EV_MAXPRI); |
912 |
|
|
ev_signal_start (EV_A_ &childev); |
913 |
|
|
ev_unref (EV_A); /* child watcher should not keep loop alive */ |
914 |
|
|
#endif |
915 |
|
|
} |
916 |
|
|
else |
917 |
|
|
default_loop = 0; |
918 |
|
|
} |
919 |
root |
1.8 |
|
920 |
root |
1.56 |
return default_loop; |
921 |
root |
1.1 |
} |
922 |
|
|
|
923 |
root |
1.24 |
void |
924 |
root |
1.56 |
ev_default_destroy (void) |
925 |
root |
1.1 |
{ |
926 |
root |
1.57 |
#if EV_MULTIPLICITY |
927 |
root |
1.56 |
struct ev_loop *loop = default_loop; |
928 |
root |
1.57 |
#endif |
929 |
root |
1.56 |
|
930 |
root |
1.71 |
#ifndef WIN32 |
931 |
root |
1.56 |
ev_ref (EV_A); /* child watcher */ |
932 |
|
|
ev_signal_stop (EV_A_ &childev); |
933 |
root |
1.71 |
#endif |
934 |
root |
1.56 |
|
935 |
|
|
ev_ref (EV_A); /* signal watcher */ |
936 |
|
|
ev_io_stop (EV_A_ &sigev); |
937 |
|
|
|
938 |
|
|
close (sigpipe [0]); sigpipe [0] = 0; |
939 |
|
|
close (sigpipe [1]); sigpipe [1] = 0; |
940 |
|
|
|
941 |
|
|
loop_destroy (EV_A); |
942 |
root |
1.1 |
} |
943 |
|
|
|
944 |
root |
1.24 |
void |
945 |
root |
1.60 |
ev_default_fork (void) |
946 |
root |
1.1 |
{ |
947 |
root |
1.60 |
#if EV_MULTIPLICITY |
948 |
|
|
struct ev_loop *loop = default_loop; |
949 |
|
|
#endif |
950 |
|
|
|
951 |
root |
1.70 |
if (method) |
952 |
|
|
postfork = 1; |
953 |
root |
1.1 |
} |
954 |
|
|
|
955 |
root |
1.8 |
/*****************************************************************************/ |
956 |
|
|
|
957 |
root |
1.76 |
static int |
958 |
|
|
any_pending (EV_P) |
959 |
|
|
{ |
960 |
|
|
int pri; |
961 |
|
|
|
962 |
|
|
for (pri = NUMPRI; pri--; ) |
963 |
|
|
if (pendingcnt [pri]) |
964 |
|
|
return 1; |
965 |
|
|
|
966 |
|
|
return 0; |
967 |
|
|
} |
968 |
|
|
|
969 |
root |
1.1 |
static void |
970 |
root |
1.51 |
call_pending (EV_P) |
971 |
root |
1.1 |
{ |
972 |
root |
1.42 |
int pri; |
973 |
|
|
|
974 |
|
|
for (pri = NUMPRI; pri--; ) |
975 |
|
|
while (pendingcnt [pri]) |
976 |
|
|
{ |
977 |
|
|
ANPENDING *p = pendings [pri] + --pendingcnt [pri]; |
978 |
root |
1.1 |
|
979 |
root |
1.42 |
if (p->w) |
980 |
|
|
{ |
981 |
|
|
p->w->pending = 0; |
982 |
root |
1.82 |
EV_CB_INVOKE (p->w, p->events); |
983 |
root |
1.42 |
} |
984 |
|
|
} |
985 |
root |
1.1 |
} |
986 |
|
|
|
987 |
|
|
static void |
988 |
root |
1.51 |
timers_reify (EV_P) |
989 |
root |
1.1 |
{ |
990 |
root |
1.63 |
while (timercnt && ((WT)timers [0])->at <= mn_now) |
991 |
root |
1.1 |
{ |
992 |
|
|
struct ev_timer *w = timers [0]; |
993 |
|
|
|
994 |
root |
1.61 |
assert (("inactive timer on timer heap detected", ev_is_active (w))); |
995 |
|
|
|
996 |
root |
1.4 |
/* first reschedule or stop timer */ |
997 |
root |
1.1 |
if (w->repeat) |
998 |
|
|
{ |
999 |
root |
1.33 |
assert (("negative ev_timer repeat value found while processing timers", w->repeat > 0.)); |
1000 |
root |
1.90 |
|
1001 |
|
|
((WT)w)->at += w->repeat; |
1002 |
|
|
if (((WT)w)->at < mn_now) |
1003 |
|
|
((WT)w)->at = mn_now; |
1004 |
|
|
|
1005 |
root |
1.12 |
downheap ((WT *)timers, timercnt, 0); |
1006 |
|
|
} |
1007 |
|
|
else |
1008 |
root |
1.51 |
ev_timer_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1009 |
root |
1.30 |
|
1010 |
root |
1.78 |
ev_feed_event (EV_A_ (W)w, EV_TIMEOUT); |
1011 |
root |
1.12 |
} |
1012 |
|
|
} |
1013 |
root |
1.4 |
|
1014 |
root |
1.93 |
#if EV_PERIODICS |
1015 |
root |
1.12 |
static void |
1016 |
root |
1.51 |
periodics_reify (EV_P) |
1017 |
root |
1.12 |
{ |
1018 |
root |
1.85 |
while (periodiccnt && ((WT)periodics [0])->at <= ev_rt_now) |
1019 |
root |
1.12 |
{ |
1020 |
|
|
struct ev_periodic *w = periodics [0]; |
1021 |
root |
1.1 |
|
1022 |
root |
1.61 |
assert (("inactive timer on periodic heap detected", ev_is_active (w))); |
1023 |
|
|
|
1024 |
root |
1.12 |
/* first reschedule or stop timer */ |
1025 |
root |
1.77 |
if (w->reschedule_cb) |
1026 |
|
|
{ |
1027 |
root |
1.85 |
ev_tstamp at = ((WT)w)->at = w->reschedule_cb (w, ev_rt_now + 0.0001); |
1028 |
root |
1.77 |
|
1029 |
root |
1.85 |
assert (("ev_periodic reschedule callback returned time in the past", ((WT)w)->at > ev_rt_now)); |
1030 |
root |
1.77 |
downheap ((WT *)periodics, periodiccnt, 0); |
1031 |
|
|
} |
1032 |
|
|
else if (w->interval) |
1033 |
root |
1.12 |
{ |
1034 |
root |
1.85 |
((WT)w)->at += floor ((ev_rt_now - ((WT)w)->at) / w->interval + 1.) * w->interval; |
1035 |
|
|
assert (("ev_periodic timeout in the past detected while processing timers, negative interval?", ((WT)w)->at > ev_rt_now)); |
1036 |
root |
1.12 |
downheap ((WT *)periodics, periodiccnt, 0); |
1037 |
root |
1.1 |
} |
1038 |
|
|
else |
1039 |
root |
1.51 |
ev_periodic_stop (EV_A_ w); /* nonrepeating: stop timer */ |
1040 |
root |
1.12 |
|
1041 |
root |
1.78 |
ev_feed_event (EV_A_ (W)w, EV_PERIODIC); |
1042 |
root |
1.12 |
} |
1043 |
|
|
} |
1044 |
|
|
|
1045 |
|
|
static void |
1046 |
root |
1.54 |
periodics_reschedule (EV_P) |
1047 |
root |
1.12 |
{ |
1048 |
|
|
int i; |
1049 |
|
|
|
1050 |
root |
1.13 |
/* adjust periodics after time jump */ |
1051 |
root |
1.12 |
for (i = 0; i < periodiccnt; ++i) |
1052 |
|
|
{ |
1053 |
|
|
struct ev_periodic *w = periodics [i]; |
1054 |
|
|
|
1055 |
root |
1.77 |
if (w->reschedule_cb) |
1056 |
root |
1.85 |
((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
1057 |
root |
1.77 |
else if (w->interval) |
1058 |
root |
1.85 |
((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1059 |
root |
1.77 |
} |
1060 |
root |
1.12 |
|
1061 |
root |
1.77 |
/* now rebuild the heap */ |
1062 |
|
|
for (i = periodiccnt >> 1; i--; ) |
1063 |
|
|
downheap ((WT *)periodics, periodiccnt, i); |
1064 |
root |
1.1 |
} |
1065 |
root |
1.93 |
#endif |
1066 |
root |
1.1 |
|
1067 |
root |
1.51 |
inline int |
1068 |
|
|
time_update_monotonic (EV_P) |
1069 |
root |
1.40 |
{ |
1070 |
root |
1.51 |
mn_now = get_clock (); |
1071 |
root |
1.40 |
|
1072 |
root |
1.51 |
if (expect_true (mn_now - now_floor < MIN_TIMEJUMP * .5)) |
1073 |
root |
1.40 |
{ |
1074 |
root |
1.85 |
ev_rt_now = rtmn_diff + mn_now; |
1075 |
root |
1.40 |
return 0; |
1076 |
|
|
} |
1077 |
|
|
else |
1078 |
|
|
{ |
1079 |
root |
1.51 |
now_floor = mn_now; |
1080 |
root |
1.85 |
ev_rt_now = ev_time (); |
1081 |
root |
1.40 |
return 1; |
1082 |
|
|
} |
1083 |
|
|
} |
1084 |
|
|
|
1085 |
root |
1.4 |
static void |
1086 |
root |
1.51 |
time_update (EV_P) |
1087 |
root |
1.4 |
{ |
1088 |
|
|
int i; |
1089 |
root |
1.12 |
|
1090 |
root |
1.40 |
#if EV_USE_MONOTONIC |
1091 |
|
|
if (expect_true (have_monotonic)) |
1092 |
|
|
{ |
1093 |
root |
1.51 |
if (time_update_monotonic (EV_A)) |
1094 |
root |
1.40 |
{ |
1095 |
root |
1.54 |
ev_tstamp odiff = rtmn_diff; |
1096 |
root |
1.4 |
|
1097 |
root |
1.40 |
for (i = 4; --i; ) /* loop a few times, before making important decisions */ |
1098 |
|
|
{ |
1099 |
root |
1.85 |
rtmn_diff = ev_rt_now - mn_now; |
1100 |
root |
1.4 |
|
1101 |
root |
1.54 |
if (fabs (odiff - rtmn_diff) < MIN_TIMEJUMP) |
1102 |
root |
1.40 |
return; /* all is well */ |
1103 |
root |
1.4 |
|
1104 |
root |
1.85 |
ev_rt_now = ev_time (); |
1105 |
root |
1.51 |
mn_now = get_clock (); |
1106 |
|
|
now_floor = mn_now; |
1107 |
root |
1.40 |
} |
1108 |
root |
1.4 |
|
1109 |
root |
1.93 |
# if EV_PERIODICS |
1110 |
root |
1.54 |
periodics_reschedule (EV_A); |
1111 |
root |
1.93 |
# endif |
1112 |
root |
1.40 |
/* no timer adjustment, as the monotonic clock doesn't jump */ |
1113 |
root |
1.54 |
/* timers_reschedule (EV_A_ rtmn_diff - odiff) */ |
1114 |
root |
1.4 |
} |
1115 |
|
|
} |
1116 |
|
|
else |
1117 |
root |
1.40 |
#endif |
1118 |
root |
1.4 |
{ |
1119 |
root |
1.85 |
ev_rt_now = ev_time (); |
1120 |
root |
1.40 |
|
1121 |
root |
1.85 |
if (expect_false (mn_now > ev_rt_now || mn_now < ev_rt_now - MAX_BLOCKTIME - MIN_TIMEJUMP)) |
1122 |
root |
1.13 |
{ |
1123 |
root |
1.93 |
#if EV_PERIODICS |
1124 |
root |
1.54 |
periodics_reschedule (EV_A); |
1125 |
root |
1.93 |
#endif |
1126 |
root |
1.13 |
|
1127 |
|
|
/* adjust timers. this is easy, as the offset is the same for all */ |
1128 |
|
|
for (i = 0; i < timercnt; ++i) |
1129 |
root |
1.85 |
((WT)timers [i])->at += ev_rt_now - mn_now; |
1130 |
root |
1.13 |
} |
1131 |
root |
1.4 |
|
1132 |
root |
1.85 |
mn_now = ev_rt_now; |
1133 |
root |
1.4 |
} |
1134 |
|
|
} |
1135 |
|
|
|
1136 |
root |
1.51 |
void |
1137 |
|
|
ev_ref (EV_P) |
1138 |
|
|
{ |
1139 |
|
|
++activecnt; |
1140 |
|
|
} |
1141 |
root |
1.1 |
|
1142 |
root |
1.51 |
void |
1143 |
|
|
ev_unref (EV_P) |
1144 |
|
|
{ |
1145 |
|
|
--activecnt; |
1146 |
|
|
} |
1147 |
|
|
|
1148 |
|
|
static int loop_done; |
1149 |
|
|
|
1150 |
|
|
void |
1151 |
|
|
ev_loop (EV_P_ int flags) |
1152 |
root |
1.1 |
{ |
1153 |
|
|
double block; |
1154 |
root |
1.51 |
loop_done = flags & (EVLOOP_ONESHOT | EVLOOP_NONBLOCK) ? 1 : 0; |
1155 |
root |
1.1 |
|
1156 |
root |
1.20 |
do |
1157 |
root |
1.9 |
{ |
1158 |
root |
1.20 |
/* queue check watchers (and execute them) */ |
1159 |
root |
1.40 |
if (expect_false (preparecnt)) |
1160 |
root |
1.20 |
{ |
1161 |
root |
1.51 |
queue_events (EV_A_ (W *)prepares, preparecnt, EV_PREPARE); |
1162 |
|
|
call_pending (EV_A); |
1163 |
root |
1.20 |
} |
1164 |
root |
1.9 |
|
1165 |
root |
1.70 |
/* we might have forked, so reify kernel state if necessary */ |
1166 |
|
|
if (expect_false (postfork)) |
1167 |
|
|
loop_fork (EV_A); |
1168 |
|
|
|
1169 |
root |
1.1 |
/* update fd-related kernel structures */ |
1170 |
root |
1.51 |
fd_reify (EV_A); |
1171 |
root |
1.1 |
|
1172 |
|
|
/* calculate blocking time */ |
1173 |
root |
1.12 |
|
1174 |
root |
1.76 |
/* we only need this for !monotonic clock or timers, but as we basically |
1175 |
root |
1.21 |
always have timers, we just calculate it always */ |
1176 |
root |
1.40 |
#if EV_USE_MONOTONIC |
1177 |
|
|
if (expect_true (have_monotonic)) |
1178 |
root |
1.51 |
time_update_monotonic (EV_A); |
1179 |
root |
1.40 |
else |
1180 |
|
|
#endif |
1181 |
|
|
{ |
1182 |
root |
1.85 |
ev_rt_now = ev_time (); |
1183 |
|
|
mn_now = ev_rt_now; |
1184 |
root |
1.40 |
} |
1185 |
root |
1.12 |
|
1186 |
root |
1.9 |
if (flags & EVLOOP_NONBLOCK || idlecnt) |
1187 |
root |
1.1 |
block = 0.; |
1188 |
|
|
else |
1189 |
|
|
{ |
1190 |
root |
1.4 |
block = MAX_BLOCKTIME; |
1191 |
|
|
|
1192 |
root |
1.12 |
if (timercnt) |
1193 |
root |
1.4 |
{ |
1194 |
root |
1.63 |
ev_tstamp to = ((WT)timers [0])->at - mn_now + method_fudge; |
1195 |
root |
1.4 |
if (block > to) block = to; |
1196 |
|
|
} |
1197 |
|
|
|
1198 |
root |
1.93 |
#if EV_PERIODICS |
1199 |
root |
1.12 |
if (periodiccnt) |
1200 |
root |
1.4 |
{ |
1201 |
root |
1.85 |
ev_tstamp to = ((WT)periodics [0])->at - ev_rt_now + method_fudge; |
1202 |
root |
1.4 |
if (block > to) block = to; |
1203 |
|
|
} |
1204 |
root |
1.93 |
#endif |
1205 |
root |
1.4 |
|
1206 |
root |
1.1 |
if (block < 0.) block = 0.; |
1207 |
|
|
} |
1208 |
|
|
|
1209 |
root |
1.51 |
method_poll (EV_A_ block); |
1210 |
root |
1.1 |
|
1211 |
root |
1.85 |
/* update ev_rt_now, do magic */ |
1212 |
root |
1.51 |
time_update (EV_A); |
1213 |
root |
1.4 |
|
1214 |
root |
1.9 |
/* queue pending timers and reschedule them */ |
1215 |
root |
1.51 |
timers_reify (EV_A); /* relative timers called last */ |
1216 |
root |
1.93 |
#if EV_PERIODICS |
1217 |
root |
1.51 |
periodics_reify (EV_A); /* absolute timers called first */ |
1218 |
root |
1.93 |
#endif |
1219 |
root |
1.1 |
|
1220 |
root |
1.9 |
/* queue idle watchers unless io or timers are pending */ |
1221 |
root |
1.76 |
if (idlecnt && !any_pending (EV_A)) |
1222 |
root |
1.51 |
queue_events (EV_A_ (W *)idles, idlecnt, EV_IDLE); |
1223 |
root |
1.9 |
|
1224 |
root |
1.20 |
/* queue check watchers, to be executed first */ |
1225 |
|
|
if (checkcnt) |
1226 |
root |
1.51 |
queue_events (EV_A_ (W *)checks, checkcnt, EV_CHECK); |
1227 |
root |
1.9 |
|
1228 |
root |
1.51 |
call_pending (EV_A); |
1229 |
root |
1.1 |
} |
1230 |
root |
1.51 |
while (activecnt && !loop_done); |
1231 |
root |
1.13 |
|
1232 |
root |
1.51 |
if (loop_done != 2) |
1233 |
|
|
loop_done = 0; |
1234 |
|
|
} |
1235 |
|
|
|
1236 |
|
|
void |
1237 |
|
|
ev_unloop (EV_P_ int how) |
1238 |
|
|
{ |
1239 |
|
|
loop_done = how; |
1240 |
root |
1.1 |
} |
1241 |
|
|
|
1242 |
root |
1.8 |
/*****************************************************************************/ |
1243 |
|
|
|
1244 |
root |
1.51 |
inline void |
1245 |
root |
1.10 |
wlist_add (WL *head, WL elem) |
1246 |
root |
1.1 |
{ |
1247 |
|
|
elem->next = *head; |
1248 |
|
|
*head = elem; |
1249 |
|
|
} |
1250 |
|
|
|
1251 |
root |
1.51 |
inline void |
1252 |
root |
1.10 |
wlist_del (WL *head, WL elem) |
1253 |
root |
1.1 |
{ |
1254 |
|
|
while (*head) |
1255 |
|
|
{ |
1256 |
|
|
if (*head == elem) |
1257 |
|
|
{ |
1258 |
|
|
*head = elem->next; |
1259 |
|
|
return; |
1260 |
|
|
} |
1261 |
|
|
|
1262 |
|
|
head = &(*head)->next; |
1263 |
|
|
} |
1264 |
|
|
} |
1265 |
|
|
|
1266 |
root |
1.51 |
inline void |
1267 |
|
|
ev_clear_pending (EV_P_ W w) |
1268 |
root |
1.16 |
{ |
1269 |
|
|
if (w->pending) |
1270 |
|
|
{ |
1271 |
root |
1.42 |
pendings [ABSPRI (w)][w->pending - 1].w = 0; |
1272 |
root |
1.16 |
w->pending = 0; |
1273 |
|
|
} |
1274 |
|
|
} |
1275 |
|
|
|
1276 |
root |
1.51 |
inline void |
1277 |
|
|
ev_start (EV_P_ W w, int active) |
1278 |
root |
1.1 |
{ |
1279 |
root |
1.43 |
if (w->priority < EV_MINPRI) w->priority = EV_MINPRI; |
1280 |
|
|
if (w->priority > EV_MAXPRI) w->priority = EV_MAXPRI; |
1281 |
|
|
|
1282 |
root |
1.1 |
w->active = active; |
1283 |
root |
1.51 |
ev_ref (EV_A); |
1284 |
root |
1.1 |
} |
1285 |
|
|
|
1286 |
root |
1.51 |
inline void |
1287 |
|
|
ev_stop (EV_P_ W w) |
1288 |
root |
1.1 |
{ |
1289 |
root |
1.51 |
ev_unref (EV_A); |
1290 |
root |
1.1 |
w->active = 0; |
1291 |
|
|
} |
1292 |
|
|
|
1293 |
root |
1.8 |
/*****************************************************************************/ |
1294 |
|
|
|
1295 |
root |
1.1 |
void |
1296 |
root |
1.51 |
ev_io_start (EV_P_ struct ev_io *w) |
1297 |
root |
1.1 |
{ |
1298 |
root |
1.37 |
int fd = w->fd; |
1299 |
|
|
|
1300 |
root |
1.1 |
if (ev_is_active (w)) |
1301 |
|
|
return; |
1302 |
|
|
|
1303 |
root |
1.33 |
assert (("ev_io_start called with negative fd", fd >= 0)); |
1304 |
|
|
|
1305 |
root |
1.51 |
ev_start (EV_A_ (W)w, 1); |
1306 |
root |
1.74 |
array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init); |
1307 |
root |
1.10 |
wlist_add ((WL *)&anfds[fd].head, (WL)w); |
1308 |
root |
1.1 |
|
1309 |
root |
1.51 |
fd_change (EV_A_ fd); |
1310 |
root |
1.1 |
} |
1311 |
|
|
|
1312 |
|
|
void |
1313 |
root |
1.51 |
ev_io_stop (EV_P_ struct ev_io *w) |
1314 |
root |
1.1 |
{ |
1315 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1316 |
root |
1.1 |
if (!ev_is_active (w)) |
1317 |
|
|
return; |
1318 |
|
|
|
1319 |
root |
1.89 |
assert (("ev_io_start called with illegal fd (must stay constant after start!)", w->fd >= 0 && w->fd < anfdmax)); |
1320 |
|
|
|
1321 |
root |
1.10 |
wlist_del ((WL *)&anfds[w->fd].head, (WL)w); |
1322 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1323 |
root |
1.1 |
|
1324 |
root |
1.51 |
fd_change (EV_A_ w->fd); |
1325 |
root |
1.1 |
} |
1326 |
|
|
|
1327 |
|
|
void |
1328 |
root |
1.51 |
ev_timer_start (EV_P_ struct ev_timer *w) |
1329 |
root |
1.1 |
{ |
1330 |
|
|
if (ev_is_active (w)) |
1331 |
|
|
return; |
1332 |
|
|
|
1333 |
root |
1.63 |
((WT)w)->at += mn_now; |
1334 |
root |
1.12 |
|
1335 |
root |
1.33 |
assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); |
1336 |
root |
1.13 |
|
1337 |
root |
1.51 |
ev_start (EV_A_ (W)w, ++timercnt); |
1338 |
root |
1.74 |
array_needsize (struct ev_timer *, timers, timermax, timercnt, (void)); |
1339 |
root |
1.12 |
timers [timercnt - 1] = w; |
1340 |
|
|
upheap ((WT *)timers, timercnt - 1); |
1341 |
root |
1.62 |
|
1342 |
|
|
assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1343 |
root |
1.12 |
} |
1344 |
|
|
|
1345 |
|
|
void |
1346 |
root |
1.51 |
ev_timer_stop (EV_P_ struct ev_timer *w) |
1347 |
root |
1.12 |
{ |
1348 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1349 |
root |
1.12 |
if (!ev_is_active (w)) |
1350 |
|
|
return; |
1351 |
|
|
|
1352 |
root |
1.62 |
assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); |
1353 |
|
|
|
1354 |
|
|
if (((W)w)->active < timercnt--) |
1355 |
root |
1.1 |
{ |
1356 |
root |
1.62 |
timers [((W)w)->active - 1] = timers [timercnt]; |
1357 |
|
|
downheap ((WT *)timers, timercnt, ((W)w)->active - 1); |
1358 |
root |
1.12 |
} |
1359 |
root |
1.4 |
|
1360 |
root |
1.91 |
((WT)w)->at -= mn_now; |
1361 |
root |
1.14 |
|
1362 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1363 |
root |
1.12 |
} |
1364 |
root |
1.4 |
|
1365 |
root |
1.12 |
void |
1366 |
root |
1.51 |
ev_timer_again (EV_P_ struct ev_timer *w) |
1367 |
root |
1.14 |
{ |
1368 |
|
|
if (ev_is_active (w)) |
1369 |
|
|
{ |
1370 |
|
|
if (w->repeat) |
1371 |
root |
1.84 |
adjustheap ((WT *)timers, timercnt, ((W)w)->active - 1, mn_now + w->repeat); |
1372 |
root |
1.14 |
else |
1373 |
root |
1.51 |
ev_timer_stop (EV_A_ w); |
1374 |
root |
1.14 |
} |
1375 |
|
|
else if (w->repeat) |
1376 |
root |
1.51 |
ev_timer_start (EV_A_ w); |
1377 |
root |
1.14 |
} |
1378 |
|
|
|
1379 |
root |
1.93 |
#if EV_PERIODICS |
1380 |
root |
1.14 |
void |
1381 |
root |
1.51 |
ev_periodic_start (EV_P_ struct ev_periodic *w) |
1382 |
root |
1.12 |
{ |
1383 |
|
|
if (ev_is_active (w)) |
1384 |
|
|
return; |
1385 |
root |
1.1 |
|
1386 |
root |
1.77 |
if (w->reschedule_cb) |
1387 |
root |
1.85 |
((WT)w)->at = w->reschedule_cb (w, ev_rt_now); |
1388 |
root |
1.77 |
else if (w->interval) |
1389 |
|
|
{ |
1390 |
|
|
assert (("ev_periodic_start called with negative interval value", w->interval >= 0.)); |
1391 |
|
|
/* this formula differs from the one in periodic_reify because we do not always round up */ |
1392 |
root |
1.85 |
((WT)w)->at += ceil ((ev_rt_now - ((WT)w)->at) / w->interval) * w->interval; |
1393 |
root |
1.77 |
} |
1394 |
root |
1.12 |
|
1395 |
root |
1.51 |
ev_start (EV_A_ (W)w, ++periodiccnt); |
1396 |
root |
1.74 |
array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void)); |
1397 |
root |
1.12 |
periodics [periodiccnt - 1] = w; |
1398 |
|
|
upheap ((WT *)periodics, periodiccnt - 1); |
1399 |
root |
1.62 |
|
1400 |
|
|
assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1401 |
root |
1.1 |
} |
1402 |
|
|
|
1403 |
|
|
void |
1404 |
root |
1.51 |
ev_periodic_stop (EV_P_ struct ev_periodic *w) |
1405 |
root |
1.1 |
{ |
1406 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1407 |
root |
1.1 |
if (!ev_is_active (w)) |
1408 |
|
|
return; |
1409 |
|
|
|
1410 |
root |
1.62 |
assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); |
1411 |
|
|
|
1412 |
|
|
if (((W)w)->active < periodiccnt--) |
1413 |
root |
1.2 |
{ |
1414 |
root |
1.62 |
periodics [((W)w)->active - 1] = periodics [periodiccnt]; |
1415 |
|
|
downheap ((WT *)periodics, periodiccnt, ((W)w)->active - 1); |
1416 |
root |
1.2 |
} |
1417 |
|
|
|
1418 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1419 |
root |
1.1 |
} |
1420 |
|
|
|
1421 |
root |
1.28 |
void |
1422 |
root |
1.77 |
ev_periodic_again (EV_P_ struct ev_periodic *w) |
1423 |
|
|
{ |
1424 |
root |
1.84 |
/* TODO: use adjustheap and recalculation */ |
1425 |
root |
1.77 |
ev_periodic_stop (EV_A_ w); |
1426 |
|
|
ev_periodic_start (EV_A_ w); |
1427 |
|
|
} |
1428 |
root |
1.93 |
#endif |
1429 |
root |
1.77 |
|
1430 |
|
|
void |
1431 |
root |
1.51 |
ev_idle_start (EV_P_ struct ev_idle *w) |
1432 |
root |
1.9 |
{ |
1433 |
|
|
if (ev_is_active (w)) |
1434 |
|
|
return; |
1435 |
|
|
|
1436 |
root |
1.51 |
ev_start (EV_A_ (W)w, ++idlecnt); |
1437 |
root |
1.74 |
array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void)); |
1438 |
root |
1.9 |
idles [idlecnt - 1] = w; |
1439 |
|
|
} |
1440 |
|
|
|
1441 |
root |
1.28 |
void |
1442 |
root |
1.51 |
ev_idle_stop (EV_P_ struct ev_idle *w) |
1443 |
root |
1.9 |
{ |
1444 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1445 |
root |
1.95 |
if (ev_is_active (w)) |
1446 |
root |
1.16 |
return; |
1447 |
|
|
|
1448 |
root |
1.62 |
idles [((W)w)->active - 1] = idles [--idlecnt]; |
1449 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1450 |
root |
1.9 |
} |
1451 |
|
|
|
1452 |
root |
1.28 |
void |
1453 |
root |
1.51 |
ev_prepare_start (EV_P_ struct ev_prepare *w) |
1454 |
root |
1.20 |
{ |
1455 |
|
|
if (ev_is_active (w)) |
1456 |
|
|
return; |
1457 |
|
|
|
1458 |
root |
1.51 |
ev_start (EV_A_ (W)w, ++preparecnt); |
1459 |
root |
1.74 |
array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void)); |
1460 |
root |
1.20 |
prepares [preparecnt - 1] = w; |
1461 |
|
|
} |
1462 |
|
|
|
1463 |
root |
1.28 |
void |
1464 |
root |
1.51 |
ev_prepare_stop (EV_P_ struct ev_prepare *w) |
1465 |
root |
1.20 |
{ |
1466 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1467 |
root |
1.95 |
if (ev_is_active (w)) |
1468 |
root |
1.20 |
return; |
1469 |
|
|
|
1470 |
root |
1.62 |
prepares [((W)w)->active - 1] = prepares [--preparecnt]; |
1471 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1472 |
root |
1.20 |
} |
1473 |
|
|
|
1474 |
root |
1.28 |
void |
1475 |
root |
1.51 |
ev_check_start (EV_P_ struct ev_check *w) |
1476 |
root |
1.9 |
{ |
1477 |
|
|
if (ev_is_active (w)) |
1478 |
|
|
return; |
1479 |
|
|
|
1480 |
root |
1.51 |
ev_start (EV_A_ (W)w, ++checkcnt); |
1481 |
root |
1.74 |
array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void)); |
1482 |
root |
1.9 |
checks [checkcnt - 1] = w; |
1483 |
|
|
} |
1484 |
|
|
|
1485 |
root |
1.28 |
void |
1486 |
root |
1.51 |
ev_check_stop (EV_P_ struct ev_check *w) |
1487 |
root |
1.9 |
{ |
1488 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1489 |
root |
1.94 |
if (!ev_is_active (w)) |
1490 |
root |
1.16 |
return; |
1491 |
|
|
|
1492 |
root |
1.62 |
checks [((W)w)->active - 1] = checks [--checkcnt]; |
1493 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1494 |
root |
1.9 |
} |
1495 |
|
|
|
1496 |
root |
1.56 |
#ifndef SA_RESTART |
1497 |
|
|
# define SA_RESTART 0 |
1498 |
|
|
#endif |
1499 |
|
|
|
1500 |
|
|
void |
1501 |
|
|
ev_signal_start (EV_P_ struct ev_signal *w) |
1502 |
|
|
{ |
1503 |
|
|
#if EV_MULTIPLICITY |
1504 |
|
|
assert (("signal watchers are only supported in the default loop", loop == default_loop)); |
1505 |
|
|
#endif |
1506 |
|
|
if (ev_is_active (w)) |
1507 |
|
|
return; |
1508 |
|
|
|
1509 |
|
|
assert (("ev_signal_start called with illegal signal number", w->signum > 0)); |
1510 |
|
|
|
1511 |
|
|
ev_start (EV_A_ (W)w, 1); |
1512 |
root |
1.74 |
array_needsize (ANSIG, signals, signalmax, w->signum, signals_init); |
1513 |
root |
1.56 |
wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); |
1514 |
|
|
|
1515 |
root |
1.63 |
if (!((WL)w)->next) |
1516 |
root |
1.56 |
{ |
1517 |
root |
1.67 |
#if WIN32 |
1518 |
|
|
signal (w->signum, sighandler); |
1519 |
|
|
#else |
1520 |
root |
1.56 |
struct sigaction sa; |
1521 |
|
|
sa.sa_handler = sighandler; |
1522 |
|
|
sigfillset (&sa.sa_mask); |
1523 |
|
|
sa.sa_flags = SA_RESTART; /* if restarting works we save one iteration */ |
1524 |
|
|
sigaction (w->signum, &sa, 0); |
1525 |
root |
1.67 |
#endif |
1526 |
root |
1.56 |
} |
1527 |
|
|
} |
1528 |
|
|
|
1529 |
|
|
void |
1530 |
|
|
ev_signal_stop (EV_P_ struct ev_signal *w) |
1531 |
|
|
{ |
1532 |
|
|
ev_clear_pending (EV_A_ (W)w); |
1533 |
|
|
if (!ev_is_active (w)) |
1534 |
|
|
return; |
1535 |
|
|
|
1536 |
|
|
wlist_del ((WL *)&signals [w->signum - 1].head, (WL)w); |
1537 |
|
|
ev_stop (EV_A_ (W)w); |
1538 |
|
|
|
1539 |
|
|
if (!signals [w->signum - 1].head) |
1540 |
|
|
signal (w->signum, SIG_DFL); |
1541 |
|
|
} |
1542 |
|
|
|
1543 |
root |
1.28 |
void |
1544 |
root |
1.51 |
ev_child_start (EV_P_ struct ev_child *w) |
1545 |
root |
1.22 |
{ |
1546 |
root |
1.56 |
#if EV_MULTIPLICITY |
1547 |
|
|
assert (("child watchers are only supported in the default loop", loop == default_loop)); |
1548 |
|
|
#endif |
1549 |
root |
1.22 |
if (ev_is_active (w)) |
1550 |
|
|
return; |
1551 |
|
|
|
1552 |
root |
1.51 |
ev_start (EV_A_ (W)w, 1); |
1553 |
root |
1.22 |
wlist_add ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1554 |
|
|
} |
1555 |
|
|
|
1556 |
root |
1.28 |
void |
1557 |
root |
1.51 |
ev_child_stop (EV_P_ struct ev_child *w) |
1558 |
root |
1.22 |
{ |
1559 |
root |
1.51 |
ev_clear_pending (EV_A_ (W)w); |
1560 |
root |
1.95 |
if (!ev_is_active (w)) |
1561 |
root |
1.22 |
return; |
1562 |
|
|
|
1563 |
|
|
wlist_del ((WL *)&childs [w->pid & (PID_HASHSIZE - 1)], (WL)w); |
1564 |
root |
1.51 |
ev_stop (EV_A_ (W)w); |
1565 |
root |
1.22 |
} |
1566 |
|
|
|
1567 |
root |
1.1 |
/*****************************************************************************/ |
1568 |
root |
1.10 |
|
1569 |
root |
1.16 |
struct ev_once |
1570 |
|
|
{ |
1571 |
|
|
struct ev_io io; |
1572 |
|
|
struct ev_timer to; |
1573 |
|
|
void (*cb)(int revents, void *arg); |
1574 |
|
|
void *arg; |
1575 |
|
|
}; |
1576 |
|
|
|
1577 |
|
|
static void |
1578 |
root |
1.51 |
once_cb (EV_P_ struct ev_once *once, int revents) |
1579 |
root |
1.16 |
{ |
1580 |
|
|
void (*cb)(int revents, void *arg) = once->cb; |
1581 |
|
|
void *arg = once->arg; |
1582 |
|
|
|
1583 |
root |
1.51 |
ev_io_stop (EV_A_ &once->io); |
1584 |
|
|
ev_timer_stop (EV_A_ &once->to); |
1585 |
root |
1.69 |
ev_free (once); |
1586 |
root |
1.16 |
|
1587 |
|
|
cb (revents, arg); |
1588 |
|
|
} |
1589 |
|
|
|
1590 |
|
|
static void |
1591 |
root |
1.51 |
once_cb_io (EV_P_ struct ev_io *w, int revents) |
1592 |
root |
1.16 |
{ |
1593 |
root |
1.51 |
once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, io)), revents); |
1594 |
root |
1.16 |
} |
1595 |
|
|
|
1596 |
|
|
static void |
1597 |
root |
1.51 |
once_cb_to (EV_P_ struct ev_timer *w, int revents) |
1598 |
root |
1.16 |
{ |
1599 |
root |
1.51 |
once_cb (EV_A_ (struct ev_once *)(((char *)w) - offsetof (struct ev_once, to)), revents); |
1600 |
root |
1.16 |
} |
1601 |
|
|
|
1602 |
|
|
void |
1603 |
root |
1.51 |
ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) |
1604 |
root |
1.16 |
{ |
1605 |
root |
1.74 |
struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once)); |
1606 |
root |
1.16 |
|
1607 |
|
|
if (!once) |
1608 |
root |
1.29 |
cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); |
1609 |
root |
1.16 |
else |
1610 |
|
|
{ |
1611 |
|
|
once->cb = cb; |
1612 |
|
|
once->arg = arg; |
1613 |
|
|
|
1614 |
root |
1.83 |
ev_init (&once->io, once_cb_io); |
1615 |
root |
1.16 |
if (fd >= 0) |
1616 |
|
|
{ |
1617 |
root |
1.28 |
ev_io_set (&once->io, fd, events); |
1618 |
root |
1.51 |
ev_io_start (EV_A_ &once->io); |
1619 |
root |
1.16 |
} |
1620 |
|
|
|
1621 |
root |
1.83 |
ev_init (&once->to, once_cb_to); |
1622 |
root |
1.16 |
if (timeout >= 0.) |
1623 |
|
|
{ |
1624 |
root |
1.28 |
ev_timer_set (&once->to, timeout, 0.); |
1625 |
root |
1.51 |
ev_timer_start (EV_A_ &once->to); |
1626 |
root |
1.16 |
} |
1627 |
|
|
} |
1628 |
|
|
} |
1629 |
|
|
|
1630 |
root |
1.87 |
#ifdef __cplusplus |
1631 |
|
|
} |
1632 |
|
|
#endif |
1633 |
|
|
|