static RParserMatch *
_clear_match_slot(RFindNodeState *state, gint matches_base)
{
RParserMatch *match = NULL;
if (state->stored_matches)
{
match = _get_match_slot(state, matches_base);
memset(match, 0, sizeof(*match));
}
return match;
}
static RNode *
_try_parse_with_a_given_child(RFindNodeState *state, RNode *root, gint parser_ndx, gint matches_slot_index,
gchar *remaining_key, gint remaining_keylen)
{
RNode *child_node = root->pchildren[parser_ndx];
RParserNode *parser_node = child_node->parser;
RParserMatch *match_slot = NULL;
gint extracted_match_len;
RNode *ret = NULL;
match_slot = _clear_match_slot(state, matches_slot_index);
if (_pnode_try_parse(parser_node, remaining_key, &extracted_match_len, match_slot))
{
/* FIXME: we don't try to find the longest match in case
* the radix tree is split on a parser node. The correct
* approach would be to try all parsers and select the
* best match, however it is quite expensive and difficult
* to implement and we don't really expect this to be a
* realistic case. A log message is printed if such a
* collision occurs, so there's a slight chance we'll
* recognize if this happens in real life. */
_add_parser_match_debug_info(state, root, parser_node, remaining_key, extracted_match_len, match_slot);
ret = _find_node_recursively(state, root->pchildren[parser_ndx], remaining_key + extracted_match_len,
remaining_keylen - extracted_match_len);
/* we have to look up "match_slot" again as the GArray may have
* moved the data in case r_find_node() expanded it above */
match_slot = _get_match_slot(state, matches_slot_index);
if (match_slot)
{
if (ret)
_fixup_match_offsets(state, parser_node, extracted_match_len, remaining_key, match_slot);
else
_clear_match_content(match_slot);
}
}
return ret;
}
