-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsaratoga.h
291 lines (250 loc) · 7.17 KB
/
saratoga.h
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
/*
Copyright (c) 2011, Charles Smith
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this
list of conditions and the following disclaimer in the documentation
and/or
other materials provided with the distribution.
* Neither the name of Vallona Networks nor the names of its contributors
may be used to endorse or promote products derived from this software
without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
ADVISED
OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _SARATOGA_H
#define _SARATOGA_H
#ifndef __STDC_FORMAT_MACROS
#define __STDC_FORMAT_MACROS // So we can d PRI_u64 in printf
#endif
#include <arpa/inet.h>
#include <inttypes.h>
#include <list>
#include <string.h>
#include <string>
/*
* At this stage we do not support 128 bit descriptors but the code is
* all there. Just define this and we are (well should be) good to go
*/
#undef UINT128_T
#ifdef UINT128_T
extern uint128_t htonlll(uint128_t);
extern uint128_t ntohlll(uint128_t);
#endif // UINT128_T
extern uint64_t htonll(uint64_t);
extern uint64_t ntohll(uint64_t);
extern int debuglevel();
// using namespace std;
namespace saratoga {
typedef uint32_t flag_t; // Saratoga Flags
typedef uint16_t dflag_t; // Directory Flags
typedef uint32_t dtime_t; // Directory Time Fields
typedef unsigned char tflag_t; // Timestamp Flags
typedef uint32_t session_t; // Session ID
typedef off64_t offset_t; // Memory & Offset maths I need it to be the biggest
// unsigned int type
// enum boolean { TRUE = 1, FALSE = 0 }; // Good old bools...
// hton and ntoh conversions
typedef uint16_t hton_t;
typedef uint16_t ntoh_t;
typedef uint32_t htonl_t;
typedef uint32_t ntohl_t;
typedef uint64_t htonll_t;
typedef uint64_t ntohll_t;
#ifdef UINT128_T
typedef uint128_t htonlll_t; // htonlll conversions - maybe one day :)
typedef uint128_t ntohlll_t; // ntohlll conversions
#endif // UINT128_T
typedef unsigned int uint_t; // Used in sprintf's
// Buffers used for socket and file i/o
class buffer
{
char* _b;
size_t _len;
offset_t _offset; // The offset into hte file for this buffer
// This is always 0 for streams and sockets of course
static const size_t _maxbuff = 10000; // maximum size of a buffer
// This has to be at least > jumbo
// frame size
public:
// Buffer with no offset to seek used for streams
// and sockets and sequential reads/writes (offset always 0)
buffer(const char* b, size_t len)
{
_len = len;
if (len > 0) {
_b = new char[len];
memcpy(_b, b, len);
} else
_b = nullptr;
_offset = 0;
}
// Buffer with an offset into the file
// so we know where to seek & read/write it
buffer(const char* b, size_t len, offset_t o)
{
_len = len;
if (len > 0) {
_b = new char[len];
memcpy(_b, b, len);
} else
_b = nullptr;
_offset = o;
}
buffer(buffer* b)
{
_len = b->len();
if (b->_len > 0) {
_b = new char[_len];
memcpy(_b, b->buf(), _len);
} else
_b = nullptr;
_offset = b->offset();
}
~buffer() { this->clear(); };
void clear()
{
if (_len > 0)
delete _b;
_b = nullptr;
_offset = 0;
_len = 0;
}
// Copy constructor
buffer(const buffer& old)
{
if (old._len > 0) {
_b = new char[old._len];
memcpy(_b, old._b, old._len);
} else
_b = nullptr;
_len = old._len;
_offset = old._offset;
}
const buffer& operator=(const buffer& old)
{
if (old._len > 0) {
_b = new char[old._len];
memcpy(_b, old._b, old._len);
} else
_b = nullptr;
_len = old._len;
_offset = old._offset;
return (*this);
}
// Equality
bool operator==(const buffer& rhs)
{
if (_len != rhs._len || _offset != rhs._offset)
return (false);
for (size_t i = 0; i < _len; i++)
if (_b[i] != rhs._b[i])
return (false);
return true;
};
// Inequality
bool operator!=(const buffer& rhs)
{
if (_len != rhs._len || _offset != rhs._offset)
return true;
for (size_t i = 0; i < _len; i++)
if (_b[i] != rhs._b[i])
return true;
return false;
};
// Add a buffer to the end of the existing buffer
const buffer& operator+=(const buffer& b1)
{
buffer tmp(_b, _len, _offset);
// Remove existing
if (_len != 0)
delete _b;
// Whats the new length
_len = tmp._len + b1._len;
if (_len > 0) {
_b = new char[_len];
memcpy(&(this->_b[0]), &tmp._b[0], tmp._len);
memcpy(&(this->_b[tmp._len]), &b1._b[0], b1._len);
} else
_b = nullptr;
_offset = tmp._offset;
return (*this);
};
char* buf() { return (_b); };
size_t len() { return (_len); };
offset_t offset() { return _offset; };
size_t maxbuff() { return (_maxbuff); };
// Mainly here for dubug purposes of printable ascii text use at
// your own peril!!!!
std::string print()
{
std::string s;
s.append(_b, _len);
return s;
};
};
// Link Lists of buffer handling
// Keep it simple with few operators
class buffers
{
private:
std::list<buffer> _bufs;
public:
buffers() { _bufs.empty(); }
~buffers() { _bufs.clear(); }
// Add a char* string to the list
// Used when we have read in something from a file
// or to socket
void add(const char* b, size_t l)
{
buffer* newb = new buffer(b, l);
_bufs.push_back(*newb);
}
// Seek to position in file offset for a read/write
void add(const char* b, size_t l, offset_t o)
{
buffer* newb = new buffer(b, l, o);
_bufs.push_back(*newb);
}
// We have an existing buffer add it
// VERY IMPORTANT as it allocated the necessary memory
void add(const buffer& b)
{
buffer* newb = new buffer(b);
_bufs.push_back(*newb);
}
// Pop the buffer off of the front of the list
void pop()
{
if (!_bufs.empty())
_bufs.pop_front();
}
// Use at your own peril!!!
std::string print()
{
std::string s = "";
for (std::list<buffer>::iterator i = _bufs.begin(); i != _bufs.end(); i++)
s += i->print();
return s;
}
};
} // namespace saratoga
#endif // _SARATOGA_H