On Thu Apr 16 09:38:33 2026 +0000, Rémi Bernon wrote:
This could also be something about dynamic branch discovery -which was probably something I had in mind at some point and related to 18e19a7903cf4c62f83aa1503aa14002a071efc4 removal- where you would only enumerate source branches first, then discover more of the graph either by continuing enumeration from each successfully connected downstream node to each of their outputs, or, in case of optional connection failures by keeping the upstream node and generating new branches from it to the downstream optional node outputs. I've thought along the same lines. It should be possible to remove the branch list if we do this. Just pass each source node discovered to a function which resolves the chain all the way to the output. We would need to keep a careful count of nodes resolved/rejected to be able to determine at the end if all nodes in the input topology were accounted for.
-- https://gitlab.winehq.org/wine/wine/-/merge_requests/10645#note_136514