haraldwolff
/
Math.Gmp.Native
mirror of https://github.com/MachineCognitis/Math.Gmp.Native.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Created NuGet package.

master
Robert Baron 2017-11-11 16:33:24 -05:00
parent b3fde9841d
commit 896b053633
15 changed files with 1025 additions and 919 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
GMP Sizes.xlsx
View File

Binary file not shown.

1
Math.Gmp.Native.sln
View File

@ -7,6 +7,7 @@ Project("{2150E333-8FDC-42A3-9474-1A3956D46DE8}") = "Solution Items", "Solution
ProjectSection(SolutionItems) = preProject
LICENSE.md = LICENSE.md
README.md = README.md
ReadMe.txt = ReadMe.txt
EndProjectSection
EndProject
Project("{7CF6DF6D-3B04-46F8-A40B-537D21BCA0B4}") = "Documentation", "Documentation\Documentation.shfbproj", "{CE631E64-52BF-4527-99AD-1EAEB76550A8}"

674
Math.Gmp.Native/GMP_COPYING 100644
View File

@ -0,0 +1,674 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. 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
them 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 prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. 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.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey 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;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If 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 convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU 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 that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
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.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
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.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
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
state 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 3 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, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program 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, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
<http://www.gnu.org/licenses/>.
The GNU 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. But first, please read
<http://www.gnu.org/philosophy/why-not-lgpl.html>.

111
Math.Gmp.Native/GMP_README 100644
View File

@ -0,0 +1,111 @@
Copyright 1991, 1996, 1999, 2000, 2007 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of either:
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your
option) any later version.
or
* 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.
or both in parallel, as here.
The GNU MP 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 General Public License
for more details.
You should have received copies of the GNU General Public License and the
GNU Lesser General Public License along with the GNU MP Library. If not,
see https://www.gnu.org/licenses/.
THE GNU MP LIBRARY
GNU MP is a library for arbitrary precision arithmetic, operating on signed
integers, rational numbers, and floating point numbers. It has a rich set of
functions, and the functions have a regular interface.
GNU MP is designed to be as fast as possible, both for small operands and huge
operands. The speed is achieved by using fullwords as the basic arithmetic
type, by using fast algorithms, with carefully optimized assembly code for the
most common inner loops for lots of CPUs, and by a general emphasis on speed
(instead of simplicity or elegance).
GNU MP is believed to be faster than any other similar library. Its advantage
increases with operand sizes for certain operations, since GNU MP in many
cases has asymptotically faster algorithms.
GNU MP is free software and may be freely copied on the terms contained in the
files COPYING* (see the manual for information on which license(s) applies to
which components of GNU MP).
OVERVIEW OF GNU MP
There are four classes of functions in GNU MP.
1. Signed integer arithmetic functions (mpz). These functions are intended
to be easy to use, with their regular interface. The associated type is
`mpz_t'.
2. Rational arithmetic functions (mpq). For now, just a small set of
functions necessary for basic rational arithmetics. The associated type
is `mpq_t'.
3. Floating-point arithmetic functions (mpf). If the C type `double'
doesn't give enough precision for your application, declare your
variables as `mpf_t' instead, set the precision to any number desired,
and call the functions in the mpf class for the arithmetic operations.
4. Positive-integer, hard-to-use, very low overhead functions are in the
mpn class. No memory management is performed. The caller must ensure
enough space is available for the results. The set of functions is not
regular, nor is the calling interface. These functions accept input
arguments in the form of pairs consisting of a pointer to the least
significant word, and an integral size telling how many limbs (= words)
the pointer points to.
Almost all calculations, in the entire package, are made by calling these
low-level functions.
For more information on how to use GNU MP, please refer to the documentation.
It is composed from the file doc/gmp.texi, and can be displayed on the screen
or printed. How to do that, as well how to build the library, is described in
the INSTALL file in this directory.
REPORTING BUGS
If you find a bug in the library, please make sure to tell us about it!
You should first check the GNU MP web pages at https://gmplib.org/, under
"Status of the current release". There will be patches for all known serious
bugs there.
Report bugs to gmp-bugs@gmplib.org. What information is needed in a useful bug
report is described in the manual. The same address can be used for suggesting
modifications and enhancements.
----------------
Local variables:
mode: text
fill-column: 78
End:

10
Math.Gmp.Native/Math.Gmp.Native.csproj
View File

@ -89,12 +89,20 @@
<ItemGroup>
<None Include="Dependencies\ConsoleApplication12.zip" />
<None Include="Dependencies\gmp-6.1.2.tar.bz2" />
<None Include="GMP_COPYING">
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
</None>
<None Include="GMP_README">
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
</None>
<None Include="ReadMe.txt" />
<None Include="Dependencies\msys2-i686-20161025.exe" />
<None Include="Dependencies\msys2-x86_64-20161025.exe" />
<None Include="Dependencies\yasm-1.3.0-win32.exe" />
<None Include="Dependencies\yasm-1.3.0-win64.exe" />
<Content Include="x64\libgmp-10.dll" />
<Content Include="x64\libgmp-10.dll">
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
</Content>
<Content Include="x86\libgmp-10.dll">
<CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
</Content>

28
NuGet/Gmp.Native.nuspec
View File

@ -1,28 +0,0 @@
<?xml version="1.0" encoding="utf-8"?>
<package xmlns="http://schemas.microsoft.com/packaging/2011/08/nuspec.xsd">
<metadata>
<id>Gmp.Native.NET</id>
<version>1.1</version>
<title>GMP Native Interface for .NET)</title>
<authors>Robert Baron (Machine Cognitis)</authors>
<owners>Robert Baron (Machine Cognitis)</owners>
<licenseUrl>https://github.com/MachineCognitis/Gmp.Native.NET/blob/master/LICENSE.md</licenseUrl>
<projectUrl>https://github.com/MachineCognitis/Gmp.Native.NET/</projectUrl>
<requireLicenseAcceptance>false</requireLicenseAcceptance>
<description>This package contains the C.math.NET library that implements several C Standard mathematical functions that are missing from the .NET framework. Functions include among others: frexp, ilogb, ldexp, logb, scalbn, copysign, nextafter, isunordered, and fpclassify. Both double and single precision functions are implemented. All functions are static and their names follow the C Standard.
All functions have been thoroughly tested using a large set of unit tests that cover all limit cases to guarantee that all functions behave as specified by the C standard.
Supported Platform: .NET Framework 2.0+</description>
<summary>C math (in .NET)</summary>
<releaseNotes>Initial release.</releaseNotes>
<copyright>Copyright (c) 2017 Robert Baron, Machine Cognitis</copyright>
<tags>fpclassify isfinite isinf isnan isnormal signbit frexp ilogb ldexp logb scalbn scalbln copysign nextafter nexttoward significand isunordered</tags>
<frameworkAssemblies>
<frameworkAssembly assemblyName="System" targetFramework=".NETFramework2.0" />
</frameworkAssemblies>
</metadata>
<files>
<file src="..\Math.Gmp.Native\bin\Release\Math.Gmp.Native.dll" target="lib\net20\Math.Gmp.Native.dll" />
</files>
</package>

41
NuGet/Math.Gmp.Native.nuspec 100644
View File

@ -0,0 +1,41 @@
<?xml version="1.0" encoding="utf-8"?>
<package xmlns="http://schemas.microsoft.com/packaging/2011/08/nuspec.xsd">
<metadata>
<id>Math.Gmp.Native.NET</id>
<version>1.6.4</version>
<title>GMP Native Interface for .NET</title>
<authors>Robert Baron (Machine Cognitis)</authors>
<owners>Robert Baron (Machine Cognitis)</owners>
<licenseUrl>https://github.com/MachineCognitis/Math.Gmp.Native/blob/master/LICENSE.md</licenseUrl>
<projectUrl>https://github.com/MachineCognitis/Math.Gmp.Native/</projectUrl>
<requireLicenseAcceptance>false</requireLicenseAcceptance>
<description>The GMP Native Interface for .NET Library exposes to .NET (through P-Invoke and .NET types) all of the functionality of the GNU MP Library (version 6.1.2). It automatically loads at runtime the 32-bit or 64-bit GNU MP library that matches the current CPU architecture, thus allowing building Visual Studio Projects for AnyCPU, x86, or x64. It is based on the GNU MP "fat" build which automatically detects the current CPU type, and selects any available assembly language code optimization for that CPU, thus providing optimal performance.
Documentation with sample usage is given at the Project URL. GNU MP is at https://gmplib.org/.
Supported Platform: .NET Framework 2.0+</description>
<summary>GMP Native Interface for .NET</summary>
<releaseNotes>Initial release for GNU MP v6.1.2.</releaseNotes>
<copyright>Copyright (c) 2017 Robert Baron, Machine Cognitis</copyright>
<tags>GNU MP GMP multi-precision arithmetic integer float rational bigint biginteger bigfloat bignum</tags>
<frameworkAssemblies>
<frameworkAssembly assemblyName="System" targetFramework=".NETFramework2.0" />
</frameworkAssemblies>
<references>
<reference file="Math.Gmp.Native.dll" />
</references>
<dependencies>
<dependency id="Baseclass.Contrib.Nuget.Output" version="2.4.0" />
</dependencies> </metadata>
<files>
<file src="..\Math.Gmp.Native\bin\Release\Math.Gmp.Native.dll" target="lib\net20\Math.Gmp.Native.dll" />
<file src="..\Math.Gmp.Native\bin\Release\Math.Gmp.Native.pdb" target="lib\net20\Math.Gmp.Native.pdb" />
<file src="..\Math.Gmp.Native\bin\Release\Math.Gmp.Native.xml" target="lib\net20\Math.Gmp.Native.xml" />
<file src="..\Math.Gmp.Native\bin\Release\GMP_COPYING" target="output\x86\GMP_COPYING" />
<file src="..\Math.Gmp.Native\bin\Release\GMP_README" target="output\x86\GMP_README" />
<file src="..\Math.Gmp.Native\bin\Release\GMP_COPYING" target="output\x64\GMP_COPYING" />
<file src="..\Math.Gmp.Native\bin\Release\GMP_README" target="output\x64\GMP_README" />
<file src="..\Math.Gmp.Native\bin\Release\x86\libgmp-10.dll" target="output\x86\libgmp-10.dll" />
<file src="..\Math.Gmp.Native\bin\Release\x64\libgmp-10.dll" target="output\x64\libgmp-10.dll" />
</files>
</package>

2
NuGet/NuGet.nuproj
View File

@ -15,7 +15,7 @@
<PropertyGroup Condition="'$(Configuration)' == 'Release'">
</PropertyGroup>
<ItemGroup>
<Compile Include="Gmp.Native.nuspec">
<Compile Include="Math.Gmp.Native.nuspec">
<SubType>Code</SubType>
</Compile>
</ItemGroup>

3
README.md
View File

@ -1,4 +1,3 @@
# THIS PROJECT IS IN PRE-RELEASE
# Welcome to the GMP Native Interface for .NET Library
The GMP Native Interface for .NET Library exposes to .NET (through P-Invoke and .NET types) all of
@ -15,7 +14,7 @@ any available assembly language code optimization for that CPU, thus providing o
### NuGet
The GMP Native Interface for .NET library can be installed in your Visual Studio solution or project
with this [NuGet package](https://www.nuget.org/packages/Math.Gmp.Native/).
with this [NuGet package](https://www.nuget.org/packages/Math.Gmp.Native.NET/).
### Latest Build

1
ReadMe.txt 100644
View File

@ -0,0 +1 @@
Edit with Visual Studio 2015 or earlier.

1
docs/fti/FTI_100 (conflict).json 100644
View File

File diff suppressed because one or more lines are too long

63
docs/html/1dfbf5da-f4c2-bbab-5708-3b31d40e4f16 (conflict).htm 100644
View File

File diff suppressed because one or more lines are too long

60
docs/html/45a76d5c-c5bf-e7f8-906a-15d290e9a50d (conflict).htm 100644
View File

File diff suppressed because one or more lines are too long

62
docs/html/8b1e9c27-7278-6032-80c0-015b93258d96 (conflict).htm 100644
View File

File diff suppressed because one or more lines are too long

887
out.txt
View File

@ -1,887 +0,0 @@
Microsoft (R) COFF/PE Dumper Version 14.00.24215.1
Copyright (C) Microsoft Corporation. All rights reserved.
Dump of file libgmp-10.dll
File Type: DLL
Section contains the following exports for libgmp-10.dll
00000000 characteristics
59B3E652 time date stamp Sat Sep 9 09:02:10 2017
0.00 version
1 ordinal base
848 number of functions
848 number of names
ordinal hint RVA name
1 0 000600D8 __gmp_0
2 1 0005F00C __gmp_allocate_func
3 2 00059880 __gmp_asprintf
4 3 00059970 __gmp_asprintf_final
5 4 00068E84 __gmp_asprintf_funs
6 5 000598B0 __gmp_asprintf_memory
7 6 00059910 __gmp_asprintf_reps
8 7 00001560 __gmp_assert_fail
9 8 00001500 __gmp_assert_header
10 9 00060360 __gmp_binvert_limb_table
11 A 000600DC __gmp_bits_per_limb
12 B 000017B0 __gmp_default_allocate
13 C 0005F060 __gmp_default_fp_limb_precision
14 D 000017A0 __gmp_default_free
15 E 000017F0 __gmp_default_reallocate
16 F 00060180 __gmp_digit_value_tab
17 10 00001670 __gmp_divide_by_zero
18 11 000599B0 __gmp_doprnt
19 12 0005AA20 __gmp_doprnt_integer
20 13 0005A270 __gmp_doprnt_mpf2
21 14 0005B800 __gmp_doscan = ___gmp_randinit_default
22 15 0007C01C __gmp_errno
23 16 00001630 __gmp_exception
24 17 00001680 __gmp_extract_double
25 18 000688A0 __gmp_fac2cnt_table
26 19 00060900 __gmp_fib_table
27 1A 0005ADF0 __gmp_fprintf
28 1B 00068E54 __gmp_fprintf_funs
29 1C 0005F004 __gmp_free_func
30 1D 0005C600 __gmp_fscanf
31 1E 00069244 __gmp_fscanf_funs
32 1F 00001840 __gmp_get_memory_functions
33 20 00001B50 __gmp_init_primesieve
34 21 00001780 __gmp_invalid_operation
35 22 000625C0 __gmp_jacobi_table
36 23 0007C3C8 __gmp_junk
37 24 00068880 __gmp_limbroots_table
38 25 0005CF40 __gmp_mt_recalc_buffer
39 26 000018C0 __gmp_nextprime
40 27 000688C0 __gmp_odd2fac_table
41 28 00068900 __gmp_oddfac_table
42 29 00001CF0 __gmp_primesieve
43 2A 0005AE20 __gmp_printf
44 2B 0005C7F0 __gmp_randclear
45 2C 0005CEC0 __gmp_randclear_mt
46 2D 0005D010 __gmp_randget_mt
47 2E 0005C7A0 __gmp_randinit
48 2F 0005C800 __gmp_randinit_default
49 30 0005CDE0 __gmp_randinit_lc_2exp
50 31 0005C820 __gmp_randinit_lc_2exp_size
51 32 0005D3E0 __gmp_randinit_mt = _fscanf
52 33 0005D130 __gmp_randinit_mt_noseed
53 34 0005C810 __gmp_randinit_set
54 35 0005CEE0 __gmp_randiset_mt
55 36 0007C3CC __gmp_rands
56 37 0007C024 __gmp_rands_initialized
57 38 0005D400 __gmp_randseed = _fprintf
58 39 0005D410 __gmp_randseed_ui = _ferror
59 3A 0005F008 __gmp_reallocate_func
60 3B 0005B410 __gmp_replacement_vsnprintf
61 3C 0005C640 __gmp_scanf
62 3D 00001880 __gmp_set_memory_functions
63 3E 0005AF80 __gmp_snprintf
64 3F 00068E64 __gmp_snprintf_funs
65 40 0005B160 __gmp_sprintf
66 41 00068E74 __gmp_sprintf_funs
67 42 00001660 __gmp_sqrt_of_negative
68 43 0005C670 __gmp_sscanf
69 44 00069254 __gmp_sscanf_funs
70 45 00001F90 __gmp_tmp_reentrant_alloc
71 46 00001FC0 __gmp_tmp_reentrant_free
72 47 0005D450 __gmp_urandomb_ui = _mpn_sub_nc
73 48 0005D490 __gmp_urandomm_ui
74 49 0005B2E0 __gmp_vasprintf
75 4A 000603E8 __gmp_version
76 4B 0005B340 __gmp_vfprintf
77 4C 0005C710 __gmp_vfscanf
78 4D 0005B370 __gmp_vprintf
79 4E 0005C740 __gmp_vscanf
80 4F 0005B3A0 __gmp_vsnprintf
81 50 0005B3E0 __gmp_vsprintf
82 51 0005C770 __gmp_vsscanf
83 52 00005F20 __gmpf_abs
84 53 00003D80 __gmpf_add
85 54 000041A0 __gmpf_add_ui
86 55 00006790 __gmpf_ceil
87 56 00002D00 __gmpf_clear
88 57 00002D30 __gmpf_clears
89 58 00005990 __gmpf_cmp
90 59 00005AB0 __gmpf_cmp_d
91 5A 00005C10 __gmpf_cmp_si
92 5B 00005B80 __gmpf_cmp_ui
93 5C 00005950 __gmpf_cmp_z
94 5D 00005530 __gmpf_div
95 5E 00005E00 __gmpf_div_2exp
96 5F 000057C0 __gmpf_div_ui
97 60 00003540 __gmpf_dump
98 61 000035F0 __gmpf_eq
99 62 00006A50 __gmpf_fits_sint_p
100 63 00006AA0 __gmpf_fits_slong_p
101 64 00006AF0 __gmpf_fits_sshort_p = ___gmpz_and
102 65 00006B40 __gmpf_fits_uint_p
103 66 00006B70 __gmpf_fits_ulong_p
104 67 00006BA0 __gmpf_fits_ushort_p
105 68 000067B0 __gmpf_floor
106 69 00006180 __gmpf_get_d
107 6A 000061D0 __gmpf_get_d_2exp
108 6B 00006320 __gmpf_get_default_prec
109 6C 00006330 __gmpf_get_prec
110 6D 00006BE0 __gmpf_get_si
111 6E 00002EB0 __gmpf_get_str
112 6F 00006C30 __gmpf_get_ui
113 70 00001FF0 __gmpf_init
114 71 00002030 __gmpf_init2
115 72 00002B40 __gmpf_init_set
116 73 00002CC0 __gmpf_init_set_d
117 74 00002C00 __gmpf_init_set_si
118 75 00002C60 __gmpf_init_set_str
119 76 00002BC0 __gmpf_init_set_ui
120 77 00002080 __gmpf_inits
121 78 00003A80 __gmpf_inp_str
122 79 00006C60 __gmpf_integer_p
123 7A 000051F0 __gmpf_mul
124 7B 00005CC0 __gmpf_mul_2exp
125 7C 00005390 __gmpf_mul_ui
126 7D 00005F80 __gmpf_neg
127 7E 00003BB0 __gmpf_out_str
128 7F 00006860 __gmpf_pow_ui
129 80 000039A0 __gmpf_random2
130 81 00003770 __gmpf_reldiff
131 82 000020B0 __gmpf_set
132 83 00002A50 __gmpf_set_d
133 84 00006240 __gmpf_set_default_prec
134 85 00006260 __gmpf_set_prec
135 86 00006300 __gmpf_set_prec_raw
136 87 00005FF0 __gmpf_set_q
137 88 00002130 __gmpf_set_si
138 89 00002170 __gmpf_set_str
139 8A 00002110 __gmpf_set_ui
140 8B 00002AE0 __gmpf_set_z
141 8C 000035D0 __gmpf_size
142 8D 00003840 __gmpf_sqrt
143 8E 000064E0 __gmpf_sqrt_ui
144 8F 00004510 __gmpf_sub
145 90 00005130 __gmpf_sub_ui
146 91 00006A10 __gmpf_swap
147 92 000067D0 __gmpf_trunc
148 93 00006340 __gmpf_ui_div
149 94 00005190 __gmpf_ui_sub
150 95 00006960 __gmpf_urandomb
151 96 000269E0 __gmpn_add
152 97 00026A80 __gmpn_add_1
153 98 00026D40 __gmpn_add_err1_n
154 99 00026DE0 __gmpn_add_err2_n
155 9A 00026ED0 __gmpn_add_err3_n
156 9B 000267B0 __gmpn_add_n
157 9C 00023D40 __gmpn_add_n_atom = ___gmpn_mul_1c_atom_sse2
158 9D 000268EC __gmpn_add_n_init
159 9E 0001A986 __gmpn_add_n_k6
160 9F 0001BFC6 __gmpn_add_n_k7
161 A0 0001F090 __gmpn_add_n_p6
162 A1 0001DFB8 __gmpn_add_n_pentium
163 A2 00022030 __gmpn_add_n_pentium4_sse2
164 A3 00059220 __gmpn_add_n_sub_n
165 A4 000191D0 __gmpn_add_n_x86
166 A5 00023DAE __gmpn_add_nc_atom
167 A6 0001A980 __gmpn_add_nc_k6
168 A7 0001BFC0 __gmpn_add_nc_k7
169 A8 0001F137 __gmpn_add_nc_p6
170 A9 0001DF80 __gmpn_add_nc_pentium
171 AA 00022028 __gmpn_add_nc_pentium4_sse2
172 AB 00019190 __gmpn_add_nc_x86
173 AC 000267B8 __gmpn_addlsh1_n
174 AD 000268F0 __gmpn_addlsh1_n_init
175 AE 000267C0 __gmpn_addlsh2_n
176 AF 000268F4 __gmpn_addlsh2_n_init
177 B0 000267C8 __gmpn_addmul_1
178 B1 000245E0 __gmpn_addmul_1_atom_sse2
179 B2 000268F8 __gmpn_addmul_1_init
180 B3 0001AAC7 __gmpn_addmul_1_k6
181 B4 0001C140 __gmpn_addmul_1_k7
182 B5 0001F147 __gmpn_addmul_1_p6
183 B6 00020600 __gmpn_addmul_1_p6_sse2
184 B7 0001E078 __gmpn_addmul_1_pentium
185 B8 00022080 __gmpn_addmul_1_pentium4_sse2
186 B9 00019270 __gmpn_addmul_1_x86
187 BA 000246E9 __gmpn_addmul_1c_atom_sse2
188 BB 0001AAC0 __gmpn_addmul_1c_k6 = ___gmpn_com_k6_mmx
189 BC 0001F140 __gmpn_addmul_1c_p6
190 BD 00020791 __gmpn_addmul_1c_p6_sse2
191 BE 0001E070 __gmpn_addmul_1c_pentium
192 BF 00022211 __gmpn_addmul_1c_pentium4_sse2
193 C0 000267D0 __gmpn_addmul_2
194 C1 000268FC __gmpn_addmul_2_init
195 C2 00058F50 __gmpn_and_n
196 C3 00058F90 __gmpn_andn_n
197 C4 000609E0 __gmpn_bases
198 C5 0004CA80 __gmpn_bc_mulmod_bnm1
199 C6 0002FA60 __gmpn_bc_set_str
200 C7 000267D8 __gmpn_bdiv_dbm1c
201 C8 00024700 __gmpn_bdiv_dbm1c_atom_sse2
202 C9 00026900 __gmpn_bdiv_dbm1c_init
203 CA 00022220 __gmpn_bdiv_dbm1c_pentium4_sse2
204 CB 00019310 __gmpn_bdiv_dbm1c_x86
205 CC 00054910 __gmpn_bdiv_q
206 CD 000528F0 __gmpn_bdiv_q_1
207 CE 00054A20 __gmpn_bdiv_q_itch
208 CF 00054A40 __gmpn_bdiv_qr
209 D0 00054C10 __gmpn_bdiv_qr_itch
210 D1 0004C7A0 __gmpn_binvert
211 D2 0004C760 __gmpn_binvert_itch
212 D3 00055020 __gmpn_broot
213 D4 00054C30 __gmpn_broot_invm1
214 D5 000550E0 __gmpn_brootinv
215 D6 00055370 __gmpn_bsqrt
216 D7 000553C0 __gmpn_bsqrtinv
217 D8 000600E0 __gmpn_clz_tab
218 D9 00030460 __gmpn_cmp
219 DA 000267E0 __gmpn_cnd_add_n = ___gmpn_divrem
220 DB 00023DC0 __gmpn_cnd_add_n_atom
221 DC 00026904 __gmpn_cnd_add_n_init
222 DD 000222C0 __gmpn_cnd_add_n_pentium4_sse2
223 DE 000193B0 __gmpn_cnd_add_n_x86
224 DF 000267E8 __gmpn_cnd_sub_n
225 E0 00023E40 __gmpn_cnd_sub_n_atom
226 E1 00026908 __gmpn_cnd_sub_n_init
227 E2 00022318 __gmpn_cnd_sub_n_pentium4_sse2
228 E3 00019430 __gmpn_cnd_sub_n_x86
229 E4 00026C70 __gmpn_cnd_swap
230 E5 000267F0 __gmpn_com
231 E6 00019C30 __gmpn_com_fat
232 E7 0002690C __gmpn_com_init
233 E8 0001BAC0 __gmpn_com_k6_mmx
234 E9 0001D690 __gmpn_com_k7_mmx
235 EA 0001E0C0 __gmpn_com_pentium
236 EB 000267F8 __gmpn_copyd
237 EC 000244A0 __gmpn_copyd_atom_mmx
238 ED 00026910 __gmpn_copyd_init
239 EE 0001BCE0 __gmpn_copyd_k6_k62mmx
240 EF 0001D6E0 __gmpn_copyd_k7_mmx
241 F0 0001F300 __gmpn_copyd_p6
242 F1 0001E198 __gmpn_copyd_pentium
243 F2 00021CE0 __gmpn_copyd_pentium4
244 F3 000194C0 __gmpn_copyd_x86
245 F4 00026800 __gmpn_copyi
246 F5 00024540 __gmpn_copyi_atom_mmx
247 F6 00026914 __gmpn_copyi_init
248 F7 0001D780 __gmpn_copyi_k7_mmx
249 F8 0001E240 __gmpn_copyi_pentium
250 F9 00021D08 __gmpn_copyi_pentium4
251 FA 00019500 __gmpn_copyi_x86
252 FB 000269A1 __gmpn_cpuid
253 FC 000269B8 __gmpn_cpuid_available
254 FD 0005F080 __gmpn_cpuvec
255 FE 00025A00 __gmpn_cpuvec_init
256 FF 0007C020 __gmpn_cpuvec_initialized
257 100 0002FCE0 __gmpn_dc_set_str
258 101 00052EF0 __gmpn_dcpi1_bdiv_q
259 102 00052D90 __gmpn_dcpi1_bdiv_q_n
260 103 00052D80 __gmpn_dcpi1_bdiv_q_n_itch
261 104 00053510 __gmpn_dcpi1_bdiv_qr
262 105 00053250 __gmpn_dcpi1_bdiv_qr_n
263 106 00053240 __gmpn_dcpi1_bdiv_qr_n_itch
264 107 0004F7D0 __gmpn_dcpi1_div_q
265 108 0004FE00 __gmpn_dcpi1_div_qr
266 109 0004FAB0 __gmpn_dcpi1_div_qr_n
267 10A 000507C0 __gmpn_dcpi1_divappr_q
268 10B 00050570 __gmpn_dcpi1_divappr_q_n
269 10C 00033400 __gmpn_div_q
270 10D 0004DC80 __gmpn_div_qr_1
271 10E 0004DE20 __gmpn_div_qr_1n_pi1
272 10F 0004E040 __gmpn_div_qr_2
273 110 0004E1F0 __gmpn_div_qr_2n_pi1
274 111 0004E310 __gmpn_div_qr_2u_pi1
275 112 00055520 __gmpn_divexact
276 113 00026808 __gmpn_divexact_1
277 114 00023EE0 __gmpn_divexact_1_atom
278 115 00026918 __gmpn_divexact_1_init
279 116 0001BB00 __gmpn_divexact_1_k6_mmx
280 117 0001C250 __gmpn_divexact_1_k7
281 118 0001F370 __gmpn_divexact_1_p6
282 119 0001E300 __gmpn_divexact_1_pentium = ___gmpn_copyd_p6
283 11A 000223A0 __gmpn_divexact_1_pentium4_sse2
284 11B 00019520 __gmpn_divexact_1_x86
285 11C 000015A0 __gmpn_divexact_by3
286 11D 00027310 __gmpn_divexact_by3c
287 11E 00027350 __gmpn_divisible_p
288 11F 000015E0 __gmpn_divmod_1
289 120 000277E0 __gmpn_divrem
290 121 00026810 __gmpn_divrem_1
291 122 00024840 __gmpn_divrem_1_atom_sse2
292 123 0002691C __gmpn_divrem_1_init
293 124 0001ACB0 __gmpn_divrem_1_k6
294 125 0001D8C1 __gmpn_divrem_1_k7_mmx
295 126 000200A1 __gmpn_divrem_1_p6_mmx
296 127 00022500 __gmpn_divrem_1_pentium4_sse2
297 128 000195F6 __gmpn_divrem_1_x86
298 129 00024810 __gmpn_divrem_1c_atom_sse2
299 12A 0001AC80 __gmpn_divrem_1c_k6 = ___gmpn_rshift_k6_mmx
300 12B 0001D890 __gmpn_divrem_1c_k7_mmx
301 12C 00020070 __gmpn_divrem_1c_p6_mmx
302 12D 000224D0 __gmpn_divrem_1c_pentium4_sse2
303 12E 000195D0 __gmpn_divrem_1c_x86 = ___gmpn_modexact_1c_odd_fat
304 12F 00027B10 __gmpn_divrem_2
305 130 00027EA0 __gmpn_dump
306 131 0002B0B0 __gmpn_fft_best_k
307 132 0002B120 __gmpn_fft_next_size
308 133 00027C80 __gmpn_fib2_ui
309 134 00031090 __gmpn_gcd
310 135 00026818 __gmpn_gcd_1
311 136 00019C60 __gmpn_gcd_1_fat
312 137 00026920 __gmpn_gcd_1_init
313 138 0001AD20 __gmpn_gcd_1_k6
314 139 0001C340 __gmpn_gcd_1_k7
315 13A 0001F470 __gmpn_gcd_1_p6
316 13B 00032470 __gmpn_gcd_subdiv_step
317 13C 00031690 __gmpn_gcdext
318 13D 000315F0 __gmpn_gcdext_1
319 13E 000329E0 __gmpn_gcdext_hook
320 13F 00032D40 __gmpn_gcdext_lehmer_n
321 140 00035770 __gmpn_get_d
322 141 0002F340 __gmpn_get_str
323 142 000302C0 __gmpn_hamdist
324 143 00037F50 __gmpn_hgcd
325 144 00036E40 __gmpn_hgcd2
326 145 00038610 __gmpn_hgcd2_jacobi
327 146 000381D0 __gmpn_hgcd_appr
328 147 00038180 __gmpn_hgcd_appr_itch
329 148 00037F00 __gmpn_hgcd_itch
330 149 00038F10 __gmpn_hgcd_jacobi
331 14A 000369E0 __gmpn_hgcd_matrix_adjust
332 14B 00036570 __gmpn_hgcd_matrix_init
333 14C 00036910 __gmpn_hgcd_matrix_mul
334 14D 00036870 __gmpn_hgcd_matrix_mul_1
335 14E 000365E0 __gmpn_hgcd_matrix_update_q
336 14F 000373D0 __gmpn_hgcd_mul_matrix1_vector
337 150 00037DC0 __gmpn_hgcd_reduce
338 151 00037D80 __gmpn_hgcd_reduce_itch
339 152 000374E0 __gmpn_hgcd_step
340 153 0004C520 __gmpn_invert
341 154 0004C4D0 __gmpn_invertappr
342 155 00059010 __gmpn_ior_n
343 156 00059050 __gmpn_iorn_n
344 157 00034F90 __gmpn_jacobi_2
345 158 00034F20 __gmpn_jacobi_base
346 159 00035320 __gmpn_jacobi_n
347 15A 00026820 __gmpn_lshift
348 15B 00023FE0 __gmpn_lshift_atom
349 15C 00026924 __gmpn_lshift_init
350 15D 0001BD40 __gmpn_lshift_k6_k62mmx
351 15E 0001BC20 __gmpn_lshift_k6_mmx
352 15F 0001DB60 __gmpn_lshift_k7_mmx
353 160 00020320 __gmpn_lshift_p6_mmx
354 161 0001E400 __gmpn_lshift_pentium
355 162 00021D50 __gmpn_lshift_pentium4_mmx
356 163 0001EC70 __gmpn_lshift_pentium_mmx
357 164 00019660 __gmpn_lshift_x86
358 165 00026828 __gmpn_lshiftc
359 166 00024110 __gmpn_lshiftc_atom
360 167 00019D80 __gmpn_lshiftc_fat
361 168 00026928 __gmpn_lshiftc_init
362 169 00036270 __gmpn_matrix22_mul
363 16A 000364D0 __gmpn_matrix22_mul1_inverse_vector
364 16B 000359E0 __gmpn_matrix22_mul_itch = ___gmpn_hgcd_matrix_adjust
365 16C 00035A10 __gmpn_matrix22_mul_strassen
366 16D 00026830 __gmpn_mod_1
367 16E 00026838 __gmpn_mod_1_1p
368 16F 00024A50 __gmpn_mod_1_1p_atom_sse2
369 170 00026840 __gmpn_mod_1_1p_cps
370 171 00024B02 __gmpn_mod_1_1p_cps_atom_sse2
371 172 00019FA0 __gmpn_mod_1_1p_cps_fat
372 173 00026934 __gmpn_mod_1_1p_cps_init
373 174 0001C4B2 __gmpn_mod_1_1p_cps_k7
374 175 00020852 __gmpn_mod_1_1p_cps_p6_sse2
375 176 000227C2 __gmpn_mod_1_1p_cps_pentium4_sse2
376 177 0001A020 __gmpn_mod_1_1p_fat
377 178 00026930 __gmpn_mod_1_1p_init
378 179 0001C3E0 __gmpn_mod_1_1p_k7
379 17A 000207A0 __gmpn_mod_1_1p_p6_sse2
380 17B 00022710 __gmpn_mod_1_1p_pentium4_sse2
381 17C 00019E20 __gmpn_mod_1_fat
382 17D 0002692C __gmpn_mod_1_init
383 17E 00026848 __gmpn_mod_1s_2p
384 17F 00026850 __gmpn_mod_1s_2p_cps
385 180 0001A0F0 __gmpn_mod_1s_2p_cps_fat
386 181 0002693C __gmpn_mod_1s_2p_cps_init
387 182 0001A180 __gmpn_mod_1s_2p_fat
388 183 00026938 __gmpn_mod_1s_2p_init
389 184 00027FE0 __gmpn_mod_1s_3p
390 185 00027F30 __gmpn_mod_1s_3p_cps
391 186 00026858 __gmpn_mod_1s_4p
392 187 00024B60 __gmpn_mod_1s_4p_atom_sse2
393 188 00026860 __gmpn_mod_1s_4p_cps
394 189 00024CA0 __gmpn_mod_1s_4p_cps_atom_sse2
395 18A 0001A340 __gmpn_mod_1s_4p_cps_fat
396 18B 00026944 __gmpn_mod_1s_4p_cps_init
397 18C 0001C640 __gmpn_mod_1s_4p_cps_k7
398 18D 000209F0 __gmpn_mod_1s_4p_cps_p6_sse2
399 18E 00022960 __gmpn_mod_1s_4p_cps_pentium4_sse2
400 18F 0001A410 __gmpn_mod_1s_4p_fat
401 190 00026940 __gmpn_mod_1s_4p_init
402 191 0001C500 __gmpn_mod_1s_4p_k7
403 192 000208B0 __gmpn_mod_1s_4p_p6_sse2
404 193 00022820 __gmpn_mod_1s_4p_pentium4_sse2
405 194 00026868 __gmpn_mod_34lsub1
406 195 000241D0 __gmpn_mod_34lsub1_atom
407 196 00026948 __gmpn_mod_34lsub1_init
408 197 0001AE10 __gmpn_mod_34lsub1_k6
409 198 0001C700 __gmpn_mod_34lsub1_k7
410 199 0001F4E0 __gmpn_mod_34lsub1_p6
411 19A 0001E550 __gmpn_mod_34lsub1_pentium
412 19B 00022A00 __gmpn_mod_34lsub1_pentium4_sse2
413 19C 000196C0 __gmpn_mod_34lsub1_x86
414 19D 000242B0 __gmpn_modexact_1_odd_atom
415 19E 0001AED0 __gmpn_modexact_1_odd_k6
416 19F 0001C7D0 __gmpn_modexact_1_odd_k7
417 1A0 0001F5C0 __gmpn_modexact_1_odd_p6
418 1A1 0001E610 __gmpn_modexact_1_odd_pentium
419 1A2 00022AD0 __gmpn_modexact_1_odd_pentium4_sse2
420 1A3 00026870 __gmpn_modexact_1c_odd
421 1A4 000242A0 __gmpn_modexact_1c_odd_atom
422 1A5 0001A5D0 __gmpn_modexact_1c_odd_fat
423 1A6 0002694C __gmpn_modexact_1c_odd_init
424 1A7 0001AEC0 __gmpn_modexact_1c_odd_k6
425 1A8 0001C7C0 __gmpn_modexact_1c_odd_k7
426 1A9 0001F5B0 __gmpn_modexact_1c_odd_p6
427 1AA 0001E600 __gmpn_modexact_1c_odd_pentium
428 1AB 00022AC0 __gmpn_modexact_1c_odd_pentium4_sse2
429 1AC 00053980 __gmpn_mu_bdiv_q
430 1AD 00053FA0 __gmpn_mu_bdiv_q_itch
431 1AE 00054050 __gmpn_mu_bdiv_qr
432 1AF 00054880 __gmpn_mu_bdiv_qr_itch
433 1B0 00052390 __gmpn_mu_div_q
434 1B1 00052840 __gmpn_mu_div_q_itch
435 1B2 000515F0 __gmpn_mu_div_qr
436 1B3 00051890 __gmpn_mu_div_qr_choose_in
437 1B4 000518F0 __gmpn_mu_div_qr_itch = ___gmpn_bdiv_q_1
438 1B5 000520B0 __gmpn_mu_divappr_q
439 1B6 000522C0 __gmpn_mu_divappr_q_choose_in
440 1B7 00052320 __gmpn_mu_divappr_q_itch
441 1B8 00028160 __gmpn_mul
442 1B9 00026878 __gmpn_mul_1
443 1BA 00024D48 __gmpn_mul_1_atom_sse2
444 1BB 00026950 __gmpn_mul_1_init
445 1BC 0001AF47 __gmpn_mul_1_k6
446 1BD 0001C920 __gmpn_mul_1_k7
447 1BE 00020A90 __gmpn_mul_1_p6_sse2
448 1BF 0001E6C8 __gmpn_mul_1_pentium
449 1C0 00022B50 __gmpn_mul_1_pentium4_sse2
450 1C1 0001EDE8 __gmpn_mul_1_pentium_mmx
451 1C2 00019770 __gmpn_mul_1_x86
452 1C3 00024D40 __gmpn_mul_1c_atom_sse2
453 1C4 0001AF40 __gmpn_mul_1c_k6
454 1C5 0001C850 __gmpn_mul_1c_k7
455 1C6 00020BCB __gmpn_mul_1c_p6_sse2
456 1C7 0001E6C0 __gmpn_mul_1c_pentium
457 1C8 00022C8B __gmpn_mul_1c_pentium4_sse2
458 1C9 00026880 __gmpn_mul_basecase
459 1CA 00024DE0 __gmpn_mul_basecase_atom_sse2
460 1CB 00026954 __gmpn_mul_basecase_init
461 1CC 0001B040 __gmpn_mul_basecase_k6
462 1CD 0001CA40 __gmpn_mul_basecase_k7
463 1CE 0001F640 __gmpn_mul_basecase_p6
464 1CF 00020BE0 __gmpn_mul_basecase_p6_sse2
465 1D0 0001E748 __gmpn_mul_basecase_pentium
466 1D1 00022CA0 __gmpn_mul_basecase_pentium4_sse2
467 1D2 00019810 __gmpn_mul_basecase_x86
468 1D3 0002B140 __gmpn_mul_fft
469 1D4 0002B590 __gmpn_mul_n
470 1D5 00026888 __gmpn_mullo_basecase
471 1D6 0001A6B0 __gmpn_mullo_basecase_fat
472 1D7 0002695B __gmpn_mullo_basecase_init
473 1D8 00039410 __gmpn_mullo_n
474 1D9 0002C560 __gmpn_mulmid
475 1DA 0002BAC0 __gmpn_mulmid_basecase
476 1DB 0002C480 __gmpn_mulmid_n
477 1DC 0004CAE0 __gmpn_mulmod_bnm1
478 1DD 0004D420 __gmpn_mulmod_bnm1_next_size
479 1DE 00058FD0 __gmpn_nand_n
480 1DF 00026CD0 __gmpn_neg
481 1E0 0004BDA0 __gmpn_ni_invertappr
482 1E1 00059090 __gmpn_nior_n
483 1E2 0002B960 __gmpn_nussbaumer_mul
484 1E3 00030CA0 __gmpn_perfect_power_p
485 1E4 000304D0 __gmpn_perfect_square_p
486 1E5 00052870 __gmpn_pi1_bdiv_q_1
487 1E6 00030140 __gmpn_popcount
488 1E7 0002D000 __gmpn_pow_1
489 1E8 000572A0 __gmpn_powlo
490 1E9 000559A0 __gmpn_powm
491 1EA 00026890 __gmpn_preinv_divrem_1
492 1EB 000247A0 __gmpn_preinv_divrem_1_atom_sse2
493 1EC 00026962 __gmpn_preinv_divrem_1_init
494 1ED 0001D820 __gmpn_preinv_divrem_1_k7_mmx
495 1EE 00020000 __gmpn_preinv_divrem_1_p6_mmx
496 1EF 00022460 __gmpn_preinv_divrem_1_pentium4_sse2
497 1F0 00026898 __gmpn_preinv_mod_1
498 1F1 00026969 __gmpn_preinv_mod_1_init
499 1F2 0001B360 __gmpn_preinv_mod_1_k6
500 1F3 00050E20 __gmpn_preinv_mu_div_qr
501 1F4 00051950 __gmpn_preinv_mu_div_qr_itch
502 1F5 00051990 __gmpn_preinv_mu_divappr_q
503 1F6 0002CE00 __gmpn_random
504 1F7 0002CE90 __gmpn_random2
505 1F8 000268A0 __gmpn_redc_1
506 1F9 0001A790 __gmpn_redc_1_fat
507 1FA 00026970 __gmpn_redc_1_init
508 1FB 000268A8 __gmpn_redc_2
509 1FC 0001A830 __gmpn_redc_2_fat
510 1FD 00026977 __gmpn_redc_2_init
511 1FE 00055720 __gmpn_redc_n
512 1FF 00058BB0 __gmpn_remove
513 200 0002DED0 __gmpn_rootrem
514 201 000268B0 __gmpn_rshift
515 202 00024360 __gmpn_rshift_atom
516 203 0002697E __gmpn_rshift_init
517 204 0001BE80 __gmpn_rshift_k6_k62mmx
518 205 0001BC80 __gmpn_rshift_k6_mmx
519 206 0001DD80 __gmpn_rshift_k7_mmx
520 207 00020498 __gmpn_rshift_p6_mmx
521 208 0001E7E8 __gmpn_rshift_pentium
522 209 00021EC8 __gmpn_rshift_pentium4_mmx
523 20A 0001EF30 __gmpn_rshift_pentium_mmx
524 20B 00019940 __gmpn_rshift_x86
525 20C 00052940 __gmpn_sbpi1_bdiv_q
526 20D 00052AB0 __gmpn_sbpi1_bdiv_qr
527 20E 0004E4E0 __gmpn_sbpi1_div_q
528 20F 0004EEC0 __gmpn_sbpi1_div_qr
529 210 0004F130 __gmpn_sbpi1_divappr_q
530 211 000300B0 __gmpn_scan0
531 212 00030100 __gmpn_scan1
532 213 000586E0 __gmpn_sec_add_1
533 214 000586D0 __gmpn_sec_add_1_itch
534 215 00057FC0 __gmpn_sec_div_qr
535 216 00057FB0 __gmpn_sec_div_qr_itch
536 217 00058140 __gmpn_sec_div_r
537 218 00058130 __gmpn_sec_div_r_itch
538 219 000587A0 __gmpn_sec_invert
539 21A 00058790 __gmpn_sec_invert_itch
540 21B 00057F50 __gmpn_sec_mul = ___gmpn_and_n
541 21C 00057F60 __gmpn_sec_mul_itch
542 21D 00058270 __gmpn_sec_pi1_div_qr
543 21E 00058500 __gmpn_sec_pi1_div_r
544 21F 000576C0 __gmpn_sec_powm
545 220 00057EC0 __gmpn_sec_powm_itch
546 221 00057F70 __gmpn_sec_sqr
547 222 00057FA0 __gmpn_sec_sqr_itch
548 223 00058740 __gmpn_sec_sub_1
549 224 00058730 __gmpn_sec_sub_1_itch
550 225 00059180 __gmpn_sec_tabselect
551 226 0002FF00 __gmpn_set_str
552 227 0002F890 __gmpn_set_str_compute_powtab
553 228 0002EEE0 __gmpn_sizeinbase
554 229 0002B7D0 __gmpn_sqr
555 22A 000268B8 __gmpn_sqr_basecase
556 22B 000252E0 __gmpn_sqr_basecase_atom_sse2
557 22C 00026985 __gmpn_sqr_basecase_init
558 22D 0001B3E0 __gmpn_sqr_basecase_k6 = ___gmpn_mod_1_1p_k7
559 22E 0001CEC0 __gmpn_sqr_basecase_k7
560 22F 0001F980 __gmpn_sqr_basecase_p6
561 230 00021330 __gmpn_sqr_basecase_p6_sse2
562 231 0001E938 __gmpn_sqr_basecase_pentium
563 232 000233F0 __gmpn_sqr_basecase_pentium4_sse2
564 233 00019998 __gmpn_sqr_basecase_x86
565 234 00039520 __gmpn_sqrlo
566 235 00039800 __gmpn_sqrlo_basecase
567 236 0004D4A0 __gmpn_sqrmod_bnm1
568 237 0004DC00 __gmpn_sqrmod_bnm1_next_size
569 238 0002EA90 __gmpn_sqrtrem
570 239 00026B30 __gmpn_sub
571 23A 00026BD0 __gmpn_sub_1
572 23B 00027020 __gmpn_sub_err1_n
573 23C 000270C0 __gmpn_sub_err2_n
574 23D 000271C0 __gmpn_sub_err3_n
575 23E 000268C0 __gmpn_sub_n
576 23F 00024410 __gmpn_sub_n_atom
577 240 0002698C __gmpn_sub_n_init
578 241 0001B7C6 __gmpn_sub_n_k6
579 242 0001D406 __gmpn_sub_n_k7
580 243 0001FD80 __gmpn_sub_n_p6
581 244 0001EB68 __gmpn_sub_n_pentium
582 245 00023BD8 __gmpn_sub_n_pentium4_sse2
583 246 00019AF0 __gmpn_sub_n_x86
584 247 0002447E __gmpn_sub_nc_atom
585 248 0001B7C0 __gmpn_sub_nc_k6 = ___gmpn_modexact_1c_odd_k7
586 249 0001D400 __gmpn_sub_nc_k7 = ___gmpn_lshift_pentium
587 24A 0001FE27 __gmpn_sub_nc_p6
588 24B 0001EB30 __gmpn_sub_nc_pentium
589 24C 00023BD0 __gmpn_sub_nc_pentium4_sse2
590 24D 00019AB0 __gmpn_sub_nc_x86
591 24E 000268C8 __gmpn_sublsh1_n
592 24F 00026993 __gmpn_sublsh1_n_init
593 250 000268D0 __gmpn_submul_1
594 251 000258E0 __gmpn_submul_1_atom_sse2
595 252 0002699A __gmpn_submul_1_init
596 253 0001B907 __gmpn_submul_1_k6
597 254 0001D580 __gmpn_submul_1_k7
598 255 0001FE47 __gmpn_submul_1_p6
599 256 00021B27 __gmpn_submul_1_p6_sse2
600 257 0001EC28 __gmpn_submul_1_pentium
601 258 00023C57 __gmpn_submul_1_pentium4_sse2
602 259 00019B90 __gmpn_submul_1_x86
603 25A 000259E9 __gmpn_submul_1c_atom_sse2
604 25B 0001B900 __gmpn_submul_1c_k6
605 25C 0001FE40 __gmpn_submul_1c_p6
606 25D 00021B20 __gmpn_submul_1c_p6_sse2
607 25E 0001EC20 __gmpn_submul_1c_pentium
608 25F 00023C50 __gmpn_submul_1c_pentium4_sse2
609 260 00034110 __gmpn_tdiv_qr
610 261 00039A40 __gmpn_toom22_mul
611 262 00046220 __gmpn_toom2_sqr
612 263 0003A0B0 __gmpn_toom32_mul
613 264 0003D190 __gmpn_toom33_mul
614 265 00046570 __gmpn_toom3_sqr
615 266 0003AD40 __gmpn_toom42_mul
616 267 0002BB60 __gmpn_toom42_mulmid
617 268 0003DC70 __gmpn_toom43_mul
618 269 0003FB00 __gmpn_toom44_mul
619 26A 00046BB0 __gmpn_toom4_sqr
620 26B 0003B640 __gmpn_toom52_mul
621 26C 0003E330 __gmpn_toom53_mul
622 26D 0003ED70 __gmpn_toom54_mul
623 26E 0003C2A0 __gmpn_toom62_mul
624 26F 0003F260 __gmpn_toom63_mul
625 270 00041E60 __gmpn_toom6_sqr
626 271 000409D0 __gmpn_toom6h_mul
627 272 00044E70 __gmpn_toom8_sqr
628 273 000430D0 __gmpn_toom8h_mul
629 274 000460A0 __gmpn_toom_couple_handling
630 275 00047740 __gmpn_toom_eval_dgr3_pm1
631 276 000478E0 __gmpn_toom_eval_dgr3_pm2
632 277 00047AF0 __gmpn_toom_eval_pm1
633 278 00047E20 __gmpn_toom_eval_pm2
634 279 00048190 __gmpn_toom_eval_pm2exp
635 27A 00048520 __gmpn_toom_eval_pm2rexp
636 27B 00049D40 __gmpn_toom_interpolate_12pts
637 27C 0004A940 __gmpn_toom_interpolate_16pts
638 27D 00048870 __gmpn_toom_interpolate_5pts
639 27E 00048BA0 __gmpn_toom_interpolate_6pts
640 27F 00049090 __gmpn_toom_interpolate_7pts
641 280 00049730 __gmpn_toom_interpolate_8pts
642 281 000589F0 __gmpn_trialdiv
643 282 00059208 __gmpn_udiv_qrnnd
644 283 000591F0 __gmpn_umul_ppmm
645 284 00059110 __gmpn_xnor_n
646 285 000590D0 __gmpn_xor_n
647 286 00059150 __gmpn_zero
648 287 000304A0 __gmpn_zero_p
649 288 00016E70 __gmpq_abs
650 289 00017240 __gmpq_add
651 28A 00017280 __gmpq_canonicalize
652 28B 00017380 __gmpq_clear
653 28C 000173C0 __gmpq_clears = ___gmpq_mul_2exp
654 28D 000177B0 __gmpq_cmp
655 28E 00017810 __gmpq_cmp_si
656 28F 00017890 __gmpq_cmp_ui
657 290 000177E0 __gmpq_cmp_z
658 291 00017A00 __gmpq_div = ___gmpq_set_str
659 292 000183E0 __gmpq_div_2exp
660 293 00018B30 __gmpq_equal
661 294 00017D10 __gmpq_get_d
662 295 00017EA0 __gmpq_get_den
663 296 00017EF0 __gmpq_get_num = ___gmpq_set_f
664 297 00017F50 __gmpq_get_str
665 298 00018040 __gmpq_init
666 299 00018090 __gmpq_inits
667 29A 000180C0 __gmpq_inp_str
668 29B 00018180 __gmpq_inv
669 29C 00018430 __gmpq_mul = ___gmpn_cnd_sub_n_x86
670 29D 000183C0 __gmpq_mul_2exp
671 29E 00018700 __gmpq_neg
672 29F 000187A0 __gmpq_out_str
673 2A0 00018840 __gmpq_set
674 2A1 00018C40 __gmpq_set_d
675 2A2 000188D0 __gmpq_set_den
676 2A3 00018EF0 __gmpq_set_f
677 2A4 00018930 __gmpq_set_num
678 2A5 00018990 __gmpq_set_si
679 2A6 00018A00 __gmpq_set_str
680 2A7 00018AE0 __gmpq_set_ui
681 2A8 00018BD0 __gmpq_set_z
682 2A9 00017260 __gmpq_sub
683 2AA 00019140 __gmpq_swap
684 2AB 0000BD90 __gmpz_2fac_ui
685 2AC 00006CB0 __gmpz_abs
686 2AD 00006D10 __gmpz_add
687 2AE 00007020 __gmpz_add_ui
688 2AF 00007670 __gmpz_addmul
689 2B0 00007A90 __gmpz_addmul_ui
690 2B1 00007AF0 __gmpz_and
691 2B2 000076B0 __gmpz_aorsmul_1
692 2B3 00008140 __gmpz_array_init
693 2B4 000081A0 __gmpz_bin_ui
694 2B5 00008FC0 __gmpz_bin_uiui
695 2B6 000091D0 __gmpz_cdiv_q
696 2B7 00009950 __gmpz_cdiv_q_2exp
697 2B8 000092A0 __gmpz_cdiv_q_ui
698 2B9 00009380 __gmpz_cdiv_qr
699 2BA 00009490 __gmpz_cdiv_qr_ui
700 2BB 00009590 __gmpz_cdiv_r
701 2BC 00009C40 __gmpz_cdiv_r_2exp
702 2BD 00009680 __gmpz_cdiv_r_ui
703 2BE 00009700 __gmpz_cdiv_ui
704 2BF 00009C80 __gmpz_clear
705 2C0 00009CA0 __gmpz_clears
706 2C1 00009CE0 __gmpz_clrbit
707 2C2 00009E60 __gmpz_cmp
708 2C3 00009EC0 __gmpz_cmp_d
709 2C4 0000A0A0 __gmpz_cmp_si
710 2C5 0000A100 __gmpz_cmp_ui
711 2C6 0000A140 __gmpz_cmpabs
712 2C7 0000A1A0 __gmpz_cmpabs_d
713 2C8 0000A300 __gmpz_cmpabs_ui = ___gmpz_divexact_ui
714 2C9 0000A340 __gmpz_com
715 2CA 0000A540 __gmpz_combit
716 2CB 0000AC60 __gmpz_congruent_2exp_p
717 2CC 0000A780 __gmpz_congruent_p
718 2CD 0000AE30 __gmpz_congruent_ui_p
719 2CE 0000AFA0 __gmpz_divexact
720 2CF 0000B150 __gmpz_divexact_gcd
721 2D0 0000B300 __gmpz_divexact_ui
722 2D1 0000B4D0 __gmpz_divisible_2exp_p
723 2D2 0000B3B0 __gmpz_divisible_p
724 2D3 0000B410 __gmpz_divisible_ui_p
725 2D4 0000B550 __gmpz_dump
726 2D5 0000B5A0 __gmpz_export
727 2D6 0000BF10 __gmpz_fac_ui
728 2D7 0000CDB0 __gmpz_fdiv_q
729 2D8 00009980 __gmpz_fdiv_q_2exp
730 2D9 0000C930 __gmpz_fdiv_q_ui
731 2DA 0000CA10 __gmpz_fdiv_qr
732 2DB 0000CB30 __gmpz_fdiv_qr_ui
733 2DC 0000CC40 __gmpz_fdiv_r
734 2DD 00009C60 __gmpz_fdiv_r_2exp = ___gmpz_congruent_2exp_p
735 2DE 0000CD30 __gmpz_fdiv_r_ui
736 2DF 0000CE80 __gmpz_fdiv_ui
737 2E0 0000D120 __gmpz_fib2_ui
738 2E1 0000CEF0 __gmpz_fib_ui
739 2E2 0000D1E0 __gmpz_fits_sint_p = ___gmpz_import
740 2E3 0000D220 __gmpz_fits_slong_p
741 2E4 0000D260 __gmpz_fits_sshort_p
742 2E5 0000D2A0 __gmpz_fits_uint_p
743 2E6 0000D2B0 __gmpz_fits_ulong_p
744 2E7 0000D2C0 __gmpz_fits_ushort_p
745 2E8 0000D2F0 __gmpz_gcd
746 2E9 0000D7C0 __gmpz_gcd_ui
747 2EA 0000D860 __gmpz_gcdext
748 2EB 0000DBC0 __gmpz_get_d
749 2EC 0000DC10 __gmpz_get_d_2exp = ___gmpz_ior
750 2ED 0000DC80 __gmpz_get_si
751 2EE 0000DCC0 __gmpz_get_str
752 2EF 0000DF40 __gmpz_get_ui
753 2F0 0000DF60 __gmpz_getlimbn
754 2F1 0000DF90 __gmpz_hamdist
755 2F2 0000E1E0 __gmpz_import
756 2F3 0000E540 __gmpz_init
757 2F4 0000E570 __gmpz_init2
758 2F5 0000F300 __gmpz_init_set
759 2F6 0000F360 __gmpz_init_set_d
760 2F7 0000F3B0 __gmpz_init_set_si
761 2F8 0000F410 __gmpz_init_set_str
762 2F9 0000F460 __gmpz_init_set_ui
763 2FA 0000E5B0 __gmpz_inits
764 2FB 0000E5F0 __gmpz_inp_raw
765 2FC 0000EA50 __gmpz_inp_str
766 2FD 0000E760 __gmpz_inp_str_nowhite
767 2FE 0000EAB0 __gmpz_invert
768 2FF 0000EC10 __gmpz_ior
769 300 0000F4A0 __gmpz_jacobi
770 301 0000FC20 __gmpz_kronecker_si
771 302 0000FD80 __gmpz_kronecker_ui
772 303 0000FEC0 __gmpz_lcm
773 304 00010050 __gmpz_lcm_ui
774 305 00001620 __gmpz_legendre
775 306 00010100 __gmpz_limbs_finish
776 307 00010150 __gmpz_limbs_modify
777 308 00010170 __gmpz_limbs_read
778 309 00010180 __gmpz_limbs_write
779 30A 000104D0 __gmpz_lucnum2_ui
780 30B 000101A0 __gmpz_lucnum_ui
781 30C 0000B9C0 __gmpz_mfac_uiui
782 30D 000106E0 __gmpz_millerrabin
783 30E 00010A60 __gmpz_mod
784 30F 00010B50 __gmpz_mul
785 310 00010E40 __gmpz_mul_2exp
786 311 00010F10 __gmpz_mul_si
787 312 00010FD0 __gmpz_mul_ui
788 313 00011070 __gmpz_n_pow_ui
789 314 000115E0 __gmpz_neg
790 315 00011640 __gmpz_nextprime
791 316 0000C060 __gmpz_oddfac_1
792 317 00011830 __gmpz_out_raw
793 318 00011930 __gmpz_out_str
794 319 00011BC0 __gmpz_perfect_power_p
795 31A 00011BE0 __gmpz_perfect_square_p
796 31B 00011C10 __gmpz_popcount
797 31C 00011C40 __gmpz_pow_ui
798 31D 00011CB0 __gmpz_powm
799 31E 00012760 __gmpz_powm_sec
800 31F 00012D80 __gmpz_powm_ui
801 320 000134F0 __gmpz_primorial_ui
802 321 000136B0 __gmpz_probab_prime_p
803 322 0000C6E0 __gmpz_prodlimbs
804 323 00013A10 __gmpz_random
805 324 00013A80 __gmpz_random2
806 325 00013AD0 __gmpz_realloc
807 326 00013B60 __gmpz_realloc2
808 327 00013BC0 __gmpz_remove
809 328 00013F60 __gmpz_roinit_n
810 329 00013FB0 __gmpz_root
811 32A 00014160 __gmpz_rootrem
812 32B 000143D0 __gmpz_rrandomb
813 32C 00014530 __gmpz_scan0 = ___gmpz_swap
814 32D 00014630 __gmpz_scan1
815 32E 00014750 __gmpz_set
816 32F 000147B0 __gmpz_set_d
817 330 000148A0 __gmpz_set_f
818 331 00014950 __gmpz_set_q
819 332 00014980 __gmpz_set_si
820 333 000149B0 __gmpz_set_str = ___gmpz_tdiv_qr
821 334 00014C30 __gmpz_set_ui
822 335 00014C50 __gmpz_setbit = ___gmpz_tdiv_qr_ui
823 336 0000F890 __gmpz_si_kronecker
824 337 00014DA0 __gmpz_size
825 338 00014DC0 __gmpz_sizeinbase
826 339 00014E30 __gmpz_sqrt
827 33A 00014F30 __gmpz_sqrtrem
828 33B 000150A0 __gmpz_sub
829 33C 00015350 __gmpz_sub_ui
830 33D 00007690 __gmpz_submul
831 33E 00007AC0 __gmpz_submul_ui
832 33F 00015530 __gmpz_swap
833 340 000155B0 __gmpz_tdiv_q
834 341 00015850 __gmpz_tdiv_q_2exp
835 342 00015900 __gmpz_tdiv_q_ui
836 343 000159B0 __gmpz_tdiv_qr
837 344 00015C50 __gmpz_tdiv_qr_ui
838 345 00015D50 __gmpz_tdiv_r
839 346 00015FD0 __gmpz_tdiv_r_2exp
840 347 000160E0 __gmpz_tdiv_r_ui
841 348 00015560 __gmpz_tdiv_ui
842 349 00016150 __gmpz_tstbit
843 34A 0000FA70 __gmpz_ui_kronecker
844 34B 000161D0 __gmpz_ui_pow_ui
845 34C 00016210 __gmpz_ui_sub
846 34D 00016420 __gmpz_urandomb
847 34E 000164B0 __gmpz_urandomm
848 34F 000166C0 __gmpz_xor
Summary
1000 .CRT
1000 .bss
1000 .data
2000 .debug_abbrev
1000 .debug_aranges
37000 .debug_info
3000 .debug_line
1000 .debug_loc
1000 .debug_ranges
1000 .debug_str
6000 .edata
C000 .eh_frame
1000 .idata
10000 .rdata
3000 .reloc
5E000 .text
1000 .tls