rtnode_t *
rttree_plookup_c (rttree_t *rr, const uint32_t *kp, unsigned int plen,
rtt_colormask_t c_i, rtt_colormask_t c_s)
{
/*
* Need a prefix, but nothing else. Hopefully the compiler will
* eliminate the code we're not using.
*/
return (rn_lookup(rr, kp, true, plen, true, c_i, c_s, false, NULL));
}
rtnode_t *
rttree_lookup_cx_v (rttree_t *rr, const uint32_t *kp, rtt_colormask_t i_m,
rtt_colormask_t s_m, const void *gorp)
{
/*
* No options here. Hopefully the compiler will eliminate
* the code we're not using.
*/
return (rn_lookup(rr, kp, false, 0, true, i_m, s_m, true, gorp));
}
rtnode_t *
rttree_plookup_x (rttree_t *rr, const uint32_t *kp, unsigned int plen,
const void *gorp)
{
/*
* Need a prefix, but nothing else. Hopefully the compiler will
* eliminate the code we're not using.
*/
return (rn_lookup(rr, kp, true, plen, false, 0, 0, true, gorp));
}
static struct radix_node *
at_lookup(void *v_arg, void *m_arg, struct radix_node_head * head)
{
struct radix_node *rn;
printf("at_lookup: v=%s\n", prsockaddr(v_arg));
printf("at_lookup: n=%s\n", prsockaddr(m_arg));
printf("at_lookup: head=%x\n", head);
rn = rn_lookup(v_arg, m_arg, head);
printf("at_lookup: returns rn=%x\n", rn);
return rn;
}
static struct radix_node *
at_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
{
return (rn_lookup(v_arg, m_arg, head));
}
