… | |
… | |
24 | #include <functional> |
24 | #include <functional> |
25 | |
25 | |
26 | #include "slog.h" |
26 | #include "slog.h" |
27 | #include "iom.h" |
27 | #include "iom.h" |
28 | |
28 | |
29 | inline bool lowest_first (const time_watcher *a, const time_watcher *b) |
29 | inline bool earliest_first (const time_watcher *a, const time_watcher *b) |
30 | { |
30 | { |
31 | return a->at > b->at; |
31 | return a->at > b->at; |
32 | } |
32 | } |
33 | |
33 | |
34 | tstamp NOW; |
34 | tstamp NOW; |
35 | |
35 | |
36 | io_manager iom; |
36 | io_manager iom; |
37 | |
37 | |
38 | void time_watcher::set (tstamp when) |
38 | void time_watcher::set (tstamp when) |
39 | { |
39 | { |
40 | iom.unreg (this); |
|
|
41 | at = when; |
40 | at = when; |
|
|
41 | |
|
|
42 | if (registered) |
|
|
43 | iom.reschedule_time_watchers (); |
|
|
44 | else |
42 | iom.reg (this); |
45 | iom.reg (this); |
43 | } |
46 | } |
44 | |
47 | |
|
|
48 | void time_watcher::trigger () |
|
|
49 | { |
|
|
50 | call (*this); |
|
|
51 | |
|
|
52 | if (registered) |
|
|
53 | iom.reschedule_time_watchers (); |
|
|
54 | else |
|
|
55 | iom.reg (this); |
|
|
56 | } |
|
|
57 | |
|
|
58 | void time_watcher::start () |
|
|
59 | { |
|
|
60 | if (!registered) |
|
|
61 | iom.reg (this); |
|
|
62 | } |
|
|
63 | |
45 | void io_manager::reg (int fd, short events, io_watcher *w) |
64 | void io_manager::reg (io_watcher *w) |
46 | { |
65 | { |
47 | pollfd pfd; |
66 | pollfd pfd; |
48 | |
67 | |
49 | pfd.fd = fd; |
68 | pfd.fd = w->fd; |
50 | pfd.events = events; |
69 | pfd.events = w->events; |
51 | |
70 | |
52 | pfs.push_back (pfd); |
71 | pfs.push_back (pfd); |
53 | iow.push_back (w); |
72 | iow.push_back (w); |
54 | } |
73 | } |
55 | |
74 | |
… | |
… | |
76 | pfs[i] = pfs[sz - 1]; pfs.pop_back (); |
95 | pfs[i] = pfs[sz - 1]; pfs.pop_back (); |
77 | } |
96 | } |
78 | } |
97 | } |
79 | } |
98 | } |
80 | |
99 | |
|
|
100 | void io_manager::reschedule_time_watchers () |
|
|
101 | { |
|
|
102 | make_heap (tw.begin (), tw.end (), earliest_first); |
|
|
103 | } |
|
|
104 | |
81 | void io_manager::reg (time_watcher *w) |
105 | void io_manager::reg (time_watcher *w) |
82 | { |
106 | { |
|
|
107 | if (w->registered) |
|
|
108 | slog (L_CRIT, "FATAL: io_manager::reg(time_watcher) called on already-registered watcher"); |
|
|
109 | |
|
|
110 | w->registered = true; |
|
|
111 | |
83 | tw.push_back (w); |
112 | tw.push_back (w); |
84 | push_heap (tw.begin (), tw.end (), lowest_first); |
113 | push_heap (tw.begin (), tw.end (), earliest_first); |
85 | } |
114 | } |
86 | |
115 | |
87 | void io_manager::unreg (time_watcher *w) |
116 | void io_manager::unreg (time_watcher *w) |
88 | { |
117 | { |
89 | unsigned int sz = tw.size (); |
118 | if (w->registered) |
90 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
|
|
91 | |
|
|
92 | if (i != sz) |
|
|
93 | { |
119 | { |
94 | if (sz == 1) |
120 | unsigned int sz = tw.size (); |
95 | tw.clear (); |
121 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
96 | else |
122 | |
|
|
123 | if (i != sz) |
97 | { |
124 | { |
98 | if (i != sz - 1) |
125 | if (i != sz - 1) |
99 | tw[i] = tw[sz - 1]; |
126 | tw[i] = tw[sz - 1]; |
100 | |
127 | |
101 | tw.pop_back (); |
128 | tw.pop_back (); |
102 | make_heap (tw.begin (), tw.end (), lowest_first); |
129 | reschedule_time_watchers (); |
103 | } |
130 | } |
|
|
131 | |
|
|
132 | w->registered = false; |
104 | } |
133 | } |
105 | } |
134 | } |
106 | |
135 | |
107 | inline void set_now (void) |
136 | inline void set_now (void) |
108 | { |
137 | { |
… | |
… | |
115 | |
144 | |
116 | void io_manager::loop () |
145 | void io_manager::loop () |
117 | { |
146 | { |
118 | set_now (); |
147 | set_now (); |
119 | |
148 | |
120 | while (!(iow.empty () && tw.empty ())) |
149 | for (;;) |
121 | { |
150 | { |
122 | int timeout = tw.empty () |
151 | while (tw[0]->at <= NOW) |
123 | ? 3600 * 1000 // wake up at least every hour |
152 | { |
124 | : (int) ((tw[0]->at - NOW) * 1000); |
153 | // remove the first watcher |
|
|
154 | time_watcher *w = tw[0]; |
125 | |
155 | |
126 | printf ("s%d t%d #%d\n", pfs.size (), timeout, tw.size ()); |
156 | pop_heap (tw.begin (), tw.end (), earliest_first); |
|
|
157 | tw.pop_back (); |
127 | |
158 | |
128 | if (timeout >= 0) |
159 | w->registered = false; |
|
|
160 | |
|
|
161 | // call it |
|
|
162 | w->call (*w); |
|
|
163 | |
|
|
164 | // re-add it if necessary |
|
|
165 | if (w->at >= 0 && !w->registered) |
|
|
166 | reg (w); |
129 | { |
167 | } |
|
|
168 | |
|
|
169 | int timeout = (int) ((tw[0]->at - NOW) * 1000); |
|
|
170 | |
130 | int fds = poll (&pfs[0], pfs.size (), timeout); |
171 | int fds = poll (&pfs[0], pfs.size (), timeout); |
131 | |
172 | |
132 | set_now (); |
173 | set_now (); |
133 | |
174 | |
134 | for (unsigned int i = iow.size (); fds && i--; ) |
175 | vector<io_watcher *>::iterator w; |
|
|
176 | vector<pollfd>::iterator p; |
|
|
177 | |
|
|
178 | for (w = iow.begin (), p = pfs.begin (); |
|
|
179 | fds > 0 && w < iow.end (); |
|
|
180 | ++w, ++p) |
135 | if (pfs[i].revents) |
181 | if (p->revents) |
136 | { |
|
|
137 | --fds; |
|
|
138 | iow[i]->call (pfs[i].revents); |
|
|
139 | } |
|
|
140 | } |
|
|
141 | |
|
|
142 | while (!tw.empty () && tw[0]->at <= NOW) |
|
|
143 | { |
182 | { |
144 | pop_heap (tw.begin (), tw.end (), lowest_first); |
183 | --fds; |
145 | (*(tw.end () - 1))->trigger (); |
184 | (*w)->call (**w, p->revents); |
146 | push_heap (tw.begin (), tw.end (), lowest_first); |
|
|
147 | } |
185 | } |
148 | } |
186 | } |
149 | } |
187 | } |
150 | |
188 | |
|
|
189 | void io_manager::idle_cb (time_watcher &w) |
|
|
190 | { |
|
|
191 | w.at = NOW + 86400; // wake up every day, for no good reason |
|
|
192 | } |
|
|
193 | |
151 | io_manager::io_manager () |
194 | io_manager::io_manager () |
152 | { |
195 | { |
153 | set_now (); |
196 | set_now (); |
|
|
197 | idle = new time_watcher (this, &io_manager::idle_cb); |
|
|
198 | idle->start (0); |
154 | } |
199 | } |
155 | |
200 | |
156 | io_manager::~io_manager () |
201 | io_manager::~io_manager () |
157 | { |
202 | { |
158 | // |
203 | // |