227 lines
5.7 KiB
Go
227 lines
5.7 KiB
Go
|
package errors
|
||
|
|
||
|
import (
|
||
|
"bytes"
|
||
|
"fmt"
|
||
|
"io"
|
||
|
"path"
|
||
|
"runtime"
|
||
|
"strconv"
|
||
|
"strings"
|
||
|
)
|
||
|
|
||
|
// StackTracer retrieves the StackTrace
|
||
|
// Generally you would want to use the GetStackTracer function to do that.
|
||
|
type StackTracer interface {
|
||
|
StackTrace() StackTrace
|
||
|
}
|
||
|
|
||
|
// GetStackTracer will return the first StackTracer in the causer chain.
|
||
|
// This function is used by AddStack to avoid creating redundant stack traces.
|
||
|
//
|
||
|
// You can also use the StackTracer interface on the returned error to get the stack trace.
|
||
|
func GetStackTracer(origErr error) StackTracer {
|
||
|
var stacked StackTracer
|
||
|
WalkDeep(origErr, func(err error) bool {
|
||
|
if stackTracer, ok := err.(StackTracer); ok {
|
||
|
stacked = stackTracer
|
||
|
return true
|
||
|
}
|
||
|
return false
|
||
|
})
|
||
|
return stacked
|
||
|
}
|
||
|
|
||
|
// Frame represents a program counter inside a stack frame.
|
||
|
type Frame uintptr
|
||
|
|
||
|
// pc returns the program counter for this frame;
|
||
|
// multiple frames may have the same PC value.
|
||
|
func (f Frame) pc() uintptr { return uintptr(f) - 1 }
|
||
|
|
||
|
// file returns the full path to the file that contains the
|
||
|
// function for this Frame's pc.
|
||
|
func (f Frame) file() string {
|
||
|
fn := runtime.FuncForPC(f.pc())
|
||
|
if fn == nil {
|
||
|
return "unknown"
|
||
|
}
|
||
|
file, _ := fn.FileLine(f.pc())
|
||
|
return file
|
||
|
}
|
||
|
|
||
|
// line returns the line number of source code of the
|
||
|
// function for this Frame's pc.
|
||
|
func (f Frame) line() int {
|
||
|
fn := runtime.FuncForPC(f.pc())
|
||
|
if fn == nil {
|
||
|
return 0
|
||
|
}
|
||
|
_, line := fn.FileLine(f.pc())
|
||
|
return line
|
||
|
}
|
||
|
|
||
|
// Format formats the frame according to the fmt.Formatter interface.
|
||
|
//
|
||
|
// %s source file
|
||
|
// %d source line
|
||
|
// %n function name
|
||
|
// %v equivalent to %s:%d
|
||
|
//
|
||
|
// Format accepts flags that alter the printing of some verbs, as follows:
|
||
|
//
|
||
|
// %+s function name and path of source file relative to the compile time
|
||
|
// GOPATH separated by \n\t (<funcname>\n\t<path>)
|
||
|
// %+v equivalent to %+s:%d
|
||
|
func (f Frame) Format(s fmt.State, verb rune) {
|
||
|
f.format(s, s, verb)
|
||
|
}
|
||
|
|
||
|
// format allows stack trace printing calls to be made with a bytes.Buffer.
|
||
|
func (f Frame) format(w io.Writer, s fmt.State, verb rune) {
|
||
|
switch verb {
|
||
|
case 's':
|
||
|
switch {
|
||
|
case s.Flag('+'):
|
||
|
pc := f.pc()
|
||
|
fn := runtime.FuncForPC(pc)
|
||
|
if fn == nil {
|
||
|
io.WriteString(w, "unknown")
|
||
|
} else {
|
||
|
file, _ := fn.FileLine(pc)
|
||
|
io.WriteString(w, fn.Name())
|
||
|
io.WriteString(w, "\n\t")
|
||
|
io.WriteString(w, file)
|
||
|
}
|
||
|
default:
|
||
|
io.WriteString(w, path.Base(f.file()))
|
||
|
}
|
||
|
case 'd':
|
||
|
io.WriteString(w, strconv.Itoa(f.line()))
|
||
|
case 'n':
|
||
|
name := runtime.FuncForPC(f.pc()).Name()
|
||
|
io.WriteString(w, funcname(name))
|
||
|
case 'v':
|
||
|
f.format(w, s, 's')
|
||
|
io.WriteString(w, ":")
|
||
|
f.format(w, s, 'd')
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// StackTrace is stack of Frames from innermost (newest) to outermost (oldest).
|
||
|
type StackTrace []Frame
|
||
|
|
||
|
// Format formats the stack of Frames according to the fmt.Formatter interface.
|
||
|
//
|
||
|
// %s lists source files for each Frame in the stack
|
||
|
// %v lists the source file and line number for each Frame in the stack
|
||
|
//
|
||
|
// Format accepts flags that alter the printing of some verbs, as follows:
|
||
|
//
|
||
|
// %+v Prints filename, function, and line number for each Frame in the stack.
|
||
|
func (st StackTrace) Format(s fmt.State, verb rune) {
|
||
|
var b bytes.Buffer
|
||
|
switch verb {
|
||
|
case 'v':
|
||
|
switch {
|
||
|
case s.Flag('+'):
|
||
|
b.Grow(len(st) * stackMinLen)
|
||
|
for _, fr := range st {
|
||
|
b.WriteByte('\n')
|
||
|
fr.format(&b, s, verb)
|
||
|
}
|
||
|
case s.Flag('#'):
|
||
|
fmt.Fprintf(&b, "%#v", []Frame(st))
|
||
|
default:
|
||
|
st.formatSlice(&b, s, verb)
|
||
|
}
|
||
|
case 's':
|
||
|
st.formatSlice(&b, s, verb)
|
||
|
}
|
||
|
io.Copy(s, &b)
|
||
|
}
|
||
|
|
||
|
// formatSlice will format this StackTrace into the given buffer as a slice of
|
||
|
// Frame, only valid when called with '%s' or '%v'.
|
||
|
func (st StackTrace) formatSlice(b *bytes.Buffer, s fmt.State, verb rune) {
|
||
|
b.WriteByte('[')
|
||
|
if len(st) == 0 {
|
||
|
b.WriteByte(']')
|
||
|
return
|
||
|
}
|
||
|
|
||
|
b.Grow(len(st) * (stackMinLen / 4))
|
||
|
st[0].format(b, s, verb)
|
||
|
for _, fr := range st[1:] {
|
||
|
b.WriteByte(' ')
|
||
|
fr.format(b, s, verb)
|
||
|
}
|
||
|
b.WriteByte(']')
|
||
|
}
|
||
|
|
||
|
// stackMinLen is a best-guess at the minimum length of a stack trace. It
|
||
|
// doesn't need to be exact, just give a good enough head start for the buffer
|
||
|
// to avoid the expensive early growth.
|
||
|
const stackMinLen = 96
|
||
|
|
||
|
// stack represents a stack of program counters.
|
||
|
type stack []uintptr
|
||
|
|
||
|
func (s *stack) Format(st fmt.State, verb rune) {
|
||
|
switch verb {
|
||
|
case 'v':
|
||
|
switch {
|
||
|
case st.Flag('+'):
|
||
|
var b bytes.Buffer
|
||
|
b.Grow(len(*s) * stackMinLen)
|
||
|
for _, pc := range *s {
|
||
|
f := Frame(pc)
|
||
|
b.WriteByte('\n')
|
||
|
f.format(&b, st, 'v')
|
||
|
}
|
||
|
io.Copy(st, &b)
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func (s *stack) StackTrace() StackTrace {
|
||
|
f := make([]Frame, len(*s))
|
||
|
for i := 0; i < len(f); i++ {
|
||
|
f[i] = Frame((*s)[i])
|
||
|
}
|
||
|
return f
|
||
|
}
|
||
|
|
||
|
func callers() *stack {
|
||
|
return callersSkip(4)
|
||
|
}
|
||
|
|
||
|
func callersSkip(skip int) *stack {
|
||
|
const depth = 32
|
||
|
var pcs [depth]uintptr
|
||
|
n := runtime.Callers(skip, pcs[:])
|
||
|
var st stack = pcs[0:n]
|
||
|
return &st
|
||
|
}
|
||
|
|
||
|
// funcname removes the path prefix component of a function's name reported by func.Name().
|
||
|
func funcname(name string) string {
|
||
|
i := strings.LastIndex(name, "/")
|
||
|
name = name[i+1:]
|
||
|
i = strings.Index(name, ".")
|
||
|
return name[i+1:]
|
||
|
}
|
||
|
|
||
|
// NewStack is for library implementers that want to generate a stack trace.
|
||
|
// Normally you should insted use AddStack to get an error with a stack trace.
|
||
|
//
|
||
|
// The result of this function can be turned into a stack trace by calling .StackTrace()
|
||
|
//
|
||
|
// This function takes an argument for the number of stack frames to skip.
|
||
|
// This avoids putting stack generation function calls like this one in the stack trace.
|
||
|
// A value of 0 will give you the line that called NewStack(0)
|
||
|
// A library author wrapping this in their own function will want to use a value of at least 1.
|
||
|
func NewStack(skip int) StackTracer {
|
||
|
return callersSkip(skip + 3)
|
||
|
}
|