2
0
mirror of https://github.com/openvswitch/ovs synced 2025-10-29 15:28:56 +00:00

datapath: Remove reciprocal_div compat code.

Signed-off-by: Pravin B Shelar <pshelar@nicira.com>
Acked-by: Jesse Gross <jesse@nicira.com>
This commit is contained in:
Pravin B Shelar
2013-08-30 10:42:53 -07:00
parent d3fe1c2bb3
commit ffe486fcef
3 changed files with 4 additions and 41 deletions

View File

@@ -56,7 +56,6 @@ openvswitch_headers += \
linux/compat/include/linux/poison.h \
linux/compat/include/linux/rculist.h \
linux/compat/include/linux/rcupdate.h \
linux/compat/include/linux/reciprocal_div.h \
linux/compat/include/linux/rtnetlink.h \
linux/compat/include/linux/sctp.h \
linux/compat/include/linux/skbuff.h \

View File

@@ -1,40 +0,0 @@
#ifndef __LINUX_RECIPROCAL_DIV_WRAPPER_H
#define __LINUX_RECIPROCAL_DIV_WRAPPER_H
#include <linux/version.h>
#if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,20)
#include_next <linux/reciprocal_div.h>
#else
#include <linux/types.h>
/*
* This file describes reciprocical division.
*
* This optimizes the (A/B) problem, when A and B are two u32
* and B is a known value (but not known at compile time)
*
* The math principle used is :
* Let RECIPROCAL_VALUE(B) be (((1LL << 32) + (B - 1))/ B)
* Then A / B = (u32)(((u64)(A) * (R)) >> 32)
*
* This replaces a divide by a multiply (and a shift), and
* is generally less expensive in CPU cycles.
*/
/*
* Computes the reciprocal value (R) for the value B of the divisor.
* Should not be called before each reciprocal_divide(),
* or else the performance is slower than a normal divide.
*/
extern u32 reciprocal_value(u32 B);
static inline u32 reciprocal_divide(u32 A, u32 R)
{
return (u32)(((u64)A * R) >> 32);
}
#endif /* Linux kernel < 2.6.20 */
#endif /* __LINUX_RECIPROCAL_DIV_WRAPPER_H */

View File

@@ -1,9 +1,13 @@
#include <asm/div64.h>
#include <linux/reciprocal_div.h>
#include <linux/version.h>
#if LINUX_VERSION_CODE < KERNEL_VERSION(3,3,0)
/* definition is required since reciprocal_value() is not exported */
u32 reciprocal_value(u32 k)
{
u64 val = (1LL << 32) + (k - 1);
do_div(val, k);
return (u32)val;
}
#endif