-
Notifications
You must be signed in to change notification settings - Fork 3.9k
/
Copy pathcreate_index.go
170 lines (147 loc) · 5.01 KB
/
create_index.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
// Copyright 2017 The Cockroach Authors.
//
// Use of this software is governed by the Business Source License
// included in the file licenses/BSL.txt.
//
// As of the Change Date specified in that file, in accordance with
// the Business Source License, use of this software will be governed
// by the Apache License, Version 2.0, included in the file
// licenses/APL.txt.
package sql
import (
"context"
"github.com/cockroachdb/cockroach/pkg/sql/pgwire/pgcode"
"github.com/cockroachdb/cockroach/pkg/sql/pgwire/pgerror"
"github.com/cockroachdb/cockroach/pkg/sql/privilege"
"github.com/cockroachdb/cockroach/pkg/sql/sem/tree"
"github.com/cockroachdb/cockroach/pkg/sql/sqlbase"
)
type createIndexNode struct {
n *tree.CreateIndex
tableDesc *sqlbase.MutableTableDescriptor
}
// CreateIndex creates an index.
// Privileges: CREATE on table.
// notes: postgres requires CREATE on the table.
// mysql requires INDEX on the table.
func (p *planner) CreateIndex(ctx context.Context, n *tree.CreateIndex) (planNode, error) {
tableDesc, err := p.ResolveMutableTableDescriptor(
ctx, &n.Table, true /*required*/, ResolveRequireTableDesc,
)
if err != nil {
return nil, err
}
if err := p.CheckPrivilege(ctx, tableDesc, privilege.CREATE); err != nil {
return nil, err
}
return &createIndexNode{tableDesc: tableDesc, n: n}, nil
}
// MakeIndexDescriptor creates an index descriptor from a CreateIndex node.
func MakeIndexDescriptor(n *tree.CreateIndex) (*sqlbase.IndexDescriptor, error) {
indexDesc := sqlbase.IndexDescriptor{
Name: string(n.Name),
Unique: n.Unique,
StoreColumnNames: n.Storing.ToStrings(),
}
if n.Inverted {
if n.Interleave != nil {
return nil, pgerror.New(pgcode.InvalidSQLStatementName, "inverted indexes don't support interleaved tables")
}
if n.PartitionBy != nil {
return nil, pgerror.New(pgcode.InvalidSQLStatementName, "inverted indexes don't support partitioning")
}
if len(indexDesc.StoreColumnNames) > 0 {
return nil, pgerror.New(pgcode.InvalidSQLStatementName, "inverted indexes don't support stored columns")
}
if n.Unique {
return nil, pgerror.New(pgcode.InvalidSQLStatementName, "inverted indexes can't be unique")
}
indexDesc.Type = sqlbase.IndexDescriptor_INVERTED
}
if err := indexDesc.FillColumns(n.Columns); err != nil {
return nil, err
}
return &indexDesc, nil
}
func (n *createIndexNode) startExec(params runParams) error {
_, dropped, err := n.tableDesc.FindIndexByName(string(n.n.Name))
if err == nil {
if dropped {
return pgerror.Newf(pgcode.ObjectNotInPrerequisiteState,
"index %q being dropped, try again later", string(n.n.Name))
}
if n.n.IfNotExists {
return nil
}
}
// Guard against creating a non-partitioned index on a partitioned table,
// which is undesirable in most cases.
if params.SessionData().SafeUpdates && n.n.PartitionBy == nil &&
n.tableDesc.PrimaryIndex.Partitioning.NumColumns > 0 {
return pgerror.DangerousStatementf("non-partitioned index on partitioned table")
}
indexDesc, err := MakeIndexDescriptor(n.n)
if err != nil {
return err
}
if n.n.PartitionBy != nil {
partitioning, err := CreatePartitioning(params.ctx, params.p.ExecCfg().Settings,
params.EvalContext(), n.tableDesc, indexDesc, n.n.PartitionBy)
if err != nil {
return err
}
indexDesc.Partitioning = partitioning
}
mutationIdx := len(n.tableDesc.Mutations)
if err := n.tableDesc.AddIndexMutation(indexDesc, sqlbase.DescriptorMutation_ADD); err != nil {
return err
}
if err := n.tableDesc.AllocateIDs(); err != nil {
return err
}
// The index name may have changed as a result of
// AllocateIDs(). Retrieve it for the event log below.
index := n.tableDesc.Mutations[mutationIdx].GetIndex()
indexName := index.Name
if n.n.Interleave != nil {
if err := params.p.addInterleave(params.ctx, n.tableDesc, index, n.n.Interleave); err != nil {
return err
}
if err := params.p.finalizeInterleave(params.ctx, n.tableDesc, index); err != nil {
return err
}
}
mutationID, err := params.p.createOrUpdateSchemaChangeJob(
params.ctx, n.tableDesc,
tree.AsStringWithFQNames(n.n, params.Ann()),
)
if err != nil {
return err
}
if err := params.p.writeSchemaChange(params.ctx, n.tableDesc, mutationID); err != nil {
return err
}
// Record index creation in the event log. This is an auditable log
// event and is recorded in the same transaction as the table descriptor
// update.
return MakeEventLogger(params.extendedEvalCtx.ExecCfg).InsertEventRecord(
params.ctx,
params.p.txn,
EventLogCreateIndex,
int32(n.tableDesc.ID),
int32(params.extendedEvalCtx.NodeID),
struct {
TableName string
IndexName string
Statement string
User string
MutationID uint32
}{
n.n.Table.FQString(), indexName, n.n.String(),
params.SessionData().User, uint32(mutationID),
},
)
}
func (*createIndexNode) Next(runParams) (bool, error) { return false, nil }
func (*createIndexNode) Values() tree.Datums { return tree.Datums{} }
func (*createIndexNode) Close(context.Context) {}