cmd/compile: simplify a few bits of the code

Remove an unused type, a few redundant returns and replace a few slice
append loops with a single append.

Change-Id: If07248180bae5631b5b152c6051d9635889997d5
Reviewed-on: https://go-review.googlesource.com/66851
Run-TryBot: Daniel Martí <mvdan@mvdan.cc>
TryBot-Result: Gobot Gobot <gobot@golang.org>
Reviewed-by: Dave Cheney <dave@cheney.net>
This commit is contained in:
Daniel Martí 2017-09-28 20:17:59 +01:00
parent 6bbe1bc940
commit ded2c65db3
5 changed files with 3 additions and 19 deletions

View file

@ -1715,14 +1715,10 @@ func (s *regAllocState) placeSpills() {
}
oldSched = append(oldSched[:0], b.Values[nphi:]...)
b.Values = b.Values[:nphi]
for _, v := range start[b.ID] {
b.Values = append(b.Values, v)
}
b.Values = append(b.Values, start[b.ID]...)
for _, v := range oldSched {
b.Values = append(b.Values, v)
for _, w := range after[v.ID] {
b.Values = append(b.Values, w)
}
b.Values = append(b.Values, after[v.ID]...)
}
}
}
@ -2211,12 +2207,6 @@ type liveInfo struct {
pos src.XPos // source position of next use
}
// dblock contains information about desired & avoid registers at the end of a block.
type dblock struct {
prefers []desiredStateEntry
avoid regMask
}
// computeLive computes a map from block ID to a list of value IDs live at the end
// of that block. Together with the value ID is a count of how many instructions
// to the next use of that value. The resulting map is stored in s.live.