// Copyright 2018 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 executor import ( "bytes" "context" "fmt" "runtime/trace" "github.com/pingcap/tidb/expression" "github.com/pingcap/tidb/kv" "github.com/pingcap/tidb/meta/autoid" "github.com/pingcap/tidb/parser/model" "github.com/pingcap/tidb/parser/mysql" plannercore "github.com/pingcap/tidb/planner/core" "github.com/pingcap/tidb/table" "github.com/pingcap/tidb/types" "github.com/pingcap/tidb/util/chunk" "github.com/pingcap/tidb/util/execdetails" "github.com/pingcap/tidb/util/memory" "github.com/tikv/client-go/v2/txnkv/txnsnapshot" ) // UpdateExec represents a new update executor. type UpdateExec struct { baseExecutor OrderedList []*expression.Assignment // updatedRowKeys is a map for unique (TableAlias, handle) pair. // The value is true if the row is changed, or false otherwise updatedRowKeys map[int]*kv.MemAwareHandleMap[bool] tblID2table map[int64]table.Table // mergedRowData is a map for unique (Table, handle) pair. // The value is cached table row mergedRowData map[int64]*kv.MemAwareHandleMap[[]types.Datum] multiUpdateOnSameTable map[int64]bool matched uint64 // a counter of matched rows during update // tblColPosInfos stores relationship between column ordinal to its table handle. // the columns ordinals is present in ordinal range format, @see plannercore.TblColPosInfos tblColPosInfos plannercore.TblColPosInfoSlice assignFlag []int evalBuffer chunk.MutRow allAssignmentsAreConstant bool virtualAssignmentsOffset int drained bool memTracker *memory.Tracker stats *updateRuntimeStats handles []kv.Handle tableUpdatable []bool changed []bool matches []bool // fkChecks contains the foreign key checkers. the map is tableID -> []*FKCheckExec fkChecks map[int64][]*FKCheckExec // fkCascades contains the foreign key cascade. the map is tableID -> []*FKCascadeExec fkCascades map[int64][]*FKCascadeExec } // prepare `handles`, `tableUpdatable`, `changed` to avoid re-computations. func (e *UpdateExec) prepare(row []types.Datum) (err error) { if e.updatedRowKeys == nil { e.updatedRowKeys = make(map[int]*kv.MemAwareHandleMap[bool]) } e.handles = e.handles[:0] e.tableUpdatable = e.tableUpdatable[:0] e.changed = e.changed[:0] e.matches = e.matches[:0] for _, content := range e.tblColPosInfos { if e.updatedRowKeys[content.Start] == nil { e.updatedRowKeys[content.Start] = kv.NewMemAwareHandleMap[bool]() } handle, err := content.HandleCols.BuildHandleByDatums(row) if err != nil { return err } e.handles = append(e.handles, handle) updatable := false flags := e.assignFlag[content.Start:content.End] for _, flag := range flags { if flag >= 0 { updatable = true break } } if unmatchedOuterRow(content, row) { updatable = false } e.tableUpdatable = append(e.tableUpdatable, updatable) changed, ok := e.updatedRowKeys[content.Start].Get(handle) if ok { e.changed = append(e.changed, changed) e.matches = append(e.matches, false) } else { e.changed = append(e.changed, false) e.matches = append(e.matches, true) } } return nil } func (e *UpdateExec) merge(row, newData []types.Datum, mergeGenerated bool) error { if e.mergedRowData == nil { e.mergedRowData = make(map[int64]*kv.MemAwareHandleMap[[]types.Datum]) } var mergedData []types.Datum // merge updates from and into mergedRowData for i, content := range e.tblColPosInfos { if !e.multiUpdateOnSameTable[content.TblID] { // No need to merge if not multi-updated continue } if !e.tableUpdatable[i] { // If there's nothing to update, we can just skip current row continue } if e.changed[i] { // Each matched row is updated once, even if it matches the conditions multiple times. continue } handle := e.handles[i] flags := e.assignFlag[content.Start:content.End] if e.mergedRowData[content.TblID] == nil { e.mergedRowData[content.TblID] = kv.NewMemAwareHandleMap[[]types.Datum]() } tbl := e.tblID2table[content.TblID] oldData := row[content.Start:content.End] newTableData := newData[content.Start:content.End] if v, ok := e.mergedRowData[content.TblID].Get(handle); ok { mergedData = v for i, flag := range flags { if tbl.WritableCols()[i].IsGenerated() != mergeGenerated { continue } mergedData[i].Copy(&oldData[i]) if flag >= 0 { newTableData[i].Copy(&mergedData[i]) } else { mergedData[i].Copy(&newTableData[i]) } } } else { mergedData = append([]types.Datum{}, newTableData...) } memDelta := e.mergedRowData[content.TblID].Set(handle, mergedData) memDelta += types.EstimatedMemUsage(mergedData, 1) + int64(handle.ExtraMemSize()) e.memTracker.Consume(memDelta) } return nil } func (e *UpdateExec) exec(ctx context.Context, schema *expression.Schema, row, newData []types.Datum) error { defer trace.StartRegion(ctx, "UpdateExec").End() bAssignFlag := make([]bool, len(e.assignFlag)) for i, flag := range e.assignFlag { bAssignFlag[i] = flag >= 0 } for i, content := range e.tblColPosInfos { if !e.tableUpdatable[i] { // If there's nothing to update, we can just skip current row continue } if e.changed[i] { // Each matched row is updated once, even if it matches the conditions multiple times. continue } if e.matches[i] { // Row is matched for the first time, increment `matched` counter e.matched++ } tbl := e.tblID2table[content.TblID] handle := e.handles[i] oldData := row[content.Start:content.End] newTableData := newData[content.Start:content.End] flags := bAssignFlag[content.Start:content.End] // Update row fkChecks := e.fkChecks[content.TblID] fkCascades := e.fkCascades[content.TblID] changed, err1 := updateRecord(ctx, e.ctx, handle, oldData, newTableData, flags, tbl, false, e.memTracker, fkChecks, fkCascades) if err1 == nil { _, exist := e.updatedRowKeys[content.Start].Get(handle) memDelta := e.updatedRowKeys[content.Start].Set(handle, changed) if !exist { memDelta += int64(handle.ExtraMemSize()) } e.memTracker.Consume(memDelta) continue } sc := e.ctx.GetSessionVars().StmtCtx if kv.ErrKeyExists.Equal(err1) && sc.DupKeyAsWarning { sc.AppendWarning(err1) continue } return err1 } return nil } // unmatchedOuterRow checks the tableCols of a record to decide whether that record // can not be updated. The handle is NULL only when it is the inner side of an // outer join: the outer row can not match any inner rows, and in this scenario // the inner handle field is filled with a NULL value. // // This fixes: https://github.com/pingcap/tidb/issues/7176. func unmatchedOuterRow(tblPos plannercore.TblColPosInfo, waitUpdateRow []types.Datum) bool { firstHandleIdx := tblPos.HandleCols.GetCol(0) return waitUpdateRow[firstHandleIdx.Index].IsNull() } // Next implements the Executor Next interface. func (e *UpdateExec) Next(ctx context.Context, req *chunk.Chunk) error { req.Reset() if !e.drained { if e.collectRuntimeStatsEnabled() { ctx = context.WithValue(ctx, autoid.AllocatorRuntimeStatsCtxKey, e.stats.AllocatorRuntimeStats) } numRows, err := e.updateRows(ctx) if err != nil { return err } e.drained = true e.ctx.GetSessionVars().StmtCtx.AddRecordRows(uint64(numRows)) } return nil } func (e *UpdateExec) updateRows(ctx context.Context) (int, error) { fields := retTypes(e.children[0]) colsInfo := plannercore.GetUpdateColumnsInfo(e.tblID2table, e.tblColPosInfos, len(fields)) globalRowIdx := 0 chk := tryNewCacheChunk(e.children[0]) if !e.allAssignmentsAreConstant { e.evalBuffer = chunk.MutRowFromTypes(fields) } composeFunc := e.fastComposeNewRow if !e.allAssignmentsAreConstant { composeFunc = e.composeNewRow } memUsageOfChk := int64(0) totalNumRows := 0 for { e.memTracker.Consume(-memUsageOfChk) err := Next(ctx, e.children[0], chk) if err != nil { return 0, err } if chk.NumRows() == 0 { break } memUsageOfChk = chk.MemoryUsage() e.memTracker.Consume(memUsageOfChk) if e.collectRuntimeStatsEnabled() { txn, err := e.ctx.Txn(true) if err == nil && txn.GetSnapshot() != nil { txn.GetSnapshot().SetOption(kv.CollectRuntimeStats, e.stats.SnapshotRuntimeStats) } } txn, err := e.ctx.Txn(true) if err == nil { sc := e.ctx.GetSessionVars().StmtCtx txn.SetOption(kv.ResourceGroupTagger, sc.GetResourceGroupTagger()) if sc.KvExecCounter != nil { // Bind an interceptor for client-go to count the number of SQL executions of each TiKV. txn.SetOption(kv.RPCInterceptor, sc.KvExecCounter.RPCInterceptor()) } } for rowIdx := 0; rowIdx < chk.NumRows(); rowIdx++ { chunkRow := chk.GetRow(rowIdx) datumRow := chunkRow.GetDatumRow(fields) // precomputes handles if err := e.prepare(datumRow); err != nil { return 0, err } // compose non-generated columns newRow, err := composeFunc(globalRowIdx, datumRow, colsInfo) if err != nil { return 0, err } // merge non-generated columns if err := e.merge(datumRow, newRow, false); err != nil { return 0, err } if e.virtualAssignmentsOffset < len(e.OrderedList) { // compose generated columns newRow, err = e.composeGeneratedColumns(globalRowIdx, newRow, colsInfo) if err != nil { return 0, err } // merge generated columns if err := e.merge(datumRow, newRow, true); err != nil { return 0, err } } // write to table if err := e.exec(ctx, e.children[0].Schema(), datumRow, newRow); err != nil { return 0, err } } totalNumRows += chk.NumRows() chk = chunk.Renew(chk, e.maxChunkSize) } return totalNumRows, nil } func (e *UpdateExec) handleErr(colName model.CIStr, rowIdx int, err error) error { if err == nil { return nil } if types.ErrDataTooLong.Equal(err) { return resetErrDataTooLong(colName.O, rowIdx+1, err) } if types.ErrOverflow.Equal(err) { return types.ErrWarnDataOutOfRange.GenWithStackByArgs(colName.O, rowIdx+1) } return err } func (e *UpdateExec) fastComposeNewRow(rowIdx int, oldRow []types.Datum, cols []*table.Column) ([]types.Datum, error) { newRowData := types.CloneRow(oldRow) for _, assign := range e.OrderedList { tblIdx := e.assignFlag[assign.Col.Index] if tblIdx >= 0 && !e.tableUpdatable[tblIdx] { continue } con := assign.Expr.(*expression.Constant) val, err := con.Eval(emptyRow) if err = e.handleErr(assign.ColName, rowIdx, err); err != nil { return nil, err } // info of `_tidb_rowid` column is nil. // No need to cast `_tidb_rowid` column value. if cols[assign.Col.Index] != nil { val, err = table.CastValue(e.ctx, val, cols[assign.Col.Index].ColumnInfo, false, false) if err = e.handleErr(assign.ColName, rowIdx, err); err != nil { return nil, err } } val.Copy(&newRowData[assign.Col.Index]) } return newRowData, nil } func (e *UpdateExec) composeNewRow(rowIdx int, oldRow []types.Datum, cols []*table.Column) ([]types.Datum, error) { newRowData := types.CloneRow(oldRow) e.evalBuffer.SetDatums(newRowData...) for _, assign := range e.OrderedList[:e.virtualAssignmentsOffset] { tblIdx := e.assignFlag[assign.Col.Index] if tblIdx >= 0 && !e.tableUpdatable[tblIdx] { continue } val, err := assign.Expr.Eval(e.evalBuffer.ToRow()) if err != nil { return nil, err } // info of `_tidb_rowid` column is nil. // No need to cast `_tidb_rowid` column value. if cols[assign.Col.Index] != nil { val, err = table.CastValue(e.ctx, val, cols[assign.Col.Index].ColumnInfo, false, false) if err = e.handleErr(assign.ColName, rowIdx, err); err != nil { return nil, err } } val.Copy(&newRowData[assign.Col.Index]) } return newRowData, nil } func (e *UpdateExec) composeGeneratedColumns(rowIdx int, newRowData []types.Datum, cols []*table.Column) ([]types.Datum, error) { if e.allAssignmentsAreConstant { return newRowData, nil } e.evalBuffer.SetDatums(newRowData...) for _, assign := range e.OrderedList[e.virtualAssignmentsOffset:] { tblIdx := e.assignFlag[assign.Col.Index] if tblIdx >= 0 && !e.tableUpdatable[tblIdx] { continue } val, err := assign.Expr.Eval(e.evalBuffer.ToRow()) if err = e.handleErr(assign.ColName, rowIdx, err); err != nil { return nil, err } // info of `_tidb_rowid` column is nil. // No need to cast `_tidb_rowid` column value. if cols[assign.Col.Index] != nil { val, err = table.CastValue(e.ctx, val, cols[assign.Col.Index].ColumnInfo, false, false) if err = e.handleErr(assign.ColName, rowIdx, err); err != nil { return nil, err } } val.Copy(&newRowData[assign.Col.Index]) e.evalBuffer.SetDatum(assign.Col.Index, val) } return newRowData, nil } // Close implements the Executor Close interface. func (e *UpdateExec) Close() error { defer e.memTracker.ReplaceBytesUsed(0) e.setMessage() if e.runtimeStats != nil && e.stats != nil { txn, err := e.ctx.Txn(false) if err == nil && txn.Valid() && txn.GetSnapshot() != nil { txn.GetSnapshot().SetOption(kv.CollectRuntimeStats, nil) } defer e.ctx.GetSessionVars().StmtCtx.RuntimeStatsColl.RegisterStats(e.id, e.stats) } return e.children[0].Close() } // Open implements the Executor Open interface. func (e *UpdateExec) Open(ctx context.Context) error { e.memTracker = memory.NewTracker(e.id, -1) e.memTracker.AttachTo(e.ctx.GetSessionVars().StmtCtx.MemTracker) return e.children[0].Open(ctx) } // setMessage sets info message(ERR_UPDATE_INFO) generated by UPDATE statement func (e *UpdateExec) setMessage() { stmtCtx := e.ctx.GetSessionVars().StmtCtx numMatched := e.matched numChanged := stmtCtx.UpdatedRows() numWarnings := stmtCtx.WarningCount() msg := fmt.Sprintf(mysql.MySQLErrName[mysql.ErrUpdateInfo].Raw, numMatched, numChanged, numWarnings) stmtCtx.SetMessage(msg) } func (e *UpdateExec) collectRuntimeStatsEnabled() bool { if e.runtimeStats != nil { if e.stats == nil { e.stats = &updateRuntimeStats{ SnapshotRuntimeStats: &txnsnapshot.SnapshotRuntimeStats{}, AllocatorRuntimeStats: autoid.NewAllocatorRuntimeStats(), } } return true } return false } // updateRuntimeStats is the execution stats about update statements. type updateRuntimeStats struct { *txnsnapshot.SnapshotRuntimeStats *autoid.AllocatorRuntimeStats } func (e *updateRuntimeStats) String() string { if e.SnapshotRuntimeStats == nil && e.AllocatorRuntimeStats == nil { return "" } buf := bytes.NewBuffer(make([]byte, 0, 16)) if e.SnapshotRuntimeStats != nil { stats := e.SnapshotRuntimeStats.String() if stats != "" { buf.WriteString(stats) } } if e.AllocatorRuntimeStats != nil { stats := e.AllocatorRuntimeStats.String() if stats != "" { if buf.Len() > 0 { buf.WriteString(", ") } buf.WriteString(stats) } } return buf.String() } // Clone implements the RuntimeStats interface. func (e *updateRuntimeStats) Clone() execdetails.RuntimeStats { newRs := &updateRuntimeStats{} if e.SnapshotRuntimeStats != nil { snapshotStats := e.SnapshotRuntimeStats.Clone() newRs.SnapshotRuntimeStats = snapshotStats } if e.AllocatorRuntimeStats != nil { newRs.AllocatorRuntimeStats = e.AllocatorRuntimeStats.Clone() } return newRs } // Merge implements the RuntimeStats interface. func (e *updateRuntimeStats) Merge(other execdetails.RuntimeStats) { tmp, ok := other.(*updateRuntimeStats) if !ok { return } if tmp.SnapshotRuntimeStats != nil { if e.SnapshotRuntimeStats == nil { snapshotStats := tmp.SnapshotRuntimeStats.Clone() e.SnapshotRuntimeStats = snapshotStats } else { e.SnapshotRuntimeStats.Merge(tmp.SnapshotRuntimeStats) } } if tmp.AllocatorRuntimeStats != nil { if e.AllocatorRuntimeStats == nil { e.AllocatorRuntimeStats = tmp.AllocatorRuntimeStats.Clone() } } } // Tp implements the RuntimeStats interface. func (e *updateRuntimeStats) Tp() int { return execdetails.TpUpdateRuntimeStats } // GetFKChecks implements WithForeignKeyTrigger interface. func (e *UpdateExec) GetFKChecks() []*FKCheckExec { fkChecks := make([]*FKCheckExec, 0, len(e.fkChecks)) for _, fkc := range e.fkChecks { fkChecks = append(fkChecks, fkc...) } return fkChecks } // GetFKCascades implements WithForeignKeyTrigger interface. func (e *UpdateExec) GetFKCascades() []*FKCascadeExec { fkCascades := make([]*FKCascadeExec, 0, len(e.fkChecks)) for _, fkc := range e.fkCascades { fkCascades = append(fkCascades, fkc...) } return fkCascades } // HasFKCascades implements WithForeignKeyTrigger interface. func (e *UpdateExec) HasFKCascades() bool { return len(e.fkCascades) > 0 }