projects / libfirm / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d4bd39a) | patch
Use a more scalable algorithm for SSA reconstruction.
authorSebastian Buchwald <Sebastian.Buchwald@kit.edu>
Thu, 17 Mar 2011 17:56:08 +0000 (18:56 +0100)
committerSebastian Buchwald <Sebastian.Buchwald@kit.edu>
Fri, 8 Apr 2011 09:05:23 +0000 (11:05 +0200)
commit3bc96e65003777814c9f29f1f257c5343c2b61d6
treeeae71477083783cbbc43412d36e0af31e7379823tree | snapshot
parentd4bd39a33b854c82f3dc292fe79974adad1ab7a4commit | diff
Use a more scalable algorithm for SSA reconstruction.

The algorithm now processes a block at most once,
instead of |uses| times.
ir/be/bessaconstr.c diff | blob | history
ir/be/bessaconstr.h diff | blob | history
libfirm