qbit/go
1
0
Fork 0
mirror of https://github.com/golang/go synced 2024-10-05 22:21:23 -06:00
Code Releases Activity

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

Browse Source 
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/12244
Reviewed-by: Keith Randall <khr@golang.org>
This commit is contained in:
Josh Bleecher Snyder 2015-07-15 14:38:19 -06:00
parent 00437ebe73
commit 8c954d5780
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
src/cmd/compile/internal/ssa/cse.go
View File

@ -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.