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.34 by root, Wed Mar 31 11:57:35 2010 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,2008,2009,2010 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 practically guaranteed 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
… …
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);
96 EV_ACQUIRE_CB; 99 EV_ACQUIRE_CB;
97 100
98 if (expect_false (res < 0)) 101 if (expect_false (res < 0))
99 { 102 {
100 if (errno == EBADF) 103 if (errno == EBADF)
… …
124 ); 127 );
125 } 128 }
126 } 129 }
127} 130}
128 131
129int inline_size 132inline_size
133int
130poll_init (EV_P_ int flags) 134poll_init (EV_P_ int flags)
131{ 135{
132 backend_fudge = 0.; /* posix says this is zero */ 136 backend_mintime = 1e-3;
133 backend_modify = poll_modify; 137 backend_modify = poll_modify;
134 backend_poll = poll_poll; 138 backend_poll = poll_poll;
135 139
136 pollidxs = 0; pollidxmax = 0; 140 pollidxs = 0; pollidxmax = 0;
137 polls = 0; pollmax = 0; pollcnt = 0; 141 polls = 0; pollmax = 0; pollcnt = 0;
138 142
139 return EVBACKEND_POLL; 143 return EVBACKEND_POLL;
140} 144}
141 145
142void inline_size 146inline_size
147void
143poll_destroy (EV_P) 148poll_destroy (EV_P)
144{ 149{
145 ev_free (pollidxs); 150 ev_free (pollidxs);
146 ev_free (polls); 151 ev_free (polls);
147} 152}

Diff Legend

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