[PATCH] D46564: [SSAUpdaterBulk] Sort blocks in IDF to avoid non-determinism.

[Michael Zolotukhin via Phabricator via llvm-commits]

mzolotukhin added a comment.

> The solution in IDF should just be changing domtreenodepair to a tuple, with the last item being domtreenode->getDFSNumIn()

Just to make sure I understand you correctly: we need to change `pair<DomTreeNode *, unsigned>` to `tuple<DomTreeNode *, unsigned, unsigned>` and use the second and third elements as keys for the priority queue (i.e. we will need to implement a compare function for it, which will look at RootLevel first and at DfsNumber second if RootLevels are the same). Is it what you meant?

Michael


Repository:
  rL LLVM

https://reviews.llvm.org/D46564