mirror of
https://github.com/ddidderr/wuffs.git
synced 2026-11-20 00:47:28 +01:00
wuffs_png_decode_19k_8bpp/clang9 95.7MB/s ± 1% 95.5MB/s ± 0% ~ (p=0.151 n=5+5) wuffs_png_decode_40k_24bpp/clang9 112MB/s ± 0% 115MB/s ± 0% +2.23% (p=0.008 n=5+5) wuffs_png_decode_77k_8bpp/clang9 357MB/s ± 0% 358MB/s ± 0% ~ (p=0.222 n=5+5) wuffs_png_decode_552k_32bpp/clang9 119MB/s ± 1% 124MB/s ± 0% +4.89% (p=0.008 n=5+5) wuffs_png_decode_4002k_24bpp/clang9 114MB/s ± 0% 116MB/s ± 0% +1.95% (p=0.008 n=5+5) wuffs_png_decode_filter_1_sub/clang9 919MB/s ± 1% 924MB/s ± 0% +0.57% (p=0.008 n=5+5) wuffs_png_decode_filter_2_up/clang9 13.3GB/s ± 1% 13.1GB/s ± 0% -2.02% (p=0.008 n=5+5) wuffs_png_decode_filter_3_average/clang9 554MB/s ± 0% 640MB/s ± 0% +15.61% (p=0.008 n=5+5) wuffs_png_decode_filter_4_paeth/clang9 61.9MB/s ± 1% 64.8MB/s ± 0% +4.59% (p=0.008 n=5+5) wuffs_png_decode_19k_8bpp/gcc10 100MB/s ± 1% 99MB/s ± 0% -0.92% (p=0.008 n=5+5) wuffs_png_decode_40k_24bpp/gcc10 114MB/s ± 0% 114MB/s ± 1% ~ (p=0.548 n=5+5) wuffs_png_decode_77k_8bpp/gcc10 325MB/s ± 0% 320MB/s ± 0% -1.45% (p=0.016 n=4+5) wuffs_png_decode_552k_32bpp/gcc10 160MB/s ± 0% 141MB/s ± 0% -11.59% (p=0.016 n=4+5) wuffs_png_decode_4002k_24bpp/gcc10 117MB/s ± 0% 118MB/s ± 0% +0.91% (p=0.008 n=5+5) wuffs_png_decode_filter_1_sub/gcc10 979MB/s ± 0% 1109MB/s ± 0% +13.30% (p=0.008 n=5+5) wuffs_png_decode_filter_2_up/gcc10 11.5GB/s ± 1% 11.1GB/s ± 0% -3.88% (p=0.008 n=5+5) wuffs_png_decode_filter_3_average/gcc10 644MB/s ± 0% 751MB/s ± 0% +16.69% (p=0.008 n=5+5) wuffs_png_decode_filter_4_paeth/gcc10 84.3MB/s ± 1% 76.9MB/s ± 0% -8.74% (p=0.008 n=5+5)
391 lines
8.8 KiB
Go
391 lines
8.8 KiB
Go
// Code generated by running "go generate". DO NOT EDIT.
|
|
|
|
// Copyright 2017 The Wuffs Authors.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// https://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package check
|
|
|
|
import (
|
|
a "github.com/google/wuffs/lang/ast"
|
|
t "github.com/google/wuffs/lang/token"
|
|
)
|
|
|
|
var reasons = [...]struct {
|
|
s string
|
|
r reason
|
|
}{
|
|
|
|
{`"a < b: b > a"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// b > a
|
|
if err := proveReasonRequirement(q, t.IDXBinaryGreaterThan, xb, xa); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
return nil
|
|
}},
|
|
|
|
{`"a < b: a < c; c < b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// a < c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c < b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a < b: a < c; c == b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// a < c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c == b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryEqEq, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a < b: a == c; c < b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// a == c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryEqEq, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c < b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a < b: a < c; c <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// a < c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a < b: a <= c; c < b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
// a <= c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c < b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a > b: b < a"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryGreaterThan {
|
|
return errFailed
|
|
}
|
|
// b < a
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xb, xa); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
return nil
|
|
}},
|
|
|
|
{`"a <= b: b >= a"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
// b >= a
|
|
if err := proveReasonRequirement(q, t.IDXBinaryGreaterEq, xb, xa); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
return nil
|
|
}},
|
|
|
|
{`"a <= b: a <= c; c <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
// a <= c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a <= b: a <= c; c == b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
// a <= c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c == b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryEqEq, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a <= b: a == c; c <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
// a == c
|
|
xc := argValue(q.tm, n.Args(), "c")
|
|
if xc == nil {
|
|
return errFailed
|
|
}
|
|
if err := proveReasonRequirement(q, t.IDXBinaryEqEq, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// c <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xc, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a >= b: b <= a"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, xb := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryGreaterEq {
|
|
return errFailed
|
|
}
|
|
// b <= a
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xb, xa); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
return nil
|
|
}},
|
|
|
|
{`"a < (b + c): a < c; 0 <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, t0 := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
op, xb, xc := parseBinaryOp(t0)
|
|
if op != t.IDXBinaryPlus {
|
|
return errFailed
|
|
}
|
|
// a < c
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// 0 <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, zeroExpr, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"a < (b + c): a < (b0 + c0); b0 <= b; c0 <= c"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, t0 := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
op, xb, xc := parseBinaryOp(t0)
|
|
if op != t.IDXBinaryPlus {
|
|
return errFailed
|
|
}
|
|
// a < (b0 + c0)
|
|
xb0 := argValue(q.tm, n.Args(), "b0")
|
|
if xb0 == nil {
|
|
return errFailed
|
|
}
|
|
xc0 := argValue(q.tm, n.Args(), "c0")
|
|
if xc0 == nil {
|
|
return errFailed
|
|
}
|
|
t1 := a.NewExpr(0, t.IDXBinaryPlus, 0, xb0.AsNode(), nil, xc0.AsNode(), nil)
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, t1); err != nil {
|
|
return err
|
|
}
|
|
// b0 <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xb0, xb); err != nil {
|
|
return err
|
|
}
|
|
// c0 <= c
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xc0, xc); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xb0
|
|
_ = xc
|
|
_ = xc0
|
|
return nil
|
|
}},
|
|
|
|
{`"a <= (a + b): 0 <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, xa, t0 := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
op, xa, xb := parseBinaryOp(t0)
|
|
if op != t.IDXBinaryPlus {
|
|
return errFailed
|
|
}
|
|
// 0 <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, zeroExpr, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
return nil
|
|
}},
|
|
|
|
{`"(a + b) <= c: a <= (c - b)"`, func(q *checker, n *a.Assert) error {
|
|
op, t0, xc := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessEq {
|
|
return errFailed
|
|
}
|
|
op, xa, xb := parseBinaryOp(t0)
|
|
if op != t.IDXBinaryPlus {
|
|
return errFailed
|
|
}
|
|
// a <= (c - b)
|
|
t1 := a.NewExpr(0, t.IDXBinaryMinus, 0, xc.AsNode(), nil, xb.AsNode(), nil)
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, xa, t1); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
|
|
{`"(a - b) < c: a < c; 0 <= b"`, func(q *checker, n *a.Assert) error {
|
|
op, t0, xc := parseBinaryOp(n.Condition())
|
|
if op != t.IDXBinaryLessThan {
|
|
return errFailed
|
|
}
|
|
op, xa, xb := parseBinaryOp(t0)
|
|
if op != t.IDXBinaryMinus {
|
|
return errFailed
|
|
}
|
|
// a < c
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessThan, xa, xc); err != nil {
|
|
return err
|
|
}
|
|
// 0 <= b
|
|
if err := proveReasonRequirement(q, t.IDXBinaryLessEq, zeroExpr, xb); err != nil {
|
|
return err
|
|
}
|
|
_ = xa
|
|
_ = xb
|
|
_ = xc
|
|
return nil
|
|
}},
|
|
}
|