forked from scylladb/seastar
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfile.hh
603 lines (533 loc) · 21.3 KB
/
file.hh
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
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
/*
* This file is open source software, licensed to you under the terms
* of the Apache License, Version 2.0 (the "License"). See the NOTICE file
* distributed with this work for additional information regarding copyright
* ownership. You may not use this file except in compliance with the License.
*
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*
* Copyright 2015 Cloudius Systems
*/
#ifndef FILE_HH_
#define FILE_HH_
#include "stream.hh"
#include "sstring.hh"
#include "core/shared_ptr.hh"
#include "core/align.hh"
#include "core/future-util.hh"
#include "core/fair_queue.hh"
#include <experimental/optional>
#include <system_error>
#include <sys/stat.h>
#include <sys/ioctl.h>
#include <linux/fs.h>
#include <sys/uio.h>
#include <unistd.h>
/// \addtogroup fileio-module
/// @{
/// Enumeration describing the type of a directory entry being listed.
///
/// \see file::list_directory()
enum class directory_entry_type {
block_device,
char_device,
directory,
fifo,
link,
regular,
socket,
};
/// Enumeration describing the type of a particular filesystem
enum class fs_type {
other,
xfs,
ext2,
ext3,
ext4,
btrfs,
hfs,
tmpfs,
};
/// A directory entry being listed.
struct directory_entry {
/// Name of the file in a directory entry. Will never be "." or "..". Only the last component is included.
sstring name;
/// Type of the directory entry, if known.
std::experimental::optional<directory_entry_type> type;
};
/// File open options
///
/// Options used to configure an open file.
///
/// \ref file
struct file_open_options {
uint64_t extent_allocation_size_hint = 1 << 20; ///< Allocate this much disk space when extending the file
bool sloppy_size = false; ///< Allow the file size not to track the amount of data written until a flush
uint64_t sloppy_size_hint = 1 << 20; ///< Hint as to what the eventual file size will be
};
/// \cond internal
class io_queue;
class io_priority_class {
unsigned val;
friend io_queue;
public:
unsigned id() const {
return val;
}
};
const io_priority_class& default_priority_class();
class file;
class file_impl {
protected:
static file_impl* get_file_impl(file& f);
public:
unsigned _memory_dma_alignment = 4096;
unsigned _disk_read_dma_alignment = 4096;
unsigned _disk_write_dma_alignment = 4096;
public:
virtual ~file_impl() {}
virtual future<size_t> write_dma(uint64_t pos, const void* buffer, size_t len, const io_priority_class& pc) = 0;
virtual future<size_t> write_dma(uint64_t pos, std::vector<iovec> iov, const io_priority_class& pc) = 0;
virtual future<size_t> read_dma(uint64_t pos, void* buffer, size_t len, const io_priority_class& pc) = 0;
virtual future<size_t> read_dma(uint64_t pos, std::vector<iovec> iov, const io_priority_class& pc) = 0;
virtual future<> flush(void) = 0;
virtual future<struct stat> stat(void) = 0;
virtual future<> truncate(uint64_t length) = 0;
virtual future<> discard(uint64_t offset, uint64_t length) = 0;
virtual future<> allocate(uint64_t position, uint64_t length) = 0;
virtual future<uint64_t> size(void) = 0;
virtual future<> close() = 0;
virtual subscription<directory_entry> list_directory(std::function<future<> (directory_entry de)> next) = 0;
friend class reactor;
};
/// \endcond
/// A data file on persistent storage.
///
/// File objects represent uncached, unbuffered files. As such great care
/// must be taken to cache data at the application layer; neither seastar
/// nor the OS will cache these file.
///
/// Data is transferred using direct memory access (DMA). This imposes
/// restrictions on file offsets and data pointers. The former must be aligned
/// on a 4096 byte boundary, while a 512 byte boundary suffices for the latter.
class file {
shared_ptr<file_impl> _file_impl;
private:
explicit file(int fd, file_open_options options);
public:
/// Default constructor constructs an uninitialized file object.
///
/// A default constructor is useful for the common practice of declaring
/// a variable, and only assigning to it later. The uninitialized file
/// must not be used, or undefined behavior will result (currently, a null
/// pointer dereference).
///
/// One can check whether a file object is in uninitialized state with
/// \ref operator bool(); One can reset a file back to uninitialized state
/// by assigning file() to it.
file() : _file_impl(nullptr) {}
file(shared_ptr<file_impl> impl)
: _file_impl(std::move(impl)) {}
/// Checks whether the file object was initialized.
///
/// \return false if the file object is uninitialized (default
/// constructed), true if the file object refers to an actual file.
explicit operator bool() const noexcept { return bool(_file_impl); }
/// Copies a file object. The new and old objects refer to the
/// same underlying file.
///
/// \param x file object to be copied
file(const file& x) = default;
/// Moves a file object.
file(file&& x) noexcept : _file_impl(std::move(x._file_impl)) {}
/// Assigns a file object. After assignent, the destination and source refer
/// to the same underlying file.
///
/// \param x file object to assign to `this`.
file& operator=(const file& x) noexcept = default;
/// Moves assigns a file object.
file& operator=(file&& x) noexcept = default;
// O_DIRECT reading requires that buffer, offset, and read length, are
// all aligned. Alignment of 4096 was necessary in the past, but no longer
// is - 512 is usually enough; But we'll need to use BLKSSZGET ioctl to
// be sure it is really enough on this filesystem. 4096 is always safe.
// In addition, if we start reading in things outside page boundaries,
// we will end up with various pages around, some of them with
// overlapping ranges. Those would be very challenging to cache.
/// Alignment requirement for file offsets (for reads)
uint64_t disk_read_dma_alignment() const {
return _file_impl->_disk_read_dma_alignment;
}
/// Alignment requirement for file offsets (for writes)
uint64_t disk_write_dma_alignment() const {
return _file_impl->_disk_write_dma_alignment;
}
/// Alignment requirement for data buffers
uint64_t memory_dma_alignment() const {
return _file_impl->_memory_dma_alignment;
}
/**
* Perform a single DMA read operation.
*
* @param aligned_pos offset to begin reading at (should be aligned)
* @param aligned_buffer output buffer (should be aligned)
* @param aligned_len number of bytes to read (should be aligned)
* @param pc the IO priority class under which to queue this operation
*
* Alignment is HW dependent but use 4KB alignment to be on the safe side as
* explained above.
*
* @return number of bytes actually read
* @throw exception in case of I/O error
*/
template <typename CharType>
future<size_t>
dma_read(uint64_t aligned_pos, CharType* aligned_buffer, size_t aligned_len, const io_priority_class& pc = default_priority_class()) {
return _file_impl->read_dma(aligned_pos, aligned_buffer, aligned_len, pc);
}
/**
* Read the requested amount of bytes starting from the given offset.
*
* @param pos offset to begin reading from
* @param len number of bytes to read
* @param pc the IO priority class under which to queue this operation
*
* @return temporary buffer containing the requested data.
* @throw exception in case of I/O error
*
* This function doesn't require any alignment for both "pos" and "len"
*
* @note size of the returned buffer may be smaller than "len" if EOF is
* reached of in case of I/O error.
*/
template <typename CharType>
future<temporary_buffer<CharType>> dma_read(uint64_t pos, size_t len, const io_priority_class& pc = default_priority_class()) {
return dma_read_bulk<CharType>(pos, len, pc).then(
[len] (temporary_buffer<CharType> buf) {
if (len < buf.size()) {
buf.trim(len);
}
return std::move(buf);
});
}
/// Error thrown when attempting to read past end-of-file
/// with \ref dma_read_exactly().
class eof_error : public std::exception {};
/**
* Read the exact amount of bytes.
*
* @param pos offset in a file to begin reading from
* @param len number of bytes to read
* @param pc the IO priority class under which to queue this operation
*
* @return temporary buffer containing the read data
* @throw end_of_file_error if EOF is reached, file_io_error or
* std::system_error in case of I/O error.
*/
template <typename CharType>
future<temporary_buffer<CharType>>
dma_read_exactly(uint64_t pos, size_t len, const io_priority_class& pc = default_priority_class()) {
return dma_read<CharType>(pos, len, pc).then(
[pos, len] (auto buf) {
if (buf.size() < len) {
throw eof_error();
}
return std::move(buf);
});
}
/// Performs a DMA read into the specified iovec.
///
/// \param pos offset to read from. Must be aligned to \ref dma_alignment.
/// \param iov vector of address/size pairs to read into. Addresses must be
/// aligned.
/// \param pc the IO priority class under which to queue this operation
///
/// \return a future representing the number of bytes actually read. A short
/// read may happen due to end-of-file or an I/O error.
future<size_t> dma_read(uint64_t pos, std::vector<iovec> iov, const io_priority_class& pc = default_priority_class()) {
return _file_impl->read_dma(pos, std::move(iov), pc);
}
/// Performs a DMA write from the specified buffer.
///
/// \param pos offset to write into. Must be aligned to \ref dma_alignment.
/// \param buffer aligned address of buffer to read from. Buffer must exists
/// until the future is made ready.
/// \param len number of bytes to write. Must be aligned.
/// \param pc the IO priority class under which to queue this operation
///
/// \return a future representing the number of bytes actually written. A short
/// write may happen due to an I/O error.
template <typename CharType>
future<size_t> dma_write(uint64_t pos, const CharType* buffer, size_t len, const io_priority_class& pc = default_priority_class()) {
return _file_impl->write_dma(pos, buffer, len, pc);
}
/// Performs a DMA write to the specified iovec.
///
/// \param pos offset to write into. Must be aligned to \ref dma_alignment.
/// \param iov vector of address/size pairs to write from. Addresses must be
/// aligned.
/// \param pc the IO priority class under which to queue this operation
///
/// \return a future representing the number of bytes actually written. A short
/// write may happen due to an I/O error.
future<size_t> dma_write(uint64_t pos, std::vector<iovec> iov, const io_priority_class& pc = default_priority_class()) {
return _file_impl->write_dma(pos, std::move(iov), pc);
}
/// Causes any previously written data to be made stable on persistent storage.
///
/// Prior to a flush, written data may or may not survive a power failure. After
/// a flush, data is guaranteed to be on disk.
future<> flush() {
return _file_impl->flush();
}
/// Returns \c stat information about the file.
future<struct stat> stat() {
return _file_impl->stat();
}
/// Truncates the file to a specified length.
future<> truncate(uint64_t length) {
return _file_impl->truncate(length);
}
/// Preallocate disk blocks for a specified byte range.
///
/// Requests the file system to allocate disk blocks to
/// back the specified range (\c length bytes starting at
/// \c position). The range may be outside the current file
/// size; the blocks can then be used when appending to the
/// file.
///
/// \param position beginning of the range at which to allocate
/// blocks.
/// \parm length length of range to allocate.
/// \return future that becomes ready when the operation completes.
future<> allocate(uint64_t position, uint64_t length) {
return _file_impl->allocate(position, length);
}
/// Discard unneeded data from the file.
///
/// The discard operation tells the file system that a range of offsets
/// (which be aligned) is no longer needed and can be reused.
future<> discard(uint64_t offset, uint64_t length) {
return _file_impl->discard(offset, length);
}
/// Gets the file size.
future<uint64_t> size() const {
return _file_impl->size();
}
/// Closes the file.
///
/// Flushes any pending operations and release any resources associated with
/// the file (except for stable storage).
///
/// \note
/// to ensure file data reaches stable storage, you must call \ref flush()
/// before calling \c close().
future<> close() {
return _file_impl->close();
}
/// Returns a directory listing, given that this file object is a directory.
subscription<directory_entry> list_directory(std::function<future<> (directory_entry de)> next) {
return _file_impl->list_directory(std::move(next));
}
/**
* Read a data bulk containing the provided addresses range that starts at
* the given offset and ends at either the address aligned to
* dma_alignment (4KB) or at the file end.
*
* @param offset starting address of the range the read bulk should contain
* @param range_size size of the addresses range
* @param pc the IO priority class under which to queue this operation
*
* @return temporary buffer containing the read data bulk.
* @throw system_error exception in case of I/O error or eof_error when
* "offset" is beyond EOF.
*/
template <typename CharType>
future<temporary_buffer<CharType>>
dma_read_bulk(uint64_t offset, size_t range_size, const io_priority_class& pc = default_priority_class());
private:
template <typename CharType>
struct read_state;
/**
* Try to read from the given position where the previous short read has
* stopped. Check the EOF condition.
*
* The below code assumes the following: short reads due to I/O errors
* always end at address aligned to HW block boundary. Therefore if we issue
* a new read operation from the next position we are promised to get an
* error (different from EINVAL). If we've got a short read because we have
* reached EOF then the above read would either return a zero-length success
* (if the file size is aligned to HW block size) or an EINVAL error (if
* file length is not aligned to HW block size).
*
* @param pos offset to read from
* @param len number of bytes to read
* @param pc the IO priority class under which to queue this operation
*
* @return temporary buffer with read data or zero-sized temporary buffer if
* pos is at or beyond EOF.
* @throw appropriate exception in case of I/O error.
*/
template <typename CharType>
future<temporary_buffer<CharType>>
read_maybe_eof(uint64_t pos, size_t len, const io_priority_class& pc = default_priority_class());
friend class reactor;
friend class file_impl;
};
/// \cond internal
template <typename CharType>
struct file::read_state {
typedef temporary_buffer<CharType> tmp_buf_type;
read_state(uint64_t offset, uint64_t front, size_t to_read,
size_t memory_alignment, size_t disk_alignment)
: buf(tmp_buf_type::aligned(memory_alignment,
align_up(to_read, disk_alignment)))
, _offset(offset)
, _to_read(to_read)
, _front(front) {}
bool done() const {
return eof || pos >= _to_read;
}
/**
* Trim the buffer to the actual number of read bytes and cut the
* bytes from offset 0 till "_front".
*
* @note this function has to be called only if we read bytes beyond
* "_front".
*/
void trim_buf_before_ret() {
if (have_good_bytes()) {
buf.trim(pos);
buf.trim_front(_front);
} else {
buf.trim(0);
}
}
uint64_t cur_offset() const {
return _offset + pos;
}
size_t left_space() const {
return buf.size() - pos;
}
size_t left_to_read() const {
// positive as long as (done() == false)
return _to_read - pos;
}
void append_new_data(tmp_buf_type& new_data) {
auto to_copy = std::min(left_space(), new_data.size());
std::memcpy(buf.get_write() + pos, new_data.get(), to_copy);
pos += to_copy;
}
bool have_good_bytes() const {
return pos > _front;
}
public:
bool eof = false;
tmp_buf_type buf;
size_t pos = 0;
private:
uint64_t _offset;
size_t _to_read;
uint64_t _front;
};
template <typename CharType>
future<temporary_buffer<CharType>>
file::dma_read_bulk(uint64_t offset, size_t range_size, const io_priority_class& pc) {
using tmp_buf_type = typename read_state<CharType>::tmp_buf_type;
auto front = offset & (disk_read_dma_alignment() - 1);
offset -= front;
range_size += front;
auto rstate = make_lw_shared<read_state<CharType>>(offset, front,
range_size,
memory_dma_alignment(),
disk_read_dma_alignment());
//
// First, try to read directly into the buffer. Most of the reads will
// end here.
//
auto read = dma_read(offset, rstate->buf.get_write(),
rstate->buf.size(), pc);
return read.then([rstate, this, &pc] (size_t size) mutable {
rstate->pos = size;
//
// If we haven't read all required data at once -
// start read-copy sequence. We can't continue with direct reads
// into the previously allocated buffer here since we have to ensure
// the aligned read length and thus the aligned destination buffer
// size.
//
// The copying will actually take place only if there was a HW glitch.
// In EOF case or in case of a persistent I/O error the only overhead is
// an extra allocation.
//
return do_until(
[rstate] { return rstate->done(); },
[rstate, this, &pc] () mutable {
return read_maybe_eof<CharType>(
rstate->cur_offset(), rstate->left_to_read(), pc).then(
[rstate] (auto buf1) mutable {
if (buf1.size()) {
rstate->append_new_data(buf1);
} else {
rstate->eof = true;
}
return make_ready_future<>();
});
}).then([rstate] () mutable {
//
// If we are here we are promised to have read some bytes beyond
// "front" so we may trim straight away.
//
rstate->trim_buf_before_ret();
return make_ready_future<tmp_buf_type>(std::move(rstate->buf));
});
});
}
template <typename CharType>
future<temporary_buffer<CharType>>
file::read_maybe_eof(uint64_t pos, size_t len, const io_priority_class& pc) {
//
// We have to allocate a new aligned buffer to make sure we don't get
// an EINVAL error due to unaligned destination buffer.
//
temporary_buffer<CharType> buf = temporary_buffer<CharType>::aligned(
memory_dma_alignment(), align_up(len, disk_read_dma_alignment()));
// try to read a single bulk from the given position
return dma_read(pos, buf.get_write(), buf.size(), pc).then_wrapped(
[buf = std::move(buf)](future<size_t> f) mutable {
try {
size_t size = std::get<0>(f.get());
buf.trim(size);
return std::move(buf);
} catch (std::system_error& e) {
//
// TODO: implement a non-trowing file_impl::dma_read() interface to
// avoid the exceptions throwing in a good flow completely.
// Otherwise for users that don't want to care about the
// underlying file size and preventing the attempts to read
// bytes beyond EOF there will always be at least one
// exception throwing at the file end for files with unaligned
// length.
//
if (e.code().value() == EINVAL) {
buf.trim(0);
return std::move(buf);
} else {
throw;
}
}
});
}
/// \endcond
/// @}
#endif /* FILE_HH_ */