/
procedure_resolved_table.go
147 lines (128 loc) · 5.1 KB
/
procedure_resolved_table.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
// Copyright 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 plan
import (
"github.com/Ciyfly/FakerMysql/sql"
)
// ProcedureResolvedTable represents a resolved SQL Table inside of a stored procedure. These are initially resolved to
// verify that they exist, and are then reloaded when another statement accesses its data. Some integrators return a
// snapshot of a table during the analysis step as an internal optimization, which is incompatible with stored
// procedures as they require the latest data at each statement.
type ProcedureResolvedTable struct {
ResolvedTable *ResolvedTable
}
var _ sql.Node = (*ProcedureResolvedTable)(nil)
var _ sql.DebugStringer = (*ProcedureResolvedTable)(nil)
var _ sql.TableWrapper = (*ProcedureResolvedTable)(nil)
var _ sql.Table = (*ProcedureResolvedTable)(nil)
// NewProcedureResolvedTable returns a *ProcedureResolvedTable.
func NewProcedureResolvedTable(rt *ResolvedTable) *ProcedureResolvedTable {
return &ProcedureResolvedTable{rt}
}
// Resolved implements the sql.Node interface.
func (t *ProcedureResolvedTable) Resolved() bool {
return t.ResolvedTable.Resolved()
}
// String implements the sql.Node interface.
func (t *ProcedureResolvedTable) String() string {
return t.ResolvedTable.String()
}
// Schema implements the sql.Node interface.
func (t *ProcedureResolvedTable) Schema() sql.Schema {
return t.ResolvedTable.Schema()
}
// DebugString implements the sql.DebugStringer interface.
func (t *ProcedureResolvedTable) DebugString() string {
return sql.DebugString(t.ResolvedTable)
}
// Children implements the sql.Node interface.
func (t *ProcedureResolvedTable) Children() []sql.Node {
return []sql.Node{t.ResolvedTable}
}
// RowIter implements the sql.Node interface.
func (t *ProcedureResolvedTable) RowIter(ctx *sql.Context, row sql.Row) (sql.RowIter, error) {
rt, err := t.newestTable(ctx)
if err != nil {
return nil, err
}
return rt.RowIter(ctx, row)
}
// WithChildren implements the sql.Node interface.
func (t *ProcedureResolvedTable) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) != 1 {
return nil, sql.ErrInvalidChildrenNumber.New(t, len(children), 1)
}
// Even though we return the *ResolvedTable in Children, we cannot assume that the given child is still
// *ResolvedTable. In the analyzer, there are instances where the table is buried under other nodes such as
// tracking nodes, so we must walk the tree and find the table.
return TransformUp(children[0], func(n sql.Node) (sql.Node, error) {
rt, ok := children[0].(*ResolvedTable)
if !ok {
return n, nil
}
return NewProcedureResolvedTable(rt), nil
})
}
// Underlying implements the sql.TableWrapper interface.
func (t *ProcedureResolvedTable) Underlying() sql.Table {
return t.ResolvedTable.Table
}
// Name implements the sql.Table interface.
func (t *ProcedureResolvedTable) Name() string {
return t.ResolvedTable.Name()
}
// Partitions implements the sql.Table interface.
func (t *ProcedureResolvedTable) Partitions(ctx *sql.Context) (sql.PartitionIter, error) {
rt, err := t.newestTable(ctx)
if err != nil {
return nil, err
}
return rt.Partitions(ctx)
}
// PartitionRows implements the sql.Table interface.
func (t *ProcedureResolvedTable) PartitionRows(ctx *sql.Context, partition sql.Partition) (sql.RowIter, error) {
rt, err := t.newestTable(ctx)
if err != nil {
return nil, err
}
return rt.PartitionRows(ctx, partition)
}
// newestTable fetches the newest copy of the contained table from the database.
func (t *ProcedureResolvedTable) newestTable(ctx *sql.Context) (*ResolvedTable, error) {
// If no database was given, such as with the "dual" table, then we return the given table as-is.
if t.ResolvedTable.Database == nil {
return t.ResolvedTable, nil
}
if t.ResolvedTable.AsOf == nil {
tbl, ok, err := t.ResolvedTable.Database.GetTableInsensitive(ctx, t.ResolvedTable.Table.Name())
if err != nil {
return nil, err
} else if !ok {
return nil, sql.ErrTableNotFound.New(t.ResolvedTable.Table.Name())
}
return t.ResolvedTable.WithTable(tbl)
} else {
versionedDb, ok := t.ResolvedTable.Database.(sql.VersionedDatabase)
if !ok {
return nil, sql.ErrAsOfNotSupported.New(t.ResolvedTable.Database.Name())
}
tbl, ok, err := versionedDb.GetTableInsensitiveAsOf(ctx, t.ResolvedTable.Table.Name(), t.ResolvedTable.AsOf)
if err != nil {
return nil, err
} else if !ok {
return nil, sql.ErrTableNotFound.New(t.ResolvedTable.Table.Name())
}
return t.ResolvedTable.WithTable(tbl)
}
}