mirror of
https://github.com/tailscale/tailscale.git
synced 2024-12-01 22:15:51 +00:00
350aab05e5
Consider the following pattern: err1 := foo() err2 := bar() err3 := baz() return multierr.New(err1, err2, err3) If err1, err2, and err3 are all nil, then multierr.New should not allocate. Thus, modify the logic of New to count the number of distinct error values and allocate the exactly needed slice. This also speeds up non-empty error situation since repeatedly growing with append is slow. Performance: name old time/op new time/op delta Empty-24 41.8ns ± 2% 6.4ns ± 1% -84.73% (p=0.000 n=10+10) NonEmpty-24 120ns ± 3% 69ns ± 1% -42.01% (p=0.000 n=9+10) name old alloc/op new alloc/op delta Empty-24 64.0B ± 0% 0.0B -100.00% (p=0.000 n=10+10) NonEmpty-24 168B ± 0% 88B ± 0% -47.62% (p=0.000 n=10+10) name old allocs/op new allocs/op delta Empty-24 1.00 ± 0% 0.00 -100.00% (p=0.000 n=10+10) NonEmpty-24 3.00 ± 0% 2.00 ± 0% -33.33% (p=0.000 n=10+10) Signed-off-by: Joe Tsai <joetsai@digital-static.net>
149 lines
3.4 KiB
Go
149 lines
3.4 KiB
Go
// Copyright (c) 2021 Tailscale Inc & 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 multierr provides a simple multiple-error type.
|
|
// It was inspired by github.com/go-multierror/multierror.
|
|
package multierr
|
|
|
|
import (
|
|
"errors"
|
|
"strings"
|
|
|
|
"golang.org/x/exp/slices"
|
|
)
|
|
|
|
// An Error represents multiple errors.
|
|
type Error struct {
|
|
errs []error
|
|
}
|
|
|
|
// Error implements the error interface.
|
|
func (e Error) Error() string {
|
|
s := new(strings.Builder)
|
|
s.WriteString("multiple errors:")
|
|
for _, err := range e.errs {
|
|
s.WriteString("\n\t")
|
|
s.WriteString(err.Error())
|
|
}
|
|
return s.String()
|
|
}
|
|
|
|
// Errors returns a slice containing all errors in e.
|
|
func (e Error) Errors() []error {
|
|
return slices.Clone(e.errs)
|
|
}
|
|
|
|
// TODO(https://go.dev/cl/53435): Implement Unwrap when Go 1.20 is released.
|
|
/*
|
|
// Unwrap returns the underlying errors as is.
|
|
func (e Error) Unwrap() []error {
|
|
// Do not clone since Unwrap requires callers to not mutate the slice.
|
|
// See the documentation in the Go "errors" package.
|
|
return e.errs
|
|
}
|
|
*/
|
|
|
|
// New returns an error composed from errs.
|
|
// Some errors in errs get special treatment:
|
|
// - nil errors are discarded
|
|
// - errors of type Error are expanded into the top level
|
|
//
|
|
// If the resulting slice has length 0, New returns nil.
|
|
// If the resulting slice has length 1, New returns that error.
|
|
// If the resulting slice has length > 1, New returns that slice as an Error.
|
|
func New(errs ...error) error {
|
|
// First count the number of errors to avoid allocating.
|
|
var n int
|
|
var errFirst error
|
|
for _, e := range errs {
|
|
switch e := e.(type) {
|
|
case nil:
|
|
continue
|
|
case Error:
|
|
n += len(e.errs)
|
|
if errFirst == nil && len(e.errs) > 0 {
|
|
errFirst = e.errs[0]
|
|
}
|
|
default:
|
|
n++
|
|
if errFirst == nil {
|
|
errFirst = e
|
|
}
|
|
}
|
|
}
|
|
if n <= 1 {
|
|
return errFirst // nil if n == 0
|
|
}
|
|
|
|
// More than one error, allocate slice and construct the multi-error.
|
|
dst := make([]error, 0, n)
|
|
for _, e := range errs {
|
|
switch e := e.(type) {
|
|
case nil:
|
|
continue
|
|
case Error:
|
|
dst = append(dst, e.errs...)
|
|
default:
|
|
dst = append(dst, e)
|
|
}
|
|
}
|
|
return Error{errs: dst}
|
|
}
|
|
|
|
// Is reports whether any error in e matches target.
|
|
func (e Error) Is(target error) bool {
|
|
for _, err := range e.errs {
|
|
if errors.Is(err, target) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// As finds the first error in e that matches target, and if any is found,
|
|
// sets target to that error value and returns true. Otherwise, it returns false.
|
|
func (e Error) As(target any) bool {
|
|
for _, err := range e.errs {
|
|
if ok := errors.As(err, target); ok {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// Range performs a pre-order, depth-first iteration of the error tree
|
|
// by successively unwrapping all error values.
|
|
// For each iteration it calls fn with the current error value and
|
|
// stops iteration if it ever reports false.
|
|
func Range(err error, fn func(error) bool) bool {
|
|
if err == nil {
|
|
return true
|
|
}
|
|
if !fn(err) {
|
|
return false
|
|
}
|
|
switch err := err.(type) {
|
|
case interface{ Unwrap() error }:
|
|
if err := err.Unwrap(); err != nil {
|
|
if !Range(err, fn) {
|
|
return false
|
|
}
|
|
}
|
|
case interface{ Unwrap() []error }:
|
|
for _, err := range err.Unwrap() {
|
|
if !Range(err, fn) {
|
|
return false
|
|
}
|
|
}
|
|
// TODO(https://go.dev/cl/53435): Delete this when Error implements Unwrap.
|
|
case Error:
|
|
for _, err := range err.errs {
|
|
if !Range(err, fn) {
|
|
return false
|
|
}
|
|
}
|
|
}
|
|
return true
|
|
}
|