Commit 7a8e8b2f authored by Artyom Pervukhin's avatar Artyom Pervukhin Committed by Nigel Tao

image/draw, image/color: optimize hot path sqDiff function

Function sqDiff is called multiple times in the hot path (x, y loops) of
drawPaletted from the image/draw package; number of sqDiff calls is
between 4×width×height and 4×width×height×len(palette) for each
drawPaletted call.

Simplify this function by removing arguments comparison and relying
instead on signed to unsigned integer conversion rules and properties of
unsigned integer values operations guaranteed by the spec:

> For unsigned integer values, the operations +, -, *, and << are
> computed modulo 2n, where n is the bit width of the unsigned integer's
> type. Loosely speaking, these unsigned integer operations discard high
> bits upon overflow, and programs may rely on ``wrap around''.

image/gif package benchmark that depends on the code updated shows
throughput improvements:

name               old time/op    new time/op    delta
QuantizedEncode-4     788ms ± 2%     468ms ± 9%  -40.58%  (p=0.000 n=9+10)

name               old speed      new speed      delta
QuantizedEncode-4  1.56MB/s ± 2%  2.63MB/s ± 8%  +68.47%  (p=0.000 n=9+10)

Closes #22375.

Change-Id: Ic9a540e39ceb21e7741d308af1cfbe61b4ac347b
Reviewed-on: https://go-review.googlesource.com/72373Reviewed-by: 's avatarNigel Tao <nigeltao@golang.org>
parent 62229970
......@@ -312,12 +312,29 @@ func (p Palette) Index(c Color) int {
//
// x and y are both assumed to be in the range [0, 0xffff].
func sqDiff(x, y uint32) uint32 {
var d uint32
if x > y {
d = x - y
} else {
d = y - x
}
// The canonical code of this function looks as follows:
//
// var d uint32
// if x > y {
// d = x - y
// } else {
// d = y - x
// }
// return (d * d) >> 2
//
// Language spec guarantees the following properties of unsigned integer
// values operations with respect to overflow/wrap around:
//
// > For unsigned integer values, the operations +, -, *, and << are
// > computed modulo 2n, where n is the bit width of the unsigned
// > integer's type. Loosely speaking, these unsigned integer operations
// > discard high bits upon overflow, and programs may rely on ``wrap
// > around''.
//
// Considering these properties and the fact that this function is
// called in the hot paths (x,y loops), it is reduced to the below code
// which is slightly faster. See TestSqDiff for correctness check.
d := x - y
return (d * d) >> 2
}
......
// Copyright 2017 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 color
import (
"testing"
"testing/quick"
)
func TestSqDiff(t *testing.T) {
// canonical sqDiff implementation
orig := func(x, y uint32) uint32 {
var d uint32
if x > y {
d = uint32(x - y)
} else {
d = uint32(y - x)
}
return (d * d) >> 2
}
testCases := []uint32{
0,
1,
2,
0x0fffd,
0x0fffe,
0x0ffff,
0x10000,
0x10001,
0x10002,
0xfffffffd,
0xfffffffe,
0xffffffff,
}
for _, x := range testCases {
for _, y := range testCases {
if got, want := sqDiff(x, y), orig(x, y); got != want {
t.Fatalf("sqDiff(%#x, %#x): got %d, want %d", x, y, got, want)
}
}
}
if err := quick.CheckEqual(orig, sqDiff, &quick.Config{MaxCountScale: 10}); err != nil {
t.Fatal(err)
}
}
......@@ -564,12 +564,10 @@ func clamp(i int32) int32 {
//
// x and y are both assumed to be in the range [0, 0xffff].
func sqDiff(x, y int32) uint32 {
var d uint32
if x > y {
d = uint32(x - y)
} else {
d = uint32(y - x)
}
// This is an optimized code relying on the overflow/wrap around
// properties of unsigned integers operations guaranteed by the language
// spec. See sqDiff from the image/color package for more details.
d := uint32(x - y)
return (d * d) >> 2
}
......
......@@ -10,6 +10,7 @@ import (
"image/png"
"os"
"testing"
"testing/quick"
)
func eq(c0, c1 color.Color) bool {
......@@ -467,3 +468,47 @@ loop:
}
}
}
func TestSqDiff(t *testing.T) {
// This test is similar to the one from the image/color package, but
// sqDiff in this package accepts int32 instead of uint32, so test it
// for appropriate input.
// canonical sqDiff implementation
orig := func(x, y int32) uint32 {
var d uint32
if x > y {
d = uint32(x - y)
} else {
d = uint32(y - x)
}
return (d * d) >> 2
}
testCases := []int32{
0,
1,
2,
0x0fffd,
0x0fffe,
0x0ffff,
0x10000,
0x10001,
0x10002,
0x7ffffffd,
0x7ffffffe,
0x7fffffff,
-0x7ffffffd,
-0x7ffffffe,
-0x80000000,
}
for _, x := range testCases {
for _, y := range testCases {
if got, want := sqDiff(x, y), orig(x, y); got != want {
t.Fatalf("sqDiff(%#x, %#x): got %d, want %d", x, y, got, want)
}
}
}
if err := quick.CheckEqual(orig, sqDiff, &quick.Config{MaxCountScale: 10}); err != nil {
t.Fatal(err)
}
}
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