Completely rewrite domset, idom, and domtree implementation. Now it is based
authorChris Lattner <sabre@nondot.org>
Sun, 7 Dec 2003 00:38:08 +0000 (00:38 +0000)
committerChris Lattner <sabre@nondot.org>
Sun, 7 Dec 2003 00:38:08 +0000 (00:38 +0000)
commit16addf87bf331645de63575aa15627c74b9cab66
tree3f863f02b76b49a64d9df9ee75547992481407e8
parent31b935357d1396d3be32fdf24dcb0319a6908c6f
Completely rewrite domset, idom, and domtree implementation.  Now it is based
on the algorithm for directly computing immediate dominators presented in this
paper:

  A Fast Algorithm for Finding Dominators in a Flowgraph
  T. Lengauer & R. Tarjan, ACM TOPLAS July 1979, pgs 121-141.

This _substantially_ speeds up construction of all dominator related information.
Post-dominators to follow.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@10301 91177308-0d34-0410-b5e6-96231b3b80d8
lib/VMCore/Dominators.cpp