| … | |
… | |
| 21 | #include <sys/time.h> |
21 | #include <sys/time.h> |
| 22 | |
22 | |
| 23 | #include <algorithm> |
23 | #include <algorithm> |
| 24 | #include <functional> |
24 | #include <functional> |
| 25 | |
25 | |
|
|
26 | #include "gettext.h" |
|
|
27 | |
| 26 | #include "slog.h" |
28 | #include "slog.h" |
| 27 | #include "iom.h" |
29 | #include "iom.h" |
| 28 | |
30 | |
|
|
31 | tstamp NOW; |
|
|
32 | bool iom_valid; |
|
|
33 | io_manager iom; |
|
|
34 | |
| 29 | inline bool lowest_first (const time_watcher *a, const time_watcher *b) |
35 | inline bool earliest_first (const time_watcher *a, const time_watcher *b) |
| 30 | { |
36 | { |
| 31 | return a->at > b->at; |
37 | return a->at > b->at; |
| 32 | } |
38 | } |
| 33 | |
39 | |
| 34 | tstamp NOW; |
|
|
| 35 | |
|
|
| 36 | io_manager iom; |
|
|
| 37 | |
|
|
| 38 | void time_watcher::set (tstamp when) |
40 | void time_watcher::set (tstamp when) |
| 39 | { |
41 | { |
| 40 | at = when; |
42 | at = when; |
|
|
43 | |
|
|
44 | if (registered) |
|
|
45 | iom.reschedule_time_watchers (); |
|
|
46 | } |
|
|
47 | |
|
|
48 | void time_watcher::trigger () |
|
|
49 | { |
|
|
50 | call (*this); |
| 41 | |
51 | |
| 42 | if (registered) |
52 | if (registered) |
| 43 | iom.reschedule_time_watchers (); |
53 | iom.reschedule_time_watchers (); |
| 44 | else |
54 | else |
| 45 | iom.reg (this); |
55 | iom.reg (this); |
| 46 | } |
56 | } |
| 47 | |
57 | |
| 48 | void time_watcher::trigger () |
58 | time_watcher::~time_watcher () |
| 49 | { |
59 | { |
| 50 | call (at); |
60 | if (iom_valid) |
|
|
61 | iom.unreg (this); |
|
|
62 | } |
|
|
63 | |
|
|
64 | void io_watcher::set(int fd_, short events_) |
|
|
65 | { |
|
|
66 | fd = fd_; |
|
|
67 | events = events_; |
| 51 | |
68 | |
| 52 | if (registered) |
69 | if (registered) |
| 53 | iom.reschedule_time_watchers (); |
70 | { |
| 54 | else |
71 | iom.unreg (this); |
| 55 | iom.reg (this); |
72 | iom.reg (this); |
|
|
73 | } |
| 56 | } |
74 | } |
| 57 | |
75 | |
| 58 | void time_watcher::start () |
76 | io_watcher::~io_watcher () |
| 59 | { |
77 | { |
| 60 | if (!registered) |
78 | if (iom_valid) |
| 61 | iom.reg (this); |
79 | iom.unreg (this); |
| 62 | } |
80 | } |
| 63 | |
81 | |
| 64 | void io_manager::reg (int fd, short events, io_watcher *w) |
82 | void io_manager::reg (io_watcher *w) |
| 65 | { |
83 | { |
|
|
84 | if (!w->registered) |
|
|
85 | { |
|
|
86 | w->registered = true; |
|
|
87 | |
| 66 | pollfd pfd; |
88 | pollfd pfd; |
| 67 | |
89 | |
| 68 | pfd.fd = fd; |
90 | pfd.fd = w->fd; |
| 69 | pfd.events = events; |
91 | pfd.events = w->events; |
| 70 | |
92 | |
| 71 | pfs.push_back (pfd); |
93 | pfs.push_back (pfd); |
| 72 | iow.push_back (w); |
94 | iow.push_back (w); |
|
|
95 | } |
| 73 | } |
96 | } |
| 74 | |
97 | |
| 75 | void io_manager::unreg (io_watcher *w) |
98 | void io_manager::unreg (io_watcher *w) |
| 76 | { |
99 | { |
|
|
100 | if (w->registered) |
|
|
101 | { |
|
|
102 | w->registered = false; |
|
|
103 | |
| 77 | unsigned int sz = iow.size (); |
104 | unsigned int sz = iow.size (); |
| 78 | unsigned int i = find (iow.begin (), iow.end (), w) - iow.begin (); |
105 | unsigned int i = find (iow.begin (), iow.end (), w) - iow.begin (); |
| 79 | |
106 | |
| 80 | if (i != sz) |
107 | assert (i != sz); |
| 81 | { |
108 | |
| 82 | if (sz == 1) |
109 | if (sz == 1) |
| 83 | { |
110 | { |
| 84 | pfs.clear (); |
111 | pfs.clear (); |
| 85 | iow.clear (); |
112 | iow.clear (); |
| 86 | } |
113 | } |
| … | |
… | |
| 97 | } |
124 | } |
| 98 | } |
125 | } |
| 99 | |
126 | |
| 100 | void io_manager::reschedule_time_watchers () |
127 | void io_manager::reschedule_time_watchers () |
| 101 | { |
128 | { |
| 102 | make_heap (tw.begin (), tw.end (), lowest_first); |
129 | make_heap (tw.begin (), tw.end (), earliest_first); |
| 103 | } |
130 | } |
| 104 | |
131 | |
| 105 | void io_manager::reg (time_watcher *w) |
132 | void io_manager::reg (time_watcher *w) |
| 106 | { |
133 | { |
|
|
134 | if (!w->registered) |
|
|
135 | { |
|
|
136 | w->registered = true; |
|
|
137 | |
|
|
138 | tw.push_back (w); |
|
|
139 | push_heap (tw.begin (), tw.end (), earliest_first); |
|
|
140 | } |
|
|
141 | } |
|
|
142 | |
|
|
143 | void io_manager::unreg (time_watcher *w) |
|
|
144 | { |
| 107 | if (w->registered) |
145 | if (w->registered) |
| 108 | slog (L_CRIT, "FATAL: io_manager::reg(time_watcher) called on already-registered watcher"); |
146 | { |
| 109 | |
|
|
| 110 | w->registered = true; |
147 | w->registered = false; |
| 111 | |
148 | |
| 112 | tw.push_back (w); |
|
|
| 113 | push_heap (tw.begin (), tw.end (), lowest_first); |
|
|
| 114 | } |
|
|
| 115 | |
|
|
| 116 | void io_manager::unreg (time_watcher *w) |
|
|
| 117 | { |
|
|
| 118 | if (w->registered) |
|
|
| 119 | { |
|
|
| 120 | unsigned int sz = tw.size (); |
149 | unsigned int sz = tw.size (); |
| 121 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
150 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
| 122 | |
151 | |
| 123 | if (i != sz) |
152 | assert (i != sz); |
| 124 | { |
153 | |
| 125 | if (i != sz - 1) |
154 | if (i != sz - 1) |
| 126 | tw[i] = tw[sz - 1]; |
155 | tw[i] = tw[sz - 1]; |
| 127 | |
156 | |
| 128 | tw.pop_back (); |
157 | tw.pop_back (); |
| 129 | reschedule_time_watchers (); |
158 | reschedule_time_watchers (); |
| 130 | } |
|
|
| 131 | |
|
|
| 132 | w->registered = false; |
|
|
| 133 | } |
159 | } |
| 134 | } |
160 | } |
| 135 | |
161 | |
| 136 | inline void set_now (void) |
162 | inline void set_now (void) |
| 137 | { |
163 | { |
| … | |
… | |
| 151 | while (tw[0]->at <= NOW) |
177 | while (tw[0]->at <= NOW) |
| 152 | { |
178 | { |
| 153 | // remove the first watcher |
179 | // remove the first watcher |
| 154 | time_watcher *w = tw[0]; |
180 | time_watcher *w = tw[0]; |
| 155 | |
181 | |
| 156 | pop_heap (tw.begin (), tw.end (), lowest_first); |
182 | pop_heap (tw.begin (), tw.end (), earliest_first); |
| 157 | tw.pop_back (); |
183 | tw.pop_back (); |
| 158 | |
184 | |
| 159 | w->registered = false; |
185 | w->registered = false; |
| 160 | |
186 | |
| 161 | // call it |
187 | // call it |
| 162 | w->call (w->at); |
188 | w->call (*w); |
| 163 | |
189 | |
| 164 | // re-add it if necessary |
190 | // re-add it if necessary |
| 165 | if (w->at >= 0 && !w->registered) |
191 | if (w->at >= 0 && !w->registered) |
| 166 | reg (w); |
192 | reg (w); |
| 167 | } |
193 | } |
| … | |
… | |
| 170 | |
196 | |
| 171 | int fds = poll (&pfs[0], pfs.size (), timeout); |
197 | int fds = poll (&pfs[0], pfs.size (), timeout); |
| 172 | |
198 | |
| 173 | set_now (); |
199 | set_now (); |
| 174 | |
200 | |
| 175 | for (unsigned int i = iow.size (); fds > 0 && i--; ) |
201 | vector<io_watcher *>::iterator w; |
|
|
202 | vector<pollfd>::iterator p; |
|
|
203 | |
|
|
204 | for (w = iow.begin (), p = pfs.begin (); |
|
|
205 | fds > 0 && w < iow.end (); |
|
|
206 | ++w, ++p) |
| 176 | if (pfs[i].revents) |
207 | if (p->revents) |
| 177 | { |
208 | { |
| 178 | --fds; |
209 | --fds; |
| 179 | iow[i]->call (pfs[i].revents); |
210 | |
|
|
211 | if (p->revents & POLLNVAL) |
|
|
212 | { |
|
|
213 | slog (L_ERR, _("io_watcher started on illegal file descriptor, disabling.")); |
|
|
214 | (*w)->stop (); |
|
|
215 | } |
|
|
216 | else |
|
|
217 | (*w)->call (**w, p->revents); |
| 180 | } |
218 | } |
| 181 | } |
219 | } |
| 182 | } |
220 | } |
| 183 | |
221 | |
| 184 | void io_manager::idle_cb (tstamp &ts) |
222 | void io_manager::idle_cb (time_watcher &w) |
| 185 | { |
223 | { |
| 186 | ts = NOW + 86400; // wake up every day, for no good reason |
224 | w.at = NOW + 86400; // wake up every day, for no good reason |
| 187 | } |
225 | } |
| 188 | |
226 | |
| 189 | io_manager::io_manager () |
227 | io_manager::io_manager () |
| 190 | { |
228 | { |
|
|
229 | iom_valid = true; |
|
|
230 | |
| 191 | set_now (); |
231 | set_now (); |
| 192 | idle = new time_watcher (this, &io_manager::idle_cb); |
232 | idle = new time_watcher (this, &io_manager::idle_cb); |
| 193 | idle->start (0); |
233 | idle->start (0); |
| 194 | } |
234 | } |
| 195 | |
235 | |
| 196 | io_manager::~io_manager () |
236 | io_manager::~io_manager () |
| 197 | { |
237 | { |
| 198 | // |
238 | iom_valid = false; |
| 199 | } |
239 | } |
| 200 | |
240 | |
