IRDB dominance graph analysis fails for exception landing pads
The algorithm assumes that all nodes are reachable from the function entry-point, which is not the case for exception landing pads. This can lead to incorrect dominance results in the code of the landing pads.
In addition to the algorithm itself, the function IRDB_SDK::getDFSOrder has a related (but easily fixable) issue where all nodes not reachable from the entry-point are inserted into the dfs order in an undefined order.
Fixing the dfs order is required for the dominance analysis but does not seem to be sufficient to fix it.