shithub: gefs

ref: eed6e68174a13a4b7c0b39acdcfa911a302f96c2
dir: /ream.c/

#include <u.h>
#include <libc.h>
#include <bio.h>
#include <fcall.h>
#include <avl.h>

#include "dat.h"
#include "fns.h"


static void
initroot(Blk *r)
{
	char *p, kbuf[Keymax], vbuf[Inlmax];
	Kvp kv;
	Xdir d;

	/* nb: values must be inserted in key order */
	memset(&d, 0, sizeof(Dir));
	d.qid = (Qid){fs->nextqid++, 0, QTDIR};
	d.mode = DMDIR|0755;
	d.atime = 0;
	d.mtime = 0;
	d.length = 0;
	d.name = "";
	d.uid = 2;
	d.gid = 2;
	d.muid = 2;
	if(dir2kv(-1, &d, &kv, vbuf, sizeof(vbuf)) == -1)
		sysfatal("ream: pack root: %r");
	setval(r, 0, &kv);

	if((p = packsuper(kbuf, sizeof(kbuf), 0)) == nil)
		sysfatal("ream: pack super");
	kv.k = kbuf;
	kv.nk = p - kbuf;
	if((p = packdkey(vbuf, sizeof(vbuf), -1, "")) == nil)
		sysfatal("ream: pack super");
	kv.v = vbuf;
	kv.nv = p - vbuf;
	setval(r, 1, &kv);
}

static void
initsnap(Blk *s, Blk *r)
{
	char *p, kbuf[Keymax], vbuf[Treesz];
	Tree t;
	Kvp kv;
	int i;


	kv.k = kbuf;
	kv.v = vbuf;
	kv.k[0] = Klabel;
	kv.nk = 1 + snprint(kv.k+1, sizeof(kbuf)-1, "main");
	kv.v[0] = Ksnap;
	PBIT64(kv.v+1, 0);
	kv.nv = Snapsz;
	setval(s, 0, &kv);

	kv.k[0] = Ksnap;
	PBIT64(kv.k+1, 0);
	kv.nk = Snapsz;

	memset(&t, 0, sizeof(Tree));
	t.ref = 2;
	t.ht = 1;
	t.gen = 0;
	t.bp = r->bp;
	for(i = 0; i < Ndead; i++){
		t.dead[i].prev = -1;
		t.dead[i].head.addr = -1;
		t.dead[i].head.hash = -1;
		t.dead[i].head.gen = -1;
		t.dead[i].ins = nil;
	}
	p = packtree(vbuf, sizeof(vbuf), &t);
	kv.v = vbuf;
	kv.nv = p - vbuf;
	setval(s, 1, &kv);
}

static void
initarena(Arena *a, vlong start, vlong asz)
{
	vlong addr, bo, bh;
	char *p;
	Blk *b;

	addr = start;
	if((b = mallocz(sizeof(Blk), 1)) == nil)
		sysfatal("ream: %r");
	addr += Blksz;	/* arena header */

	a->head.addr = -1;
	a->head.hash = -1;
	a->head.gen = -1;

	memset(b, 0, sizeof(Blk));
	b->type = Tlog;
	b->bp.addr = addr;
	b->logsz = 32;
	b->data = b->buf + Hdrsz;
	b->flag |= Bdirty;

	p = b->data+Loghdsz;
	PBIT64(p, addr|LogFree);	p += 8;	/* addr */
	PBIT64(p, asz-Blksz);		p += 8;	/* len */
	PBIT64(p, b->bp.addr|LogAlloc);	p += 8;	/* addr */
	PBIT64(p, Blksz);		p += 8;	/* len */
	PBIT64(p, (uvlong)LogEnd);	/* done */
	finalize(b);
	if(syncblk(b) == -1)
		sysfatal("ream: init log");

	bh = blkhash(b);
	bo = b->bp.addr;

	memset(b, 0, sizeof(Blk));
	b->type = Tarena;
	b->bp.addr = start;
	p = b->buf + Hdrsz;
	PBIT64(p, bo);		p += 8;	/* freelist addr */
	PBIT64(p, bh);		p += 8;	/* freelist hash */
	PBIT64(p, asz);		p += 8;	/* arena size */
	PBIT64(p, Blksz);	/* arena used */
	finalize(b);
	if(syncblk(b) == -1)
		sysfatal("ream: write arena: %r");
}

void
reamfs(char *dev)
{
	vlong sz, asz, off;
	Blk *sb, *rb, *tb;
	Mount *mnt;
	Dir *d;
	int i;

	if((fs->fd = open(dev, ORDWR)) == -1)
		sysfatal("open %s: %r", dev);
	if((d = dirfstat(fs->fd)) == nil)
		sysfatal("ream: %r");
	if(d->length < 64*MiB)
		sysfatal("ream: disk too small");
	if((sb = mallocz(sizeof(Blk), 1)) == nil)
		sysfatal("ream: %r");
	if((mnt = mallocz(sizeof(Mount), 1)) == nil)
		sysfatal("ream: alloc mount: %r");
	if((mnt->root = mallocz(sizeof(Tree), 1)) == nil)
		sysfatal("ream: alloc tree: %r");
	fs->super = sb;
	refblk(sb);

	sz = d->length;
	sz = sz - (sz % Blksz) - Blksz;
	fs->narena = (d->length + 64ULL*GiB - 1) / (64ULL*GiB);
	if(fs->narena < 8)
		fs->narena = 8;
	if(fs->narena >= 128)
		fs->narena = 128;
	if((fs->arenas = calloc(fs->narena, sizeof(Arena))) == nil)
		sysfatal("malloc: %r");
	free(d);

	asz = sz/fs->narena;
	asz = asz - (asz % Blksz) - Blksz;
	if(asz < 512*MiB)
		sysfatal("disk too small");
	fs->arenasz = asz;
	off = 0;
	fprint(2, "reaming %d arenas:\n", fs->narena);

	for(i = 0; i < fs->narena; i++){
		print("\tarena %d: %lld blocks at %llx\n", i, asz/Blksz, off);
		initarena(&fs->arenas[i], off, asz);
		off += asz;
	}
	
	sb->type = Tsuper;
	sb->bp.addr = sz;
	sb->data = sb->buf + Hdrsz;
	sb->ref = 2;

	for(i = 0; i < fs->narena; i++)
		if((loadarena(&fs->arenas[i], i*asz)) == -1)
			sysfatal("ream: loadarena: %r");

	if((tb = newblk(Tleaf)) == nil)
		sysfatal("ream: allocate root: %r");
	refblk(tb);
	initroot(tb);
	finalize(tb);
	syncblk(tb);

	mnt->root->ht = 1;
	mnt->root->bp = tb->bp;

	/*
	 * Now that we have a completely empty fs, give it
	 * a single snap block that the tree will insert
	 * into, and take a snapshot as the initial state.
	 */
	if((rb = newblk(Tleaf)) == nil)
		sysfatal("ream: allocate snaps: %r");
	refblk(rb);
	initsnap(rb, tb);
	finalize(rb);
	syncblk(rb);

	fs->snap.bp = rb->bp;
	fs->snap.ht = 1;
	fillsuper(sb);
	finalize(sb);
	syncblk(sb);

	putblk(tb);
	putblk(sb);
	putblk(rb);
	free(mnt);
	if(sync() == -1)
		sysfatal("ream: sync: %r");
}