From 2dbe738c693fd913ed5c02ba2a5c7a3094f0beee Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ilpo=20J=C3=A4rvinen?= Date: Fri, 4 Aug 2006 16:36:18 -0700 Subject: [PATCH] --- yaml --- r: 33217 b: refs/heads/master c: c4c0ce5c57ef0ca47a4428a14de6b5c8cdf8de8a h: refs/heads/master i: 33215: d8ddba9662e6bf823e752339b74964edd92c5668 v: v3 --- [refs] | 2 +- trunk/include/net/red.h | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/[refs] b/[refs] index 3c6e85a5eac4..6298e2e2bd93 100644 --- a/[refs] +++ b/[refs] @@ -1,2 +1,2 @@ --- -refs/heads/master: 30a584d944fbd599d4a8f470f75bf7af1a15b466 +refs/heads/master: c4c0ce5c57ef0ca47a4428a14de6b5c8cdf8de8a diff --git a/trunk/include/net/red.h b/trunk/include/net/red.h index 5ccdbb3d4722..a4eb37946f2c 100644 --- a/trunk/include/net/red.h +++ b/trunk/include/net/red.h @@ -212,7 +212,7 @@ static inline unsigned long red_calc_qavg_from_idle_time(struct red_parms *p) * Seems, it is the best solution to * problem of too coarse exponent tabulation. */ - us_idle = (p->qavg * us_idle) >> p->Scell_log; + us_idle = (p->qavg * (u64)us_idle) >> p->Scell_log; if (us_idle < (p->qavg >> 1)) return p->qavg - us_idle;