s/recalcultion/recalculation/
Signed-off-by: Bhaskar Chowdhury <[email protected]>
---
include/net/red.h | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/include/net/red.h b/include/net/red.h
index 932f0d79d60c..6b418b69dc48 100644
--- a/include/net/red.h
+++ b/include/net/red.h
@@ -287,7 +287,7 @@ static inline unsigned long red_calc_qavg_from_idle_time(const struct red_parms
int shift;
/*
- * The problem: ideally, average length queue recalcultion should
+ * The problem: ideally, average length queue recalculation should
* be done over constant clock intervals. This is too expensive, so
* that the calculation is driven by outgoing packets.
* When the queue is idle we have to model this clock by hand.
--
2.26.2
On Fri, 19 Mar 2021, Bhaskar Chowdhury wrote:
>
> s/recalcultion/recalculation/
>
> Signed-off-by: Bhaskar Chowdhury <[email protected]>
Acked-by: Randy Dunlap <[email protected]>
> ---
> include/net/red.h | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/include/net/red.h b/include/net/red.h
> index 932f0d79d60c..6b418b69dc48 100644
> --- a/include/net/red.h
> +++ b/include/net/red.h
> @@ -287,7 +287,7 @@ static inline unsigned long red_calc_qavg_from_idle_time(const struct red_parms
> int shift;
>
> /*
> - * The problem: ideally, average length queue recalcultion should
> + * The problem: ideally, average length queue recalculation should
> * be done over constant clock intervals. This is too expensive, so
> * that the calculation is driven by outgoing packets.
> * When the queue is idle we have to model this clock by hand.
> --
> 2.26.2
>
>