From 1f9c73593c9db0205b4dc51b8b7cac495c0ca482 Mon Sep 17 00:00:00 2001 From: Qi Zhang Date: Wed, 26 Aug 2020 17:52:43 +0800 Subject: [PATCH] net/ice/base: fix abbreviations Correct abbreviations as identified by abbrevcheck Signed-off-by: Tony Nguyen Signed-off-by: Qi Zhang Acked-by: Qiming Yang --- drivers/net/ice/base/ice_flex_pipe.c | 6 +++--- drivers/net/ice/base/ice_sched.c | 16 ++++++++-------- 2 files changed, 11 insertions(+), 11 deletions(-) diff --git a/drivers/net/ice/base/ice_flex_pipe.c b/drivers/net/ice/base/ice_flex_pipe.c index 3df7b8596f..d4b2e4f290 100644 --- a/drivers/net/ice/base/ice_flex_pipe.c +++ b/drivers/net/ice/base/ice_flex_pipe.c @@ -5228,7 +5228,7 @@ ice_prof_tcam_ena_dis(struct ice_hw *hw, enum ice_block blk, bool enable, /* for re-enabling, reallocate a TCAM */ /* for entries with empty attribute masks, allocate entry from - * the bottom of the tcam table; otherwise, allocate from the + * the bottom of the TCAM table; otherwise, allocate from the * top of the table in order to give it higher priority */ status = ice_alloc_tcam_ent(hw, blk, tcam->attr.mask == 0, @@ -5439,7 +5439,7 @@ ice_add_prof_id_vsig(struct ice_hw *hw, enum ice_block blk, u16 vsig, u64 hdl, /* allocate the TCAM entry index */ /* for entries with empty attribute masks, allocate entry from - * the bottom of the tcam table; otherwise, allocate from the + * the bottom of the TCAM table; otherwise, allocate from the * top of the table in order to give it higher priority */ status = ice_alloc_tcam_ent(hw, blk, map->attr[i].mask == 0, @@ -5872,7 +5872,7 @@ ice_rem_prof_id_flow(struct ice_hw *hw, enum ice_block blk, u16 vsi, u64 hdl) if (last_profile) { /* If there are no profiles left for this VSIG, - * then simply remove the the VSIG. + * then simply remove the VSIG. */ status = ice_rem_vsig(hw, blk, vsig, &chg); if (status) diff --git a/drivers/net/ice/base/ice_sched.c b/drivers/net/ice/base/ice_sched.c index e189e95f74..f5f3b85d69 100644 --- a/drivers/net/ice/base/ice_sched.c +++ b/drivers/net/ice/base/ice_sched.c @@ -1435,14 +1435,14 @@ ice_sched_find_node_in_subtree(struct ice_hw *hw, struct ice_sched_node *base, } /** - * ice_sched_get_free_qgrp - Scan all Q group siblings and find a free node + * ice_sched_get_free_qgrp - Scan all queue group siblings and find a free node * @pi: port information structure * @vsi_node: software VSI handle - * @qgrp_node: first Q group node identified for scanning + * @qgrp_node: first queue group node identified for scanning * @owner: LAN or RDMA * - * This function retrieves a free LAN or RDMA Q group node by scanning - * qgrp_node and its siblings for the Q group with the fewest number + * This function retrieves a free LAN or RDMA queue group node by scanning + * qgrp_node and its siblings for the queue group with the fewest number * of queues currently assigned. */ static struct ice_sched_node * @@ -1459,17 +1459,17 @@ ice_sched_get_free_qgrp(struct ice_port_info *pi, if (!min_children) return qgrp_node; min_qgrp = qgrp_node; - /* scan all Q groups until find a node which has less than the - * minimum number of children. This way all Q group nodes get + /* scan all queue groups until find a node which has less than the + * minimum number of children. This way all queue group nodes get * equal number of shares and active. The bandwidth will be equally - * distributed across all Qs. + * distributed across all queues. */ while (qgrp_node) { /* make sure the qgroup node is part of the VSI subtree */ if (ice_sched_find_node_in_subtree(pi->hw, vsi_node, qgrp_node)) if (qgrp_node->num_children < min_children && qgrp_node->owner == owner) { - /* replace the new min Q group node */ + /* replace the new min queue group node */ min_qgrp = qgrp_node; min_children = min_qgrp->num_children; /* break if it has no children, */ -- 2.20.1