A FIB entry. More...

#include <entry.h>

Data Fields
struct cds_lfht_node	lfhtnode

uint16_t	nameL
	TLV-LENGTH of name. More...

uint8_t	nameV [FibMaxNameLength]

RTE_MARKER	cachelineA_

union {
StrategyCode * strategy
	Forwarding strategy. More...

FibEntry * realEntry
	Real FIB entry. More...

};

uint32_t	seqNum
	sequence number to detect FIB changes More...

uint8_t	nComps
	number of name components More...

uint8_t	nNexthops
	number of nexthops More...

uint8_t	height
	Height of a virtual node. More...

FaceID	nexthops [FibMaxNexthops]

char	b_ [16]

struct rcu_head	rcuhead

RTE_MARKER	cachelineB_

FibEntryDyn	dyn []

Detailed Description

A FIB entry.

Field Documentation

◆

union { ... }

◆ b_

char FibEntry::b_[16]

◆ cachelineA_

RTE_MARKER FibEntry::cachelineA_

◆ cachelineB_

RTE_MARKER FibEntry::cachelineB_

◆ dyn

FibEntryDyn FibEntry::dyn[]

◆ height

uint8_t FibEntry::height

Height of a virtual node.

Precondition: nComps == startDepth and this is a virtual node.

This field is known as '(MD - M)' in 2-stage LPM algorithm. The height of a node is the length of the longest downward path to a leaf from that node.

◆ lfhtnode

struct cds_lfht_node FibEntry::lfhtnode

◆ nameL

uint16_t FibEntry::nameL

TLV-LENGTH of name.

◆ nameV

uint8_t FibEntry::nameV[FibMaxNameLength]

◆ nComps

uint8_t FibEntry::nComps

number of name components

◆ nexthops

FaceID FibEntry::nexthops[FibMaxNexthops]

◆ nNexthops

uint8_t FibEntry::nNexthops

number of nexthops

◆ rcuhead

struct rcu_head FibEntry::rcuhead

◆ realEntry

FibEntry* FibEntry::realEntry

Real FIB entry.

Precondition: height > 0

◆ seqNum

uint32_t FibEntry::seqNum

sequence number to detect FIB changes

◆ strategy

StrategyCode* FibEntry::strategy

Forwarding strategy.

Precondition: height == 0

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

csrc/fib/entry.h

Data Fields