FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
sqlparser/dependency/sqltypes/plan_value.go at master · dbmirror/sqlparser · GitHub
dbmirror
/
sqlparser
Public
forked from
xwb1989/sqlparser
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
sqlparser
/
dependency
/
sqltypes
/
plan_value.go
Copy path
More file actions
More file actions
Latest commit
History
History
History
259 lines (239 loc) · 7.14 KB
Breadcrumbs
sqlparser
/
dependency
/
sqltypes
/
plan_value.go
Copy path
File metadata and controls
259 lines (239 loc) · 7.14 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*
Copyright 2017 Google 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
sqltypes
import
(
"encoding/json"
"errors"
"fmt"
"github.com/xwb1989/sqlparser/dependency/querypb"
)
// PlanValue represents a value or a list of values for
// a column that will later be resolved using bind vars and used
// to perform plan actions like generating the final query or
// deciding on a route.
//
// Plan values are typically used as a slice ([]planValue)
// where each entry is for one column. For situations where
// the required output is a list of rows (like in the case
// of multi-value inserts), the representation is pivoted.
// For example, a statement like this:
// INSERT INTO t VALUES (1, 2), (3, 4)
// will be represented as follows:
// []PlanValue{
// Values: {1, 3},
// Values: {2, 4},
// }
//
// For WHERE clause items that contain a combination of
// equality expressions and IN clauses like this:
// WHERE pk1 = 1 AND pk2 IN (2, 3, 4)
// The plan values will be represented as follows:
// []PlanValue{
// Value: 1,
// Values: {2, 3, 4},
// }
// When converted into rows, columns with single values
// are replicated as the same for all rows:
// [][]Value{
// {1, 2},
// {1, 3},
// {1, 4},
// }
type
PlanValue
struct
{
Key
string
Value
Value
ListKey
string
Values
[]
PlanValue
}
// IsNull returns true if the PlanValue is NULL.
func
(
pv
PlanValue
)
IsNull
()
bool
{
return
pv
.
Key
==
""
&&
pv
.
Value
.
IsNull
()
&&
pv
.
ListKey
==
""
&&
pv
.
Values
==
nil
}
// IsList returns true if the PlanValue is a list.
func
(
pv
PlanValue
)
IsList
()
bool
{
return
pv
.
ListKey
!=
""
||
pv
.
Values
!=
nil
}
// ResolveValue resolves a PlanValue as a single value based on the supplied bindvars.
func
(
pv
PlanValue
)
ResolveValue
(
bindVars
map
[
string
]
*
querypb.
BindVariable
) (
Value
,
error
) {
switch
{
case
pv
.
Key
!=
""
:
bv
,
err
:=
pv
.
lookupValue
(
bindVars
)
if
err
!=
nil
{
return
NULL
,
err
}
return
MakeTrusted
(
bv
.
Type
,
bv
.
Value
),
nil
case
!
pv
.
Value
.
IsNull
():
return
pv
.
Value
,
nil
case
pv
.
ListKey
!=
""
||
pv
.
Values
!=
nil
:
// This code is unreachable because the parser does not allow
// multi-value constructs where a single value is expected.
return
NULL
,
errors
.
New
(
"a list was supplied where a single value was expected"
)
}
return
NULL
,
nil
}
func
(
pv
PlanValue
)
lookupValue
(
bindVars
map
[
string
]
*
querypb.
BindVariable
) (
*
querypb.
BindVariable
,
error
) {
bv
,
ok
:=
bindVars
[
pv
.
Key
]
if
!
ok
{
return
nil
,
fmt
.
Errorf
(
"missing bind var %s"
,
pv
.
Key
)
}
if
bv
.
Type
==
querypb
.
Type_TUPLE
{
return
nil
,
fmt
.
Errorf
(
"TUPLE was supplied for single value bind var %s"
,
pv
.
ListKey
)
}
return
bv
,
nil
}
// ResolveList resolves a PlanValue as a list of values based on the supplied bindvars.
func
(
pv
PlanValue
)
ResolveList
(
bindVars
map
[
string
]
*
querypb.
BindVariable
) ([]
Value
,
error
) {
switch
{
case
pv
.
ListKey
!=
""
:
bv
,
err
:=
pv
.
lookupList
(
bindVars
)
if
err
!=
nil
{
return
nil
,
err
}
values
:=
make
([]
Value
,
0
,
len
(
bv
.
Values
))
for
_
,
val
:=
range
bv
.
Values
{
values
=
append
(
values
,
MakeTrusted
(
val
.
Type
,
val
.
Value
))
}
return
values
,
nil
case
pv
.
Values
!=
nil
:
values
:=
make
([]
Value
,
0
,
len
(
pv
.
Values
))
for
_
,
val
:=
range
pv
.
Values
{
v
,
err
:=
val
.
ResolveValue
(
bindVars
)
if
err
!=
nil
{
return
nil
,
err
}
values
=
append
(
values
,
v
)
}
return
values
,
nil
}
// This code is unreachable because the parser does not allow
// single value constructs where multiple values are expected.
return
nil
,
errors
.
New
(
"a single value was supplied where a list was expected"
)
}
func
(
pv
PlanValue
)
lookupList
(
bindVars
map
[
string
]
*
querypb.
BindVariable
) (
*
querypb.
BindVariable
,
error
) {
bv
,
ok
:=
bindVars
[
pv
.
ListKey
]
if
!
ok
{
return
nil
,
fmt
.
Errorf
(
"missing bind var %s"
,
pv
.
ListKey
)
}
if
bv
.
Type
!=
querypb
.
Type_TUPLE
{
return
nil
,
fmt
.
Errorf
(
"single value was supplied for TUPLE bind var %s"
,
pv
.
ListKey
)
}
return
bv
,
nil
}
// MarshalJSON should be used only for testing.
func
(
pv
PlanValue
)
MarshalJSON
() ([]
byte
,
error
) {
switch
{
case
pv
.
Key
!=
""
:
return
json
.
Marshal
(
":"
+
pv
.
Key
)
case
!
pv
.
Value
.
IsNull
():
if
pv
.
Value
.
IsIntegral
() {
return
pv
.
Value
.
ToBytes
(),
nil
}
return
json
.
Marshal
(
pv
.
Value
.
ToString
())
case
pv
.
ListKey
!=
""
:
return
json
.
Marshal
(
"::"
+
pv
.
ListKey
)
case
pv
.
Values
!=
nil
:
return
json
.
Marshal
(
pv
.
Values
)
}
return
[]
byte
(
"null"
),
nil
}
func
rowCount
(
pvs
[]
PlanValue
,
bindVars
map
[
string
]
*
querypb.
BindVariable
) (
int
,
error
) {
count
:=
-
1
setCount
:=
func
(
l
int
)
error
{
switch
count
{
case
-
1
:
count
=
l
return
nil
case
l
:
return
nil
default
:
return
errors
.
New
(
"mismatch in number of column values"
)
}
}
for
_
,
pv
:=
range
pvs
{
switch
{
case
pv
.
Key
!=
""
||
!
pv
.
Value
.
IsNull
():
continue
case
pv
.
Values
!=
nil
:
if
err
:=
setCount
(
len
(
pv
.
Values
));
err
!=
nil
{
return
0
,
err
}
case
pv
.
ListKey
!=
""
:
bv
,
err
:=
pv
.
lookupList
(
bindVars
)
if
err
!=
nil
{
return
0
,
err
}
if
err
:=
setCount
(
len
(
bv
.
Values
));
err
!=
nil
{
return
0
,
err
}
}
}
if
count
==
-
1
{
// If there were no lists inside, it was a single row.
// Note that count can never be 0 because there is enough
// protection at the top level: list bind vars must have
// at least one value (enforced by vtgate), and AST lists
// must have at least one value (enforced by the parser).
// Also lists created internally after vtgate validation
// ensure at least one value.
// TODO(sougou): verify and change API to enforce this.
return
1
,
nil
}
return
count
,
nil
}
// ResolveRows resolves a []PlanValue as rows based on the supplied bindvars.
func
ResolveRows
(
pvs
[]
PlanValue
,
bindVars
map
[
string
]
*
querypb.
BindVariable
) ([][]
Value
,
error
) {
count
,
err
:=
rowCount
(
pvs
,
bindVars
)
if
err
!=
nil
{
return
nil
,
err
}
// Allocate the rows.
rows
:=
make
([][]
Value
,
count
)
for
i
:=
range
rows
{
rows
[
i
]
=
make
([]
Value
,
len
(
pvs
))
}
// Using j becasue we're resolving by columns.
for
j
,
pv
:=
range
pvs
{
switch
{
case
pv
.
Key
!=
""
:
bv
,
err
:=
pv
.
lookupValue
(
bindVars
)
if
err
!=
nil
{
return
nil
,
err
}
for
i
:=
range
rows
{
rows
[
i
][
j
]
=
MakeTrusted
(
bv
.
Type
,
bv
.
Value
)
}
case
!
pv
.
Value
.
IsNull
():
for
i
:=
range
rows
{
rows
[
i
][
j
]
=
pv
.
Value
}
case
pv
.
ListKey
!=
""
:
bv
,
err
:=
pv
.
lookupList
(
bindVars
)
if
err
!=
nil
{
// This code is unreachable because pvRowCount already checks this.
return
nil
,
err
}
for
i
:=
range
rows
{
rows
[
i
][
j
]
=
MakeTrusted
(
bv
.
Values
[
i
].
Type
,
bv
.
Values
[
i
].
Value
)
}
case
pv
.
Values
!=
nil
:
for
i
:=
range
rows
{
rows
[
i
][
j
],
err
=
pv
.
Values
[
i
].
ResolveValue
(
bindVars
)
if
err
!=
nil
{
return
nil
,
err
}
}
// default case is a NULL value, which the row values are already initialized to.
}
}
return
rows
,
nil
}
Back
|
FazBrowse Home
|
New Git URL