/
expr.go
262 lines (232 loc) · 6.8 KB
/
expr.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
// Copyright 2020-2021 Dolthub, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package transform
import (
"errors"
"fmt"
"github.com/dolthub/go-mysql-server/sql"
"github.com/dolthub/go-mysql-server/sql/expression"
)
// Expr applies a transformation function to the given expression
// tree from the bottom up. Each callback [f] returns a TreeIdentity
// that is aggregated into a final output indicating whether the
// expression tree was changed.
func Expr(e sql.Expression, f ExprFunc) (sql.Expression, TreeIdentity, error) {
children := e.Children()
if len(children) == 0 {
return f(e)
}
var (
newChildren []sql.Expression
err error
)
for i := 0; i < len(children); i++ {
c := children[i]
c, same, err := Expr(c, f)
if err != nil {
return nil, SameTree, err
}
if !same {
if newChildren == nil {
newChildren = make([]sql.Expression, len(children))
copy(newChildren, children)
}
newChildren[i] = c
}
}
sameC := SameTree
if len(newChildren) > 0 {
sameC = NewTree
e, err = e.WithChildren(newChildren...)
if err != nil {
return nil, SameTree, err
}
}
e, sameN, err := f(e)
if err != nil {
return nil, SameTree, err
}
return e, sameC && sameN, nil
}
// Exprs applies a transformation function to the given set of expressions and returns the result.
func Exprs(e []sql.Expression, f ExprFunc) ([]sql.Expression, TreeIdentity, error) {
var (
newExprs []sql.Expression
)
for i := 0; i < len(e); i++ {
c := e[i]
c, same, err := Expr(c, f)
if err != nil {
return nil, SameTree, err
}
if !same {
if newExprs == nil {
newExprs = make([]sql.Expression, len(e))
copy(newExprs, e)
}
newExprs[i] = c
}
}
if len(newExprs) == 0 {
return e, SameTree, nil
}
return newExprs, NewTree, nil
}
var stopInspect = errors.New("stop")
// InspectExpr traverses the given expression tree from the bottom up, breaking if
// stop = true. Returns a bool indicating whether traversal was interrupted.
func InspectExpr(node sql.Expression, f func(sql.Expression) bool) bool {
_, _, err := Expr(node, func(e sql.Expression) (sql.Expression, TreeIdentity, error) {
ok := f(e)
if ok {
return nil, SameTree, stopInspect
}
return e, SameTree, nil
})
return errors.Is(err, stopInspect)
}
// InspectUp traverses the given node tree from the bottom up, breaking if
// stop = true. Returns a bool indicating whether traversal was interrupted.
func InspectUp(node sql.Node, f func(sql.Node) bool) bool {
stop := errors.New("stop")
_, _, err := Node(node, func(e sql.Node) (sql.Node, TreeIdentity, error) {
ok := f(e)
if ok {
return nil, SameTree, stop
}
return e, SameTree, nil
})
return errors.Is(err, stop)
}
// Clone duplicates an existing sql.Expression, returning new nodes with the
// same structure and internal values. It can be useful when dealing with
// stateful expression nodes where an evaluation needs to create multiple
// independent histories of the internal state of the expression nodes.
func Clone(expr sql.Expression) (sql.Expression, error) {
expr, _, err := Expr(expr, func(e sql.Expression) (sql.Expression, TreeIdentity, error) {
return e, NewTree, nil
})
return expr, err
}
// ExprWithNode applies a transformation function to the given expression from the bottom up.
func ExprWithNode(n sql.Node, e sql.Expression, f ExprWithNodeFunc) (sql.Expression, TreeIdentity, error) {
children := e.Children()
if len(children) == 0 {
return f(n, e)
}
var (
newChildren []sql.Expression
err error
)
for i := 0; i < len(children); i++ {
c := children[i]
c, sameC, err := ExprWithNode(n, c, f)
if err != nil {
return nil, SameTree, err
}
if !sameC {
if newChildren == nil {
newChildren = make([]sql.Expression, len(children))
copy(newChildren, children)
}
newChildren[i] = c
}
}
sameC := SameTree
if len(newChildren) > 0 {
sameC = NewTree
e, err = e.WithChildren(newChildren...)
if err != nil {
return nil, SameTree, err
}
}
e, sameN, err := f(n, e)
if err != nil {
return nil, SameTree, err
}
return e, sameC && sameN, nil
}
// ExpressionToColumn converts the expression to the form that should be used in a Schema. Expressions that have Name()
// and Table() methods will use these; otherwise, String() and "" are used, respectively. The type and nullability are
// taken from the expression directly.
func ExpressionToColumn(e sql.Expression, name string) *sql.Column {
if n, ok := e.(sql.Nameable); ok {
name = n.Name()
}
var table string
if t, ok := e.(sql.Tableable); ok {
table = t.Table()
}
var db string
if t, ok := e.(sql.Databaseable); ok {
db = t.Database()
}
// TODO: Is this still necessary?
if e.Resolved() {
return &sql.Column{
Name: name,
Source: table,
DatabaseSource: db,
Type: e.Type(),
Nullable: e.IsNullable(),
}
} else {
return &sql.Column{
Name: name,
Source: table,
DatabaseSource: db,
}
}
}
// SchemaWithDefaults returns a copy of the schema given with the defaults provided. Default expressions must be
// wrapped with expression.Wrapper.
func SchemaWithDefaults(schema sql.Schema, defaultExprs []sql.Expression) (sql.Schema, error) {
if len(schema) != len(defaultExprs) {
return nil, fmt.Errorf("expected %d default expressions, got %d", len(schema), len(defaultExprs))
}
sch := schema.Copy()
for i, col := range sch {
wrapper, ok := defaultExprs[i].(*expression.Wrapper)
if !ok {
return nil, fmt.Errorf("expected expression.Wrapper, got %T", defaultExprs[i])
}
wrappedExpr := wrapper.Unwrap()
if wrappedExpr == nil {
continue
}
defaultExpr, ok := wrappedExpr.(*sql.ColumnDefaultValue)
if !ok {
return nil, fmt.Errorf("expected *sql.ColumnDefaultValue, got %T", wrappedExpr)
}
if col.Default != nil {
col.Default = defaultExpr
} else {
col.Generated = defaultExpr
}
}
return sch, nil
}
// WrappedColumnDefaults returns the column defaults / generated expressions for the schema given,
// wrapped with expression.Wrapper
func WrappedColumnDefaults(schema sql.Schema) []sql.Expression {
defs := make([]sql.Expression, len(schema))
for i, col := range schema {
defaultVal := col.Default
if defaultVal == nil && col.Generated != nil {
defaultVal = col.Generated
}
defs[i] = expression.WrapExpression(defaultVal)
}
return defs
}