ingen.git - Ingen modular audio processor

Age	Commit message (Collapse)	Author	Files	Lines
2023-09-22	Use a regular unique_ptr for compiled graphs	David Robillard	1	-2/+2
	Since these are always swapped by events which already have the ability to delete things after execution (by deleting them along with the event itself after processing), we can avoid the complexity and overhead of Raul::managed_ptr here by swapping the old graph for the new, retaining the owning reference to the old CompiledGraph in the event.
2022-12-14	Concatenate nested namespaces	David Robillard	1	-6/+2

2020-12-15	Clean up includes in core and server	David Robillard	1	-0/+3

2020-08-03	Clean up includes	David Robillard	1	-0/+6
	As directed by include-what-you-use. Unfortunately, it is still confused by quite a few things, but this gets a lot closer to a clean report, and at least makes the output more tolerable to manually check.
2020-08-02	Remove Raul::managed_ptr alias	David Robillard	1	-3/+1

2020-08-02	Remove std::shared_ptr alias	David Robillard	1	-8/+10

2020-08-02	Remove std::unique_ptr alias	David Robillard	1	-3/+4

2020-08-02	Use consistent naming for context parameters	David Robillard	1	-1/+1

2020-02-26	Fix atomic bundle execution	David Robillard	1	-5/+21

2019-12-08	Cleanup: Remove unused parameter names	David Robillard	1	-1/+1

2019-12-08	Cleanup: Avoid parameter copying overhead	David Robillard	1	-2/+2

2019-03-09	Clean up includes and forward declarations	David Robillard	1	-1/+4

2018-09-23	Use lowercase namespace names	David Robillard	1	-8/+8

2018-01-21	Replace insert(make_pair(...)) with emplace	David Robillard	1	-1/+1

2018-01-17	Clean up Engine component memory management and trim include tree	David Robillard	1	-3/+3

2017-12-25	Remove trivial destructors and use default where possible	David Robillard	1	-4/+0

2017-12-16	Make events take the corresponding message directly	David Robillard	1	-9/+17

2017-12-16	Make CompiledGraph::compile a free function	David Robillard	1	-2/+1

2017-02-12	Use smart pointers to handle real-time memory disposal	David Robillard	1	-6/+4

2016-10-02	Defer graph compilation in atomic bundles	David Robillard	1	-2/+25
	This avoids situations like compiling a graph hundreds of times when it is loaded because it has hundreds of nodes and each event triggers a re-compile. This speeds things up dramatically, but exacerbates the theoretical problem of there not being enough time in a cycle to execute a bundle. As far as I can tell, the execute phase of events is very fast, so hundreds or thousands can easily run in a tiny fraction of the process cycle, but this still needs resolution to be truly hard real-time. What probably needs to happen is that all context and state used to process is moved to CompiledGraph and nodes do not access their own fields at all, but have some references into the CompiledGraph. This way, a compiled graph is separate from its "source code", and an old one could continue to be run while a new one is beng applied across several cycles.
2016-09-29	Atomic bundle execution	David Robillard	1	-2/+25

2016-09-11	Remove last vestiges of multiple run contexts	David Robillard	1	-1/+1

2016-07-30	Add undo support	David Robillard	1	-0/+65