forked from pingcap/tidb
-
Notifications
You must be signed in to change notification settings - Fork 1
/
property_cols_prune.go
160 lines (145 loc) · 4.83 KB
/
property_cols_prune.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
// Copyright 2017 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 (
"github.com/pingcap/tidb/expression"
)
func (ds *DataSource) preparePossibleProperties() [][]*expression.Column {
indices := ds.availableIndices.indices
includeTS := ds.availableIndices.includeTableScan
result := make([][]*expression.Column, 0, len(indices))
ds.relevantIndices = make([]bool, len(indices))
if includeTS {
col := ds.getPKIsHandleCol()
if col != nil {
result = append(result, []*expression.Column{col})
}
cols := expression.ExtractColumnsFromExpressions(make([]*expression.Column, 0, 10), ds.pushedDownConds, nil)
colsSet := make(map[string]struct{}, len(cols))
for _, col := range cols {
colsSet[col.ColName.L] = struct{}{}
}
for i, idx := range indices {
_, ok := colsSet[idx.Columns[0].Name.L]
ds.relevantIndices[i] = ok
}
} else {
for i := range ds.relevantIndices {
ds.relevantIndices[i] = true
}
}
for _, idx := range indices {
cols, _ := expression.IndexInfo2Cols(ds.schema.Columns, idx)
if len(cols) > 0 {
result = append(result, cols)
}
}
return result
}
func (p *LogicalSelection) preparePossibleProperties() (result [][]*expression.Column) {
return p.children[0].preparePossibleProperties()
}
func (p *LogicalSort) preparePossibleProperties() [][]*expression.Column {
p.children[0].preparePossibleProperties()
propCols := getPossiblePropertyFromByItems(p.ByItems)
if len(propCols) == 0 {
return nil
}
return [][]*expression.Column{propCols}
}
func (p *LogicalTopN) preparePossibleProperties() [][]*expression.Column {
p.children[0].preparePossibleProperties()
propCols := getPossiblePropertyFromByItems(p.ByItems)
if len(propCols) == 0 {
return nil
}
return [][]*expression.Column{propCols}
}
func getPossiblePropertyFromByItems(items []*ByItems) []*expression.Column {
cols := make([]*expression.Column, 0, len(items))
for _, item := range items {
if col, ok := item.Expr.(*expression.Column); ok {
cols = append(cols, col)
} else {
break
}
}
return cols
}
func (p *baseLogicalPlan) preparePossibleProperties() [][]*expression.Column {
for _, ch := range p.children {
ch.preparePossibleProperties()
}
return nil
}
func (p *LogicalProjection) preparePossibleProperties() [][]*expression.Column {
childProperties := p.children[0].preparePossibleProperties()
oldCols := make([]*expression.Column, 0, p.schema.Len())
newCols := make([]*expression.Column, 0, p.schema.Len())
for i, expr := range p.Exprs {
if col, ok := expr.(*expression.Column); ok {
newCols = append(newCols, p.schema.Columns[i])
oldCols = append(oldCols, col)
}
}
tmpSchema := expression.NewSchema(oldCols...)
for i := len(childProperties) - 1; i >= 0; i-- {
for j, col := range childProperties[i] {
pos := tmpSchema.ColumnIndex(col)
if pos >= 0 {
childProperties[i][j] = newCols[pos]
} else {
childProperties[i] = childProperties[i][:j]
break
}
}
if len(childProperties[i]) == 0 {
childProperties = append(childProperties[:i], childProperties[i+1:]...)
}
}
return childProperties
}
func (p *LogicalJoin) preparePossibleProperties() [][]*expression.Column {
leftProperties := p.children[0].preparePossibleProperties()
rightProperties := p.children[1].preparePossibleProperties()
// TODO: We should consider properties propagation.
p.leftProperties = leftProperties
p.rightProperties = rightProperties
if p.JoinType == LeftOuterJoin || p.JoinType == LeftOuterSemiJoin {
rightProperties = nil
} else if p.JoinType == RightOuterJoin {
leftProperties = nil
}
resultProperties := make([][]*expression.Column, len(leftProperties)+len(rightProperties))
for i, cols := range leftProperties {
resultProperties[i] = make([]*expression.Column, len(cols))
copy(resultProperties[i], cols)
}
leftLen := len(leftProperties)
for i, cols := range rightProperties {
resultProperties[leftLen+i] = make([]*expression.Column, len(cols))
copy(resultProperties[leftLen+i], cols)
}
return resultProperties
}
func (la *LogicalAggregation) preparePossibleProperties() [][]*expression.Column {
childProps := la.children[0].preparePossibleProperties()
// If there's no group-by item, the stream aggregation could have no order property. So we can add an empty property
// when its group-by item is empty.
if len(la.GroupByItems) == 0 {
la.possibleProperties = [][]*expression.Column{nil}
} else {
la.possibleProperties = childProps
}
return nil
}