mirror of
https://github.com/urbit/ares.git
synced 2024-11-26 09:57:56 +03:00
Merge pull request #224 from urbit/barter-simsum/pma-restore-regression-fix
pma: fix regression on restore
This commit is contained in:
commit
06b62d3efa
@ -157,30 +157,6 @@ int main(int argc, char *argv[])
|
|||||||
BT_findpath path = {0};
|
BT_findpath path = {0};
|
||||||
int rc = 0;
|
int rc = 0;
|
||||||
|
|
||||||
/* broken with recent changes. Maybe because we aren't mmapping the data
|
|
||||||
ranges (pure _bt_insert) */
|
|
||||||
#if 0
|
|
||||||
|
|
||||||
DPUTS("== test 1: insert");
|
|
||||||
|
|
||||||
bt_state_new(&state1);
|
|
||||||
if (mkdir("./pmatest1", 0774) == -1)
|
|
||||||
return errno;
|
|
||||||
assert(SUCC(bt_state_open(state1, "./pmatest1", 0, 0644)));
|
|
||||||
|
|
||||||
#define LOWEST_ADDR 0x2aaa80;
|
|
||||||
vaof_t lo = LOWEST_ADDR;
|
|
||||||
vaof_t hi = 0xDEADBEEF;
|
|
||||||
pgno_t pg = 1; /* dummy value */
|
|
||||||
for (size_t i = 0; i < BT_DAT_MAXKEYS * 4; ++i) {
|
|
||||||
_bt_insert(state1, lo, hi, pg);
|
|
||||||
_test_nodeinteg(state1, &path, lo, hi, pg);
|
|
||||||
lo++; pg++;
|
|
||||||
}
|
|
||||||
|
|
||||||
bt_state_close(state1);
|
|
||||||
#endif
|
|
||||||
|
|
||||||
|
|
||||||
DPUTS("== test 2: malloc");
|
DPUTS("== test 2: malloc");
|
||||||
BT_state *state2;
|
BT_state *state2;
|
||||||
@ -323,6 +299,7 @@ int main(int argc, char *argv[])
|
|||||||
|
|
||||||
#define PMA_INITIAL_SIZE_p PMA_GROW_SIZE_p
|
#define PMA_INITIAL_SIZE_p PMA_GROW_SIZE_p
|
||||||
BYTE *t4a = bt_malloc(state4, PMA_GROW_SIZE_p * 2);
|
BYTE *t4a = bt_malloc(state4, PMA_GROW_SIZE_p * 2);
|
||||||
|
BYTE *t4a_copy = malloc(PMA_GROW_SIZE_b * 2);
|
||||||
BYTE *t4b = t4a;
|
BYTE *t4b = t4a;
|
||||||
for (size_t i = 0; i < PMA_GROW_SIZE_b * 2; i++) {
|
for (size_t i = 0; i < PMA_GROW_SIZE_b * 2; i++) {
|
||||||
*t4b++ = rand();
|
*t4b++ = rand();
|
||||||
@ -333,6 +310,7 @@ int main(int argc, char *argv[])
|
|||||||
tail. The hi page here should match the file size */
|
tail. The hi page here should match the file size */
|
||||||
assert(state4->flist->hi == state4->file_size_p);
|
assert(state4->flist->hi == state4->file_size_p);
|
||||||
|
|
||||||
|
memcpy(t4a_copy, t4a, PMA_GROW_SIZE_b * 2);
|
||||||
bt_state_close(state4);
|
bt_state_close(state4);
|
||||||
|
|
||||||
bt_state_new(&state4);
|
bt_state_new(&state4);
|
||||||
@ -340,7 +318,18 @@ int main(int argc, char *argv[])
|
|||||||
assert(SUCC(bt_state_open(state4, "./pmatest4", 0, 0644)));
|
assert(SUCC(bt_state_open(state4, "./pmatest4", 0, 0644)));
|
||||||
|
|
||||||
assert(state4->file_size_p == PMA_INITIAL_SIZE_p + PMA_GROW_SIZE_p * 2);
|
assert(state4->file_size_p == PMA_INITIAL_SIZE_p + PMA_GROW_SIZE_p * 2);
|
||||||
assert(state4->flist->hi == state4->file_size_p);
|
assert(state4->flist->next->hi == state4->file_size_p);
|
||||||
|
|
||||||
|
for (size_t i = 0; i < PMA_GROW_SIZE_b * 2; i++)
|
||||||
|
assert(t4a_copy[i] == t4a[i]);
|
||||||
|
|
||||||
|
void *t4c = bt_malloc(state4, 10);
|
||||||
|
bt_sync(state4);
|
||||||
|
void *t4d = bt_malloc(state4, 10);
|
||||||
|
bt_sync(state4);
|
||||||
|
void *t4e = bt_malloc(state4, 10);
|
||||||
|
bt_sync(state4);
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
DPUTS("== test 5: partition striping");
|
DPUTS("== test 5: partition striping");
|
||||||
|
@ -699,6 +699,9 @@ _bt_root_new(BT_meta *meta, BT_page *root)
|
|||||||
root->datk[0].fo = 0;
|
root->datk[0].fo = 0;
|
||||||
root->datk[1].va = UINT32_MAX;
|
root->datk[1].va = UINT32_MAX;
|
||||||
root->datk[1].fo = 0;
|
root->datk[1].fo = 0;
|
||||||
|
/* though we've modified the data segment, we shouldn't mark these default
|
||||||
|
values dirty because when we attempt to sync them, we'll obviously run into
|
||||||
|
problems since they aren't mapped */
|
||||||
}
|
}
|
||||||
|
|
||||||
static int
|
static int
|
||||||
@ -2307,9 +2310,8 @@ _bt_state_read_header(BT_state *state)
|
|||||||
|
|
||||||
static int
|
static int
|
||||||
_bt_state_meta_new(BT_state *state)
|
_bt_state_meta_new(BT_state *state)
|
||||||
#define INITIAL_ROOTPG 2
|
|
||||||
{
|
{
|
||||||
BT_page *p1, *p2, *root;
|
BT_page *p1;
|
||||||
BT_meta meta = {0};
|
BT_meta meta = {0};
|
||||||
|
|
||||||
TRACE();
|
TRACE();
|
||||||
@ -2324,9 +2326,6 @@ _bt_state_meta_new(BT_state *state)
|
|||||||
/* initialize the block base array */
|
/* initialize the block base array */
|
||||||
meta.blk_base[0] = BT_NUMMETAS;
|
meta.blk_base[0] = BT_NUMMETAS;
|
||||||
|
|
||||||
root = _bt_nalloc(state);
|
|
||||||
_bt_root_new(&meta, root);
|
|
||||||
|
|
||||||
/* initialize meta struct */
|
/* initialize meta struct */
|
||||||
meta.magic = BT_MAGIC;
|
meta.magic = BT_MAGIC;
|
||||||
meta.version = BT_VERSION;
|
meta.version = BT_VERSION;
|
||||||
@ -2335,18 +2334,12 @@ _bt_state_meta_new(BT_state *state)
|
|||||||
meta.fix_addr = BT_MAPADDR;
|
meta.fix_addr = BT_MAPADDR;
|
||||||
meta.depth = 1;
|
meta.depth = 1;
|
||||||
meta.flags = BP_META;
|
meta.flags = BP_META;
|
||||||
meta.root = _fo_get(state, root);
|
|
||||||
assert(meta.root == INITIAL_ROOTPG); /* ;;: remove?? */
|
|
||||||
|
|
||||||
/* initialize the metapages */
|
/* initialize the first metapage */
|
||||||
p1 = &((BT_page *)state->map)[0];
|
p1 = &((BT_page *)state->map)[0];
|
||||||
p2 = &((BT_page *)state->map)[1];
|
|
||||||
|
|
||||||
/* copy the metadata into the metapages */
|
/* copy the metadata into the metapages */
|
||||||
memcpy(METADATA(p1), &meta, sizeof meta);
|
memcpy(METADATA(p1), &meta, sizeof meta);
|
||||||
/* ;;: todo, should the second metapage actually share a .root with the
|
|
||||||
first?? */
|
|
||||||
memcpy(METADATA(p2), &meta, sizeof meta);
|
|
||||||
|
|
||||||
/* only the active metapage should be writable (first page) */
|
/* only the active metapage should be writable (first page) */
|
||||||
if (mprotect(BT_MAPADDR, BT_META_SECTION_WIDTH, BT_PROT_CLEAN) != 0) {
|
if (mprotect(BT_MAPADDR, BT_META_SECTION_WIDTH, BT_PROT_CLEAN) != 0) {
|
||||||
@ -2361,6 +2354,19 @@ _bt_state_meta_new(BT_state *state)
|
|||||||
|
|
||||||
return BT_SUCC;
|
return BT_SUCC;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static int
|
||||||
|
_bt_state_meta_inject_root(BT_state *state)
|
||||||
|
#define INITIAL_ROOTPG 2
|
||||||
|
{
|
||||||
|
assert(state->nlist);
|
||||||
|
BT_meta *meta = state->meta_pages[state->which];
|
||||||
|
BT_page *root = _bt_nalloc(state);
|
||||||
|
_bt_root_new(meta, root);
|
||||||
|
meta->root = _fo_get(state, root);
|
||||||
|
assert(meta->root == INITIAL_ROOTPG);
|
||||||
|
return BT_SUCC;
|
||||||
|
}
|
||||||
#undef INITIAL_ROOTPG
|
#undef INITIAL_ROOTPG
|
||||||
|
|
||||||
static void
|
static void
|
||||||
@ -2422,6 +2428,8 @@ _bt_state_map_node_segment(BT_state *state)
|
|||||||
BYTE *targ = BT_MAPADDR + BT_META_SECTION_WIDTH;
|
BYTE *targ = BT_MAPADDR + BT_META_SECTION_WIDTH;
|
||||||
size_t i;
|
size_t i;
|
||||||
|
|
||||||
|
assert(meta->blk_base[0] == BT_NUMMETAS);
|
||||||
|
|
||||||
/* map all allocated node stripes as clean */
|
/* map all allocated node stripes as clean */
|
||||||
for (i = 0
|
for (i = 0
|
||||||
; i < BT_NUMPARTS && meta->blk_base[i] != 0
|
; i < BT_NUMPARTS && meta->blk_base[i] != 0
|
||||||
@ -2500,6 +2508,10 @@ _bt_state_load(BT_state *state)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (new) {
|
||||||
|
assert(SUCC(_bt_state_meta_new(state)));
|
||||||
|
}
|
||||||
|
|
||||||
/* map the node segment */
|
/* map the node segment */
|
||||||
_bt_state_map_node_segment(state);
|
_bt_state_map_node_segment(state);
|
||||||
|
|
||||||
@ -2507,12 +2519,7 @@ _bt_state_load(BT_state *state)
|
|||||||
if (new) {
|
if (new) {
|
||||||
assert(SUCC(_flist_new(state, PMA_GROW_SIZE_p)));
|
assert(SUCC(_flist_new(state, PMA_GROW_SIZE_p)));
|
||||||
assert(SUCC(_nlist_new(state)));
|
assert(SUCC(_nlist_new(state)));
|
||||||
|
assert(SUCC(_bt_state_meta_inject_root(state)));
|
||||||
if (!SUCC(rc = _bt_state_meta_new(state))) {
|
|
||||||
munmap(state->map, BT_ADDRSIZE);
|
|
||||||
return rc;
|
|
||||||
}
|
|
||||||
|
|
||||||
assert(SUCC(_mlist_new(state)));
|
assert(SUCC(_mlist_new(state)));
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
@ -2931,9 +2938,16 @@ bt_sync(BT_state *state)
|
|||||||
BT_page *root = _node_get(state, meta->root);
|
BT_page *root = _node_get(state, meta->root);
|
||||||
int rc = 0;
|
int rc = 0;
|
||||||
|
|
||||||
|
/* sync root subtrees */
|
||||||
if ((rc = _bt_sync(state, root, 1, meta->depth)))
|
if ((rc = _bt_sync(state, root, 1, meta->depth)))
|
||||||
return rc;
|
return rc;
|
||||||
|
|
||||||
|
/* sync root page itself */
|
||||||
|
if (msync(root, sizeof(BT_page), MS_SYNC) != 0) {
|
||||||
|
DPRINTF("msync of root node: %p failed with %s", root, strerror(errno));
|
||||||
|
abort();
|
||||||
|
}
|
||||||
|
|
||||||
/* merge the pending freelists */
|
/* merge the pending freelists */
|
||||||
_pending_nlist_merge(state);
|
_pending_nlist_merge(state);
|
||||||
_pending_flist_merge(state);
|
_pending_flist_merge(state);
|
||||||
|
Loading…
Reference in New Issue
Block a user