X-Git-Url: http://git.onelab.eu/?a=blobdiff_plain;ds=sidebyside;f=include%2Fnet%2Fred.h;fp=include%2Fnet%2Fred.h;h=2ed4358e3295c2f03595efd9bc9a91c86fa2b496;hb=64ba3f394c830ec48a1c31b53dcae312c56f1604;hp=a4eb37946f2cdf1c63f22cc19341a88e6bd76cca;hpb=be1e6109ac94a859551f8e1774eb9a8469fe055c;p=linux-2.6.git

diff --git a/include/net/red.h b/include/net/red.h
index a4eb37946..2ed4358e3 100644
--- a/include/net/red.h
+++ b/include/net/red.h
@@ -1,6 +1,7 @@
 #ifndef __NET_SCHED_RED_H
 #define __NET_SCHED_RED_H
 
+#include <linux/config.h>
 #include <linux/types.h>
 #include <net/pkt_sched.h>
 #include <net/inet_ecn.h>
@@ -212,7 +213,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 * (u64)us_idle) >> p->Scell_log;
+		us_idle = (p->qavg * us_idle) >> p->Scell_log;
 
 		if (us_idle < (p->qavg >> 1))
 			return p->qavg - us_idle;