[PATCH] D58327: [Dominators] Simplify and optimize path compression used in link-eval forest.

[Jakub Kuderski via Phabricator via llvm-commits]

kuhar added a comment.

In D58327#1403532 <https://reviews.llvm.org/D58327#1403532>, @MaskRay wrote:

> And how can I benchmark dynamic dominator tree? `CalculateFromScratch` is easy to benchmark as I can just repeatedly run the function analysis `domtree` and discard the result but I don't know how for the dynamic case...


The best method I came up with is to instrument the updater primitives (applyUpdates, insertEdge, deleteEdge, recalculate, etc.), and measure time within the running optimizer.  It should be best to get some big bitcode file and run opt with O3 <https://reviews.llvm.org/owners/package/3/> on it. clang is reasonably sized in this configuration, you should also have luck with webassembly and rippled. If you are with google, you can try some bigger internal targets (there is a script to compile a given target to bitcode).


Repository:
  rL LLVM

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D58327/new/

https://reviews.llvm.org/D58327