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
|
/**
* Copyright (C) 2018-present MongoDB, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the Server Side Public License, version 1,
* as published by MongoDB, Inc.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* Server Side Public License for more details.
*
* You should have received a copy of the Server Side Public License
* along with this program. If not, see
* <http://www.mongodb.com/licensing/server-side-public-license>.
*
* As a special exception, the copyright holders give permission to link the
* code of portions of this program with the OpenSSL library under certain
* conditions as described in each individual source file and distribute
* linked combinations including the program with the OpenSSL library. You
* must comply with the Server Side Public License in all respects for
* all of the code used other than as permitted herein. If you modify file(s)
* with this exception, you may extend this exception to your version of the
* file(s), but you are not obligated to do so. If you do not wish to do so,
* delete this exception statement from your version. If you delete this
* exception statement from all source files in the program, then also delete
* it in the license file.
*/
#include "mongo/platform/basic.h"
#include "mongo/db/update/rename_node.h"
#include "mongo/base/string_data.h"
#include "mongo/bson/mutable/algorithm.h"
#include "mongo/db/update/field_checker.h"
#include "mongo/db/update/modifier_node.h"
#include "mongo/db/update/path_support.h"
#include "mongo/db/update/storage_validation.h"
#include "mongo/db/update/unset_node.h"
namespace mongo {
/**
* The SetElementNode class provides the $set functionality for $rename. A $rename from a source
* field to a destination field behaves logically like a $set on the destination followed by a
* $unset on the source, and the first of those operations is executed by calling apply on a
* SetElementNode object. We create a class for this purpose (rather than a stand-alone function) so
* that it can inherit from ModifierNode.
*
* Unlike SetNode, SetElementNode takes a mutablebson::Element as its input. Additionally,
* SetElementNode::updateExistingElement() does not check for the possibility that we are
* overwriting the target value with an identical source value (a no-op). That check would require
* us to convert _elemToSet from a mutablebson::Element to a BSONElement, which is not worth the
* extra time.
*/
class SetElementNode : public ModifierNode {
public:
SetElementNode(mutablebson::Element elemToSet) : _elemToSet(elemToSet) {}
std::unique_ptr<UpdateNode> clone() const final {
return std::make_unique<SetElementNode>(*this);
}
void setCollator(const CollatorInterface* collator) final {}
Status init(BSONElement modExpr, const boost::intrusive_ptr<ExpressionContext>& expCtx) {
return Status::OK();
}
/**
* These internally-generated nodes do not need to be serialized.
*/
void produceSerializationMap(
FieldRef* currentPath,
std::map<std::string, std::vector<std::pair<std::string, BSONObj>>>*
operatorOrientedUpdates) const final {}
void acceptVisitor(UpdateNodeVisitor* visitor) final {
visitor->visit(this);
}
protected:
ModifierNode::ModifyResult updateExistingElement(mutablebson::Element* element,
const FieldRef& elementPath) const final {
invariant(element->setValueElement(_elemToSet));
return ModifyResult::kNormalUpdate;
}
void setValueForNewElement(mutablebson::Element* element) const final {
invariant(element->setValueElement(_elemToSet));
}
bool allowCreation() const final {
return true;
}
bool canSetObjectValue() const final {
return true;
}
private:
StringData operatorName() const final {
return "$set";
}
BSONObj operatorValue() const final {
return BSON("" << _elemToSet.getValue());
}
mutablebson::Element _elemToSet;
};
Status RenameNode::init(BSONElement modExpr,
const boost::intrusive_ptr<ExpressionContext>& expCtx) {
invariant(modExpr.ok());
invariant(BSONType::String == modExpr.type());
FieldRef fromFieldRef(modExpr.fieldName());
FieldRef toFieldRef(modExpr.String());
if (modExpr.valueStringData().find('\0') != std::string::npos) {
return Status(ErrorCodes::BadValue,
"The 'to' field for $rename cannot contain an embedded null byte");
}
// Parsing {$rename: {'from': 'to'}} places nodes in the UpdateNode tree for both the "from" and
// "to" paths via UpdateObjectNode::parseAndMerge(), which will enforce this isUpdatable
// property.
dassert(fieldchecker::isUpdatable(fromFieldRef).isOK());
dassert(fieldchecker::isUpdatable(toFieldRef).isOK());
// Though we could treat this as a no-op, it is illegal in the current implementation.
if (fromFieldRef == toFieldRef) {
return Status(ErrorCodes::BadValue,
str::stream()
<< "The source and target field for $rename must differ: " << modExpr);
}
if (fromFieldRef.isPrefixOf(toFieldRef) || toFieldRef.isPrefixOf(fromFieldRef)) {
return Status(ErrorCodes::BadValue,
str::stream() << "The source and target field for $rename must "
"not be on the same path: "
<< modExpr);
}
size_t dummyPos;
if (fieldchecker::isPositional(fromFieldRef, &dummyPos) ||
fieldchecker::hasArrayFilter(fromFieldRef)) {
return Status(ErrorCodes::BadValue,
str::stream() << "The source field for $rename may not be dynamic: "
<< fromFieldRef.dottedField());
} else if (fieldchecker::isPositional(toFieldRef, &dummyPos) ||
fieldchecker::hasArrayFilter(toFieldRef)) {
return Status(ErrorCodes::BadValue,
str::stream() << "The destination field for $rename may not be dynamic: "
<< toFieldRef.dottedField());
}
_val = modExpr;
return Status::OK();
}
UpdateExecutor::ApplyResult RenameNode::apply(ApplyParams applyParams,
UpdateNodeApplyParams updateNodeApplyParams) const {
// It would make sense to store fromFieldRef and toFieldRef as members during
// RenameNode::init(), but FieldRef is not copyable.
FieldRef fromFieldRef(_val.fieldName());
FieldRef toFieldRef(_val.valueStringData());
mutablebson::Document& document = applyParams.element.getDocument();
FieldIndex fromIdxFound;
mutablebson::Element fromElement(document.end());
auto status =
pathsupport::findLongestPrefix(fromFieldRef, document.root(), &fromIdxFound, &fromElement);
if (!status.isOK() || !fromElement.ok() || fromIdxFound != (fromFieldRef.numParts() - 1)) {
// We could safely remove this restriction (thereby treating a rename with a non-viable
// source path as a no-op), but most updates fail on an attempt to update a non-viable path,
// so we throw an error for consistency.
if (status == ErrorCodes::PathNotViable) {
uassertStatusOK(status);
MONGO_UNREACHABLE; // The previous uassertStatusOK should always throw.
}
// The element we want to rename does not exist. When that happens, we treat the operation
// as a no-op. The attempted from/to paths are still considered modified.
if (applyParams.modifiedPaths) {
applyParams.modifiedPaths->keepShortest(fromFieldRef);
applyParams.modifiedPaths->keepShortest(toFieldRef);
}
return ApplyResult::noopResult();
}
// Renaming through an array is prohibited. Check that our source path does not contain an
// array. (The element being renamed may be an array, however.)
for (auto currentElement = fromElement.parent(); currentElement != document.root();
currentElement = currentElement.parent()) {
invariant(currentElement.ok());
if (BSONType::Array == currentElement.getType()) {
auto idElem = mutablebson::findFirstChildNamed(document.root(), "_id");
uasserted(ErrorCodes::BadValue,
str::stream() << "The source field cannot be an array element, '"
<< fromFieldRef.dottedField() << "' in doc with "
<< (idElem.ok() ? idElem.toString() : "no id")
<< " has an array field called '"
<< currentElement.getFieldName() << "'");
}
}
// Check that our destination path does not contain an array. (If the rename will overwrite an
// existing element, that element may be an array. Iff pathToCreate is empty, "element"
// represents an element that we are going to overwrite.)
for (auto currentElement = updateNodeApplyParams.pathToCreate->empty()
? applyParams.element.parent()
: applyParams.element;
currentElement != document.root();
currentElement = currentElement.parent()) {
invariant(currentElement.ok());
if (BSONType::Array == currentElement.getType()) {
auto idElem = mutablebson::findFirstChildNamed(document.root(), "_id");
uasserted(ErrorCodes::BadValue,
str::stream() << "The destination field cannot be an array element, '"
<< toFieldRef.dottedField() << "' in doc with "
<< (idElem.ok() ? idElem.toString() : "no id")
<< " has an array field called '"
<< currentElement.getFieldName() << "'");
}
}
// Once we've determined that the rename is valid and found the source element, the actual work
// gets broken out into a $set operation and an $unset operation. Note that, generally, we
// should call the init() method of a ModifierNode before calling its apply() method, but the
// init() methods of SetElementNode and UnsetNode don't do anything, so we can skip them.
SetElementNode setElement(fromElement);
auto setElementApplyResult = setElement.apply(applyParams, updateNodeApplyParams);
ApplyParams unsetParams(applyParams);
unsetParams.element = fromElement;
// Renames never "go through" arrays, so we're guaranteed all of the parts of the path are
// of type kFieldName.
auto pathTaken = std::make_shared<RuntimeUpdatePath>(
fromFieldRef,
std::vector<RuntimeUpdatePath::ComponentType>(
fromFieldRef.numParts(), RuntimeUpdatePath::ComponentType::kFieldName));
UpdateNodeApplyParams unsetUpdateNodeApplyParams{
std::make_shared<FieldRef>(),
pathTaken,
updateNodeApplyParams.logBuilder,
};
UnsetNode unsetElement;
auto unsetElementApplyResult = unsetElement.apply(unsetParams, unsetUpdateNodeApplyParams);
// Determine the final result based on the results of the $set and $unset.
ApplyResult applyResult;
applyResult.indexesAffected =
setElementApplyResult.indexesAffected || unsetElementApplyResult.indexesAffected;
// The $unset would only be a no-op if the source element did not exist, in which case we would
// have exited early with a no-op result.
invariant(!unsetElementApplyResult.noop);
return applyResult;
}
} // namespace mongo
|