mirror of
https://github.com/opnsense/src.git
synced 2026-02-12 23:36:07 -05:00
ef8821e5db
It seems there have only been a small amount to the compiler-rt source code in the mean time. I'd rather have the code in sync as much as possible by the time we release 9.0. Changes: - The libcompiler_rt library is now dual licensed under both the University of Illinois "BSD-Like" license and the MIT license. - Our local modifications for using .hidden instead of .private_extern have been upstreamed, meaning our changes to lib/assembly.h can now be reverted. - A possible endless recursion in __modsi3() has been fixed. - Support for ARM EABI has been added, but it has no effect on FreeBSD (yet). - The functions __udivmodsi4 and __divmodsi4 have been added. Requested by: many, including bf@ and Pedro Giffuni
50 lines
1.6 KiB
C
50 lines
1.6 KiB
C
//===-- lib/floatunsisf.c - uint -> single-precision conversion ---*- C -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements unsigned integer to single-precision conversion for the
|
|
// compiler-rt library in the IEEE-754 default round-to-nearest, ties-to-even
|
|
// mode.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
#include "abi.h"
|
|
|
|
#define SINGLE_PRECISION
|
|
#include "fp_lib.h"
|
|
|
|
#include "int_lib.h"
|
|
|
|
ARM_EABI_FNALIAS(ui2f, floatunsisf);
|
|
|
|
fp_t __floatunsisf(unsigned int a) {
|
|
|
|
const int aWidth = sizeof a * CHAR_BIT;
|
|
|
|
// Handle zero as a special case to protect clz
|
|
if (a == 0) return fromRep(0);
|
|
|
|
// Exponent of (fp_t)a is the width of abs(a).
|
|
const int exponent = (aWidth - 1) - __builtin_clz(a);
|
|
rep_t result;
|
|
|
|
// Shift a into the significand field, rounding if it is a right-shift
|
|
if (exponent <= significandBits) {
|
|
const int shift = significandBits - exponent;
|
|
result = (rep_t)a << shift ^ implicitBit;
|
|
} else {
|
|
const int shift = exponent - significandBits;
|
|
result = (rep_t)a >> shift ^ implicitBit;
|
|
rep_t round = (rep_t)a << (typeWidth - shift);
|
|
if (round > signBit) result++;
|
|
if (round == signBit) result += result & 1;
|
|
}
|
|
|
|
// Insert the exponent
|
|
result += (rep_t)(exponent + exponentBias) << significandBits;
|
|
return fromRep(result);
|
|
}
|