4 // Fraunhofer Institut fuer offene Kommunikationssysteme (FOKUS)
5 // Kompetenzzentrum fuer Satelitenkommunikation (SatCom)
6 // Stefan Bund <stefan.bund@fokus.fraunhofer.de>
8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
10 // the Free Software Foundation; either version 2 of the License, or
11 // (at your option) any later version.
13 // This program is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License
19 // along with this program; if not, write to the
20 // Free Software Foundation, Inc.,
21 // 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
25 \idea Implement signal handling (See source for more discussion
28 \idea Multithreading support: To support multithreading, the
29 static member Scheduler::instance() must return a thread-local
30 value (that is Scheduler::instance() must allocate one Scheduler
34 // Here a basic concept of how to add signal support to the scheduler:
36 // Every signal to be reported by the scheduler will be asigned a
37 // generic signal handler by the scheduler. This signal handler will
38 // use longjmp (juck) to report this signal back to the scheduler
41 // To make this safe, the main-loop will look something like:
43 // int signal = setjmp(jmpBuffer_);
45 // // unblock all signals which are registered with the
48 // // block all relevant signals again
51 // // now handle the event
53 // The signal handler is then simply defined as
55 // static void Scheduler::sigHandler(int signal)
57 // // make sure to restore the signal handler here if
59 // longjmp(Scheduler::instance().jmpBuffer_,signal);
62 // You should use sigaction to register the signal handlers and define
63 // a sa_mask so all Scheduler-registered signals are automatically
64 // *blocked* whenever one of the signals is called (including the
65 // called signal!). This ensures, that no two signals can be delivered
66 // on top of each other. And of course any signal registered with the
67 // scheduler must be blocked as soon as it is registered with the
70 // Definition of non-inline non-template functions
72 #include "Scheduler.hh"
73 //#include "Scheduler.ih"
77 #include <sys/epoll.h>
78 #include "Utils/Exception.hh"
79 #include "Utils/MicroTime.hh"
81 static const int EPollInitialSize = 16;
84 ///////////////////////////////cc.p////////////////////////////////////////
86 prefix_ senf::Scheduler::Scheduler & senf::Scheduler::instance()
88 static Scheduler instance;
92 prefix_ void senf::Scheduler::timeout(unsigned long timeout, TimerCallback const & cb)
94 timerQueue_.push(TimerSpec(now()+1000*timeout,cb));
97 prefix_ senf::Scheduler::Scheduler()
98 : epollFd_(epoll_create(EPollInitialSize))
101 throw SystemException(errno);
104 prefix_ void senf::Scheduler::do_add(int fd, SimpleCallback const & cb, int eventMask)
106 FdTable::iterator i (fdTable_.find(fd));
107 int action (EPOLL_CTL_MOD);
108 if (i == fdTable_.end()) {
109 action = EPOLL_CTL_ADD;
110 i = fdTable_.insert(std::make_pair(fd, EventSpec())).first;
113 if (eventMask & EV_READ) i->second.cb_read = cb;
114 if (eventMask & EV_PRIO) i->second.cb_prio = cb;
115 if (eventMask & EV_WRITE) i->second.cb_write = cb;
116 if (eventMask & EV_HUP) i->second.cb_hup = cb;
117 if (eventMask & EV_ERR) i->second.cb_err = cb;
120 memset(&ev,0,sizeof(ev));
121 ev.events = i->second.epollMask();
124 if (epoll_ctl(epollFd_, action, fd, &ev)<0)
125 throw SystemException(errno);
128 prefix_ void senf::Scheduler::do_remove(int fd, int eventMask)
130 FdTable::iterator i (fdTable_.find(fd));
131 if (i == fdTable_.end())
134 if (eventMask & EV_READ) i->second.cb_read = 0;
135 if (eventMask & EV_PRIO) i->second.cb_prio = 0;
136 if (eventMask & EV_WRITE) i->second.cb_write = 0;
137 if (eventMask & EV_HUP) i->second.cb_hup = 0;
138 if (eventMask & EV_ERR) i->second.cb_err = 0;
141 memset(&ev,0,sizeof(ev));
142 ev.events = i->second.epollMask();
145 int action (EPOLL_CTL_MOD);
147 action = EPOLL_CTL_DEL;
151 if (epoll_ctl(epollFd_, action, fd, &ev)<0)
152 throw SystemException(errno);
156 prefix_ int senf::Scheduler::EventSpec::epollMask()
160 if (cb_read) mask |= EPOLLIN;
161 if (cb_prio) mask |= EPOLLPRI;
162 if (cb_write) mask |= EPOLLOUT;
163 if (cb_hup) mask |= EPOLLHUP;
164 if (cb_err) mask |= EPOLLERR;
168 prefix_ void senf::Scheduler::process()
171 while (! terminate_) {
173 MicroTime timeNow = now();
174 while ( ! timerQueue_.empty() && timerQueue_.top().timeout <= timeNow ) {
175 timerQueue_.top().cb();
180 int timeout = timerQueue_.empty() ? -1 : int((timerQueue_.top().timeout - timeNow)/1000);
182 struct epoll_event ev;
183 int events = epoll_wait(epollFd_, &ev, 1, timeout);
185 // Hmm ... man epoll says, it will NOT return with EINTR ??
186 throw SystemException(errno);
188 // Timeout .. it will be run when reachiung the top of the loop
191 FdTable::iterator i = fdTable_.find(ev.data.fd);
192 BOOST_ASSERT (i != fdTable_.end() );
193 EventSpec const & spec (i->second);
195 if (ev.events & EPOLLIN) {
196 BOOST_ASSERT(spec.cb_read);
197 spec.cb_read(EV_READ);
199 else if (ev.events & EPOLLPRI) {
200 BOOST_ASSERT(spec.cb_prio);
201 spec.cb_prio(EV_PRIO);
203 else if (ev.events & EPOLLOUT) {
204 BOOST_ASSERT(spec.cb_write);
205 spec.cb_write(EV_WRITE);
208 else if (ev.events & EPOLLHUP) {
211 else if (ev.events & EPOLLERR) {
212 if (spec.cb_write) spec.cb_write(EV_HUP);
213 if (spec.cb_read) spec.cb_read(EV_HUP);
216 else if (ev.events & EPOLLERR && ! ev.events & EPOLLHUP) {
220 if (spec.cb_write) spec.cb_write(EV_ERR);
221 if (spec.cb_read) spec.cb_read(EV_ERR);
228 ///////////////////////////////cc.e////////////////////////////////////////
234 // c-file-style: "senf"