/*
This file is part of Ingen.
Copyright 2007-2016 David Robillard
Ingen is free software: you can redistribute it and/or modify it under the
terms of the GNU Affero General Public License as published by the Free
Software Foundation, either version 3 of the License, or any later version.
Ingen 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 Affero General Public License for details.
You should have received a copy of the GNU Affero General Public License
along with Ingen. If not, see .
*/
#ifndef INGEN_ENGINE_COMPILEDGRAPH_HPP
#define INGEN_ENGINE_COMPILEDGRAPH_HPP
#include
#include
#include
#include "raul/Maid.hpp"
#include "raul/Noncopyable.hpp"
#include "raul/Path.hpp"
#include "Task.hpp"
namespace Ingen {
class Log;
namespace Server {
class BlockImpl;
class GraphImpl;
class RunContext;
/** A graph ``compiled'' into a quickly executable form.
*
* This is a flat sequence of nodes ordered such that the process thread can
* execute the nodes in order and have nodes always executed before any of
* their dependencies.
*/
class CompiledGraph : public Raul::Maid::Disposable
, public Raul::Noncopyable
{
public:
static CompiledGraph* compile(GraphImpl* graph);
void run(RunContext& context);
void dump(std::function sink) const;
private:
CompiledGraph(GraphImpl* graph);
typedef std::set BlockSet;
void compile_graph(GraphImpl* graph);
void compile_set(const BlockSet& blocks, Task& task, BlockSet& k);
void compile_block(BlockImpl* block, Task& task, BlockSet& k);
void compile_dependant(const BlockImpl* root,
BlockImpl* block,
Task& task,
BlockSet& k);
Log& _log;
const Raul::Path _path;
Task _master;
};
} // namespace Server
} // namespace Ingen
#endif // INGEN_ENGINE_COMPILEDGRAPH_HPP