X-Git-Url: https://git.llucax.com/software/libev.git/blobdiff_plain/49a82c163f76e2916974ec3eac8d395662e7187b..aa3db4d9af85499b82ea83235a1400f24a2965c8:/ev_epoll.c?ds=sidebyside diff --git a/ev_epoll.c b/ev_epoll.c index da2b5bc..4793212 100644 --- a/ev_epoll.c +++ b/ev_epoll.c @@ -1,3 +1,34 @@ +/* + * libev epoll fd activity backend + * + * Copyright (c) 2007 Marc Alexander Lehmann + * All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions are + * met: + * + * * Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * + * * Redistributions in binary form must reproduce the above + * copyright notice, this list of conditions and the following + * disclaimer in the documentation and/or other materials provided + * with the distribution. + * + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS + * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT + * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR + * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT + * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, + * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT + * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, + * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY + * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT + * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE + * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + */ + #include static int epoll_fd = -1; @@ -16,7 +47,8 @@ epoll_modify (int fd, int oev, int nev) epoll_ctl (epoll_fd, mode, fd, &ev); } -void epoll_postfork_child (void) +static void +epoll_postfork_child (void) { int fd; @@ -25,14 +57,15 @@ void epoll_postfork_child (void) /* re-register interest in fds */ for (fd = 0; fd < anfdmax; ++fd) - if (anfds [fd].wev) - epoll_modify (fd, EV_NONE, anfds [fd].wev); + if (anfds [fd].events)//D + epoll_modify (fd, EV_NONE, anfds [fd].events); } static struct epoll_event *events; static int eventmax; -static void epoll_poll (ev_tstamp timeout) +static void +epoll_poll (ev_tstamp timeout) { int eventcnt = epoll_wait (epoll_fd, events, eventmax, ceil (timeout * 1000.)); int i; @@ -48,15 +81,16 @@ static void epoll_poll (ev_tstamp timeout) ); /* if the receive array was full, increase its size */ - if (eventcnt == eventmax) + if (expect_false (eventcnt == eventmax)) { free (events); - eventmax += eventmax >> 1; + eventmax = array_roundsize (events, eventmax << 1); events = malloc (sizeof (struct epoll_event) * eventmax); } } -void epoll_init (int flags) +static void +epoll_init (int flags) { epoll_fd = epoll_create (256); @@ -73,3 +107,4 @@ void epoll_init (int flags) eventmax = 64; /* intiial number of events receivable per poll */ events = malloc (sizeof (struct epoll_event) * eventmax); } +