CTEST(basement, empty) { int ret; struct basement_iter iter; struct basement *bsm = basement_new(); basement_iter_init(&iter, bsm); basement_iter_seektofirst(&iter); ret = basement_iter_valid(&iter); ASSERT_EQUAL(0, ret); struct msg m1 = { .size = 6, .data = "key-01" }; basement_iter_seek(&iter, &m1); ret = basement_iter_valid(&iter); ASSERT_EQUAL(0, ret); basement_free(bsm); xcheck_all_free(); } void _random_key(char *key,int length) { int i; char salt[36]= "abcdefghijklmnopqrstuvwxyz123456789"; for (i = 0; i < length; i++) key[i] = salt[rand() % 36]; }
int _findsmallest(struct basement **bsms, int bsms_size, struct cursor *cur, struct search *so) { int i; int ret; int end; struct basement_iter *smallest = NULL; struct basement_iter iters[bsms_size]; /* seek each level */ for (i = (bsms_size - 1); i >= 0; i--) { struct basement *bsm; struct basement_iter *iter; bsm = bsms[i]; iter = &iters[i]; basement_iter_init(iter, bsm); if (so->key) { /* * sought position is >= position(so->key) * so we should ensure that all sought iters positioned after so->key */ basement_iter_seek(iter, so->key); if (so->slip != SLIP_ZERO) { if (basement_iter_valid(iter) && (so->key_compare_func(&iter->key, so->key) == 0)) basement_iter_next(iter); } } else { basement_iter_seektofirst(iter); } } for (i = (bsms_size - 1); i >= 0; i--) { struct basement_iter *iter = &iters[i]; if (basement_iter_valid(iter)) { if (smallest == NULL) { smallest = iter; } else if (so->key_compare_func(&iter->key, &smallest->key) < 0) { smallest = iter; } } } end = (basement_iter_valid(&iters[0]) == 0); if (end) { if (smallest) { cur->valid = 1; cur->key = smallest->key; cur->val = smallest->val; } else { cur->valid = 0; } ret = CURSOR_EOF; } else { cur->valid = 1; cur->key = smallest->key; cur->val = smallest->val; ret = CURSOR_CONTINUE; } return ret; }
/* * apply parent's [leaf, right] messages to child node */ void _apply_msg_to_child(struct node *parent, int child_num, struct node *child, struct msg *left, struct msg *right) { int height; struct basement *bsm; struct basement_iter iter; nassert(child != NULL); nassert(parent->height > 0); height = child->height; if (height == 0) bsm = child->u.l.le->bsm; else bsm = child->u.n.parts[child_num].buffer; basement_iter_init(&iter, bsm); basement_iter_seek(&iter, left); while (basement_iter_valid_lessorequal(&iter, right)) { struct bt_cmd cmd = { .msn = iter.msn, .type = iter.type, .key = &iter.key, .val = &iter.val, .xidpair = iter.xidpair }; if (nessunlikely(height == 0)) leaf_put_cmd(child, &cmd); else nonleaf_put_cmd(child, &cmd); } } /* * apply msgs from ances to leaf basement which are between(include) left and right * REQUIRES: * 1) leaf write-lock * 2) ances all write-lock */ int leaf_apply_ancestors(struct node *leaf, struct ancestors *ances) { struct ancestors *ance; struct msg *left = NULL; struct msg *right = NULL; struct basement_iter iter; struct basement *bsm = leaf->u.l.le->bsm; basement_iter_init(&iter, bsm); basement_iter_seektofirst(&iter); if (basement_iter_valid(&iter)) left = msgdup(&iter.key); basement_iter_seektolast(&iter); if (basement_iter_valid(&iter)) right = msgdup(&iter.key); ance = ances; while (ance && ance->next) { /* apply [leaf, right] to leaf */ _apply_msg_to_child(ance->v, ance->childnum, ance->next->v, left, right); ance = ances->next; } msgfree(left); msgfree(right); return NESS_OK; }