forked from src-d/go-mysql-server
/
prune_columns.go
288 lines (237 loc) · 6.49 KB
/
prune_columns.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
package analyzer
import (
"fmt"
"github.com/src-d/go-mysql-server/sql"
"github.com/src-d/go-mysql-server/sql/expression"
"github.com/src-d/go-mysql-server/sql/plan"
)
type usedColumns map[string]map[string]struct{}
func pruneColumns(ctx *sql.Context, a *Analyzer, n sql.Node) (sql.Node, error) {
a.Log("pruning columns, node of type %T", n)
if !n.Resolved() {
return n, nil
}
if describe, ok := n.(*plan.DescribeQuery); ok {
pruned, err := pruneColumns(ctx, a, describe.Child)
if err != nil {
return nil, err
}
return plan.NewDescribeQuery(describe.Format, pruned), nil
}
columns := make(usedColumns)
// All the columns required for the output of the query must be mark as
// used, otherwise the schema would change.
for _, col := range n.Schema() {
if _, ok := columns[col.Source]; !ok {
columns[col.Source] = make(map[string]struct{})
}
columns[col.Source][col.Name] = struct{}{}
}
findUsedColumns(columns, n)
n, err := pruneUnusedColumns(n, columns)
if err != nil {
return nil, err
}
n, err = pruneSubqueries(ctx, a, n, columns)
if err != nil {
return nil, err
}
return fixRemainingFieldsIndexes(n)
}
func pruneSubqueryColumns(
ctx *sql.Context,
a *Analyzer,
n *plan.SubqueryAlias,
parentColumns usedColumns,
) (sql.Node, error) {
a.Log("pruning columns of subquery with alias %q", n.Name())
columns := make(usedColumns)
// The columns coming from the parent have the subquery alias name as the
// source. We need to find the real table in order to prune the subquery
// correctly.
tableByCol := make(map[string]string)
for _, col := range n.Child.Schema() {
tableByCol[col.Name] = col.Source
}
for col := range parentColumns[n.Name()] {
table, ok := tableByCol[col]
if !ok {
// This should never happen, but better be safe than sorry.
return nil, fmt.Errorf("this is likely a bug: missing projected column %q on subquery %q", col, n.Name())
}
if _, ok := columns[table]; !ok {
columns[table] = make(map[string]struct{})
}
columns[table][col] = struct{}{}
}
findUsedColumns(columns, n.Child)
node, err := pruneUnusedColumns(n.Child, columns)
if err != nil {
return nil, err
}
node, err = pruneSubqueries(ctx, a, node, columns)
if err != nil {
return nil, err
}
// There is no need to fix the field indexes after pruning here
// because the main query will take care of fixing the indexes of all the
// nodes in the tree.
return plan.NewSubqueryAlias(n.Name(), node), nil
}
func findUsedColumns(columns usedColumns, n sql.Node) {
plan.Inspect(n, func(n sql.Node) bool {
switch n := n.(type) {
case *plan.Project:
addUsedProjectColumns(columns, n.Projections)
return true
case *plan.GroupBy:
addUsedProjectColumns(columns, n.Aggregate)
addUsedColumns(columns, n.Grouping)
return true
case *plan.SubqueryAlias:
return false
}
exp, ok := n.(sql.Expressioner)
if ok {
addUsedColumns(columns, exp.Expressions())
}
return true
})
}
func pruneSubqueries(
ctx *sql.Context,
a *Analyzer,
n sql.Node,
parentColumns usedColumns,
) (sql.Node, error) {
return plan.TransformUp(n, func(n sql.Node) (sql.Node, error) {
subq, ok := n.(*plan.SubqueryAlias)
if !ok {
return n, nil
}
return pruneSubqueryColumns(ctx, a, subq, parentColumns)
})
}
func pruneUnusedColumns(n sql.Node, columns usedColumns) (sql.Node, error) {
return plan.TransformUp(n, func(n sql.Node) (sql.Node, error) {
switch n := n.(type) {
case *plan.Project:
return pruneProject(n, columns), nil
case *plan.GroupBy:
return pruneGroupBy(n, columns), nil
default:
return n, nil
}
})
}
func fixRemainingFieldsIndexes(n sql.Node) (sql.Node, error) {
return plan.TransformUp(n, func(n sql.Node) (sql.Node, error) {
switch n := n.(type) {
case *plan.SubqueryAlias:
child, err := fixRemainingFieldsIndexes(n.Child)
if err != nil {
return nil, err
}
return plan.NewSubqueryAlias(n.Name(), child), nil
default:
if _, ok := n.(sql.Expressioner); !ok {
return n, nil
}
var schema sql.Schema
for _, c := range n.Children() {
schema = append(schema, c.Schema()...)
}
if len(schema) == 0 {
return n, nil
}
indexes := make(map[tableCol]int)
for i, col := range schema {
indexes[tableCol{col.Source, col.Name}] = i
}
return plan.TransformExpressions(n, func(e sql.Expression) (sql.Expression, error) {
gf, ok := e.(*expression.GetField)
if !ok {
return e, nil
}
idx, ok := indexes[tableCol{gf.Table(), gf.Name()}]
if !ok {
return nil, ErrColumnTableNotFound.New(gf.Table(), gf.Name())
}
if idx == gf.Index() {
return gf, nil
}
ngf := *gf
return ngf.WithIndex(idx), nil
})
}
})
}
func addUsedProjectColumns(
columns usedColumns,
projection []sql.Expression,
) {
var candidates []sql.Expression
for _, e := range projection {
// Only check for expressions that are not directly a GetField. This
// is because in a projection we only care about those that were used
// to compute new columns, such as aliases and so on. The fields that
// are just passed up in the tree will already be in some other part
// if they are really used.
if _, ok := e.(*expression.GetField); !ok {
candidates = append(candidates, e)
}
}
addUsedColumns(columns, candidates)
}
func addUsedColumns(columns usedColumns, exprs []sql.Expression) {
for _, e := range exprs {
expression.Inspect(e, func(e sql.Expression) bool {
if gf, ok := e.(*expression.GetField); ok {
if _, ok := columns[gf.Table()]; !ok {
columns[gf.Table()] = make(map[string]struct{})
}
columns[gf.Table()][gf.Name()] = struct{}{}
}
return true
})
}
}
func pruneProject(n *plan.Project, columns usedColumns) sql.Node {
var remaining []sql.Expression
for _, e := range n.Projections {
if !shouldPruneExpr(e, columns) {
remaining = append(remaining, e)
}
}
if len(remaining) == 0 {
return n.Child
}
return plan.NewProject(remaining, n.Child)
}
func pruneGroupBy(n *plan.GroupBy, columns usedColumns) sql.Node {
var remaining []sql.Expression
for _, e := range n.Aggregate {
if !shouldPruneExpr(e, columns) {
remaining = append(remaining, e)
}
}
if len(remaining) == 0 {
return n.Child
}
return plan.NewGroupBy(remaining, n.Grouping, n.Child)
}
func shouldPruneExpr(e sql.Expression, cols usedColumns) bool {
gf, ok := e.(*expression.GetField)
if !ok {
return false
}
if gf.Table() == "" {
return false
}
if c, ok := cols[gf.Table()]; ok {
if _, ok := c[gf.Name()]; ok {
return false
}
}
return true
}