forked from pingcap/tidb
-
Notifications
You must be signed in to change notification settings - Fork 1
/
property_cols_prune.go
83 lines (76 loc) · 2.6 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
// 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() (result [][]*expression.Column) {
indices := ds.availableIndices.indices
includeTS := ds.availableIndices.includeTableScan
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)
for i, idx := range indices {
for _, col := range cols {
if col.ColName.L == idx.Columns[0].Name.L {
ds.relevantIndices[i] = true
break
}
}
}
} 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
}
func (p *LogicalSelection) preparePossibleProperties() (result [][]*expression.Column) {
return p.children[0].preparePossibleProperties()
}
func (p *baseLogicalPlan) preparePossibleProperties() [][]*expression.Column {
for _, ch := range p.children {
ch.preparePossibleProperties()
}
return nil
}
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(leftProperties)+len(rightProperties))
copy(resultProperties, leftProperties)
resultProperties = append(resultProperties, rightProperties...)
return resultProperties
}
func (la *LogicalAggregation) preparePossibleProperties() [][]*expression.Column {
la.possibleProperties = la.children[0].preparePossibleProperties()
return nil
}