u32 next_hop_child_index;
/**
- * The next DPO in the grpah to follow
+ * The next DPO in the graph to follow
*/
dpo_id_t ila_dpo;
} ila_entry_t;
* @brief IP unicast adjacency.
* @note cache aligned.
*
- * An adjacency is a represenation of a peer on a particular link.
+ * An adjacency is a representation of a peer on a particular link.
*/
typedef struct ip_adjacency_t_
{
CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
/**
- * Linkage into the FIB node grpah. First member since this type
+ * Linkage into the FIB node graph. First member since this type
* has 8 byte alignment requirements.
*/
fib_node_t ia_node;
/**
* The protocol of the neighbor/peer. i.e. the protocol with
- * which to interpret the 'next-hop' attirbutes of the sub-types.
+ * which to interpret the 'next-hop' attributes of the sub-types.
* 1-btyes
*/
fib_protocol_t ia_nh_proto;
} ip_adjacency_t;
STATIC_ASSERT ((STRUCT_OFFSET_OF (ip_adjacency_t, cacheline0) == 0),
- "IP adjacency cachline 0 is not offset");
+ "IP adjacency cacheline 0 is not offset");
STATIC_ASSERT ((STRUCT_OFFSET_OF (ip_adjacency_t, cacheline1) ==
CLIB_CACHE_LINE_BYTES),
- "IP adjacency cachline 1 is more than one cachline size offset");
+ "IP adjacency cacheline 1 is more than one cacheline size offset");
/**
* @brief
/**
* @brief
- * The global adjacnecy pool. Exposed for fast/inline data-plane access
+ * The global adjacency pool. Exposed for fast/inline data-plane access
*/
extern ip_adjacency_t *adj_pool;
#include <vnet/ethernet/ethernet.h>
/**
- * represenation of a pipe interface
+ * representation of a pipe interface
*/
typedef struct pipe_t_
{
} dhcp_server_t;
/**
- * @brief A DHCP proxy represenation fpr per-client VRF config
+ * @brief A DHCP proxy representation fpr per-client VRF config
*/
typedef struct dhcp_proxy_t_
{
* VLIB graph arcs are created, from the child_node passed.
*
* @param child_node
- * The VLIB grpah node index to create an arc from to the parent
+ * The VLIB graph node index to create an arc from to the parent
*
* @param dpo
* This is the DPO to stack and set.
/*
* when the weight skew is high (norm is small) and n == nf.
* without this correction the path with a low weight would have
- * no represenation in the load-balanace - don't want that.
+ * no representation in the load-balanace - don't want that.
* If the weight skew is high so the load-balance has many buckets
* to allow it. pays ya money takes ya choice.
*/
} load_balance_t;
STATIC_ASSERT(sizeof(load_balance_t) <= CLIB_CACHE_LINE_BYTES,
- "A load_balance object size exceeds one cachline");
+ "A load_balance object size exceeds one cacheline");
/**
* Flags controlling load-balance formatting/display
} replicate_t;
STATIC_ASSERT(sizeof(replicate_t) <= CLIB_CACHE_LINE_BYTES,
- "A replicate object size exceeds one cachline");
+ "A replicate object size exceeds one cacheline");
/**
* Flags controlling load-balance formatting/display
/**
* The different sources that can create a route.
- * The sources are defined here the thier relative priority order.
+ * The sources are defined here with their relative priority order.
* The lower the value the higher the priority
*/
typedef enum fib_source_t_ {
/**
* The different sources that can create a route.
- * The sources are defined here the thier relative priority order.
+ * The sources are defined here with their relative priority order.
* The lower the value the higher the priority
*/
typedef enum fib_entry_attribute_t_ {
} fib_node_bw_flags_t;
/**
- * Forward eclarations
+ * Forward declarations
*/
struct fib_node_t_;
fib_path_attached_next_hop_set (fib_path_t *path)
{
/*
- * resolve directly via the adjacnecy discribed by the
+ * resolve directly via the adjacency discribed by the
* interface and next-hop
*/
dpo_set(&path->fp_dpo,
/**
* The magic number of child entries that make a path-list popular.
- * There's a trade-off here between convergnece and forwarding speed.
+ * There's a trade-off here between convergence and forwarding speed.
* Popular path-lists generate load-balance maps for the entries that
* use them. If the map is present there is a switch path cost to indirect
* through the map - this indirection provides the fast convergence - so
{
/*
* the path-list is not a direct child of any other node type
- * paths, which do not change thier to-list-mapping, save the
+ * paths, which do not change their to-list-mapping, save the
* list they are a member of, and invoke the BW function directly.
*/
ASSERT(0);
extern dpo_proto_t fib_forw_chain_type_to_dpo_proto(fib_forward_chain_type_t fct);
/**
- * Aggregrate type for a prefix
+ * Aggregate type for a prefix
*/
typedef struct fib_prefix_t_ {
/**
static const char * const fib_node_bw_reason_names[] = FIB_NODE_BW_REASONS;
/**
- * A represenation of one queue of walk
+ * A representation of one queue of walk
*/
typedef struct fib_walk_queue_t_
{
* @brief Back walk all the children of a FIB node.
*
* note this is a synchronous depth first walk. Children visited may propagate
- * the walk to thier children. Other children node types may not propagate,
+ * the walk to their children. Other children node types may not propagate,
* synchronously but instead queue the walk for later async completion.
*/
void
#include <vnet/fib/ip4_fib.h>
/*
- * A table of pefixes to be added to tables and the sources for them
+ * A table of prefixes to be added to tables and the sources for them
*/
typedef struct ip4_fib_table_special_prefix_t_ {
fib_prefix_t ift_prefix;
int i;
/*
- * There is no efficent way to walk this array of hash tables.
+ * There is no efficient way to walk this array of hash tables.
* so we walk each table with a mask length greater than and equal to
* the required root and check it is covered by the root.
*/
void
ip4_mtrie_free (ip4_fib_mtrie_t * m)
{
- /* the root ply is embedded so the is nothing to do,
+ /* the root ply is embedded so there is nothing to do,
* the assumption being that the IP4 FIB table has emptied the trie
* before deletion.
*/
i32 n_non_empty_leafs;
/**
- * The length of the ply's coviering prefix. Also a measure of its depth
+ * The length of the ply's covering prefix. Also a measure of its depth
* If a leaf in a slot has a mask length longer than this then it is
* 'non-empty'. Otherwise it is the value of the cover.
*/
/**
* Embed the PLY with the mtrie struct. This means that the Data-plane
* 'get me the mtrie' returns the first ply, and not an indirect 'pointer'
- * to it. therefore no cachline misses in the data-path.
+ * to it. therefore no cacheline misses in the data-path.
*/
ip4_fib_mtrie_16_ply_t root_ply;
} ip4_fib_mtrie_t;
void ip4_mtrie_free (ip4_fib_mtrie_t * m);
/**
- * @brief Add a route/rntry to the mtrie
+ * @brief Add a route/entry to the mtrie
*/
void ip4_fib_mtrie_route_add (ip4_fib_mtrie_t * m,
const ip4_address_t * dst_address,
u32 dst_address_length, u32 adj_index);
/**
- * @brief remove a route/rntry to the mtrie
+ * @brief remove a route/entry to the mtrie
*/
void ip4_fib_mtrie_route_del (ip4_fib_mtrie_t * m,
const ip4_address_t * dst_address,
extern ip4_fib_mtrie_8_ply_t *ip4_ply_pool;
/**
- * Is the leaf terminal (i.e. an LB index) or non-terminak (i.e. a PLY index)
+ * Is the leaf terminal (i.e. an LB index) or non-terminal (i.e. a PLY index)
*/
always_inline u32
ip4_fib_mtrie_leaf_is_terminal (ip4_fib_mtrie_leaf_t n)
{
/**
* This table stores the routes that are used to forward traffic.
- * The key is the prefix, the result the adjacnecy to forward on.
+ * The key is the prefix, the result the adjacency to forward on.
*/
IP6_FIB_TABLE_FWDING,
/**
#define IP6_FIB_NUM_TABLES (IP6_FIB_TABLE_NON_FWDING+1)
/**
- * A represenation of a single IP6 table
+ * A representation of a single IP6 table
*/
typedef struct ip6_fib_table_instance_t_
{
} ip6_fib_table_instance_t;
/**
- * A represenation of a single IP6 mfib table
+ * A representation of a single IP6 mfib table
*/
typedef struct ip6_mfib_table_instance_t_
{
#include <vnet/ip/ip6_packet.h>
/**
- * Aggregrate type for a prefix in the IPv6 Link-local table
+ * Aggregate type for a prefix in the IPv6 Link-local table
*/
typedef struct ip6_ll_prefix_t_
{
#include <vnet/fib/fib_types.h>
/**
- * Aggregrate type for a prefix
+ * Aggregate type for a prefix
*/
typedef struct mfib_prefix_t_ {
/**
Code Review / vpp.git / commitdiff