A LISP GPE Adjacency. More...

Collaboration diagram for lisp_gpe_adjacency_t_:

Data Fields
fib_node_t	fib_node
	The LISP adj is a part of the FIB control plane graph. More...

ip_address_t	remote_rloc
	remote RLOC. More...

u32	vni
	The VNI. More...

u32	locks
	The number of locks/reference counts on the adjacency. More...

u32	lisp_l3_sub_index
	The index of the LISP L3 subinterface. More...

u32	sw_if_index
	The SW IF index of the sub-interface this adjacency uses. More...

u32	tunnel_index
	The index of the LISP GPE tunnel that provides the transport in the underlay. More...

u32	fib_entry_child_index
	This adjacency is a child of the FIB entry to reach the RLOC. More...

u8	flags
	LISP header fields in HOST byte order. More...

u8	ver_res

u8	res

u8	next_protocol

Detailed Description

A LISP GPE Adjacency.

A adjacency represents peer on an L3 sub-interface to which to send traffic. adjacencies are thus present in the EID space. The peer is identified by the key:{remote-rloc, sub-interface}, which is equivalent to the usal adjacency key {next-hop, interface}. So curiously the rloc address from the underlay is used as a next hop address in the overlay This is OK because: 1 - the RLOC is unique in the underlay AND there is only one underlay VRF per overlay 2 - the RLOC may overlap with an address in the overlay, but we do not create an adj-fib (i.e. a route in the overlay FIB for the rloc)

Definition at line 43 of file lisp_gpe_adjacency.h.

Field Documentation

◆ fib_entry_child_index

u32 lisp_gpe_adjacency_t_::fib_entry_child_index

This adjacency is a child of the FIB entry to reach the RLOC.

This is so when the reachability of that RLOC changes, we can restack the FIB adjacnecies.

Definition at line 87 of file lisp_gpe_adjacency.h.

◆ fib_node

fib_node_t lisp_gpe_adjacency_t_::fib_node

The LISP adj is a part of the FIB control plane graph.

Definition at line 48 of file lisp_gpe_adjacency.h.

◆ flags

u8 lisp_gpe_adjacency_t_::flags

LISP header fields in HOST byte order.

Definition at line 92 of file lisp_gpe_adjacency.h.

◆ lisp_l3_sub_index

u32 lisp_gpe_adjacency_t_::lisp_l3_sub_index

The index of the LISP L3 subinterface.

Definition at line 68 of file lisp_gpe_adjacency.h.

◆ locks

u32 lisp_gpe_adjacency_t_::locks

The number of locks/reference counts on the adjacency.

Definition at line 63 of file lisp_gpe_adjacency.h.

◆ next_protocol

u8 lisp_gpe_adjacency_t_::next_protocol

Definition at line 95 of file lisp_gpe_adjacency.h.

◆ remote_rloc

ip_address_t lisp_gpe_adjacency_t_::remote_rloc

remote RLOC.

The adjacency's next-hop

Definition at line 53 of file lisp_gpe_adjacency.h.

◆ res

u8 lisp_gpe_adjacency_t_::res

Definition at line 94 of file lisp_gpe_adjacency.h.

◆ sw_if_index

u32 lisp_gpe_adjacency_t_::sw_if_index

The SW IF index of the sub-interface this adjacency uses.

Cached for convenience from the LISP L3 sub-interface

Definition at line 74 of file lisp_gpe_adjacency.h.

◆ tunnel_index

u32 lisp_gpe_adjacency_t_::tunnel_index

The index of the LISP GPE tunnel that provides the transport in the underlay.

Definition at line 80 of file lisp_gpe_adjacency.h.

◆ ver_res

u8 lisp_gpe_adjacency_t_::ver_res

Definition at line 93 of file lisp_gpe_adjacency.h.

◆ vni

u32 lisp_gpe_adjacency_t_::vni

The VNI.

Used in combination with the local-rloc to get the sub-interface

Definition at line 58 of file lisp_gpe_adjacency.h.

The documentation for this struct was generated from the following file:

src/vnet/lisp-gpe/lisp_gpe_adjacency.h

Data Fields