forked from cockroachdb/cockroach
/
alter_table.go
128 lines (110 loc) · 3.32 KB
/
alter_table.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
// Copyright 2015 The Cockroach Authors.
//
// 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. See the AUTHORS file
// for names of contributors.
//
// Author: Tamir Duberstein (tamird@gmail.com)
package sql
import (
"fmt"
"github.com/cockroachdb/cockroach/sql/parser"
"github.com/cockroachdb/cockroach/sql/privilege"
"github.com/cockroachdb/cockroach/util"
)
// AlterTable creates a table.
// Privileges: CREATE on table.
// notes: postgres requires CREATE on the table.
// mysql requires ALTER, CREATE, INSERT on the table.
func (p *planner) AlterTable(n *parser.AlterTable) (planNode, error) {
if err := n.Table.NormalizeTableName(p.session.Database); err != nil {
return nil, err
}
dbDesc, err := p.getDatabaseDesc(n.Table.Database())
if err != nil {
return nil, err
}
// Check if table exists.
tbKey := tableKey{dbDesc.ID, n.Table.Table()}.Key()
gr, err := p.txn.Get(tbKey)
if err != nil {
return nil, err
}
if !gr.Exists() {
if n.IfExists {
// Noop.
return &valuesNode{}, nil
}
// Key does not exist, but we want it to: error out.
return nil, fmt.Errorf("table %q does not exist", n.Table.Table())
}
tableDesc, err := p.getTableDesc(n.Table)
if err != nil {
return nil, err
}
if err := p.checkPrivilege(tableDesc, privilege.CREATE); err != nil {
return nil, err
}
nextIndexID := tableDesc.NextIndexID
for _, cmd := range n.Cmds {
switch t := cmd.(type) {
case *parser.AlterTableAddColumn:
d := t.ColumnDef
col, idx, err := makeColumnDefDescs(d)
if err != nil {
return nil, err
}
tableDesc.AddColumn(*col)
if idx != nil {
if err := tableDesc.AddIndex(*idx, d.PrimaryKey); err != nil {
return nil, err
}
}
case *parser.AlterTableAddConstraint:
switch d := t.ConstraintDef.(type) {
case *parser.UniqueConstraintTableDef:
idx := IndexDescriptor{
Name: string(d.Name),
Unique: true,
ColumnNames: d.Columns,
StoreColumnNames: d.Storing,
}
if err := tableDesc.AddIndex(idx, d.PrimaryKey); err != nil {
return nil, err
}
default:
return nil, util.Errorf("unsupported constraint: %T", t.ConstraintDef)
}
default:
return nil, util.Errorf("unsupported alter cmd: %T", cmd)
}
}
if err := tableDesc.AllocateIDs(); err != nil {
return nil, err
}
// These changed on us when we called `tableDesc.AllocateIDs()`.
var newIndexes []IndexDescriptor
for _, index := range append(tableDesc.Indexes, tableDesc.PrimaryIndex) {
if index.ID >= nextIndexID {
newIndexes = append(newIndexes, index)
}
}
b, err := p.makeBackfillBatch(n.Table, tableDesc, newIndexes...)
if err != nil {
return nil, err
}
b.Put(MakeDescMetadataKey(tableDesc.GetID()), tableDesc)
if err := p.txn.Run(&b); err != nil {
return nil, convertBatchError(tableDesc, b, err)
}
return &valuesNode{}, nil
}