| 1 | #include <unistd.h> |
|
|
| 2 | /* |
1 | /* |
| 3 | iom.C -- I/O multiplexor |
2 | iom.C -- I/O multiplexor |
| 4 | |
3 | |
| 5 | This program is free software; you can redistribute it and/or modify |
4 | 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 |
5 | it under the terms of the GNU General Public License as published by |
| … | |
… | |
| 23 | |
22 | |
| 24 | #include <algorithm> |
23 | #include <algorithm> |
| 25 | #include <functional> |
24 | #include <functional> |
| 26 | |
25 | |
| 27 | #include "slog.h" |
26 | #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 | inline bool lowest_first (const time_watcher *a, const time_watcher *b) |
| 32 | { |
30 | { |
| 33 | return a->at > b->at; |
31 | return a->at > b->at; |
| 34 | } |
32 | } |
| 35 | |
33 | |
| 36 | timestamp NOW; |
34 | tstamp NOW; |
| 37 | |
35 | |
| 38 | io_manager iom; |
36 | io_manager iom; |
| 39 | |
37 | |
| 40 | void time_watcher::set (timestamp when) |
38 | void time_watcher::set (tstamp when) |
| 41 | { |
39 | { |
| 42 | iom.unreg (this); |
40 | iom.unreg (this); |
| 43 | at = when; |
41 | at = when; |
|
|
42 | iom.reg (this); |
|
|
43 | } |
|
|
44 | |
|
|
45 | void time_watcher::trigger () |
|
|
46 | { |
|
|
47 | iom.unreg (this); |
|
|
48 | call (at); |
|
|
49 | iom.reg (this); |
|
|
50 | } |
|
|
51 | |
|
|
52 | void time_watcher::start () |
|
|
53 | { |
|
|
54 | iom.unreg (this); |
| 44 | iom.reg (this); |
55 | iom.reg (this); |
| 45 | } |
56 | } |
| 46 | |
57 | |
| 47 | void io_manager::reg (int fd, short events, io_watcher *w) |
58 | void io_manager::reg (int fd, short events, io_watcher *w) |
| 48 | { |
59 | { |
| … | |
… | |
| 91 | unsigned int sz = tw.size (); |
102 | unsigned int sz = tw.size (); |
| 92 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
103 | unsigned int i = find (tw.begin (), tw.end (), w) - tw.begin (); |
| 93 | |
104 | |
| 94 | if (i != sz) |
105 | if (i != sz) |
| 95 | { |
106 | { |
| 96 | if (sz == 1) |
|
|
| 97 | tw.clear (); |
|
|
| 98 | else |
|
|
| 99 | { |
|
|
| 100 | if (i != sz - 1) |
107 | if (i != sz - 1) |
| 101 | tw[i] = tw[sz - 1]; |
108 | tw[i] = tw[sz - 1]; |
| 102 | |
109 | |
| 103 | tw.pop_back (); |
110 | tw.pop_back (); |
| 104 | make_heap (tw.begin (), tw.end (), lowest_first); |
111 | make_heap (tw.begin (), tw.end (), lowest_first); |
| 105 | } |
|
|
| 106 | } |
112 | } |
| 107 | } |
113 | } |
| 108 | |
114 | |
| 109 | inline void set_now (void) |
115 | inline void set_now (void) |
| 110 | { |
116 | { |
| 111 | struct timeval tv; |
117 | struct timeval tv; |
| 112 | |
118 | |
| 113 | gettimeofday (&tv, 0); |
119 | gettimeofday (&tv, 0); |
| 114 | |
120 | |
| 115 | NOW = (timestamp)tv.tv_sec + (timestamp)tv.tv_usec / 1000000; |
121 | NOW = (tstamp)tv.tv_sec + (tstamp)tv.tv_usec / 1000000; |
| 116 | } |
122 | } |
| 117 | |
123 | |
| 118 | void io_manager::loop () |
124 | void io_manager::loop () |
| 119 | { |
125 | { |
| 120 | set_now (); |
126 | set_now (); |
| 121 | |
127 | |
| 122 | for (;;) |
128 | for (;;) |
| 123 | { |
129 | { |
| 124 | int timeout = tw.empty () ? -1 : (int) ((tw[0]->at - NOW) * 1000); |
130 | while (tw[0]->at <= NOW) |
|
|
131 | { |
|
|
132 | pop_heap (tw.begin (), tw.end (), lowest_first); |
|
|
133 | time_watcher *w = *(tw.end () - 1); |
| 125 | |
134 | |
| 126 | //printf ("s%d t%d #%d <%f<%f<\n", pfs.size (), timeout, tw.size (), tw[0]->at - NOW, tw[1]->at - NOW); |
135 | if (w->at >= 0) |
| 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 | { |
136 | { |
| 137 | --fds; |
137 | w->call (w->at); |
| 138 | iow[i]->call (pfs[i].revents); |
138 | push_heap (tw.begin (), tw.end (), lowest_first); |
| 139 | } |
139 | } |
|
|
140 | else |
|
|
141 | tw.pop_back (); |
| 140 | } |
142 | } |
| 141 | |
143 | |
| 142 | while (!tw.empty () && tw[0]->at <= NOW) |
144 | int timeout = (int) ((tw[0]->at - NOW) * 1000); |
|
|
145 | |
|
|
146 | int fds = poll (&pfs[0], pfs.size (), timeout); |
|
|
147 | |
|
|
148 | set_now (); |
|
|
149 | |
|
|
150 | for (unsigned int i = iow.size (); fds > 0 && i--; ) |
|
|
151 | if (pfs[i].revents) |
| 143 | { |
152 | { |
| 144 | pop_heap (tw.begin (), tw.end (), lowest_first); |
153 | --fds; |
| 145 | time_watcher *w = tw[tw.size () - 1]; |
154 | iow[i]->call (pfs[i].revents); |
| 146 | w->call (w->at); |
|
|
| 147 | push_heap (tw.begin (), tw.end (), lowest_first); |
|
|
| 148 | } |
155 | } |
| 149 | } |
156 | } |
|
|
157 | } |
|
|
158 | |
|
|
159 | void io_manager::idle_cb (tstamp &ts) |
|
|
160 | { |
|
|
161 | ts = NOW + 86400; // wake up every day, for no good reason |
| 150 | } |
162 | } |
| 151 | |
163 | |
| 152 | io_manager::io_manager () |
164 | io_manager::io_manager () |
| 153 | { |
165 | { |
| 154 | set_now (); |
166 | set_now (); |
|
|
167 | idle = new time_watcher (this, &io_manager::idle_cb); |
|
|
168 | idle->start (0); |
| 155 | } |
169 | } |
| 156 | |
170 | |
| 157 | io_manager::~io_manager () |
171 | io_manager::~io_manager () |
| 158 | { |
172 | { |
| 159 | // |
173 | // |
