Commit 8c954d57 authored by Josh Bleecher Snyder's avatar Josh Bleecher Snyder

[dev.ssa] cmd/compile: speed up cse

By walking only the current set of partitions
at any given point, the cse pass ended up doing
lots of extraneous, effectively O(n^2) work.

Using a regular for loop allows each cse pass to
make as much progress as possible by processing
each new class as it is introduced.

This can and should be optimized further,
but it already reduces by 75% cse time on test/slice3.go.

The overall time to compile test/slice3.go is still
dominated by the O(n^2) work in the liveness pass.
However, Keith is rewriting regalloc anyway.

Change-Id: I8be020b2f69352234587eeadeba923481bf43fcc
Reviewed-on: https://go-review.googlesource.com/12244Reviewed-by: default avatarKeith Randall <khr@golang.org>
parent 00437ebe
...@@ -69,7 +69,10 @@ func cse(f *Func) { ...@@ -69,7 +69,10 @@ func cse(f *Func) {
for { for {
changed := false changed := false
for i, e := range partition { // partition can grow in the loop. By not using a range loop here,
// we process new additions as they arrive, avoiding O(n^2) behavior.
for i := 0; i < len(partition); i++ {
e := partition[i]
v := e[0] v := e[0]
// all values in this equiv class that are not equivalent to v get moved // all values in this equiv class that are not equivalent to v get moved
// into another equiv class q. // into another equiv class q.
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment