/*
* Internal function which adds digests to the defrag_list
* Mallocs the nodes of defrag_list
* Returns :
* -1 : Error
* number of digests found : success
*
*/
static long
build_defrag_list_from_nbtr(as_namespace *ns, ai_obj *acol, bt *nbtr, ulong nofst, ulong *limit, uint64_t * tot_found, cf_ll *gc_list)
{
int error = -1;
btEntry *nbe;
// STEP 1: go thru a portion of the nbtr and find to-be-deleted-PKs
// TODO: a range query may be smarter then using the Xth Iterator
btSIter *nbi = (nofst ? btGetFullXthIter(nbtr, nofst, 1, NULL, 0) :
btGetFullRangeIter(nbtr, 1, NULL));
if (!nbi) {
return error;
}
long found = 0;
long processed = 0;
while ((nbe = btRangeNext(nbi, 1))) {
ai_obj *akey = nbe->key;
int ret = as_sindex_can_defrag_record(ns, (cf_digest *) (&akey->y));
if (ret == AS_SINDEX_GC_SKIP_ITERATION) {
*limit = 0;
break;
} else if (ret == AS_SINDEX_GC_OK) {
bool create = (cf_ll_size(gc_list) == 0) ? true : false;
objs_to_defrag_arr *dt;
if (!create) {
cf_ll_element * ele = cf_ll_get_tail(gc_list);
dt = ((ll_sindex_gc_element*)ele)->objs_to_defrag;
if (dt->num == SINDEX_GC_NUM_OBJS_PER_ARR) {
create = true;
}
}
if (create) {
dt = as_sindex_gc_get_defrag_arr();
if (!dt) {
*tot_found += found;
return -1;
}
ll_sindex_gc_element * node;
node = cf_malloc(sizeof(ll_sindex_gc_element));
node->objs_to_defrag = dt;
cf_ll_append(gc_list, (cf_ll_element *)node);
}
cloneDigestFromai_obj(&(dt->acol_digs[dt->num].dig), akey);
ai_objClone(&(dt->acol_digs[dt->num].acol), acol);
dt->num += 1;
found++;
}
processed++;
(*limit)--;
if (*limit == 0) break;
}
btReleaseRangeIterator(nbi);
*tot_found += found;
return processed;
}
/*
* Deletes the digest as in the passed in as gc_list, bound by n2del number of
* elements per iteration, with *deleted successful deletes.
*/
bool
ai_btree_defrag_list(as_sindex_metadata *imd, as_sindex_pmetadata *pimd, cf_ll *gc_list, ulong n2del, ulong *deleted)
{
// If n2del is zero here, that means caller do not want to defrag
if (n2del == 0 ) {
return false;
}
ulong success = 0;
as_namespace *ns = imd->si->ns;
// STEP 3: go thru the PKtoDeleteList and delete the keys
ulong bb = pimd->ibtr->msize + pimd->ibtr->nsize;
uint64_t validation_time_ns = 0;
uint64_t deletion_time_ns = 0;
while (cf_ll_size(gc_list)) {
cf_ll_element * ele = cf_ll_get_head(gc_list);
ll_sindex_gc_element * node = (ll_sindex_gc_element * )ele;
objs_to_defrag_arr * dt = node->objs_to_defrag;
// check before deleting. The digest may re-appear after the list
// creation and before deletion from the secondary index
int i = 0;
while (dt->num != 0) {
i = dt->num - 1;
SET_TIME_FOR_SINDEX_GC_HIST(validation_time_ns);
int ret = as_sindex_can_defrag_record(ns, &(dt->acol_digs[i].dig));
SINDEX_GC_HIST_INSERT_DATA_POINT(sindex_gc_validate_obj_hist, validation_time_ns);
validation_time_ns = 0;
if (ret == AS_SINDEX_GC_SKIP_ITERATION) {
goto END;
} else if (ret == AS_SINDEX_GC_OK) {
ai_obj apk;
init_ai_objFromDigest(&apk, &(dt->acol_digs[i].dig));
ai_obj *acol = &(dt->acol_digs[i].acol);
cf_detail(AS_SINDEX, "Defragged %lu %ld", acol->l, *((uint64_t *)&apk.y));
SET_TIME_FOR_SINDEX_GC_HIST(deletion_time_ns);
if (reduced_iRem(pimd->ibtr, acol, &apk) == AS_SINDEX_OK) {
success++;
SINDEX_GC_HIST_INSERT_DATA_POINT(sindex_gc_delete_obj_hist, deletion_time_ns);
}
deletion_time_ns = 0;
}
dt->num -= 1;
n2del--;
if (n2del == 0) {
goto END;
}
}
cf_ll_delete(gc_list, (cf_ll_element*)node);
}
END:
as_sindex_release_data_memory(imd, (bb - pimd->ibtr->msize - pimd->ibtr->nsize));
*deleted += success;
return cf_ll_size(gc_list) ? true : false;
}
static long
build_defrag_list_from_arr(as_namespace *ns, ai_obj *acol, ai_arr *arr, long nofst, long *limit, uint64_t * tot_found, cf_ll *gc_list)
{
long found = 0;
long processed = 0;
uint64_t validation_time_ns = 0;
for (int i = nofst; i < arr->used; i++) {
SET_TIME_FOR_SINDEX_GC_HIST(validation_time_ns);
int ret = as_sindex_can_defrag_record(ns, (cf_digest *) &arr->data[i * CF_DIGEST_KEY_SZ]);
SINDEX_GC_HIST_INSERT_DATA_POINT(sindex_gc_validate_obj_hist, validation_time_ns);
validation_time_ns = 0;
if (ret == AS_SINDEX_GC_SKIP_ITERATION) {
*limit = 0;
break;
} else if (ret == AS_SINDEX_GC_OK) {
bool create = (cf_ll_size(gc_list) == 0) ? true : false;
objs_to_defrag_arr *dt;
if (!create) {
cf_ll_element * ele = cf_ll_get_tail(gc_list);
dt = ((ll_sindex_gc_element*)ele)->objs_to_defrag;
if (dt->num == SINDEX_GC_NUM_OBJS_PER_ARR) {
create = true;
}
}
if (create) {
dt = as_sindex_gc_get_defrag_arr();
if (!dt) {
*tot_found += found;
return -1;
}
ll_sindex_gc_element * node;
node = cf_malloc(sizeof(ll_sindex_gc_element));
node->objs_to_defrag = dt;
cf_ll_append(gc_list, (cf_ll_element *)node);
}
memcpy(&(dt->acol_digs[dt->num].dig), (cf_digest *) &arr->data[i * CF_DIGEST_KEY_SZ], CF_DIGEST_KEY_SZ);
ai_objClone(&(dt->acol_digs[dt->num].acol), acol);
dt->num += 1;
found++;
}
processed++;
(*limit)--;
if (*limit == 0) {
break;
}
}
*tot_found += found;
return processed;
}
