blob: e883ea2f1f243908d34f805de73c95496ac9f8c7 (
plain)
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
|
/**
* Copyright (C) 2008 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/>.
*/
/* builder.h
*/
#pragma once
#include "../stdafx.h"
namespace mongo {
class BufBuilder {
public:
BufBuilder(int initsize = 512) : size(initsize) {
data = (char *) malloc(size);
assert(data);
l = 0;
}
~BufBuilder() {
kill();
}
void kill() {
if ( data ) {
free(data);
data = 0;
}
}
/* leave room for some stuff later */
void skip(int n) {
grow(n);
}
/* note this may be deallocated (realloced) if you keep writing. */
char* buf() {
return data;
}
/* assume ownership of the buffer - you must then free it */
void decouple() {
data = 0;
}
template<class T> void append(T j) {
*((T*)grow(sizeof(T))) = j;
}
void append(short j) {
append<short>(j);
}
void append(int j) {
append<int>(j);
}
void append(unsigned j) {
append<unsigned>(j);
}
void append(bool j) {
append<bool>(j);
}
void append(double j) {
append<double>(j);
}
void append(void *src, int len) {
memcpy(grow(len), src, len);
}
void append(const char *str) {
append((void*) str, strlen(str)+1);
}
int len() {
return l;
}
private:
/* returns the pre-grow write position */
char* grow(int by) {
int oldlen = l;
l += by;
if ( l > size ) {
int a = size * 2;
if ( l > a )
a = l + 16 * 1024;
assert( a < 64 * 1024 * 1024 );
data = (char *) realloc(data, a);
size= a;
}
return data + oldlen;
}
char *data;
int l;
int size;
};
} // namespace mongo
|
