\brief The heart of the phi-node placement algorithm Recursively walk the dominance tree starting from a given block. Calculate any children that are in the dominance frontier and add them to the \b merge array. \param qnode is the parent of the given block \param vnode is the given block
source not stored for this graph (policy: none)