149 lines
3.6 KiB
Plaintext
149 lines
3.6 KiB
Plaintext
/*
|
|
* This file is part of libsidplayfp, a SID player engine.
|
|
*
|
|
* Copyright (C) 2011-2014 Leandro Nini
|
|
* Copyright (C) 2009 Antti S. Lankila
|
|
* Copyright (C) 2001 Simon White
|
|
*
|
|
* 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 2 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, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef EVENTSCHEDULER_H
|
|
#define EVENTSCHEDULER_H
|
|
|
|
#include "sidplayfp/event.h"
|
|
|
|
#include "sidcxx11.h"
|
|
|
|
|
|
template< class This >
|
|
class EventCallback: public Event
|
|
{
|
|
private:
|
|
typedef void (This::*Callback) ();
|
|
|
|
private:
|
|
This &m_this;
|
|
Callback const m_callback;
|
|
|
|
private:
|
|
void event() override { (m_this.*m_callback)(); }
|
|
|
|
public:
|
|
EventCallback(const char * const name, This &_this, Callback callback) :
|
|
Event(name),
|
|
m_this(_this),
|
|
m_callback(callback) {}
|
|
};
|
|
|
|
|
|
/**
|
|
* Fast EventScheduler implementation
|
|
*
|
|
* @author Antti S. Lankila
|
|
*/
|
|
class EventScheduler: public EventContext
|
|
{
|
|
private:
|
|
/**
|
|
* The first event of the chain.
|
|
*/
|
|
Event *firstEvent;
|
|
|
|
/**
|
|
* EventScheduler's current clock.
|
|
*/
|
|
event_clock_t currentTime;
|
|
|
|
private:
|
|
/**
|
|
* Scan the event queue and schedule event for execution.
|
|
*
|
|
* @param event The event to add
|
|
*/
|
|
void schedule(Event &event)
|
|
{
|
|
// find the right spot where to tuck this new event
|
|
Event **scan = &firstEvent;
|
|
for (;;)
|
|
{
|
|
if (*scan == nullptr || (*scan)->triggerTime > event.triggerTime)
|
|
{
|
|
event.next = *scan;
|
|
*scan = &event;
|
|
break;
|
|
}
|
|
scan = &((*scan)->next);
|
|
}
|
|
}
|
|
|
|
protected:
|
|
void schedule(Event &event, event_clock_t cycles,
|
|
event_phase_t phase) override
|
|
{
|
|
// this strange formulation always selects the next available slot regardless of specified phase.
|
|
event.triggerTime = (cycles << 1) + currentTime + ((currentTime & 1) ^ phase);
|
|
schedule(event);
|
|
}
|
|
|
|
void schedule(Event &event, event_clock_t cycles) override
|
|
{
|
|
event.triggerTime = (cycles << 1) + currentTime;
|
|
schedule(event);
|
|
}
|
|
|
|
void cancel(Event &event) override;
|
|
|
|
public:
|
|
EventScheduler() :
|
|
firstEvent(nullptr),
|
|
currentTime(0) {}
|
|
|
|
/**
|
|
* Cancel all pending events and reset time.
|
|
*/
|
|
void reset();
|
|
|
|
/**
|
|
* Fire next event, advance system time to that event.
|
|
*/
|
|
void clock()
|
|
{
|
|
Event &event = *firstEvent;
|
|
firstEvent = firstEvent->next;
|
|
currentTime = event.triggerTime;
|
|
event.event();
|
|
}
|
|
|
|
/**
|
|
* Check if an event is in the queue.
|
|
*/
|
|
bool isPending(Event &event) const override;
|
|
|
|
event_clock_t getTime(event_phase_t phase) const override
|
|
{
|
|
return (currentTime + (phase ^ 1)) >> 1;
|
|
}
|
|
|
|
event_clock_t getTime(event_clock_t clock, event_phase_t phase) const override
|
|
{
|
|
return getTime(phase) - clock;
|
|
}
|
|
|
|
event_phase_t phase() const override { return static_cast<event_phase_t>(currentTime & 1); }
|
|
};
|
|
|
|
#endif // EVENTSCHEDULER_H
|