tidb/plan/initialize.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,
// See the License for the specific language governing permissions and
// limitations under the License.

package plan

import (
	"github.com/pingcap/tidb/context"
)

const (
	// TypeSel is the type of Selection.
	TypeSel = "Selection"
	// TypeSet is the type of Set.
	TypeSet = "Set"
	// TypeProj is the type of Projection.
	TypeProj = "Projection"
	// TypeAgg is the type of Aggregation.
	TypeAgg = "Aggregation"
	// TypeStreamAgg is the type of StreamAgg.
	TypeStreamAgg = "StreamAgg"
	// TypeHashAgg is the type of HashAgg.
	TypeHashAgg = "HashAgg"
	// TypeShow is the type of show.
	TypeShow = "Show"
	// TypeJoin is the type of Join.
	TypeJoin = "Join"
	// TypeUnion is the type of Union.
	TypeUnion = "Union"
	// TypeTableScan is the type of TableScan.
	TypeTableScan = "TableScan"
	// TypeMemTableScan is the type of TableScan.
	TypeMemTableScan = "MemTableScan"
	// TypeUnionScan is the type of UnionScan.
	TypeUnionScan = "UnionScan"
	// TypeIdxScan is the type of IndexScan.
	TypeIdxScan = "IndexScan"
	// TypeSort is the type of Sort.
	TypeSort = "Sort"
	// TypeTopN is the type of TopN.
	TypeTopN = "TopN"
	// TypeLimit is the type of Limit.
	TypeLimit = "Limit"
	// TypeHashLeftJoin is the type of left hash join.
	TypeHashLeftJoin = "HashLeftJoin"
	// TypeHashRightJoin is the type of right hash join.
	TypeHashRightJoin = "HashRightJoin"
	// TypeMergeJoin is the type of merge join.
	TypeMergeJoin = "MergeJoin"
	// TypeIndexJoin is the type of index look up join.
	TypeIndexJoin = "IndexJoin"
	// TypeApply is the type of Apply.
	TypeApply = "Apply"
	// TypeMaxOneRow is the type of MaxOneRow.
	TypeMaxOneRow = "MaxOneRow"
	// TypeExists is the type of Exists.
	TypeExists = "Exists"
	// TypeDual is the type of TableDual.
	TypeDual = "TableDual"
	// TypeLock is the type of SelectLock.
	TypeLock = "SelectLock"
	// TypeInsert is the type of Insert
	TypeInsert = "Insert"
	// TypeUpdate is the type of Update.
	TypeUpdate = "Update"
	// TypeDelete is the type of Delete.
	TypeDelete = "Delete"
	// TypeIndexLookUp is the type of IndexLookUp.
	TypeIndexLookUp = "IndexLookUp"
	// TypeTableReader is the type of TableReader.
	TypeTableReader = "TableReader"
	// TypeIndexReader is the type of IndexReader.
	TypeIndexReader = "IndexReader"
)

func (la LogicalAggregation) init(ctx context.Context) *LogicalAggregation {
	la.baseLogicalPlan = newBaseLogicalPlan(TypeAgg, ctx, &la)
	return &la
}

func (p LogicalJoin) init(ctx context.Context) *LogicalJoin {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeJoin, ctx, &p)
	return &p
}

func (ds DataSource) init(ctx context.Context) *DataSource {
	ds.baseLogicalPlan = newBaseLogicalPlan(TypeTableScan, ctx, &ds)
	return &ds
}

func (la LogicalApply) init(ctx context.Context) *LogicalApply {
	la.baseLogicalPlan = newBaseLogicalPlan(TypeApply, ctx, &la)
	return &la
}

func (p LogicalSelection) init(ctx context.Context) *LogicalSelection {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeSel, ctx, &p)
	return &p
}

func (p PhysicalSelection) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalSelection {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeSel, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p LogicalUnionScan) init(ctx context.Context) *LogicalUnionScan {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeUnionScan, ctx, &p)
	return &p
}

func (p LogicalProjection) init(ctx context.Context) *LogicalProjection {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeProj, ctx, &p)
	return &p
}

func (p PhysicalProjection) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalProjection {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeProj, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p LogicalUnionAll) init(ctx context.Context) *LogicalUnionAll {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeUnion, ctx, &p)
	return &p
}

func (p PhysicalUnionAll) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalUnionAll {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeUnion, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (ls LogicalSort) init(ctx context.Context) *LogicalSort {
	ls.baseLogicalPlan = newBaseLogicalPlan(TypeSort, ctx, &ls)
	return &ls
}

func (p PhysicalSort) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalSort {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeSort, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p NominalSort) init(ctx context.Context, props ...*requiredProp) *NominalSort {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeSort, ctx, &p)
	p.childrenReqProps = props
	return &p
}

func (lt LogicalTopN) init(ctx context.Context) *LogicalTopN {
	lt.baseLogicalPlan = newBaseLogicalPlan(TypeTopN, ctx, &lt)
	return &lt
}

func (p PhysicalTopN) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalTopN {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeTopN, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p LogicalLimit) init(ctx context.Context) *LogicalLimit {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeLimit, ctx, &p)
	return &p
}

func (p PhysicalLimit) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalLimit {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeLimit, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p LogicalTableDual) init(ctx context.Context) *LogicalTableDual {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeDual, ctx, &p)
	return &p
}

func (p PhysicalTableDual) init(ctx context.Context, stats *statsInfo) *PhysicalTableDual {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeDual, ctx, &p)
	p.stats = stats
	return &p
}

func (p LogicalExists) init(ctx context.Context) *LogicalExists {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeExists, ctx, &p)
	return &p
}

func (p PhysicalExists) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalExists {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeExists, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p LogicalMaxOneRow) init(ctx context.Context) *LogicalMaxOneRow {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeMaxOneRow, ctx, &p)
	return &p
}

func (p PhysicalMaxOneRow) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalMaxOneRow {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeMaxOneRow, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p Update) init(ctx context.Context) *Update {
	p.basePlan = newBasePlan(TypeUpdate, ctx)
	return &p
}

func (p Delete) init(ctx context.Context) *Delete {
	p.basePlan = newBasePlan(TypeDelete, ctx)
	return &p
}

func (p Insert) init(ctx context.Context) *Insert {
	p.basePlan = newBasePlan(TypeInsert, ctx)
	return &p
}

func (p Show) init(ctx context.Context) *Show {
	p.basePlan = newBasePlan(TypeShow, ctx)
	return &p
}

func (p LogicalLock) init(ctx context.Context) *LogicalLock {
	p.baseLogicalPlan = newBaseLogicalPlan(TypeLock, ctx, &p)
	return &p
}

func (p PhysicalLock) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalLock {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeLock, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p PhysicalTableScan) init(ctx context.Context) *PhysicalTableScan {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeTableScan, ctx, &p)
	return &p
}

func (p PhysicalIndexScan) init(ctx context.Context) *PhysicalIndexScan {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeIdxScan, ctx, &p)
	return &p
}

func (p PhysicalMemTable) init(ctx context.Context, stats *statsInfo) *PhysicalMemTable {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeMemTableScan, ctx, &p)
	p.stats = stats
	return &p
}

func (p PhysicalHashJoin) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalHashJoin {
	tp := TypeHashRightJoin
	if p.SmallChildIdx == 1 {
		tp = TypeHashLeftJoin
	}
	p.basePhysicalPlan = newBasePhysicalPlan(tp, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p PhysicalMergeJoin) init(ctx context.Context, stats *statsInfo) *PhysicalMergeJoin {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeMergeJoin, ctx, &p)
	p.stats = stats
	return &p
}

func (base basePhysicalAgg) init(ctx context.Context, stats *statsInfo) *basePhysicalAgg {
	base.basePhysicalPlan = newBasePhysicalPlan(TypeHashAgg, ctx, &base)
	base.stats = stats
	return &base
}

func (base basePhysicalAgg) initForHash(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalHashAgg {
	p := &PhysicalHashAgg{base}
	p.basePhysicalPlan = newBasePhysicalPlan(TypeHashAgg, ctx, p)
	p.childrenReqProps = props
	p.stats = stats
	return p
}

func (base basePhysicalAgg) initForStream(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalStreamAgg {
	p := &PhysicalStreamAgg{base}
	p.basePhysicalPlan = newBasePhysicalPlan(TypeStreamAgg, ctx, p)
	p.childrenReqProps = props
	p.stats = stats
	return p
}

func (p PhysicalApply) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalApply {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeApply, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p PhysicalUnionScan) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalUnionScan {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeUnionScan, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

func (p PhysicalIndexLookUpReader) init(ctx context.Context) *PhysicalIndexLookUpReader {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeIndexLookUp, ctx, &p)
	p.TablePlans = flattenPushDownPlan(p.tablePlan)
	p.IndexPlans = flattenPushDownPlan(p.indexPlan)
	p.schema = p.tablePlan.Schema()
	return &p
}

func (p PhysicalTableReader) init(ctx context.Context) *PhysicalTableReader {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeTableReader, ctx, &p)
	p.TablePlans = flattenPushDownPlan(p.tablePlan)
	p.schema = p.tablePlan.Schema()
	return &p
}

func (p PhysicalIndexReader) init(ctx context.Context) *PhysicalIndexReader {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeIndexReader, ctx, &p)
	p.IndexPlans = flattenPushDownPlan(p.indexPlan)
	switch p.indexPlan.(type) {
	case *PhysicalHashAgg, *PhysicalStreamAgg:
		p.schema = p.indexPlan.Schema()
	default:
		is := p.IndexPlans[0].(*PhysicalIndexScan)
		p.schema = is.dataSourceSchema
	}
	p.OutputColumns = p.schema.Clone().Columns
	return &p
}

func (p PhysicalIndexJoin) init(ctx context.Context, stats *statsInfo, props ...*requiredProp) *PhysicalIndexJoin {
	p.basePhysicalPlan = newBasePhysicalPlan(TypeIndexJoin, ctx, &p)
	p.childrenReqProps = props
	p.stats = stats
	return &p
}

// flattenPushDownPlan converts a plan tree to a list, whose head is the leaf node like table scan.
func flattenPushDownPlan(p PhysicalPlan) []PhysicalPlan {
	plans := make([]PhysicalPlan, 0, 5)
	for {
		plans = append(plans, p)
		if len(p.Children()) == 0 {
			break
		}
		p = p.Children()[0].(PhysicalPlan)
	}
	for i := 0; i < len(plans)/2; i++ {
		j := len(plans) - i - 1
		plans[i], plans[j] = plans[j], plans[i]
	}
	return plans
}