-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathcallstack.go
More file actions
64 lines (54 loc) · 1.55 KB
/
Copy pathcallstack.go
File metadata and controls
64 lines (54 loc) · 1.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/*
* Copyright (C) 2018 The dad-go Authors
* This file is part of The dad-go library.
*
* The dad-go is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* The dad-go is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with The dad-go. If not, see <http://www.gnu.org/licenses/>.
*/
package errors
import (
"bytes"
"fmt"
"runtime"
)
type CallStacker interface {
GetCallStack() *CallStack
}
type CallStack struct {
Stacks []uintptr
}
func GetCallStacks(err error) *CallStack {
if err, ok := err.(CallStacker); ok {
return err.GetCallStack()
}
return nil
}
func CallStacksString(call *CallStack) string {
buf := bytes.Buffer{}
if call == nil {
return fmt.Sprintf("No call stack available")
}
for _, stack := range call.Stacks {
f := runtime.FuncForPC(stack)
file, line := f.FileLine(stack)
buf.WriteString(fmt.Sprintf("%s:%d - %s\n", file, line, f.Name()))
}
return fmt.Sprintf("%s", buf.Bytes())
}
func getCallStack(skip int, depth int) *CallStack {
stacks := make([]uintptr, depth)
stacklen := runtime.Callers(skip, stacks)
return &CallStack{
Stacks: stacks[:stacklen],
}
}