/* Find matched prefix. */
struct route_node *
-route_node_match (const struct route_table *table, const struct prefix *p)
+route_node_match (const struct route_table *table, union prefixconstptr pu)
{
+ const struct prefix *p = pu.p;
struct route_node *node;
struct route_node *matched;
/* Lookup same prefix node. Return NULL when we can't find route. */
struct route_node *
-route_node_lookup (const struct route_table *table, const struct prefix *p)
+route_node_lookup (const struct route_table *table, union prefixconstptr pu)
{
+ const struct prefix *p = pu.p;
struct route_node *node;
u_char prefixlen = p->prefixlen;
const u_char *prefix = &p->u.prefix;
/* Lookup same prefix node. Return NULL when we can't find route. */
struct route_node *
-route_node_lookup_maynull (const struct route_table *table, const struct prefix *p)
+route_node_lookup_maynull (const struct route_table *table, union prefixconstptr pu)
{
+ const struct prefix *p = pu.p;
struct route_node *node;
u_char prefixlen = p->prefixlen;
const u_char *prefix = &p->u.prefix;
/* Add node to routing table. */
struct route_node *
-route_node_get (struct route_table *const table, const struct prefix *p)
+route_node_get (struct route_table *const table, union prefixconstptr pu)
{
+ const struct prefix *p = pu.p;
struct route_node *new;
struct route_node *node;
struct route_node *match;
/* Unlock current node and lock next node until limit. */
struct route_node *
-route_next_until (struct route_node *node, struct route_node *limit)
+route_next_until (struct route_node *node, const struct route_node *limit)
{
struct route_node *next;
struct route_node *start;
* +1 if p1 occurs after p2 (p1 > p2)
*/
int
-route_table_prefix_iter_cmp (struct prefix *p1, struct prefix *p2)
+route_table_prefix_iter_cmp (const struct prefix *p1, const struct prefix *p2)
{
struct prefix common_space;
struct prefix *common = &common_space;
*/
static struct route_node *
route_table_get_next_internal (const struct route_table *table,
- struct prefix *p)
+ const struct prefix *p)
{
struct route_node *node, *tmp_node;
int cmp;
* iteration.
*/
struct route_node *
-route_table_get_next (const struct route_table *table, struct prefix *p)
+route_table_get_next (const struct route_table *table, union prefixconstptr pu)
{
+ const struct prefix *p = pu.p;
struct route_node *node;
node = route_table_get_next_internal (table, p);
extern struct route_node *route_top (struct route_table *);
extern struct route_node *route_next (struct route_node *);
extern struct route_node *route_next_until (struct route_node *,
- struct route_node *);
+ const struct route_node *);
extern struct route_node *route_node_get (struct route_table *const,
- const struct prefix *);
+ union prefixconstptr);
extern struct route_node *route_node_lookup (const struct route_table *,
- const struct prefix *);
+ union prefixconstptr);
extern struct route_node *route_node_lookup_maynull (const struct route_table *,
- const struct prefix *);
+ union prefixconstptr);
extern struct route_node *route_lock_node (struct route_node *node);
extern struct route_node *route_node_match (const struct route_table *,
- const struct prefix *);
+ union prefixconstptr);
extern struct route_node *route_node_match_ipv4 (const struct route_table *,
const struct in_addr *);
extern struct route_node *route_node_match_ipv6 (const struct route_table *,
struct route_table *, struct route_node *);
extern struct route_node *
-route_table_get_next (const struct route_table *table, struct prefix *p);
+route_table_get_next (const struct route_table *table, union prefixconstptr pu);
extern int
-route_table_prefix_iter_cmp (struct prefix *p1, struct prefix *p2);
+route_table_prefix_iter_cmp (const struct prefix *p1, const struct prefix *p2);
/*
* Iterator functions.