summaryrefslogtreecommitdiffstats
path: root/src/server/events/Mark.cpp
AgeCommit message (Collapse)AuthorFilesLines
2018-01-21Replace insert(make_pair(...)) with emplaceDavid Robillard1-1/+1
2018-01-17Clean up Engine component memory management and trim include treeDavid Robillard1-3/+3
2017-12-25Remove trivial destructors and use default where possibleDavid Robillard1-4/+0
2017-12-16Make events take the corresponding message directlyDavid Robillard1-9/+17
2017-12-16Make CompiledGraph::compile a free functionDavid Robillard1-2/+1
2017-02-12Use smart pointers to handle real-time memory disposalDavid Robillard1-6/+4
2016-10-02Defer graph compilation in atomic bundlesDavid Robillard1-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-29Atomic bundle executionDavid Robillard1-2/+25
2016-09-11Remove last vestiges of multiple run contextsDavid Robillard1-1/+1
2016-07-30Add undo supportDavid Robillard1-0/+65