Page MenuHomeClusterLabs Projects
Files F2825018

buffer.c
No OneTemporary
Actions

buffer.c
View Options

#define _XOPEN_SOURCE 500 /* pwrite */
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <unistd.h>
#include <errno.h>
#include "list.h"
#include "buffer.h"
#include "trace.h"
#define buftrace trace_off
/*
* Kernel-like buffer layer
*/
/*
* Even though we are in user space, for reasons of durability and speed
* we need to access the block directly, handle our own block caching and
* keep track block by block of which parts of the on-disk data structures
* as they are accessed and modified. There's no need to reinvent the
* wheel here. I have basically cloned the traditional Unix kernel buffer
* paradigm, with one small twists of my own, that is, instead of state
* bits we use scalar values. This captures the notion of buffer state
* transitions more precisely than the traditional approach.
*
* One big benefit of using a buffer paradigm that looks and acts very
* much like the kernel incarnation is, porting this into the kernel is
* going to be a whole lot easier. Most higher level code will not need
* to be modified at all. Another benefit is, it will be much easier to
* add async IO.
*/
static struct buffer *buffer_table[BUFFER_BUCKETS];
LIST_HEAD(dirty_buffers);
unsigned dirty_buffer_count;
void set_buffer_dirty(struct buffer *buffer)
{
buftrace(printf("set_buffer_dirty %llx state=%u\n", buffer->sector, buffer->flags & BUFFER_STATE_MASK);)
if (!buffer_dirty(buffer)) {
list_add_tail(&buffer->list, &dirty_buffers);
dirty_buffer_count++;
}
buffer->flags = BUFFER_STATE_DIRTY | (buffer->flags & ~BUFFER_STATE_MASK);
}
void set_buffer_uptodate(struct buffer *buffer)
{
if (buffer_dirty(buffer)) {
list_del(&buffer->list);
dirty_buffer_count--;
}
buffer->flags = BUFFER_STATE_CLEAN | (buffer->flags & ~BUFFER_STATE_MASK);
}
void brelse(struct buffer *buffer)
{
buftrace(printf("Release buffer %llx\n", buffer->sector);)
if (!--buffer->count)
trace_off(printf("Free buffer %llx\n", buffer->sector));
}
void brelse_dirty(struct buffer *buffer)
{
buftrace(printf("Release dirty buffer %llx\n", buffer->sector);)
set_buffer_dirty(buffer);
brelse(buffer);
}
int read_buffer(struct buffer *buffer)
{
buftrace(warn("read buffer %llx", buffer->sector);)
lseek(buffer->fd, buffer->sector << SECTOR_BITS , SEEK_SET);
unsigned count = 0;
while (count < buffer->size)
{
int n = read(buffer->fd, buffer->data, buffer->size - count);
if (n == -1)
{
printf("read error %i %s %i\n", errno, strerror(errno), buffer->size - count);
return errno;
}
count += n;
}
set_buffer_uptodate(buffer);
return 0;
}
int write_buffer_to(struct buffer *buffer, sector_t sector)
{
while (pwrite(buffer->fd, buffer->data, buffer->size, sector << SECTOR_BITS) == -1)
if (errno != EAGAIN)
return errno;
return 0;
}
int write_buffer(struct buffer *buffer)
{
buftrace(warn("write buffer %Lx/%u", buffer->sector, buffer->size);)
int err;
if ((err = write_buffer_to(buffer, buffer->sector)))
return err;
set_buffer_uptodate(buffer);
return 0;
}
unsigned buffer_hash(sector_t sector)
{
return (((sector >> 32) ^ (sector_t)sector) * 978317583) % BUFFER_BUCKETS;
}
struct buffer *new_buffer(sector_t sector, unsigned size)
{
buftrace(printf("Allocate buffer for %llx\n", sector);)
struct buffer *buffer = (struct buffer *)malloc(sizeof(struct buffer));
buffer->data = malloc_aligned(size, size); // what if malloc fails?
buffer->count = 1;
buffer->flags = 0;
buffer->size = size;
buffer->sector = sector;
return buffer;
}
struct buffer *getblk(unsigned fd, sector_t sector, unsigned size)
{
struct buffer **bucket = &buffer_table[buffer_hash(sector)], *buffer;
for (buffer = *bucket; buffer; buffer = buffer->hashlist)
if (buffer->sector == sector) {
buftrace(printf("Found buffer for %llx\n", sector);)
buffer->count++;
return buffer;
}
buffer = new_buffer(sector, size);
buffer->fd = fd;
buffer->hashlist = *bucket;
*bucket = buffer;
return buffer;
}
struct buffer *bread(unsigned fd, sector_t sector, unsigned size)
{
struct buffer *buffer = getblk(fd, sector, size);
if (buffer_uptodate(buffer) || buffer_dirty(buffer))
return buffer;
read_buffer(buffer);
if (buffer_uptodate(buffer))
return buffer;
brelse(buffer);
error("bad read");
return NULL;
}
void evict_buffer(struct buffer *buffer)
{
if (buffer_dirty(buffer))
set_buffer_uptodate(buffer);
struct buffer **pbuffer = &buffer_table[buffer_hash(buffer->sector)];
for (; *pbuffer; pbuffer = &(*pbuffer)->hashlist)
if (*pbuffer == buffer) {
*pbuffer = buffer->hashlist;
buftrace(printf("Evict buffer for %llx\n", buffer->sector);)
// free(buffer->data); // !!! malloc_aligned means pointer is wrong
free(buffer);
return;
}
error("buffer not found");
}
void evict_buffers(void) // !!! should use lru list
{
unsigned i;
for (i = 0; i < BUFFER_BUCKETS; i++)
{
struct buffer *buffer;
for (buffer = buffer_table[i]; buffer;) {
struct buffer *next = buffer->hashlist;
if (!buffer->count)
evict_buffer(buffer);
buffer = next;
}
}
}
void flush_buffers(void) // !!! should use lru list
{
while (!list_empty(&dirty_buffers)) {
struct list_head *entry = dirty_buffers.next;
struct buffer *buffer = list_entry(entry, struct buffer, list);
if (buffer_dirty(buffer))
write_buffer(buffer);
}
}
void show_buffer(struct buffer *buffer)
{
printf("%s%llx/%i ",
buffer_dirty(buffer)? "+": buffer_uptodate(buffer)? "": "?",
buffer->sector, buffer->count);
}
void show_buffers_(int all)
{
unsigned i;
for (i = 0; i < BUFFER_BUCKETS; i++)
{
struct buffer *buffer = buffer_table[i];
if (!buffer)
continue;
printf("[%i] ", i);
for (; buffer; buffer = buffer->hashlist)
if (all || buffer->count)
show_buffer(buffer);
printf("\n");
}
}
void show_active_buffers(void)
{
printf("Active buffers:\n");
show_buffers_(0);
}
void show_buffers(void)
{
printf("Buffers:\n");
show_buffers_(1);
}
void show_dirty_buffers(void)
{
struct list_head *list;
printf("Dirty buffers: ");
list_for_each(list, &dirty_buffers) {
struct buffer *buffer = list_entry(list, struct buffer, list);
printf("%llx ", buffer->sector);
}
printf("\n");
}
#if 0
void dump_buffer(struct buffer *buffer, unsigned offset, unsigned length)
{
hexdump(buffer->data + offset, length);
}
#endif
void init_buffers(void)
{
memset(buffer_table, 0, sizeof(buffer_table));
INIT_LIST_HEAD(&dirty_buffers);
dirty_buffer_count = 0;
}

File Metadata

Mime Type
text/x-c
Expires
Sat, Jan 25, 11:12 AM (1 d, 7 h)
Storage Engine
blob
Storage Format
Raw Data
Storage Handle
1322301
Default Alt Text
buffer.c (6 KB)

Event Timeline