/*
* delete a range from the interval tree and any
* associated nodemap references
*
* \param range range to remove
*/
void range_delete(struct lu_nid_range *range)
{
if (range == NULL || interval_is_intree(&range->rn_node) == 0)
return;
list_del(&range->rn_list);
interval_erase(&range->rn_node, &range_interval_root);
range_destroy(range);
}
static void cache_entry_destroy (gpointer data)
{
struct _CacheEntry * entry = (struct _CacheEntry*) data;
range_destroy(entry->avail_range);
if (entry->version_id)
g_free (entry->version_id);
g_free(entry);
}
range* rangefunc_cluster(range_request* rr, range** r)
{
range* ret = range_new(rr);
if (!validate_range_args(rr, r, 1)) {
return ret;
}
apr_pool_t* pool = range_request_pool(rr);
const char** clusters = range_get_hostnames(pool, r[0]);
const char** p = clusters;
while (*p) {
const char* colon = strchr(*p, ':');
range* r1;
if (colon) {
int len = strlen(*p);
int cluster_len = colon - *p;
int section_len = len - cluster_len - 1;
char* cl = apr_palloc(pool, cluster_len + 1);
char* sec = apr_palloc(pool, section_len + 1);
memcpy(cl, *p, cluster_len);
cl[cluster_len] = '\0';
memcpy(sec, colon + 1, section_len);
sec[section_len] = '\0';
r1 = _expand_cluster(rr, cl, sec);
}
else
r1 = _expand_cluster(rr, *p, "CLUSTER");
if (range_members(r1) > range_members(ret)) {
/* swap them */
range* tmp = r1;
r1 = ret;
ret = tmp;
}
range_union_inplace(rr, ret, r1);
range_destroy(r1);
++p;
}
return ret;
}
range* range_evaluate(range_request* rr, const rangeast* ast)
{
range* r;
int i;
rangeast* rtmp;
range** ranges;
range* r1;
range* r2;
range* r3;
apr_pool_t* pool = range_request_pool(rr);
switch (ast->type) {
case AST_LITERAL:
r = range_from_literal(rr, ast->data.string);
return r;
case AST_NONRANGE_LITERAL:
r = range_from_nonrange_literal(rr, ast->data.string);
return r;
case AST_UNION:
r1 = range_evaluate(rr, ast->children);
r2 = range_evaluate(rr, ast->children->next);
if (range_members(r1) > range_members(r2)) {
range_union_inplace(rr, r1, r2);
range_destroy(r2);
return r1;
} else {
range_union_inplace(rr, r2, r1);
range_destroy(r1);
return r2;
}
case AST_GROUP:
r1 = range_evaluate(rr, ast->children);
r = range_from_group(rr, r1);
range_destroy(r1);
return r;
case AST_DIFF:
r1 = range_evaluate(rr, ast->children);
if (ast->children->next->type == AST_REGEX)
r2 = range_from_match(rr, r1, ast->children->next->data.string);
else
r2 = range_evaluate(rr, ast->children->next);
range_diff_inplace(rr, r1, r2);
return r1;
case AST_INTER:
r1 = range_evaluate(rr, ast->children);
if (ast->children->next->type == AST_REGEX)
r2 = range_from_match(rr, r1, ast->children->next->data.string);
else
r2 = range_evaluate(rr, ast->children->next);
r = range_from_inter(rr, r1, r2);
range_destroy(r1);
range_destroy(r2);
return r;
case AST_NOT:
ranges = (range **)apr_palloc(pool, sizeof(range *) * (2));
ranges[0] = range_from_literal(rr, "all:CLUSTER");
ranges[1] = NULL;
r1 = range_from_function(rr, "cluster", (const range**)ranges);
r2 = range_evaluate(rr, ast->children);
range_diff_inplace(rr, r1, r2);
range_destroy(r2);
range_destroy(ranges[0]);
return r1;
case AST_REGEX:
ranges = (range **)apr_palloc(pool, sizeof(range *) * (2));
ranges[0] = range_from_literal(rr, "all:CLUSTER");
ranges[1] = NULL;
r1 = range_from_function(rr, "cluster", (const range**)ranges);
r = range_from_match(rr, r1, ast->data.string);
range_destroy(r1);
range_destroy(ranges[0]);
return r;
case AST_PARTS:
r = range_from_rangeparts(rr, ast->data.parts);
return r;
case AST_BRACES:
r1 = range_evaluate(rr, ast->children);
r2 = range_evaluate(rr, ast->children->next);
r3 = range_evaluate(rr, ast->children->next->next);
r = range_from_braces(rr, r1, r2, r3);
range_destroy(r1);
range_destroy(r2);
range_destroy(r3);
return r;
case AST_FUNCTION:
i=0;
for (rtmp = ast->children; rtmp; rtmp = rtmp->next)
i++;
ranges = (range **)apr_palloc(pool, sizeof(range *) * (i+1));
ranges[i] = NULL;
i=0;
for (rtmp = ast->children; rtmp; rtmp = rtmp->next)
ranges[i++] = range_evaluate(rr, rtmp);
r = range_from_function(rr, ast->data.string, (const range**)ranges);
for (i=0; ranges[i]; i++) range_destroy(ranges[i]);
return r;
case AST_NOTHING:
r = range_new(rr);
return r;
default:
fprintf(stderr, "ERROR IN LIBCRANGE: Corrupted AST\n");
abort();
}
}
