mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-22 21:15:44 +07:00
9d5a634946
Based on 1 normalized pattern(s): this program is free software you can distribute it and or modify it under the terms of the gnu general public license version 2 as published by the free software foundation this program is distributed in the hope it will be useful but without any warranty without even the implied warranty of merchantability or fitness for a particular purpose see the gnu general public license for more details you should have received a copy of the gnu general public license along with this program if not write to the free software foundation inc 51 franklin st fifth floor boston ma 02110 1301 usa extracted by the scancode license scanner the SPDX license identifier GPL-2.0-only has been chosen to replace the boilerplate/reference in 33 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Richard Fontana <rfontana@redhat.com> Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190531081038.563233189@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
45 lines
820 B
C
45 lines
820 B
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
/* IEEE754 floating point arithmetic
|
|
* double precision: common utilities
|
|
*/
|
|
/*
|
|
* MIPS floating point support
|
|
* Copyright (C) 1994-2000 Algorithmics Ltd.
|
|
*/
|
|
|
|
#include "ieee754dp.h"
|
|
|
|
union ieee754dp ieee754dp_fint(int x)
|
|
{
|
|
u64 xm;
|
|
int xe;
|
|
int xs;
|
|
|
|
ieee754_clearcx();
|
|
|
|
if (x == 0)
|
|
return ieee754dp_zero(0);
|
|
if (x == 1 || x == -1)
|
|
return ieee754dp_one(x < 0);
|
|
if (x == 10 || x == -10)
|
|
return ieee754dp_ten(x < 0);
|
|
|
|
xs = (x < 0);
|
|
if (xs) {
|
|
if (x == (1 << 31))
|
|
xm = ((unsigned) 1 << 31); /* max neg can't be safely negated */
|
|
else
|
|
xm = -x;
|
|
} else {
|
|
xm = x;
|
|
}
|
|
|
|
/* normalize - result can never be inexact or overflow */
|
|
xe = DP_FBITS;
|
|
while ((xm >> DP_FBITS) == 0) {
|
|
xm <<= 1;
|
|
xe--;
|
|
}
|
|
return builddp(xs, xe + DP_EBIAS, xm & ~DP_HIDDEN_BIT);
|
|
}
|