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
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
|
/* builder.h */
/* Copyright 2009 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.
*/
#pragma once
#include <cfloat>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include "mongo/base/data_type_endian.h"
#include "mongo/base/data_view.h"
#include "mongo/base/string_data.h"
#include "mongo/bson/inline_decls.h"
#include "mongo/platform/decimal128.h"
#include "mongo/util/allocator.h"
#include "mongo/util/assert_util.h"
namespace mongo {
/* Note the limit here is rather arbitrary and is simply a standard. generally the code works
with any object that fits in ram.
Also note that the server has some basic checks to enforce this limit but those checks are not
exhaustive for example need to check for size too big after
update $push (append) operation
various db.eval() type operations
*/
const int BSONObjMaxUserSize = 16 * 1024 * 1024;
/*
Sometimes we need objects slightly larger - an object in the replication local.oplog
is slightly larger than a user object for example.
*/
const int BSONObjMaxInternalSize = BSONObjMaxUserSize + (16 * 1024);
const int BufferMaxSize = 64 * 1024 * 1024;
template <typename Allocator>
class StringBuilderImpl;
class TrivialAllocator {
public:
void* Malloc(size_t sz) {
return mongoMalloc(sz);
}
void* Realloc(void* p, size_t sz) {
return mongoRealloc(p, sz);
}
void Free(void* p) {
free(p);
}
};
class StackAllocator {
public:
enum { SZ = 512 };
void* Malloc(size_t sz) {
if (sz <= SZ)
return buf;
return mongoMalloc(sz);
}
void* Realloc(void* p, size_t sz) {
if (p == buf) {
if (sz <= SZ)
return buf;
void* d = mongoMalloc(sz);
if (d == 0)
msgasserted(15912, "out of memory StackAllocator::Realloc");
memcpy(d, p, SZ);
return d;
}
return mongoRealloc(p, sz);
}
void Free(void* p) {
if (p != buf)
free(p);
}
private:
char buf[SZ];
};
template <class Allocator>
class _BufBuilder {
// non-copyable, non-assignable
_BufBuilder(const _BufBuilder&);
_BufBuilder& operator=(const _BufBuilder&);
Allocator al;
public:
_BufBuilder(int initsize = 512) : size(initsize) {
if (size > 0) {
data = (char*)al.Malloc(size);
if (data == 0)
msgasserted(10000, "out of memory BufBuilder");
} else {
data = 0;
}
l = 0;
reservedBytes = 0;
}
~_BufBuilder() {
kill();
}
void kill() {
if (data) {
al.Free(data);
data = 0;
}
}
void reset() {
l = 0;
reservedBytes = 0;
}
void reset(int maxSize) {
l = 0;
reservedBytes = 0;
if (maxSize && size > maxSize) {
al.Free(data);
data = (char*)al.Malloc(maxSize);
if (data == 0)
msgasserted(15913, "out of memory BufBuilder::reset");
size = maxSize;
}
}
/** leave room for some stuff later
@return point to region that was skipped. pointer may change later (on realloc), so for
immediate use only
*/
char* skip(int n) {
return grow(n);
}
/* note this may be deallocated (realloced) if you keep writing. */
char* buf() {
return data;
}
const char* buf() const {
return data;
}
/* assume ownership of the buffer - you must then free() it */
void decouple() {
data = 0;
}
void appendUChar(unsigned char j) {
static_assert(CHAR_BIT == 8, "CHAR_BIT == 8");
appendNumImpl(j);
}
void appendChar(char j) {
appendNumImpl(j);
}
void appendNum(char j) {
appendNumImpl(j);
}
void appendNum(short j) {
static_assert(sizeof(short) == 2, "sizeof(short) == 2");
appendNumImpl(j);
}
void appendNum(int j) {
static_assert(sizeof(int) == 4, "sizeof(int) == 4");
appendNumImpl(j);
}
void appendNum(unsigned j) {
appendNumImpl(j);
}
// Bool does not have a well defined encoding.
void appendNum(bool j) = delete;
void appendNum(double j) {
static_assert(sizeof(double) == 8, "sizeof(double) == 8");
appendNumImpl(j);
}
void appendNum(long long j) {
static_assert(sizeof(long long) == 8, "sizeof(long long) == 8");
appendNumImpl(j);
}
void appendNum(unsigned long long j) {
appendNumImpl(j);
}
void appendNum(Decimal128 j) {
BOOST_STATIC_ASSERT(sizeof(Decimal128::Value) == 16);
appendNumImpl(j.getValue());
}
void appendBuf(const void* src, size_t len) {
if (len)
memcpy(grow((int)len), src, len);
}
template <class T>
void appendStruct(const T& s) {
appendBuf(&s, sizeof(T));
}
void appendStr(StringData str, bool includeEndingNull = true) {
const int len = str.size() + (includeEndingNull ? 1 : 0);
str.copyTo(grow(len), includeEndingNull);
}
/** @return length of current std::string */
int len() const {
return l;
}
void setlen(int newLen) {
l = newLen;
}
/** @return size of the buffer */
int getSize() const {
return size;
}
/* returns the pre-grow write position */
inline char* grow(int by) {
int oldlen = l;
int newLen = l + by;
int minSize = newLen + reservedBytes;
if (minSize > size) {
grow_reallocate(minSize);
}
l = newLen;
return data + oldlen;
}
/**
* Reserve room for some number of bytes to be claimed at a later time.
*/
void reserveBytes(int bytes) {
int minSize = l + reservedBytes + bytes;
if (minSize > size)
grow_reallocate(minSize);
// This must happen *after* any attempt to grow.
reservedBytes += bytes;
}
/**
* Claim an earlier reservation of some number of bytes. These bytes must already have been
* reserved. Appends of up to this many bytes immediately following a claim are
* guaranteed to succeed without a need to reallocate.
*/
void claimReservedBytes(int bytes) {
invariant(reservedBytes >= bytes);
reservedBytes -= bytes;
}
private:
template <typename T>
void appendNumImpl(T t) {
// NOTE: For now, we assume that all things written
// by a BufBuilder are intended for external use: either written to disk
// or to the wire. Since all of our encoding formats are little endian,
// we bake that assumption in here. This decision should be revisited soon.
DataView(grow(sizeof(t))).write(tagLittleEndian(t));
}
/* "slow" portion of 'grow()' */
void NOINLINE_DECL grow_reallocate(int minSize) {
int a = 64;
while (a < minSize)
a = a * 2;
if (a > BufferMaxSize) {
std::stringstream ss;
ss << "BufBuilder attempted to grow() to " << a << " bytes, past the 64MB limit.";
msgasserted(13548, ss.str().c_str());
}
data = (char*)al.Realloc(data, a);
if (data == NULL)
msgasserted(16070, "out of memory BufBuilder::grow_reallocate");
size = a;
}
char* data;
int l;
int size;
int reservedBytes; // eagerly grow_reallocate to keep this many bytes of spare room.
friend class StringBuilderImpl<Allocator>;
};
typedef _BufBuilder<TrivialAllocator> BufBuilder;
/** The StackBufBuilder builds smaller datasets on the stack instead of using malloc.
this can be significantly faster for small bufs. However, you can not decouple() the
buffer with StackBufBuilder.
While designed to be a variable on the stack, if you were to dynamically allocate one,
nothing bad would happen. In fact in some circumstances this might make sense, say,
embedded in some other object.
*/
class StackBufBuilder : public _BufBuilder<StackAllocator> {
public:
StackBufBuilder() : _BufBuilder<StackAllocator>(StackAllocator::SZ) {}
void decouple(); // not allowed. not implemented.
};
/** std::stringstream deals with locale so this is a lot faster than std::stringstream for UTF8 */
template <typename Allocator>
class StringBuilderImpl {
public:
// Sizes are determined based on the number of characters in 64-bit + the trailing '\0'
static const size_t MONGO_DBL_SIZE = 3 + DBL_MANT_DIG - DBL_MIN_EXP + 1;
static const size_t MONGO_S32_SIZE = 12;
static const size_t MONGO_U32_SIZE = 11;
static const size_t MONGO_S64_SIZE = 23;
static const size_t MONGO_U64_SIZE = 22;
static const size_t MONGO_S16_SIZE = 7;
static const size_t MONGO_PTR_SIZE = 19; // Accounts for the 0x prefix
StringBuilderImpl() {}
StringBuilderImpl& operator<<(double x) {
return SBNUM(x, MONGO_DBL_SIZE, "%g");
}
StringBuilderImpl& operator<<(int x) {
return SBNUM(x, MONGO_S32_SIZE, "%d");
}
StringBuilderImpl& operator<<(unsigned x) {
return SBNUM(x, MONGO_U32_SIZE, "%u");
}
StringBuilderImpl& operator<<(long x) {
return SBNUM(x, MONGO_S64_SIZE, "%ld");
}
StringBuilderImpl& operator<<(unsigned long x) {
return SBNUM(x, MONGO_U64_SIZE, "%lu");
}
StringBuilderImpl& operator<<(long long x) {
return SBNUM(x, MONGO_S64_SIZE, "%lld");
}
StringBuilderImpl& operator<<(unsigned long long x) {
return SBNUM(x, MONGO_U64_SIZE, "%llu");
}
StringBuilderImpl& operator<<(short x) {
return SBNUM(x, MONGO_S16_SIZE, "%hd");
}
StringBuilderImpl& operator<<(const void* x) {
if (sizeof(x) == 8) {
return SBNUM(x, MONGO_PTR_SIZE, "0x%llX");
} else {
return SBNUM(x, MONGO_PTR_SIZE, "0x%lX");
}
}
StringBuilderImpl& operator<<(char c) {
_buf.grow(1)[0] = c;
return *this;
}
StringBuilderImpl& operator<<(const char* str) {
return *this << StringData(str);
}
StringBuilderImpl& operator<<(StringData str) {
append(str);
return *this;
}
void appendDoubleNice(double x) {
const int prev = _buf.l;
const int maxSize = 32;
char* start = _buf.grow(maxSize);
int z = snprintf(start, maxSize, "%.16g", x);
verify(z >= 0);
verify(z < maxSize);
_buf.l = prev + z;
if (strchr(start, '.') == 0 && strchr(start, 'E') == 0 && strchr(start, 'N') == 0) {
write(".0", 2);
}
}
void write(const char* buf, int len) {
memcpy(_buf.grow(len), buf, len);
}
void append(StringData str) {
str.copyTo(_buf.grow(str.size()), false);
}
void reset(int maxSize = 0) {
_buf.reset(maxSize);
}
std::string str() const {
return std::string(_buf.data, _buf.l);
}
/** size of current std::string */
int len() const {
return _buf.l;
}
private:
_BufBuilder<Allocator> _buf;
// non-copyable, non-assignable
StringBuilderImpl(const StringBuilderImpl&);
StringBuilderImpl& operator=(const StringBuilderImpl&);
template <typename T>
StringBuilderImpl& SBNUM(T val, int maxSize, const char* macro) {
int prev = _buf.l;
int z = snprintf(_buf.grow(maxSize), maxSize, macro, (val));
verify(z >= 0);
verify(z < maxSize);
_buf.l = prev + z;
return *this;
}
};
typedef StringBuilderImpl<TrivialAllocator> StringBuilder;
typedef StringBuilderImpl<StackAllocator> StackStringBuilder;
} // namespace mongo
|