Files

72 lines
1.2 KiB
C
Raw Permalink Normal View History

// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (C) 2013 Davidlohr Bueso <davidlohr.bueso@hp.com>
*
* Based on the shift-and-subtract algorithm for computing integer
* square root from Guy L. Steele.
*/
2005-04-16 15:20:36 -07:00
#include <linux/export.h>
#include <linux/bitops.h>
2020-12-15 20:42:48 -08:00
#include <linux/limits.h>
#include <linux/math.h>
2005-04-16 15:20:36 -07:00
/**
2017-11-17 15:28:12 -08:00
* int_sqrt - computes the integer square root
2005-04-16 15:20:36 -07:00
* @x: integer of which to calculate the sqrt
*
2017-11-17 15:28:12 -08:00
* Computes: floor(sqrt(x))
2005-04-16 15:20:36 -07:00
*/
unsigned long int_sqrt(unsigned long x)
{
unsigned long b, m, y = 0;
2005-04-16 15:20:36 -07:00
if (x <= 1)
return x;
2005-04-16 15:20:36 -07:00
m = 1UL << (__fls(x) & ~1UL);
while (m != 0) {
b = y + m;
y >>= 1;
2005-04-16 15:20:36 -07:00
if (x >= b) {
x -= b;
y += m;
2005-04-16 15:20:36 -07:00
}
m >>= 2;
2005-04-16 15:20:36 -07:00
}
return y;
2005-04-16 15:20:36 -07:00
}
EXPORT_SYMBOL(int_sqrt);
2018-01-11 11:19:57 +01:00
#if BITS_PER_LONG < 64
/**
* int_sqrt64 - strongly typed int_sqrt function when minimum 64 bit input
* is expected.
* @x: 64bit integer of which to calculate the sqrt
*/
u32 int_sqrt64(u64 x)
{
u64 b, m, y = 0;
if (x <= ULONG_MAX)
return int_sqrt((unsigned long) x);
2019-01-19 16:14:50 +01:00
m = 1ULL << ((fls64(x) - 1) & ~1ULL);
2018-01-11 11:19:57 +01:00
while (m != 0) {
b = y + m;
y >>= 1;
if (x >= b) {
x -= b;
y += m;
}
m >>= 2;
}
return y;
}
EXPORT_SYMBOL(int_sqrt64);
#endif