[LLVMdev] PassManager Dependence Question

[David Greene]

On Friday 19 September 2008 22:38, Chris Lattner wrote:

> > I noticed that the Verifier takes a VERY long time on large
> > programs.  This
> > appears to be due to its checking of defs dominating uses.  When a def
> > and use are in the same BasicBlock, DominatorTrees iterates over the
> > block until it finds one or the other.  Since Verifier does this for
> > each
> > Instruction, this is an n^2 algorithm.
>
> The verifier case is easy to fix.  Can you please send me a testcase?

Not the one I have, unfortunately.  It's code we can't release.  I can try to 
write an artificial test.

Can you outline the fix in general?

                                                     -Dave