| commit | d5811b965df21fff17b13117ec9a0fc3c9136e9f | [log] [tgz] |
|---|---|---|
| author | Nate Begeman <natebegeman@mac.com> | Sat Mar 11 02:20:46 2006 +0000 |
| committer | Nate Begeman <natebegeman@mac.com> | Sat Mar 11 02:20:46 2006 +0000 |
| tree | 1935742ea8bb1d2707723537b41ac984680fec3f | |
| parent | 69035f00e3d4ea598e5fe4d87ebf5d291131be36 [diff] |
Fix PR681 by using the standard Lengauer and Tarjan algorithm for dominator set construction, rather than intersecting various std::sets. This reduces the memory usage for the testcase in PR681 from 496 to 26MB of ram on my darwin system, and reduces the runtime from 32.8 to 0.8 seconds on a 2.5GHz G5. This also enables future code sharing between Dom and PostDom now that they share near-identical implementations. llvm-svn: 26707