90 Star 490 Fork 149

平凯星辰(北京)科技有限公司/tidb

Create your Gitee Account
Explore and code with more than 12 million developers,Free private repositories !:)
Sign up
Clone or Download
compiler.go 5.25 KB
Copy Edit Raw Blame History
// 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 executor
import (
"fmt"
"github.com/opentracing/opentracing-go"
"github.com/pingcap/tidb/ast"
"github.com/pingcap/tidb/config"
"github.com/pingcap/tidb/infoschema"
"github.com/pingcap/tidb/metrics"
plannercore "github.com/pingcap/tidb/planner/core"
"github.com/pingcap/tidb/sessionctx"
"github.com/pkg/errors"
log "github.com/sirupsen/logrus"
"golang.org/x/net/context"
)
// Compiler compiles an ast.StmtNode to a physical plan.
type Compiler struct {
Ctx sessionctx.Context
}
// Compile compiles an ast.StmtNode to a physical plan.
func (c *Compiler) Compile(ctx context.Context, stmtNode ast.StmtNode) (*ExecStmt, error) {
if span := opentracing.SpanFromContext(ctx); span != nil {
span1 := opentracing.StartSpan("executor.Compile", opentracing.ChildOf(span.Context()))
defer span1.Finish()
}
infoSchema := GetInfoSchema(c.Ctx)
if err := plannercore.Preprocess(c.Ctx, stmtNode, infoSchema, false); err != nil {
return nil, errors.Trace(err)
}
finalPlan, err := plannercore.Optimize(c.Ctx, stmtNode, infoSchema)
if err != nil {
return nil, errors.Trace(err)
}
CountStmtNode(stmtNode, c.Ctx.GetSessionVars().InRestrictedSQL)
isExpensive := logExpensiveQuery(stmtNode, finalPlan)
return &ExecStmt{
InfoSchema: infoSchema,
Plan: finalPlan,
Expensive: isExpensive,
Cacheable: plannercore.Cacheable(stmtNode),
Text: stmtNode.Text(),
StmtNode: stmtNode,
Ctx: c.Ctx,
}, nil
}
func logExpensiveQuery(stmtNode ast.StmtNode, finalPlan plannercore.Plan) (expensive bool) {
expensive = isExpensiveQuery(finalPlan)
if !expensive {
return
}
const logSQLLen = 1024
sql := stmtNode.Text()
if len(sql) > logSQLLen {
sql = fmt.Sprintf("%s len(%d)", sql[:logSQLLen], len(sql))
}
log.Warnf("[EXPENSIVE_QUERY] %s", sql)
return
}
func isExpensiveQuery(p plannercore.Plan) bool {
switch x := p.(type) {
case plannercore.PhysicalPlan:
return isPhysicalPlanExpensive(x)
case *plannercore.Execute:
return isExpensiveQuery(x.Plan)
case *plannercore.Insert:
if x.SelectPlan != nil {
return isPhysicalPlanExpensive(x.SelectPlan)
}
case *plannercore.Delete:
if x.SelectPlan != nil {
return isPhysicalPlanExpensive(x.SelectPlan)
}
case *plannercore.Update:
if x.SelectPlan != nil {
return isPhysicalPlanExpensive(x.SelectPlan)
}
}
return false
}
func isPhysicalPlanExpensive(p plannercore.PhysicalPlan) bool {
expensiveRowThreshold := int64(config.GetGlobalConfig().Log.ExpensiveThreshold)
if int64(p.StatsCount()) > expensiveRowThreshold {
return true
}
for _, child := range p.Children() {
if isPhysicalPlanExpensive(child) {
return true
}
}
return false
}
// CountStmtNode records the number of statements with the same type.
func CountStmtNode(stmtNode ast.StmtNode, inRestrictedSQL bool) {
if inRestrictedSQL {
return
}
metrics.StmtNodeCounter.WithLabelValues(GetStmtLabel(stmtNode)).Inc()
}
// GetStmtLabel generates a label for a statement.
func GetStmtLabel(stmtNode ast.StmtNode) string {
switch x := stmtNode.(type) {
case *ast.AlterTableStmt:
return "AlterTable"
case *ast.AnalyzeTableStmt:
return "AnalyzeTable"
case *ast.BeginStmt:
return "Begin"
case *ast.CommitStmt:
return "Commit"
case *ast.CreateDatabaseStmt:
return "CreateDatabase"
case *ast.CreateIndexStmt:
return "CreateIndex"
case *ast.CreateTableStmt:
return "CreateTable"
case *ast.CreateUserStmt:
return "CreateUser"
case *ast.DeleteStmt:
return "Delete"
case *ast.DropDatabaseStmt:
return "DropDatabase"
case *ast.DropIndexStmt:
return "DropIndex"
case *ast.DropTableStmt:
return "DropTable"
case *ast.ExplainStmt:
return "Explain"
case *ast.InsertStmt:
if x.IsReplace {
return "Replace"
}
return "Insert"
case *ast.LoadDataStmt:
return "LoadData"
case *ast.RollbackStmt:
return "RollBack"
case *ast.SelectStmt:
return "Select"
case *ast.SetStmt, *ast.SetPwdStmt:
return "Set"
case *ast.ShowStmt:
return "Show"
case *ast.TruncateTableStmt:
return "TruncateTable"
case *ast.UpdateStmt:
return "Update"
case *ast.GrantStmt:
return "Grant"
case *ast.RevokeStmt:
return "Revoke"
case *ast.DeallocateStmt:
return "Deallocate"
case *ast.ExecuteStmt:
return "Execute"
case *ast.PrepareStmt:
return "Prepare"
case *ast.UseStmt:
return "Use"
}
return "other"
}
// GetInfoSchema gets TxnCtx InfoSchema if snapshot schema is not set,
// Otherwise, snapshot schema is returned.
func GetInfoSchema(ctx sessionctx.Context) infoschema.InfoSchema {
sessVar := ctx.GetSessionVars()
var is infoschema.InfoSchema
if snap := sessVar.SnapshotInfoschema; snap != nil {
is = snap.(infoschema.InfoSchema)
log.Infof("con:%d use snapshot schema %d", sessVar.ConnectionID, is.SchemaMetaVersion())
} else {
is = sessVar.TxnCtx.InfoSchema.(infoschema.InfoSchema)
}
return is
}
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Go
1
https://gitee.com/pingcap/tidb.git
git@gitee.com:pingcap/tidb.git
pingcap
tidb
tidb
v2.1.0-rc.3

Search