forked from pingcap/tidb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
optimizer.go
222 lines (202 loc) · 7.5 KB
/
optimizer.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
// Copyright 2015 PingCAP, 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,
// See the License for the specific language governing permissions and
// limitations under the License.
package plan
import (
"math"
"github.com/juju/errors"
"github.com/pingcap/tidb/ast"
"github.com/pingcap/tidb/expression"
"github.com/pingcap/tidb/infoschema"
"github.com/pingcap/tidb/mysql"
"github.com/pingcap/tidb/privilege"
"github.com/pingcap/tidb/sessionctx"
"github.com/pingcap/tidb/terror"
)
// AllowCartesianProduct means whether tidb allows cartesian join without equal conditions.
var AllowCartesianProduct = true
const (
flagPrunColumns uint64 = 1 << iota
flagEliminateProjection
flagBuildKeyInfo
flagDecorrelate
flagMaxMinEliminate
flagPredicatePushDown
flagAggregationOptimize
flagPushDownTopN
)
var optRuleList = []logicalOptRule{
&columnPruner{},
&projectionEliminater{},
&buildKeySolver{},
&decorrelateSolver{},
&maxMinEliminator{},
&ppdSolver{},
&aggregationOptimizer{},
&pushDownTopNOptimizer{},
}
// logicalOptRule means a logical optimizing rule, which contains decorrelate, ppd, column pruning, etc.
type logicalOptRule interface {
optimize(LogicalPlan) (LogicalPlan, error)
}
// Optimize does optimization and creates a Plan.
// The node must be prepared first.
func Optimize(ctx sessionctx.Context, node ast.Node, is infoschema.InfoSchema) (Plan, error) {
ctx.GetSessionVars().PlanID = 0
builder := &planBuilder{
ctx: ctx,
is: is,
colMapper: make(map[*ast.ColumnNameExpr]int),
}
p := builder.build(node)
if builder.err != nil {
return nil, errors.Trace(builder.err)
}
// Maybe it's better to move this to Preprocess, but check privilege need table
// information, which is collected into visitInfo during logical plan builder.
if pm := privilege.GetPrivilegeManager(ctx); pm != nil {
if !checkPrivilege(pm, builder.visitInfo) {
return nil, errors.New("privilege check fail")
}
}
if logic, ok := p.(LogicalPlan); ok {
return doOptimize(builder.optFlag, logic)
}
if execPlan, ok := p.(*Execute); ok {
err := execPlan.optimizePreparedPlan(ctx, is)
return p, errors.Trace(err)
}
return p, nil
}
// BuildLogicalPlan used to build logical plan from ast.Node.
func BuildLogicalPlan(ctx sessionctx.Context, node ast.Node, is infoschema.InfoSchema) (Plan, error) {
ctx.GetSessionVars().PlanID = 0
builder := &planBuilder{
ctx: ctx,
is: is,
colMapper: make(map[*ast.ColumnNameExpr]int),
}
p := builder.build(node)
if builder.err != nil {
return nil, errors.Trace(builder.err)
}
return p, nil
}
func checkPrivilege(pm privilege.Manager, vs []visitInfo) bool {
for _, v := range vs {
if !pm.RequestVerification(v.db, v.table, v.column, v.privilege) {
return false
}
}
return true
}
func doOptimize(flag uint64, logic LogicalPlan) (PhysicalPlan, error) {
logic, err := logicalOptimize(flag, logic)
if err != nil {
return nil, errors.Trace(err)
}
if !AllowCartesianProduct && existsCartesianProduct(logic) {
return nil, errors.Trace(ErrCartesianProductUnsupported)
}
physical, err := dagPhysicalOptimize(logic)
if err != nil {
return nil, errors.Trace(err)
}
finalPlan := eliminatePhysicalProjection(physical)
return finalPlan, nil
}
func logicalOptimize(flag uint64, logic LogicalPlan) (LogicalPlan, error) {
var err error
for i, rule := range optRuleList {
// The order of flags is same as the order of optRule in the list.
// We use a bitmask to record which opt rules should be used. If the i-th bit is 1, it means we should
// apply i-th optimizing rule.
if flag&(1<<uint(i)) == 0 {
continue
}
logic, err = rule.optimize(logic)
if err != nil {
return nil, errors.Trace(err)
}
}
return logic, errors.Trace(err)
}
func dagPhysicalOptimize(logic LogicalPlan) (PhysicalPlan, error) {
logic.preparePossibleProperties()
logic.deriveStats()
t, err := logic.convert2PhysicalPlan(&requiredProp{taskTp: rootTaskType, expectedCnt: math.MaxFloat64})
if err != nil {
return nil, errors.Trace(err)
}
p := t.plan()
p.ResolveIndices()
return p, nil
}
func existsCartesianProduct(p LogicalPlan) bool {
if join, ok := p.(*LogicalJoin); ok && len(join.EqualConditions) == 0 {
return join.JoinType == InnerJoin || join.JoinType == LeftOuterJoin || join.JoinType == RightOuterJoin
}
for _, child := range p.Children() {
if existsCartesianProduct(child) {
return true
}
}
return false
}
// Optimizer error codes.
const (
CodeOperandColumns terror.ErrCode = 1
CodeInvalidWildCard = 3
CodeUnsupported = 4
CodeStmtNotFound = 7
CodeWrongParamCount = 8
CodeSchemaChanged = 9
// MySQL error code.
CodeInvalidGroupFuncUse = mysql.ErrInvalidGroupFuncUse
CodeIllegalReference = mysql.ErrIllegalReference
CodeNoDB = mysql.ErrNoDB
CodeUnknownExplainFormat = mysql.ErrUnknownExplainFormat
CodeWrongGroupField = mysql.ErrWrongGroupField
CodeDupFieldName = mysql.ErrDupFieldName
CodeNonUpdatableTable = mysql.ErrNonUpdatableTable
)
// Optimizer base errors.
var (
ErrOperandColumns = terror.ClassOptimizer.New(CodeOperandColumns, "Operand should contain %d column(s)")
ErrInvalidWildCard = terror.ClassOptimizer.New(CodeInvalidWildCard, "Wildcard fields without any table name appears in wrong place")
ErrCartesianProductUnsupported = terror.ClassOptimizer.New(CodeUnsupported, "Cartesian product is unsupported")
ErrInvalidGroupFuncUse = terror.ClassOptimizer.New(CodeInvalidGroupFuncUse, "Invalid use of group function")
ErrIllegalReference = terror.ClassOptimizer.New(CodeIllegalReference, mysql.MySQLErrName[mysql.ErrIllegalReference])
ErrNoDB = terror.ClassOptimizer.New(CodeNoDB, "No database selected")
ErrUnknownExplainFormat = terror.ClassOptimizer.New(CodeUnknownExplainFormat, mysql.MySQLErrName[mysql.ErrUnknownExplainFormat])
ErrStmtNotFound = terror.ClassOptimizer.New(CodeStmtNotFound, "Prepared statement not found")
ErrWrongParamCount = terror.ClassOptimizer.New(CodeWrongParamCount, "Wrong parameter count")
ErrSchemaChanged = terror.ClassOptimizer.New(CodeSchemaChanged, "Schema has changed")
ErrWrongGroupField = terror.ClassOptimizer.New(CodeWrongGroupField, mysql.MySQLErrName[mysql.ErrWrongGroupField])
ErrDupFieldName = terror.ClassOptimizer.New(CodeDupFieldName, mysql.MySQLErrName[mysql.ErrDupFieldName])
ErrNonUpdatableTable = terror.ClassOptimizer.New(CodeNonUpdatableTable, mysql.MySQLErrName[mysql.ErrNonUpdatableTable])
)
func init() {
mySQLErrCodes := map[terror.ErrCode]uint16{
CodeOperandColumns: mysql.ErrOperandColumns,
CodeInvalidWildCard: mysql.ErrParse,
CodeInvalidGroupFuncUse: mysql.ErrInvalidGroupFuncUse,
CodeIllegalReference: mysql.ErrIllegalReference,
CodeNoDB: mysql.ErrNoDB,
CodeUnknownExplainFormat: mysql.ErrUnknownExplainFormat,
CodeWrongGroupField: mysql.ErrWrongGroupField,
CodeDupFieldName: mysql.ErrDupFieldName,
CodeNonUpdatableTable: mysql.ErrUnknownTable,
}
terror.ErrClassToMySQLCodes[terror.ClassOptimizer] = mySQLErrCodes
expression.EvalAstExpr = evalAstExpr
}