Minor typos in comments.
Signed-off-by: Stephen Hemminger <stephen@networkplumber.org>
---
lib/librte_acl/acl.h | 4 ++--
lib/librte_acl/acl_bld.c | 2 +-
lib/librte_acl/acl_run_avx2.h | 2 +-
3 files changed, 4 insertions(+), 4 deletions(-)
@@ -45,7 +45,7 @@ struct rte_acl_bitset {
* Each transition is 64 bit value with the following format:
* | node_type_specific : 32 | node_type : 3 | node_addr : 29 |
* For all node types except RTE_ACL_NODE_MATCH, node_addr is an index
- * to the start of the node in the transtions array.
+ * to the start of the node in the transitions array.
* Few different node types are used:
* RTE_ACL_NODE_MATCH:
* node_addr value is and index into an array that contains the return value
@@ -66,7 +66,7 @@ struct rte_acl_bitset {
* RTE_ACL_NODE_SINGLE:
* always transitions to the same node regardless of the input value.
* RTE_ACL_NODE_DFA:
- * that node consits of up to 256 transitions.
+ * that node consists of up to 256 transitions.
* In attempt to conserve space all transitions are divided into 4 consecutive
* groups, by 64 transitions per group:
* group64[i] contains transitions[i * 64, .. i * 64 + 63].
@@ -1430,7 +1430,7 @@ acl_set_data_indexes(struct rte_acl_ctx *ctx)
/*
* Internal routine, performs 'build' phase of trie generation:
* - setups build context.
- * - analizes given set of rules.
+ * - analyzes given set of rules.
* - builds internal tree(s).
*/
static int
@@ -125,7 +125,7 @@ acl_process_matches_avx2x8(const struct rte_acl_ctx *ctx,
/* For each transition: put low 32 into tr_lo and high 32 into tr_hi */
ACL_TR_HILO(mm256, __m256, t0, t1, lo, hi);
- /* Keep transitions wth NOMATCH intact. */
+ /* Keep transitions with NOMATCH intact. */
*tr_lo = _mm256_blendv_epi8(*tr_lo, lo, matches);
*tr_hi = _mm256_blendv_epi8(*tr_hi, hi, matches);
}