-
Notifications
You must be signed in to change notification settings - Fork 5.9k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
inforschema, executor, util/kvcache, util/statement_summary : Add STA…
…TEMENTS_SUMMARY_EVICTED into information_schema (#24513)
- Loading branch information
Showing
9 changed files
with
615 additions
and
15 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,192 @@ | ||
| // Copyright 2021 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 stmtsummary | ||
|
|
||
| import ( | ||
| "container/list" | ||
| "time" | ||
|
|
||
| "github.com/pingcap/parser/mysql" | ||
| "github.com/pingcap/tidb/types" | ||
| ) | ||
|
|
||
| // stmtSummaryByDigestEvicted contents digests evicted from stmtSummaryByDigestMap | ||
| type stmtSummaryByDigestEvicted struct { | ||
| // record evicted data in intervals | ||
| // latest history data is Back() | ||
| history *list.List | ||
| } | ||
|
|
||
| // element being stored in stmtSummaryByDigestEvicted | ||
| type stmtSummaryByDigestEvictedElement struct { | ||
| // beginTime is the begin time of current interval | ||
| beginTime int64 | ||
| // endTime is the end time of current interval | ||
| endTime int64 | ||
| // *Kinds* of digest being evicted | ||
| digestKeyMap map[string]struct{} | ||
| } | ||
|
|
||
| // spawn a new pointer to stmtSummaryByDigestEvicted | ||
| func newStmtSummaryByDigestEvicted() *stmtSummaryByDigestEvicted { | ||
| return &stmtSummaryByDigestEvicted{ | ||
| history: list.New(), | ||
| } | ||
| } | ||
|
|
||
| // spawn a new pointer to stmtSummaryByDigestEvictedElement | ||
| func newStmtSummaryByDigestEvictedElement(beginTime int64, endTime int64) *stmtSummaryByDigestEvictedElement { | ||
| return &stmtSummaryByDigestEvictedElement{ | ||
| beginTime: beginTime, | ||
| endTime: endTime, | ||
| digestKeyMap: make(map[string]struct{}), | ||
| } | ||
| } | ||
|
|
||
| // AddEvicted is used add an evicted record to stmtSummaryByDigestEvicted | ||
| func (ssbde *stmtSummaryByDigestEvicted) AddEvicted(evictedKey *stmtSummaryByDigestKey, evictedValue *stmtSummaryByDigest, historySize int) { | ||
| if evictedValue == nil { | ||
| return | ||
| } | ||
|
|
||
| evictedValue.Lock() | ||
| defer evictedValue.Unlock() | ||
|
|
||
| if evictedValue.history == nil { | ||
| return | ||
| } | ||
| for e, h := evictedValue.history.Back(), ssbde.history.Back(); e != nil; e = e.Prev() { | ||
| evictedElement := e.Value.(*stmtSummaryByDigestElement) | ||
|
|
||
| // use closure to minimize time holding lock | ||
| func() { | ||
| evictedElement.Lock() | ||
| defer evictedElement.Unlock() | ||
| // no record in ssbde.history, direct insert | ||
| if ssbde.history.Len() == 0 && historySize != 0 { | ||
|
|
||
| eBeginTime := evictedElement.beginTime | ||
| eEndTime := evictedElement.endTime | ||
| record := newStmtSummaryByDigestEvictedElement(eBeginTime, eEndTime) | ||
| record.addEvicted(evictedKey, evictedElement) | ||
| ssbde.history.PushFront(record) | ||
|
|
||
| h = ssbde.history.Back() | ||
| return | ||
| } | ||
|
|
||
| // look for matching history interval | ||
| MATCHING: | ||
| for ; h != nil; h = h.Prev() { | ||
| historyElement := h.Value.(*stmtSummaryByDigestEvictedElement) | ||
|
|
||
| switch historyElement.matchAndAdd(evictedKey, evictedElement) { | ||
| case isMatch: | ||
| // automatically added | ||
| break MATCHING | ||
| // not matching, create a new record and insert | ||
| case isTooYoung: | ||
| { | ||
| eBeginTime := evictedElement.beginTime | ||
| eEndTime := evictedElement.endTime | ||
| record := newStmtSummaryByDigestEvictedElement(eBeginTime, eEndTime) | ||
| record.addEvicted(evictedKey, evictedElement) | ||
| ssbde.history.InsertAfter(record, h) | ||
| break MATCHING | ||
| } | ||
| default: // isTooOld | ||
| { | ||
| if h == ssbde.history.Front() { | ||
| // if digest older than all records in ssbde.history. | ||
| eBeginTime := evictedElement.beginTime | ||
| eEndTime := evictedElement.endTime | ||
| record := newStmtSummaryByDigestEvictedElement(eBeginTime, eEndTime) | ||
| record.addEvicted(evictedKey, evictedElement) | ||
| ssbde.history.PushFront(record) | ||
| break MATCHING | ||
| } | ||
| } | ||
| } | ||
| } | ||
| }() | ||
|
|
||
| // prevent exceeding history size | ||
| for ssbde.history.Len() > historySize && ssbde.history.Len() > 0 { | ||
| ssbde.history.Remove(ssbde.history.Front()) | ||
| } | ||
| } | ||
| } | ||
|
|
||
| // Clear up all records in stmtSummaryByDigestEvicted | ||
| func (ssbde *stmtSummaryByDigestEvicted) Clear() { | ||
| ssbde.history.Init() | ||
| } | ||
|
|
||
| // add an evicted record to stmtSummaryByDigestEvictedElement | ||
| func (seElement *stmtSummaryByDigestEvictedElement) addEvicted(digestKey *stmtSummaryByDigestKey, digestValue *stmtSummaryByDigestElement) { | ||
| if digestKey != nil { | ||
| seElement.digestKeyMap[string(digestKey.Hash())] = struct{}{} | ||
| } | ||
| } | ||
|
|
||
| const ( | ||
| isMatch = 0 | ||
| isTooOld = 1 | ||
| isTooYoung = 2 | ||
| ) | ||
|
|
||
| // matchAndAdd check time interval of seElement and digestValue. | ||
| // if matches, it will add the digest and return enum match | ||
| // if digest too old, it will return enum tooOld and do nothing | ||
| // if digest too young, it will return enum tooYoung and do nothing | ||
| func (seElement *stmtSummaryByDigestEvictedElement) matchAndAdd(digestKey *stmtSummaryByDigestKey, digestValue *stmtSummaryByDigestElement) (statement int) { | ||
| if seElement == nil || digestValue == nil { | ||
| return isTooYoung | ||
| } | ||
| sBeginTime, sEndTime := seElement.beginTime, seElement.endTime | ||
| eBeginTime, eEndTime := digestValue.beginTime, digestValue.endTime | ||
| if sBeginTime <= eBeginTime && eEndTime <= sEndTime { | ||
| seElement.addEvicted(digestKey, digestValue) | ||
| return isMatch | ||
| } else if eEndTime <= sBeginTime { | ||
| return isTooOld | ||
| } else { | ||
| return isTooYoung | ||
| } | ||
| } | ||
|
|
||
| // ToEvictedCountDatum converts history evicted record to `evicted count` record's datum | ||
| func (ssbde *stmtSummaryByDigestEvicted) ToEvictedCountDatum() [][]types.Datum { | ||
| records := make([][]types.Datum, 0, ssbde.history.Len()) | ||
| for e := ssbde.history.Back(); e != nil; e = e.Prev() { | ||
| if record := e.Value.(*stmtSummaryByDigestEvictedElement).toEvictedCountDatum(); record != nil { | ||
| records = append(records, record) | ||
| } | ||
| } | ||
| return records | ||
| } | ||
|
|
||
| // toEvictedCountDatum converts evicted record to `EvictedCount` record's datum | ||
| func (seElement *stmtSummaryByDigestEvictedElement) toEvictedCountDatum() []types.Datum { | ||
| datum := types.MakeDatums( | ||
| types.NewTime(types.FromGoTime(time.Unix(seElement.beginTime, 0)), mysql.TypeTimestamp, 0), | ||
| types.NewTime(types.FromGoTime(time.Unix(seElement.endTime, 0)), mysql.TypeTimestamp, 0), | ||
| int64(len(seElement.digestKeyMap)), | ||
| ) | ||
| return datum | ||
| } | ||
|
|
||
| func (ssMap *stmtSummaryByDigestMap) ToEvictedCountDatum() [][]types.Datum { | ||
| return ssMap.other.ToEvictedCountDatum() | ||
| } |
Oops, something went wrong.