static int
si_redistribute(si *index, sr *r, sdc *c, sinode *node, ssbuf *result)
{
(void)index;
svindex *vindex = si_nodeindex(node);
ssiter i;
ss_iterinit(sv_indexiter, &i);
ss_iteropen(sv_indexiter, &i, r, vindex, SS_GTE, NULL, 0);
while (ss_iterhas(sv_indexiter, &i))
{
sv *v = ss_iterof(sv_indexiter, &i);
int rc = ss_bufadd(&c->b, r->a, &v->v, sizeof(svv**));
if (ssunlikely(rc == -1))
return sr_oom_malfunction(r->e);
ss_iternext(sv_indexiter, &i);
}
if (ssunlikely(ss_bufused(&c->b) == 0))
return 0;
ss_iterinit(ss_bufiterref, &i);
ss_iteropen(ss_bufiterref, &i, &c->b, sizeof(svv*));
ssiter j;
ss_iterinit(ss_bufiterref, &j);
ss_iteropen(ss_bufiterref, &j, result, sizeof(sinode*));
sinode *prev = ss_iterof(ss_bufiterref, &j);
ss_iternext(ss_bufiterref, &j);
while (1)
{
sinode *p = ss_iterof(ss_bufiterref, &j);
if (p == NULL) {
assert(prev != NULL);
while (ss_iterhas(ss_bufiterref, &i)) {
svv *v = ss_iterof(ss_bufiterref, &i);
v->next = NULL;
sv_indexset(&prev->i0, r, v);
ss_iternext(ss_bufiterref, &i);
}
break;
}
while (ss_iterhas(ss_bufiterref, &i))
{
svv *v = ss_iterof(ss_bufiterref, &i);
v->next = NULL;
sdindexpage *page = sd_indexmin(&p->self.index);
int rc = sr_compare(r->scheme, sv_vpointer(v), v->size,
sd_indexpage_min(&p->self.index, page),
page->sizemin);
if (ssunlikely(rc >= 0))
break;
sv_indexset(&prev->i0, r, v);
ss_iternext(ss_bufiterref, &i);
}
if (ssunlikely(! ss_iterhas(ss_bufiterref, &i)))
break;
prev = p;
ss_iternext(ss_bufiterref, &j);
}
assert(ss_iterof(ss_bufiterref, &i) == NULL);
return 0;
}
static void
sv_indexiter_iterate0(void)
{
svindex i;
t( sv_indexinit(&i) == 0 );
int keyb = 3;
int keya = 7;
int keyc = 15;
svv *h = st_svv(&st_r.g, NULL, 0, 0, keyb);
t( sv_indexset(&i, &st_r.r, h) == 0 );
svv *p = st_svv(&st_r.g, NULL, 2, 0, keyc);
t( sv_indexset(&i, &st_r.r, p) == 0 );
svv *va = st_svv(&st_r.g, NULL, 1, 0, keya);
t( sv_indexset(&i, &st_r.r, va) == 0 );
svv *vb = st_svv(&st_r.g, NULL, 2, 0, keya);
t( sv_indexset(&i, &st_r.r, vb) == 0 );
svv *vc = st_svv(&st_r.g, NULL, 3, 0, keya);
t( sv_indexset(&i, &st_r.r, vc) == 0 );
ssiter it;
ss_iterinit(sv_indexiter, &it);
ss_iteropen(sv_indexiter, &it, &st_r.r, &i, SS_GTE, NULL, 0);
t( ss_iteratorhas(&it) != 0 );
sv *v = ss_iteratorof(&it);
t( v->v == h );
ss_iteratornext(&it);
v = ss_iteratorof(&it);
t( v->v == vc );
ss_iteratornext(&it);
v = ss_iteratorof(&it);
t( v->v == vb );
ss_iteratornext(&it);
v = ss_iteratorof(&it);
t( v->v == va );
ss_iteratornext(&it);
v = ss_iteratorof(&it);
t( v->v == p );
ss_iteratornext(&it);
v = ss_iteratorof(&it);
t( v == NULL );
sv_indexfree(&i, &st_r.r);
}
static void
sv_indexiter_iterate1(void)
{
svindex i;
t( sv_indexinit(&i) == 0 );
int j = 0;
while (j < 16) {
svv *v = st_svv(&st_r.g, NULL, j, 0, j);
t( sv_indexset(&i, &st_r.r, v) == 0 );
j++;
}
ssiter it;
ss_iterinit(sv_indexiter, &it);
ss_iteropen(sv_indexiter, &it, &st_r.r, &i, SS_GTE, NULL, 0);
j = 0;
while (ss_iteratorhas(&it)) {
sv *v = ss_iteratorof(&it);
t( sv_lsn(v) == j );
ss_iteratornext(&it);
j++;
}
t( j == 16 );
sv_indexfree(&i, &st_r.r);
}
static void
sv_indexiter_lt_eq(void)
{
svindex i;
t( sv_indexinit(&i) == 0 );
int keya = 7;
int keyb = 5;
int keyc = 2;
svv *va = st_svv(&st_r.g, NULL, 0, 0, keya);
t( sv_indexset(&i, &st_r.r, va) == 0 );
svv *vb = st_svv(&st_r.g, NULL, 0, 0, keyb);
t( sv_indexset(&i, &st_r.r, vb) == 0 );
svv *vc = st_svv(&st_r.g, NULL, 0, 0, keyc);
t( sv_indexset(&i, &st_r.r, vc) == 0 );
ssiter it;
ss_iterinit(sv_indexiter, &it);
ss_iteropen(sv_indexiter, &it, &st_r.r, &i, SS_LT, sv_vpointer(va), va->size);
t( ss_iteratorhas(&it) != 0 );
sv *v = ss_iteratorof(&it);
t( v->v == vb );
ss_iterinit(sv_indexiter, &it);
ss_iteropen(sv_indexiter, &it, &st_r.r, &i, SS_LT, sv_vpointer(vb), vb->size);
t( ss_iteratorhas(&it) != 0 );
v = ss_iteratorof(&it);
t( v->v == vc );
ss_iterinit(sv_indexiter, &it);
ss_iteropen(sv_indexiter, &it, &st_r.r, &i, SS_LT, sv_vpointer(vc), vc->size);
t( ss_iteratorhas(&it) == 0 );
v = ss_iteratorof(&it);
t( v == NULL );
sv_indexfree(&i, &st_r.r);
}
static void
sv_index_replace0(void)
{
svindex i;
t( sv_indexinit(&i) == 0 );
uint32_t key = 7;
svv *h = st_svv(&st_r.g, NULL, 0, 0, key);
svv *n = st_svv(&st_r.g, NULL, 1, 0, key);
t( sv_indexset(&i, &st_r.r, h) == 0 );
t( sv_indexset(&i, &st_r.r, n) == 0 );
svv *keyv = st_svv(&st_r.g, &st_r.gc, 0, 0, key);
svv *p = getv(&i, &st_r.r, 0, keyv);
t( p == h );
p = getv(&i, &st_r.r, 1, keyv);
t( p == n );
t( h->next == NULL );
sv_indexfree(&i, &st_r.r);
}
static inline void
si_redistribute_set(si *index, sr *r, svv *v)
{
/* match node */
ssiter i;
ss_iterinit(si_iter, &i);
ss_iteropen(si_iter, &i, r, index, SS_GTE, sv_vpointer(v));
sinode *node = ss_iterof(si_iter, &i);
assert(node != NULL);
/* update node */
svindex *vindex = si_nodeindex(node);
sv_indexset(vindex, r, v);
node->used += sv_vsize(v, &index->r);
/* schedule node */
si_plannerupdate(&index->p, node);
}
static inline void
si_redistribute_set(si *index, sr *r, uint64_t now, svv *v)
{
index->update_time = now;
/* match node */
ssiter i;
ss_iterinit(si_iter, &i);
ss_iteropen(si_iter, &i, r, index, SS_ROUTE, sv_vpointer(v), v->size);
sinode *node = ss_iterof(si_iter, &i);
assert(node != NULL);
/* update node */
svindex *vindex = si_nodeindex(node);
sv_indexset(vindex, r, v);
node->update_time = index->update_time;
node->used += sv_vsize(v);
/* schedule node */
si_plannerupdate(&index->p, SI_BRANCH, node);
}