* recurse. Instead, it just looks at itself, and it's immediate
* children for optimizations
*/
-static int cond_normalise(TALLOC_CTX *ctx, fr_token_t lhs_type, fr_cond_t **c_out)
+static int cond_normalise(fr_token_t lhs_type, fr_cond_t **c_out)
{
fr_cond_t *c = *c_out;
}
done:
- if (cond_normalise(ctx, lhs ? lhs->quote : T_INVALID, &c) < 0) {
+ if (cond_normalise(lhs ? lhs->quote : T_INVALID, &c) < 0) {
talloc_free(c);
return 0;
}
cond->type = COND_TYPE_MAP;
cond->data.map = map;
- if (cond_normalise(ctx, T_BARE_WORD, &cond) < 0) return -1;
+ if (cond_normalise(T_BARE_WORD, &cond) < 0) return -1;
/*
* If the condition is still a MAP, then make the map