forked from dolthub/go-mysql-server
/
ddl.go
860 lines (743 loc) · 22.4 KB
/
ddl.go
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
// Copyright 2020-2021 Dolthub, 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 plan
import (
"fmt"
"strings"
"github.com/gabereiser/go-mysql-server/sql/mysql_db"
"github.com/gabereiser/go-mysql-server/sql/types"
"github.com/gabereiser/go-mysql-server/sql"
"github.com/gabereiser/go-mysql-server/sql/expression"
)
type IfNotExistsOption bool
const (
IfNotExists IfNotExistsOption = true
IfNotExistsAbsent IfNotExistsOption = false
)
type TempTableOption bool
const (
IsTempTable TempTableOption = true
IsTempTableAbsent TempTableOption = false
)
// Ddl nodes have a reference to a database, but no children and a nil schema.
type ddlNode struct {
db sql.Database
}
// Resolved implements the Resolvable interface.
func (c *ddlNode) Resolved() bool {
_, ok := c.db.(sql.UnresolvedDatabase)
return !ok
}
// Database implements the sql.Databaser interface.
func (c *ddlNode) Database() sql.Database {
return c.db
}
// Schema implements the Node interface.
func (*ddlNode) Schema() sql.Schema {
return types.OkResultSchema
}
// Children implements the Node interface.
func (c *ddlNode) Children() []sql.Node { return nil }
type IndexDefinition struct {
IndexName string
Using sql.IndexUsing
Constraint sql.IndexConstraint
Columns []sql.IndexColumn
Comment string
}
func (i *IndexDefinition) String() string {
return i.IndexName
}
// ColumnNames returns each column's name without the length property.
func (i *IndexDefinition) ColumnNames() []string {
colNames := make([]string, len(i.Columns))
for i, col := range i.Columns {
colNames[i] = col.Name
}
return colNames
}
// TableSpec is a node describing the schema of a table.
type TableSpec struct {
Schema sql.PrimaryKeySchema
FkDefs []*sql.ForeignKeyConstraint
ChDefs []*sql.CheckConstraint
IdxDefs []*IndexDefinition
Collation sql.CollationID
}
func (c *TableSpec) WithSchema(schema sql.PrimaryKeySchema) *TableSpec {
nc := *c
nc.Schema = schema
return &nc
}
func (c *TableSpec) WithForeignKeys(fkDefs []*sql.ForeignKeyConstraint) *TableSpec {
nc := *c
nc.FkDefs = fkDefs
return &nc
}
func (c *TableSpec) WithCheckConstraints(chDefs []*sql.CheckConstraint) *TableSpec {
nc := *c
nc.ChDefs = chDefs
return &nc
}
func (c *TableSpec) WithIndices(idxDefs []*IndexDefinition) *TableSpec {
nc := *c
nc.IdxDefs = idxDefs
return &nc
}
// CreateTable is a node describing the creation of some table.
type CreateTable struct {
ddlNode
name string
CreateSchema sql.PrimaryKeySchema
ifNotExists IfNotExistsOption
fkDefs []*sql.ForeignKeyConstraint
fkParentTbls []sql.ForeignKeyTable
chDefs sql.CheckConstraints
idxDefs []*IndexDefinition
collation sql.CollationID
like sql.Node
temporary TempTableOption
selectNode sql.Node
}
var _ sql.Databaser = (*CreateTable)(nil)
var _ sql.Node = (*CreateTable)(nil)
var _ sql.Expressioner = (*CreateTable)(nil)
var _ sql.SchemaTarget = (*CreateTable)(nil)
// NewCreateTable creates a new CreateTable node
func NewCreateTable(db sql.Database, name string, ifn IfNotExistsOption, temp TempTableOption, tableSpec *TableSpec) *CreateTable {
for _, s := range tableSpec.Schema.Schema {
s.Source = name
}
return &CreateTable{
ddlNode: ddlNode{db},
name: name,
CreateSchema: tableSpec.Schema,
fkDefs: tableSpec.FkDefs,
chDefs: tableSpec.ChDefs,
idxDefs: tableSpec.IdxDefs,
collation: tableSpec.Collation,
ifNotExists: ifn,
temporary: temp,
}
}
// NewCreateTableLike creates a new CreateTable node for CREATE TABLE LIKE statements
func NewCreateTableLike(db sql.Database, name string, likeTable sql.Node, ifn IfNotExistsOption, temp TempTableOption) *CreateTable {
return &CreateTable{
ddlNode: ddlNode{db},
name: name,
ifNotExists: ifn,
like: likeTable,
temporary: temp,
}
}
// NewCreateTableSelect create a new CreateTable node for CREATE TABLE [AS] SELECT
func NewCreateTableSelect(db sql.Database, name string, selectNode sql.Node, tableSpec *TableSpec, ifn IfNotExistsOption, temp TempTableOption) *CreateTable {
for _, s := range tableSpec.Schema.Schema {
s.Source = name
}
return &CreateTable{
ddlNode: ddlNode{db: db},
CreateSchema: tableSpec.Schema,
fkDefs: tableSpec.FkDefs,
chDefs: tableSpec.ChDefs,
idxDefs: tableSpec.IdxDefs,
name: name,
selectNode: selectNode,
ifNotExists: ifn,
temporary: temp,
}
}
// WithTargetSchema implements the sql.TargetSchema interface.
func (c *CreateTable) WithTargetSchema(schema sql.Schema) (sql.Node, error) {
return nil, fmt.Errorf("unable to set target schema without primary key info")
}
// TargetSchema implements the sql.TargetSchema interface.
func (c *CreateTable) TargetSchema() sql.Schema {
return c.CreateSchema.Schema
}
// WithDatabase implements the sql.Databaser interface.
func (c *CreateTable) WithDatabase(db sql.Database) (sql.Node, error) {
nc := *c
nc.db = db
return &nc, nil
}
// Schema implements the sql.Node interface.
func (c *CreateTable) Schema() sql.Schema {
return types.OkResultSchema
}
func (c *CreateTable) PkSchema() sql.PrimaryKeySchema {
return c.CreateSchema
}
// Resolved implements the Resolvable interface.
func (c *CreateTable) Resolved() bool {
if !c.ddlNode.Resolved() {
return false
}
for _, col := range c.CreateSchema.Schema {
if !col.Default.Resolved() {
return false
}
}
for _, chDef := range c.chDefs {
if !chDef.Expr.Resolved() {
return false
}
}
if c.like != nil {
if !c.like.Resolved() {
return false
}
}
return true
}
// RowIter implements the Node interface.
func (c *CreateTable) RowIter(ctx *sql.Context, row sql.Row) (sql.RowIter, error) {
var err error
var vd sql.ViewDatabase
// If it's set to Invalid, then no collation has been explicitly defined
if c.collation == sql.Collation_Unspecified {
c.collation = GetDatabaseCollation(ctx, c.db)
// Need to set each type's collation to the correct type as well
for _, col := range c.CreateSchema.Schema {
if collatedType, ok := col.Type.(sql.TypeWithCollation); ok && collatedType.Collation() == sql.Collation_Unspecified {
col.Type, err = collatedType.WithNewCollation(c.collation)
if err != nil {
return nil, err
}
}
}
}
err = c.validateDefaultPosition()
if err != nil {
return sql.RowsToRowIter(), err
}
maybePrivDb := c.db
if privDb, ok := maybePrivDb.(mysql_db.PrivilegedDatabase); ok {
maybePrivDb = privDb.Unwrap()
}
if c.temporary == IsTempTable {
creatable, ok := maybePrivDb.(sql.TemporaryTableCreator)
if !ok {
return sql.RowsToRowIter(), sql.ErrTemporaryTableNotSupported.New()
}
err = creatable.CreateTemporaryTable(ctx, c.name, c.CreateSchema, c.collation)
} else {
switch creatable := maybePrivDb.(type) {
case sql.IndexedTableCreator:
var pkIdxDef sql.IndexDef
var hasPkIdxDef bool
for _, idxDef := range c.idxDefs {
if idxDef.Constraint == sql.IndexConstraint_Primary {
hasPkIdxDef = true
pkIdxDef = sql.IndexDef{
Name: idxDef.IndexName,
Columns: idxDef.Columns,
Constraint: idxDef.Constraint,
Storage: idxDef.Using,
Comment: idxDef.Comment,
}
}
}
if hasPkIdxDef {
err = creatable.CreateIndexedTable(ctx, c.name, c.CreateSchema, pkIdxDef, c.collation)
if sql.ErrUnsupportedIndexPrefix.Is(err) {
return sql.RowsToRowIter(), err
}
} else {
creatable, ok := maybePrivDb.(sql.TableCreator)
if !ok {
return sql.RowsToRowIter(), sql.ErrCreateTableNotSupported.New(c.db.Name())
}
err = creatable.CreateTable(ctx, c.name, c.CreateSchema, c.collation)
}
case sql.TableCreator:
err = creatable.CreateTable(ctx, c.name, c.CreateSchema, c.collation)
default:
return sql.RowsToRowIter(), sql.ErrCreateTableNotSupported.New(c.db.Name())
}
}
if err != nil && !(sql.ErrTableAlreadyExists.Is(err) && (c.ifNotExists == IfNotExists)) {
return sql.RowsToRowIter(), err
}
vd, _ = maybePrivDb.(sql.ViewDatabase)
if vd != nil {
_, ok, err := vd.GetViewDefinition(ctx, c.name)
if err != nil {
return nil, err
}
if ok {
return nil, sql.ErrTableAlreadyExists.New(c.name)
}
}
//TODO: in the event that foreign keys or indexes aren't supported, you'll be left with a created table and no foreign keys/indexes
//this also means that if a foreign key or index fails, you'll only have what was declared up to the failure
tableNode, ok, err := c.db.GetTableInsensitive(ctx, c.name)
if err != nil {
return sql.RowsToRowIter(), err
}
if !ok {
return sql.RowsToRowIter(), sql.ErrTableCreatedNotFound.New()
}
var nonPrimaryIdxes []*IndexDefinition
for _, def := range c.idxDefs {
if def.Constraint != sql.IndexConstraint_Primary {
nonPrimaryIdxes = append(nonPrimaryIdxes, def)
}
}
if len(nonPrimaryIdxes) > 0 {
err = c.createIndexes(ctx, tableNode, nonPrimaryIdxes)
if err != nil {
return sql.RowsToRowIter(), err
}
}
if len(c.fkDefs) > 0 {
err = c.createForeignKeys(ctx, tableNode)
if err != nil {
return sql.RowsToRowIter(), err
}
}
if len(c.chDefs) > 0 {
err = c.createChecks(ctx, tableNode)
if err != nil {
return sql.RowsToRowIter(), err
}
}
return sql.RowsToRowIter(sql.NewRow(types.NewOkResult(0))), nil
}
// ForeignKeys returns any foreign keys that will be declared on this table.
func (c *CreateTable) ForeignKeys() []*sql.ForeignKeyConstraint {
return c.fkDefs
}
// WithParentForeignKeyTables adds the tables that are referenced in each foreign key. The table indices is assumed
// to match the foreign key indices in their respective slices.
func (c *CreateTable) WithParentForeignKeyTables(refTbls []sql.ForeignKeyTable) (*CreateTable, error) {
if len(c.fkDefs) != len(refTbls) {
return nil, fmt.Errorf("table `%s` defines `%d` foreign keys but found `%d` referenced tables",
c.name, len(c.fkDefs), len(refTbls))
}
nc := *c
nc.fkParentTbls = refTbls
return &nc, nil
}
func (c *CreateTable) createIndexes(ctx *sql.Context, tableNode sql.Table, idxes []*IndexDefinition) error {
idxAlterable, ok := tableNode.(sql.IndexAlterableTable)
if !ok {
return ErrNotIndexable.New()
}
indexMap := make(map[string]struct{})
for _, idxDef := range idxes {
indexName := idxDef.IndexName
// If the name is empty, we create a new name using the columns provided while appending an ascending integer
// until we get a non-colliding name if the original name (or each preceding name) already exists.
if indexName == "" {
indexName = strings.Join(idxDef.ColumnNames(), "")
if _, ok = indexMap[strings.ToLower(indexName)]; ok {
for i := 0; true; i++ {
newIndexName := fmt.Sprintf("%s_%d", indexName, i)
if _, ok = indexMap[strings.ToLower(newIndexName)]; !ok {
indexName = newIndexName
break
}
}
}
} else if _, ok = indexMap[strings.ToLower(idxDef.IndexName)]; ok {
return sql.ErrIndexIDAlreadyRegistered.New(idxDef.IndexName)
}
err := idxAlterable.CreateIndex(ctx, sql.IndexDef{
Name: indexName,
Columns: idxDef.Columns,
Constraint: idxDef.Constraint,
Storage: idxDef.Using,
Comment: idxDef.Comment,
})
if err != nil {
return err
}
indexMap[strings.ToLower(indexName)] = struct{}{}
}
return nil
}
func (c *CreateTable) createForeignKeys(ctx *sql.Context, tableNode sql.Table) error {
fkTbl, ok := tableNode.(sql.ForeignKeyTable)
if !ok {
return sql.ErrNoForeignKeySupport.New(c.name)
}
fkChecks, err := ctx.GetSessionVariable(ctx, "foreign_key_checks")
if err != nil {
return err
}
for i, fkDef := range c.fkDefs {
if fkDef.OnUpdate == sql.ForeignKeyReferentialAction_SetDefault || fkDef.OnDelete == sql.ForeignKeyReferentialAction_SetDefault {
return sql.ErrForeignKeySetDefault.New()
}
if fkChecks.(int8) == 1 {
fkParentTbl := c.fkParentTbls[i]
// If a foreign key is self-referential then the analyzer uses a nil since the table does not yet exist
if fkParentTbl == nil {
fkParentTbl = fkTbl
}
// If foreign_key_checks are true, then the referenced tables will be populated
err = ResolveForeignKey(ctx, fkTbl, fkParentTbl, *fkDef, true, true)
if err != nil {
return err
}
} else {
// If foreign_key_checks are true, then the referenced tables will be populated
err = ResolveForeignKey(ctx, fkTbl, nil, *fkDef, true, false)
if err != nil {
return err
}
}
}
return nil
}
func (c *CreateTable) createChecks(ctx *sql.Context, tableNode sql.Table) error {
chAlterable, ok := tableNode.(sql.CheckAlterableTable)
if !ok {
return ErrNoCheckConstraintSupport.New(c.name)
}
for _, ch := range c.chDefs {
check, err := NewCheckDefinition(ctx, ch)
if err != nil {
return err
}
err = chAlterable.CreateCheck(ctx, check)
if err != nil {
return err
}
}
return nil
}
// Children implements the Node interface.
func (c *CreateTable) Children() []sql.Node {
if c.like != nil {
return []sql.Node{c.like}
} else if c.selectNode != nil {
return []sql.Node{c.selectNode}
}
return nil
}
// WithChildren implements the Node interface.
func (c CreateTable) WithChildren(children ...sql.Node) (sql.Node, error) {
if len(children) == 0 {
return &c, nil
} else if len(children) == 1 {
child := children[0]
if c.like != nil {
c.like = child
} else {
c.selectNode = child
}
return &c, nil
} else {
return nil, sql.ErrInvalidChildrenNumber.New(c, len(children), 1)
}
}
// CheckPrivileges implements the interface sql.Node.
func (c *CreateTable) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
if c.temporary == IsTempTable {
return opChecker.UserHasPrivileges(ctx,
sql.NewPrivilegedOperation(c.db.Name(), "", "", sql.PrivilegeType_CreateTempTable))
} else {
return opChecker.UserHasPrivileges(ctx,
sql.NewPrivilegedOperation(c.db.Name(), "", "", sql.PrivilegeType_Create))
}
}
func (c *CreateTable) String() string {
ifNotExists := ""
if c.ifNotExists {
ifNotExists = "if not exists "
}
return fmt.Sprintf("Create table %s%s", ifNotExists, c.name)
}
func (c *CreateTable) DebugString() string {
ifNotExists := ""
if c.ifNotExists {
ifNotExists = "if not exists "
}
p := sql.NewTreePrinter()
if c.selectNode != nil {
p.WriteNode("Create table %s%s as", ifNotExists, c.name)
p.WriteChildren(sql.DebugString(c.selectNode))
return p.String()
}
p.WriteNode("Create table %s%s", ifNotExists, c.name)
var children []string
children = append(children, c.schemaDebugString())
if len(c.fkDefs) > 0 {
children = append(children, c.foreignKeysDebugString())
}
if len(c.idxDefs) > 0 {
children = append(children, c.indexesDebugString())
}
if len(c.chDefs) > 0 {
children = append(children, c.checkConstraintsDebugString())
}
p.WriteChildren(children...)
return p.String()
}
func (c *CreateTable) foreignKeysDebugString() string {
p := sql.NewTreePrinter()
p.WriteNode("ForeignKeys")
var children []string
for _, def := range c.fkDefs {
children = append(children, sql.DebugString(def))
}
p.WriteChildren(children...)
return p.String()
}
func (c *CreateTable) indexesDebugString() string {
p := sql.NewTreePrinter()
p.WriteNode("Indexes")
var children []string
for _, def := range c.idxDefs {
children = append(children, sql.DebugString(def))
}
p.WriteChildren(children...)
return p.String()
}
func (c *CreateTable) checkConstraintsDebugString() string {
p := sql.NewTreePrinter()
p.WriteNode("CheckConstraints")
var children []string
for _, def := range c.chDefs {
children = append(children, sql.DebugString(def))
}
p.WriteChildren(children...)
return p.String()
}
func (c *CreateTable) schemaDebugString() string {
p := sql.NewTreePrinter()
p.WriteNode("Columns")
var children []string
for _, col := range c.CreateSchema.Schema {
children = append(children, sql.DebugString(col))
}
p.WriteChildren(children...)
return p.String()
}
func (c *CreateTable) Expressions() []sql.Expression {
exprs := make([]sql.Expression, len(c.CreateSchema.Schema)+len(c.chDefs))
i := 0
for _, col := range c.CreateSchema.Schema {
exprs[i] = expression.WrapExpression(col.Default)
i++
}
for _, ch := range c.chDefs {
exprs[i] = ch.Expr
i++
}
return exprs
}
func (c *CreateTable) Like() sql.Node {
return c.like
}
func (c *CreateTable) Select() sql.Node {
return c.selectNode
}
func (c *CreateTable) TableSpec() *TableSpec {
tableSpec := TableSpec{}
ret := tableSpec.WithSchema(c.CreateSchema)
ret = ret.WithForeignKeys(c.fkDefs)
ret = ret.WithIndices(c.idxDefs)
ret = ret.WithCheckConstraints(c.chDefs)
ret.Collation = c.collation
return ret
}
func (c *CreateTable) Name() string {
return c.name
}
func (c *CreateTable) IfNotExists() IfNotExistsOption {
return c.ifNotExists
}
func (c *CreateTable) Temporary() TempTableOption {
return c.temporary
}
func (c CreateTable) WithExpressions(exprs ...sql.Expression) (sql.Node, error) {
length := len(c.CreateSchema.Schema) + len(c.chDefs)
if len(exprs) != length {
return nil, sql.ErrInvalidChildrenNumber.New(c, len(exprs), length)
}
nc := c
// Make sure to make a deep copy of any slices here so we aren't modifying the original pointer
ns := c.CreateSchema.Schema.Copy()
i := 0
for ; i < len(c.CreateSchema.Schema); i++ {
unwrappedColDefVal, ok := exprs[i].(*expression.Wrapper).Unwrap().(*sql.ColumnDefaultValue)
if ok {
ns[i].Default = unwrappedColDefVal
} else { // nil fails type check
ns[i].Default = nil
}
}
nc.CreateSchema = sql.NewPrimaryKeySchema(ns, c.CreateSchema.PkOrdinals...)
ncd, err := c.chDefs.FromExpressions(exprs[i:])
if err != nil {
return nil, err
}
nc.chDefs = ncd
return &nc, nil
}
func (c *CreateTable) validateDefaultPosition() error {
colsAfterThis := make(map[string]*sql.Column)
for i := len(c.CreateSchema.Schema) - 1; i >= 0; i-- {
col := c.CreateSchema.Schema[i]
colsAfterThis[col.Name] = col
if err := inspectDefaultForInvalidColumns(col, colsAfterThis); err != nil {
return err
}
}
return nil
}
// DropTable is a node describing dropping one or more tables
type DropTable struct {
Tables []sql.Node
ifExists bool
triggerNames []string
}
var _ sql.Node = (*DropTable)(nil)
// NewDropTable creates a new DropTable node
func NewDropTable(tbls []sql.Node, ifExists bool) *DropTable {
return &DropTable{
Tables: tbls,
ifExists: ifExists,
}
}
// WithTriggers returns this node but with the given triggers.
func (d *DropTable) WithTriggers(triggers []string) sql.Node {
nd := *d
nd.triggerNames = triggers
return &nd
}
// TableNames returns the names of the tables to drop.
func (d *DropTable) TableNames() ([]string, error) {
tblNames := make([]string, len(d.Tables))
for i, t := range d.Tables {
// either *ResolvedTable OR *UnresolvedTable here
if uTable, ok := t.(*UnresolvedTable); ok {
tblNames[i] = uTable.Name()
} else if rTable, ok := t.(*ResolvedTable); ok {
tblNames[i] = rTable.Name()
} else {
return []string{}, sql.ErrInvalidType.New(t)
}
}
return tblNames, nil
}
// IfExists returns ifExists variable.
func (d *DropTable) IfExists() bool {
return d.ifExists
}
// RowIter implements the Node interface.
func (d *DropTable) RowIter(ctx *sql.Context, row sql.Row) (sql.RowIter, error) {
var err error
var curdb sql.Database
for _, table := range d.Tables {
tbl := table.(*ResolvedTable)
curdb = tbl.Database
droppable := tbl.Database.(sql.TableDropper)
if fkTable, err := getForeignKeyTable(tbl); err == nil {
fkChecks, err := ctx.GetSessionVariable(ctx, "foreign_key_checks")
if err != nil {
return nil, err
}
if fkChecks.(int8) == 1 {
parentFks, err := fkTable.GetReferencedForeignKeys(ctx)
if err != nil {
return nil, err
}
if len(parentFks) > 0 {
return nil, sql.ErrForeignKeyDropTable.New(fkTable.Name(), parentFks[0].Name)
}
}
fks, err := fkTable.GetDeclaredForeignKeys(ctx)
if err != nil {
return nil, err
}
for _, fk := range fks {
if err = fkTable.DropForeignKey(ctx, fk.Name); err != nil {
return nil, err
}
}
}
err = droppable.DropTable(ctx, tbl.Name())
if err != nil {
return nil, err
}
}
if len(d.triggerNames) > 0 {
triggerDb, ok := curdb.(sql.TriggerDatabase)
if !ok {
tblNames, _ := d.TableNames()
return nil, fmt.Errorf(`tables %v are referenced in triggers %v, but database does not support triggers`, tblNames, d.triggerNames)
}
//TODO: if dropping any triggers fail, then we'll be left in a state where triggers exist for a table that was dropped
for _, trigger := range d.triggerNames {
err = triggerDb.DropTrigger(ctx, trigger)
if err != nil {
return nil, err
}
}
}
return sql.RowsToRowIter(sql.NewRow(types.NewOkResult(0))), nil
}
// Children implements the Node interface.
func (d *DropTable) Children() []sql.Node {
return d.Tables
}
// Resolved implements the sql.Expression interface.
func (d *DropTable) Resolved() bool {
for _, table := range d.Tables {
if !table.Resolved() {
return false
}
}
return true
}
// Schema implements the sql.Expression interface.
func (d *DropTable) Schema() sql.Schema {
return types.OkResultSchema
}
// WithChildren implements the Node interface.
func (d *DropTable) WithChildren(children ...sql.Node) (sql.Node, error) {
// Number of children can be smaller than original as the non-existent
// tables get filtered out in some cases
var newChildren = make([]sql.Node, len(children))
for i, child := range children {
newChildren[i] = child
}
nd := *d
nd.Tables = newChildren
return &nd, nil
}
// CheckPrivileges implements the interface sql.Node.
func (d *DropTable) CheckPrivileges(ctx *sql.Context, opChecker sql.PrivilegedOperationChecker) bool {
for _, tbl := range d.Tables {
if !opChecker.UserHasPrivileges(ctx,
sql.NewPrivilegedOperation(GetDatabaseName(tbl), getTableName(tbl), "", sql.PrivilegeType_Drop)) {
return false
}
}
return true
}
// String implements the sql.Node interface.
func (d *DropTable) String() string {
ifExists := ""
tblNames, _ := d.TableNames()
names := strings.Join(tblNames, ", ")
if d.ifExists {
ifExists = "if exists "
}
return fmt.Sprintf("Drop table %s%s", ifExists, names)
}