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.27 by root, Wed Oct 29 06:32:48 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,2008 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{
45 /* consider using memset (.., -1, ...), which is pratically guarenteed 46 /* consider using memset (.., -1, ...), which is practically guaranteed
46 * to work on all systems implementing poll */ 47 * to work on all systems implementing poll */
47 while (count--) 48 while (count--)
48 *base++ = -1; 49 *base++ = -1;
49} 50}
50 51
… …
61 idx = pollidxs [fd]; 62 idx = pollidxs [fd];
62 63
63 if (idx < 0) /* need to allocate a new pollfd */ 64 if (idx < 0) /* need to allocate a new pollfd */
64 { 65 {
65 pollidxs [fd] = idx = pollcnt++; 66 pollidxs [fd] = idx = pollcnt++;
66 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); 67 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
67 polls [idx].fd = fd; 68 polls [idx].fd = fd;
68 } 69 }
69 70
70 assert (polls [idx].fd == fd); 71 assert (polls [idx].fd == fd);
71 72
… …
87 88
88static void 89static void
89poll_poll (EV_P_ ev_tstamp timeout) 90poll_poll (EV_P_ ev_tstamp timeout)
90{ 91{
91 struct pollfd *p; 92 struct pollfd *p;
93 int res;
94
95 EV_RELEASE_CB;
92 int res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); 96 res = poll (polls, pollcnt, timeout * 1e3);
97 EV_ACQUIRE_CB;
93 98
94 if (expect_false (res < 0)) 99 if (expect_false (res < 0))
95 { 100 {
96 if (errno == EBADF) 101 if (errno == EBADF)
97 fd_ebadf (EV_A); 102 fd_ebadf (EV_A);
… …
100 else if (errno != EINTR) 105 else if (errno != EINTR)
101 ev_syserr ("(libev) poll"); 106 ev_syserr ("(libev) poll");
102 } 107 }
103 else 108 else
104 for (p = polls; res; ++p) 109 for (p = polls; res; ++p)
105 if (expect_false (p->revents)) /* this expect is debatable */
106 { 110 {
107 --res; 111 assert (("libev: poll() returned illegal result, broken BSD kernel?", p < polls + pollcnt));
108 112
113 if (expect_false (p->revents)) /* this expect is debatable */
114 {
115 --res;
116
109 if (expect_false (p->revents & POLLNVAL)) 117 if (expect_false (p->revents & POLLNVAL))
110 fd_kill (EV_A_ p->fd); 118 fd_kill (EV_A_ p->fd);
111 else 119 else
112 fd_event ( 120 fd_event (
113 EV_A_ 121 EV_A_
114 p->fd, 122 p->fd,
115 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 123 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
116 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 124 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
117 ); 125 );
118 } 126 }
127 }
119} 128}
120 129
121int inline_size 130inline_size
131int
122poll_init (EV_P_ int flags) 132poll_init (EV_P_ int flags)
123{ 133{
124 backend_fudge = 0.; /* posix says this is zero */ 134 backend_mintime = 1e-3;
125 backend_modify = poll_modify; 135 backend_modify = poll_modify;
126 backend_poll = poll_poll; 136 backend_poll = poll_poll;
127 137
128 pollidxs = 0; pollidxmax = 0; 138 pollidxs = 0; pollidxmax = 0;
129 polls = 0; pollmax = 0; pollcnt = 0; 139 polls = 0; pollmax = 0; pollcnt = 0;
130 140
131 return EVBACKEND_POLL; 141 return EVBACKEND_POLL;
132} 142}
133 143
134void inline_size 144inline_size
145void
135poll_destroy (EV_P) 146poll_destroy (EV_P)
136{ 147{
137 ev_free (pollidxs); 148 ev_free (pollidxs);
138 ev_free (polls); 149 ev_free (polls);
139} 150}

Diff Legend

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