-
Notifications
You must be signed in to change notification settings - Fork 0
/
goinspect.go
152 lines (130 loc) · 3.73 KB
/
goinspect.go
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
package goinspect
import (
"fmt"
"go/token"
"io"
"log"
"strings"
"github.com/podhmo/goinspect/graph"
"golang.org/x/tools/go/packages"
)
type Config struct {
Fset *token.FileSet
PkgPath string
Padding string
ExpandAll bool
IncludeUnexported bool
OtherPackages []string
skipHeader bool
}
func (c *Config) NeedName(name string) bool {
return c.IncludeUnexported || token.IsExported(name)
}
func Scan(c *Config, pkgs []*packages.Package) (*Graph, error) {
if c.Fset == nil {
c.Fset = token.NewFileSet()
}
g := graph.New(func(s *Subject) string { return s.ID })
pkgMap := make(map[string]*packages.Package, len(pkgs))
for _, pkg := range pkgs {
pkgMap[pkg.ID] = pkg
}
scanner := &Scanner{
g: g,
pkgMap: pkgMap,
Config: c,
}
for _, pkg := range pkgs {
if len(pkg.Errors) > 0 {
return nil, pkg.Errors[0] // TODO: multierror
}
for _, f := range pkg.Syntax {
if err := scanner.Scan(pkg, f); err != nil {
log.Printf("! %+v", err)
}
}
}
return g, nil
}
func DumpAll(w io.Writer, c *Config, g *Graph) error {
return Dump(w, c, g, g.Nodes)
}
func Dump(w io.Writer, c *Config, g *Graph, nodes []*Node) error {
pkgpath := c.PkgPath
expand := c.ExpandAll
rows := make([]*row, 0, len(nodes))
sameIDRows := map[int][]*row{}
g.WalkPath(func(path []*Node) {
parts := strings.Split(pkgpath, "/")
prefix := strings.Join(parts[:len(parts)-1], "/") + "/"
node := path[len(path)-1]
if len(path) == 1 {
if len(node.From) == 0 && len(node.To) > 0 && c.NeedName(node.Name) && (node.Value.Recv == "" || c.NeedName(node.Value.Recv)) {
name := strings.ReplaceAll(path[len(path)-1].Value.Object.String(), prefix, "")
row := &row{indent: len(path), text: name, id: node.ID, hasChildren: len(node.To) > 0, isToplevel: true}
rows = append(rows, row)
sameIDRows[node.ID] = append(sameIDRows[node.ID], row)
}
} else {
if c.NeedName(node.Name) && (node.Value.Recv == "" || c.NeedName(node.Value.Recv)) {
name := strings.ReplaceAll(node.Value.Object.String(), prefix, "")
row := &row{indent: len(path), text: name, id: node.ID, hasChildren: len(node.To) > 0}
rows = append(rows, row)
sameIDRows[node.ID] = append(sameIDRows[node.ID], row)
}
}
}, nodes)
if !c.skipHeader {
fmt.Fprintf(w, "package %s\n", pkgpath)
}
seen := make(map[int][]int, len(sameIDRows))
if expand {
for i, row := range rows {
if row.isToplevel {
fmt.Fprintln(w, "")
}
if showID := len(sameIDRows[row.id]) > 1 && row.hasChildren; showID {
if len(seen[row.id]) == 0 {
fmt.Fprintf(w, "%s%s\n", strings.Repeat(c.Padding, row.indent), row.text)
} else {
idx := seen[row.id][0]
st := rows[idx]
fmt.Fprintf(w, "%s%s\n", strings.Repeat(c.Padding, row.indent), st.text)
for _, x := range rows[idx+1:] {
if x.indent <= st.indent {
break
}
fmt.Fprintf(w, "%s%s\n", strings.Repeat(c.Padding, row.indent+(x.indent-st.indent)), x.text)
}
}
seen[row.id] = append(seen[row.id], i)
} else {
fmt.Fprintf(w, "%s%s\n", strings.Repeat(c.Padding, row.indent), row.text)
}
}
} else {
for i, row := range rows {
if row.isToplevel {
fmt.Fprintln(w, "")
}
if showID := len(sameIDRows[row.id]) > 1 && row.hasChildren; showID {
if len(seen[row.id]) == 0 {
fmt.Fprintf(w, "%s%s // &%d\n", strings.Repeat(c.Padding, row.indent), row.text, row.id)
} else {
fmt.Fprintf(w, "%s%s // *%d\n", strings.Repeat(c.Padding, row.indent), row.text, row.id)
}
seen[row.id] = append(seen[row.id], i)
} else {
fmt.Fprintf(w, "%s%s\n", strings.Repeat(c.Padding, row.indent), row.text)
}
}
}
return nil
}
type row struct {
indent int
text string
id int
hasChildren bool
isToplevel bool
}