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.31 by root, Sun Jul 19 04:11:27 2009 UTC vs.
Revision 1.45 by root, Sun Jul 7 06:00:32 2019 UTC

1/* 1/*
2 * libev poll fd activity backend 2 * libev poll fd activity backend
3 * 3 *
4 * Copyright (c) 2007,2008,2009 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
43pollidx_init (int *base, int count) 43void
44array_needsize_pollidx (int *base, int offset, int count)
44{ 45{
45 /* consider using memset (.., -1, ...), which is pratically guarenteed 46 /* using memset (.., -1, ...) is tempting, we we try
46 * to work on all systems implementing poll */ 47 * to be ultraportable
48 */
49 base += offset;
47 while (count--) 50 while (count--)
48 *base++ = -1; 51 *base++ = -1;
49} 52}
50 53
51static void 54static void
… …
54 int idx; 57 int idx;
55 58
56 if (oev == nev) 59 if (oev == nev)
57 return; 60 return;
58 61
59 array_needsize (int, pollidxs, pollidxmax, fd + 1, pollidx_init); 62 array_needsize (int, pollidxs, pollidxmax, fd + 1, array_needsize_pollidx);
60 63
61 idx = pollidxs [fd]; 64 idx = pollidxs [fd];
62 65
63 if (idx < 0) /* need to allocate a new pollfd */ 66 if (idx < 0) /* need to allocate a new pollfd */
64 { 67 {
65 pollidxs [fd] = idx = pollcnt++; 68 pollidxs [fd] = idx = pollcnt++;
66 array_needsize (struct pollfd, polls, pollmax, pollcnt, EMPTY2); 69 array_needsize (struct pollfd, polls, pollmax, pollcnt, array_needsize_noinit);
67 polls [idx].fd = fd; 70 polls [idx].fd = fd;
68 } 71 }
69 72
70 assert (polls [idx].fd == fd); 73 assert (polls [idx].fd == fd);
71 74
… …
75 | (nev & EV_WRITE ? POLLOUT : 0); 78 | (nev & EV_WRITE ? POLLOUT : 0);
76 else /* remove pollfd */ 79 else /* remove pollfd */
77 { 80 {
78 pollidxs [fd] = -1; 81 pollidxs [fd] = -1;
79 82
80 if (expect_true (idx < --pollcnt)) 83 if (ecb_expect_true (idx < --pollcnt))
81 { 84 {
82 polls [idx] = polls [pollcnt]; 85 polls [idx] = polls [pollcnt];
83 pollidxs [polls [idx].fd] = idx; 86 pollidxs [polls [idx].fd] = idx;
84 } 87 }
85 } 88 }
… …
90{ 93{
91 struct pollfd *p; 94 struct pollfd *p;
92 int res; 95 int res;
93 96
94 EV_RELEASE_CB; 97 EV_RELEASE_CB;
95 res = poll (polls, pollcnt, (int)ceil (timeout * 1000.)); 98 res = poll (polls, pollcnt, timeout * 1e3 + 0.9999);
96 EV_ACQUIRE_CB; 99 EV_ACQUIRE_CB;
97 100
98 if (expect_false (res < 0)) 101 if (ecb_expect_false (res < 0))
99 { 102 {
100 if (errno == EBADF) 103 if (errno == EBADF)
101 fd_ebadf (EV_A); 104 fd_ebadf (EV_A);
102 else if (errno == ENOMEM && !syserr_cb) 105 else if (errno == ENOMEM && !syserr_cb)
103 fd_enomem (EV_A); 106 fd_enomem (EV_A);
104 else if (errno != EINTR) 107 else if (errno != EINTR)
105 ev_syserr ("(libev) poll"); 108 ev_syserr ("(libev) poll");
106 } 109 }
107 else 110 else
108 for (p = polls; res; ++p) 111 for (p = polls; res; ++p)
109 if (expect_false (p->revents)) /* this expect is debatable */
110 { 112 {
111 --res; 113 assert (("libev: poll returned illegal result, broken BSD kernel?", p < polls + pollcnt));
112 114
115 if (ecb_expect_false (p->revents)) /* this expect is debatable */
116 {
117 --res;
118
113 if (expect_false (p->revents & POLLNVAL)) 119 if (ecb_expect_false (p->revents & POLLNVAL))
120 {
121 assert (("libev: poll found invalid fd in poll set", 0));
114 fd_kill (EV_A_ p->fd); 122 fd_kill (EV_A_ p->fd);
123 }
115 else 124 else
116 fd_event ( 125 fd_event (
117 EV_A_ 126 EV_A_
118 p->fd, 127 p->fd,
119 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0) 128 (p->revents & (POLLOUT | POLLERR | POLLHUP) ? EV_WRITE : 0)
120 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0) 129 | (p->revents & (POLLIN | POLLERR | POLLHUP) ? EV_READ : 0)
121 ); 130 );
122 } 131 }
132 }
123} 133}
124 134
125int inline_size 135inline_size
136int
126poll_init (EV_P_ int flags) 137poll_init (EV_P_ int flags)
127{ 138{
128 backend_fudge = 0.; /* posix says this is zero */ 139 backend_mintime = 1e-3;
129 backend_modify = poll_modify; 140 backend_modify = poll_modify;
130 backend_poll = poll_poll; 141 backend_poll = poll_poll;
131 142
132 pollidxs = 0; pollidxmax = 0; 143 pollidxs = 0; pollidxmax = 0;
133 polls = 0; pollmax = 0; pollcnt = 0; 144 polls = 0; pollmax = 0; pollcnt = 0;
134 145
135 return EVBACKEND_POLL; 146 return EVBACKEND_POLL;
136} 147}
137 148
138void inline_size 149inline_size
150void
139poll_destroy (EV_P) 151poll_destroy (EV_P)
140{ 152{
141 ev_free (pollidxs); 153 ev_free (pollidxs);
142 ev_free (polls); 154 ev_free (polls);
143} 155}

Diff Legend

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