about summary refs log tree commit diff
path: root/REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c
diff options
context:
space:
mode:
authorZack Weinberg <zackw@panix.com>2017-06-08 15:39:03 -0400
committerZack Weinberg <zackw@panix.com>2017-06-08 15:39:03 -0400
commit5046dbb4a7eba5eccfd258f92f4735c9ffc8d069 (patch)
tree4470480d904b65cf14ca524f96f79eca818c3eaf /REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c
parent199fc19d3aaaf57944ef036e15904febe877fc93 (diff)
downloadglibc-5046dbb4a7eba5eccfd258f92f4735c9ffc8d069.tar.gz
glibc-5046dbb4a7eba5eccfd258f92f4735c9ffc8d069.tar.xz
glibc-5046dbb4a7eba5eccfd258f92f4735c9ffc8d069.zip
Prepare for radical source tree reorganization. zack/build-layout-experiment
All top-level files and directories are moved into a temporary storage
directory, REORG.TODO, except for files that will certainly still
exist in their current form at top level when we're done (COPYING,
COPYING.LIB, LICENSES, NEWS, README), all old ChangeLog files (which
are moved to the new directory OldChangeLogs, instead), and the
generated file INSTALL (which is just deleted; in the new order, there
will be no generated files checked into version control).
Diffstat (limited to 'REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c')
-rw-r--r--REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c124
1 files changed, 124 insertions, 0 deletions
diff --git a/REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c b/REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c
new file mode 100644
index 0000000000..dab6aa6558
--- /dev/null
+++ b/REORG.TODO/sysdeps/ieee754/ldbl-96/s_roundevenl.c
@@ -0,0 +1,124 @@
+/* Round to nearest integer value, rounding halfway cases to even.
+   ldbl-96 version.
+   Copyright (C) 2016-2017 Free Software Foundation, Inc.
+   This file is part of the GNU C Library.
+
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2.1 of the License, or (at your option) any later version.
+
+   The GNU C Library 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
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with the GNU C Library; if not, see
+   <http://www.gnu.org/licenses/>.  */
+
+#include <math.h>
+#include <math_private.h>
+#include <stdint.h>
+
+#define BIAS 0x3fff
+#define MANT_DIG 64
+#define MAX_EXP (2 * BIAS + 1)
+
+long double
+roundevenl (long double x)
+{
+  uint16_t se;
+  uint32_t hx, lx;
+  GET_LDOUBLE_WORDS (se, hx, lx, x);
+  int exponent = se & 0x7fff;
+  if (exponent >= BIAS + MANT_DIG - 1)
+    {
+      /* Integer, infinity or NaN.  */
+      if (exponent == MAX_EXP)
+	/* Infinity or NaN; quiet signaling NaNs.  */
+	return x + x;
+      else
+	return x;
+    }
+  else if (exponent >= BIAS + MANT_DIG - 32)
+    {
+      /* Not necessarily an integer; integer bit is in low word.
+	 Locate the bits with exponents 0 and -1.  */
+      int int_pos = (BIAS + MANT_DIG - 1) - exponent;
+      int half_pos = int_pos - 1;
+      uint32_t half_bit = 1U << half_pos;
+      uint32_t int_bit = 1U << int_pos;
+      if ((lx & (int_bit | (half_bit - 1))) != 0)
+	{
+	  /* No need to test whether HALF_BIT is set.  */
+	  lx += half_bit;
+	  if (lx < half_bit)
+	    {
+	      hx++;
+	      if (hx == 0)
+		{
+		  hx = 0x80000000;
+		  se++;
+		}
+	    }
+	}
+      lx &= ~(int_bit - 1);
+    }
+  else if (exponent == BIAS + MANT_DIG - 33)
+    {
+      /* Not necessarily an integer; integer bit is bottom of high
+	 word, half bit is top of low word.  */
+      if (((hx & 1) | (lx & 0x7fffffff)) != 0)
+	{
+	  lx += 0x80000000;
+	  if (lx < 0x80000000)
+	    {
+	      hx++;
+	      if (hx == 0)
+		{
+		  hx = 0x80000000;
+		  se++;
+		}
+	    }
+	}
+      lx = 0;
+    }
+  else if (exponent >= BIAS)
+    {
+      /* At least 1; not necessarily an integer, integer bit and half
+	 bit are in the high word.  Locate the bits with exponents 0
+	 and -1.  */
+      int int_pos = (BIAS + MANT_DIG - 33) - exponent;
+      int half_pos = int_pos - 1;
+      uint32_t half_bit = 1U << half_pos;
+      uint32_t int_bit = 1U << int_pos;
+      if (((hx & (int_bit | (half_bit - 1))) | lx) != 0)
+	{
+	  hx += half_bit;
+	  if (hx < half_bit)
+	    {
+	      hx = 0x80000000;
+	      se++;
+	    }
+	}
+      hx &= ~(int_bit - 1);
+      lx = 0;
+    }
+  else if (exponent == BIAS - 1 && (hx > 0x80000000 || lx != 0))
+    {
+      /* Interval (0.5, 1).  */
+      se = (se & 0x8000) | 0x3fff;
+      hx = 0x80000000;
+      lx = 0;
+    }
+  else
+    {
+      /* Rounds to 0.  */
+      se &= 0x8000;
+      hx = 0;
+      lx = 0;
+    }
+  SET_LDOUBLE_WORDS (x, se, hx, lx);
+  return x;
+}