adj_midchain.h File Reference

Include dependency graph for adj_midchain.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	adj_nbr_midchain_update_rewrite (adj_index_t adj_index, adj_midchain_fixup_t fixup, const void *fixup_data, adj_flags_t flags, u8 *rewrite)
	Midchain Adjacency sub-type. More...
void	adj_nbr_midchain_stack (adj_index_t adj_index, const dpo_id_t *dpo)
	[re]stack a midchain. More...
void	adj_nbr_midchain_unstack (adj_index_t adj_index)
	unstack a midchain. More...
void	adj_midchain_module_init (void)
	Module initialisation. More...
u8 *	format_adj_midchain (u8 *s, va_list *ap)
	Format a midchain adjacency. More...

Function Documentation

void adj_midchain_module_init

(

void

)

Module initialisation.

Definition at line 670 of file adj_midchain.c.

Here is the call graph for this function:

Here is the caller graph for this function:

void adj_nbr_midchain_stack	(	adj_index_t	adj_index,
		const dpo_id_t *	next
	)

[re]stack a midchain.

'Stacking' is the act of forming parent-child relationships in the data-plane graph.

Parameters

adj_index	The index of the midchain to stack
dpo	The parent DPO to stack onto (i.e. become a child of).

[re]stack a midchain.

Definition at line 570 of file adj_midchain.c.

Here is the call graph for this function:

Here is the caller graph for this function:

void adj_nbr_midchain_unstack

(

adj_index_t

adj_index

)

unstack a midchain.

This will break the chain between the midchain and the next graph section. This is a implemented as stack-on-drop

Parameters

adj_index

The index of the midchain to stack

unstack a midchain.

Unstack the adj. stack it on drop

Definition at line 548 of file adj_midchain.c.

Here is the call graph for this function:

Here is the caller graph for this function:

void adj_nbr_midchain_update_rewrite	(	adj_index_t	adj_index,
		adj_midchain_fixup_t	fixup,
		const void *	fixup_data,
		adj_flags_t	flags,
		u8 *	rewrite
	)

Midchain Adjacency sub-type.

These adjs represent an L3 peer on a tunnel interface. The tunnel's adjacency is thus not the end of the chain, and needs to stack on/link to another chain (or portion of the graph) to reach the tunnel's destination.

Convert an existing neighbour adjacency into a midchain

Parameters

adj_index	The index of the neighbour adjacency.
fixup	The function that will be invoked at paket switch time to 'fixup' the rewrite applied with necessary per-packet info (i.e. length, checksums).
fixup_data	Context data set by the caller that is provided as an argument in the fixup function.
flags	Flags controlling the adjacency behaviour
rewrite	The rewrite.

Midchain Adjacency sub-type.

Update the adjacency's rewrite string. A NULL string implies the rewrite is reset (i.e. when ARP/ND etnry is gone). NB: the adj being updated may be handling traffic in the DP.

Definition at line 506 of file adj_midchain.c.

Here is the call graph for this function:

Here is the caller graph for this function:

u8* format_adj_midchain	(	u8 *	s,
		va_list *	ap
	)

Format a midchain adjacency.

Definition at line 588 of file adj_midchain.c.

Here is the call graph for this function:

Here is the caller graph for this function: