diff options
author | Matthew Dempsky <mdempsky@google.com> | 2019-06-11 19:52:58 -0700 |
---|---|---|
committer | Matthew Dempsky <mdempsky@google.com> | 2019-06-12 18:03:46 +0000 |
commit | f44404ebbfeff57f3e45ebf4b314a320bb89841f (patch) | |
tree | 4e76a2aa951eb65617c6d50092ae53c1b329a23d /src/cmd/compile/internal/ssa/prove.go | |
parent | 87367cf86a0a8390418a8e2431a11d5dcdddff72 (diff) | |
download | go-git-f44404ebbfeff57f3e45ebf4b314a320bb89841f.tar.gz |
cmd/compile: fix range analysis of small signed integers
For int8, int16, and int32, comparing their unsigned value to MaxInt64
to determine non-negativity doesn't make sense, because they have
negative values whose unsigned representation is smaller than that.
Fix is simply to compare with the appropriate upper bound based on the
value type's size.
Fixes #32560.
Change-Id: Ie7afad7a56af92bd890ba5ff33c86d1df06cfd9a
Reviewed-on: https://go-review.googlesource.com/c/go/+/181797
Run-TryBot: Matthew Dempsky <mdempsky@google.com>
Reviewed-by: Josh Bleecher Snyder <josharian@gmail.com>
Reviewed-by: David Chase <drchase@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
TryBot-Result: Gobot Gobot <gobot@golang.org>
Diffstat (limited to 'src/cmd/compile/internal/ssa/prove.go')
-rw-r--r-- | src/cmd/compile/internal/ssa/prove.go | 18 |
1 files changed, 16 insertions, 2 deletions
diff --git a/src/cmd/compile/internal/ssa/prove.go b/src/cmd/compile/internal/ssa/prove.go index a73cd613f2..7c69327990 100644 --- a/src/cmd/compile/internal/ssa/prove.go +++ b/src/cmd/compile/internal/ssa/prove.go @@ -553,15 +553,29 @@ func (ft *factsTable) isNonNegative(v *Value) bool { return true } + var max int64 + switch v.Type.Size() { + case 1: + max = math.MaxInt8 + case 2: + max = math.MaxInt16 + case 4: + max = math.MaxInt32 + case 8: + max = math.MaxInt64 + default: + panic("unexpected integer size") + } + // Check if the recorded limits can prove that the value is positive - if l, has := ft.limits[v.ID]; has && (l.min >= 0 || l.umax <= math.MaxInt64) { + if l, has := ft.limits[v.ID]; has && (l.min >= 0 || l.umax <= uint64(max)) { return true } // Check if v = x+delta, and we can use x's limits to prove that it's positive if x, delta := isConstDelta(v); x != nil { if l, has := ft.limits[x.ID]; has { - if delta > 0 && l.min >= -delta && l.max <= math.MaxInt64-delta { + if delta > 0 && l.min >= -delta && l.max <= max-delta { return true } if delta < 0 && l.min >= -delta { |