-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFileJournal.h
478 lines (417 loc) · 12.1 KB
/
FileJournal.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
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2004-2006 Sage Weil <[email protected]>
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef CEPH_FILEJOURNAL_H
#define CEPH_FILEJOURNAL_H
#include <deque>
using std::deque;
#include "Journal.h"
#include "common/Cond.h"
#include "common/Mutex.h"
#include "common/Thread.h"
#include "common/Throttle.h"
#ifdef HAVE_LIBAIO
# include <libaio.h>
#endif
/**
* Implements journaling on top of block device or file.
*
* Lock ordering is write_lock > aio_lock > finisher_lock
*/
class FileJournal : public Journal {
public:
/// Protected by finisher_lock
struct completion_item {
uint64_t seq;
Context *finish;
utime_t start;
TrackedOpRef tracked_op;
completion_item(uint64_t o, Context *c, utime_t s,
TrackedOpRef opref)
: seq(o), finish(c), start(s), tracked_op(opref) {}
completion_item() : seq(0), finish(0), start(0) {}
};
struct write_item {
uint64_t seq;
bufferlist bl;
int alignment;
TrackedOpRef tracked_op;
write_item(uint64_t s, bufferlist& b, int al, TrackedOpRef opref) :
seq(s), alignment(al), tracked_op(opref) {
bl.claim(b);
}
write_item() : seq(0), alignment(0) {}
};
Mutex finisher_lock;
Cond finisher_cond;
uint64_t journaled_seq;
bool plug_journal_completions;
Mutex writeq_lock;
Cond writeq_cond;
deque<write_item> writeq;
bool writeq_empty();
write_item &peek_write();
void pop_write();
Mutex completions_lock;
deque<completion_item> completions;
bool completions_empty() {
Mutex::Locker l(completions_lock);
return completions.empty();
}
completion_item completion_peek_front() {
Mutex::Locker l(completions_lock);
assert(!completions.empty());
return completions.front();
}
void completion_pop_front() {
Mutex::Locker l(completions_lock);
assert(!completions.empty());
completions.pop_front();
}
void submit_entry(uint64_t seq, bufferlist& bl, int alignment,
Context *oncommit,
TrackedOpRef osd_op = TrackedOpRef());
/// End protected by finisher_lock
/*
* journal header
*/
struct header_t {
enum {
FLAG_CRC = (1<<0),
// NOTE: remove kludgey weirdness in read_header() next time a flag is added.
};
uint64_t flags;
uuid_d fsid;
__u32 block_size;
__u32 alignment;
int64_t max_size; // max size of journal ring buffer
int64_t start; // offset of first entry
uint64_t committed_up_to; // committed up to
/**
* start_seq
*
* entry at header.start has sequence >= start_seq
*
* Generally, the entry at header.start will have sequence
* start_seq if it exists. The only exception is immediately
* after journal creation since the first sequence number is
* not known.
*
* If the first read on open fails, we can assume corruption
* if start_seq > committed_up_thru because the entry would have
* a sequence >= start_seq and therefore > committed_up_thru.
*/
uint64_t start_seq;
header_t() :
flags(0), block_size(0), alignment(0), max_size(0), start(0),
committed_up_to(0), start_seq(0) {}
void clear() {
start = block_size;
}
uint64_t get_fsid64() {
return *(uint64_t*)&fsid.uuid[0];
}
void encode(bufferlist& bl) const {
__u32 v = 4;
::encode(v, bl);
bufferlist em;
{
::encode(flags, em);
::encode(fsid, em);
::encode(block_size, em);
::encode(alignment, em);
::encode(max_size, em);
::encode(start, em);
::encode(committed_up_to, em);
::encode(start_seq, em);
}
::encode(em, bl);
}
void decode(bufferlist::iterator& bl) {
__u32 v;
::decode(v, bl);
if (v < 2) { // normally 0, but concievably 1
// decode old header_t struct (pre v0.40).
bl.advance(4); // skip __u32 flags (it was unused by any old code)
flags = 0;
uint64_t tfsid;
::decode(tfsid, bl);
*(uint64_t*)&fsid.uuid[0] = tfsid;
*(uint64_t*)&fsid.uuid[8] = tfsid;
::decode(block_size, bl);
::decode(alignment, bl);
::decode(max_size, bl);
::decode(start, bl);
committed_up_to = 0;
start_seq = 0;
return;
}
bufferlist em;
::decode(em, bl);
bufferlist::iterator t = em.begin();
::decode(flags, t);
::decode(fsid, t);
::decode(block_size, t);
::decode(alignment, t);
::decode(max_size, t);
::decode(start, t);
if (v > 2)
::decode(committed_up_to, t);
else
committed_up_to = 0;
if (v > 3)
::decode(start_seq, t);
else
start_seq = 0;
}
} header;
struct entry_header_t {
uint64_t seq; // fs op seq #
uint32_t crc32c; // payload only. not header, pre_pad, post_pad, or footer.
uint32_t len;
uint32_t pre_pad, post_pad;
uint64_t magic1;
uint64_t magic2;
void make_magic(off64_t pos, uint64_t fsid) {
magic1 = pos;
magic2 = fsid ^ seq ^ len;
}
bool check_magic(off64_t pos, uint64_t fsid) {
return
magic1 == (uint64_t)pos &&
magic2 == (fsid ^ seq ^ len);
}
} __attribute__((__packed__, aligned(4)));
private:
string fn;
char *zero_buf;
off64_t max_size;
size_t block_size;
bool directio, aio, force_aio;
bool must_write_header;
off64_t write_pos; // byte where the next entry to be written will go
off64_t read_pos; //
#ifdef HAVE_LIBAIO
/// state associated with an in-flight aio request
/// Protected by aio_lock
struct aio_info {
struct iocb iocb;
bufferlist bl;
struct iovec *iov;
bool done;
uint64_t off, len; ///< these are for debug only
uint64_t seq; ///< seq number to complete on aio completion, if non-zero
aio_info(bufferlist& b, uint64_t o, uint64_t s)
: iov(NULL), done(false), off(o), len(b.length()), seq(s) {
bl.claim(b);
memset((void*)&iocb, 0, sizeof(iocb));
}
~aio_info() {
delete[] iov;
}
};
Mutex aio_lock;
Cond aio_cond;
Cond write_finish_cond;
io_context_t aio_ctx;
list<aio_info> aio_queue;
int aio_num, aio_bytes;
/// End protected by aio_lock
#endif
uint64_t last_committed_seq;
uint64_t journaled_since_start;
/*
* full states cycle at the beginnging of each commit epoch, when commit_start()
* is called.
* FULL - we just filled up during this epoch.
* WAIT - we filled up last epoch; now we have to wait until everything during
* that epoch commits to the fs before we can start writing over it.
* NOTFULL - all good, journal away.
*/
enum {
FULL_NOTFULL = 0,
FULL_FULL = 1,
FULL_WAIT = 2,
} full_state;
int fd;
// in journal
deque<pair<uint64_t, off64_t> > journalq; // track seq offsets, so we can trim later.
uint64_t writing_seq;
// throttle
Throttle throttle_ops, throttle_bytes;
void put_throttle(uint64_t ops, uint64_t bytes);
// write thread
Mutex write_lock;
bool write_stop;
Cond commit_cond;
int _open(bool wr, bool create=false);
int _open_block_device();
void _check_disk_write_cache() const;
int _open_file(int64_t oldsize, blksize_t blksize, bool create);
void print_header();
int read_header();
bufferptr prepare_header();
void start_writer();
void stop_writer();
void write_thread_entry();
void queue_completions_thru(uint64_t seq);
int check_for_full(uint64_t seq, off64_t pos, off64_t size);
int prepare_multi_write(bufferlist& bl, uint64_t& orig_ops, uint64_t& orig_bytee);
int prepare_single_write(bufferlist& bl, off64_t& queue_pos, uint64_t& orig_ops, uint64_t& orig_bytes);
void do_write(bufferlist& bl);
void write_finish_thread_entry();
void check_aio_completion();
void do_aio_write(bufferlist& bl);
int write_aio_bl(off64_t& pos, bufferlist& bl, uint64_t seq);
void align_bl(off64_t pos, bufferlist& bl);
int write_bl(off64_t& pos, bufferlist& bl);
/// read len from journal starting at in_pos and wrapping up to len
void wrap_read_bl(
off64_t in_pos, ///< [in] start position
int64_t len, ///< [in] length to read
bufferlist* bl, ///< [out] result
off64_t *out_pos ///< [out] next position to read, will be wrapped
);
class Writer : public Thread {
FileJournal *journal;
public:
Writer(FileJournal *fj) : journal(fj) {}
void *entry() {
journal->write_thread_entry();
return 0;
}
} write_thread;
class WriteFinisher : public Thread {
FileJournal *journal;
public:
WriteFinisher(FileJournal *fj) : journal(fj) {}
void *entry() {
journal->write_finish_thread_entry();
return 0;
}
} write_finish_thread;
off64_t get_top() {
return ROUND_UP_TO(sizeof(header), block_size);
}
public:
FileJournal(uuid_d fsid, Finisher *fin, Cond *sync_cond, const char *f, bool dio=false, bool ai=true, bool faio=false) :
Journal(fsid, fin, sync_cond),
finisher_lock("FileJournal::finisher_lock", false, true, false, g_ceph_context),
journaled_seq(0),
plug_journal_completions(false),
writeq_lock("FileJournal::writeq_lock", false, true, false, g_ceph_context),
completions_lock(
"FileJournal::completions_lock", false, true, false, g_ceph_context),
fn(f),
zero_buf(NULL),
max_size(0), block_size(0),
directio(dio), aio(ai), force_aio(faio),
must_write_header(false),
write_pos(0), read_pos(0),
#ifdef HAVE_LIBAIO
aio_lock("FileJournal::aio_lock"),
aio_ctx(0),
aio_num(0), aio_bytes(0),
#endif
last_committed_seq(0),
journaled_since_start(0),
full_state(FULL_NOTFULL),
fd(-1),
writing_seq(0),
throttle_ops(g_ceph_context, "filestore_ops"),
throttle_bytes(g_ceph_context, "filestore_bytes"),
write_lock("FileJournal::write_lock", false, true, false, g_ceph_context),
write_stop(false),
write_thread(this),
write_finish_thread(this) { }
~FileJournal() {
delete[] zero_buf;
}
int check();
int create();
int open(uint64_t fs_op_seq);
void close();
int peek_fsid(uuid_d& fsid);
int dump(ostream& out);
void flush();
void throttle();
bool is_writeable() {
return read_pos == 0;
}
int make_writeable();
// writes
void commit_start(uint64_t seq);
void committed_thru(uint64_t seq);
bool should_commit_now() {
return full_state != FULL_NOTFULL;
}
void set_wait_on_full(bool b) { wait_on_full = b; }
// reads
/// Result code for read_entry
enum read_entry_result {
SUCCESS,
FAILURE,
MAYBE_CORRUPT
};
/**
* read_entry
*
* Reads next entry starting at pos. If the entry appears
* clean, *bl will contain the payload, *seq will contain
* the sequence number, and *out_pos will reflect the next
* read position. If the entry is invalid *ss will contain
* debug text, while *seq, *out_pos, and *bl will be unchanged.
*
* If the entry suggests a corrupt log, *ss will contain debug
* text, *out_pos will contain the next index to check. If
* we find an entry in this way that returns SUCCESS, the journal
* is most likely corrupt.
*/
read_entry_result do_read_entry(
off64_t pos, ///< [in] position to read
off64_t *next_pos, ///< [out] next position to read
bufferlist* bl, ///< [out] payload for successful read
uint64_t *seq, ///< [out] seq of successful read
ostream *ss, ///< [out] error output
entry_header_t *h = 0 ///< [out] header
); ///< @return result code
bool read_entry(
bufferlist &bl,
uint64_t &last_seq,
bool *corrupt
);
bool read_entry(
bufferlist &bl,
uint64_t &last_seq) {
return read_entry(bl, last_seq, 0);
}
// Debug/Testing
void get_header(
uint64_t wanted_seq,
off64_t *_pos,
entry_header_t *h);
void corrupt(
int wfd,
off64_t corrupt_at);
void corrupt_payload(
int wfd,
uint64_t seq);
void corrupt_footer_magic(
int wfd,
uint64_t seq);
void corrupt_header_magic(
int wfd,
uint64_t seq);
};
WRITE_CLASS_ENCODER(FileJournal::header_t)
#endif