Zach Brown db9f2be728 Switch to indexed manifest using treap ring ...

The first pass manifest and allocator storage used a simple ring log
that was entirely replayed into memory to be used.  That risked the
manifest being too large to fit in memory, especially with large keys
and large volumes.

So we move to using an indexed persistent structure that can be read on
demand and cached.  We use a treap of byte referenced nodoes stored in a
circular ring.

The code interface is modeled a bit on the in-memory rbtree interface.
Except that we can get IO errors and manage allocation so we return data
pointers to the item payload istead of item structs and we can return
errors.

The manifest and allocator are converted over and the old ring code is
removed entirely.

Signed-off-by: Zach Brown <zab@versity.com>

2017-04-18 13:44:53 -07:00

..

src

Switch to indexed manifest using treap ring

2017-04-18 13:44:53 -07:00

.gitignore

scoutfs: add cscope noise to .gitignore

2016-04-12 19:37:31 -07:00

Makefile

Add all target for make

2016-10-20 13:55:31 -07:00