1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
|
/*
* This file is part of PowerDNS or dnsdist.
* Copyright -- PowerDNS.COM B.V. and its contributors
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* In addition, for the avoidance of any doubt, permission is granted to
* link this program with OpenSSL and to (re)distribute the binaries
* produced as the result of such linking.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "mtasker.hh"
#include "misc.hh"
#include <stdio.h>
#include <iostream>
#ifdef PDNS_USE_VALGRIND
#include <valgrind/valgrind.h>
#endif /* PDNS_USE_VALGRIND */
/** \page MTasker
Simple system for implementing cooperative multitasking of functions, with
support for waiting on events which can return values.
\section copyright Copyright and License
MTasker is (c) 2002 - 2009 by bert hubert. It is licensed to you under the terms of the GPL version 2.
\section overview High level overview
MTasker is designed to support very simple cooperative multitasking to facilitate writing
code that would ordinarily require a statemachine, for which the author does not consider
himself smart enough.
This class does not perform any magic it only makes calls to makecontext() and swapcontext().
Getting the details right however is complicated and MTasker does that for you.
If preemptive multitasking or more advanced concepts such as semaphores, locks or mutexes
are required, the use of POSIX threads is advised.
MTasker is designed to offer the performance of statemachines while maintaining simple thread semantics. It is not
a replacement for a full threading system.
\section compatibility Compatibility
MTasker is only guaranteed to work on Linux with glibc 2.2.5 and higher. It does not work on FreeBSD and notably,
not on Red Hat 6.0. It may work on Solaris, please test.
\section concepts Concepts
There are two important concepts, the 'kernel' and the 'thread'. Each thread starts out as a function,
which is passed to MTasker::makeThread(), together with a possible argument.
This function is now free to do whatever it wants, but realise that MTasker implements cooperative
multitasking, which means that the coder has the responsibility of not taking the CPU overly long.
Other threads can only get the CPU if MTasker::yield() is called or if a thread sleeps to wait for an event,
using the MTasker::waitEvent() method.
\section kernel The Kernel
The Kernel consists of functions that do housekeeping, but also of code that the client coder
can call to report events. A minimal kernel loop looks like this:
\code
for(;;) {
MT.schedule();
if(MT.noProcesses()) // exit if no processes are left
break;
}
\endcode
The kernel typically starts from the main() function of your program. New threads are also
created from the kernel. This can also happen before entering the main loop. To start a thread,
the method MTasker::makeThread is provided.
\section events Events
By default, Events are recognized by an int and their value is also an int.
This can be overridden by specifying the EventKey and EventVal template parameters.
An event can be a keypress, but also a UDP packet, or a bit of data from a TCP socket. The
sample code provided works with keypresses, but that is just a not very useful example.
A thread can also wait for an event only for a limited time, and receive a timeout of that
event did not occur within the specified timeframe.
\section example A simple menu system
\code
MTasker<> MT;
void menuHandler(void *p)
{
int num=(int)p;
cout<<"Key handler for key "<<num<<" launched"<<endl;
MT.waitEvent(num);
cout<<"Key "<<num<<" was pressed!"<<endl;
}
int main()
{
char line[10];
for(int i=0;i<10;++i)
MT.makeThread(menuHandler,(void *)i);
for(;;) {
while(MT.schedule()); // do everything we can do
if(MT.noProcesses()) // exit if no processes are left
break;
if(!fgets(line,sizeof(line),stdin))
break;
MT.sendEvent(*line-'0');
}
}
\endcode
\section example2 Canonical multitasking example
This implements the canonical multitasking example, alternately printing an 'A' and a 'B'. The Linux kernel
started this way too.
\code
void printer(void *p)
{
char c=(char)p;
for(;;) {
cout<<c<<endl;
MT.yield();
}
}
int main()
{
MT.makeThread(printer,(void*)'a');
MT.makeThread(printer,(void*)'b');
for(;;) {
while(MT.schedule()); // do everything we can do
if(MT.noProcesses()) // exit if no processes are left
break;
}
}
\endcode
*/
//! puts a thread to sleep waiting until a specified event arrives
/** Threads can call waitEvent to register that they are waiting on an event with a certain key.
If so desired, the event can carry data which is returned in val in case that is non-zero.
Furthermore, a timeout can be specified in seconds.
Only one thread can be waiting on a key, results of trying to have more threads
waiting on the same key are undefined.
\param key Event key to wait for. Needs to match up to a key reported to sendEvent
\param val If non-zero, the value of the event will be stored in *val
\param timeout If non-zero, number of seconds to wait for an event.
\return returns -1 in case of error, 0 in case of timeout, 1 in case of an answer
*/
template<class EventKey, class EventVal>int MTasker<EventKey,EventVal>::waitEvent(EventKey &key, EventVal *val, unsigned int timeoutMsec, const struct timeval* now)
{
if(d_waiters.count(key)) { // there was already an exact same waiter
return -1;
}
Waiter w;
w.context=std::make_shared<pdns_ucontext_t>();
w.ttd.tv_sec = 0; w.ttd.tv_usec = 0;
if(timeoutMsec) {
struct timeval increment;
increment.tv_sec = timeoutMsec / 1000;
increment.tv_usec = 1000 * (timeoutMsec % 1000);
if(now)
w.ttd = increment + *now;
else {
struct timeval realnow;
gettimeofday(&realnow, 0);
w.ttd = increment + realnow;
}
}
w.tid=d_tid;
w.key=key;
d_waiters.insert(w);
#ifdef MTASKERTIMING
unsigned int diff=d_threads[d_tid].dt.ndiff()/1000;
d_threads[d_tid].totTime+=diff;
#endif
notifyStackSwitchToKernel();
pdns_swapcontext(*d_waiters.find(key)->context,d_kernel); // 'A' will return here when 'key' has arrived, hands over control to kernel first
notifyStackSwitchDone();
#ifdef MTASKERTIMING
d_threads[d_tid].dt.start();
#endif
if(val && d_waitstatus==Answer)
*val=d_waitval;
d_tid=w.tid;
if((char*)&w < d_threads[d_tid].highestStackSeen) {
d_threads[d_tid].highestStackSeen = (char*)&w;
}
key=d_eventkey;
return d_waitstatus;
}
//! yields control to the kernel or other threads
/** Hands over control to the kernel, allowing other processes to run, or events to arrive */
template<class Key, class Val>void MTasker<Key,Val>::yield()
{
d_runQueue.push(d_tid);
notifyStackSwitchToKernel();
pdns_swapcontext(*d_threads[d_tid].context ,d_kernel); // give control to the kernel
notifyStackSwitchDone();
}
//! reports that an event took place for which threads may be waiting
/** From the kernel loop, sendEvent can be called to report that something occurred for which there may be waiters.
\param key Key of the event for which threads may be waiting
\param val If non-zero, pointer to the content of the event
\return Returns -1 in case of error, 0 if there were no waiters, 1 if a thread was woken up.
WARNING: when passing val as zero, d_waitval is undefined, and hence waitEvent will return undefined!
*/
template<class EventKey, class EventVal>int MTasker<EventKey,EventVal>::sendEvent(const EventKey& key, const EventVal* val)
{
typename waiters_t::iterator waiter=d_waiters.find(key);
if(waiter == d_waiters.end()) {
// cout<<"Event sent nobody was waiting for!"<<endl;
return 0;
}
d_waitstatus=Answer;
if(val)
d_waitval=*val;
d_tid=waiter->tid; // set tid
d_eventkey=waiter->key; // pass waitEvent the exact key it was woken for
auto userspace=std::move(waiter->context);
d_waiters.erase(waiter); // removes the waitpoint
notifyStackSwitch(d_threads[d_tid].startOfStack, d_stacksize);
pdns_swapcontext(d_kernel,*userspace); // swaps back to the above point 'A'
notifyStackSwitchDone();
return 1;
}
//! launches a new thread
/** The kernel can call this to make a new thread, which starts at the function start and gets passed the val void pointer.
\param start Pointer to the function which will form the start of the thread
\param val A void pointer that can be used to pass data to the thread
*/
template<class Key, class Val>void MTasker<Key,Val>::makeThread(tfunc_t *start, void* val)
{
auto uc=std::make_shared<pdns_ucontext_t>();
uc->uc_link = &d_kernel; // come back to kernel after dying
uc->uc_stack.resize (d_stacksize+1);
#ifdef PDNS_USE_VALGRIND
uc->valgrind_id = VALGRIND_STACK_REGISTER(&uc->uc_stack[0],
&uc->uc_stack[uc->uc_stack.size()-1]);
#endif /* PDNS_USE_VALGRIND */
++d_threadsCount;
auto& thread = d_threads[d_maxtid];
auto mt = this;
thread.start = [start, val, mt]() {
char dummy;
mt->d_threads[mt->d_tid].startOfStack = mt->d_threads[mt->d_tid].highestStackSeen = &dummy;
auto const tid = mt->d_tid;
start (val);
mt->d_zombiesQueue.push(tid);
};
pdns_makecontext (*uc, thread.start);
thread.context = std::move(uc);
d_runQueue.push(d_maxtid++); // will run at next schedule invocation
}
//! needs to be called periodically so threads can run and housekeeping can be performed
/** The kernel should call this function every once in a while. It makes sense
to call this function if you:
- reported an event
- called makeThread
- want to have threads running waitEvent() to get a timeout if enough time passed
\return Returns if there is more work scheduled and recalling schedule now would be useful
*/
template<class Key, class Val>bool MTasker<Key,Val>::schedule(const struct timeval* now)
{
if(!d_runQueue.empty()) {
d_tid=d_runQueue.front();
#ifdef MTASKERTIMING
d_threads[d_tid].dt.start();
#endif
notifyStackSwitch(d_threads[d_tid].startOfStack, d_stacksize);
pdns_swapcontext(d_kernel, *d_threads[d_tid].context);
notifyStackSwitchDone();
d_runQueue.pop();
return true;
}
if(!d_zombiesQueue.empty()) {
d_threads.erase(d_zombiesQueue.front());
--d_threadsCount;
d_zombiesQueue.pop();
return true;
}
if(!d_waiters.empty()) {
struct timeval rnow;
if(!now)
gettimeofday(&rnow, 0);
else
rnow = *now;
typedef typename waiters_t::template index<KeyTag>::type waiters_by_ttd_index_t;
// waiters_by_ttd_index_t& ttdindex=d_waiters.template get<KeyTag>();
waiters_by_ttd_index_t& ttdindex=boost::multi_index::get<KeyTag>(d_waiters);
for(typename waiters_by_ttd_index_t::iterator i=ttdindex.begin(); i != ttdindex.end(); ) {
if(i->ttd.tv_sec && i->ttd < rnow) {
d_waitstatus=TimeOut;
d_eventkey=i->key; // pass waitEvent the exact key it was woken for
auto uc = i->context;
d_tid = i->tid;
ttdindex.erase(i++); // removes the waitpoint
notifyStackSwitch(d_threads[d_tid].startOfStack, d_stacksize);
pdns_swapcontext(d_kernel, *uc); // swaps back to the above point 'A'
notifyStackSwitchDone();
}
else if(i->ttd.tv_sec)
break;
else
++i;
}
}
return false;
}
//! returns true if there are no processes
/** Call this to check if no processes are running anymore
\return true if no processes are left
*/
template<class Key, class Val>bool MTasker<Key,Val>::noProcesses() const
{
return d_threadsCount == 0;
}
//! returns the number of processes running
/** Call this to perhaps limit activities if too many threads are running
\return number of processes running
*/
template<class Key, class Val>unsigned int MTasker<Key,Val>::numProcesses() const
{
return d_threadsCount;
}
//! gives access to the list of Events threads are waiting for
/** The kernel can call this to get a list of Events threads are waiting for. This is very useful
to setup 'select' or 'poll' or 'aio' events needed to satisfy these requests.
getEvents clears the events parameter before filling it.
\param events Vector which is to be filled with keys threads are waiting for
*/
template<class Key, class Val>void MTasker<Key,Val>::getEvents(std::vector<Key>& events)
{
events.clear();
for(typename waiters_t::const_iterator i=d_waiters.begin();i!=d_waiters.end();++i) {
events.push_back(i->first);
}
}
//! Returns the current Thread ID (tid)
/** Processes can call this to get a numerical representation of their current thread ID.
This can be useful for logging purposes.
*/
template<class Key, class Val>int MTasker<Key,Val>::getTid() const
{
return d_tid;
}
//! Returns the maximum stack usage so far of this MThread
template<class Key, class Val>unsigned int MTasker<Key,Val>::getMaxStackUsage()
{
return d_threads[d_tid].startOfStack - d_threads[d_tid].highestStackSeen;
}
//! Returns the maximum stack usage so far of this MThread
template<class Key, class Val>unsigned int MTasker<Key,Val>::getUsec()
{
#ifdef MTASKERTIMING
return d_threads[d_tid].totTime + d_threads[d_tid].dt.ndiff()/1000;
#else
return 0;
#endif
}
|