/
pager.cpp
249 lines (199 loc) · 5.04 KB
/
pager.cpp
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
#include "pager.h"
#include "headerbuf.h"
#include "freecache.h"
#include "exceptions.h"
#include "data.h"
#include <assert.h>
#include <math.h>
//should be ok; roughly 1,000,000 entries @ 4k page size
#define MAX_FREECHUNKS 2048
using namespace std;
using namespace ST;
uint16_t BasicBuf::get_pagesize() const
{
return m_pager? m_pager->pagesize() : 0;
}
void BasicBuf::copy(const BasicBuf &bbuf)
{
if (this == &bbuf)
return;
if (m_pager)
m_pager->return_page(*this);
m_pager = bbuf.m_pager;
m_metasize = bbuf.m_metasize;
m_lrubuf = bbuf.m_lrubuf;
if (m_lrubuf)
m_lrubuf->incref();
}
BasicBuf::~BasicBuf()
{
if (m_pager)
m_pager->return_page(*this);
}
void Pager::open(const string &file, int flags, int mode, uint32_t maxcache, uint16_t pagesize)
{
int oflags;
if (m_opened)
throw IOException("cannot call open twice", m_filename);
if (pagesize > 0)
m_pagesize = pagesize;
else
m_pagesize = FileIO::getpagesize();
//if file exists, it should have a valid header
bool strict = FileIO::exists(file);
if (flags & OPEN_WRITE)
{
oflags = O_RDWR | O_CREAT;
m_write = true;
}
else
{
oflags = O_RDONLY;
m_write = false;
}
m_io.open(file, oflags, mode);
if (strict)
{
buffer headpeak(HeaderBuf::HEADER_END);
m_io.seek(0);
m_io.read(&headpeak[0], headpeak.size());
m_pagesize = HeaderBuf::check_header(headpeak);
if (!m_pagesize)
{
m_io.close();
throw InvalidPageException("Invalid Header", file);
}
}
//lru now owns fd
m_lru.init(m_io.get_fd(), m_pagesize, maxcache);
HeaderBuf header;
//create() sets the file page size and initial page count
if (!strict)
new_page(header, 0);
read_page(header, 0);
m_pagecount = header.get_file_pagecount();
return_page(header);
m_opened = true;
m_filename = file;
if (m_write)
m_free.load(*this, 0);
}
void Pager::close()
{
if (!m_opened)
return;
HeaderBuf header;
if (m_write)
{
m_free.sync(*this, 0, FreeCache::DESTROY);
read_page_dirty(header, 0);
header.set_file_pagecount(m_pagecount);
return_page(header);
}
m_lru.close();
m_opened = false;
}
void Pager::sync()
{
HeaderBuf header;
if (m_write)
{
m_free.sync(*this, 0);
read_page_dirty(header, 0);
header.set_file_pagecount(m_pagecount);
return_page(header);
m_lru.sync();
}
}
//create tmp anon page
void Pager::new_page_tmp(BasicBuf &buf)
{
if (buf.m_pager)
buf.m_pager->return_page(buf);
buf.m_pager = this;
buf.set_lru(m_lru.new_anon());
buf.clear();
buf.create();
}
//create a new dirty page
void Pager::new_page(BasicBuf &buf, uint32_t page)
{
if (!m_write)
throw IOException("file is readonly", m_filename);
if (buf.m_pager)
buf.m_pager->return_page(buf);
buf.m_pager = this;
buf.set_lru(m_lru.new_page(page));
buf.clear();
buf.create();
buf.make_dirty();
}
void Pager::read_page(BasicBuf &buf, uint32_t page)
{
if (buf.m_pager)
buf.m_pager->return_page(buf);
buf.m_pager = this;
buf.set_lru(m_lru.get_page(page));
}
void Pager::return_page(BasicBuf &buf)
{
LRUNode *node;
assert(buf.m_pager == this);
node = buf.get_lru();
if (!node)
return;
m_lru.put_page(node);
}
uint32_t Pager::alloc_pages(uint32_t count, int flags)
{
if (!m_write)
throw IOException("file is readonly", m_filename);
uint32_t offset;
auto_ptr<FreeNode> node(m_free.pop_free(count));
if (!node.get())
{
offset = m_pagecount;
m_pagecount += count;
if (flags & ALLOC_ENSURE)
m_io.truncate(physical(m_pagecount));
}
else
{
offset = node->get_offset();
assert(node->get_span() >= count);
if (node->get_span() > count)
{
//move the remaining free space down
node->set_offset(offset + count);
node->set_span(node->get_span() - count);
m_free.push_free(node.release());
}
//else: used up all of freenode's space.
}
return offset;
}
void Pager::free_pages(uint32_t start, uint32_t count)
{
FreeNode *node;
if (!m_write)
throw IOException("file is readonly", m_filename);
assert(start > 0);
m_lru.clear_extent(start, count);
//add the free range to check for merges
node = m_free.add_free(start, count);
//truncate and remove node from free cache
if (node->get_offset() + node->get_span() >= m_pagecount)
{
m_pagecount = node->get_offset();
m_free.pop_free(node);
delete node;
m_io.truncate(physical(m_pagecount));
}
}
uint32_t Pager::bytes_to_pages(uint32_t bytes) const
{
uint32_t pages = bytes / m_pagesize;
if (bytes % m_pagesize)
pages++;
return pages;
}