mirror of https://github.com/golang/go.git
cmd/compile: use stricter rule for possible partial overlap
Partial overlaps can only happen for strict sub-pieces of larger arrays. That's a much stronger condition than the current optimization rules. Update #54467 Change-Id: I11e539b71099e50175f37ee78fddf69283f83ee5 Reviewed-on: https://go-review.googlesource.com/c/go/+/433056 TryBot-Result: Gopher Robot <gobot@golang.org> Reviewed-by: David Chase <drchase@google.com> Run-TryBot: Keith Randall <khr@golang.org> Reviewed-by: Matthew Dempsky <mdempsky@google.com>
This commit is contained in:
parent
92a94a7024
commit
6485e8f503
|
|
@ -1588,18 +1588,16 @@ func (s *state) stmt(n ir.Node) {
|
||||||
}
|
}
|
||||||
|
|
||||||
// mayOverlap keeps track of whether the LHS and RHS might
|
// mayOverlap keeps track of whether the LHS and RHS might
|
||||||
// refer to overlapping memory.
|
// refer to partially overlapping memory. Partial overlapping can
|
||||||
mayOverlap := true
|
// only happen for arrays, see the comment in moveWhichMayOverlap.
|
||||||
if n.Y == nil {
|
//
|
||||||
// Not a move at all, mayOverlap is not relevant.
|
// If both sides of the assignment are not dereferences, then partial
|
||||||
} else if n.Def {
|
// overlap can't happen. Partial overlap can only occur only when the
|
||||||
// A variable being defined cannot overlap anything else.
|
// arrays referenced are strictly smaller parts of the same base array.
|
||||||
mayOverlap = false
|
// If one side of the assignment is a full array, then partial overlap
|
||||||
} else if n.X.Op() == ir.ONAME && n.Y.Op() == ir.ONAME {
|
// can't happen. (The arrays are either disjoint or identical.)
|
||||||
// Two named things never overlap.
|
mayOverlap := n.X.Op() == ir.ODEREF && (n.Y != nil && n.Y.Op() == ir.ODEREF)
|
||||||
// (Or they are identical, which we treat as nonoverlapping.)
|
if n.Y != nil && n.Y.Op() == ir.ODEREF {
|
||||||
mayOverlap = false
|
|
||||||
} else if n.Y.Op() == ir.ODEREF {
|
|
||||||
p := n.Y.(*ir.StarExpr).X
|
p := n.Y.(*ir.StarExpr).X
|
||||||
for p.Op() == ir.OCONVNOP {
|
for p.Op() == ir.OCONVNOP {
|
||||||
p = p.(*ir.ConvExpr).X
|
p = p.(*ir.ConvExpr).X
|
||||||
|
|
@ -1609,12 +1607,6 @@ func (s *state) stmt(n ir.Node) {
|
||||||
// That memory can't overlap with the memory being written.
|
// That memory can't overlap with the memory being written.
|
||||||
mayOverlap = false
|
mayOverlap = false
|
||||||
}
|
}
|
||||||
} else if n.Y.Op() == ir.ORESULT || n.Y.Op() == ir.OCALLFUNC || n.Y.Op() == ir.OCALLINTER {
|
|
||||||
// When copying values out of the return area of a call, we know
|
|
||||||
// the source and destination don't overlap. Importantly, we must
|
|
||||||
// set mayOverlap so we don't introduce a call to memmove while
|
|
||||||
// we still have live data in the argument area.
|
|
||||||
mayOverlap = false
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Evaluate RHS.
|
// Evaluate RHS.
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,59 @@
|
||||||
|
// asmcheck
|
||||||
|
|
||||||
|
// Copyright 2022 The Go Authors. All rights reserved.
|
||||||
|
// Use of this source code is governed by a BSD-style
|
||||||
|
// license that can be found in the LICENSE file.
|
||||||
|
|
||||||
|
package codegen
|
||||||
|
|
||||||
|
func f1(x *[4]int, y *[4]int) {
|
||||||
|
// amd64:".*memmove"
|
||||||
|
*x = *y
|
||||||
|
}
|
||||||
|
func f2(x *[4]int, y [4]int) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
*x = y
|
||||||
|
}
|
||||||
|
func f3(x *[4]int, y *[4]int) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
t := *y
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
*x = t
|
||||||
|
}
|
||||||
|
func f4(x *[4]int, y [4]int) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
t := y
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
*x = t
|
||||||
|
}
|
||||||
|
|
||||||
|
type T struct {
|
||||||
|
a [4]int
|
||||||
|
}
|
||||||
|
|
||||||
|
func f5(x, y *T) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
x.a = y.a
|
||||||
|
}
|
||||||
|
func f6(x *T, y T) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
x.a = y.a
|
||||||
|
}
|
||||||
|
func f7(x *T, y *[4]int) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
x.a = *y
|
||||||
|
}
|
||||||
|
func f8(x *[4]int, y *T) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
*x = y.a
|
||||||
|
}
|
||||||
|
|
||||||
|
func f9(x [][4]int, y [][4]int, i, j int) {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
x[i] = y[j]
|
||||||
|
}
|
||||||
|
|
||||||
|
func f10() []byte {
|
||||||
|
// amd64:-".*memmove"
|
||||||
|
return []byte("aReasonablyBigTestString")
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue