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

Comparing libev/ev_poll.c (file contents):
Revision 1.22 by root, Wed Apr 9 22:33:55 2008 UTC vs.
Revision 1.41 by root, Thu Jun 20 22:44:59 2019 UTC

1/* 1/*
2 * libev poll fd activity backend 2 * libev poll fd activity backend
3 * 3 *
4 * Copyright (c) 2007 Marc Alexander Lehmann <libev@schmorp.de> 4 * Copyright (c) 2007,2008,2009,2010,2011,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 *
10 * 1. Redistributions of source code must retain the above copyright notice, 10 * 1. Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer.
12 * 12 *
13 * 2. Redistributions in binary form must reproduce the above copyright 13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the 14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution. 15 * documentation and/or other materials provided with the distribution.
16 * 16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- 18 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER-
19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO 19 * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- 20 * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE-
21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 21 * CIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
… …
37 * either the BSD or the GPL. 37 * either the BSD or the GPL.
38 */ 38 */
39 39
40#include <poll.h> 40#include <poll.h>
41 41
42void inline_size 42inline_size
43void
43pollidx_init (int *base, int count) 44pollidx_init (int *base, int count)
44{ 45{
46 /* consider using memset (.., -1, ...), which is practically guaranteed
47 * to work on all systems implementing poll */
45 while (count--) 48 while (count--)
46 *base++ = -1; 49 *base++ = -1;
47} 50}
48 51
49static void 52static void
… …
59 idx = pollidxs [fd]; 62 idx = pollidxs [fd];
60 63
61 if (idx < 0) /* need to allocate a new pollfd */ 64 if (idx < 0) /* need to allocate a new pollfd */
62 { 65 {
63 pollidxs [fd] = idx = pollcnt++; 66 pollidxs [fd] = idx = pollcnt++;
64 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); 67 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
65 polls [idx].fd = fd; 68 polls [idx].fd = fd;
66 } 69 }
67 70
68 assert (polls [idx].fd == fd); 71 assert (polls [idx].fd == fd);
69 72
… …
84} 87}
85 88
86static void 89static void
87poll_poll (EV_P_ ev_tstamp timeout) 90poll_poll (EV_P_ ev_tstamp timeout)
88{ 91{
92 struct pollfd *p;
89 int i; 93 int res;
94
95 EV_RELEASE_CB;
90 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); 96 res = poll (polls, pollcnt, timeout * 1e3);
97 EV_ACQUIRE_CB;
91 98
92 if (expect_false (res < 0)) 99 if (expect_false (res < 0))
93 { 100 {
94 if (errno == EBADF) 101 if (errno == EBADF)
95 fd_ebadf (EV_A); 102 fd_ebadf (EV_A);
96 else if (errno == ENOMEM && !syserr_cb) 103 else if (errno == ENOMEM && !syserr_cb)
97 fd_enomem (EV_A); 104 fd_enomem (EV_A);
98 else if (errno != EINTR) 105 else if (errno != EINTR)
99 syserr ("(libev) poll"); 106 ev_syserr ("(libev) poll");
100 } 107 }
101 else if (res > 0) 108 else
102 for (i = 0; i < pollcnt; ++i) 109 for (p = polls; res; ++p)
110 {
111 assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
112
113 if (expect_false (p->revents)) /* this expect is debatable */
114 {
115 --res;
116
103 if (expect_false (polls [i].revents & POLLNVAL)) 117 if (expect_false (p->revents & POLLNVAL))
104 fd_kill (EV_A_ polls [i].fd); 118 fd_kill (EV_A_ p->fd);
105 else 119 else
106 fd_event ( 120 fd_event (
107 EV_A_ 121 EV_A_
108 polls [i].fd, 122 p->fd,
109 (polls [i].revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 123 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
110 | (polls [i].revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 124 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
111 ); 125 );
126 }
127 }
112} 128}
113 129
114int inline_size 130inline_size
131int
115poll_init (EV_P_ int flags) 132poll_init (EV_P_ int flags)
116{ 133{
117 backend_fudge = 0.; /* posix says this is zero */ 134 backend_mintime = 1e-3;
118 backend_modify = poll_modify; 135 backend_modify = poll_modify;
119 backend_poll = poll_poll; 136 backend_poll = poll_poll;
120 137
121 pollidxs = 0; pollidxmax = 0; 138 pollidxs = 0; pollidxmax = 0;
122 polls = 0; pollmax = 0; pollcnt = 0; 139 polls = 0; pollmax = 0; pollcnt = 0;
123 140
124 return EVBACKEND_POLL; 141 return EVBACKEND_POLL;
125} 142}
126 143
127void inline_size 144inline_size
145void
128poll_destroy (EV_P) 146poll_destroy (EV_P)
129{ 147{
130 ev_free (pollidxs); 148 ev_free (pollidxs);
131 ev_free (polls); 149 ev_free (polls);
132} 150}

Diff Legend

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