vitastor/blockstore_write.cpp

145 lines
5.7 KiB
C++
Raw Normal View History

2019-11-07 02:24:12 +03:00
#include "blockstore.h"
// First step of the write algorithm: dequeue operation and submit initial write(s)
int blockstore::dequeue_write(blockstore_operation *op)
{
auto dirty_it = dirty_db.find((obj_ver_id){
.oid = op->oid,
.version = op->version,
});
2019-11-07 02:24:12 +03:00
if (op->len == block_size)
{
// Big (redirect) write
uint64_t loc = allocator_find_free(data_alloc);
if (loc == (uint64_t)-1)
{
// no space
op->retval = -ENOSPC;
op->callback(op);
return 1;
}
struct io_uring_sqe *sqe = get_sqe();
if (!sqe)
{
// Pause until there are more requests available
op->wait_for = WAIT_SQE;
op->wait_detail = 1;
2019-11-07 02:24:12 +03:00
return 0;
}
struct ring_data_t *data = ((ring_data_t*)sqe->user_data);
dirty_it->second.location = loc << block_order;
2019-11-08 02:16:31 +03:00
dirty_it->second.state = ST_D_SUBMITTED;
2019-11-07 02:24:12 +03:00
allocator_set(data_alloc, loc, true);
data->iov = (struct iovec){ op->buf, op->len };
data->op = op;
io_uring_prep_writev(
sqe, data_fd, &data->iov, 1, data_offset + (loc << block_order)
);
op->pending_ops = 1;
op->used_journal_sector = 0;
2019-11-07 02:24:12 +03:00
}
else
{
// Small (journaled) write
// First check if the journal has sufficient space
// FIXME Always two SQEs for now. Although it's possible to send 1 sometimes
bool two_sqes = true;
uint64_t next_pos = journal.next_free;
if (512 - journal.in_sector_pos < sizeof(struct journal_entry_small_write))
2019-11-07 02:24:12 +03:00
{
next_pos = next_pos + 512;
//if (journal.len - next_pos < op->len)
// two_sqes = true;
if (next_pos >= journal.len)
2019-11-07 02:24:12 +03:00
next_pos = 512;
// Also check if we have an unused memory buffer for the journal sector
if (journal.sector_info[((journal.cur_sector + 1) % journal.sector_count)].usage_count > 0)
{
// No memory buffer available. Wait for it.
op->wait_for = WAIT_JOURNAL_BUFFER;
return 0;
}
2019-11-07 02:24:12 +03:00
}
//else if (journal.sector_info[journal.cur_sector].offset + 512 != journal.next_free ||
// journal.len - next_pos < op->len)
// two_sqes = true;
next_pos = (journal.len - next_pos < op->len ? 512 : next_pos) + op->len;
if (next_pos >= journal.used_start)
2019-11-07 02:24:12 +03:00
{
// No space in the journal. Wait for it.
2019-11-07 02:24:12 +03:00
op->wait_for = WAIT_JOURNAL;
op->wait_detail = next_pos;
2019-11-07 02:24:12 +03:00
return 0;
}
// There is sufficient space. Get SQE(s)
unsigned prev_sqe_pos = ringloop->ring->sq.sqe_tail;
2019-11-07 02:24:12 +03:00
struct io_uring_sqe *sqe1 = get_sqe(), *sqe2 = two_sqes ? get_sqe() : NULL;
if (!sqe1 || two_sqes && !sqe2)
{
// Pause until there are more requests available
op->wait_for = WAIT_SQE;
op->wait_detail = two_sqes ? 2 : 1;
ringloop->ring->sq.sqe_tail = prev_sqe_pos;
2019-11-07 02:24:12 +03:00
return 0;
}
struct ring_data_t *data1 = ((ring_data_t*)sqe1->user_data);
struct ring_data_t *data2 = two_sqes ? ((ring_data_t*)sqe2->user_data) : NULL;
// Got SQEs. Prepare journal sector write
if (512 - journal.in_sector_pos < sizeof(struct journal_entry_small_write))
2019-11-07 02:24:12 +03:00
{
// Move to the next journal sector
// Also select next sector buffer in memory
journal.cur_sector = ((journal.cur_sector + 1) % journal.sector_count);
journal.sector_info[journal.cur_sector].offset = journal.next_free;
journal.in_sector_pos = 0;
journal.next_free = (journal.next_free + 512) >= journal.len ? journal.next_free + 512 : 512;
memset(journal.sector_buf + 512*journal.cur_sector, 0, 512);
2019-11-07 02:24:12 +03:00
}
journal_entry_small_write *je = (struct journal_entry_small_write*)(
journal.sector_buf + 512*journal.cur_sector + journal.in_sector_pos
);
2019-11-07 02:24:12 +03:00
*je = {
.crc32 = 0,
.magic = JOURNAL_MAGIC,
.type = JE_SMALL_WRITE,
.size = sizeof(struct journal_entry_small_write),
.crc32_prev = journal.crc32_last,
2019-11-07 02:24:12 +03:00
.oid = op->oid,
.version = op->version,
.offset = op->offset,
.len = op->len,
};
je->crc32 = je_crc32((journal_entry*)je);
data1->iov = (struct iovec){ journal.sector_buf + 512*journal.cur_sector, 512 };
2019-11-07 02:24:12 +03:00
data1->op = op;
io_uring_prep_writev(
sqe1, journal.fd, &data1->iov, 1, journal.offset + journal.sector_info[journal.cur_sector].offset
2019-11-07 02:24:12 +03:00
);
// Prepare journal data write
if (journal.len - journal.next_free < op->len)
journal.next_free = 512;
2019-11-07 02:24:12 +03:00
data2->iov = (struct iovec){ op->buf, op->len };
data2->op = op;
io_uring_prep_writev(
sqe2, journal.fd, &data2->iov, 1, journal.offset + journal.next_free
2019-11-07 02:24:12 +03:00
);
dirty_it->second.location = journal.next_free;
2019-11-08 02:16:31 +03:00
dirty_it->second.state = ST_J_SUBMITTED;
// Move journal.next_free and save last write for current sector
journal.next_free += op->len;
if (journal.next_free >= journal.len)
journal.next_free = 512;
journal.sector_info[journal.cur_sector].usage_count++;
journal.crc32_last = je->crc32;
2019-11-07 02:24:12 +03:00
op->pending_ops = 2;
op->used_journal_sector = 1 + journal.cur_sector;
2019-11-07 02:24:12 +03:00
}
in_process_ops.insert(op);
int ret = ringloop->submit();
if (ret < 0)
{
throw new std::runtime_error(std::string("io_uring_submit: ") + strerror(-ret));
}
return 1;
}