forked from go-gremlins/gremlins
-
Notifications
You must be signed in to change notification settings - Fork 0
/
query.go
81 lines (66 loc) · 1.55 KB
/
query.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
package astutil
import (
"go/ast"
)
// IdentifiersInStatement returns all identifiers with their found in a statement.
func IdentifiersInStatement(stmt ast.Stmt) []ast.Expr {
w := &identifierWalker{}
ast.Walk(w, stmt)
return w.identifiers
}
type identifierWalker struct {
identifiers []ast.Expr
}
func (w *identifierWalker) Visit(node ast.Node) ast.Visitor {
if node == nil {
return nil
}
switch n := node.(type) {
case *ast.AssignStmt:
// Handle assignment statements
for _, expr := range n.Lhs {
if ident, ok := expr.(*ast.Ident); ok {
w.identifiers = append(w.identifiers, &ast.Ident{
Name: ident.Name,
})
}
}
case *ast.ExprStmt:
// Handle expression statements
if call, ok := n.X.(*ast.CallExpr); ok {
// Example: Check for Call expressions like func calls
for _, arg := range call.Args {
if ident, ok := arg.(*ast.Ident); ok {
w.identifiers = append(w.identifiers, &ast.Ident{
Name: ident.Name,
})
}
}
}
case *ast.IncDecStmt:
// Handle increment/decrement statements
if ident, ok := n.X.(*ast.Ident); ok {
w.identifiers = append(w.identifiers, &ast.Ident{
Name: ident.Name,
})
}
}
return w
}
// Functions returns all found functions.
func Functions(n ast.Node) []*ast.FuncDecl {
w := &functionWalker{}
ast.Walk(w, n)
return w.functions
}
type functionWalker struct {
functions []*ast.FuncDecl
}
func (w *functionWalker) Visit(node ast.Node) ast.Visitor {
switch n := node.(type) {
case *ast.FuncDecl:
w.functions = append(w.functions, n)
return nil
}
return w
}