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