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
|
// @file alignedbuilder.h
/**
* Copyright (C) 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/>.
*/
#pragma once
#include "../bson/stringdata.h"
namespace mongo {
/** a page-aligned BufBuilder. */
class AlignedBuilder {
public:
AlignedBuilder(unsigned init_size);
~AlignedBuilder() { kill(); }
/** reset for a re-use. shrinks if > 128MB */
void reset() {
_len = 0;
const unsigned sizeCap = 128*1024*1024;
if (_p._size > sizeCap)
_realloc(sizeCap, _len);
}
/** note this may be deallocated (realloced) if you keep writing or reset(). */
const char* buf() const { return _p._data; }
/** leave room for some stuff later
@return offset in the buffer that was our current position
*/
size_t skip(unsigned n) {
unsigned l = len();
grow(n);
return l;
}
char* atOfs(unsigned ofs) { return _p._data + ofs; }
void appendChar(char j) {
*((char*)grow(sizeof(char))) = j;
}
void appendNum(char j) {
*((char*)grow(sizeof(char))) = j;
}
void appendNum(short j) {
*((short*)grow(sizeof(short))) = j;
}
void appendNum(int j) {
*((int*)grow(sizeof(int))) = j;
}
void appendNum(unsigned j) {
*((unsigned*)grow(sizeof(unsigned))) = j;
}
void appendNum(bool j) {
*((bool*)grow(sizeof(bool))) = j;
}
void appendNum(double j) {
*((double*)grow(sizeof(double))) = j;
}
void appendNum(long long j) {
*((long long*)grow(sizeof(long long))) = j;
}
void appendNum(unsigned long long j) {
*((unsigned long long*)grow(sizeof(unsigned long long))) = j;
}
void appendBuf(const void *src, size_t len) { memcpy(grow((unsigned) len), src, len); }
template<class T>
void appendStruct(const T& s) { appendBuf(&s, sizeof(T)); }
void appendStr(const StringData &str , bool includeEOO = true ) {
const unsigned len = str.size() + ( includeEOO ? 1 : 0 );
assert( len < (unsigned) BSONObjMaxUserSize );
memcpy(grow(len), str.data(), len);
}
/** @return the in-use length */
unsigned len() const { return _len; }
private:
static const unsigned Alignment = 8192;
/** returns the pre-grow write position */
inline char* grow(unsigned by) {
unsigned oldlen = _len;
_len += by;
if ( _len > _p._size ) {
growReallocate(oldlen);
}
return _p._data + oldlen;
}
void growReallocate(unsigned oldLenInUse);
void kill();
void mallocSelfAligned(unsigned sz);
void _malloc(unsigned sz);
void _realloc(unsigned newSize, unsigned oldLenInUse);
void _free(void*);
struct AllocationInfo {
char *_data;
void *_allocationAddress;
unsigned _size;
} _p;
unsigned _len; // bytes in use
};
}
|
