13
0
livetrax/libs/ardour/rt_tasklist.cc
Robin Gareus c713841f39
Re-implement RTTaskList using Graph Threads
There is no longer an extra set of rt-threads, but existing
process-graph threads are reused.

There are two main benefits to this approach: graph-threads
have a SessioEvent pool and ProcessThread buffers. They are
also joined to work-groups (on macOS), or  JACK created threads
(cgroups).
2022-06-04 17:22:50 +02:00

48 lines
1.3 KiB
C++

/*
* Copyright (C) 2017-2018 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_tasklist.h"
using namespace ARDOUR;
RTTaskList::RTTaskList (boost::shared_ptr<Graph> process_graph)
: _graph (process_graph)
{
_tasks.reserve (256);
}
void
RTTaskList::push_back (boost::function<void ()> fn)
{
_tasks.push_back (RTTask (_graph.get(), fn));
}
void
RTTaskList::process ()
{
if (_graph->n_threads () > 1 && _tasks.size () > 2) {
_graph->process_tasklist (*this);
} else {
for (auto const& fn : _tasks) {
fn._f ();
}
}
_tasks.clear ();
}