Cregit: Linux 6.8: int

Contributors: 11
Author	Tokens	Token Proportion	Commits	Commit Proportion
Davidlohr Bueso A	65	31.10%	1	7.14%
Andrew Morton	64	30.62%	1	7.14%
Crt Mori	43	20.57%	1	7.14%
Peter Zijlstra	20	9.57%	3	21.43%
Florian La Roche	4	1.91%	1	7.14%
Linus Torvalds (pre-git)	4	1.91%	2	14.29%
Andy Shevchenko	3	1.44%	1	7.14%
Peter Williams	2	0.96%	1	7.14%
James Simmons	2	0.96%	1	7.14%
Masahiro Yamada	1	0.48%	1	7.14%
Greg Kroah-Hartman	1	0.48%	1	7.14%
Total	209		14

// 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.
 */

#include <linux/export.h>
#include <linux/bitops.h>
#include <linux/limits.h>
#include <linux/math.h>

/**
 * int_sqrt - computes the integer square root
 * @x: integer of which to calculate the sqrt
 *
 * Computes: floor(sqrt(x))
 */
unsigned long int_sqrt(unsigned long x)
{
	unsigned long b, m, y = 0;

	if (x <= 1)
		return x;

	m = 1UL << (__fls(x) & ~1UL);
	while (m != 0) {
		b = y + m;
		y >>= 1;

		if (x >= b) {
			x -= b;
			y += m;
		}
		m >>= 2;
	}

	return y;
}
EXPORT_SYMBOL(int_sqrt);

#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);

	m = 1ULL << ((fls64(x) - 1) & ~1ULL);
	while (m != 0) {
		b = y + m;
		y >>= 1;

		if (x >= b) {
			x -= b;
			y += m;
		}
		m >>= 2;
	}

	return y;
}
EXPORT_SYMBOL(int_sqrt64);
#endif

int_sqrt.c