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 | |
|
|
24 | #include <sys/select.h> |
22 | #include <sys/time.h> |
25 | #include <sys/time.h> |
23 | |
26 | |
24 | #include <algorithm> |
|
|
25 | #include <functional> |
|
|
26 | |
|
|
27 | #include "slog.h" |
|
|
28 | |
|
|
29 | #include "iom.h" |
27 | #include "iom.h" |
30 | |
28 | |
31 | inline bool lowest_first (const time_watcher *a, const time_watcher *b) |
29 | // TSTAMP_MAX must still fit into a positive struct timeval |
32 | { |
30 | #define TSTAMP_MAX (double)(1UL<<31) |
33 | return a->at > b->at; |
|
|
34 | } |
|
|
35 | |
31 | |
36 | tstamp NOW; |
32 | tstamp NOW; |
37 | |
33 | static bool iom_valid; |
38 | io_manager iom; |
34 | io_manager iom; |
39 | |
35 | |
40 | void time_watcher::set (tstamp when) |
36 | template<class watcher> |
|
|
37 | void io_manager::reg (watcher *w, io_manager_vec<watcher> &queue) |
41 | { |
38 | { |
42 | iom.unreg (this); |
39 | if (!iom_valid) |
43 | at = when; |
40 | abort (); |
|
|
41 | |
|
|
42 | if (!w->active) |
|
|
43 | { |
|
|
44 | queue.push_back (w); |
|
|
45 | w->active = queue.size (); |
|
|
46 | } |
|
|
47 | } |
|
|
48 | |
|
|
49 | template<class watcher> |
|
|
50 | void io_manager::unreg (watcher *w, io_manager_vec<watcher> &queue) |
|
|
51 | { |
|
|
52 | if (!iom_valid) |
|
|
53 | return; |
|
|
54 | |
|
|
55 | if (w->active) |
|
|
56 | { |
|
|
57 | queue [w->active - 1] = 0; |
|
|
58 | w->active = 0; |
|
|
59 | } |
|
|
60 | } |
|
|
61 | |
|
|
62 | #if IOM_TIME |
|
|
63 | void time_watcher::trigger () |
|
|
64 | { |
|
|
65 | call (*this); |
|
|
66 | |
44 | iom.reg (this); |
67 | iom.reg (this); |
45 | } |
68 | } |
46 | |
69 | |
47 | void io_manager::reg (int fd, short events, io_watcher *w) |
70 | void io_manager::reg (time_watcher *w) { reg (w, tw); } |
48 | { |
71 | void io_manager::unreg (time_watcher *w) { unreg (w, tw); } |
49 | pollfd pfd; |
72 | #endif |
50 | |
73 | |
51 | pfd.fd = fd; |
74 | #if IOM_IO |
52 | pfd.events = events; |
75 | void io_manager::reg (io_watcher *w) { reg (w, iow); } |
53 | |
|
|
54 | pfs.push_back (pfd); |
|
|
55 | iow.push_back (w); |
|
|
56 | } |
|
|
57 | |
|
|
58 | void io_manager::unreg (io_watcher *w) |
76 | void io_manager::unreg (io_watcher *w) { unreg (w, iow); } |
59 | { |
77 | #endif |
60 | unsigned int sz = iow.size (); |
|
|
61 | unsigned int i = find (iow.begin (), iow.end (), w) - iow.begin (); |
|
|
62 | |
78 | |
63 | if (i != sz) |
79 | #if IOM_CHECK |
|
|
80 | void io_manager::reg (check_watcher *w) { reg (w, cw); } |
|
|
81 | void io_manager::unreg (check_watcher *w) { unreg (w, cw); } |
|
|
82 | #endif |
|
|
83 | |
|
|
84 | #if IOM_IDLE |
|
|
85 | void io_manager::reg (idle_watcher *w) { reg (w, iw); } |
|
|
86 | void io_manager::unreg (idle_watcher *w) { unreg (w, iw); } |
|
|
87 | #endif |
|
|
88 | |
|
|
89 | #if IOM_TIME |
|
|
90 | inline void set_now (void) |
|
|
91 | { |
|
|
92 | struct timeval tv; |
|
|
93 | |
|
|
94 | gettimeofday (&tv, 0); |
|
|
95 | |
|
|
96 | NOW = (tstamp)tv.tv_sec + (tstamp)tv.tv_usec / 1000000; |
|
|
97 | #endif |
|
|
98 | } |
|
|
99 | |
|
|
100 | void io_manager::loop () |
|
|
101 | { |
|
|
102 | #if IOM_TIME |
|
|
103 | set_now (); |
|
|
104 | #endif |
|
|
105 | |
|
|
106 | for (;;) |
64 | { |
107 | { |
65 | if (sz == 1) |
108 | struct timeval *to = 0; |
|
|
109 | struct timeval tval; |
|
|
110 | |
|
|
111 | #if IOM_IDLE |
|
|
112 | if (iw.size ()) |
66 | { |
113 | { |
67 | pfs.clear (); |
114 | tval.tv_sec = 0; |
68 | iow.clear (); |
115 | tval.tv_usec = 0; |
69 | } |
116 | to = &tval; |
70 | else if (i == sz - 1) |
|
|
71 | { |
|
|
72 | iow.pop_back (); |
|
|
73 | pfs.pop_back (); |
|
|
74 | } |
117 | } |
75 | else |
118 | else |
|
|
119 | #endif |
76 | { |
120 | { |
77 | iow[i] = iow[sz - 1]; iow.pop_back (); |
121 | #if IOM_TIME |
78 | pfs[i] = pfs[sz - 1]; pfs.pop_back (); |
122 | time_watcher *next; |
|
|
123 | |
|
|
124 | for (;;) |
|
|
125 | { |
|
|
126 | next = tw[0]; // the first time-watcher must exist at ALL times |
|
|
127 | |
|
|
128 | for (int i = tw.size (); i--; ) |
|
|
129 | if (!tw[i]) |
|
|
130 | tw.erase_unordered (i); |
|
|
131 | else if (tw[i]->at < next->at) |
|
|
132 | next = tw[i]; |
|
|
133 | |
|
|
134 | if (next->at > NOW) |
|
|
135 | { |
|
|
136 | if (next != tw[0]) |
|
|
137 | { |
|
|
138 | double diff = next->at - NOW; |
|
|
139 | tval.tv_sec = (int)diff; |
|
|
140 | tval.tv_usec = (int)((diff - tval.tv_sec) * 1000000); |
|
|
141 | to = &tval; |
|
|
142 | } |
|
|
143 | break; |
|
|
144 | } |
|
|
145 | else |
|
|
146 | { |
|
|
147 | unreg (next); |
|
|
148 | next->call (*next); |
|
|
149 | } |
|
|
150 | } |
|
|
151 | #endif |
79 | } |
152 | } |
|
|
153 | |
|
|
154 | #if IOM_CHECK |
|
|
155 | for (int i = cw.size (); i--; ) |
|
|
156 | if (!cw[i]) |
|
|
157 | cw.erase_unordered (i); |
|
|
158 | else |
|
|
159 | cw[i]->call (*cw[i]); |
|
|
160 | #endif |
|
|
161 | |
|
|
162 | #if IOM_IO |
|
|
163 | fd_set rfd, wfd, efd; |
|
|
164 | |
|
|
165 | FD_ZERO (&rfd); |
|
|
166 | FD_ZERO (&wfd); |
|
|
167 | |
|
|
168 | int fds = 0; |
|
|
169 | |
|
|
170 | for (io_manager_vec<io_watcher>::iterator i = iow.end (); i-- > iow.begin (); ) |
|
|
171 | if (*i) |
|
|
172 | { |
|
|
173 | if ((*i)->events & EVENT_READ ) FD_SET ((*i)->fd, &rfd); |
|
|
174 | if ((*i)->events & EVENT_WRITE) FD_SET ((*i)->fd, &wfd); |
|
|
175 | |
|
|
176 | if ((*i)->fd >= fds) fds = (*i)->fd + 1; |
|
|
177 | } |
|
|
178 | |
|
|
179 | if (!to && !fds) //TODO: also check idle_watchers and check_watchers |
|
|
180 | break; // no events |
|
|
181 | |
|
|
182 | fds = select (fds, &rfd, &wfd, &efd, to); |
|
|
183 | # if IOM_TIME |
|
|
184 | set_now (); |
|
|
185 | # endif |
|
|
186 | |
|
|
187 | if (fds > 0) |
|
|
188 | for (int i = iow.size (); i--; ) |
|
|
189 | if (!iow[i]) |
|
|
190 | iow.erase_unordered (i); |
|
|
191 | else |
|
|
192 | { |
|
|
193 | short revents = iow[i]->events; |
|
|
194 | |
|
|
195 | if (!FD_ISSET (iow[i]->fd, &rfd)) revents &= ~EVENT_READ; |
|
|
196 | if (!FD_ISSET (iow[i]->fd, &wfd)) revents &= ~EVENT_WRITE; |
|
|
197 | |
|
|
198 | if (revents) |
|
|
199 | iow[i]->call (*iow[i], revents); |
|
|
200 | } |
|
|
201 | else if (fds < 0 && errno != EINTR) |
|
|
202 | { |
|
|
203 | perror ("Error while waiting for I/O or time event"); |
|
|
204 | abort (); |
|
|
205 | } |
|
|
206 | #if IOM_IDLE |
|
|
207 | else |
|
|
208 | for (int i = iw.size (); i--; ) |
|
|
209 | if (!iw[i]) |
|
|
210 | iw.erase_unordered (i); |
|
|
211 | else |
|
|
212 | iw[i]->call (*iw[i]); |
|
|
213 | #endif |
|
|
214 | |
|
|
215 | #elif IOM_TIME |
|
|
216 | if (!to) |
|
|
217 | break; |
|
|
218 | |
|
|
219 | select (0, 0, 0, 0, &to); |
|
|
220 | set_now (); |
|
|
221 | #else |
|
|
222 | break; |
|
|
223 | #endif |
80 | } |
224 | } |
81 | } |
225 | } |
82 | |
226 | |
83 | void io_manager::reg (time_watcher *w) |
227 | // this is a dummy time watcher to ensure that the first |
84 | { |
228 | // time watcher is _always_ valid, this gets rid of a lot |
85 | tw.push_back (w); |
229 | // of null-pointer-checks |
86 | push_heap (tw.begin (), tw.end (), lowest_first); |
230 | static struct tw0 : time_watcher { |
87 | } |
231 | void cb (time_watcher &w) |
88 | |
|
|
89 | void io_manager::unreg (time_watcher *w) |
|
|
90 | { |
|
|
91 | unsigned int sz = tw.size (); |
|
|
92 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
|
|
93 | |
|
|
94 | if (i != sz) |
|
|
95 | { |
232 | { |
96 | if (sz == 1) |
233 | // should never get called |
97 | tw.clear (); |
234 | // reached end-of-time, or tstamp has a bogus definition :) |
98 | else |
235 | abort (); |
99 | { |
236 | } |
100 | if (i != sz - 1) |
|
|
101 | tw[i] = tw[sz - 1]; |
|
|
102 | |
237 | |
103 | tw.pop_back (); |
238 | tw0() |
104 | make_heap (tw.begin (), tw.end (), lowest_first); |
239 | : time_watcher (this, &tw0::cb) |
105 | } |
|
|
106 | } |
240 | { } |
107 | } |
241 | } tw0; |
108 | |
242 | |
109 | inline void set_now (void) |
243 | io_manager::io_manager () |
110 | { |
244 | { |
111 | struct timeval tv; |
245 | iom_valid = true; |
112 | |
246 | |
113 | gettimeofday (&tv, 0); |
247 | #if IOM_TIME |
114 | |
|
|
115 | NOW = (tstamp)tv.tv_sec + (tstamp)tv.tv_usec / 1000000; |
|
|
116 | } |
|
|
117 | |
|
|
118 | void io_manager::loop () |
|
|
119 | { |
|
|
120 | set_now (); |
248 | set_now (); |
121 | |
249 | |
122 | while (!(iow.empty () && tw.empty ())) |
250 | tw0.start (TSTAMP_MAX); |
123 | { |
251 | #endif |
124 | int timeout = tw.empty () |
|
|
125 | ? 3600 * 1000 // wake up at least every hour |
|
|
126 | : (int) ((tw[0]->at - NOW) * 1000); |
|
|
127 | |
|
|
128 | printf ("s%d t%d #%d\n", pfs.size (), timeout, tw.size ()); |
|
|
129 | |
|
|
130 | if (timeout >= 0) |
|
|
131 | { |
|
|
132 | int fds = poll (&pfs[0], pfs.size (), timeout); |
|
|
133 | |
|
|
134 | set_now (); |
|
|
135 | |
|
|
136 | for (unsigned int i = iow.size (); fds && i--; ) |
|
|
137 | if (pfs[i].revents) |
|
|
138 | { |
|
|
139 | --fds; |
|
|
140 | iow[i]->call (pfs[i].revents); |
|
|
141 | } |
|
|
142 | } |
|
|
143 | |
|
|
144 | while (!tw.empty () && tw[0]->at <= NOW) |
|
|
145 | { |
|
|
146 | pop_heap (tw.begin (), tw.end (), lowest_first); |
|
|
147 | (*(tw.end () - 1))->trigger (); |
|
|
148 | push_heap (tw.begin (), tw.end (), lowest_first); |
|
|
149 | } |
|
|
150 | } |
|
|
151 | } |
|
|
152 | |
|
|
153 | io_manager::io_manager () |
|
|
154 | { |
|
|
155 | set_now (); |
|
|
156 | } |
252 | } |
157 | |
253 | |
158 | io_manager::~io_manager () |
254 | io_manager::~io_manager () |
159 | { |
255 | { |
160 | // |
256 | iom_valid = false; |
161 | } |
257 | } |
162 | |
258 | |