Minki/linux
1
0
Fork 1
mirror of https://github.com/torvalds/linux.git synced 2024-11-21 19:41:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

net: sched: Correct spelling in headers

Browse Source 
Correct spelling in pkt_cls.h and red.h.
As reported by codespell.

Cc: Krzysztof Kozlowski <krzk@kernel.org>
Signed-off-by: Simon Horman <horms@kernel.org>
Link: https://patch.msgid.link/20240822-net-spell-v1-9-3a98971ce2d2@kernel.org
Signed-off-by: Jakub Kicinski <kuba@kernel.org>
This commit is contained in:
Simon Horman 2024-08-22 13:57:30 +01:00 committed by Jakub Kicinski
parent 10d0749a38
commit a7a45f02a0
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/net/pkt_cls.h
View File

@ -491,7 +491,7 @@ int __tcf_em_tree_match(struct sk_buff *, struct tcf_ematch_tree *,
struct tcf_pkt_info *); struct tcf_pkt_info *);
/** /**
* tcf_em_tree_match - evaulate an ematch tree * tcf_em_tree_match - evaluate an ematch tree
* *
* @skb: socket buffer of the packet in question * @skb: socket buffer of the packet in question
* @tree: ematch tree to be used for evaluation * @tree: ematch tree to be used for evaluation

8
include/net/red.h
View File

@ -40,7 +40,7 @@
max_P should be small (not 1), usually 0.01..0.02 is good value. max_P should be small (not 1), usually 0.01..0.02 is good value.
max_P is chosen as a number, so that max_P/(th_max-th_min) max_P is chosen as a number, so that max_P/(th_max-th_min)
is a negative power of two in order arithmetics to contain is a negative power of two in order arithmetic to contain
only shifts. only shifts.
@ -159,7 +159,7 @@ static inline u32 red_maxp(u8 Plog)
static inline void red_set_vars(struct red_vars *v) static inline void red_set_vars(struct red_vars *v)
{ {
/* Reset average queue length, the value is strictly bound /* Reset average queue length, the value is strictly bound
* to the parameters below, reseting hurts a bit but leaving * to the parameters below, resetting hurts a bit but leaving
* it might result in an unreasonable qavg for a while. --TGR * it might result in an unreasonable qavg for a while. --TGR
*/ */
v->qavg = 0; v->qavg = 0;
@ -340,7 +340,7 @@ static inline unsigned long red_calc_qavg_no_idle_time(const struct red_parms *p
{ {
/* /*
* NOTE: v->qavg is fixed point number with point at Wlog. * NOTE: v->qavg is fixed point number with point at Wlog.
* The formula below is equvalent to floating point * The formula below is equivalent to floating point
* version: * version:
* *
* qavg = qavg*(1-W) + backlog*W; * qavg = qavg*(1-W) + backlog*W;
@ -375,7 +375,7 @@ static inline int red_mark_probability(const struct red_parms *p,
OK. qR is random number in the interval OK. qR is random number in the interval
(0..1/max_P)*(qth_max-qth_min) (0..1/max_P)*(qth_max-qth_min)
i.e. 0..(2^Plog). If we used floating point i.e. 0..(2^Plog). If we used floating point
arithmetics, it would be: (2^Plog)*rnd_num, arithmetic, it would be: (2^Plog)*rnd_num,
where rnd_num is less 1. where rnd_num is less 1.
Taking into account, that qavg have fixed Taking into account, that qavg have fixed