summaryrefslogtreecommitdiffstats
path: root/src/core/isqrt.c
diff options
context:
space:
mode:
authorMichael Brown2014-04-26 19:19:49 +0200
committerMichael Brown2014-04-26 19:19:49 +0200
commit3ffd309375c8f044939a77eb4738bc0b16c01965 (patch)
tree75447f704d1825f2018b1cf3171ccf299b369ff9 /src/core/isqrt.c
parent[test] Check for correct -mrtd assumption on libgcc arithmetic functions (diff)
downloadipxe-3ffd309375c8f044939a77eb4738bc0b16c01965.tar.gz
ipxe-3ffd309375c8f044939a77eb4738bc0b16c01965.tar.xz
ipxe-3ffd309375c8f044939a77eb4738bc0b16c01965.zip
[libc] Add isqrt() function to find integer square roots
Signed-off-by: Michael Brown <mcb30@ipxe.org>
Diffstat (limited to 'src/core/isqrt.c')
-rw-r--r--src/core/isqrt.c52
1 files changed, 52 insertions, 0 deletions
diff --git a/src/core/isqrt.c b/src/core/isqrt.c
new file mode 100644
index 00000000..35c918d1
--- /dev/null
+++ b/src/core/isqrt.c
@@ -0,0 +1,52 @@
+/*
+ * Copyright (C) 2014 Michael Brown <mbrown@fensystems.co.uk>.
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ * 02110-1301, USA.
+ */
+
+FILE_LICENCE ( GPL2_OR_LATER );
+
+/** @file
+ *
+ * Integer square root
+ *
+ */
+
+#include <ipxe/isqrt.h>
+
+/**
+ * Find integer square root
+ *
+ * @v value Value
+ * @v isqrt Integer square root of value
+ */
+unsigned long isqrt ( unsigned long value ) {
+ unsigned long result = 0;
+ unsigned long bit = ( 1UL << ( ( 8 * sizeof ( bit ) ) - 2 ) );
+
+ while ( bit > value )
+ bit >>= 2;
+ while ( bit ) {
+ if ( value >= ( result + bit ) ) {
+ value -= ( result + bit );
+ result = ( ( result >> 1 ) + bit );
+ } else {
+ result >>= 1;
+ }
+ bit >>= 2;
+ }
+ return result;
+}