ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/gvpe/src/iom.C
(Generate patch)

Comparing gvpe/src/iom.C (file contents):
Revision 1.1 by pcg, Fri Mar 21 20:33:36 2003 UTC vs.
Revision 1.20 by pcg, Fri Apr 2 14:42:45 2004 UTC

1#include <unistd.h>
2/* 1/*
3 iom.C -- I/O multiplexor 2 iom.C -- generic I/O multiplexor
3 Copyright (C) 2003, 2004 Marc Lehmann <pcg@goof.com>
4 4
5 This program is free software; you can redistribute it and/or modify 5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by 6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or 7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version. 8 (at your option) any later version.
… …
15 You should have received a copy of the GNU General Public License 15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software 16 along with this program; if not, write to the Free Software
17 Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 17 Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18*/ 18*/
19 19
20#include "config.h" 20#include <cstdio>
21#include <cstdlib>
22#include <cerrno>
21 23
22#include <sys/time.h> 24#include <sys/time.h>
23 25
24#include <algorithm> 26#include <assert.h>
27
28#if 1 // older unices need these includes for select (2)
29# include <unistd.h>
30# include <sys/types.h>
31#endif
32
33// if the BSDs would at least be marginally POSIX-compatible.. *sigh*
34// until that happens, sys/select.h must come last
35#include <sys/select.h>
36
37// for IOM_SIG
25#include <functional> 38#include <signal.h>
26
27#include "slog.h"
28 39
29#include "iom.h" 40#include "iom.h"
30 41
31inline bool lowest_first (const time_watcher *a, const time_watcher *b) 42// TSTAMP_MAX must still fit into a positive struct timeval
32{ 43#define TSTAMP_MAX (double)(1UL<<31)
33 return a->at > b->at;
34}
35 44
45// this is a dummy time watcher to ensure that the first
46// time watcher is _always_ valid, this gets rid of a lot
47// of null-pointer-checks
48// (must come _before_ iom is being defined)
49static struct tw0 : time_watcher
50 {
51 void cb (time_watcher &w)
52 {
53 // should never get called
54 // reached end-of-time, or tstamp has a bogus definition,
55 // or compiler initilization order broken, or somethine else :)
56 abort ();
57 }
58
59 tw0 ()
60 : time_watcher (this, &tw0::cb)
61 { }
62 } tw0;
63
36timestamp NOW; 64tstamp NOW;
37 65static bool iom_valid;
38io_manager iom; 66io_manager iom;
39 67
40void time_watcher::set (timestamp when) 68template<class watcher>
69void io_manager::reg (watcher *w, io_manager_vec<watcher> &queue)
41{ 70{
42 iom.unreg (this); 71 if (!iom_valid)
43 at = when; 72 abort ();
73
74 if (!w->active)
75 {
76#if IOM_CHECK
77 queue.activity = true;
78#endif
79 queue.push_back (w);
80 w->active = queue.size ();
81 }
82}
83
84template<class watcher>
85void io_manager::unreg (watcher *w, io_manager_vec<watcher> &queue)
86{
87 if (!iom_valid)
88 return;
89
90 if (w->active)
91 {
92 queue [w->active - 1] = 0;
93 w->active = 0;
94 }
95}
96
97#if IOM_TIME
98void time_watcher::trigger ()
99{
100 call (*this);
101
44 iom.reg (this); 102 iom.reg (this);
45} 103}
46 104
47void io_manager::reg (int fd, short events, io_watcher *w) 105void io_manager::reg (time_watcher *w) { reg (w, tw); }
48{ 106void io_manager::unreg (time_watcher *w) { unreg (w, tw); }
49 pollfd pfd; 107#endif
50 108
51 pfd.fd = fd; 109#if IOM_IO
52 pfd.events = events; 110void io_manager::reg (io_watcher *w) { reg (w, iow); }
111void io_manager::unreg (io_watcher *w) { unreg (w, iow); }
112#endif
53 113
54 pfs.push_back (pfd); 114#if IOM_CHECK
55 iow.push_back (w); 115void io_manager::reg (check_watcher *w) { reg (w, cw); }
56} 116void io_manager::unreg (check_watcher *w) { unreg (w, cw); }
117#endif
57 118
119#if IOM_IDLE
120void io_manager::reg (idle_watcher *w) { reg (w, iw); }
121void io_manager::unreg (idle_watcher *w) { unreg (w, iw); }
122#endif
123
124#if IOM_TIME
125inline void set_now (void)
126{
127 struct timeval tv;
128
129 gettimeofday (&tv, 0);
130
131 NOW = (tstamp)tv.tv_sec + (tstamp)tv.tv_usec / 1000000;
132}
133#endif
134
135#if IOM_SIG
136// race conditions galore
137
138void io_manager::sighandler (int signum)
139{
140 assert (0 < signum && signum <= iom.sw.size ());
141
142 sig_vec &sv = *iom.sw [signum - 1];
143
144 for (int i = sv.size (); i--; )
145 if (!sv[i])
146 sv.erase_unordered (i);
147 else
148 sv[i]->call (*sv[i]);
149}
150
151void io_manager::reg (sig_watcher *w)
152{
153 assert (0 < w->signum);
154
155 sw.reserve (w->signum);
156
157 sig_vec *&sv = sw [w->signum - 1];
158
159 if (!sv)
160 {
161 sv = new sig_vec;
162
163 struct sigaction sa;
164 sa.sa_handler = io_manager::sighandler;
165 sigfillset (&sa.sa_mask);
166 sa.sa_flags = 0;
167
168 if (sigaction (w->signum, &sa, 0))
169 {
170 perror ("Error while installing signal handler");
171 abort ();
172 }
173 }
174
175 reg (w, *sv);
176}
177
58void io_manager::unreg (io_watcher *w) 178void io_manager::unreg (sig_watcher *w)
59{ 179{
60 unsigned int sz = iow.size (); 180 assert (0 < w->signum && w->signum <= sw.size ());
61 unsigned int i = find (iow.begin (), iow.end (), w) - iow.begin (); 181
182 unreg (w, *sw [w->signum - 1]);
183}
62 184
63 if (i != sz) 185void sig_watcher::start (int signum)
186{
187 stop ();
188 this->signum = signum;
189 iom.reg (this);
190}
191#endif
192
193void io_manager::loop ()
194{
195#if IOM_TIME
196 set_now ();
197#endif
198
199 for (;;)
64 { 200 {
65 if (sz == 1) 201 struct timeval *to = 0;
66 { 202 struct timeval tval;
67 pfs.clear (); 203
68 iow.clear (); 204#if IOM_IDLE
205 if (iw.size ())
69 } 206 {
70 else if (i == sz - 1) 207 tval.tv_sec = 0;
71 { 208 tval.tv_usec = 0;
72 iow.pop_back (); 209 to = &tval;
73 pfs.pop_back ();
74 } 210 }
75 else 211 else
212#endif
213
214 {
215#if IOM_TIME
216 time_watcher *next;
217
218 for (;;)
219 {
220 next = tw[0]; // the first time-watcher must exist at ALL times
221
222 for (int i = tw.size (); i--; )
223 if (!tw[i])
224 tw.erase_unordered (i);
225 else if (tw[i]->at < next->at)
226 next = tw[i];
227
228 if (next->at > NOW)
229 {
230 if (next != tw[0])
231 {
232 double diff = next->at - NOW;
233 tval.tv_sec = (int)diff;
234 tval.tv_usec = (int) ((diff - tval.tv_sec) * 1000000);
235 to = &tval;
236 }
237 break;
238 }
239 else
240 {
241 unreg (next);
242 next->call (*next);
243 }
244 }
245#endif
246
247 }
248
249#if IOM_CHECK
250 tw.activity = false;
251
252 for (int i = cw.size (); i--; )
253 if (!cw[i])
254 cw.erase_unordered (i);
255 else
256 cw[i]->call (*cw[i]);
257
258 if (tw.activity)
259 {
260 tval.tv_sec = 0;
261 tval.tv_usec = 0;
262 to = &tval;
263 }
264#endif
265
266#if IOM_IO
267 fd_set rfd, wfd;
268
269 FD_ZERO (&rfd);
270 FD_ZERO (&wfd);
271
272 int fds = 0;
273
274 for (io_manager_vec<io_watcher>::iterator i = iow.end (); i-- > iow.begin (); )
275 if (*i)
76 { 276 {
77 iow[i] = iow[sz - 1]; iow.pop_back (); 277 if ((*i)->events & EVENT_READ ) FD_SET ((*i)->fd, &rfd);
78 pfs[i] = pfs[sz - 1]; pfs.pop_back (); 278 if ((*i)->events & EVENT_WRITE) FD_SET ((*i)->fd, &wfd);
279
280 if ((*i)->fd >= fds) fds = (*i)->fd + 1;
79 } 281 }
80 }
81}
82 282
83void io_manager::reg (time_watcher *w) 283 if (!to && !fds) //TODO: also check idle_watchers and check_watchers
84{ 284 break; // no events
85 tw.push_back (w);
86 push_heap (tw.begin (), tw.end (), lowest_first);
87}
88 285
89void io_manager::unreg (time_watcher *w) 286 fds = select (fds, &rfd, &wfd, NULL, to);
90{ 287# if IOM_TIME
91 unsigned int sz = tw.size (); 288 set_now ();
92 unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); 289# endif
93 290
94 if (i != sz) 291 if (fds > 0)
95 { 292 for (int i = iow.size (); i--; )
96 if (sz == 1) 293 if (!iow[i])
97 tw.clear (); 294 iow.erase_unordered (i);
295 else
296 {
297 short revents = iow[i]->events;
298
299 if (!FD_ISSET (iow[i]->fd, &rfd)) revents &= ~EVENT_READ;
300 if (!FD_ISSET (iow[i]->fd, &wfd)) revents &= ~EVENT_WRITE;
301
302 if (revents)
303 iow[i]->call (*iow[i], revents);
304 }
305 else if (fds < 0 && errno != EINTR)
306 {
307 perror ("Error while waiting for I/O or time event");
308 abort ();
309 }
310#if IOM_IDLE
98 else 311 else
99 { 312 for (int i = iw.size (); i--; )
100 if (i != sz - 1) 313 if (!iw[i])
101 tw[i] = tw[sz - 1]; 314 iw.erase_unordered (i);
315 else
316 iw[i]->call (*iw[i]);
317#endif
102 318
103 tw.pop_back (); 319#elif IOM_TIME
104 make_heap (tw.begin (), tw.end (), lowest_first); 320 if (!to)
105 } 321 break;
106 }
107}
108 322
109inline void set_now (void) 323 select (0, 0, 0, 0, &to);
110{ 324 set_now ();
111 struct timeval tv; 325#else
326 break;
327#endif
112 328
113 gettimeofday (&tv, 0); 329 }
114
115 NOW = (timestamp)tv.tv_sec + (timestamp)tv.tv_usec / 1000000;
116} 330}
117 331
118void io_manager::loop () 332io_manager::io_manager ()
119{ 333{
334 iom_valid = true;
335
336#if IOM_TIME
120 set_now (); 337 set_now ();
121 338
122 for (;;) 339 tw0.start (TSTAMP_MAX);
123 { 340#endif
124 int timeout = tw.empty () ? -1 : (int) ((tw[0]->at - NOW) * 1000);
125
126 //printf ("s%d t%d #%d <%f<%f<\n", pfs.size (), timeout, tw.size (), tw[0]->at - NOW, tw[1]->at - NOW);
127
128 if (timeout >= 0)
129 {
130 int fds = poll (&pfs[0], pfs.size (), timeout);
131
132 set_now ();
133
134 for (unsigned int i = iow.size (); fds && i--; )
135 if (pfs[i].revents)
136 {
137 --fds;
138 iow[i]->call (pfs[i].revents);
139 }
140 }
141
142 while (!tw.empty () && tw[0]->at <= NOW)
143 {
144 pop_heap (tw.begin (), tw.end (), lowest_first);
145 time_watcher *w = tw[tw.size () - 1];
146 w->call (w->at);
147 push_heap (tw.begin (), tw.end (), lowest_first);
148 }
149 }
150}
151
152io_manager::io_manager ()
153{
154 set_now ();
155} 341}
156 342
157io_manager::~io_manager () 343io_manager::~io_manager ()
158{ 344{
159 // 345 iom_valid = false;
160} 346}
161 347

Diff Legend

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