static int rl_key_get_hash_ignore_expire(struct rlite *db, unsigned char digest[20], unsigned char *type, long *string_page, long *value_page, unsigned long long *expires, long *version, int ignore_expire)
{
int retval;
rl_btree *btree;
rl_key *key_obj;
RL_CALL(rl_get_key_btree, RL_OK, db, &btree, 0);
void *tmp = NULL;
retval = rl_btree_find_score(db, btree, digest, &tmp, NULL, NULL);
if (retval == RL_FOUND) {
key_obj = tmp;
if (ignore_expire == 0 && key_obj->expires != 0 && key_obj->expires <= rl_mstime()) {
retval = RL_DELETED;
goto cleanup;
}
else {
if (type) {
*type = key_obj->type;
}
if (string_page) {
*string_page = key_obj->string_page;
}
if (value_page) {
*value_page = key_obj->value_page;
}
if (expires) {
*expires = key_obj->expires;
}
if (version) {
*version = key_obj->version;
}
}
}
cleanup:
return retval;
}
int rl_key_delete(struct rlite *db, const unsigned char *key, long keylen)
{
int retval;
void *tmp;
unsigned char *digest;
rl_btree *btree = NULL;
rl_key *key_obj = NULL;
RL_MALLOC(digest, sizeof(unsigned char) * 20);
RL_CALL(sha1, RL_OK, key, keylen, digest);
RL_CALL(rl_get_key_btree, RL_OK, db, &btree, 0);
retval = rl_btree_find_score(db, btree, digest, &tmp, NULL, NULL);
if (retval == RL_FOUND) {
int selected_database = rl_get_selected_db(db);
key_obj = tmp;
RL_CALL(rl_multi_string_delete, RL_OK, db, key_obj->string_page);
retval = rl_btree_remove_element(db, btree, db->databases[selected_database], digest);
if (retval == RL_DELETED) {
db->databases[selected_database] = 0;
retval = RL_OK;
}
else if (retval != RL_OK) {
goto cleanup;
}
}
cleanup:
rl_free(digest);
return retval;
}
static int remove_member(rlite *db, const unsigned char *key, long keylen, long levels_page_number, rl_btree *scores, long scores_page, rl_skiplist *skiplist, long skiplist_page, unsigned char *member, long member_len)
{
double score;
void *tmp;
unsigned char digest[20];
int retval;
RL_CALL(sha1, RL_OK, member, member_len, digest);
retval = rl_btree_find_score(db, scores, digest, &tmp, NULL, NULL);
if (retval != RL_FOUND && retval != RL_NOT_FOUND) {
goto cleanup;
}
if (retval == RL_FOUND) {
score = *(double *)tmp;
RL_CALL(remove_member_score_sha1, RL_OK, db, key, keylen, levels_page_number, scores, scores_page, skiplist, skiplist_page, member, member_len, score, digest);
}
cleanup:
return retval;
}
int rl_zinterstore(rlite *db, long keys_size, unsigned char **keys, long *keys_len, double *_weights, int aggregate)
{
unsigned char *member = NULL;
rl_btree **btrees = NULL;
rl_skiplist **skiplists = NULL;
double weight = 1.0, weight_tmp;
double *weights = NULL;
rl_skiplist_node *node;
rl_skiplist_iterator *skiplist_iterator = NULL;
rl_btree_iterator *btree_iterator = NULL;
int retval;
long target_btree_page, target_skiplist_page;
long multi_string_page;
rl_btree *target_btree;
rl_skiplist *target_skiplist;
int found;
void *tmp;
double skiplist_score, tmp_score;
long memberlen;
unsigned char digest[20];
if (keys_size > 1) {
RL_MALLOC(btrees, sizeof(rl_btree *) * (keys_size - 1));
RL_MALLOC(skiplists, sizeof(rl_skiplist *) * (keys_size - 1));
}
else {
retval = RL_UNEXPECTED;
goto cleanup;
}
retval = rl_key_delete_with_value(db, keys[0], keys_len[0]);
if (retval != RL_OK && retval != RL_NOT_FOUND) {
goto cleanup;
}
rl_btree *btree, *btree_tmp;
rl_skiplist *skiplist = NULL, *skiplist_tmp;
long i;
// key in position 0 is the target key
// we'll store a pivot skiplist in btree/skiplist and the others in btrees/skiplists
// TODO: qsort instead
RL_MALLOC(weights, sizeof(double) * (keys_size - 2));
for (i = 1; i < keys_size; i++) {
weight_tmp = _weights ? _weights[i - 1] : 1.0;
RL_CALL2(rl_zset_get_objects, RL_OK, RL_WRONG_TYPE, db, keys[i], keys_len[i], NULL, &btree_tmp, NULL, &skiplist_tmp, NULL, 0, 0);
if (retval == RL_WRONG_TYPE) {
skiplist_tmp = NULL;
RL_CALL(rl_set_get_objects, RL_OK, db, keys[i], keys_len[i], NULL, &btree_tmp, 0, 0);
}
if (i == 1) {
btree = btree_tmp;
skiplist = skiplist_tmp;
weight = weight_tmp;
}
else if (btree_tmp->number_of_elements < btree->number_of_elements) {
weights[i - 2] = weight;
weight = weight_tmp;
btrees[i - 2] = btree;
btree = btree_tmp;
skiplists[i - 2] = skiplist;
skiplist = skiplist_tmp;
}
else {
weights[i - 2] = weight_tmp;
btrees[i - 2] = btree_tmp;
skiplists[i - 2] = skiplist_tmp;
}
}
RL_CALL(rl_zset_get_objects, RL_OK, db, keys[0], keys_len[0], NULL, &target_btree, &target_btree_page, &target_skiplist, &target_skiplist_page, 1, 1);
if (skiplist) {
RL_CALL(rl_skiplist_iterator_create, RL_OK, db, &skiplist_iterator, skiplist, 0, 0, 0);
} else {
RL_CALL(rl_btree_iterator_create, RL_OK, db, btree, &btree_iterator);
}
while ((retval = skiplist ? rl_skiplist_iterator_next(skiplist_iterator, &node) : rl_btree_iterator_next(btree_iterator, NULL, &tmp)) == RL_OK) {
found = 1;
if (skiplist) {
skiplist_score = node->score * weight;
multi_string_page = node->value;
} else {
skiplist_score = weight;
multi_string_page = *(long *)tmp;
rl_free(tmp);
}
for (i = 1; i < keys_size - 1; i++) {
RL_CALL(rl_multi_string_sha1, RL_OK, db, digest, multi_string_page);
retval = rl_btree_find_score(db, btrees[i - 1], digest, &tmp, NULL, NULL);
if (retval == RL_NOT_FOUND) {
found = 0;
break;
}
else if (retval == RL_FOUND) {
tmp_score = skiplist ? *(double *)tmp : 1.0;
if (aggregate == RL_ZSET_AGGREGATE_SUM) {
skiplist_score += tmp_score * weights[i - 1];
}
else if (
(aggregate == RL_ZSET_AGGREGATE_MIN && tmp_score * weights[i - 1] < skiplist_score) ||
(aggregate == RL_ZSET_AGGREGATE_MAX && tmp_score * weights[i - 1] > skiplist_score)
) {
skiplist_score = tmp_score * weights[i - 1];
}
}
else {
goto cleanup;
}
}
if (found) {
RL_CALL(rl_multi_string_get, RL_OK, db, multi_string_page, &member, &memberlen);
RL_CALL(add_member, RL_OK, db, target_btree, target_btree_page, target_skiplist, target_skiplist_page, isnan(skiplist_score) ? 0.0 : skiplist_score, member, memberlen);
rl_free(member);
member = NULL;
}
}
skiplist_iterator = NULL;
btree_iterator = NULL;
if (retval != RL_END) {
goto cleanup;
}
retval = RL_OK;
cleanup:
rl_free(member);
if (skiplist_iterator) {
rl_zset_iterator_destroy(skiplist_iterator);
}
if (btree_iterator) {
rl_btree_iterator_destroy(btree_iterator);
}
rl_free(weights);
rl_free(btrees);
rl_free(skiplists);
return retval;
}
