1999-12-30 02:11:48 +08:00
|
|
|
/* Software floating-point emulation.
|
|
|
|
Basic eight-word fraction declaration and manipulation.
|
2016-01-05 00:05:18 +08:00
|
|
|
Copyright (C) 1997-2016 Free Software Foundation, Inc.
|
1999-12-30 02:11:48 +08:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
Contributed by Richard Henderson (rth@cygnus.com),
|
|
|
|
Jakub Jelinek (jj@ultra.linux.cz) and
|
|
|
|
Peter Maydell (pmaydell@chiark.greenend.org.uk).
|
2001-07-06 12:58:11 +08:00
|
|
|
|
1999-12-30 02:11:48 +08:00
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
2001-07-06 12:58:11 +08:00
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2.1 of the License, or (at your option) any later version.
|
1999-12-30 02:11:48 +08:00
|
|
|
|
2006-04-04 16:25:52 +08:00
|
|
|
In addition to the permissions in the GNU Lesser General Public
|
|
|
|
License, the Free Software Foundation gives you unlimited
|
|
|
|
permission to link the compiled version of this file into
|
|
|
|
combinations with other programs, and to distribute those
|
|
|
|
combinations without any restriction coming from the use of this
|
|
|
|
file. (The Lesser General Public License restrictions do apply in
|
|
|
|
other respects; for example, they cover modification of the file,
|
|
|
|
and distribution when not linked into a combine executable.)
|
|
|
|
|
1999-12-30 02:11:48 +08:00
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2001-07-06 12:58:11 +08:00
|
|
|
Lesser General Public License for more details.
|
1999-12-30 02:11:48 +08:00
|
|
|
|
2001-07-06 12:58:11 +08:00
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-10 07:18:22 +08:00
|
|
|
License along with the GNU C Library; if not, see
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
1999-12-30 02:11:48 +08:00
|
|
|
|
2015-03-10 08:32:29 +08:00
|
|
|
#ifndef SOFT_FP_OP_8_H
|
|
|
|
#define SOFT_FP_OP_8_H 1
|
|
|
|
|
1999-12-30 02:11:48 +08:00
|
|
|
/* We need just a few things from here for op-4, if we ever need some
|
2014-09-18 06:20:45 +08:00
|
|
|
other macros, they can be added. */
|
1999-12-30 02:11:48 +08:00
|
|
|
#define _FP_FRAC_DECL_8(X) _FP_W_TYPE X##_f[8]
|
|
|
|
#define _FP_FRAC_HIGH_8(X) (X##_f[7])
|
|
|
|
#define _FP_FRAC_LOW_8(X) (X##_f[0])
|
2013-10-16 09:22:21 +08:00
|
|
|
#define _FP_FRAC_WORD_8(X, w) (X##_f[w])
|
1999-12-30 02:11:48 +08:00
|
|
|
|
2014-07-01 01:37:10 +08:00
|
|
|
#define _FP_FRAC_SLL_8(X, N) \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
_FP_I_TYPE _FP_FRAC_SLL_8_up, _FP_FRAC_SLL_8_down; \
|
|
|
|
_FP_I_TYPE _FP_FRAC_SLL_8_skip, _FP_FRAC_SLL_8_i; \
|
|
|
|
_FP_FRAC_SLL_8_skip = (N) / _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SLL_8_up = (N) % _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SLL_8_down = _FP_W_TYPE_SIZE - _FP_FRAC_SLL_8_up; \
|
|
|
|
if (!_FP_FRAC_SLL_8_up) \
|
|
|
|
for (_FP_FRAC_SLL_8_i = 7; \
|
|
|
|
_FP_FRAC_SLL_8_i >= _FP_FRAC_SLL_8_skip; \
|
|
|
|
--_FP_FRAC_SLL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SLL_8_i] \
|
|
|
|
= X##_f[_FP_FRAC_SLL_8_i-_FP_FRAC_SLL_8_skip]; \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
for (_FP_FRAC_SLL_8_i = 7; \
|
|
|
|
_FP_FRAC_SLL_8_i > _FP_FRAC_SLL_8_skip; \
|
|
|
|
--_FP_FRAC_SLL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SLL_8_i] \
|
|
|
|
= ((X##_f[_FP_FRAC_SLL_8_i-_FP_FRAC_SLL_8_skip] \
|
|
|
|
<< _FP_FRAC_SLL_8_up) \
|
|
|
|
| (X##_f[_FP_FRAC_SLL_8_i-_FP_FRAC_SLL_8_skip-1] \
|
|
|
|
>> _FP_FRAC_SLL_8_down)); \
|
|
|
|
X##_f[_FP_FRAC_SLL_8_i--] = X##_f[0] << _FP_FRAC_SLL_8_up; \
|
|
|
|
} \
|
|
|
|
for (; _FP_FRAC_SLL_8_i >= 0; --_FP_FRAC_SLL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SLL_8_i] = 0; \
|
|
|
|
} \
|
2013-10-15 08:17:35 +08:00
|
|
|
while (0)
|
1999-12-30 02:11:48 +08:00
|
|
|
|
2014-07-01 01:37:10 +08:00
|
|
|
#define _FP_FRAC_SRL_8(X, N) \
|
|
|
|
do \
|
|
|
|
{ \
|
|
|
|
_FP_I_TYPE _FP_FRAC_SRL_8_up, _FP_FRAC_SRL_8_down; \
|
|
|
|
_FP_I_TYPE _FP_FRAC_SRL_8_skip, _FP_FRAC_SRL_8_i; \
|
|
|
|
_FP_FRAC_SRL_8_skip = (N) / _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SRL_8_down = (N) % _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SRL_8_up = _FP_W_TYPE_SIZE - _FP_FRAC_SRL_8_down; \
|
|
|
|
if (!_FP_FRAC_SRL_8_down) \
|
|
|
|
for (_FP_FRAC_SRL_8_i = 0; \
|
|
|
|
_FP_FRAC_SRL_8_i <= 7-_FP_FRAC_SRL_8_skip; \
|
|
|
|
++_FP_FRAC_SRL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRL_8_i] \
|
|
|
|
= X##_f[_FP_FRAC_SRL_8_i+_FP_FRAC_SRL_8_skip]; \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
for (_FP_FRAC_SRL_8_i = 0; \
|
|
|
|
_FP_FRAC_SRL_8_i < 7-_FP_FRAC_SRL_8_skip; \
|
|
|
|
++_FP_FRAC_SRL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRL_8_i] \
|
|
|
|
= ((X##_f[_FP_FRAC_SRL_8_i+_FP_FRAC_SRL_8_skip] \
|
|
|
|
>> _FP_FRAC_SRL_8_down) \
|
|
|
|
| (X##_f[_FP_FRAC_SRL_8_i+_FP_FRAC_SRL_8_skip+1] \
|
|
|
|
<< _FP_FRAC_SRL_8_up)); \
|
|
|
|
X##_f[_FP_FRAC_SRL_8_i++] = X##_f[7] >> _FP_FRAC_SRL_8_down; \
|
|
|
|
} \
|
|
|
|
for (; _FP_FRAC_SRL_8_i < 8; ++_FP_FRAC_SRL_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRL_8_i] = 0; \
|
|
|
|
} \
|
2013-10-15 08:17:35 +08:00
|
|
|
while (0)
|
1999-12-30 02:11:48 +08:00
|
|
|
|
|
|
|
|
2013-06-06 04:44:03 +08:00
|
|
|
/* Right shift with sticky-lsb.
|
2014-09-18 06:20:45 +08:00
|
|
|
What this actually means is that we do a standard right-shift,
|
|
|
|
but that if any of the bits that fall off the right hand side
|
|
|
|
were one then we always set the LSbit. */
|
2013-10-16 09:22:21 +08:00
|
|
|
#define _FP_FRAC_SRS_8(X, N, size) \
|
2013-10-15 08:17:35 +08:00
|
|
|
do \
|
|
|
|
{ \
|
2014-07-01 01:37:10 +08:00
|
|
|
_FP_I_TYPE _FP_FRAC_SRS_8_up, _FP_FRAC_SRS_8_down; \
|
|
|
|
_FP_I_TYPE _FP_FRAC_SRS_8_skip, _FP_FRAC_SRS_8_i; \
|
|
|
|
_FP_W_TYPE _FP_FRAC_SRS_8_s; \
|
|
|
|
_FP_FRAC_SRS_8_skip = (N) / _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SRS_8_down = (N) % _FP_W_TYPE_SIZE; \
|
|
|
|
_FP_FRAC_SRS_8_up = _FP_W_TYPE_SIZE - _FP_FRAC_SRS_8_down; \
|
|
|
|
for (_FP_FRAC_SRS_8_s = _FP_FRAC_SRS_8_i = 0; \
|
|
|
|
_FP_FRAC_SRS_8_i < _FP_FRAC_SRS_8_skip; \
|
|
|
|
++_FP_FRAC_SRS_8_i) \
|
|
|
|
_FP_FRAC_SRS_8_s |= X##_f[_FP_FRAC_SRS_8_i]; \
|
|
|
|
if (!_FP_FRAC_SRS_8_down) \
|
|
|
|
for (_FP_FRAC_SRS_8_i = 0; \
|
|
|
|
_FP_FRAC_SRS_8_i <= 7-_FP_FRAC_SRS_8_skip; \
|
|
|
|
++_FP_FRAC_SRS_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRS_8_i] \
|
|
|
|
= X##_f[_FP_FRAC_SRS_8_i+_FP_FRAC_SRS_8_skip]; \
|
2013-10-15 08:17:35 +08:00
|
|
|
else \
|
|
|
|
{ \
|
2014-07-01 01:37:10 +08:00
|
|
|
_FP_FRAC_SRS_8_s \
|
|
|
|
|= X##_f[_FP_FRAC_SRS_8_i] << _FP_FRAC_SRS_8_up; \
|
|
|
|
for (_FP_FRAC_SRS_8_i = 0; \
|
|
|
|
_FP_FRAC_SRS_8_i < 7-_FP_FRAC_SRS_8_skip; \
|
|
|
|
++_FP_FRAC_SRS_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRS_8_i] \
|
|
|
|
= ((X##_f[_FP_FRAC_SRS_8_i+_FP_FRAC_SRS_8_skip] \
|
|
|
|
>> _FP_FRAC_SRS_8_down) \
|
|
|
|
| (X##_f[_FP_FRAC_SRS_8_i+_FP_FRAC_SRS_8_skip+1] \
|
|
|
|
<< _FP_FRAC_SRS_8_up)); \
|
|
|
|
X##_f[_FP_FRAC_SRS_8_i++] = X##_f[7] >> _FP_FRAC_SRS_8_down; \
|
2013-10-15 08:17:35 +08:00
|
|
|
} \
|
2014-07-01 01:37:10 +08:00
|
|
|
for (; _FP_FRAC_SRS_8_i < 8; ++_FP_FRAC_SRS_8_i) \
|
|
|
|
X##_f[_FP_FRAC_SRS_8_i] = 0; \
|
2014-09-18 06:20:45 +08:00
|
|
|
/* Don't fix the LSB until the very end when we're sure f[0] is \
|
|
|
|
stable. */ \
|
2014-07-01 01:37:10 +08:00
|
|
|
X##_f[0] |= (_FP_FRAC_SRS_8_s != 0); \
|
2013-10-15 08:17:35 +08:00
|
|
|
} \
|
|
|
|
while (0)
|
2015-03-10 08:32:29 +08:00
|
|
|
|
|
|
|
#endif /* !SOFT_FP_OP_8_H */
|