aboutsummaryrefslogtreecommitdiff
blob: 6649369b0681d848bbb25818d29f5e02d7cae61c (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/* Round long double value to long int.
   Copyright (C) 1997 Free Software Foundation, Inc.
   This file is part of the GNU C Library.
   Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.

   The GNU C Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public License as
   published by the Free Software Foundation; either version 2 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
   Library General Public License for more details.

   You should have received a copy of the GNU Library General Public
   License along with the GNU C Library; see the file COPYING.LIB.  If not,
   write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  */

#include <math.h>

#include "math_private.h"


#ifdef NO_LONG_DOUBLE
/* The `long double' is in fact the IEEE `double' type.  */

long int
__roundtol (long double x)
{
  int32_t j0;
  u_int32_t i1, i0;
  long int result;

  EXTRACT_WORDS (i0, i1, x);
  j0 = ((i0 >> 20) & 0x7ff) - 0x3ff;
  if (j0 < 20)
    {
      if (j0 < 0)
	result = j0 < -1 ? 0 : ((i0 & 0x80000000) ? -1 : 1);
      else
	{
	  u_int32_t i = 0xfffff >> j0;
	  if (((i0 & i) | i1) == 0)
	    result = (long int) ((i0 & 0xfffff) | 0x100000) >> j0;
	  else
	    {
	      /* X is not integral.  */
	      u_int32_t j = i0 + (0x80000 >> j0);
              if (j < i0)
		result = (long int) 0x80000 >> (20 - j0);
	      else
		result = (j | 0x100000) >> (20 - j0);
	    }
	}
    }
  else if (j0 >= 8 * sizeof (long int) || j0 > 51)
    {
      /* The number is too large.  It is left implementation defined
	 what happens.  */
      result = (long int) x;
    }
  else
    {
      i = ((u_int32_t) (0xffffffff)) >> (j0 - 20);
      if ((i1 & i) != 0)
	{
	  /* x is not integral.  */
	  u_int32_t j = i1 + (0x80000000 >> (j0 - 20));
	  if (j < i1)
	    {
	      j = i0 + 1;
	      if ((j & 0xfffff) == 0)
		{
		  if (sizeof (long int) <= 4)
		    /* Overflow.  */
		    result = (long int) x;
		  else
		    result = 1l << (j0 + 1);
		}
	      else
		result = (long int) ((i0 & 0xfffff) | 0x100000) << (j0 - 31);
	    }
	  else
	    {
	      result = (long int) ((i0 & 0xfffff) | 0x100000) << (j0 - 31);
	      if (sizeof (long int) > 4 && j0 > 31)
		result |= j >> (63 - j0);
	    }
	}
      else
	{
	  result = (long int) ((i0 & 0xfffff) | 0x100000) << (j0 - 31);
	  if (sizeof (long int) > 4 && j0 > 31)
	    result |= j >> (63 - j0);
	}
    }

  return i0 & 0x80000000 ? -result : result;
}
#else
long int
__roundtol (long double x)
{
  int32_t j0;
  u_int32_t se, i1, i0;
  long int result;

  GET_LDOUBLE_WORDS (se, i0, i1, x);
  j0 = (se & 0x7fff) - 0x3fff;
  if (j0 < 31)
    {
      if (j0 < 0)
	result = j0 < -1 ? 0 : 1;
      else
	{
	  u_int32_t i = 0x7fffffff >> j0;
	  if (((i0 & i) | i1) == 0)
	    result = (long int) i0 >> j0;
	  else
	    {
	      /* X is not integral.  */
	      u_int32_t j = i0 + (0x40000000 >> j0);
              if (j < i0)
		result = 0x80000000l >> (30 - j0);
	      else
		result = j >> (31 - j0);
	    }
	}
    }
  else if ((unsigned int) j0 >= 8 * sizeof (long int) || j0 > 62)
    {
      /* The number is too large.  It is left implementation defined
	 what happens.  */
      result = (long int) x;
    }
  else
    {
      u_int32_t i = ((u_int32_t) (0xffffffff)) >> (j0 - 31);
      if ((i1 & i) != 0)
	{
	  /* x is not integral.  */
	  u_int32_t j = i1 + (0x80000000 >> (j0 - 31));
	  if (j < i1)
	    {
	      j = i0 + 1;
	      if (j == 0)
		{
		  if (sizeof (long int) <= 4)
		    /* Overflow.  */
		    result = (long int) x;
		  else
		    result = 1l << (j0 + 1);
		}
	      else
		result = (long int) i0 << (j0 - 31);
	    }
	  else
	    {
	      result = (long int) i0 << (j0 - 31);
	      if (sizeof (long int) > 4 && j0 > 31)
		result |= j >> (63 - j0);
	    }
	}
      else
	{
	  result = (long int) i0 << (j0 - 31);
	  if (sizeof (long int) > 4 && j0 > 31)
	    result |= i1 >> (63 - j0);
	}
    }

  return se & 0x8000 ? -result : result;
}
#endif
weak_alias (__roundtol, roundtol)