36 lines
1.0 KiB
C++
36 lines
1.0 KiB
C++
/*
|
|
* Copyright (C) 2017,2022 Robin Gareus <robin@gareus.org>
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#include "ardour/graph.h"
|
|
#include "ardour/rt_task.h"
|
|
|
|
using namespace ARDOUR;
|
|
|
|
RTTask::RTTask (Graph* g, boost::function<void ()> const& fn)
|
|
: _f (fn)
|
|
, _graph (g)
|
|
{
|
|
}
|
|
|
|
void
|
|
RTTask::run (GraphChain const*)
|
|
{
|
|
_f ();
|
|
_graph->reached_terminal_node ();
|
|
}
|