-
Notifications
You must be signed in to change notification settings - Fork 6.2k
Expand file tree
/
Copy pathoptimize.go
More file actions
994 lines (907 loc) · 34.3 KB
/
optimize.go
File metadata and controls
994 lines (907 loc) · 34.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
// 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 planner
import (
"context"
"math"
"math/rand"
"sort"
"strings"
"sync"
"time"
"github.com/pingcap/errors"
"github.com/pingcap/failpoint"
"github.com/pingcap/tidb/pkg/bindinfo"
"github.com/pingcap/tidb/pkg/domain"
"github.com/pingcap/tidb/pkg/infoschema"
"github.com/pingcap/tidb/pkg/kv"
"github.com/pingcap/tidb/pkg/parser/ast"
"github.com/pingcap/tidb/pkg/planner/core"
"github.com/pingcap/tidb/pkg/planner/core/base"
"github.com/pingcap/tidb/pkg/planner/core/resolve"
"github.com/pingcap/tidb/pkg/planner/core/rule"
"github.com/pingcap/tidb/pkg/planner/indexadvisor"
"github.com/pingcap/tidb/pkg/planner/planctx"
"github.com/pingcap/tidb/pkg/planner/property"
"github.com/pingcap/tidb/pkg/planner/util/costusage"
"github.com/pingcap/tidb/pkg/privilege"
"github.com/pingcap/tidb/pkg/sessionctx"
"github.com/pingcap/tidb/pkg/sessionctx/stmtctx"
"github.com/pingcap/tidb/pkg/sessionctx/vardef"
"github.com/pingcap/tidb/pkg/sessionctx/variable"
"github.com/pingcap/tidb/pkg/types"
tidbutil "github.com/pingcap/tidb/pkg/util"
"github.com/pingcap/tidb/pkg/util/dbterror/plannererrors"
"github.com/pingcap/tidb/pkg/util/hint"
"github.com/pingcap/tidb/pkg/util/intest"
"github.com/pingcap/tidb/pkg/util/logutil"
semv2 "github.com/pingcap/tidb/pkg/util/sem/v2"
"github.com/pingcap/tidb/pkg/util/topsql"
"github.com/pingcap/tidb/pkg/util/tracing"
"go.uber.org/zap"
)
const nonPreparedPlanCacheHintOnlyNoHintReason = "plan cache strategy is hint_only and use_plan_cache hint is absent"
func containUsePlanCacheHintInSQLOrBinding(sctx sessionctx.Context, stmt ast.StmtNode) bool {
if hint.ContainTableHintInStmtNode(stmt, hint.HintUsePlanCache) {
return true
}
binding, matched, _ := bindinfo.MatchSQLBinding(sctx, stmt)
return matched && binding != nil && binding.Hint != nil && binding.Hint.ContainTableHint(hint.HintUsePlanCache)
}
// getPlanFromNonPreparedPlanCache tries to get an available cached plan from the NonPrepared Plan Cache for this stmt.
func getPlanFromNonPreparedPlanCache(ctx context.Context, sctx sessionctx.Context, node *resolve.NodeW, is infoschema.InfoSchema) (p base.Plan, ns types.NameSlice, ok bool, err error) {
stmtCtx := sctx.GetSessionVars().StmtCtx
stmt, isStmtNode := node.Node.(ast.StmtNode)
_, isExplain := stmt.(*ast.ExplainStmt)
if !sctx.GetSessionVars().EnableNonPreparedPlanCache || // disabled
!isStmtNode ||
stmtCtx.InRestrictedSQL || // is internal SQL
isExplain || // explain external
!sctx.GetSessionVars().DisableTxnAutoRetry || // txn-auto-retry
sctx.GetSessionVars().InMultiStmts { // in multi-stmt
return nil, nil, false, nil
}
if sctx.GetSessionVars().PlanCacheStrategy == vardef.TiDBPlanCacheStrategyHintOnly &&
!containUsePlanCacheHintInSQLOrBinding(sctx, stmt) {
if !isExplain && stmtCtx.InExplainStmt && stmtCtx.ExplainFormat == types.ExplainFormatPlanCache {
stmtCtx.AppendWarning(errors.NewNoStackErrorf("skip non-prepared plan-cache: %s", nonPreparedPlanCacheHintOnlyNoHintReason))
}
return nil, nil, false, nil
}
ok, reason := core.NonPreparedPlanCacheableWithCtx(sctx.GetPlanCtx(), stmt, is)
if !ok {
if !isExplain && stmtCtx.InExplainStmt && stmtCtx.ExplainFormat == types.ExplainFormatPlanCache {
stmtCtx.AppendWarning(errors.NewNoStackErrorf("skip non-prepared plan-cache: %s", reason))
}
return nil, nil, false, nil
}
paramSQL, paramsVals, err := core.GetParamSQLFromAST(stmt)
if err != nil {
return nil, nil, false, err
}
if intest.InTest && ctx.Value(core.PlanCacheKeyTestIssue43667{}) != nil { // update the AST in the middle of the process
ctx.Value(core.PlanCacheKeyTestIssue43667{}).(func(stmt ast.StmtNode))(stmt)
}
val := sctx.GetSessionVars().GetNonPreparedPlanCacheStmt(paramSQL)
paramExprs := core.Params2Expressions(paramsVals)
if val == nil {
// Create a new AST upon this parameterized SQL instead of using the original AST.
// Keep the original AST unchanged to avoid any side effect.
paramStmt, err := core.ParseParameterizedSQL(sctx, paramSQL)
if err != nil {
// This can happen rarely, cannot parse the parameterized(restored) SQL successfully, skip the plan cache in this case.
sctx.GetSessionVars().StmtCtx.AppendWarning(err)
return nil, nil, false, nil
}
// GeneratePlanCacheStmtWithAST may evaluate these parameters so set their values into SCtx in advance.
if err := core.SetParameterValuesIntoSCtx(sctx.GetPlanCtx(), true, nil, paramExprs); err != nil {
return nil, nil, false, err
}
cachedStmt, _, _, err := core.GeneratePlanCacheStmtWithAST(ctx, sctx, false, paramSQL, paramStmt, is)
if err != nil {
return nil, nil, false, err
}
sctx.GetSessionVars().AddNonPreparedPlanCacheStmt(paramSQL, cachedStmt)
val = cachedStmt
}
cachedStmt := val.(*core.PlanCacheStmt)
cachedPlan, names, err := core.GetPlanFromPlanCache(ctx, sctx, true, is, cachedStmt, paramExprs)
if err != nil {
return nil, nil, false, err
}
if intest.InTest && ctx.Value(core.PlanCacheKeyTestIssue47133{}) != nil {
ctx.Value(core.PlanCacheKeyTestIssue47133{}).(func(names []*types.FieldName))(names)
}
return cachedPlan, names, true, nil
}
// Optimize does optimization and creates a Plan.
func Optimize(ctx context.Context, sctx sessionctx.Context, node *resolve.NodeW, is infoschema.InfoSchema) (plan base.Plan, slice types.NameSlice, retErr error) {
defer tracing.StartRegion(ctx, "planner.Optimize").End()
sessVars := sctx.GetSessionVars()
pctx := sctx.GetPlanCtx()
if !sessVars.InRestrictedSQL && (vardef.RestrictedReadOnly.Load() || vardef.VarTiDBSuperReadOnly.Load()) {
allowed, err := allowInReadOnlyMode(pctx, node.Node)
if err != nil {
return nil, nil, err
}
if !allowed {
return nil, nil, errors.Trace(plannererrors.ErrSQLInReadOnlyMode)
}
}
defer func() {
if retErr == nil {
// Override the resource group if the hint is set.
// resource group name is case-insensitive. so we need to convert it to lower case.
lowerRgName := strings.ToLower(sessVars.StmtCtx.StmtHints.ResourceGroup)
if sessVars.StmtCtx.StmtHints.HasResourceGroup {
if vardef.EnableResourceControl.Load() {
hasPriv := true
// only check dynamic privilege when strict-mode is enabled.
if vardef.EnableResourceControlStrictMode.Load() {
checker := privilege.GetPrivilegeManager(sctx)
if checker != nil {
hasRgAdminPriv := checker.RequestDynamicVerification(sctx.GetSessionVars().ActiveRoles, "RESOURCE_GROUP_ADMIN", false)
hasRgUserPriv := checker.RequestDynamicVerification(sctx.GetSessionVars().ActiveRoles, "RESOURCE_GROUP_USER", false)
hasPriv = hasRgAdminPriv || hasRgUserPriv
}
}
if hasPriv {
sessVars.StmtCtx.ResourceGroupName = lowerRgName
// if we are in a txn, should update the txn resource name to let the txn
// commit with the hint resource group.
if txn, err := sctx.Txn(false); err == nil && txn != nil && txn.Valid() {
kv.SetTxnResourceGroup(txn, sessVars.StmtCtx.ResourceGroupName)
}
} else {
err := plannererrors.ErrSpecificAccessDenied.GenWithStackByArgs("SUPER or RESOURCE_GROUP_ADMIN or RESOURCE_GROUP_USER")
sessVars.StmtCtx.AppendWarning(err)
}
} else {
err := infoschema.ErrResourceGroupSupportDisabled
sessVars.StmtCtx.AppendWarning(err)
}
}
// Handle SetVars hints for cached plans.
for name, val := range sessVars.StmtCtx.StmtHints.SetVars {
oldV, err := sessVars.SetSystemVarWithOldStateAsRet(name, val)
if err != nil {
sessVars.StmtCtx.AppendWarning(err)
}
sessVars.StmtCtx.AddSetVarHintRestore(name, oldV)
}
}
}()
// Handle the execute statement. This calls into the prepared plan cache.
if _, ok := node.Node.(*ast.ExecuteStmt); ok {
p, names, err := OptimizeExecStmt(ctx, sctx, node, is)
return p, names, err
}
return optimizeCache(ctx, sctx, node, is)
}
func optimizeCache(ctx context.Context, sctx sessionctx.Context, node *resolve.NodeW, is infoschema.InfoSchema) (plan base.Plan, slice types.NameSlice, retErr error) {
// Call into the non-prepared plan cache.
cachedPlan, names, ok, err := getPlanFromNonPreparedPlanCache(ctx, sctx, node, is)
if err != nil {
return nil, nil, err
}
if ok {
return cachedPlan, names, nil
}
return optimizeNoCache(ctx, sctx, node, is)
}
func optimizeNoCache(ctx context.Context, sctx sessionctx.Context, node *resolve.NodeW, is infoschema.InfoSchema) (plan base.Plan, slice types.NameSlice, retErr error) {
defer func() {
if r := recover(); r != nil {
retErr = tidbutil.GetRecoverError(r)
}
}()
pctx := sctx.GetPlanCtx()
sessVars := sctx.GetSessionVars()
tableHints := hint.ExtractTableHintsFromStmtNode(node.Node, sessVars.StmtCtx)
tableHints, restrictedHintWarns := filterRestrictedHints(tableHints)
for _, warn := range restrictedHintWarns {
sessVars.StmtCtx.AppendWarning(warn)
}
originStmtHints, _, warns := hint.ParseStmtHints(tableHints,
setVarHintChecker, hypoIndexChecker(ctx, is),
sessVars.CurrentDB, byte(kv.ReplicaReadFollower))
sessVars.StmtCtx.StmtHints = originStmtHints
for _, warn := range warns {
sessVars.StmtCtx.AppendWarning(warn)
}
if sessVars.StmtCtx.StmtHints.IgnorePlanCache {
sessVars.StmtCtx.SetSkipPlanCache("ignore_plan_cache hint used in SQL query")
}
for name, val := range sessVars.StmtCtx.StmtHints.SetVars {
oldV, err := sessVars.SetSystemVarWithOldStateAsRet(name, val)
if err != nil {
sessVars.StmtCtx.AppendWarning(err)
}
sessVars.StmtCtx.AddSetVarHintRestore(name, oldV)
}
// XXX: this should be handled after any bindings are setup.
if sessVars.SQLMode.HasStrictMode() && !core.IsReadOnly(node.Node, sessVars) {
sessVars.StmtCtx.TiFlashEngineRemovedDueToStrictSQLMode = true
_, hasTiFlashAccess := sessVars.IsolationReadEngines[kv.TiFlash]
if hasTiFlashAccess {
delete(sessVars.IsolationReadEngines, kv.TiFlash)
}
defer func() {
sessVars.StmtCtx.TiFlashEngineRemovedDueToStrictSQLMode = false
if hasTiFlashAccess {
sessVars.IsolationReadEngines[kv.TiFlash] = struct{}{}
}
}()
}
if _, isolationReadContainTiKV := sessVars.IsolationReadEngines[kv.TiKV]; isolationReadContainTiKV {
var fp base.Plan
if fpv, ok := sctx.Value(core.PointPlanKey).(core.PointPlanVal); ok {
// point plan is already tried in a multi-statement query.
fp = fpv.Plan
} else {
fp = core.TryFastPlan(pctx, node)
}
if fp != nil {
return fp, fp.OutputNames(), nil
}
}
enableUseBinding := sessVars.UsePlanBaselines
stmtNode, isStmtNode := node.Node.(ast.StmtNode)
binding, match, _ := bindinfo.MatchSQLBinding(sctx, stmtNode)
useBinding := enableUseBinding && isStmtNode && match
if isStmtNode {
// add the extra Limit after matching the bind record
stmtNode = core.TryAddExtraLimit(sctx, stmtNode)
node = node.CloneWithNewNode(stmtNode)
}
var (
names types.NameSlice
bestPlan, bestPlanFromBind base.Plan
chosenBinding *bindinfo.Binding
err error
)
if useBinding {
var bindStmtHints hint.StmtHints
originHints := hint.CollectHint(stmtNode)
var warns []error
if binding != nil && binding.IsBindingEnabled() {
hint.BindHint(stmtNode, binding.Hint)
bindingHints, bindingRestrictedWarns := filterRestrictedHints(binding.Hint.GetStmtHints())
for _, warn := range bindingRestrictedWarns {
sessVars.StmtCtx.AppendWarning(warn)
}
curStmtHints, _, curWarns := hint.ParseStmtHints(bindingHints,
setVarHintChecker, hypoIndexChecker(ctx, is),
sessVars.CurrentDB, byte(kv.ReplicaReadFollower))
sessVars.StmtCtx.StmtHints = curStmtHints
if sessVars.StmtCtx.StmtHints.IgnorePlanCache {
sessVars.StmtCtx.SetSkipPlanCache("ignore_plan_cache hint used in SQL binding")
}
for name, val := range sessVars.StmtCtx.StmtHints.SetVars {
oldV, err := sessVars.SetSystemVarWithOldStateAsRet(name, val)
if err != nil {
sessVars.StmtCtx.AppendWarning(err)
}
sessVars.StmtCtx.AddSetVarHintRestore(name, oldV)
}
plan, curNames, _, err := optimize(ctx, pctx, node, is)
if err != nil {
sessVars.StmtCtx.AppendWarning(errors.Errorf("binding %s failed: %v", binding.BindSQL, err))
}
bindStmtHints, warns, names, bestPlanFromBind, chosenBinding = curStmtHints, curWarns, curNames, plan, binding
}
if bestPlanFromBind == nil {
sessVars.StmtCtx.AppendWarning(errors.NewNoStackError("no plan generated from bindings"))
} else {
bestPlan = bestPlanFromBind
sessVars.StmtCtx.StmtHints = bindStmtHints
for _, warn := range warns {
sessVars.StmtCtx.AppendWarning(warn)
}
sessVars.StmtCtx.BindSQL = chosenBinding.BindSQL
sessVars.FoundInBinding = true
if sessVars.StmtCtx.InVerboseExplain {
sessVars.StmtCtx.AppendNote(errors.NewNoStackErrorf("Using the bindSQL: %v", chosenBinding.BindSQL))
} else {
sessVars.StmtCtx.AppendExtraNote(errors.NewNoStackErrorf("Using the bindSQL: %v", chosenBinding.BindSQL))
}
if originStmtHints.QueryHasHints {
sessVars.StmtCtx.AppendWarning(errors.NewNoStackErrorf("The system ignores the hints in the current query and uses the hints specified in the bindSQL: %v", chosenBinding.BindSQL))
}
}
// Restore the hint to avoid changing the stmt node.
hint.BindHint(stmtNode, originHints)
}
// postpone Warmup because binding may change the behaviour, like pipelined DML
if err = pctx.AdviseTxnWarmup(); err != nil {
return nil, nil, err
}
// No plan found from the bindings, or the bindings are ignored.
if bestPlan == nil {
sessVars.StmtCtx.StmtHints = originStmtHints
bestPlan, names, _, err = optimize(ctx, pctx, node, is)
if err != nil {
return nil, nil, err
}
}
// Add a baseline evolution task if:
// 1. the returned plan is from bindings;
// 2. the query is a select statement;
// 3. the original binding contains no read_from_storage hint;
// 4. the plan when ignoring bindings contains no tiflash hint;
// 5. the pending verified binding has not been added already;
savedStmtHints := sessVars.StmtCtx.StmtHints
defer func() {
sessVars.StmtCtx.StmtHints = savedStmtHints
}()
if sessVars.EvolvePlanBaselines && bestPlanFromBind != nil &&
sessVars.SelectLimit == math.MaxUint64 { // do not evolve this query if sql_select_limit is enabled
// Check bestPlanFromBind firstly to avoid nil stmtNode.
if _, ok := stmtNode.(*ast.SelectStmt); ok && !binding.Hint.ContainTableHint(hint.HintReadFromStorage) {
sessVars.StmtCtx.StmtHints = originStmtHints
defPlan, _, _, err := optimize(ctx, pctx, node, is)
if err != nil {
// Ignore this evolution task.
return bestPlan, names, nil
}
defPlanHints := core.GenHintsFromPhysicalPlan(defPlan)
for _, h := range defPlanHints {
if h.HintName.String() == hint.HintReadFromStorage {
return bestPlan, names, nil
}
}
}
}
return bestPlan, names, nil
}
// OptimizeForForeignKeyCascade does optimization and creates a Plan for foreign key cascade.
// Compare to Optimize, OptimizeForForeignKeyCascade only build plan by StmtNode,
// doesn't consider plan cache and plan binding, also doesn't do privilege check.
func OptimizeForForeignKeyCascade(ctx context.Context, sctx planctx.PlanContext, node *resolve.NodeW, is infoschema.InfoSchema) (base.Plan, error) {
builder := planBuilderPool.Get().(*core.PlanBuilder)
defer planBuilderPool.Put(builder.ResetForReuse())
hintProcessor := hint.NewQBHintHandler(sctx.GetSessionVars().StmtCtx)
builder.Init(sctx, is, hintProcessor)
p, err := builder.Build(ctx, node)
if err != nil {
return nil, err
}
if err := core.CheckTableLock(sctx, is, builder.GetVisitInfo()); err != nil {
return nil, err
}
return p, nil
}
func allowInReadOnlyMode(sctx planctx.PlanContext, node ast.Node) (bool, error) {
pm := privilege.GetPrivilegeManager(sctx)
if pm == nil {
return true, nil
}
roles := sctx.GetSessionVars().ActiveRoles
// allow replication thread
// NOTE: it is required, whether SEM is enabled or not, only user with explicit RESTRICTED_REPLICA_WRITER_ADMIN granted can ignore the restriction, so we need to surpass the case that if SEM is not enabled, SUPER will has all privileges
if pm.HasExplicitlyGrantedDynamicPrivilege(roles, "RESTRICTED_REPLICA_WRITER_ADMIN", false) {
return true, nil
}
switch node.(type) {
// allow change variables (otherwise can't unset read-only mode)
case *ast.SetStmt,
// allow analyze table
*ast.AnalyzeTableStmt,
*ast.UseStmt,
*ast.ShowStmt,
*ast.CreateBindingStmt,
*ast.DropBindingStmt,
*ast.PrepareStmt,
*ast.BeginStmt,
*ast.RollbackStmt:
return true, nil
case *ast.CommitStmt:
txn, err := sctx.Txn(true)
if err != nil {
return false, err
}
if !txn.IsReadOnly() {
return false, txn.Rollback()
}
return true, nil
}
vars := sctx.GetSessionVars()
// Passing false allows global variables updates in read-only mode.
return core.IsReadOnlyInternal(node, vars, false), nil
}
var planBuilderPool = sync.Pool{
New: func() any {
return core.NewPlanBuilder()
},
}
type logicalPlanBuildCtx struct {
stmtCtxState stmtctx.LogicalPlanBuildState
plannerSelectBlockAsName *[]ast.HintTable
mapScalarSubQ []any
mapHashCode2UniqueID map[string]int
rewritePhaseInfo variable.RewritePhaseInfo
}
func saveLogicalPlanBuildCtx(sessVars *variable.SessionVars) logicalPlanBuildCtx {
return logicalPlanBuildCtx{
stmtCtxState: sessVars.StmtCtx.SaveLogicalPlanBuildState(),
plannerSelectBlockAsName: sessVars.PlannerSelectBlockAsName.Load(),
mapScalarSubQ: sessVars.MapScalarSubQ,
mapHashCode2UniqueID: sessVars.MapHashCode2UniqueID4ExtendedCol,
rewritePhaseInfo: sessVars.RewritePhaseInfo,
}
}
func restoreLogicalPlanBuildCtx(sessVars *variable.SessionVars, logicalPlanCtx logicalPlanBuildCtx) {
sessVars.StmtCtx.RestoreLogicalPlanBuildState(logicalPlanCtx.stmtCtxState)
sessVars.PlannerSelectBlockAsName.Store(logicalPlanCtx.plannerSelectBlockAsName)
sessVars.MapScalarSubQ = logicalPlanCtx.mapScalarSubQ
sessVars.MapHashCode2UniqueID4ExtendedCol = logicalPlanCtx.mapHashCode2UniqueID
sessVars.RewritePhaseInfo = logicalPlanCtx.rewritePhaseInfo
}
func buildAndOptimizeLogicalPlanRound(
ctx context.Context,
sctx planctx.PlanContext,
node *resolve.NodeW,
is infoschema.InfoSchema,
hintProcessor *hint.QBHintHandler,
checked *bool,
optimizeStarted *bool,
beginOpt *time.Time,
needRestoreLogicalPlanCtx bool,
bestPlan *base.PhysicalPlan,
bestNames *types.NameSlice,
bestCost *float64,
bestLogicalPlanCtx *logicalPlanBuildCtx,
optFlagAdjust func(uint64) uint64,
) (base.Plan, types.NameSlice, bool, error) {
builder := planBuilderPool.Get().(*core.PlanBuilder)
defer planBuilderPool.Put(builder.ResetForReuse())
// TODO: when buildRound > 1, only emit unused view-hint warnings for the winner build.
defer builder.HandleUnusedViewHints()
builder.Init(sctx, is, hintProcessor)
// todo: you can customize each round's special builder (like semi join rewrite or not by signal)
p, err := buildLogicalPlan(ctx, sctx, node, builder)
if err != nil {
return nil, nil, false, err
}
names := p.OutputNames()
if !*checked {
// Keep privilege and lock checks fail-fast. These depend on visitInfo
// produced by the logical build, but not on the later cost winner.
if pm := privilege.GetPrivilegeManager(sctx); pm != nil {
visitInfo := core.VisitInfo4PrivCheck(ctx, is, node.Node, builder.GetVisitInfo())
if err := core.CheckPrivilege(sctx.GetSessionVars().ActiveRoles, pm, visitInfo); err != nil {
return nil, nil, false, err
}
}
if err := core.CheckTableLock(sctx, is, builder.GetVisitInfo()); err != nil {
return nil, nil, false, err
}
if err := core.CheckTableMode(node); err != nil {
return nil, nil, false, err
}
*checked = true
}
// Handle the non-logical plan statement.
logic, isLogicalPlan := p.(base.LogicalPlan)
if !isLogicalPlan {
return p, names, true, nil
}
core.RecheckCTE(logic)
// todo: also you can customize each round's special logical opt flag here (like decorrelate rule or not)
if !*optimizeStarted {
*optimizeStarted = true
*beginOpt = time.Now()
}
optFlag := builder.GetOptFlag()
if sctx.GetSessionVars().EnableAlternativeLogicalPlans &&
optFlag&rule.FlagPushDownTopN > 0 &&
optFlag&rule.FlagJoinReOrder > 0 {
sctx.GetSessionVars().StmtCtx.MarkAlternativeLogicalPlanOrderAwareJoinReorder()
}
if optFlagAdjust != nil {
optFlag = optFlagAdjust(optFlag)
}
finalPlan, cost, err := core.DoOptimize(ctx, sctx, optFlag, logic)
if err != nil {
return nil, nil, false, err
}
if *bestPlan == nil || cost < *bestCost {
*bestCost = cost
*bestPlan = finalPlan
*bestNames = names
if needRestoreLogicalPlanCtx {
*bestLogicalPlanCtx = saveLogicalPlanBuildCtx(sctx.GetSessionVars())
}
}
return p, names, false, nil
}
// optimizeCnt is a global variable only used for test.
var optimizeCnt int
func shouldTryNonDecorrelationRound(sessVars *variable.SessionVars) bool {
return sessVars.EnableAlternativeLogicalPlans &&
sessVars.StmtCtx.AlternativeLogicalPlanDecorrelatedApply &&
!sessVars.StmtCtx.AlternativeLogicalPlanSameOrderIndexJoin
}
func shouldTryOrderAwareReorderRound(sessVars *variable.SessionVars) bool {
return sessVars.EnableAlternativeLogicalPlans &&
sessVars.StmtCtx.AlternativeLogicalPlanOrderAwareJoinReorder
}
func shouldTryCorrelateRound(sessVars *variable.SessionVars) bool {
return sessVars.EnableAlternativeLogicalPlans &&
sessVars.StmtCtx.AlternativeLogicalPlanPreferCorrelate
}
// alternativeRound describes one alternative logical-plan round.
// adjustFlag adjusts the optimization flags for the round.
// enabled returns true when the round should be attempted.
// setup/cleanup optionally modify session state before/after plan building.
type alternativeRound struct {
name string
adjustFlag func(uint64) uint64
enabled func(*variable.SessionVars) bool
setup func(*variable.SessionVars)
cleanup func(*variable.SessionVars)
}
// savedEnableCorrelateSubquery holds the pre-round value of
// EnableCorrelateSubquery so setup/cleanup can share it without a closure
// wrapper. Safe because optimize is single-threaded per session.
var savedEnableCorrelateSubquery bool
var alternativeRounds = [...]alternativeRound{
{
name: "non-decorrelate",
adjustFlag: func(flag uint64) uint64 { return flag &^ rule.FlagDecorrelate },
enabled: shouldTryNonDecorrelationRound,
},
{
name: "order-aware-reorder",
adjustFlag: func(flag uint64) uint64 { return flag | rule.FlagOrderAwareJoinReorder },
enabled: shouldTryOrderAwareReorderRound,
},
{
name: "correlate",
adjustFlag: func(flag uint64) uint64 { return flag | rule.FlagCorrelate },
enabled: shouldTryCorrelateRound,
setup: func(sv *variable.SessionVars) {
savedEnableCorrelateSubquery = sv.EnableCorrelateSubquery
sv.EnableCorrelateSubquery = true
},
cleanup: func(sv *variable.SessionVars) {
sv.EnableCorrelateSubquery = savedEnableCorrelateSubquery
},
},
}
func optimize(ctx context.Context, sctx planctx.PlanContext, node *resolve.NodeW, is infoschema.InfoSchema) (base.Plan, types.NameSlice, float64, error) {
failpoint.Inject("checkOptimizeCountOne", func(val failpoint.Value) {
// only count the optimization for SQL with specified text
if testSQL, ok := val.(string); ok && testSQL == node.Node.OriginalText() {
optimizeCnt++
if optimizeCnt > 1 {
failpoint.Return(nil, nil, 0, errors.New("gofail wrong optimizerCnt error"))
}
}
})
failpoint.Inject("mockHighLoadForOptimize", func() {
sqlPrefixes := []string{"select"}
topsql.MockHighCPULoad(sctx.GetSessionVars().StmtCtx.OriginalSQL, sqlPrefixes, 10)
})
sessVars := sctx.GetSessionVars()
var (
beginOpt time.Time
optimizeStarted bool
)
defer func() {
if optimizeStarted {
sessVars.DurationOptimizer.Total = time.Since(beginOpt)
}
}()
// Build the logical plan from the raw AST. The hint processor only keeps
// AST-derived metadata; per-build state is allocated inside PlanBuilder.
hintProcessor := hint.NewQBHintHandler(sctx.GetSessionVars().StmtCtx)
node.Node.Accept(hintProcessor)
// build multi logical plan from raw AST.
var (
needRestoreLogicalPlanCtx = sessVars.EnableAlternativeLogicalPlans
bestCost = math.MaxFloat64
bestPlan base.PhysicalPlan
bestNames types.NameSlice
bestLogicalPlanCtx logicalPlanBuildCtx
checked bool
)
var initialLogicalPlanCtx logicalPlanBuildCtx
if needRestoreLogicalPlanCtx {
initialLogicalPlanCtx = saveLogicalPlanBuildCtx(sessVars)
sessVars.StmtCtx.ResetAlternativeLogicalPlanSignals()
}
p, names, nonLogical, err := buildAndOptimizeLogicalPlanRound(
ctx,
sctx,
node,
is,
hintProcessor,
&checked,
&optimizeStarted,
&beginOpt,
needRestoreLogicalPlanCtx,
&bestPlan,
&bestNames,
&bestCost,
&bestLogicalPlanCtx,
nil,
)
if err != nil {
return nil, nil, 0, err
}
if nonLogical {
// keep compatible with the old.
return p, names, 0, nil
}
// Pre-compute which rounds are enabled based on the signals from the first
// (default) build. This prevents signal leakage: alternative rounds rebuild
// the plan and may set AlternativeLogicalPlan* signals as a side effect,
// which are not reset by restoreLogicalPlanBuildCtx. Evaluating enabled()
// upfront ensures each round's eligibility is determined solely by the
// original build's signals.
enabledRounds := make([]alternativeRound, 0, len(alternativeRounds))
for _, round := range alternativeRounds {
if round.enabled(sessVars) {
enabledRounds = append(enabledRounds, round)
}
}
for _, round := range enabledRounds {
restoreLogicalPlanBuildCtx(sessVars, initialLogicalPlanCtx)
failpoint.Inject("failIfAlternativeLogicalPlanRoundTriggered", func(val failpoint.Value) {
if testSQL, ok := val.(string); ok && testSQL == node.Node.OriginalText() {
failpoint.Return(nil, nil, 0, errors.New("unexpected alternative logical plan round"))
}
})
// Use a closure so that defer-based cleanup runs at the end of each
// iteration, not at function exit. This ensures session state (e.g.
// EnableCorrelateSubquery) is restored even if the round panics.
func() {
if round.setup != nil {
round.setup(sessVars)
defer round.cleanup(sessVars)
}
p, names, nonLogical, err = buildAndOptimizeLogicalPlanRound(
ctx,
sctx,
node,
is,
hintProcessor,
&checked,
&optimizeStarted,
&beginOpt,
needRestoreLogicalPlanCtx,
&bestPlan,
&bestNames,
&bestCost,
&bestLogicalPlanCtx,
round.adjustFlag,
)
}()
if err != nil {
// Alternative rounds are optional optimizations. If one fails,
// log and continue — the first round's plan is still valid.
logutil.BgLogger().Warn("alternative logical plan round failed",
zap.String("round", round.name),
zap.Error(err))
continue
}
if nonLogical {
return p, names, 0, nil
}
}
if bestPlan == nil {
return nil, nil, 0, errors.New("failed to build logical plan")
}
if needRestoreLogicalPlanCtx {
restoreLogicalPlanBuildCtx(sessVars, bestLogicalPlanCtx)
}
return bestPlan, bestNames, bestCost, nil
}
// OptimizeExecStmt to handle the "execute" statement
func OptimizeExecStmt(ctx context.Context, sctx sessionctx.Context,
execAst *resolve.NodeW, is infoschema.InfoSchema) (base.Plan, types.NameSlice, error) {
builder := planBuilderPool.Get().(*core.PlanBuilder)
defer planBuilderPool.Put(builder.ResetForReuse())
pctx := sctx.GetPlanCtx()
builder.Init(pctx, is, nil)
p, err := buildLogicalPlan(ctx, pctx, execAst, builder)
if err != nil {
return nil, nil, err
}
exec, ok := p.(*core.Execute)
if !ok {
return nil, nil, errors.Errorf("invalid result plan type, should be Execute")
}
plan, names, err := core.GetPlanFromPlanCache(ctx, sctx, false, is, exec.PrepStmt, exec.Params)
if err != nil {
return nil, nil, err
}
exec.Plan = plan
exec.SetOutputNames(names)
exec.Stmt = exec.PrepStmt.PreparedAst.Stmt
return exec, names, nil
}
func buildLogicalPlan(ctx context.Context, sctx planctx.PlanContext, node *resolve.NodeW, builder *core.PlanBuilder) (base.Plan, error) {
sctx.GetSessionVars().PlanID.Store(0)
sctx.GetSessionVars().PlanColumnID.Store(0)
sctx.GetSessionVars().MapScalarSubQ = nil
sctx.GetSessionVars().MapHashCode2UniqueID4ExtendedCol = nil
failpoint.Inject("mockRandomPlanID", func() {
sctx.GetSessionVars().PlanID.Store(rand.Int31n(1000)) // nolint:gosec
})
// reset fields about rewrite
sctx.GetSessionVars().RewritePhaseInfo.Reset()
beginRewrite := time.Now()
p, err := builder.Build(ctx, node)
if err != nil {
return nil, err
}
sctx.GetSessionVars().RewritePhaseInfo.DurationRewrite = time.Since(beginRewrite)
if exec, ok := p.(*core.Execute); ok && exec.PrepStmt != nil {
sctx.GetSessionVars().StmtCtx.Tables = core.GetDBTableInfo(exec.PrepStmt.VisitInfos)
} else {
sctx.GetSessionVars().StmtCtx.Tables = core.GetDBTableInfo(builder.GetVisitInfo())
}
return p, nil
}
// filterRestrictedHints returns hints with strict-SEM-forbidden entries
// stripped and a warning per strip. When strict is off it returns the input
// slice unchanged.
func filterRestrictedHints(hints []*ast.TableOptimizerHint) ([]*ast.TableOptimizerHint, []error) {
if !semv2.IsStrictEnabled() || len(hints) == 0 {
return hints, nil
}
filtered := make([]*ast.TableOptimizerHint, 0, len(hints))
var warns []error
for _, h := range hints {
if err := semv2.IsRestrictedHint(h.HintName.L); err != nil {
warns = append(warns, err)
continue
}
filtered = append(filtered, h)
}
return filtered, warns
}
// setVarHintChecker checks whether the variable name in set_var hint is valid.
func setVarHintChecker(varName, hint string) (ok bool, warning error) {
sysVar := variable.GetSysVar(varName)
if sysVar == nil { // no such a variable
return false, plannererrors.ErrUnresolvedHintName.FastGenByArgs(varName, hint)
}
if !sysVar.IsHintUpdatableVerified {
warning = plannererrors.ErrNotHintUpdatable.FastGenByArgs(varName)
}
return true, warning
}
func hypoIndexChecker(ctx context.Context, is infoschema.InfoSchema) func(db, tbl, col ast.CIStr) (colOffset int, err error) {
return func(db, tbl, col ast.CIStr) (colOffset int, err error) {
t, err := is.TableByName(ctx, db, tbl)
if err != nil {
return 0, errors.NewNoStackErrorf("table '%v.%v' doesn't exist", db, tbl)
}
for i, tblCol := range t.Cols() {
if tblCol.Name.L == col.L {
return i, nil
}
}
return 0, errors.NewNoStackErrorf("can't find column %v in table %v.%v", col, db, tbl)
}
}
// queryPlanCost returns the plan cost of this node, which is mainly for the Index Advisor.
func queryPlanCost(sctx sessionctx.Context, stmt ast.StmtNode) (float64, error) {
nodeW := resolve.NewNodeW(stmt)
plan, _, err := Optimize(context.Background(), sctx, nodeW, sctx.GetLatestInfoSchema().(infoschema.InfoSchema))
if err != nil {
return 0, err
}
pp, ok := plan.(base.PhysicalPlan)
if !ok {
return 0, errors.Errorf("plan is not a physical plan: %T", plan)
}
return core.GetPlanCost(pp, property.RootTaskType, costusage.NewDefaultPlanCostOption())
}
func calculatePlanDigestFunc(sctx sessionctx.Context, stmt ast.StmtNode) (planDigest string, err error) {
ret := &core.PreprocessorReturn{}
nodeW := resolve.NewNodeW(stmt)
err = core.Preprocess(
context.Background(),
sctx,
nodeW,
core.WithPreprocessorReturn(ret),
core.InitTxnContextProvider,
)
if err != nil {
return "", err
}
p, _, err := Optimize(context.Background(), sctx, nodeW, sctx.GetLatestInfoSchema().(infoschema.InfoSchema))
if err != nil {
return "", err
}
flat := core.FlattenPhysicalPlan(p, false)
_, digest := core.NormalizeFlatPlan(flat)
return digest.String(), nil
}
func recordRelevantOptVarsAndFixes(sctx sessionctx.Context, stmt ast.StmtNode) (varNames []string, fixIDs []uint64, err error) {
sctx.GetSessionVars().ResetRelevantOptVarsAndFixes(true)
defer sctx.GetSessionVars().ResetRelevantOptVarsAndFixes(false)
ret := &core.PreprocessorReturn{}
nodeW := resolve.NewNodeW(stmt)
err = core.Preprocess(
context.Background(),
sctx,
nodeW,
core.WithPreprocessorReturn(ret),
core.InitTxnContextProvider,
)
if err != nil {
return nil, nil, err
}
_, _, err = Optimize(context.Background(), sctx, nodeW, sctx.GetLatestInfoSchema().(infoschema.InfoSchema))
if err != nil {
return nil, nil, err
}
for varName := range sctx.GetSessionVars().RelevantOptVars {
varNames = append(varNames, varName)
}
sort.Strings(varNames)
for fixID := range sctx.GetSessionVars().RelevantOptFixes {
fixIDs = append(fixIDs, fixID)
}
sort.Slice(fixIDs, func(i, j int) bool {
return fixIDs[i] < fixIDs[j]
})
return
}
func genBriefPlanWithSCtx(sctx sessionctx.Context, stmt ast.StmtNode) (planDigest, planHintStr string, planText [][]string, err error) {
ret := &core.PreprocessorReturn{}
nodeW := resolve.NewNodeW(stmt)
if err = core.Preprocess(context.Background(), sctx, nodeW,
core.WithPreprocessorReturn(ret), core.InitTxnContextProvider,
); err != nil {
return "", "", nil, err
}
p, _, err := Optimize(context.Background(), sctx, nodeW, sctx.GetLatestInfoSchema().(infoschema.InfoSchema))
if err != nil {
return "", "", nil, err
}
flat := core.FlattenPhysicalPlan(p, false)
_, digest := core.NormalizeFlatPlan(flat)
sctx.GetSessionVars().StmtCtx.IgnoreExplainIDSuffix = true // ignore operatorID to make the output simpler
plan := core.ExplainFlatPlanInRowFormat(flat, types.ExplainFormatBrief, false, nil)
hints := core.GenHintsFromFlatPlan(flat)
return digest.String(), hint.RestoreOptimizerHints(hints), plan, nil
}
func planIDFunc(plan any) (planID int, ok bool) {
if p, ok := plan.(base.Plan); ok {
return p.ID(), true
}
return 0, false
}
func init() {
core.OptimizeAstNode = optimizeCache
core.OptimizeAstNodeNoCache = optimizeNoCache
indexadvisor.QueryPlanCostHook = queryPlanCost
bindinfo.GetBindingHandle = func(sctx sessionctx.Context) bindinfo.BindingHandle {
dom := domain.GetDomain(sctx)
if dom == nil {
return nil
}
return dom.BindingHandle()
}
bindinfo.CalculatePlanDigest = calculatePlanDigestFunc
bindinfo.RecordRelevantOptVarsAndFixes = recordRelevantOptVarsAndFixes
bindinfo.GenBriefPlanWithSCtx = genBriefPlanWithSCtx
stmtctx.PlanIDFunc = planIDFunc
}