diff options
| author | Bjorn Helgaas <bhelgaas@google.com> | 2023-08-14 23:28:22 +0200 |
|---|---|---|
| committer | Jonathan Corbet <corbet@lwn.net> | 2023-08-18 19:29:03 +0200 |
| commit | d56b699d76d1b352f7a3d3a0a3e91c79b8612d94 (patch) | |
| tree | 2a368f3e2e17f7a516bf39e055f79d8c79a74885 /Documentation/networking/devlink | |
| parent | Documentation/ABI: Fix typos (diff) | |
| download | linux-d56b699d76d1b352f7a3d3a0a3e91c79b8612d94.tar.xz linux-d56b699d76d1b352f7a3d3a0a3e91c79b8612d94.zip | |
Documentation: Fix typos
Fix typos in Documentation.
Signed-off-by: Bjorn Helgaas <bhelgaas@google.com>
Link: https://lore.kernel.org/r/20230814212822.193684-4-helgaas@kernel.org
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
Diffstat (limited to 'Documentation/networking/devlink')
| -rw-r--r-- | Documentation/networking/devlink/devlink-port.rst | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/Documentation/networking/devlink/devlink-port.rst b/Documentation/networking/devlink/devlink-port.rst index 3da590953ce8..e0c7b95f505b 100644 --- a/Documentation/networking/devlink/devlink-port.rst +++ b/Documentation/networking/devlink/devlink-port.rst @@ -321,9 +321,9 @@ API allows to configure following rate object's parameters: Allows for usage of Weighted Fair Queuing arbitration scheme among siblings. This arbitration scheme can be used simultaneously with the strict priority. As a node is configured with a higher rate it gets more - BW relative to it's siblings. Values are relative like a percentage + BW relative to its siblings. Values are relative like a percentage points, they basically tell how much BW should node take relative to - it's siblings. + its siblings. ``parent`` Parent node name. Parent node rate limits are considered as additional limits @@ -343,7 +343,7 @@ Arbitration flow from the high level: #. If group of nodes have the same priority perform WFQ arbitration on that subgroup. Use ``tx_weight`` as a parameter for this arbitration. -#. Select the winner node, and continue arbitration flow among it's children, +#. Select the winner node, and continue arbitration flow among its children, until leaf node is reached, and the winner is established. #. If all the nodes from the highest priority sub-group are satisfied, or |