sortix-mirror/ext/block.cpp

169 lines
3.8 KiB
C++
Raw Normal View History

2013-05-23 12:39:54 +00:00
/*******************************************************************************
Copyright(C) Jonas 'Sortie' Termansen 2013, 2014, 2015.
2013-05-23 12:39:54 +00:00
This program is free software: you can redistribute it and/or modify it
under the terms of the GNU 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 General Public License for
more details.
You should have received a copy of the GNU General Public License along with
this program. If not, see <http://www.gnu.org/licenses/>.
block.cpp
Blocks in the filesystem.
*******************************************************************************/
#include <sys/types.h>
2015-01-30 23:19:54 +00:00
#include <assert.h>
#include <pthread.h>
2013-05-23 12:39:54 +00:00
#include <stddef.h>
#include <stdint.h>
#include "block.h"
#include "device.h"
#include "ioleast.h"
Block::Block()
{
this->block_data = NULL;
}
2013-05-23 12:39:54 +00:00
Block::Block(Device* device, uint32_t block_id)
{
Construct(device, block_id);
}
void Block::Construct(Device* device, uint32_t block_id)
2013-05-23 12:39:54 +00:00
{
2015-01-30 23:19:54 +00:00
this->modify_lock = PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP;
this->transit_done_cond = PTHREAD_COND_INITIALIZER;
2013-05-23 12:39:54 +00:00
this->prev_block = NULL;
this->next_block = NULL;
this->prev_hashed = NULL;
this->next_hashed = NULL;
2014-10-01 20:27:19 +00:00
this->prev_dirty = NULL;
this->next_dirty = NULL;
2013-05-23 12:39:54 +00:00
this->device = device;
this->reference_count = 1;
this->block_id = block_id;
this->dirty = false;
2015-01-30 23:19:54 +00:00
this->is_in_transit = false;
2013-05-23 12:39:54 +00:00
}
Block::~Block()
{
Destruct();
delete[] block_data;
}
void Block::Destruct()
2013-05-23 12:39:54 +00:00
{
Sync();
Unlink();
}
void Block::Refer()
{
reference_count++;
}
void Block::Unref()
{
if ( !--reference_count )
{
2013-05-23 12:39:54 +00:00
#if 0
device->block_count--;
2013-05-23 12:39:54 +00:00
delete this;
#endif
}
2013-05-23 12:39:54 +00:00
}
void Block::Sync()
{
2015-01-30 23:19:54 +00:00
if ( device->has_sync_thread )
{
pthread_mutex_lock(&device->sync_thread_lock);
while ( dirty || is_in_transit )
pthread_cond_wait(&transit_done_cond, &device->sync_thread_lock);
pthread_mutex_unlock(&device->sync_thread_lock);
return;
}
2013-05-23 12:39:54 +00:00
if ( !dirty )
return;
dirty = false;
2014-10-01 20:27:19 +00:00
(prev_dirty ? prev_dirty->next_dirty : device->dirty_block) = next_dirty;
if ( next_dirty )
next_dirty->prev_dirty = prev_dirty;
prev_dirty = NULL;
next_dirty = NULL;
2013-05-23 12:39:54 +00:00
if ( !device->write )
return;
off_t file_offset = (off_t) device->block_size * (off_t) block_id;
pwriteall(device->fd, block_data, device->block_size, file_offset);
}
void Block::BeginWrite()
{
2015-01-30 23:19:54 +00:00
assert(device->write);
pthread_mutex_lock(&modify_lock);
}
void Block::FinishWrite()
2013-05-23 12:39:54 +00:00
{
2015-01-30 23:19:54 +00:00
pthread_mutex_unlock(&modify_lock);
pthread_mutex_lock(&device->sync_thread_lock);
2014-10-01 20:27:19 +00:00
if ( !dirty )
{
dirty = true;
prev_dirty = NULL;
next_dirty = device->dirty_block;
if ( next_dirty )
next_dirty->prev_dirty = this;
device->dirty_block = this;
2015-01-30 23:19:54 +00:00
pthread_cond_signal(&device->sync_thread_cond);
2014-10-01 20:27:19 +00:00
}
2015-01-30 23:19:54 +00:00
pthread_mutex_unlock(&device->sync_thread_lock);
2013-05-23 12:39:54 +00:00
Use();
}
void Block::Use()
{
Unlink();
Prelink();
}
void Block::Unlink()
{
(prev_block ? prev_block->next_block : device->mru_block) = next_block;
(next_block ? next_block->prev_block : device->lru_block) = prev_block;
size_t bin = block_id % DEVICE_HASH_LENGTH;
(prev_hashed ? prev_hashed->next_hashed : device->hash_blocks[bin]) = next_hashed;
if ( next_hashed ) next_hashed->prev_hashed = prev_hashed;
}
void Block::Prelink()
{
prev_block = NULL;
next_block = device->mru_block;
if ( device->mru_block )
device->mru_block->prev_block = this;
device->mru_block = this;
if ( !device->lru_block )
device->lru_block = this;
size_t bin = block_id % DEVICE_HASH_LENGTH;
prev_hashed = NULL;
next_hashed = device->hash_blocks[bin];
device->hash_blocks[bin] = this;
if ( next_hashed )
next_hashed->prev_hashed = this;
}