Initial commit.
This commit is contained in:
commit
04bbbcef56
|
@ -0,0 +1,674 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
|
@ -0,0 +1,32 @@
|
|||
Guile bindings for GnuNet
|
||||
—————————————————————————
|
||||
|
||||
Work in progress!
|
||||
|
||||
To try the stub gnunet-search clone, you must have a working GnuNet
|
||||
configuration. Edit the file `examples/search.scm` and modify the line
|
||||
|
||||
(define config-file "~/.gnunet/gnunet.conf")
|
||||
|
||||
to match your configuration file.
|
||||
|
||||
Run Guile in the bindings directory:
|
||||
|
||||
$ cd guix/gnunet/
|
||||
$ guile
|
||||
|
||||
Then in Guile’s prompt:
|
||||
|
||||
> (add-to-load-path ".")
|
||||
> (load "examples/search.scm")
|
||||
> ,m (gnunet-search)
|
||||
> (main "foo")
|
||||
|
||||
This will start a 5 seconds search on the keyword “foo”. Here’s the
|
||||
output when exactly one find matches the keyword “foo”:
|
||||
|
||||
> (main "foo")
|
||||
Search service opened (#<pointer 0x2414dd8>)
|
||||
Starting search on gnunet://fs/ksk/foo
|
||||
RESULT! #<pointer 0x7ffcd822ee50>
|
||||
|
|
@ -0,0 +1,47 @@
|
|||
#!/usr/bin/guile \
|
||||
-e main -s
|
||||
!#
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnunet-search)
|
||||
#:use-module (ice-9 match)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (gnu gnunet container metadata)
|
||||
#:use-module (gnu gnunet fs)
|
||||
#:use-module (gnu gnunet fs uri)
|
||||
#:use-module (gnu gnunet fs progress-info)
|
||||
#:use-module (gnu gnunet configuration)
|
||||
#:use-module (gnu gnunet scheduler))
|
||||
|
||||
(define config-file "~/.gnunet/gnunet.conf")
|
||||
(define count-limit 10)
|
||||
|
||||
|
||||
(define (result-cb info)
|
||||
(simple-format #t "RESULT! ~a\n" info))
|
||||
|
||||
(define (main args)
|
||||
(let ((config (load-configuration config-file)))
|
||||
(define (first-task _)
|
||||
(let ((search-service
|
||||
(search-service-open config #:result result-cb)))
|
||||
(simple-format #t "Search service opened (~a)\n" search-service)
|
||||
(let ((current-search (start-ksk-search search-service args)))
|
||||
;; adds a timeout in 5 seconds
|
||||
(add-task! (lambda (_)
|
||||
(stop-search current-search))
|
||||
#:delay (* 5 1000 1000)))))
|
||||
(call-with-scheduler config first-task)))
|
|
@ -0,0 +1,88 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet binding-utils)
|
||||
#:use-module (ice-9 match)
|
||||
#:use-module ((srfi srfi-1) #:select (find))
|
||||
#:use-module ((rnrs base) #:select (assert))
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (system foreign)
|
||||
#:export (getf
|
||||
interleave
|
||||
|
||||
rassq
|
||||
rassq-ref
|
||||
rassv
|
||||
rassv-ref
|
||||
rassoc
|
||||
rassoc-ref
|
||||
|
||||
string->pointer*
|
||||
make-c-struct*))
|
||||
|
||||
(define (getf plist value)
|
||||
(let ((entry (member value plist)))
|
||||
(if entry (cadr entry) #f)))
|
||||
|
||||
;; reverse association lists
|
||||
(define-syntax-rule (define-assoc name name-ref test)
|
||||
(begin
|
||||
(define (name alist value)
|
||||
"Return the first entry in ALIST with the given VALUE."
|
||||
(find (match-lambda ((_ . val) (test value val))) alist))
|
||||
|
||||
(define (name-ref alist value)
|
||||
"Return the key from the first entry in ALIST with the given VALUE."
|
||||
(car (or (name alist value) '(#f . #f))))))
|
||||
|
||||
(define-assoc rassq rassq-ref eq?)
|
||||
(define-assoc rassv rassv-ref eqv?)
|
||||
(define-assoc rassoc rassoc-ref equal?)
|
||||
|
||||
(define (interleave obj lst)
|
||||
"Interleaves OBJ in LST.
|
||||
|
||||
(interleave '& '(kirk spock ahura sulu scotty))
|
||||
⇒
|
||||
(kirk & spock & ahura & sulu & scotty)"
|
||||
(define (%interleave lst)
|
||||
(if (null? lst)
|
||||
lst
|
||||
(cons obj (cons (car lst) (%interleave (cdr lst))))))
|
||||
(if (or (null? lst) (null? (cdr lst)))
|
||||
lst
|
||||
(cons (car lst) (%interleave (cdr lst)))))
|
||||
|
||||
;;; FFI utilities
|
||||
|
||||
(define (string->pointer* string)
|
||||
"Return a foreign pointer to a nul-terminated copy of STRING, or %null-pointer
|
||||
if STRING is empty (\"\")."
|
||||
(if (string=? "" string) %null-pointer (string->pointer string)))
|
||||
|
||||
(define (make-c-struct* types)
|
||||
"Create a foreign pointer to a zeroed C struct from TYPES."
|
||||
(assert (not (null? types)))
|
||||
(letrec ((spec->zeros (lambda (spec)
|
||||
(match spec
|
||||
('* %null-pointer)
|
||||
((? number?) 0)
|
||||
((? list? lst) (map spec->zeros lst))
|
||||
(_ (scm-error 'wrong-type-arg "make-c-struct*"
|
||||
"Wrong argument in position 1: (… ~a …)"
|
||||
(list spec) #f))))))
|
||||
(make-c-struct types (map spec->zeros types))))
|
|
@ -0,0 +1,105 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet common)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (system foreign-padded)
|
||||
#:use-module (rnrs base)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:export (gnunet-ok
|
||||
gnunet-system-error
|
||||
gnunet-yes
|
||||
gnunet-no
|
||||
|
||||
time-relative
|
||||
time-absolute
|
||||
ecdsa-public-key
|
||||
eddsa-public-key
|
||||
eddsa-signature
|
||||
hashcode
|
||||
|
||||
define-foreign-definer
|
||||
|
||||
gnunet-util-ffi
|
||||
gnunet-fs-ffi
|
||||
define-gnunet
|
||||
define-gnunet-fs
|
||||
|
||||
%make-blob-pointer
|
||||
%malloc
|
||||
%free))
|
||||
|
||||
|
||||
(define time-relative uint64)
|
||||
(define time-absolute uint64)
|
||||
(define ecdsa-public-key (list (padding (/ 256 8))))
|
||||
(define eddsa-public-key ecdsa-public-key)
|
||||
(define eddsa-signature (list (padding (/ 256 8))
|
||||
(padding (/ 256 8))))
|
||||
(define hashcode (list (padding 16 uint32)))
|
||||
|
||||
(define gnunet-ok 1)
|
||||
(define gnunet-system-error -1)
|
||||
(define gnunet-yes 1)
|
||||
(define gnunet-no 0)
|
||||
|
||||
(define gnunet-util-ffi (dynamic-link "/usr/local/lib/libgnunetutil"))
|
||||
(define gnunet-fs-ffi (dynamic-link "/usr/local/lib/libgnunetfs"))
|
||||
|
||||
|
||||
(define-syntax define-foreign-definer
|
||||
(syntax-rules ()
|
||||
((_ definer-name ffi-var)
|
||||
(define-syntax definer-name
|
||||
(syntax-rules (: ->)
|
||||
((_ func name : in -> out)
|
||||
(define func
|
||||
(pointer->procedure out (dynamic-func name ffi-var) in))))))))
|
||||
|
||||
(define-foreign-definer define-gnunet gnunet-util-ffi)
|
||||
(define-foreign-definer define-gnunet-fs gnunet-fs-ffi)
|
||||
|
||||
(define-gnunet %xfree "GNUNET_xfree_" : (list '* '* int) -> void)
|
||||
(define-gnunet %xmalloc "GNUNET_xmalloc_" : (list size_t '* int) -> '*)
|
||||
|
||||
|
||||
(define %xfilename (string->pointer "guile"))
|
||||
|
||||
(define (%free pointer)
|
||||
(assert (not (eq? %null-pointer pointer)))
|
||||
(%xfree pointer %xfilename 0))
|
||||
|
||||
(define (%malloc size)
|
||||
"Allocates SIZE bytes on the C heap."
|
||||
;; note: if %xmalloc couldn’t do the allocation (out of memory), it calls
|
||||
;; abort(), and the whole guile process core dumps; at least, we’re assured
|
||||
;; %xmalloc will never return a null pointer…
|
||||
(%xmalloc size %xfilename 0))
|
||||
|
||||
(define (%make-blob-pointer)
|
||||
(bytevector->pointer (make-bytevector (sizeof ptrdiff_t) 0)))
|
||||
|
||||
;;+TODO: what about (getenv "GNUNET_ARGS") ?
|
||||
;;+TODO: skew-offset and skew-variance:
|
||||
;; GNUNET_TIME_set_offset(offset - variance)
|
||||
;;+TODO: what about defining the configuration entry ("arm" "CONFIG")?
|
||||
;; (define-syntax with-gnunet
|
||||
;; (syntax-rules ()
|
||||
;; ((_ (config-file-name) thunk)
|
||||
;; (let ((cfg-handle (load-configuration config-file-name)))
|
||||
|
|
@ -0,0 +1,79 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet configuration)
|
||||
#:use-module (srfi srfi-9)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (system foreign-padded)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:export (<configuration>
|
||||
load-configuration
|
||||
configuration?
|
||||
unwrap-configuration
|
||||
configuration-ref))
|
||||
|
||||
(define-record-type <configuration>
|
||||
(wrap-configuration pointer)
|
||||
configuration?
|
||||
(pointer unwrap-configuration))
|
||||
|
||||
(define-gnunet %create "GNUNET_CONFIGURATION_create" : '() -> '*)
|
||||
(define %destroy (dynamic-func "GNUNET_CONFIGURATION_destroy" gnunet-util-ffi))
|
||||
(define-gnunet %load "GNUNET_CONFIGURATION_load" : '(* *) -> int)
|
||||
|
||||
(define-gnunet %get-value-number
|
||||
"GNUNET_CONFIGURATION_get_value_number" : '(* * * *) -> int)
|
||||
(define-gnunet %get-value-string
|
||||
"GNUNET_CONFIGURATION_get_value_string" : '(* * * *) -> int)
|
||||
|
||||
(define (load-configuration filename)
|
||||
"Load GnuNet default configuration (a set of files sometimes placed
|
||||
in `/usr/share/gnunet/config.d/`), and then the configuration file
|
||||
denoted by FILENAME. Returns a configuration handle."
|
||||
(let ((%handle (%create)))
|
||||
(when (eq? %null-pointer %handle)
|
||||
(throw 'memory-allocation-error "load-configuration" %create))
|
||||
(set-pointer-finalizer! %handle %destroy)
|
||||
(when (not (= gnunet-ok (%load %handle (string->pointer filename))))
|
||||
(throw 'file-unavailable "load-configuration" filename))
|
||||
(wrap-configuration %handle)))
|
||||
|
||||
(define (configuration-ref type config section option)
|
||||
"Get a configuration value from CONFIG. TYPE must be either `integer` or
|
||||
`string`."
|
||||
(let* ((result (make-bytevector (sizeof int) 0))
|
||||
(%result (bytevector->pointer result))
|
||||
(get-value-fun (case type
|
||||
((integer) %get-value-number)
|
||||
((string) %get-value-string)
|
||||
(else (throw 'invalid-arg
|
||||
"configuration-ref" type))))
|
||||
(retval (get-value-fun (unwrap-configuration config)
|
||||
(string->pointer* section)
|
||||
(string->pointer* option)
|
||||
%result)))
|
||||
(if (and (= gnunet-ok retval)
|
||||
(not (eq? %null-pointer result)))
|
||||
(case type
|
||||
((integer)
|
||||
(bytevector-sint-ref result 0 (native-endianness) (sizeof int)))
|
||||
((string)
|
||||
(pointer->string
|
||||
(dereference-pointer (bytevector->pointer result)))))
|
||||
#f)))
|
|
@ -0,0 +1,163 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
;;;; source for libextractor related values:
|
||||
;;;; https://gnunet.org/svn/Extractor/src/include/extractor.h
|
||||
|
||||
(define-module (gnu gnunet container metadata)
|
||||
#:use-module (srfi srfi-1)
|
||||
#:use-module (srfi srfi-9)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:export (<metadata>
|
||||
make-metadata
|
||||
metadata?
|
||||
wrap-metadata
|
||||
unwrap-metadata
|
||||
|
||||
<metadata-item>
|
||||
make-metadata-item
|
||||
metadata-item?
|
||||
metadata-item-name
|
||||
metadata-item-type
|
||||
metadata-item-format
|
||||
metadata-item-mime-type
|
||||
metadata-item-data
|
||||
|
||||
metadata-set!
|
||||
metadata-ref
|
||||
metadata-iterate
|
||||
metadata-map))
|
||||
|
||||
|
||||
(define-record-type <metadata>
|
||||
(%wrap-metadata pointer)
|
||||
metadata?
|
||||
(pointer unwrap-metadata))
|
||||
|
||||
|
||||
(define metaformat-alist
|
||||
'((#:unknown . 0)
|
||||
(#:utf8 . 1)
|
||||
(#:binary . 2)
|
||||
(#:c-string . 3)))
|
||||
|
||||
(define (metaformat->integer format)
|
||||
(or (assq-ref metaformat-alist format)
|
||||
(throw 'invalid-arg "metaformat->integer" format)))
|
||||
|
||||
(define (integer->metaformat n)
|
||||
(or (rassq-ref metaformat-alist n)
|
||||
(begin (warn "Invalid metaformat code" n)
|
||||
#:unknown)))
|
||||
|
||||
(define metadata-type-alist
|
||||
'((#:unknown . 45)
|
||||
(#:original-filename . 180)))
|
||||
|
||||
(define (metadata-type->integer type)
|
||||
(or (assq-ref metadata-type-alist type)
|
||||
(throw 'invalid-arg "metadata-type->integer" type)))
|
||||
|
||||
(define (integer->metadata-type n)
|
||||
(or (rassq-ref metadata-type-alist n)
|
||||
(begin (warn "Invalid metadata type code" n)
|
||||
#:unknown)))
|
||||
|
||||
(define-gnunet %metadata-create
|
||||
"GNUNET_CONTAINER_meta_data_create" : '() -> '*)
|
||||
|
||||
(define %metadata-destroy
|
||||
(dynamic-func "GNUNET_CONTAINER_meta_data_destroy" gnunet-util-ffi))
|
||||
|
||||
(define-gnunet %metadata-insert
|
||||
"GNUNET_CONTAINER_meta_data_insert" :
|
||||
(list '* '* unsigned-int unsigned-int '* '* size_t) -> int)
|
||||
|
||||
(define-gnunet %metadata-get-by-type
|
||||
"GNUNET_CONTAINER_meta_data_get_by_type" : (list '* unsigned-int) -> '*)
|
||||
|
||||
(define-gnunet %metadata-iterate
|
||||
"GNUNET_CONTAINER_meta_data_iterate" : (list '* '* '*) -> int)
|
||||
|
||||
|
||||
(define* (wrap-metadata pointer #:key (finalize #f))
|
||||
(when finalize
|
||||
(set-pointer-finalizer! pointer %metadata-destroy))
|
||||
(%wrap-metadata pointer))
|
||||
|
||||
(define (make-metadata)
|
||||
(wrap-metadata (%metadata-create)))
|
||||
|
||||
(define-record-type <metadata-item>
|
||||
(make-metadata-item name type format mime-type data)
|
||||
metadata-item?
|
||||
(name metadata-item-name)
|
||||
(type metadata-item-type)
|
||||
(format metadata-item-format)
|
||||
(mime-type metadata-item-mime-type)
|
||||
(data metadata-item-data))
|
||||
|
||||
(define (metadata-item->list item)
|
||||
(list (string->pointer (metadata-item-name item))
|
||||
(metadata-type->integer (metadata-item-type item))
|
||||
(metaformat->integer (metadata-item-format item))
|
||||
(string->pointer (metadata-item-mime-type item))
|
||||
(bytevector->pointer (metadata-item-data item))
|
||||
(bytevector-length (metadata-item-data item))))
|
||||
|
||||
(define (metadata-set! metadata item)
|
||||
(apply %metadata-insert (unwrap-metadata metadata)
|
||||
(metadata-item->list item)))
|
||||
|
||||
(define (metadata-ref metadata type)
|
||||
(pointer->string
|
||||
(%metadata-get-by-type (unwrap-metadata metadata)
|
||||
(metadata-type->integer type))))
|
||||
|
||||
(define (metadata-iterate f metadata)
|
||||
"Iterate through metadata, calling f on each entry found until no entry remain
|
||||
or f returns #f.
|
||||
|
||||
f: plugin-name × metadata-type × metaformat × mime-type × data → bool
|
||||
where plugin-name is a string,
|
||||
metadata-type is either #:original-filename or #:unknown
|
||||
metaformat is either #:unknown, #:utf8, #:binary or #:c-string,
|
||||
mime-type is a string,
|
||||
data is a bytevector."
|
||||
(let* ((f* (lambda (_ plugin-name metadata-type metaformat
|
||||
data-mime-type data-pointer data-size)
|
||||
(if (f (pointer->string plugin-name)
|
||||
(integer->metadata-type metadata-type)
|
||||
(integer->metaformat metaformat)
|
||||
(pointer->string data-mime-type)
|
||||
(pointer->bytevector data-pointer data-size))
|
||||
0 1)))
|
||||
(f-pointer (procedure->pointer
|
||||
int f*
|
||||
(list '* '* unsigned-int unsigned-int '* '* size_t))))
|
||||
(%metadata-iterate (unwrap-metadata metadata) f-pointer %null-pointer)))
|
||||
|
||||
(define (metadata-map f metadata)
|
||||
(let ((result '()))
|
||||
(metadata-iterate (lambda (. args)
|
||||
(set! result (cons (apply f args) result))
|
||||
0)
|
||||
metadata)
|
||||
(reverse result)))
|
|
@ -0,0 +1,114 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet fs)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet configuration)
|
||||
#:use-module (gnu gnunet fs uri)
|
||||
#:use-module (gnu gnunet fs progress-info)
|
||||
#:export (search-service-open
|
||||
start-ksk-search
|
||||
stop-search
|
||||
is-directory?))
|
||||
|
||||
(define struct-fs-handle
|
||||
(list '* '* '* '* '* '* '* '* '* '* '* '* '* '* time-relative
|
||||
unsigned-int unsigned-int unsigned-int unsigned-int unsigned-int))
|
||||
|
||||
(define struct-search-context
|
||||
(list '* '* '* '* '* '* '* '* '* '* time-absolute time-relative '*
|
||||
unsigned-int unsigned-int uint32 uint32 unsigned-int))
|
||||
|
||||
(define struct-download-context
|
||||
(list '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '* '*
|
||||
eddsa-public-key '* uint64 uint64 uint64 uint64 time-absolute
|
||||
time-relative uint32 unsigned-int unsigned-int int int int))
|
||||
|
||||
(define default-max-parallel-downloads 16)
|
||||
(define default-max-parallel-requests (* 1024 10))
|
||||
|
||||
(define-gnunet-fs %search-start
|
||||
"GNUNET_FS_search_start" : (list '* '* uint32 unsigned-int '*) -> '*)
|
||||
|
||||
(define-gnunet-fs %search-stop
|
||||
"GNUNET_FS_search_stop" : (list '*) -> void)
|
||||
|
||||
(define-gnunet-fs %test-for-directory
|
||||
"GNUNET_FS_meta_data_test_for_directory" : (list '*) -> int)
|
||||
|
||||
(define (progress-callback->pointer thunk)
|
||||
(procedure->pointer '* (lambda (cls info)
|
||||
(thunk info)
|
||||
%null-pointer)
|
||||
(list '* '*)))
|
||||
|
||||
;; This is a temporary replacement for the actual GNUNET_FS_start function that
|
||||
;; is variadic and, hence, not currently handlable by Guile’s Dynamic FFI.
|
||||
;;
|
||||
;;+TODO: replace value for avg_block_latency with a call to a function
|
||||
;; akin `(time-relative #:minutes 1)`
|
||||
(define (%gnunet-fs-start config client-name progress-callback)
|
||||
(make-c-struct struct-fs-handle
|
||||
(list (unwrap-configuration config)
|
||||
(string->pointer client-name)
|
||||
(progress-callback->pointer progress-callback)
|
||||
%null-pointer ; progress-cb closure
|
||||
%null-pointer ; top_head
|
||||
%null-pointer ; top_tail
|
||||
%null-pointer ; running_head
|
||||
%null-pointer ; running_tail
|
||||
%null-pointer ; pending_head
|
||||
%null-pointer ; pending_tail
|
||||
%null-pointer ; probes_head
|
||||
%null-pointer ; probes_tail
|
||||
%null-pointer ; queue_job
|
||||
%null-pointer ; probe_ping_task
|
||||
(* 60 1000 1000) ; avg_block_latency (1 minute)
|
||||
0 ; active_downloads
|
||||
0 ; active_blocks
|
||||
0 ; flags
|
||||
default-max-parallel-downloads
|
||||
default-max-parallel-requests)))
|
||||
|
||||
(define* (search-service-open config
|
||||
#:key resume resume-result suspend result
|
||||
result-namespace update error
|
||||
paused continued result-stopped
|
||||
result-suspend stopped
|
||||
#:rest callbacks)
|
||||
(define (progress-cb %progress-info)
|
||||
(let* ((status (cadr (progress-info-status %progress-info)))
|
||||
(callback (getf callbacks status)))
|
||||
(when callback (callback %progress-info))))
|
||||
(%gnunet-fs-start config "gnunet-search" progress-cb))
|
||||
|
||||
(define (start-ksk-search handle keywords)
|
||||
(let ((uri (make-ksk-uri keywords)))
|
||||
(simple-format #t "Starting search on ~a\n" (uri->string uri))
|
||||
(%search-start handle (unwrap-uri uri) 0 0 %null-pointer)))
|
||||
|
||||
(define (stop-search handle)
|
||||
(%search-stop handle))
|
||||
|
||||
;;+TODO: should be (is-directory? search-result) or
|
||||
;; (result-is-directory? result)
|
||||
(define (is-directory? metadata)
|
||||
"Checks some search result’s METADATA if its mime-type matches
|
||||
GNUNET_FS_DIRECTORY_MIME."
|
||||
(= gnunet-yes (%test-for-directory metadata)))
|
|
@ -0,0 +1,298 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet fs progress-info)
|
||||
#:use-module (ice-9 match)
|
||||
#:use-module (srfi srfi-9)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (system foreign-padded)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet container metadata)
|
||||
#:use-module (gnu gnunet fs uri)
|
||||
#:export (progress-info-status
|
||||
parse-c-progress-info))
|
||||
|
||||
|
||||
(define %progress-info-type
|
||||
(list ; struct GNUNET_FS_ProgressInfo
|
||||
(make-union ; union {…} value
|
||||
(list #:publish ; struct {…} publish
|
||||
'* ; GNUNET_FS_PublishContext *pc;
|
||||
'* ; GNUNET_FS_FileInformation *fi;
|
||||
'* ; void *cctx;
|
||||
'* ; void *pctx;
|
||||
'* ; char *filename;
|
||||
uint64 ; uint64_t size;
|
||||
time-relative ; GNUNET_TIME_Relative eta;
|
||||
time-relative ; GNUNET_TIME_Relative duration;
|
||||
uint64 ; uint64_t completed;
|
||||
uint32 ; uint32_t anonymity;
|
||||
(make-union ; union {…} specifics
|
||||
(list #:progress ; struct {…} progress
|
||||
'* ; void *data;
|
||||
uint64 ; uint64_t offset;
|
||||
uint64 ; uint64_t data_len;
|
||||
unsigned-int) ; unsigned int depth;
|
||||
(list #:progress-directory ; struct {…} progress_directory
|
||||
uint64 ; uint64_t completed;
|
||||
uint64 ; uint64_t total;
|
||||
time-relative) ; GNUNET_TIME_Relative eta;
|
||||
(list #:resume ; struct {…} resume
|
||||
'* ; char *message;
|
||||
'*) ; GNUNET_FS_URI *chk_uri;
|
||||
(list #:completed ; struct {…} completed
|
||||
'*) ; GNUNET_FS_URI *chk_uri;
|
||||
(list #:error ; struct {…} error
|
||||
'*))) ; char *message;
|
||||
(list #:download ; struct {…} download
|
||||
'* ; GNUNET_FS_DownloadContext *dc
|
||||
'* ; void *cctx;
|
||||
'* ; void *pctx;
|
||||
'* ; void *sctx;
|
||||
'* ; GNUNET_FS_Uri *uri;
|
||||
'* ; char *filename;
|
||||
uint64 ; uint64_t size;
|
||||
time-relative ; GNUNET_TIME_Relative eta;
|
||||
time-relative ; GNUNET_TIME_Relative duration;
|
||||
uint64 ; uint64_t completed;
|
||||
uint32 ; uint32_t anonymity;
|
||||
int ; int is_active;
|
||||
(make-union ; union {…} specifics
|
||||
(list #:progress ; struct {…} progress
|
||||
'* ; void *data;
|
||||
uint64 ; uint64_t offset;
|
||||
uint64 ; uint64_t data_len;
|
||||
time-relative ; GNUNET_TIME_Relative block…;
|
||||
unsigned-int ; unsigned int depth;
|
||||
uint32 ; uint32_t respect_offered;
|
||||
uint32) ; uint32_t num_transmissions;
|
||||
(list #:start ; struct {…} start
|
||||
'*) ; GNUNET_CONTAINER_MetaData *m…;
|
||||
(list #:resume ; struct {…} resume
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
'*) ; char *message;
|
||||
(list #:error ; struct {…} error
|
||||
'*))) ; char *message;
|
||||
(list #:search ; struct {…} search
|
||||
'* ; GNUNET_FS_SearchContext *sc;
|
||||
'* ; void *cctx;
|
||||
'* ; void *pctx;
|
||||
'* ; GNUNET_FS_Uri *query;
|
||||
time-relative ; GNUNET_TIME_RELATIVE duration;
|
||||
uint32 ; uint32_t anonymity;
|
||||
(make-union ; union {…} specifics
|
||||
(list #:result ; struct {…} result
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
'* ; GNUNET_FS_Uri *uri;
|
||||
'* ; GNUNET_FS_SearchResult *res…;
|
||||
uint32) ; uint32_t applicability_rank;
|
||||
(list #:resume-result ; struct {…} resume_result
|
||||
'* ; GNUNET_CONTAINER_MetaData m…;
|
||||
'* ; GNUNET_FS_Uri *uri;
|
||||
'* ; GNUNET_FS_SearchResult *res…;
|
||||
int32 ; int32_t availability_rank;
|
||||
uint32 ; uint32_t availability_certa…;
|
||||
uint32) ; uint32_t applicability_rank;
|
||||
(list #:update ; struct {…} update
|
||||
'* ; void *cctx;
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
'* ; GNUNET_FS_Uri *uri;
|
||||
int32 ; int32_t availability_rank;
|
||||
uint32 ; uint32_t availability_certai…;
|
||||
uint32 ; uint32_t applicability_rank;
|
||||
time-relative) ; GNUNET_TIME_Relative current…;
|
||||
(list #:result-suspend ; struct {…} result_suspend
|
||||
'* ; void *cctx
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
'*) ; GNUNET_FS_Uri *uri;
|
||||
(list #:result-stopped ; struct {…} result_stopped
|
||||
'* ; void *cctx;
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
'*) ; GNUNET_FS_Uri *uri;
|
||||
(list #:resume ; struct {…} resume
|
||||
'* ; char *message;
|
||||
int) ; int is_paused;
|
||||
(list #:error ; struct {…} error
|
||||
'*) ; char *message;
|
||||
(list #:ns ; struct {…} ns
|
||||
'* ; char *name;
|
||||
'* ; char *root;
|
||||
'* ; GNUNET_CONTAINER_MetaData *m…;
|
||||
ecdsa-public-key))) ; GNUNET_CRYPTO_Ecdsa…Key pseu…;
|
||||
(list #:unindex ; struct {…} unindex
|
||||
'* ; GNUNET_FS_UnindexContext *uc;
|
||||
'* ; void *cctx;
|
||||
'* ; char *filename;
|
||||
uint64 ; uint64_t size;
|
||||
time-relative ; GNUNET_TIME_Relative eta;
|
||||
time-relative ; GNUNET_TIME_Relative duration;
|
||||
uint64 ; uint64_t completed;
|
||||
(make-union ; union {…} specifics
|
||||
(list #:progress ; struct {…} progress
|
||||
'* ; void *data;
|
||||
uint64 ; uint64_t offset;
|
||||
uint64 ; uint64_t data_len;
|
||||
unsigned-int) ; unsigned int depth;
|
||||
(list #:resume ; struct {…} resume
|
||||
'*) ; char *message;
|
||||
(list #:error ; struct {…} error
|
||||
'*)))) ; char *message;
|
||||
unsigned-int ; enum GNUNET_FS_Status status;
|
||||
'*)) ; GNUNET_FS_Handle *fsh;
|
||||
|
||||
(define progress-info-status-alist
|
||||
`((0 #:publish #:start)
|
||||
(1 #:publish #:resume)
|
||||
(2 #:publish #:suspend)
|
||||
(3 #:publish #:progress)
|
||||
(4 #:publish #:error)
|
||||
(5 #:publish #:completed)
|
||||
(6 #:publish #:stopped)
|
||||
(7 #:download #:start)
|
||||
(8 #:download #:resume)
|
||||
(9 #:download #:suspend)
|
||||
(10 #:download #:progress)
|
||||
(11 #:download #:error)
|
||||
(12 #:download #:completed)
|
||||
(13 #:download #:stopped)
|
||||
(14 #:download #:active)
|
||||
(15 #:download #:inactive)
|
||||
(16 #:download #:lost-parent)
|
||||
(17 #:search #:start)
|
||||
(18 #:search #:resume)
|
||||
(19 #:search #:resume-result)
|
||||
(20 #:search #:suspend)
|
||||
(21 #:search #:result)
|
||||
(22 #:search #:result-namespace)
|
||||
(23 #:search #:update)
|
||||
(24 #:search #:error)
|
||||
(25 #:search #:paused)
|
||||
(26 #:search #:continued)
|
||||
(27 #:search #:result-stopped)
|
||||
(28 #:search #:result-suspend)
|
||||
(29 #:search #:stopped)
|
||||
(30 #:unindex #:start)
|
||||
(31 #:unindex #:resume)
|
||||
(32 #:unindex #:suspend)
|
||||
(33 #:unindex #:progress)
|
||||
(34 #:unindex #:error)
|
||||
(35 #:unindex #:completed)
|
||||
(36 #:unindex #:stopped)
|
||||
(37 #:publish #:progress-directory)))
|
||||
|
||||
(define %search-result-type
|
||||
(list '* '* '* '* '* '* '* '* '* '* '* '* hashcode
|
||||
'* time-absolute time-relative
|
||||
uint32 uint32 uint32 uint32 uint32))
|
||||
|
||||
|
||||
(define (integer->progress-info-status n)
|
||||
(or (assq-ref progress-info-status-alist n)
|
||||
(throw 'invalid-arg "integer->progress-info-status" n)))
|
||||
|
||||
(define (progress-info-status->integer status)
|
||||
(or (rassoc-ref progress-info-status-alist status)
|
||||
(throw 'invalid-arg "progress-info-status->integer" status)))
|
||||
|
||||
(define (progress-info-get-type value specifics)
|
||||
"Returns the type specification of struct GNUNET_FS_ProgressInfo
|
||||
when its union `value` is VALUE and its union `specifics` is
|
||||
SPECIFICS."
|
||||
(define (replace-specifics-union type)
|
||||
(match type
|
||||
((? union?) (union-ref specifics type))
|
||||
(_ type)))
|
||||
(define (replace-value-union type)
|
||||
(match type
|
||||
((? union?) (map replace-specifics-union (union-ref value type)))
|
||||
(_ type)))
|
||||
(map replace-value-union %progress-info-type))
|
||||
|
||||
(define (progress-info-status pointer)
|
||||
"Returns the status of a struct GNUNET_FS_ProgressInfo as a list of
|
||||
two keywords. If status is unknown, raises an error."
|
||||
(let* ((size (sizeof unsigned-int))
|
||||
(offset (sizeof* (car %progress-info-type)))
|
||||
(bv (pointer->bytevector pointer size offset))
|
||||
(code (bytevector-uint-ref bv 0 (native-endianness) size)))
|
||||
(integer->progress-info-status code)))
|
||||
|
||||
(define (parse-c-progress-info pointer)
|
||||
(parse-c-struct pointer (apply progress-info-get-type
|
||||
(progress-info-status pointer))))
|
||||
|
||||
|
||||
;;; incomplete mapping of GNUNET_FS_SearchResult
|
||||
;;;+TODO: complete mapping of GNUNET_FS_SearchResult
|
||||
|
||||
(define* (bytevector-u8-fold f bv lst init #:optional
|
||||
(index 0)
|
||||
(start (expt 2 7)))
|
||||
(match lst
|
||||
(() init)
|
||||
((first . rest)
|
||||
(let ((n (bytevector-u8-ref bv index)))
|
||||
(let ((new-init (f init (not (zero? (logand n start))) first))
|
||||
(new-index (if (= 1 start)
|
||||
(+ 1 index)
|
||||
index))
|
||||
(new-start (if (= 1 start)
|
||||
(expt 2 7)
|
||||
(/ start 2))))
|
||||
(bytevector-u8-fold f bv rest new-init new-index new-start))))))
|
||||
|
||||
(define (u8-bitmap->list bv index lst)
|
||||
(bytevector-u8-fold (lambda (acc bool elt)
|
||||
(if bool
|
||||
(cons elt acc)
|
||||
acc))
|
||||
bv lst '() index))
|
||||
|
||||
(define (bitmap-pointer->list pointer ordered-set)
|
||||
(let* ((len (/ (+ (length ordered-set) 7) 8))
|
||||
(bv (pointer->bytevector pointer len)))
|
||||
(u8-bitmap->list bv 0 ordered-set)))
|
||||
|
||||
(define-record-type <search-result>
|
||||
(%wrap-search-result pointer uri metadata serialization
|
||||
keywords-matched mandatory-missing optional-support
|
||||
availability-success availability-trials)
|
||||
search-result?
|
||||
(pointer unwrap-search-result)
|
||||
(uri search-result-uri)
|
||||
(metadata search-result-metadata)
|
||||
(serialization search-result-serialization)
|
||||
(keywords-matched search-result-keywords-matched)
|
||||
(mandatory-missing search-result-mandatory-missing)
|
||||
(optional-support search-result-optional-support)
|
||||
(availability-success search-result-availability-success)
|
||||
(availability-trials search-result-availability-trials))
|
||||
|
||||
(define (make-search-result pointer keywords)
|
||||
(match (parse-c-struct pointer %search-result-type)
|
||||
((_ _ _ _ %uri %metadata _ _ _ %serialization
|
||||
%keyword-bitmap _ _ _ _ _ mandatory-missing optional-support
|
||||
availability-success availability-trials)
|
||||
(%wrap-search-result pointer
|
||||
(wrap-uri %uri)
|
||||
(wrap-metadata %metadata)
|
||||
(pointer->string %serialization)
|
||||
(bitmap-pointer->list %keyword-bitmap keywords)
|
||||
mandatory-missing optional-support
|
||||
availability-success availability-trials))))
|
|
@ -0,0 +1,122 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
;;;; source for libextractor related values:
|
||||
;;;; https://gnunet.org/svn/Extractor/src/include/extractor.h
|
||||
|
||||
(define-module (gnu gnunet fs uri)
|
||||
#:use-module (srfi srfi-1)
|
||||
#:use-module (srfi srfi-9)
|
||||
#:use-module ((rnrs base) #:select (assert))
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:export (<uri>
|
||||
uri?
|
||||
make-ksk-uri
|
||||
make-ksk-uri-pointer
|
||||
wrap-uri
|
||||
unwrap-uri
|
||||
uri-type
|
||||
uri-keywords
|
||||
uri->string))
|
||||
|
||||
(define-record-type <uri>
|
||||
(%wrap-uri pointer type keywords)
|
||||
uri?
|
||||
(pointer unwrap-uri)
|
||||
(type uri-type)
|
||||
(keywords uri-keywords))
|
||||
|
||||
|
||||
;; (define %file-identifier-type
|
||||
;; (list uint64
|
||||
;; (list uint32
|
||||
;; uint32)))
|
||||
|
||||
;; (define %location-type
|
||||
;; (list %file-identifier-type
|
||||
;; ecdsa-public-key
|
||||
;; time-absolute
|
||||
;; eddsa-signature))
|
||||
|
||||
;; (define %uri-type
|
||||
;; (list unsigned-int
|
||||
;; (union (list '*
|
||||
;; unsigned-int)
|
||||
;; (list ecdsa-public-key
|
||||
;; '*)
|
||||
;; %file-identifier-type
|
||||
;; %location-type)))
|
||||
|
||||
|
||||
(define %uri-destroy
|
||||
(dynamic-func "GNUNET_FS_uri_destroy" gnunet-fs-ffi))
|
||||
|
||||
(define-gnunet-fs %uri->string
|
||||
"GNUNET_FS_uri_to_string" : '(*) -> '*)
|
||||
|
||||
(define-gnunet-fs %uri-ksk-create
|
||||
"GNUNET_FS_uri_ksk_create" : '(* *) -> '*)
|
||||
|
||||
|
||||
(define (keyword-list->string keywords)
|
||||
(string-concatenate/shared (interleave " " keywords)))
|
||||
|
||||
(define* (wrap-uri pointer #:key (finalize #f))
|
||||
(when finalize
|
||||
(set-pointer-finalizer! pointer %uri-destroy))
|
||||
(%wrap-uri pointer (%uri-get-type pointer) #f))
|
||||
|
||||
(define (make-ksk-uri-pointer . keywords)
|
||||
"Create a foreign pointer to a KSK URI from a list of strings KEYWORDS."
|
||||
(assert (not (null? keywords)))
|
||||
(let* ((%error-msg-ptr (%make-blob-pointer))
|
||||
(%keywords-str (string->pointer (keyword-list->string keywords)))
|
||||
(%uri (%uri-ksk-create %keywords-str %error-msg-ptr))
|
||||
(%error-msg (dereference-pointer %error-msg-ptr)))
|
||||
(cond ((and (eq? %null-pointer %uri)
|
||||
(eq? %null-pointer %error-msg))
|
||||
(throw 'invalid-result "make-ksk-uri-pointer" "%uri-ksk-create"
|
||||
(list %error-msg-ptr)))
|
||||
((eq? %null-pointer %uri)
|
||||
(%free %error-msg) ; we don’t use error-msg
|
||||
(throw 'invalid-arg "make-ksk-uri-pointer" keywords))
|
||||
(else
|
||||
(set-pointer-finalizer! %uri %uri-destroy)))
|
||||
%uri))
|
||||
|
||||
(define (make-ksk-uri . keywords)
|
||||
"Create an <uri> of type #:ksk from the list of strings KEYWORDS."
|
||||
(%wrap-uri (apply make-ksk-uri-pointer keywords) #:ksk keywords))
|
||||
|
||||
(define (%uri-get-type pointer)
|
||||
(let* ((bv (pointer->bytevector pointer (sizeof unsigned-int)))
|
||||
(type (bytevector-uint-ref bv 0 (native-endianness)
|
||||
(sizeof unsigned-int))))
|
||||
(case type
|
||||
((0) #:chk)
|
||||
((1) #:sks)
|
||||
((2) #:ksk)
|
||||
((3) #:loc))))
|
||||
|
||||
(define (uri->string uri)
|
||||
(let ((%str (%uri->string (unwrap-uri uri))))
|
||||
(if (eq? %null-pointer %str)
|
||||
(throw 'invalid-arg "uri->string" uri)
|
||||
(pointer->string %str))))
|
|
@ -0,0 +1,168 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (gnu gnunet scheduler)
|
||||
#:use-module (srfi srfi-1)
|
||||
#:use-module (ice-9 match)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet configuration)
|
||||
#:export (default-error-handler
|
||||
call-with-scheduler
|
||||
add-task!
|
||||
set-next-task!
|
||||
schedule-shutdown!))
|
||||
|
||||
|
||||
(define-gnunet %scheduler-run
|
||||
"GNUNET_SCHEDULER_run" : '(* *) -> void)
|
||||
(define-gnunet schedule-shutdown!
|
||||
"GNUNET_SCHEDULER_shutdown" : '() -> void)
|
||||
|
||||
(define-gnunet %add-continuation
|
||||
"GNUNET_SCHEDULER_add_continuation" : (list '* '* unsigned-int) -> void)
|
||||
(define-gnunet %add-continuation-with-priority
|
||||
"GNUNET_SCHEDULER_add_continuation_with_priority" :
|
||||
(list '* '* unsigned-int unsigned-int) -> void)
|
||||
|
||||
(define-gnunet %add-with-priority
|
||||
"GNUNET_SCHEDULER_add_with_priority" : (list unsigned-int '* '*) -> '*)
|
||||
|
||||
(define-gnunet %add-now
|
||||
"GNUNET_SCHEDULER_add_now" : '(* *) -> '*)
|
||||
|
||||
(define-gnunet %add-delayed
|
||||
"GNUNET_SCHEDULER_add_delayed" : (list time-relative '* '*) -> '*)
|
||||
(define-gnunet %add-delayed-with-priority
|
||||
"GNUNET_SCHEDULER_add_delayed_with_priority" :
|
||||
(list time-relative unsigned-int '* '*) -> '*)
|
||||
|
||||
(define-gnunet %speedup-start "GNUNET_SPEEDUP_start_" : '(*) -> int)
|
||||
(define-gnunet %speedup-stop "GNUNET_SPEEDUP_stop_" : '() -> void)
|
||||
|
||||
(define-gnunet %resolver-connect "GNUNET_RESOLVER_connect" : '(*) -> void)
|
||||
|
||||
|
||||
(define priorities-alist
|
||||
'((#:keep . 0)
|
||||
(#:idle . 1)
|
||||
(#:background . 2)
|
||||
(#:default . 3)
|
||||
(#:high . 4)
|
||||
(#:ui . 5)
|
||||
(#:urgent . 6)
|
||||
(#:shutdown . 7)
|
||||
(#:count . 8)))
|
||||
|
||||
(define (priority->number priority)
|
||||
(assq-ref priorities-alist priority))
|
||||
|
||||
(define (number->priority n)
|
||||
(rassq-ref priorities-alist n))
|
||||
|
||||
(define reasons-alist
|
||||
'((#:none . 0)
|
||||
(#:startup . 1)
|
||||
(#:shutdown . 2)
|
||||
(#:timeout . 4)
|
||||
(#:read-ready . 8)
|
||||
(#:write-ready . 16)
|
||||
(#:prerequisite-done . 32)))
|
||||
|
||||
(define (reason-list->number . reasons)
|
||||
(fold (lambda (reason result)
|
||||
(logand (assq-ref reasons-alist reason) result))
|
||||
0 reasons-alist))
|
||||
|
||||
(define (number->reason-list n)
|
||||
(fold (lambda (reason result)
|
||||
(if (zero? (logand (cdr reason) n))
|
||||
result
|
||||
(cons (car reason) result)))
|
||||
'() reasons-alist))
|
||||
|
||||
|
||||
(define (task-thunk->pointer thunk error-handler)
|
||||
"Wraps THUNK for use with the scheduler, and returns a pointer to it.
|
||||
THUNK should be a function of one argument: a list of reasons (as keywords)."
|
||||
(procedure->pointer void
|
||||
(lambda (unused %context)
|
||||
(match (parse-c-struct %context
|
||||
(list unsigned-int '* '*))
|
||||
((%reasons _ _)
|
||||
;; (with-throw-handler
|
||||
;; #t (thunk (number->reason-list %reasons))
|
||||
;; (lambda args (backtrace)))
|
||||
; (catch #t
|
||||
(thunk (number->reason-list %reasons)))))
|
||||
; error-handler))))
|
||||
'(* *)))
|
||||
|
||||
(define (default-error-handler key . args)
|
||||
(simple-format #t "GNUNET SHUTDOWN: ~a ~a\n" key args)
|
||||
(schedule-shutdown!))
|
||||
|
||||
(define* (call-with-scheduler config thunk
|
||||
#:key (error-handler default-error-handler))
|
||||
"Initialize and run GnuNet’s scheduler, that will start by calling THUNK, and
|
||||
will only return when all tasks have been completed.
|
||||
|
||||
On systems with signals, receiving a SIGTERM (or any other similar signal)
|
||||
causes `scheduler-shutdown` to be run after the active task is completed. As a
|
||||
result, SIGTERM causes all the current pending tasks to be marked as ready, and
|
||||
scheduled for immediate execution with reason #:shutdown. However, tasks
|
||||
scheduled *after* the call to `scheduler-shutdown` may still be delayed
|
||||
arbitrarily."
|
||||
(define (init-and-start reasons)
|
||||
(when (not (member #:shutdown reasons))
|
||||
(%speedup-start (unwrap-configuration config))
|
||||
(%resolver-connect (unwrap-configuration config))
|
||||
(thunk reasons)))
|
||||
(%scheduler-run (task-thunk->pointer init-and-start error-handler)
|
||||
%null-pointer))
|
||||
|
||||
;;+TODO: shall I (assert (uint64? delay)) ?
|
||||
(define* (add-task! thunk #:key (delay 0) (priority #:default)
|
||||
(error-handler default-error-handler))
|
||||
"Schedule THUNK for execution with DELAY with PRIORITY.
|
||||
|
||||
– DELAY is an integer in microseconds,
|
||||
– PRIORITY is a keyword."
|
||||
(let ((%thunk (task-thunk->pointer thunk error-handler)))
|
||||
;; in the following calls to the %add-* functions, %null-pointer designates
|
||||
;; the “closure” of the task (a simulation of the closure concept in C). As
|
||||
;; we have real closures, we don’t need to use this, hence the null pointer.
|
||||
(cond ((and (zero? delay) (eq? #:default priority))
|
||||
(%add-now %thunk %null-pointer))
|
||||
((zero? delay)
|
||||
(%add-with-priority (priority->number priority) %thunk %null-pointer))
|
||||
((eq? #:default priority)
|
||||
(%add-delayed delay %thunk %null-pointer))
|
||||
(else
|
||||
(%add-delayed-with-priority delay (priority->number priority)
|
||||
%thunk %null-pointer)))))
|
||||
|
||||
(define* (set-next-task! thunk #:key (reasons '(#:none)) (priority #:default)
|
||||
(error-handler default-error-handler))
|
||||
"Schedule TASK as the next action to complete."
|
||||
(let ((%thunk (task-thunk->pointer thunk error-handler))
|
||||
(%reasons (apply reason-list->number reasons)))
|
||||
(if (eq? priority #:default)
|
||||
(%add-continuation %thunk %null-pointer %reasons)
|
||||
(%add-continuation-with-priority %thunk %null-pointer %reasons
|
||||
(priority->number priority)))))
|
|
@ -0,0 +1,100 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (system foreign-padded)
|
||||
#:use-module ((srfi srfi-1) #:select (fold))
|
||||
#:use-module (ice-9 match)
|
||||
#:use-module (system foreign)
|
||||
#:export (union?
|
||||
union-size
|
||||
union-ref
|
||||
alignof*
|
||||
sizeof*
|
||||
padding
|
||||
pad
|
||||
make-union))
|
||||
|
||||
|
||||
(define (union? type)
|
||||
(match type
|
||||
(('union (? integer? size) (? integer? align) (members ...)) #t)
|
||||
(_ #f)))
|
||||
|
||||
(define union-size cadr)
|
||||
(define union-align caddr)
|
||||
|
||||
(define (union-ref key union)
|
||||
(match union
|
||||
(('union size align (members ...)) (assq-ref members key))
|
||||
(_ (scm-error 'wrong-type-arg "union-ref"
|
||||
"Wrong type argument in position 2: ~a"
|
||||
(list union) (list union)))))
|
||||
|
||||
(define (alignof* type)
|
||||
"A variant of alignof that accepts unions."
|
||||
(cond ((union? type) (union-align type))
|
||||
((list? type) (fold max 1 (map alignof* type)))
|
||||
(else (alignof type))))
|
||||
|
||||
(define (next-multiple numerator divisor)
|
||||
"Raise up NUMERATOR to the most little multiple M of DIVISOR such that
|
||||
NUMERATOR <= M."
|
||||
(let ((prev-multiple (* divisor (quotient numerator divisor))))
|
||||
(if (= prev-multiple numerator)
|
||||
numerator
|
||||
(+ prev-multiple divisor))))
|
||||
|
||||
(define (sizeof* type)
|
||||
"A variant of sizeof that accepts unions and returns pads the structures in
|
||||
relation to their alignment before returning their size."
|
||||
(cond ((union? type) (union-size type))
|
||||
((list? type) (next-multiple (fold + 0 (map sizeof* type))
|
||||
(alignof* type)))
|
||||
(#t (sizeof type))))
|
||||
|
||||
(define* (padding n #:optional (type uint8))
|
||||
"Generate a list of N times TYPE."
|
||||
(match n
|
||||
(0 '())
|
||||
(_ (cons type (padding (- n 1))))))
|
||||
|
||||
(define (pad type size)
|
||||
"Pad TYPE upto SIZE."
|
||||
(let ((size* (sizeof* type)))
|
||||
(cond ((> size* size)
|
||||
(scm-error 'wrong-type-arg "pad"
|
||||
"Wrong argument in position 2: (sizeof ~a) < ~a"
|
||||
(list type size) (list type size)))
|
||||
((or (not (list? type)) (union? type))
|
||||
(scm-error 'wrong-type-arg "pad"
|
||||
"Wrong argument in position 1: ~a"
|
||||
(list type) (list type)))
|
||||
(else
|
||||
(append type (padding (- size size*)))))))
|
||||
|
||||
(define (make-union . members)
|
||||
"Create a union. MEMBERS should be an assoc. list of lists of C types, where
|
||||
keys are only used to identify each union member in calls to `union-ref`."
|
||||
(let* ((size (fold max 0 (map (compose sizeof* cdr) members)))
|
||||
(align (fold max 1 (map (compose alignof* cdr) members)))
|
||||
(padded-size (next-multiple size align))
|
||||
(padded-members (map (match-lambda
|
||||
((key . type) (cons key (pad type
|
||||
padded-size))))
|
||||
members)))
|
||||
(list 'union padded-size align padded-members)))
|
||||
|
|
@ -0,0 +1,47 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-binding-utils)
|
||||
#:use-module (gnu gnunet binding-utils)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (srfi srfi-64))
|
||||
|
||||
(test-begin "test-binding-utils")
|
||||
|
||||
(test-equal '(kirk & spock & ahura & sulu & scotty)
|
||||
(interleave '& '(kirk spock ahura sulu scotty)))
|
||||
|
||||
(define foo-alist '((#:foo . 1) (#:bar . 2) (#:baz . 3)))
|
||||
|
||||
;; rassq
|
||||
(test-equal '(#:bar . 2) (rassq foo-alist 2))
|
||||
(test-equal #f (rassq foo-alist 5))
|
||||
|
||||
;; rassq-ref
|
||||
(test-equal #:bar (rassq-ref foo-alist 2))
|
||||
(test-equal #f (rassq-ref foo-alist 5))
|
||||
|
||||
;; make-c-struct*
|
||||
(test-equal '(0 0 0)
|
||||
(parse-c-struct (make-c-struct* (list int unsigned-int int8))
|
||||
(list int unsigned-int int8)))
|
||||
|
||||
;; string->pointer*
|
||||
(test-equal %null-pointer (string->pointer* ""))
|
||||
(test-equal "foo" (pointer->string (string->pointer* "foo")))
|
||||
|
||||
(test-end)
|
|
@ -0,0 +1,32 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-configuration)
|
||||
#:use-module (srfi srfi-64)
|
||||
#:use-module (gnu gnunet configuration))
|
||||
|
||||
|
||||
(test-begin "test-configuration")
|
||||
|
||||
(define test-config (load-configuration "tests/testconf.conf"))
|
||||
|
||||
(test-equal 2
|
||||
(configuration-ref 'integer test-config "testing" "skew_variance"))
|
||||
(test-equal "localhost"
|
||||
(configuration-ref 'string test-config "testing" "hostname"))
|
||||
|
||||
(test-end)
|
|
@ -0,0 +1,48 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-container-metadata)
|
||||
#:use-module (srfi srfi-64)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (gnu gnunet container metadata))
|
||||
|
||||
(test-begin "test-container-metadata")
|
||||
|
||||
(define test-meta (make-metadata))
|
||||
(define test-data1 (string->utf8 "foo.scm"))
|
||||
(define test-item1
|
||||
(make-metadata-item "foo" #:original-filename #:utf8 "text/plain" test-data1))
|
||||
(define test-data2 (string->utf8 "bar.txt"))
|
||||
(define test-item2
|
||||
(make-metadata-item "bar" #:unknown #:utf8 "text/plain" test-data2))
|
||||
|
||||
(metadata-set! test-meta test-item1)
|
||||
(metadata-set! test-meta test-item2)
|
||||
|
||||
(test-equal "foo.scm" (metadata-ref test-meta #:original-filename))
|
||||
|
||||
(let ((lst '()))
|
||||
(metadata-iterate (lambda (name . _)
|
||||
(set! lst (cons name lst)))
|
||||
test-meta)
|
||||
(test-assert (or (equal? '("foo" "bar") lst)
|
||||
(equal? '("bar" "foo") lst))))
|
||||
|
||||
(test-equal '("foo" "bar")
|
||||
(metadata-map (lambda (name . _) name) test-meta))
|
||||
|
||||
(test-end)
|
|
@ -0,0 +1,75 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-foreign-padded)
|
||||
#:use-module (srfi srfi-64)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (system foreign-padded))
|
||||
|
||||
;; union?
|
||||
(test-equal #t (union? (make-union)))
|
||||
(test-equal #t (union? (make-union '(#:foo *) '(#:bar * *))))
|
||||
(test-equal #f (union? '(union 0)))
|
||||
|
||||
;; %next-multiple
|
||||
(define next-multiple (@@ (system foreign-padded) next-multiple))
|
||||
(test-equal 10 (next-multiple 7 5))
|
||||
(test-equal 2 (next-multiple 1 2))
|
||||
(test-equal 0 (next-multiple 0 1))
|
||||
(test-equal 10 (next-multiple 10 5))
|
||||
(test-error 'numerical-overflow (next-multiple 10 0))
|
||||
|
||||
;; alignof*
|
||||
(test-equal (alignof '*)
|
||||
(alignof* (make-union (list #:foo '*)
|
||||
(list #:bar unsigned-int))))
|
||||
(test-equal (alignof '*)
|
||||
(alignof* (list (make-union (list #:foo '*)
|
||||
(list #:bar unsigned-int)))))
|
||||
|
||||
;; sizeof* — unions
|
||||
(let ((size (sizeof (list int64 int16)))
|
||||
(align (alignof (list int64 int16))))
|
||||
(test-equal (next-multiple size align)
|
||||
(sizeof* (make-union (list #:foo int8)
|
||||
(list #:bar int64 int16)))))
|
||||
(test-equal 0 (sizeof* (make-union)))
|
||||
(test-equal 1 (sizeof* uint8))
|
||||
|
||||
;; sizeof* — alignment padding
|
||||
(let ((%type (list '* unsigned-int)))
|
||||
(test-assert (zero? (remainder (sizeof* %type) (alignof %type)))))
|
||||
|
||||
;; padding
|
||||
(test-equal 5 (length (padding 5)))
|
||||
(test-equal 0 (length (padding 0)))
|
||||
|
||||
;; make-union
|
||||
;; (let* ((longuest (list int32 int32))
|
||||
;; (size (sizeof longuest))
|
||||
;; (pad-size (sizeof* longuest))
|
||||
;; (pad-rem (- pad-size size))
|
||||
;; (align (alignof* longuest)))
|
||||
;; (test-equal
|
||||
;; `(union ,pad-size ,align
|
||||
;; ((#:foo ,int32 ,int32 ,@(if (> pad-rem 0)
|
||||
;; (padding pad-rem)
|
||||
;; '()))
|
||||
;; (#:bar ,(pad (list uint8) (sizeof int32))
|
||||
;; ,(pad (list uint8) pad-size))))
|
||||
;; (make-union `(#:foo ,int32 ,int32)
|
||||
;; `(#:bar ,uint8))))
|
|
@ -0,0 +1,92 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-fs-progress-info)
|
||||
#:use-module (srfi srfi-1)
|
||||
#:use-module (srfi srfi-64)
|
||||
#:use-module (rnrs bytevectors)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (system foreign-padded)
|
||||
#:use-module (gnu gnunet common)
|
||||
#:use-module (gnu gnunet container metadata)
|
||||
#:use-module (gnu gnunet fs progress-info))
|
||||
|
||||
|
||||
(define-syntax-rule (pi-import name ...)
|
||||
(begin (define name (@@ (gnu gnunet fs progress-info) name))
|
||||
...))
|
||||
|
||||
(pi-import integer->progress-info-status
|
||||
progress-info-status->integer
|
||||
progress-info-get-type
|
||||
bytevector-u8-fold
|
||||
u8-bitmap->list)
|
||||
|
||||
(test-begin "test-fs-progress-info")
|
||||
|
||||
;; integer->progress-info-status
|
||||
(test-equal '(#:unindex #:progress) (integer->progress-info-status 33))
|
||||
(test-error 'invalid-arg (integer->progress-info-status 42))
|
||||
|
||||
;; progress-info-status->integer
|
||||
(test-equal 8 (progress-info-status->integer '(#:download #:resume)))
|
||||
(test-error 'invalid-arg (progress-info-status->integer
|
||||
'(#:beam-me-up #:scotty)))
|
||||
|
||||
;; progress-info-get-type
|
||||
(define progress-info-download-progress-signature
|
||||
(list
|
||||
(list '* '* '* '* '* '*
|
||||
uint64
|
||||
time-relative time-relative
|
||||
uint64 uint32 int
|
||||
(list '* uint64 uint64
|
||||
time-relative
|
||||
unsigned-int uint32 uint32))
|
||||
unsigned-int
|
||||
'*))
|
||||
(test-equal progress-info-download-progress-signature
|
||||
(progress-info-get-type #:download #:progress))
|
||||
(test-error 'invalid-arg (progress-info-get-type #:maximum #:warp))
|
||||
|
||||
|
||||
;; bytevector-u8-fold
|
||||
(let ((bv (make-bytevector 1)))
|
||||
(bytevector-u8-set! bv 0 #b01101010)
|
||||
(test-equal '(1 1 1 1)
|
||||
(bytevector-u8-fold (lambda (acc bool elt)
|
||||
(if bool
|
||||
(cons elt acc)
|
||||
acc))
|
||||
bv
|
||||
'(1 1 1 1 1 1 1 1)
|
||||
'())))
|
||||
|
||||
;; u8-bitmap->list
|
||||
(let ((bv (make-bytevector 3)))
|
||||
(bytevector-u8-set! bv 0 #b11000001)
|
||||
(bytevector-u8-set! bv 1 #b00010100)
|
||||
(bytevector-u8-set! bv 2 #b00010000)
|
||||
(test-assert
|
||||
(lset= eq?
|
||||
'(#\T #\e #\r #\r #\y #\.)
|
||||
(u8-bitmap->list bv 0
|
||||
'(#\T #\e #\a #\. #\ #\E #\a #\r
|
||||
#\l #\- #\G #\r #\a #\y #\. #\
|
||||
#\H #\o #\t #\.)))))
|
||||
|
||||
(test-end)
|
|
@ -0,0 +1,6 @@
|
|||
[arm]
|
||||
DEFAULTSERVICES = topology hostlist fs
|
||||
|
||||
[testing]
|
||||
SKEW_VARIANCE = 2
|
||||
HOSTNAME = localhost
|
|
@ -0,0 +1,33 @@
|
|||
;;;; -*- mode: Scheme; indent-tabs-mode: nil; fill-column: 80; -*-
|
||||
;;;;
|
||||
;;;; Copyright © 2015 Rémi Delrue <asgeir@free.fr>
|
||||
;;;;
|
||||
;;;; 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/>.
|
||||
|
||||
(define-module (test-fs-uri)
|
||||
#:use-module (system foreign)
|
||||
#:use-module (srfi srfi-64)
|
||||
#:use-module (gnu gnunet fs uri))
|
||||
|
||||
(test-begin "test-fs-uri")
|
||||
|
||||
;; make-ksk-uri
|
||||
(test-error 'invalid-arg (make-ksk-uri))
|
||||
|
||||
(define test-uri (make-ksk-uri "+foo" "bar" "baz"))
|
||||
|
||||
;; uri->string
|
||||
(test-assert (not (string-null? (uri->string test-uri))))
|
||||
|
||||
(test-end)
|
Loading…
Reference in New Issue