forked from dolthub/go-mysql-server
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tables.go
261 lines (237 loc) · 6.73 KB
/
tables.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
// 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 analyzer
import (
"github.com/gabereiser/go-mysql-server/sql"
"github.com/gabereiser/go-mysql-server/sql/expression"
"github.com/gabereiser/go-mysql-server/sql/plan"
"github.com/gabereiser/go-mysql-server/sql/transform"
)
// Returns the underlying table name for the node given
func getTableName(node sql.Node) string {
var tableName string
transform.Inspect(node, func(node sql.Node) bool {
switch node := node.(type) {
case *plan.TableAlias:
tableName = node.Name()
return false
case *plan.ResolvedTable:
tableName = node.Name()
return false
case *plan.UnresolvedTable:
tableName = node.Name()
return false
case *plan.IndexedTableAccess:
tableName = node.Name()
return false
}
return true
})
return tableName
}
// Returns the underlying table name for the node given, ignoring table aliases
func getUnaliasedTableName(node sql.Node) string {
var tableName string
transform.Inspect(node, func(node sql.Node) bool {
switch node := node.(type) {
case *plan.ResolvedTable:
tableName = node.Name()
return false
case *plan.UnresolvedTable:
tableName = node.Name()
return false
case *plan.IndexedTableAccess:
tableName = node.Name()
return false
}
return true
})
return tableName
}
// Finds first table node that is a descendant of the node given
func getTable(node sql.Node) sql.Table {
var table sql.Table
transform.Inspect(node, func(node sql.Node) bool {
if table != nil {
return false
}
switch n := node.(type) {
case *plan.ResolvedTable:
table = n.Table
// TODO unwinding a table wrapper here causes infinite analyzer recursion
return false
case *plan.IndexedTableAccess:
table = n.ResolvedTable.Table
return false
}
return true
})
return table
}
// Finds first unresolved table node that is a descendant of the node given
func hasTable(name string, node sql.Node) bool {
var found bool
transform.Inspect(node, func(node sql.Node) bool {
switch n := node.(type) {
case *plan.UnresolvedTable:
found = found ||
name == n.Name()
case *plan.TableAlias:
switch n := n.Child.(type) {
case *plan.UnresolvedTable:
found = found || name == n.Name()
}
default:
}
return !found
})
return found
}
// getResolvedTableAndAlias returns the first resolved table in the specified node tree, along with its aliased name,
// or the empty string if no table alias has been specified.
func getResolvedTableAndAlias(node sql.Node) (*plan.ResolvedTable, string) {
var table *plan.ResolvedTable
var alias string
transform.Inspect(node, func(node sql.Node) bool {
// plan.Inspect will get called on all children of a node even if one of the children's calls returns false. We
// only want the first ResolvedTable match.
if table != nil {
return false
}
switch n := node.(type) {
case *plan.TableAlias:
table = getResolvedTable(n)
alias = n.Name()
return false
case *plan.ResolvedTable:
table = n
return false
case *plan.IndexedTableAccess:
table = n.ResolvedTable
return false
}
return true
})
return table, alias
}
// Finds first ResolvedTable node that is a descendant of the node given
func getResolvedTable(node sql.Node) *plan.ResolvedTable {
var table *plan.ResolvedTable
transform.Inspect(node, func(node sql.Node) bool {
// plan.Inspect will get called on all children of a node even if one of the children's calls returns false. We
// only want the first ResolvedTable match.
if table != nil {
return false
}
switch n := node.(type) {
case *plan.ResolvedTable:
if !plan.IsDualTable(n) {
table = n
return false
}
case *plan.IndexedTableAccess:
table = n.ResolvedTable
return false
}
return true
})
return table
}
// getTablesByName takes a node and returns all found resolved tables in a map.
func getTablesByName(node sql.Node) map[string]*plan.ResolvedTable {
ret := make(map[string]*plan.ResolvedTable)
transform.Inspect(node, func(node sql.Node) bool {
switch n := node.(type) {
case *plan.ResolvedTable:
ret[n.Table.Name()] = n
case *plan.IndexedTableAccess:
ret[n.ResolvedTable.Name()] = n.ResolvedTable
case *plan.TableAlias:
rt := getResolvedTable(n)
if rt != nil {
ret[n.Name()] = rt
}
default:
}
return true
})
return ret
}
// Returns the tables used in the expressions given
func findTables(exprs ...sql.Expression) []string {
tables := make(map[string]bool)
for _, e := range exprs {
sql.Inspect(e, func(e sql.Expression) bool {
switch e := e.(type) {
case *expression.GetField:
tables[e.Table()] = true
return false
default:
return true
}
})
}
var names []string
for table := range tables {
names = append(names, table)
}
return names
}
// Returns a hashmap of tableCol used in the expressions given
func findCols(exprs ...sql.Expression) []tableCol {
columns := make([]tableCol, 0)
for _, e := range exprs {
sql.Inspect(e, func(e sql.Expression) bool {
switch e := e.(type) {
case *expression.GetField:
columns = append(columns, tableCol{table: e.Table(), col: e.Name()})
return false
default:
return true
}
})
}
return columns
}
// Transforms the node given bottom up by setting resolve tables to reference the table given. Returns an error if more
// than one table was set in this way.
func withTable(node sql.Node, table sql.Table) (sql.Node, transform.TreeIdentity, error) {
foundTable := false
return transform.Node(node, func(n sql.Node) (sql.Node, transform.TreeIdentity, error) {
switch n := n.(type) {
case *plan.ResolvedTable:
if foundTable {
return nil, transform.SameTree, ErrInAnalysis.New("attempted to set more than one table in withTable()")
}
foundTable = true
n, err := n.WithTable(table)
if err != nil {
return nil, transform.SameTree, err
}
return n, transform.NewTree, nil
case *plan.IndexedTableAccess:
if foundTable {
return nil, transform.SameTree, ErrInAnalysis.New("attempted to set more than one table in withTable()")
}
foundTable = true
ita, err := n.WithTable(table)
if err != nil {
return nil, transform.SameTree, err
}
return ita, transform.NewTree, nil
default:
return n, transform.SameTree, nil
}
})
}