d/numam-dpdk
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

sched: get 64-bit greatest common divisor

Browse Source 
This patch adds new function that compute the greatest common
divisor of 64 bits, also changes the original 32 bits function
to call this new 64-bit version.

Cc: stable@dpdk.org

Signed-off-by: Xueming Li <xuemingl@nvidia.com>
Acked-by: Kevin Traynor <ktraynor@redhat.com>
This commit is contained in:
Xueming Li 2021-09-23 16:11:21 +08:00 committed by Thomas Monjalon
parent 175d213bf8
commit eb5636e879
1 changed files with 12 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
lib/sched/rte_sched_common.h
View File

@ -51,10 +51,10 @@ rte_min_pos_4_u16(uint16_t *x)
* gcd(a, b) = gcd(b, a mod b)
*
*/
static inline uint32_t
rte_get_gcd(uint32_t a, uint32_t b)
static inline uint64_t
rte_get_gcd64(uint64_t a, uint64_t b)
{
uint32_t c;
uint64_t c;
if (a == 0)
return b;
@ -76,6 +76,15 @@ rte_get_gcd(uint32_t a, uint32_t b)
return a;
}
/*
* 32-bit version of Greatest Common Divisor (GCD).
*/
static inline uint32_t
rte_get_gcd(uint32_t a, uint32_t b)
{
return rte_get_gcd64(a, b);
}
/*
* Compute the Lowest Common Denominator (LCD) of two numbers.
* This implementation computes GCD first: