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

Diff Legend

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