summaryrefslogtreecommitdiffstats
path: root/src/vnet/fib
diff options
context:
space:
mode:
Diffstat (limited to 'src/vnet/fib')
-rw-r--r--src/vnet/fib/fib_entry.h4
-rw-r--r--src/vnet/fib/fib_node.h2
-rw-r--r--src/vnet/fib/fib_path.c2
-rw-r--r--src/vnet/fib/fib_path_list.c4
-rw-r--r--src/vnet/fib/fib_types.h2
-rw-r--r--src/vnet/fib/fib_walk.c4
-rw-r--r--src/vnet/fib/ip4_fib.c4
7 files changed, 11 insertions, 11 deletions
diff --git a/src/vnet/fib/fib_entry.h b/src/vnet/fib/fib_entry.h
index 8bd87e9d222..4ce28b1ae9d 100644
--- a/src/vnet/fib/fib_entry.h
+++ b/src/vnet/fib/fib_entry.h
@@ -23,7 +23,7 @@
/**
* 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_ {
@@ -193,7 +193,7 @@ STATIC_ASSERT (sizeof(fib_source_t) == 1,
/**
* 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_ {
diff --git a/src/vnet/fib/fib_node.h b/src/vnet/fib/fib_node.h
index bd8bee067e4..5cf9182560f 100644
--- a/src/vnet/fib/fib_node.h
+++ b/src/vnet/fib/fib_node.h
@@ -175,7 +175,7 @@ typedef enum fib_node_bw_flags_t_
} fib_node_bw_flags_t;
/**
- * Forward eclarations
+ * Forward declarations
*/
struct fib_node_t_;
diff --git a/src/vnet/fib/fib_path.c b/src/vnet/fib/fib_path.c
index ed7bc0262fc..17aa77feee8 100644
--- a/src/vnet/fib/fib_path.c
+++ b/src/vnet/fib/fib_path.c
@@ -676,7 +676,7 @@ static void
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,
diff --git a/src/vnet/fib/fib_path_list.c b/src/vnet/fib/fib_path_list.c
index a9976e52ba9..07d54f4d4d6 100644
--- a/src/vnet/fib/fib_path_list.c
+++ b/src/vnet/fib/fib_path_list.c
@@ -29,7 +29,7 @@
/**
* 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
@@ -512,7 +512,7 @@ fib_path_list_back_walk_notify (fib_node_t *node,
{
/*
* 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);
diff --git a/src/vnet/fib/fib_types.h b/src/vnet/fib/fib_types.h
index 980fe3d1d0a..91d1d7b2fde 100644
--- a/src/vnet/fib/fib_types.h
+++ b/src/vnet/fib/fib_types.h
@@ -198,7 +198,7 @@ extern fib_forward_chain_type_t fib_forw_chain_type_from_fib_proto(fib_protocol_
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_ {
/**
diff --git a/src/vnet/fib/fib_walk.c b/src/vnet/fib/fib_walk.c
index fca1bfe13d8..a09e34df3ba 100644
--- a/src/vnet/fib/fib_walk.c
+++ b/src/vnet/fib/fib_walk.c
@@ -127,7 +127,7 @@ static const char * const fib_walk_queue_stats_names[] = FIB_WALK_QUEUE_STATS;
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_
{
@@ -738,7 +738,7 @@ fib_walk_async (fib_node_type_t parent_type,
* @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
diff --git a/src/vnet/fib/ip4_fib.c b/src/vnet/fib/ip4_fib.c
index 8944637c127..0204b7a129a 100644
--- a/src/vnet/fib/ip4_fib.c
+++ b/src/vnet/fib/ip4_fib.c
@@ -18,7 +18,7 @@
#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;
@@ -435,7 +435,7 @@ ip4_fib_table_sub_tree_walk (ip4_fib_t *fib,
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.
*/