/
matcher.go
76 lines (60 loc) · 1.29 KB
/
matcher.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
package matcher
import (
"fmt"
"go/ast"
"go/types"
"golang.org/x/tools/go/ast/inspector"
"honnef.co/go/tools/pattern"
)
type Context = pattern.Matcher
type Pattern interface {
Matches(Context, ast.Node) bool
Nodes() []ast.Node
}
type Matcher struct {
inspector *inspector.Inspector
types *types.Info
}
func (m *Matcher) Find() []Match {
var matches []Match
// matcher := pattern.Matcher{
// TypesInfo: m.types,
// State: make(map[string]any),
// }
// pattern.Pattern{
// Root: ,
// }
// matcher.Match()
// p := pattern.MustParse(`(CallExpr (Symbol "fmt.Sprintf") (Binding "args" _))`)
p := pattern.MustParse(`
(CallExpr (Symbol "time.Now") (Binding "args" _))
(CallExpr
["subtracted"@(_)]
)
`)
fmt.Printf("%#v\n", p)
// p := pattern.Pattern{
// Root: pattern.CallExpr{
// Fun: pattern.Symbol{
// Name: pattern.String("fmt.Sprintf"),
// },
// Args: pattern.Any{},
// },
// Relevant: make(map[reflect.Type]struct{}),
// }
m.inspector.Preorder([]ast.Node{
(*ast.CallExpr)(nil),
}, func(n ast.Node) {
matcher := pattern.Matcher{
TypesInfo: m.types,
State: make(map[string]any),
}
if matcher.Match(p, n) {
fmt.Printf("%#v\n", matcher)
matches = append(matches, &match{
nodes: []ast.Node{n},
})
}
})
return matches
}