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

Comparing libev/ev.c (file contents):
Revision 1.16 by root, Wed Oct 31 13:57:34 2007 UTC vs.
Revision 1.21 by root, Wed Oct 31 18:37:38 2007 UTC

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>
… …
9 38
10#include <assert.h> 39#include <assert.h>
11#include <errno.h> 40#include <errno.h>
12#include <sys/time.h> 41#include <sys/time.h>
13#include <time.h> 42#include <time.h>
14
15#define HAVE_EPOLL 1
16 43
17#ifndef HAVE_MONOTONIC 44#ifndef HAVE_MONOTONIC
18# ifdef CLOCK_MONOTONIC 45# ifdef CLOCK_MONOTONIC
19# define HAVE_MONOTONIC 1 46# define HAVE_MONOTONIC 1
20# endif 47# endif
… …
159 186
160 for (i = 0; i < eventcnt; ++i) 187 for (i = 0; i < eventcnt; ++i)
161 event (events [i], type); 188 event (events [i], type);
162} 189}
163 190
191/* called on EBADF to verify fds */
192static void
193fd_recheck ()
194{
195 int fd;
196
197 for (fd = 0; fd < anfdmax; ++fd)
198 if (anfds [fd].wev)
199 if (fcntl (fd, F_GETFD) == -1 && errno == EBADF)
200 while (anfds [fd].head)
201 evio_stop (anfds [fd].head);
202}
203
164/*****************************************************************************/ 204/*****************************************************************************/
165 205
166static struct ev_timer **timers; 206static struct ev_timer **timers;
167static int timermax, timercnt; 207static int timermax, timercnt;
168 208
… …
283 323
284/*****************************************************************************/ 324/*****************************************************************************/
285 325
286static struct ev_idle **idles; 326static struct ev_idle **idles;
287static int idlemax, idlecnt; 327static int idlemax, idlecnt;
328
329static struct ev_prepare **prepares;
330static int preparemax, preparecnt;
288 331
289static struct ev_check **checks; 332static struct ev_check **checks;
290static int checkmax, checkcnt; 333static int checkmax, checkcnt;
291 334
292/*****************************************************************************/ 335/*****************************************************************************/
… …
387} 430}
388 431
389static void 432static void
390call_pending () 433call_pending ()
391{ 434{
392 int i; 435 while (pendingcnt)
393
394 for (i = 0; i < pendingcnt; ++i)
395 { 436 {
396 ANPENDING *p = pendings + i; 437 ANPENDING *p = pendings + --pendingcnt;
397 438
398 if (p->w) 439 if (p->w)
399 { 440 {
400 p->w->pending = 0; 441 p->w->pending = 0;
401 p->w->cb (p->w, p->events); 442 p->w->cb (p->w, p->events);
402 } 443 }
403 } 444 }
404
405 pendingcnt = 0;
406} 445}
407 446
408static void 447static void
409timers_reify () 448timers_reify ()
410{ 449{
… …
517void ev_loop (int flags) 556void ev_loop (int flags)
518{ 557{
519 double block; 558 double block;
520 ev_loop_done = flags & EVLOOP_ONESHOT ? 1 : 0; 559 ev_loop_done = flags & EVLOOP_ONESHOT ? 1 : 0;
521 560
522 if (checkcnt)
523 {
524 queue_events ((W *)checks, checkcnt, EV_CHECK);
525 call_pending ();
526 }
527
528 do 561 do
529 { 562 {
563 /* queue check watchers (and execute them) */
564 if (preparecnt)
565 {
566 queue_events ((W *)prepares, preparecnt, EV_PREPARE);
567 call_pending ();
568 }
569
530 /* update fd-related kernel structures */ 570 /* update fd-related kernel structures */
531 fd_reify (); 571 fd_reify ();
532 572
533 /* calculate blocking time */ 573 /* calculate blocking time */
534 574
535 /* we only need this for !monotonic clock, but as we always have timers, we just calculate it every time */ 575 /* we only need this for !monotonic clockor timers, but as we basically
576 always have timers, we just calculate it always */
536 ev_now = ev_time (); 577 ev_now = ev_time ();
537 578
538 if (flags & EVLOOP_NONBLOCK || idlecnt) 579 if (flags & EVLOOP_NONBLOCK || idlecnt)
539 block = 0.; 580 block = 0.;
540 else 581 else
… …
560 601
561 /* update ev_now, do magic */ 602 /* update ev_now, do magic */
562 time_update (); 603 time_update ();
563 604
564 /* queue pending timers and reschedule them */ 605 /* queue pending timers and reschedule them */
606 timers_reify (); /* relative timers called last */
565 periodics_reify (); /* absolute timers first */ 607 periodics_reify (); /* absolute timers called first */
566 timers_reify (); /* relative timers second */
567 608
568 /* queue idle watchers unless io or timers are pending */ 609 /* queue idle watchers unless io or timers are pending */
569 if (!pendingcnt) 610 if (!pendingcnt)
570 queue_events ((W *)idles, idlecnt, EV_IDLE); 611 queue_events ((W *)idles, idlecnt, EV_IDLE);
571 612
572 /* queue check and possibly idle watchers */ 613 /* queue check watchers, to be executed first */
614 if (checkcnt)
573 queue_events ((W *)checks, checkcnt, EV_CHECK); 615 queue_events ((W *)checks, checkcnt, EV_CHECK);
574 616
575 call_pending (); 617 call_pending ();
576 } 618 }
577 while (!ev_loop_done); 619 while (!ev_loop_done);
578 620
… …
794 ev_clear ((W)w); 836 ev_clear ((W)w);
795 if (ev_is_active (w)) 837 if (ev_is_active (w))
796 return; 838 return;
797 839
798 idles [w->active - 1] = idles [--idlecnt]; 840 idles [w->active - 1] = idles [--idlecnt];
841 ev_stop ((W)w);
842}
843
844void evprepare_start (struct ev_prepare *w)
845{
846 if (ev_is_active (w))
847 return;
848
849 ev_start ((W)w, ++preparecnt);
850 array_needsize (prepares, preparemax, preparecnt, );
851 prepares [preparecnt - 1] = w;
852}
853
854void evprepare_stop (struct ev_prepare *w)
855{
856 ev_clear ((W)w);
857 if (ev_is_active (w))
858 return;
859
860 prepares [w->active - 1] = prepares [--preparecnt];
799 ev_stop ((W)w); 861 ev_stop ((W)w);
800} 862}
801 863
802void evcheck_start (struct ev_check *w) 864void evcheck_start (struct ev_check *w)
803{ 865{

Diff Legend

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