-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.go
290 lines (252 loc) · 6.52 KB
/
main.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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
// this is a fork from https://github.com/golang/exp/tree/master/cmd/modgraphviz
// Modgraphdot converts “go mod graph” output into Graphviz's DOT language,
// for use with Graphviz visualization and analysis tools like dot, dotty, and sccmap.
//
// Usage:
//
// go mod graph | modgraphdot > graph.dot
// go mod graph | modgraphdot [stop string] | dot -Tpng -o graph.png
//
package main
import (
"bufio"
"bytes"
"flag"
"fmt"
"io"
"log"
"os"
"sort"
"strings"
"golang.org/x/mod/semver"
)
func usage() {
fmt.Fprintf(os.Stderr, `Usage: go mod graph | modgraphdot [-p] [stop string] | dot -Tpng -o graph.png
For each module, the node representing the greatest version (i.e., the
version chosen by Go's minimal version selection algorithm) is colored green.
Other nodes, which aren't in the final build list, are colored grey.
If -p is set, only the the green ones will apper.
If [stop string] is defined
`)
os.Exit(2)
}
func main() {
log.SetFlags(0)
log.SetPrefix("modgraphdot: ")
flag.Usage = usage
var onlyPicked = flag.Bool("p", false, "if set, only the picked versions are displayed")
flag.Parse()
if flag.NArg() > 1 {
usage()
}
stopAt := flag.Arg(0)
if err := modgraphdot(os.Stdin, os.Stdout, *onlyPicked, stopAt); err != nil {
log.Fatal(err)
}
}
func modgraphdot(in io.Reader, out io.Writer, onlyPicked bool, stopAt string) error {
graph, err := convert(in)
if err != nil {
return err
}
if onlyPicked || stopAt != "" {
graph.trim(onlyPicked, stopAt)
}
fmt.Fprintf(out, "digraph gomodgraph {\n")
out.Write(graph.edgesAsDOT())
for _, n := range graph.mvsPicked {
fmt.Fprintf(out, "\t%q [style = filled, fillcolor = green]\n", n)
}
for _, n := range graph.mvsUnpicked {
fmt.Fprintf(out, "\t%q [style = filled, fillcolor = gray]\n", n)
}
fmt.Fprintf(out, "}\n")
return nil
}
type edge struct{ from, to string }
type graph struct {
edges []edge
mvsPicked []string
mvsUnpicked []string
}
func (g *graph) trim(onlyPicked bool, stopAt string) {
mvsPicked := map[string]bool{}
if onlyPicked {
for _, v := range g.mvsPicked {
mvsPicked[v] = true
}
}
nodes := make(map[string]*node)
// from
for _, v := range g.edges {
addToNodes(nodes, v.from, mvsPicked)
}
// to
for _, v := range g.edges {
addToNodes(nodes, v.to, mvsPicked)
}
// relate from -> to
for _, v := range g.edges {
from := nodes[v.from]
to := nodes[v.to]
from.nodes = append(from.nodes, to)
}
root := findRoot(nodes)
seen := map[string]bool{}
edges := make([]edge, 0)
edges, _ = root.toEdges(seen, edges, onlyPicked, stopAt)
g.edges = removeDuplicateEdges(edges)
currentEdges := map[string]bool{}
for _, v := range edges {
currentEdges[v.from] = true
currentEdges[v.to] = true
}
g.mvsPicked = filterOut(currentEdges, g.mvsPicked)
if onlyPicked {
g.mvsUnpicked = make([]string, 0)
} else {
g.mvsUnpicked = filterOut(currentEdges, g.mvsUnpicked)
}
}
type node struct {
name string
nodes []*node
picked bool
}
func newNode(name string, picked bool) *node {
return &node{name, make([]*node, 0), picked}
}
// toEdges converts this node to a stack os edges.
func (n *node) toEdges(seen map[string]bool, edges []edge, onlyPicked bool, stopAt string) ([]edge, bool) {
if seen[n.name] {
return edges, stopAt == ""
}
if stopAt != "" && strings.Contains(n.name, stopAt) {
return edges, true
}
seen[n.name] = true
found := false
for _, v := range n.nodes {
// check if it is valid to call, considering onlyPicked
if onlyPicked && !v.picked {
continue
}
edges = append(edges, edge{from: n.name, to: v.name}) // Push
if children, ok := v.toEdges(seen, edges, onlyPicked, stopAt); ok {
edges = children
found = true
} else {
edges = edges[:len(edges)-1] // Pop
}
}
delete(seen, n.name)
pick := (!onlyPicked || n.picked) && stopAt == ""
return edges, found || pick
}
func findRoot(nodes map[string]*node) *node {
var root *node
for k, v := range nodes {
if strings.IndexByte(k, '@') == -1 {
root = v
root.picked = true
return root
}
}
panic("There is no root node!!!")
}
func removeDuplicateEdges(edges []edge) []edge {
for i := len(edges) - 1; i >= 0; i-- {
e := edges[i]
// check equality
for k, v := range edges {
if k != i && e.from == v.from && e.to == v.to {
// delete
edges = append(edges[:i], edges[i+1:]...)
break
}
}
}
return edges
}
func filterOut(existing map[string]bool, toFilter []string) []string {
filtered := make([]string, 0)
for _, v := range toFilter {
if existing[v] {
filtered = append(filtered, v)
}
}
return filtered
}
// FIXME: side effect
func addToNodes(nodes map[string]*node, name string, msvPicked map[string]bool) {
if _, ok := nodes[name]; !ok {
picked := msvPicked[name]
nodes[name] = newNode(name, picked)
}
}
// convert reads “go mod graph” output from r and returns a graph, recording
// MVS picked and unpicked nodes along the way.
func convert(r io.Reader) (*graph, error) {
scanner := bufio.NewScanner(r)
var g graph
seen := map[string]bool{}
mvsPicked := map[string]string{} // module name -> module version
for scanner.Scan() {
l := scanner.Text()
if l == "" {
continue
}
parts := strings.Fields(l)
if len(parts) != 2 {
return nil, fmt.Errorf("expected 2 words in line, but got %d: %s", len(parts), l)
}
from := parts[0]
to := parts[1]
g.edges = append(g.edges, edge{from: from, to: to})
for _, node := range []string{from, to} {
if _, ok := seen[node]; ok {
// Skip over nodes we've already seen.
continue
}
seen[node] = true
var m, v string
if i := strings.IndexByte(node, '@'); i >= 0 {
m, v = node[:i], node[i+1:]
} else {
// Root node doesn't have a version.
continue
}
if maxV, ok := mvsPicked[m]; ok {
if semver.Compare(maxV, v) < 0 {
// This version is higher - replace it and consign the old
// max to the unpicked list.
g.mvsUnpicked = append(g.mvsUnpicked, m+"@"+maxV)
mvsPicked[m] = v
} else {
// Other version is higher - stick this version in the
// unpicked list.
g.mvsUnpicked = append(g.mvsUnpicked, node)
}
} else {
mvsPicked[m] = v
}
}
}
if err := scanner.Err(); err != nil {
return nil, err
}
for m, v := range mvsPicked {
g.mvsPicked = append(g.mvsPicked, m+"@"+v)
}
// Make this function deterministic.
sort.Strings(g.mvsPicked)
return &g, nil
}
// edgesAsDOT returns the edges in DOT notation.
func (g *graph) edgesAsDOT() []byte {
var buf bytes.Buffer
for _, e := range g.edges {
fmt.Fprintf(&buf, "\t%q -> %q\n", e.from, e.to)
}
return buf.Bytes()
}