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
|
/**
* 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.
*/
#define MONGO_LOG_DEFAULT_COMPONENT ::mongo::logger::LogComponent::kNetwork
#include "mongo/platform/basic.h"
#include "mongo/rpc/op_msg.h"
#include <bitset>
#include <set>
#include "mongo/base/data_type_endian.h"
#include "mongo/db/bson/dotted_path_support.h"
#include "mongo/rpc/object_check.h"
#include "mongo/util/bufreader.h"
#include "mongo/util/hex.h"
#include "mongo/util/log.h"
namespace mongo {
namespace {
auto kAllSupportedFlags = OpMsg::kChecksumPresent | OpMsg::kMoreToCome;
bool containsUnknownRequiredFlags(uint32_t flags) {
const uint32_t kRequiredFlagMask = 0xffff; // Low 2 bytes are required, high 2 are optional.
return (flags & ~kAllSupportedFlags & kRequiredFlagMask) != 0;
}
enum class Section : uint8_t {
kBody = 0,
kDocSequence = 1,
};
} // namespace
uint32_t OpMsg::flags(const Message& message) {
if (message.operation() != dbMsg)
return 0; // Other command protocols are the same as no flags set.
return BufReader(message.singleData().data(), message.dataSize())
.read<LittleEndian<uint32_t>>();
}
void OpMsg::replaceFlags(Message* message, uint32_t flags) {
invariant(!message->empty());
invariant(message->operation() == dbMsg);
invariant(message->dataSize() >= static_cast<int>(sizeof(uint32_t)));
DataView(message->singleData().data()).write<LittleEndian<uint32_t>>(flags);
}
OpMsg OpMsg::parse(const Message& message) try {
// It is the caller's responsibility to call the correct parser for a given message type.
invariant(!message.empty());
invariant(message.operation() == dbMsg);
const uint32_t flags = OpMsg::flags(message);
uassert(ErrorCodes::IllegalOpMsgFlag,
str::stream() << "Message contains illegal flags value: Ob"
<< std::bitset<32>(flags).to_string(),
!containsUnknownRequiredFlags(flags));
constexpr int kCrc32Size = 4;
const bool haveChecksum = flags & kChecksumPresent;
const int checksumSize = haveChecksum ? kCrc32Size : 0;
// The sections begin after the flags and before the checksum (if present).
BufReader sectionsBuf(message.singleData().data() + sizeof(flags),
message.dataSize() - sizeof(flags) - checksumSize);
// TODO some validation may make more sense in the IDL parser. I've tagged them with comments.
bool haveBody = false;
OpMsg msg;
while (!sectionsBuf.atEof()) {
const auto sectionKind = sectionsBuf.read<Section>();
switch (sectionKind) {
case Section::kBody: {
uassert(40430, "Multiple body sections in message", !haveBody);
haveBody = true;
msg.body = sectionsBuf.read<Validated<BSONObj>>();
break;
}
case Section::kDocSequence: {
// We use an O(N^2) algorithm here and an O(N*M) algorithm below. These are fastest
// for the current small values of N, but would be problematic if it is large.
// If we need more document sequences, raise the limit and use a better algorithm.
uassert(ErrorCodes::TooManyDocumentSequences,
"Too many document sequences in OP_MSG",
msg.sequences.size() < 2); // Limit is <=2 since we are about to add one.
// The first 4 bytes are the total size, including themselves.
const auto remainingSize =
sectionsBuf.read<LittleEndian<int32_t>>() - sizeof(int32_t);
BufReader seqBuf(sectionsBuf.skip(remainingSize), remainingSize);
const auto name = seqBuf.readCStr();
uassert(40431,
str::stream() << "Duplicate document sequence: " << name,
!msg.getSequence(name)); // TODO IDL
msg.sequences.push_back({name.toString()});
while (!seqBuf.atEof()) {
msg.sequences.back().objs.push_back(seqBuf.read<Validated<BSONObj>>());
}
break;
}
default:
// Using uint32_t so we append as a decimal number rather than as a char.
uasserted(40432, str::stream() << "Unknown section kind " << uint32_t(sectionKind));
}
}
uassert(40587, "OP_MSG messages must have a body", haveBody);
// Detect duplicates between doc sequences and body. TODO IDL
// Technically this is O(N*M) but N is at most 2.
for (const auto& docSeq : msg.sequences) {
const char* name = docSeq.name.c_str(); // Pointer is redirected by next call.
auto inBody =
!dotted_path_support::extractElementAtPathOrArrayAlongPath(msg.body, name).eoo();
uassert(40433,
str::stream() << "Duplicate field between body and document sequence "
<< docSeq.name,
!inBody);
}
return msg;
} catch (const DBException& ex) {
LOG(1) << "invalid message: " << ex.code() << " " << redact(ex) << " -- "
<< redact(hexdump(message.singleData().view2ptr(), message.size()));
throw;
}
Message OpMsg::serialize() const {
OpMsgBuilder builder;
for (auto&& seq : sequences) {
auto docSeq = builder.beginDocSequence(seq.name);
for (auto&& obj : seq.objs) {
docSeq.append(obj);
}
}
builder.beginBody().appendElements(body);
return builder.finish();
}
void OpMsg::shareOwnershipWith(const ConstSharedBuffer& buffer) {
if (!body.isOwned()) {
body.shareOwnershipWith(buffer);
}
for (auto&& seq : sequences) {
for (auto&& obj : seq.objs) {
if (!obj.isOwned()) {
obj.shareOwnershipWith(buffer);
}
}
}
}
auto OpMsgBuilder::beginDocSequence(StringData name) -> DocSequenceBuilder {
invariant(_state == kEmpty || _state == kDocSequence);
invariant(!_openBuilder);
_openBuilder = true;
_state = kDocSequence;
_buf.appendStruct(Section::kDocSequence);
int sizeOffset = _buf.len();
_buf.skip(sizeof(int32_t)); // section size.
_buf.appendStr(name, true);
return DocSequenceBuilder(this, &_buf, sizeOffset);
}
void OpMsgBuilder::finishDocumentStream(DocSequenceBuilder* docSequenceBuilder) {
invariant(_state == kDocSequence);
invariant(_openBuilder);
_openBuilder = false;
const int32_t size = _buf.len() - docSequenceBuilder->_sizeOffset;
invariant(size > 0);
DataView(_buf.buf()).write<LittleEndian<int32_t>>(size, docSequenceBuilder->_sizeOffset);
}
BSONObjBuilder OpMsgBuilder::beginBody() {
invariant(_state == kEmpty || _state == kDocSequence);
_state = kBody;
_buf.appendStruct(Section::kBody);
invariant(_bodyStart == 0);
_bodyStart = _buf.len(); // Cannot be 0.
return BSONObjBuilder(_buf);
}
BSONObjBuilder OpMsgBuilder::resumeBody() {
invariant(_state == kBody);
invariant(_bodyStart != 0);
return BSONObjBuilder(BSONObjBuilder::ResumeBuildingTag(), _buf, _bodyStart);
}
AtomicBool OpMsgBuilder::disableDupeFieldCheck_forTest{false};
Message OpMsgBuilder::finish() {
if (kDebugBuild && !disableDupeFieldCheck_forTest.load()) {
std::set<StringData> seenFields;
for (auto elem : resumeBody().asTempObj()) {
if (!(seenFields.insert(elem.fieldNameStringData()).second)) {
severe() << "OP_MSG with duplicate field '" << elem.fieldNameStringData()
<< "' : " << redact(resumeBody().asTempObj());
fassert(40474, false);
}
}
}
invariant(_state == kBody);
invariant(_bodyStart);
invariant(!_openBuilder);
_state = kDone;
const auto size = _buf.len();
MSGHEADER::View header(_buf.buf());
header.setMessageLength(size);
// header.setRequestMsgId(...); // These are currently filled in by the networking layer.
// header.setResponseToMsgId(...);
header.setOpCode(dbMsg);
return Message(_buf.release());
}
BSONObj OpMsgBuilder::releaseBody() {
invariant(_state == kBody);
invariant(_bodyStart);
invariant(_bodyStart == sizeof(MSGHEADER::Layout) + 4 /*flags*/ + 1 /*body kind byte*/);
invariant(!_openBuilder);
_state = kDone;
auto bson = BSONObj(_buf.buf() + _bodyStart);
return bson.shareOwnershipWith(_buf.release());
}
} // namespace mongo
|