mirror of
https://github.com/brain-hackers/linux-brain.git
synced 2024-06-09 15:26:21 +09: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>
78 lines
1.7 KiB
C
78 lines
1.7 KiB
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
/*
|
|
* IEEE754 floating point
|
|
* double precision internal header file
|
|
*/
|
|
/*
|
|
* MIPS floating point support
|
|
* Copyright (C) 1994-2000 Algorithmics Ltd.
|
|
*/
|
|
|
|
#include <linux/compiler.h>
|
|
|
|
#include "ieee754int.h"
|
|
|
|
#define assert(expr) ((void)0)
|
|
|
|
#define SP_EBIAS 127
|
|
#define SP_EMIN (-126)
|
|
#define SP_EMAX 127
|
|
#define SP_FBITS 23
|
|
#define SP_MBITS 23
|
|
|
|
#define SP_MBIT(x) ((u32)1 << (x))
|
|
#define SP_HIDDEN_BIT SP_MBIT(SP_FBITS)
|
|
#define SP_SIGN_BIT SP_MBIT(31)
|
|
|
|
#define SPSIGN(sp) (sp.sign)
|
|
#define SPBEXP(sp) (sp.bexp)
|
|
#define SPMANT(sp) (sp.mant)
|
|
|
|
static inline int ieee754sp_finite(union ieee754sp x)
|
|
{
|
|
return SPBEXP(x) != SP_EMAX + 1 + SP_EBIAS;
|
|
}
|
|
|
|
/* 64 bit right shift with rounding */
|
|
#define XSPSRS64(v, rs) \
|
|
(((rs) >= 64) ? ((v) != 0) : ((v) >> (rs)) | ((v) << (64-(rs)) != 0))
|
|
|
|
/* 3bit extended single precision sticky right shift */
|
|
#define XSPSRS(v, rs) \
|
|
((rs > (SP_FBITS+3))?1:((v) >> (rs)) | ((v) << (32-(rs)) != 0))
|
|
|
|
#define XSPSRS1(m) \
|
|
((m >> 1) | (m & 1))
|
|
|
|
#define SPXSRSX1() \
|
|
(xe++, (xm = XSPSRS1(xm)))
|
|
|
|
#define SPXSRSY1() \
|
|
(ye++, (ym = XSPSRS1(ym)))
|
|
|
|
/* convert denormal to normalized with extended exponent */
|
|
#define SPDNORMx(m,e) \
|
|
while ((m >> SP_FBITS) == 0) { m <<= 1; e--; }
|
|
#define SPDNORMX SPDNORMx(xm, xe)
|
|
#define SPDNORMY SPDNORMx(ym, ye)
|
|
#define SPDNORMZ SPDNORMx(zm, ze)
|
|
|
|
static inline union ieee754sp buildsp(int s, int bx, unsigned int m)
|
|
{
|
|
union ieee754sp r;
|
|
|
|
assert((s) == 0 || (s) == 1);
|
|
assert((bx) >= SP_EMIN - 1 + SP_EBIAS
|
|
&& (bx) <= SP_EMAX + 1 + SP_EBIAS);
|
|
assert(((m) >> SP_FBITS) == 0);
|
|
|
|
r.sign = s;
|
|
r.bexp = bx;
|
|
r.mant = m;
|
|
|
|
return r;
|
|
}
|
|
|
|
extern union ieee754sp __cold ieee754sp_nanxcpt(union ieee754sp);
|
|
extern union ieee754sp ieee754sp_format(int, int, unsigned);
|