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
|
// Copyright Notice (GNU Affero GPL) {{{
/* Cyndir - (Awesome) Memory Mapped Dictionary
* Copyright (C) 2010 Jay Freeman (saurik)
*/
/*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* 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/>.
*/
// }}}
#ifndef CYTORE_HPP
#define CYTORE_HPP
#include <fcntl.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <cstdio>
#include <cstdlib>
#include <errno.h>
#include <stdint.h>
#include <unistd.h>
#define _assert(test) do \
if (!(test)) { \
fprintf(stderr, "_assert(%d:%s)@%s:%u[%s]\n", errno, #test, __FILE__, __LINE__, __FUNCTION__); \
exit(-1); \
} \
while (false)
namespace Cytore {
static const uint32_t Magic = 'cynd';
struct Header {
uint32_t magic_;
uint32_t version_;
uint32_t size_;
uint32_t reserved_;
} _packed;
template <typename Target_>
class Offset {
private:
uint32_t offset_;
public:
Offset() :
offset_(0)
{
}
Offset(uint32_t offset) :
offset_(offset)
{
}
Offset &operator =(uint32_t offset) {
offset_ = offset;
return *this;
}
uint32_t GetOffset() const {
return offset_;
}
bool IsNull() const {
return offset_ == 0;
}
} _packed;
struct Block {
Cytore::Offset<void> reserved_;
} _packed;
template <typename Type_>
static _finline Type_ Round(Type_ value, Type_ size) {
Type_ mask(size - 1);
return value + mask & ~mask;
}
template <typename Base_>
class File {
private:
static const unsigned Shift_ = 17;
static const size_t Block_ = 1 << Shift_;
static const size_t Mask_ = Block_ - 1;
private:
int file_;
typedef std::vector<uint8_t *> BlockVector_;
BlockVector_ blocks_;
struct Mapping_ {
uint8_t *data_;
size_t size_;
Mapping_(uint8_t *data, size_t size) :
data_(data),
size_(size)
{
}
};
typedef std::vector<Mapping_> MappingVector_;
MappingVector_ maps_;
Header &Header_() {
return *reinterpret_cast<Header *>(blocks_[0]);
}
uint32_t &Size_() {
return Header_().size_;
}
void Map_(size_t size) {
size_t before(blocks_.size() * Block_);
size_t extend(size - before);
void *data(mmap(NULL, extend, PROT_READ | PROT_WRITE, MAP_FILE | MAP_SHARED, file_, before));
_assert(data != MAP_FAILED);
uint8_t *bytes(reinterpret_cast<uint8_t *>(data));
maps_.push_back(Mapping_(bytes, extend));
for (size_t i(0); i != extend >> Shift_; ++i)
blocks_.push_back(bytes + Block_ * i);
}
void Close_() {
for (typename MappingVector_::const_iterator map(maps_.begin()); map != maps_.end(); ++map)
munmap(map->data_, map->size_);
maps_.clear();
blocks_.clear();
close(file_);
file_ = -1;
}
bool Truncate_(size_t capacity) {
capacity = Round(capacity, Block_);
int error(ftruncate(file_, capacity));
if (error != 0)
return false;
Map_(capacity);
return true;
}
public:
File() :
file_(-1)
{
}
File(const char *path) :
file_(-1)
{
Open(path);
}
~File() {
Close_();
}
void Sync() {
for (typename MappingVector_::const_iterator map(maps_.begin()); map != maps_.end(); ++map)
msync(map->data_, map->size_, MS_SYNC);
}
size_t Capacity() const {
return blocks_.size() * Block_;
}
void Open(const char *path) { open:
_assert(file_ == -1);
file_ = open(path, O_RDWR | O_CREAT | O_EXLOCK, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);
_assert(file_ != -1);
_assert(file_ != STDOUT_FILENO);
_assert(file_ != STDERR_FILENO);
struct stat stat;
_assert(fstat(file_, &stat) == 0);
size_t core(sizeof(Header) + sizeof(Base_));
size_t size(stat.st_size);
if (size == 0) {
if (!Truncate_(core)) {
unlink(path);
_assert(false);
}
Header_().magic_ = Magic;
Size_() = core;
// XXX: this involves an unneccessary call to ftruncate()
} else if (size < core || !Truncate_(size) || Header_().magic_ != Magic || Header_().version_ != 0) {
Close_();
_assert(unlink(path) == 0);
goto open;
}
}
bool Reserve(size_t capacity) {
if (capacity <= Capacity())
return true;
uint8_t *block(blocks_.back());
blocks_.pop_back();
if (Truncate_(capacity))
return true;
else {
blocks_.push_back(block);
return false;
}
}
template <typename Target_>
Target_ &Get(uint32_t offset) {
return *reinterpret_cast<Target_ *>(offset == 0 ? NULL : blocks_[offset >> Shift_] + (offset & Mask_));
}
template <typename Target_>
Target_ &Get(Offset<Target_> &ref) {
return Get<Target_>(ref.GetOffset());
}
Base_ *operator ->() {
return &Get<Base_>(sizeof(Header));
}
template <typename Target_>
Offset<Target_> New(size_t extra = 0) {
size_t size(sizeof(Target_) + extra);
size = Round(size, sizeof(uintptr_t));
uint32_t offset;
if (!Reserve(Size_() + size))
offset = 0;
else {
offset = Size_();
Size_() += size;
}
return Offset<Target_>(offset);
}
};
}
#endif//CYTORE_HPP
|