18 #ifndef __INCLUDE_IP_NEIGHBOR_TYPES_H__ 19 #define __INCLUDE_IP_NEIGHBOR_TYPES_H__ 25 #define foreach_ip_neighbor_flag \ 26 _(STATIC, 1 << 0, "static", "S") \ 27 _(DYNAMIC, 1 << 1, "dynamic", "D") \ 28 _(NO_FIB_ENTRY, 1 << 2, "no-fib-entry", "N") \ 29 _(PENDING, 1 << 3, "pending", "P") \ 30 _(STALE, 1 << 4, "stale", "A") \ 35 #define _(a,b,c,d) IP_NEIGHBOR_FLAG_##a = b, f64 ipn_time_last_updated
Aging related data.
struct ip_neighbor_learn_t_ ip_neighbor_learn_t
void ip_neighbor_clone(const ip_neighbor_t *ipn, ip_neighbor_t *clone)
u8 * format_ip_neighbor_flags(u8 *s, va_list *args)
ip_neighbor_t * ip_neighbor_get(index_t ipni)
u8 * format_ip_neighbor_watcher(u8 *s, va_list *args)
u32 index_t
A Data-Path Object is an object that represents actions that are applied to packets are they are swit...
u8 * format_ip_neighbor(u8 *s, va_list *args)
struct ip_neighbor_t_ ip_neighbor_t
A representation of an IP neighbour/peer.
ip_neighbor_event_flags_t ipne_flags
ip_neighbor_event_flags_t_
A representation of an IP neighbour/peer.
mac_address_t ipn_mac
The learned MAC address of the neighbour.
fib_node_index_t ipn_fib_entry_index
The index of the adj fib created for this neighbour.
#define foreach_ip_neighbor_flag
u32 fib_node_index_t
A typedef of a node index.
u8 * format_ip_neighbor_key(u8 *s, va_list *args)
struct ip_neighbor_watcher_t_ ip_neighbor_watcher_t
enum ip_neighbor_event_flags_t_ ip_neighbor_event_flags_t
ip_neighbor_key_t * ipn_key
The idempotent key.
enum ip_neighbor_flags_t_ ip_neighbor_flags_t
struct ip_neighbor_event_t_ ip_neighbor_event_t
void ip_neighbor_free(ip_neighbor_t *ipn)
ip_neighbor_flags_t ipn_flags
Falgs for this object.
struct ip_neighbor_key_t_ ip_neighbor_key_t
ip_neighbor_watcher_t ipne_watch