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
|
/**
* Copyright (C) 2013 10gen Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* 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
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* 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 GNU Affero General 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/db/ops/modifier_rename.h"
#include "mongo/base/error_codes.h"
#include "mongo/bson/mutable/document.h"
#include "mongo/bson/mutable/algorithm.h"
#include "mongo/db/ops/field_checker.h"
#include "mongo/db/ops/log_builder.h"
#include "mongo/db/ops/path_support.h"
#include "mongo/util/mongoutils/str.h"
namespace mongo {
namespace str = mongoutils::str;
struct ModifierRename::PreparedState {
PreparedState(mutablebson::Element root)
: doc(root.getDocument()),
fromElemFound(doc.end()),
toIdxFound(0),
toElemFound(doc.end()),
applyCalled(false) {}
// Document that is going to be changed.
mutablebson::Document& doc;
// The element to rename
mutablebson::Element fromElemFound;
// Index in _fieldRef for which an Element exist in the document.
size_t toIdxFound;
// Element to remove (in the destination position)
mutablebson::Element toElemFound;
// Was apply called?
bool applyCalled;
};
ModifierRename::ModifierRename() : _fromFieldRef(), _toFieldRef() {}
ModifierRename::~ModifierRename() {}
Status ModifierRename::init(const BSONElement& modExpr, const Options& opts, bool* positional) {
if (modExpr.type() != String) {
return Status(ErrorCodes::BadValue,
str::stream() << "The 'to' field for $rename must be a string: " << modExpr);
}
// Extract the field names from the mod expression
_fromFieldRef.parse(modExpr.fieldName());
Status status = fieldchecker::isUpdatable(_fromFieldRef);
if (!status.isOK())
return status;
_toFieldRef.parse(modExpr.String());
status = fieldchecker::isUpdatable(_toFieldRef);
if (!status.isOK())
return status;
// TODO: Remove this restriction and make a noOp to lift restriction
// Old restriction is that if the fields are the same then it is not allowed.
if (_fromFieldRef == _toFieldRef)
return Status(ErrorCodes::BadValue,
str::stream()
<< "The source and target field for $rename must differ: " << modExpr);
// TODO: Remove this restriction by allowing moving deeping from the 'from' path
// Old restriction is that if the to/from is on the same path it fails
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);
}
// TODO: We can remove this restriction as long as there is only one,
// or it is the same array -- should think on this a bit.
//
// If a $-positional operator was used it is an error
size_t dummyPos;
if (fieldchecker::isPositional(_fromFieldRef, &dummyPos))
return Status(ErrorCodes::BadValue,
str::stream() << "The source field for $rename may not be dynamic: "
<< _fromFieldRef.dottedField());
else if (fieldchecker::isPositional(_toFieldRef, &dummyPos))
return Status(ErrorCodes::BadValue,
str::stream() << "The destination field for $rename may not be dynamic: "
<< _toFieldRef.dottedField());
if (positional)
*positional = false;
return Status::OK();
}
Status ModifierRename::prepare(mutablebson::Element root,
StringData matchedField,
ExecInfo* execInfo) {
// Rename doesn't work with positional fields ($)
dassert(matchedField.empty());
_preparedState.reset(new PreparedState(root));
// Locate the to field name in 'root', which must exist.
size_t fromIdxFound;
Status status = pathsupport::findLongestPrefix(
_fromFieldRef, root, &fromIdxFound, &_preparedState->fromElemFound);
const bool sourceExists =
(_preparedState->fromElemFound.ok() && fromIdxFound == (_fromFieldRef.numParts() - 1));
// If we can't find the full element in the from field then we can't do anything.
if (!status.isOK() || !sourceExists) {
execInfo->noOp = true;
_preparedState->fromElemFound = root.getDocument().end();
// TODO: remove this special case from existing behavior
if (status.code() == ErrorCodes::PathNotViable) {
return status;
}
return Status::OK();
}
// Ensure no array in ancestry if what we found is not at the root
mutablebson::Element curr = _preparedState->fromElemFound.parent();
if (curr != curr.getDocument().root())
while (curr.ok() && (curr != curr.getDocument().root())) {
if (curr.getType() == Array)
return Status(ErrorCodes::BadValue,
str::stream() << "The source field cannot be an array element, '"
<< _fromFieldRef.dottedField() << "' in doc with "
<< findElementNamed(root.leftChild(), "_id").toString()
<< " has an array field called '" << curr.getFieldName()
<< "'");
curr = curr.parent();
}
// "To" side validation below
status = pathsupport::findLongestPrefix(
_toFieldRef, root, &_preparedState->toIdxFound, &_preparedState->toElemFound);
// FindLongestPrefix may return not viable or any other error and then we cannot proceed.
if (status.code() == ErrorCodes::NonExistentPath) {
// Not an error condition as we will create the "to" path as needed.
} else if (!status.isOK()) {
return status;
}
const bool destExists = _preparedState->toElemFound.ok() &&
(_preparedState->toIdxFound == (_toFieldRef.numParts() - 1));
// Ensure no array in ancestry of "to" Element
// Set to either parent, or node depending on if the full path element was found
curr = (destExists ? _preparedState->toElemFound.parent() : _preparedState->toElemFound);
if (curr != curr.getDocument().root()) {
while (curr.ok()) {
if (curr.getType() == Array)
return Status(ErrorCodes::BadValue,
str::stream() << "The destination field cannot be an array element, '"
<< _fromFieldRef.dottedField() << "' in doc with "
<< findElementNamed(root.leftChild(), "_id").toString()
<< " has an array field called '" << curr.getFieldName()
<< "'");
curr = curr.parent();
}
}
// We register interest in the field name. The driver needs this info to sort out if
// there is any conflict among mods.
execInfo->fieldRef[0] = &_fromFieldRef;
execInfo->fieldRef[1] = &_toFieldRef;
execInfo->noOp = false;
return Status::OK();
}
Status ModifierRename::apply() const {
dassert(_preparedState->fromElemFound.ok());
_preparedState->applyCalled = true;
// Remove from source
Status removeStatus = _preparedState->fromElemFound.remove();
if (!removeStatus.isOK()) {
return removeStatus;
}
// If there's no need to create any further field part, the op is simply a value
// assignment.
const bool destExists = _preparedState->toElemFound.ok() &&
(_preparedState->toIdxFound == (_toFieldRef.numParts() - 1));
if (destExists) {
removeStatus = _preparedState->toElemFound.remove();
if (!removeStatus.isOK()) {
return removeStatus;
}
}
// Creates the final element that's going to be the in 'doc'.
mutablebson::Document& doc = _preparedState->doc;
StringData lastPart = _toFieldRef.getPart(_toFieldRef.numParts() - 1);
mutablebson::Element elemToSet =
doc.makeElementWithNewFieldName(lastPart, _preparedState->fromElemFound);
if (!elemToSet.ok()) {
return Status(ErrorCodes::InternalError, "can't create new element");
}
// Find the new place to put the "to" element:
// createPathAt does not use existing prefix elements so we
// need to get the prefix match position for createPathAt below
size_t tempIdx = 0;
mutablebson::Element tempElem = doc.end();
Status status = pathsupport::findLongestPrefix(_toFieldRef, doc.root(), &tempIdx, &tempElem);
// createPathAt will complete the path and attach 'elemToSet' at the end of it.
return pathsupport::createPathAt(_toFieldRef,
tempElem == doc.end() ? 0 : tempIdx + 1,
tempElem == doc.end() ? doc.root() : tempElem,
elemToSet);
}
Status ModifierRename::log(LogBuilder* logBuilder) const {
// If there was no element found then it was a noop, so return immediately
if (!_preparedState->fromElemFound.ok())
return Status::OK();
// debug assert if apply not called, since we found an element to move.
dassert(_preparedState->applyCalled);
const bool isPrefix = _fromFieldRef.isPrefixOf(_toFieldRef);
const StringData setPath = (isPrefix ? _fromFieldRef : _toFieldRef).dottedField();
const StringData unsetPath = isPrefix ? StringData() : _fromFieldRef.dottedField();
const bool doUnset = !isPrefix;
// We'd like to create an entry such as {$set: {<fieldname>: <value>}} under 'logRoot'.
// We start by creating the {$set: ...} Element.
mutablebson::Document& doc = logBuilder->getDocument();
// Create the {<fieldname>: <value>} Element. Note that we log the mod with a
// dotted field, if it was applied over a dotted field. The rationale is that the
// secondary may be in a different state than the primary and thus make different
// decisions about creating the intermediate path in _fieldRef or not.
mutablebson::Element logElement =
doc.makeElementWithNewFieldName(setPath, _preparedState->fromElemFound.getValue());
if (!logElement.ok()) {
return Status(ErrorCodes::InternalError, "cannot create details for $rename mod");
}
// Now, we attach the {<fieldname>: <value>} Element under the {$set: ...} section.
Status status = logBuilder->addToSets(logElement);
if (status.isOK() && doUnset) {
// Create the {<fieldname>: <value>} Element. Note that we log the mod with a
// dotted field, if it was applied over a dotted field. The rationale is that the
// secondary may be in a different state than the primary and thus make different
// decisions about creating the intermediate path in _fieldRef or not.
status = logBuilder->addToUnsets(unsetPath);
}
return status;
}
} // namespace mongo
|