// Custom includes
#include <signal.h>
#include <time.h>
+#include <cassert>
#include <senf/Utils/Exception.hh>
#include <senf/Utils/senfassert.hh>
#ifdef SENF_DEBUG
// At the moment, the FIFORunner is not very efficient with many non-runnable tasks since the
// complete list of tasks is traversed on each run().
//
-// To optimize this, we woould need a way to find the relative ordering of two tasks in O(1) (at the
+// To optimize this, we would need a way to find the relative ordering of two tasks in O(1) (at the
// moment, this is an O(N) operation by traversing the list).
//
// One idea is, to give each task an 'order' value. Whenever a task is added at the end, it's order
++ next_;
}
watchdogCount_ = 0;
- next_ = 0;
+ next_ = l;
}
catch (...) {
watchdogCount_ = 0;
- next_ = 0;
+ next_ = l;
throw;
}
}
prefix_ void senf::scheduler::detail::FIFORunner::watchdogError()
{
- static char const hex[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
- 'a', 'b', 'c', 'd', 'e', 'f' };
- static void * entries[SENF_DEBUG_BACKTRACE_NUMCALLERS];
-
// We don't care if the write commands below fail, we just give our best to inform the user
senf::IGNORE( write(1, "\n\n*** Scheduler task hanging (pid ",34) );
static char pid[7];
senf::IGNORE( write(1, runningName_.c_str(), runningName_.size()) );
senf::IGNORE( write(1, " at\n ", 3) );
#ifdef SENF_DEBUG
+ static char const hex[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
+ 'a', 'b', 'c', 'd', 'e', 'f' };
+ static void * entries[SENF_DEBUG_BACKTRACE_NUMCALLERS];
unsigned nEntries( ::backtrace(entries, SENF_DEBUG_BACKTRACE_NUMCALLERS) );
for (unsigned i (0); i < nEntries; ++i) {
senf::IGNORE( write(1, " 0x", 3) );