compiler_builtins.hpp File Reference

#include <cstdint>
#include <softfloat.hpp>

Include dependency graph for compiler_builtins.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
__int128	___fixdfti (uint64_t)
__int128	___fixsfti (uint32_t)
__int128	___fixtfti (float128_t)
unsigned __int128	___fixunsdfti (uint64_t)
unsigned __int128	___fixunssfti (uint32_t)
unsigned __int128	___fixunstfti (float128_t)
double	___floattidf (__int128)
double	___floatuntidf (unsigned __int128)

Function Documentation

___fixdfti()

__int128 ___fixdfti

(

uint64_t

a

)

Definition at line 16 of file fixdfti.c.

                                {
    const fixint_t fixint_max = (fixint_t)((~(fixuint_t)0) / 2);
    const fixint_t fixint_min = -fixint_max - 1;
    // Break a into sign, exponent, significand
    const rep_t aRep = a;
    const rep_t aAbs = aRep & absMask;
    const fixint_t sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const rep_t significand = (aAbs & significandMask) | implicitBit;
 
    // If exponent is negative, the result is zero.
    if (exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(fixint_t) * CHAR_BIT)
        return sign == 1 ? fixint_max : fixint_min;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return sign * (significand >> (significandBits - exponent));
    else
        return sign * ((fixint_t)significand << (exponent - significandBits));
 
}

Here is the caller graph for this function:

___fixsfti()

__int128 ___fixsfti

(

uint32_t

a

)

Definition at line 16 of file fixsfti.c.

                                {
    const fixint_t fixint_max = (fixint_t)((~(fixuint_t)0) / 2);
    const fixint_t fixint_min = -fixint_max - 1;
    // Break a into sign, exponent, significand
    const rep_t aRep = a;
    const rep_t aAbs = aRep & absMask;
    const fixint_t sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const rep_t significand = (aAbs & significandMask) | implicitBit;
 
    // If exponent is negative, the result is zero.
    if (exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(fixint_t) * CHAR_BIT)
        return sign == 1 ? fixint_max : fixint_min;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return sign * (significand >> (significandBits - exponent));
    else
        return sign * ((fixint_t)significand << (exponent - significandBits));
}

Here is the caller graph for this function:

___fixtfti()

__int128 ___fixtfti

(

float128_t

a

)

Definition at line 13 of file fixtfti.c.

                                   {
    const __int128 fixint_max = (__int128)((~(unsigned __int128)0) / 2);
    const __int128 fixint_min = -fixint_max - 1;
    // Break a into sign, exponent, significand
    const __int128 aRep = toRep(a);
    const __int128 aAbs = aRep & absMask;
    const __int128 sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const __int128 significand = (aAbs & significandMask) | implicitBit;
 
    // If exponent is negative, the result is zero.
    if (exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(__int128) * CHAR_BIT)
        return sign == 1 ? fixint_max : fixint_min;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return sign * (significand >> (significandBits - exponent));
    else
        return sign * ((__int128)significand << (exponent - significandBits));
}

Here is the caller graph for this function:

___fixunsdfti()

unsigned __int128 ___fixunsdfti

(

uint64_t

a

)

Definition at line 15 of file fixunsdfti.c.

                                    {
    // Break a into sign, exponent, significand
    const rep_t aRep = a;
    const rep_t aAbs = aRep & absMask;
    const int sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const rep_t significand = (aAbs & significandMask) | implicitBit;
 
    // If either the value or the exponent is negative, the result is zero.
    if (sign == -1 || exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(fixuint_t) * CHAR_BIT)
        return ~(fixuint_t)0;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return significand >> (significandBits - exponent);
    else
        return (fixuint_t)significand << (exponent - significandBits);
}

Here is the caller graph for this function:

___fixunssfti()

unsigned __int128 ___fixunssfti

(

uint32_t

a

)

Definition at line 19 of file fixunssfti.c.

                                    {
    // Break a into sign, exponent, significand
    const rep_t aRep = a;
    const rep_t aAbs = aRep & absMask;
    const int sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const rep_t significand = (aAbs & significandMask) | implicitBit;
 
    // If either the value or the exponent is negative, the result is zero.
    if (sign == -1 || exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(fixuint_t) * CHAR_BIT)
        return ~(fixuint_t)0;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return significand >> (significandBits - exponent);
    else
        return (fixuint_t)significand << (exponent - significandBits);
}

Here is the caller graph for this function:

___fixunstfti()

unsigned __int128 ___fixunstfti

(

float128_t

a

)

Definition at line 18 of file fixunstfti.c.

                             {
    // Break a into sign, exponent, significand
    const rep_t aRep = toRep(a);
    const rep_t aAbs = aRep & absMask;
    const int sign = aRep & signBit ? -1 : 1;
    const int exponent = (aAbs >> significandBits) - exponentBias;
    const rep_t significand = (aAbs & significandMask) | implicitBit;
 
    // If either the value or the exponent is negative, the result is zero.
    if (sign == -1 || exponent < 0)
        return 0;
 
    // If the value is too large for the integer type, saturate.
    if ((unsigned)exponent >= sizeof(fixuint_t) * CHAR_BIT)
        return ~(fixuint_t)0;
 
    // If 0 <= exponent < significandBits, right shift to get the result.
    // Otherwise, shift left.
    if (exponent < significandBits)
        return significand >> (significandBits - exponent);
    else
        return (fixuint_t)significand << (exponent - significandBits);
}

Here is the caller graph for this function:

___floattidf()

double ___floattidf

(

__int128

a

)

Definition at line 26 of file floattidf.c.

{
    if (a == 0)
        return 0.0;
    const unsigned N = sizeof(ti_int) * CHAR_BIT;
    const ti_int s = a >> (N-1);
    a = (a ^ s) - s;
    int sd = N - __clzti2(a);  /* number of significant digits */
    int e = sd - 1;             /* exponent */
    if (sd > DBL_MANT_DIG)
    {
        /* start:  0000000000000000000001xxxxxxxxxxxxxxxxxxxxxxPQxxxxxxxxxxxxxxxxxx
         *  finish: 000000000000000000000000000000000000001xxxxxxxxxxxxxxxxxxxxxxPQR
         *                                               12345678901234567890123456
         * 1 = msb 1 bit
         * P = bit DBL_MANT_DIG-1 bits to the right of 1
         * Q = bit DBL_MANT_DIG bits to the right of 1
         * R = "or" of all bits to the right of Q
         */
        switch (sd)
        {
        case DBL_MANT_DIG + 1:
            a <<= 1;
            break;
        case DBL_MANT_DIG + 2:
            break;
        default:
            a = ((tu_int)a >> (sd - (DBL_MANT_DIG+2))) |
                ((a & ((tu_int)(-1) >> ((N + DBL_MANT_DIG+2) - sd))) != 0);
        };
        /* finish: */
        a |= (a & 4) != 0;  /* Or P into R */
        ++a;  /* round - this step may add a significant bit */
        a >>= 2;  /* dump Q and R */
        /* a is now rounded to DBL_MANT_DIG or DBL_MANT_DIG+1 bits */
        if (a & ((tu_int)1 << DBL_MANT_DIG))
        {
            a >>= 1;
            ++e;
        }
        /* a is now rounded to DBL_MANT_DIG bits */
    }
    else
    {
        a <<= (DBL_MANT_DIG - sd);
        /* a is now rounded to DBL_MANT_DIG bits */
    }
    double_bits fb;
    fb.u.s.high = ((uint32_t)s & 0x80000000) |        /* sign */
                ((e + 1023) << 20)      |        /* exponent */
                ((uint32_t)(a >> 32) & 0x000FFFFF); /* mantissa-high */
    fb.u.s.low = (uint32_t)a;                         /* mantissa-low */
    return fb.f;
}

Here is the call graph for this function:

Here is the caller graph for this function:

___floatuntidf()

double ___floatuntidf

(

unsigned

__int128

)

Here is the caller graph for this function: