/* More subroutines needed by GCC output code on some machines. */
|
/* More subroutines needed by GCC output code on some machines. */
|
/* Compile this one with gcc. */
|
/* Compile this one with gcc. */
|
/* Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
/* Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
|
2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
|
2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
GCC 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
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 2, or (at your option) any later
|
Software Foundation; either version 2, or (at your option) any later
|
version.
|
version.
|
|
|
In addition to the permissions in the GNU General Public License, the
|
In addition to the permissions in the GNU General Public License, the
|
Free Software Foundation gives you unlimited permission to link the
|
Free Software Foundation gives you unlimited permission to link the
|
compiled version of this file into combinations with other programs,
|
compiled version of this file into combinations with other programs,
|
and to distribute those combinations without any restriction coming
|
and to distribute those combinations without any restriction coming
|
from the use of this file. (The General Public License restrictions
|
from the use of this file. (The General Public License restrictions
|
do apply in other respects; for example, they cover modification of
|
do apply in other respects; for example, they cover modification of
|
the file, and distribution when not linked into a combine
|
the file, and distribution when not linked into a combine
|
executable.)
|
executable.)
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING. If not, write to the Free
|
along with GCC; see the file COPYING. If not, write to the Free
|
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
|
Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
|
02110-1301, USA. */
|
02110-1301, USA. */
|
|
|
#include "tconfig.h"
|
#include "tconfig.h"
|
#include "tsystem.h"
|
#include "tsystem.h"
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
|
|
#ifdef HAVE_GAS_HIDDEN
|
#ifdef HAVE_GAS_HIDDEN
|
#define ATTRIBUTE_HIDDEN __attribute__ ((__visibility__ ("hidden")))
|
#define ATTRIBUTE_HIDDEN __attribute__ ((__visibility__ ("hidden")))
|
#else
|
#else
|
#define ATTRIBUTE_HIDDEN
|
#define ATTRIBUTE_HIDDEN
|
#endif
|
#endif
|
|
|
#ifndef MIN_UNITS_PER_WORD
|
#ifndef MIN_UNITS_PER_WORD
|
#define MIN_UNITS_PER_WORD UNITS_PER_WORD
|
#define MIN_UNITS_PER_WORD UNITS_PER_WORD
|
#endif
|
#endif
|
|
|
/* Work out the largest "word" size that we can deal with on this target. */
|
/* Work out the largest "word" size that we can deal with on this target. */
|
#if MIN_UNITS_PER_WORD > 4
|
#if MIN_UNITS_PER_WORD > 4
|
# define LIBGCC2_MAX_UNITS_PER_WORD 8
|
# define LIBGCC2_MAX_UNITS_PER_WORD 8
|
#elif (MIN_UNITS_PER_WORD > 2 \
|
#elif (MIN_UNITS_PER_WORD > 2 \
|
|| (MIN_UNITS_PER_WORD > 1 && LONG_LONG_TYPE_SIZE > 32))
|
|| (MIN_UNITS_PER_WORD > 1 && LONG_LONG_TYPE_SIZE > 32))
|
# define LIBGCC2_MAX_UNITS_PER_WORD 4
|
# define LIBGCC2_MAX_UNITS_PER_WORD 4
|
#else
|
#else
|
# define LIBGCC2_MAX_UNITS_PER_WORD MIN_UNITS_PER_WORD
|
# define LIBGCC2_MAX_UNITS_PER_WORD MIN_UNITS_PER_WORD
|
#endif
|
#endif
|
|
|
/* Work out what word size we are using for this compilation.
|
/* Work out what word size we are using for this compilation.
|
The value can be set on the command line. */
|
The value can be set on the command line. */
|
#ifndef LIBGCC2_UNITS_PER_WORD
|
#ifndef LIBGCC2_UNITS_PER_WORD
|
#define LIBGCC2_UNITS_PER_WORD LIBGCC2_MAX_UNITS_PER_WORD
|
#define LIBGCC2_UNITS_PER_WORD LIBGCC2_MAX_UNITS_PER_WORD
|
#endif
|
#endif
|
|
|
#if LIBGCC2_UNITS_PER_WORD <= LIBGCC2_MAX_UNITS_PER_WORD
|
#if LIBGCC2_UNITS_PER_WORD <= LIBGCC2_MAX_UNITS_PER_WORD
|
|
|
#include "libgcc2.h"
|
#include "libgcc2.h"
|
|
|
#ifdef DECLARE_LIBRARY_RENAMES
|
#ifdef DECLARE_LIBRARY_RENAMES
|
DECLARE_LIBRARY_RENAMES
|
DECLARE_LIBRARY_RENAMES
|
#endif
|
#endif
|
|
|
#if defined (L_negdi2)
|
#if defined (L_negdi2)
|
DWtype
|
DWtype
|
__negdi2 (DWtype u)
|
__negdi2 (DWtype u)
|
{
|
{
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const DWunion w = { {.low = -uu.s.low,
|
const DWunion w = { {.low = -uu.s.low,
|
.high = -uu.s.high - ((UWtype) -uu.s.low > 0) } };
|
.high = -uu.s.high - ((UWtype) -uu.s.low > 0) } };
|
|
|
return w.ll;
|
return w.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_addvsi3
|
#ifdef L_addvsi3
|
Wtype
|
Wtype
|
__addvSI3 (Wtype a, Wtype b)
|
__addvSI3 (Wtype a, Wtype b)
|
{
|
{
|
const Wtype w = a + b;
|
const Wtype w = a + b;
|
|
|
if (b >= 0 ? w < a : w > a)
|
if (b >= 0 ? w < a : w > a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
SItype
|
SItype
|
__addvsi3 (SItype a, SItype b)
|
__addvsi3 (SItype a, SItype b)
|
{
|
{
|
const SItype w = a + b;
|
const SItype w = a + b;
|
|
|
if (b >= 0 ? w < a : w > a)
|
if (b >= 0 ? w < a : w > a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif
|
#endif
|
|
|
#ifdef L_addvdi3
|
#ifdef L_addvdi3
|
DWtype
|
DWtype
|
__addvDI3 (DWtype a, DWtype b)
|
__addvDI3 (DWtype a, DWtype b)
|
{
|
{
|
const DWtype w = a + b;
|
const DWtype w = a + b;
|
|
|
if (b >= 0 ? w < a : w > a)
|
if (b >= 0 ? w < a : w > a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_subvsi3
|
#ifdef L_subvsi3
|
Wtype
|
Wtype
|
__subvSI3 (Wtype a, Wtype b)
|
__subvSI3 (Wtype a, Wtype b)
|
{
|
{
|
const Wtype w = a - b;
|
const Wtype w = a - b;
|
|
|
if (b >= 0 ? w > a : w < a)
|
if (b >= 0 ? w > a : w < a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
SItype
|
SItype
|
__subvsi3 (SItype a, SItype b)
|
__subvsi3 (SItype a, SItype b)
|
{
|
{
|
const SItype w = a - b;
|
const SItype w = a - b;
|
|
|
if (b >= 0 ? w > a : w < a)
|
if (b >= 0 ? w > a : w < a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif
|
#endif
|
|
|
#ifdef L_subvdi3
|
#ifdef L_subvdi3
|
DWtype
|
DWtype
|
__subvDI3 (DWtype a, DWtype b)
|
__subvDI3 (DWtype a, DWtype b)
|
{
|
{
|
const DWtype w = a - b;
|
const DWtype w = a - b;
|
|
|
if (b >= 0 ? w > a : w < a)
|
if (b >= 0 ? w > a : w < a)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_mulvsi3
|
#ifdef L_mulvsi3
|
Wtype
|
Wtype
|
__mulvSI3 (Wtype a, Wtype b)
|
__mulvSI3 (Wtype a, Wtype b)
|
{
|
{
|
const DWtype w = (DWtype) a * (DWtype) b;
|
const DWtype w = (DWtype) a * (DWtype) b;
|
|
|
if ((Wtype) (w >> W_TYPE_SIZE) != (Wtype) w >> (W_TYPE_SIZE - 1))
|
if ((Wtype) (w >> W_TYPE_SIZE) != (Wtype) w >> (W_TYPE_SIZE - 1))
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#undef WORD_SIZE
|
#undef WORD_SIZE
|
#define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
|
#define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
|
SItype
|
SItype
|
__mulvsi3 (SItype a, SItype b)
|
__mulvsi3 (SItype a, SItype b)
|
{
|
{
|
const DItype w = (DItype) a * (DItype) b;
|
const DItype w = (DItype) a * (DItype) b;
|
|
|
if ((SItype) (w >> WORD_SIZE) != (SItype) w >> (WORD_SIZE-1))
|
if ((SItype) (w >> WORD_SIZE) != (SItype) w >> (WORD_SIZE-1))
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif
|
#endif
|
|
|
#ifdef L_negvsi2
|
#ifdef L_negvsi2
|
Wtype
|
Wtype
|
__negvSI2 (Wtype a)
|
__negvSI2 (Wtype a)
|
{
|
{
|
const Wtype w = -a;
|
const Wtype w = -a;
|
|
|
if (a >= 0 ? w > 0 : w < 0)
|
if (a >= 0 ? w > 0 : w < 0)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
SItype
|
SItype
|
__negvsi2 (SItype a)
|
__negvsi2 (SItype a)
|
{
|
{
|
const SItype w = -a;
|
const SItype w = -a;
|
|
|
if (a >= 0 ? w > 0 : w < 0)
|
if (a >= 0 ? w > 0 : w < 0)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif
|
#endif
|
|
|
#ifdef L_negvdi2
|
#ifdef L_negvdi2
|
DWtype
|
DWtype
|
__negvDI2 (DWtype a)
|
__negvDI2 (DWtype a)
|
{
|
{
|
const DWtype w = -a;
|
const DWtype w = -a;
|
|
|
if (a >= 0 ? w > 0 : w < 0)
|
if (a >= 0 ? w > 0 : w < 0)
|
abort ();
|
abort ();
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_absvsi2
|
#ifdef L_absvsi2
|
Wtype
|
Wtype
|
__absvSI2 (Wtype a)
|
__absvSI2 (Wtype a)
|
{
|
{
|
Wtype w = a;
|
Wtype w = a;
|
|
|
if (a < 0)
|
if (a < 0)
|
#ifdef L_negvsi2
|
#ifdef L_negvsi2
|
w = __negvSI2 (a);
|
w = __negvSI2 (a);
|
#else
|
#else
|
w = -a;
|
w = -a;
|
|
|
if (w < 0)
|
if (w < 0)
|
abort ();
|
abort ();
|
#endif
|
#endif
|
|
|
return w;
|
return w;
|
}
|
}
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
#ifdef COMPAT_SIMODE_TRAPPING_ARITHMETIC
|
SItype
|
SItype
|
__absvsi2 (SItype a)
|
__absvsi2 (SItype a)
|
{
|
{
|
SItype w = a;
|
SItype w = a;
|
|
|
if (a < 0)
|
if (a < 0)
|
#ifdef L_negvsi2
|
#ifdef L_negvsi2
|
w = __negvsi2 (a);
|
w = __negvsi2 (a);
|
#else
|
#else
|
w = -a;
|
w = -a;
|
|
|
if (w < 0)
|
if (w < 0)
|
abort ();
|
abort ();
|
#endif
|
#endif
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif /* COMPAT_SIMODE_TRAPPING_ARITHMETIC */
|
#endif
|
#endif
|
|
|
#ifdef L_absvdi2
|
#ifdef L_absvdi2
|
DWtype
|
DWtype
|
__absvDI2 (DWtype a)
|
__absvDI2 (DWtype a)
|
{
|
{
|
DWtype w = a;
|
DWtype w = a;
|
|
|
if (a < 0)
|
if (a < 0)
|
#ifdef L_negvdi2
|
#ifdef L_negvdi2
|
w = __negvDI2 (a);
|
w = __negvDI2 (a);
|
#else
|
#else
|
w = -a;
|
w = -a;
|
|
|
if (w < 0)
|
if (w < 0)
|
abort ();
|
abort ();
|
#endif
|
#endif
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_mulvdi3
|
#ifdef L_mulvdi3
|
DWtype
|
DWtype
|
__mulvDI3 (DWtype u, DWtype v)
|
__mulvDI3 (DWtype u, DWtype v)
|
{
|
{
|
/* The unchecked multiplication needs 3 Wtype x Wtype multiplications,
|
/* The unchecked multiplication needs 3 Wtype x Wtype multiplications,
|
but the checked multiplication needs only two. */
|
but the checked multiplication needs only two. */
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const DWunion vv = {.ll = v};
|
const DWunion vv = {.ll = v};
|
|
|
if (__builtin_expect (uu.s.high == uu.s.low >> (W_TYPE_SIZE - 1), 1))
|
if (__builtin_expect (uu.s.high == uu.s.low >> (W_TYPE_SIZE - 1), 1))
|
{
|
{
|
/* u fits in a single Wtype. */
|
/* u fits in a single Wtype. */
|
if (__builtin_expect (vv.s.high == vv.s.low >> (W_TYPE_SIZE - 1), 1))
|
if (__builtin_expect (vv.s.high == vv.s.low >> (W_TYPE_SIZE - 1), 1))
|
{
|
{
|
/* v fits in a single Wtype as well. */
|
/* v fits in a single Wtype as well. */
|
/* A single multiplication. No overflow risk. */
|
/* A single multiplication. No overflow risk. */
|
return (DWtype) uu.s.low * (DWtype) vv.s.low;
|
return (DWtype) uu.s.low * (DWtype) vv.s.low;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Two multiplications. */
|
/* Two multiplications. */
|
DWunion w0 = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion w0 = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
DWunion w1 = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion w1 = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.high};
|
* (UDWtype) (UWtype) vv.s.high};
|
|
|
if (vv.s.high < 0)
|
if (vv.s.high < 0)
|
w1.s.high -= uu.s.low;
|
w1.s.high -= uu.s.low;
|
if (uu.s.low < 0)
|
if (uu.s.low < 0)
|
w1.ll -= vv.ll;
|
w1.ll -= vv.ll;
|
w1.ll += (UWtype) w0.s.high;
|
w1.ll += (UWtype) w0.s.high;
|
if (__builtin_expect (w1.s.high == w1.s.low >> (W_TYPE_SIZE - 1), 1))
|
if (__builtin_expect (w1.s.high == w1.s.low >> (W_TYPE_SIZE - 1), 1))
|
{
|
{
|
w0.s.high = w1.s.low;
|
w0.s.high = w1.s.low;
|
return w0.ll;
|
return w0.ll;
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
if (__builtin_expect (vv.s.high == vv.s.low >> (W_TYPE_SIZE - 1), 1))
|
if (__builtin_expect (vv.s.high == vv.s.low >> (W_TYPE_SIZE - 1), 1))
|
{
|
{
|
/* v fits into a single Wtype. */
|
/* v fits into a single Wtype. */
|
/* Two multiplications. */
|
/* Two multiplications. */
|
DWunion w0 = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion w0 = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
DWunion w1 = {.ll = (UDWtype) (UWtype) uu.s.high
|
DWunion w1 = {.ll = (UDWtype) (UWtype) uu.s.high
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
|
|
if (uu.s.high < 0)
|
if (uu.s.high < 0)
|
w1.s.high -= vv.s.low;
|
w1.s.high -= vv.s.low;
|
if (vv.s.low < 0)
|
if (vv.s.low < 0)
|
w1.ll -= uu.ll;
|
w1.ll -= uu.ll;
|
w1.ll += (UWtype) w0.s.high;
|
w1.ll += (UWtype) w0.s.high;
|
if (__builtin_expect (w1.s.high == w1.s.low >> (W_TYPE_SIZE - 1), 1))
|
if (__builtin_expect (w1.s.high == w1.s.low >> (W_TYPE_SIZE - 1), 1))
|
{
|
{
|
w0.s.high = w1.s.low;
|
w0.s.high = w1.s.low;
|
return w0.ll;
|
return w0.ll;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
/* A few sign checks and a single multiplication. */
|
/* A few sign checks and a single multiplication. */
|
if (uu.s.high >= 0)
|
if (uu.s.high >= 0)
|
{
|
{
|
if (vv.s.high >= 0)
|
if (vv.s.high >= 0)
|
{
|
{
|
if (uu.s.high == 0 && vv.s.high == 0)
|
if (uu.s.high == 0 && vv.s.high == 0)
|
{
|
{
|
const DWtype w = (UDWtype) (UWtype) uu.s.low
|
const DWtype w = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low;
|
* (UDWtype) (UWtype) vv.s.low;
|
if (__builtin_expect (w >= 0, 1))
|
if (__builtin_expect (w >= 0, 1))
|
return w;
|
return w;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
if (uu.s.high == 0 && vv.s.high == (Wtype) -1)
|
if (uu.s.high == 0 && vv.s.high == (Wtype) -1)
|
{
|
{
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
|
|
ww.s.high -= uu.s.low;
|
ww.s.high -= uu.s.low;
|
if (__builtin_expect (ww.s.high < 0, 1))
|
if (__builtin_expect (ww.s.high < 0, 1))
|
return ww.ll;
|
return ww.ll;
|
}
|
}
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
if (vv.s.high >= 0)
|
if (vv.s.high >= 0)
|
{
|
{
|
if (uu.s.high == (Wtype) -1 && vv.s.high == 0)
|
if (uu.s.high == (Wtype) -1 && vv.s.high == 0)
|
{
|
{
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
|
|
ww.s.high -= vv.s.low;
|
ww.s.high -= vv.s.low;
|
if (__builtin_expect (ww.s.high < 0, 1))
|
if (__builtin_expect (ww.s.high < 0, 1))
|
return ww.ll;
|
return ww.ll;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
if (uu.s.high == (Wtype) -1 && vv.s.high == (Wtype) - 1)
|
if (uu.s.high == (Wtype) -1 && vv.s.high == (Wtype) - 1)
|
{
|
{
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
DWunion ww = {.ll = (UDWtype) (UWtype) uu.s.low
|
* (UDWtype) (UWtype) vv.s.low};
|
* (UDWtype) (UWtype) vv.s.low};
|
|
|
ww.s.high -= uu.s.low;
|
ww.s.high -= uu.s.low;
|
ww.s.high -= vv.s.low;
|
ww.s.high -= vv.s.low;
|
if (__builtin_expect (ww.s.high >= 0, 1))
|
if (__builtin_expect (ww.s.high >= 0, 1))
|
return ww.ll;
|
return ww.ll;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
/* Overflow. */
|
/* Overflow. */
|
abort ();
|
abort ();
|
}
|
}
|
#endif
|
#endif
|
|
|
|
|
/* Unless shift functions are defined with full ANSI prototypes,
|
/* Unless shift functions are defined with full ANSI prototypes,
|
parameter b will be promoted to int if word_type is smaller than an int. */
|
parameter b will be promoted to int if word_type is smaller than an int. */
|
#ifdef L_lshrdi3
|
#ifdef L_lshrdi3
|
DWtype
|
DWtype
|
__lshrdi3 (DWtype u, word_type b)
|
__lshrdi3 (DWtype u, word_type b)
|
{
|
{
|
if (b == 0)
|
if (b == 0)
|
return u;
|
return u;
|
|
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
DWunion w;
|
DWunion w;
|
|
|
if (bm <= 0)
|
if (bm <= 0)
|
{
|
{
|
w.s.high = 0;
|
w.s.high = 0;
|
w.s.low = (UWtype) uu.s.high >> -bm;
|
w.s.low = (UWtype) uu.s.high >> -bm;
|
}
|
}
|
else
|
else
|
{
|
{
|
const UWtype carries = (UWtype) uu.s.high << bm;
|
const UWtype carries = (UWtype) uu.s.high << bm;
|
|
|
w.s.high = (UWtype) uu.s.high >> b;
|
w.s.high = (UWtype) uu.s.high >> b;
|
w.s.low = ((UWtype) uu.s.low >> b) | carries;
|
w.s.low = ((UWtype) uu.s.low >> b) | carries;
|
}
|
}
|
|
|
return w.ll;
|
return w.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ashldi3
|
#ifdef L_ashldi3
|
DWtype
|
DWtype
|
__ashldi3 (DWtype u, word_type b)
|
__ashldi3 (DWtype u, word_type b)
|
{
|
{
|
if (b == 0)
|
if (b == 0)
|
return u;
|
return u;
|
|
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
DWunion w;
|
DWunion w;
|
|
|
if (bm <= 0)
|
if (bm <= 0)
|
{
|
{
|
w.s.low = 0;
|
w.s.low = 0;
|
w.s.high = (UWtype) uu.s.low << -bm;
|
w.s.high = (UWtype) uu.s.low << -bm;
|
}
|
}
|
else
|
else
|
{
|
{
|
const UWtype carries = (UWtype) uu.s.low >> bm;
|
const UWtype carries = (UWtype) uu.s.low >> bm;
|
|
|
w.s.low = (UWtype) uu.s.low << b;
|
w.s.low = (UWtype) uu.s.low << b;
|
w.s.high = ((UWtype) uu.s.high << b) | carries;
|
w.s.high = ((UWtype) uu.s.high << b) | carries;
|
}
|
}
|
|
|
return w.ll;
|
return w.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ashrdi3
|
#ifdef L_ashrdi3
|
DWtype
|
DWtype
|
__ashrdi3 (DWtype u, word_type b)
|
__ashrdi3 (DWtype u, word_type b)
|
{
|
{
|
if (b == 0)
|
if (b == 0)
|
return u;
|
return u;
|
|
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
const word_type bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
|
DWunion w;
|
DWunion w;
|
|
|
if (bm <= 0)
|
if (bm <= 0)
|
{
|
{
|
/* w.s.high = 1..1 or 0..0 */
|
/* w.s.high = 1..1 or 0..0 */
|
w.s.high = uu.s.high >> (sizeof (Wtype) * BITS_PER_UNIT - 1);
|
w.s.high = uu.s.high >> (sizeof (Wtype) * BITS_PER_UNIT - 1);
|
w.s.low = uu.s.high >> -bm;
|
w.s.low = uu.s.high >> -bm;
|
}
|
}
|
else
|
else
|
{
|
{
|
const UWtype carries = (UWtype) uu.s.high << bm;
|
const UWtype carries = (UWtype) uu.s.high << bm;
|
|
|
w.s.high = uu.s.high >> b;
|
w.s.high = uu.s.high >> b;
|
w.s.low = ((UWtype) uu.s.low >> b) | carries;
|
w.s.low = ((UWtype) uu.s.low >> b) | carries;
|
}
|
}
|
|
|
return w.ll;
|
return w.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ffssi2
|
#ifdef L_ffssi2
|
#undef int
|
#undef int
|
int
|
int
|
__ffsSI2 (UWtype u)
|
__ffsSI2 (UWtype u)
|
{
|
{
|
UWtype count;
|
UWtype count;
|
|
|
if (u == 0)
|
if (u == 0)
|
return 0;
|
return 0;
|
|
|
count_trailing_zeros (count, u);
|
count_trailing_zeros (count, u);
|
return count + 1;
|
return count + 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ffsdi2
|
#ifdef L_ffsdi2
|
#undef int
|
#undef int
|
int
|
int
|
__ffsDI2 (DWtype u)
|
__ffsDI2 (DWtype u)
|
{
|
{
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
UWtype word, count, add;
|
UWtype word, count, add;
|
|
|
if (uu.s.low != 0)
|
if (uu.s.low != 0)
|
word = uu.s.low, add = 0;
|
word = uu.s.low, add = 0;
|
else if (uu.s.high != 0)
|
else if (uu.s.high != 0)
|
word = uu.s.high, add = BITS_PER_UNIT * sizeof (Wtype);
|
word = uu.s.high, add = BITS_PER_UNIT * sizeof (Wtype);
|
else
|
else
|
return 0;
|
return 0;
|
|
|
count_trailing_zeros (count, word);
|
count_trailing_zeros (count, word);
|
return count + add + 1;
|
return count + add + 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_muldi3
|
#ifdef L_muldi3
|
DWtype
|
DWtype
|
__muldi3 (DWtype u, DWtype v)
|
__muldi3 (DWtype u, DWtype v)
|
{
|
{
|
const DWunion uu = {.ll = u};
|
const DWunion uu = {.ll = u};
|
const DWunion vv = {.ll = v};
|
const DWunion vv = {.ll = v};
|
DWunion w = {.ll = __umulsidi3 (uu.s.low, vv.s.low)};
|
DWunion w = {.ll = __umulsidi3 (uu.s.low, vv.s.low)};
|
|
|
w.s.high += ((UWtype) uu.s.low * (UWtype) vv.s.high
|
w.s.high += ((UWtype) uu.s.low * (UWtype) vv.s.high
|
+ (UWtype) uu.s.high * (UWtype) vv.s.low);
|
+ (UWtype) uu.s.high * (UWtype) vv.s.low);
|
|
|
return w.ll;
|
return w.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
defined (L_umoddi3) || defined (L_moddi3))
|
defined (L_umoddi3) || defined (L_moddi3))
|
#if defined (sdiv_qrnnd)
|
#if defined (sdiv_qrnnd)
|
#define L_udiv_w_sdiv
|
#define L_udiv_w_sdiv
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#ifdef L_udiv_w_sdiv
|
#ifdef L_udiv_w_sdiv
|
#if defined (sdiv_qrnnd)
|
#if defined (sdiv_qrnnd)
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
defined (L_umoddi3) || defined (L_moddi3))
|
defined (L_umoddi3) || defined (L_moddi3))
|
static inline __attribute__ ((__always_inline__))
|
static inline __attribute__ ((__always_inline__))
|
#endif
|
#endif
|
UWtype
|
UWtype
|
__udiv_w_sdiv (UWtype *rp, UWtype a1, UWtype a0, UWtype d)
|
__udiv_w_sdiv (UWtype *rp, UWtype a1, UWtype a0, UWtype d)
|
{
|
{
|
UWtype q, r;
|
UWtype q, r;
|
UWtype c0, c1, b1;
|
UWtype c0, c1, b1;
|
|
|
if ((Wtype) d >= 0)
|
if ((Wtype) d >= 0)
|
{
|
{
|
if (a1 < d - a1 - (a0 >> (W_TYPE_SIZE - 1)))
|
if (a1 < d - a1 - (a0 >> (W_TYPE_SIZE - 1)))
|
{
|
{
|
/* Dividend, divisor, and quotient are nonnegative. */
|
/* Dividend, divisor, and quotient are nonnegative. */
|
sdiv_qrnnd (q, r, a1, a0, d);
|
sdiv_qrnnd (q, r, a1, a0, d);
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d. */
|
/* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d. */
|
sub_ddmmss (c1, c0, a1, a0, d >> 1, d << (W_TYPE_SIZE - 1));
|
sub_ddmmss (c1, c0, a1, a0, d >> 1, d << (W_TYPE_SIZE - 1));
|
/* Divide (c1*2^32 + c0) by d. */
|
/* Divide (c1*2^32 + c0) by d. */
|
sdiv_qrnnd (q, r, c1, c0, d);
|
sdiv_qrnnd (q, r, c1, c0, d);
|
/* Add 2^31 to quotient. */
|
/* Add 2^31 to quotient. */
|
q += (UWtype) 1 << (W_TYPE_SIZE - 1);
|
q += (UWtype) 1 << (W_TYPE_SIZE - 1);
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
b1 = d >> 1; /* d/2, between 2^30 and 2^31 - 1 */
|
b1 = d >> 1; /* d/2, between 2^30 and 2^31 - 1 */
|
c1 = a1 >> 1; /* A/2 */
|
c1 = a1 >> 1; /* A/2 */
|
c0 = (a1 << (W_TYPE_SIZE - 1)) + (a0 >> 1);
|
c0 = (a1 << (W_TYPE_SIZE - 1)) + (a0 >> 1);
|
|
|
if (a1 < b1) /* A < 2^32*b1, so A/2 < 2^31*b1 */
|
if (a1 < b1) /* A < 2^32*b1, so A/2 < 2^31*b1 */
|
{
|
{
|
sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
|
sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
|
|
|
r = 2*r + (a0 & 1); /* Remainder from A/(2*b1) */
|
r = 2*r + (a0 & 1); /* Remainder from A/(2*b1) */
|
if ((d & 1) != 0)
|
if ((d & 1) != 0)
|
{
|
{
|
if (r >= q)
|
if (r >= q)
|
r = r - q;
|
r = r - q;
|
else if (q - r <= d)
|
else if (q - r <= d)
|
{
|
{
|
r = r - q + d;
|
r = r - q + d;
|
q--;
|
q--;
|
}
|
}
|
else
|
else
|
{
|
{
|
r = r - q + 2*d;
|
r = r - q + 2*d;
|
q -= 2;
|
q -= 2;
|
}
|
}
|
}
|
}
|
}
|
}
|
else if (c1 < b1) /* So 2^31 <= (A/2)/b1 < 2^32 */
|
else if (c1 < b1) /* So 2^31 <= (A/2)/b1 < 2^32 */
|
{
|
{
|
c1 = (b1 - 1) - c1;
|
c1 = (b1 - 1) - c1;
|
c0 = ~c0; /* logical NOT */
|
c0 = ~c0; /* logical NOT */
|
|
|
sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
|
sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
|
|
|
q = ~q; /* (A/2)/b1 */
|
q = ~q; /* (A/2)/b1 */
|
r = (b1 - 1) - r;
|
r = (b1 - 1) - r;
|
|
|
r = 2*r + (a0 & 1); /* A/(2*b1) */
|
r = 2*r + (a0 & 1); /* A/(2*b1) */
|
|
|
if ((d & 1) != 0)
|
if ((d & 1) != 0)
|
{
|
{
|
if (r >= q)
|
if (r >= q)
|
r = r - q;
|
r = r - q;
|
else if (q - r <= d)
|
else if (q - r <= d)
|
{
|
{
|
r = r - q + d;
|
r = r - q + d;
|
q--;
|
q--;
|
}
|
}
|
else
|
else
|
{
|
{
|
r = r - q + 2*d;
|
r = r - q + 2*d;
|
q -= 2;
|
q -= 2;
|
}
|
}
|
}
|
}
|
}
|
}
|
else /* Implies c1 = b1 */
|
else /* Implies c1 = b1 */
|
{ /* Hence a1 = d - 1 = 2*b1 - 1 */
|
{ /* Hence a1 = d - 1 = 2*b1 - 1 */
|
if (a0 >= -d)
|
if (a0 >= -d)
|
{
|
{
|
q = -1;
|
q = -1;
|
r = a0 + d;
|
r = a0 + d;
|
}
|
}
|
else
|
else
|
{
|
{
|
q = -2;
|
q = -2;
|
r = a0 + 2*d;
|
r = a0 + 2*d;
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
*rp = r;
|
*rp = r;
|
return q;
|
return q;
|
}
|
}
|
#else
|
#else
|
/* If sdiv_qrnnd doesn't exist, define dummy __udiv_w_sdiv. */
|
/* If sdiv_qrnnd doesn't exist, define dummy __udiv_w_sdiv. */
|
UWtype
|
UWtype
|
__udiv_w_sdiv (UWtype *rp __attribute__ ((__unused__)),
|
__udiv_w_sdiv (UWtype *rp __attribute__ ((__unused__)),
|
UWtype a1 __attribute__ ((__unused__)),
|
UWtype a1 __attribute__ ((__unused__)),
|
UWtype a0 __attribute__ ((__unused__)),
|
UWtype a0 __attribute__ ((__unused__)),
|
UWtype d __attribute__ ((__unused__)))
|
UWtype d __attribute__ ((__unused__)))
|
{
|
{
|
return 0;
|
return 0;
|
}
|
}
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
defined (L_umoddi3) || defined (L_moddi3))
|
defined (L_umoddi3) || defined (L_moddi3))
|
#define L_udivmoddi4
|
#define L_udivmoddi4
|
#endif
|
#endif
|
|
|
#ifdef L_clz
|
#ifdef L_clz
|
const UQItype __clz_tab[256] =
|
const UQItype __clz_tab[256] =
|
{
|
{
|
0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
|
0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
|
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
|
6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
|
8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
|
};
|
};
|
#endif
|
#endif
|
|
|
#ifdef L_clzsi2
|
#ifdef L_clzsi2
|
#undef int
|
#undef int
|
int
|
int
|
__clzSI2 (UWtype x)
|
__clzSI2 (UWtype x)
|
{
|
{
|
Wtype ret;
|
Wtype ret;
|
|
|
count_leading_zeros (ret, x);
|
count_leading_zeros (ret, x);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_clzdi2
|
#ifdef L_clzdi2
|
#undef int
|
#undef int
|
int
|
int
|
__clzDI2 (UDWtype x)
|
__clzDI2 (UDWtype x)
|
{
|
{
|
const DWunion uu = {.ll = x};
|
const DWunion uu = {.ll = x};
|
UWtype word;
|
UWtype word;
|
Wtype ret, add;
|
Wtype ret, add;
|
|
|
if (uu.s.high)
|
if (uu.s.high)
|
word = uu.s.high, add = 0;
|
word = uu.s.high, add = 0;
|
else
|
else
|
word = uu.s.low, add = W_TYPE_SIZE;
|
word = uu.s.low, add = W_TYPE_SIZE;
|
|
|
count_leading_zeros (ret, word);
|
count_leading_zeros (ret, word);
|
return ret + add;
|
return ret + add;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ctzsi2
|
#ifdef L_ctzsi2
|
#undef int
|
#undef int
|
int
|
int
|
__ctzSI2 (UWtype x)
|
__ctzSI2 (UWtype x)
|
{
|
{
|
Wtype ret;
|
Wtype ret;
|
|
|
count_trailing_zeros (ret, x);
|
count_trailing_zeros (ret, x);
|
|
|
return ret;
|
return ret;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ctzdi2
|
#ifdef L_ctzdi2
|
#undef int
|
#undef int
|
int
|
int
|
__ctzDI2 (UDWtype x)
|
__ctzDI2 (UDWtype x)
|
{
|
{
|
const DWunion uu = {.ll = x};
|
const DWunion uu = {.ll = x};
|
UWtype word;
|
UWtype word;
|
Wtype ret, add;
|
Wtype ret, add;
|
|
|
if (uu.s.low)
|
if (uu.s.low)
|
word = uu.s.low, add = 0;
|
word = uu.s.low, add = 0;
|
else
|
else
|
word = uu.s.high, add = W_TYPE_SIZE;
|
word = uu.s.high, add = W_TYPE_SIZE;
|
|
|
count_trailing_zeros (ret, word);
|
count_trailing_zeros (ret, word);
|
return ret + add;
|
return ret + add;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_popcount_tab
|
#ifdef L_popcount_tab
|
const UQItype __popcount_tab[256] =
|
const UQItype __popcount_tab[256] =
|
{
|
{
|
0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
|
0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
|
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8
|
3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8
|
};
|
};
|
#endif
|
#endif
|
|
|
#ifdef L_popcountsi2
|
#ifdef L_popcountsi2
|
#undef int
|
#undef int
|
int
|
int
|
__popcountSI2 (UWtype x)
|
__popcountSI2 (UWtype x)
|
{
|
{
|
int i, ret = 0;
|
int i, ret = 0;
|
|
|
for (i = 0; i < W_TYPE_SIZE; i += 8)
|
for (i = 0; i < W_TYPE_SIZE; i += 8)
|
ret += __popcount_tab[(x >> i) & 0xff];
|
ret += __popcount_tab[(x >> i) & 0xff];
|
|
|
return ret;
|
return ret;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_popcountdi2
|
#ifdef L_popcountdi2
|
#undef int
|
#undef int
|
int
|
int
|
__popcountDI2 (UDWtype x)
|
__popcountDI2 (UDWtype x)
|
{
|
{
|
int i, ret = 0;
|
int i, ret = 0;
|
|
|
for (i = 0; i < 2*W_TYPE_SIZE; i += 8)
|
for (i = 0; i < 2*W_TYPE_SIZE; i += 8)
|
ret += __popcount_tab[(x >> i) & 0xff];
|
ret += __popcount_tab[(x >> i) & 0xff];
|
|
|
return ret;
|
return ret;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_paritysi2
|
#ifdef L_paritysi2
|
#undef int
|
#undef int
|
int
|
int
|
__paritySI2 (UWtype x)
|
__paritySI2 (UWtype x)
|
{
|
{
|
#if W_TYPE_SIZE > 64
|
#if W_TYPE_SIZE > 64
|
# error "fill out the table"
|
# error "fill out the table"
|
#endif
|
#endif
|
#if W_TYPE_SIZE > 32
|
#if W_TYPE_SIZE > 32
|
x ^= x >> 32;
|
x ^= x >> 32;
|
#endif
|
#endif
|
#if W_TYPE_SIZE > 16
|
#if W_TYPE_SIZE > 16
|
x ^= x >> 16;
|
x ^= x >> 16;
|
#endif
|
#endif
|
x ^= x >> 8;
|
x ^= x >> 8;
|
x ^= x >> 4;
|
x ^= x >> 4;
|
x &= 0xf;
|
x &= 0xf;
|
return (0x6996 >> x) & 1;
|
return (0x6996 >> x) & 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_paritydi2
|
#ifdef L_paritydi2
|
#undef int
|
#undef int
|
int
|
int
|
__parityDI2 (UDWtype x)
|
__parityDI2 (UDWtype x)
|
{
|
{
|
const DWunion uu = {.ll = x};
|
const DWunion uu = {.ll = x};
|
UWtype nx = uu.s.low ^ uu.s.high;
|
UWtype nx = uu.s.low ^ uu.s.high;
|
|
|
#if W_TYPE_SIZE > 64
|
#if W_TYPE_SIZE > 64
|
# error "fill out the table"
|
# error "fill out the table"
|
#endif
|
#endif
|
#if W_TYPE_SIZE > 32
|
#if W_TYPE_SIZE > 32
|
nx ^= nx >> 32;
|
nx ^= nx >> 32;
|
#endif
|
#endif
|
#if W_TYPE_SIZE > 16
|
#if W_TYPE_SIZE > 16
|
nx ^= nx >> 16;
|
nx ^= nx >> 16;
|
#endif
|
#endif
|
nx ^= nx >> 8;
|
nx ^= nx >> 8;
|
nx ^= nx >> 4;
|
nx ^= nx >> 4;
|
nx &= 0xf;
|
nx &= 0xf;
|
return (0x6996 >> nx) & 1;
|
return (0x6996 >> nx) & 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_udivmoddi4
|
#ifdef L_udivmoddi4
|
|
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
#if (defined (L_udivdi3) || defined (L_divdi3) || \
|
defined (L_umoddi3) || defined (L_moddi3))
|
defined (L_umoddi3) || defined (L_moddi3))
|
static inline __attribute__ ((__always_inline__))
|
static inline __attribute__ ((__always_inline__))
|
#endif
|
#endif
|
UDWtype
|
UDWtype
|
__udivmoddi4 (UDWtype n, UDWtype d, UDWtype *rp)
|
__udivmoddi4 (UDWtype n, UDWtype d, UDWtype *rp)
|
{
|
{
|
const DWunion nn = {.ll = n};
|
const DWunion nn = {.ll = n};
|
const DWunion dd = {.ll = d};
|
const DWunion dd = {.ll = d};
|
DWunion rr;
|
DWunion rr;
|
UWtype d0, d1, n0, n1, n2;
|
UWtype d0, d1, n0, n1, n2;
|
UWtype q0, q1;
|
UWtype q0, q1;
|
UWtype b, bm;
|
UWtype b, bm;
|
|
|
d0 = dd.s.low;
|
d0 = dd.s.low;
|
d1 = dd.s.high;
|
d1 = dd.s.high;
|
n0 = nn.s.low;
|
n0 = nn.s.low;
|
n1 = nn.s.high;
|
n1 = nn.s.high;
|
|
|
#if !UDIV_NEEDS_NORMALIZATION
|
#if !UDIV_NEEDS_NORMALIZATION
|
if (d1 == 0)
|
if (d1 == 0)
|
{
|
{
|
if (d0 > n1)
|
if (d0 > n1)
|
{
|
{
|
/* 0q = nn / 0D */
|
/* 0q = nn / 0D */
|
|
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
q1 = 0;
|
q1 = 0;
|
|
|
/* Remainder in n0. */
|
/* Remainder in n0. */
|
}
|
}
|
else
|
else
|
{
|
{
|
/* qq = NN / 0d */
|
/* qq = NN / 0d */
|
|
|
if (d0 == 0)
|
if (d0 == 0)
|
d0 = 1 / d0; /* Divide intentionally by zero. */
|
d0 = 1 / d0; /* Divide intentionally by zero. */
|
|
|
udiv_qrnnd (q1, n1, 0, n1, d0);
|
udiv_qrnnd (q1, n1, 0, n1, d0);
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
|
|
/* Remainder in n0. */
|
/* Remainder in n0. */
|
}
|
}
|
|
|
if (rp != 0)
|
if (rp != 0)
|
{
|
{
|
rr.s.low = n0;
|
rr.s.low = n0;
|
rr.s.high = 0;
|
rr.s.high = 0;
|
*rp = rr.ll;
|
*rp = rr.ll;
|
}
|
}
|
}
|
}
|
|
|
#else /* UDIV_NEEDS_NORMALIZATION */
|
#else /* UDIV_NEEDS_NORMALIZATION */
|
|
|
if (d1 == 0)
|
if (d1 == 0)
|
{
|
{
|
if (d0 > n1)
|
if (d0 > n1)
|
{
|
{
|
/* 0q = nn / 0D */
|
/* 0q = nn / 0D */
|
|
|
count_leading_zeros (bm, d0);
|
count_leading_zeros (bm, d0);
|
|
|
if (bm != 0)
|
if (bm != 0)
|
{
|
{
|
/* Normalize, i.e. make the most significant bit of the
|
/* Normalize, i.e. make the most significant bit of the
|
denominator set. */
|
denominator set. */
|
|
|
d0 = d0 << bm;
|
d0 = d0 << bm;
|
n1 = (n1 << bm) | (n0 >> (W_TYPE_SIZE - bm));
|
n1 = (n1 << bm) | (n0 >> (W_TYPE_SIZE - bm));
|
n0 = n0 << bm;
|
n0 = n0 << bm;
|
}
|
}
|
|
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
q1 = 0;
|
q1 = 0;
|
|
|
/* Remainder in n0 >> bm. */
|
/* Remainder in n0 >> bm. */
|
}
|
}
|
else
|
else
|
{
|
{
|
/* qq = NN / 0d */
|
/* qq = NN / 0d */
|
|
|
if (d0 == 0)
|
if (d0 == 0)
|
d0 = 1 / d0; /* Divide intentionally by zero. */
|
d0 = 1 / d0; /* Divide intentionally by zero. */
|
|
|
count_leading_zeros (bm, d0);
|
count_leading_zeros (bm, d0);
|
|
|
if (bm == 0)
|
if (bm == 0)
|
{
|
{
|
/* From (n1 >= d0) /\ (the most significant bit of d0 is set),
|
/* From (n1 >= d0) /\ (the most significant bit of d0 is set),
|
conclude (the most significant bit of n1 is set) /\ (the
|
conclude (the most significant bit of n1 is set) /\ (the
|
leading quotient digit q1 = 1).
|
leading quotient digit q1 = 1).
|
|
|
This special case is necessary, not an optimization.
|
This special case is necessary, not an optimization.
|
(Shifts counts of W_TYPE_SIZE are undefined.) */
|
(Shifts counts of W_TYPE_SIZE are undefined.) */
|
|
|
n1 -= d0;
|
n1 -= d0;
|
q1 = 1;
|
q1 = 1;
|
}
|
}
|
else
|
else
|
{
|
{
|
/* Normalize. */
|
/* Normalize. */
|
|
|
b = W_TYPE_SIZE - bm;
|
b = W_TYPE_SIZE - bm;
|
|
|
d0 = d0 << bm;
|
d0 = d0 << bm;
|
n2 = n1 >> b;
|
n2 = n1 >> b;
|
n1 = (n1 << bm) | (n0 >> b);
|
n1 = (n1 << bm) | (n0 >> b);
|
n0 = n0 << bm;
|
n0 = n0 << bm;
|
|
|
udiv_qrnnd (q1, n1, n2, n1, d0);
|
udiv_qrnnd (q1, n1, n2, n1, d0);
|
}
|
}
|
|
|
/* n1 != d0... */
|
/* n1 != d0... */
|
|
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
udiv_qrnnd (q0, n0, n1, n0, d0);
|
|
|
/* Remainder in n0 >> bm. */
|
/* Remainder in n0 >> bm. */
|
}
|
}
|
|
|
if (rp != 0)
|
if (rp != 0)
|
{
|
{
|
rr.s.low = n0 >> bm;
|
rr.s.low = n0 >> bm;
|
rr.s.high = 0;
|
rr.s.high = 0;
|
*rp = rr.ll;
|
*rp = rr.ll;
|
}
|
}
|
}
|
}
|
#endif /* UDIV_NEEDS_NORMALIZATION */
|
#endif /* UDIV_NEEDS_NORMALIZATION */
|
|
|
else
|
else
|
{
|
{
|
if (d1 > n1)
|
if (d1 > n1)
|
{
|
{
|
/* 00 = nn / DD */
|
/* 00 = nn / DD */
|
|
|
q0 = 0;
|
q0 = 0;
|
q1 = 0;
|
q1 = 0;
|
|
|
/* Remainder in n1n0. */
|
/* Remainder in n1n0. */
|
if (rp != 0)
|
if (rp != 0)
|
{
|
{
|
rr.s.low = n0;
|
rr.s.low = n0;
|
rr.s.high = n1;
|
rr.s.high = n1;
|
*rp = rr.ll;
|
*rp = rr.ll;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
/* 0q = NN / dd */
|
/* 0q = NN / dd */
|
|
|
count_leading_zeros (bm, d1);
|
count_leading_zeros (bm, d1);
|
if (bm == 0)
|
if (bm == 0)
|
{
|
{
|
/* From (n1 >= d1) /\ (the most significant bit of d1 is set),
|
/* From (n1 >= d1) /\ (the most significant bit of d1 is set),
|
conclude (the most significant bit of n1 is set) /\ (the
|
conclude (the most significant bit of n1 is set) /\ (the
|
quotient digit q0 = 0 or 1).
|
quotient digit q0 = 0 or 1).
|
|
|
This special case is necessary, not an optimization. */
|
This special case is necessary, not an optimization. */
|
|
|
/* The condition on the next line takes advantage of that
|
/* The condition on the next line takes advantage of that
|
n1 >= d1 (true due to program flow). */
|
n1 >= d1 (true due to program flow). */
|
if (n1 > d1 || n0 >= d0)
|
if (n1 > d1 || n0 >= d0)
|
{
|
{
|
q0 = 1;
|
q0 = 1;
|
sub_ddmmss (n1, n0, n1, n0, d1, d0);
|
sub_ddmmss (n1, n0, n1, n0, d1, d0);
|
}
|
}
|
else
|
else
|
q0 = 0;
|
q0 = 0;
|
|
|
q1 = 0;
|
q1 = 0;
|
|
|
if (rp != 0)
|
if (rp != 0)
|
{
|
{
|
rr.s.low = n0;
|
rr.s.low = n0;
|
rr.s.high = n1;
|
rr.s.high = n1;
|
*rp = rr.ll;
|
*rp = rr.ll;
|
}
|
}
|
}
|
}
|
else
|
else
|
{
|
{
|
UWtype m1, m0;
|
UWtype m1, m0;
|
/* Normalize. */
|
/* Normalize. */
|
|
|
b = W_TYPE_SIZE - bm;
|
b = W_TYPE_SIZE - bm;
|
|
|
d1 = (d1 << bm) | (d0 >> b);
|
d1 = (d1 << bm) | (d0 >> b);
|
d0 = d0 << bm;
|
d0 = d0 << bm;
|
n2 = n1 >> b;
|
n2 = n1 >> b;
|
n1 = (n1 << bm) | (n0 >> b);
|
n1 = (n1 << bm) | (n0 >> b);
|
n0 = n0 << bm;
|
n0 = n0 << bm;
|
|
|
udiv_qrnnd (q0, n1, n2, n1, d1);
|
udiv_qrnnd (q0, n1, n2, n1, d1);
|
umul_ppmm (m1, m0, q0, d0);
|
umul_ppmm (m1, m0, q0, d0);
|
|
|
if (m1 > n1 || (m1 == n1 && m0 > n0))
|
if (m1 > n1 || (m1 == n1 && m0 > n0))
|
{
|
{
|
q0--;
|
q0--;
|
sub_ddmmss (m1, m0, m1, m0, d1, d0);
|
sub_ddmmss (m1, m0, m1, m0, d1, d0);
|
}
|
}
|
|
|
q1 = 0;
|
q1 = 0;
|
|
|
/* Remainder in (n1n0 - m1m0) >> bm. */
|
/* Remainder in (n1n0 - m1m0) >> bm. */
|
if (rp != 0)
|
if (rp != 0)
|
{
|
{
|
sub_ddmmss (n1, n0, n1, n0, m1, m0);
|
sub_ddmmss (n1, n0, n1, n0, m1, m0);
|
rr.s.low = (n1 << b) | (n0 >> bm);
|
rr.s.low = (n1 << b) | (n0 >> bm);
|
rr.s.high = n1 >> bm;
|
rr.s.high = n1 >> bm;
|
*rp = rr.ll;
|
*rp = rr.ll;
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
const DWunion ww = {{.low = q0, .high = q1}};
|
const DWunion ww = {{.low = q0, .high = q1}};
|
return ww.ll;
|
return ww.ll;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_divdi3
|
#ifdef L_divdi3
|
DWtype
|
DWtype
|
__divdi3 (DWtype u, DWtype v)
|
__divdi3 (DWtype u, DWtype v)
|
{
|
{
|
word_type c = 0;
|
word_type c = 0;
|
DWunion uu = {.ll = u};
|
DWunion uu = {.ll = u};
|
DWunion vv = {.ll = v};
|
DWunion vv = {.ll = v};
|
DWtype w;
|
DWtype w;
|
|
|
if (uu.s.high < 0)
|
if (uu.s.high < 0)
|
c = ~c,
|
c = ~c,
|
uu.ll = -uu.ll;
|
uu.ll = -uu.ll;
|
if (vv.s.high < 0)
|
if (vv.s.high < 0)
|
c = ~c,
|
c = ~c,
|
vv.ll = -vv.ll;
|
vv.ll = -vv.ll;
|
|
|
w = __udivmoddi4 (uu.ll, vv.ll, (UDWtype *) 0);
|
w = __udivmoddi4 (uu.ll, vv.ll, (UDWtype *) 0);
|
if (c)
|
if (c)
|
w = -w;
|
w = -w;
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_moddi3
|
#ifdef L_moddi3
|
DWtype
|
DWtype
|
__moddi3 (DWtype u, DWtype v)
|
__moddi3 (DWtype u, DWtype v)
|
{
|
{
|
word_type c = 0;
|
word_type c = 0;
|
DWunion uu = {.ll = u};
|
DWunion uu = {.ll = u};
|
DWunion vv = {.ll = v};
|
DWunion vv = {.ll = v};
|
DWtype w;
|
DWtype w;
|
|
|
if (uu.s.high < 0)
|
if (uu.s.high < 0)
|
c = ~c,
|
c = ~c,
|
uu.ll = -uu.ll;
|
uu.ll = -uu.ll;
|
if (vv.s.high < 0)
|
if (vv.s.high < 0)
|
vv.ll = -vv.ll;
|
vv.ll = -vv.ll;
|
|
|
(void) __udivmoddi4 (uu.ll, vv.ll, (UDWtype*)&w);
|
(void) __udivmoddi4 (uu.ll, vv.ll, (UDWtype*)&w);
|
if (c)
|
if (c)
|
w = -w;
|
w = -w;
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_umoddi3
|
#ifdef L_umoddi3
|
UDWtype
|
UDWtype
|
__umoddi3 (UDWtype u, UDWtype v)
|
__umoddi3 (UDWtype u, UDWtype v)
|
{
|
{
|
UDWtype w;
|
UDWtype w;
|
|
|
(void) __udivmoddi4 (u, v, &w);
|
(void) __udivmoddi4 (u, v, &w);
|
|
|
return w;
|
return w;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_udivdi3
|
#ifdef L_udivdi3
|
UDWtype
|
UDWtype
|
__udivdi3 (UDWtype n, UDWtype d)
|
__udivdi3 (UDWtype n, UDWtype d)
|
{
|
{
|
return __udivmoddi4 (n, d, (UDWtype *) 0);
|
return __udivmoddi4 (n, d, (UDWtype *) 0);
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_cmpdi2
|
#ifdef L_cmpdi2
|
word_type
|
word_type
|
__cmpdi2 (DWtype a, DWtype b)
|
__cmpdi2 (DWtype a, DWtype b)
|
{
|
{
|
const DWunion au = {.ll = a};
|
const DWunion au = {.ll = a};
|
const DWunion bu = {.ll = b};
|
const DWunion bu = {.ll = b};
|
|
|
if (au.s.high < bu.s.high)
|
if (au.s.high < bu.s.high)
|
return 0;
|
return 0;
|
else if (au.s.high > bu.s.high)
|
else if (au.s.high > bu.s.high)
|
return 2;
|
return 2;
|
if ((UWtype) au.s.low < (UWtype) bu.s.low)
|
if ((UWtype) au.s.low < (UWtype) bu.s.low)
|
return 0;
|
return 0;
|
else if ((UWtype) au.s.low > (UWtype) bu.s.low)
|
else if ((UWtype) au.s.low > (UWtype) bu.s.low)
|
return 2;
|
return 2;
|
return 1;
|
return 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifdef L_ucmpdi2
|
#ifdef L_ucmpdi2
|
word_type
|
word_type
|
__ucmpdi2 (DWtype a, DWtype b)
|
__ucmpdi2 (DWtype a, DWtype b)
|
{
|
{
|
const DWunion au = {.ll = a};
|
const DWunion au = {.ll = a};
|
const DWunion bu = {.ll = b};
|
const DWunion bu = {.ll = b};
|
|
|
if ((UWtype) au.s.high < (UWtype) bu.s.high)
|
if ((UWtype) au.s.high < (UWtype) bu.s.high)
|
return 0;
|
return 0;
|
else if ((UWtype) au.s.high > (UWtype) bu.s.high)
|
else if ((UWtype) au.s.high > (UWtype) bu.s.high)
|
return 2;
|
return 2;
|
if ((UWtype) au.s.low < (UWtype) bu.s.low)
|
if ((UWtype) au.s.low < (UWtype) bu.s.low)
|
return 0;
|
return 0;
|
else if ((UWtype) au.s.low > (UWtype) bu.s.low)
|
else if ((UWtype) au.s.low > (UWtype) bu.s.low)
|
return 2;
|
return 2;
|
return 1;
|
return 1;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunstfdi) && LIBGCC2_HAS_TF_MODE
|
#if defined(L_fixunstfdi) && LIBGCC2_HAS_TF_MODE
|
DWtype
|
DWtype
|
__fixunstfDI (TFtype a)
|
__fixunstfDI (TFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return 0;
|
return 0;
|
|
|
/* Compute high word of result, as a flonum. */
|
/* Compute high word of result, as a flonum. */
|
const TFtype b = (a / Wtype_MAXp1_F);
|
const TFtype b = (a / Wtype_MAXp1_F);
|
/* Convert that to fixed (but not to DWtype!),
|
/* Convert that to fixed (but not to DWtype!),
|
and shift it into the high word. */
|
and shift it into the high word. */
|
UDWtype v = (UWtype) b;
|
UDWtype v = (UWtype) b;
|
v <<= W_TYPE_SIZE;
|
v <<= W_TYPE_SIZE;
|
/* Remove high part from the TFtype, leaving the low part as flonum. */
|
/* Remove high part from the TFtype, leaving the low part as flonum. */
|
a -= (TFtype)v;
|
a -= (TFtype)v;
|
/* Convert that to fixed (but not to DWtype!) and add it in.
|
/* Convert that to fixed (but not to DWtype!) and add it in.
|
Sometimes A comes out negative. This is significant, since
|
Sometimes A comes out negative. This is significant, since
|
A has more bits than a long int does. */
|
A has more bits than a long int does. */
|
if (a < 0)
|
if (a < 0)
|
v -= (UWtype) (- a);
|
v -= (UWtype) (- a);
|
else
|
else
|
v += (UWtype) a;
|
v += (UWtype) a;
|
return v;
|
return v;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixtfdi) && LIBGCC2_HAS_TF_MODE
|
#if defined(L_fixtfdi) && LIBGCC2_HAS_TF_MODE
|
DWtype
|
DWtype
|
__fixtfdi (TFtype a)
|
__fixtfdi (TFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return - __fixunstfDI (-a);
|
return - __fixunstfDI (-a);
|
return __fixunstfDI (a);
|
return __fixunstfDI (a);
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunsxfdi) && LIBGCC2_HAS_XF_MODE
|
#if defined(L_fixunsxfdi) && LIBGCC2_HAS_XF_MODE
|
DWtype
|
DWtype
|
__fixunsxfDI (XFtype a)
|
__fixunsxfDI (XFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return 0;
|
return 0;
|
|
|
/* Compute high word of result, as a flonum. */
|
/* Compute high word of result, as a flonum. */
|
const XFtype b = (a / Wtype_MAXp1_F);
|
const XFtype b = (a / Wtype_MAXp1_F);
|
/* Convert that to fixed (but not to DWtype!),
|
/* Convert that to fixed (but not to DWtype!),
|
and shift it into the high word. */
|
and shift it into the high word. */
|
UDWtype v = (UWtype) b;
|
UDWtype v = (UWtype) b;
|
v <<= W_TYPE_SIZE;
|
v <<= W_TYPE_SIZE;
|
/* Remove high part from the XFtype, leaving the low part as flonum. */
|
/* Remove high part from the XFtype, leaving the low part as flonum. */
|
a -= (XFtype)v;
|
a -= (XFtype)v;
|
/* Convert that to fixed (but not to DWtype!) and add it in.
|
/* Convert that to fixed (but not to DWtype!) and add it in.
|
Sometimes A comes out negative. This is significant, since
|
Sometimes A comes out negative. This is significant, since
|
A has more bits than a long int does. */
|
A has more bits than a long int does. */
|
if (a < 0)
|
if (a < 0)
|
v -= (UWtype) (- a);
|
v -= (UWtype) (- a);
|
else
|
else
|
v += (UWtype) a;
|
v += (UWtype) a;
|
return v;
|
return v;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixxfdi) && LIBGCC2_HAS_XF_MODE
|
#if defined(L_fixxfdi) && LIBGCC2_HAS_XF_MODE
|
DWtype
|
DWtype
|
__fixxfdi (XFtype a)
|
__fixxfdi (XFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return - __fixunsxfDI (-a);
|
return - __fixunsxfDI (-a);
|
return __fixunsxfDI (a);
|
return __fixunsxfDI (a);
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunsdfdi) && LIBGCC2_HAS_DF_MODE
|
#if defined(L_fixunsdfdi) && LIBGCC2_HAS_DF_MODE
|
DWtype
|
DWtype
|
__fixunsdfDI (DFtype a)
|
__fixunsdfDI (DFtype a)
|
{
|
{
|
/* Get high part of result. The division here will just moves the radix
|
/* Get high part of result. The division here will just moves the radix
|
point and will not cause any rounding. Then the conversion to integral
|
point and will not cause any rounding. Then the conversion to integral
|
type chops result as desired. */
|
type chops result as desired. */
|
const UWtype hi = a / Wtype_MAXp1_F;
|
const UWtype hi = a / Wtype_MAXp1_F;
|
|
|
/* Get low part of result. Convert `hi' to floating type and scale it back,
|
/* Get low part of result. Convert `hi' to floating type and scale it back,
|
then subtract this from the number being converted. This leaves the low
|
then subtract this from the number being converted. This leaves the low
|
part. Convert that to integral type. */
|
part. Convert that to integral type. */
|
const UWtype lo = a - (DFtype) hi * Wtype_MAXp1_F;
|
const UWtype lo = a - (DFtype) hi * Wtype_MAXp1_F;
|
|
|
/* Assemble result from the two parts. */
|
/* Assemble result from the two parts. */
|
return ((UDWtype) hi << W_TYPE_SIZE) | lo;
|
return ((UDWtype) hi << W_TYPE_SIZE) | lo;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixdfdi) && LIBGCC2_HAS_DF_MODE
|
#if defined(L_fixdfdi) && LIBGCC2_HAS_DF_MODE
|
DWtype
|
DWtype
|
__fixdfdi (DFtype a)
|
__fixdfdi (DFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return - __fixunsdfDI (-a);
|
return - __fixunsdfDI (-a);
|
return __fixunsdfDI (a);
|
return __fixunsdfDI (a);
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunssfdi) && LIBGCC2_HAS_SF_MODE
|
#if defined(L_fixunssfdi) && LIBGCC2_HAS_SF_MODE
|
DWtype
|
DWtype
|
__fixunssfDI (SFtype a)
|
__fixunssfDI (SFtype a)
|
{
|
{
|
#if LIBGCC2_HAS_DF_MODE
|
#if LIBGCC2_HAS_DF_MODE
|
/* Convert the SFtype to a DFtype, because that is surely not going
|
/* Convert the SFtype to a DFtype, because that is surely not going
|
to lose any bits. Some day someone else can write a faster version
|
to lose any bits. Some day someone else can write a faster version
|
that avoids converting to DFtype, and verify it really works right. */
|
that avoids converting to DFtype, and verify it really works right. */
|
const DFtype dfa = a;
|
const DFtype dfa = a;
|
|
|
/* Get high part of result. The division here will just moves the radix
|
/* Get high part of result. The division here will just moves the radix
|
point and will not cause any rounding. Then the conversion to integral
|
point and will not cause any rounding. Then the conversion to integral
|
type chops result as desired. */
|
type chops result as desired. */
|
const UWtype hi = dfa / Wtype_MAXp1_F;
|
const UWtype hi = dfa / Wtype_MAXp1_F;
|
|
|
/* Get low part of result. Convert `hi' to floating type and scale it back,
|
/* Get low part of result. Convert `hi' to floating type and scale it back,
|
then subtract this from the number being converted. This leaves the low
|
then subtract this from the number being converted. This leaves the low
|
part. Convert that to integral type. */
|
part. Convert that to integral type. */
|
const UWtype lo = dfa - (DFtype) hi * Wtype_MAXp1_F;
|
const UWtype lo = dfa - (DFtype) hi * Wtype_MAXp1_F;
|
|
|
/* Assemble result from the two parts. */
|
/* Assemble result from the two parts. */
|
return ((UDWtype) hi << W_TYPE_SIZE) | lo;
|
return ((UDWtype) hi << W_TYPE_SIZE) | lo;
|
#elif FLT_MANT_DIG < W_TYPE_SIZE
|
#elif FLT_MANT_DIG < W_TYPE_SIZE
|
if (a < 1)
|
if (a < 1)
|
return 0;
|
return 0;
|
if (a < Wtype_MAXp1_F)
|
if (a < Wtype_MAXp1_F)
|
return (UWtype)a;
|
return (UWtype)a;
|
if (a < Wtype_MAXp1_F * Wtype_MAXp1_F)
|
if (a < Wtype_MAXp1_F * Wtype_MAXp1_F)
|
{
|
{
|
/* Since we know that there are fewer significant bits in the SFmode
|
/* Since we know that there are fewer significant bits in the SFmode
|
quantity than in a word, we know that we can convert out all the
|
quantity than in a word, we know that we can convert out all the
|
significant bits in one step, and thus avoid losing bits. */
|
significant bits in one step, and thus avoid losing bits. */
|
|
|
/* ??? This following loop essentially performs frexpf. If we could
|
/* ??? This following loop essentially performs frexpf. If we could
|
use the real libm function, or poke at the actual bits of the fp
|
use the real libm function, or poke at the actual bits of the fp
|
format, it would be significantly faster. */
|
format, it would be significantly faster. */
|
|
|
UWtype shift = 0, counter;
|
UWtype shift = 0, counter;
|
SFtype msb;
|
SFtype msb;
|
|
|
a /= Wtype_MAXp1_F;
|
a /= Wtype_MAXp1_F;
|
for (counter = W_TYPE_SIZE / 2; counter != 0; counter >>= 1)
|
for (counter = W_TYPE_SIZE / 2; counter != 0; counter >>= 1)
|
{
|
{
|
SFtype counterf = (UWtype)1 << counter;
|
SFtype counterf = (UWtype)1 << counter;
|
if (a >= counterf)
|
if (a >= counterf)
|
{
|
{
|
shift |= counter;
|
shift |= counter;
|
a /= counterf;
|
a /= counterf;
|
}
|
}
|
}
|
}
|
|
|
/* Rescale into the range of one word, extract the bits of that
|
/* Rescale into the range of one word, extract the bits of that
|
one word, and shift the result into position. */
|
one word, and shift the result into position. */
|
a *= Wtype_MAXp1_F;
|
a *= Wtype_MAXp1_F;
|
counter = a;
|
counter = a;
|
return (DWtype)counter << shift;
|
return (DWtype)counter << shift;
|
}
|
}
|
return -1;
|
return -1;
|
#else
|
#else
|
# error
|
# error
|
#endif
|
#endif
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixsfdi) && LIBGCC2_HAS_SF_MODE
|
#if defined(L_fixsfdi) && LIBGCC2_HAS_SF_MODE
|
DWtype
|
DWtype
|
__fixsfdi (SFtype a)
|
__fixsfdi (SFtype a)
|
{
|
{
|
if (a < 0)
|
if (a < 0)
|
return - __fixunssfDI (-a);
|
return - __fixunssfDI (-a);
|
return __fixunssfDI (a);
|
return __fixunssfDI (a);
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_floatdixf) && LIBGCC2_HAS_XF_MODE
|
#if defined(L_floatdixf) && LIBGCC2_HAS_XF_MODE
|
XFtype
|
XFtype
|
__floatdixf (DWtype u)
|
__floatdixf (DWtype u)
|
{
|
{
|
#if W_TYPE_SIZE > XF_SIZE
|
#if W_TYPE_SIZE > XF_SIZE
|
# error
|
# error
|
#endif
|
#endif
|
XFtype d = (Wtype) (u >> W_TYPE_SIZE);
|
XFtype d = (Wtype) (u >> W_TYPE_SIZE);
|
d *= Wtype_MAXp1_F;
|
d *= Wtype_MAXp1_F;
|
d += (UWtype)u;
|
d += (UWtype)u;
|
return d;
|
return d;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_floatundixf) && LIBGCC2_HAS_XF_MODE
|
#if defined(L_floatundixf) && LIBGCC2_HAS_XF_MODE
|
XFtype
|
XFtype
|
__floatundixf (UDWtype u)
|
__floatundixf (UDWtype u)
|
{
|
{
|
#if W_TYPE_SIZE > XF_SIZE
|
#if W_TYPE_SIZE > XF_SIZE
|
# error
|
# error
|
#endif
|
#endif
|
XFtype d = (UWtype) (u >> W_TYPE_SIZE);
|
XFtype d = (UWtype) (u >> W_TYPE_SIZE);
|
d *= Wtype_MAXp1_F;
|
d *= Wtype_MAXp1_F;
|
d += (UWtype)u;
|
d += (UWtype)u;
|
return d;
|
return d;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_floatditf) && LIBGCC2_HAS_TF_MODE
|
#if defined(L_floatditf) && LIBGCC2_HAS_TF_MODE
|
TFtype
|
TFtype
|
__floatditf (DWtype u)
|
__floatditf (DWtype u)
|
{
|
{
|
#if W_TYPE_SIZE > TF_SIZE
|
#if W_TYPE_SIZE > TF_SIZE
|
# error
|
# error
|
#endif
|
#endif
|
TFtype d = (Wtype) (u >> W_TYPE_SIZE);
|
TFtype d = (Wtype) (u >> W_TYPE_SIZE);
|
d *= Wtype_MAXp1_F;
|
d *= Wtype_MAXp1_F;
|
d += (UWtype)u;
|
d += (UWtype)u;
|
return d;
|
return d;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_floatunditf) && LIBGCC2_HAS_TF_MODE
|
#if defined(L_floatunditf) && LIBGCC2_HAS_TF_MODE
|
TFtype
|
TFtype
|
__floatunditf (UDWtype u)
|
__floatunditf (UDWtype u)
|
{
|
{
|
#if W_TYPE_SIZE > TF_SIZE
|
#if W_TYPE_SIZE > TF_SIZE
|
# error
|
# error
|
#endif
|
#endif
|
TFtype d = (UWtype) (u >> W_TYPE_SIZE);
|
TFtype d = (UWtype) (u >> W_TYPE_SIZE);
|
d *= Wtype_MAXp1_F;
|
d *= Wtype_MAXp1_F;
|
d += (UWtype)u;
|
d += (UWtype)u;
|
return d;
|
return d;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if (defined(L_floatdisf) && LIBGCC2_HAS_SF_MODE) \
|
#if (defined(L_floatdisf) && LIBGCC2_HAS_SF_MODE) \
|
|| (defined(L_floatdidf) && LIBGCC2_HAS_DF_MODE)
|
|| (defined(L_floatdidf) && LIBGCC2_HAS_DF_MODE)
|
#define DI_SIZE (W_TYPE_SIZE * 2)
|
#define DI_SIZE (W_TYPE_SIZE * 2)
|
#define F_MODE_OK(SIZE) \
|
#define F_MODE_OK(SIZE) \
|
(SIZE < DI_SIZE \
|
(SIZE < DI_SIZE \
|
&& SIZE > (DI_SIZE - SIZE + FSSIZE) \
|
&& SIZE > (DI_SIZE - SIZE + FSSIZE) \
|
/* Don't use IBM Extended Double TFmode for TI->SF calculations. \
|
/* Don't use IBM Extended Double TFmode for TI->SF calculations. \
|
The conversion from long double to float suffers from double \
|
The conversion from long double to float suffers from double \
|
rounding, because we convert via double. In any case, the \
|
rounding, because we convert via double. In any case, the \
|
fallback code is faster. */ \
|
fallback code is faster. */ \
|
&& !IS_IBM_EXTENDED (SIZE))
|
&& !IS_IBM_EXTENDED (SIZE))
|
#if defined(L_floatdisf)
|
#if defined(L_floatdisf)
|
#define FUNC __floatdisf
|
#define FUNC __floatdisf
|
#define FSTYPE SFtype
|
#define FSTYPE SFtype
|
#define FSSIZE SF_SIZE
|
#define FSSIZE SF_SIZE
|
#else
|
#else
|
#define FUNC __floatdidf
|
#define FUNC __floatdidf
|
#define FSTYPE DFtype
|
#define FSTYPE DFtype
|
#define FSSIZE DF_SIZE
|
#define FSSIZE DF_SIZE
|
#endif
|
#endif
|
|
|
FSTYPE
|
FSTYPE
|
FUNC (DWtype u)
|
FUNC (DWtype u)
|
{
|
{
|
#if FSSIZE >= W_TYPE_SIZE
|
#if FSSIZE >= W_TYPE_SIZE
|
/* When the word size is small, we never get any rounding error. */
|
/* When the word size is small, we never get any rounding error. */
|
FSTYPE f = (Wtype) (u >> W_TYPE_SIZE);
|
FSTYPE f = (Wtype) (u >> W_TYPE_SIZE);
|
f *= Wtype_MAXp1_F;
|
f *= Wtype_MAXp1_F;
|
f += (UWtype)u;
|
f += (UWtype)u;
|
return f;
|
return f;
|
#elif (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE)) \
|
#elif (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE)) \
|
|| (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE)) \
|
|| (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE)) \
|
|| (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
|| (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
|
|
#if (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE))
|
#if (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE))
|
# define FSIZE DF_SIZE
|
# define FSIZE DF_SIZE
|
# define FTYPE DFtype
|
# define FTYPE DFtype
|
#elif (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE))
|
#elif (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE))
|
# define FSIZE XF_SIZE
|
# define FSIZE XF_SIZE
|
# define FTYPE XFtype
|
# define FTYPE XFtype
|
#elif (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
#elif (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
# define FSIZE TF_SIZE
|
# define FSIZE TF_SIZE
|
# define FTYPE TFtype
|
# define FTYPE TFtype
|
#else
|
#else
|
# error
|
# error
|
#endif
|
#endif
|
|
|
#define REP_BIT ((UDWtype) 1 << (DI_SIZE - FSIZE))
|
#define REP_BIT ((UDWtype) 1 << (DI_SIZE - FSIZE))
|
|
|
/* Protect against double-rounding error.
|
/* Protect against double-rounding error.
|
Represent any low-order bits, that might be truncated by a bit that
|
Represent any low-order bits, that might be truncated by a bit that
|
won't be lost. The bit can go in anywhere below the rounding position
|
won't be lost. The bit can go in anywhere below the rounding position
|
of the FSTYPE. A fixed mask and bit position handles all usual
|
of the FSTYPE. A fixed mask and bit position handles all usual
|
configurations. */
|
configurations. */
|
if (! (- ((DWtype) 1 << FSIZE) < u
|
if (! (- ((DWtype) 1 << FSIZE) < u
|
&& u < ((DWtype) 1 << FSIZE)))
|
&& u < ((DWtype) 1 << FSIZE)))
|
{
|
{
|
if ((UDWtype) u & (REP_BIT - 1))
|
if ((UDWtype) u & (REP_BIT - 1))
|
{
|
{
|
u &= ~ (REP_BIT - 1);
|
u &= ~ (REP_BIT - 1);
|
u |= REP_BIT;
|
u |= REP_BIT;
|
}
|
}
|
}
|
}
|
|
|
/* Do the calculation in a wider type so that we don't lose any of
|
/* Do the calculation in a wider type so that we don't lose any of
|
the precision of the high word while multiplying it. */
|
the precision of the high word while multiplying it. */
|
FTYPE f = (Wtype) (u >> W_TYPE_SIZE);
|
FTYPE f = (Wtype) (u >> W_TYPE_SIZE);
|
f *= Wtype_MAXp1_F;
|
f *= Wtype_MAXp1_F;
|
f += (UWtype)u;
|
f += (UWtype)u;
|
return (FSTYPE) f;
|
return (FSTYPE) f;
|
#else
|
#else
|
#if FSSIZE >= W_TYPE_SIZE - 2
|
#if FSSIZE >= W_TYPE_SIZE - 2
|
# error
|
# error
|
#endif
|
#endif
|
/* Finally, the word size is larger than the number of bits in the
|
/* Finally, the word size is larger than the number of bits in the
|
required FSTYPE, and we've got no suitable wider type. The only
|
required FSTYPE, and we've got no suitable wider type. The only
|
way to avoid double rounding is to special case the
|
way to avoid double rounding is to special case the
|
extraction. */
|
extraction. */
|
|
|
/* If there are no high bits set, fall back to one conversion. */
|
/* If there are no high bits set, fall back to one conversion. */
|
if ((Wtype)u == u)
|
if ((Wtype)u == u)
|
return (FSTYPE)(Wtype)u;
|
return (FSTYPE)(Wtype)u;
|
|
|
/* Otherwise, find the power of two. */
|
/* Otherwise, find the power of two. */
|
Wtype hi = u >> W_TYPE_SIZE;
|
Wtype hi = u >> W_TYPE_SIZE;
|
if (hi < 0)
|
if (hi < 0)
|
hi = -hi;
|
hi = -hi;
|
|
|
UWtype count, shift;
|
UWtype count, shift;
|
count_leading_zeros (count, hi);
|
count_leading_zeros (count, hi);
|
|
|
/* No leading bits means u == minimum. */
|
/* No leading bits means u == minimum. */
|
if (count == 0)
|
if (count == 0)
|
return -(Wtype_MAXp1_F * (Wtype_MAXp1_F / 2));
|
return -(Wtype_MAXp1_F * (Wtype_MAXp1_F / 2));
|
|
|
shift = 1 + W_TYPE_SIZE - count;
|
shift = 1 + W_TYPE_SIZE - count;
|
|
|
/* Shift down the most significant bits. */
|
/* Shift down the most significant bits. */
|
hi = u >> shift;
|
hi = u >> shift;
|
|
|
/* If we lost any nonzero bits, set the lsb to ensure correct rounding. */
|
/* If we lost any nonzero bits, set the lsb to ensure correct rounding. */
|
if (u & (((DWtype)1 << shift) - 1))
|
if (u & (((DWtype)1 << shift) - 1))
|
hi |= 1;
|
hi |= 1;
|
|
|
/* Convert the one word of data, and rescale. */
|
/* Convert the one word of data, and rescale. */
|
FSTYPE f = hi;
|
FSTYPE f = hi;
|
f *= (UDWtype)1 << shift;
|
f *= (UDWtype)1 << shift;
|
return f;
|
return f;
|
#endif
|
#endif
|
}
|
}
|
#endif
|
#endif
|
|
|
#if (defined(L_floatundisf) && LIBGCC2_HAS_SF_MODE) \
|
#if (defined(L_floatundisf) && LIBGCC2_HAS_SF_MODE) \
|
|| (defined(L_floatundidf) && LIBGCC2_HAS_DF_MODE)
|
|| (defined(L_floatundidf) && LIBGCC2_HAS_DF_MODE)
|
#define DI_SIZE (W_TYPE_SIZE * 2)
|
#define DI_SIZE (W_TYPE_SIZE * 2)
|
#define F_MODE_OK(SIZE) \
|
#define F_MODE_OK(SIZE) \
|
(SIZE < DI_SIZE \
|
(SIZE < DI_SIZE \
|
&& SIZE > (DI_SIZE - SIZE + FSSIZE) \
|
&& SIZE > (DI_SIZE - SIZE + FSSIZE) \
|
/* Don't use IBM Extended Double TFmode for TI->SF calculations. \
|
/* Don't use IBM Extended Double TFmode for TI->SF calculations. \
|
The conversion from long double to float suffers from double \
|
The conversion from long double to float suffers from double \
|
rounding, because we convert via double. In any case, the \
|
rounding, because we convert via double. In any case, the \
|
fallback code is faster. */ \
|
fallback code is faster. */ \
|
&& !IS_IBM_EXTENDED (SIZE))
|
&& !IS_IBM_EXTENDED (SIZE))
|
#if defined(L_floatundisf)
|
#if defined(L_floatundisf)
|
#define FUNC __floatundisf
|
#define FUNC __floatundisf
|
#define FSTYPE SFtype
|
#define FSTYPE SFtype
|
#define FSSIZE SF_SIZE
|
#define FSSIZE SF_SIZE
|
#else
|
#else
|
#define FUNC __floatundidf
|
#define FUNC __floatundidf
|
#define FSTYPE DFtype
|
#define FSTYPE DFtype
|
#define FSSIZE DF_SIZE
|
#define FSSIZE DF_SIZE
|
#endif
|
#endif
|
|
|
FSTYPE
|
FSTYPE
|
FUNC (UDWtype u)
|
FUNC (UDWtype u)
|
{
|
{
|
#if FSSIZE >= W_TYPE_SIZE
|
#if FSSIZE >= W_TYPE_SIZE
|
/* When the word size is small, we never get any rounding error. */
|
/* When the word size is small, we never get any rounding error. */
|
FSTYPE f = (UWtype) (u >> W_TYPE_SIZE);
|
FSTYPE f = (UWtype) (u >> W_TYPE_SIZE);
|
f *= Wtype_MAXp1_F;
|
f *= Wtype_MAXp1_F;
|
f += (UWtype)u;
|
f += (UWtype)u;
|
return f;
|
return f;
|
#elif (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE)) \
|
#elif (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE)) \
|
|| (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE)) \
|
|| (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE)) \
|
|| (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
|| (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
|
|
#if (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE))
|
#if (LIBGCC2_HAS_DF_MODE && F_MODE_OK (DF_SIZE))
|
# define FSIZE DF_SIZE
|
# define FSIZE DF_SIZE
|
# define FTYPE DFtype
|
# define FTYPE DFtype
|
#elif (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE))
|
#elif (LIBGCC2_HAS_XF_MODE && F_MODE_OK (XF_SIZE))
|
# define FSIZE XF_SIZE
|
# define FSIZE XF_SIZE
|
# define FTYPE XFtype
|
# define FTYPE XFtype
|
#elif (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
#elif (LIBGCC2_HAS_TF_MODE && F_MODE_OK (TF_SIZE))
|
# define FSIZE TF_SIZE
|
# define FSIZE TF_SIZE
|
# define FTYPE TFtype
|
# define FTYPE TFtype
|
#else
|
#else
|
# error
|
# error
|
#endif
|
#endif
|
|
|
#define REP_BIT ((UDWtype) 1 << (DI_SIZE - FSIZE))
|
#define REP_BIT ((UDWtype) 1 << (DI_SIZE - FSIZE))
|
|
|
/* Protect against double-rounding error.
|
/* Protect against double-rounding error.
|
Represent any low-order bits, that might be truncated by a bit that
|
Represent any low-order bits, that might be truncated by a bit that
|
won't be lost. The bit can go in anywhere below the rounding position
|
won't be lost. The bit can go in anywhere below the rounding position
|
of the FSTYPE. A fixed mask and bit position handles all usual
|
of the FSTYPE. A fixed mask and bit position handles all usual
|
configurations. */
|
configurations. */
|
if (u >= ((UDWtype) 1 << FSIZE))
|
if (u >= ((UDWtype) 1 << FSIZE))
|
{
|
{
|
if ((UDWtype) u & (REP_BIT - 1))
|
if ((UDWtype) u & (REP_BIT - 1))
|
{
|
{
|
u &= ~ (REP_BIT - 1);
|
u &= ~ (REP_BIT - 1);
|
u |= REP_BIT;
|
u |= REP_BIT;
|
}
|
}
|
}
|
}
|
|
|
/* Do the calculation in a wider type so that we don't lose any of
|
/* Do the calculation in a wider type so that we don't lose any of
|
the precision of the high word while multiplying it. */
|
the precision of the high word while multiplying it. */
|
FTYPE f = (UWtype) (u >> W_TYPE_SIZE);
|
FTYPE f = (UWtype) (u >> W_TYPE_SIZE);
|
f *= Wtype_MAXp1_F;
|
f *= Wtype_MAXp1_F;
|
f += (UWtype)u;
|
f += (UWtype)u;
|
return (FSTYPE) f;
|
return (FSTYPE) f;
|
#else
|
#else
|
#if FSSIZE == W_TYPE_SIZE - 1
|
#if FSSIZE == W_TYPE_SIZE - 1
|
# error
|
# error
|
#endif
|
#endif
|
/* Finally, the word size is larger than the number of bits in the
|
/* Finally, the word size is larger than the number of bits in the
|
required FSTYPE, and we've got no suitable wider type. The only
|
required FSTYPE, and we've got no suitable wider type. The only
|
way to avoid double rounding is to special case the
|
way to avoid double rounding is to special case the
|
extraction. */
|
extraction. */
|
|
|
/* If there are no high bits set, fall back to one conversion. */
|
/* If there are no high bits set, fall back to one conversion. */
|
if ((UWtype)u == u)
|
if ((UWtype)u == u)
|
return (FSTYPE)(UWtype)u;
|
return (FSTYPE)(UWtype)u;
|
|
|
/* Otherwise, find the power of two. */
|
/* Otherwise, find the power of two. */
|
UWtype hi = u >> W_TYPE_SIZE;
|
UWtype hi = u >> W_TYPE_SIZE;
|
|
|
UWtype count, shift;
|
UWtype count, shift;
|
count_leading_zeros (count, hi);
|
count_leading_zeros (count, hi);
|
|
|
shift = W_TYPE_SIZE - count;
|
shift = W_TYPE_SIZE - count;
|
|
|
/* Shift down the most significant bits. */
|
/* Shift down the most significant bits. */
|
hi = u >> shift;
|
hi = u >> shift;
|
|
|
/* If we lost any nonzero bits, set the lsb to ensure correct rounding. */
|
/* If we lost any nonzero bits, set the lsb to ensure correct rounding. */
|
if (u & (((UDWtype)1 << shift) - 1))
|
if (u & (((UDWtype)1 << shift) - 1))
|
hi |= 1;
|
hi |= 1;
|
|
|
/* Convert the one word of data, and rescale. */
|
/* Convert the one word of data, and rescale. */
|
FSTYPE f = hi;
|
FSTYPE f = hi;
|
f *= (UDWtype)1 << shift;
|
f *= (UDWtype)1 << shift;
|
return f;
|
return f;
|
#endif
|
#endif
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunsxfsi) && LIBGCC2_HAS_XF_MODE
|
#if defined(L_fixunsxfsi) && LIBGCC2_HAS_XF_MODE
|
/* Reenable the normal types, in case limits.h needs them. */
|
/* Reenable the normal types, in case limits.h needs them. */
|
#undef char
|
#undef char
|
#undef short
|
#undef short
|
#undef int
|
#undef int
|
#undef long
|
#undef long
|
#undef unsigned
|
#undef unsigned
|
#undef float
|
#undef float
|
#undef double
|
#undef double
|
#undef MIN
|
#undef MIN
|
#undef MAX
|
#undef MAX
|
#include <limits.h>
|
#include <limits.h>
|
|
|
UWtype
|
UWtype
|
__fixunsxfSI (XFtype a)
|
__fixunsxfSI (XFtype a)
|
{
|
{
|
if (a >= - (DFtype) Wtype_MIN)
|
if (a >= - (DFtype) Wtype_MIN)
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) a;
|
return (Wtype) a;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunsdfsi) && LIBGCC2_HAS_DF_MODE
|
#if defined(L_fixunsdfsi) && LIBGCC2_HAS_DF_MODE
|
/* Reenable the normal types, in case limits.h needs them. */
|
/* Reenable the normal types, in case limits.h needs them. */
|
#undef char
|
#undef char
|
#undef short
|
#undef short
|
#undef int
|
#undef int
|
#undef long
|
#undef long
|
#undef unsigned
|
#undef unsigned
|
#undef float
|
#undef float
|
#undef double
|
#undef double
|
#undef MIN
|
#undef MIN
|
#undef MAX
|
#undef MAX
|
#include <limits.h>
|
#include <limits.h>
|
|
|
UWtype
|
UWtype
|
__fixunsdfSI (DFtype a)
|
__fixunsdfSI (DFtype a)
|
{
|
{
|
if (a >= - (DFtype) Wtype_MIN)
|
if (a >= - (DFtype) Wtype_MIN)
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) a;
|
return (Wtype) a;
|
}
|
}
|
#endif
|
#endif
|
|
|
#if defined(L_fixunssfsi) && LIBGCC2_HAS_SF_MODE
|
#if defined(L_fixunssfsi) && LIBGCC2_HAS_SF_MODE
|
/* Reenable the normal types, in case limits.h needs them. */
|
/* Reenable the normal types, in case limits.h needs them. */
|
#undef char
|
#undef char
|
#undef short
|
#undef short
|
#undef int
|
#undef int
|
#undef long
|
#undef long
|
#undef unsigned
|
#undef unsigned
|
#undef float
|
#undef float
|
#undef double
|
#undef double
|
#undef MIN
|
#undef MIN
|
#undef MAX
|
#undef MAX
|
#include <limits.h>
|
#include <limits.h>
|
|
|
UWtype
|
UWtype
|
__fixunssfSI (SFtype a)
|
__fixunssfSI (SFtype a)
|
{
|
{
|
if (a >= - (SFtype) Wtype_MIN)
|
if (a >= - (SFtype) Wtype_MIN)
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
|
return (Wtype) a;
|
return (Wtype) a;
|
}
|
}
|
#endif
|
#endif
|
|
|
/* Integer power helper used from __builtin_powi for non-constant
|
/* Integer power helper used from __builtin_powi for non-constant
|
exponents. */
|
exponents. */
|
|
|
#if (defined(L_powisf2) && LIBGCC2_HAS_SF_MODE) \
|
#if (defined(L_powisf2) && LIBGCC2_HAS_SF_MODE) \
|
|| (defined(L_powidf2) && LIBGCC2_HAS_DF_MODE) \
|
|| (defined(L_powidf2) && LIBGCC2_HAS_DF_MODE) \
|
|| (defined(L_powixf2) && LIBGCC2_HAS_XF_MODE) \
|
|| (defined(L_powixf2) && LIBGCC2_HAS_XF_MODE) \
|
|| (defined(L_powitf2) && LIBGCC2_HAS_TF_MODE)
|
|| (defined(L_powitf2) && LIBGCC2_HAS_TF_MODE)
|
# if defined(L_powisf2)
|
# if defined(L_powisf2)
|
# define TYPE SFtype
|
# define TYPE SFtype
|
# define NAME __powisf2
|
# define NAME __powisf2
|
# elif defined(L_powidf2)
|
# elif defined(L_powidf2)
|
# define TYPE DFtype
|
# define TYPE DFtype
|
# define NAME __powidf2
|
# define NAME __powidf2
|
# elif defined(L_powixf2)
|
# elif defined(L_powixf2)
|
# define TYPE XFtype
|
# define TYPE XFtype
|
# define NAME __powixf2
|
# define NAME __powixf2
|
# elif defined(L_powitf2)
|
# elif defined(L_powitf2)
|
# define TYPE TFtype
|
# define TYPE TFtype
|
# define NAME __powitf2
|
# define NAME __powitf2
|
# endif
|
# endif
|
|
|
#undef int
|
#undef int
|
#undef unsigned
|
#undef unsigned
|
TYPE
|
TYPE
|
NAME (TYPE x, int m)
|
NAME (TYPE x, int m)
|
{
|
{
|
unsigned int n = m < 0 ? -m : m;
|
unsigned int n = m < 0 ? -m : m;
|
TYPE y = n % 2 ? x : 1;
|
TYPE y = n % 2 ? x : 1;
|
while (n >>= 1)
|
while (n >>= 1)
|
{
|
{
|
x = x * x;
|
x = x * x;
|
if (n % 2)
|
if (n % 2)
|
y = y * x;
|
y = y * x;
|
}
|
}
|
return m < 0 ? 1/y : y;
|
return m < 0 ? 1/y : y;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
#if ((defined(L_mulsc3) || defined(L_divsc3)) && LIBGCC2_HAS_SF_MODE) \
|
#if ((defined(L_mulsc3) || defined(L_divsc3)) && LIBGCC2_HAS_SF_MODE) \
|
|| ((defined(L_muldc3) || defined(L_divdc3)) && LIBGCC2_HAS_DF_MODE) \
|
|| ((defined(L_muldc3) || defined(L_divdc3)) && LIBGCC2_HAS_DF_MODE) \
|
|| ((defined(L_mulxc3) || defined(L_divxc3)) && LIBGCC2_HAS_XF_MODE) \
|
|| ((defined(L_mulxc3) || defined(L_divxc3)) && LIBGCC2_HAS_XF_MODE) \
|
|| ((defined(L_multc3) || defined(L_divtc3)) && LIBGCC2_HAS_TF_MODE)
|
|| ((defined(L_multc3) || defined(L_divtc3)) && LIBGCC2_HAS_TF_MODE)
|
|
|
#undef float
|
#undef float
|
#undef double
|
#undef double
|
#undef long
|
#undef long
|
|
|
#if defined(L_mulsc3) || defined(L_divsc3)
|
#if defined(L_mulsc3) || defined(L_divsc3)
|
# define MTYPE SFtype
|
# define MTYPE SFtype
|
# define CTYPE SCtype
|
# define CTYPE SCtype
|
# define MODE sc
|
# define MODE sc
|
# define CEXT f
|
# define CEXT f
|
# define NOTRUNC __FLT_EVAL_METHOD__ == 0
|
# define NOTRUNC __FLT_EVAL_METHOD__ == 0
|
#elif defined(L_muldc3) || defined(L_divdc3)
|
#elif defined(L_muldc3) || defined(L_divdc3)
|
# define MTYPE DFtype
|
# define MTYPE DFtype
|
# define CTYPE DCtype
|
# define CTYPE DCtype
|
# define MODE dc
|
# define MODE dc
|
# if LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 64
|
# if LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 64
|
# define CEXT l
|
# define CEXT l
|
# define NOTRUNC 1
|
# define NOTRUNC 1
|
# else
|
# else
|
# define CEXT
|
# define CEXT
|
# define NOTRUNC __FLT_EVAL_METHOD__ == 0 || __FLT_EVAL_METHOD__ == 1
|
# define NOTRUNC __FLT_EVAL_METHOD__ == 0 || __FLT_EVAL_METHOD__ == 1
|
# endif
|
# endif
|
#elif defined(L_mulxc3) || defined(L_divxc3)
|
#elif defined(L_mulxc3) || defined(L_divxc3)
|
# define MTYPE XFtype
|
# define MTYPE XFtype
|
# define CTYPE XCtype
|
# define CTYPE XCtype
|
# define MODE xc
|
# define MODE xc
|
# define CEXT l
|
# define CEXT l
|
# define NOTRUNC 1
|
# define NOTRUNC 1
|
#elif defined(L_multc3) || defined(L_divtc3)
|
#elif defined(L_multc3) || defined(L_divtc3)
|
# define MTYPE TFtype
|
# define MTYPE TFtype
|
# define CTYPE TCtype
|
# define CTYPE TCtype
|
# define MODE tc
|
# define MODE tc
|
# define CEXT l
|
# define CEXT l
|
# define NOTRUNC 1
|
# define NOTRUNC 1
|
#else
|
#else
|
# error
|
# error
|
#endif
|
#endif
|
|
|
#define CONCAT3(A,B,C) _CONCAT3(A,B,C)
|
#define CONCAT3(A,B,C) _CONCAT3(A,B,C)
|
#define _CONCAT3(A,B,C) A##B##C
|
#define _CONCAT3(A,B,C) A##B##C
|
|
|
#define CONCAT2(A,B) _CONCAT2(A,B)
|
#define CONCAT2(A,B) _CONCAT2(A,B)
|
#define _CONCAT2(A,B) A##B
|
#define _CONCAT2(A,B) A##B
|
|
|
/* All of these would be present in a full C99 implementation of <math.h>
|
/* All of these would be present in a full C99 implementation of <math.h>
|
and <complex.h>. Our problem is that only a few systems have such full
|
and <complex.h>. Our problem is that only a few systems have such full
|
implementations. Further, libgcc_s.so isn't currently linked against
|
implementations. Further, libgcc_s.so isn't currently linked against
|
libm.so, and even for systems that do provide full C99, the extra overhead
|
libm.so, and even for systems that do provide full C99, the extra overhead
|
of all programs using libgcc having to link against libm. So avoid it. */
|
of all programs using libgcc having to link against libm. So avoid it. */
|
|
|
#define isnan(x) __builtin_expect ((x) != (x), 0)
|
#define isnan(x) __builtin_expect ((x) != (x), 0)
|
#define isfinite(x) __builtin_expect (!isnan((x) - (x)), 1)
|
#define isfinite(x) __builtin_expect (!isnan((x) - (x)), 1)
|
#define isinf(x) __builtin_expect (!isnan(x) & !isfinite(x), 0)
|
#define isinf(x) __builtin_expect (!isnan(x) & !isfinite(x), 0)
|
|
|
#define INFINITY CONCAT2(__builtin_inf, CEXT) ()
|
#define INFINITY CONCAT2(__builtin_inf, CEXT) ()
|
#define I 1i
|
#define I 1i
|
|
|
/* Helpers to make the following code slightly less gross. */
|
/* Helpers to make the following code slightly less gross. */
|
#define COPYSIGN CONCAT2(__builtin_copysign, CEXT)
|
#define COPYSIGN CONCAT2(__builtin_copysign, CEXT)
|
#define FABS CONCAT2(__builtin_fabs, CEXT)
|
#define FABS CONCAT2(__builtin_fabs, CEXT)
|
|
|
/* Verify that MTYPE matches up with CEXT. */
|
/* Verify that MTYPE matches up with CEXT. */
|
extern void *compile_type_assert[sizeof(INFINITY) == sizeof(MTYPE) ? 1 : -1];
|
extern void *compile_type_assert[sizeof(INFINITY) == sizeof(MTYPE) ? 1 : -1];
|
|
|
/* Ensure that we've lost any extra precision. */
|
/* Ensure that we've lost any extra precision. */
|
#if NOTRUNC
|
#if NOTRUNC
|
# define TRUNC(x)
|
# define TRUNC(x)
|
#else
|
#else
|
# define TRUNC(x) __asm__ ("" : "=m"(x) : "m"(x))
|
# define TRUNC(x) __asm__ ("" : "=m"(x) : "m"(x))
|
#endif
|
#endif
|
|
|
#if defined(L_mulsc3) || defined(L_muldc3) \
|
#if defined(L_mulsc3) || defined(L_muldc3) \
|
|| defined(L_mulxc3) || defined(L_multc3)
|
|| defined(L_mulxc3) || defined(L_multc3)
|
|
|
CTYPE
|
CTYPE
|
CONCAT3(__mul,MODE,3) (MTYPE a, MTYPE b, MTYPE c, MTYPE d)
|
CONCAT3(__mul,MODE,3) (MTYPE a, MTYPE b, MTYPE c, MTYPE d)
|
{
|
{
|
MTYPE ac, bd, ad, bc, x, y;
|
MTYPE ac, bd, ad, bc, x, y;
|
|
|
ac = a * c;
|
ac = a * c;
|
bd = b * d;
|
bd = b * d;
|
ad = a * d;
|
ad = a * d;
|
bc = b * c;
|
bc = b * c;
|
|
|
TRUNC (ac);
|
TRUNC (ac);
|
TRUNC (bd);
|
TRUNC (bd);
|
TRUNC (ad);
|
TRUNC (ad);
|
TRUNC (bc);
|
TRUNC (bc);
|
|
|
x = ac - bd;
|
x = ac - bd;
|
y = ad + bc;
|
y = ad + bc;
|
|
|
if (isnan (x) && isnan (y))
|
if (isnan (x) && isnan (y))
|
{
|
{
|
/* Recover infinities that computed as NaN + iNaN. */
|
/* Recover infinities that computed as NaN + iNaN. */
|
_Bool recalc = 0;
|
_Bool recalc = 0;
|
if (isinf (a) || isinf (b))
|
if (isinf (a) || isinf (b))
|
{
|
{
|
/* z is infinite. "Box" the infinity and change NaNs in
|
/* z is infinite. "Box" the infinity and change NaNs in
|
the other factor to 0. */
|
the other factor to 0. */
|
a = COPYSIGN (isinf (a) ? 1 : 0, a);
|
a = COPYSIGN (isinf (a) ? 1 : 0, a);
|
b = COPYSIGN (isinf (b) ? 1 : 0, b);
|
b = COPYSIGN (isinf (b) ? 1 : 0, b);
|
if (isnan (c)) c = COPYSIGN (0, c);
|
if (isnan (c)) c = COPYSIGN (0, c);
|
if (isnan (d)) d = COPYSIGN (0, d);
|
if (isnan (d)) d = COPYSIGN (0, d);
|
recalc = 1;
|
recalc = 1;
|
}
|
}
|
if (isinf (c) || isinf (d))
|
if (isinf (c) || isinf (d))
|
{
|
{
|
/* w is infinite. "Box" the infinity and change NaNs in
|
/* w is infinite. "Box" the infinity and change NaNs in
|
the other factor to 0. */
|
the other factor to 0. */
|
c = COPYSIGN (isinf (c) ? 1 : 0, c);
|
c = COPYSIGN (isinf (c) ? 1 : 0, c);
|
d = COPYSIGN (isinf (d) ? 1 : 0, d);
|
d = COPYSIGN (isinf (d) ? 1 : 0, d);
|
if (isnan (a)) a = COPYSIGN (0, a);
|
if (isnan (a)) a = COPYSIGN (0, a);
|
if (isnan (b)) b = COPYSIGN (0, b);
|
if (isnan (b)) b = COPYSIGN (0, b);
|
recalc = 1;
|
recalc = 1;
|
}
|
}
|
if (!recalc
|
if (!recalc
|
&& (isinf (ac) || isinf (bd)
|
&& (isinf (ac) || isinf (bd)
|
|| isinf (ad) || isinf (bc)))
|
|| isinf (ad) || isinf (bc)))
|
{
|
{
|
/* Recover infinities from overflow by changing NaNs to 0. */
|
/* Recover infinities from overflow by changing NaNs to 0. */
|
if (isnan (a)) a = COPYSIGN (0, a);
|
if (isnan (a)) a = COPYSIGN (0, a);
|
if (isnan (b)) b = COPYSIGN (0, b);
|
if (isnan (b)) b = COPYSIGN (0, b);
|
if (isnan (c)) c = COPYSIGN (0, c);
|
if (isnan (c)) c = COPYSIGN (0, c);
|
if (isnan (d)) d = COPYSIGN (0, d);
|
if (isnan (d)) d = COPYSIGN (0, d);
|
recalc = 1;
|
recalc = 1;
|
}
|
}
|
if (recalc)
|
if (recalc)
|
{
|
{
|
x = INFINITY * (a * c - b * d);
|
x = INFINITY * (a * c - b * d);
|
y = INFINITY * (a * d + b * c);
|
y = INFINITY * (a * d + b * c);
|
}
|
}
|
}
|
}
|
|
|
return x + I * y;
|
return x + I * y;
|
}
|
}
|
#endif /* complex multiply */
|
#endif /* complex multiply */
|
|
|
#if defined(L_divsc3) || defined(L_divdc3) \
|
#if defined(L_divsc3) || defined(L_divdc3) \
|
|| defined(L_divxc3) || defined(L_divtc3)
|
|| defined(L_divxc3) || defined(L_divtc3)
|
|
|
CTYPE
|
CTYPE
|
CONCAT3(__div,MODE,3) (MTYPE a, MTYPE b, MTYPE c, MTYPE d)
|
CONCAT3(__div,MODE,3) (MTYPE a, MTYPE b, MTYPE c, MTYPE d)
|
{
|
{
|
MTYPE denom, ratio, x, y;
|
MTYPE denom, ratio, x, y;
|
|
|
/* ??? We can get better behavior from logarithmic scaling instead of
|
/* ??? We can get better behavior from logarithmic scaling instead of
|
the division. But that would mean starting to link libgcc against
|
the division. But that would mean starting to link libgcc against
|
libm. We could implement something akin to ldexp/frexp as gcc builtins
|
libm. We could implement something akin to ldexp/frexp as gcc builtins
|
fairly easily... */
|
fairly easily... */
|
if (FABS (c) < FABS (d))
|
if (FABS (c) < FABS (d))
|
{
|
{
|
ratio = c / d;
|
ratio = c / d;
|
denom = (c * ratio) + d;
|
denom = (c * ratio) + d;
|
x = ((a * ratio) + b) / denom;
|
x = ((a * ratio) + b) / denom;
|
y = ((b * ratio) - a) / denom;
|
y = ((b * ratio) - a) / denom;
|
}
|
}
|
else
|
else
|
{
|
{
|
ratio = d / c;
|
ratio = d / c;
|
denom = (d * ratio) + c;
|
denom = (d * ratio) + c;
|
x = ((b * ratio) + a) / denom;
|
x = ((b * ratio) + a) / denom;
|
y = (b - (a * ratio)) / denom;
|
y = (b - (a * ratio)) / denom;
|
}
|
}
|
|
|
/* Recover infinities and zeros that computed as NaN+iNaN; the only cases
|
/* Recover infinities and zeros that computed as NaN+iNaN; the only cases
|
are nonzero/zero, infinite/finite, and finite/infinite. */
|
are nonzero/zero, infinite/finite, and finite/infinite. */
|
if (isnan (x) && isnan (y))
|
if (isnan (x) && isnan (y))
|
{
|
{
|
if (c == 0.0 && d == 0.0 && (!isnan (a) || !isnan (b)))
|
if (c == 0.0 && d == 0.0 && (!isnan (a) || !isnan (b)))
|
{
|
{
|
x = COPYSIGN (INFINITY, c) * a;
|
x = COPYSIGN (INFINITY, c) * a;
|
y = COPYSIGN (INFINITY, c) * b;
|
y = COPYSIGN (INFINITY, c) * b;
|
}
|
}
|
else if ((isinf (a) || isinf (b)) && isfinite (c) && isfinite (d))
|
else if ((isinf (a) || isinf (b)) && isfinite (c) && isfinite (d))
|
{
|
{
|
a = COPYSIGN (isinf (a) ? 1 : 0, a);
|
a = COPYSIGN (isinf (a) ? 1 : 0, a);
|
b = COPYSIGN (isinf (b) ? 1 : 0, b);
|
b = COPYSIGN (isinf (b) ? 1 : 0, b);
|
x = INFINITY * (a * c + b * d);
|
x = INFINITY * (a * c + b * d);
|
y = INFINITY * (b * c - a * d);
|
y = INFINITY * (b * c - a * d);
|
}
|
}
|
else if ((isinf (c) || isinf (d)) && isfinite (a) && isfinite (b))
|
else if ((isinf (c) || isinf (d)) && isfinite (a) && isfinite (b))
|
{
|
{
|
c = COPYSIGN (isinf (c) ? 1 : 0, c);
|
c = COPYSIGN (isinf (c) ? 1 : 0, c);
|
d = COPYSIGN (isinf (d) ? 1 : 0, d);
|
d = COPYSIGN (isinf (d) ? 1 : 0, d);
|
x = 0.0 * (a * c + b * d);
|
x = 0.0 * (a * c + b * d);
|
y = 0.0 * (b * c - a * d);
|
y = 0.0 * (b * c - a * d);
|
}
|
}
|
}
|
}
|
|
|
return x + I * y;
|
return x + I * y;
|
}
|
}
|
#endif /* complex divide */
|
#endif /* complex divide */
|
|
|
#endif /* all complex float routines */
|
#endif /* all complex float routines */
|
|
|
/* From here on down, the routines use normal data types. */
|
/* From here on down, the routines use normal data types. */
|
|
|
#define SItype bogus_type
|
#define SItype bogus_type
|
#define USItype bogus_type
|
#define USItype bogus_type
|
#define DItype bogus_type
|
#define DItype bogus_type
|
#define UDItype bogus_type
|
#define UDItype bogus_type
|
#define SFtype bogus_type
|
#define SFtype bogus_type
|
#define DFtype bogus_type
|
#define DFtype bogus_type
|
#undef Wtype
|
#undef Wtype
|
#undef UWtype
|
#undef UWtype
|
#undef HWtype
|
#undef HWtype
|
#undef UHWtype
|
#undef UHWtype
|
#undef DWtype
|
#undef DWtype
|
#undef UDWtype
|
#undef UDWtype
|
|
|
#undef char
|
#undef char
|
#undef short
|
#undef short
|
#undef int
|
#undef int
|
#undef long
|
#undef long
|
#undef unsigned
|
#undef unsigned
|
#undef float
|
#undef float
|
#undef double
|
#undef double
|
|
|
#ifdef L__gcc_bcmp
|
#ifdef L__gcc_bcmp
|
|
|
/* Like bcmp except the sign is meaningful.
|
/* Like bcmp except the sign is meaningful.
|
Result is negative if S1 is less than S2,
|
Result is negative if S1 is less than S2,
|
positive if S1 is greater, 0 if S1 and S2 are equal. */
|
positive if S1 is greater, 0 if S1 and S2 are equal. */
|
|
|
int
|
int
|
__gcc_bcmp (const unsigned char *s1, const unsigned char *s2, size_t size)
|
__gcc_bcmp (const unsigned char *s1, const unsigned char *s2, size_t size)
|
{
|
{
|
while (size > 0)
|
while (size > 0)
|
{
|
{
|
const unsigned char c1 = *s1++, c2 = *s2++;
|
const unsigned char c1 = *s1++, c2 = *s2++;
|
if (c1 != c2)
|
if (c1 != c2)
|
return c1 - c2;
|
return c1 - c2;
|
size--;
|
size--;
|
}
|
}
|
return 0;
|
return 0;
|
}
|
}
|
|
|
#endif
|
#endif
|
|
|
/* __eprintf used to be used by GCC's private version of <assert.h>.
|
/* __eprintf used to be used by GCC's private version of <assert.h>.
|
We no longer provide that header, but this routine remains in libgcc.a
|
We no longer provide that header, but this routine remains in libgcc.a
|
for binary backward compatibility. Note that it is not included in
|
for binary backward compatibility. Note that it is not included in
|
the shared version of libgcc. */
|
the shared version of libgcc. */
|
#ifdef L_eprintf
|
#ifdef L_eprintf
|
#ifndef inhibit_libc
|
#ifndef inhibit_libc
|
|
|
#undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
|
#undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
|
#include <stdio.h>
|
#include <stdio.h>
|
|
|
void
|
void
|
__eprintf (const char *string, const char *expression,
|
__eprintf (const char *string, const char *expression,
|
unsigned int line, const char *filename)
|
unsigned int line, const char *filename)
|
{
|
{
|
fprintf (stderr, string, expression, line, filename);
|
fprintf (stderr, string, expression, line, filename);
|
fflush (stderr);
|
fflush (stderr);
|
abort ();
|
abort ();
|
}
|
}
|
|
|
#endif
|
#endif
|
#endif
|
#endif
|
|
|
|
|
#ifdef L_clear_cache
|
#ifdef L_clear_cache
|
/* Clear part of an instruction cache. */
|
/* Clear part of an instruction cache. */
|
|
|
void
|
void
|
__clear_cache (char *beg __attribute__((__unused__)),
|
__clear_cache (char *beg __attribute__((__unused__)),
|
char *end __attribute__((__unused__)))
|
char *end __attribute__((__unused__)))
|
{
|
{
|
#ifdef CLEAR_INSN_CACHE
|
#ifdef CLEAR_INSN_CACHE
|
CLEAR_INSN_CACHE (beg, end);
|
CLEAR_INSN_CACHE (beg, end);
|
#endif /* CLEAR_INSN_CACHE */
|
#endif /* CLEAR_INSN_CACHE */
|
}
|
}
|
|
|
#endif /* L_clear_cache */
|
#endif /* L_clear_cache */
|
|
|
#ifdef L_enable_execute_stack
|
#ifdef L_enable_execute_stack
|
/* Attempt to turn on execute permission for the stack. */
|
/* Attempt to turn on execute permission for the stack. */
|
|
|
#ifdef ENABLE_EXECUTE_STACK
|
#ifdef ENABLE_EXECUTE_STACK
|
ENABLE_EXECUTE_STACK
|
ENABLE_EXECUTE_STACK
|
#else
|
#else
|
void
|
void
|
__enable_execute_stack (void *addr __attribute__((__unused__)))
|
__enable_execute_stack (void *addr __attribute__((__unused__)))
|
{}
|
{}
|
#endif /* ENABLE_EXECUTE_STACK */
|
#endif /* ENABLE_EXECUTE_STACK */
|
|
|
#endif /* L_enable_execute_stack */
|
#endif /* L_enable_execute_stack */
|
|
|
#ifdef L_trampoline
|
#ifdef L_trampoline
|
|
|
/* Jump to a trampoline, loading the static chain address. */
|
/* Jump to a trampoline, loading the static chain address. */
|
|
|
#if defined(WINNT) && ! defined(__CYGWIN__) && ! defined (_UWIN)
|
#if defined(WINNT) && ! defined(__CYGWIN__) && ! defined (_UWIN)
|
|
|
int
|
int
|
getpagesize (void)
|
getpagesize (void)
|
{
|
{
|
#ifdef _ALPHA_
|
#ifdef _ALPHA_
|
return 8192;
|
return 8192;
|
#else
|
#else
|
return 4096;
|
return 4096;
|
#endif
|
#endif
|
}
|
}
|
|
|
#ifdef __i386__
|
#ifdef __i386__
|
extern int VirtualProtect (char *, int, int, int *) __attribute__((stdcall));
|
extern int VirtualProtect (char *, int, int, int *) __attribute__((stdcall));
|
#endif
|
#endif
|
|
|
int
|
int
|
mprotect (char *addr, int len, int prot)
|
mprotect (char *addr, int len, int prot)
|
{
|
{
|
int np, op;
|
int np, op;
|
|
|
if (prot == 7)
|
if (prot == 7)
|
np = 0x40;
|
np = 0x40;
|
else if (prot == 5)
|
else if (prot == 5)
|
np = 0x20;
|
np = 0x20;
|
else if (prot == 4)
|
else if (prot == 4)
|
np = 0x10;
|
np = 0x10;
|
else if (prot == 3)
|
else if (prot == 3)
|
np = 0x04;
|
np = 0x04;
|
else if (prot == 1)
|
else if (prot == 1)
|
np = 0x02;
|
np = 0x02;
|
else if (prot == 0)
|
else if (prot == 0)
|
np = 0x01;
|
np = 0x01;
|
|
|
if (VirtualProtect (addr, len, np, &op))
|
if (VirtualProtect (addr, len, np, &op))
|
return 0;
|
return 0;
|
else
|
else
|
return -1;
|
return -1;
|
}
|
}
|
|
|
#endif /* WINNT && ! __CYGWIN__ && ! _UWIN */
|
#endif /* WINNT && ! __CYGWIN__ && ! _UWIN */
|
|
|
#ifdef TRANSFER_FROM_TRAMPOLINE
|
#ifdef TRANSFER_FROM_TRAMPOLINE
|
TRANSFER_FROM_TRAMPOLINE
|
TRANSFER_FROM_TRAMPOLINE
|
#endif
|
#endif
|
#endif /* L_trampoline */
|
#endif /* L_trampoline */
|
|
|
#ifndef __CYGWIN__
|
#ifndef __CYGWIN__
|
#ifdef L__main
|
#ifdef L__main
|
|
|
#include "gbl-ctors.h"
|
#include "gbl-ctors.h"
|
|
|
/* Some systems use __main in a way incompatible with its use in gcc, in these
|
/* Some systems use __main in a way incompatible with its use in gcc, in these
|
cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
|
cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
|
give the same symbol without quotes for an alternative entry point. You
|
give the same symbol without quotes for an alternative entry point. You
|
must define both, or neither. */
|
must define both, or neither. */
|
#ifndef NAME__MAIN
|
#ifndef NAME__MAIN
|
#define NAME__MAIN "__main"
|
#define NAME__MAIN "__main"
|
#define SYMBOL__MAIN __main
|
#define SYMBOL__MAIN __main
|
#endif
|
#endif
|
|
|
#if defined (INIT_SECTION_ASM_OP) || defined (INIT_ARRAY_SECTION_ASM_OP)
|
#if defined (INIT_SECTION_ASM_OP) || defined (INIT_ARRAY_SECTION_ASM_OP)
|
#undef HAS_INIT_SECTION
|
#undef HAS_INIT_SECTION
|
#define HAS_INIT_SECTION
|
#define HAS_INIT_SECTION
|
#endif
|
#endif
|
|
|
#if !defined (HAS_INIT_SECTION) || !defined (OBJECT_FORMAT_ELF)
|
#if !defined (HAS_INIT_SECTION) || !defined (OBJECT_FORMAT_ELF)
|
|
|
/* Some ELF crosses use crtstuff.c to provide __CTOR_LIST__, but use this
|
/* Some ELF crosses use crtstuff.c to provide __CTOR_LIST__, but use this
|
code to run constructors. In that case, we need to handle EH here, too. */
|
code to run constructors. In that case, we need to handle EH here, too. */
|
|
|
#ifdef EH_FRAME_SECTION_NAME
|
#ifdef EH_FRAME_SECTION_NAME
|
#include "unwind-dw2-fde.h"
|
#include "unwind-dw2-fde.h"
|
extern unsigned char __EH_FRAME_BEGIN__[];
|
extern unsigned char __EH_FRAME_BEGIN__[];
|
#endif
|
#endif
|
|
|
/* Run all the global destructors on exit from the program. */
|
/* Run all the global destructors on exit from the program. */
|
|
|
void
|
void
|
__do_global_dtors (void)
|
__do_global_dtors (void)
|
{
|
{
|
#ifdef DO_GLOBAL_DTORS_BODY
|
#ifdef DO_GLOBAL_DTORS_BODY
|
DO_GLOBAL_DTORS_BODY;
|
DO_GLOBAL_DTORS_BODY;
|
#else
|
#else
|
static func_ptr *p = __DTOR_LIST__ + 1;
|
static func_ptr *p = __DTOR_LIST__ + 1;
|
while (*p)
|
while (*p)
|
{
|
{
|
p++;
|
p++;
|
(*(p-1)) ();
|
(*(p-1)) ();
|
}
|
}
|
#endif
|
#endif
|
#if defined (EH_FRAME_SECTION_NAME) && !defined (HAS_INIT_SECTION)
|
#if defined (EH_FRAME_SECTION_NAME) && !defined (HAS_INIT_SECTION)
|
{
|
{
|
static int completed = 0;
|
static int completed = 0;
|
if (! completed)
|
if (! completed)
|
{
|
{
|
completed = 1;
|
completed = 1;
|
__deregister_frame_info (__EH_FRAME_BEGIN__);
|
__deregister_frame_info (__EH_FRAME_BEGIN__);
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
}
|
}
|
#endif
|
#endif
|
|
|
#ifndef HAS_INIT_SECTION
|
#ifndef HAS_INIT_SECTION
|
/* Run all the global constructors on entry to the program. */
|
/* Run all the global constructors on entry to the program. */
|
|
|
void
|
void
|
__do_global_ctors (void)
|
__do_global_ctors (void)
|
{
|
{
|
#ifdef EH_FRAME_SECTION_NAME
|
#ifdef EH_FRAME_SECTION_NAME
|
{
|
{
|
static struct object object;
|
static struct object object;
|
__register_frame_info (__EH_FRAME_BEGIN__, &object);
|
__register_frame_info (__EH_FRAME_BEGIN__, &object);
|
}
|
}
|
#endif
|
#endif
|
DO_GLOBAL_CTORS_BODY;
|
DO_GLOBAL_CTORS_BODY;
|
atexit (__do_global_dtors);
|
atexit (__do_global_dtors);
|
}
|
}
|
#endif /* no HAS_INIT_SECTION */
|
#endif /* no HAS_INIT_SECTION */
|
|
|
#if !defined (HAS_INIT_SECTION) || defined (INVOKE__main)
|
#if !defined (HAS_INIT_SECTION) || defined (INVOKE__main)
|
/* Subroutine called automatically by `main'.
|
/* Subroutine called automatically by `main'.
|
Compiling a global function named `main'
|
Compiling a global function named `main'
|
produces an automatic call to this function at the beginning.
|
produces an automatic call to this function at the beginning.
|
|
|
For many systems, this routine calls __do_global_ctors.
|
For many systems, this routine calls __do_global_ctors.
|
For systems which support a .init section we use the .init section
|
For systems which support a .init section we use the .init section
|
to run __do_global_ctors, so we need not do anything here. */
|
to run __do_global_ctors, so we need not do anything here. */
|
|
|
extern void SYMBOL__MAIN (void);
|
extern void SYMBOL__MAIN (void);
|
void
|
void
|
SYMBOL__MAIN (void)
|
SYMBOL__MAIN (void)
|
{
|
{
|
/* Support recursive calls to `main': run initializers just once. */
|
/* Support recursive calls to `main': run initializers just once. */
|
static int initialized;
|
static int initialized;
|
if (! initialized)
|
if (! initialized)
|
{
|
{
|
initialized = 1;
|
initialized = 1;
|
__do_global_ctors ();
|
__do_global_ctors ();
|
}
|
}
|
}
|
}
|
#endif /* no HAS_INIT_SECTION or INVOKE__main */
|
#endif /* no HAS_INIT_SECTION or INVOKE__main */
|
|
|
#endif /* L__main */
|
#endif /* L__main */
|
#endif /* __CYGWIN__ */
|
#endif /* __CYGWIN__ */
|
|
|
#ifdef L_ctors
|
#ifdef L_ctors
|
|
|
#include "gbl-ctors.h"
|
#include "gbl-ctors.h"
|
|
|
/* Provide default definitions for the lists of constructors and
|
/* Provide default definitions for the lists of constructors and
|
destructors, so that we don't get linker errors. These symbols are
|
destructors, so that we don't get linker errors. These symbols are
|
intentionally bss symbols, so that gld and/or collect will provide
|
intentionally bss symbols, so that gld and/or collect will provide
|
the right values. */
|
the right values. */
|
|
|
/* We declare the lists here with two elements each,
|
/* We declare the lists here with two elements each,
|
so that they are valid empty lists if no other definition is loaded.
|
so that they are valid empty lists if no other definition is loaded.
|
|
|
If we are using the old "set" extensions to have the gnu linker
|
If we are using the old "set" extensions to have the gnu linker
|
collect ctors and dtors, then we __CTOR_LIST__ and __DTOR_LIST__
|
collect ctors and dtors, then we __CTOR_LIST__ and __DTOR_LIST__
|
must be in the bss/common section.
|
must be in the bss/common section.
|
|
|
Long term no port should use those extensions. But many still do. */
|
Long term no port should use those extensions. But many still do. */
|
#if !defined(INIT_SECTION_ASM_OP) && !defined(CTOR_LISTS_DEFINED_EXTERNALLY)
|
#if !defined(INIT_SECTION_ASM_OP) && !defined(CTOR_LISTS_DEFINED_EXTERNALLY)
|
#if defined (TARGET_ASM_CONSTRUCTOR) || defined (USE_COLLECT2)
|
#if defined (TARGET_ASM_CONSTRUCTOR) || defined (USE_COLLECT2)
|
func_ptr __CTOR_LIST__[2] = {0, 0};
|
func_ptr __CTOR_LIST__[2] = {0, 0};
|
func_ptr __DTOR_LIST__[2] = {0, 0};
|
func_ptr __DTOR_LIST__[2] = {0, 0};
|
#else
|
#else
|
func_ptr __CTOR_LIST__[2];
|
func_ptr __CTOR_LIST__[2];
|
func_ptr __DTOR_LIST__[2];
|
func_ptr __DTOR_LIST__[2];
|
#endif
|
#endif
|
#endif /* no INIT_SECTION_ASM_OP and not CTOR_LISTS_DEFINED_EXTERNALLY */
|
#endif /* no INIT_SECTION_ASM_OP and not CTOR_LISTS_DEFINED_EXTERNALLY */
|
#endif /* L_ctors */
|
#endif /* L_ctors */
|
#endif /* LIBGCC2_UNITS_PER_WORD <= MIN_UNITS_PER_WORD */
|
#endif /* LIBGCC2_UNITS_PER_WORD <= MIN_UNITS_PER_WORD */
|
|
|
