/
simple.go
89 lines (75 loc) · 1.61 KB
/
simple.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
// Copyright 2024 Chainguard, Inc.
// SPDX-License-Identifier: Apache-2.0
package render
import (
"context"
"fmt"
"io"
"sort"
"github.com/chainguard-dev/bincapz/pkg/bincapz"
)
type Simple struct {
w io.Writer
}
func NewSimple(w io.Writer) Simple {
return Simple{w: w}
}
func (r Simple) File(_ context.Context, fr bincapz.FileReport) error {
fmt.Fprintf(r.w, "# %s\n", fr.Path)
bs := []string{}
for k := range fr.Behaviors {
bs = append(bs, k)
}
sort.Strings(bs)
for _, k := range bs {
fmt.Fprintf(r.w, "%s\n", k)
}
return nil
}
func (r Simple) Full(_ context.Context, rep bincapz.Report) error {
for f, fr := range rep.Diff.Removed {
fmt.Fprintf(r.w, "--- missing: %s\n", f)
bs := []string{}
for k := range fr.Behaviors {
bs = append(bs, k)
}
sort.Strings(bs)
for _, k := range bs {
fmt.Fprintf(r.w, "-%s\n", k)
}
}
for f, fr := range rep.Diff.Removed {
fmt.Fprintf(r.w, "++++ added: %s\n", f)
bs := []string{}
for k := range fr.Behaviors {
bs = append(bs, k)
}
sort.Strings(bs)
for _, k := range bs {
fmt.Fprintf(r.w, "+%s\n", k)
}
}
for f, fr := range rep.Diff.Modified {
if fr.PreviousRelPath != "" {
fmt.Fprintf(r.w, ">>> moved: %s -> %s (score: %f)\n", fr.PreviousRelPath, f, fr.PreviousRelPathScore)
} else {
fmt.Fprintf(r.w, "*** changed: %s\n", fr.Path)
}
bs := []string{}
for k := range fr.Behaviors {
bs = append(bs, k)
}
sort.Strings(bs)
for _, k := range bs {
b := fr.Behaviors[k]
if b.DiffRemoved {
fmt.Fprintf(r.w, "-%s\n", k)
continue
}
if b.DiffAdded {
fmt.Fprintf(r.w, "+%s\n", k)
}
}
}
return nil
}