decibel measuring?
parent
914a918465
commit
c723f59ecc
GPG Key ID:
7BA5A2980566A649
@ -0,0 +1,339 @@
|
|||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 2, June 1991
|
||||||
|
|
||||||
|
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
||||||
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The licenses for most software are designed to take away your
|
||||||
|
freedom to share and change it. By contrast, the GNU General Public
|
||||||
|
License is intended to guarantee your freedom to share and change free
|
||||||
|
software--to make sure the software is free for all its users. This
|
||||||
|
General Public License applies to most of the Free Software
|
||||||
|
Foundation's software and to any other program whose authors commit to
|
||||||
|
using it. (Some other Free Software Foundation software is covered by
|
||||||
|
the GNU Lesser General Public License instead.) You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
this service if you wish), that you receive source code or can get it
|
||||||
|
if you want it, that you can change the software or use pieces of it
|
||||||
|
in new free programs; and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to make restrictions that forbid
|
||||||
|
anyone to deny you these rights or to ask you to surrender the rights.
|
||||||
|
These restrictions translate to certain responsibilities for you if you
|
||||||
|
distribute copies of the software, or if you modify it.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must give the recipients all the rights that
|
||||||
|
you have. You must make sure that they, too, receive or can get the
|
||||||
|
source code. And you must show them these terms so they know their
|
||||||
|
rights.
|
||||||
|
|
||||||
|
We protect your rights with two steps: (1) copyright the software, and
|
||||||
|
(2) offer you this license which gives you legal permission to copy,
|
||||||
|
distribute and/or modify the software.
|
||||||
|
|
||||||
|
Also, for each author's protection and ours, we want to make certain
|
||||||
|
that everyone understands that there is no warranty for this free
|
||||||
|
software. If the software is modified by someone else and passed on, we
|
||||||
|
want its recipients to know that what they have is not the original, so
|
||||||
|
that any problems introduced by others will not reflect on the original
|
||||||
|
authors' reputations.
|
||||||
|
|
||||||
|
Finally, any free program is threatened constantly by software
|
||||||
|
patents. We wish to avoid the danger that redistributors of a free
|
||||||
|
program will individually obtain patent licenses, in effect making the
|
||||||
|
program proprietary. To prevent this, we have made it clear that any
|
||||||
|
patent must be licensed for everyone's free use or not licensed at all.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||||
|
|
||||||
|
0. This License applies to any program or other work which contains
|
||||||
|
a notice placed by the copyright holder saying it may be distributed
|
||||||
|
under the terms of this General Public License. The "Program", below,
|
||||||
|
refers to any such program or work, and a "work based on the Program"
|
||||||
|
means either the Program or any derivative work under copyright law:
|
||||||
|
that is to say, a work containing the Program or a portion of it,
|
||||||
|
either verbatim or with modifications and/or translated into another
|
||||||
|
language. (Hereinafter, translation is included without limitation in
|
||||||
|
the term "modification".) Each licensee is addressed as "you".
|
||||||
|
|
||||||
|
Activities other than copying, distribution and modification are not
|
||||||
|
covered by this License; they are outside its scope. The act of
|
||||||
|
running the Program is not restricted, and the output from the Program
|
||||||
|
is covered only if its contents constitute a work based on the
|
||||||
|
Program (independent of having been made by running the Program).
|
||||||
|
Whether that is true depends on what the Program does.
|
||||||
|
|
||||||
|
1. You may copy and distribute verbatim copies of the Program's
|
||||||
|
source code as you receive it, in any medium, provided that you
|
||||||
|
conspicuously and appropriately publish on each copy an appropriate
|
||||||
|
copyright notice and disclaimer of warranty; keep intact all the
|
||||||
|
notices that refer to this License and to the absence of any warranty;
|
||||||
|
and give any other recipients of the Program a copy of this License
|
||||||
|
along with the Program.
|
||||||
|
|
||||||
|
You may charge a fee for the physical act of transferring a copy, and
|
||||||
|
you may at your option offer warranty protection in exchange for a fee.
|
||||||
|
|
||||||
|
2. You may modify your copy or copies of the Program or any portion
|
||||||
|
of it, thus forming a work based on the Program, and copy and
|
||||||
|
distribute such modifications or work under the terms of Section 1
|
||||||
|
above, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) You must cause the modified files to carry prominent notices
|
||||||
|
stating that you changed the files and the date of any change.
|
||||||
|
|
||||||
|
b) You must cause any work that you distribute or publish, that in
|
||||||
|
whole or in part contains or is derived from the Program or any
|
||||||
|
part thereof, to be licensed as a whole at no charge to all third
|
||||||
|
parties under the terms of this License.
|
||||||
|
|
||||||
|
c) If the modified program normally reads commands interactively
|
||||||
|
when run, you must cause it, when started running for such
|
||||||
|
interactive use in the most ordinary way, to print or display an
|
||||||
|
announcement including an appropriate copyright notice and a
|
||||||
|
notice that there is no warranty (or else, saying that you provide
|
||||||
|
a warranty) and that users may redistribute the program under
|
||||||
|
these conditions, and telling the user how to view a copy of this
|
||||||
|
License. (Exception: if the Program itself is interactive but
|
||||||
|
does not normally print such an announcement, your work based on
|
||||||
|
the Program is not required to print an announcement.)
|
||||||
|
|
||||||
|
These requirements apply to the modified work as a whole. If
|
||||||
|
identifiable sections of that work are not derived from the Program,
|
||||||
|
and can be reasonably considered independent and separate works in
|
||||||
|
themselves, then this License, and its terms, do not apply to those
|
||||||
|
sections when you distribute them as separate works. But when you
|
||||||
|
distribute the same sections as part of a whole which is a work based
|
||||||
|
on the Program, the distribution of the whole must be on the terms of
|
||||||
|
this License, whose permissions for other licensees extend to the
|
||||||
|
entire whole, and thus to each and every part regardless of who wrote it.
|
||||||
|
|
||||||
|
Thus, it is not the intent of this section to claim rights or contest
|
||||||
|
your rights to work written entirely by you; rather, the intent is to
|
||||||
|
exercise the right to control the distribution of derivative or
|
||||||
|
collective works based on the Program.
|
||||||
|
|
||||||
|
In addition, mere aggregation of another work not based on the Program
|
||||||
|
with the Program (or with a work based on the Program) on a volume of
|
||||||
|
a storage or distribution medium does not bring the other work under
|
||||||
|
the scope of this License.
|
||||||
|
|
||||||
|
3. You may copy and distribute the Program (or a work based on it,
|
||||||
|
under Section 2) in object code or executable form under the terms of
|
||||||
|
Sections 1 and 2 above provided that you also do one of the following:
|
||||||
|
|
||||||
|
a) Accompany it with the complete corresponding machine-readable
|
||||||
|
source code, which must be distributed under the terms of Sections
|
||||||
|
1 and 2 above on a medium customarily used for software interchange; or,
|
||||||
|
|
||||||
|
b) Accompany it with a written offer, valid for at least three
|
||||||
|
years, to give any third party, for a charge no more than your
|
||||||
|
cost of physically performing source distribution, a complete
|
||||||
|
machine-readable copy of the corresponding source code, to be
|
||||||
|
distributed under the terms of Sections 1 and 2 above on a medium
|
||||||
|
customarily used for software interchange; or,
|
||||||
|
|
||||||
|
c) Accompany it with the information you received as to the offer
|
||||||
|
to distribute corresponding source code. (This alternative is
|
||||||
|
allowed only for noncommercial distribution and only if you
|
||||||
|
received the program in object code or executable form with such
|
||||||
|
an offer, in accord with Subsection b above.)
|
||||||
|
|
||||||
|
The source code for a work means the preferred form of the work for
|
||||||
|
making modifications to it. For an executable work, complete source
|
||||||
|
code means all the source code for all modules it contains, plus any
|
||||||
|
associated interface definition files, plus the scripts used to
|
||||||
|
control compilation and installation of the executable. However, as a
|
||||||
|
special exception, the source code distributed need not include
|
||||||
|
anything that is normally distributed (in either source or binary
|
||||||
|
form) with the major components (compiler, kernel, and so on) of the
|
||||||
|
operating system on which the executable runs, unless that component
|
||||||
|
itself accompanies the executable.
|
||||||
|
|
||||||
|
If distribution of executable or object code is made by offering
|
||||||
|
access to copy from a designated place, then offering equivalent
|
||||||
|
access to copy the source code from the same place counts as
|
||||||
|
distribution of the source code, even though third parties are not
|
||||||
|
compelled to copy the source along with the object code.
|
||||||
|
|
||||||
|
4. You may not copy, modify, sublicense, or distribute the Program
|
||||||
|
except as expressly provided under this License. Any attempt
|
||||||
|
otherwise to copy, modify, sublicense or distribute the Program is
|
||||||
|
void, and will automatically terminate your rights under this License.
|
||||||
|
However, parties who have received copies, or rights, from you under
|
||||||
|
this License will not have their licenses terminated so long as such
|
||||||
|
parties remain in full compliance.
|
||||||
|
|
||||||
|
5. You are not required to accept this License, since you have not
|
||||||
|
signed it. However, nothing else grants you permission to modify or
|
||||||
|
distribute the Program or its derivative works. These actions are
|
||||||
|
prohibited by law if you do not accept this License. Therefore, by
|
||||||
|
modifying or distributing the Program (or any work based on the
|
||||||
|
Program), you indicate your acceptance of this License to do so, and
|
||||||
|
all its terms and conditions for copying, distributing or modifying
|
||||||
|
the Program or works based on it.
|
||||||
|
|
||||||
|
6. Each time you redistribute the Program (or any work based on the
|
||||||
|
Program), the recipient automatically receives a license from the
|
||||||
|
original licensor to copy, distribute or modify the Program subject to
|
||||||
|
these terms and conditions. You may not impose any further
|
||||||
|
restrictions on the recipients' exercise of the rights granted herein.
|
||||||
|
You are not responsible for enforcing compliance by third parties to
|
||||||
|
this License.
|
||||||
|
|
||||||
|
7. If, as a consequence of a court judgment or allegation of patent
|
||||||
|
infringement or for any other reason (not limited to patent issues),
|
||||||
|
conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot
|
||||||
|
distribute so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you
|
||||||
|
may not distribute the Program at all. For example, if a patent
|
||||||
|
license would not permit royalty-free redistribution of the Program by
|
||||||
|
all those who receive copies directly or indirectly through you, then
|
||||||
|
the only way you could satisfy both it and this License would be to
|
||||||
|
refrain entirely from distribution of the Program.
|
||||||
|
|
||||||
|
If any portion of this section is held invalid or unenforceable under
|
||||||
|
any particular circumstance, the balance of the section is intended to
|
||||||
|
apply and the section as a whole is intended to apply in other
|
||||||
|
circumstances.
|
||||||
|
|
||||||
|
It is not the purpose of this section to induce you to infringe any
|
||||||
|
patents or other property right claims or to contest validity of any
|
||||||
|
such claims; this section has the sole purpose of protecting the
|
||||||
|
integrity of the free software distribution system, which is
|
||||||
|
implemented by public license practices. Many people have made
|
||||||
|
generous contributions to the wide range of software distributed
|
||||||
|
through that system in reliance on consistent application of that
|
||||||
|
system; it is up to the author/donor to decide if he or she is willing
|
||||||
|
to distribute software through any other system and a licensee cannot
|
||||||
|
impose that choice.
|
||||||
|
|
||||||
|
This section is intended to make thoroughly clear what is believed to
|
||||||
|
be a consequence of the rest of this License.
|
||||||
|
|
||||||
|
8. If the distribution and/or use of the Program is restricted in
|
||||||
|
certain countries either by patents or by copyrighted interfaces, the
|
||||||
|
original copyright holder who places the Program under this License
|
||||||
|
may add an explicit geographical distribution limitation excluding
|
||||||
|
those countries, so that distribution is permitted only in or among
|
||||||
|
countries not thus excluded. In such case, this License incorporates
|
||||||
|
the limitation as if written in the body of this License.
|
||||||
|
|
||||||
|
9. The Free Software Foundation may publish revised and/or new versions
|
||||||
|
of the General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the Program
|
||||||
|
specifies a version number of this License which applies to it and "any
|
||||||
|
later version", you have the option of following the terms and conditions
|
||||||
|
either of that version or of any later version published by the Free
|
||||||
|
Software Foundation. If the Program does not specify a version number of
|
||||||
|
this License, you may choose any version ever published by the Free Software
|
||||||
|
Foundation.
|
||||||
|
|
||||||
|
10. If you wish to incorporate parts of the Program into other free
|
||||||
|
programs whose distribution conditions are different, write to the author
|
||||||
|
to ask for permission. For software which is copyrighted by the Free
|
||||||
|
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||||
|
make exceptions for this. Our decision will be guided by the two goals
|
||||||
|
of preserving the free status of all derivatives of our free software and
|
||||||
|
of promoting the sharing and reuse of software generally.
|
||||||
|
|
||||||
|
NO WARRANTY
|
||||||
|
|
||||||
|
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||||
|
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||||
|
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||||
|
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||||
|
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||||
|
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||||
|
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||||
|
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||||
|
REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||||
|
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||||
|
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||||
|
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||||
|
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||||
|
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||||
|
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||||
|
POSSIBILITY OF SUCH DAMAGES.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
convey the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.>
|
||||||
|
Copyright (C) <year> <name of author>
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation; either version 2 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program 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 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 Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program is interactive, make it output a short notice like this
|
||||||
|
when it starts in an interactive mode:
|
||||||
|
|
||||||
|
Gnomovision version 69, Copyright (C) year name of author
|
||||||
|
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, the commands you use may
|
||||||
|
be called something other than `show w' and `show c'; they could even be
|
||||||
|
mouse-clicks or menu items--whatever suits your program.
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or your
|
||||||
|
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||||
|
necessary. Here is a sample; alter the names:
|
||||||
|
|
||||||
|
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
||||||
|
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
||||||
|
|
||||||
|
<signature of Ty Coon>, 1 April 1989
|
||||||
|
Ty Coon, President of Vice
|
||||||
|
|
||||||
|
This General Public License does not permit incorporating your program into
|
||||||
|
proprietary programs. If your program is a subroutine library, you may
|
||||||
|
consider it more useful to permit linking proprietary applications with the
|
||||||
|
library. If this is what you want to do, use the GNU Lesser General
|
||||||
|
Public License instead of this License.
|
||||||
@ -0,0 +1,4 @@
|
|||||||
|
The Qfplib libraries are open source, licensed under version 2 of the
|
||||||
|
GNU GPL. A copy of that licence is included in this archive.
|
||||||
|
|
||||||
|
Visit http://www.quinapalus.com/qfplib.html for more information.
|
||||||
@ -0,0 +1,44 @@
|
|||||||
|
#ifndef __QFPLIB_M0_FULL_H__
|
||||||
|
#define __QFPLIB_M0_FULL_H__
|
||||||
|
|
||||||
|
/*
|
||||||
|
Copyright 2019-2024 Mark Owen
|
||||||
|
http://www.quinapalus.com
|
||||||
|
E-mail: qfp@quinapalus.com
|
||||||
|
|
||||||
|
This file is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of version 2 of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation.
|
||||||
|
|
||||||
|
This file 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 General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this file. If not, see <http://www.gnu.org/licenses/> or
|
||||||
|
write to the Free Software Foundation, Inc., 51 Franklin Street,
|
||||||
|
Fifth Floor, Boston, MA 02110-1301, USA.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef unsigned int ui32;
|
||||||
|
typedef int i32;
|
||||||
|
|
||||||
|
extern float qfp_fadd (float x,float y);
|
||||||
|
extern float qfp_fsub (float x,float y);
|
||||||
|
extern float qfp_fmul (float x,float y);
|
||||||
|
extern float qfp_fdiv (float x,float y);
|
||||||
|
extern int qfp_fcmp (float x,float y);
|
||||||
|
extern float qfp_fsqrt (float x);
|
||||||
|
extern i32 qfp_float2int (float x);
|
||||||
|
extern i32 qfp_float2fix (float x,int f);
|
||||||
|
extern ui32 qfp_float2uint (float x);
|
||||||
|
extern ui32 qfp_float2ufix (float x,int f);
|
||||||
|
extern float qfp_int2float (i32 x);
|
||||||
|
extern float qfp_fix2float (i32 x,int f);
|
||||||
|
extern float qfp_uint2float (ui32 x);
|
||||||
|
extern float qfp_ufix2float (ui32 x,int f);
|
||||||
|
extern float qfp_fexp (float x);
|
||||||
|
extern float qfp_fln (float x);
|
||||||
|
|
||||||
|
#endif
|
||||||
File diff suppressed because it is too large
Load Diff
@ -0,0 +1,382 @@
|
|||||||
|
#include "qfplib-m0-full.h"
|
||||||
|
|
||||||
|
float qfp_fpow(float b, float e)
|
||||||
|
{
|
||||||
|
return qfp_fexp(qfp_fmul(e, qfp_fln(b)));
|
||||||
|
}
|
||||||
|
|
||||||
|
float qfp_flog10(float x)
|
||||||
|
{
|
||||||
|
extern float ln10;
|
||||||
|
return qfp_fdiv(qfp_fln(x), ln10);
|
||||||
|
}
|
||||||
|
|
||||||
|
//__attribute__((naked, section(".data")))
|
||||||
|
//inline float qfp_fadd_asm(float, float)
|
||||||
|
//{
|
||||||
|
//asm(R"(
|
||||||
|
//.syntax unified
|
||||||
|
// push {r4,r5,r6,r14}
|
||||||
|
// asrs r4,r0,#31
|
||||||
|
// lsls r2,r0,#1
|
||||||
|
// lsrs r2,#24 @ x exponent
|
||||||
|
// beq fa_xe0
|
||||||
|
// cmp r2,#255
|
||||||
|
// beq fa_xe255
|
||||||
|
//fa_xe:
|
||||||
|
// asrs r5,r1,#31
|
||||||
|
// lsls r3,r1,#1
|
||||||
|
// lsrs r3,#24 @ y exponent
|
||||||
|
// beq fa_ye0
|
||||||
|
// cmp r3,#255
|
||||||
|
// beq fa_ye255
|
||||||
|
//fa_ye:
|
||||||
|
// ldr r6,=#0x007fffff
|
||||||
|
// ands r0,r0,r6 @ extract mantissa bits
|
||||||
|
// ands r1,r1,r6
|
||||||
|
// adds r6,#1 @ r6=0x00800000
|
||||||
|
// orrs r0,r0,r6 @ set implied 1
|
||||||
|
// orrs r1,r1,r6
|
||||||
|
// eors r0,r0,r4 @ complement...
|
||||||
|
// eors r1,r1,r5
|
||||||
|
// subs r0,r0,r4 @ ... and add 1 if sign bit is set: 2's complement
|
||||||
|
// subs r1,r1,r5
|
||||||
|
// subs r5,r3,r2 @ ye-xe
|
||||||
|
// subs r4,r2,r3 @ xe-ye
|
||||||
|
// bmi fa_ygtx
|
||||||
|
//@ here xe>=ye
|
||||||
|
// cmp r4,#30
|
||||||
|
// bge fa_xmgty @ xe much greater than ye?
|
||||||
|
// adds r5,#32
|
||||||
|
// movs r3,r2 @ save exponent
|
||||||
|
//@ here y in r1 must be shifted down r4 places to align with x in r0
|
||||||
|
// movs r2,r1
|
||||||
|
// lsls r2,r2,r5 @ keep the bits we will shift off the bottom of r1
|
||||||
|
// asrs r1,r1,r4
|
||||||
|
// b fa_0
|
||||||
|
//
|
||||||
|
//.ltorg
|
||||||
|
//
|
||||||
|
//fa_ymgtx:
|
||||||
|
// movs r2,#0 @ result is just y
|
||||||
|
// movs r0,r1
|
||||||
|
// b fa_1
|
||||||
|
//fa_xmgty:
|
||||||
|
// movs r3,r2 @ result is just x
|
||||||
|
// movs r2,#0
|
||||||
|
// b fa_1
|
||||||
|
//
|
||||||
|
//fa_ygtx:
|
||||||
|
//@ here ye>xe
|
||||||
|
// cmp r5,#30
|
||||||
|
// bge fa_ymgtx @ ye much greater than xe?
|
||||||
|
// adds r4,#32
|
||||||
|
//@ here x in r0 must be shifted down r5 places to align with y in r1
|
||||||
|
// movs r2,r0
|
||||||
|
// lsls r2,r2,r4 @ keep the bits we will shift off the bottom of r0
|
||||||
|
// asrs r0,r0,r5
|
||||||
|
//fa_0:
|
||||||
|
// adds r0,r1 @ result is now in r0:r2, possibly highly denormalised or zero; exponent in r3
|
||||||
|
// beq fa_9 @ if zero, inputs must have been of identical magnitude and opposite sign, so return +0
|
||||||
|
//fa_1:
|
||||||
|
// lsrs r1,r0,#31 @ sign bit
|
||||||
|
// beq fa_8
|
||||||
|
// mvns r0,r0
|
||||||
|
// rsbs r2,r2,#0
|
||||||
|
// bne fa_8
|
||||||
|
// adds r0,#1
|
||||||
|
//fa_8:
|
||||||
|
// adds r6,r6
|
||||||
|
//@ r6=0x01000000
|
||||||
|
// cmp r0,r6
|
||||||
|
// bhs fa_2
|
||||||
|
//fa_3:
|
||||||
|
// adds r2,r2 @ normalisation loop
|
||||||
|
// adcs r0,r0
|
||||||
|
// subs r3,#1 @ adjust exponent
|
||||||
|
// cmp r0,r6
|
||||||
|
// blo fa_3
|
||||||
|
//fa_2:
|
||||||
|
//@ here r0:r2 is the result mantissa 0x01000000<=r0<0x02000000, r3 the exponent, and r1 the sign bit
|
||||||
|
// lsrs r0,#1
|
||||||
|
// bcc fa_4
|
||||||
|
//@ rounding bits here are 1:r2
|
||||||
|
// adds r0,#1 @ round up
|
||||||
|
// cmp r2,#0
|
||||||
|
// beq fa_5 @ sticky bits all zero?
|
||||||
|
//fa_4:
|
||||||
|
// cmp r3,#254
|
||||||
|
// bhs fa_6 @ exponent too large or negative?
|
||||||
|
// lsls r1,#31 @ pack everything
|
||||||
|
// add r0,r1
|
||||||
|
// lsls r3,#23
|
||||||
|
// add r0,r3
|
||||||
|
//fa_end:
|
||||||
|
// pop {r4,r5,r6,r15}
|
||||||
|
//
|
||||||
|
//fa_9:
|
||||||
|
// cmp r2,#0 @ result zero?
|
||||||
|
// beq fa_end @ return +0
|
||||||
|
// b fa_1
|
||||||
|
//
|
||||||
|
//fa_5:
|
||||||
|
// lsrs r0,#1
|
||||||
|
// lsls r0,#1 @ round to even
|
||||||
|
// b fa_4
|
||||||
|
//
|
||||||
|
//fa_6:
|
||||||
|
// bge fa_7
|
||||||
|
//@ underflow
|
||||||
|
//@ can handle denormals here
|
||||||
|
// lsls r0,r1,#31 @ result is signed zero
|
||||||
|
// pop {r4,r5,r6,r15}
|
||||||
|
//fa_7:
|
||||||
|
//@ overflow
|
||||||
|
// lsls r0,r1,#8
|
||||||
|
// adds r0,#255
|
||||||
|
// lsls r0,#23 @ result is signed infinity
|
||||||
|
// pop {r4,r5,r6,r15}
|
||||||
|
//
|
||||||
|
//
|
||||||
|
//fa_xe0:
|
||||||
|
//@ can handle denormals here
|
||||||
|
// subs r2,#32
|
||||||
|
// adds r2,r4 @ exponent -32 for +Inf, -33 for -Inf
|
||||||
|
// b fa_xe
|
||||||
|
//
|
||||||
|
//fa_xe255:
|
||||||
|
//@ can handle NaNs here
|
||||||
|
// lsls r2,#8
|
||||||
|
// add r2,r2,r4 @ exponent ~64k for +Inf, ~64k-1 for -Inf
|
||||||
|
// b fa_xe
|
||||||
|
//
|
||||||
|
//fa_ye0:
|
||||||
|
//@ can handle denormals here
|
||||||
|
// subs r3,#32
|
||||||
|
// adds r3,r5 @ exponent -32 for +Inf, -33 for -Inf
|
||||||
|
// b fa_ye
|
||||||
|
//
|
||||||
|
//fa_ye255:
|
||||||
|
//@ can handle NaNs here
|
||||||
|
// lsls r3,#8
|
||||||
|
// add r3,r3,r5 @ exponent ~64k for +Inf, ~64k-1 for -Inf
|
||||||
|
// b fa_ye
|
||||||
|
// )");
|
||||||
|
//}
|
||||||
|
//
|
||||||
|
//__attribute__((naked, section(".data")))
|
||||||
|
//inline float qfp_fmul_asm(float, float)
|
||||||
|
//{
|
||||||
|
//asm(R"(
|
||||||
|
//.syntax unified
|
||||||
|
// push {r7,r14}
|
||||||
|
// mov r2,r0
|
||||||
|
// eors r2,r1 @ sign of result
|
||||||
|
// lsrs r2,#31
|
||||||
|
// lsls r2,#31
|
||||||
|
// mov r14,r2
|
||||||
|
// lsls r0,#1
|
||||||
|
// lsls r1,#1
|
||||||
|
// lsrs r2,r0,#24 @ xe
|
||||||
|
// beq fm_xe0
|
||||||
|
// cmp r2,#255
|
||||||
|
// beq fm_xe255
|
||||||
|
//fm_xe:
|
||||||
|
// lsrs r3,r1,#24 @ ye
|
||||||
|
// beq fm_ye0
|
||||||
|
// cmp r3,#255
|
||||||
|
// beq fm_ye255
|
||||||
|
//fm_ye:
|
||||||
|
// adds r7,r2,r3 @ exponent of result (will possibly be incremented)
|
||||||
|
// subs r7,#128 @ adjust bias for packing
|
||||||
|
// lsls r0,#8 @ x mantissa
|
||||||
|
// lsls r1,#8 @ y mantissa
|
||||||
|
// lsrs r0,#9
|
||||||
|
// lsrs r1,#9
|
||||||
|
//
|
||||||
|
// adds r2,r0,r1 @ for later
|
||||||
|
// mov r12,r2
|
||||||
|
// lsrs r2,r0,#7 @ x[22..7] Q16
|
||||||
|
// lsrs r3,r1,#7 @ y[22..7] Q16
|
||||||
|
// muls r2,r2,r3 @ result [45..14] Q32: never an overestimate and worst case error is 2*(2^7-1)*(2^23-2^7)+(2^7-1)^2 = 2130690049 < 2^31
|
||||||
|
// muls r0,r0,r1 @ result [31..0] Q46
|
||||||
|
// lsrs r2,#18 @ result [45..32] Q14
|
||||||
|
// bcc 1f
|
||||||
|
// cmp r0,#0
|
||||||
|
// bmi 1f
|
||||||
|
// adds r2,#1 @ fix error in r2
|
||||||
|
//1:
|
||||||
|
// lsls r3,r0,#9 @ bits off bottom of result
|
||||||
|
// lsrs r0,#23 @ Q23
|
||||||
|
// lsls r2,#9
|
||||||
|
// adds r0,r2 @ cut'n'shut
|
||||||
|
// add r0,r12 @ implied 1*(x+y) to compensate for no insertion of implied 1s
|
||||||
|
//@ result-1 in r3:r0 Q23+32, i.e., in range [0,3)
|
||||||
|
//
|
||||||
|
// lsrs r1,r0,#23
|
||||||
|
// bne fm_0 @ branch if we need to shift down one place
|
||||||
|
//@ here 1<=result<2
|
||||||
|
// cmp r7,#254
|
||||||
|
// bhs fm_3a @ catches both underflow and overflow
|
||||||
|
// lsls r3,#1 @ sticky bits at top of R3, rounding bit in carry
|
||||||
|
// bcc fm_1 @ no rounding
|
||||||
|
// beq fm_2 @ rounding tie?
|
||||||
|
// adds r0,#1 @ round up
|
||||||
|
//fm_1:
|
||||||
|
// adds r7,#1 @ for implied 1
|
||||||
|
// lsls r7,#23 @ pack result
|
||||||
|
// add r0,r7
|
||||||
|
// add r0,r14
|
||||||
|
// pop {r7,r15}
|
||||||
|
//fm_2: @ rounding tie
|
||||||
|
// adds r0,#1
|
||||||
|
//fm_3:
|
||||||
|
// lsrs r0,#1
|
||||||
|
// lsls r0,#1 @ clear bottom bit
|
||||||
|
// b fm_1
|
||||||
|
//
|
||||||
|
//@ here 1<=result-1<3
|
||||||
|
//fm_0:
|
||||||
|
// adds r7,#1 @ increment exponent
|
||||||
|
// cmp r7,#254
|
||||||
|
// bhs fm_3b @ catches both underflow and overflow
|
||||||
|
// lsrs r0,#1 @ shift mantissa down
|
||||||
|
// bcc fm_1a @ no rounding
|
||||||
|
// adds r0,#1 @ assume we will round up
|
||||||
|
// cmp r3,#0 @ sticky bits
|
||||||
|
// beq fm_3c @ rounding tie?
|
||||||
|
//fm_1a:
|
||||||
|
// adds r7,r7
|
||||||
|
// adds r7,#1 @ for implied 1
|
||||||
|
// lsls r7,#22 @ pack result
|
||||||
|
// add r0,r7
|
||||||
|
// add r0,r14
|
||||||
|
// pop {r7,r15}
|
||||||
|
//
|
||||||
|
//fm_3c:
|
||||||
|
// lsrs r0,#1
|
||||||
|
// lsls r0,#1 @ clear bottom bit
|
||||||
|
// b fm_1a
|
||||||
|
//
|
||||||
|
//fm_xe0:
|
||||||
|
// subs r2,#16
|
||||||
|
//fm_xe255:
|
||||||
|
// lsls r2,#8
|
||||||
|
// b fm_xe
|
||||||
|
//fm_ye0:
|
||||||
|
// subs r3,#16
|
||||||
|
//fm_ye255:
|
||||||
|
// lsls r3,#8
|
||||||
|
// b fm_ye
|
||||||
|
//
|
||||||
|
//@ here the result is under- or overflowing
|
||||||
|
//fm_3b:
|
||||||
|
// bge fm_4 @ branch on overflow
|
||||||
|
//@ trap case where result is denormal 0x007fffff + 0.5ulp or more
|
||||||
|
// adds r7,#1 @ exponent=-1?
|
||||||
|
// bne fm_5
|
||||||
|
//@ corrected mantissa will be >= 3.FFFFFC (0x1fffffe Q23)
|
||||||
|
//@ so r0 >= 2.FFFFFC (0x17ffffe Q23)
|
||||||
|
// adds r0,#2
|
||||||
|
// lsrs r0,#23
|
||||||
|
// cmp r0,#3
|
||||||
|
// bne fm_5
|
||||||
|
// b fm_6
|
||||||
|
//
|
||||||
|
//fm_3a:
|
||||||
|
// bge fm_4 @ branch on overflow
|
||||||
|
//@ trap case where result is denormal 0x007fffff + 0.5ulp or more
|
||||||
|
// adds r7,#1 @ exponent=-1?
|
||||||
|
// bne fm_5
|
||||||
|
// adds r0,#1 @ mantissa=0xffffff (i.e., r0=0x7fffff)?
|
||||||
|
// lsrs r0,#23
|
||||||
|
// beq fm_5
|
||||||
|
//fm_6:
|
||||||
|
// movs r0,#1 @ return smallest normal
|
||||||
|
// lsls r0,#23
|
||||||
|
// add r0,r14
|
||||||
|
// pop {r7,r15}
|
||||||
|
//
|
||||||
|
//fm_5:
|
||||||
|
// mov r0,r14
|
||||||
|
// pop {r7,r15}
|
||||||
|
//fm_4:
|
||||||
|
// movs r0,#0xff
|
||||||
|
// lsls r0,#23
|
||||||
|
// add r0,r14
|
||||||
|
// pop {r7,r15}
|
||||||
|
//)");
|
||||||
|
//}
|
||||||
|
//
|
||||||
|
//__attribute__((naked, section(".data")))
|
||||||
|
//inline float qfp_int2float_asm(int)
|
||||||
|
//{
|
||||||
|
//asm(R"(
|
||||||
|
//.syntax unified
|
||||||
|
// movs r1,#0 @ fall through
|
||||||
|
// push {r4,r5,r6,r14}
|
||||||
|
// movs r2,#29
|
||||||
|
// subs r2,r1 @ fix exponent
|
||||||
|
// movs r5,#0
|
||||||
|
// bl qfp_int2float_packx
|
||||||
|
// pop {r4,r5,r6,r15}
|
||||||
|
//qfp_int2float_packx:
|
||||||
|
// lsrs r4,r0,#31 @ save sign bit
|
||||||
|
// lsls r4,r4,#31 @ sign now in b31
|
||||||
|
// bpl 2f @ skip if positive
|
||||||
|
// cmp r5,#0
|
||||||
|
// beq 11f
|
||||||
|
// adds r0,#1 @ fiddle carry in to following rsb if sticky bits are non-zero
|
||||||
|
//11:
|
||||||
|
// rsbs r0,#0 @ can now treat r0 as unsigned
|
||||||
|
// bmi 3f @ catch r0=0x80000000 case
|
||||||
|
//2:
|
||||||
|
// subs r2,#1 @ normalisation loop
|
||||||
|
// adds r0,r0
|
||||||
|
// beq 1f @ zero? special case
|
||||||
|
// bpl 2b @ normalise so leading "1" in bit 31
|
||||||
|
//3:
|
||||||
|
// adds r2,#129 @ (mis-)offset exponent
|
||||||
|
// bne 12f @ special case: highest denormal can round to lowest normal
|
||||||
|
// adds r0,#0x80 @ in special case, need to add 256 to r0 for rounding
|
||||||
|
// bcs 4f @ tripped carry? then have leading 1 in C as required
|
||||||
|
//12:
|
||||||
|
// adds r0,#0x80 @ rounding
|
||||||
|
// bcs 4f @ tripped carry? then have leading 1 in C as required (and result is even so can ignore sticky bits)
|
||||||
|
// cmp r5,#0
|
||||||
|
// beq 7f @ sticky bits zero?
|
||||||
|
//8:
|
||||||
|
// lsls r0,#1 @ remove leading 1
|
||||||
|
//9:
|
||||||
|
// subs r2,#1 @ compensate exponent on this path
|
||||||
|
//4:
|
||||||
|
// cmp r2,#254
|
||||||
|
// bge 5f @ overflow?
|
||||||
|
// adds r2,#1 @ correct exponent offset
|
||||||
|
// ble 10f @ denormal/underflow?
|
||||||
|
// lsrs r0,#9 @ align mantissa
|
||||||
|
// lsls r2,#23 @ align exponent
|
||||||
|
// orrs r0,r2 @ assemble exponent and mantissa
|
||||||
|
//6:
|
||||||
|
// orrs r0,r4 @ apply sign
|
||||||
|
//1:
|
||||||
|
// bx r14
|
||||||
|
//
|
||||||
|
//5:
|
||||||
|
// movs r0,#0xff @ create infinity
|
||||||
|
// lsls r0,#23
|
||||||
|
// b 6b
|
||||||
|
//
|
||||||
|
//10:
|
||||||
|
// movs r0,#0 @ create zero
|
||||||
|
// bx r14
|
||||||
|
//
|
||||||
|
//7: @ sticky bit rounding case
|
||||||
|
// lsls r5,r0,#24 @ check bottom 8 bits of r0
|
||||||
|
// bne 8b @ in rounding-tie case?
|
||||||
|
// lsrs r0,#9 @ ensure even result
|
||||||
|
// lsls r0,#10
|
||||||
|
// b 9b
|
||||||
|
//)");
|
||||||
|
//}
|
||||||
|
|
||||||
Loading…
Reference in New Issue