/
table_def.go
151 lines (145 loc) · 4.7 KB
/
table_def.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
// Copyright 2023 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 ast
import (
"fmt"
"sort"
vitess "github.com/dolthub/vitess/go/vt/sqlparser"
"github.com/dolthub/doltgresql/postgres/parser/sem/tree"
"github.com/dolthub/doltgresql/utils"
)
// assignTableDef handles tree.TableDef nodes for *vitess.DDL targets. Some table defs, such as indexes, affect other
// defs, such as columns, and they're therefore dependent on columns being handled first. It is up to the caller to
// ensure that all defs have been ordered properly before calling. assignTableDefs handles the sort for you, so this
// notice is only relevant when individually calling assignTableDef.
func assignTableDef(node tree.TableDef, target *vitess.DDL) error {
switch node := node.(type) {
case *tree.CheckConstraintTableDef:
if target.TableSpec == nil {
target.TableSpec = &vitess.TableSpec{}
}
expr, err := nodeExpr(node.Expr)
if err != nil {
return err
}
target.TableSpec.Constraints = append(target.TableSpec.Constraints, &vitess.ConstraintDefinition{
Name: string(node.Name),
Details: &vitess.CheckConstraintDefinition{
Expr: expr,
Enforced: true,
},
})
return nil
case *tree.ColumnTableDef:
if target.TableSpec == nil {
target.TableSpec = &vitess.TableSpec{}
}
columnDef, err := nodeColumnTableDef(node)
if err != nil {
return err
}
target.TableSpec.Columns = append(target.TableSpec.Columns, columnDef)
return nil
case *tree.ForeignKeyConstraintTableDef:
if target.TableSpec == nil {
target.TableSpec = &vitess.TableSpec{}
}
fkDef, err := nodeForeignKeyConstraintTableDef(node)
if err != nil {
return err
}
target.TableSpec.Constraints = append(target.TableSpec.Constraints, &vitess.ConstraintDefinition{
Name: string(node.Name),
Details: fkDef,
})
return nil
case *tree.IndexTableDef:
if target.TableSpec == nil {
target.TableSpec = &vitess.TableSpec{}
}
indexDef, err := nodeIndexTableDef(node)
if err != nil {
return err
}
target.TableSpec.Indexes = append(target.TableSpec.Indexes, indexDef)
return nil
case *tree.LikeTableDef:
if len(node.Options) > 0 {
return fmt.Errorf("options for LIKE are not yet supported")
}
tableName, err := nodeTableName(&node.Name)
if err != nil {
return err
}
target.OptLike = &vitess.OptLike{
LikeTable: tableName,
}
return nil
case *tree.UniqueConstraintTableDef:
if target.TableSpec == nil {
target.TableSpec = &vitess.TableSpec{}
}
indexDef, err := nodeIndexTableDef(&node.IndexTableDef)
if err != nil {
return err
}
indexDef.Info.Unique = true
indexDef.Info.Primary = node.PrimaryKey
// If we're setting a primary key, then we need to make sure that all of the columns are also set to NOT NULL
if indexDef.Info.Primary {
tableColumns := utils.SliceToMapValues(target.TableSpec.Columns, func(col *vitess.ColumnDefinition) string {
return col.Name.String()
})
for _, indexedColumn := range indexDef.Columns {
if column, ok := tableColumns[indexedColumn.Column.String()]; ok {
column.Type.Null = false
column.Type.NotNull = true
}
}
}
target.TableSpec.Indexes = append(target.TableSpec.Indexes, indexDef)
return nil
case nil:
return nil
default:
return fmt.Errorf("unknown table definition encountered")
}
}
// assignTableDefs handles tree.TableDefs nodes for *vitess.DDL targets. This also sorts table defs by whether they're
// dependent on other table defs evaluating first. Some table defs, such as indexes, affect other defs, such as columns,
// and they're therefore dependent on columns being handled first.
func assignTableDefs(node tree.TableDefs, target *vitess.DDL) error {
sortedNode := make(tree.TableDefs, len(node))
copy(sortedNode, node)
sort.Slice(sortedNode, func(i, j int) bool {
var cmps [2]int
for cmpsIdx := range []tree.TableDef{sortedNode[i], sortedNode[j]} {
switch sortedNode[i].(type) {
case *tree.IndexTableDef:
cmps[cmpsIdx] = 1
case *tree.UniqueConstraintTableDef:
cmps[cmpsIdx] = 2
default:
cmps[cmpsIdx] = 0
}
}
return cmps[0] < cmps[1]
})
for i := range sortedNode {
if err := assignTableDef(sortedNode[i], target); err != nil {
return err
}
}
return nil
}