Fix graph ordering incl. Inserts, Returns and SideChains
authorRobin Gareus <robin@gareus.org>
Sun, 3 Apr 2016 18:24:14 +0000 (20:24 +0200)
committerRobin Gareus <robin@gareus.org>
Sun, 3 Apr 2016 20:45:23 +0000 (22:45 +0200)
commitdaa10a6a38638da3b9c5e6de615367e44ccf4e4c
treeaa45975c5a9d7503167c29d0c366553464d68b00
parent650f2802a0ac634dbcfa33172bf3bf51aa571845
Fix graph ordering incl. Inserts, Returns and SideChains

When building the process graph. Ardour usess
   Route::direct_feeds_according_to_reality()
This function only tests if the current route (or any ioprocessors)
is feeding another route's *input*.

Inserts, Return and now Sidechains are ignored as destinations on the
destination route are not taken into account.

This is now resolved by adding an IOVector, a collection of all inputs
of the destination route.
libs/ardour/ardour/io_vector.h [new file with mode: 0644]
libs/ardour/ardour/route.h
libs/ardour/route.cc