-
Notifications
You must be signed in to change notification settings - Fork 721
/
find_params.go
214 lines (186 loc) · 4.42 KB
/
find_params.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
package compiler
import (
"fmt"
"github.com/sqlc-dev/sqlc/internal/sql/ast"
"github.com/sqlc-dev/sqlc/internal/sql/astutils"
)
func findParameters(root ast.Node) ([]paramRef, []error) {
refs := make([]paramRef, 0)
errors := make([]error, 0)
v := paramSearch{seen: make(map[int]struct{}), refs: &refs, errs: &errors}
astutils.Walk(v, root)
if len(*v.errs) > 0 {
return refs, *v.errs
} else {
return refs, nil
}
}
type paramRef struct {
parent ast.Node
rv *ast.RangeVar
ref *ast.ParamRef
name string // Named parameter support
}
type paramSearch struct {
parent ast.Node
rangeVar *ast.RangeVar
refs *[]paramRef
seen map[int]struct{}
errs *[]error
// XXX: Gross state hack for limit
limitCount ast.Node
limitOffset ast.Node
}
type limitCount struct {
}
func (l *limitCount) Pos() int {
return 0
}
type limitOffset struct {
}
func (l *limitOffset) Pos() int {
return 0
}
func (p paramSearch) Visit(node ast.Node) astutils.Visitor {
switch n := node.(type) {
case *ast.A_Expr:
p.parent = node
case *ast.BetweenExpr:
p.parent = node
case *ast.CallStmt:
p.parent = n.FuncCall
case *ast.DeleteStmt:
if n.LimitCount != nil {
p.limitCount = n.LimitCount
}
case *ast.FuncCall:
p.parent = node
case *ast.InsertStmt:
if s, ok := n.SelectStmt.(*ast.SelectStmt); ok {
for i, item := range s.TargetList.Items {
target, ok := item.(*ast.ResTarget)
if !ok {
continue
}
ref, ok := target.Val.(*ast.ParamRef)
if !ok {
continue
}
if len(n.Cols.Items) <= i {
*p.errs = append(*p.errs, fmt.Errorf("INSERT has more expressions than target columns"))
return p
}
*p.refs = append(*p.refs, paramRef{parent: n.Cols.Items[i], ref: ref, rv: n.Relation})
p.seen[ref.Location] = struct{}{}
}
for _, item := range s.ValuesLists.Items {
vl, ok := item.(*ast.List)
if !ok {
continue
}
for i, v := range vl.Items {
ref, ok := v.(*ast.ParamRef)
if !ok {
continue
}
if len(n.Cols.Items) <= i {
*p.errs = append(*p.errs, fmt.Errorf("INSERT has more expressions than target columns"))
return p
}
*p.refs = append(*p.refs, paramRef{parent: n.Cols.Items[i], ref: ref, rv: n.Relation})
p.seen[ref.Location] = struct{}{}
}
}
}
case *ast.UpdateStmt:
for _, item := range n.TargetList.Items {
target, ok := item.(*ast.ResTarget)
if !ok {
continue
}
ref, ok := target.Val.(*ast.ParamRef)
if !ok {
continue
}
for _, relation := range n.Relations.Items {
rv, ok := relation.(*ast.RangeVar)
if !ok {
continue
}
*p.refs = append(*p.refs, paramRef{parent: target, ref: ref, rv: rv})
}
p.seen[ref.Location] = struct{}{}
}
if n.LimitCount != nil {
p.limitCount = n.LimitCount
}
case *ast.RangeVar:
p.rangeVar = n
case *ast.ResTarget:
p.parent = node
case *ast.SelectStmt:
if n.LimitCount != nil {
p.limitCount = n.LimitCount
}
if n.LimitOffset != nil {
p.limitOffset = n.LimitOffset
}
case *ast.TypeCast:
p.parent = node
case *ast.ParamRef:
parent := p.parent
if count, ok := p.limitCount.(*ast.ParamRef); ok {
if n.Number == count.Number {
parent = &limitCount{}
}
}
if offset, ok := p.limitOffset.(*ast.ParamRef); ok {
if n.Number == offset.Number {
parent = &limitOffset{}
}
}
if _, found := p.seen[n.Location]; found {
break
}
// Special, terrible case for *ast.MultiAssignRef
set := true
if res, ok := parent.(*ast.ResTarget); ok {
if multi, ok := res.Val.(*ast.MultiAssignRef); ok {
set = false
if row, ok := multi.Source.(*ast.RowExpr); ok {
for i, arg := range row.Args.Items {
if ref, ok := arg.(*ast.ParamRef); ok {
if multi.Colno == i+1 && ref.Number == n.Number {
set = true
}
}
}
}
}
}
if set {
*p.refs = append(*p.refs, paramRef{parent: parent, ref: n, rv: p.rangeVar})
p.seen[n.Location] = struct{}{}
}
return nil
case *ast.In:
if n.Sel == nil {
p.parent = node
} else {
if sel, ok := n.Sel.(*ast.SelectStmt); ok && sel.FromClause != nil {
from := sel.FromClause
if schema, ok := from.Items[0].(*ast.RangeVar); ok && schema != nil {
p.rangeVar = &ast.RangeVar{
Catalogname: schema.Catalogname,
Schemaname: schema.Schemaname,
Relname: schema.Relname,
}
}
}
}
if _, ok := n.Expr.(*ast.ParamRef); ok {
p.Visit(n.Expr)
}
}
return p
}