mirror of
https://github.com/Llewellynvdm/conky.git
synced 2024-11-19 19:45:15 +00:00
127 lines
2.6 KiB
C++
127 lines
2.6 KiB
C++
|
/* -*- mode: c++; c-basic-offset: 4; tab-width: 4; indent-tabs-mode: t -*-
|
||
|
* vim: ts=4 sw=4 noet ai cindent syntax=cpp
|
||
|
*
|
||
|
* Conky, a system monitor, based on torsmo
|
||
|
*
|
||
|
* Please see COPYING for details
|
||
|
*
|
||
|
* Copyright (C) 2010 Pavel Labath et al.
|
||
|
*
|
||
|
* This program is free software: you can redistribute it and/or modify
|
||
|
* it under the terms of the GNU General Public License as published by
|
||
|
* the Free Software Foundation, either version 3 of the License, or
|
||
|
* (at your option) any later version.
|
||
|
*
|
||
|
* 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, see <http://www.gnu.org/licenses/>.
|
||
|
*
|
||
|
*/
|
||
|
|
||
|
#include "config.h"
|
||
|
|
||
|
#include "update-cb.hh"
|
||
|
|
||
|
#include <typeinfo>
|
||
|
|
||
|
namespace conky {
|
||
|
namespace {
|
||
|
semaphore sem_wait;
|
||
|
enum {UNUSED_MAX = 5};
|
||
|
}
|
||
|
|
||
|
namespace priv {
|
||
|
callback_base::~callback_base()
|
||
|
{
|
||
|
if(thread) {
|
||
|
done = true;
|
||
|
sem_start.post();
|
||
|
thread->join();
|
||
|
delete thread;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
inline size_t callback_base::get_hash(const handle &h)
|
||
|
{ return h->hash; }
|
||
|
|
||
|
inline bool callback_base::is_equal(const handle &a, const handle &b)
|
||
|
{
|
||
|
if(a->hash != b->hash)
|
||
|
return false;
|
||
|
|
||
|
if(typeid(*a) != typeid(*b))
|
||
|
return false;
|
||
|
|
||
|
return *a == *b;
|
||
|
}
|
||
|
|
||
|
callback_base::handle callback_base::do_register_cb(const handle &h)
|
||
|
{
|
||
|
const handle &ret = *callbacks.insert(h).first;
|
||
|
|
||
|
if(h->period < ret->period) {
|
||
|
ret->period = h->period;
|
||
|
ret->remaining = 0;
|
||
|
}
|
||
|
assert(ret->wait == h->wait);
|
||
|
ret->unused = 0;
|
||
|
|
||
|
return ret;
|
||
|
}
|
||
|
|
||
|
void callback_base::run()
|
||
|
{
|
||
|
if(not thread)
|
||
|
thread = new std::thread(&callback_base::start_routine, this);
|
||
|
|
||
|
sem_start.post();
|
||
|
}
|
||
|
|
||
|
void callback_base::start_routine()
|
||
|
{
|
||
|
for(;;) {
|
||
|
sem_start.wait();
|
||
|
if(done)
|
||
|
return;
|
||
|
work();
|
||
|
if(wait)
|
||
|
sem_wait.post();
|
||
|
}
|
||
|
}
|
||
|
|
||
|
callback_base::Callbacks callback_base::callbacks(1, get_hash, is_equal);
|
||
|
}
|
||
|
|
||
|
|
||
|
void run_all_callbacks()
|
||
|
{
|
||
|
using priv::callback_base;
|
||
|
|
||
|
size_t wait = 0;
|
||
|
for(auto i = callback_base::callbacks.begin(); i != callback_base::callbacks.end(); ) {
|
||
|
callback_base &cb = **i;
|
||
|
|
||
|
if(cb.remaining-- == 0) {
|
||
|
if(!i->unique() || ++cb.unused < UNUSED_MAX) {
|
||
|
cb.remaining = cb.period-1;
|
||
|
cb.run();
|
||
|
if(cb.wait)
|
||
|
++wait;
|
||
|
}
|
||
|
}
|
||
|
if(cb.unused == UNUSED_MAX) {
|
||
|
auto t = i;
|
||
|
++i;
|
||
|
callback_base::callbacks.erase(t);
|
||
|
} else
|
||
|
++i;
|
||
|
}
|
||
|
|
||
|
while(wait-- > 0)
|
||
|
sem_wait.wait();
|
||
|
}
|
||
|
}
|