diff options
| author | Chris Lattner <sabre@nondot.org> | 2007-08-08 06:24:20 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2007-08-08 06:24:20 +0000 |
| commit | 415750e13223ed79447d6791b683fed122315195 (patch) | |
| tree | e37e7593b0388ef0c7739bdff970b102afe5c6da /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | b17ab030814fe2a49a9b509cc28d464810a16d0e (diff) | |
| download | bcm5719-llvm-415750e13223ed79447d6791b683fed122315195.tar.gz bcm5719-llvm-415750e13223ed79447d6791b683fed122315195.zip | |
Speed up updateDFSNumbers with two observations:
1. domtree is a tree, not a graph. There is no need to avoid revisiting nodes with a set.
2. the worklist can contain the child iterator pointers so we don't get N^2 rescanning of children.
This speeds up updateDFSNumbers significantly, making it basically free. On the testcase in PR1432,
this speeds up loopsimplify by another 3x, dropping it from the 12th most expensive pass to the to
the 30th. :) It used to be #1.
llvm-svn: 40923
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions
