Messages in this thread | | | Date | Tue, 06 Mar 2007 20:20:52 -0800 (PST) | Subject | Re: [PATCH] tcp_cubic: faster cube root | From | David Miller <> |
| |
From: Stephen Hemminger <shemminger@linux-foundation.org> Date: Tue, 6 Mar 2007 14:47:06 -0800
> The Newton-Raphson method is quadratically convergent so > only a small fixed number of steps are necessary. > Therefore it is faster to unroll the loop. Since div64_64 is no longer > inline it won't cause code explosion. > > Also fixes a bug that can occur if x^2 was bigger than 32 bits. > > Signed-off-by: Stephen Hemminger <shemminger@linux-foundation.org>
Applied, thanks Stephen. - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |