ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/libev/ev.c
(Generate patch)

Comparing libev/ev.c (file contents):
Revision 1.71 by root, Tue Nov 6 13:17:55 2007 UTC vs.
Revision 1.74 by root, Tue Nov 6 16:51:20 2007 UTC

… …
64#include <assert.h> 64#include <assert.h>
65#include <errno.h> 65#include <errno.h>
66#include <sys/types.h> 66#include <sys/types.h>
67#include <time.h> 67#include <time.h>
68 68
69#ifndef PERL
70# include <signal.h> 69#include <signal.h>
71#endif
72 70
73#ifndef WIN32 71#ifndef WIN32
74# include <unistd.h> 72# include <unistd.h>
75# include <sys/time.h> 73# include <sys/time.h>
76# include <sys/wait.h> 74# include <sys/wait.h>
… …
150typedef struct ev_watcher_list *WL; 148typedef struct ev_watcher_list *WL;
151typedef struct ev_watcher_time *WT; 149typedef struct ev_watcher_time *WT;
152 150
153static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */ 151static int have_monotonic; /* did clock_gettime (CLOCK_MONOTONIC) work? */
154 152
155#if WIN32 153#include "ev_win32.c"
156/* note: the comment below could not be substantiated, but what would I care */
157/* MSDN says this is required to handle SIGFPE */
158volatile double SIGFPE_REQ = 0.0f;
159#endif
160 154
161/*****************************************************************************/ 155/*****************************************************************************/
162 156
163static void (*syserr_cb)(const char *msg); 157static void (*syserr_cb)(const char *msg);
164 158
… …
274ev_now (EV_P) 268ev_now (EV_P)
275{ 269{
276 return rt_now; 270 return rt_now;
277} 271}
278 272
279#define array_roundsize(base,n) ((n) | 4 & ~3) 273#define array_roundsize(type,n) ((n) | 4 & ~3)
280 274
281#define array_needsize(base,cur,cnt,init) \ 275#define array_needsize(type,base,cur,cnt,init) \
282 if (expect_false ((cnt) > cur)) \ 276 if (expect_false ((cnt) > cur)) \
283 { \ 277 { \
284 int newcnt = cur; \ 278 int newcnt = cur; \
285 do \ 279 do \
286 { \ 280 { \
287 newcnt = array_roundsize (base, newcnt << 1); \ 281 newcnt = array_roundsize (type, newcnt << 1); \
288 } \ 282 } \
289 while ((cnt) > newcnt); \ 283 while ((cnt) > newcnt); \
290 \ 284 \
291 base = ev_realloc (base, sizeof (*base) * (newcnt)); \ 285 base = (type *)ev_realloc (base, sizeof (type) * (newcnt));\
292 init (base + cur, newcnt - cur); \ 286 init (base + cur, newcnt - cur); \
293 cur = newcnt; \ 287 cur = newcnt; \
294 } 288 }
295 289
296#define array_slim(stem) \ 290#define array_slim(type,stem) \
297 if (stem ## max < array_roundsize (stem ## cnt >> 2)) \ 291 if (stem ## max < array_roundsize (stem ## cnt >> 2)) \
298 { \ 292 { \
299 stem ## max = array_roundsize (stem ## cnt >> 1); \ 293 stem ## max = array_roundsize (stem ## cnt >> 1); \
300 base = ev_realloc (base, sizeof (*base) * (stem ## max)); \ 294 base = (type *)ev_realloc (base, sizeof (type) * (stem ## max));\
301 fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\ 295 fprintf (stderr, "slimmed down " # stem " to %d\n", stem ## max);/*D*/\
302 } 296 }
303 297
304/* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */ 298/* microsoft's pseudo-c is quite far from C as the rest of the world and the standard knows it */
305/* bringing us everlasting joy in form of stupid extra macros that are not required in C */ 299/* bringing us everlasting joy in form of stupid extra macros that are not required in C */
… …
332 pendings [ABSPRI (w)][w->pending - 1].events |= events; 326 pendings [ABSPRI (w)][w->pending - 1].events |= events;
333 return; 327 return;
334 } 328 }
335 329
336 w->pending = ++pendingcnt [ABSPRI (w)]; 330 w->pending = ++pendingcnt [ABSPRI (w)];
337 array_needsize (pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], (void)); 331 array_needsize (ANPENDING, pendings [ABSPRI (w)], pendingmax [ABSPRI (w)], pendingcnt [ABSPRI (w)], (void));
338 pendings [ABSPRI (w)][w->pending - 1].w = w; 332 pendings [ABSPRI (w)][w->pending - 1].w = w;
339 pendings [ABSPRI (w)][w->pending - 1].events = events; 333 pendings [ABSPRI (w)][w->pending - 1].events = events;
340} 334}
341 335
342static void 336static void
… …
397 return; 391 return;
398 392
399 anfds [fd].reify = 1; 393 anfds [fd].reify = 1;
400 394
401 ++fdchangecnt; 395 ++fdchangecnt;
402 array_needsize (fdchanges, fdchangemax, fdchangecnt, (void)); 396 array_needsize (int, fdchanges, fdchangemax, fdchangecnt, (void));
403 fdchanges [fdchangecnt - 1] = fd; 397 fdchanges [fdchangecnt - 1] = fd;
404} 398}
405 399
406static void 400static void
407fd_kill (EV_P_ int fd) 401fd_kill (EV_P_ int fd)
… …
1215 return; 1209 return;
1216 1210
1217 assert (("ev_io_start called with negative fd", fd >= 0)); 1211 assert (("ev_io_start called with negative fd", fd >= 0));
1218 1212
1219 ev_start (EV_A_ (W)w, 1); 1213 ev_start (EV_A_ (W)w, 1);
1220 array_needsize (anfds, anfdmax, fd + 1, anfds_init); 1214 array_needsize (ANFD, anfds, anfdmax, fd + 1, anfds_init);
1221 wlist_add ((WL *)&anfds[fd].head, (WL)w); 1215 wlist_add ((WL *)&anfds[fd].head, (WL)w);
1222 1216
1223 fd_change (EV_A_ fd); 1217 fd_change (EV_A_ fd);
1224} 1218}
1225 1219
… …
1245 ((WT)w)->at += mn_now; 1239 ((WT)w)->at += mn_now;
1246 1240
1247 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.)); 1241 assert (("ev_timer_start called with negative timer repeat value", w->repeat >= 0.));
1248 1242
1249 ev_start (EV_A_ (W)w, ++timercnt); 1243 ev_start (EV_A_ (W)w, ++timercnt);
1250 array_needsize (timers, timermax, timercnt, (void)); 1244 array_needsize (struct ev_timer *, timers, timermax, timercnt, (void));
1251 timers [timercnt - 1] = w; 1245 timers [timercnt - 1] = w;
1252 upheap ((WT *)timers, timercnt - 1); 1246 upheap ((WT *)timers, timercnt - 1);
1253 1247
1254 assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w)); 1248 assert (("internal timer heap corruption", timers [((W)w)->active - 1] == w));
1255} 1249}
… …
1302 /* this formula differs from the one in periodic_reify because we do not always round up */ 1296 /* this formula differs from the one in periodic_reify because we do not always round up */
1303 if (w->interval) 1297 if (w->interval)
1304 ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval; 1298 ((WT)w)->at += ceil ((rt_now - ((WT)w)->at) / w->interval) * w->interval;
1305 1299
1306 ev_start (EV_A_ (W)w, ++periodiccnt); 1300 ev_start (EV_A_ (W)w, ++periodiccnt);
1307 array_needsize (periodics, periodicmax, periodiccnt, (void)); 1301 array_needsize (struct ev_periodic *, periodics, periodicmax, periodiccnt, (void));
1308 periodics [periodiccnt - 1] = w; 1302 periodics [periodiccnt - 1] = w;
1309 upheap ((WT *)periodics, periodiccnt - 1); 1303 upheap ((WT *)periodics, periodiccnt - 1);
1310 1304
1311 assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w)); 1305 assert (("internal periodic heap corruption", periodics [((W)w)->active - 1] == w));
1312} 1306}
… …
1334{ 1328{
1335 if (ev_is_active (w)) 1329 if (ev_is_active (w))
1336 return; 1330 return;
1337 1331
1338 ev_start (EV_A_ (W)w, ++idlecnt); 1332 ev_start (EV_A_ (W)w, ++idlecnt);
1339 array_needsize (idles, idlemax, idlecnt, (void)); 1333 array_needsize (struct ev_idle *, idles, idlemax, idlecnt, (void));
1340 idles [idlecnt - 1] = w; 1334 idles [idlecnt - 1] = w;
1341} 1335}
1342 1336
1343void 1337void
1344ev_idle_stop (EV_P_ struct ev_idle *w) 1338ev_idle_stop (EV_P_ struct ev_idle *w)
… …
1356{ 1350{
1357 if (ev_is_active (w)) 1351 if (ev_is_active (w))
1358 return; 1352 return;
1359 1353
1360 ev_start (EV_A_ (W)w, ++preparecnt); 1354 ev_start (EV_A_ (W)w, ++preparecnt);
1361 array_needsize (prepares, preparemax, preparecnt, (void)); 1355 array_needsize (struct ev_prepare *, prepares, preparemax, preparecnt, (void));
1362 prepares [preparecnt - 1] = w; 1356 prepares [preparecnt - 1] = w;
1363} 1357}
1364 1358
1365void 1359void
1366ev_prepare_stop (EV_P_ struct ev_prepare *w) 1360ev_prepare_stop (EV_P_ struct ev_prepare *w)
… …
1378{ 1372{
1379 if (ev_is_active (w)) 1373 if (ev_is_active (w))
1380 return; 1374 return;
1381 1375
1382 ev_start (EV_A_ (W)w, ++checkcnt); 1376 ev_start (EV_A_ (W)w, ++checkcnt);
1383 array_needsize (checks, checkmax, checkcnt, (void)); 1377 array_needsize (struct ev_check *, checks, checkmax, checkcnt, (void));
1384 checks [checkcnt - 1] = w; 1378 checks [checkcnt - 1] = w;
1385} 1379}
1386 1380
1387void 1381void
1388ev_check_stop (EV_P_ struct ev_check *w) 1382ev_check_stop (EV_P_ struct ev_check *w)
… …
1409 return; 1403 return;
1410 1404
1411 assert (("ev_signal_start called with illegal signal number", w->signum > 0)); 1405 assert (("ev_signal_start called with illegal signal number", w->signum > 0));
1412 1406
1413 ev_start (EV_A_ (W)w, 1); 1407 ev_start (EV_A_ (W)w, 1);
1414 array_needsize (signals, signalmax, w->signum, signals_init); 1408 array_needsize (ANSIG, signals, signalmax, w->signum, signals_init);
1415 wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w); 1409 wlist_add ((WL *)&signals [w->signum - 1].head, (WL)w);
1416 1410
1417 if (!((WL)w)->next) 1411 if (!((WL)w)->next)
1418 { 1412 {
1419#if WIN32 1413#if WIN32
… …
1502} 1496}
1503 1497
1504void 1498void
1505ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg) 1499ev_once (EV_P_ int fd, int events, ev_tstamp timeout, void (*cb)(int revents, void *arg), void *arg)
1506{ 1500{
1507 struct ev_once *once = ev_malloc (sizeof (struct ev_once)); 1501 struct ev_once *once = (struct ev_once *)ev_malloc (sizeof (struct ev_once));
1508 1502
1509 if (!once) 1503 if (!once)
1510 cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg); 1504 cb (EV_ERROR | EV_READ | EV_WRITE | EV_TIMEOUT, arg);
1511 else 1505 else
1512 { 1506 {

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines