tidb util 源码
tidb util 代码
文件路径：/planner/core/util.go
// 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,
// 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 core
import (
"fmt"
"strings"
"github.com/pingcap/tidb/expression"
"github.com/pingcap/tidb/parser/ast"
"github.com/pingcap/tidb/parser/model"
"github.com/pingcap/tidb/sessionctx"
"github.com/pingcap/tidb/types"
"github.com/pingcap/tidb/util/ranger"
"github.com/pingcap/tidb/util/set"
"github.com/pingcap/tidb/util/size"
"golang.org/x/exp/slices"
)
// AggregateFuncExtractor visits Expr tree.
// It collects AggregateFuncExpr from AST Node.
type AggregateFuncExtractor struct {
// skipAggMap stores correlated aggregate functions which have been built in outer query,
// so extractor in sub-query will skip these aggregate functions.
skipAggMap map[*ast.AggregateFuncExpr]*expression.CorrelatedColumn
// AggFuncs is the collected AggregateFuncExprs.
AggFuncs []*ast.AggregateFuncExpr
}
// Enter implements Visitor interface.
func (a *AggregateFuncExtractor) Enter(n ast.Node) (ast.Node, bool) {
switch n.(type) {
case *ast.SelectStmt, *ast.SetOprStmt:
return n, true
}
return n, false
}
// Leave implements Visitor interface.
func (a *AggregateFuncExtractor) Leave(n ast.Node) (ast.Node, bool) {
switch v := n.(type) {
case *ast.AggregateFuncExpr:
if _, ok := a.skipAggMap[v]; !ok {
a.AggFuncs = append(a.AggFuncs, v)
}
}
return n, true
}
// WindowFuncExtractor visits Expr tree.
// It converts ColunmNameExpr to WindowFuncExpr and collects WindowFuncExpr.
type WindowFuncExtractor struct {
// WindowFuncs is the collected WindowFuncExprs.
windowFuncs []*ast.WindowFuncExpr
}
// Enter implements Visitor interface.
func (a *WindowFuncExtractor) Enter(n ast.Node) (ast.Node, bool) {
switch n.(type) {
case *ast.SelectStmt, *ast.SetOprStmt:
return n, true
}
return n, false
}
// Leave implements Visitor interface.
func (a *WindowFuncExtractor) Leave(n ast.Node) (ast.Node, bool) {
switch v := n.(type) {
case *ast.WindowFuncExpr:
a.windowFuncs = append(a.windowFuncs, v)
}
return n, true
}
// logicalSchemaProducer stores the schema for the logical plans who can produce schema directly.
type logicalSchemaProducer struct {
schema *expression.Schema
names types.NameSlice
baseLogicalPlan
}
// Schema implements the Plan.Schema interface.
func (s *logicalSchemaProducer) Schema() *expression.Schema {
if s.schema == nil {
if len(s.Children()) == 1 {
// default implementation for plans has only one child: proprgate child schema.
// multi-children plans are likely to have particular implementation.
s.schema = s.Children()[0].Schema().Clone()
} else {
s.schema = expression.NewSchema()
}
}
return s.schema
}
func (s *logicalSchemaProducer) OutputNames() types.NameSlice {
if s.names == nil && len(s.Children()) == 1 {
// default implementation for plans has only one child: proprgate child `OutputNames`.
// multi-children plans are likely to have particular implementation.
s.names = s.Children()[0].OutputNames()
}
return s.names
}
func (s *logicalSchemaProducer) SetOutputNames(names types.NameSlice) {
s.names = names
}
// SetSchema implements the Plan.SetSchema interface.
func (s *logicalSchemaProducer) SetSchema(schema *expression.Schema) {
s.schema = schema
}
func (s *logicalSchemaProducer) setSchemaAndNames(schema *expression.Schema, names types.NameSlice) {
s.schema = schema
s.names = names
}
// inlineProjection prunes unneeded columns inline a executor.
func (s *logicalSchemaProducer) inlineProjection(parentUsedCols []*expression.Column, opt *logicalOptimizeOp) {
prunedColumns := make([]*expression.Column, 0)
used := expression.GetUsedList(parentUsedCols, s.Schema())
for i := len(used) - 1; i >= 0; i-- {
if !used[i] {
prunedColumns = append(prunedColumns, s.Schema().Columns[i])
s.schema.Columns = append(s.Schema().Columns[:i], s.Schema().Columns[i+1:]...)
}
}
appendColumnPruneTraceStep(s.self, prunedColumns, opt)
}
// physicalSchemaProducer stores the schema for the physical plans who can produce schema directly.
type physicalSchemaProducer struct {
schema *expression.Schema
basePhysicalPlan
}
func (s *physicalSchemaProducer) cloneWithSelf(newSelf PhysicalPlan) (*physicalSchemaProducer, error) {
base, err := s.basePhysicalPlan.cloneWithSelf(newSelf)
if err != nil {
return nil, err
}
return &physicalSchemaProducer{
basePhysicalPlan: *base,
schema: s.Schema().Clone(),
}, nil
}
// Schema implements the Plan.Schema interface.
func (s *physicalSchemaProducer) Schema() *expression.Schema {
if s.schema == nil {
if len(s.Children()) == 1 {
// default implementation for plans has only one child: proprgate child schema.
// multi-children plans are likely to have particular implementation.
s.schema = s.Children()[0].Schema().Clone()
} else {
s.schema = expression.NewSchema()
}
}
return s.schema
}
// SetSchema implements the Plan.SetSchema interface.
func (s *physicalSchemaProducer) SetSchema(schema *expression.Schema) {
s.schema = schema
}
// MemoryUsage return the memory usage of physicalSchemaProducer
func (s *physicalSchemaProducer) MemoryUsage() (sum int64) {
if s == nil {
return
}
sum = s.basePhysicalPlan.MemoryUsage() + size.SizeOfPointer
return
}
// baseSchemaProducer stores the schema for the base plans who can produce schema directly.
type baseSchemaProducer struct {
schema *expression.Schema
names types.NameSlice
basePlan
}
// OutputNames returns the outputting names of each column.
func (s *baseSchemaProducer) OutputNames() types.NameSlice {
return s.names
}
func (s *baseSchemaProducer) SetOutputNames(names types.NameSlice) {
s.names = names
}
// Schema implements the Plan.Schema interface.
func (s *baseSchemaProducer) Schema() *expression.Schema {
if s.schema == nil {
s.schema = expression.NewSchema()
}
return s.schema
}
// SetSchema implements the Plan.SetSchema interface.
func (s *baseSchemaProducer) SetSchema(schema *expression.Schema) {
s.schema = schema
}
func (s *baseSchemaProducer) setSchemaAndNames(schema *expression.Schema, names types.NameSlice) {
s.schema = schema
s.names = names
}
// Schema implements the Plan.Schema interface.
func (p *LogicalMaxOneRow) Schema() *expression.Schema {
s := p.Children()[0].Schema().Clone()
resetNotNullFlag(s, 0, s.Len())
return s
}
func buildLogicalJoinSchema(joinType JoinType, join LogicalPlan) *expression.Schema {
leftSchema := join.Children()[0].Schema()
switch joinType {
case SemiJoin, AntiSemiJoin:
return leftSchema.Clone()
case LeftOuterSemiJoin, AntiLeftOuterSemiJoin:
newSchema := leftSchema.Clone()
newSchema.Append(join.Schema().Columns[join.Schema().Len()-1])
return newSchema
}
newSchema := expression.MergeSchema(leftSchema, join.Children()[1].Schema())
if joinType == LeftOuterJoin {
resetNotNullFlag(newSchema, leftSchema.Len(), newSchema.Len())
} else if joinType == RightOuterJoin {
resetNotNullFlag(newSchema, 0, leftSchema.Len())
}
return newSchema
}
// BuildPhysicalJoinSchema builds the schema of PhysicalJoin from it's children's schema.
func BuildPhysicalJoinSchema(joinType JoinType, join PhysicalPlan) *expression.Schema {
leftSchema := join.Children()[0].Schema()
switch joinType {
case SemiJoin, AntiSemiJoin:
return leftSchema.Clone()
case LeftOuterSemiJoin, AntiLeftOuterSemiJoin:
newSchema := leftSchema.Clone()
newSchema.Append(join.Schema().Columns[join.Schema().Len()-1])
return newSchema
}
newSchema := expression.MergeSchema(leftSchema, join.Children()[1].Schema())
if joinType == LeftOuterJoin {
resetNotNullFlag(newSchema, leftSchema.Len(), newSchema.Len())
} else if joinType == RightOuterJoin {
resetNotNullFlag(newSchema, 0, leftSchema.Len())
}
return newSchema
}
// GetStatsInfoFromFlatPlan gets the statistics info from a FlatPhysicalPlan.
func GetStatsInfoFromFlatPlan(flat *FlatPhysicalPlan) map[string]uint64 {
res := make(map[string]uint64)
for _, op := range flat.Main {
switch p := op.Origin.(type) {
case *PhysicalIndexScan:
if _, ok := res[p.Table.Name.O]; p.stats != nil && !ok {
res[p.Table.Name.O] = p.stats.StatsVersion
}
case *PhysicalTableScan:
if _, ok := res[p.Table.Name.O]; p.stats != nil && !ok {
res[p.Table.Name.O] = p.stats.StatsVersion
}
}
}
return res
}
// GetStatsInfo gets the statistics info from a physical plan tree.
// Deprecated: FlattenPhysicalPlan() + GetStatsInfoFromFlatPlan() is preferred.
func GetStatsInfo(i interface{}) map[string]uint64 {
if i == nil {
// it's a workaround for https://github.com/pingcap/tidb/issues/17419
// To entirely fix this, uncomment the assertion in TestPreparedIssue17419
return nil
}
p := i.(Plan)
var physicalPlan PhysicalPlan
switch x := p.(type) {
case *Insert:
physicalPlan = x.SelectPlan
case *Update:
physicalPlan = x.SelectPlan
case *Delete:
physicalPlan = x.SelectPlan
case PhysicalPlan:
physicalPlan = x
}
if physicalPlan == nil {
return nil
}
statsInfos := make(map[string]uint64)
statsInfos = CollectPlanStatsVersion(physicalPlan, statsInfos)
return statsInfos
}
// extractStringFromStringSet helps extract string info from set.StringSet.
func extractStringFromStringSet(set set.StringSet) string {
if len(set) < 1 {
return ""
}
l := make([]string, 0, len(set))
for k := range set {
l = append(l, fmt.Sprintf(`"%s"`, k))
}
slices.Sort(l)
return strings.Join(l, ",")
}
// extractStringFromStringSlice helps extract string info from []string.
func extractStringFromStringSlice(ss []string) string {
if len(ss) < 1 {
return ""
}
slices.Sort(ss)
return strings.Join(ss, ",")
}
// extractStringFromUint64Slice helps extract string info from uint64 slice.
func extractStringFromUint64Slice(slice []uint64) string {
if len(slice) < 1 {
return ""
}
l := make([]string, 0, len(slice))
for _, k := range slice {
l = append(l, fmt.Sprintf(`%d`, k))
}
slices.Sort(l)
return strings.Join(l, ",")
}
// extractStringFromBoolSlice helps extract string info from bool slice.
func extractStringFromBoolSlice(slice []bool) string {
if len(slice) < 1 {
return ""
}
l := make([]string, 0, len(slice))
for _, k := range slice {
l = append(l, fmt.Sprintf(`%t`, k))
}
slices.Sort(l)
return strings.Join(l, ",")
}
func tableHasDirtyContent(ctx sessionctx.Context, tableInfo *model.TableInfo) bool {
pi := tableInfo.GetPartitionInfo()
if pi == nil {
return ctx.HasDirtyContent(tableInfo.ID)
}
// Currently, we add UnionScan on every partition even though only one partition's data is changed.
// This is limited by current implementation of Partition Prune. It'll be updated once we modify that part.
for _, partition := range pi.Definitions {
if ctx.HasDirtyContent(partition.ID) {
return true
}
}
return false
}
func cloneExprs(exprs []expression.Expression) []expression.Expression {
cloned := make([]expression.Expression, 0, len(exprs))
for _, e := range exprs {
cloned = append(cloned, e.Clone())
}
return cloned
}
func cloneCols(cols []*expression.Column) []*expression.Column {
cloned := make([]*expression.Column, 0, len(cols))
for _, c := range cols {
cloned = append(cloned, c.Clone().(*expression.Column))
}
return cloned
}
func cloneColInfos(cols []*model.ColumnInfo) []*model.ColumnInfo {
cloned := make([]*model.ColumnInfo, 0, len(cols))
for _, c := range cols {
cloned = append(cloned, c.Clone())
}
return cloned
}
func cloneRanges(ranges []*ranger.Range) []*ranger.Range {
cloned := make([]*ranger.Range, 0, len(ranges))
for _, r := range ranges {
cloned = append(cloned, r.Clone())
}
return cloned
}
func clonePhysicalPlan(plans []PhysicalPlan) ([]PhysicalPlan, error) {
cloned := make([]PhysicalPlan, 0, len(plans))
for _, p := range plans {
c, err := p.Clone()
if err != nil {
return nil, err
}
cloned = append(cloned, c)
}
return cloned, nil
}
相关信息
相关文章
tidb collect_column_stats_usage 源码
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
8、 openharmony