- Eliminate provably non-pointer nodes from graphs.
authorChris Lattner <sabre@nondot.org>
Fri, 14 Feb 2003 06:28:00 +0000 (06:28 +0000)
committerChris Lattner <sabre@nondot.org>
Fri, 14 Feb 2003 06:28:00 +0000 (06:28 +0000)
commit5f07a8b312e9d4ca0142b05ebb1ef088d88b4770
tree594b287994cb0ef09102ec9d2afe138564273404
parenta3183be835b09ad0a5bb94fbac6756ff4ba956ed
- Eliminate provably non-pointer nodes from graphs.

This helps a lot of testcases, for example:
            New Time  New #Nodes     Old Time    Old #Nodes
254.gap:    91.1024     21605        91.1397     22657
povray31:    2.7807      8613         3.0152     10338
255.vortex:  1.2034      8153         1.2172     8822
moria:        .6756      3150          .7054     3877
300.twolf:    .1652      2010          .1851     3270

Typically, testcases which use long and ulong integers a lot get better, f.e. povray above.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5566 91177308-0d34-0410-b5e6-96231b3b80d8
lib/Analysis/DataStructure/DataStructure.cpp