summaryrefslogtreecommitdiffstats
path: root/src/vpp/stats
diff options
context:
space:
mode:
Diffstat (limited to 'src/vpp/stats')
-rw-r--r--src/vpp/stats/stats.api6
-rw-r--r--src/vpp/stats/stats.md2
2 files changed, 4 insertions, 4 deletions
diff --git a/src/vpp/stats/stats.api b/src/vpp/stats/stats.api
index c66f2e4ab43..c94471ae93c 100644
--- a/src/vpp/stats/stats.api
+++ b/src/vpp/stats/stats.api
@@ -177,7 +177,7 @@ autoreply define want_ip6_fib_stats
u32 pid;
};
-/** \brief Want IP4 muilticast FIB Stats, register for continuous stats
+/** \brief Want IP4 multicast FIB Stats, register for continuous stats
@param client_index - opaque cookie to identify the sender
@param context - sender context, to match reply w/ request
@param enable_disable - 1 = enable stats, 0 = disable
@@ -273,7 +273,7 @@ typeonly manual_print manual_endian define ip4_nbr_counter
};
/**
- * @brief Per-neighbour (i.e. per-adjacency) coutners
+ * @brief Per-neighbour (i.e. per-adjacency) counters
* @param count The size of the array of counters
* @param sw_if_index The interface the adjacency is on
* @param begin Flag to indicate this is the first set of stats for this
@@ -494,7 +494,7 @@ autoreply define want_bier_neighbor_stats
/** \brief Stat for one BIER neighbor object
@param tbl_id - The BIER Table ID the neighbour belongs to.
- @param path - The path describing the negihbor (this is the data
+ @param path - The path describing the neighbor (this is the data
given during a BIER route add)
@param packets - number of packets sent
@param bytes - number of bytes sent
diff --git a/src/vpp/stats/stats.md b/src/vpp/stats/stats.md
index d66c31bb636..dd14a188e47 100644
--- a/src/vpp/stats/stats.md
+++ b/src/vpp/stats/stats.md
@@ -36,7 +36,7 @@ typedef struct {
```
#### Writer
-On the VPP side there is a single writer (controlled by a spinlock). When the writer starts it sets in_progress=1, continues with the update of the data-structues, and when done, bumps epoch++ and sets in_progress=0.
+On the VPP side there is a single writer (controlled by a spinlock). When the writer starts it sets in_progress=1, continues with the update of the data-structures, and when done, bumps epoch++ and sets in_progress=0.
#### Readers
If in_progress=1, there is no point continuing, so reader sits spinning on the in_progress flag until it is 0. Then it sets start_epoch = epoch and continues copying out the counter data it is interested in, while doing strict boundary checks on all offsets / pointers. When the reader is done, it checks if in_progress=1 or if epoch != start_epoch. If either of those are true is discards the data read.