commit initial version 0.1
This commit is contained in:
1 parent
24402aed6d
commit
6aac3fbba5
807 files changed
+147888
-674
No files matched your search
@@ -0,0 +1,9 @@
|
||||
|
||||
It is advised to run ./autogen.sh before./configure (autoconf and automake
|
||||
need to be installed on your system for autogen.sh to work)
|
||||
|
||||
./configure has an option named --with-cuda that allows you to specify
|
||||
where your CUDA 5.5 toolkit is installed (usually /usr/local/cuda-5.5,
|
||||
but some distros may have a different default location)
|
||||
|
||||
See README.txt
|
||||
@@ -1,674 +1,3 @@
|
||||
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:
|
||||
|
||||
{project} Copyright (C) {year} {fullname}
|
||||
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>.
|
||||
ccminer is available under the terms of the GNU Public License version 3.
|
||||
|
||||
See LICENSE.TXT for details.
|
||||
+885
@@ -0,0 +1,885 @@
|
||||
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>.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Apache License
|
||||
Version 2.0, January 2004
|
||||
http://www.apache.org/licenses/
|
||||
|
||||
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||
|
||||
1. Definitions.
|
||||
|
||||
"License" shall mean the terms and conditions for use, reproduction,
|
||||
and distribution as defined by Sections 1 through 9 of this document.
|
||||
|
||||
"Licensor" shall mean the copyright owner or entity authorized by
|
||||
the copyright owner that is granting the License.
|
||||
|
||||
"Legal Entity" shall mean the union of the acting entity and all
|
||||
other entities that control, are controlled by, or are under common
|
||||
control with that entity. For the purposes of this definition,
|
||||
"control" means (i) the power, direct or indirect, to cause the
|
||||
direction or management of such entity, whether by contract or
|
||||
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||
|
||||
"You" (or "Your") shall mean an individual or Legal Entity
|
||||
exercising permissions granted by this License.
|
||||
|
||||
"Source" form shall mean the preferred form for making modifications,
|
||||
including but not limited to software source code, documentation
|
||||
source, and configuration files.
|
||||
|
||||
"Object" form shall mean any form resulting from mechanical
|
||||
transformation or translation of a Source form, including but
|
||||
not limited to compiled object code, generated documentation,
|
||||
and conversions to other media types.
|
||||
|
||||
"Work" shall mean the work of authorship, whether in Source or
|
||||
Object form, made available under the License, as indicated by a
|
||||
copyright notice that is included in or attached to the work
|
||||
(an example is provided in the Appendix below).
|
||||
|
||||
"Derivative Works" shall mean any work, whether in Source or Object
|
||||
form, that is based on (or derived from) the Work and for which the
|
||||
editorial revisions, annotations, elaborations, or other modifications
|
||||
represent, as a whole, an original work of authorship. For the purposes
|
||||
of this License, Derivative Works shall not include works that remain
|
||||
separable from, or merely link (or bind by name) to the interfaces of,
|
||||
the Work and Derivative Works thereof.
|
||||
|
||||
"Contribution" shall mean any work of authorship, including
|
||||
the original version of the Work and any modifications or additions
|
||||
to that Work or Derivative Works thereof, that is intentionally
|
||||
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||
or by an individual or Legal Entity authorized to submit on behalf of
|
||||
the copyright owner. For the purposes of this definition, "submitted"
|
||||
means any form of electronic, verbal, or written communication sent
|
||||
to the Licensor or its representatives, including but not limited to
|
||||
communication on electronic mailing lists, source code control systems,
|
||||
and issue tracking systems that are managed by, or on behalf of, the
|
||||
Licensor for the purpose of discussing and improving the Work, but
|
||||
excluding communication that is conspicuously marked or otherwise
|
||||
designated in writing by the copyright owner as "Not a Contribution."
|
||||
|
||||
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||
on behalf of whom a Contribution has been received by Licensor and
|
||||
subsequently incorporated within the Work.
|
||||
|
||||
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
copyright license to reproduce, prepare Derivative Works of,
|
||||
publicly display, publicly perform, sublicense, and distribute the
|
||||
Work and such Derivative Works in Source or Object form.
|
||||
|
||||
3. Grant of Patent License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
(except as stated in this section) patent license to make, have made,
|
||||
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||
where such license applies only to those patent claims licensable
|
||||
by such Contributor that are necessarily infringed by their
|
||||
Contribution(s) alone or by combination of their Contribution(s)
|
||||
with the Work to which such Contribution(s) was submitted. If You
|
||||
institute patent litigation against any entity (including a
|
||||
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||
or a Contribution incorporated within the Work constitutes direct
|
||||
or contributory patent infringement, then any patent licenses
|
||||
granted to You under this License for that Work shall terminate
|
||||
as of the date such litigation is filed.
|
||||
|
||||
4. Redistribution. You may reproduce and distribute copies of the
|
||||
Work or Derivative Works thereof in any medium, with or without
|
||||
modifications, and in Source or Object form, provided that You
|
||||
meet the following conditions:
|
||||
|
||||
(a) You must give any other recipients of the Work or
|
||||
Derivative Works a copy of this License; and
|
||||
|
||||
(b) You must cause any modified files to carry prominent notices
|
||||
stating that You changed the files; and
|
||||
|
||||
(c) You must retain, in the Source form of any Derivative Works
|
||||
that You distribute, all copyright, patent, trademark, and
|
||||
attribution notices from the Source form of the Work,
|
||||
excluding those notices that do not pertain to any part of
|
||||
the Derivative Works; and
|
||||
|
||||
(d) If the Work includes a "NOTICE" text file as part of its
|
||||
distribution, then any Derivative Works that You distribute must
|
||||
include a readable copy of the attribution notices contained
|
||||
within such NOTICE file, excluding those notices that do not
|
||||
pertain to any part of the Derivative Works, in at least one
|
||||
of the following places: within a NOTICE text file distributed
|
||||
as part of the Derivative Works; within the Source form or
|
||||
documentation, if provided along with the Derivative Works; or,
|
||||
within a display generated by the Derivative Works, if and
|
||||
wherever such third-party notices normally appear. The contents
|
||||
of the NOTICE file are for informational purposes only and
|
||||
do not modify the License. You may add Your own attribution
|
||||
notices within Derivative Works that You distribute, alongside
|
||||
or as an addendum to the NOTICE text from the Work, provided
|
||||
that such additional attribution notices cannot be construed
|
||||
as modifying the License.
|
||||
|
||||
You may add Your own copyright statement to Your modifications and
|
||||
may provide additional or different license terms and conditions
|
||||
for use, reproduction, or distribution of Your modifications, or
|
||||
for any such Derivative Works as a whole, provided Your use,
|
||||
reproduction, and distribution of the Work otherwise complies with
|
||||
the conditions stated in this License.
|
||||
|
||||
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||
any Contribution intentionally submitted for inclusion in the Work
|
||||
by You to the Licensor shall be under the terms and conditions of
|
||||
this License, without any additional terms or conditions.
|
||||
Notwithstanding the above, nothing herein shall supersede or modify
|
||||
the terms of any separate license agreement you may have executed
|
||||
with Licensor regarding such Contributions.
|
||||
|
||||
6. Trademarks. This License does not grant permission to use the trade
|
||||
names, trademarks, service marks, or product names of the Licensor,
|
||||
except as required for reasonable and customary use in describing the
|
||||
origin of the Work and reproducing the content of the NOTICE file.
|
||||
|
||||
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||
agreed to in writing, Licensor provides the Work (and each
|
||||
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||
implied, including, without limitation, any warranties or conditions
|
||||
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||
appropriateness of using or redistributing the Work and assume any
|
||||
risks associated with Your exercise of permissions under this License.
|
||||
|
||||
8. Limitation of Liability. In no event and under no legal theory,
|
||||
whether in tort (including negligence), contract, or otherwise,
|
||||
unless required by applicable law (such as deliberate and grossly
|
||||
negligent acts) or agreed to in writing, shall any Contributor be
|
||||
liable to You for damages, including any direct, indirect, special,
|
||||
incidental, or consequential damages of any character arising as a
|
||||
result of this License or out of the use or inability to use the
|
||||
Work (including but not limited to damages for loss of goodwill,
|
||||
work stoppage, computer failure or malfunction, or any and all
|
||||
other commercial damages or losses), even if such Contributor
|
||||
has been advised of the possibility of such damages.
|
||||
|
||||
9. Accepting Warranty or Additional Liability. While redistributing
|
||||
the Work or Derivative Works thereof, You may choose to offer,
|
||||
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||
or other liability obligations and/or rights consistent with this
|
||||
License. However, in accepting such obligations, You may act only
|
||||
on Your own behalf and on Your sole responsibility, not on behalf
|
||||
of any other Contributor, and only if You agree to indemnify,
|
||||
defend, and hold each Contributor harmless for any liability
|
||||
incurred by, or claims asserted against, such Contributor by reason
|
||||
of your accepting any such warranty or additional liability.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
APPENDIX: How to apply the Apache License to your work.
|
||||
|
||||
To apply the Apache License to your work, attach the following
|
||||
boilerplate notice, with the fields enclosed by brackets "[]"
|
||||
replaced with your own identifying information. (Don't include
|
||||
the brackets!) The text should be enclosed in the appropriate
|
||||
comment syntax for the file format. We also recommend that a
|
||||
file or class name and description of purpose be included on the
|
||||
same "printed page" as the copyright notice for easier
|
||||
identification within third-party archives.
|
||||
|
||||
Copyright [yyyy] [name of copyright owner]
|
||||
|
||||
Licensed under the Apache License, Version 2.0 (the "License");
|
||||
you may not use this file except in compliance with the License.
|
||||
You may obtain a copy of the License at
|
||||
|
||||
http://www.apache.org/licenses/LICENSE-2.0
|
||||
|
||||
Unless required by applicable law or agreed to in writing, software
|
||||
distributed under the License is distributed on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
See the License for the specific language governing permissions and
|
||||
limitations under the License.
|
||||
|
||||
+45
@@ -0,0 +1,45 @@
|
||||
|
||||
if WANT_JANSSON
|
||||
JANSSON_INCLUDES= -I$(top_srcdir)/compat/jansson
|
||||
else
|
||||
JANSSON_INCLUDES=
|
||||
endif
|
||||
|
||||
EXTRA_DIST = autogen.sh README.txt LICENSE.txt \
|
||||
cudaminer.sln cudaminer.vcxproj cudaminer.vcxproj.filters \
|
||||
compat/gettimeofday.c compat/getopt/getopt_long.c cpuminer-config.h.in
|
||||
|
||||
SUBDIRS = compat
|
||||
|
||||
bin_PROGRAMS = ccminer
|
||||
|
||||
ccminer_SOURCES = elist.h miner.h compat.h \
|
||||
compat/inttypes.h compat/stdbool.h compat/unistd.h \
|
||||
compat/sys/time.h compat/getopt/getopt.h \
|
||||
cpu-miner.c util.c blake.c groestl.c hefty1.c keccak.c scrypt.c sha2.c \
|
||||
sph_blake.h sph_groestl.h sph_keccak.h sph_types.h \
|
||||
heavy.cu \
|
||||
cuda_blake512.cu cuda_blake512.h \
|
||||
cuda_combine.cu cuda_combine.h \
|
||||
cuda_groestl512.cu cuda_groestl512.h \
|
||||
cuda_hefty1.cu cuda_hefty1.h \
|
||||
cuda_keccak512.cu cuda_keccak512.h \
|
||||
cuda_sha256.cu cuda_sha256.h \
|
||||
cuda_fugue256.cu \
|
||||
fuguecoin.cpp fugue.c sph_fugue.h uint256.h
|
||||
|
||||
|
||||
ccminer_LDFLAGS = $(PTHREAD_FLAGS) @CUDA_LDFLAGS@
|
||||
ccminer_LDADD = @LIBCURL@ @JANSSON_LIBS@ @PTHREAD_LIBS@ @WS2_LIBS@ @CUDA_LIBS@ @OPENMP_CFLAGS@ @LIBS@
|
||||
ccminer_CPPFLAGS = -msse2 @LIBCURL_CPPFLAGS@ @OPENMP_CFLAGS@ $(PTHREAD_FLAGS) -fno-strict-aliasing $(JANSSON_INCLUDES) -DSCRYPT_KECCAK512 -DSCRYPT_CHACHA -DSCRYPT_CHOOSE_COMPILETIME
|
||||
|
||||
.cu.o:
|
||||
$(NVCC) @CFLAGS@ -Xptxas "-abi=no -v" -arch=compute_20 --maxrregcount=63 --ptxas-options=-v $(JANSSON_INCLUDES) -o $@ -c $<
|
||||
|
||||
## Thrust needs Compute 2.0 minimum
|
||||
#heavy.o: heavy.cu
|
||||
# $(NVCC) @CFLAGS@ -Xptxas "-abi=no -v" -arch=compute_20 --maxrregcount=63 --ptxas-options=-v $(JANSSON_INCLUDES) -o $@ -c $<
|
||||
#
|
||||
#cuda_hefty1.o: cuda_hefty1.cu
|
||||
# $(NVCC) @CFLAGS@ -Xptxas "-abi=no -v" -arch=compute_20 --maxrregcount=63 --ptxas-options=-v $(JANSSON_INCLUDES) -o $@ -c $<
|
||||
|
||||
+1107
File diff suppressed because it is too large.
Load diff
@@ -0,0 +1,3 @@
|
||||
|
||||
A CUDA based miner for Heavycoin and Fuguecoin. For more information, take a look at README.txt
|
||||
|
||||
+117
@@ -0,0 +1,117 @@
|
||||
|
||||
HeavyCUDA release Mar 18th 2014 - Initial Release
|
||||
-------------------------------------------------------------
|
||||
|
||||
***************************************************************
|
||||
If you find this tool useful and like to support its continued
|
||||
development, then consider a donation.
|
||||
|
||||
LTC donation address: LKS1WDKGED647msBQfLBHV3Ls8sveGncnm
|
||||
BTC donation address: 16hJF5mceSojnTD3ZTUDqdRhDyPJzoRakM
|
||||
YAC donation address: Y87sptDEcpLkLeAuex6qZioDbvy1qXZEj4
|
||||
VTC donation address: VrjeFzMgvteCGarLw85KivBzmsiH9fqp4a
|
||||
MAX donation address: mHrhQP9EFArechWxTFJ97s9D3jvcCvEEnt
|
||||
DOGE donation address: DT9ghsGmez6ojVdEZgvaZbT2Z3TruXG6yP
|
||||
PANDA donation address: PvgtxJ2ZKaudRogCXfUMLXVaWUMcKQgRed
|
||||
MRC donation address: 1Lxc4JPDpQRJB8BN4YwhmSQ3Rcu8gjj2Kd
|
||||
HVC donation address: HNN3PyyTMkDo4RkEjkWSGMwqia1yD8mwJN
|
||||
***************************************************************
|
||||
|
||||
>>> Introduction <<<
|
||||
|
||||
This is a CUDA accelerated mining application for use with
|
||||
HeavyCoin and FugueCoin. We did not take effort on usability,
|
||||
so please set your parameters carefuly.
|
||||
|
||||
THIS PROGRAMM IS PROVIDED "AS-IS", USE IT AT YOUR OWN RISK!
|
||||
|
||||
If you're interessted and read the source-code, please excuse
|
||||
that the most of our comments are in german.
|
||||
|
||||
>>> Command Line Interface <<<
|
||||
|
||||
This code is based on the pooler cpuminer 2.3.2 release and inherits
|
||||
its command line interface and options.
|
||||
|
||||
-a, --algo=ALGO specify the algorithm to use
|
||||
heavy use to mine Heavycoin
|
||||
fugue256 use to mine Fuguecoin
|
||||
|
||||
-o, --url=URL URL of mining server (default: " DEF_RPC_URL ")
|
||||
-O, --userpass=U:P username:password pair for mining server
|
||||
-u, --user=USERNAME username for mining server
|
||||
-p, --pass=PASSWORD password for mining server
|
||||
-v, --vote Heavycoin block vote (default: 512)
|
||||
--cert=FILE certificate for mining server using SSL
|
||||
-x, --proxy=[PROTOCOL://]HOST[:PORT] connect through a proxy
|
||||
-t, --threads=N number of miner threads (default: number of nVidia GPUs in your system)
|
||||
-r, --retries=N number of times to retry if a network call fails
|
||||
(default: retry indefinitely)
|
||||
-R, --retry-pause=N time to pause between retries, in seconds (default: 15)
|
||||
-T, --timeout=N network timeout, in seconds (default: 270)
|
||||
-s, --scantime=N upper bound on time spent scanning current work when
|
||||
long polling is unavailable, in seconds (default: 5)
|
||||
--no-longpoll disable X-Long-Polling support
|
||||
--no-stratum disable X-Stratum support
|
||||
-q, --quiet disable per-thread hashmeter output
|
||||
-D, --debug enable debug output
|
||||
-P, --protocol-dump verbose dump of protocol-level activities
|
||||
-B, --background run the miner in the background
|
||||
--benchmark run in offline benchmark mode
|
||||
-c, --config=FILE load a JSON-format configuration file
|
||||
-V, --version display version information and exit
|
||||
-h, --help display this help text and exit
|
||||
|
||||
>>> Examples <<<
|
||||
|
||||
Example for Heavycoin Mining on heavycoinpool.com with a single gpu in your system
|
||||
|
||||
cudaminer.exe -t 1 -a heavy -o stratum+tcp://stratum01.heavycoinpool.com:5333 -u <<username.worker>> -p <<workerpassword>> -v 512
|
||||
|
||||
|
||||
|
||||
Example for Heavycoin Mining on hvc.1gh.com with a dual gpu in your system
|
||||
|
||||
cudaminer.exe -t 2 -a heavy -o stratum+tcp://hvcpool.1gh.com:5333 -u <<WALLET>> -p x -v 512
|
||||
|
||||
|
||||
|
||||
Example for Fuguecoin solo-mining with 4 gpu's in your system and a Fuguecoin-wallet running on localhost
|
||||
|
||||
cudaminer.exe -q -s 1 -t 4 -a fugue256 -o http://localhost:9089 -u <<myusername>> -p <<mypassword>>
|
||||
|
||||
For solo-mining you typically use -o 127.0.0.1:xxxx where xxxx represents
|
||||
the RPC portnumber specified in your wallet's .conf file and you have to
|
||||
pass the same username and password with -O as specified in the wallet's
|
||||
.conf file. The wallet must also be started with the -server option and
|
||||
the server flag in the wallet's .conf file set to 1
|
||||
|
||||
|
||||
>>> Additional Notes <<<
|
||||
|
||||
This code should be running on nVidia GPUs ranging from compute capability
|
||||
2.0 up to compute capability 3.5. Just don't expect any hashing miracles
|
||||
from your old clunkers.
|
||||
|
||||
>>> RELEASE HISTORY <<<
|
||||
|
||||
March, 18 2014 initial release.
|
||||
|
||||
|
||||
>>> AUTHORS <<<
|
||||
|
||||
Notable contributors to this application are:
|
||||
|
||||
Christian Buchner, Christian H. (Germany): CUDA implementation
|
||||
|
||||
and also many thanks to anyone else who contributed to the original
|
||||
cpuminer application (Jeff Garzik, pooler), it's original HVC-fork
|
||||
and the HVC-fork available at hvc.1gh.com
|
||||
|
||||
Source code is included to satisfy GNU GPL V2 requirements.
|
||||
|
||||
|
||||
With kind regards,
|
||||
|
||||
Christian Buchner ( Christian.Buchner@gmail.com )
|
||||
Christian H. ( Chris84 )
|
||||
Vendored
+1379
File diff suppressed because it is too large.
Load diff
Executable
+1
@@ -0,0 +1 @@
|
||||
aclocal && autoheader && automake --add-missing --gnu --copy && autoconf
|
||||
+26
@@ -0,0 +1,26 @@
|
||||
|
||||
Microsoft Visual Studio Solution File, Format Version 11.00
|
||||
# Visual Studio 2010
|
||||
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ccminer", "ccminer.vcxproj", "{36DC07F9-A4A6-4877-A146-1B960083CF6F}"
|
||||
EndProject
|
||||
Global
|
||||
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||
Debug|Win32 = Debug|Win32
|
||||
Debug|x64 = Debug|x64
|
||||
Release|Win32 = Release|Win32
|
||||
Release|x64 = Release|x64
|
||||
EndGlobalSection
|
||||
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Debug|Win32.ActiveCfg = Debug|Win32
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Debug|Win32.Build.0 = Debug|Win32
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Debug|x64.ActiveCfg = Debug|x64
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Debug|x64.Build.0 = Debug|x64
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Release|Win32.ActiveCfg = Release|Win32
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Release|Win32.Build.0 = Release|Win32
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Release|x64.ActiveCfg = Release|x64
|
||||
{36DC07F9-A4A6-4877-A146-1B960083CF6F}.Release|x64.Build.0 = Release|x64
|
||||
EndGlobalSection
|
||||
GlobalSection(SolutionProperties) = preSolution
|
||||
HideSolutionNode = FALSE
|
||||
EndGlobalSection
|
||||
EndGlobal
|
||||
+291
@@ -0,0 +1,291 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project DefaultTargets="Build" ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<ItemGroup Label="ProjectConfigurations">
|
||||
<ProjectConfiguration Include="Debug|Win32">
|
||||
<Configuration>Debug</Configuration>
|
||||
<Platform>Win32</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Debug|x64">
|
||||
<Configuration>Debug</Configuration>
|
||||
<Platform>x64</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Release|Win32">
|
||||
<Configuration>Release</Configuration>
|
||||
<Platform>Win32</Platform>
|
||||
</ProjectConfiguration>
|
||||
<ProjectConfiguration Include="Release|x64">
|
||||
<Configuration>Release</Configuration>
|
||||
<Platform>x64</Platform>
|
||||
</ProjectConfiguration>
|
||||
</ItemGroup>
|
||||
<PropertyGroup Label="Globals">
|
||||
<ProjectGuid>{36DC07F9-A4A6-4877-A146-1B960083CF6F}</ProjectGuid>
|
||||
<RootNamespace>ccminer</RootNamespace>
|
||||
</PropertyGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>true</UseDebugLibraries>
|
||||
<CharacterSet>MultiByte</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>true</UseDebugLibraries>
|
||||
<CharacterSet>MultiByte</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>false</UseDebugLibraries>
|
||||
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||
<CharacterSet>MultiByte</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||
<ConfigurationType>Application</ConfigurationType>
|
||||
<UseDebugLibraries>false</UseDebugLibraries>
|
||||
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||
<CharacterSet>MultiByte</CharacterSet>
|
||||
</PropertyGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||
<ImportGroup Label="ExtensionSettings">
|
||||
<Import Project="$(VCTargetsPath)\BuildCustomizations\CUDA 5.5.props" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="PropertySheets">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<ImportGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="PropertySheets">
|
||||
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||
</ImportGroup>
|
||||
<PropertyGroup Label="UserMacros" />
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||
<LinkIncremental>true</LinkIncremental>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||
<LinkIncremental>true</LinkIncremental>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||
<LinkIncremental>true</LinkIncremental>
|
||||
</PropertyGroup>
|
||||
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||
<LinkIncremental>true</LinkIncremental>
|
||||
</PropertyGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<Optimization>Disabled</Optimization>
|
||||
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;CURL_STATICLIB;SCRYPT_KECCAK512;SCRYPT_CHACHA;SCRYPT_CHOOSE_COMPILETIME;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<AdditionalIncludeDirectories>.;compat;compat\jansson;compat\getopt;..\pthreads\Pre-built.2\include;..\curl-7.29.0\include;..\OpenSSL-Win32\include;%(AdditionalIncludeDirectories);$(CudaToolkitIncludeDir)</AdditionalIncludeDirectories>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<AdditionalDependencies>cudart.lib;cuda.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;pthreadVC2.lib;libcurl.lib;ws2_32.lib;Wldap32.lib;libeay32MTd.lib;ssleay32MTd.lib;%(AdditionalDependencies)</AdditionalDependencies>
|
||||
<AdditionalLibraryDirectories>..\pthreads\Pre-built.2\lib\x86;..\curl-7.29.0\build\lib\Debug;..\OpenSSL-Win32\lib\VC\static;%(AdditionalLibraryDirectories);$(CudaToolkitLibDir)</AdditionalLibraryDirectories>
|
||||
</Link>
|
||||
<PostBuildEvent>
|
||||
<Command>echo copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"
|
||||
copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"</Command>
|
||||
</PostBuildEvent>
|
||||
<CudaCompile>
|
||||
<CInterleavedPTX>true</CInterleavedPTX>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<MaxRegCount>128</MaxRegCount>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<PtxAsOptionV>true</PtxAsOptionV>
|
||||
<Keep>true</Keep>
|
||||
<CodeGeneration>compute_35,sm_35</CodeGeneration>
|
||||
<Include>
|
||||
</Include>
|
||||
<AdditionalOptions>-Xptxas "-abi=no -v" %(AdditionalOptions)</AdditionalOptions>
|
||||
</CudaCompile>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<Optimization>Disabled</Optimization>
|
||||
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;CURL_STATICLIB;SCRYPT_KECCAK512;SCRYPT_CHACHA;SCRYPT_CHOOSE_COMPILETIME;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<AdditionalIncludeDirectories>.;compat;compat\jansson;compat\getopt;..\pthreads\Pre-built.2\include;..\curl-7.29.0_x64\include;..\OpenSSL-Win64\include;%(AdditionalIncludeDirectories);$(CudaToolkitIncludeDir)</AdditionalIncludeDirectories>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<AdditionalDependencies>cudart.lib;cuda.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;pthreadVC2.lib;libcurl.lib;ws2_32.lib;Wldap32.lib;libeay32MTd.lib;ssleay32MTd.lib;%(AdditionalDependencies)</AdditionalDependencies>
|
||||
<AdditionalLibraryDirectories>..\pthreads\Pre-built.2\lib\x64;..\curl-7.29.0_x64\build\lib\Debug;..\OpenSSL-Win64\lib\VC\static;%(AdditionalLibraryDirectories);$(CudaToolkitLibDir)</AdditionalLibraryDirectories>
|
||||
</Link>
|
||||
<PostBuildEvent>
|
||||
<Command>echo copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"
|
||||
copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"</Command>
|
||||
</PostBuildEvent>
|
||||
<CudaCompile>
|
||||
<CInterleavedPTX>true</CInterleavedPTX>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<MaxRegCount>128</MaxRegCount>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<PtxAsOptionV>true</PtxAsOptionV>
|
||||
<Keep>true</Keep>
|
||||
<CodeGeneration>compute_35,sm_35</CodeGeneration>
|
||||
<Include>
|
||||
</Include>
|
||||
<AdditionalOptions>-Xptxas "-abi=no -v" %(AdditionalOptions)</AdditionalOptions>
|
||||
</CudaCompile>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<Optimization>MaxSpeed</Optimization>
|
||||
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;CURL_STATICLIB;SCRYPT_KECCAK512;SCRYPT_CHACHA;SCRYPT_CHOOSE_COMPILETIME;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<AdditionalIncludeDirectories>.;compat;compat\jansson;compat\getopt;..\pthreads\Pre-built.2\include;..\curl-7.29.0\include;..\OpenSSL-Win32\include;%(AdditionalIncludeDirectories);$(CudaToolkitIncludeDir)</AdditionalIncludeDirectories>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||
<OptimizeReferences>true</OptimizeReferences>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<AdditionalDependencies>cudart.lib;cuda.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;pthreadVC2.lib;libcurl.lib;ws2_32.lib;Wldap32.lib;libeay32MT.lib;ssleay32MT.lib;%(AdditionalDependencies)</AdditionalDependencies>
|
||||
<AdditionalLibraryDirectories>..\pthreads\Pre-built.2\lib\x86;..\curl-7.29.0\build\lib\Release;..\OpenSSL-Win32\lib\VC\static;%(AdditionalLibraryDirectories);$(CudaToolkitLibDir)</AdditionalLibraryDirectories>
|
||||
</Link>
|
||||
<PostBuildEvent>
|
||||
<Command>echo copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"
|
||||
copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"</Command>
|
||||
</PostBuildEvent>
|
||||
<CudaCompile>
|
||||
<CInterleavedPTX>true</CInterleavedPTX>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<MaxRegCount>128</MaxRegCount>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<PtxAsOptionV>true</PtxAsOptionV>
|
||||
<Keep>true</Keep>
|
||||
<CodeGeneration>compute_35,sm_35</CodeGeneration>
|
||||
<Include>
|
||||
</Include>
|
||||
<AdditionalOptions>-Xptxas "-abi=no -v" %(AdditionalOptions)</AdditionalOptions>
|
||||
</CudaCompile>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||
<ClCompile>
|
||||
<WarningLevel>Level3</WarningLevel>
|
||||
<Optimization>MaxSpeed</Optimization>
|
||||
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;_CRT_SECURE_NO_WARNINGS;CURL_STATICLIB;SCRYPT_KECCAK512;SCRYPT_CHACHA;SCRYPT_CHOOSE_COMPILETIME;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||
<AdditionalIncludeDirectories>.;compat;compat\jansson;compat\getopt;..\pthreads\Pre-built.2\include;..\curl-7.29.0_x64\include;..\OpenSSL-Win64\include;%(AdditionalIncludeDirectories);$(CudaToolkitIncludeDir)</AdditionalIncludeDirectories>
|
||||
</ClCompile>
|
||||
<Link>
|
||||
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||
<OptimizeReferences>true</OptimizeReferences>
|
||||
<SubSystem>Console</SubSystem>
|
||||
<AdditionalDependencies>cudart.lib;cuda.lib;kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;pthreadVC2.lib;libcurl.lib;ws2_32.lib;Wldap32.lib;libeay32MT.lib;ssleay32MT.lib;%(AdditionalDependencies)</AdditionalDependencies>
|
||||
<AdditionalLibraryDirectories>..\pthreads\Pre-built.2\lib\x64;..\curl-7.29.0_x64\build\lib\Release;..\OpenSSL-Win64\lib\VC\static;%(AdditionalLibraryDirectories);$(CudaToolkitLibDir)</AdditionalLibraryDirectories>
|
||||
</Link>
|
||||
<PostBuildEvent>
|
||||
<Command>echo copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"
|
||||
copy "$(CudaToolkitBinDir)\cudart*.dll" "$(OutDir)"</Command>
|
||||
</PostBuildEvent>
|
||||
<CudaCompile>
|
||||
<CInterleavedPTX>true</CInterleavedPTX>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<MaxRegCount>128</MaxRegCount>
|
||||
</CudaCompile>
|
||||
<CudaCompile>
|
||||
<PtxAsOptionV>true</PtxAsOptionV>
|
||||
<Keep>true</Keep>
|
||||
<CodeGeneration>compute_35,sm_35</CodeGeneration>
|
||||
<Include>
|
||||
</Include>
|
||||
<AdditionalOptions>-Xptxas "-abi=no -v" %(AdditionalOptions)</AdditionalOptions>
|
||||
</CudaCompile>
|
||||
</ItemDefinitionGroup>
|
||||
<ItemGroup>
|
||||
<ClCompile Include="blake.c" />
|
||||
<ClCompile Include="compat\getopt\getopt_long.c" />
|
||||
<ClCompile Include="compat\gettimeofday.c" />
|
||||
<ClCompile Include="compat\jansson\dump.c" />
|
||||
<ClCompile Include="compat\jansson\hashtable.c" />
|
||||
<ClCompile Include="compat\jansson\load.c" />
|
||||
<ClCompile Include="compat\jansson\strbuffer.c" />
|
||||
<ClCompile Include="compat\jansson\utf.c" />
|
||||
<ClCompile Include="compat\jansson\value.c" />
|
||||
<ClCompile Include="cpu-miner.c">
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
</ClCompile>
|
||||
<ClCompile Include="fugue.c" />
|
||||
<ClCompile Include="fuguecoin.cpp" />
|
||||
<ClCompile Include="groestl.c" />
|
||||
<ClCompile Include="hefty1.c" />
|
||||
<ClCompile Include="keccak.c" />
|
||||
<ClCompile Include="scrypt.c" />
|
||||
<ClCompile Include="sha2.c">
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
</ClCompile>
|
||||
<ClCompile Include="util.c">
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
<AdditionalOptions Condition="'$(Configuration)|$(Platform)'=='Release|x64'">/TP %(AdditionalOptions)</AdditionalOptions>
|
||||
</ClCompile>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<ClInclude Include="compat.h" />
|
||||
<ClInclude Include="compat\getopt\getopt.h" />
|
||||
<ClInclude Include="compat\inttypes.h" />
|
||||
<ClInclude Include="compat\stdbool.h" />
|
||||
<ClInclude Include="compat\sys\time.h" />
|
||||
<ClInclude Include="compat\unistd.h" />
|
||||
<ClInclude Include="cpuminer-config.h" />
|
||||
<ClInclude Include="cuda_blake512.h" />
|
||||
<ClInclude Include="cuda_combine.h" />
|
||||
<ClInclude Include="cuda_groestl512.h" />
|
||||
<ClInclude Include="cuda_hefty1.h" />
|
||||
<ClInclude Include="cuda_keccak512.h" />
|
||||
<ClInclude Include="cuda_sha256.h" />
|
||||
<ClInclude Include="elist.h" />
|
||||
<ClInclude Include="hefty1.h" />
|
||||
<ClInclude Include="miner.h" />
|
||||
<ClInclude Include="sph_blake.h" />
|
||||
<ClInclude Include="sph_fugue.h" />
|
||||
<ClInclude Include="sph_groestl.h" />
|
||||
<ClInclude Include="sph_keccak.h" />
|
||||
<ClInclude Include="sph_types.h" />
|
||||
<ClInclude Include="uint256.h" />
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<CudaCompile Include="cuda_blake512.cu" />
|
||||
<CudaCompile Include="cuda_combine.cu" />
|
||||
<CudaCompile Include="cuda_fugue256.cu" />
|
||||
<CudaCompile Include="cuda_groestl512.cu" />
|
||||
<CudaCompile Include="cuda_hefty1.cu">
|
||||
<CodeGeneration Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">compute_10,sm_10</CodeGeneration>
|
||||
<CodeGeneration Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">compute_10,sm_10</CodeGeneration>
|
||||
<CodeGeneration Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">compute_10,sm_10</CodeGeneration>
|
||||
<CodeGeneration Condition="'$(Configuration)|$(Platform)'=='Release|x64'">compute_10,sm_10</CodeGeneration>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_keccak512.cu" />
|
||||
<CudaCompile Include="cuda_sha256.cu" />
|
||||
<CudaCompile Include="heavy.cu" />
|
||||
</ItemGroup>
|
||||
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||
<ImportGroup Label="ExtensionTargets">
|
||||
<Import Project="$(VCTargetsPath)\BuildCustomizations\CUDA 5.5.targets" />
|
||||
</ImportGroup>
|
||||
</Project>
|
||||
@@ -0,0 +1,188 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||
<ItemGroup>
|
||||
<Filter Include="Source Files">
|
||||
<UniqueIdentifier>{2450a9c7-a97a-49e1-ba19-c8dbc5a4e3e7}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Source Files\gettimeofday">
|
||||
<UniqueIdentifier>{c53ce808-c5c5-4c6c-99a2-3947090c62f1}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Source Files\getopt">
|
||||
<UniqueIdentifier>{5a45c1bf-81d2-4bc6-97b5-714e34f51a82}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Header Files">
|
||||
<UniqueIdentifier>{431cec61-9376-4de9-aae9-04c4250652e7}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Header Files\compat">
|
||||
<UniqueIdentifier>{cc8bb259-5332-4a45-ba81-f4840a55b604}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Header Files\compat\getopt">
|
||||
<UniqueIdentifier>{89362bd8-4690-4f0c-a4f7-6b2fa67a1f34}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Header Files\compat\sys">
|
||||
<UniqueIdentifier>{6c3cd392-b6b8-424c-87d2-10e33dbd4b41}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Source Files\CUDA">
|
||||
<UniqueIdentifier>{5a31b6f4-4943-4b22-b69a-230f3cc96269}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Header Files\CUDA">
|
||||
<UniqueIdentifier>{a0f072d0-a831-4c23-8d64-7a026521df9c}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Source Files\code">
|
||||
<UniqueIdentifier>{fe39ded0-754b-415f-a284-038a15a0aa55}</UniqueIdentifier>
|
||||
</Filter>
|
||||
<Filter Include="Source Files\CUDA\jansson">
|
||||
<UniqueIdentifier>{17b56151-79ec-4a32-bac3-9d94ae7f68fe}</UniqueIdentifier>
|
||||
</Filter>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<ClCompile Include="compat\jansson\dump.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\jansson\hashtable.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\jansson\load.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\jansson\strbuffer.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\jansson\utf.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\jansson\value.c">
|
||||
<Filter>Source Files\CUDA\jansson</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\getopt\getopt_long.c">
|
||||
<Filter>Source Files\getopt</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="compat\gettimeofday.c">
|
||||
<Filter>Source Files\gettimeofday</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="util.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="sha2.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="cpu-miner.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="blake.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="groestl.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="hefty1.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="keccak.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="scrypt.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="fugue.c">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
<ClCompile Include="fuguecoin.cpp">
|
||||
<Filter>Source Files</Filter>
|
||||
</ClCompile>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<ClInclude Include="compat.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="elist.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="miner.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="compat\sys\time.h">
|
||||
<Filter>Header Files\compat\sys</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="compat\unistd.h">
|
||||
<Filter>Header Files\compat</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="compat\inttypes.h">
|
||||
<Filter>Header Files\compat</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="compat\getopt\getopt.h">
|
||||
<Filter>Header Files\compat\getopt</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="compat\stdbool.h">
|
||||
<Filter>Header Files\compat</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cpuminer-config.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="sph_blake.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="sph_types.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="sph_groestl.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="sph_keccak.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="hefty1.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_sha256.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_hefty1.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_keccak512.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_combine.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_blake512.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="cuda_groestl512.h">
|
||||
<Filter>Header Files\CUDA</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="sph_fugue.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="uint256.h">
|
||||
<Filter>Header Files</Filter>
|
||||
</ClInclude>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<CudaCompile Include="cuda_sha256.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_blake512.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_groestl512.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_hefty1.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_keccak512.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_combine.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="heavy.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
<CudaCompile Include="cuda_fugue256.cu">
|
||||
<Filter>Source Files\CUDA</Filter>
|
||||
</CudaCompile>
|
||||
</ItemGroup>
|
||||
</Project>
|
||||
@@ -0,0 +1,24 @@
|
||||
#ifndef __COMPAT_H__
|
||||
#define __COMPAT_H__
|
||||
|
||||
#ifdef WIN32
|
||||
|
||||
#include <windows.h>
|
||||
|
||||
static __inline void sleep(int secs)
|
||||
{
|
||||
Sleep(secs * 1000);
|
||||
}
|
||||
|
||||
enum {
|
||||
PRIO_PROCESS = 0,
|
||||
};
|
||||
|
||||
static __inline int setpriority(int which, int who, int prio)
|
||||
{
|
||||
return -!SetThreadPriority(GetCurrentThread(), THREAD_PRIORITY_IDLE /*THREAD_PRIORITY_TIME_CRITICAL*/);
|
||||
}
|
||||
|
||||
#endif /* WIN32 */
|
||||
|
||||
#endif /* __COMPAT_H__ */
|
||||
@@ -0,0 +1,7 @@
|
||||
|
||||
if WANT_JANSSON
|
||||
SUBDIRS = jansson
|
||||
else
|
||||
SUBDIRS =
|
||||
endif
|
||||
|
||||
@@ -0,0 +1,601 @@
|
||||
# Makefile.in generated by automake 1.13.3 from Makefile.am.
|
||||
# @configure_input@
|
||||
|
||||
# Copyright (C) 1994-2013 Free Software Foundation, Inc.
|
||||
|
||||
# This Makefile.in is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
@SET_MAKE@
|
||||
VPATH = @srcdir@
|
||||
am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
|
||||
am__make_running_with_option = \
|
||||
case $${target_option-} in \
|
||||
?) ;; \
|
||||
*) echo "am__make_running_with_option: internal error: invalid" \
|
||||
"target option '$${target_option-}' specified" >&2; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
has_opt=no; \
|
||||
sane_makeflags=$$MAKEFLAGS; \
|
||||
if $(am__is_gnu_make); then \
|
||||
sane_makeflags=$$MFLAGS; \
|
||||
else \
|
||||
case $$MAKEFLAGS in \
|
||||
*\\[\ \ ]*) \
|
||||
bs=\\; \
|
||||
sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
|
||||
| sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \
|
||||
esac; \
|
||||
fi; \
|
||||
skip_next=no; \
|
||||
strip_trailopt () \
|
||||
{ \
|
||||
flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
|
||||
}; \
|
||||
for flg in $$sane_makeflags; do \
|
||||
test $$skip_next = yes && { skip_next=no; continue; }; \
|
||||
case $$flg in \
|
||||
*=*|--*) continue;; \
|
||||
-*I) strip_trailopt 'I'; skip_next=yes;; \
|
||||
-*I?*) strip_trailopt 'I';; \
|
||||
-*O) strip_trailopt 'O'; skip_next=yes;; \
|
||||
-*O?*) strip_trailopt 'O';; \
|
||||
-*l) strip_trailopt 'l'; skip_next=yes;; \
|
||||
-*l?*) strip_trailopt 'l';; \
|
||||
-[dEDm]) skip_next=yes;; \
|
||||
-[JT]) skip_next=yes;; \
|
||||
esac; \
|
||||
case $$flg in \
|
||||
*$$target_option*) has_opt=yes; break;; \
|
||||
esac; \
|
||||
done; \
|
||||
test $$has_opt = yes
|
||||
am__make_dryrun = (target_option=n; $(am__make_running_with_option))
|
||||
am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
|
||||
pkgdatadir = $(datadir)/@PACKAGE@
|
||||
pkgincludedir = $(includedir)/@PACKAGE@
|
||||
pkglibdir = $(libdir)/@PACKAGE@
|
||||
pkglibexecdir = $(libexecdir)/@PACKAGE@
|
||||
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||
install_sh_DATA = $(install_sh) -c -m 644
|
||||
install_sh_PROGRAM = $(install_sh) -c
|
||||
install_sh_SCRIPT = $(install_sh) -c
|
||||
INSTALL_HEADER = $(INSTALL_DATA)
|
||||
transform = $(program_transform_name)
|
||||
NORMAL_INSTALL = :
|
||||
PRE_INSTALL = :
|
||||
POST_INSTALL = :
|
||||
NORMAL_UNINSTALL = :
|
||||
PRE_UNINSTALL = :
|
||||
POST_UNINSTALL = :
|
||||
build_triplet = @build@
|
||||
host_triplet = @host@
|
||||
target_triplet = @target@
|
||||
subdir = compat
|
||||
DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am
|
||||
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||
am__aclocal_m4_deps = $(top_srcdir)/configure.ac
|
||||
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||
$(ACLOCAL_M4)
|
||||
mkinstalldirs = $(install_sh) -d
|
||||
CONFIG_HEADER = $(top_builddir)/cpuminer-config.h
|
||||
CONFIG_CLEAN_FILES =
|
||||
CONFIG_CLEAN_VPATH_FILES =
|
||||
AM_V_P = $(am__v_P_@AM_V@)
|
||||
am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
|
||||
am__v_P_0 = false
|
||||
am__v_P_1 = :
|
||||
AM_V_GEN = $(am__v_GEN_@AM_V@)
|
||||
am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
|
||||
am__v_GEN_0 = @echo " GEN " $@;
|
||||
am__v_GEN_1 =
|
||||
AM_V_at = $(am__v_at_@AM_V@)
|
||||
am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
|
||||
am__v_at_0 = @
|
||||
am__v_at_1 =
|
||||
SOURCES =
|
||||
DIST_SOURCES =
|
||||
RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \
|
||||
ctags-recursive dvi-recursive html-recursive info-recursive \
|
||||
install-data-recursive install-dvi-recursive \
|
||||
install-exec-recursive install-html-recursive \
|
||||
install-info-recursive install-pdf-recursive \
|
||||
install-ps-recursive install-recursive installcheck-recursive \
|
||||
installdirs-recursive pdf-recursive ps-recursive \
|
||||
tags-recursive uninstall-recursive
|
||||
am__can_run_installinfo = \
|
||||
case $$AM_UPDATE_INFO_DIR in \
|
||||
n|no|NO) false;; \
|
||||
*) (install-info --version) >/dev/null 2>&1;; \
|
||||
esac
|
||||
RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \
|
||||
distclean-recursive maintainer-clean-recursive
|
||||
am__recursive_targets = \
|
||||
$(RECURSIVE_TARGETS) \
|
||||
$(RECURSIVE_CLEAN_TARGETS) \
|
||||
$(am__extra_recursive_targets)
|
||||
AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \
|
||||
distdir
|
||||
am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
|
||||
# Read a list of newline-separated strings from the standard input,
|
||||
# and print each of them once, without duplicates. Input order is
|
||||
# *not* preserved.
|
||||
am__uniquify_input = $(AWK) '\
|
||||
BEGIN { nonempty = 0; } \
|
||||
{ items[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in items) print i; }; } \
|
||||
'
|
||||
# Make sure the list of sources is unique. This is necessary because,
|
||||
# e.g., the same source file might be shared among _SOURCES variables
|
||||
# for different programs/libraries.
|
||||
am__define_uniq_tagged_files = \
|
||||
list='$(am__tagged_files)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | $(am__uniquify_input)`
|
||||
ETAGS = etags
|
||||
CTAGS = ctags
|
||||
DIST_SUBDIRS = jansson
|
||||
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||
am__relativize = \
|
||||
dir0=`pwd`; \
|
||||
sed_first='s,^\([^/]*\)/.*$$,\1,'; \
|
||||
sed_rest='s,^[^/]*/*,,'; \
|
||||
sed_last='s,^.*/\([^/]*\)$$,\1,'; \
|
||||
sed_butlast='s,/*[^/]*$$,,'; \
|
||||
while test -n "$$dir1"; do \
|
||||
first=`echo "$$dir1" | sed -e "$$sed_first"`; \
|
||||
if test "$$first" != "."; then \
|
||||
if test "$$first" = ".."; then \
|
||||
dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \
|
||||
dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \
|
||||
else \
|
||||
first2=`echo "$$dir2" | sed -e "$$sed_first"`; \
|
||||
if test "$$first2" = "$$first"; then \
|
||||
dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \
|
||||
else \
|
||||
dir2="../$$dir2"; \
|
||||
fi; \
|
||||
dir0="$$dir0"/"$$first"; \
|
||||
fi; \
|
||||
fi; \
|
||||
dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \
|
||||
done; \
|
||||
reldir="$$dir2"
|
||||
ACLOCAL = @ACLOCAL@
|
||||
ALLOCA = @ALLOCA@
|
||||
AMTAR = @AMTAR@
|
||||
AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
|
||||
AUTOCONF = @AUTOCONF@
|
||||
AUTOHEADER = @AUTOHEADER@
|
||||
AUTOMAKE = @AUTOMAKE@
|
||||
AWK = @AWK@
|
||||
CC = @CC@
|
||||
CCAS = @CCAS@
|
||||
CCASDEPMODE = @CCASDEPMODE@
|
||||
CCASFLAGS = @CCASFLAGS@
|
||||
CCDEPMODE = @CCDEPMODE@
|
||||
CFLAGS = @CFLAGS@
|
||||
CPP = @CPP@
|
||||
CPPFLAGS = @CPPFLAGS@
|
||||
CUDA_CFLAGS = @CUDA_CFLAGS@
|
||||
CUDA_LDFLAGS = @CUDA_LDFLAGS@
|
||||
CUDA_LIBS = @CUDA_LIBS@
|
||||
CXX = @CXX@
|
||||
CXXDEPMODE = @CXXDEPMODE@
|
||||
CXXFLAGS = @CXXFLAGS@
|
||||
CYGPATH_W = @CYGPATH_W@
|
||||
DEFS = @DEFS@
|
||||
DEPDIR = @DEPDIR@
|
||||
ECHO_C = @ECHO_C@
|
||||
ECHO_N = @ECHO_N@
|
||||
ECHO_T = @ECHO_T@
|
||||
EGREP = @EGREP@
|
||||
EXEEXT = @EXEEXT@
|
||||
GREP = @GREP@
|
||||
INSTALL = @INSTALL@
|
||||
INSTALL_DATA = @INSTALL_DATA@
|
||||
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||
JANSSON_LIBS = @JANSSON_LIBS@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
LIBCURL = @LIBCURL@
|
||||
LIBCURL_CPPFLAGS = @LIBCURL_CPPFLAGS@
|
||||
LIBOBJS = @LIBOBJS@
|
||||
LIBS = @LIBS@
|
||||
LTLIBOBJS = @LTLIBOBJS@
|
||||
MAINT = @MAINT@
|
||||
MAKEINFO = @MAKEINFO@
|
||||
MKDIR_P = @MKDIR_P@
|
||||
NVCC = @NVCC@
|
||||
OBJEXT = @OBJEXT@
|
||||
OPENMP_CFLAGS = @OPENMP_CFLAGS@
|
||||
PACKAGE = @PACKAGE@
|
||||
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||
PACKAGE_NAME = @PACKAGE_NAME@
|
||||
PACKAGE_STRING = @PACKAGE_STRING@
|
||||
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||
PACKAGE_URL = @PACKAGE_URL@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||
PTHREAD_FLAGS = @PTHREAD_FLAGS@
|
||||
PTHREAD_LIBS = @PTHREAD_LIBS@
|
||||
RANLIB = @RANLIB@
|
||||
SET_MAKE = @SET_MAKE@
|
||||
SHELL = @SHELL@
|
||||
STRIP = @STRIP@
|
||||
VERSION = @VERSION@
|
||||
WS2_LIBS = @WS2_LIBS@
|
||||
_libcurl_config = @_libcurl_config@
|
||||
abs_builddir = @abs_builddir@
|
||||
abs_srcdir = @abs_srcdir@
|
||||
abs_top_builddir = @abs_top_builddir@
|
||||
abs_top_srcdir = @abs_top_srcdir@
|
||||
ac_ct_CC = @ac_ct_CC@
|
||||
ac_ct_CXX = @ac_ct_CXX@
|
||||
am__include = @am__include@
|
||||
am__leading_dot = @am__leading_dot@
|
||||
am__quote = @am__quote@
|
||||
am__tar = @am__tar@
|
||||
am__untar = @am__untar@
|
||||
bindir = @bindir@
|
||||
build = @build@
|
||||
build_alias = @build_alias@
|
||||
build_cpu = @build_cpu@
|
||||
build_os = @build_os@
|
||||
build_vendor = @build_vendor@
|
||||
builddir = @builddir@
|
||||
datadir = @datadir@
|
||||
datarootdir = @datarootdir@
|
||||
docdir = @docdir@
|
||||
dvidir = @dvidir@
|
||||
exec_prefix = @exec_prefix@
|
||||
host = @host@
|
||||
host_alias = @host_alias@
|
||||
host_cpu = @host_cpu@
|
||||
host_os = @host_os@
|
||||
host_vendor = @host_vendor@
|
||||
htmldir = @htmldir@
|
||||
includedir = @includedir@
|
||||
infodir = @infodir@
|
||||
install_sh = @install_sh@
|
||||
libdir = @libdir@
|
||||
libexecdir = @libexecdir@
|
||||
localedir = @localedir@
|
||||
localstatedir = @localstatedir@
|
||||
mandir = @mandir@
|
||||
mkdir_p = @mkdir_p@
|
||||
oldincludedir = @oldincludedir@
|
||||
pdfdir = @pdfdir@
|
||||
prefix = @prefix@
|
||||
program_transform_name = @program_transform_name@
|
||||
psdir = @psdir@
|
||||
sbindir = @sbindir@
|
||||
sharedstatedir = @sharedstatedir@
|
||||
srcdir = @srcdir@
|
||||
sysconfdir = @sysconfdir@
|
||||
target = @target@
|
||||
target_alias = @target_alias@
|
||||
target_cpu = @target_cpu@
|
||||
target_os = @target_os@
|
||||
target_vendor = @target_vendor@
|
||||
top_build_prefix = @top_build_prefix@
|
||||
top_builddir = @top_builddir@
|
||||
top_srcdir = @top_srcdir@
|
||||
@WANT_JANSSON_FALSE@SUBDIRS =
|
||||
@WANT_JANSSON_TRUE@SUBDIRS = jansson
|
||||
all: all-recursive
|
||||
|
||||
.SUFFIXES:
|
||||
$(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps)
|
||||
@for dep in $?; do \
|
||||
case '$(am__configure_deps)' in \
|
||||
*$$dep*) \
|
||||
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
|
||||
&& { if test -f $@; then exit 0; else break; fi; }; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
done; \
|
||||
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu compat/Makefile'; \
|
||||
$(am__cd) $(top_srcdir) && \
|
||||
$(AUTOMAKE) --gnu compat/Makefile
|
||||
.PRECIOUS: Makefile
|
||||
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||
@case '$?' in \
|
||||
*config.status*) \
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
|
||||
*) \
|
||||
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
|
||||
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
|
||||
esac;
|
||||
|
||||
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
|
||||
$(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(am__aclocal_m4_deps):
|
||||
|
||||
# This directory's subdirectories are mostly independent; you can cd
|
||||
# into them and run 'make' without going through this Makefile.
|
||||
# To change the values of 'make' variables: instead of editing Makefiles,
|
||||
# (1) if the variable is set in 'config.status', edit 'config.status'
|
||||
# (which will cause the Makefiles to be regenerated when you run 'make');
|
||||
# (2) otherwise, pass the desired values on the 'make' command line.
|
||||
$(am__recursive_targets):
|
||||
@fail=; \
|
||||
if $(am__make_keepgoing); then \
|
||||
failcom='fail=yes'; \
|
||||
else \
|
||||
failcom='exit 1'; \
|
||||
fi; \
|
||||
dot_seen=no; \
|
||||
target=`echo $@ | sed s/-recursive//`; \
|
||||
case "$@" in \
|
||||
distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
|
||||
*) list='$(SUBDIRS)' ;; \
|
||||
esac; \
|
||||
for subdir in $$list; do \
|
||||
echo "Making $$target in $$subdir"; \
|
||||
if test "$$subdir" = "."; then \
|
||||
dot_seen=yes; \
|
||||
local_target="$$target-am"; \
|
||||
else \
|
||||
local_target="$$target"; \
|
||||
fi; \
|
||||
($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|
||||
|| eval $$failcom; \
|
||||
done; \
|
||||
if test "$$dot_seen" = "no"; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
|
||||
fi; test -z "$$fail"
|
||||
|
||||
ID: $(am__tagged_files)
|
||||
$(am__define_uniq_tagged_files); mkid -fID $$unique
|
||||
tags: tags-recursive
|
||||
TAGS: tags
|
||||
|
||||
tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
|
||||
set x; \
|
||||
here=`pwd`; \
|
||||
if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
|
||||
include_option=--etags-include; \
|
||||
empty_fix=.; \
|
||||
else \
|
||||
include_option=--include; \
|
||||
empty_fix=; \
|
||||
fi; \
|
||||
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||
if test "$$subdir" = .; then :; else \
|
||||
test ! -f $$subdir/TAGS || \
|
||||
set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \
|
||||
fi; \
|
||||
done; \
|
||||
$(am__define_uniq_tagged_files); \
|
||||
shift; \
|
||||
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
|
||||
test -n "$$unique" || unique=$$empty_fix; \
|
||||
if test $$# -gt 0; then \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
"$$@" $$unique; \
|
||||
else \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
$$unique; \
|
||||
fi; \
|
||||
fi
|
||||
ctags: ctags-recursive
|
||||
|
||||
CTAGS: ctags
|
||||
ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
|
||||
$(am__define_uniq_tagged_files); \
|
||||
test -z "$(CTAGS_ARGS)$$unique" \
|
||||
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||
$$unique
|
||||
|
||||
GTAGS:
|
||||
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||
&& $(am__cd) $(top_srcdir) \
|
||||
&& gtags -i $(GTAGS_ARGS) "$$here"
|
||||
cscopelist: cscopelist-recursive
|
||||
|
||||
cscopelist-am: $(am__tagged_files)
|
||||
list='$(am__tagged_files)'; \
|
||||
case "$(srcdir)" in \
|
||||
[\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
|
||||
*) sdir=$(subdir)/$(srcdir) ;; \
|
||||
esac; \
|
||||
for i in $$list; do \
|
||||
if test -f "$$i"; then \
|
||||
echo "$(subdir)/$$i"; \
|
||||
else \
|
||||
echo "$$sdir/$$i"; \
|
||||
fi; \
|
||||
done >> $(top_builddir)/cscope.files
|
||||
|
||||
distclean-tags:
|
||||
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||
|
||||
distdir: $(DISTFILES)
|
||||
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
list='$(DISTFILES)'; \
|
||||
dist_files=`for file in $$list; do echo $$file; done | \
|
||||
sed -e "s|^$$srcdirstrip/||;t" \
|
||||
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||
case $$dist_files in \
|
||||
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||
sort -u` ;; \
|
||||
esac; \
|
||||
for file in $$dist_files; do \
|
||||
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||
if test -d $$d/$$file; then \
|
||||
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||
if test -d "$(distdir)/$$file"; then \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
|
||||
else \
|
||||
test -f "$(distdir)/$$file" \
|
||||
|| cp -p $$d/$$file "$(distdir)/$$file" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
@list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
|
||||
if test "$$subdir" = .; then :; else \
|
||||
$(am__make_dryrun) \
|
||||
|| test -d "$(distdir)/$$subdir" \
|
||||
|| $(MKDIR_P) "$(distdir)/$$subdir" \
|
||||
|| exit 1; \
|
||||
dir1=$$subdir; dir2="$(distdir)/$$subdir"; \
|
||||
$(am__relativize); \
|
||||
new_distdir=$$reldir; \
|
||||
dir1=$$subdir; dir2="$(top_distdir)"; \
|
||||
$(am__relativize); \
|
||||
new_top_distdir=$$reldir; \
|
||||
echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \
|
||||
echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \
|
||||
($(am__cd) $$subdir && \
|
||||
$(MAKE) $(AM_MAKEFLAGS) \
|
||||
top_distdir="$$new_top_distdir" \
|
||||
distdir="$$new_distdir" \
|
||||
am__remove_distdir=: \
|
||||
am__skip_length_check=: \
|
||||
am__skip_mode_fix=: \
|
||||
distdir) \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
check-am: all-am
|
||||
check: check-recursive
|
||||
all-am: Makefile
|
||||
installdirs: installdirs-recursive
|
||||
installdirs-am:
|
||||
install: install-recursive
|
||||
install-exec: install-exec-recursive
|
||||
install-data: install-data-recursive
|
||||
uninstall: uninstall-recursive
|
||||
|
||||
install-am: all-am
|
||||
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||
|
||||
installcheck: installcheck-recursive
|
||||
install-strip:
|
||||
if test -z '$(STRIP)'; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
install; \
|
||||
else \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
|
||||
fi
|
||||
mostlyclean-generic:
|
||||
|
||||
clean-generic:
|
||||
|
||||
distclean-generic:
|
||||
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
|
||||
|
||||
maintainer-clean-generic:
|
||||
@echo "This command is intended for maintainers to use"
|
||||
@echo "it deletes files that may require special tools to rebuild."
|
||||
clean: clean-recursive
|
||||
|
||||
clean-am: clean-generic mostlyclean-am
|
||||
|
||||
distclean: distclean-recursive
|
||||
-rm -f Makefile
|
||||
distclean-am: clean-am distclean-generic distclean-tags
|
||||
|
||||
dvi: dvi-recursive
|
||||
|
||||
dvi-am:
|
||||
|
||||
html: html-recursive
|
||||
|
||||
html-am:
|
||||
|
||||
info: info-recursive
|
||||
|
||||
info-am:
|
||||
|
||||
install-data-am:
|
||||
|
||||
install-dvi: install-dvi-recursive
|
||||
|
||||
install-dvi-am:
|
||||
|
||||
install-exec-am:
|
||||
|
||||
install-html: install-html-recursive
|
||||
|
||||
install-html-am:
|
||||
|
||||
install-info: install-info-recursive
|
||||
|
||||
install-info-am:
|
||||
|
||||
install-man:
|
||||
|
||||
install-pdf: install-pdf-recursive
|
||||
|
||||
install-pdf-am:
|
||||
|
||||
install-ps: install-ps-recursive
|
||||
|
||||
install-ps-am:
|
||||
|
||||
installcheck-am:
|
||||
|
||||
maintainer-clean: maintainer-clean-recursive
|
||||
-rm -f Makefile
|
||||
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||
|
||||
mostlyclean: mostlyclean-recursive
|
||||
|
||||
mostlyclean-am: mostlyclean-generic
|
||||
|
||||
pdf: pdf-recursive
|
||||
|
||||
pdf-am:
|
||||
|
||||
ps: ps-recursive
|
||||
|
||||
ps-am:
|
||||
|
||||
uninstall-am:
|
||||
|
||||
.MAKE: $(am__recursive_targets) install-am install-strip
|
||||
|
||||
.PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am check \
|
||||
check-am clean clean-generic cscopelist-am ctags ctags-am \
|
||||
distclean distclean-generic distclean-tags distdir dvi dvi-am \
|
||||
html html-am info info-am install install-am install-data \
|
||||
install-data-am install-dvi install-dvi-am install-exec \
|
||||
install-exec-am install-html install-html-am install-info \
|
||||
install-info-am install-man install-pdf install-pdf-am \
|
||||
install-ps install-ps-am install-strip installcheck \
|
||||
installcheck-am installdirs installdirs-am maintainer-clean \
|
||||
maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
|
||||
pdf-am ps ps-am tags tags-am uninstall uninstall-am
|
||||
|
||||
|
||||
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||
.NOEXPORT:
|
||||
@@ -0,0 +1,93 @@
|
||||
/* $Id: getopt.h,v 1.1 2009/10/16 19:50:28 rodney Exp rodney $ */
|
||||
/* $OpenBSD: getopt.h,v 1.1 2002/12/03 20:24:29 millert Exp $ */
|
||||
/* $NetBSD: getopt.h,v 1.4 2000/07/07 10:43:54 ad Exp $ */
|
||||
|
||||
/*-
|
||||
* Copyright (c) 2000 The NetBSD Foundation, Inc.
|
||||
* All rights reserved.
|
||||
*
|
||||
* This code is derived from software contributed to The NetBSD Foundation
|
||||
* by Dieter Baron and Thomas Klausner.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 3. All advertising materials mentioning features or use of this software
|
||||
* must display the following acknowledgement:
|
||||
* This product includes software developed by the NetBSD
|
||||
* Foundation, Inc. and its contributors.
|
||||
* 4. Neither the name of The NetBSD Foundation nor the names of its
|
||||
* contributors may be used to endorse or promote products derived
|
||||
* from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
||||
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
||||
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
||||
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
* POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#ifndef _GETOPT_H_
|
||||
#define _GETOPT_H_
|
||||
|
||||
#if 0
|
||||
#include <sys/cdefs.h>
|
||||
#endif
|
||||
|
||||
/*
|
||||
* GNU-like getopt_long() and 4.4BSD getsubopt()/optreset extensions
|
||||
*/
|
||||
#define no_argument 0
|
||||
#define required_argument 1
|
||||
#define optional_argument 2
|
||||
|
||||
struct option {
|
||||
/* name of long option */
|
||||
const char *name;
|
||||
/*
|
||||
* one of no_argument, required_argument, and optional_argument:
|
||||
* whether option takes an argument
|
||||
*/
|
||||
int has_arg;
|
||||
/* if not NULL, set *flag to val when option found */
|
||||
int *flag;
|
||||
/* if flag not NULL, value to set *flag to; else return value */
|
||||
int val;
|
||||
};
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
int getopt_long(int, char * const *, const char *,
|
||||
const struct option *, int *);
|
||||
int getopt_long_only(int, char * const *, const char *,
|
||||
const struct option *, int *);
|
||||
#ifndef _GETOPT_DEFINED
|
||||
#define _GETOPT_DEFINED
|
||||
int getopt(int, char * const *, const char *);
|
||||
int getsubopt(char **, char * const *, char **);
|
||||
|
||||
extern char *optarg; /* getopt(3) external variables */
|
||||
extern int opterr;
|
||||
extern int optind;
|
||||
extern int optopt;
|
||||
extern int optreset;
|
||||
extern char *suboptarg; /* getsubopt(3) external variable */
|
||||
#endif /* _GETOPT_DEFINED */
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
#endif /* !_GETOPT_H_ */
|
||||
@@ -0,0 +1,554 @@
|
||||
/* $Id: getopt_long.c,v 1.1 2009/10/16 19:50:28 rodney Exp rodney $ */
|
||||
/* $OpenBSD: getopt_long.c,v 1.23 2007/10/31 12:34:57 chl Exp $ */
|
||||
/* $NetBSD: getopt_long.c,v 1.15 2002/01/31 22:43:40 tv Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 2002 Todd C. Miller <Todd.Miller@courtesan.com>
|
||||
*
|
||||
* Permission to use, copy, modify, and distribute this software for any
|
||||
* purpose with or without fee is hereby granted, provided that the above
|
||||
* copyright notice and this permission notice appear in all copies.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
||||
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
||||
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
||||
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
||||
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
||||
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
||||
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
||||
*
|
||||
* Sponsored in part by the Defense Advanced Research Projects
|
||||
* Agency (DARPA) and Air Force Research Laboratory, Air Force
|
||||
* Materiel Command, USAF, under agreement number F39502-99-1-0512.
|
||||
*/
|
||||
|
||||
#ifndef lint
|
||||
static const char rcsid[]="$Id: getopt_long.c,v 1.1 2009/10/16 19:50:28 rodney Exp rodney $";
|
||||
#endif /* lint */
|
||||
/*-
|
||||
* Copyright (c) 2000 The NetBSD Foundation, Inc.
|
||||
* All rights reserved.
|
||||
*
|
||||
* This code is derived from software contributed to The NetBSD Foundation
|
||||
* by Dieter Baron and Thomas Klausner.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
||||
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
||||
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
||||
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
||||
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
||||
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
||||
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
||||
* POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#if 0
|
||||
#include <err.h>
|
||||
#endif
|
||||
#include <errno.h>
|
||||
#include <getopt.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef _WIN32
|
||||
|
||||
/* Windows needs warnx(). We change the definition though:
|
||||
* 1. (another) global is defined, opterrmsg, which holds the error message
|
||||
* 2. errors are always printed out on stderr w/o the program name
|
||||
* Note that opterrmsg always gets set no matter what opterr is set to. The
|
||||
* error message will not be printed if opterr is 0 as usual.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdarg.h>
|
||||
|
||||
char opterrmsg[128]; /* last error message is stored here */
|
||||
|
||||
static void warnx(const char *fmt, ...)
|
||||
{
|
||||
va_list ap;
|
||||
va_start(ap, fmt);
|
||||
if (fmt != NULL)
|
||||
_vsnprintf(opterrmsg, 128, fmt, ap);
|
||||
else
|
||||
opterrmsg[0]='\0';
|
||||
va_end(ap);
|
||||
fprintf(stderr, opterrmsg);
|
||||
fprintf(stderr, "\n");
|
||||
}
|
||||
|
||||
#endif /*_WIN32*/
|
||||
|
||||
#define REPLACE_GETOPT /* use this getopt as the system getopt(3) */
|
||||
|
||||
#ifdef REPLACE_GETOPT
|
||||
int opterr = 1; /* if error message should be printed */
|
||||
int optind = 1; /* index into parent argv vector */
|
||||
int optopt = '?'; /* character checked for validity */
|
||||
int optreset; /* reset getopt */
|
||||
char *optarg; /* argument associated with option */
|
||||
#endif
|
||||
|
||||
#define PRINT_ERROR ((opterr) && (*options != ':'))
|
||||
|
||||
#define FLAG_PERMUTE 0x01 /* permute non-options to the end of argv */
|
||||
#define FLAG_ALLARGS 0x02 /* treat non-options as args to option "-1" */
|
||||
#define FLAG_LONGONLY 0x04 /* operate as getopt_long_only */
|
||||
|
||||
/* return values */
|
||||
#define BADCH (int)'?'
|
||||
#define BADARG ((*options == ':') ? (int)':' : (int)'?')
|
||||
#define INORDER (int)1
|
||||
|
||||
#define EMSG ""
|
||||
|
||||
static int getopt_internal(int, char * const *, const char *,
|
||||
const struct option *, int *, int);
|
||||
static int parse_long_options(char * const *, const char *,
|
||||
const struct option *, int *, int);
|
||||
static int gcd(int, int);
|
||||
static void permute_args(int, int, int, char * const *);
|
||||
|
||||
static char *place = EMSG; /* option letter processing */
|
||||
|
||||
/* XXX: set optreset to 1 rather than these two */
|
||||
static int nonopt_start = -1; /* first non option argument (for permute) */
|
||||
static int nonopt_end = -1; /* first option after non options (for permute) */
|
||||
|
||||
/* Error messages */
|
||||
static const char recargchar[] = "option requires an argument -- %c";
|
||||
static const char recargstring[] = "option requires an argument -- %s";
|
||||
static const char ambig[] = "ambiguous option -- %.*s";
|
||||
static const char noarg[] = "option doesn't take an argument -- %.*s";
|
||||
static const char illoptchar[] = "unknown option -- %c";
|
||||
static const char illoptstring[] = "unknown option -- %s";
|
||||
|
||||
/*
|
||||
* Compute the greatest common divisor of a and b.
|
||||
*/
|
||||
static int
|
||||
gcd(int a, int b)
|
||||
{
|
||||
int c;
|
||||
|
||||
c = a % b;
|
||||
while (c != 0) {
|
||||
a = b;
|
||||
b = c;
|
||||
c = a % b;
|
||||
}
|
||||
|
||||
return (b);
|
||||
}
|
||||
|
||||
/*
|
||||
* Exchange the block from nonopt_start to nonopt_end with the block
|
||||
* from nonopt_end to opt_end (keeping the same order of arguments
|
||||
* in each block).
|
||||
*/
|
||||
static void
|
||||
permute_args(int panonopt_start, int panonopt_end, int opt_end,
|
||||
char * const *nargv)
|
||||
{
|
||||
int cstart, cyclelen, i, j, ncycle, nnonopts, nopts, pos;
|
||||
char *swap;
|
||||
|
||||
/*
|
||||
* compute lengths of blocks and number and size of cycles
|
||||
*/
|
||||
nnonopts = panonopt_end - panonopt_start;
|
||||
nopts = opt_end - panonopt_end;
|
||||
ncycle = gcd(nnonopts, nopts);
|
||||
cyclelen = (opt_end - panonopt_start) / ncycle;
|
||||
|
||||
for (i = 0; i < ncycle; i++) {
|
||||
cstart = panonopt_end+i;
|
||||
pos = cstart;
|
||||
for (j = 0; j < cyclelen; j++) {
|
||||
if (pos >= panonopt_end)
|
||||
pos -= nnonopts;
|
||||
else
|
||||
pos += nopts;
|
||||
swap = nargv[pos];
|
||||
/* LINTED const cast */
|
||||
((char **) nargv)[pos] = nargv[cstart];
|
||||
/* LINTED const cast */
|
||||
((char **)nargv)[cstart] = swap;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* parse_long_options --
|
||||
* Parse long options in argc/argv argument vector.
|
||||
* Returns -1 if short_too is set and the option does not match long_options.
|
||||
*/
|
||||
static int
|
||||
parse_long_options(char * const *nargv, const char *options,
|
||||
const struct option *long_options, int *idx, int short_too)
|
||||
{
|
||||
char *current_argv, *has_equal;
|
||||
size_t current_argv_len;
|
||||
int i, match;
|
||||
|
||||
current_argv = place;
|
||||
match = -1;
|
||||
|
||||
optind++;
|
||||
|
||||
if ((has_equal = strchr(current_argv, '=')) != NULL) {
|
||||
/* argument found (--option=arg) */
|
||||
current_argv_len = has_equal - current_argv;
|
||||
has_equal++;
|
||||
} else
|
||||
current_argv_len = strlen(current_argv);
|
||||
|
||||
for (i = 0; long_options[i].name; i++) {
|
||||
/* find matching long option */
|
||||
if (strncmp(current_argv, long_options[i].name,
|
||||
current_argv_len))
|
||||
continue;
|
||||
|
||||
if (strlen(long_options[i].name) == current_argv_len) {
|
||||
/* exact match */
|
||||
match = i;
|
||||
break;
|
||||
}
|
||||
/*
|
||||
* If this is a known short option, don't allow
|
||||
* a partial match of a single character.
|
||||
*/
|
||||
if (short_too && current_argv_len == 1)
|
||||
continue;
|
||||
|
||||
if (match == -1) /* partial match */
|
||||
match = i;
|
||||
else {
|
||||
/* ambiguous abbreviation */
|
||||
if (PRINT_ERROR)
|
||||
warnx(ambig, (int)current_argv_len,
|
||||
current_argv);
|
||||
optopt = 0;
|
||||
return (BADCH);
|
||||
}
|
||||
}
|
||||
if (match != -1) { /* option found */
|
||||
if (long_options[match].has_arg == no_argument
|
||||
&& has_equal) {
|
||||
if (PRINT_ERROR)
|
||||
warnx(noarg, (int)current_argv_len,
|
||||
current_argv);
|
||||
/*
|
||||
* XXX: GNU sets optopt to val regardless of flag
|
||||
*/
|
||||
if (long_options[match].flag == NULL)
|
||||
optopt = long_options[match].val;
|
||||
else
|
||||
optopt = 0;
|
||||
return (BADARG);
|
||||
}
|
||||
if (long_options[match].has_arg == required_argument ||
|
||||
long_options[match].has_arg == optional_argument) {
|
||||
if (has_equal)
|
||||
optarg = has_equal;
|
||||
else if (long_options[match].has_arg ==
|
||||
required_argument) {
|
||||
/*
|
||||
* optional argument doesn't use next nargv
|
||||
*/
|
||||
optarg = nargv[optind++];
|
||||
}
|
||||
}
|
||||
if ((long_options[match].has_arg == required_argument)
|
||||
&& (optarg == NULL)) {
|
||||
/*
|
||||
* Missing argument; leading ':' indicates no error
|
||||
* should be generated.
|
||||
*/
|
||||
if (PRINT_ERROR)
|
||||
warnx(recargstring,
|
||||
current_argv);
|
||||
/*
|
||||
* XXX: GNU sets optopt to val regardless of flag
|
||||
*/
|
||||
if (long_options[match].flag == NULL)
|
||||
optopt = long_options[match].val;
|
||||
else
|
||||
optopt = 0;
|
||||
--optind;
|
||||
return (BADARG);
|
||||
}
|
||||
} else { /* unknown option */
|
||||
if (short_too) {
|
||||
--optind;
|
||||
return (-1);
|
||||
}
|
||||
if (PRINT_ERROR)
|
||||
warnx(illoptstring, current_argv);
|
||||
optopt = 0;
|
||||
return (BADCH);
|
||||
}
|
||||
if (idx)
|
||||
*idx = match;
|
||||
if (long_options[match].flag) {
|
||||
*long_options[match].flag = long_options[match].val;
|
||||
return (0);
|
||||
} else
|
||||
return (long_options[match].val);
|
||||
}
|
||||
|
||||
/*
|
||||
* getopt_internal --
|
||||
* Parse argc/argv argument vector. Called by user level routines.
|
||||
*/
|
||||
static int
|
||||
getopt_internal(int nargc, char * const *nargv, const char *options,
|
||||
const struct option *long_options, int *idx, int flags)
|
||||
{
|
||||
char *oli; /* option letter list index */
|
||||
int optchar, short_too;
|
||||
static int posixly_correct = -1;
|
||||
|
||||
if (options == NULL)
|
||||
return (-1);
|
||||
|
||||
/*
|
||||
* Disable GNU extensions if POSIXLY_CORRECT is set or options
|
||||
* string begins with a '+'.
|
||||
*/
|
||||
if (posixly_correct == -1)
|
||||
posixly_correct = (getenv("POSIXLY_CORRECT") != NULL);
|
||||
if (posixly_correct || *options == '+')
|
||||
flags &= ~FLAG_PERMUTE;
|
||||
else if (*options == '-')
|
||||
flags |= FLAG_ALLARGS;
|
||||
if (*options == '+' || *options == '-')
|
||||
options++;
|
||||
|
||||
/*
|
||||
* XXX Some GNU programs (like cvs) set optind to 0 instead of
|
||||
* XXX using optreset. Work around this braindamage.
|
||||
*/
|
||||
if (optind == 0)
|
||||
optind = optreset = 1;
|
||||
|
||||
optarg = NULL;
|
||||
if (optreset)
|
||||
nonopt_start = nonopt_end = -1;
|
||||
start:
|
||||
if (optreset || !*place) { /* update scanning pointer */
|
||||
optreset = 0;
|
||||
if (optind >= nargc) { /* end of argument vector */
|
||||
place = EMSG;
|
||||
if (nonopt_end != -1) {
|
||||
/* do permutation, if we have to */
|
||||
permute_args(nonopt_start, nonopt_end,
|
||||
optind, nargv);
|
||||
optind -= nonopt_end - nonopt_start;
|
||||
}
|
||||
else if (nonopt_start != -1) {
|
||||
/*
|
||||
* If we skipped non-options, set optind
|
||||
* to the first of them.
|
||||
*/
|
||||
optind = nonopt_start;
|
||||
}
|
||||
nonopt_start = nonopt_end = -1;
|
||||
return (-1);
|
||||
}
|
||||
if (*(place = nargv[optind]) != '-' ||
|
||||
(place[1] == '\0' && strchr(options, '-') == NULL)) {
|
||||
place = EMSG; /* found non-option */
|
||||
if (flags & FLAG_ALLARGS) {
|
||||
/*
|
||||
* GNU extension:
|
||||
* return non-option as argument to option 1
|
||||
*/
|
||||
optarg = nargv[optind++];
|
||||
return (INORDER);
|
||||
}
|
||||
if (!(flags & FLAG_PERMUTE)) {
|
||||
/*
|
||||
* If no permutation wanted, stop parsing
|
||||
* at first non-option.
|
||||
*/
|
||||
return (-1);
|
||||
}
|
||||
/* do permutation */
|
||||
if (nonopt_start == -1)
|
||||
nonopt_start = optind;
|
||||
else if (nonopt_end != -1) {
|
||||
permute_args(nonopt_start, nonopt_end,
|
||||
optind, nargv);
|
||||
nonopt_start = optind -
|
||||
(nonopt_end - nonopt_start);
|
||||
nonopt_end = -1;
|
||||
}
|
||||
optind++;
|
||||
/* process next argument */
|
||||
goto start;
|
||||
}
|
||||
if (nonopt_start != -1 && nonopt_end == -1)
|
||||
nonopt_end = optind;
|
||||
|
||||
/*
|
||||
* If we have "-" do nothing, if "--" we are done.
|
||||
*/
|
||||
if (place[1] != '\0' && *++place == '-' && place[1] == '\0') {
|
||||
optind++;
|
||||
place = EMSG;
|
||||
/*
|
||||
* We found an option (--), so if we skipped
|
||||
* non-options, we have to permute.
|
||||
*/
|
||||
if (nonopt_end != -1) {
|
||||
permute_args(nonopt_start, nonopt_end,
|
||||
optind, nargv);
|
||||
optind -= nonopt_end - nonopt_start;
|
||||
}
|
||||
nonopt_start = nonopt_end = -1;
|
||||
return (-1);
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* Check long options if:
|
||||
* 1) we were passed some
|
||||
* 2) the arg is not just "-"
|
||||
* 3) either the arg starts with -- we are getopt_long_only()
|
||||
*/
|
||||
if (long_options != NULL && place != nargv[optind] &&
|
||||
(*place == '-' || (flags & FLAG_LONGONLY))) {
|
||||
short_too = 0;
|
||||
if (*place == '-')
|
||||
place++; /* --foo long option */
|
||||
else if (*place != ':' && strchr(options, *place) != NULL)
|
||||
short_too = 1; /* could be short option too */
|
||||
|
||||
optchar = parse_long_options(nargv, options, long_options,
|
||||
idx, short_too);
|
||||
if (optchar != -1) {
|
||||
place = EMSG;
|
||||
return (optchar);
|
||||
}
|
||||
}
|
||||
|
||||
if ((optchar = (int)*place++) == (int)':' ||
|
||||
(optchar == (int)'-' && *place != '\0') ||
|
||||
(oli = strchr(options, optchar)) == NULL) {
|
||||
/*
|
||||
* If the user specified "-" and '-' isn't listed in
|
||||
* options, return -1 (non-option) as per POSIX.
|
||||
* Otherwise, it is an unknown option character (or ':').
|
||||
*/
|
||||
if (optchar == (int)'-' && *place == '\0')
|
||||
return (-1);
|
||||
if (!*place)
|
||||
++optind;
|
||||
if (PRINT_ERROR)
|
||||
warnx(illoptchar, optchar);
|
||||
optopt = optchar;
|
||||
return (BADCH);
|
||||
}
|
||||
if (long_options != NULL && optchar == 'W' && oli[1] == ';') {
|
||||
/* -W long-option */
|
||||
if (*place) /* no space */
|
||||
/* NOTHING */;
|
||||
else if (++optind >= nargc) { /* no arg */
|
||||
place = EMSG;
|
||||
if (PRINT_ERROR)
|
||||
warnx(recargchar, optchar);
|
||||
optopt = optchar;
|
||||
return (BADARG);
|
||||
} else /* white space */
|
||||
place = nargv[optind];
|
||||
optchar = parse_long_options(nargv, options, long_options,
|
||||
idx, 0);
|
||||
place = EMSG;
|
||||
return (optchar);
|
||||
}
|
||||
if (*++oli != ':') { /* doesn't take argument */
|
||||
if (!*place)
|
||||
++optind;
|
||||
} else { /* takes (optional) argument */
|
||||
optarg = NULL;
|
||||
if (*place) /* no white space */
|
||||
optarg = place;
|
||||
else if (oli[1] != ':') { /* arg not optional */
|
||||
if (++optind >= nargc) { /* no arg */
|
||||
place = EMSG;
|
||||
if (PRINT_ERROR)
|
||||
warnx(recargchar, optchar);
|
||||
optopt = optchar;
|
||||
return (BADARG);
|
||||
} else
|
||||
optarg = nargv[optind];
|
||||
}
|
||||
place = EMSG;
|
||||
++optind;
|
||||
}
|
||||
/* dump back option letter */
|
||||
return (optchar);
|
||||
}
|
||||
|
||||
#ifdef REPLACE_GETOPT
|
||||
/*
|
||||
* getopt --
|
||||
* Parse argc/argv argument vector.
|
||||
*
|
||||
* [eventually this will replace the BSD getopt]
|
||||
*/
|
||||
int
|
||||
getopt(int nargc, char * const *nargv, const char *options)
|
||||
{
|
||||
|
||||
/*
|
||||
* We don't pass FLAG_PERMUTE to getopt_internal() since
|
||||
* the BSD getopt(3) (unlike GNU) has never done this.
|
||||
*
|
||||
* Furthermore, since many privileged programs call getopt()
|
||||
* before dropping privileges it makes sense to keep things
|
||||
* as simple (and bug-free) as possible.
|
||||
*/
|
||||
return (getopt_internal(nargc, nargv, options, NULL, NULL, 0));
|
||||
}
|
||||
#endif /* REPLACE_GETOPT */
|
||||
|
||||
/*
|
||||
* getopt_long --
|
||||
* Parse argc/argv argument vector.
|
||||
*/
|
||||
int
|
||||
getopt_long(int nargc, char * const *nargv, const char *options,
|
||||
const struct option *long_options, int *idx)
|
||||
{
|
||||
|
||||
return (getopt_internal(nargc, nargv, options, long_options, idx,
|
||||
FLAG_PERMUTE));
|
||||
}
|
||||
|
||||
/*
|
||||
* getopt_long_only --
|
||||
* Parse argc/argv argument vector.
|
||||
*/
|
||||
int
|
||||
getopt_long_only(int nargc, char * const *nargv, const char *options,
|
||||
const struct option *long_options, int *idx)
|
||||
{
|
||||
|
||||
return (getopt_internal(nargc, nargv, options, long_options, idx,
|
||||
FLAG_PERMUTE|FLAG_LONGONLY));
|
||||
}
|
||||
@@ -0,0 +1,83 @@
|
||||
#include < time.h >
|
||||
#include <windows.h> //I've ommited this line.
|
||||
#if defined(_MSC_VER) || defined(_MSC_EXTENSIONS)
|
||||
#define DELTA_EPOCH_IN_MICROSECS 11644473600000000Ui64
|
||||
#else
|
||||
#define DELTA_EPOCH_IN_MICROSECS 11644473600000000ULL
|
||||
#endif
|
||||
|
||||
struct timezone
|
||||
{
|
||||
int tz_minuteswest; /* minutes W of Greenwich */
|
||||
int tz_dsttime; /* type of dst correction */
|
||||
};
|
||||
|
||||
int gettimeofday(struct timeval *tv, struct timezone *tz)
|
||||
{
|
||||
FILETIME ft;
|
||||
unsigned __int64 tmpres = 0;
|
||||
static int tzflag;
|
||||
|
||||
if (NULL != tv)
|
||||
{
|
||||
GetSystemTimeAsFileTime(&ft);
|
||||
|
||||
tmpres |= ft.dwHighDateTime;
|
||||
tmpres <<= 32;
|
||||
tmpres |= ft.dwLowDateTime;
|
||||
|
||||
/*converting file time to unix epoch*/
|
||||
tmpres /= 10; /*convert into microseconds*/
|
||||
tmpres -= DELTA_EPOCH_IN_MICROSECS;
|
||||
tv->tv_sec = (long)(tmpres / 1000000UL);
|
||||
tv->tv_usec = (long)(tmpres % 1000000UL);
|
||||
}
|
||||
|
||||
if (NULL != tz)
|
||||
{
|
||||
if (!tzflag)
|
||||
{
|
||||
_tzset();
|
||||
tzflag++;
|
||||
}
|
||||
tz->tz_minuteswest = _timezone / 60;
|
||||
tz->tz_dsttime = _daylight;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void usleep(__int64 waitTime)
|
||||
{
|
||||
if (waitTime > 0)
|
||||
{
|
||||
if (waitTime > 100)
|
||||
{
|
||||
// use a waitable timer for larger intervals > 0.1ms
|
||||
|
||||
HANDLE timer;
|
||||
LARGE_INTEGER ft;
|
||||
|
||||
ft.QuadPart = -(10*waitTime); // Convert to 100 nanosecond interval, negative value indicates relative time
|
||||
|
||||
timer = CreateWaitableTimer(NULL, TRUE, NULL);
|
||||
SetWaitableTimer(timer, &ft, 0, NULL, NULL, 0);
|
||||
WaitForSingleObject(timer, INFINITE);
|
||||
CloseHandle(timer);
|
||||
}
|
||||
else
|
||||
{
|
||||
// use a polling loop for short intervals <= 100ms
|
||||
|
||||
LARGE_INTEGER perfCnt, start, now;
|
||||
__int64 elapsed;
|
||||
|
||||
QueryPerformanceFrequency(&perfCnt);
|
||||
QueryPerformanceCounter(&start);
|
||||
do {
|
||||
QueryPerformanceCounter((LARGE_INTEGER*) &now);
|
||||
elapsed = (__int64)((now.QuadPart - start.QuadPart) / (float)perfCnt.QuadPart * 1000 * 1000);
|
||||
} while ( elapsed < waitTime );
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,2 @@
|
||||
#pragma once
|
||||
#include <stdint.h>
|
||||
@@ -0,0 +1,18 @@
|
||||
|
||||
noinst_LIBRARIES = libjansson.a
|
||||
|
||||
libjansson_a_SOURCES = \
|
||||
config.h \
|
||||
dump.c \
|
||||
hashtable.c \
|
||||
hashtable.h \
|
||||
jansson.h \
|
||||
jansson_private.h \
|
||||
load.c \
|
||||
strbuffer.c \
|
||||
strbuffer.h \
|
||||
utf.c \
|
||||
utf.h \
|
||||
util.h \
|
||||
value.c
|
||||
|
||||
@@ -0,0 +1,571 @@
|
||||
# Makefile.in generated by automake 1.13.3 from Makefile.am.
|
||||
# @configure_input@
|
||||
|
||||
# Copyright (C) 1994-2013 Free Software Foundation, Inc.
|
||||
|
||||
# This Makefile.in is free software; the Free Software Foundation
|
||||
# gives unlimited permission to copy and/or distribute it,
|
||||
# with or without modifications, as long as this notice is preserved.
|
||||
|
||||
# This program is distributed in the hope that it will be useful,
|
||||
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||
# PARTICULAR PURPOSE.
|
||||
|
||||
@SET_MAKE@
|
||||
|
||||
VPATH = @srcdir@
|
||||
am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
|
||||
am__make_running_with_option = \
|
||||
case $${target_option-} in \
|
||||
?) ;; \
|
||||
*) echo "am__make_running_with_option: internal error: invalid" \
|
||||
"target option '$${target_option-}' specified" >&2; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
has_opt=no; \
|
||||
sane_makeflags=$$MAKEFLAGS; \
|
||||
if $(am__is_gnu_make); then \
|
||||
sane_makeflags=$$MFLAGS; \
|
||||
else \
|
||||
case $$MAKEFLAGS in \
|
||||
*\\[\ \ ]*) \
|
||||
bs=\\; \
|
||||
sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
|
||||
| sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \
|
||||
esac; \
|
||||
fi; \
|
||||
skip_next=no; \
|
||||
strip_trailopt () \
|
||||
{ \
|
||||
flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
|
||||
}; \
|
||||
for flg in $$sane_makeflags; do \
|
||||
test $$skip_next = yes && { skip_next=no; continue; }; \
|
||||
case $$flg in \
|
||||
*=*|--*) continue;; \
|
||||
-*I) strip_trailopt 'I'; skip_next=yes;; \
|
||||
-*I?*) strip_trailopt 'I';; \
|
||||
-*O) strip_trailopt 'O'; skip_next=yes;; \
|
||||
-*O?*) strip_trailopt 'O';; \
|
||||
-*l) strip_trailopt 'l'; skip_next=yes;; \
|
||||
-*l?*) strip_trailopt 'l';; \
|
||||
-[dEDm]) skip_next=yes;; \
|
||||
-[JT]) skip_next=yes;; \
|
||||
esac; \
|
||||
case $$flg in \
|
||||
*$$target_option*) has_opt=yes; break;; \
|
||||
esac; \
|
||||
done; \
|
||||
test $$has_opt = yes
|
||||
am__make_dryrun = (target_option=n; $(am__make_running_with_option))
|
||||
am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
|
||||
pkgdatadir = $(datadir)/@PACKAGE@
|
||||
pkgincludedir = $(includedir)/@PACKAGE@
|
||||
pkglibdir = $(libdir)/@PACKAGE@
|
||||
pkglibexecdir = $(libexecdir)/@PACKAGE@
|
||||
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||
install_sh_DATA = $(install_sh) -c -m 644
|
||||
install_sh_PROGRAM = $(install_sh) -c
|
||||
install_sh_SCRIPT = $(install_sh) -c
|
||||
INSTALL_HEADER = $(INSTALL_DATA)
|
||||
transform = $(program_transform_name)
|
||||
NORMAL_INSTALL = :
|
||||
PRE_INSTALL = :
|
||||
POST_INSTALL = :
|
||||
NORMAL_UNINSTALL = :
|
||||
PRE_UNINSTALL = :
|
||||
POST_UNINSTALL = :
|
||||
build_triplet = @build@
|
||||
host_triplet = @host@
|
||||
target_triplet = @target@
|
||||
subdir = compat/jansson
|
||||
DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \
|
||||
$(top_srcdir)/depcomp
|
||||
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||
am__aclocal_m4_deps = $(top_srcdir)/configure.ac
|
||||
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||
$(ACLOCAL_M4)
|
||||
mkinstalldirs = $(install_sh) -d
|
||||
CONFIG_HEADER = $(top_builddir)/cpuminer-config.h
|
||||
CONFIG_CLEAN_FILES =
|
||||
CONFIG_CLEAN_VPATH_FILES =
|
||||
LIBRARIES = $(noinst_LIBRARIES)
|
||||
AR = ar
|
||||
ARFLAGS = cru
|
||||
AM_V_AR = $(am__v_AR_@AM_V@)
|
||||
am__v_AR_ = $(am__v_AR_@AM_DEFAULT_V@)
|
||||
am__v_AR_0 = @echo " AR " $@;
|
||||
am__v_AR_1 =
|
||||
libjansson_a_AR = $(AR) $(ARFLAGS)
|
||||
libjansson_a_LIBADD =
|
||||
am_libjansson_a_OBJECTS = dump.$(OBJEXT) hashtable.$(OBJEXT) \
|
||||
load.$(OBJEXT) strbuffer.$(OBJEXT) utf.$(OBJEXT) \
|
||||
value.$(OBJEXT)
|
||||
libjansson_a_OBJECTS = $(am_libjansson_a_OBJECTS)
|
||||
AM_V_P = $(am__v_P_@AM_V@)
|
||||
am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
|
||||
am__v_P_0 = false
|
||||
am__v_P_1 = :
|
||||
AM_V_GEN = $(am__v_GEN_@AM_V@)
|
||||
am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
|
||||
am__v_GEN_0 = @echo " GEN " $@;
|
||||
am__v_GEN_1 =
|
||||
AM_V_at = $(am__v_at_@AM_V@)
|
||||
am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
|
||||
am__v_at_0 = @
|
||||
am__v_at_1 =
|
||||
DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)
|
||||
depcomp = $(SHELL) $(top_srcdir)/depcomp
|
||||
am__depfiles_maybe = depfiles
|
||||
am__mv = mv -f
|
||||
COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
|
||||
$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
|
||||
AM_V_CC = $(am__v_CC_@AM_V@)
|
||||
am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@)
|
||||
am__v_CC_0 = @echo " CC " $@;
|
||||
am__v_CC_1 =
|
||||
CCLD = $(CC)
|
||||
LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
|
||||
AM_V_CCLD = $(am__v_CCLD_@AM_V@)
|
||||
am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@)
|
||||
am__v_CCLD_0 = @echo " CCLD " $@;
|
||||
am__v_CCLD_1 =
|
||||
SOURCES = $(libjansson_a_SOURCES)
|
||||
DIST_SOURCES = $(libjansson_a_SOURCES)
|
||||
am__can_run_installinfo = \
|
||||
case $$AM_UPDATE_INFO_DIR in \
|
||||
n|no|NO) false;; \
|
||||
*) (install-info --version) >/dev/null 2>&1;; \
|
||||
esac
|
||||
am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
|
||||
# Read a list of newline-separated strings from the standard input,
|
||||
# and print each of them once, without duplicates. Input order is
|
||||
# *not* preserved.
|
||||
am__uniquify_input = $(AWK) '\
|
||||
BEGIN { nonempty = 0; } \
|
||||
{ items[$$0] = 1; nonempty = 1; } \
|
||||
END { if (nonempty) { for (i in items) print i; }; } \
|
||||
'
|
||||
# Make sure the list of sources is unique. This is necessary because,
|
||||
# e.g., the same source file might be shared among _SOURCES variables
|
||||
# for different programs/libraries.
|
||||
am__define_uniq_tagged_files = \
|
||||
list='$(am__tagged_files)'; \
|
||||
unique=`for i in $$list; do \
|
||||
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||
done | $(am__uniquify_input)`
|
||||
ETAGS = etags
|
||||
CTAGS = ctags
|
||||
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||
ACLOCAL = @ACLOCAL@
|
||||
ALLOCA = @ALLOCA@
|
||||
AMTAR = @AMTAR@
|
||||
AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
|
||||
AUTOCONF = @AUTOCONF@
|
||||
AUTOHEADER = @AUTOHEADER@
|
||||
AUTOMAKE = @AUTOMAKE@
|
||||
AWK = @AWK@
|
||||
CC = @CC@
|
||||
CCAS = @CCAS@
|
||||
CCASDEPMODE = @CCASDEPMODE@
|
||||
CCASFLAGS = @CCASFLAGS@
|
||||
CCDEPMODE = @CCDEPMODE@
|
||||
CFLAGS = @CFLAGS@
|
||||
CPP = @CPP@
|
||||
CPPFLAGS = @CPPFLAGS@
|
||||
CUDA_CFLAGS = @CUDA_CFLAGS@
|
||||
CUDA_LDFLAGS = @CUDA_LDFLAGS@
|
||||
CUDA_LIBS = @CUDA_LIBS@
|
||||
CXX = @CXX@
|
||||
CXXDEPMODE = @CXXDEPMODE@
|
||||
CXXFLAGS = @CXXFLAGS@
|
||||
CYGPATH_W = @CYGPATH_W@
|
||||
DEFS = @DEFS@
|
||||
DEPDIR = @DEPDIR@
|
||||
ECHO_C = @ECHO_C@
|
||||
ECHO_N = @ECHO_N@
|
||||
ECHO_T = @ECHO_T@
|
||||
EGREP = @EGREP@
|
||||
EXEEXT = @EXEEXT@
|
||||
GREP = @GREP@
|
||||
INSTALL = @INSTALL@
|
||||
INSTALL_DATA = @INSTALL_DATA@
|
||||
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||
JANSSON_LIBS = @JANSSON_LIBS@
|
||||
LDFLAGS = @LDFLAGS@
|
||||
LIBCURL = @LIBCURL@
|
||||
LIBCURL_CPPFLAGS = @LIBCURL_CPPFLAGS@
|
||||
LIBOBJS = @LIBOBJS@
|
||||
LIBS = @LIBS@
|
||||
LTLIBOBJS = @LTLIBOBJS@
|
||||
MAINT = @MAINT@
|
||||
MAKEINFO = @MAKEINFO@
|
||||
MKDIR_P = @MKDIR_P@
|
||||
NVCC = @NVCC@
|
||||
OBJEXT = @OBJEXT@
|
||||
OPENMP_CFLAGS = @OPENMP_CFLAGS@
|
||||
PACKAGE = @PACKAGE@
|
||||
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||
PACKAGE_NAME = @PACKAGE_NAME@
|
||||
PACKAGE_STRING = @PACKAGE_STRING@
|
||||
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||
PACKAGE_URL = @PACKAGE_URL@
|
||||
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||
PTHREAD_FLAGS = @PTHREAD_FLAGS@
|
||||
PTHREAD_LIBS = @PTHREAD_LIBS@
|
||||
RANLIB = @RANLIB@
|
||||
SET_MAKE = @SET_MAKE@
|
||||
SHELL = @SHELL@
|
||||
STRIP = @STRIP@
|
||||
VERSION = @VERSION@
|
||||
WS2_LIBS = @WS2_LIBS@
|
||||
_libcurl_config = @_libcurl_config@
|
||||
abs_builddir = @abs_builddir@
|
||||
abs_srcdir = @abs_srcdir@
|
||||
abs_top_builddir = @abs_top_builddir@
|
||||
abs_top_srcdir = @abs_top_srcdir@
|
||||
ac_ct_CC = @ac_ct_CC@
|
||||
ac_ct_CXX = @ac_ct_CXX@
|
||||
am__include = @am__include@
|
||||
am__leading_dot = @am__leading_dot@
|
||||
am__quote = @am__quote@
|
||||
am__tar = @am__tar@
|
||||
am__untar = @am__untar@
|
||||
bindir = @bindir@
|
||||
build = @build@
|
||||
build_alias = @build_alias@
|
||||
build_cpu = @build_cpu@
|
||||
build_os = @build_os@
|
||||
build_vendor = @build_vendor@
|
||||
builddir = @builddir@
|
||||
datadir = @datadir@
|
||||
datarootdir = @datarootdir@
|
||||
docdir = @docdir@
|
||||
dvidir = @dvidir@
|
||||
exec_prefix = @exec_prefix@
|
||||
host = @host@
|
||||
host_alias = @host_alias@
|
||||
host_cpu = @host_cpu@
|
||||
host_os = @host_os@
|
||||
host_vendor = @host_vendor@
|
||||
htmldir = @htmldir@
|
||||
includedir = @includedir@
|
||||
infodir = @infodir@
|
||||
install_sh = @install_sh@
|
||||
libdir = @libdir@
|
||||
libexecdir = @libexecdir@
|
||||
localedir = @localedir@
|
||||
localstatedir = @localstatedir@
|
||||
mandir = @mandir@
|
||||
mkdir_p = @mkdir_p@
|
||||
oldincludedir = @oldincludedir@
|
||||
pdfdir = @pdfdir@
|
||||
prefix = @prefix@
|
||||
program_transform_name = @program_transform_name@
|
||||
psdir = @psdir@
|
||||
sbindir = @sbindir@
|
||||
sharedstatedir = @sharedstatedir@
|
||||
srcdir = @srcdir@
|
||||
sysconfdir = @sysconfdir@
|
||||
target = @target@
|
||||
target_alias = @target_alias@
|
||||
target_cpu = @target_cpu@
|
||||
target_os = @target_os@
|
||||
target_vendor = @target_vendor@
|
||||
top_build_prefix = @top_build_prefix@
|
||||
top_builddir = @top_builddir@
|
||||
top_srcdir = @top_srcdir@
|
||||
noinst_LIBRARIES = libjansson.a
|
||||
libjansson_a_SOURCES = \
|
||||
config.h \
|
||||
dump.c \
|
||||
hashtable.c \
|
||||
hashtable.h \
|
||||
jansson.h \
|
||||
jansson_private.h \
|
||||
load.c \
|
||||
strbuffer.c \
|
||||
strbuffer.h \
|
||||
utf.c \
|
||||
utf.h \
|
||||
util.h \
|
||||
value.c
|
||||
|
||||
all: all-am
|
||||
|
||||
.SUFFIXES:
|
||||
.SUFFIXES: .c .o .obj
|
||||
$(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am $(am__configure_deps)
|
||||
@for dep in $?; do \
|
||||
case '$(am__configure_deps)' in \
|
||||
*$$dep*) \
|
||||
( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
|
||||
&& { if test -f $@; then exit 0; else break; fi; }; \
|
||||
exit 1;; \
|
||||
esac; \
|
||||
done; \
|
||||
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu compat/jansson/Makefile'; \
|
||||
$(am__cd) $(top_srcdir) && \
|
||||
$(AUTOMAKE) --gnu compat/jansson/Makefile
|
||||
.PRECIOUS: Makefile
|
||||
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||
@case '$?' in \
|
||||
*config.status*) \
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
|
||||
*) \
|
||||
echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
|
||||
cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
|
||||
esac;
|
||||
|
||||
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
|
||||
$(top_srcdir)/configure: @MAINTAINER_MODE_TRUE@ $(am__configure_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(ACLOCAL_M4): @MAINTAINER_MODE_TRUE@ $(am__aclocal_m4_deps)
|
||||
cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
|
||||
$(am__aclocal_m4_deps):
|
||||
|
||||
clean-noinstLIBRARIES:
|
||||
-test -z "$(noinst_LIBRARIES)" || rm -f $(noinst_LIBRARIES)
|
||||
|
||||
libjansson.a: $(libjansson_a_OBJECTS) $(libjansson_a_DEPENDENCIES) $(EXTRA_libjansson_a_DEPENDENCIES)
|
||||
$(AM_V_at)-rm -f libjansson.a
|
||||
$(AM_V_AR)$(libjansson_a_AR) libjansson.a $(libjansson_a_OBJECTS) $(libjansson_a_LIBADD)
|
||||
$(AM_V_at)$(RANLIB) libjansson.a
|
||||
|
||||
mostlyclean-compile:
|
||||
-rm -f *.$(OBJEXT)
|
||||
|
||||
distclean-compile:
|
||||
-rm -f *.tab.c
|
||||
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dump.Po@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/hashtable.Po@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/load.Po@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/strbuffer.Po@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/utf.Po@am__quote@
|
||||
@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/value.Po@am__quote@
|
||||
|
||||
.c.o:
|
||||
@am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ $<
|
||||
@am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c $<
|
||||
|
||||
.c.obj:
|
||||
@am__fastdepCC_TRUE@ $(AM_V_CC)$(COMPILE) -MT $@ -MD -MP -MF $(DEPDIR)/$*.Tpo -c -o $@ `$(CYGPATH_W) '$<'`
|
||||
@am__fastdepCC_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/$*.Tpo $(DEPDIR)/$*.Po
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
|
||||
@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
|
||||
@am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c `$(CYGPATH_W) '$<'`
|
||||
|
||||
ID: $(am__tagged_files)
|
||||
$(am__define_uniq_tagged_files); mkid -fID $$unique
|
||||
tags: tags-am
|
||||
TAGS: tags
|
||||
|
||||
tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
|
||||
set x; \
|
||||
here=`pwd`; \
|
||||
$(am__define_uniq_tagged_files); \
|
||||
shift; \
|
||||
if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
|
||||
test -n "$$unique" || unique=$$empty_fix; \
|
||||
if test $$# -gt 0; then \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
"$$@" $$unique; \
|
||||
else \
|
||||
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||
$$unique; \
|
||||
fi; \
|
||||
fi
|
||||
ctags: ctags-am
|
||||
|
||||
CTAGS: ctags
|
||||
ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
|
||||
$(am__define_uniq_tagged_files); \
|
||||
test -z "$(CTAGS_ARGS)$$unique" \
|
||||
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||
$$unique
|
||||
|
||||
GTAGS:
|
||||
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||
&& $(am__cd) $(top_srcdir) \
|
||||
&& gtags -i $(GTAGS_ARGS) "$$here"
|
||||
cscopelist: cscopelist-am
|
||||
|
||||
cscopelist-am: $(am__tagged_files)
|
||||
list='$(am__tagged_files)'; \
|
||||
case "$(srcdir)" in \
|
||||
[\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
|
||||
*) sdir=$(subdir)/$(srcdir) ;; \
|
||||
esac; \
|
||||
for i in $$list; do \
|
||||
if test -f "$$i"; then \
|
||||
echo "$(subdir)/$$i"; \
|
||||
else \
|
||||
echo "$$sdir/$$i"; \
|
||||
fi; \
|
||||
done >> $(top_builddir)/cscope.files
|
||||
|
||||
distclean-tags:
|
||||
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||
|
||||
distdir: $(DISTFILES)
|
||||
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||
list='$(DISTFILES)'; \
|
||||
dist_files=`for file in $$list; do echo $$file; done | \
|
||||
sed -e "s|^$$srcdirstrip/||;t" \
|
||||
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||
case $$dist_files in \
|
||||
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||
sort -u` ;; \
|
||||
esac; \
|
||||
for file in $$dist_files; do \
|
||||
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||
if test -d $$d/$$file; then \
|
||||
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||
if test -d "$(distdir)/$$file"; then \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||
cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
|
||||
find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
|
||||
fi; \
|
||||
cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
|
||||
else \
|
||||
test -f "$(distdir)/$$file" \
|
||||
|| cp -p $$d/$$file "$(distdir)/$$file" \
|
||||
|| exit 1; \
|
||||
fi; \
|
||||
done
|
||||
check-am: all-am
|
||||
check: check-am
|
||||
all-am: Makefile $(LIBRARIES)
|
||||
installdirs:
|
||||
install: install-am
|
||||
install-exec: install-exec-am
|
||||
install-data: install-data-am
|
||||
uninstall: uninstall-am
|
||||
|
||||
install-am: all-am
|
||||
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||
|
||||
installcheck: installcheck-am
|
||||
install-strip:
|
||||
if test -z '$(STRIP)'; then \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
install; \
|
||||
else \
|
||||
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||
"INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
|
||||
fi
|
||||
mostlyclean-generic:
|
||||
|
||||
clean-generic:
|
||||
|
||||
distclean-generic:
|
||||
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||
-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
|
||||
|
||||
maintainer-clean-generic:
|
||||
@echo "This command is intended for maintainers to use"
|
||||
@echo "it deletes files that may require special tools to rebuild."
|
||||
clean: clean-am
|
||||
|
||||
clean-am: clean-generic clean-noinstLIBRARIES mostlyclean-am
|
||||
|
||||
distclean: distclean-am
|
||||
-rm -rf ./$(DEPDIR)
|
||||
-rm -f Makefile
|
||||
distclean-am: clean-am distclean-compile distclean-generic \
|
||||
distclean-tags
|
||||
|
||||
dvi: dvi-am
|
||||
|
||||
dvi-am:
|
||||
|
||||
html: html-am
|
||||
|
||||
html-am:
|
||||
|
||||
info: info-am
|
||||
|
||||
info-am:
|
||||
|
||||
install-data-am:
|
||||
|
||||
install-dvi: install-dvi-am
|
||||
|
||||
install-dvi-am:
|
||||
|
||||
install-exec-am:
|
||||
|
||||
install-html: install-html-am
|
||||
|
||||
install-html-am:
|
||||
|
||||
install-info: install-info-am
|
||||
|
||||
install-info-am:
|
||||
|
||||
install-man:
|
||||
|
||||
install-pdf: install-pdf-am
|
||||
|
||||
install-pdf-am:
|
||||
|
||||
install-ps: install-ps-am
|
||||
|
||||
install-ps-am:
|
||||
|
||||
installcheck-am:
|
||||
|
||||
maintainer-clean: maintainer-clean-am
|
||||
-rm -rf ./$(DEPDIR)
|
||||
-rm -f Makefile
|
||||
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||
|
||||
mostlyclean: mostlyclean-am
|
||||
|
||||
mostlyclean-am: mostlyclean-compile mostlyclean-generic
|
||||
|
||||
pdf: pdf-am
|
||||
|
||||
pdf-am:
|
||||
|
||||
ps: ps-am
|
||||
|
||||
ps-am:
|
||||
|
||||
uninstall-am:
|
||||
|
||||
.MAKE: install-am install-strip
|
||||
|
||||
.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \
|
||||
clean-noinstLIBRARIES cscopelist-am ctags ctags-am distclean \
|
||||
distclean-compile distclean-generic distclean-tags distdir dvi \
|
||||
dvi-am html html-am info info-am install install-am \
|
||||
install-data install-data-am install-dvi install-dvi-am \
|
||||
install-exec install-exec-am install-html install-html-am \
|
||||
install-info install-info-am install-man install-pdf \
|
||||
install-pdf-am install-ps install-ps-am install-strip \
|
||||
installcheck installcheck-am installdirs maintainer-clean \
|
||||
maintainer-clean-generic mostlyclean mostlyclean-compile \
|
||||
mostlyclean-generic pdf pdf-am ps ps-am tags tags-am uninstall \
|
||||
uninstall-am
|
||||
|
||||
|
||||
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||
.NOEXPORT:
|
||||
@@ -0,0 +1,73 @@
|
||||
/* config.h. Generated from config.h.in by configure. */
|
||||
/* config.h.in. Generated from configure.ac by autoheader. */
|
||||
|
||||
/* Define to 1 if you have the <dlfcn.h> header file. */
|
||||
#define HAVE_DLFCN_H 1
|
||||
|
||||
/* Define to 1 if you have the <inttypes.h> header file. */
|
||||
#define HAVE_INTTYPES_H 1
|
||||
|
||||
/* Define to 1 if you have the <memory.h> header file. */
|
||||
#define HAVE_MEMORY_H 1
|
||||
|
||||
/* Define to 1 if you have the <stdint.h> header file. */
|
||||
#define HAVE_STDINT_H 1
|
||||
|
||||
/* Define to 1 if you have the <stdlib.h> header file. */
|
||||
#define HAVE_STDLIB_H 1
|
||||
|
||||
/* Define to 1 if you have the <strings.h> header file. */
|
||||
#define HAVE_STRINGS_H 1
|
||||
|
||||
/* Define to 1 if you have the <string.h> header file. */
|
||||
#define HAVE_STRING_H 1
|
||||
|
||||
/* Define to 1 if you have the <sys/stat.h> header file. */
|
||||
#define HAVE_SYS_STAT_H 1
|
||||
|
||||
/* Define to 1 if you have the <sys/types.h> header file. */
|
||||
#define HAVE_SYS_TYPES_H 1
|
||||
|
||||
/* Define to 1 if you have the <unistd.h> header file. */
|
||||
#define HAVE_UNISTD_H 1
|
||||
|
||||
/* Define to the sub-directory in which libtool stores uninstalled libraries.
|
||||
*/
|
||||
#define LT_OBJDIR ".libs/"
|
||||
|
||||
/* Name of package */
|
||||
#define PACKAGE "jansson"
|
||||
|
||||
/* Define to the address where bug reports for this package should be sent. */
|
||||
#define PACKAGE_BUGREPORT "petri@digip.org"
|
||||
|
||||
/* Define to the full name of this package. */
|
||||
#define PACKAGE_NAME "jansson"
|
||||
|
||||
/* Define to the full name and version of this package. */
|
||||
#define PACKAGE_STRING "jansson 1.3"
|
||||
|
||||
/* Define to the one symbol short name of this package. */
|
||||
#define PACKAGE_TARNAME "jansson"
|
||||
|
||||
/* Define to the home page for this package. */
|
||||
#define PACKAGE_URL ""
|
||||
|
||||
/* Define to the version of this package. */
|
||||
#define PACKAGE_VERSION "1.3"
|
||||
|
||||
/* Define to 1 if you have the ANSI C header files. */
|
||||
#define STDC_HEADERS 1
|
||||
|
||||
/* Version number of package */
|
||||
#define VERSION "1.3"
|
||||
|
||||
/* Define to `__inline__' or `__inline' if that's what the C compiler
|
||||
calls it, or to nothing if 'inline' is not supported under any name. */
|
||||
#ifndef __cplusplus
|
||||
/* #undef inline */
|
||||
#endif
|
||||
|
||||
/* Define to the type of a signed integer type of width exactly 32 bits if
|
||||
such a type exists and the standard includes do not define it. */
|
||||
/* #undef int32_t */
|
||||
@@ -0,0 +1,460 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#define _GNU_SOURCE
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <assert.h>
|
||||
|
||||
#include <jansson.h>
|
||||
#include "jansson_private.h"
|
||||
#include "strbuffer.h"
|
||||
#include "utf.h"
|
||||
|
||||
#define MAX_INTEGER_STR_LENGTH 100
|
||||
#define MAX_REAL_STR_LENGTH 100
|
||||
|
||||
typedef int (*dump_func)(const char *buffer, int size, void *data);
|
||||
|
||||
struct string
|
||||
{
|
||||
char *buffer;
|
||||
int length;
|
||||
int size;
|
||||
};
|
||||
|
||||
static int dump_to_strbuffer(const char *buffer, int size, void *data)
|
||||
{
|
||||
return strbuffer_append_bytes((strbuffer_t *)data, buffer, size);
|
||||
}
|
||||
|
||||
static int dump_to_file(const char *buffer, int size, void *data)
|
||||
{
|
||||
FILE *dest = (FILE *)data;
|
||||
if(fwrite(buffer, size, 1, dest) != 1)
|
||||
return -1;
|
||||
return 0;
|
||||
}
|
||||
|
||||
/* 256 spaces (the maximum indentation size) */
|
||||
static char whitespace[] = " ";
|
||||
|
||||
static int dump_indent(unsigned long flags, int depth, int space, dump_func dump, void *data)
|
||||
{
|
||||
if(JSON_INDENT(flags) > 0)
|
||||
{
|
||||
int i, ws_count = JSON_INDENT(flags);
|
||||
|
||||
if(dump("\n", 1, data))
|
||||
return -1;
|
||||
|
||||
for(i = 0; i < depth; i++)
|
||||
{
|
||||
if(dump(whitespace, ws_count, data))
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
else if(space && !(flags & JSON_COMPACT))
|
||||
{
|
||||
return dump(" ", 1, data);
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int dump_string(const char *str, int ascii, dump_func dump, void *data)
|
||||
{
|
||||
const char *pos, *end;
|
||||
int32_t codepoint;
|
||||
|
||||
if(dump("\"", 1, data))
|
||||
return -1;
|
||||
|
||||
end = pos = str;
|
||||
while(1)
|
||||
{
|
||||
const char *text;
|
||||
char seq[13];
|
||||
int length;
|
||||
|
||||
while(*end)
|
||||
{
|
||||
end = utf8_iterate(pos, &codepoint);
|
||||
if(!end)
|
||||
return -1;
|
||||
|
||||
/* mandatory escape or control char */
|
||||
if(codepoint == '\\' || codepoint == '"' || codepoint < 0x20)
|
||||
break;
|
||||
|
||||
/* non-ASCII */
|
||||
if(ascii && codepoint > 0x7F)
|
||||
break;
|
||||
|
||||
pos = end;
|
||||
}
|
||||
|
||||
if(pos != str) {
|
||||
if(dump(str, pos - str, data))
|
||||
return -1;
|
||||
}
|
||||
|
||||
if(end == pos)
|
||||
break;
|
||||
|
||||
/* handle \, ", and control codes */
|
||||
length = 2;
|
||||
switch(codepoint)
|
||||
{
|
||||
case '\\': text = "\\\\"; break;
|
||||
case '\"': text = "\\\""; break;
|
||||
case '\b': text = "\\b"; break;
|
||||
case '\f': text = "\\f"; break;
|
||||
case '\n': text = "\\n"; break;
|
||||
case '\r': text = "\\r"; break;
|
||||
case '\t': text = "\\t"; break;
|
||||
default:
|
||||
{
|
||||
/* codepoint is in BMP */
|
||||
if(codepoint < 0x10000)
|
||||
{
|
||||
sprintf(seq, "\\u%04x", codepoint);
|
||||
length = 6;
|
||||
}
|
||||
|
||||
/* not in BMP -> construct a UTF-16 surrogate pair */
|
||||
else
|
||||
{
|
||||
int32_t first, last;
|
||||
|
||||
codepoint -= 0x10000;
|
||||
first = 0xD800 | ((codepoint & 0xffc00) >> 10);
|
||||
last = 0xDC00 | (codepoint & 0x003ff);
|
||||
|
||||
sprintf(seq, "\\u%04x\\u%04x", first, last);
|
||||
length = 12;
|
||||
}
|
||||
|
||||
text = seq;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if(dump(text, length, data))
|
||||
return -1;
|
||||
|
||||
str = pos = end;
|
||||
}
|
||||
|
||||
return dump("\"", 1, data);
|
||||
}
|
||||
|
||||
static int object_key_compare_keys(const void *key1, const void *key2)
|
||||
{
|
||||
return strcmp((*(const object_key_t **)key1)->key,
|
||||
(*(const object_key_t **)key2)->key);
|
||||
}
|
||||
|
||||
static int object_key_compare_serials(const void *key1, const void *key2)
|
||||
{
|
||||
return (*(const object_key_t **)key1)->serial -
|
||||
(*(const object_key_t **)key2)->serial;
|
||||
}
|
||||
|
||||
static int do_dump(const json_t *json, unsigned long flags, int depth,
|
||||
dump_func dump, void *data)
|
||||
{
|
||||
int ascii = flags & JSON_ENSURE_ASCII ? 1 : 0;
|
||||
|
||||
switch(json_typeof(json)) {
|
||||
case JSON_NULL:
|
||||
return dump("null", 4, data);
|
||||
|
||||
case JSON_TRUE:
|
||||
return dump("true", 4, data);
|
||||
|
||||
case JSON_FALSE:
|
||||
return dump("false", 5, data);
|
||||
|
||||
case JSON_INTEGER:
|
||||
{
|
||||
char buffer[MAX_INTEGER_STR_LENGTH];
|
||||
int size;
|
||||
|
||||
size = snprintf(buffer, MAX_INTEGER_STR_LENGTH, "%d", json_integer_value(json));
|
||||
if(size >= MAX_INTEGER_STR_LENGTH)
|
||||
return -1;
|
||||
|
||||
return dump(buffer, size, data);
|
||||
}
|
||||
|
||||
case JSON_REAL:
|
||||
{
|
||||
char buffer[MAX_REAL_STR_LENGTH];
|
||||
int size;
|
||||
|
||||
size = snprintf(buffer, MAX_REAL_STR_LENGTH, "%.17g",
|
||||
json_real_value(json));
|
||||
if(size >= MAX_REAL_STR_LENGTH)
|
||||
return -1;
|
||||
|
||||
/* Make sure there's a dot or 'e' in the output. Otherwise
|
||||
a real is converted to an integer when decoding */
|
||||
if(strchr(buffer, '.') == NULL &&
|
||||
strchr(buffer, 'e') == NULL)
|
||||
{
|
||||
if(size + 2 >= MAX_REAL_STR_LENGTH) {
|
||||
/* No space to append ".0" */
|
||||
return -1;
|
||||
}
|
||||
buffer[size] = '.';
|
||||
buffer[size + 1] = '0';
|
||||
size += 2;
|
||||
}
|
||||
|
||||
return dump(buffer, size, data);
|
||||
}
|
||||
|
||||
case JSON_STRING:
|
||||
return dump_string(json_string_value(json), ascii, dump, data);
|
||||
|
||||
case JSON_ARRAY:
|
||||
{
|
||||
int i;
|
||||
int n;
|
||||
json_array_t *array;
|
||||
|
||||
/* detect circular references */
|
||||
array = json_to_array(json);
|
||||
if(array->visited)
|
||||
goto array_error;
|
||||
array->visited = 1;
|
||||
|
||||
n = json_array_size(json);
|
||||
|
||||
if(dump("[", 1, data))
|
||||
goto array_error;
|
||||
if(n == 0) {
|
||||
array->visited = 0;
|
||||
return dump("]", 1, data);
|
||||
}
|
||||
if(dump_indent(flags, depth + 1, 0, dump, data))
|
||||
goto array_error;
|
||||
|
||||
for(i = 0; i < n; ++i) {
|
||||
if(do_dump(json_array_get(json, i), flags, depth + 1,
|
||||
dump, data))
|
||||
goto array_error;
|
||||
|
||||
if(i < n - 1)
|
||||
{
|
||||
if(dump(",", 1, data) ||
|
||||
dump_indent(flags, depth + 1, 1, dump, data))
|
||||
goto array_error;
|
||||
}
|
||||
else
|
||||
{
|
||||
if(dump_indent(flags, depth, 0, dump, data))
|
||||
goto array_error;
|
||||
}
|
||||
}
|
||||
|
||||
array->visited = 0;
|
||||
return dump("]", 1, data);
|
||||
|
||||
array_error:
|
||||
array->visited = 0;
|
||||
return -1;
|
||||
}
|
||||
|
||||
case JSON_OBJECT:
|
||||
{
|
||||
json_object_t *object;
|
||||
void *iter;
|
||||
const char *separator;
|
||||
int separator_length;
|
||||
|
||||
if(flags & JSON_COMPACT) {
|
||||
separator = ":";
|
||||
separator_length = 1;
|
||||
}
|
||||
else {
|
||||
separator = ": ";
|
||||
separator_length = 2;
|
||||
}
|
||||
|
||||
/* detect circular references */
|
||||
object = json_to_object(json);
|
||||
if(object->visited)
|
||||
goto object_error;
|
||||
object->visited = 1;
|
||||
|
||||
iter = json_object_iter((json_t *)json);
|
||||
|
||||
if(dump("{", 1, data))
|
||||
goto object_error;
|
||||
if(!iter) {
|
||||
object->visited = 0;
|
||||
return dump("}", 1, data);
|
||||
}
|
||||
if(dump_indent(flags, depth + 1, 0, dump, data))
|
||||
goto object_error;
|
||||
|
||||
if(flags & JSON_SORT_KEYS || flags & JSON_PRESERVE_ORDER)
|
||||
{
|
||||
const object_key_t **keys;
|
||||
unsigned int size;
|
||||
unsigned int i;
|
||||
int (*cmp_func)(const void *, const void *);
|
||||
|
||||
size = json_object_size(json);
|
||||
keys = malloc(size * sizeof(object_key_t *));
|
||||
if(!keys)
|
||||
goto object_error;
|
||||
|
||||
i = 0;
|
||||
while(iter)
|
||||
{
|
||||
keys[i] = jsonp_object_iter_fullkey(iter);
|
||||
iter = json_object_iter_next((json_t *)json, iter);
|
||||
i++;
|
||||
}
|
||||
assert(i == size);
|
||||
|
||||
if(flags & JSON_SORT_KEYS)
|
||||
cmp_func = object_key_compare_keys;
|
||||
else
|
||||
cmp_func = object_key_compare_serials;
|
||||
|
||||
qsort((void*)keys, size, sizeof(object_key_t *), cmp_func);
|
||||
|
||||
for(i = 0; i < size; i++)
|
||||
{
|
||||
const char *key;
|
||||
json_t *value;
|
||||
|
||||
key = keys[i]->key;
|
||||
value = json_object_get(json, key);
|
||||
assert(value);
|
||||
|
||||
dump_string(key, ascii, dump, data);
|
||||
if(dump(separator, separator_length, data) ||
|
||||
do_dump(value, flags, depth + 1, dump, data))
|
||||
{
|
||||
free((void*)keys);
|
||||
goto object_error;
|
||||
}
|
||||
|
||||
if(i < size - 1)
|
||||
{
|
||||
if(dump(",", 1, data) ||
|
||||
dump_indent(flags, depth + 1, 1, dump, data))
|
||||
{
|
||||
free((void*)keys);
|
||||
goto object_error;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if(dump_indent(flags, depth, 0, dump, data))
|
||||
{
|
||||
free((void*)keys);
|
||||
goto object_error;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
free((void*)keys);
|
||||
}
|
||||
else
|
||||
{
|
||||
/* Don't sort keys */
|
||||
|
||||
while(iter)
|
||||
{
|
||||
void *next = json_object_iter_next((json_t *)json, iter);
|
||||
|
||||
dump_string(json_object_iter_key(iter), ascii, dump, data);
|
||||
if(dump(separator, separator_length, data) ||
|
||||
do_dump(json_object_iter_value(iter), flags, depth + 1,
|
||||
dump, data))
|
||||
goto object_error;
|
||||
|
||||
if(next)
|
||||
{
|
||||
if(dump(",", 1, data) ||
|
||||
dump_indent(flags, depth + 1, 1, dump, data))
|
||||
goto object_error;
|
||||
}
|
||||
else
|
||||
{
|
||||
if(dump_indent(flags, depth, 0, dump, data))
|
||||
goto object_error;
|
||||
}
|
||||
|
||||
iter = next;
|
||||
}
|
||||
}
|
||||
|
||||
object->visited = 0;
|
||||
return dump("}", 1, data);
|
||||
|
||||
object_error:
|
||||
object->visited = 0;
|
||||
return -1;
|
||||
}
|
||||
|
||||
default:
|
||||
/* not reached */
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
char *json_dumps(const json_t *json, unsigned long flags)
|
||||
{
|
||||
strbuffer_t strbuff;
|
||||
char *result;
|
||||
|
||||
if(!json_is_array(json) && !json_is_object(json))
|
||||
return NULL;
|
||||
|
||||
if(strbuffer_init(&strbuff))
|
||||
return NULL;
|
||||
|
||||
if(do_dump(json, flags, 0, dump_to_strbuffer, (void *)&strbuff)) {
|
||||
strbuffer_close(&strbuff);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
result = strdup(strbuffer_value(&strbuff));
|
||||
strbuffer_close(&strbuff);
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
int json_dumpf(const json_t *json, FILE *output, unsigned long flags)
|
||||
{
|
||||
if(!json_is_array(json) && !json_is_object(json))
|
||||
return -1;
|
||||
|
||||
return do_dump(json, flags, 0, dump_to_file, (void *)output);
|
||||
}
|
||||
|
||||
int json_dump_file(const json_t *json, const char *path, unsigned long flags)
|
||||
{
|
||||
int result;
|
||||
|
||||
FILE *output = fopen(path, "w");
|
||||
if(!output)
|
||||
return -1;
|
||||
|
||||
result = json_dumpf(json, output, flags);
|
||||
|
||||
fclose(output);
|
||||
return result;
|
||||
}
|
||||
@@ -0,0 +1,379 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* This library is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#include <config.h>
|
||||
|
||||
#include <stdlib.h>
|
||||
#include "hashtable.h"
|
||||
|
||||
#ifdef WIN32
|
||||
#define inline __inline
|
||||
#endif
|
||||
|
||||
typedef struct hashtable_list list_t;
|
||||
typedef struct hashtable_pair pair_t;
|
||||
typedef struct hashtable_bucket bucket_t;
|
||||
|
||||
#define container_of(ptr_, type_, member_) \
|
||||
((type_ *)((char *)ptr_ - (size_t)&((type_ *)0)->member_))
|
||||
|
||||
#define list_to_pair(list_) container_of(list_, pair_t, list)
|
||||
|
||||
static inline void list_init(list_t *list)
|
||||
{
|
||||
list->next = list;
|
||||
list->prev = list;
|
||||
}
|
||||
|
||||
static inline void list_insert(list_t *list, list_t *node)
|
||||
{
|
||||
node->next = list;
|
||||
node->prev = list->prev;
|
||||
list->prev->next = node;
|
||||
list->prev = node;
|
||||
}
|
||||
|
||||
static inline void list_remove(list_t *list)
|
||||
{
|
||||
list->prev->next = list->next;
|
||||
list->next->prev = list->prev;
|
||||
}
|
||||
|
||||
static inline int bucket_is_empty(hashtable_t *hashtable, bucket_t *bucket)
|
||||
{
|
||||
return bucket->first == &hashtable->list && bucket->first == bucket->last;
|
||||
}
|
||||
|
||||
static void insert_to_bucket(hashtable_t *hashtable, bucket_t *bucket,
|
||||
list_t *list)
|
||||
{
|
||||
if(bucket_is_empty(hashtable, bucket))
|
||||
{
|
||||
list_insert(&hashtable->list, list);
|
||||
bucket->first = bucket->last = list;
|
||||
}
|
||||
else
|
||||
{
|
||||
list_insert(bucket->first, list);
|
||||
bucket->first = list;
|
||||
}
|
||||
}
|
||||
|
||||
static unsigned int primes[] = {
|
||||
5, 13, 23, 53, 97, 193, 389, 769, 1543, 3079, 6151, 12289, 24593,
|
||||
49157, 98317, 196613, 393241, 786433, 1572869, 3145739, 6291469,
|
||||
12582917, 25165843, 50331653, 100663319, 201326611, 402653189,
|
||||
805306457, 1610612741
|
||||
};
|
||||
static const unsigned int num_primes = sizeof(primes) / sizeof(unsigned int);
|
||||
|
||||
static inline unsigned int num_buckets(hashtable_t *hashtable)
|
||||
{
|
||||
return primes[hashtable->num_buckets];
|
||||
}
|
||||
|
||||
|
||||
static pair_t *hashtable_find_pair(hashtable_t *hashtable, bucket_t *bucket,
|
||||
const void *key, unsigned int hash)
|
||||
{
|
||||
list_t *list;
|
||||
pair_t *pair;
|
||||
|
||||
if(bucket_is_empty(hashtable, bucket))
|
||||
return NULL;
|
||||
|
||||
list = bucket->first;
|
||||
while(1)
|
||||
{
|
||||
pair = list_to_pair(list);
|
||||
if(pair->hash == hash && hashtable->cmp_keys(pair->key, key))
|
||||
return pair;
|
||||
|
||||
if(list == bucket->last)
|
||||
break;
|
||||
|
||||
list = list->next;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/* returns 0 on success, -1 if key was not found */
|
||||
static int hashtable_do_del(hashtable_t *hashtable,
|
||||
const void *key, unsigned int hash)
|
||||
{
|
||||
pair_t *pair;
|
||||
bucket_t *bucket;
|
||||
unsigned int index;
|
||||
|
||||
index = hash % num_buckets(hashtable);
|
||||
bucket = &hashtable->buckets[index];
|
||||
|
||||
pair = hashtable_find_pair(hashtable, bucket, key, hash);
|
||||
if(!pair)
|
||||
return -1;
|
||||
|
||||
if(&pair->list == bucket->first && &pair->list == bucket->last)
|
||||
bucket->first = bucket->last = &hashtable->list;
|
||||
|
||||
else if(&pair->list == bucket->first)
|
||||
bucket->first = pair->list.next;
|
||||
|
||||
else if(&pair->list == bucket->last)
|
||||
bucket->last = pair->list.prev;
|
||||
|
||||
list_remove(&pair->list);
|
||||
|
||||
if(hashtable->free_key)
|
||||
hashtable->free_key(pair->key);
|
||||
if(hashtable->free_value)
|
||||
hashtable->free_value(pair->value);
|
||||
|
||||
free(pair);
|
||||
hashtable->size--;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void hashtable_do_clear(hashtable_t *hashtable)
|
||||
{
|
||||
list_t *list, *next;
|
||||
pair_t *pair;
|
||||
|
||||
for(list = hashtable->list.next; list != &hashtable->list; list = next)
|
||||
{
|
||||
next = list->next;
|
||||
pair = list_to_pair(list);
|
||||
if(hashtable->free_key)
|
||||
hashtable->free_key(pair->key);
|
||||
if(hashtable->free_value)
|
||||
hashtable->free_value(pair->value);
|
||||
free(pair);
|
||||
}
|
||||
}
|
||||
|
||||
static int hashtable_do_rehash(hashtable_t *hashtable)
|
||||
{
|
||||
list_t *list, *next;
|
||||
pair_t *pair;
|
||||
unsigned int i, index, new_size;
|
||||
|
||||
free(hashtable->buckets);
|
||||
|
||||
hashtable->num_buckets++;
|
||||
new_size = num_buckets(hashtable);
|
||||
|
||||
hashtable->buckets = malloc(new_size * sizeof(bucket_t));
|
||||
if(!hashtable->buckets)
|
||||
return -1;
|
||||
|
||||
for(i = 0; i < num_buckets(hashtable); i++)
|
||||
{
|
||||
hashtable->buckets[i].first = hashtable->buckets[i].last =
|
||||
&hashtable->list;
|
||||
}
|
||||
|
||||
list = hashtable->list.next;
|
||||
list_init(&hashtable->list);
|
||||
|
||||
for(; list != &hashtable->list; list = next) {
|
||||
next = list->next;
|
||||
pair = list_to_pair(list);
|
||||
index = pair->hash % new_size;
|
||||
insert_to_bucket(hashtable, &hashtable->buckets[index], &pair->list);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
hashtable_t *hashtable_create(key_hash_fn hash_key, key_cmp_fn cmp_keys,
|
||||
free_fn free_key, free_fn free_value)
|
||||
{
|
||||
hashtable_t *hashtable = malloc(sizeof(hashtable_t));
|
||||
if(!hashtable)
|
||||
return NULL;
|
||||
|
||||
if(hashtable_init(hashtable, hash_key, cmp_keys, free_key, free_value))
|
||||
{
|
||||
free(hashtable);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return hashtable;
|
||||
}
|
||||
|
||||
void hashtable_destroy(hashtable_t *hashtable)
|
||||
{
|
||||
hashtable_close(hashtable);
|
||||
free(hashtable);
|
||||
}
|
||||
|
||||
int hashtable_init(hashtable_t *hashtable,
|
||||
key_hash_fn hash_key, key_cmp_fn cmp_keys,
|
||||
free_fn free_key, free_fn free_value)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
hashtable->size = 0;
|
||||
hashtable->num_buckets = 0; /* index to primes[] */
|
||||
hashtable->buckets = malloc(num_buckets(hashtable) * sizeof(bucket_t));
|
||||
if(!hashtable->buckets)
|
||||
return -1;
|
||||
|
||||
list_init(&hashtable->list);
|
||||
|
||||
hashtable->hash_key = hash_key;
|
||||
hashtable->cmp_keys = cmp_keys;
|
||||
hashtable->free_key = free_key;
|
||||
hashtable->free_value = free_value;
|
||||
|
||||
for(i = 0; i < num_buckets(hashtable); i++)
|
||||
{
|
||||
hashtable->buckets[i].first = hashtable->buckets[i].last =
|
||||
&hashtable->list;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void hashtable_close(hashtable_t *hashtable)
|
||||
{
|
||||
hashtable_do_clear(hashtable);
|
||||
free(hashtable->buckets);
|
||||
}
|
||||
|
||||
int hashtable_set(hashtable_t *hashtable, void *key, void *value)
|
||||
{
|
||||
pair_t *pair;
|
||||
bucket_t *bucket;
|
||||
unsigned int hash, index;
|
||||
|
||||
/* rehash if the load ratio exceeds 1 */
|
||||
if(hashtable->size >= num_buckets(hashtable))
|
||||
if(hashtable_do_rehash(hashtable))
|
||||
return -1;
|
||||
|
||||
hash = hashtable->hash_key(key);
|
||||
index = hash % num_buckets(hashtable);
|
||||
bucket = &hashtable->buckets[index];
|
||||
pair = hashtable_find_pair(hashtable, bucket, key, hash);
|
||||
|
||||
if(pair)
|
||||
{
|
||||
if(hashtable->free_key)
|
||||
hashtable->free_key(key);
|
||||
if(hashtable->free_value)
|
||||
hashtable->free_value(pair->value);
|
||||
pair->value = value;
|
||||
}
|
||||
else
|
||||
{
|
||||
pair = malloc(sizeof(pair_t));
|
||||
if(!pair)
|
||||
return -1;
|
||||
|
||||
pair->key = key;
|
||||
pair->value = value;
|
||||
pair->hash = hash;
|
||||
list_init(&pair->list);
|
||||
|
||||
insert_to_bucket(hashtable, bucket, &pair->list);
|
||||
|
||||
hashtable->size++;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
void *hashtable_get(hashtable_t *hashtable, const void *key)
|
||||
{
|
||||
pair_t *pair;
|
||||
unsigned int hash;
|
||||
bucket_t *bucket;
|
||||
|
||||
hash = hashtable->hash_key(key);
|
||||
bucket = &hashtable->buckets[hash % num_buckets(hashtable)];
|
||||
|
||||
pair = hashtable_find_pair(hashtable, bucket, key, hash);
|
||||
if(!pair)
|
||||
return NULL;
|
||||
|
||||
return pair->value;
|
||||
}
|
||||
|
||||
int hashtable_del(hashtable_t *hashtable, const void *key)
|
||||
{
|
||||
unsigned int hash = hashtable->hash_key(key);
|
||||
return hashtable_do_del(hashtable, key, hash);
|
||||
}
|
||||
|
||||
void hashtable_clear(hashtable_t *hashtable)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
hashtable_do_clear(hashtable);
|
||||
|
||||
for(i = 0; i < num_buckets(hashtable); i++)
|
||||
{
|
||||
hashtable->buckets[i].first = hashtable->buckets[i].last =
|
||||
&hashtable->list;
|
||||
}
|
||||
|
||||
list_init(&hashtable->list);
|
||||
hashtable->size = 0;
|
||||
}
|
||||
|
||||
void *hashtable_iter(hashtable_t *hashtable)
|
||||
{
|
||||
return hashtable_iter_next(hashtable, &hashtable->list);
|
||||
}
|
||||
|
||||
void *hashtable_iter_at(hashtable_t *hashtable, const void *key)
|
||||
{
|
||||
pair_t *pair;
|
||||
unsigned int hash;
|
||||
bucket_t *bucket;
|
||||
|
||||
hash = hashtable->hash_key(key);
|
||||
bucket = &hashtable->buckets[hash % num_buckets(hashtable)];
|
||||
|
||||
pair = hashtable_find_pair(hashtable, bucket, key, hash);
|
||||
if(!pair)
|
||||
return NULL;
|
||||
|
||||
return &pair->list;
|
||||
}
|
||||
|
||||
void *hashtable_iter_next(hashtable_t *hashtable, void *iter)
|
||||
{
|
||||
list_t *list = (list_t *)iter;
|
||||
if(list->next == &hashtable->list)
|
||||
return NULL;
|
||||
return list->next;
|
||||
}
|
||||
|
||||
void *hashtable_iter_key(void *iter)
|
||||
{
|
||||
pair_t *pair = list_to_pair((list_t *)iter);
|
||||
return pair->key;
|
||||
}
|
||||
|
||||
void *hashtable_iter_value(void *iter)
|
||||
{
|
||||
pair_t *pair = list_to_pair((list_t *)iter);
|
||||
return pair->value;
|
||||
}
|
||||
|
||||
void hashtable_iter_set(hashtable_t *hashtable, void *iter, void *value)
|
||||
{
|
||||
pair_t *pair = list_to_pair((list_t *)iter);
|
||||
|
||||
if(hashtable->free_value)
|
||||
hashtable->free_value(pair->value);
|
||||
|
||||
pair->value = value;
|
||||
}
|
||||
@@ -0,0 +1,207 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* This library is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef HASHTABLE_H
|
||||
#define HASHTABLE_H
|
||||
|
||||
typedef unsigned int (*key_hash_fn)(const void *key);
|
||||
typedef int (*key_cmp_fn)(const void *key1, const void *key2);
|
||||
typedef void (*free_fn)(void *key);
|
||||
|
||||
struct hashtable_list {
|
||||
struct hashtable_list *prev;
|
||||
struct hashtable_list *next;
|
||||
};
|
||||
|
||||
struct hashtable_pair {
|
||||
void *key;
|
||||
void *value;
|
||||
unsigned int hash;
|
||||
struct hashtable_list list;
|
||||
};
|
||||
|
||||
struct hashtable_bucket {
|
||||
struct hashtable_list *first;
|
||||
struct hashtable_list *last;
|
||||
};
|
||||
|
||||
typedef struct hashtable {
|
||||
unsigned int size;
|
||||
struct hashtable_bucket *buckets;
|
||||
unsigned int num_buckets; /* index to primes[] */
|
||||
struct hashtable_list list;
|
||||
|
||||
key_hash_fn hash_key;
|
||||
key_cmp_fn cmp_keys; /* returns non-zero for equal keys */
|
||||
free_fn free_key;
|
||||
free_fn free_value;
|
||||
} hashtable_t;
|
||||
|
||||
/**
|
||||
* hashtable_create - Create a hashtable object
|
||||
*
|
||||
* @hash_key: The key hashing function
|
||||
* @cmp_keys: The key compare function. Returns non-zero for equal and
|
||||
* zero for unequal unequal keys
|
||||
* @free_key: If non-NULL, called for a key that is no longer referenced.
|
||||
* @free_value: If non-NULL, called for a value that is no longer referenced.
|
||||
*
|
||||
* Returns a new hashtable object that should be freed with
|
||||
* hashtable_destroy when it's no longer used, or NULL on failure (out
|
||||
* of memory).
|
||||
*/
|
||||
hashtable_t *hashtable_create(key_hash_fn hash_key, key_cmp_fn cmp_keys,
|
||||
free_fn free_key, free_fn free_value);
|
||||
|
||||
/**
|
||||
* hashtable_destroy - Destroy a hashtable object
|
||||
*
|
||||
* @hashtable: The hashtable
|
||||
*
|
||||
* Destroys a hashtable created with hashtable_create().
|
||||
*/
|
||||
void hashtable_destroy(hashtable_t *hashtable);
|
||||
|
||||
/**
|
||||
* hashtable_init - Initialize a hashtable object
|
||||
*
|
||||
* @hashtable: The (statically allocated) hashtable object
|
||||
* @hash_key: The key hashing function
|
||||
* @cmp_keys: The key compare function. Returns non-zero for equal and
|
||||
* zero for unequal unequal keys
|
||||
* @free_key: If non-NULL, called for a key that is no longer referenced.
|
||||
* @free_value: If non-NULL, called for a value that is no longer referenced.
|
||||
*
|
||||
* Initializes a statically allocated hashtable object. The object
|
||||
* should be cleared with hashtable_close when it's no longer used.
|
||||
*
|
||||
* Returns 0 on success, -1 on error (out of memory).
|
||||
*/
|
||||
int hashtable_init(hashtable_t *hashtable,
|
||||
key_hash_fn hash_key, key_cmp_fn cmp_keys,
|
||||
free_fn free_key, free_fn free_value);
|
||||
|
||||
/**
|
||||
* hashtable_close - Release all resources used by a hashtable object
|
||||
*
|
||||
* @hashtable: The hashtable
|
||||
*
|
||||
* Destroys a statically allocated hashtable object.
|
||||
*/
|
||||
void hashtable_close(hashtable_t *hashtable);
|
||||
|
||||
/**
|
||||
* hashtable_set - Add/modify value in hashtable
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
* @key: The key
|
||||
* @value: The value
|
||||
*
|
||||
* If a value with the given key already exists, its value is replaced
|
||||
* with the new value.
|
||||
*
|
||||
* Key and value are "stealed" in the sense that hashtable frees them
|
||||
* automatically when they are no longer used. The freeing is
|
||||
* accomplished by calling free_key and free_value functions that were
|
||||
* supplied to hashtable_new. In case one or both of the free
|
||||
* functions is NULL, the corresponding item is not "stealed".
|
||||
*
|
||||
* Returns 0 on success, -1 on failure (out of memory).
|
||||
*/
|
||||
int hashtable_set(hashtable_t *hashtable, void *key, void *value);
|
||||
|
||||
/**
|
||||
* hashtable_get - Get a value associated with a key
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
* @key: The key
|
||||
*
|
||||
* Returns value if it is found, or NULL otherwise.
|
||||
*/
|
||||
void *hashtable_get(hashtable_t *hashtable, const void *key);
|
||||
|
||||
/**
|
||||
* hashtable_del - Remove a value from the hashtable
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
* @key: The key
|
||||
*
|
||||
* Returns 0 on success, or -1 if the key was not found.
|
||||
*/
|
||||
int hashtable_del(hashtable_t *hashtable, const void *key);
|
||||
|
||||
/**
|
||||
* hashtable_clear - Clear hashtable
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
*
|
||||
* Removes all items from the hashtable.
|
||||
*/
|
||||
void hashtable_clear(hashtable_t *hashtable);
|
||||
|
||||
/**
|
||||
* hashtable_iter - Iterate over hashtable
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
*
|
||||
* Returns an opaque iterator to the first element in the hashtable.
|
||||
* The iterator should be passed to hashtable_iter_* functions.
|
||||
* The hashtable items are not iterated over in any particular order.
|
||||
*
|
||||
* There's no need to free the iterator in any way. The iterator is
|
||||
* valid as long as the item that is referenced by the iterator is not
|
||||
* deleted. Other values may be added or deleted. In particular,
|
||||
* hashtable_iter_next() may be called on an iterator, and after that
|
||||
* the key/value pair pointed by the old iterator may be deleted.
|
||||
*/
|
||||
void *hashtable_iter(hashtable_t *hashtable);
|
||||
|
||||
/**
|
||||
* hashtable_iter_at - Return an iterator at a specific key
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
* @key: The key that the iterator should point to
|
||||
*
|
||||
* Like hashtable_iter() but returns an iterator pointing to a
|
||||
* specific key.
|
||||
*/
|
||||
void *hashtable_iter_at(hashtable_t *hashtable, const void *key);
|
||||
|
||||
/**
|
||||
* hashtable_iter_next - Advance an iterator
|
||||
*
|
||||
* @hashtable: The hashtable object
|
||||
* @iter: The iterator
|
||||
*
|
||||
* Returns a new iterator pointing to the next element in the
|
||||
* hashtable or NULL if the whole hastable has been iterated over.
|
||||
*/
|
||||
void *hashtable_iter_next(hashtable_t *hashtable, void *iter);
|
||||
|
||||
/**
|
||||
* hashtable_iter_key - Retrieve the key pointed by an iterator
|
||||
*
|
||||
* @iter: The iterator
|
||||
*/
|
||||
void *hashtable_iter_key(void *iter);
|
||||
|
||||
/**
|
||||
* hashtable_iter_value - Retrieve the value pointed by an iterator
|
||||
*
|
||||
* @iter: The iterator
|
||||
*/
|
||||
void *hashtable_iter_value(void *iter);
|
||||
|
||||
/**
|
||||
* hashtable_iter_set - Set the value pointed by an iterator
|
||||
*
|
||||
* @iter: The iterator
|
||||
* @value: The value to set
|
||||
*/
|
||||
void hashtable_iter_set(hashtable_t *hashtable, void *iter, void *value);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,200 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef JANSSON_H
|
||||
#define JANSSON_H
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
#ifdef WIN32
|
||||
#define snprintf(...) _snprintf(__VA_ARGS__)
|
||||
#define strdup(x) _strdup(x)
|
||||
#endif
|
||||
|
||||
#ifdef WIN32
|
||||
#define inline __inline
|
||||
#endif
|
||||
|
||||
#ifndef __cplusplus
|
||||
#define JSON_INLINE inline
|
||||
#else
|
||||
#define JSON_INLINE inline
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* types */
|
||||
|
||||
typedef enum {
|
||||
JSON_OBJECT,
|
||||
JSON_ARRAY,
|
||||
JSON_STRING,
|
||||
JSON_INTEGER,
|
||||
JSON_REAL,
|
||||
JSON_TRUE,
|
||||
JSON_FALSE,
|
||||
JSON_NULL
|
||||
} json_type;
|
||||
|
||||
typedef struct {
|
||||
json_type type;
|
||||
unsigned long refcount;
|
||||
} json_t;
|
||||
|
||||
#define json_typeof(json) ((json)->type)
|
||||
#define json_is_object(json) (json && json_typeof(json) == JSON_OBJECT)
|
||||
#define json_is_array(json) (json && json_typeof(json) == JSON_ARRAY)
|
||||
#define json_is_string(json) (json && json_typeof(json) == JSON_STRING)
|
||||
#define json_is_integer(json) (json && json_typeof(json) == JSON_INTEGER)
|
||||
#define json_is_real(json) (json && json_typeof(json) == JSON_REAL)
|
||||
#define json_is_number(json) (json_is_integer(json) || json_is_real(json))
|
||||
#define json_is_true(json) (json && json_typeof(json) == JSON_TRUE)
|
||||
#define json_is_false(json) (json && json_typeof(json) == JSON_FALSE)
|
||||
#define json_is_boolean(json) (json_is_true(json) || json_is_false(json))
|
||||
#define json_is_null(json) (json && json_typeof(json) == JSON_NULL)
|
||||
|
||||
/* construction, destruction, reference counting */
|
||||
|
||||
json_t *json_object(void);
|
||||
json_t *json_array(void);
|
||||
json_t *json_string(const char *value);
|
||||
json_t *json_string_nocheck(const char *value);
|
||||
json_t *json_integer(int value);
|
||||
json_t *json_real(double value);
|
||||
json_t *json_true(void);
|
||||
json_t *json_false(void);
|
||||
json_t *json_null(void);
|
||||
|
||||
static JSON_INLINE
|
||||
json_t *json_incref(json_t *json)
|
||||
{
|
||||
if(json && json->refcount != (unsigned int)-1)
|
||||
++json->refcount;
|
||||
return json;
|
||||
}
|
||||
|
||||
/* do not call json_delete directly */
|
||||
void json_delete(json_t *json);
|
||||
|
||||
static JSON_INLINE
|
||||
void json_decref(json_t *json)
|
||||
{
|
||||
if(json && json->refcount != (unsigned int)-1 && --json->refcount == 0)
|
||||
json_delete(json);
|
||||
}
|
||||
|
||||
|
||||
/* getters, setters, manipulation */
|
||||
|
||||
unsigned int json_object_size(const json_t *object);
|
||||
json_t *json_object_get(const json_t *object, const char *key);
|
||||
int json_object_set_new(json_t *object, const char *key, json_t *value);
|
||||
int json_object_set_new_nocheck(json_t *object, const char *key, json_t *value);
|
||||
int json_object_del(json_t *object, const char *key);
|
||||
int json_object_clear(json_t *object);
|
||||
int json_object_update(json_t *object, json_t *other);
|
||||
void *json_object_iter(json_t *object);
|
||||
void *json_object_iter_at(json_t *object, const char *key);
|
||||
void *json_object_iter_next(json_t *object, void *iter);
|
||||
const char *json_object_iter_key(void *iter);
|
||||
json_t *json_object_iter_value(void *iter);
|
||||
int json_object_iter_set_new(json_t *object, void *iter, json_t *value);
|
||||
|
||||
static JSON_INLINE
|
||||
int json_object_set(json_t *object, const char *key, json_t *value)
|
||||
{
|
||||
return json_object_set_new(object, key, json_incref(value));
|
||||
}
|
||||
|
||||
static JSON_INLINE
|
||||
int json_object_set_nocheck(json_t *object, const char *key, json_t *value)
|
||||
{
|
||||
return json_object_set_new_nocheck(object, key, json_incref(value));
|
||||
}
|
||||
|
||||
static inline
|
||||
int json_object_iter_set(json_t *object, void *iter, json_t *value)
|
||||
{
|
||||
return json_object_iter_set_new(object, iter, json_incref(value));
|
||||
}
|
||||
|
||||
unsigned int json_array_size(const json_t *array);
|
||||
json_t *json_array_get(const json_t *array, unsigned int index);
|
||||
int json_array_set_new(json_t *array, unsigned int index, json_t *value);
|
||||
int json_array_append_new(json_t *array, json_t *value);
|
||||
int json_array_insert_new(json_t *array, unsigned int index, json_t *value);
|
||||
int json_array_remove(json_t *array, unsigned int index);
|
||||
int json_array_clear(json_t *array);
|
||||
int json_array_extend(json_t *array, json_t *other);
|
||||
|
||||
static JSON_INLINE
|
||||
int json_array_set(json_t *array, unsigned int index, json_t *value)
|
||||
{
|
||||
return json_array_set_new(array, index, json_incref(value));
|
||||
}
|
||||
|
||||
static JSON_INLINE
|
||||
int json_array_append(json_t *array, json_t *value)
|
||||
{
|
||||
return json_array_append_new(array, json_incref(value));
|
||||
}
|
||||
|
||||
static JSON_INLINE
|
||||
int json_array_insert(json_t *array, unsigned int index, json_t *value)
|
||||
{
|
||||
return json_array_insert_new(array, index, json_incref(value));
|
||||
}
|
||||
|
||||
const char *json_string_value(const json_t *string);
|
||||
int json_integer_value(const json_t *integer);
|
||||
double json_real_value(const json_t *real);
|
||||
double json_number_value(const json_t *json);
|
||||
|
||||
int json_string_set(json_t *string, const char *value);
|
||||
int json_string_set_nocheck(json_t *string, const char *value);
|
||||
int json_integer_set(json_t *integer, int value);
|
||||
int json_real_set(json_t *real, double value);
|
||||
|
||||
|
||||
/* equality */
|
||||
|
||||
int json_equal(json_t *value1, json_t *value2);
|
||||
|
||||
|
||||
/* copying */
|
||||
|
||||
json_t *json_copy(json_t *value);
|
||||
json_t *json_deep_copy(json_t *value);
|
||||
|
||||
|
||||
/* loading, printing */
|
||||
|
||||
#define JSON_ERROR_TEXT_LENGTH 160
|
||||
|
||||
typedef struct {
|
||||
char text[JSON_ERROR_TEXT_LENGTH];
|
||||
int line;
|
||||
} json_error_t;
|
||||
|
||||
json_t *json_loads(const char *input, json_error_t *error);
|
||||
json_t *json_loadf(FILE *input, json_error_t *error);
|
||||
json_t *json_load_file(const char *path, json_error_t *error);
|
||||
|
||||
#define JSON_INDENT(n) (n & 0xFF)
|
||||
#define JSON_COMPACT 0x100
|
||||
#define JSON_ENSURE_ASCII 0x200
|
||||
#define JSON_SORT_KEYS 0x400
|
||||
#define JSON_PRESERVE_ORDER 0x800
|
||||
|
||||
char *json_dumps(const json_t *json, unsigned long flags);
|
||||
int json_dumpf(const json_t *json, FILE *output, unsigned long flags);
|
||||
int json_dump_file(const json_t *json, const char *path, unsigned long flags);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,60 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef JANSSON_PRIVATE_H
|
||||
#define JANSSON_PRIVATE_H
|
||||
|
||||
#include "jansson.h"
|
||||
#include "hashtable.h"
|
||||
|
||||
#define container_of(ptr_, type_, member_) \
|
||||
((type_ *)((char *)ptr_ - (size_t)&((type_ *)0)->member_))
|
||||
|
||||
typedef struct {
|
||||
json_t json;
|
||||
hashtable_t hashtable;
|
||||
unsigned long serial;
|
||||
int visited;
|
||||
} json_object_t;
|
||||
|
||||
typedef struct {
|
||||
json_t json;
|
||||
unsigned int size;
|
||||
unsigned int entries;
|
||||
json_t **table;
|
||||
int visited;
|
||||
} json_array_t;
|
||||
|
||||
typedef struct {
|
||||
json_t json;
|
||||
char *value;
|
||||
} json_string_t;
|
||||
|
||||
typedef struct {
|
||||
json_t json;
|
||||
double value;
|
||||
} json_real_t;
|
||||
|
||||
typedef struct {
|
||||
json_t json;
|
||||
int value;
|
||||
} json_integer_t;
|
||||
|
||||
#define json_to_object(json_) container_of(json_, json_object_t, json)
|
||||
#define json_to_array(json_) container_of(json_, json_array_t, json)
|
||||
#define json_to_string(json_) container_of(json_, json_string_t, json)
|
||||
#define json_to_real(json_) container_of(json_, json_real_t, json)
|
||||
#define json_to_integer(json_) container_of(json_, json_integer_t, json)
|
||||
|
||||
typedef struct {
|
||||
unsigned long serial;
|
||||
char key[];
|
||||
} object_key_t;
|
||||
|
||||
const object_key_t *jsonp_object_iter_fullkey(void *iter);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,879 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#define _GNU_SOURCE
|
||||
#include <ctype.h>
|
||||
#include <errno.h>
|
||||
#include <limits.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdarg.h>
|
||||
#include <assert.h>
|
||||
|
||||
#include <jansson.h>
|
||||
#include "jansson_private.h"
|
||||
#include "strbuffer.h"
|
||||
#include "utf.h"
|
||||
|
||||
#define TOKEN_INVALID -1
|
||||
#define TOKEN_EOF 0
|
||||
#define TOKEN_STRING 256
|
||||
#define TOKEN_INTEGER 257
|
||||
#define TOKEN_REAL 258
|
||||
#define TOKEN_TRUE 259
|
||||
#define TOKEN_FALSE 260
|
||||
#define TOKEN_NULL 261
|
||||
|
||||
/* read one byte from stream, return EOF on end of file */
|
||||
typedef int (*get_func)(void *data);
|
||||
|
||||
/* return non-zero if end of file has been reached */
|
||||
typedef int (*eof_func)(void *data);
|
||||
|
||||
typedef struct {
|
||||
get_func get;
|
||||
eof_func eof;
|
||||
void *data;
|
||||
int stream_pos;
|
||||
char buffer[5];
|
||||
int buffer_pos;
|
||||
} stream_t;
|
||||
|
||||
|
||||
typedef struct {
|
||||
stream_t stream;
|
||||
strbuffer_t saved_text;
|
||||
int token;
|
||||
int line, column;
|
||||
union {
|
||||
char *string;
|
||||
int integer;
|
||||
double real;
|
||||
} value;
|
||||
} lex_t;
|
||||
|
||||
|
||||
/*** error reporting ***/
|
||||
|
||||
static void error_init(json_error_t *error)
|
||||
{
|
||||
if(error)
|
||||
{
|
||||
error->text[0] = '\0';
|
||||
error->line = -1;
|
||||
}
|
||||
}
|
||||
|
||||
static void error_set(json_error_t *error, const lex_t *lex,
|
||||
const char *msg, ...)
|
||||
{
|
||||
va_list ap;
|
||||
char text[JSON_ERROR_TEXT_LENGTH];
|
||||
|
||||
if(!error || error->text[0] != '\0') {
|
||||
/* error already set */
|
||||
return;
|
||||
}
|
||||
|
||||
va_start(ap, msg);
|
||||
vsnprintf(text, JSON_ERROR_TEXT_LENGTH, msg, ap);
|
||||
va_end(ap);
|
||||
|
||||
if(lex)
|
||||
{
|
||||
const char *saved_text = strbuffer_value(&lex->saved_text);
|
||||
error->line = lex->line;
|
||||
if(saved_text && saved_text[0])
|
||||
{
|
||||
if(lex->saved_text.length <= 20) {
|
||||
snprintf(error->text, JSON_ERROR_TEXT_LENGTH,
|
||||
"%s near '%s'", text, saved_text);
|
||||
}
|
||||
else
|
||||
snprintf(error->text, JSON_ERROR_TEXT_LENGTH, "%s", text);
|
||||
}
|
||||
else
|
||||
{
|
||||
snprintf(error->text, JSON_ERROR_TEXT_LENGTH,
|
||||
"%s near end of file", text);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
error->line = -1;
|
||||
snprintf(error->text, JSON_ERROR_TEXT_LENGTH, "%s", text);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/*** lexical analyzer ***/
|
||||
|
||||
static void
|
||||
stream_init(stream_t *stream, get_func get, eof_func eof, void *data)
|
||||
{
|
||||
stream->get = get;
|
||||
stream->eof = eof;
|
||||
stream->data = data;
|
||||
stream->stream_pos = 0;
|
||||
stream->buffer[0] = '\0';
|
||||
stream->buffer_pos = 0;
|
||||
}
|
||||
|
||||
static char stream_get(stream_t *stream, json_error_t *error)
|
||||
{
|
||||
char c;
|
||||
|
||||
if(!stream->buffer[stream->buffer_pos])
|
||||
{
|
||||
stream->buffer[0] = stream->get(stream->data);
|
||||
stream->buffer_pos = 0;
|
||||
|
||||
c = stream->buffer[0];
|
||||
|
||||
if((unsigned char)c >= 0x80 && c != (char)EOF)
|
||||
{
|
||||
/* multi-byte UTF-8 sequence */
|
||||
int i, count;
|
||||
|
||||
count = utf8_check_first(c);
|
||||
if(!count)
|
||||
goto out;
|
||||
|
||||
assert(count >= 2);
|
||||
|
||||
for(i = 1; i < count; i++)
|
||||
stream->buffer[i] = stream->get(stream->data);
|
||||
|
||||
if(!utf8_check_full(stream->buffer, count, NULL))
|
||||
goto out;
|
||||
|
||||
stream->stream_pos += count;
|
||||
stream->buffer[count] = '\0';
|
||||
}
|
||||
else {
|
||||
stream->buffer[1] = '\0';
|
||||
stream->stream_pos++;
|
||||
}
|
||||
}
|
||||
|
||||
return stream->buffer[stream->buffer_pos++];
|
||||
|
||||
out:
|
||||
error_set(error, NULL, "unable to decode byte 0x%x at position %d",
|
||||
(unsigned char)c, stream->stream_pos);
|
||||
|
||||
stream->buffer[0] = EOF;
|
||||
stream->buffer[1] = '\0';
|
||||
stream->buffer_pos = 1;
|
||||
|
||||
return EOF;
|
||||
}
|
||||
|
||||
static void stream_unget(stream_t *stream, char c)
|
||||
{
|
||||
assert(stream->buffer_pos > 0);
|
||||
stream->buffer_pos--;
|
||||
assert(stream->buffer[stream->buffer_pos] == c);
|
||||
}
|
||||
|
||||
|
||||
static int lex_get(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
return stream_get(&lex->stream, error);
|
||||
}
|
||||
|
||||
static int lex_eof(lex_t *lex)
|
||||
{
|
||||
return lex->stream.eof(lex->stream.data);
|
||||
}
|
||||
|
||||
static void lex_save(lex_t *lex, char c)
|
||||
{
|
||||
strbuffer_append_byte(&lex->saved_text, c);
|
||||
}
|
||||
|
||||
static int lex_get_save(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
char c = stream_get(&lex->stream, error);
|
||||
lex_save(lex, c);
|
||||
return c;
|
||||
}
|
||||
|
||||
static void lex_unget_unsave(lex_t *lex, char c)
|
||||
{
|
||||
char d;
|
||||
stream_unget(&lex->stream, c);
|
||||
d = strbuffer_pop(&lex->saved_text);
|
||||
assert(c == d);
|
||||
}
|
||||
|
||||
static void lex_save_cached(lex_t *lex)
|
||||
{
|
||||
while(lex->stream.buffer[lex->stream.buffer_pos] != '\0')
|
||||
{
|
||||
lex_save(lex, lex->stream.buffer[lex->stream.buffer_pos]);
|
||||
lex->stream.buffer_pos++;
|
||||
}
|
||||
}
|
||||
|
||||
/* assumes that str points to 'u' plus at least 4 valid hex digits */
|
||||
static int32_t decode_unicode_escape(const char *str)
|
||||
{
|
||||
int i;
|
||||
int32_t value = 0;
|
||||
|
||||
assert(str[0] == 'u');
|
||||
|
||||
for(i = 1; i <= 4; i++) {
|
||||
char c = str[i];
|
||||
value <<= 4;
|
||||
if(isdigit(c))
|
||||
value += c - '0';
|
||||
else if(islower(c))
|
||||
value += c - 'a' + 10;
|
||||
else if(isupper(c))
|
||||
value += c - 'A' + 10;
|
||||
else
|
||||
assert(0);
|
||||
}
|
||||
|
||||
return value;
|
||||
}
|
||||
|
||||
static void lex_scan_string(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
char c;
|
||||
const char *p;
|
||||
char *t;
|
||||
int i;
|
||||
|
||||
lex->value.string = NULL;
|
||||
lex->token = TOKEN_INVALID;
|
||||
|
||||
c = lex_get_save(lex, error);
|
||||
|
||||
while(c != '"') {
|
||||
if(c == (char)EOF) {
|
||||
lex_unget_unsave(lex, c);
|
||||
if(lex_eof(lex))
|
||||
error_set(error, lex, "premature end of input");
|
||||
goto out;
|
||||
}
|
||||
|
||||
else if((unsigned char)c <= 0x1F) {
|
||||
/* control character */
|
||||
lex_unget_unsave(lex, c);
|
||||
if(c == '\n')
|
||||
error_set(error, lex, "unexpected newline", c);
|
||||
else
|
||||
error_set(error, lex, "control character 0x%x", c);
|
||||
goto out;
|
||||
}
|
||||
|
||||
else if(c == '\\') {
|
||||
c = lex_get_save(lex, error);
|
||||
if(c == 'u') {
|
||||
c = lex_get_save(lex, error);
|
||||
for(i = 0; i < 4; i++) {
|
||||
if(!isxdigit(c)) {
|
||||
lex_unget_unsave(lex, c);
|
||||
error_set(error, lex, "invalid escape");
|
||||
goto out;
|
||||
}
|
||||
c = lex_get_save(lex, error);
|
||||
}
|
||||
}
|
||||
else if(c == '"' || c == '\\' || c == '/' || c == 'b' ||
|
||||
c == 'f' || c == 'n' || c == 'r' || c == 't')
|
||||
c = lex_get_save(lex, error);
|
||||
else {
|
||||
lex_unget_unsave(lex, c);
|
||||
error_set(error, lex, "invalid escape");
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
else
|
||||
c = lex_get_save(lex, error);
|
||||
}
|
||||
|
||||
/* the actual value is at most of the same length as the source
|
||||
string, because:
|
||||
- shortcut escapes (e.g. "\t") (length 2) are converted to 1 byte
|
||||
- a single \uXXXX escape (length 6) is converted to at most 3 bytes
|
||||
- two \uXXXX escapes (length 12) forming an UTF-16 surrogate pair
|
||||
are converted to 4 bytes
|
||||
*/
|
||||
lex->value.string = malloc(lex->saved_text.length + 1);
|
||||
if(!lex->value.string) {
|
||||
/* this is not very nice, since TOKEN_INVALID is returned */
|
||||
goto out;
|
||||
}
|
||||
|
||||
/* the target */
|
||||
t = lex->value.string;
|
||||
|
||||
/* + 1 to skip the " */
|
||||
p = strbuffer_value(&lex->saved_text) + 1;
|
||||
|
||||
while(*p != '"') {
|
||||
if(*p == '\\') {
|
||||
p++;
|
||||
if(*p == 'u') {
|
||||
char buffer[4];
|
||||
int length;
|
||||
int32_t value;
|
||||
|
||||
value = decode_unicode_escape(p);
|
||||
p += 5;
|
||||
|
||||
if(0xD800 <= value && value <= 0xDBFF) {
|
||||
/* surrogate pair */
|
||||
if(*p == '\\' && *(p + 1) == 'u') {
|
||||
int32_t value2 = decode_unicode_escape(++p);
|
||||
p += 5;
|
||||
|
||||
if(0xDC00 <= value2 && value2 <= 0xDFFF) {
|
||||
/* valid second surrogate */
|
||||
value =
|
||||
((value - 0xD800) << 10) +
|
||||
(value2 - 0xDC00) +
|
||||
0x10000;
|
||||
}
|
||||
else {
|
||||
/* invalid second surrogate */
|
||||
error_set(error, lex,
|
||||
"invalid Unicode '\\u%04X\\u%04X'",
|
||||
value, value2);
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
else {
|
||||
/* no second surrogate */
|
||||
error_set(error, lex, "invalid Unicode '\\u%04X'",
|
||||
value);
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
else if(0xDC00 <= value && value <= 0xDFFF) {
|
||||
error_set(error, lex, "invalid Unicode '\\u%04X'", value);
|
||||
goto out;
|
||||
}
|
||||
else if(value == 0)
|
||||
{
|
||||
error_set(error, lex, "\\u0000 is not allowed");
|
||||
goto out;
|
||||
}
|
||||
|
||||
if(utf8_encode(value, buffer, &length))
|
||||
assert(0);
|
||||
|
||||
memcpy(t, buffer, length);
|
||||
t += length;
|
||||
}
|
||||
else {
|
||||
switch(*p) {
|
||||
case '"': case '\\': case '/':
|
||||
*t = *p; break;
|
||||
case 'b': *t = '\b'; break;
|
||||
case 'f': *t = '\f'; break;
|
||||
case 'n': *t = '\n'; break;
|
||||
case 'r': *t = '\r'; break;
|
||||
case 't': *t = '\t'; break;
|
||||
default: assert(0);
|
||||
}
|
||||
t++;
|
||||
p++;
|
||||
}
|
||||
}
|
||||
else
|
||||
*(t++) = *(p++);
|
||||
}
|
||||
*t = '\0';
|
||||
lex->token = TOKEN_STRING;
|
||||
return;
|
||||
|
||||
out:
|
||||
free(lex->value.string);
|
||||
}
|
||||
|
||||
static int lex_scan_number(lex_t *lex, char c, json_error_t *error)
|
||||
{
|
||||
const char *saved_text;
|
||||
char *end;
|
||||
double value;
|
||||
|
||||
lex->token = TOKEN_INVALID;
|
||||
|
||||
if(c == '-')
|
||||
c = lex_get_save(lex, error);
|
||||
|
||||
if(c == '0') {
|
||||
c = lex_get_save(lex, error);
|
||||
if(isdigit(c)) {
|
||||
lex_unget_unsave(lex, c);
|
||||
goto out;
|
||||
}
|
||||
}
|
||||
else if(isdigit(c)) {
|
||||
c = lex_get_save(lex, error);
|
||||
while(isdigit(c))
|
||||
c = lex_get_save(lex, error);
|
||||
}
|
||||
else {
|
||||
lex_unget_unsave(lex, c);
|
||||
goto out;
|
||||
}
|
||||
|
||||
if(c != '.' && c != 'E' && c != 'e') {
|
||||
long value;
|
||||
|
||||
lex_unget_unsave(lex, c);
|
||||
|
||||
saved_text = strbuffer_value(&lex->saved_text);
|
||||
value = strtol(saved_text, &end, 10);
|
||||
assert(end == saved_text + lex->saved_text.length);
|
||||
|
||||
if((value == LONG_MAX && errno == ERANGE) || value > INT_MAX) {
|
||||
error_set(error, lex, "too big integer");
|
||||
goto out;
|
||||
}
|
||||
else if((value == LONG_MIN && errno == ERANGE) || value < INT_MIN) {
|
||||
error_set(error, lex, "too big negative integer");
|
||||
goto out;
|
||||
}
|
||||
|
||||
lex->token = TOKEN_INTEGER;
|
||||
lex->value.integer = (int)value;
|
||||
return 0;
|
||||
}
|
||||
|
||||
if(c == '.') {
|
||||
c = lex_get(lex, error);
|
||||
if(!isdigit(c))
|
||||
goto out;
|
||||
lex_save(lex, c);
|
||||
|
||||
c = lex_get_save(lex, error);
|
||||
while(isdigit(c))
|
||||
c = lex_get_save(lex, error);
|
||||
}
|
||||
|
||||
if(c == 'E' || c == 'e') {
|
||||
c = lex_get_save(lex, error);
|
||||
if(c == '+' || c == '-')
|
||||
c = lex_get_save(lex, error);
|
||||
|
||||
if(!isdigit(c)) {
|
||||
lex_unget_unsave(lex, c);
|
||||
goto out;
|
||||
}
|
||||
|
||||
c = lex_get_save(lex, error);
|
||||
while(isdigit(c))
|
||||
c = lex_get_save(lex, error);
|
||||
}
|
||||
|
||||
lex_unget_unsave(lex, c);
|
||||
|
||||
saved_text = strbuffer_value(&lex->saved_text);
|
||||
value = strtod(saved_text, &end);
|
||||
assert(end == saved_text + lex->saved_text.length);
|
||||
|
||||
if(errno == ERANGE && value != 0) {
|
||||
error_set(error, lex, "real number overflow");
|
||||
goto out;
|
||||
}
|
||||
|
||||
lex->token = TOKEN_REAL;
|
||||
lex->value.real = value;
|
||||
return 0;
|
||||
|
||||
out:
|
||||
return -1;
|
||||
}
|
||||
|
||||
static int lex_scan(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
char c;
|
||||
|
||||
strbuffer_clear(&lex->saved_text);
|
||||
|
||||
if(lex->token == TOKEN_STRING) {
|
||||
free(lex->value.string);
|
||||
lex->value.string = NULL;
|
||||
}
|
||||
|
||||
c = lex_get(lex, error);
|
||||
while(c == ' ' || c == '\t' || c == '\n' || c == '\r')
|
||||
{
|
||||
if(c == '\n')
|
||||
lex->line++;
|
||||
|
||||
c = lex_get(lex, error);
|
||||
}
|
||||
|
||||
if(c == (char)EOF) {
|
||||
if(lex_eof(lex))
|
||||
lex->token = TOKEN_EOF;
|
||||
else
|
||||
lex->token = TOKEN_INVALID;
|
||||
goto out;
|
||||
}
|
||||
|
||||
lex_save(lex, c);
|
||||
|
||||
if(c == '{' || c == '}' || c == '[' || c == ']' || c == ':' || c == ',')
|
||||
lex->token = c;
|
||||
|
||||
else if(c == '"')
|
||||
lex_scan_string(lex, error);
|
||||
|
||||
else if(isdigit(c) || c == '-') {
|
||||
if(lex_scan_number(lex, c, error))
|
||||
goto out;
|
||||
}
|
||||
|
||||
else if(isupper(c) || islower(c)) {
|
||||
/* eat up the whole identifier for clearer error messages */
|
||||
const char *saved_text;
|
||||
|
||||
c = lex_get_save(lex, error);
|
||||
while(isupper(c) || islower(c))
|
||||
c = lex_get_save(lex, error);
|
||||
lex_unget_unsave(lex, c);
|
||||
|
||||
saved_text = strbuffer_value(&lex->saved_text);
|
||||
|
||||
if(strcmp(saved_text, "true") == 0)
|
||||
lex->token = TOKEN_TRUE;
|
||||
else if(strcmp(saved_text, "false") == 0)
|
||||
lex->token = TOKEN_FALSE;
|
||||
else if(strcmp(saved_text, "null") == 0)
|
||||
lex->token = TOKEN_NULL;
|
||||
else
|
||||
lex->token = TOKEN_INVALID;
|
||||
}
|
||||
|
||||
else {
|
||||
/* save the rest of the input UTF-8 sequence to get an error
|
||||
message of valid UTF-8 */
|
||||
lex_save_cached(lex);
|
||||
lex->token = TOKEN_INVALID;
|
||||
}
|
||||
|
||||
out:
|
||||
return lex->token;
|
||||
}
|
||||
|
||||
static char *lex_steal_string(lex_t *lex)
|
||||
{
|
||||
char *result = NULL;
|
||||
if(lex->token == TOKEN_STRING)
|
||||
{
|
||||
result = lex->value.string;
|
||||
lex->value.string = NULL;
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
static int lex_init(lex_t *lex, get_func get, eof_func eof, void *data)
|
||||
{
|
||||
stream_init(&lex->stream, get, eof, data);
|
||||
if(strbuffer_init(&lex->saved_text))
|
||||
return -1;
|
||||
|
||||
lex->token = TOKEN_INVALID;
|
||||
lex->line = 1;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void lex_close(lex_t *lex)
|
||||
{
|
||||
if(lex->token == TOKEN_STRING)
|
||||
free(lex->value.string);
|
||||
strbuffer_close(&lex->saved_text);
|
||||
}
|
||||
|
||||
|
||||
/*** parser ***/
|
||||
|
||||
static json_t *parse_value(lex_t *lex, json_error_t *error);
|
||||
|
||||
static json_t *parse_object(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
json_t *object = json_object();
|
||||
if(!object)
|
||||
return NULL;
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token == '}')
|
||||
return object;
|
||||
|
||||
while(1) {
|
||||
char *key;
|
||||
json_t *value;
|
||||
|
||||
if(lex->token != TOKEN_STRING) {
|
||||
error_set(error, lex, "string or '}' expected");
|
||||
goto error;
|
||||
}
|
||||
|
||||
key = lex_steal_string(lex);
|
||||
if(!key)
|
||||
return NULL;
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token != ':') {
|
||||
free(key);
|
||||
error_set(error, lex, "':' expected");
|
||||
goto error;
|
||||
}
|
||||
|
||||
lex_scan(lex, error);
|
||||
value = parse_value(lex, error);
|
||||
if(!value) {
|
||||
free(key);
|
||||
goto error;
|
||||
}
|
||||
|
||||
if(json_object_set_nocheck(object, key, value)) {
|
||||
free(key);
|
||||
json_decref(value);
|
||||
goto error;
|
||||
}
|
||||
|
||||
json_decref(value);
|
||||
free(key);
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token != ',')
|
||||
break;
|
||||
|
||||
lex_scan(lex, error);
|
||||
}
|
||||
|
||||
if(lex->token != '}') {
|
||||
error_set(error, lex, "'}' expected");
|
||||
goto error;
|
||||
}
|
||||
|
||||
return object;
|
||||
|
||||
error:
|
||||
json_decref(object);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static json_t *parse_array(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
json_t *array = json_array();
|
||||
if(!array)
|
||||
return NULL;
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token == ']')
|
||||
return array;
|
||||
|
||||
while(lex->token) {
|
||||
json_t *elem = parse_value(lex, error);
|
||||
if(!elem)
|
||||
goto error;
|
||||
|
||||
if(json_array_append(array, elem)) {
|
||||
json_decref(elem);
|
||||
goto error;
|
||||
}
|
||||
json_decref(elem);
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token != ',')
|
||||
break;
|
||||
|
||||
lex_scan(lex, error);
|
||||
}
|
||||
|
||||
if(lex->token != ']') {
|
||||
error_set(error, lex, "']' expected");
|
||||
goto error;
|
||||
}
|
||||
|
||||
return array;
|
||||
|
||||
error:
|
||||
json_decref(array);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static json_t *parse_value(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
json_t *json;
|
||||
|
||||
switch(lex->token) {
|
||||
case TOKEN_STRING: {
|
||||
json = json_string_nocheck(lex->value.string);
|
||||
break;
|
||||
}
|
||||
|
||||
case TOKEN_INTEGER: {
|
||||
json = json_integer(lex->value.integer);
|
||||
break;
|
||||
}
|
||||
|
||||
case TOKEN_REAL: {
|
||||
json = json_real(lex->value.real);
|
||||
break;
|
||||
}
|
||||
|
||||
case TOKEN_TRUE:
|
||||
json = json_true();
|
||||
break;
|
||||
|
||||
case TOKEN_FALSE:
|
||||
json = json_false();
|
||||
break;
|
||||
|
||||
case TOKEN_NULL:
|
||||
json = json_null();
|
||||
break;
|
||||
|
||||
case '{':
|
||||
json = parse_object(lex, error);
|
||||
break;
|
||||
|
||||
case '[':
|
||||
json = parse_array(lex, error);
|
||||
break;
|
||||
|
||||
case TOKEN_INVALID:
|
||||
error_set(error, lex, "invalid token");
|
||||
return NULL;
|
||||
|
||||
default:
|
||||
error_set(error, lex, "unexpected token");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if(!json)
|
||||
return NULL;
|
||||
|
||||
return json;
|
||||
}
|
||||
|
||||
static json_t *parse_json(lex_t *lex, json_error_t *error)
|
||||
{
|
||||
error_init(error);
|
||||
|
||||
lex_scan(lex, error);
|
||||
if(lex->token != '[' && lex->token != '{') {
|
||||
error_set(error, lex, "'[' or '{' expected");
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return parse_value(lex, error);
|
||||
}
|
||||
|
||||
typedef struct
|
||||
{
|
||||
const char *data;
|
||||
int pos;
|
||||
} string_data_t;
|
||||
|
||||
static int string_get(void *data)
|
||||
{
|
||||
char c;
|
||||
string_data_t *stream = (string_data_t *)data;
|
||||
c = stream->data[stream->pos];
|
||||
if(c == '\0')
|
||||
return EOF;
|
||||
else
|
||||
{
|
||||
stream->pos++;
|
||||
return c;
|
||||
}
|
||||
}
|
||||
|
||||
static int string_eof(void *data)
|
||||
{
|
||||
string_data_t *stream = (string_data_t *)data;
|
||||
return (stream->data[stream->pos] == '\0');
|
||||
}
|
||||
|
||||
json_t *json_loads(const char *string, json_error_t *error)
|
||||
{
|
||||
lex_t lex;
|
||||
json_t *result;
|
||||
|
||||
string_data_t stream_data = {
|
||||
string,
|
||||
0
|
||||
};
|
||||
|
||||
if(lex_init(&lex, string_get, string_eof, (void *)&stream_data))
|
||||
return NULL;
|
||||
|
||||
result = parse_json(&lex, error);
|
||||
if(!result)
|
||||
goto out;
|
||||
|
||||
lex_scan(&lex, error);
|
||||
if(lex.token != TOKEN_EOF) {
|
||||
error_set(error, &lex, "end of file expected");
|
||||
json_decref(result);
|
||||
result = NULL;
|
||||
}
|
||||
|
||||
out:
|
||||
lex_close(&lex);
|
||||
return result;
|
||||
}
|
||||
|
||||
json_t *json_loadf(FILE *input, json_error_t *error)
|
||||
{
|
||||
lex_t lex;
|
||||
json_t *result;
|
||||
|
||||
if(lex_init(&lex, (get_func)fgetc, (eof_func)feof, input))
|
||||
return NULL;
|
||||
|
||||
result = parse_json(&lex, error);
|
||||
if(!result)
|
||||
goto out;
|
||||
|
||||
lex_scan(&lex, error);
|
||||
if(lex.token != TOKEN_EOF) {
|
||||
error_set(error, &lex, "end of file expected");
|
||||
json_decref(result);
|
||||
result = NULL;
|
||||
}
|
||||
|
||||
out:
|
||||
lex_close(&lex);
|
||||
return result;
|
||||
}
|
||||
|
||||
json_t *json_load_file(const char *path, json_error_t *error)
|
||||
{
|
||||
json_t *result;
|
||||
FILE *fp;
|
||||
|
||||
error_init(error);
|
||||
|
||||
fp = fopen(path, "r");
|
||||
if(!fp)
|
||||
{
|
||||
error_set(error, NULL, "unable to open %s: %s",
|
||||
path, strerror(errno));
|
||||
return NULL;
|
||||
}
|
||||
|
||||
result = json_loadf(fp, error);
|
||||
|
||||
fclose(fp);
|
||||
return result;
|
||||
}
|
||||
@@ -0,0 +1,95 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#define _GNU_SOURCE
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "strbuffer.h"
|
||||
#include "util.h"
|
||||
|
||||
#define STRBUFFER_MIN_SIZE 16
|
||||
#define STRBUFFER_FACTOR 2
|
||||
|
||||
int strbuffer_init(strbuffer_t *strbuff)
|
||||
{
|
||||
strbuff->size = STRBUFFER_MIN_SIZE;
|
||||
strbuff->length = 0;
|
||||
|
||||
strbuff->value = malloc(strbuff->size);
|
||||
if(!strbuff->value)
|
||||
return -1;
|
||||
|
||||
/* initialize to empty */
|
||||
strbuff->value[0] = '\0';
|
||||
return 0;
|
||||
}
|
||||
|
||||
void strbuffer_close(strbuffer_t *strbuff)
|
||||
{
|
||||
free(strbuff->value);
|
||||
strbuff->size = 0;
|
||||
strbuff->length = 0;
|
||||
strbuff->value = NULL;
|
||||
}
|
||||
|
||||
void strbuffer_clear(strbuffer_t *strbuff)
|
||||
{
|
||||
strbuff->length = 0;
|
||||
strbuff->value[0] = '\0';
|
||||
}
|
||||
|
||||
const char *strbuffer_value(const strbuffer_t *strbuff)
|
||||
{
|
||||
return strbuff->value;
|
||||
}
|
||||
|
||||
char *strbuffer_steal_value(strbuffer_t *strbuff)
|
||||
{
|
||||
char *result = strbuff->value;
|
||||
strbuffer_init(strbuff);
|
||||
return result;
|
||||
}
|
||||
|
||||
int strbuffer_append(strbuffer_t *strbuff, const char *string)
|
||||
{
|
||||
return strbuffer_append_bytes(strbuff, string, strlen(string));
|
||||
}
|
||||
|
||||
int strbuffer_append_byte(strbuffer_t *strbuff, char byte)
|
||||
{
|
||||
return strbuffer_append_bytes(strbuff, &byte, 1);
|
||||
}
|
||||
|
||||
int strbuffer_append_bytes(strbuffer_t *strbuff, const char *data, int size)
|
||||
{
|
||||
if(strbuff->length + size >= strbuff->size)
|
||||
{
|
||||
strbuff->size = max(strbuff->size * STRBUFFER_FACTOR,
|
||||
strbuff->length + size + 1);
|
||||
|
||||
strbuff->value = realloc(strbuff->value, strbuff->size);
|
||||
if(!strbuff->value)
|
||||
return -1;
|
||||
}
|
||||
|
||||
memcpy(strbuff->value + strbuff->length, data, size);
|
||||
strbuff->length += size;
|
||||
strbuff->value[strbuff->length] = '\0';
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
char strbuffer_pop(strbuffer_t *strbuff)
|
||||
{
|
||||
if(strbuff->length > 0) {
|
||||
char c = strbuff->value[--strbuff->length];
|
||||
strbuff->value[strbuff->length] = '\0';
|
||||
return c;
|
||||
}
|
||||
else
|
||||
return '\0';
|
||||
}
|
||||
@@ -0,0 +1,31 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef STRBUFFER_H
|
||||
#define STRBUFFER_H
|
||||
|
||||
typedef struct {
|
||||
char *value;
|
||||
int length; /* bytes used */
|
||||
int size; /* bytes allocated */
|
||||
} strbuffer_t;
|
||||
|
||||
int strbuffer_init(strbuffer_t *strbuff);
|
||||
void strbuffer_close(strbuffer_t *strbuff);
|
||||
|
||||
void strbuffer_clear(strbuffer_t *strbuff);
|
||||
|
||||
const char *strbuffer_value(const strbuffer_t *strbuff);
|
||||
char *strbuffer_steal_value(strbuffer_t *strbuff);
|
||||
|
||||
int strbuffer_append(strbuffer_t *strbuff, const char *string);
|
||||
int strbuffer_append_byte(strbuffer_t *strbuff, char byte);
|
||||
int strbuffer_append_bytes(strbuffer_t *strbuff, const char *data, int size);
|
||||
|
||||
char strbuffer_pop(strbuffer_t *strbuff);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,190 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#include <string.h>
|
||||
#include "utf.h"
|
||||
|
||||
int utf8_encode(int32_t codepoint, char *buffer, int *size)
|
||||
{
|
||||
if(codepoint < 0)
|
||||
return -1;
|
||||
else if(codepoint < 0x80)
|
||||
{
|
||||
buffer[0] = (char)codepoint;
|
||||
*size = 1;
|
||||
}
|
||||
else if(codepoint < 0x800)
|
||||
{
|
||||
buffer[0] = 0xC0 + ((codepoint & 0x7C0) >> 6);
|
||||
buffer[1] = 0x80 + ((codepoint & 0x03F));
|
||||
*size = 2;
|
||||
}
|
||||
else if(codepoint < 0x10000)
|
||||
{
|
||||
buffer[0] = 0xE0 + ((codepoint & 0xF000) >> 12);
|
||||
buffer[1] = 0x80 + ((codepoint & 0x0FC0) >> 6);
|
||||
buffer[2] = 0x80 + ((codepoint & 0x003F));
|
||||
*size = 3;
|
||||
}
|
||||
else if(codepoint <= 0x10FFFF)
|
||||
{
|
||||
buffer[0] = 0xF0 + ((codepoint & 0x1C0000) >> 18);
|
||||
buffer[1] = 0x80 + ((codepoint & 0x03F000) >> 12);
|
||||
buffer[2] = 0x80 + ((codepoint & 0x000FC0) >> 6);
|
||||
buffer[3] = 0x80 + ((codepoint & 0x00003F));
|
||||
*size = 4;
|
||||
}
|
||||
else
|
||||
return -1;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int utf8_check_first(char byte)
|
||||
{
|
||||
unsigned char u = (unsigned char)byte;
|
||||
|
||||
if(u < 0x80)
|
||||
return 1;
|
||||
|
||||
if(0x80 <= u && u <= 0xBF) {
|
||||
/* second, third or fourth byte of a multi-byte
|
||||
sequence, i.e. a "continuation byte" */
|
||||
return 0;
|
||||
}
|
||||
else if(u == 0xC0 || u == 0xC1) {
|
||||
/* overlong encoding of an ASCII byte */
|
||||
return 0;
|
||||
}
|
||||
else if(0xC2 <= u && u <= 0xDF) {
|
||||
/* 2-byte sequence */
|
||||
return 2;
|
||||
}
|
||||
|
||||
else if(0xE0 <= u && u <= 0xEF) {
|
||||
/* 3-byte sequence */
|
||||
return 3;
|
||||
}
|
||||
else if(0xF0 <= u && u <= 0xF4) {
|
||||
/* 4-byte sequence */
|
||||
return 4;
|
||||
}
|
||||
else { /* u >= 0xF5 */
|
||||
/* Restricted (start of 4-, 5- or 6-byte sequence) or invalid
|
||||
UTF-8 */
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
int utf8_check_full(const char *buffer, int size, int32_t *codepoint)
|
||||
{
|
||||
int i;
|
||||
int32_t value = 0;
|
||||
unsigned char u = (unsigned char)buffer[0];
|
||||
|
||||
if(size == 2)
|
||||
{
|
||||
value = u & 0x1F;
|
||||
}
|
||||
else if(size == 3)
|
||||
{
|
||||
value = u & 0xF;
|
||||
}
|
||||
else if(size == 4)
|
||||
{
|
||||
value = u & 0x7;
|
||||
}
|
||||
else
|
||||
return 0;
|
||||
|
||||
for(i = 1; i < size; i++)
|
||||
{
|
||||
u = (unsigned char)buffer[i];
|
||||
|
||||
if(u < 0x80 || u > 0xBF) {
|
||||
/* not a continuation byte */
|
||||
return 0;
|
||||
}
|
||||
|
||||
value = (value << 6) + (u & 0x3F);
|
||||
}
|
||||
|
||||
if(value > 0x10FFFF) {
|
||||
/* not in Unicode range */
|
||||
return 0;
|
||||
}
|
||||
|
||||
else if(0xD800 <= value && value <= 0xDFFF) {
|
||||
/* invalid code point (UTF-16 surrogate halves) */
|
||||
return 0;
|
||||
}
|
||||
|
||||
else if((size == 2 && value < 0x80) ||
|
||||
(size == 3 && value < 0x800) ||
|
||||
(size == 4 && value < 0x10000)) {
|
||||
/* overlong encoding */
|
||||
return 0;
|
||||
}
|
||||
|
||||
if(codepoint)
|
||||
*codepoint = value;
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
const char *utf8_iterate(const char *buffer, int32_t *codepoint)
|
||||
{
|
||||
int count;
|
||||
int32_t value;
|
||||
|
||||
if(!*buffer)
|
||||
return buffer;
|
||||
|
||||
count = utf8_check_first(buffer[0]);
|
||||
if(count <= 0)
|
||||
return NULL;
|
||||
|
||||
if(count == 1)
|
||||
value = (unsigned char)buffer[0];
|
||||
else
|
||||
{
|
||||
if(!utf8_check_full(buffer, count, &value))
|
||||
return NULL;
|
||||
}
|
||||
|
||||
if(codepoint)
|
||||
*codepoint = value;
|
||||
|
||||
return buffer + count;
|
||||
}
|
||||
|
||||
int utf8_check_string(const char *string, int length)
|
||||
{
|
||||
int i;
|
||||
|
||||
if(length == -1)
|
||||
length = strlen(string);
|
||||
|
||||
for(i = 0; i < length; i++)
|
||||
{
|
||||
int count = utf8_check_first(string[i]);
|
||||
if(count == 0)
|
||||
return 0;
|
||||
else if(count > 1)
|
||||
{
|
||||
if(i + count > length)
|
||||
return 0;
|
||||
|
||||
if(!utf8_check_full(&string[i], count, NULL))
|
||||
return 0;
|
||||
|
||||
i += count - 1;
|
||||
}
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
@@ -0,0 +1,28 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef UTF_H
|
||||
#define UTF_H
|
||||
|
||||
#include <config.h>
|
||||
|
||||
#ifdef HAVE_INTTYPES_H
|
||||
/* inttypes.h includes stdint.h in a standard environment, so there's
|
||||
no need to include stdint.h separately. If inttypes.h doesn't define
|
||||
int32_t, it's defined in config.h. */
|
||||
#include <inttypes.h>
|
||||
#endif
|
||||
|
||||
int utf8_encode(int codepoint, char *buffer, int *size);
|
||||
|
||||
int utf8_check_first(char byte);
|
||||
int utf8_check_full(const char *buffer, int size, int32_t *codepoint);
|
||||
const char *utf8_iterate(const char *buffer, int32_t *codepoint);
|
||||
|
||||
int utf8_check_string(const char *string, int length);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,15 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#ifndef UTIL_H
|
||||
#define UTIL_H
|
||||
|
||||
#ifndef max
|
||||
#define max(a, b) ((a) > (b) ? (a) : (b))
|
||||
#endif
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,976 @@
|
||||
/*
|
||||
* Copyright (c) 2009, 2010 Petri Lehtinen <petri@digip.org>
|
||||
*
|
||||
* Jansson is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the MIT license. See LICENSE for details.
|
||||
*/
|
||||
|
||||
#define _GNU_SOURCE
|
||||
|
||||
#include <config.h>
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <jansson.h>
|
||||
#include "hashtable.h"
|
||||
#include "jansson_private.h"
|
||||
#include "utf.h"
|
||||
#include "util.h"
|
||||
|
||||
|
||||
static inline void json_init(json_t *json, json_type type)
|
||||
{
|
||||
json->type = type;
|
||||
json->refcount = 1;
|
||||
}
|
||||
|
||||
|
||||
/*** object ***/
|
||||
|
||||
/* This macro just returns a pointer that's a few bytes backwards from
|
||||
string. This makes it possible to pass a pointer to object_key_t
|
||||
when only the string inside it is used, without actually creating
|
||||
an object_key_t instance. */
|
||||
#define string_to_key(string) container_of(string, object_key_t, key)
|
||||
|
||||
static unsigned int hash_key(const void *ptr)
|
||||
{
|
||||
const char *str = ((const object_key_t *)ptr)->key;
|
||||
|
||||
unsigned int hash = 5381;
|
||||
unsigned int c;
|
||||
|
||||
while((c = (unsigned int)*str))
|
||||
{
|
||||
hash = ((hash << 5) + hash) + c;
|
||||
str++;
|
||||
}
|
||||
|
||||
return hash;
|
||||
}
|
||||
|
||||
static int key_equal(const void *ptr1, const void *ptr2)
|
||||
{
|
||||
return strcmp(((const object_key_t *)ptr1)->key,
|
||||
((const object_key_t *)ptr2)->key) == 0;
|
||||
}
|
||||
|
||||
static void value_decref(void *value)
|
||||
{
|
||||
json_decref((json_t *)value);
|
||||
}
|
||||
|
||||
json_t *json_object(void)
|
||||
{
|
||||
json_object_t *object = malloc(sizeof(json_object_t));
|
||||
if(!object)
|
||||
return NULL;
|
||||
json_init(&object->json, JSON_OBJECT);
|
||||
|
||||
if(hashtable_init(&object->hashtable, hash_key, key_equal,
|
||||
free, value_decref))
|
||||
{
|
||||
free(object);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
object->serial = 0;
|
||||
object->visited = 0;
|
||||
|
||||
return &object->json;
|
||||
}
|
||||
|
||||
static void json_delete_object(json_object_t *object)
|
||||
{
|
||||
hashtable_close(&object->hashtable);
|
||||
free(object);
|
||||
}
|
||||
|
||||
unsigned int json_object_size(const json_t *json)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json))
|
||||
return -1;
|
||||
|
||||
object = json_to_object(json);
|
||||
return object->hashtable.size;
|
||||
}
|
||||
|
||||
json_t *json_object_get(const json_t *json, const char *key)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json))
|
||||
return NULL;
|
||||
|
||||
object = json_to_object(json);
|
||||
return hashtable_get(&object->hashtable, string_to_key(key));
|
||||
}
|
||||
|
||||
int json_object_set_new_nocheck(json_t *json, const char *key, json_t *value)
|
||||
{
|
||||
json_object_t *object;
|
||||
object_key_t *k;
|
||||
|
||||
if(!key || !value)
|
||||
return -1;
|
||||
|
||||
if(!json_is_object(json) || json == value)
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
object = json_to_object(json);
|
||||
|
||||
k = malloc(sizeof(object_key_t) + strlen(key) + 1);
|
||||
if(!k)
|
||||
return -1;
|
||||
|
||||
k->serial = object->serial++;
|
||||
strcpy(k->key, key);
|
||||
|
||||
if(hashtable_set(&object->hashtable, k, value))
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_object_set_new(json_t *json, const char *key, json_t *value)
|
||||
{
|
||||
if(!key || !utf8_check_string(key, -1))
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
return json_object_set_new_nocheck(json, key, value);
|
||||
}
|
||||
|
||||
int json_object_del(json_t *json, const char *key)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json))
|
||||
return -1;
|
||||
|
||||
object = json_to_object(json);
|
||||
return hashtable_del(&object->hashtable, string_to_key(key));
|
||||
}
|
||||
|
||||
int json_object_clear(json_t *json)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json))
|
||||
return -1;
|
||||
|
||||
object = json_to_object(json);
|
||||
hashtable_clear(&object->hashtable);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_object_update(json_t *object, json_t *other)
|
||||
{
|
||||
void *iter;
|
||||
|
||||
if(!json_is_object(object) || !json_is_object(other))
|
||||
return -1;
|
||||
|
||||
iter = json_object_iter(other);
|
||||
while(iter) {
|
||||
const char *key;
|
||||
json_t *value;
|
||||
|
||||
key = json_object_iter_key(iter);
|
||||
value = json_object_iter_value(iter);
|
||||
|
||||
if(json_object_set_nocheck(object, key, value))
|
||||
return -1;
|
||||
|
||||
iter = json_object_iter_next(other, iter);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void *json_object_iter(json_t *json)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json))
|
||||
return NULL;
|
||||
|
||||
object = json_to_object(json);
|
||||
return hashtable_iter(&object->hashtable);
|
||||
}
|
||||
|
||||
void *json_object_iter_at(json_t *json, const char *key)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!key || !json_is_object(json))
|
||||
return NULL;
|
||||
|
||||
object = json_to_object(json);
|
||||
return hashtable_iter_at(&object->hashtable, string_to_key(key));
|
||||
}
|
||||
|
||||
void *json_object_iter_next(json_t *json, void *iter)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json) || iter == NULL)
|
||||
return NULL;
|
||||
|
||||
object = json_to_object(json);
|
||||
return hashtable_iter_next(&object->hashtable, iter);
|
||||
}
|
||||
|
||||
const object_key_t *jsonp_object_iter_fullkey(void *iter)
|
||||
{
|
||||
if(!iter)
|
||||
return NULL;
|
||||
|
||||
return hashtable_iter_key(iter);
|
||||
}
|
||||
|
||||
const char *json_object_iter_key(void *iter)
|
||||
{
|
||||
if(!iter)
|
||||
return NULL;
|
||||
|
||||
return jsonp_object_iter_fullkey(iter)->key;
|
||||
}
|
||||
|
||||
json_t *json_object_iter_value(void *iter)
|
||||
{
|
||||
if(!iter)
|
||||
return NULL;
|
||||
|
||||
return (json_t *)hashtable_iter_value(iter);
|
||||
}
|
||||
|
||||
int json_object_iter_set_new(json_t *json, void *iter, json_t *value)
|
||||
{
|
||||
json_object_t *object;
|
||||
|
||||
if(!json_is_object(json) || !iter || !value)
|
||||
return -1;
|
||||
|
||||
object = json_to_object(json);
|
||||
hashtable_iter_set(&object->hashtable, iter, value);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int json_object_equal(json_t *object1, json_t *object2)
|
||||
{
|
||||
void *iter;
|
||||
|
||||
if(json_object_size(object1) != json_object_size(object2))
|
||||
return 0;
|
||||
|
||||
iter = json_object_iter(object1);
|
||||
while(iter)
|
||||
{
|
||||
const char *key;
|
||||
json_t *value1, *value2;
|
||||
|
||||
key = json_object_iter_key(iter);
|
||||
value1 = json_object_iter_value(iter);
|
||||
value2 = json_object_get(object2, key);
|
||||
|
||||
if(!json_equal(value1, value2))
|
||||
return 0;
|
||||
|
||||
iter = json_object_iter_next(object1, iter);
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
static json_t *json_object_copy(json_t *object)
|
||||
{
|
||||
json_t *result;
|
||||
void *iter;
|
||||
|
||||
result = json_object();
|
||||
if(!result)
|
||||
return NULL;
|
||||
|
||||
iter = json_object_iter(object);
|
||||
while(iter)
|
||||
{
|
||||
const char *key;
|
||||
json_t *value;
|
||||
|
||||
key = json_object_iter_key(iter);
|
||||
value = json_object_iter_value(iter);
|
||||
json_object_set_nocheck(result, key, value);
|
||||
|
||||
iter = json_object_iter_next(object, iter);
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
static json_t *json_object_deep_copy(json_t *object)
|
||||
{
|
||||
json_t *result;
|
||||
void *iter;
|
||||
|
||||
result = json_object();
|
||||
if(!result)
|
||||
return NULL;
|
||||
|
||||
iter = json_object_iter(object);
|
||||
while(iter)
|
||||
{
|
||||
const char *key;
|
||||
json_t *value;
|
||||
|
||||
key = json_object_iter_key(iter);
|
||||
value = json_object_iter_value(iter);
|
||||
json_object_set_new_nocheck(result, key, json_deep_copy(value));
|
||||
|
||||
iter = json_object_iter_next(object, iter);
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
/*** array ***/
|
||||
|
||||
json_t *json_array(void)
|
||||
{
|
||||
json_array_t *array = malloc(sizeof(json_array_t));
|
||||
if(!array)
|
||||
return NULL;
|
||||
json_init(&array->json, JSON_ARRAY);
|
||||
|
||||
array->entries = 0;
|
||||
array->size = 8;
|
||||
|
||||
array->table = malloc(array->size * sizeof(json_t *));
|
||||
if(!array->table) {
|
||||
free(array);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
array->visited = 0;
|
||||
|
||||
return &array->json;
|
||||
}
|
||||
|
||||
static void json_delete_array(json_array_t *array)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
for(i = 0; i < array->entries; i++)
|
||||
json_decref(array->table[i]);
|
||||
|
||||
free(array->table);
|
||||
free(array);
|
||||
}
|
||||
|
||||
unsigned int json_array_size(const json_t *json)
|
||||
{
|
||||
if(!json_is_array(json))
|
||||
return 0;
|
||||
|
||||
return json_to_array(json)->entries;
|
||||
}
|
||||
|
||||
json_t *json_array_get(const json_t *json, unsigned int index)
|
||||
{
|
||||
json_array_t *array;
|
||||
if(!json_is_array(json))
|
||||
return NULL;
|
||||
array = json_to_array(json);
|
||||
|
||||
if(index >= array->entries)
|
||||
return NULL;
|
||||
|
||||
return array->table[index];
|
||||
}
|
||||
|
||||
int json_array_set_new(json_t *json, unsigned int index, json_t *value)
|
||||
{
|
||||
json_array_t *array;
|
||||
|
||||
if(!value)
|
||||
return -1;
|
||||
|
||||
if(!json_is_array(json) || json == value)
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
array = json_to_array(json);
|
||||
|
||||
if(index >= array->entries)
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
json_decref(array->table[index]);
|
||||
array->table[index] = value;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void array_move(json_array_t *array, unsigned int dest,
|
||||
unsigned int src, unsigned int count)
|
||||
{
|
||||
memmove(&array->table[dest], &array->table[src], count * sizeof(json_t *));
|
||||
}
|
||||
|
||||
static void array_copy(json_t **dest, unsigned int dpos,
|
||||
json_t **src, unsigned int spos,
|
||||
unsigned int count)
|
||||
{
|
||||
memcpy(&dest[dpos], &src[spos], count * sizeof(json_t *));
|
||||
}
|
||||
|
||||
static json_t **json_array_grow(json_array_t *array,
|
||||
unsigned int amount,
|
||||
int copy)
|
||||
{
|
||||
unsigned int new_size;
|
||||
json_t **old_table, **new_table;
|
||||
|
||||
if(array->entries + amount <= array->size)
|
||||
return array->table;
|
||||
|
||||
old_table = array->table;
|
||||
|
||||
new_size = max(array->size + amount, array->size * 2);
|
||||
new_table = malloc(new_size * sizeof(json_t *));
|
||||
if(!new_table)
|
||||
return NULL;
|
||||
|
||||
array->size = new_size;
|
||||
array->table = new_table;
|
||||
|
||||
if(copy) {
|
||||
array_copy(array->table, 0, old_table, 0, array->entries);
|
||||
free(old_table);
|
||||
return array->table;
|
||||
}
|
||||
|
||||
return old_table;
|
||||
}
|
||||
|
||||
int json_array_append_new(json_t *json, json_t *value)
|
||||
{
|
||||
json_array_t *array;
|
||||
|
||||
if(!value)
|
||||
return -1;
|
||||
|
||||
if(!json_is_array(json) || json == value)
|
||||
{
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
array = json_to_array(json);
|
||||
|
||||
if(!json_array_grow(array, 1, 1)) {
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
array->table[array->entries] = value;
|
||||
array->entries++;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_array_insert_new(json_t *json, unsigned int index, json_t *value)
|
||||
{
|
||||
json_array_t *array;
|
||||
json_t **old_table;
|
||||
|
||||
if(!value)
|
||||
return -1;
|
||||
|
||||
if(!json_is_array(json) || json == value) {
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
array = json_to_array(json);
|
||||
|
||||
if(index > array->entries) {
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
old_table = json_array_grow(array, 1, 0);
|
||||
if(!old_table) {
|
||||
json_decref(value);
|
||||
return -1;
|
||||
}
|
||||
|
||||
if(old_table != array->table) {
|
||||
array_copy(array->table, 0, old_table, 0, index);
|
||||
array_copy(array->table, index + 1, old_table, index,
|
||||
array->entries - index);
|
||||
free(old_table);
|
||||
}
|
||||
else
|
||||
array_move(array, index + 1, index, array->entries - index);
|
||||
|
||||
array->table[index] = value;
|
||||
array->entries++;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_array_remove(json_t *json, unsigned int index)
|
||||
{
|
||||
json_array_t *array;
|
||||
|
||||
if(!json_is_array(json))
|
||||
return -1;
|
||||
array = json_to_array(json);
|
||||
|
||||
if(index >= array->entries)
|
||||
return -1;
|
||||
|
||||
json_decref(array->table[index]);
|
||||
|
||||
array_move(array, index, index + 1, array->entries - index);
|
||||
array->entries--;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_array_clear(json_t *json)
|
||||
{
|
||||
json_array_t *array;
|
||||
unsigned int i;
|
||||
|
||||
if(!json_is_array(json))
|
||||
return -1;
|
||||
array = json_to_array(json);
|
||||
|
||||
for(i = 0; i < array->entries; i++)
|
||||
json_decref(array->table[i]);
|
||||
|
||||
array->entries = 0;
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_array_extend(json_t *json, json_t *other_json)
|
||||
{
|
||||
json_array_t *array, *other;
|
||||
unsigned int i;
|
||||
|
||||
if(!json_is_array(json) || !json_is_array(other_json))
|
||||
return -1;
|
||||
array = json_to_array(json);
|
||||
other = json_to_array(other_json);
|
||||
|
||||
if(!json_array_grow(array, other->entries, 1))
|
||||
return -1;
|
||||
|
||||
for(i = 0; i < other->entries; i++)
|
||||
json_incref(other->table[i]);
|
||||
|
||||
array_copy(array->table, array->entries, other->table, 0, other->entries);
|
||||
|
||||
array->entries += other->entries;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static int json_array_equal(json_t *array1, json_t *array2)
|
||||
{
|
||||
unsigned int i, size;
|
||||
|
||||
size = json_array_size(array1);
|
||||
if(size != json_array_size(array2))
|
||||
return 0;
|
||||
|
||||
for(i = 0; i < size; i++)
|
||||
{
|
||||
json_t *value1, *value2;
|
||||
|
||||
value1 = json_array_get(array1, i);
|
||||
value2 = json_array_get(array2, i);
|
||||
|
||||
if(!json_equal(value1, value2))
|
||||
return 0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
static json_t *json_array_copy(json_t *array)
|
||||
{
|
||||
json_t *result;
|
||||
unsigned int i;
|
||||
|
||||
result = json_array();
|
||||
if(!result)
|
||||
return NULL;
|
||||
|
||||
for(i = 0; i < json_array_size(array); i++)
|
||||
json_array_append(result, json_array_get(array, i));
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
static json_t *json_array_deep_copy(json_t *array)
|
||||
{
|
||||
json_t *result;
|
||||
unsigned int i;
|
||||
|
||||
result = json_array();
|
||||
if(!result)
|
||||
return NULL;
|
||||
|
||||
for(i = 0; i < json_array_size(array); i++)
|
||||
json_array_append_new(result, json_deep_copy(json_array_get(array, i)));
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
/*** string ***/
|
||||
|
||||
json_t *json_string_nocheck(const char *value)
|
||||
{
|
||||
json_string_t *string;
|
||||
|
||||
if(!value)
|
||||
return NULL;
|
||||
|
||||
string = malloc(sizeof(json_string_t));
|
||||
if(!string)
|
||||
return NULL;
|
||||
json_init(&string->json, JSON_STRING);
|
||||
|
||||
string->value = strdup(value);
|
||||
if(!string->value) {
|
||||
free(string);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return &string->json;
|
||||
}
|
||||
|
||||
json_t *json_string(const char *value)
|
||||
{
|
||||
if(!value || !utf8_check_string(value, -1))
|
||||
return NULL;
|
||||
|
||||
return json_string_nocheck(value);
|
||||
}
|
||||
|
||||
const char *json_string_value(const json_t *json)
|
||||
{
|
||||
if(!json_is_string(json))
|
||||
return NULL;
|
||||
|
||||
return json_to_string(json)->value;
|
||||
}
|
||||
|
||||
int json_string_set_nocheck(json_t *json, const char *value)
|
||||
{
|
||||
char *dup;
|
||||
json_string_t *string;
|
||||
|
||||
dup = strdup(value);
|
||||
if(!dup)
|
||||
return -1;
|
||||
|
||||
string = json_to_string(json);
|
||||
free(string->value);
|
||||
string->value = dup;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int json_string_set(json_t *json, const char *value)
|
||||
{
|
||||
if(!value || !utf8_check_string(value, -1))
|
||||
return -1;
|
||||
|
||||
return json_string_set_nocheck(json, value);
|
||||
}
|
||||
|
||||
static void json_delete_string(json_string_t *string)
|
||||
{
|
||||
free(string->value);
|
||||
free(string);
|
||||
}
|
||||
|
||||
static int json_string_equal(json_t *string1, json_t *string2)
|
||||
{
|
||||
return strcmp(json_string_value(string1), json_string_value(string2)) == 0;
|
||||
}
|
||||
|
||||
static json_t *json_string_copy(json_t *string)
|
||||
{
|
||||
return json_string_nocheck(json_string_value(string));
|
||||
}
|
||||
|
||||
|
||||
/*** integer ***/
|
||||
|
||||
json_t *json_integer(int value)
|
||||
{
|
||||
json_integer_t *integer = malloc(sizeof(json_integer_t));
|
||||
if(!integer)
|
||||
return NULL;
|
||||
json_init(&integer->json, JSON_INTEGER);
|
||||
|
||||
integer->value = value;
|
||||
return &integer->json;
|
||||
}
|
||||
|
||||
int json_integer_value(const json_t *json)
|
||||
{
|
||||
if(!json_is_integer(json))
|
||||
return 0;
|
||||
|
||||
return json_to_integer(json)->value;
|
||||
}
|
||||
|
||||
int json_integer_set(json_t *json, int value)
|
||||
{
|
||||
if(!json_is_integer(json))
|
||||
return -1;
|
||||
|
||||
json_to_integer(json)->value = value;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void json_delete_integer(json_integer_t *integer)
|
||||
{
|
||||
free(integer);
|
||||
}
|
||||
|
||||
static int json_integer_equal(json_t *integer1, json_t *integer2)
|
||||
{
|
||||
return json_integer_value(integer1) == json_integer_value(integer2);
|
||||
}
|
||||
|
||||
static json_t *json_integer_copy(json_t *integer)
|
||||
{
|
||||
return json_integer(json_integer_value(integer));
|
||||
}
|
||||
|
||||
|
||||
/*** real ***/
|
||||
|
||||
json_t *json_real(double value)
|
||||
{
|
||||
json_real_t *real = malloc(sizeof(json_real_t));
|
||||
if(!real)
|
||||
return NULL;
|
||||
json_init(&real->json, JSON_REAL);
|
||||
|
||||
real->value = value;
|
||||
return &real->json;
|
||||
}
|
||||
|
||||
double json_real_value(const json_t *json)
|
||||
{
|
||||
if(!json_is_real(json))
|
||||
return 0;
|
||||
|
||||
return json_to_real(json)->value;
|
||||
}
|
||||
|
||||
int json_real_set(json_t *json, double value)
|
||||
{
|
||||
if(!json_is_real(json))
|
||||
return 0;
|
||||
|
||||
json_to_real(json)->value = value;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void json_delete_real(json_real_t *real)
|
||||
{
|
||||
free(real);
|
||||
}
|
||||
|
||||
static int json_real_equal(json_t *real1, json_t *real2)
|
||||
{
|
||||
return json_real_value(real1) == json_real_value(real2);
|
||||
}
|
||||
|
||||
static json_t *json_real_copy(json_t *real)
|
||||
{
|
||||
return json_real(json_real_value(real));
|
||||
}
|
||||
|
||||
|
||||
/*** number ***/
|
||||
|
||||
double json_number_value(const json_t *json)
|
||||
{
|
||||
if(json_is_integer(json))
|
||||
return json_integer_value(json);
|
||||
else if(json_is_real(json))
|
||||
return json_real_value(json);
|
||||
else
|
||||
return 0.0;
|
||||
}
|
||||
|
||||
|
||||
/*** simple values ***/
|
||||
|
||||
json_t *json_true(void)
|
||||
{
|
||||
static json_t the_true = {
|
||||
JSON_TRUE,
|
||||
(unsigned int)-1
|
||||
};
|
||||
return &the_true;
|
||||
}
|
||||
|
||||
|
||||
json_t *json_false(void)
|
||||
{
|
||||
static json_t the_false = {
|
||||
JSON_FALSE,
|
||||
(unsigned int)-1
|
||||
};
|
||||
return &the_false;
|
||||
}
|
||||
|
||||
|
||||
json_t *json_null(void)
|
||||
{
|
||||
static json_t the_null = {
|
||||
JSON_NULL,
|
||||
(unsigned int)-1
|
||||
};
|
||||
return &the_null;
|
||||
}
|
||||
|
||||
|
||||
/*** deletion ***/
|
||||
|
||||
void json_delete(json_t *json)
|
||||
{
|
||||
if(json_is_object(json))
|
||||
json_delete_object(json_to_object(json));
|
||||
|
||||
else if(json_is_array(json))
|
||||
json_delete_array(json_to_array(json));
|
||||
|
||||
else if(json_is_string(json))
|
||||
json_delete_string(json_to_string(json));
|
||||
|
||||
else if(json_is_integer(json))
|
||||
json_delete_integer(json_to_integer(json));
|
||||
|
||||
else if(json_is_real(json))
|
||||
json_delete_real(json_to_real(json));
|
||||
|
||||
/* json_delete is not called for true, false or null */
|
||||
}
|
||||
|
||||
|
||||
/*** equality ***/
|
||||
|
||||
int json_equal(json_t *json1, json_t *json2)
|
||||
{
|
||||
if(!json1 || !json2)
|
||||
return 0;
|
||||
|
||||
if(json_typeof(json1) != json_typeof(json2))
|
||||
return 0;
|
||||
|
||||
/* this covers true, false and null as they are singletons */
|
||||
if(json1 == json2)
|
||||
return 1;
|
||||
|
||||
if(json_is_object(json1))
|
||||
return json_object_equal(json1, json2);
|
||||
|
||||
if(json_is_array(json1))
|
||||
return json_array_equal(json1, json2);
|
||||
|
||||
if(json_is_string(json1))
|
||||
return json_string_equal(json1, json2);
|
||||
|
||||
if(json_is_integer(json1))
|
||||
return json_integer_equal(json1, json2);
|
||||
|
||||
if(json_is_real(json1))
|
||||
return json_real_equal(json1, json2);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
/*** copying ***/
|
||||
|
||||
json_t *json_copy(json_t *json)
|
||||
{
|
||||
if(!json)
|
||||
return NULL;
|
||||
|
||||
if(json_is_object(json))
|
||||
return json_object_copy(json);
|
||||
|
||||
if(json_is_array(json))
|
||||
return json_array_copy(json);
|
||||
|
||||
if(json_is_string(json))
|
||||
return json_string_copy(json);
|
||||
|
||||
if(json_is_integer(json))
|
||||
return json_integer_copy(json);
|
||||
|
||||
if(json_is_real(json))
|
||||
return json_real_copy(json);
|
||||
|
||||
if(json_is_true(json) || json_is_false(json) || json_is_null(json))
|
||||
return json;
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
json_t *json_deep_copy(json_t *json)
|
||||
{
|
||||
if(!json)
|
||||
return NULL;
|
||||
|
||||
if(json_is_object(json))
|
||||
return json_object_deep_copy(json);
|
||||
|
||||
if(json_is_array(json))
|
||||
return json_array_deep_copy(json);
|
||||
|
||||
/* for the rest of the types, deep copying doesn't differ from
|
||||
shallow copying */
|
||||
|
||||
if(json_is_string(json))
|
||||
return json_string_copy(json);
|
||||
|
||||
if(json_is_integer(json))
|
||||
return json_integer_copy(json);
|
||||
|
||||
if(json_is_real(json))
|
||||
return json_real_copy(json);
|
||||
|
||||
if(json_is_true(json) || json_is_false(json) || json_is_null(json))
|
||||
return json;
|
||||
|
||||
return NULL;
|
||||
}
|
||||
@@ -0,0 +1,6 @@
|
||||
#pragma once
|
||||
|
||||
#define false 0
|
||||
#define true 1
|
||||
|
||||
#define bool int
|
||||
@@ -0,0 +1,11 @@
|
||||
#pragma once
|
||||
#ifdef __cplusplus
|
||||
extern "C"
|
||||
{
|
||||
#endif
|
||||
int gettimeofday(struct timeval *tv, struct timezone *tz);
|
||||
void usleep(__int64 usec);
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
typedef __int64 useconds_t;
|
||||
@@ -0,0 +1,662 @@
|
||||
#######################################
|
||||
# Thrust v1.7.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust 1.7.0 introduces a new interface for controlling algorithm execution as
|
||||
well as several new algorithms and performance improvements. With this new
|
||||
interface, users may directly control how algorithms execute as well as details
|
||||
such as the allocation of temporary storage. Key/value versions of thrust::merge
|
||||
and the set operation algorithms have been added, as well stencil versions of
|
||||
partitioning algorithms. thrust::tabulate has been introduced to tabulate the
|
||||
values of functions taking integers. For 32b types, new CUDA merge and set
|
||||
operations provide 2-15x faster performance while a new CUDA comparison sort
|
||||
provides 1.3-4x faster performance. Finally, a new TBB reduce_by_key implementation
|
||||
provides 80% faster performance.
|
||||
|
||||
Breaking API Changes
|
||||
Dispatch
|
||||
Custom user backend systems' tag types must now inherit from the corresponding system's execution_policy template (e.g. thrust::cuda::execution_policy) instead
|
||||
of the tag struct (e.g. thrust::cuda::tag). Otherwise, algorithm specializations will silently go unfound during dispatch.
|
||||
See examples/minimal_custom_backend.cu and examples/cuda/fallback_allocator.cu for usage examples.
|
||||
|
||||
thrust::advance and thrust::distance are no longer dispatched based on iterator system type and thus may no longer be customized.
|
||||
|
||||
Iterators
|
||||
iterator_facade and iterator_adaptor's Pointer template parameters have been eliminated.
|
||||
iterator_adaptor has been moved into the thrust namespace (previously thrust::experimental::iterator_adaptor).
|
||||
iterator_facade has been moved into the thrust namespace (previously thrust::experimental::iterator_facade).
|
||||
iterator_core_access has been moved into the thrust namespace (previously thrust::experimental::iterator_core_access).
|
||||
All iterators' nested pointer typedef (the type of the result of operator->) is now void instead of a pointer type to indicate that such expressions are currently impossible.
|
||||
Floating point counting_iterators' nested difference_type typedef is now a signed integral type instead of a floating point type.
|
||||
|
||||
Other
|
||||
normal_distribution has been moved into the thrust::random namespace (previously thrust::random::experimental::normal_distribution).
|
||||
Placeholder expressions may no longer include the comma operator.
|
||||
|
||||
New Features
|
||||
Execution Policies
|
||||
Users may directly control the dispatch of algorithm invocations with optional execution policy arguments.
|
||||
For example, instead of wrapping raw pointers allocated by cudaMalloc with thrust::device_ptr, the thrust::device execution_policy may be passed as an argument to an algorithm invocation to enable CUDA execution.
|
||||
The following execution policies are supported in this version:
|
||||
|
||||
thrust::host
|
||||
thrust::device
|
||||
thrust::cpp::par
|
||||
thrust::cuda::par
|
||||
thrust::omp::par
|
||||
thrust::tbb::par
|
||||
|
||||
Algorithms
|
||||
free
|
||||
get_temporary_buffer
|
||||
malloc
|
||||
merge_by_key
|
||||
partition with stencil
|
||||
partition_copy with stencil
|
||||
return_temporary_buffer
|
||||
set_difference_by_key
|
||||
set_intersection_by_key
|
||||
set_symmetric_difference_by_key
|
||||
set_union_by_key
|
||||
stable_partition with stencil
|
||||
stable_partition_copy with stencil
|
||||
tabulate
|
||||
|
||||
New Examples
|
||||
uninitialized_vector demonstrates how to use a custom allocator to avoid the automatic initialization of elements in thrust::device_vector.
|
||||
|
||||
Other Enhancements
|
||||
Authors of custom backend systems may manipulate arbitrary state during algorithm dispatch by incorporating it into their execution_policy parameter.
|
||||
Users may control the allocation of temporary storage during algorithm execution by passing standard allocators as parameters via execution policies such as thrust::device.
|
||||
THRUST_DEVICE_SYSTEM_CPP has been added as a compile-time target for the device backend.
|
||||
CUDA merge performance is 2-15x faster.
|
||||
CUDA comparison sort performance is 1.3-4x faster.
|
||||
CUDA set operation performance is 1.5-15x faster.
|
||||
TBB reduce_by_key performance is 80% faster.
|
||||
Several algorithms have been parallelized with TBB.
|
||||
Support for user allocators in vectors has been improved.
|
||||
The sparse_vector example is now implemented with merge_by_key instead of sort_by_key.
|
||||
Warnings have been eliminated in various contexts.
|
||||
Warnings about __host__ or __device__-only functions called from __host__ __device__ functions have been eliminated in various contexts.
|
||||
Documentation about algorithm requirements have been improved.
|
||||
Simplified the minimal_custom_backend example.
|
||||
Simplified the cuda/custom_temporary_allocation example.
|
||||
Simplified the cuda/fallback_allocator example.
|
||||
|
||||
Bug Fixes
|
||||
#248 fix broken counting_iterator<float> behavior with OpenMP
|
||||
#231, #209 fix set operation failures with CUDA
|
||||
#187 fix incorrect occupancy calculation with CUDA
|
||||
#153 fix broken multigpu behavior with CUDA
|
||||
#142 eliminate warning produced by thrust::random::taus88 and MSVC 2010
|
||||
#208 correctly initialize elements in temporary storage when necessary
|
||||
#16 fix compilation error when sorting bool with CUDA
|
||||
#10 fix ambiguous overloads of reinterpret_tag
|
||||
|
||||
Known Issues
|
||||
g++ versions 4.3 and lower may fail to dispatch thrust::get_temporary_buffer correctly causing infinite recursion in examples such as cuda/custom_temporary_allocation.
|
||||
|
||||
Acknowledgments
|
||||
Thanks to Sean Baxter, Bryan Catanzaro, and Manjunath Kudlur for contributing a faster merge implementation for CUDA.
|
||||
Thanks to Sean Baxter for contributing a faster set operation implementation for CUDA.
|
||||
Thanks to Cliff Woolley for contributing a correct occupancy calculation algorithm.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.6.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.6.0 provides an interface for customization and extension and a new
|
||||
backend system based on the Threading Building Blocks library. With this
|
||||
new interface, programmers may customize the behavior of specific algorithms
|
||||
as well as control the allocation of temporary storage or invent entirely new
|
||||
backends. These enhancements also allow multiple different backend systems
|
||||
such as CUDA and OpenMP to coexist within a single program. Support for TBB
|
||||
allows Thrust programs to integrate more naturally into applications which
|
||||
may already employ the TBB task scheduler.
|
||||
|
||||
Breaking API Changes
|
||||
The header <thrust/experimental/cuda/pinned_allocator.h> has been moved to <thrust/system/cuda/experimental/pinned_allocator.h>
|
||||
thrust::experimental::cuda::pinned_allocator has been moved to thrust::cuda::experimental::pinned_allocator
|
||||
The macro THRUST_DEVICE_BACKEND has been renamed THRUST_DEVICE_SYSTEM
|
||||
The macro THRUST_DEVICE_BACKEND_CUDA has been renamed THRUST_DEVICE_SYSTEM_CUDA
|
||||
The macro THRUST_DEVICE_BACKEND_OMP has been renamed THRUST_DEVICE_SYSTEM_OMP
|
||||
thrust::host_space_tag has been renamed thrust::host_system_tag
|
||||
thrust::device_space_tag has been renamed thrust::device_system_tag
|
||||
thrust::any_space_tag has been renamed thrust::any_system_tag
|
||||
thrust::iterator_space has been renamed thrust::iterator_system
|
||||
|
||||
|
||||
New Features
|
||||
Backend Systems
|
||||
Threading Building Blocks (TBB) is now supported
|
||||
Functions
|
||||
for_each_n
|
||||
raw_reference_cast
|
||||
Types
|
||||
pointer
|
||||
reference
|
||||
|
||||
New Examples
|
||||
cuda/custom_temporary_allocation
|
||||
cuda/fallback_allocator
|
||||
device_ptr
|
||||
expand
|
||||
minimal_custom_backend
|
||||
raw_reference_cast
|
||||
set_operations
|
||||
|
||||
Other Enhancements
|
||||
thrust::for_each now returns the end of the input range similar to most other algorithms
|
||||
thrust::pair and thrust::tuple have swap functionality
|
||||
all CUDA algorithms now support large data types
|
||||
iterators may be dereferenced in user __device__ or __global__ functions
|
||||
the safe use of different backend systems is now possible within a single binary
|
||||
|
||||
Bug Fixes
|
||||
#469 min_element and max_element algorithms no longer require a const comparison operator
|
||||
|
||||
Known Issues
|
||||
cudafe++.exe may crash when parsing TBB headers on Windows.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.5.3 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Small bug fixes
|
||||
|
||||
Bug Fixes
|
||||
Avoid warnings about potential race due to __shared__ non-POD variable
|
||||
|
||||
#######################################
|
||||
# Thrust v1.5.2 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Small bug fixes
|
||||
|
||||
Bug Fixes
|
||||
Fixed warning about C-style initialization of structures
|
||||
|
||||
#######################################
|
||||
# Thrust v1.5.1 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Small bug fixes
|
||||
|
||||
Bug Fixes
|
||||
Sorting data referenced by permutation_iterators on CUDA produces invalid results
|
||||
|
||||
#######################################
|
||||
# Thrust v1.5.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.5.0 provides introduces new programmer productivity and performance
|
||||
enhancements. New functionality for creating anonymous "lambda" functions has
|
||||
been added. A faster host sort provides 2-10x faster performance for sorting
|
||||
arithmetic types on (single-threaded) CPUs. A new OpenMP sort provides
|
||||
2.5x-3.0x speedup over the host sort using a quad-core CPU. When sorting
|
||||
arithmetic types with the OpenMP backend the combined performance improvement
|
||||
is 5.9x for 32-bit integers and ranges from 3.0x (64-bit types) to 14.2x
|
||||
(8-bit types). A new CUDA reduce_by_key implementation provides 2-3x faster
|
||||
performance.
|
||||
|
||||
Breaking API Changes
|
||||
device_ptr<void> no longer unsafely converts to device_ptr<T> without an
|
||||
explicit cast. Use the expression
|
||||
device_pointer_cast(static_cast<int*>(void_ptr.get()))
|
||||
to convert, for example, device_ptr<void> to device_ptr<int>.
|
||||
|
||||
New Features
|
||||
Functions
|
||||
stencil-less transform_if
|
||||
|
||||
Types
|
||||
lambda placeholders
|
||||
|
||||
New Examples
|
||||
lambda
|
||||
|
||||
Other Enhancements
|
||||
host sort is 2-10x faster for arithmetic types
|
||||
OMP sort provides speedup over host sort
|
||||
reduce_by_key is 2-3x faster
|
||||
reduce_by_key no longer requires O(N) temporary storage
|
||||
CUDA scan algorithms are 10-40% faster
|
||||
host_vector and device_vector are now documented
|
||||
out-of-memory exceptions now provide detailed information from CUDART
|
||||
improved histogram example
|
||||
device_reference now has a specialized swap
|
||||
reduce_by_key and scan algorithms are compatible with discard_iterator
|
||||
|
||||
Removed Functionality
|
||||
|
||||
Bug Fixes
|
||||
#44 allow host_vector to compile when value_type uses __align__
|
||||
#198 allow adjacent_difference to permit safe in-situ operation
|
||||
#303 make thrust thread-safe
|
||||
#313 avoid race conditions in device_vector::insert
|
||||
#314 avoid unintended adl invocation when dispatching copy
|
||||
#365 fix merge and set operation failures
|
||||
|
||||
Known Issues
|
||||
None
|
||||
|
||||
Acknowledgments
|
||||
Thanks to Manjunath Kudlur for contributing his Carbon library, from which the lambda functionality is derived.
|
||||
Thanks to Jean-Francois Bastien for suggesting a fix for issue 303.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.4.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.4.0 provides support for CUDA 4.0 in addition to many feature
|
||||
and performance improvements. New set theoretic algorithms operating on
|
||||
sorted sequences have been added. Additionally, a new fancy iterator
|
||||
allows discarding redundant or otherwise unnecessary output from
|
||||
algorithms, conserving memory storage and bandwidth.
|
||||
|
||||
Breaking API Changes
|
||||
Eliminations
|
||||
thrust/is_sorted.h
|
||||
thrust/utility.h
|
||||
thrust/set_intersection.h
|
||||
thrust/experimental/cuda/ogl_interop_allocator.h and the functionality therein
|
||||
thrust::deprecated::copy_when
|
||||
thrust::deprecated::absolute_value
|
||||
|
||||
New Features
|
||||
Functions
|
||||
copy_n
|
||||
merge
|
||||
set_difference
|
||||
set_symmetric_difference
|
||||
set_union
|
||||
|
||||
Types
|
||||
discard_iterator
|
||||
|
||||
Device support
|
||||
Compute Capability 2.1 GPUs
|
||||
|
||||
New Examples
|
||||
run_length_decoding
|
||||
|
||||
Other Enhancements
|
||||
Compilation warnings are substantially reduced in various contexts.
|
||||
The compilation time of thrust::sort, thrust::stable_sort, thrust::sort_by_key,
|
||||
and thrust::stable_sort_by_key are substantially reduced.
|
||||
A fast sort implementation is used when sorting primitive types with thrust::greater.
|
||||
The performance of thrust::set_intersection is improved.
|
||||
The performance of thrust::fill is improved on SM 1.x devices.
|
||||
A code example is now provided in each algorithm's documentation.
|
||||
thrust::reverse now operates in-place
|
||||
|
||||
Removed Functionality
|
||||
thrust::deprecated::copy_when
|
||||
thrust::deprecated::absolute_value
|
||||
thrust::experimental::cuda::ogl_interop_allocator
|
||||
thrust::gather and thrust::scatter from host to device and vice versa are no longer supported.
|
||||
Operations which modify the elements of a thrust::device_vector are no longer
|
||||
available from source code compiled without nvcc when the device backend is CUDA.
|
||||
Instead, use the idiom from the cpp_interop example.
|
||||
|
||||
Bug Fixes
|
||||
#212 set_intersection works correctly for large input sizes.
|
||||
#275 counting_iterator and constant_iterator work correctly with OpenMP as the
|
||||
backend when compiling with optimization
|
||||
#256 min and max correctly return their first argument as a tie-breaker
|
||||
#248 NDEBUG is interpreted correctly
|
||||
|
||||
Known Issues
|
||||
nvcc may generate code containing warnings when compiling some Thrust algorithms.
|
||||
When compiling with -arch=sm_1x, some Thrust algorithms may cause nvcc to issue
|
||||
benign pointer advisories.
|
||||
When compiling with -arch=sm_1x and -G, some Thrust algorithms may fail to execute correctly.
|
||||
thrust::inclusive_scan, thrust::exclusive_scan, thrust::inclusive_scan_by_key,
|
||||
and thrust::exclusive_scan_by_key are currently incompatible with thrust::discard_iterator.
|
||||
|
||||
Acknowledgments
|
||||
Thanks to David Tarjan for improving the performance of set_intersection.
|
||||
Thanks to Duane Merrill for continued help with sort.
|
||||
Thanks to Nathan Whitehead for help with CUDA Toolkit integration.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.3.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.3.0 provides support for CUDA 3.2 in addition to many feature
|
||||
and performance enhancements.
|
||||
|
||||
Performance of the sort and sort_by_key algorithms is improved by as much
|
||||
as 3x in certain situations. The performance of stream compaction algorithms,
|
||||
such as copy_if, is improved by as much as 2x. Reduction performance is
|
||||
also improved, particularly for small input sizes.
|
||||
|
||||
CUDA errors are now converted to runtime exceptions using the system_error
|
||||
interface. Combined with a debug mode, also new in v1.3, runtime errors
|
||||
can be located with greater precision.
|
||||
|
||||
Lastly, a few header files have been consolidated or renamed for clarity.
|
||||
See the deprecations section below for additional details.
|
||||
|
||||
|
||||
Breaking API Changes
|
||||
Promotions
|
||||
thrust::experimental::inclusive_segmented_scan has been renamed thrust::inclusive_scan_by_key and exposes a different interface
|
||||
thrust::experimental::exclusive_segmented_scan has been renamed thrust::exclusive_scan_by_key and exposes a different interface
|
||||
thrust::experimental::partition_copy has been renamed thrust::partition_copy and exposes a different interface
|
||||
thrust::next::gather has been renamed thrust::gather
|
||||
thrust::next::gather_if has been renamed thrust::gather_if
|
||||
thrust::unique_copy_by_key has been renamed thrust::unique_by_key_copy
|
||||
Deprecations
|
||||
thrust::copy_when has been renamed thrust::deprecated::copy_when
|
||||
thrust::absolute_value has been renamed thrust::deprecated::absolute_value
|
||||
The header thrust/set_intersection.h is now deprecated; use thrust/set_operations.h instead
|
||||
The header thrust/utility.h is now deprecated; use thrust/swap.h instead
|
||||
The header thrust/swap_ranges.h is now deprecated; use thrust/swap.h instead
|
||||
Eliminations
|
||||
thrust::deprecated::gather
|
||||
thrust::deprecated::gather_if
|
||||
thrust/experimental/arch.h and the functions therein
|
||||
thrust/sorting/merge_sort.h
|
||||
thrust/sorting/radix_sort.h
|
||||
|
||||
New Features
|
||||
Functions
|
||||
exclusive_scan_by_key
|
||||
find
|
||||
find_if
|
||||
find_if_not
|
||||
inclusive_scan_by_key
|
||||
is_partitioned
|
||||
is_sorted_until
|
||||
mismatch
|
||||
partition_point
|
||||
reverse
|
||||
reverse_copy
|
||||
stable_partition_copy
|
||||
|
||||
Types
|
||||
system_error and related types
|
||||
experimental::cuda::ogl_interop_allocator
|
||||
bit_and, bit_or, and bit_xor
|
||||
|
||||
Device support
|
||||
gf104-based GPUs
|
||||
|
||||
New Examples
|
||||
opengl_interop.cu
|
||||
repeated_range.cu
|
||||
simple_moving_average.cu
|
||||
sparse_vector.cu
|
||||
strided_range.cu
|
||||
|
||||
Other Enhancements
|
||||
Performance of thrust::sort and thrust::sort_by_key is substantially improved for primitive key types
|
||||
Performance of thrust::copy_if is substantially improved
|
||||
Performance of thrust::reduce and related reductions is improved
|
||||
THRUST_DEBUG mode added
|
||||
Callers of Thrust functions may detect error conditions by catching thrust::system_error, which derives from std::runtime_error
|
||||
The number of compiler warnings generated by Thrust has been substantially reduced
|
||||
Comparison sort now works correctly for input sizes > 32M
|
||||
min & max usage no longer collides with <windows.h> definitions
|
||||
Compiling against the OpenMP backend no longer requires nvcc
|
||||
Performance of device_vector initialized in .cpp files is substantially improved in common cases
|
||||
Performance of thrust::sort_by_key on the host is substantially improved
|
||||
|
||||
Removed Functionality
|
||||
nvcc 2.3 is no longer supported
|
||||
|
||||
Bug Fixes
|
||||
Debug device code now compiles correctly
|
||||
thrust::uninitialized_copy and thrust::unintialized_fill now dispatch constructors on the device rather than the host
|
||||
|
||||
Known Issues
|
||||
#212 set_intersection is known to fail for large input sizes
|
||||
partition_point is known to fail for 64b types with nvcc 3.2
|
||||
|
||||
Acknowledgments
|
||||
Thanks to Duane Merrill for contributing a fast CUDA radix sort implementation
|
||||
Thanks to Erich Elsen for contributing an implementation of find_if
|
||||
Thanks to Andrew Corrigan for contributing changes which allow the OpenMP backend to compile in the absence of nvcc
|
||||
Thanks to Andrew Corrigan, Cliff Wooley, David Coeurjolly, Janick Martinez Esturo, John Bowers, Maxim Naumov, Michael Garland, and Ryuta Suzuki for bug reports
|
||||
Thanks to Cliff Woolley for help with testing
|
||||
|
||||
#######################################
|
||||
# Thrust v1.2.1 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Small fixes for compatibility with CUDA 3.1
|
||||
|
||||
Known Issues
|
||||
inclusive_scan & exclusive_scan may fail with very large types
|
||||
the Microsoft compiler may fail to compile code using both sort and binary search algorithms
|
||||
uninitialized_fill & uninitialized_copy dispatch constructors on the host rather than the device
|
||||
# 109 some algorithms may exhibit poor performance with the OpenMP backend with large numbers (>= 6) of CPU threads
|
||||
default_random_engine::discard is not accelerated with nvcc 2.3
|
||||
nvcc 3.1 may fail to compile code using types derived from thrust::subtract_with_carry_engine, such as thrust::ranlux24 & thrust::ranlux48.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.2.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.2 introduces support for compilation to multicore CPUs
|
||||
and the Ocelot virtual machine, and several new facilities for
|
||||
pseudo-random number generation. New algorithms such as set
|
||||
intersection and segmented reduction have also been added. Lastly,
|
||||
improvements to the robustness of the CUDA backend ensure
|
||||
correctness across a broad set of (uncommon) use cases.
|
||||
|
||||
Breaking API Changes
|
||||
thrust::gather's interface was incorrect and has been removed.
|
||||
The old interface is deprecated but will be preserved for Thrust
|
||||
version 1.2 at thrust::deprecated::gather &
|
||||
thrust::deprecated::gather_if. The new interface is provided at
|
||||
thrust::next::gather & thrust::next::gather_if. The new interface
|
||||
will be promoted to thrust:: in Thrust version 1.3. For more details,
|
||||
please refer to this thread:
|
||||
http://groups.google.com/group/thrust-users/browse_thread/thread/f5f0583cb97b51fd
|
||||
|
||||
The thrust::sorting namespace has been deprecated in favor of the
|
||||
top-level sorting functions, such as thrust::sort() and
|
||||
thrust::sort_by_key().
|
||||
|
||||
New Features
|
||||
Functions
|
||||
reduce_by_key
|
||||
set_intersection
|
||||
tie
|
||||
unique_copy
|
||||
unique_by_key
|
||||
unique_copy_by_key
|
||||
|
||||
Types
|
||||
Random Number Generation
|
||||
discard_block_engine
|
||||
default_random_engine
|
||||
linear_congruential_engine
|
||||
linear_feedback_shift_engine
|
||||
minstd_rand
|
||||
minstd_rand0
|
||||
normal_distribution (experimental)
|
||||
ranlux24
|
||||
ranlux48
|
||||
ranlux24_base
|
||||
ranlux48_base
|
||||
subtract_with_carry_engine
|
||||
taus88
|
||||
uniform_int_distribution
|
||||
uniform_real_distribution
|
||||
xor_combine_engine
|
||||
Functionals
|
||||
project1st
|
||||
project2nd
|
||||
|
||||
Fancy Iterators
|
||||
permutation_iterator
|
||||
reverse_iterator
|
||||
|
||||
Device support
|
||||
Add support for multicore CPUs via OpenMP
|
||||
Add support for Fermi-class GPUs
|
||||
Add support for Ocelot virtual machine
|
||||
|
||||
New Examples
|
||||
cpp_integration
|
||||
histogram
|
||||
mode
|
||||
monte_carlo
|
||||
monte_carlo_disjoint_sequences
|
||||
padded_grid_reduction
|
||||
permutation_iterator
|
||||
row_sum
|
||||
run_length_encoding
|
||||
segmented_scan
|
||||
stream_compaction
|
||||
summary_statistics
|
||||
transform_iterator
|
||||
word_count
|
||||
|
||||
Other Enhancements
|
||||
vector functions operator!=, rbegin, crbegin, rend, crend, data, & shrink_to_fit
|
||||
integer sorting performance is improved when max is large but (max - min) is small and when min is negative
|
||||
performance of inclusive_scan() and exclusive_scan() is improved by 20-25% for primitive types
|
||||
support for nvcc 3.0
|
||||
|
||||
Removed Functionality
|
||||
removed support for equal between host & device sequences
|
||||
removed support for gather() and scatter() between host & device sequences
|
||||
|
||||
Bug Fixes
|
||||
# 8 cause a compiler error if the required compiler is not found rather than a mysterious error at link time
|
||||
# 42 device_ptr & device_reference are classes rather than structs, eliminating warnings on certain platforms
|
||||
# 46 gather & scatter handle any space iterators correctly
|
||||
# 51 thrust::experimental::arch functions gracefully handle unrecognized GPUs
|
||||
# 52 avoid collisions with common user macros such as BLOCK_SIZE
|
||||
# 62 provide better documentation for device_reference
|
||||
# 68 allow built-in CUDA vector types to work with device_vector in pure C++ mode
|
||||
# 102 eliminated a race condition in device_vector::erase
|
||||
various compilation warnings eliminated
|
||||
|
||||
Known Issues
|
||||
inclusive_scan & exclusive_scan may fail with very large types
|
||||
the Microsoft compiler may fail to compile code using both sort and binary search algorithms
|
||||
uninitialized_fill & uninitialized_copy dispatch constructors on the host rather than the device
|
||||
# 109 some algorithms may exhibit poor performance with the OpenMP backend with large numbers (>= 6) of CPU threads
|
||||
default_random_engine::discard is not accelerated with nvcc 2.3
|
||||
|
||||
Acknowledgments
|
||||
Thanks to Gregory Diamos for contributing a CUDA implementation of set_intersection
|
||||
Thanks to Ryuta Suzuki & Gregory Diamos for rigorously testing Thrust's unit tests and examples against Ocelot
|
||||
Thanks to Tom Bradley for contributing an implementation of normal_distribution
|
||||
Thanks to Joseph Rhoads for contributing the example summary_statistics
|
||||
|
||||
#######################################
|
||||
# Thrust v1.1.1 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Small fixes for compatibility with CUDA 2.3a and Mac OSX Snow Leopard.
|
||||
|
||||
#######################################
|
||||
# Thrust v1.1.0 #
|
||||
#######################################
|
||||
|
||||
Summary
|
||||
Thrust v1.1 introduces fancy iterators, binary search functions, and
|
||||
several specialized reduction functions. Experimental support for
|
||||
segmented scan has also been added.
|
||||
|
||||
Breaking API Changes
|
||||
counting_iterator has been moved into the thrust namespace (previously thrust::experimental)
|
||||
|
||||
New Features
|
||||
Functions
|
||||
copy_if
|
||||
lower_bound
|
||||
upper_bound
|
||||
vectorized lower_bound
|
||||
vectorized upper_bound
|
||||
equal_range
|
||||
binary_search
|
||||
vectorized binary_search
|
||||
all_of
|
||||
any_of
|
||||
none_of
|
||||
minmax_element
|
||||
advance
|
||||
inclusive_segmented_scan (experimental)
|
||||
exclusive_segmented_scan (experimental)
|
||||
|
||||
Types
|
||||
pair
|
||||
tuple
|
||||
device_malloc_allocator
|
||||
|
||||
Fancy Iterators
|
||||
constant_iterator
|
||||
counting_iterator
|
||||
transform_iterator
|
||||
zip_iterator
|
||||
|
||||
New Examples
|
||||
computing the maximum absolute difference between vectors
|
||||
computing the bounding box of a two-dimensional point set
|
||||
sorting multiple arrays together (lexicographical sorting)
|
||||
constructing a summed area table
|
||||
using zip_iterator to mimic an array of structs
|
||||
using constant_iterator to increment array values
|
||||
|
||||
Other Enhancements
|
||||
added pinned memory allocator (experimental)
|
||||
added more methods to host_vector & device_vector (issue #4)
|
||||
added variant of remove_if with a stencil argument (issue #29)
|
||||
scan and reduce use cudaFuncGetAttributes to determine grid size
|
||||
exceptions are reported when temporary device arrays cannot be allocated
|
||||
|
||||
Bug Fixes
|
||||
#5 make vector work for larger data types
|
||||
#9 stable_partition_copy doesn't respect OutputIterator concept semantics
|
||||
#10 scans should return OutputIterator
|
||||
#16 make algorithms work for larger data types
|
||||
#27 dispatch radix_sort even when comp=less<T> is explicitly provided
|
||||
|
||||
Known Issues
|
||||
Using functors with Thrust entry points may not compile on Mac OSX with gcc-4.0.1
|
||||
uninitialized_copy & uninitialized_fill dispatch constructors on the host rather than the device.
|
||||
inclusive_scan, inclusive_scan_by_key, exclusive_scan, and exclusive_scan_by_key may fail when used with large types with the CUDA 3.1 driver
|
||||
|
||||
|
||||
#######################################
|
||||
# Thrust v1.0.0 #
|
||||
#######################################
|
||||
|
||||
Breaking API changes
|
||||
Rename top level namespace komrade to thrust.
|
||||
Move partition_copy() & stable_partition_copy() into thrust::experimental namespace until we can easily provide the standard interface.
|
||||
Rename range() to sequence() to avoid collision with Boost.Range.
|
||||
Rename copy_if() to copy_when() due to semantic differences with C++0x copy_if().
|
||||
|
||||
New Features
|
||||
Add C++0x style cbegin() & cend() methods to host_vector & device_vector.
|
||||
Add transform_if function.
|
||||
Add stencil versions of replace_if() & replace_copy_if().
|
||||
Allow counting_iterator to work with for_each().
|
||||
Allow types with constructors in comparison sort & reduce.
|
||||
|
||||
Other Enhancements
|
||||
merge_sort and stable_merge_sort are now 2 to 5x faster when executed on the parallel device.
|
||||
|
||||
Bug fixes
|
||||
Workaround an issue where an incremented iterator causes nvcc to crash. (Komrade issue #6)
|
||||
Fix an issue where const_iterators could not be passed to transform. (Komrade issue #7)
|
||||
|
||||
@@ -0,0 +1,244 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file adjacent_difference.h
|
||||
* \brief Compute difference between consecutive elements of a range
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
/*! \addtogroup transformations Transformations
|
||||
* \{
|
||||
*/
|
||||
|
||||
|
||||
/*! \p adjacent_difference calculates the differences of adjacent elements in the
|
||||
* range <tt>[first, last)</tt>. That is, <tt>\*first</tt> is assigned to
|
||||
* <tt>\*result</tt>, and, for each iterator \p i in the range
|
||||
* <tt>[first + 1, last)</tt>, the difference of <tt>\*i</tt> and <tt>*(i - 1)</tt>
|
||||
* is assigned to <tt>\*(result + (i - first))</tt>.
|
||||
*
|
||||
* This version of \p adjacent_difference uses <tt>operator-</tt> to calculate
|
||||
* differences.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the input range.
|
||||
* \param last The end of the input range.
|
||||
* \param result The beginning of the output range.
|
||||
* \return The iterator <tt>result + (last - first)</tt>
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
|
||||
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
|
||||
* and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
|
||||
* useful for computing differences "in place".
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p adjacent_difference to compute
|
||||
* the difference between adjacent elements of a range using the \p thrust::device execution policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/adjacent_difference.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
|
||||
* thrust::device_vector<int> d_data(h_data, h_data + 8);
|
||||
* thrust::device_vector<int> d_result(8);
|
||||
*
|
||||
* thrust::adjacent_difference(thrust::device, d_data.begin(), d_data.end(), d_result.begin());
|
||||
*
|
||||
* // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
|
||||
* \see inclusive_scan
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first, InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
/*! \p adjacent_difference calculates the differences of adjacent elements in the
|
||||
* range <tt>[first, last)</tt>. That is, <tt>*first</tt> is assigned to
|
||||
* <tt>\*result</tt>, and, for each iterator \p i in the range
|
||||
* <tt>[first + 1, last)</tt>, <tt>binary_op(\*i, \*(i - 1))</tt> is assigned to
|
||||
* <tt>\*(result + (i - first))</tt>.
|
||||
*
|
||||
* This version of \p adjacent_difference uses the binary function \p binary_op to
|
||||
* calculate differences.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the input range.
|
||||
* \param last The end of the input range.
|
||||
* \param result The beginning of the output range.
|
||||
* \param binary_op The binary function used to compute differences.
|
||||
* \return The iterator <tt>result + (last - first)</tt>
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
|
||||
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
* \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
*
|
||||
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
|
||||
* useful for computing differences "in place".
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p adjacent_difference to compute
|
||||
* the sum between adjacent elements of a range using the \p thrust::device execution policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/adjacent_difference.h>
|
||||
* #include <thrust/functional.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
|
||||
* thrust::device_vector<int> d_data(h_data, h_data + 8);
|
||||
* thrust::device_vector<int> d_result(8);
|
||||
*
|
||||
* thrust::adjacent_difference(thrust::device, d_data.begin(), d_data.end(), d_result.begin(), thrust::plus<int>());
|
||||
*
|
||||
* // d_data is now [1, 3, 3, 3, 3, 3, 3, 3]
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
|
||||
* \see inclusive_scan
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator, typename BinaryFunction>
|
||||
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first, InputIterator last,
|
||||
OutputIterator result,
|
||||
BinaryFunction binary_op);
|
||||
|
||||
/*! \p adjacent_difference calculates the differences of adjacent elements in the
|
||||
* range <tt>[first, last)</tt>. That is, <tt>\*first</tt> is assigned to
|
||||
* <tt>\*result</tt>, and, for each iterator \p i in the range
|
||||
* <tt>[first + 1, last)</tt>, the difference of <tt>\*i</tt> and <tt>*(i - 1)</tt>
|
||||
* is assigned to <tt>\*(result + (i - first))</tt>.
|
||||
*
|
||||
* This version of \p adjacent_difference uses <tt>operator-</tt> to calculate
|
||||
* differences.
|
||||
*
|
||||
* \param first The beginning of the input range.
|
||||
* \param last The end of the input range.
|
||||
* \param result The beginning of the output range.
|
||||
* \return The iterator <tt>result + (last - first)</tt>
|
||||
*
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
|
||||
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
|
||||
* and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
|
||||
* useful for computing differences "in place".
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p adjacent_difference to compute
|
||||
* the difference between adjacent elements of a range.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/adjacent_difference.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
|
||||
* thrust::device_vector<int> d_data(h_data, h_data + 8);
|
||||
* thrust::device_vector<int> d_result(8);
|
||||
*
|
||||
* thrust::adjacent_difference(d_data.begin(), d_data.end(), d_result.begin());
|
||||
*
|
||||
* // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
|
||||
* \see inclusive_scan
|
||||
*/
|
||||
template <typename InputIterator, typename OutputIterator>
|
||||
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
/*! \p adjacent_difference calculates the differences of adjacent elements in the
|
||||
* range <tt>[first, last)</tt>. That is, <tt>*first</tt> is assigned to
|
||||
* <tt>\*result</tt>, and, for each iterator \p i in the range
|
||||
* <tt>[first + 1, last)</tt>, <tt>binary_op(\*i, \*(i - 1))</tt> is assigned to
|
||||
* <tt>\*(result + (i - first))</tt>.
|
||||
*
|
||||
* This version of \p adjacent_difference uses the binary function \p binary_op to
|
||||
* calculate differences.
|
||||
*
|
||||
* \param first The beginning of the input range.
|
||||
* \param last The end of the input range.
|
||||
* \param result The beginning of the output range.
|
||||
* \param binary_op The binary function used to compute differences.
|
||||
* \return The iterator <tt>result + (last - first)</tt>
|
||||
*
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
|
||||
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
* \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
|
||||
*
|
||||
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
|
||||
* useful for computing differences "in place".
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p adjacent_difference to compute
|
||||
* the sum between adjacent elements of a range.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/adjacent_difference.h>
|
||||
* #include <thrust/functional.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
|
||||
* thrust::device_vector<int> d_data(h_data, h_data + 8);
|
||||
* thrust::device_vector<int> d_result(8);
|
||||
*
|
||||
* thrust::adjacent_difference(d_data.begin(), d_data.end(), d_result.begin(), thrust::plus<int>());
|
||||
*
|
||||
* // d_data is now [1, 3, 3, 3, 3, 3, 3, 3]
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
|
||||
* \see inclusive_scan
|
||||
*/
|
||||
template <typename InputIterator, typename OutputIterator, typename BinaryFunction>
|
||||
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
|
||||
OutputIterator result,
|
||||
BinaryFunction binary_op);
|
||||
|
||||
/*! \}
|
||||
*/
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
#include <thrust/detail/adjacent_difference.inl>
|
||||
|
||||
@@ -0,0 +1,73 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file advance.h
|
||||
* \brief Advance an iterator by a given distance.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
/*! \addtogroup iterators
|
||||
* \{
|
||||
*/
|
||||
|
||||
/*! \p advance(i, n) increments the iterator \p i by the distance \p n.
|
||||
* If <tt>n > 0</tt> it is equivalent to executing <tt>++i</tt> \p n
|
||||
* times, and if <tt>n < 0</tt> it is equivalent to executing <tt>--i</tt>
|
||||
* \p n times. If <tt>n == 0</tt>, the call has no effect.
|
||||
*
|
||||
* \param i The iterator to be advanced.
|
||||
* \param n The distance by which to advance the iterator.
|
||||
*
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
|
||||
* \tparam Distance is an integral type that is convertible to \p InputIterator's distance type.
|
||||
*
|
||||
* \pre \p n shall be negative only for bidirectional and random access iterators.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p advance to increment
|
||||
* an iterator a given number of times.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/advance.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* thrust::device_vector<int> vec(13);
|
||||
* thrust::device_vector<int>::iterator iter = vec.begin();
|
||||
*
|
||||
* thrust::advance(iter, 7);
|
||||
*
|
||||
* // iter - vec.begin() == 7
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/advance.html
|
||||
*/
|
||||
template <typename InputIterator, typename Distance>
|
||||
void advance(InputIterator& i, Distance n);
|
||||
|
||||
/*! \} // end iterators
|
||||
*/
|
||||
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/advance.inl>
|
||||
|
||||
File diff suppressed because it is too large.
Load diff
@@ -0,0 +1,505 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file copy.h
|
||||
* \brief Copies elements from one range to another
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
/*! \addtogroup algorithms
|
||||
*/
|
||||
|
||||
/*! \addtogroup copying
|
||||
* \ingroup algorithms
|
||||
* \{
|
||||
*/
|
||||
|
||||
|
||||
/*! \p copy copies elements from the range [\p first, \p last) to the range
|
||||
* [\p result, \p result + (\p last - \p first)). That is, it performs
|
||||
* the assignments *\p result = *\p first, *(\p result + \c 1) = *(\p first + \c 1),
|
||||
* and so on. Generally, for every integer \c n from \c 0 to \p last - \p first, \p copy
|
||||
* performs the assignment *(\p result + \c n) = *(\p first + \c n). Unlike
|
||||
* \c std::copy, \p copy offers no guarantee on order of operation. As a result,
|
||||
* calling \p copy with overlapping source and destination ranges has undefined
|
||||
* behavior.
|
||||
*
|
||||
* The return value is \p result + (\p last - \p first).
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the sequence to copy.
|
||||
* \param last The end of the sequence to copy.
|
||||
* \param result The destination sequence.
|
||||
* \return The end of the destination sequence.
|
||||
* \see http://www.sgi.com/tech/stl/copy.html
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c OutputIterator's \c value_type.
|
||||
* \tparam OutputIterator must be a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \pre \p result may be equal to \p first, but \p result shall not be in the range <tt>[first, last)</tt> otherwise.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy
|
||||
* to copy from one range to another using the \p thrust::device parallelization policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
*
|
||||
* thrust::device_vector<int> vec0(100);
|
||||
* thrust::device_vector<int> vec1(100);
|
||||
* ...
|
||||
*
|
||||
* thrust::copy(thrust::device, vec0.begin(), vec0.end(), vec1.begin());
|
||||
*
|
||||
* // vec1 is now a copy of vec0
|
||||
* \endcode
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
|
||||
/*! \p copy_n copies elements from the range <tt>[first, first + n)</tt> to the range
|
||||
* <tt>[result, result + n)</tt>. That is, it performs the assignments <tt>*result = *first, *(result + 1) = *(first + 1)</tt>,
|
||||
* and so on. Generally, for every integer \c i from \c 0 to \c n, \p copy
|
||||
* performs the assignment *(\p result + \c i) = *(\p first + \c i). Unlike
|
||||
* \c std::copy_n, \p copy_n offers no guarantee on order of operation. As a result,
|
||||
* calling \p copy_n with overlapping source and destination ranges has undefined
|
||||
* behavior.
|
||||
*
|
||||
* The return value is \p result + \p n.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the range to copy.
|
||||
* \param n The number of elements to copy.
|
||||
* \param result The beginning destination range.
|
||||
* \return The end of the destination range.
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c OutputIterator's \c value_type.
|
||||
* \tparam Size is an integral type.
|
||||
* \tparam OutputIterator must be a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \pre \p result may be equal to \p first, but \p result shall not be in the range <tt>[first, first + n)</tt> otherwise.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy
|
||||
* to copy from one range to another using the \p thrust::device parallelization policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* size_t n = 100;
|
||||
* thrust::device_vector<int> vec0(n);
|
||||
* thrust::device_vector<int> vec1(n);
|
||||
* ...
|
||||
* thrust::copy_n(thrust::device, vec0.begin(), n, vec1.begin());
|
||||
*
|
||||
* // vec1 is now a copy of vec0
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/copy_n.html
|
||||
* \see thrust::copy
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename Size, typename OutputIterator>
|
||||
OutputIterator copy_n(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result);
|
||||
|
||||
|
||||
|
||||
/*! \p copy copies elements from the range [\p first, \p last) to the range
|
||||
* [\p result, \p result + (\p last - \p first)). That is, it performs
|
||||
* the assignments *\p result = *\p first, *(\p result + \c 1) = *(\p first + \c 1),
|
||||
* and so on. Generally, for every integer \c n from \c 0 to \p last - \p first, \p copy
|
||||
* performs the assignment *(\p result + \c n) = *(\p first + \c n). Unlike
|
||||
* \c std::copy, \p copy offers no guarantee on order of operation. As a result,
|
||||
* calling \p copy with overlapping source and destination ranges has undefined
|
||||
* behavior.
|
||||
*
|
||||
* The return value is \p result + (\p last - \p first).
|
||||
*
|
||||
* \param first The beginning of the sequence to copy.
|
||||
* \param last The end of the sequence to copy.
|
||||
* \param result The destination sequence.
|
||||
* \return The end of the destination sequence.
|
||||
* \see http://www.sgi.com/tech/stl/copy.html
|
||||
*
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c OutputIterator's \c value_type.
|
||||
* \tparam OutputIterator must be a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \pre \p result may be equal to \p first, but \p result shall not be in the range <tt>[first, last)</tt> otherwise.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy
|
||||
* to copy from one range to another.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
*
|
||||
* thrust::device_vector<int> vec0(100);
|
||||
* thrust::device_vector<int> vec1(100);
|
||||
* ...
|
||||
*
|
||||
* thrust::copy(vec0.begin(), vec0.end(),
|
||||
* vec1.begin());
|
||||
*
|
||||
* // vec1 is now a copy of vec0
|
||||
* \endcode
|
||||
*/
|
||||
template<typename InputIterator, typename OutputIterator>
|
||||
OutputIterator copy(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
/*! \p copy_n copies elements from the range <tt>[first, first + n)</tt> to the range
|
||||
* <tt>[result, result + n)</tt>. That is, it performs the assignments <tt>*result = *first, *(result + 1) = *(first + 1)</tt>,
|
||||
* and so on. Generally, for every integer \c i from \c 0 to \c n, \p copy
|
||||
* performs the assignment *(\p result + \c i) = *(\p first + \c i). Unlike
|
||||
* \c std::copy_n, \p copy_n offers no guarantee on order of operation. As a result,
|
||||
* calling \p copy_n with overlapping source and destination ranges has undefined
|
||||
* behavior.
|
||||
*
|
||||
* The return value is \p result + \p n.
|
||||
*
|
||||
* \param first The beginning of the range to copy.
|
||||
* \param n The number of elements to copy.
|
||||
* \param result The beginning destination range.
|
||||
* \return The end of the destination range.
|
||||
*
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c OutputIterator's \c value_type.
|
||||
* \tparam Size is an integral type.
|
||||
* \tparam OutputIterator must be a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
*
|
||||
* \pre \p result may be equal to \p first, but \p result shall not be in the range <tt>[first, first + n)</tt> otherwise.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy
|
||||
* to copy from one range to another.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* size_t n = 100;
|
||||
* thrust::device_vector<int> vec0(n);
|
||||
* thrust::device_vector<int> vec1(n);
|
||||
* ...
|
||||
* thrust::copy_n(vec0.begin(), n, vec1.begin());
|
||||
*
|
||||
* // vec1 is now a copy of vec0
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/copy_n.html
|
||||
* \see thrust::copy
|
||||
*/
|
||||
template<typename InputIterator, typename Size, typename OutputIterator>
|
||||
OutputIterator copy_n(InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result);
|
||||
|
||||
/*! \} // end copying
|
||||
*/
|
||||
|
||||
/*! \addtogroup stream_compaction
|
||||
* \{
|
||||
*/
|
||||
|
||||
|
||||
/*! This version of \p copy_if copies elements from the range <tt>[first,last)</tt>
|
||||
* to a range beginning at \ presult, except that any element which causes \p pred
|
||||
* to be \p pred to be \c false is not copied.
|
||||
*
|
||||
* More precisely, for every integer \c n such that <tt>0 <= n < last-first</tt>,
|
||||
* \p copy_if performs the assignment <tt>*result = *(first+n)</tt> and \p result
|
||||
* is advanced one position if <tt>pred(*(first+n))</tt>. Otherwise, no assignment
|
||||
* occurs and \p result is not advanced.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p system.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the sequence from which to copy.
|
||||
* \param last The end of the sequence from which to copy.
|
||||
* \param result The beginning of the sequence into which to copy.
|
||||
* \param pred The predicate to test on every value of the range <tt>[first, last)</tt>.
|
||||
* \return <tt>result + n</tt>, where \c n is equal to the number of times \p pred
|
||||
* evaluated to \c true in the range <tt>[first, last)</tt>.
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* \pre The ranges <tt>[first, last)</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy_if to perform stream compaction
|
||||
* to copy even numbers to an output range using the \p thrust::host parallelization policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* struct is_even
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(const int x)
|
||||
* {
|
||||
* return (x % 2) == 0;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* const int N = 6;
|
||||
* int V[N] = {-2, 0, -1, 0, 1, 2};
|
||||
* int result[4];
|
||||
*
|
||||
* thrust::copy_if(thrust::host, V, V + N, result, is_even());
|
||||
*
|
||||
* // V remains {-2, 0, -1, 0, 1, 2}
|
||||
* // result is now {-2, 0, 0, 2}
|
||||
* \endcode
|
||||
*
|
||||
* \see \c remove_copy_if
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator, typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
|
||||
|
||||
/*! This version of \p copy_if copies elements from the range <tt>[first,last)</tt>
|
||||
* to a range beginning at \ presult, except that any element which causes \p pred
|
||||
* to be \p pred to be \c false is not copied.
|
||||
*
|
||||
* More precisely, for every integer \c n such that <tt>0 <= n < last-first</tt>,
|
||||
* \p copy_if performs the assignment <tt>*result = *(first+n)</tt> and \p result
|
||||
* is advanced one position if <tt>pred(*(first+n))</tt>. Otherwise, no assignment
|
||||
* occurs and \p result is not advanced.
|
||||
*
|
||||
* \param first The beginning of the sequence from which to copy.
|
||||
* \param last The end of the sequence from which to copy.
|
||||
* \param result The beginning of the sequence into which to copy.
|
||||
* \param pred The predicate to test on every value of the range <tt>[first, last)</tt>.
|
||||
* \return <tt>result + n</tt>, where \c n is equal to the number of times \p pred
|
||||
* evaluated to \c true in the range <tt>[first, last)</tt>.
|
||||
*
|
||||
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator's \c value_type is convertible to \p Predicate's \c argument_type.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
|
||||
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* \pre The ranges <tt>[first, last)</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy_if to perform stream compaction
|
||||
* to copy even numbers to an output range.
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* ...
|
||||
* struct is_even
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(const int x)
|
||||
* {
|
||||
* return (x % 2) == 0;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* const int N = 6;
|
||||
* int V[N] = {-2, 0, -1, 0, 1, 2};
|
||||
* int result[4];
|
||||
*
|
||||
* thrust::copy_if(V, V + N, result, is_even());
|
||||
*
|
||||
* // V remains {-2, 0, -1, 0, 1, 2}
|
||||
* // result is now {-2, 0, 0, 2}
|
||||
* \endcode
|
||||
*
|
||||
* \see \c remove_copy_if
|
||||
*/
|
||||
template<typename InputIterator,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
|
||||
/*! This version of \p copy_if copies elements from the range <tt>[first,last)</tt>
|
||||
* to a range beginning at \p result, except that any element whose corresponding stencil
|
||||
* element causes \p pred to be \c false is not copied.
|
||||
*
|
||||
* More precisely, for every integer \c n such that <tt>0 <= n < last-first</tt>,
|
||||
* \p copy_if performs the assignment <tt>*result = *(first+n)</tt> and \p result
|
||||
* is advanced one position if <tt>pred(*(stencil+n))</tt>. Otherwise, no assignment
|
||||
* occurs and \p result is not advanced.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the sequence from which to copy.
|
||||
* \param last The end of the sequence from which to copy.
|
||||
* \param stencil The beginning of the stencil sequence.
|
||||
* \param result The beginning of the sequence into which to copy.
|
||||
* \param pred The predicate to test on every value of the range <tt>[stencil, stencil + (last-first))</tt>.
|
||||
* \return <tt>result + n</tt>, where \c n is equal to the number of times \p pred
|
||||
* evaluated to \c true in the range <tt>[stencil, stencil + (last-first))</tt>.
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
|
||||
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator">Output Iterator</a>.
|
||||
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* \pre The ranges <tt>[first, last)</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
* \pre The ranges <tt>[stencil, stencil + (last - first))</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy_if to perform stream compaction
|
||||
* to copy numbers to an output range when corresponding stencil elements are even using the \p thrust::host execution policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* struct is_even
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(const int x)
|
||||
* {
|
||||
* return (x % 2) == 0;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* int N = 6;
|
||||
* int data[N] = { 0, 1, 2, 3, 4, 5};
|
||||
* int stencil[N] = {-2, 0, -1, 0, 1, 2};
|
||||
* int result[4];
|
||||
*
|
||||
* thrust::copy_if(thrust::host, data, data + N, stencil, result, is_even());
|
||||
*
|
||||
* // data remains = { 0, 1, 2, 3, 4, 5};
|
||||
* // stencil remains = {-2, 0, -1, 0, 1, 2};
|
||||
* // result is now { 0, 1, 3, 5}
|
||||
* \endcode
|
||||
*
|
||||
* \see \c remove_copy_if
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
|
||||
/*! This version of \p copy_if copies elements from the range <tt>[first,last)</tt>
|
||||
* to a range beginning at \p result, except that any element whose corresponding stencil
|
||||
* element causes \p pred to be \c false is not copied.
|
||||
*
|
||||
* More precisely, for every integer \c n such that <tt>0 <= n < last-first</tt>,
|
||||
* \p copy_if performs the assignment <tt>*result = *(first+n)</tt> and \p result
|
||||
* is advanced one position if <tt>pred(*(stencil+n))</tt>. Otherwise, no assignment
|
||||
* occurs and \p result is not advanced.
|
||||
*
|
||||
* \param first The beginning of the sequence from which to copy.
|
||||
* \param last The end of the sequence from which to copy.
|
||||
* \param stencil The beginning of the stencil sequence.
|
||||
* \param result The beginning of the sequence into which to copy.
|
||||
* \param pred The predicate to test on every value of the range <tt>[stencil, stencil + (last-first))</tt>.
|
||||
* \return <tt>result + n</tt>, where \c n is equal to the number of times \p pred
|
||||
* evaluated to \c true in the range <tt>[stencil, stencil + (last-first))</tt>.
|
||||
*
|
||||
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
|
||||
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
|
||||
* and \p InputIterator2's \c value_type is convertible to \p Predicate's \c argument_type.
|
||||
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator">Output Iterator</a>.
|
||||
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* \pre The ranges <tt>[first, last)</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
* \pre The ranges <tt>[stencil, stencil + (last - first))</tt> and <tt>[result, result + (last - first))</tt> shall not overlap.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p copy_if to perform stream compaction
|
||||
* to copy numbers to an output range when corresponding stencil elements are even:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/copy.h>
|
||||
* ...
|
||||
* struct is_even
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(const int x)
|
||||
* {
|
||||
* return (x % 2) == 0;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* int N = 6;
|
||||
* int data[N] = { 0, 1, 2, 3, 4, 5};
|
||||
* int stencil[N] = {-2, 0, -1, 0, 1, 2};
|
||||
* int result[4];
|
||||
*
|
||||
* thrust::copy_if(data, data + N, stencil, result, is_even());
|
||||
*
|
||||
* // data remains = { 0, 1, 2, 3, 4, 5};
|
||||
* // stencil remains = {-2, 0, -1, 0, 1, 2};
|
||||
* // result is now { 0, 1, 3, 5}
|
||||
* \endcode
|
||||
*
|
||||
* \see \c remove_copy_if
|
||||
*/
|
||||
template<typename InputIterator1,
|
||||
typename InputIterator2,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
/*! \} // end stream_compaction
|
||||
*/
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
#include <thrust/detail/copy.h>
|
||||
#include <thrust/detail/copy_if.h>
|
||||
|
||||
@@ -0,0 +1,231 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file count.h
|
||||
* \brief Counting elements in a range
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
/*! \addtogroup algorithms
|
||||
*/
|
||||
|
||||
/*! \addtogroup reductions
|
||||
* \ingroup algorithms
|
||||
* \{
|
||||
*/
|
||||
|
||||
/*! \addtogroup counting
|
||||
* \ingroup reductions
|
||||
* \{
|
||||
*/
|
||||
|
||||
|
||||
/*! \p count finds the number of elements in <tt>[first,last)</tt> that are equal
|
||||
* to \p value. More precisely, \p count returns the number of iterators \c i in
|
||||
* <tt>[first, last)</tt> such that <tt>*i == value</tt>.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the sequence.
|
||||
* \param last The end of the sequence.
|
||||
* \param value The value to be counted.
|
||||
* \return The number of elements equal to \p value.
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be a model of must be a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||||
* \tparam EqualityComparable must be a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a> and can be compared for equality with \c InputIterator's \c value_type
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p count to
|
||||
* count the number of instances in a range of a value of interest using the \p thrust::device execution policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/count.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* // put 3 1s in a device_vector
|
||||
* thrust::device_vector<int> vec(5,0);
|
||||
* vec[1] = 1;
|
||||
* vec[3] = 1;
|
||||
* vec[4] = 1;
|
||||
*
|
||||
* // count the 1s
|
||||
* int result = thrust::count(thrust::device, vec.begin(), vec.end(), 1);
|
||||
* // result == 3
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/count.html
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename EqualityComparable>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, InputIterator first, InputIterator last, const EqualityComparable& value);
|
||||
|
||||
|
||||
|
||||
/*! \p count finds the number of elements in <tt>[first,last)</tt> that are equal
|
||||
* to \p value. More precisely, \p count returns the number of iterators \c i in
|
||||
* <tt>[first, last)</tt> such that <tt>*i == value</tt>.
|
||||
*
|
||||
* \param first The beginning of the sequence.
|
||||
* \param last The end of the sequence.
|
||||
* \param value The value to be counted.
|
||||
* \return The number of elements equal to \p value.
|
||||
*
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be a model of must be a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||||
* \tparam EqualityComparable must be a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a> and can be compared for equality with \c InputIterator's \c value_type
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p count to
|
||||
* count the number of instances in a range of a value of interest.
|
||||
* \code
|
||||
* #include <thrust/count.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* // put 3 1s in a device_vector
|
||||
* thrust::device_vector<int> vec(5,0);
|
||||
* vec[1] = 1;
|
||||
* vec[3] = 1;
|
||||
* vec[4] = 1;
|
||||
*
|
||||
* // count the 1s
|
||||
* int result = thrust::count(vec.begin(), vec.end(), 1);
|
||||
* // result == 3
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/count.html
|
||||
*/
|
||||
template <typename InputIterator, typename EqualityComparable>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count(InputIterator first, InputIterator last, const EqualityComparable& value);
|
||||
|
||||
|
||||
/*! \p count_if finds the number of elements in <tt>[first,last)</tt> for which
|
||||
* a predicate is \c true. More precisely, \p count_if returns the number of iterators
|
||||
* \c i in <tt>[first, last)</tt> such that <tt>pred(*i) == true</tt>.
|
||||
*
|
||||
* The algorithm's execution is parallelized as determined by \p exec.
|
||||
*
|
||||
* \param exec The execution policy to use for parallelization.
|
||||
* \param first The beginning of the sequence.
|
||||
* \param last The end of the sequence.
|
||||
* \param pred The predicate.
|
||||
* \return The number of elements where \p pred is \c true.
|
||||
*
|
||||
* \tparam DerivedPolicy The name of the derived execution policy.
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c Predicate's \c argument_type.
|
||||
* \tparam Predicate must be a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p count to
|
||||
* count the number of odd numbers in a range using the \p thrust::device execution policy:
|
||||
*
|
||||
* \code
|
||||
* #include <thrust/count.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* #include <thrust/execution_policy.h>
|
||||
* ...
|
||||
* struct is_odd
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(int &x)
|
||||
* {
|
||||
* return x & 1;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* // fill a device_vector with even & odd numbers
|
||||
* thrust::device_vector<int> vec(5);
|
||||
* vec[0] = 0;
|
||||
* vec[1] = 1;
|
||||
* vec[2] = 2;
|
||||
* vec[3] = 3;
|
||||
* vec[4] = 4;
|
||||
*
|
||||
* // count the odd elements in vec
|
||||
* int result = thrust::count_if(thrust::device, vec.begin(), vec.end(), is_odd());
|
||||
* // result == 2
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/count.html
|
||||
*/
|
||||
template<typename DerivedPolicy, typename InputIterator, typename Predicate>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, InputIterator first, InputIterator last, Predicate pred);
|
||||
|
||||
|
||||
/*! \p count_if finds the number of elements in <tt>[first,last)</tt> for which
|
||||
* a predicate is \c true. More precisely, \p count_if returns the number of iterators
|
||||
* \c i in <tt>[first, last)</tt> such that <tt>pred(*i) == true</tt>.
|
||||
*
|
||||
* \param first The beginning of the sequence.
|
||||
* \param last The end of the sequence.
|
||||
* \param pred The predicate.
|
||||
* \return The number of elements where \p pred is \c true.
|
||||
*
|
||||
* \tparam InputIterator must be a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a> and \c InputIterator's \c value_type must be convertible to \c Predicate's \c argument_type.
|
||||
* \tparam Predicate must be a model of <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>.
|
||||
*
|
||||
* The following code snippet demonstrates how to use \p count to
|
||||
* count the number of odd numbers in a range.
|
||||
* \code
|
||||
* #include <thrust/count.h>
|
||||
* #include <thrust/device_vector.h>
|
||||
* ...
|
||||
* struct is_odd
|
||||
* {
|
||||
* __host__ __device__
|
||||
* bool operator()(int &x)
|
||||
* {
|
||||
* return x & 1;
|
||||
* }
|
||||
* };
|
||||
* ...
|
||||
* // fill a device_vector with even & odd numbers
|
||||
* thrust::device_vector<int> vec(5);
|
||||
* vec[0] = 0;
|
||||
* vec[1] = 1;
|
||||
* vec[2] = 2;
|
||||
* vec[3] = 3;
|
||||
* vec[4] = 4;
|
||||
*
|
||||
* // count the odd elements in vec
|
||||
* int result = thrust::count_if(vec.begin(), vec.end(), is_odd());
|
||||
* // result == 2
|
||||
* \endcode
|
||||
*
|
||||
* \see http://www.sgi.com/tech/stl/count.html
|
||||
*/
|
||||
template <typename InputIterator, typename Predicate>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count_if(InputIterator first, InputIterator last, Predicate pred);
|
||||
|
||||
/*! \} // end counting
|
||||
* \} // end reductions
|
||||
*/
|
||||
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/count.inl>
|
||||
|
||||
@@ -0,0 +1,88 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file adjacent_difference.inl
|
||||
* \brief Inline file for adjacent_difference.h
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/adjacent_difference.h>
|
||||
#include <thrust/system/detail/adl/adjacent_difference.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first, InputIterator last,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::adjacent_difference;
|
||||
|
||||
return adjacent_difference(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, result);
|
||||
} // end adjacent_difference()
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename InputIterator, typename OutputIterator, typename BinaryFunction>
|
||||
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first, InputIterator last,
|
||||
OutputIterator result,
|
||||
BinaryFunction binary_op)
|
||||
{
|
||||
using thrust::system::detail::generic::adjacent_difference;
|
||||
|
||||
return adjacent_difference(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, result, binary_op);
|
||||
} // end adjacent_difference()
|
||||
|
||||
|
||||
template <typename InputIterator, typename OutputIterator>
|
||||
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::adjacent_difference(select_system(system1, system2), first, last, result);
|
||||
} // end adjacent_difference()
|
||||
|
||||
|
||||
template <typename InputIterator, typename OutputIterator, typename BinaryFunction>
|
||||
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
|
||||
OutputIterator result,
|
||||
BinaryFunction binary_op)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::adjacent_difference(select_system(system1, system2), first, last, result, binary_op);
|
||||
} // end adjacent_difference()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,38 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file advance.inl
|
||||
* \brief Inline file for advance.h
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/advance.h>
|
||||
#include <thrust/system/detail/generic/advance.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template <typename InputIterator, typename Distance>
|
||||
void advance(InputIterator& i, Distance n)
|
||||
{
|
||||
thrust::system::detail::generic::advance(i, n);
|
||||
} // end advance()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,240 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/detail/type_traits/has_nested_type.h>
|
||||
#include <thrust/detail/type_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_pointer, pointer)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_const_pointer, const_pointer)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_reference, reference)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_const_reference, const_reference)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_void_pointer, void_pointer)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_const_void_pointer, const_void_pointer)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_difference_type, difference_type)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_size_type, size_type)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_propagate_on_container_copy_assignment, propagate_on_container_copy_assignment)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_propagate_on_container_move_assignment, propagate_on_container_move_assignment)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_propagate_on_container_swap, propagate_on_container_swap)
|
||||
__THRUST_DEFINE_HAS_NESTED_TYPE(has_system_type, system_type)
|
||||
|
||||
template<typename T>
|
||||
struct nested_pointer
|
||||
{
|
||||
typedef typename T::pointer type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_const_pointer
|
||||
{
|
||||
typedef typename T::const_pointer type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_reference
|
||||
{
|
||||
typedef typename T::reference type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_const_reference
|
||||
{
|
||||
typedef typename T::const_reference type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_void_pointer
|
||||
{
|
||||
typedef typename T::void_pointer type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_const_void_pointer
|
||||
{
|
||||
typedef typename T::const_void_pointer type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_difference_type
|
||||
{
|
||||
typedef typename T::difference_type type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_size_type
|
||||
{
|
||||
typedef typename T::size_type type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_propagate_on_container_copy_assignment
|
||||
{
|
||||
typedef typename T::propagate_on_container_copy_assignment type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_propagate_on_container_move_assignment
|
||||
{
|
||||
typedef typename T::propagate_on_container_move_assignment type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_propagate_on_container_swap
|
||||
{
|
||||
typedef typename T::propagate_on_container_swap type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct nested_system_type
|
||||
{
|
||||
typedef typename T::system_type type;
|
||||
};
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename Alloc>
|
||||
struct allocator_traits
|
||||
{
|
||||
typedef Alloc allocator_type;
|
||||
|
||||
typedef typename allocator_type::value_type value_type;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_pointer<allocator_type>::value,
|
||||
allocator_traits_detail::nested_pointer<allocator_type>,
|
||||
identity_<value_type*>
|
||||
>::type pointer;
|
||||
|
||||
private:
|
||||
template<typename T>
|
||||
struct rebind_pointer
|
||||
{
|
||||
typedef typename pointer_traits<pointer>::template rebind<T>::other type;
|
||||
};
|
||||
|
||||
public:
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_const_pointer<allocator_type>::value,
|
||||
allocator_traits_detail::nested_const_pointer<allocator_type>,
|
||||
rebind_pointer<const value_type>
|
||||
>::type const_pointer;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_void_pointer<allocator_type>::value,
|
||||
allocator_traits_detail::nested_void_pointer<allocator_type>,
|
||||
rebind_pointer<void>
|
||||
>::type void_pointer;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_const_void_pointer<allocator_type>::value,
|
||||
allocator_traits_detail::nested_const_void_pointer<allocator_type>,
|
||||
rebind_pointer<const void>
|
||||
>::type const_void_pointer;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_difference_type<allocator_type>::value,
|
||||
allocator_traits_detail::nested_difference_type<allocator_type>,
|
||||
pointer_difference<pointer>
|
||||
>::type difference_type;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_size_type<allocator_type>::value,
|
||||
allocator_traits_detail::nested_size_type<allocator_type>,
|
||||
make_unsigned<difference_type>
|
||||
>::type size_type;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_propagate_on_container_copy_assignment<allocator_type>::value,
|
||||
allocator_traits_detail::nested_propagate_on_container_copy_assignment<allocator_type>,
|
||||
identity_<false_type>
|
||||
>::type propagate_on_container_copy_assignment;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_propagate_on_container_move_assignment<allocator_type>::value,
|
||||
allocator_traits_detail::nested_propagate_on_container_move_assignment<allocator_type>,
|
||||
identity_<false_type>
|
||||
>::type propagate_on_container_move_assignment;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_propagate_on_container_swap<allocator_type>::value,
|
||||
allocator_traits_detail::nested_propagate_on_container_swap<allocator_type>,
|
||||
identity_<false_type>
|
||||
>::type propagate_on_container_swap;
|
||||
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_system_type<allocator_type>::value,
|
||||
allocator_traits_detail::nested_system_type<allocator_type>,
|
||||
thrust::iterator_system<pointer>
|
||||
>::type system_type;
|
||||
|
||||
// XXX rebind and rebind_traits are alias templates
|
||||
// and so are omitted while c++11 is unavailable
|
||||
|
||||
inline static pointer allocate(allocator_type &a, size_type n);
|
||||
|
||||
inline static pointer allocate(allocator_type &a, size_type n, const_void_pointer hint);
|
||||
|
||||
inline static void deallocate(allocator_type &a, pointer p, size_type n);
|
||||
|
||||
// XXX should probably change T* to pointer below and then relax later
|
||||
|
||||
template<typename T>
|
||||
inline __host__ __device__ static void construct(allocator_type &a, T *p);
|
||||
|
||||
template<typename T, typename Arg1>
|
||||
inline __host__ __device__ static void construct(allocator_type &a, T *p, const Arg1 &arg1);
|
||||
|
||||
template<typename T>
|
||||
inline __host__ __device__ static void destroy(allocator_type &a, T *p);
|
||||
|
||||
inline static size_type max_size(const allocator_type &a);
|
||||
}; // end allocator_traits
|
||||
|
||||
|
||||
// XXX consider moving this non-standard functionality inside allocator_traits
|
||||
template<typename Alloc>
|
||||
struct allocator_system
|
||||
{
|
||||
// the type of the allocator's system
|
||||
typedef typename eval_if<
|
||||
allocator_traits_detail::has_system_type<Alloc>::value,
|
||||
allocator_traits_detail::nested_system_type<Alloc>,
|
||||
thrust::iterator_system<
|
||||
typename allocator_traits<Alloc>::pointer
|
||||
>
|
||||
>::type type;
|
||||
|
||||
inline static type &get(Alloc &a);
|
||||
};
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/allocator_traits.inl>
|
||||
|
||||
@@ -0,0 +1,287 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/type_traits/has_member_function.h>
|
||||
#include <thrust/detail/type_traits/is_call_possible.h>
|
||||
#include <new>
|
||||
#include <limits>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
__THRUST_DEFINE_IS_CALL_POSSIBLE(has_member_allocate_with_hint_impl, allocate)
|
||||
|
||||
template<typename Alloc>
|
||||
class has_member_allocate_with_hint
|
||||
{
|
||||
typedef typename allocator_traits<Alloc>::pointer pointer;
|
||||
typedef typename allocator_traits<Alloc>::size_type size_type;
|
||||
typedef typename allocator_traits<Alloc>::const_void_pointer const_void_pointer;
|
||||
|
||||
public:
|
||||
typedef typename has_member_allocate_with_hint_impl<Alloc, pointer(size_type,const_void_pointer)>::type type;
|
||||
static const bool value = type::value;
|
||||
};
|
||||
|
||||
template<typename Alloc>
|
||||
typename enable_if<
|
||||
has_member_allocate_with_hint<Alloc>::value,
|
||||
typename allocator_traits<Alloc>::pointer
|
||||
>::type
|
||||
allocate(Alloc &a, typename allocator_traits<Alloc>::size_type n, typename allocator_traits<Alloc>::const_void_pointer hint)
|
||||
{
|
||||
return a.allocate(n,hint);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename disable_if<
|
||||
has_member_allocate_with_hint<Alloc>::value,
|
||||
typename allocator_traits<Alloc>::pointer
|
||||
>::type
|
||||
allocate(Alloc &a, typename allocator_traits<Alloc>::size_type n, typename allocator_traits<Alloc>::const_void_pointer)
|
||||
{
|
||||
return a.allocate(n);
|
||||
}
|
||||
|
||||
|
||||
__THRUST_DEFINE_IS_CALL_POSSIBLE(has_member_construct1_impl, construct)
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
struct has_member_construct1
|
||||
: has_member_construct1_impl<Alloc, void(T*)>
|
||||
{};
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
inline __host__ __device__
|
||||
typename enable_if<
|
||||
has_member_construct1<Alloc,T>::value
|
||||
>::type
|
||||
construct(Alloc &a, T *p)
|
||||
{
|
||||
a.construct(p);
|
||||
}
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
inline __host__ __device__
|
||||
typename disable_if<
|
||||
has_member_construct1<Alloc,T>::value
|
||||
>::type
|
||||
construct(Alloc &a, T *p)
|
||||
{
|
||||
::new(static_cast<void*>(p)) T();
|
||||
}
|
||||
|
||||
|
||||
__THRUST_DEFINE_IS_CALL_POSSIBLE(has_member_construct2_impl, construct)
|
||||
|
||||
template<typename Alloc, typename T, typename Arg1>
|
||||
struct has_member_construct2
|
||||
: has_member_construct2_impl<Alloc, void(T*,const Arg1 &)>
|
||||
{};
|
||||
|
||||
template<typename Alloc, typename T, typename Arg1>
|
||||
inline __host__ __device__
|
||||
typename enable_if<
|
||||
has_member_construct2<Alloc,T,Arg1>::value
|
||||
>::type
|
||||
construct(Alloc &a, T *p, const Arg1 &arg1)
|
||||
{
|
||||
a.construct(p,arg1);
|
||||
}
|
||||
|
||||
template<typename Alloc, typename T, typename Arg1>
|
||||
inline __host__ __device__
|
||||
typename disable_if<
|
||||
has_member_construct2<Alloc,T,Arg1>::value
|
||||
>::type
|
||||
construct(Alloc &, T *p, const Arg1 &arg1)
|
||||
{
|
||||
::new(static_cast<void*>(p)) T(arg1);
|
||||
}
|
||||
|
||||
|
||||
__THRUST_DEFINE_IS_CALL_POSSIBLE(has_member_destroy_impl, destroy)
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
struct has_member_destroy
|
||||
: has_member_destroy_impl<Alloc, void(T*)>
|
||||
{};
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
inline __host__ __device__
|
||||
typename enable_if<
|
||||
has_member_destroy<Alloc,T>::value
|
||||
>::type
|
||||
destroy(Alloc &a, T *p)
|
||||
{
|
||||
a.destroy(p);
|
||||
}
|
||||
|
||||
template<typename Alloc, typename T>
|
||||
inline __host__ __device__
|
||||
typename disable_if<
|
||||
has_member_destroy<Alloc,T>::value
|
||||
>::type
|
||||
destroy(Alloc &, T *p)
|
||||
{
|
||||
p->~T();
|
||||
}
|
||||
|
||||
|
||||
__THRUST_DEFINE_IS_CALL_POSSIBLE(has_member_max_size_impl, max_size)
|
||||
|
||||
template<typename Alloc>
|
||||
class has_member_max_size
|
||||
{
|
||||
typedef typename allocator_traits<Alloc>::size_type size_type;
|
||||
|
||||
public:
|
||||
typedef typename has_member_max_size_impl<Alloc, size_type(void)>::type type;
|
||||
static const bool value = type::value;
|
||||
};
|
||||
|
||||
template<typename Alloc>
|
||||
typename enable_if<
|
||||
has_member_max_size<Alloc>::value,
|
||||
typename allocator_traits<Alloc>::size_type
|
||||
>::type
|
||||
max_size(const Alloc &a)
|
||||
{
|
||||
return a.max_size();
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename disable_if<
|
||||
has_member_max_size<Alloc>::value,
|
||||
typename allocator_traits<Alloc>::size_type
|
||||
>::type
|
||||
max_size(const Alloc &a)
|
||||
{
|
||||
typedef typename allocator_traits<Alloc>::size_type size_type;
|
||||
return std::numeric_limits<size_type>::max();
|
||||
}
|
||||
|
||||
__THRUST_DEFINE_HAS_MEMBER_FUNCTION(has_member_system_impl, system)
|
||||
|
||||
template<typename Alloc>
|
||||
class has_member_system
|
||||
{
|
||||
typedef typename allocator_system<Alloc>::type system_type;
|
||||
|
||||
public:
|
||||
typedef typename has_member_system_impl<Alloc, system_type&(void)>::type type;
|
||||
static const bool value = type::value;
|
||||
};
|
||||
|
||||
template<typename Alloc>
|
||||
typename enable_if<
|
||||
has_member_system<Alloc>::value,
|
||||
typename allocator_system<Alloc>::type &
|
||||
>::type
|
||||
system(Alloc &a)
|
||||
{
|
||||
return a.system();
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename disable_if<
|
||||
has_member_system<Alloc>::value,
|
||||
typename allocator_system<Alloc>::type &
|
||||
>::type
|
||||
system(Alloc &a)
|
||||
{
|
||||
// assumes the system is default-constructible
|
||||
static typename allocator_system<Alloc>::type state;
|
||||
return state;
|
||||
}
|
||||
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename Alloc>
|
||||
typename allocator_traits<Alloc>::pointer
|
||||
allocator_traits<Alloc>
|
||||
::allocate(Alloc &a, typename allocator_traits<Alloc>::size_type n)
|
||||
{
|
||||
return a.allocate(n);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename allocator_traits<Alloc>::pointer
|
||||
allocator_traits<Alloc>
|
||||
::allocate(Alloc &a, typename allocator_traits<Alloc>::size_type n, typename allocator_traits<Alloc>::const_void_pointer hint)
|
||||
{
|
||||
return allocator_traits_detail::allocate(a, n, hint);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
void allocator_traits<Alloc>
|
||||
::deallocate(Alloc &a, typename allocator_traits<Alloc>::pointer p, typename allocator_traits<Alloc>::size_type n)
|
||||
{
|
||||
return a.deallocate(p,n);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
template<typename T>
|
||||
void allocator_traits<Alloc>
|
||||
::construct(allocator_type &a, T *p)
|
||||
{
|
||||
return allocator_traits_detail::construct(a,p);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
template<typename T, typename Arg1>
|
||||
void allocator_traits<Alloc>
|
||||
::construct(allocator_type &a, T *p, const Arg1 &arg1)
|
||||
{
|
||||
return allocator_traits_detail::construct(a,p,arg1);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
template<typename T>
|
||||
void allocator_traits<Alloc>
|
||||
::destroy(allocator_type &a, T *p)
|
||||
{
|
||||
return allocator_traits_detail::destroy(a,p);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename allocator_traits<Alloc>::size_type
|
||||
allocator_traits<Alloc>
|
||||
::max_size(const allocator_type &a)
|
||||
{
|
||||
return allocator_traits_detail::max_size(a);
|
||||
}
|
||||
|
||||
template<typename Alloc>
|
||||
typename allocator_system<Alloc>::type &
|
||||
allocator_system<Alloc>
|
||||
::get(Alloc &a)
|
||||
{
|
||||
return allocator_traits_detail::system(a);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,45 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename System, typename Allocator, typename InputIterator, typename Pointer>
|
||||
Pointer copy_construct_range(thrust::execution_policy<System> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result);
|
||||
|
||||
template<typename System, typename Allocator, typename InputIterator, typename Size, typename Pointer>
|
||||
Pointer copy_construct_range_n(thrust::execution_policy<System> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result);
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/copy_construct_range.inl>
|
||||
|
||||
@@ -0,0 +1,298 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/detail/copy.h>
|
||||
#include <thrust/tuple.h>
|
||||
#include <thrust/advance.h>
|
||||
#include <thrust/distance.h>
|
||||
#include <thrust/iterator/zip_iterator.h>
|
||||
#include <thrust/for_each.h>
|
||||
#include <memory>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
|
||||
template<typename Allocator, typename InputType, typename OutputType>
|
||||
struct copy_construct_with_allocator
|
||||
{
|
||||
Allocator &a;
|
||||
|
||||
copy_construct_with_allocator(Allocator &a)
|
||||
: a(a)
|
||||
{}
|
||||
|
||||
template<typename Tuple>
|
||||
inline __host__ __device__
|
||||
void operator()(Tuple t)
|
||||
{
|
||||
const InputType &in = thrust::get<0>(t);
|
||||
OutputType &out = thrust::get<1>(t);
|
||||
|
||||
allocator_traits<Allocator>::construct(a, &out, in);
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
template<typename Allocator, typename T>
|
||||
struct needs_copy_construct_via_allocator
|
||||
: has_member_construct2<
|
||||
Allocator,
|
||||
T,
|
||||
T
|
||||
>
|
||||
{};
|
||||
|
||||
|
||||
// we know that std::allocator::construct's only effect is to call T's
|
||||
// copy constructor, so we needn't use it for copy construction
|
||||
template<typename U, typename T>
|
||||
struct needs_copy_construct_via_allocator<std::allocator<U>, T>
|
||||
: thrust::detail::false_type
|
||||
{};
|
||||
|
||||
|
||||
// XXX it's regrettable that this implementation is copied almost
|
||||
// exactly from system::detail::generic::uninitialized_copy
|
||||
// perhaps generic::uninitialized_copy could call this routine
|
||||
// with a default allocator
|
||||
template<typename Allocator, typename FromSystem, typename ToSystem, typename InputIterator, typename Pointer>
|
||||
typename enable_if_convertible<
|
||||
FromSystem,
|
||||
ToSystem,
|
||||
Pointer
|
||||
>::type
|
||||
uninitialized_copy_with_allocator(Allocator &a,
|
||||
thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &to_system,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result)
|
||||
{
|
||||
// zip up the iterators
|
||||
typedef thrust::tuple<InputIterator,Pointer> IteratorTuple;
|
||||
typedef thrust::zip_iterator<IteratorTuple> ZipIterator;
|
||||
|
||||
ZipIterator begin = thrust::make_zip_iterator(thrust::make_tuple(first,result));
|
||||
ZipIterator end = begin;
|
||||
|
||||
// get a zip_iterator pointing to the end
|
||||
const typename thrust::iterator_difference<InputIterator>::type n = thrust::distance(first,last);
|
||||
thrust::advance(end,n);
|
||||
|
||||
// create a functor
|
||||
typedef typename iterator_traits<InputIterator>::value_type InputType;
|
||||
typedef typename iterator_traits<Pointer>::value_type OutputType;
|
||||
|
||||
// do the for_each
|
||||
// note we use to_system to dispatch the for_each
|
||||
thrust::for_each(to_system, begin, end, copy_construct_with_allocator<Allocator,InputType,OutputType>(a));
|
||||
|
||||
// return the end of the output range
|
||||
return thrust::get<1>(end.get_iterator_tuple());
|
||||
}
|
||||
|
||||
|
||||
// XXX it's regrettable that this implementation is copied almost
|
||||
// exactly from system::detail::generic::uninitialized_copy_n
|
||||
// perhaps generic::uninitialized_copy_n could call this routine
|
||||
// with a default allocator
|
||||
template<typename Allocator, typename FromSystem, typename ToSystem, typename InputIterator, typename Size, typename Pointer>
|
||||
typename enable_if_convertible<
|
||||
FromSystem,
|
||||
ToSystem,
|
||||
Pointer
|
||||
>::type
|
||||
uninitialized_copy_with_allocator_n(Allocator &a,
|
||||
thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &to_system,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result)
|
||||
{
|
||||
// zip up the iterators
|
||||
typedef thrust::tuple<InputIterator,Pointer> IteratorTuple;
|
||||
typedef thrust::zip_iterator<IteratorTuple> ZipIterator;
|
||||
|
||||
ZipIterator begin = thrust::make_zip_iterator(thrust::make_tuple(first,result));
|
||||
|
||||
// create a functor
|
||||
typedef typename iterator_traits<InputIterator>::value_type InputType;
|
||||
typedef typename iterator_traits<Pointer>::value_type OutputType;
|
||||
|
||||
// do the for_each_n
|
||||
// note we use to_system to dispatch the for_each_n
|
||||
ZipIterator end = thrust::for_each_n(to_system, begin, n, copy_construct_with_allocator<Allocator,InputType,OutputType>(a));
|
||||
|
||||
// return the end of the output range
|
||||
return thrust::get<1>(end.get_iterator_tuple());
|
||||
}
|
||||
|
||||
|
||||
template<typename Allocator, typename FromSystem, typename ToSystem, typename InputIterator, typename Pointer>
|
||||
typename disable_if_convertible<
|
||||
FromSystem,
|
||||
ToSystem,
|
||||
Pointer
|
||||
>::type
|
||||
uninitialized_copy_with_allocator(Allocator &,
|
||||
thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &to_system,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result)
|
||||
{
|
||||
// the systems aren't trivially interoperable
|
||||
// just call two_system_copy and hope for the best
|
||||
return thrust::detail::two_system_copy(from_system, to_system, first, last, result);
|
||||
} // end uninitialized_copy_with_allocator()
|
||||
|
||||
|
||||
template<typename Allocator, typename FromSystem, typename ToSystem, typename InputIterator, typename Size, typename Pointer>
|
||||
typename disable_if_convertible<
|
||||
FromSystem,
|
||||
ToSystem,
|
||||
Pointer
|
||||
>::type
|
||||
uninitialized_copy_with_allocator_n(Allocator &,
|
||||
thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &to_system,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result)
|
||||
{
|
||||
// the systems aren't trivially interoperable
|
||||
// just call two_system_copy_n and hope for the best
|
||||
return thrust::detail::two_system_copy_n(from_system, to_system, first, n, result);
|
||||
} // end uninitialized_copy_with_allocator_n()
|
||||
|
||||
|
||||
template<typename FromSystem, typename Allocator, typename InputIterator, typename Pointer>
|
||||
typename disable_if<
|
||||
needs_copy_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value,
|
||||
Pointer
|
||||
>::type
|
||||
copy_construct_range(thrust::execution_policy<FromSystem> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result)
|
||||
{
|
||||
typename allocator_system<Allocator>::type &to_system = allocator_system<Allocator>::get(a);
|
||||
|
||||
// just call two_system_copy
|
||||
return thrust::detail::two_system_copy(from_system, to_system, first, last, result);
|
||||
}
|
||||
|
||||
|
||||
template<typename FromSystem, typename Allocator, typename InputIterator, typename Size, typename Pointer>
|
||||
typename disable_if<
|
||||
needs_copy_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value,
|
||||
Pointer
|
||||
>::type
|
||||
copy_construct_range_n(thrust::execution_policy<FromSystem> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result)
|
||||
{
|
||||
typename allocator_system<Allocator>::type &to_system = allocator_system<Allocator>::get(a);
|
||||
|
||||
// just call two_system_copy_n
|
||||
return thrust::detail::two_system_copy_n(from_system, to_system, first, n, result);
|
||||
}
|
||||
|
||||
|
||||
template<typename FromSystem, typename Allocator, typename InputIterator, typename Pointer>
|
||||
typename enable_if<
|
||||
needs_copy_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value,
|
||||
Pointer
|
||||
>::type
|
||||
copy_construct_range(thrust::execution_policy<FromSystem> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result)
|
||||
{
|
||||
typename allocator_system<Allocator>::type &to_system = allocator_system<Allocator>::get(a);
|
||||
return uninitialized_copy_with_allocator(a, from_system, to_system, first, last, result);
|
||||
}
|
||||
|
||||
|
||||
template<typename FromSystem, typename Allocator, typename InputIterator, typename Size, typename Pointer>
|
||||
typename enable_if<
|
||||
needs_copy_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value,
|
||||
Pointer
|
||||
>::type
|
||||
copy_construct_range_n(thrust::execution_policy<FromSystem> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result)
|
||||
{
|
||||
typename allocator_system<Allocator>::type &to_system = allocator_system<Allocator>::get(a);
|
||||
return uninitialized_copy_with_allocator_n(a, from_system, to_system, first, n, result);
|
||||
}
|
||||
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename System, typename Allocator, typename InputIterator, typename Pointer>
|
||||
Pointer copy_construct_range(thrust::execution_policy<System> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
Pointer result)
|
||||
{
|
||||
return allocator_traits_detail::copy_construct_range(from_system, a, first, last, result);
|
||||
}
|
||||
|
||||
|
||||
template<typename System, typename Allocator, typename InputIterator, typename Size, typename Pointer>
|
||||
Pointer copy_construct_range_n(thrust::execution_policy<System> &from_system,
|
||||
Allocator &a,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
Pointer result)
|
||||
{
|
||||
return allocator_traits_detail::copy_construct_range_n(from_system, a, first, n, result);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,36 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
inline void default_construct_range(Allocator &a, Pointer p, Size n);
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/default_construct_range.inl>
|
||||
|
||||
|
||||
@@ -0,0 +1,105 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/type_traits.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/for_each.h>
|
||||
#include <thrust/uninitialized_fill.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
|
||||
template<typename Allocator>
|
||||
struct construct1_via_allocator
|
||||
{
|
||||
Allocator &a;
|
||||
|
||||
construct1_via_allocator(Allocator &a)
|
||||
: a(a)
|
||||
{}
|
||||
|
||||
template<typename T>
|
||||
inline __host__ __device__
|
||||
void operator()(T &x)
|
||||
{
|
||||
allocator_traits<Allocator>::construct(a, &x);
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
template<typename Allocator, typename T>
|
||||
struct needs_default_construct_via_allocator
|
||||
: has_member_construct1<
|
||||
Allocator,
|
||||
T
|
||||
>
|
||||
{};
|
||||
|
||||
|
||||
// we know that std::allocator::construct's only effect is to call T's
|
||||
// default constructor, so we needn't use it for default construction
|
||||
template<typename U, typename T>
|
||||
struct needs_default_construct_via_allocator<std::allocator<U>, T>
|
||||
: thrust::detail::false_type
|
||||
{};
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
typename enable_if<
|
||||
needs_default_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value
|
||||
>::type
|
||||
default_construct_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
thrust::for_each_n(allocator_system<Allocator>::get(a), p, n, construct1_via_allocator<Allocator>(a));
|
||||
}
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
typename disable_if<
|
||||
needs_default_construct_via_allocator<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value
|
||||
>::type
|
||||
default_construct_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
thrust::uninitialized_fill_n(allocator_system<Allocator>::get(a), p, n, typename pointer_element<Pointer>::type());
|
||||
}
|
||||
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
void default_construct_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
return allocator_traits_detail::default_construct_range(a,p,n);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,33 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
inline void destroy_range(Allocator &a, Pointer p, Size n);
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/destroy_range.inl>
|
||||
|
||||
@@ -0,0 +1,158 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/allocator/destroy_range.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/for_each.h>
|
||||
#include <memory>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
|
||||
// destroy_range has three cases:
|
||||
// if Allocator has an effectful member function destroy:
|
||||
// 1. destroy via the allocator
|
||||
// else
|
||||
// 2. if T has a non-trivial destructor, destroy the range without using the allocator
|
||||
// 3. if T has a trivial destructor, do a no-op
|
||||
|
||||
template<typename Allocator, typename T>
|
||||
struct has_effectful_member_destroy
|
||||
: has_member_destroy<Allocator,T>
|
||||
{};
|
||||
|
||||
// std::allocator::destroy's only effect is to invoke its argument's destructor
|
||||
template<typename U, typename T>
|
||||
struct has_effectful_member_destroy<std::allocator<U>, T>
|
||||
: thrust::detail::false_type
|
||||
{};
|
||||
|
||||
// case 1: Allocator has an effectful 1-argument member function "destroy"
|
||||
template<typename Allocator, typename Pointer>
|
||||
struct enable_if_destroy_range_case1
|
||||
: thrust::detail::enable_if<
|
||||
has_effectful_member_destroy<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value
|
||||
>
|
||||
{};
|
||||
|
||||
// case 2: Allocator has no member function "destroy", but T has a non-trivial destructor
|
||||
template<typename Allocator, typename Pointer>
|
||||
struct enable_if_destroy_range_case2
|
||||
: thrust::detail::enable_if<
|
||||
!has_effectful_member_destroy<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value &&
|
||||
!has_trivial_destructor<
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value
|
||||
>
|
||||
{};
|
||||
|
||||
// case 3: Allocator has no member function "destroy", and T has a trivial destructor
|
||||
template<typename Allocator, typename Pointer>
|
||||
struct enable_if_destroy_range_case3
|
||||
: thrust::detail::enable_if<
|
||||
!has_effectful_member_destroy<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value &&
|
||||
has_trivial_destructor<
|
||||
typename pointer_element<Pointer>::type
|
||||
>::value
|
||||
>
|
||||
{};
|
||||
|
||||
|
||||
|
||||
template<typename Allocator>
|
||||
struct destroy_via_allocator
|
||||
{
|
||||
Allocator &a;
|
||||
|
||||
destroy_via_allocator(Allocator &a)
|
||||
: a(a)
|
||||
{}
|
||||
|
||||
template<typename T>
|
||||
inline __host__ __device__
|
||||
void operator()(T &x)
|
||||
{
|
||||
allocator_traits<Allocator>::destroy(a, &x);
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
// destroy_range case 1: destroy via allocator
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
typename enable_if_destroy_range_case1<Allocator,Pointer>::type
|
||||
destroy_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
thrust::for_each_n(allocator_system<Allocator>::get(a), p, n, destroy_via_allocator<Allocator>(a));
|
||||
}
|
||||
|
||||
|
||||
// we must prepare for His coming
|
||||
struct gozer
|
||||
{
|
||||
template<typename T>
|
||||
inline __host__ __device__
|
||||
void operator()(T &x)
|
||||
{
|
||||
x.~T();
|
||||
}
|
||||
};
|
||||
|
||||
// destroy_range case 2: destroy without the allocator
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
typename enable_if_destroy_range_case2<Allocator,Pointer>::type
|
||||
destroy_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
thrust::for_each_n(allocator_system<Allocator>::get(a), p, n, gozer());
|
||||
}
|
||||
|
||||
|
||||
// destroy_range case 3: no-op
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
typename enable_if_destroy_range_case3<Allocator,Pointer>::type
|
||||
destroy_range(Allocator &, Pointer, Size)
|
||||
{
|
||||
// no op
|
||||
}
|
||||
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size>
|
||||
void destroy_range(Allocator &a, Pointer p, Size n)
|
||||
{
|
||||
return allocator_traits_detail::destroy_range(a,p,n);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,35 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size, typename T>
|
||||
inline void fill_construct_range(Allocator &a, Pointer p, Size n, const T &value);
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/fill_construct_range.inl>
|
||||
|
||||
@@ -0,0 +1,109 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/type_traits.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/for_each.h>
|
||||
#include <thrust/uninitialized_fill.h>
|
||||
#include <memory>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
namespace allocator_traits_detail
|
||||
{
|
||||
|
||||
// fill_construct_range has 2 cases:
|
||||
// if Allocator has an effectful member function construct:
|
||||
// 1. construct via the allocator
|
||||
// else
|
||||
// 2. construct via uninitialized_fill
|
||||
|
||||
template<typename Allocator, typename T, typename Arg1>
|
||||
struct has_effectful_member_construct2
|
||||
: has_member_construct2<Allocator,T,Arg1>
|
||||
{};
|
||||
|
||||
// std::allocator::construct's only effect is to invoke placement new
|
||||
template<typename U, typename T, typename Arg1>
|
||||
struct has_effectful_member_construct2<std::allocator<U>,T,Arg1>
|
||||
: thrust::detail::false_type
|
||||
{};
|
||||
|
||||
|
||||
template<typename Allocator, typename Arg1>
|
||||
struct construct2_via_allocator
|
||||
{
|
||||
Allocator &a;
|
||||
Arg1 arg;
|
||||
|
||||
construct2_via_allocator(Allocator &a, const Arg1 &arg)
|
||||
: a(a), arg(arg)
|
||||
{}
|
||||
|
||||
template<typename T>
|
||||
inline __host__ __device__
|
||||
void operator()(T &x)
|
||||
{
|
||||
allocator_traits<Allocator>::construct(a, &x, arg);
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size, typename T>
|
||||
typename enable_if<
|
||||
has_effectful_member_construct2<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type,
|
||||
T
|
||||
>::value
|
||||
>::type
|
||||
fill_construct_range(Allocator &a, Pointer p, Size n, const T &value)
|
||||
{
|
||||
thrust::for_each_n(allocator_system<Allocator>::get(a), p, n, construct2_via_allocator<Allocator,T>(a, value));
|
||||
}
|
||||
|
||||
|
||||
template<typename Allocator, typename Pointer, typename Size, typename T>
|
||||
typename disable_if<
|
||||
has_effectful_member_construct2<
|
||||
Allocator,
|
||||
typename pointer_element<Pointer>::type,
|
||||
T
|
||||
>::value
|
||||
>::type
|
||||
fill_construct_range(Allocator &a, Pointer p, Size n, const T &value)
|
||||
{
|
||||
thrust::uninitialized_fill_n(allocator_system<Allocator>::get(a), p, n, value);
|
||||
}
|
||||
|
||||
|
||||
} // end allocator_traits_detail
|
||||
|
||||
|
||||
template<typename Alloc, typename Pointer, typename Size, typename T>
|
||||
void fill_construct_range(Alloc &a, Pointer p, Size n, const T &value)
|
||||
{
|
||||
return allocator_traits_detail::fill_construct_range(a,p,n,value);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,52 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/detail/allocator/tagged_allocator.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename T, typename System, typename Pointer>
|
||||
class malloc_allocator
|
||||
: public thrust::detail::tagged_allocator<
|
||||
T, System, Pointer
|
||||
>
|
||||
{
|
||||
private:
|
||||
typedef thrust::detail::tagged_allocator<
|
||||
T, System, Pointer
|
||||
> super_t;
|
||||
|
||||
public:
|
||||
typedef typename super_t::pointer pointer;
|
||||
typedef typename super_t::size_type size_type;
|
||||
|
||||
pointer allocate(size_type cnt);
|
||||
|
||||
void deallocate(pointer p, size_type n);
|
||||
};
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/malloc_allocator.inl>
|
||||
|
||||
@@ -0,0 +1,64 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/malloc_allocator.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/bad_alloc.h>
|
||||
#include <thrust/detail/raw_pointer_cast.h>
|
||||
#include <thrust/detail/malloc_and_free.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename T, typename System, typename Pointer>
|
||||
typename malloc_allocator<T,System,Pointer>::pointer
|
||||
malloc_allocator<T,System,Pointer>
|
||||
::allocate(typename malloc_allocator<T,System,Pointer>::size_type cnt)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
// XXX should use a hypothetical thrust::static_pointer_cast here
|
||||
System system;
|
||||
|
||||
pointer result = thrust::malloc<T>(select_system(system), cnt);
|
||||
|
||||
if(result.get() == 0)
|
||||
{
|
||||
throw thrust::system::detail::bad_alloc("malloc_allocator::allocate: malloc failed");
|
||||
} // end if
|
||||
|
||||
return result;
|
||||
} // end malloc_allocator::allocate()
|
||||
|
||||
|
||||
template<typename T, typename System, typename Pointer>
|
||||
void malloc_allocator<T,System,Pointer>
|
||||
::deallocate(typename malloc_allocator<T,System,Pointer>::pointer p, typename malloc_allocator<T,System,Pointer>::size_type n)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
System system;
|
||||
thrust::free(select_system(system), p);
|
||||
} // end malloc_allocator
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,62 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename BaseAllocator>
|
||||
struct no_throw_allocator : BaseAllocator
|
||||
{
|
||||
private:
|
||||
typedef BaseAllocator super_t;
|
||||
|
||||
public:
|
||||
inline no_throw_allocator(const BaseAllocator &other = BaseAllocator())
|
||||
: super_t(other)
|
||||
{}
|
||||
|
||||
template<typename U>
|
||||
struct rebind
|
||||
{
|
||||
typedef no_throw_allocator<typename super_t::template rebind<U>::other> other;
|
||||
}; // end rebind
|
||||
|
||||
void deallocate(typename super_t::pointer p, typename super_t::size_type n)
|
||||
{
|
||||
try
|
||||
{
|
||||
super_t::deallocate(p, n);
|
||||
} // end try
|
||||
catch(...)
|
||||
{
|
||||
// catch anything
|
||||
} // end catch
|
||||
} // end deallocate()
|
||||
|
||||
inline bool operator==(no_throw_allocator const &other) { return super_t::operator==(other); }
|
||||
inline bool operator!=(no_throw_allocator const &other) { return super_t::operator!=(other); }
|
||||
}; // end no_throw_allocator
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
|
||||
@@ -0,0 +1,101 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename T, typename Tag, typename Pointer> class tagged_allocator;
|
||||
|
||||
template<typename Tag, typename Pointer>
|
||||
class tagged_allocator<void, Tag, Pointer>
|
||||
{
|
||||
public:
|
||||
typedef void value_type;
|
||||
typedef typename thrust::detail::pointer_traits<Pointer>::template rebind<void>::other pointer;
|
||||
typedef typename thrust::detail::pointer_traits<Pointer>::template rebind<const void>::other const_pointer;
|
||||
typedef std::size_t size_type;
|
||||
typedef typename thrust::detail::pointer_traits<Pointer>::difference_type difference_type;
|
||||
typedef Tag system_type;
|
||||
|
||||
template<typename U>
|
||||
struct rebind
|
||||
{
|
||||
typedef tagged_allocator<U,Tag,Pointer> other;
|
||||
}; // end rebind
|
||||
};
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
class tagged_allocator
|
||||
{
|
||||
public:
|
||||
typedef T value_type;
|
||||
typedef typename thrust::detail::pointer_traits<Pointer>::template rebind<T>::other pointer;
|
||||
typedef typename thrust::detail::pointer_traits<Pointer>::template rebind<const T>::other const_pointer;
|
||||
typedef typename thrust::iterator_reference<pointer>::type reference;
|
||||
typedef typename thrust::iterator_reference<const_pointer>::type const_reference;
|
||||
typedef std::size_t size_type;
|
||||
typedef typename thrust::detail::pointer_traits<pointer>::difference_type difference_type;
|
||||
typedef Tag system_type;
|
||||
|
||||
template<typename U>
|
||||
struct rebind
|
||||
{
|
||||
typedef tagged_allocator<U,Tag,Pointer> other;
|
||||
}; // end rebind
|
||||
|
||||
__host__ __device__
|
||||
inline tagged_allocator();
|
||||
|
||||
__host__ __device__
|
||||
inline tagged_allocator(const tagged_allocator &);
|
||||
|
||||
template<typename U, typename OtherPointer>
|
||||
__host__ __device__
|
||||
inline tagged_allocator(const tagged_allocator<U, Tag, OtherPointer> &);
|
||||
|
||||
__host__ __device__
|
||||
inline ~tagged_allocator();
|
||||
|
||||
__host__ __device__
|
||||
pointer address(reference x) const;
|
||||
|
||||
__host__ __device__
|
||||
const_pointer address(const_reference x) const;
|
||||
|
||||
size_type max_size() const;
|
||||
};
|
||||
|
||||
template<typename T1, typename Pointer1, typename T2, typename Pointer2, typename Tag>
|
||||
__host__ __device__
|
||||
bool operator==(const tagged_allocator<T1,Pointer1,Tag> &, const tagged_allocator<T2,Pointer2,Tag> &);
|
||||
|
||||
template<typename T1, typename Pointer1, typename T2, typename Pointer2, typename Tag>
|
||||
__host__ __device__
|
||||
bool operator!=(const tagged_allocator<T1,Pointer1,Tag> &, const tagged_allocator<T2,Pointer2,Tag> &);
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/tagged_allocator.inl>
|
||||
|
||||
@@ -0,0 +1,97 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/tagged_allocator.h>
|
||||
#include <limits>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::tagged_allocator()
|
||||
{}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::tagged_allocator(const tagged_allocator<T,Tag,Pointer> &)
|
||||
{}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
template<typename U, typename OtherPointer>
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::tagged_allocator(const tagged_allocator<U,Tag,OtherPointer> &)
|
||||
{}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::~tagged_allocator()
|
||||
{}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
typename tagged_allocator<T,Tag,Pointer>::pointer
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::address(reference x) const
|
||||
{
|
||||
return &x;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
typename tagged_allocator<T,Tag,Pointer>::const_pointer
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::address(const_reference x) const
|
||||
{
|
||||
return &x;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, typename Tag, typename Pointer>
|
||||
typename tagged_allocator<T,Tag,Pointer>::size_type
|
||||
tagged_allocator<T,Tag,Pointer>
|
||||
::max_size() const
|
||||
{
|
||||
return (std::numeric_limits<size_type>::max)() / sizeof(T);
|
||||
}
|
||||
|
||||
|
||||
template<typename T1, typename Pointer1, typename T2, typename Pointer2, typename Tag>
|
||||
__host__ __device__
|
||||
bool operator==(const tagged_allocator<T1,Pointer1,Tag> &, const tagged_allocator<T2,Pointer2,Tag> &)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
template<typename T1, typename Pointer1, typename T2, typename Pointer2, typename Tag>
|
||||
__host__ __device__
|
||||
bool operator!=(const tagged_allocator<T1,Pointer1,Tag> &, const tagged_allocator<T2,Pointer2,Tag> &)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,75 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/tagged_allocator.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/pair.h>
|
||||
#include <thrust/memory.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
// XXX the pointer parameter given to tagged_allocator should be related to
|
||||
// the type of the expression get_temporary_buffer(system, n).first
|
||||
// without decltype, compromise on pointer<T,System>
|
||||
template<typename T, typename System>
|
||||
class temporary_allocator
|
||||
: public thrust::detail::tagged_allocator<
|
||||
T, System, thrust::pointer<T,System>
|
||||
>
|
||||
{
|
||||
private:
|
||||
typedef thrust::detail::tagged_allocator<
|
||||
T, System, thrust::pointer<T,System>
|
||||
> super_t;
|
||||
|
||||
System &m_system;
|
||||
|
||||
public:
|
||||
typedef typename super_t::pointer pointer;
|
||||
typedef typename super_t::size_type size_type;
|
||||
|
||||
inline explicit temporary_allocator(thrust::execution_policy<System> &system) :
|
||||
super_t(),
|
||||
m_system(thrust::detail::derived_cast(system))
|
||||
{}
|
||||
|
||||
pointer allocate(size_type cnt);
|
||||
|
||||
void deallocate(pointer p, size_type n);
|
||||
|
||||
inline System &system()
|
||||
{
|
||||
return m_system;
|
||||
} // end system()
|
||||
|
||||
private:
|
||||
typedef thrust::pair<pointer, size_type> pointer_and_size;
|
||||
}; // end temporary_allocator
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/allocator/temporary_allocator.inl>
|
||||
|
||||
@@ -0,0 +1,59 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/allocator/temporary_allocator.h>
|
||||
#include <thrust/detail/temporary_buffer.h>
|
||||
#include <thrust/system/detail/bad_alloc.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename T, typename System>
|
||||
typename temporary_allocator<T,System>::pointer
|
||||
temporary_allocator<T,System>
|
||||
::allocate(typename temporary_allocator<T,System>::size_type cnt)
|
||||
{
|
||||
pointer_and_size result = thrust::get_temporary_buffer<T>(system(), cnt);
|
||||
|
||||
// handle failure
|
||||
if(result.second < cnt)
|
||||
{
|
||||
// deallocate and throw
|
||||
// note that we pass cnt to deallocate, not a value derived from result.second
|
||||
deallocate(result.first, cnt);
|
||||
|
||||
throw thrust::system::detail::bad_alloc("temporary_buffer::allocate: get_temporary_buffer failed");
|
||||
} // end if
|
||||
|
||||
return result.first;
|
||||
} // end temporary_allocator::allocate()
|
||||
|
||||
|
||||
template<typename T, typename System>
|
||||
void temporary_allocator<T,System>
|
||||
::deallocate(typename temporary_allocator<T,System>::pointer p, typename temporary_allocator<T,System>::size_type n)
|
||||
{
|
||||
return thrust::return_temporary_buffer(system(), p);
|
||||
} // end temporary_allocator
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,458 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file binary_search.inl
|
||||
* \brief Inline file for binary_search.h.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/binary_search.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/binary_search.h>
|
||||
#include <thrust/system/detail/adl/binary_search.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename LessThanComparable>
|
||||
ForwardIterator lower_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable &value)
|
||||
{
|
||||
using thrust::system::detail::generic::lower_bound;
|
||||
return lower_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
}
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
ForwardIterator lower_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T &value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::lower_bound;
|
||||
return lower_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value, comp);
|
||||
}
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename LessThanComparable>
|
||||
ForwardIterator upper_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable &value)
|
||||
{
|
||||
using thrust::system::detail::generic::upper_bound;
|
||||
return upper_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
}
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
ForwardIterator upper_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T &value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::upper_bound;
|
||||
return upper_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value, comp);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename LessThanComparable>
|
||||
bool binary_search(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::binary_search;
|
||||
return binary_search(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
bool binary_search(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::binary_search;
|
||||
return binary_search(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value, comp);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
thrust::pair<ForwardIterator, ForwardIterator>
|
||||
equal_range(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::equal_range;
|
||||
return equal_range(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value, comp);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename LessThanComparable>
|
||||
thrust::pair<ForwardIterator, ForwardIterator>
|
||||
equal_range(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::equal_range;
|
||||
return equal_range(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator lower_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::lower_bound;
|
||||
return lower_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator lower_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::lower_bound;
|
||||
return lower_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator upper_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::upper_bound;
|
||||
return upper_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator upper_bound(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::upper_bound;
|
||||
return upper_bound(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator binary_search(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::binary_search;
|
||||
return binary_search(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
|
||||
template <typename DerivedPolicy, typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator binary_search(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::binary_search;
|
||||
return binary_search(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
|
||||
//////////////////////
|
||||
// Scalar Functions //
|
||||
//////////////////////
|
||||
|
||||
template <typename ForwardIterator, typename LessThanComparable>
|
||||
ForwardIterator lower_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::lower_bound(select_system(system), first, last, value);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
ForwardIterator lower_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::lower_bound(select_system(system), first, last, value, comp);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename LessThanComparable>
|
||||
ForwardIterator upper_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::upper_bound(select_system(system), first, last, value);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
ForwardIterator upper_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::upper_bound(select_system(system), first, last, value, comp);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename LessThanComparable>
|
||||
bool binary_search(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::binary_search(select_system(system), first, last, value);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
bool binary_search(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::binary_search(select_system(system), first, last, value, comp);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename LessThanComparable>
|
||||
thrust::pair<ForwardIterator, ForwardIterator>
|
||||
equal_range(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const LessThanComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::equal_range(select_system(system), first, last, value);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename T, typename StrictWeakOrdering>
|
||||
thrust::pair<ForwardIterator, ForwardIterator>
|
||||
equal_range(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T& value,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::equal_range(select_system(system), first, last, value, comp);
|
||||
}
|
||||
|
||||
//////////////////////
|
||||
// Vector Functions //
|
||||
//////////////////////
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator lower_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::lower_bound(select_system(system1,system2,system3), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator lower_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::lower_bound(select_system(system1,system2,system3), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator upper_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::upper_bound(select_system(system1,system2,system3), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator upper_bound(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::upper_bound(select_system(system1,system2,system3), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator binary_search(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::binary_search(select_system(system1,system2,system3), first, last, values_first, values_last, output);
|
||||
}
|
||||
|
||||
template <typename ForwardIterator, typename InputIterator, typename OutputIterator, typename StrictWeakOrdering>
|
||||
OutputIterator binary_search(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
InputIterator values_first,
|
||||
InputIterator values_last,
|
||||
OutputIterator output,
|
||||
StrictWeakOrdering comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::binary_search(select_system(system1,system2,system3), first, last, values_first, values_last, output, comp);
|
||||
}
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,23 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
/*! \file config.h
|
||||
* \brief Defines platform configuration.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config/config.h>
|
||||
|
||||
@@ -0,0 +1,103 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file compiler.h
|
||||
* \brief Compiler-specific configuration
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#ifdef __CUDACC__
|
||||
|
||||
#include <cuda.h>
|
||||
|
||||
// Thrust supports CUDA >= 3.0
|
||||
#if CUDA_VERSION < 3000
|
||||
#error "CUDA v3.0 or newer is required"
|
||||
#endif // CUDA_VERSION
|
||||
|
||||
#endif // __CUDACC__
|
||||
|
||||
// enumerate host compilers we know about
|
||||
#define THRUST_HOST_COMPILER_UNKNOWN 0
|
||||
#define THRUST_HOST_COMPILER_MSVC 1
|
||||
#define THRUST_HOST_COMPILER_GCC 2
|
||||
|
||||
// enumerate host compilers we know about
|
||||
#define THRUST_DEVICE_COMPILER_UNKNOWN 0
|
||||
#define THRUST_DEVICE_COMPILER_MSVC 1
|
||||
#define THRUST_DEVICE_COMPILER_GCC 2
|
||||
#define THRUST_DEVICE_COMPILER_NVCC 3
|
||||
|
||||
// figure out which host compiler we're using
|
||||
// XXX we should move the definition of THRUST_DEPRECATED out of this logic
|
||||
#if defined(_MSC_VER)
|
||||
#define THRUST_HOST_COMPILER THRUST_HOST_COMPILER_MSVC
|
||||
#define THRUST_DEPRECATED __declspec(deprecated)
|
||||
#elif defined(__GNUC__)
|
||||
#define THRUST_HOST_COMPILER THRUST_HOST_COMPILER_GCC
|
||||
#define THRUST_DEPRECATED __attribute__ ((deprecated))
|
||||
#define THRUST_GCC_VERSION (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__)
|
||||
#else
|
||||
#define THRUST_HOST_COMPILER THRUST_HOST_COMPILER_UNKNOWN
|
||||
#define THRUST_DEPRECATED
|
||||
#endif // THRUST_HOST_COMPILER
|
||||
|
||||
// figure out which device compiler we're using
|
||||
#if defined(__CUDACC__)
|
||||
#define THRUST_DEVICE_COMPILER THRUST_DEVICE_COMPILER_NVCC
|
||||
#elif THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC
|
||||
#define THRUST_DEVICE_COMPILER THRUST_DEVICE_COMPILER_MSVC
|
||||
#elif THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_GCC
|
||||
#define THRUST_DEVICE_COMPILER THRUST_DEVICE_COMPILER_GCC
|
||||
#else
|
||||
#define THRUST_DEVICE_COMPILER THRUST_DEVICE_COMPILER_UNKNOWN
|
||||
#endif
|
||||
|
||||
// is the device compiler capable of compiling omp?
|
||||
#ifdef _OPENMP
|
||||
#define THRUST_DEVICE_COMPILER_IS_OMP_CAPABLE THRUST_TRUE
|
||||
#else
|
||||
#define THRUST_DEVICE_COMPILER_IS_OMP_CAPABLE THRUST_FALSE
|
||||
#endif // _OPENMP
|
||||
|
||||
// disable specific MSVC warnings
|
||||
#if (THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC) && !defined(__CUDA_ARCH__)
|
||||
#define __THRUST_DISABLE_MSVC_WARNING_BEGIN(x) \
|
||||
__pragma(warning(push)) \
|
||||
__pragma(warning(disable : x))
|
||||
#define __THRUST_DISABLE_MSVC_WARNING_END(x) \
|
||||
__pragma(warning(pop))
|
||||
#else
|
||||
#define __THRUST_DISABLE_MSVC_WARNING_BEGIN(x)
|
||||
#define __THRUST_DISABLE_MSVC_WARNING_END(x)
|
||||
#endif
|
||||
#define __THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING(x) \
|
||||
__THRUST_DISABLE_MSVC_WARNING_BEGIN(4244 4267) \
|
||||
x;\
|
||||
__THRUST_DISABLE_MSVC_WARNING_END(4244 4267)
|
||||
#define __THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_BEGIN \
|
||||
__THRUST_DISABLE_MSVC_WARNING_BEGIN(4244 4267)
|
||||
#define __THRUST_DISABLE_MSVC_POSSIBLE_LOSS_OF_DATA_WARNING_END \
|
||||
__THRUST_DISABLE_MSVC_WARNING_END(4244 4267)
|
||||
#define __THRUST_DISABLE_MSVC_FORCING_VALUE_TO_BOOL(x) \
|
||||
__THRUST_DISABLE_MSVC_WARNING_BEGIN(4800) \
|
||||
x;\
|
||||
__THRUST_DISABLE_MSVC_WARNING_END(4800)
|
||||
#define __THRUST_DISABLE_MSVC_FORCING_VALUE_TO_BOOL_BEGIN \
|
||||
__THRUST_DISABLE_MSVC_WARNING_BEGIN(4800)
|
||||
#define __THRUST_DISABLE_MSVC_FORCING_VALUE_TO_BOOL_END \
|
||||
__THRUST_DISABLE_MSVC_WARNING_END(4800)
|
||||
@@ -0,0 +1,52 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
// msvc case
|
||||
#if THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC
|
||||
|
||||
#ifndef _DEBUG
|
||||
|
||||
#include <intrin.h>
|
||||
#pragma intrinsic(_ReadWriteBarrier)
|
||||
#define __thrust_compiler_fence() _ReadWriteBarrier()
|
||||
#else
|
||||
|
||||
#define __thrust_compiler_fence() do {} while (0)
|
||||
|
||||
#endif // _DEBUG
|
||||
|
||||
// gcc case
|
||||
#elif THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_GCC
|
||||
|
||||
#if THRUST_GCC_VERSION >= 40200 // atomic built-ins were introduced ~4.2
|
||||
#define __thrust_compiler_fence() __sync_synchronize()
|
||||
#else
|
||||
// allow the code to compile without any guarantees
|
||||
#define __thrust_compiler_fence() do {} while (0)
|
||||
#endif // THRUST_GCC_VERSION
|
||||
|
||||
// unknown case
|
||||
#elif THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_UNKNOWN
|
||||
|
||||
// allow the code to compile without any guarantees
|
||||
#define __thrust_compiler_fence() do {} while (0)
|
||||
|
||||
#endif
|
||||
|
||||
@@ -0,0 +1,36 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file config.h
|
||||
* \brief Defines platform configuration.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
// XXX the order of these #includes matters
|
||||
|
||||
#include <thrust/detail/config/simple_defines.h>
|
||||
#include <thrust/detail/config/compiler.h>
|
||||
// host_system.h & device_system.h must be #included as early as possible
|
||||
// because other config headers depend on it
|
||||
#include <thrust/detail/config/host_system.h>
|
||||
#include <thrust/detail/config/device_system.h>
|
||||
#include <thrust/detail/config/host_device.h>
|
||||
#include <thrust/detail/config/debug.h>
|
||||
#include <thrust/detail/config/compiler_fence.h>
|
||||
#include <thrust/detail/config/forceinline.h>
|
||||
#include <thrust/detail/config/hd_warning_disable.h>
|
||||
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#ifndef THRUST_DEBUG
|
||||
# ifndef NDEBUG
|
||||
# if (DEBUG || _DEBUG)
|
||||
# define THRUST_DEBUG 1
|
||||
# endif // (DEBUG || _DEBUG)
|
||||
# endif // NDEBUG
|
||||
#endif // THRUST_DEBUG
|
||||
|
||||
#if THRUST_DEBUG
|
||||
# ifndef __THRUST_SYNCHRONOUS
|
||||
# define __THRUST_SYNCHRONOUS 1
|
||||
# endif // __THRUST_SYNCHRONOUS
|
||||
#endif // THRUST_DEBUG
|
||||
|
||||
@@ -0,0 +1,61 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
// reserve 0 for undefined
|
||||
#define THRUST_DEVICE_SYSTEM_CUDA 1
|
||||
#define THRUST_DEVICE_SYSTEM_OMP 2
|
||||
#define THRUST_DEVICE_SYSTEM_TBB 3
|
||||
#define THRUST_DEVICE_SYSTEM_CPP 4
|
||||
|
||||
#ifndef THRUST_DEVICE_SYSTEM
|
||||
#define THRUST_DEVICE_SYSTEM THRUST_DEVICE_SYSTEM_CUDA
|
||||
#endif // THRUST_DEVICE_SYSTEM
|
||||
|
||||
// XXX make the use of THRUST_DEVICE_BACKEND an error in Thrust 1.7
|
||||
// XXX eliminate the following in Thrust 1.7
|
||||
|
||||
#define THRUST_DEVICE_BACKEND_CUDA THRUST_DEVICE_SYSTEM_CUDA
|
||||
#define THRUST_DEVICE_BACKEND_OMP THRUST_DEVICE_SYSTEM_OMP
|
||||
#define THRUST_DEVICE_BACKEND_TBB THRUST_DEVICE_SYSTEM_TBB
|
||||
|
||||
#ifdef THRUST_DEVICE_BACKEND
|
||||
# if THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC
|
||||
# pragma message("----------------------------------------------------------------------------------")
|
||||
# pragma message("| WARNING: THRUST_DEVICE_BACKEND is deprecated; use THRUST_DEVICE_SYSTEM instead |")
|
||||
# pragma message("----------------------------------------------------------------------------------")
|
||||
# else
|
||||
# warning ----------------------------------------------------------------------------------
|
||||
# warning | WARNING: THRUST_DEVICE_BACKEND is deprecated; use THRUST_DEVICE_SYSTEM instead |
|
||||
# warning ----------------------------------------------------------------------------------
|
||||
# endif // THRUST_HOST_COMPILER
|
||||
# undef THRUST_DEVICE_SYSTEM
|
||||
# define THRUST_DEVICE_SYSTEM THRUST_DEVICE_BACKEND
|
||||
#endif // THRUST_DEVICE_BACKEND
|
||||
|
||||
#if THRUST_DEVICE_SYSTEM == THRUST_DEVICE_SYSTEM_CUDA
|
||||
#define __THRUST_DEVICE_SYSTEM_NAMESPACE cuda
|
||||
#elif THRUST_DEVICE_SYSTEM == THRUST_DEVICE_SYSTEM_OMP
|
||||
#define __THRUST_DEVICE_SYSTEM_NAMESPACE omp
|
||||
#elif THRUST_DEVICE_SYSTEM == THRUST_DEVICE_SYSTEM_TBB
|
||||
#define __THRUST_DEVICE_SYSTEM_NAMESPACE tbb
|
||||
#elif THRUST_DEVICE_SYSTEM == THRUST_DEVICE_SYSTEM_CPP
|
||||
#define __THRUST_DEVICE_SYSTEM_NAMESPACE cpp
|
||||
#endif
|
||||
|
||||
#define __THRUST_DEVICE_SYSTEM_ROOT thrust/system/__THRUST_DEVICE_SYSTEM_NAMESPACE
|
||||
|
||||
@@ -0,0 +1,36 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file forceinline.h
|
||||
* \brief Defines __thrust_forceinline__
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
#if defined(__CUDACC__)
|
||||
|
||||
#define __thrust_forceinline__ __forceinline__
|
||||
|
||||
#else
|
||||
|
||||
// TODO add
|
||||
|
||||
#define __thrust_forceinline__
|
||||
|
||||
#endif
|
||||
|
||||
@@ -0,0 +1,35 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file hd_warning_disable.h
|
||||
* \brief Defines __thrust_hd_warning_disable__
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
#if defined(__CUDACC__)
|
||||
|
||||
#define __thrust_hd_warning_disable__ \
|
||||
#pragma hd_warning_disable
|
||||
#else
|
||||
|
||||
#define __thrust_hd_warning_disable__
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
@@ -0,0 +1,44 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file host_device.h
|
||||
* \brief Defines __host__ and __device__ and other CUDA-isms
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
#if THRUST_DEVICE_SYSTEM == THRUST_DEVICE_SYSTEM_CUDA
|
||||
|
||||
#include <host_defines.h>
|
||||
|
||||
#else
|
||||
|
||||
// since __host__ & __device__ might have already be defined, only
|
||||
// #define them if not defined already
|
||||
// XXX this will break if the client does #include <host_defines.h> later
|
||||
|
||||
#ifndef __host__
|
||||
#define __host__
|
||||
#endif // __host__
|
||||
|
||||
#ifndef __device__
|
||||
#define __device__
|
||||
#endif // __device__
|
||||
|
||||
#endif
|
||||
|
||||
@@ -0,0 +1,58 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
// reserve 0 for undefined
|
||||
#define THRUST_HOST_SYSTEM_CPP 1
|
||||
#define THRUST_HOST_SYSTEM_OMP 2
|
||||
#define THRUST_HOST_SYSTEM_TBB 3
|
||||
|
||||
#ifndef THRUST_HOST_SYSTEM
|
||||
#define THRUST_HOST_SYSTEM THRUST_HOST_SYSTEM_CPP
|
||||
#endif // THRUST_HOST_SYSTEM
|
||||
|
||||
// XXX make the use of THRUST_HOST_BACKEND an error in Thrust 1.7
|
||||
// XXX eliminate the following in Thrust 1.7
|
||||
|
||||
#define THRUST_HOST_BACKEND_CPP THRUST_HOST_SYSTEM_CPP
|
||||
#define THRUST_HOST_BACKEND_OMP THRUST_HOST_SYSTEM_OMP
|
||||
#define THRUST_HOST_BACKEND_TBB THRUST_HOST_SYSTEM_TBB
|
||||
|
||||
#ifdef THRUST_HOST_BACKEND
|
||||
# if THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC
|
||||
# pragma message("------------------------------------------------------------------------------")
|
||||
# pragma message("| WARNING: THRUST_HOST_BACKEND is deprecated; use THRUST_HOST_SYSTEM instead |")
|
||||
# pragma message("------------------------------------------------------------------------------")
|
||||
# else
|
||||
# warning ------------------------------------------------------------------------------
|
||||
# warning | WARNING: THRUST_HOST_BACKEND is deprecated; use THRUST_HOST_SYSTEM instead |
|
||||
# warning ------------------------------------------------------------------------------
|
||||
# endif // THRUST_HOST_COMPILER
|
||||
# undef THRUST_HOST_SYSTEM
|
||||
# define THRUST_HOST_SYSTEM THRUST_HOST_BACKEND
|
||||
#endif // THRUST_HOST_BACKEND
|
||||
|
||||
#if THRUST_HOST_SYSTEM == THRUST_HOST_SYSTEM_CPP
|
||||
#define __THRUST_HOST_SYSTEM_NAMESPACE cpp
|
||||
#elif THRUST_HOST_SYSTEM == THRUST_HOST_SYSTEM_OMP
|
||||
#define __THRUST_HOST_SYSTEM_NAMESPACE omp
|
||||
#elif THRUST_HOST_SYSTEM == THRUST_HOST_SYSTEM_TBB
|
||||
#define __THRUST_HOST_SYSTEM_NAMESPACE tbb
|
||||
#endif
|
||||
|
||||
#define __THRUST_HOST_SYSTEM_ROOT thrust/system/__THRUST_HOST_SYSTEM_NAMESPACE
|
||||
|
||||
@@ -0,0 +1,28 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
/*! \file simple_defines.h
|
||||
* \brief Primitive macros without dependencies.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#define THRUST_UNKNOWN 0
|
||||
#define THRUST_FALSE 0
|
||||
#define THRUST_TRUE 1
|
||||
|
||||
#define THRUST_PREVENT_MACRO_SUBSTITUTION
|
||||
|
||||
@@ -0,0 +1,129 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/iterator/detail/normal_iterator.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
// XXX parameter T is redundant with parameter Alloc
|
||||
template<typename T, typename Alloc>
|
||||
class contiguous_storage
|
||||
{
|
||||
private:
|
||||
typedef thrust::detail::allocator_traits<Alloc> alloc_traits;
|
||||
|
||||
public:
|
||||
typedef Alloc allocator_type;
|
||||
typedef T value_type;
|
||||
typedef typename alloc_traits::pointer pointer;
|
||||
typedef typename alloc_traits::const_pointer const_pointer;
|
||||
typedef typename alloc_traits::size_type size_type;
|
||||
typedef typename alloc_traits::difference_type difference_type;
|
||||
|
||||
// XXX we should bring reference & const_reference into allocator_traits
|
||||
// at the moment, it's unclear how -- we have nothing analogous to
|
||||
// rebind_pointer for references
|
||||
// we either need to add reference_traits or extend the existing
|
||||
// pointer_traits to support wrapped references
|
||||
typedef typename Alloc::reference reference;
|
||||
typedef typename Alloc::const_reference const_reference;
|
||||
|
||||
typedef thrust::detail::normal_iterator<pointer> iterator;
|
||||
typedef thrust::detail::normal_iterator<const_pointer> const_iterator;
|
||||
|
||||
explicit contiguous_storage(const allocator_type &alloc = allocator_type());
|
||||
|
||||
explicit contiguous_storage(size_type n, const allocator_type &alloc = allocator_type());
|
||||
|
||||
~contiguous_storage(void);
|
||||
|
||||
size_type size(void) const;
|
||||
|
||||
size_type max_size(void) const;
|
||||
|
||||
iterator begin(void);
|
||||
|
||||
const_iterator begin(void) const;
|
||||
|
||||
iterator end(void);
|
||||
|
||||
const_iterator end(void) const;
|
||||
|
||||
reference operator[](size_type n);
|
||||
|
||||
const_reference operator[](size_type n) const;
|
||||
|
||||
allocator_type get_allocator(void) const;
|
||||
|
||||
// note that allocate does *not* automatically call deallocate
|
||||
void allocate(size_type n);
|
||||
|
||||
void deallocate(void);
|
||||
|
||||
void swap(contiguous_storage &x);
|
||||
|
||||
void default_construct_n(iterator first, size_type n);
|
||||
|
||||
void uninitialized_fill_n(iterator first, size_type n, const value_type &value);
|
||||
|
||||
template<typename InputIterator>
|
||||
iterator uninitialized_copy(InputIterator first, InputIterator last, iterator result);
|
||||
|
||||
template<typename System, typename InputIterator>
|
||||
iterator uninitialized_copy(thrust::execution_policy<System> &from_system,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
iterator result);
|
||||
|
||||
template<typename InputIterator, typename Size>
|
||||
iterator uninitialized_copy_n(InputIterator first, Size n, iterator result);
|
||||
|
||||
template<typename System, typename InputIterator, typename Size>
|
||||
iterator uninitialized_copy_n(thrust::execution_policy<System> &from_system,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
iterator result);
|
||||
|
||||
void destroy(iterator first, iterator last);
|
||||
|
||||
private:
|
||||
// XXX we could inherit from this to take advantage of empty base class optimization
|
||||
allocator_type m_allocator;
|
||||
|
||||
iterator m_begin;
|
||||
|
||||
size_type m_size;
|
||||
|
||||
// disallow assignment
|
||||
contiguous_storage &operator=(const contiguous_storage &x);
|
||||
}; // end contiguous_storage
|
||||
|
||||
} // end detail
|
||||
|
||||
template<typename T, typename Alloc> void swap(detail::contiguous_storage<T,Alloc> &lhs, detail::contiguous_storage<T,Alloc> &rhs);
|
||||
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/contiguous_storage.inl>
|
||||
|
||||
@@ -0,0 +1,245 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/contiguous_storage.h>
|
||||
#include <thrust/detail/swap.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/allocator/copy_construct_range.h>
|
||||
#include <thrust/detail/allocator/default_construct_range.h>
|
||||
#include <thrust/detail/allocator/destroy_range.h>
|
||||
#include <thrust/detail/allocator/fill_construct_range.h>
|
||||
#include <utility> // for use of std::swap in the WAR below
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
contiguous_storage<T,Alloc>
|
||||
::contiguous_storage(const Alloc &alloc)
|
||||
:m_allocator(alloc),
|
||||
m_begin(pointer(static_cast<T*>(0))),
|
||||
m_size(0)
|
||||
{
|
||||
;
|
||||
} // end contiguous_storage::contiguous_storage()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
contiguous_storage<T,Alloc>
|
||||
::contiguous_storage(size_type n, const Alloc &alloc)
|
||||
:m_allocator(alloc),
|
||||
m_begin(pointer(static_cast<T*>(0))),
|
||||
m_size(0)
|
||||
{
|
||||
allocate(n);
|
||||
} // end contiguous_storage::contiguous_storage()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
contiguous_storage<T,Alloc>
|
||||
::~contiguous_storage(void)
|
||||
{
|
||||
deallocate();
|
||||
} // end contiguous_storage::~contiguous_storage()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::size_type
|
||||
contiguous_storage<T,Alloc>
|
||||
::size(void) const
|
||||
{
|
||||
return m_size;
|
||||
} // end contiguous_storage::size()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::size_type
|
||||
contiguous_storage<T,Alloc>
|
||||
::max_size(void) const
|
||||
{
|
||||
return alloc_traits::max_size(m_allocator);
|
||||
} // end contiguous_storage::max_size()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::begin(void)
|
||||
{
|
||||
return m_begin;
|
||||
} // end contiguous_storage::begin()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::const_iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::begin(void) const
|
||||
{
|
||||
return m_begin;
|
||||
} // end contiguous_storage::begin()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::end(void)
|
||||
{
|
||||
return m_begin + size();
|
||||
} // end contiguous_storage::end()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::const_iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::end(void) const
|
||||
{
|
||||
return m_begin + size();
|
||||
} // end contiguous_storage::end()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::reference
|
||||
contiguous_storage<T,Alloc>
|
||||
::operator[](size_type n)
|
||||
{
|
||||
return m_begin[n];
|
||||
} // end contiguous_storage::operator[]()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::const_reference
|
||||
contiguous_storage<T,Alloc>
|
||||
::operator[](size_type n) const
|
||||
{
|
||||
return m_begin[n];
|
||||
} // end contiguous_storage::operator[]()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
typename contiguous_storage<T,Alloc>::allocator_type
|
||||
contiguous_storage<T,Alloc>
|
||||
::get_allocator(void) const
|
||||
{
|
||||
return m_allocator;
|
||||
} // end contiguous_storage::get_allocator()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::allocate(size_type n)
|
||||
{
|
||||
if(n > 0)
|
||||
{
|
||||
m_begin = iterator(m_allocator.allocate(n));
|
||||
m_size = n;
|
||||
} // end if
|
||||
else
|
||||
{
|
||||
m_begin = iterator(pointer(static_cast<T*>(0)));
|
||||
m_size = 0;
|
||||
} // end else
|
||||
} // end contiguous_storage::allocate()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::deallocate(void)
|
||||
{
|
||||
if(size() > 0)
|
||||
{
|
||||
m_allocator.deallocate(m_begin.base(), size());
|
||||
m_begin = iterator(pointer(static_cast<T*>(0)));
|
||||
m_size = 0;
|
||||
} // end if
|
||||
} // end contiguous_storage::deallocate()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::swap(contiguous_storage &x)
|
||||
{
|
||||
thrust::swap(m_begin, x.m_begin);
|
||||
thrust::swap(m_size, x.m_size);
|
||||
|
||||
// XXX WAR nvcc 4.0's "calling a __host__ function from a __host__ __device__ function is not allowed" warning
|
||||
//thrust::swap(m_allocator, x.m_allocator);
|
||||
std::swap(m_allocator, x.m_allocator);
|
||||
} // end contiguous_storage::swap()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::default_construct_n(iterator first, size_type n)
|
||||
{
|
||||
default_construct_range(m_allocator, first.base(), n);
|
||||
} // end contiguous_storage::default_construct_n()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::uninitialized_fill_n(iterator first, size_type n, const value_type &x)
|
||||
{
|
||||
fill_construct_range(m_allocator, first.base(), n, x);
|
||||
} // end contiguous_storage::uninitialized_fill()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
template<typename System, typename InputIterator>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::uninitialized_copy(thrust::execution_policy<System> &from_system, InputIterator first, InputIterator last, iterator result)
|
||||
{
|
||||
return iterator(copy_construct_range(from_system, m_allocator, first, last, result.base()));
|
||||
} // end contiguous_storage::uninitialized_copy()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
template<typename InputIterator>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::uninitialized_copy(InputIterator first, InputIterator last, iterator result)
|
||||
{
|
||||
// XXX assumes InputIterator's associated System is default-constructible
|
||||
typename thrust::iterator_system<InputIterator>::type from_system;
|
||||
|
||||
return iterator(copy_construct_range(from_system, m_allocator, first, last, result.base()));
|
||||
} // end contiguous_storage::uninitialized_copy()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
template<typename System, typename InputIterator, typename Size>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::uninitialized_copy_n(thrust::execution_policy<System> &from_system, InputIterator first, Size n, iterator result)
|
||||
{
|
||||
return iterator(copy_construct_range_n(from_system, m_allocator, first, n, result.base()));
|
||||
} // end contiguous_storage::uninitialized_copy_n()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
template<typename InputIterator, typename Size>
|
||||
typename contiguous_storage<T,Alloc>::iterator
|
||||
contiguous_storage<T,Alloc>
|
||||
::uninitialized_copy_n(InputIterator first, Size n, iterator result)
|
||||
{
|
||||
// XXX assumes InputIterator's associated System is default-constructible
|
||||
typename thrust::iterator_system<InputIterator>::type from_system;
|
||||
|
||||
return iterator(copy_construct_range_n(from_system, m_allocator, first, n, result.base()));
|
||||
} // end contiguous_storage::uninitialized_copy_n()
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void contiguous_storage<T,Alloc>
|
||||
::destroy(iterator first, iterator last)
|
||||
{
|
||||
destroy_range(m_allocator, first.base(), last - first);
|
||||
} // end contiguous_storage::destroy()
|
||||
|
||||
} // end detail
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
void swap(detail::contiguous_storage<T,Alloc> &lhs, detail::contiguous_storage<T,Alloc> &rhs)
|
||||
{
|
||||
lhs.swap(rhs);
|
||||
} // end swap()
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,87 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename System,
|
||||
typename InputIterator,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy(const thrust::detail::execution_policy_base<System> &system,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
template<typename System,
|
||||
typename InputIterator,
|
||||
typename Size,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy_n(const thrust::detail::execution_policy_base<System> &system,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result);
|
||||
|
||||
template<typename InputIterator,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
template<typename InputIterator,
|
||||
typename Size,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy_n(InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result);
|
||||
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename FromSystem,
|
||||
typename ToSystem,
|
||||
typename InputIterator,
|
||||
typename OutputIterator>
|
||||
OutputIterator two_system_copy(thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &two_system,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result);
|
||||
|
||||
|
||||
template<typename FromSystem,
|
||||
typename ToSystem,
|
||||
typename InputIterator,
|
||||
typename Size,
|
||||
typename OutputIterator>
|
||||
OutputIterator two_system_copy_n(thrust::execution_policy<FromSystem> &from_system,
|
||||
thrust::execution_policy<ToSystem> &two_system,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result);
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/copy.inl>
|
||||
|
||||
@@ -0,0 +1,124 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/copy.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/copy.h>
|
||||
#include <thrust/system/detail/adl/copy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator>
|
||||
OutputIterator copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::copy;
|
||||
return copy(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, result);
|
||||
} // end copy()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename InputIterator, typename Size, typename OutputIterator>
|
||||
OutputIterator copy_n(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::copy_n;
|
||||
return copy_n(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, n, result);
|
||||
} // end copy_n()
|
||||
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
template<typename System1,
|
||||
typename System2,
|
||||
typename InputIterator,
|
||||
typename OutputIterator>
|
||||
OutputIterator two_system_copy(thrust::execution_policy<System1> &system1,
|
||||
thrust::execution_policy<System2> &system2,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
return thrust::copy(select_system(thrust::detail::derived_cast(thrust::detail::strip_const(system1)), thrust::detail::derived_cast(thrust::detail::strip_const(system2))), first, last, result);
|
||||
} // end two_system_copy()
|
||||
|
||||
|
||||
template<typename System1,
|
||||
typename System2,
|
||||
typename InputIterator,
|
||||
typename Size,
|
||||
typename OutputIterator>
|
||||
OutputIterator two_system_copy_n(thrust::execution_policy<System1> &system1,
|
||||
thrust::execution_policy<System2> &system2,
|
||||
InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
return thrust::copy_n(select_system(thrust::detail::derived_cast(thrust::detail::strip_const(system1)), thrust::detail::derived_cast(thrust::detail::strip_const(system2))), first, n, result);
|
||||
} // end two_system_copy_n()
|
||||
|
||||
|
||||
} // end detail
|
||||
|
||||
|
||||
template<typename InputIterator,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result)
|
||||
{
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::detail::two_system_copy(system1, system2, first, last, result);
|
||||
} // end copy()
|
||||
|
||||
|
||||
template<typename InputIterator,
|
||||
typename Size,
|
||||
typename OutputIterator>
|
||||
OutputIterator copy_n(InputIterator first,
|
||||
Size n,
|
||||
OutputIterator result)
|
||||
{
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::detail::two_system_copy_n(system1, system2, first, n, result);
|
||||
} // end copy_n()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,68 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/execution_policy.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename DerivedPolicy,
|
||||
typename InputIterator,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
template<typename DerivedPolicy,
|
||||
typename InputIterator1,
|
||||
typename InputIterator2,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
template<typename InputIterator,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
template<typename InputIterator1,
|
||||
typename InputIterator2,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred);
|
||||
|
||||
} // end thrust
|
||||
|
||||
#include <thrust/detail/copy_if.inl>
|
||||
|
||||
@@ -0,0 +1,105 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/copy_if.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/copy_if.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/adl/copy_if.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename DerivedPolicy,
|
||||
typename InputIterator,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::copy_if;
|
||||
return copy_if(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, result, pred);
|
||||
} // end copy_if()
|
||||
|
||||
|
||||
template<typename DerivedPolicy,
|
||||
typename InputIterator1,
|
||||
typename InputIterator2,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::copy_if;
|
||||
return copy_if(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, stencil, result, pred);
|
||||
} // end copy_if()
|
||||
|
||||
|
||||
template<typename InputIterator,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System1;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::copy_if(select_system(system1,system2), first, last, result, pred);
|
||||
} // end copy_if()
|
||||
|
||||
|
||||
template<typename InputIterator1,
|
||||
typename InputIterator2,
|
||||
typename OutputIterator,
|
||||
typename Predicate>
|
||||
OutputIterator copy_if(InputIterator1 first,
|
||||
InputIterator1 last,
|
||||
InputIterator2 stencil,
|
||||
OutputIterator result,
|
||||
Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator1>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator2>::type System2;
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System3;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
System3 system3;
|
||||
|
||||
return thrust::copy_if(select_system(system1,system2,system3), first, last, stencil, result, pred);
|
||||
} // end copy_if()
|
||||
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,80 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file count.inl
|
||||
* \brief Inline file for count.h.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/count.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/count.h>
|
||||
#include <thrust/system/detail/adl/count.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename InputIterator, typename EqualityComparable>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, InputIterator first, InputIterator last, const EqualityComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::count;
|
||||
return count(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
} // end count()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename InputIterator, typename Predicate>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count_if(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, InputIterator first, InputIterator last, Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::count_if;
|
||||
return count_if(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, pred);
|
||||
} // end count_if()
|
||||
|
||||
|
||||
template <typename InputIterator, typename EqualityComparable>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count(InputIterator first, InputIterator last, const EqualityComparable& value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::count(select_system(system), first, last, value);
|
||||
} // end count()
|
||||
|
||||
|
||||
template <typename InputIterator, typename Predicate>
|
||||
typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
count_if(InputIterator first, InputIterator last, Predicate pred)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::count_if(select_system(system), first, last, pred);
|
||||
} // end count_if()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,79 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#if (THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_GCC)
|
||||
#include <stdint.h>
|
||||
#endif
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
#if (THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC)
|
||||
|
||||
#if (_MSC_VER < 1300)
|
||||
typedef signed char int8_t;
|
||||
typedef signed short int16_t;
|
||||
typedef signed int int32_t;
|
||||
typedef unsigned char uint8_t;
|
||||
typedef unsigned short uint16_t;
|
||||
typedef unsigned int uint32_t;
|
||||
#else
|
||||
typedef signed __int8 int8_t;
|
||||
typedef signed __int16 int16_t;
|
||||
typedef signed __int32 int32_t;
|
||||
typedef unsigned __int8 uint8_t;
|
||||
typedef unsigned __int16 uint16_t;
|
||||
typedef unsigned __int32 uint32_t;
|
||||
#endif
|
||||
typedef signed __int64 int64_t;
|
||||
typedef unsigned __int64 uint64_t;
|
||||
|
||||
#else
|
||||
|
||||
typedef ::int8_t int8_t;
|
||||
typedef ::int16_t int16_t;
|
||||
typedef ::int32_t int32_t;
|
||||
typedef ::int64_t int64_t;
|
||||
typedef ::uint8_t uint8_t;
|
||||
typedef ::uint16_t uint16_t;
|
||||
typedef ::uint32_t uint32_t;
|
||||
typedef ::uint64_t uint64_t;
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
// an oracle to tell us how to define intptr_t
|
||||
template<int word_size = sizeof(void*)> struct divine_intptr_t;
|
||||
template<int word_size = sizeof(void*)> struct divine_uintptr_t;
|
||||
|
||||
// 32b platforms
|
||||
template<> struct divine_intptr_t<4> { typedef thrust::detail::int32_t type; };
|
||||
template<> struct divine_uintptr_t<4> { typedef thrust::detail::uint32_t type; };
|
||||
|
||||
// 64b platforms
|
||||
template<> struct divine_intptr_t<8> { typedef thrust::detail::int64_t type; };
|
||||
template<> struct divine_uintptr_t<8> { typedef thrust::detail::uint64_t type; };
|
||||
|
||||
typedef divine_intptr_t<>::type intptr_t;
|
||||
typedef divine_uintptr_t<>::type uintptr_t;
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,47 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_delete.inl
|
||||
* \brief Inline file for device_delete.h.
|
||||
*/
|
||||
|
||||
#include <thrust/device_delete.h>
|
||||
#include <thrust/device_free.h>
|
||||
#include <thrust/detail/allocator/destroy_range.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
// define an empty allocator class to use below
|
||||
struct device_delete_allocator {};
|
||||
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
void device_delete(device_ptr<T> ptr,
|
||||
const size_t n)
|
||||
{
|
||||
// we can use device_allocator to destroy the range
|
||||
thrust::detail::device_delete_allocator a;
|
||||
thrust::detail::destroy_range(a, ptr, n);
|
||||
thrust::device_free(ptr);
|
||||
} // end device_delete()
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,44 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_free.inl
|
||||
* \brief Inline file for device_free.h.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/device_free.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/detail/malloc_and_free.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
void device_free(thrust::device_ptr<void> ptr)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef thrust::iterator_system< thrust::device_ptr<void> >::type system;
|
||||
|
||||
// XXX lower to select_system(system) here
|
||||
system s;
|
||||
|
||||
thrust::free(s, ptr);
|
||||
} // end device_free()
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,60 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_malloc.inl
|
||||
* \brief Inline file for device_malloc.h.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/device_malloc.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/detail/malloc_and_free.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
thrust::device_ptr<void> device_malloc(const std::size_t n)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef thrust::iterator_system< thrust::device_ptr<void> >::type system;
|
||||
|
||||
// XXX lower to select_system(system) here
|
||||
system s;
|
||||
|
||||
return thrust::device_ptr<void>(thrust::malloc(s, n).get());
|
||||
} // end device_malloc()
|
||||
|
||||
|
||||
template<typename T>
|
||||
thrust::device_ptr<T> device_malloc(const std::size_t n)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef thrust::iterator_system< thrust::device_ptr<void> >::type system;
|
||||
|
||||
// XXX lower to select_system(system) here
|
||||
system s;
|
||||
|
||||
return thrust::device_ptr<T>(thrust::malloc<T>(s,n).get());
|
||||
} // end device_malloc()
|
||||
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,60 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_new.inl
|
||||
* \brief Inline file for device_new.h.
|
||||
*/
|
||||
|
||||
#include <thrust/device_new.h>
|
||||
#include <thrust/device_malloc.h>
|
||||
#include <thrust/uninitialized_fill.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename T>
|
||||
device_ptr<T> device_new(device_ptr<void> p,
|
||||
const size_t n)
|
||||
{
|
||||
// XXX TODO dispatch n null device constructors at p here
|
||||
// in the meantime, dispatch 1 null host constructor here
|
||||
// and dispatch n copy constructors
|
||||
return device_new<T>(p, T(), n);
|
||||
} // end device_new()
|
||||
|
||||
template<typename T>
|
||||
device_ptr<T> device_new(device_ptr<void> p,
|
||||
const T &exemplar,
|
||||
const size_t n)
|
||||
{
|
||||
device_ptr<T> result(reinterpret_cast<T*>(p.get()));
|
||||
|
||||
// run copy constructors at p here
|
||||
thrust::uninitialized_fill(result, result + n, exemplar);
|
||||
|
||||
return result;
|
||||
} // end device_new()
|
||||
|
||||
template<typename T>
|
||||
device_ptr<T> device_new(const size_t n)
|
||||
{
|
||||
// call placement new
|
||||
return device_new<T>(thrust::device_malloc<T>(n));
|
||||
} // end device_new()
|
||||
|
||||
} // thrust
|
||||
|
||||
@@ -0,0 +1,74 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_ptr.inl
|
||||
* \brief Inline file for device_ptr.h.
|
||||
*/
|
||||
|
||||
#include <thrust/device_ptr.h>
|
||||
#include <thrust/device_reference.h>
|
||||
#include <iostream>
|
||||
|
||||
#include <thrust/detail/type_traits.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename T>
|
||||
device_ptr<T> device_pointer_cast(T *ptr)
|
||||
{
|
||||
return device_ptr<T>(ptr);
|
||||
} // end device_pointer_cast()
|
||||
|
||||
template<typename T>
|
||||
device_ptr<T> device_pointer_cast(const device_ptr<T> &ptr)
|
||||
{
|
||||
return ptr;
|
||||
} // end device_pointer_cast()
|
||||
|
||||
// output to ostream
|
||||
template<class E, class T, class Y>
|
||||
std::basic_ostream<E, T> &operator<<(std::basic_ostream<E, T> &os, const device_ptr<Y> &p)
|
||||
{
|
||||
return os << p.get();
|
||||
} // end operator<<()
|
||||
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename T>
|
||||
struct is_device_ptr< thrust::device_ptr<T> >
|
||||
: public true_type
|
||||
{
|
||||
}; // end is_device_ptr
|
||||
|
||||
#if (THRUST_HOST_COMPILER == THRUST_HOST_COMPILER_MSVC) && (_MSC_VER <= 1400)
|
||||
// XXX WAR MSVC 2005 problem with correctly implementing
|
||||
// pointer_raw_pointer for device_ptr by specializing it here
|
||||
template<typename T>
|
||||
struct pointer_raw_pointer< thrust::device_ptr<T> >
|
||||
{
|
||||
typedef typename device_ptr<T>::raw_pointer type;
|
||||
}; // end pointer_raw_pointer
|
||||
#endif
|
||||
|
||||
|
||||
} // end namespace detail
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,53 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_reference.inl
|
||||
* \brief Inline file for device_reference.h.
|
||||
*/
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/device_reference.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename T>
|
||||
template<typename OtherT>
|
||||
device_reference<T> &
|
||||
device_reference<T>
|
||||
::operator=(const device_reference<OtherT> &other)
|
||||
{
|
||||
return super_t::operator=(other);
|
||||
} // end operator=()
|
||||
|
||||
template<typename T>
|
||||
device_reference<T> &
|
||||
device_reference<T>
|
||||
::operator=(const value_type &x)
|
||||
{
|
||||
return super_t::operator=(x);
|
||||
} // end operator=()
|
||||
|
||||
template<typename T>
|
||||
__host__ __device__
|
||||
void swap(device_reference<T> &a, device_reference<T> &b)
|
||||
{
|
||||
a.swap(b);
|
||||
} // end swap()
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,37 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file device_vector.inl
|
||||
* \brief Inline file for device_vector.h.
|
||||
*/
|
||||
|
||||
#include <thrust/host_vector.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
template<typename T, typename Alloc>
|
||||
template<typename OtherT, typename OtherAlloc>
|
||||
device_vector<T,Alloc>
|
||||
::device_vector(const host_vector<OtherT,OtherAlloc> &v)
|
||||
:Parent(v)
|
||||
{
|
||||
;
|
||||
} // end device_vector::device_vector()
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,59 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file trivial_copy.h
|
||||
* \brief Device implementations for copying memory between host and device.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/detail/type_traits.h>
|
||||
#include <thrust/iterator/detail/is_trivial_iterator.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
namespace dispatch
|
||||
{
|
||||
|
||||
|
||||
// a trivial copy's iterator's value_types match,
|
||||
// the iterators themselves are normal_iterators
|
||||
// and the ToIterator's value_type has_trivial_assign
|
||||
template<typename FromIterator, typename ToIterator>
|
||||
struct is_trivial_copy :
|
||||
integral_constant<
|
||||
bool,
|
||||
is_same<
|
||||
typename thrust::iterator_value<FromIterator>::type,
|
||||
typename thrust::iterator_value<ToIterator>::type
|
||||
>::value
|
||||
&& is_trivial_iterator<FromIterator>::value
|
||||
&& is_trivial_iterator<ToIterator>::value
|
||||
&& has_trivial_assign<typename thrust::iterator_value<ToIterator>::type>::value
|
||||
> {};
|
||||
|
||||
} // end namespace dispatch
|
||||
|
||||
} // end namespace detail
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,39 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file distance.inl
|
||||
* \brief Inline file for distance.h
|
||||
*/
|
||||
|
||||
#include <thrust/advance.h>
|
||||
#include <thrust/system/detail/generic/distance.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename InputIterator>
|
||||
inline typename thrust::iterator_traits<InputIterator>::difference_type
|
||||
distance(InputIterator first, InputIterator last)
|
||||
{
|
||||
return thrust::system::detail::generic::distance(first, last);
|
||||
} // end distance()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,82 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file equal.inl
|
||||
* \brief Inline file for equal.h.
|
||||
*/
|
||||
|
||||
#include <thrust/equal.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/equal.h>
|
||||
#include <thrust/system/detail/adl/equal.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename System, typename InputIterator1, typename InputIterator2>
|
||||
bool equal(const thrust::detail::execution_policy_base<System> &system, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
|
||||
{
|
||||
using thrust::system::detail::generic::equal;
|
||||
return equal(thrust::detail::derived_cast(thrust::detail::strip_const(system)), first1, last1, first2);
|
||||
} // end equal()
|
||||
|
||||
|
||||
template<typename System, typename InputIterator1, typename InputIterator2, typename BinaryPredicate>
|
||||
bool equal(const thrust::detail::execution_policy_base<System> &system, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate binary_pred)
|
||||
{
|
||||
using thrust::system::detail::generic::equal;
|
||||
return equal(thrust::detail::derived_cast(thrust::detail::strip_const(system)), first1, last1, first2, binary_pred);
|
||||
} // end equal()
|
||||
|
||||
|
||||
template <typename InputIterator1, typename InputIterator2>
|
||||
bool equal(InputIterator1 first1, InputIterator1 last1,
|
||||
InputIterator2 first2)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator1>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator2>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::equal(select_system(system1,system2), first1, last1, first2);
|
||||
}
|
||||
|
||||
|
||||
template <typename InputIterator1, typename InputIterator2,
|
||||
typename BinaryPredicate>
|
||||
bool equal(InputIterator1 first1, InputIterator1 last1,
|
||||
InputIterator2 first2, BinaryPredicate binary_pred)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<InputIterator1>::type System1;
|
||||
typedef typename thrust::iterator_system<InputIterator2>::type System2;
|
||||
|
||||
System1 system1;
|
||||
System2 system2;
|
||||
|
||||
return thrust::equal(select_system(system1,system2), first1, last1, first2, binary_pred);
|
||||
}
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,84 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/detail/raw_pointer_cast.h>
|
||||
#include <thrust/detail/type_traits/pointer_traits.h>
|
||||
#include <thrust/detail/allocator/allocator_traits.h>
|
||||
#include <thrust/detail/util/blocking.h>
|
||||
#include <thrust/pair.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
template<typename ToPointer, typename FromPointer>
|
||||
__host__ __device__
|
||||
ToPointer reinterpret_pointer_cast(FromPointer ptr)
|
||||
{
|
||||
typedef typename thrust::detail::pointer_element<ToPointer>::type to_element;
|
||||
return ToPointer(reinterpret_cast<to_element*>(thrust::raw_pointer_cast(ptr)));
|
||||
}
|
||||
|
||||
|
||||
template<typename Allocator, template <typename> class BaseSystem>
|
||||
struct execute_with_allocator
|
||||
: BaseSystem<execute_with_allocator<Allocator, BaseSystem> >
|
||||
{
|
||||
Allocator &m_alloc;
|
||||
|
||||
execute_with_allocator(Allocator &alloc)
|
||||
: m_alloc(alloc)
|
||||
{}
|
||||
|
||||
template<typename T>
|
||||
friend thrust::pair<T*,std::ptrdiff_t>
|
||||
get_temporary_buffer(execute_with_allocator &system, std::ptrdiff_t n)
|
||||
{
|
||||
typedef typename thrust::detail::allocator_traits<Allocator> alloc_traits;
|
||||
typedef typename alloc_traits::void_pointer void_pointer;
|
||||
typedef typename alloc_traits::size_type size_type;
|
||||
typedef typename alloc_traits::value_type value_type;
|
||||
|
||||
// how many elements of type value_type do we need to accomodate n elements of type T?
|
||||
size_type num_elements = thrust::detail::util::divide_ri(sizeof(T) * n, sizeof(value_type));
|
||||
|
||||
// allocate that many
|
||||
void_pointer ptr = alloc_traits::allocate(system.m_alloc, num_elements);
|
||||
|
||||
// return the pointer and the number of elements of type T allocated
|
||||
return thrust::make_pair(thrust::detail::reinterpret_pointer_cast<T*>(ptr),n);
|
||||
}
|
||||
|
||||
template<typename Pointer>
|
||||
friend void return_temporary_buffer(execute_with_allocator &system, Pointer p)
|
||||
{
|
||||
typedef typename thrust::detail::allocator_traits<Allocator> alloc_traits;
|
||||
typedef typename alloc_traits::pointer pointer;
|
||||
|
||||
// return the pointer to the allocator
|
||||
pointer to_ptr = thrust::detail::reinterpret_pointer_cast<pointer>(p);
|
||||
alloc_traits::deallocate(system.m_alloc, to_ptr, 0);
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
} // end detail
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,78 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
namespace detail
|
||||
{
|
||||
|
||||
|
||||
// execution_policy_base serves as a guard against
|
||||
// inifinite recursion in thrust entry points:
|
||||
//
|
||||
// template<typename DerivedPolicy>
|
||||
// void foo(const thrust::detail::execution_policy_base<DerivedPolicy> &s)
|
||||
// {
|
||||
// using thrust::system::detail::generic::foo;
|
||||
//
|
||||
// foo(thrust::detail::derived_cast(thrust::detail::strip_const(s));
|
||||
// }
|
||||
//
|
||||
// foo is not recursive when
|
||||
// 1. DerivedPolicy is derived from thrust::execution_policy below
|
||||
// 2. generic::foo takes thrust::execution_policy as a parameter
|
||||
template<typename DerivedPolicy> struct execution_policy_base {};
|
||||
|
||||
|
||||
template<typename DerivedPolicy>
|
||||
__host__ __device__
|
||||
inline execution_policy_base<DerivedPolicy> &strip_const(const execution_policy_base<DerivedPolicy> &x)
|
||||
{
|
||||
return const_cast<execution_policy_base<DerivedPolicy>&>(x);
|
||||
}
|
||||
|
||||
|
||||
template<typename DerivedPolicy>
|
||||
__host__ __device__
|
||||
inline DerivedPolicy &derived_cast(execution_policy_base<DerivedPolicy> &x)
|
||||
{
|
||||
return static_cast<DerivedPolicy&>(x);
|
||||
}
|
||||
|
||||
|
||||
template<typename DerivedPolicy>
|
||||
__host__ __device__
|
||||
inline const DerivedPolicy &derived_cast(const execution_policy_base<DerivedPolicy> &x)
|
||||
{
|
||||
return static_cast<const DerivedPolicy&>(x);
|
||||
}
|
||||
|
||||
|
||||
} // end detail
|
||||
|
||||
|
||||
template<typename DerivedPolicy>
|
||||
struct execution_policy
|
||||
: thrust::detail::execution_policy_base<DerivedPolicy>
|
||||
{};
|
||||
|
||||
|
||||
} // end thrust
|
||||
|
||||
@@ -0,0 +1,160 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
#include <thrust/detail/config.h>
|
||||
#include <thrust/extrema.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/extrema.h>
|
||||
#include <thrust/system/detail/adl/extrema.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator>
|
||||
ForwardIterator min_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::min_element;
|
||||
return min_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last);
|
||||
} // end min_element()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename BinaryPredicate>
|
||||
ForwardIterator min_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last, BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::min_element;
|
||||
return min_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, comp);
|
||||
} // end min_element()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator>
|
||||
ForwardIterator max_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::max_element;
|
||||
return max_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last);
|
||||
} // end max_element()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename BinaryPredicate>
|
||||
ForwardIterator max_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last, BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::max_element;
|
||||
return max_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, comp);
|
||||
} // end max_element()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator>
|
||||
thrust::pair<ForwardIterator,ForwardIterator> minmax_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::minmax_element;
|
||||
return minmax_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last);
|
||||
} // end minmax_element()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename BinaryPredicate>
|
||||
thrust::pair<ForwardIterator,ForwardIterator> minmax_element(const thrust::detail::execution_policy_base<DerivedPolicy> &exec, ForwardIterator first, ForwardIterator last, BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::minmax_element;
|
||||
return minmax_element(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, comp);
|
||||
} // end minmax_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator>
|
||||
ForwardIterator min_element(ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::min_element(select_system(system), first, last);
|
||||
} // end min_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator, typename BinaryPredicate>
|
||||
ForwardIterator min_element(ForwardIterator first, ForwardIterator last,
|
||||
BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::min_element(select_system(system), first, last, comp);
|
||||
} // end min_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator>
|
||||
ForwardIterator max_element(ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::max_element(select_system(system), first, last);
|
||||
} // end max_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator, typename BinaryPredicate>
|
||||
ForwardIterator max_element(ForwardIterator first, ForwardIterator last,
|
||||
BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::max_element(select_system(system), first, last, comp);
|
||||
} // end max_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator>
|
||||
thrust::pair<ForwardIterator,ForwardIterator>
|
||||
minmax_element(ForwardIterator first, ForwardIterator last)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::minmax_element(select_system(system), first, last);
|
||||
} // end minmax_element()
|
||||
|
||||
|
||||
template <typename ForwardIterator, typename BinaryPredicate>
|
||||
thrust::pair<ForwardIterator,ForwardIterator>
|
||||
minmax_element(ForwardIterator first, ForwardIterator last, BinaryPredicate comp)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::minmax_element(select_system(system), first, last, comp);
|
||||
} // end minmax_element()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
@@ -0,0 +1,85 @@
|
||||
/*
|
||||
* Copyright 2008-2012 NVIDIA Corporation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
|
||||
/*! \file fill.inl
|
||||
* \brief Inline file for fill.h.
|
||||
*/
|
||||
|
||||
#include <thrust/fill.h>
|
||||
#include <thrust/iterator/iterator_traits.h>
|
||||
#include <thrust/system/detail/generic/select_system.h>
|
||||
#include <thrust/system/detail/generic/fill.h>
|
||||
#include <thrust/system/detail/adl/fill.h>
|
||||
|
||||
namespace thrust
|
||||
{
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename ForwardIterator, typename T>
|
||||
void fill(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T &value)
|
||||
{
|
||||
using thrust::system::detail::generic::fill;
|
||||
return fill(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, last, value);
|
||||
} // end fill()
|
||||
|
||||
|
||||
template<typename DerivedPolicy, typename OutputIterator, typename Size, typename T>
|
||||
OutputIterator fill_n(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
|
||||
OutputIterator first,
|
||||
Size n,
|
||||
const T &value)
|
||||
{
|
||||
using thrust::system::detail::generic::fill_n;
|
||||
return fill_n(thrust::detail::derived_cast(thrust::detail::strip_const(exec)), first, n, value);
|
||||
} // end fill_n()
|
||||
|
||||
|
||||
template<typename ForwardIterator, typename T>
|
||||
void fill(ForwardIterator first,
|
||||
ForwardIterator last,
|
||||
const T &value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<ForwardIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
thrust::fill(select_system(system), first, last, value);
|
||||
} // end fill()
|
||||
|
||||
|
||||
template<typename OutputIterator, typename Size, typename T>
|
||||
OutputIterator fill_n(OutputIterator first,
|
||||
Size n,
|
||||
const T &value)
|
||||
{
|
||||
using thrust::system::detail::generic::select_system;
|
||||
|
||||
typedef typename thrust::iterator_system<OutputIterator>::type System;
|
||||
|
||||
System system;
|
||||
|
||||
return thrust::fill_n(select_system(system), first, n, value);
|
||||
} // end fill()
|
||||
|
||||
|
||||
} // end namespace thrust
|
||||
|
||||
Loaded 100 of 807 files, more files were not shown because too many files have changed in this diff.
Show more
Reference in new issue
Block a user