added example and kernel patch
parent
5c32ab5562
commit
89078f01a2
@ -0,0 +1,2 @@
|
|||||||
|
Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
|
||||||
@ -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,370 @@
|
|||||||
|
Installation Instructions
|
||||||
|
*************************
|
||||||
|
|
||||||
|
Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation,
|
||||||
|
Inc.
|
||||||
|
|
||||||
|
Copying and distribution of this file, with or without modification,
|
||||||
|
are permitted in any medium without royalty provided the copyright
|
||||||
|
notice and this notice are preserved. This file is offered as-is,
|
||||||
|
without warranty of any kind.
|
||||||
|
|
||||||
|
Basic Installation
|
||||||
|
==================
|
||||||
|
|
||||||
|
Briefly, the shell command `./configure && make && make install'
|
||||||
|
should configure, build, and install this package. The following
|
||||||
|
more-detailed instructions are generic; see the `README' file for
|
||||||
|
instructions specific to this package. Some packages provide this
|
||||||
|
`INSTALL' file but do not implement all of the features documented
|
||||||
|
below. The lack of an optional feature in a given package is not
|
||||||
|
necessarily a bug. More recommendations for GNU packages can be found
|
||||||
|
in *note Makefile Conventions: (standards)Makefile Conventions.
|
||||||
|
|
||||||
|
The `configure' shell script attempts to guess correct values for
|
||||||
|
various system-dependent variables used during compilation. It uses
|
||||||
|
those values to create a `Makefile' in each directory of the package.
|
||||||
|
It may also create one or more `.h' files containing system-dependent
|
||||||
|
definitions. Finally, it creates a shell script `config.status' that
|
||||||
|
you can run in the future to recreate the current configuration, and a
|
||||||
|
file `config.log' containing compiler output (useful mainly for
|
||||||
|
debugging `configure').
|
||||||
|
|
||||||
|
It can also use an optional file (typically called `config.cache'
|
||||||
|
and enabled with `--cache-file=config.cache' or simply `-C') that saves
|
||||||
|
the results of its tests to speed up reconfiguring. Caching is
|
||||||
|
disabled by default to prevent problems with accidental use of stale
|
||||||
|
cache files.
|
||||||
|
|
||||||
|
If you need to do unusual things to compile the package, please try
|
||||||
|
to figure out how `configure' could check whether to do them, and mail
|
||||||
|
diffs or instructions to the address given in the `README' so they can
|
||||||
|
be considered for the next release. If you are using the cache, and at
|
||||||
|
some point `config.cache' contains results you don't want to keep, you
|
||||||
|
may remove or edit it.
|
||||||
|
|
||||||
|
The file `configure.ac' (or `configure.in') is used to create
|
||||||
|
`configure' by a program called `autoconf'. You need `configure.ac' if
|
||||||
|
you want to change it or regenerate `configure' using a newer version
|
||||||
|
of `autoconf'.
|
||||||
|
|
||||||
|
The simplest way to compile this package is:
|
||||||
|
|
||||||
|
1. `cd' to the directory containing the package's source code and type
|
||||||
|
`./configure' to configure the package for your system.
|
||||||
|
|
||||||
|
Running `configure' might take a while. While running, it prints
|
||||||
|
some messages telling which features it is checking for.
|
||||||
|
|
||||||
|
2. Type `make' to compile the package.
|
||||||
|
|
||||||
|
3. Optionally, type `make check' to run any self-tests that come with
|
||||||
|
the package, generally using the just-built uninstalled binaries.
|
||||||
|
|
||||||
|
4. Type `make install' to install the programs and any data files and
|
||||||
|
documentation. When installing into a prefix owned by root, it is
|
||||||
|
recommended that the package be configured and built as a regular
|
||||||
|
user, and only the `make install' phase executed with root
|
||||||
|
privileges.
|
||||||
|
|
||||||
|
5. Optionally, type `make installcheck' to repeat any self-tests, but
|
||||||
|
this time using the binaries in their final installed location.
|
||||||
|
This target does not install anything. Running this target as a
|
||||||
|
regular user, particularly if the prior `make install' required
|
||||||
|
root privileges, verifies that the installation completed
|
||||||
|
correctly.
|
||||||
|
|
||||||
|
6. You can remove the program binaries and object files from the
|
||||||
|
source code directory by typing `make clean'. To also remove the
|
||||||
|
files that `configure' created (so you can compile the package for
|
||||||
|
a different kind of computer), type `make distclean'. There is
|
||||||
|
also a `make maintainer-clean' target, but that is intended mainly
|
||||||
|
for the package's developers. If you use it, you may have to get
|
||||||
|
all sorts of other programs in order to regenerate files that came
|
||||||
|
with the distribution.
|
||||||
|
|
||||||
|
7. Often, you can also type `make uninstall' to remove the installed
|
||||||
|
files again. In practice, not all packages have tested that
|
||||||
|
uninstallation works correctly, even though it is required by the
|
||||||
|
GNU Coding Standards.
|
||||||
|
|
||||||
|
8. Some packages, particularly those that use Automake, provide `make
|
||||||
|
distcheck', which can by used by developers to test that all other
|
||||||
|
targets like `make install' and `make uninstall' work correctly.
|
||||||
|
This target is generally not run by end users.
|
||||||
|
|
||||||
|
Compilers and Options
|
||||||
|
=====================
|
||||||
|
|
||||||
|
Some systems require unusual options for compilation or linking that
|
||||||
|
the `configure' script does not know about. Run `./configure --help'
|
||||||
|
for details on some of the pertinent environment variables.
|
||||||
|
|
||||||
|
You can give `configure' initial values for configuration parameters
|
||||||
|
by setting variables in the command line or in the environment. Here
|
||||||
|
is an example:
|
||||||
|
|
||||||
|
./configure CC=c99 CFLAGS=-g LIBS=-lposix
|
||||||
|
|
||||||
|
*Note Defining Variables::, for more details.
|
||||||
|
|
||||||
|
Compiling For Multiple Architectures
|
||||||
|
====================================
|
||||||
|
|
||||||
|
You can compile the package for more than one kind of computer at the
|
||||||
|
same time, by placing the object files for each architecture in their
|
||||||
|
own directory. To do this, you can use GNU `make'. `cd' to the
|
||||||
|
directory where you want the object files and executables to go and run
|
||||||
|
the `configure' script. `configure' automatically checks for the
|
||||||
|
source code in the directory that `configure' is in and in `..'. This
|
||||||
|
is known as a "VPATH" build.
|
||||||
|
|
||||||
|
With a non-GNU `make', it is safer to compile the package for one
|
||||||
|
architecture at a time in the source code directory. After you have
|
||||||
|
installed the package for one architecture, use `make distclean' before
|
||||||
|
reconfiguring for another architecture.
|
||||||
|
|
||||||
|
On MacOS X 10.5 and later systems, you can create libraries and
|
||||||
|
executables that work on multiple system types--known as "fat" or
|
||||||
|
"universal" binaries--by specifying multiple `-arch' options to the
|
||||||
|
compiler but only a single `-arch' option to the preprocessor. Like
|
||||||
|
this:
|
||||||
|
|
||||||
|
./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
||||||
|
CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
|
||||||
|
CPP="gcc -E" CXXCPP="g++ -E"
|
||||||
|
|
||||||
|
This is not guaranteed to produce working output in all cases, you
|
||||||
|
may have to build one architecture at a time and combine the results
|
||||||
|
using the `lipo' tool if you have problems.
|
||||||
|
|
||||||
|
Installation Names
|
||||||
|
==================
|
||||||
|
|
||||||
|
By default, `make install' installs the package's commands under
|
||||||
|
`/usr/local/bin', include files under `/usr/local/include', etc. You
|
||||||
|
can specify an installation prefix other than `/usr/local' by giving
|
||||||
|
`configure' the option `--prefix=PREFIX', where PREFIX must be an
|
||||||
|
absolute file name.
|
||||||
|
|
||||||
|
You can specify separate installation prefixes for
|
||||||
|
architecture-specific files and architecture-independent files. If you
|
||||||
|
pass the option `--exec-prefix=PREFIX' to `configure', the package uses
|
||||||
|
PREFIX as the prefix for installing programs and libraries.
|
||||||
|
Documentation and other data files still use the regular prefix.
|
||||||
|
|
||||||
|
In addition, if you use an unusual directory layout you can give
|
||||||
|
options like `--bindir=DIR' to specify different values for particular
|
||||||
|
kinds of files. Run `configure --help' for a list of the directories
|
||||||
|
you can set and what kinds of files go in them. In general, the
|
||||||
|
default for these options is expressed in terms of `${prefix}', so that
|
||||||
|
specifying just `--prefix' will affect all of the other directory
|
||||||
|
specifications that were not explicitly provided.
|
||||||
|
|
||||||
|
The most portable way to affect installation locations is to pass the
|
||||||
|
correct locations to `configure'; however, many packages provide one or
|
||||||
|
both of the following shortcuts of passing variable assignments to the
|
||||||
|
`make install' command line to change installation locations without
|
||||||
|
having to reconfigure or recompile.
|
||||||
|
|
||||||
|
The first method involves providing an override variable for each
|
||||||
|
affected directory. For example, `make install
|
||||||
|
prefix=/alternate/directory' will choose an alternate location for all
|
||||||
|
directory configuration variables that were expressed in terms of
|
||||||
|
`${prefix}'. Any directories that were specified during `configure',
|
||||||
|
but not in terms of `${prefix}', must each be overridden at install
|
||||||
|
time for the entire installation to be relocated. The approach of
|
||||||
|
makefile variable overrides for each directory variable is required by
|
||||||
|
the GNU Coding Standards, and ideally causes no recompilation.
|
||||||
|
However, some platforms have known limitations with the semantics of
|
||||||
|
shared libraries that end up requiring recompilation when using this
|
||||||
|
method, particularly noticeable in packages that use GNU Libtool.
|
||||||
|
|
||||||
|
The second method involves providing the `DESTDIR' variable. For
|
||||||
|
example, `make install DESTDIR=/alternate/directory' will prepend
|
||||||
|
`/alternate/directory' before all installation names. The approach of
|
||||||
|
`DESTDIR' overrides is not required by the GNU Coding Standards, and
|
||||||
|
does not work on platforms that have drive letters. On the other hand,
|
||||||
|
it does better at avoiding recompilation issues, and works well even
|
||||||
|
when some directory options were not specified in terms of `${prefix}'
|
||||||
|
at `configure' time.
|
||||||
|
|
||||||
|
Optional Features
|
||||||
|
=================
|
||||||
|
|
||||||
|
If the package supports it, you can cause programs to be installed
|
||||||
|
with an extra prefix or suffix on their names by giving `configure' the
|
||||||
|
option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
|
||||||
|
|
||||||
|
Some packages pay attention to `--enable-FEATURE' options to
|
||||||
|
`configure', where FEATURE indicates an optional part of the package.
|
||||||
|
They may also pay attention to `--with-PACKAGE' options, where PACKAGE
|
||||||
|
is something like `gnu-as' or `x' (for the X Window System). The
|
||||||
|
`README' should mention any `--enable-' and `--with-' options that the
|
||||||
|
package recognizes.
|
||||||
|
|
||||||
|
For packages that use the X Window System, `configure' can usually
|
||||||
|
find the X include and library files automatically, but if it doesn't,
|
||||||
|
you can use the `configure' options `--x-includes=DIR' and
|
||||||
|
`--x-libraries=DIR' to specify their locations.
|
||||||
|
|
||||||
|
Some packages offer the ability to configure how verbose the
|
||||||
|
execution of `make' will be. For these packages, running `./configure
|
||||||
|
--enable-silent-rules' sets the default to minimal output, which can be
|
||||||
|
overridden with `make V=1'; while running `./configure
|
||||||
|
--disable-silent-rules' sets the default to verbose, which can be
|
||||||
|
overridden with `make V=0'.
|
||||||
|
|
||||||
|
Particular systems
|
||||||
|
==================
|
||||||
|
|
||||||
|
On HP-UX, the default C compiler is not ANSI C compatible. If GNU
|
||||||
|
CC is not installed, it is recommended to use the following options in
|
||||||
|
order to use an ANSI C compiler:
|
||||||
|
|
||||||
|
./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
|
||||||
|
|
||||||
|
and if that doesn't work, install pre-built binaries of GCC for HP-UX.
|
||||||
|
|
||||||
|
HP-UX `make' updates targets which have the same time stamps as
|
||||||
|
their prerequisites, which makes it generally unusable when shipped
|
||||||
|
generated files such as `configure' are involved. Use GNU `make'
|
||||||
|
instead.
|
||||||
|
|
||||||
|
On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
|
||||||
|
parse its `<wchar.h>' header file. The option `-nodtk' can be used as
|
||||||
|
a workaround. If GNU CC is not installed, it is therefore recommended
|
||||||
|
to try
|
||||||
|
|
||||||
|
./configure CC="cc"
|
||||||
|
|
||||||
|
and if that doesn't work, try
|
||||||
|
|
||||||
|
./configure CC="cc -nodtk"
|
||||||
|
|
||||||
|
On Solaris, don't put `/usr/ucb' early in your `PATH'. This
|
||||||
|
directory contains several dysfunctional programs; working variants of
|
||||||
|
these programs are available in `/usr/bin'. So, if you need `/usr/ucb'
|
||||||
|
in your `PATH', put it _after_ `/usr/bin'.
|
||||||
|
|
||||||
|
On Haiku, software installed for all users goes in `/boot/common',
|
||||||
|
not `/usr/local'. It is recommended to use the following options:
|
||||||
|
|
||||||
|
./configure --prefix=/boot/common
|
||||||
|
|
||||||
|
Specifying the System Type
|
||||||
|
==========================
|
||||||
|
|
||||||
|
There may be some features `configure' cannot figure out
|
||||||
|
automatically, but needs to determine by the type of machine the package
|
||||||
|
will run on. Usually, assuming the package is built to be run on the
|
||||||
|
_same_ architectures, `configure' can figure that out, but if it prints
|
||||||
|
a message saying it cannot guess the machine type, give it the
|
||||||
|
`--build=TYPE' option. TYPE can either be a short name for the system
|
||||||
|
type, such as `sun4', or a canonical name which has the form:
|
||||||
|
|
||||||
|
CPU-COMPANY-SYSTEM
|
||||||
|
|
||||||
|
where SYSTEM can have one of these forms:
|
||||||
|
|
||||||
|
OS
|
||||||
|
KERNEL-OS
|
||||||
|
|
||||||
|
See the file `config.sub' for the possible values of each field. If
|
||||||
|
`config.sub' isn't included in this package, then this package doesn't
|
||||||
|
need to know the machine type.
|
||||||
|
|
||||||
|
If you are _building_ compiler tools for cross-compiling, you should
|
||||||
|
use the option `--target=TYPE' to select the type of system they will
|
||||||
|
produce code for.
|
||||||
|
|
||||||
|
If you want to _use_ a cross compiler, that generates code for a
|
||||||
|
platform different from the build platform, you should specify the
|
||||||
|
"host" platform (i.e., that on which the generated programs will
|
||||||
|
eventually be run) with `--host=TYPE'.
|
||||||
|
|
||||||
|
Sharing Defaults
|
||||||
|
================
|
||||||
|
|
||||||
|
If you want to set default values for `configure' scripts to share,
|
||||||
|
you can create a site shell script called `config.site' that gives
|
||||||
|
default values for variables like `CC', `cache_file', and `prefix'.
|
||||||
|
`configure' looks for `PREFIX/share/config.site' if it exists, then
|
||||||
|
`PREFIX/etc/config.site' if it exists. Or, you can set the
|
||||||
|
`CONFIG_SITE' environment variable to the location of the site script.
|
||||||
|
A warning: not all `configure' scripts look for a site script.
|
||||||
|
|
||||||
|
Defining Variables
|
||||||
|
==================
|
||||||
|
|
||||||
|
Variables not defined in a site shell script can be set in the
|
||||||
|
environment passed to `configure'. However, some packages may run
|
||||||
|
configure again during the build, and the customized values of these
|
||||||
|
variables may be lost. In order to avoid this problem, you should set
|
||||||
|
them in the `configure' command line, using `VAR=value'. For example:
|
||||||
|
|
||||||
|
./configure CC=/usr/local2/bin/gcc
|
||||||
|
|
||||||
|
causes the specified `gcc' to be used as the C compiler (unless it is
|
||||||
|
overridden in the site shell script).
|
||||||
|
|
||||||
|
Unfortunately, this technique does not work for `CONFIG_SHELL' due to
|
||||||
|
an Autoconf limitation. Until the limitation is lifted, you can use
|
||||||
|
this workaround:
|
||||||
|
|
||||||
|
CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash
|
||||||
|
|
||||||
|
`configure' Invocation
|
||||||
|
======================
|
||||||
|
|
||||||
|
`configure' recognizes the following options to control how it
|
||||||
|
operates.
|
||||||
|
|
||||||
|
`--help'
|
||||||
|
`-h'
|
||||||
|
Print a summary of all of the options to `configure', and exit.
|
||||||
|
|
||||||
|
`--help=short'
|
||||||
|
`--help=recursive'
|
||||||
|
Print a summary of the options unique to this package's
|
||||||
|
`configure', and exit. The `short' variant lists options used
|
||||||
|
only in the top level, while the `recursive' variant lists options
|
||||||
|
also present in any nested packages.
|
||||||
|
|
||||||
|
`--version'
|
||||||
|
`-V'
|
||||||
|
Print the version of Autoconf used to generate the `configure'
|
||||||
|
script, and exit.
|
||||||
|
|
||||||
|
`--cache-file=FILE'
|
||||||
|
Enable the cache: use and save the results of the tests in FILE,
|
||||||
|
traditionally `config.cache'. FILE defaults to `/dev/null' to
|
||||||
|
disable caching.
|
||||||
|
|
||||||
|
`--config-cache'
|
||||||
|
`-C'
|
||||||
|
Alias for `--cache-file=config.cache'.
|
||||||
|
|
||||||
|
`--quiet'
|
||||||
|
`--silent'
|
||||||
|
`-q'
|
||||||
|
Do not print messages saying which checks are being made. To
|
||||||
|
suppress all normal output, redirect it to `/dev/null' (any error
|
||||||
|
messages will still be shown).
|
||||||
|
|
||||||
|
`--srcdir=DIR'
|
||||||
|
Look for the package's source code in directory DIR. Usually
|
||||||
|
`configure' can determine that directory automatically.
|
||||||
|
|
||||||
|
`--prefix=DIR'
|
||||||
|
Use DIR as the installation prefix. *note Installation Names::
|
||||||
|
for more details, including other options available for fine-tuning
|
||||||
|
the installation locations.
|
||||||
|
|
||||||
|
`--no-create'
|
||||||
|
`-n'
|
||||||
|
Run the configure checks, but stop before creating any output
|
||||||
|
files.
|
||||||
|
|
||||||
|
`configure' also accepts some other, not widely useful, options. Run
|
||||||
|
`configure --help' for more details.
|
||||||
@ -0,0 +1,8 @@
|
|||||||
|
## Process this file with automake to produce Makefile.in
|
||||||
|
|
||||||
|
SUBDIRS = daemon tools
|
||||||
|
|
||||||
|
clean-local:
|
||||||
|
|
||||||
|
# Remove doc directory on uninstall
|
||||||
|
uninstall-local:
|
||||||
@ -0,0 +1,157 @@
|
|||||||
|
#!/bin/sh
|
||||||
|
# Run this to generate all the initial makefiles, etc.
|
||||||
|
|
||||||
|
srcdir=`dirname $0`
|
||||||
|
test -z "$srcdir" && srcdir=.
|
||||||
|
|
||||||
|
DIE=0
|
||||||
|
|
||||||
|
if [ -n "$GNOME2_DIR" ]; then
|
||||||
|
ACLOCAL_FLAGS="-I $GNOME2_DIR/share/aclocal $ACLOCAL_FLAGS"
|
||||||
|
LD_LIBRARY_PATH="$GNOME2_DIR/lib:$LD_LIBRARY_PATH"
|
||||||
|
PATH="$GNOME2_DIR/bin:$PATH"
|
||||||
|
export PATH
|
||||||
|
export LD_LIBRARY_PATH
|
||||||
|
fi
|
||||||
|
|
||||||
|
(test -f $srcdir/configure.ac) || {
|
||||||
|
echo -n "**Error**: Directory "\`$srcdir\'" does not look like the"
|
||||||
|
echo " top-level package directory"
|
||||||
|
exit 1
|
||||||
|
}
|
||||||
|
|
||||||
|
(autoconf --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`autoconf' installed."
|
||||||
|
echo "Download the appropriate package for your distribution,"
|
||||||
|
echo "or get the source tarball at ftp://ftp.gnu.org/pub/gnu/"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
|
||||||
|
(grep "^IT_PROG_INTLTOOL" $srcdir/configure.ac >/dev/null) && {
|
||||||
|
(intltoolize --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`intltool' installed."
|
||||||
|
echo "You can get it from:"
|
||||||
|
echo " ftp://ftp.gnome.org/pub/GNOME/"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(grep "^AM_PROG_XML_I18N_TOOLS" $srcdir/configure.ac >/dev/null) && {
|
||||||
|
(xml-i18n-toolize --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`xml-i18n-toolize' installed."
|
||||||
|
echo "You can get it from:"
|
||||||
|
echo " ftp://ftp.gnome.org/pub/GNOME/"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(grep "^LT_INIT" $srcdir/configure.ac >/dev/null) && {
|
||||||
|
(libtool --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`libtool' installed."
|
||||||
|
echo "You can get it from: ftp://ftp.gnu.org/pub/gnu/"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(grep "^AM_GLIB_GNU_GETTEXT" $srcdir/configure.ac >/dev/null) && {
|
||||||
|
(grep "sed.*POTFILES" $srcdir/configure.ac) > /dev/null || \
|
||||||
|
(glib-gettextize --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`glib' installed."
|
||||||
|
echo "You can get it from: ftp://ftp.gtk.org/pub/gtk"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
(automake --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: You must have \`automake' installed."
|
||||||
|
echo "You can get it from: ftp://ftp.gnu.org/pub/gnu/"
|
||||||
|
DIE=1
|
||||||
|
NO_AUTOMAKE=yes
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
# if no automake, don't bother testing for aclocal
|
||||||
|
test -n "$NO_AUTOMAKE" || (aclocal --version) < /dev/null > /dev/null 2>&1 || {
|
||||||
|
echo
|
||||||
|
echo "**Error**: Missing \`aclocal'. The version of \`automake'"
|
||||||
|
echo "installed doesn't appear recent enough."
|
||||||
|
echo "You can get automake from ftp://ftp.gnu.org/pub/gnu/"
|
||||||
|
DIE=1
|
||||||
|
}
|
||||||
|
|
||||||
|
if test "$DIE" -eq 1; then
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test -z "$*"; then
|
||||||
|
echo "**Warning**: I am going to run \`configure' with no arguments."
|
||||||
|
echo "If you wish to pass any to it, please specify them on the"
|
||||||
|
echo \`$0\'" command line."
|
||||||
|
echo
|
||||||
|
fi
|
||||||
|
|
||||||
|
case $CC in
|
||||||
|
xlc )
|
||||||
|
am_opt=--include-deps;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
for coin in `find $srcdir -path $srcdir/CVS -prune -o -name configure.ac -print`
|
||||||
|
do
|
||||||
|
dr=`dirname $coin`
|
||||||
|
if test -f $dr/NO-AUTO-GEN; then
|
||||||
|
echo skipping $dr -- flagged as no auto-gen
|
||||||
|
else
|
||||||
|
echo processing $dr
|
||||||
|
( cd $dr
|
||||||
|
|
||||||
|
aclocalinclude="$ACLOCAL_FLAGS"
|
||||||
|
|
||||||
|
if grep "^AM_GLIB_GNU_GETTEXT" configure.ac >/dev/null; then
|
||||||
|
echo "Creating $dr/aclocal.m4 ..."
|
||||||
|
test -r $dr/aclocal.m4 || touch $dr/aclocal.m4
|
||||||
|
echo "Running glib-gettextize... Ignore non-fatal messages."
|
||||||
|
echo "no" | glib-gettextize --force --copy
|
||||||
|
echo "Making $dr/aclocal.m4 writable ..."
|
||||||
|
test -r $dr/aclocal.m4 && chmod u+w $dr/aclocal.m4
|
||||||
|
fi
|
||||||
|
if grep "^IT_PROG_INTLTOOL" configure.ac >/dev/null; then
|
||||||
|
echo "Running intltoolize..."
|
||||||
|
intltoolize --copy --force --automake
|
||||||
|
fi
|
||||||
|
if grep "^AM_PROG_XML_I18N_TOOLS" configure.ac >/dev/null; then
|
||||||
|
echo "Running xml-i18n-toolize..."
|
||||||
|
xml-i18n-toolize --copy --force --automake
|
||||||
|
fi
|
||||||
|
if grep "^LT_INIT" configure.ac >/dev/null; then
|
||||||
|
if test -z "$NO_LIBTOOLIZE" ; then
|
||||||
|
echo "Running libtoolize..."
|
||||||
|
libtoolize --force --copy
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
echo "Running aclocal $aclocalinclude ..."
|
||||||
|
aclocal $aclocalinclude
|
||||||
|
if grep "^A[CM]_CONFIG_HEADER" configure.ac >/dev/null; then
|
||||||
|
echo "Running autoheader..."
|
||||||
|
autoheader
|
||||||
|
fi
|
||||||
|
echo "Running automake --gnu $am_opt ..."
|
||||||
|
automake --add-missing --copy --gnu $am_opt
|
||||||
|
echo "Running autoconf ..."
|
||||||
|
autoconf
|
||||||
|
)
|
||||||
|
fi
|
||||||
|
done
|
||||||
|
|
||||||
|
if test x$NOCONFIGURE = x; then
|
||||||
|
echo Running $srcdir/configure "$@" ...
|
||||||
|
$srcdir/configure "$@" \
|
||||||
|
&& echo Now type \`make\' to compile. || exit 1
|
||||||
|
else
|
||||||
|
echo Skipping configure process.
|
||||||
|
fi
|
||||||
@ -0,0 +1,22 @@
|
|||||||
|
dnl Process this file with autoconf to produce a configure script.
|
||||||
|
|
||||||
|
AC_INIT(dsbus, 0.1)
|
||||||
|
|
||||||
|
AC_CONFIG_HEADERS([config.h])
|
||||||
|
|
||||||
|
AM_INIT_AUTOMAKE([1.11])
|
||||||
|
|
||||||
|
AM_SILENT_RULES([yes])
|
||||||
|
|
||||||
|
AC_PROG_CC
|
||||||
|
|
||||||
|
LT_INIT
|
||||||
|
|
||||||
|
PKG_CHECK_MODULES(LIBTDATA, [libtdata >= 0.2.2])
|
||||||
|
PKG_CHECK_MODULES(LIBSEXPR, [libsexpr >= 1.3.1])
|
||||||
|
dnl PKG_CHECK_MODULES(LIBBLKID, [libblkid])
|
||||||
|
|
||||||
|
AC_OUTPUT([
|
||||||
|
Makefile
|
||||||
|
daemon/Makefile
|
||||||
|
tools/Makefile])
|
||||||
@ -0,0 +1,16 @@
|
|||||||
|
## AUTOMAKE_OPTIONS = foreign
|
||||||
|
|
||||||
|
AM_CPPFLAGS = \
|
||||||
|
-DPACKAGE_LOCALE_DIR=\""$(localedir)"\" \
|
||||||
|
-DPACKAGE_SRC_DIR=\""$(srcdir)"\" \
|
||||||
|
-DPACKAGE_DATA_DIR=\""$(pkgdatadir)"\" \
|
||||||
|
-DCNFPATH=\""$(prefix)/etc"\" \
|
||||||
|
-I../include
|
||||||
|
|
||||||
|
AM_CFLAGS = -Wall -g
|
||||||
|
|
||||||
|
bin_PROGRAMS = dsbusd
|
||||||
|
|
||||||
|
dsbusd_SOURCES = daemon.c netlink.c storage.c audit.c support.c
|
||||||
|
dsbusd_LDADD = $(LIBTDATA_LIBS) $(LIBSEXPR_LIBS) -lpthread
|
||||||
|
|
||||||
@ -0,0 +1,89 @@
|
|||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/socket.h>
|
||||||
|
#include <linux/netlink.h>
|
||||||
|
#include <sys/un.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <signal.h>
|
||||||
|
#include <getopt.h>
|
||||||
|
#include <syslog.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <sexpr/sexp.h>
|
||||||
|
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
#include <dsbus/daemon.h>
|
||||||
|
|
||||||
|
#define MAX_PAYLOAD 512
|
||||||
|
|
||||||
|
static int __remove_object_storage(FILE *out, dsb_secstore_t *storage,
|
||||||
|
uint64_t hash)
|
||||||
|
{
|
||||||
|
int r = dsb_store_remove(storage, hash);
|
||||||
|
|
||||||
|
/* NOTE: here the place to put the callback */
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
void events_loop(FILE *out, struct dsbd_ctx *gctx, int fd)
|
||||||
|
{
|
||||||
|
sexp_t *sx, *isx;
|
||||||
|
int idx;
|
||||||
|
uint64_t hash;
|
||||||
|
dsb_secstore_t *storage = gctx->storage;
|
||||||
|
char *datamsg, *cmd;
|
||||||
|
struct nlmsghdr *nlh = (struct nlmsghdr *)malloc(NLMSG_SPACE(MAX_PAYLOAD));
|
||||||
|
struct iovec iov;
|
||||||
|
struct msghdr msg;
|
||||||
|
struct sockaddr_nl src_addr, dest_addr;
|
||||||
|
|
||||||
|
for(;;) {
|
||||||
|
memset(&src_addr, 0, sizeof(src_addr));
|
||||||
|
src_addr.nl_family = AF_NETLINK;
|
||||||
|
src_addr.nl_pid = getpid(); /* self pid */
|
||||||
|
|
||||||
|
memset(nlh, 0, NLMSG_SPACE(MAX_PAYLOAD));
|
||||||
|
memset(&dest_addr, 0, sizeof(dest_addr));
|
||||||
|
|
||||||
|
iov.iov_base = (void *)nlh;
|
||||||
|
iov.iov_len = NLMSG_SPACE(MAX_PAYLOAD);
|
||||||
|
msg.msg_name = (void *)&dest_addr;
|
||||||
|
msg.msg_namelen = sizeof(dest_addr);
|
||||||
|
msg.msg_iov = &iov;
|
||||||
|
msg.msg_iovlen = 1;
|
||||||
|
|
||||||
|
/* Read message from kernel */
|
||||||
|
recvmsg(fd, &msg, 0);
|
||||||
|
datamsg = NLMSG_DATA(nlh);
|
||||||
|
|
||||||
|
if(strlen(datamsg) && (sx = parse_sexp(datamsg, strlen(datamsg)))) {
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(isx->ty == SEXP_LIST) goto __badprot;
|
||||||
|
switch(idx) {
|
||||||
|
case 0:
|
||||||
|
cmd = isx->val;
|
||||||
|
break;
|
||||||
|
case 2:
|
||||||
|
hash = strtoul(isx->val, NULL, 0);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(idx < 2) goto __badprot;
|
||||||
|
|
||||||
|
if(!strcmp(cmd, "rm-object")) __remove_object_storage(out, storage, hash);
|
||||||
|
|
||||||
|
__badprot:
|
||||||
|
destroy_sexp(sx);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
@ -0,0 +1,949 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/socket.h>
|
||||||
|
#include <sys/un.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <signal.h>
|
||||||
|
#include <getopt.h>
|
||||||
|
#include <syslog.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <sexpr/sexp.h>
|
||||||
|
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
#include <dsbus/daemon.h>
|
||||||
|
|
||||||
|
|
||||||
|
static void __print_version(void)
|
||||||
|
{
|
||||||
|
fprintf(stdout, "DSB user space daemon version: 0.1\n\n");
|
||||||
|
fprintf(stdout, "Copyright (c) 2015-2016 Alexander Vdolainen.\nEmail: avdolainen@gmail.com\n\n");
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __print_help(void)
|
||||||
|
{
|
||||||
|
fprintf(stdout, "Usage: dsbusd [options]\nOptions:\n");
|
||||||
|
fprintf(stdout, " --daemonize(-d)\t Daemonize at startup for normal init system.\n");
|
||||||
|
fprintf(stdout, " --systemd(-s)\t Daemonize adopted for idiots init system i.e. systemd.\n");
|
||||||
|
fprintf(stdout, " --config-file-path(-c) <file>\t Use <file> as the configuration file.\n");
|
||||||
|
fprintf(stdout, " --unix-socket-path(-u) <file>\t Use <file> as the unix socket name.\n");
|
||||||
|
fprintf(stdout, " --log-file-path(-l) <file>\t Use <file> as the logging output.\n");
|
||||||
|
fprintf(stdout, " --help(-h)\t Print there help message\n");
|
||||||
|
fprintf(stdout, " --version(-v)\t Print version information\n");
|
||||||
|
fprintf(stdout, "\nFor further information check out provided documentation.\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* this version of skeleton daemon targeted for the normal init system
|
||||||
|
* i.e. sysvinit, openrc, bsd-style init etc...
|
||||||
|
* it will works with systemd like other usual *nix daemon.
|
||||||
|
* there are no sense to make a lot of code for each weird init system
|
||||||
|
*/
|
||||||
|
static void skeleton_daemon()
|
||||||
|
{
|
||||||
|
pid_t pid;
|
||||||
|
int x;
|
||||||
|
|
||||||
|
/* Fork off the parent process */
|
||||||
|
pid = fork();
|
||||||
|
|
||||||
|
/* An error occurred */
|
||||||
|
if(pid < 0)
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
|
||||||
|
/* Success: Let the parent terminate */
|
||||||
|
if(pid > 0)
|
||||||
|
exit(EXIT_SUCCESS);
|
||||||
|
|
||||||
|
/* On success: The child process becomes session leader */
|
||||||
|
if(setsid() < 0)
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
|
||||||
|
/* Catch, ignore and handle signals */
|
||||||
|
signal(SIGCHLD, SIG_IGN);
|
||||||
|
signal(SIGHUP, SIG_IGN);
|
||||||
|
|
||||||
|
/* Fork off for the second time*/
|
||||||
|
pid = fork();
|
||||||
|
|
||||||
|
/* An error occurred */
|
||||||
|
if(pid < 0)
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
|
||||||
|
/* Success: Let the parent terminate */
|
||||||
|
if(pid > 0)
|
||||||
|
exit(EXIT_SUCCESS);
|
||||||
|
|
||||||
|
/* TODO: FIXME: Set new file permissions */
|
||||||
|
//umask(0);
|
||||||
|
|
||||||
|
/* TODO: FIXME: Change the working directory to the root directory */
|
||||||
|
/* or another appropriated directory */
|
||||||
|
//chdir("/");
|
||||||
|
|
||||||
|
/* Close all open file descriptors */
|
||||||
|
for(x = sysconf(_SC_OPEN_MAX); x>0; x--) {
|
||||||
|
close(x);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Open the log file */
|
||||||
|
openlog("dsbusd", LOG_PID, LOG_DAEMON);
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void *__unixsocket_thread(void *arg)
|
||||||
|
{
|
||||||
|
struct dsbd_ctx *gctx = (struct dsbd_ctx *)arg;
|
||||||
|
int s, len, s2;
|
||||||
|
socklen_t t;
|
||||||
|
struct sockaddr_un local, remote;
|
||||||
|
struct _payload *pload;
|
||||||
|
char buf[4096];
|
||||||
|
|
||||||
|
if(!gctx) return NULL;
|
||||||
|
|
||||||
|
if ((s = socket(AF_UNIX, SOCK_STREAM, 0)) == -1) {
|
||||||
|
perror("socket");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
local.sun_family = AF_UNIX;
|
||||||
|
strcpy(local.sun_path, (const char *)gctx->unixsck_path);
|
||||||
|
unlink(local.sun_path);
|
||||||
|
len = strlen(local.sun_path) + sizeof(local.sun_family);
|
||||||
|
if (bind(s, (struct sockaddr *)&local, len) == -1) {
|
||||||
|
syslog(LOG_CRIT, "Unable to create a unix socket for cmds.\n");
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (listen(s, MAX_BACKLOG_CONNECTIONS) == -1) {
|
||||||
|
syslog(LOG_CRIT, "Unable to listen a unix socket for cmds.\n");
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(;;) {
|
||||||
|
int done, n;
|
||||||
|
t = sizeof(remote);
|
||||||
|
if ((s2 = accept(s, (struct sockaddr *)&remote, &t)) == -1) {
|
||||||
|
syslog(LOG_CRIT, "Unable to accept a unix socket connection for cmds.\n");
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
done = 0;
|
||||||
|
do {
|
||||||
|
n = recv(s2, buf, sizeof(char)*4096, 0);
|
||||||
|
if (n <= 0) {
|
||||||
|
if (n < 0) perror("recv");
|
||||||
|
done = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!done) {
|
||||||
|
/* let's deal with that */
|
||||||
|
pload = malloc(sizeof(struct _payload));
|
||||||
|
if(!pload) {
|
||||||
|
syslog(LOG_CRIT, "Cannot allocate memory for message from unix socket.\n");
|
||||||
|
} else {
|
||||||
|
pload->pmsg = strdup(buf);
|
||||||
|
if(pload->pmsg) {
|
||||||
|
pload->scn = s2;
|
||||||
|
if((n = zst_queue_add(gctx->uqueue, pload, USR_MSG))) {
|
||||||
|
free(pload->pmsg);
|
||||||
|
free(pload);
|
||||||
|
close(s2);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
done = 1;
|
||||||
|
}
|
||||||
|
} while (!done);
|
||||||
|
|
||||||
|
memset(buf, 0, sizeof(char)*4096);
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __print_active_object_from_storage(FILE *out,
|
||||||
|
dsb_secstore_t *storage)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->curr_data);
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
dsb_secinfo_t *info = NULL;
|
||||||
|
char *uus;
|
||||||
|
|
||||||
|
pthread_rwlock_rdlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
if(!(node = usrtc_first(stree))) {
|
||||||
|
fprintf(out, "(No data).\n");
|
||||||
|
goto __unlock;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(node = usrtc_first(stree); ;
|
||||||
|
node = usrtc_next(stree, node)) {
|
||||||
|
info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
|
||||||
|
if(!(info->flags & DSB_GARBAGED)) {
|
||||||
|
uus = uuid2str(info->blk_uuid);
|
||||||
|
fprintf(out, "%lu: @%s inum: %lu name: '%s'\n", info->hash,
|
||||||
|
uus ? uus : "nil", info->inode_num,
|
||||||
|
info->obj_name);
|
||||||
|
if(uus) free_uuidstr(uus);
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
if(node == usrtc_last(stree)) break;
|
||||||
|
}
|
||||||
|
|
||||||
|
__unlock:
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __print_object_entries(FILE *out, dsb_secstore_t *storage,
|
||||||
|
uint64_t hash)
|
||||||
|
{
|
||||||
|
dsb_secinfo_t *info;
|
||||||
|
int r = 0;
|
||||||
|
char *uus;
|
||||||
|
|
||||||
|
r = dsb_store_search(storage, hash, &info);
|
||||||
|
if(r) fprintf(out, "Object not found, or internal error occurs (%d).\n", r);
|
||||||
|
else {
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
uus = uuid2str(info->blk_uuid);
|
||||||
|
fprintf(out, "%lu: @%s inum: %lu name: '%s'\n", info->hash,
|
||||||
|
uus ? uus : "nil", info->inode_num,
|
||||||
|
info->obj_name);
|
||||||
|
if(uus) free_uuidstr(uus);
|
||||||
|
|
||||||
|
fprintf(out, "UID List (active):\n");
|
||||||
|
|
||||||
|
for(r = 0; r < __MXRLE; r++) {
|
||||||
|
if(info->aclist.uidlist[r].mask & DSBMASK_SET) {
|
||||||
|
fprintf(out, "\t n: %d UID: %d Mode: ", r, info->aclist.uidlist[r].uid);
|
||||||
|
/* human output */
|
||||||
|
if(info->aclist.uidlist[r].mask & DSBMASK_READ) fprintf(out, "r");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.uidlist[r].mask & DSBMASK_WRITE) fprintf(out, "w");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.uidlist[r].mask & DSBMASK_EXEC) fprintf(out, "x");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
fprintf(out, "\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fprintf(out, "\n");
|
||||||
|
|
||||||
|
fprintf(out, "GID List (active):\n");
|
||||||
|
for(r = 0; r < __MXRLE; r++) {
|
||||||
|
if(info->aclist.gidlist[r].mask & DSBMASK_SET) {
|
||||||
|
fprintf(out, "\t n: %d GID: %d Mode: ", r, info->aclist.gidlist[r].gid);
|
||||||
|
/* human output */
|
||||||
|
if(info->aclist.gidlist[r].mask & DSBMASK_READ) fprintf(out, "r");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.gidlist[r].mask & DSBMASK_WRITE) fprintf(out, "w");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.gidlist[r].mask & DSBMASK_EXEC) fprintf(out, "x");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
fprintf(out, "\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fprintf(out, "\n");
|
||||||
|
|
||||||
|
fprintf(out, "Mode for others: ");
|
||||||
|
if(info->aclist.othmask & DSBMASK_SET) {
|
||||||
|
/* human output */
|
||||||
|
if(info->aclist.othmask & DSBMASK_READ) fprintf(out, "r");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.othmask & DSBMASK_WRITE) fprintf(out, "w");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
if(info->aclist.othmask & DSBMASK_EXEC) fprintf(out, "x");
|
||||||
|
else fprintf(out, "-");
|
||||||
|
fprintf(out, "\n\n");
|
||||||
|
} else fprintf(out, "Not set.\n\n");
|
||||||
|
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __add_object_storage(FILE *out, dsb_secstore_t *storage, char *name,
|
||||||
|
uint64_t inum, uint8_t blkid[16])
|
||||||
|
{
|
||||||
|
dsb_secinfo_t *info = malloc(sizeof(dsb_secinfo_t));
|
||||||
|
char str[512], *uc = NULL;
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
if(!info) fprintf(out, "Not enough memory.\n");
|
||||||
|
|
||||||
|
r = dsb_store_info_allocinit(info);
|
||||||
|
if(r) fprintf(out, "Something goes wrong with %d\n", r);
|
||||||
|
|
||||||
|
/* init */
|
||||||
|
strncpy(info->obj_name, name, 256);
|
||||||
|
memcpy(info->blk_uuid, blkid, sizeof(uint8_t)*16);
|
||||||
|
info->inode_num = inum;
|
||||||
|
|
||||||
|
/* ok, take a deal with a hash:
|
||||||
|
* it's forms from the following:
|
||||||
|
* uuid-inode_num-name
|
||||||
|
*/
|
||||||
|
uc = uuid2str(blkid);
|
||||||
|
snprintf(str, 512, "%s-%lu", uc ? uc : "nil", inum);
|
||||||
|
free_uuidstr(uc);
|
||||||
|
|
||||||
|
info->hash = (uint64_t)djb2_hash((unsigned char *)str);
|
||||||
|
|
||||||
|
r = dsb_store_insert(storage, info);
|
||||||
|
|
||||||
|
if(r) fprintf(out, "Something goes wrong with %d\n", r);
|
||||||
|
else {
|
||||||
|
/* form a message for kernel */
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDADDOBJ;
|
||||||
|
dsbmsg.hash = info->hash;
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __remove_object_storage(FILE *out, dsb_secstore_t *storage,
|
||||||
|
uint64_t hash)
|
||||||
|
{
|
||||||
|
int r = dsb_store_remove(storage, hash);
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
|
||||||
|
if(r) fprintf(out, "Something goes wrong with %d\n", r);
|
||||||
|
else {
|
||||||
|
/* form a message for kernel */
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDREMOVEOBJ;
|
||||||
|
dsbmsg.hash = hash;
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __setrule_object(FILE *out, dsb_secstore_t *storage, uint64_t hash,
|
||||||
|
int n, uint32_t id, int rid, uint8_t mask)
|
||||||
|
{
|
||||||
|
dsb_secinfo_t *info;
|
||||||
|
dsb_acl_entry_t *list;
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
if(n >= __MXRLE || n < 0) {
|
||||||
|
__einval:
|
||||||
|
fprintf(out, "INVALID(EINVAL)\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
r = dsb_store_search(storage, hash, &info);
|
||||||
|
if(r) fprintf(out, "Object not found, or internal error occurs (%d).\n", r);
|
||||||
|
else {
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
switch(rid) {
|
||||||
|
case DSBRID_UID: list = info->aclist.uidlist; break;
|
||||||
|
case DSBRID_GID: list = info->aclist.gidlist; break;
|
||||||
|
case DSBRID_OTHER:
|
||||||
|
info->aclist.othmask = mask;
|
||||||
|
info->aclist.othmask |= DSBMASK_SET;
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
goto __sendmsg;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if(!list) goto __einval;
|
||||||
|
list[n].uid = id;
|
||||||
|
list[n].mask = mask;
|
||||||
|
list[n].mask |= DSBMASK_SET;
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
|
||||||
|
__sendmsg:
|
||||||
|
/* now we need to call the dsb within kernel */
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDSETLISTENTRY;
|
||||||
|
dsbmsg.hash = info->hash;
|
||||||
|
dsbmsg.listno = n;
|
||||||
|
switch(rid) {
|
||||||
|
case DSBRID_UID:
|
||||||
|
dsbmsg.uid = id;
|
||||||
|
break;
|
||||||
|
case DSBRID_GID:
|
||||||
|
dsbmsg.gid = id;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
dsbmsg.flags = rid;
|
||||||
|
dsbmsg.cap = mask;
|
||||||
|
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __cleanrule_object(FILE *out, dsb_secstore_t *storage, uint64_t hash,
|
||||||
|
int n, int rid)
|
||||||
|
{
|
||||||
|
dsb_secinfo_t *info;
|
||||||
|
dsb_acl_entry_t *list;
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
if(n >= __MXRLE || n < 0) {
|
||||||
|
__einval:
|
||||||
|
fprintf(out, "INVALID(EINVAL)\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
r = dsb_store_search(storage, hash, &info);
|
||||||
|
if(r) fprintf(out, "Object not found, or internal error occurs (%d).\n", r);
|
||||||
|
else {
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
switch(rid) {
|
||||||
|
case DSBRID_UID: list = info->aclist.uidlist; break;
|
||||||
|
case DSBRID_GID: list = info->aclist.gidlist; break;
|
||||||
|
case DSBRID_OTHER:
|
||||||
|
info->aclist.othmask = 0;
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
goto __sendmsg;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if(!list) goto __einval;
|
||||||
|
list[n].uid = 0;
|
||||||
|
list[n].mask = 0;
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
|
||||||
|
__sendmsg:
|
||||||
|
/* now we need to call the dsb within kernel */
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDCLEANLISTENTRY;
|
||||||
|
dsbmsg.hash = info->hash;
|
||||||
|
dsbmsg.listno = n;
|
||||||
|
dsbmsg.flags = rid;
|
||||||
|
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __usercap_set(FILE *out, dsb_secstore_t *storage, uid_t uid, uint8_t n)
|
||||||
|
{
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDUIDCAPADD;
|
||||||
|
dsbmsg.uid = uid;
|
||||||
|
dsbmsg.listno = n;
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __usercap_change(FILE *out, dsb_secstore_t *storage, uid_t uid, uint8_t n)
|
||||||
|
{
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDUIDCAPCHANGE;
|
||||||
|
dsbmsg.uid = uid;
|
||||||
|
dsbmsg.listno = n;
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __usercap_remove(FILE *out, dsb_secstore_t *storage, uid_t uid)
|
||||||
|
{
|
||||||
|
struct dsbnl_policy_msg dsbmsg;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
memset(&dsbmsg, 0, sizeof(struct dsbnl_policy_msg));
|
||||||
|
dsbmsg.cmd = DSBNL_CMDUIDCAPREMOVE;
|
||||||
|
dsbmsg.uid = uid;
|
||||||
|
r = netlink_senddsbmsg(storage, &dsbmsg);
|
||||||
|
fprintf(out, "(%d)DONE.\n", r);
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* ok, here the best place to describe S-expression used for control all
|
||||||
|
* the stuff.
|
||||||
|
* 1. Listing - show the list of already configured object permissions
|
||||||
|
* '(list-all)' - will reply with all objects
|
||||||
|
* '(list <hash>)' - will show full information about object permissions
|
||||||
|
* 2. Adding objects to the list
|
||||||
|
* '(object-add (:blkid <128bit identifier>)(:inode <64bit long>)(:name "<name>"))'
|
||||||
|
* 3. Removing objects from the list
|
||||||
|
* '(object-remove <hash>)'
|
||||||
|
* 4. Edit rules of the object
|
||||||
|
* (object-entry-set-uid <hash> (:n 0)(:id 1000)(:mode rwx))
|
||||||
|
* (object-entry-set-gid <hash> (:n 0)(:id 1000)(:mode rwx))
|
||||||
|
* (object-entry-set-other <hash> (:mode rwx))
|
||||||
|
* or, in case of entry clear
|
||||||
|
* '(object-entry-clean-uid <hash> (:n 0))'
|
||||||
|
* '(object-entry-clean-gid <hash> (:n 0))'
|
||||||
|
* '(object-entry-clean-other <hash>)'
|
||||||
|
*/
|
||||||
|
static int __process_msg(FILE *out, char *msg, struct dsbd_ctx *gctx)
|
||||||
|
{
|
||||||
|
/* ok, S-expressions again */
|
||||||
|
sexp_t *sx = NULL, *isx, *iisx;
|
||||||
|
dsb_secstore_t *storage = gctx->storage;
|
||||||
|
uint64_t hash = 0;
|
||||||
|
uint64_t inum;
|
||||||
|
uint8_t blkid[16], mask;
|
||||||
|
char *name, *fu_name, *val_name;
|
||||||
|
uid_t uid;
|
||||||
|
int idx, iidx, i, n, rid;
|
||||||
|
char _des[5];
|
||||||
|
|
||||||
|
if(!msg || !strlen(msg)) return 0;
|
||||||
|
|
||||||
|
if(!(sx = parse_sexp(msg, strlen(msg)))) return 0;
|
||||||
|
|
||||||
|
if(sx->ty == SEXP_LIST)
|
||||||
|
fu_name = sx->list->val;
|
||||||
|
else goto __fini;
|
||||||
|
|
||||||
|
if(!fu_name || !strlen(fu_name)) goto __fini;
|
||||||
|
|
||||||
|
/* now we're ready to call function */
|
||||||
|
if(!strcmp(fu_name, "list-all")) { /* no parse at all */
|
||||||
|
__print_active_object_from_storage(out, storage);
|
||||||
|
} else if(!strcmp(fu_name, "list")) { /* need to take a hash */
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx == 1) hash = strtoul(isx->val, NULL, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
__print_object_entries(out, storage, hash);
|
||||||
|
} else if(!strcmp(fu_name, "object-add")) {
|
||||||
|
name = NULL; inum = 0;
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx && isx->ty != SEXP_LIST) goto __fini; /* skip */
|
||||||
|
|
||||||
|
if(idx) {
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!strcmp(val_name, ":blkid")) {
|
||||||
|
memset(blkid, 0, sizeof(uint8_t)*16);
|
||||||
|
|
||||||
|
/* convert it to normal base */
|
||||||
|
for(iidx = 0, i = 0; name[iidx] != '\0'; i++, iidx += 2) {
|
||||||
|
if(i > 15) goto __fini;
|
||||||
|
memset(_des, 0, 5);
|
||||||
|
snprintf(_des, 5, "0x%c%c", name[iidx], name[iidx + 1]);
|
||||||
|
blkid[i] = strtoul(_des, NULL, 0);
|
||||||
|
}
|
||||||
|
} else if(!strcmp(val_name, ":inode")) inum = strtoul(name, NULL, 10);
|
||||||
|
else if(!strcmp(val_name, ":name")) name = name; /* nothing to do */
|
||||||
|
else goto __fini;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!name || !inum) goto __fini;
|
||||||
|
|
||||||
|
__add_object_storage(out, storage, name, inum, blkid);
|
||||||
|
} else if(!strcmp(fu_name, "object-remove")) {
|
||||||
|
hash = 0;
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx == 1) hash = strtoul(isx->val, NULL, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!hash) goto __fini;
|
||||||
|
__remove_object_storage(out, storage, hash);
|
||||||
|
} else if(!strcmp(fu_name, "object-entry-set-uid") || !strcmp(fu_name, "object-entry-set-gid")) {
|
||||||
|
/* rid */
|
||||||
|
if(!strcmp(fu_name, "object-entry-set-uid")) rid = DSBRID_UID;
|
||||||
|
else rid = DSBRID_GID;
|
||||||
|
|
||||||
|
hash = 0; n = 0; mask = 0;
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx < 2 && isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx > 1 && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
switch(idx) {
|
||||||
|
case 0: break; /* check here ? */
|
||||||
|
case 1: hash = strtoul(isx->val, NULL, 0); break;
|
||||||
|
case 2:
|
||||||
|
case 3:
|
||||||
|
case 4:
|
||||||
|
case 5:
|
||||||
|
name = NULL;
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!name) goto __fini;
|
||||||
|
|
||||||
|
/* take care about what we got */
|
||||||
|
if(!strcmp(val_name, ":n")) n = atoi(name);
|
||||||
|
else if(!strcmp(val_name, ":mode")) {
|
||||||
|
mask = 0;
|
||||||
|
if(strlen(name) != 3) goto __fini;
|
||||||
|
|
||||||
|
for(i = 0; i < 3; i++) if(name[i] != '-') mask |= (1 << (i + 1));
|
||||||
|
} else if(!strcmp(val_name, ":id")) uid = atoi(name);
|
||||||
|
else goto __fini;
|
||||||
|
|
||||||
|
break;
|
||||||
|
default: goto __fini;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!hash) goto __fini;
|
||||||
|
|
||||||
|
__setrule_object(out, storage, hash, n, uid, rid, mask);
|
||||||
|
} else if(!strcmp(fu_name, "object-entry-set-other")) {
|
||||||
|
rid = DSBRID_OTHER;
|
||||||
|
hash = 0; mask = 0;
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx < 2 && isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx > 1 && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
switch(idx) {
|
||||||
|
case 0: break; /* check here ? */
|
||||||
|
case 1: hash = strtoul(isx->val, NULL, 0); break;
|
||||||
|
case 2:
|
||||||
|
case 3:
|
||||||
|
name = NULL;
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!name) goto __fini;
|
||||||
|
|
||||||
|
/* take care about what we got */
|
||||||
|
if(!strcmp(val_name, ":mode")) {
|
||||||
|
mask = 0;
|
||||||
|
if(strlen(name) != 3) goto __fini;
|
||||||
|
|
||||||
|
for(i = 0; i < 3; i++) if(name[i] != '-') mask |= (1 << (i + 1));
|
||||||
|
} else goto __fini;
|
||||||
|
|
||||||
|
break;
|
||||||
|
default: goto __fini;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!hash) goto __fini;
|
||||||
|
|
||||||
|
__setrule_object(out, storage, hash, 0, 0, rid, mask);
|
||||||
|
} else if(!strcmp(fu_name, "object-entry-clean-uid") || !strcmp(fu_name, "object-entry-clean-gid")) {
|
||||||
|
/* rid */
|
||||||
|
if(!strcmp(fu_name, "object-entry-clean-uid")) rid = DSBRID_UID;
|
||||||
|
else rid = DSBRID_GID;
|
||||||
|
hash = 0; n = 0;
|
||||||
|
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx < 2 && isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx > 1 && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
switch(idx) {
|
||||||
|
case 0: break; /* check here ? */
|
||||||
|
case 1: hash = strtoul(isx->val, NULL, 0); break;
|
||||||
|
case 2:
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* take care about what we got */
|
||||||
|
if(!strcmp(val_name, ":n")) n = atoi(name);
|
||||||
|
else goto __fini;
|
||||||
|
|
||||||
|
break;
|
||||||
|
default: goto __fini;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!hash) goto __fini;
|
||||||
|
|
||||||
|
__cleanrule_object(out, storage, hash, n, rid);
|
||||||
|
} else if(!strcmp(fu_name, "object-entry-clean-other")) {
|
||||||
|
rid = DSBRID_OTHER;
|
||||||
|
hash = 0;
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx < 2 && isx->ty == SEXP_LIST) goto __fini;
|
||||||
|
if(idx > 1 && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
switch(idx) {
|
||||||
|
case 0: break; /* check here ? */
|
||||||
|
case 1: hash = strtoul(isx->val, NULL, 0); break;
|
||||||
|
default: goto __fini;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!hash) goto __fini;
|
||||||
|
|
||||||
|
__cleanrule_object(out, storage, hash, 0, rid);
|
||||||
|
} else if(!strcmp(fu_name, "user-cap-set") ||
|
||||||
|
!strcmp(fu_name, "user-cap-change")) { /* (user-cap-set|change (:uid <uid>) (:mask <mask>)) */
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
if(idx) {
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(!strcmp(val_name, ":uid")) uid = atoi(name);
|
||||||
|
else if(!strcmp(val_name, ":mask")) n = atoi(name);
|
||||||
|
else goto __fini;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!strcmp(fu_name, "user-cap-set")) __usercap_set(out, storage, uid, n);
|
||||||
|
else __usercap_change(out, storage, uid, n);
|
||||||
|
} else if(!strcmp(fu_name, "user-cap-remove")) { /* (user-cap-set (:uid <uid>)) */
|
||||||
|
SEXP_ITERATE_LIST(sx, isx, idx) {
|
||||||
|
if(idx && isx->ty != SEXP_LIST) goto __fini;
|
||||||
|
|
||||||
|
if(idx) {
|
||||||
|
SEXP_ITERATE_LIST(isx, iisx, iidx) {
|
||||||
|
if(iisx->ty == SEXP_LIST) goto __fini; /* skip */
|
||||||
|
switch(iidx) {
|
||||||
|
case 0: val_name = iisx->val; break;
|
||||||
|
case 1: name = iisx->val; break;
|
||||||
|
default: goto __fini; break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(!strcmp(val_name, ":uid")) uid = atoi(name);
|
||||||
|
else goto __fini;
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
__usercap_remove(out, storage, uid);
|
||||||
|
} else goto __fini;
|
||||||
|
|
||||||
|
__fini:
|
||||||
|
destroy_sexp(sx);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void *__ctrl_thread(void *arg)
|
||||||
|
{
|
||||||
|
struct dsbd_ctx *gctx = (struct dsbd_ctx *)arg;
|
||||||
|
struct _payload *pload;
|
||||||
|
zst_msg_t msg;
|
||||||
|
FILE *wstream = NULL;
|
||||||
|
|
||||||
|
while(1) {
|
||||||
|
if(zst_queue_get(gctx->uqueue, NULL, &msg)) break;
|
||||||
|
|
||||||
|
if(msg.msgtype != USR_MSG) continue;
|
||||||
|
else pload = (struct _payload *)msg.data;
|
||||||
|
|
||||||
|
wstream = fdopen(pload->scn, "r+");
|
||||||
|
if(!wstream) {
|
||||||
|
printf("errno = %s\n", strerror(errno));
|
||||||
|
close(pload->scn);
|
||||||
|
goto __fini_msg;
|
||||||
|
}
|
||||||
|
|
||||||
|
__process_msg(wstream, pload->pmsg, gctx);
|
||||||
|
|
||||||
|
fflush(wstream);
|
||||||
|
fclose(wstream);
|
||||||
|
|
||||||
|
__fini_msg:
|
||||||
|
/* finish up the message */
|
||||||
|
//free(pload->pmsg);
|
||||||
|
//free(pload);
|
||||||
|
wstream = NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* peeeeeee
|
||||||
|
* have a nice days until systemd isn't goes deep
|
||||||
|
*/
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
int c, r = 0, fp = 0;
|
||||||
|
struct dsbd_ctx *gctx = malloc(sizeof(struct dsbd_ctx));
|
||||||
|
dsb_secstore_t *storage = malloc(sizeof(dsb_secstore_t));
|
||||||
|
zst_queue_t *queue = malloc(sizeof(zst_queue_t));
|
||||||
|
pthread_t unixsck_thread, cmds_thread;
|
||||||
|
|
||||||
|
if(!queue) return -ENOMEM;
|
||||||
|
if(!gctx || !storage) return -ENOMEM;
|
||||||
|
else { /* initial */
|
||||||
|
memset(gctx, 0, sizeof(struct dsbd_ctx));
|
||||||
|
|
||||||
|
if((r = dsb_store_allocinit(storage))) goto __fails;
|
||||||
|
else gctx->storage = storage;
|
||||||
|
|
||||||
|
if((r = zst_queue_init(queue))) goto __fails;
|
||||||
|
else gctx->uqueue = queue;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* this is time to parse parameters */
|
||||||
|
while (1) {
|
||||||
|
static struct option long_options[] = {
|
||||||
|
/* These options a generic ones. */
|
||||||
|
{"help", no_argument, NULL, 'h'}, /* print out help and version info */
|
||||||
|
{"version", no_argument, NULL, 'v'}, /* just out a version info */
|
||||||
|
/* The following options about system. */
|
||||||
|
{"daemonize", no_argument, NULL, 'd'},
|
||||||
|
{"systemd", no_argument, NULL, 's'},
|
||||||
|
{"unix-socket-path", required_argument, NULL, 'u'},
|
||||||
|
{"log-file-path", required_argument, NULL, 'l'},
|
||||||
|
{NULL, 0, NULL, 0},
|
||||||
|
};
|
||||||
|
/* getopt_long stores the option index here. */
|
||||||
|
int option_index = 0;
|
||||||
|
|
||||||
|
if((c = getopt_long(argc, argv, "hvdsu:l:", long_options,
|
||||||
|
&option_index)) == -1) break;
|
||||||
|
|
||||||
|
switch (c) {
|
||||||
|
case 'h':
|
||||||
|
__print_help();
|
||||||
|
return 0;
|
||||||
|
break;
|
||||||
|
case 'v':
|
||||||
|
__print_version();
|
||||||
|
return 0;
|
||||||
|
break;
|
||||||
|
case 'd':
|
||||||
|
gctx->flags |= DSBD_DAEMONIZE;
|
||||||
|
break;
|
||||||
|
case 's':
|
||||||
|
gctx->flags |= DSBD_SYSTEMSHIT;
|
||||||
|
break;
|
||||||
|
case 'u':
|
||||||
|
if(!(gctx->unixsck_path = strdup(optarg))) { r = -ENOMEM; goto __fails; }
|
||||||
|
fp++;
|
||||||
|
break;
|
||||||
|
case 'l':
|
||||||
|
if(!(gctx->log_file = strdup(optarg))) { r = -ENOMEM; goto __fails; }
|
||||||
|
fp++;
|
||||||
|
break;
|
||||||
|
case '?':
|
||||||
|
/* getopt_long already printed an error message. */
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
abort();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(fp < 2) {
|
||||||
|
fprintf(stderr, "FAIL: No file pathes provided, not enough options.\n");
|
||||||
|
|
||||||
|
__print_version();
|
||||||
|
__print_help();
|
||||||
|
return -EINVAL;
|
||||||
|
}
|
||||||
|
|
||||||
|
if(gctx->flags & DSBD_DAEMONIZE) skeleton_daemon();
|
||||||
|
|
||||||
|
/* ok now we're ready to do the other initialization */
|
||||||
|
dsb_sectore_setinitdac(gctx->storage, store_initdac);
|
||||||
|
dsb_sectore_setinitbe(gctx->storage, store_initbe);
|
||||||
|
dsb_sectore_setpushdac(gctx->storage, store_pushbe);
|
||||||
|
dsb_sectore_setpushbe(gctx->storage, store_pushdac);
|
||||||
|
|
||||||
|
r = dsb_store_init(gctx->storage, gctx, gctx);
|
||||||
|
if(r) goto __fails;
|
||||||
|
|
||||||
|
/* firstly open unix socket to listen for cmds */
|
||||||
|
/*
|
||||||
|
* NOTE: this part might be completely changed for more
|
||||||
|
* appropriate way to make it so.
|
||||||
|
* my suggestion to use special secure local bus, no no no
|
||||||
|
* no dbus, just something lightweight and secure. Proposal required.
|
||||||
|
*/
|
||||||
|
if(pthread_create(&unixsck_thread, NULL, __unixsocket_thread, (void *)gctx)) {
|
||||||
|
syslog(LOG_CRIT, "Failed to create a special unix socket listening thread.\n");
|
||||||
|
return -ENOMEM;
|
||||||
|
}
|
||||||
|
if(pthread_create(&cmds_thread, NULL, __ctrl_thread, (void *)gctx)) {
|
||||||
|
syslog(LOG_CRIT, "Failed to create a special unix socket command thread.\n");
|
||||||
|
return -ENOMEM;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* main thread will works with netlink */
|
||||||
|
int infd = scknl_openevents();
|
||||||
|
if(infd < 0) {
|
||||||
|
for(;;) {
|
||||||
|
sleep(10000);
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
events_loop(stderr, gctx, infd);
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_cancel(unixsck_thread);
|
||||||
|
pthread_cancel(cmds_thread);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
__fails:
|
||||||
|
free(gctx);
|
||||||
|
free(storage);
|
||||||
|
|
||||||
|
return -r;
|
||||||
|
}
|
||||||
@ -0,0 +1,114 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/socket.h>
|
||||||
|
#include <linux/netlink.h>
|
||||||
|
#include <sys/un.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <signal.h>
|
||||||
|
#include <getopt.h>
|
||||||
|
#include <syslog.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <sexpr/sexp.h>
|
||||||
|
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
#include <dsbus/daemon.h>
|
||||||
|
|
||||||
|
#define MAX_PAYLOAD 512
|
||||||
|
|
||||||
|
struct netlink_be {
|
||||||
|
int fd;
|
||||||
|
};
|
||||||
|
|
||||||
|
int store_initdac(dsb_secstore_t *storage, void *priv)
|
||||||
|
{
|
||||||
|
struct netlink_be *be = malloc(sizeof(struct netlink_be));
|
||||||
|
struct sockaddr_nl src_addr;
|
||||||
|
|
||||||
|
if(!be) return ENOMEM;
|
||||||
|
else storage->dac_be = be;
|
||||||
|
|
||||||
|
be->fd = socket(PF_NETLINK, SOCK_RAW, 31);
|
||||||
|
if(be->fd < 0) return errno;
|
||||||
|
|
||||||
|
memset(&src_addr, 0, sizeof(src_addr));
|
||||||
|
src_addr.nl_family = AF_NETLINK;
|
||||||
|
src_addr.nl_pid = getpid(); /* self pid */
|
||||||
|
|
||||||
|
bind(be->fd, (struct sockaddr*)&src_addr, sizeof(src_addr));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int scknl_openevents(void)
|
||||||
|
{
|
||||||
|
int fd;
|
||||||
|
struct sockaddr_nl src_addr;
|
||||||
|
|
||||||
|
fd = socket(PF_NETLINK, SOCK_RAW, 30);
|
||||||
|
if(fd < 0) return fd;
|
||||||
|
|
||||||
|
memset(&src_addr, 0, sizeof(src_addr));
|
||||||
|
src_addr.nl_family = AF_NETLINK;
|
||||||
|
src_addr.nl_pid = getpid(); /* self pid */
|
||||||
|
|
||||||
|
bind(fd, (struct sockaddr*)&src_addr, sizeof(src_addr));
|
||||||
|
|
||||||
|
return fd;
|
||||||
|
}
|
||||||
|
|
||||||
|
int netlink_senddsbmsg(dsb_secstore_t *storage, struct dsbnl_policy_msg *dsbmsg)
|
||||||
|
{
|
||||||
|
struct netlink_be *be = storage->dac_be;
|
||||||
|
struct sockaddr_nl dest_addr;
|
||||||
|
struct nlmsghdr *nlh = NULL;
|
||||||
|
struct msghdr msg;
|
||||||
|
struct iovec iov;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
/* set destination address */
|
||||||
|
memset(&dest_addr, 0, sizeof(dest_addr));
|
||||||
|
dest_addr.nl_family = AF_NETLINK;
|
||||||
|
dest_addr.nl_pid = 0; /* For Linux Kernel */
|
||||||
|
dest_addr.nl_groups = 2; /* unicast */
|
||||||
|
|
||||||
|
nlh = (struct nlmsghdr *)malloc(NLMSG_SPACE(MAX_PAYLOAD));
|
||||||
|
memset(nlh, 0, NLMSG_SPACE(MAX_PAYLOAD));
|
||||||
|
nlh->nlmsg_len = NLMSG_SPACE(MAX_PAYLOAD);
|
||||||
|
nlh->nlmsg_pid = getpid();
|
||||||
|
nlh->nlmsg_flags = 0;
|
||||||
|
|
||||||
|
memcpy(NLMSG_DATA(nlh), dsbmsg, sizeof(struct dsbnl_policy_msg));
|
||||||
|
|
||||||
|
iov.iov_base = (void *)nlh;
|
||||||
|
iov.iov_len = nlh->nlmsg_len;
|
||||||
|
memset(&msg, 0, sizeof(msg));
|
||||||
|
msg.msg_name = (void *)&dest_addr;
|
||||||
|
msg.msg_namelen = sizeof(dest_addr);
|
||||||
|
msg.msg_iov = &iov;
|
||||||
|
msg.msg_iovlen = 1;
|
||||||
|
|
||||||
|
r = sendmsg(be->fd, &msg, 0);
|
||||||
|
if(r < 0) {
|
||||||
|
printf("go: %s\n", strerror(errno));
|
||||||
|
return errno;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int store_pushdac(dsb_secstore_t *storage, dsb_secinfo_t *info)
|
||||||
|
{
|
||||||
|
/* still dummy */
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
@ -0,0 +1,232 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <errno.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
|
||||||
|
static long __cmpuint64(const void *a, const void *b);
|
||||||
|
|
||||||
|
int dsb_store_allocinit(dsb_secstore_t *storage)
|
||||||
|
{
|
||||||
|
if(!storage) return EINVAL;
|
||||||
|
else memset(storage, 0, sizeof(dsb_secstore_t));
|
||||||
|
|
||||||
|
if(pthread_rwlock_init(&(storage->srwlock), NULL)) return ENOMEM;
|
||||||
|
|
||||||
|
usrtc_init(&(storage->curr_data), USRTC_SPLAY, MAX_CTRLED_OBJECTS,
|
||||||
|
__cmpuint64);
|
||||||
|
usrtc_init(&(storage->garbaged_data), USRTC_SPLAY, MAX_CTRLED_OBJECTS,
|
||||||
|
__cmpuint64);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_init(dsb_secstore_t *storage, void *beptr, void *dacptr)
|
||||||
|
{
|
||||||
|
int r = 0;
|
||||||
|
if(!storage->store_initbe || !storage->store_initdac) return EINVAL;
|
||||||
|
|
||||||
|
if((r = storage->store_initbe(storage, beptr))) return r;
|
||||||
|
if((r = storage->store_initdac(storage, dacptr))) return r;
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_flush(dsb_secstore_t *storage)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->curr_data);
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
dsb_secinfo_t *info = NULL;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
/* globally lock it */
|
||||||
|
pthread_rwlock_wrlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
for(node = usrtc_first(stree); node != usrtc_last(stree);
|
||||||
|
node = usrtc_next(stree, node)) {
|
||||||
|
info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
if((info->flags & DSB_DIRTY) && (info->flags & DSB_CONFIGURED)) {
|
||||||
|
r = dsb_sectore_pushbe(storage, info);
|
||||||
|
if(!r) r = dsb_sectore_pushdac(storage, info);
|
||||||
|
|
||||||
|
/* clear flag */
|
||||||
|
if(!r) info->flags &= ~DSB_DIRTY;
|
||||||
|
}
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
|
||||||
|
if(r) break;
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_clean(dsb_secstore_t *storage)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->garbaged_data);
|
||||||
|
dsb_secinfo_t *info = NULL;
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
/* globally lock it */
|
||||||
|
pthread_rwlock_wrlock(&(storage->srwlock));
|
||||||
|
for(node = usrtc_first(stree); node != NULL;
|
||||||
|
node = usrtc_first(stree)) {
|
||||||
|
info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
usrtc_delete(stree, node);
|
||||||
|
if((r = dsb_store_info_destroy(info))) break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!r) {
|
||||||
|
stree = &(storage->curr_data);
|
||||||
|
|
||||||
|
for(node = usrtc_first(stree); node != usrtc_last(stree);
|
||||||
|
node = usrtc_next(stree, node)) {
|
||||||
|
info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
if((info->flags & DSB_GARBAGED) && (info->flags & DSB_CONFIGURED)) {
|
||||||
|
pthread_mutex_lock(&info->slock);
|
||||||
|
if((r = dsb_sectore_pushbe(storage, info))) goto __l_fail;
|
||||||
|
if((r = dsb_sectore_pushdac(storage, info))) goto __l_fail;
|
||||||
|
|
||||||
|
/* move node to the garbage */
|
||||||
|
usrtc_delete(stree, node);
|
||||||
|
usrtc_insert(&(storage->garbaged_data), node, &(info->hash));
|
||||||
|
|
||||||
|
__l_fail:
|
||||||
|
pthread_mutex_unlock(&info->slock);
|
||||||
|
if(r) break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_insert(dsb_secstore_t *storage, dsb_secinfo_t *info)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->curr_data);
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
if(!info) return EINVAL;
|
||||||
|
|
||||||
|
/* check for duplicates */
|
||||||
|
pthread_rwlock_rdlock(&(storage->srwlock));
|
||||||
|
if(usrtc_count(stree) >= MAX_CTRLED_OBJECTS) r = EXFULL;
|
||||||
|
|
||||||
|
node = usrtc_lookup(stree, &(info->hash));
|
||||||
|
if(node) r = EEXIST;
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
if(r) return r;
|
||||||
|
else node = &(info->node);
|
||||||
|
|
||||||
|
/* global lock */
|
||||||
|
pthread_rwlock_wrlock(&(storage->srwlock));
|
||||||
|
usrtc_insert(stree, node, &(info->hash));
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_remove(dsb_secstore_t *storage, uint64_t hash)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->curr_data);
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
dsb_secinfo_t *info;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
pthread_rwlock_rdlock(&(storage->srwlock));
|
||||||
|
if(usrtc_count(stree) >= MAX_CTRLED_OBJECTS) r = EXFULL;
|
||||||
|
|
||||||
|
node = usrtc_lookup(stree, &hash);
|
||||||
|
if(!node) r = ENOENT;
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
if(!r) {
|
||||||
|
info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
pthread_mutex_lock(&(info->slock));
|
||||||
|
info->flags |= DSB_GARBAGED;
|
||||||
|
info->flags |= DSB_DIRTY;
|
||||||
|
pthread_mutex_unlock(&(info->slock));
|
||||||
|
}
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_search(dsb_secstore_t *storage, uint64_t hash,
|
||||||
|
dsb_secinfo_t **info)
|
||||||
|
{
|
||||||
|
usrtc_t *stree = &(storage->curr_data);
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
pthread_rwlock_rdlock(&(storage->srwlock));
|
||||||
|
node = usrtc_lookup(stree, &hash);
|
||||||
|
if(!node) r = ENOENT;
|
||||||
|
|
||||||
|
pthread_rwlock_unlock(&(storage->srwlock));
|
||||||
|
|
||||||
|
if(!r) *info = (dsb_secinfo_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* --- infos --- */
|
||||||
|
|
||||||
|
int dsb_store_info_allocinit(dsb_secinfo_t *info)
|
||||||
|
{
|
||||||
|
if(!info) return EINVAL;
|
||||||
|
|
||||||
|
memset(info, 0, sizeof(dsb_secinfo_t));
|
||||||
|
|
||||||
|
if(pthread_mutex_init(&(info->slock), NULL)) return ENOMEM;
|
||||||
|
|
||||||
|
usrtc_node_init(&(info->node), (void *)info);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int dsb_store_info_destroy(dsb_secinfo_t *info)
|
||||||
|
{
|
||||||
|
if(!info) return EINVAL;
|
||||||
|
|
||||||
|
pthread_mutex_destroy(&(info->slock));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct storage_backend {
|
||||||
|
int fd;
|
||||||
|
};
|
||||||
|
|
||||||
|
int store_initbe(dsb_secstore_t *storage, void *priv)
|
||||||
|
{
|
||||||
|
struct storage_backend *be = malloc(sizeof(struct storage_backend));
|
||||||
|
|
||||||
|
if(!be) return ENOMEM;
|
||||||
|
else storage->store_be = be;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int store_pushbe(dsb_secstore_t *storage, dsb_secinfo_t *info)
|
||||||
|
{
|
||||||
|
/* dummy */
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static long __cmpuint64(const void *a, const void *b)
|
||||||
|
{
|
||||||
|
return *(uint64_t *)a - *(uint64_t *)b;
|
||||||
|
}
|
||||||
@ -0,0 +1,236 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <sys/time.h>
|
||||||
|
#include <fcntl.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
#include <dsbus/daemon.h>
|
||||||
|
|
||||||
|
static long __cmp_uint(const void *a, const void *b)
|
||||||
|
{
|
||||||
|
return (long)(*(unsigned int *)a - *(unsigned int *)b);
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline zst_msg_t *__get_newmsg(zst_queue_t *queue)
|
||||||
|
{
|
||||||
|
usrtc_t *tree = &queue->msgcache;
|
||||||
|
usrtc_node_t *node;
|
||||||
|
zst_msg_t *tmp;
|
||||||
|
|
||||||
|
if(usrtc_count(tree)) {
|
||||||
|
node = usrtc_first(tree);
|
||||||
|
tmp = (zst_msg_t *)usrtc_node_getdata(node);
|
||||||
|
usrtc_delete(tree, node);
|
||||||
|
} else {
|
||||||
|
tmp = malloc(sizeof(zst_msg_t));
|
||||||
|
tree = &queue->qtree;
|
||||||
|
node = &tmp->node;
|
||||||
|
usrtc_node_init(node, tmp);
|
||||||
|
}
|
||||||
|
/* insert it */
|
||||||
|
tree = &queue->qtree;
|
||||||
|
tmp->qlength = usrtc_count(tree);
|
||||||
|
usrtc_insert(tree, node, (void *)(&tmp->qlength));
|
||||||
|
|
||||||
|
return tmp;
|
||||||
|
}
|
||||||
|
|
||||||
|
static inline void __release_msg(zst_queue_t *queue, zst_msg_t *msg)
|
||||||
|
{
|
||||||
|
usrtc_node_t *node = &msg->node;
|
||||||
|
usrtc_t *tree = &queue->qtree;
|
||||||
|
|
||||||
|
tree = &queue->qtree; /* remove from queue */
|
||||||
|
usrtc_delete(tree, node);
|
||||||
|
|
||||||
|
tree = &queue->msgcache;
|
||||||
|
|
||||||
|
if(usrtc_count(tree) >= MAX_QUEUE_POOL)
|
||||||
|
free(msg);
|
||||||
|
else {
|
||||||
|
msg->data = NULL;
|
||||||
|
msg->msgtype = NIL_MSG;
|
||||||
|
usrtc_insert(tree, node, (void *)&msg->qlength);
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
int zst_queue_init(zst_queue_t *queue)
|
||||||
|
{
|
||||||
|
int r = 0;
|
||||||
|
|
||||||
|
memset(queue, 0, sizeof(zst_queue_t));
|
||||||
|
if((r = pthread_cond_init(&queue->cond, NULL)))
|
||||||
|
return r;
|
||||||
|
|
||||||
|
if((r = pthread_mutex_init(&queue->mutex, NULL))) {
|
||||||
|
pthread_cond_destroy(&queue->cond);
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
usrtc_init(&queue->qtree, USRTC_AVL, MAX_QUEUE_SIZE, __cmp_uint);
|
||||||
|
usrtc_init(&queue->msgcache, USRTC_AVL, MAX_QUEUE_POOL, __cmp_uint);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int zst_queue_add(zst_queue_t *queue, void *data, unsigned int msgtype)
|
||||||
|
{
|
||||||
|
zst_msg_t *newmsg;
|
||||||
|
|
||||||
|
pthread_mutex_lock(&queue->mutex);
|
||||||
|
newmsg = __get_newmsg(queue);
|
||||||
|
if (newmsg == NULL) {
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
return ENOMEM;
|
||||||
|
}
|
||||||
|
|
||||||
|
newmsg->data = data;
|
||||||
|
newmsg->msgtype = msgtype;
|
||||||
|
|
||||||
|
if(queue->length == 0)
|
||||||
|
pthread_cond_broadcast(&queue->cond);
|
||||||
|
queue->length++;
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int zst_queue_get(zst_queue_t *queue, const struct timespec *timeout, zst_msg_t *msg)
|
||||||
|
{
|
||||||
|
usrtc_t *tree;
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
zst_msg_t *tmp;
|
||||||
|
int r = 0;
|
||||||
|
struct timespec abstimeout;
|
||||||
|
|
||||||
|
if (queue == NULL || msg == NULL)
|
||||||
|
return EINVAL;
|
||||||
|
else
|
||||||
|
tree = &queue->qtree;
|
||||||
|
|
||||||
|
if (timeout) { /* setup timeout */
|
||||||
|
struct timeval now;
|
||||||
|
|
||||||
|
gettimeofday(&now, NULL);
|
||||||
|
abstimeout.tv_sec = now.tv_sec + timeout->tv_sec;
|
||||||
|
abstimeout.tv_nsec = (now.tv_usec * 1000) + timeout->tv_nsec;
|
||||||
|
if (abstimeout.tv_nsec >= 1000000000) {
|
||||||
|
abstimeout.tv_sec++;
|
||||||
|
abstimeout.tv_nsec -= 1000000000;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_mutex_lock(&queue->mutex);
|
||||||
|
|
||||||
|
/* Will wait until awakened by a signal or broadcast */
|
||||||
|
while ((node = usrtc_first(tree)) == NULL && r != ETIMEDOUT) { /* Need to loop to handle spurious wakeups */
|
||||||
|
if (timeout)
|
||||||
|
r = pthread_cond_timedwait(&queue->cond, &queue->mutex, &abstimeout);
|
||||||
|
else
|
||||||
|
pthread_cond_wait(&queue->cond, &queue->mutex);
|
||||||
|
}
|
||||||
|
if (r == ETIMEDOUT) {
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
tmp = (zst_msg_t *)usrtc_node_getdata(node);
|
||||||
|
queue->length--;
|
||||||
|
|
||||||
|
msg->data = tmp->data;
|
||||||
|
msg->msgtype = tmp->msgtype;
|
||||||
|
msg->qlength = tmp->qlength; /* we will hold the msg id instead of size here */
|
||||||
|
|
||||||
|
__release_msg(queue, tmp);
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int zst_queue_destroy(zst_queue_t *queue, int freedata, void (*free_msg)(void *))
|
||||||
|
{
|
||||||
|
int r = 0;
|
||||||
|
usrtc_t *tree = &queue->qtree;
|
||||||
|
usrtc_node_t *node = NULL;
|
||||||
|
zst_msg_t *msg;
|
||||||
|
|
||||||
|
if (queue == NULL) return EINVAL;
|
||||||
|
|
||||||
|
pthread_mutex_lock(&queue->mutex);
|
||||||
|
|
||||||
|
for (node = usrtc_first(tree); node != NULL; node = usrtc_first(tree)) {
|
||||||
|
usrtc_delete(tree, node);
|
||||||
|
msg = (zst_msg_t *)usrtc_node_getdata(node);
|
||||||
|
|
||||||
|
if(freedata) free(msg->data);
|
||||||
|
else if(free_msg) free_msg(msg->data);
|
||||||
|
|
||||||
|
free(msg);
|
||||||
|
}
|
||||||
|
/* free cache */
|
||||||
|
tree = &queue->msgcache;
|
||||||
|
for (node = usrtc_first(tree); node != NULL; node = usrtc_first(tree)) {
|
||||||
|
usrtc_delete(tree, node);
|
||||||
|
free(usrtc_node_getdata(node));
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
r = pthread_mutex_destroy(&queue->mutex);
|
||||||
|
pthread_cond_destroy(&queue->cond);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int zst_queue_length(zst_queue_t *queue)
|
||||||
|
{
|
||||||
|
unsigned int c;
|
||||||
|
|
||||||
|
pthread_mutex_lock(&queue->mutex);
|
||||||
|
c = queue->length;
|
||||||
|
pthread_mutex_unlock(&queue->mutex);
|
||||||
|
|
||||||
|
return c;
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned long djb2_hash(unsigned char *str)
|
||||||
|
{
|
||||||
|
unsigned long hash = 5381;
|
||||||
|
int c;
|
||||||
|
|
||||||
|
while ((c = *str++))
|
||||||
|
hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
|
||||||
|
|
||||||
|
return hash;
|
||||||
|
}
|
||||||
|
|
||||||
|
char *uuid2str(uint8_t uuid[16])
|
||||||
|
{
|
||||||
|
char *str = malloc(sizeof(char)*64);
|
||||||
|
int i;
|
||||||
|
|
||||||
|
if(!str) return NULL;
|
||||||
|
else memset(str, 0, sizeof(char)*64);
|
||||||
|
|
||||||
|
for(i = 0; i < 16; i++)
|
||||||
|
snprintf(str + (2*i*sizeof(char)), 33, "%02x", uuid[i]);
|
||||||
|
|
||||||
|
return str;
|
||||||
|
}
|
||||||
|
|
||||||
|
void free_uuidstr(char *str)
|
||||||
|
{
|
||||||
|
free(str);
|
||||||
|
}
|
||||||
@ -0,0 +1,135 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef __DSBUS_DAEMON_H__
|
||||||
|
#define __DSBUS_DAEMON_H__
|
||||||
|
|
||||||
|
#include <dsbus/data.h>
|
||||||
|
|
||||||
|
#define SYS_MSG 0x0f0affee
|
||||||
|
#define USR_MSG 0x0afeeffe
|
||||||
|
#define NIL_MSG 0x0
|
||||||
|
|
||||||
|
#define MAX_QUEUE_SIZE 4096
|
||||||
|
#define MAX_QUEUE_POOL 256
|
||||||
|
|
||||||
|
#define MAX_BACKLOG_CONNECTIONS 8
|
||||||
|
|
||||||
|
#define DSBD_DAEMONIZE (1 << 1)
|
||||||
|
#define DSBD_SYSTEMSHIT (1 << 2)
|
||||||
|
|
||||||
|
#define DSBNL_CMDADDOBJ 0xf
|
||||||
|
#define DSBNL_CMDREMOVEOBJ 0xc
|
||||||
|
#define DSBNL_CMDSETLISTENTRY 0xa
|
||||||
|
#define DSBNL_CMDCLEANLISTENTRY 0xb
|
||||||
|
#define DSBNL_CMDUIDCAPADD 0x5
|
||||||
|
#define DSBNL_CMDUIDCAPREMOVE 0x7
|
||||||
|
#define DSBNL_CMDUIDCAPCHANGE 0x8
|
||||||
|
|
||||||
|
#define DSBACT_READ 1
|
||||||
|
#define DSBACT_WRITE 2
|
||||||
|
#define DSBACT_EXEC 3
|
||||||
|
|
||||||
|
#define DSBMASK_READ (1 << DSBACT_READ)
|
||||||
|
#define DSBMASK_WRITE (1 << DSBACT_WRITE)
|
||||||
|
#define DSBMASK_EXEC (1 << DSBACT_EXEC)
|
||||||
|
#define DSBMASK_SET (1 << 4)
|
||||||
|
|
||||||
|
#define DSBRID_UID 1
|
||||||
|
#define DSBRID_GID 2
|
||||||
|
#define DSBRID_OTHER 0 /* must be always zero */
|
||||||
|
#define DSBRID_MAX 2
|
||||||
|
|
||||||
|
#define DSBNL_UIDRULE DSBRID_UID
|
||||||
|
#define DSBNL_GIDRULE DSBRID_GID
|
||||||
|
#define DSBNL_OTHERRULE DSBRID_OTHER
|
||||||
|
|
||||||
|
struct dsbnl_policy_msg {
|
||||||
|
uint64_t hash;
|
||||||
|
uint32_t flags;
|
||||||
|
uint32_t uid;
|
||||||
|
uint32_t gid;
|
||||||
|
uint32_t cap;
|
||||||
|
uint8_t listno;
|
||||||
|
uint8_t cmd;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct zst_queue_s;
|
||||||
|
|
||||||
|
/* dsbusd context */
|
||||||
|
struct dsbd_ctx {
|
||||||
|
dsb_secstore_t *storage; /* storage */
|
||||||
|
char *config_file; /* from old proposal, not used */
|
||||||
|
char *log_file; /* the same i.e. not actually used */
|
||||||
|
char *unixsck_path; /* path to unix socket */
|
||||||
|
struct zst_queue_s *uqueue; /* job queue */
|
||||||
|
void *priv; /* added to make it more flexible */
|
||||||
|
int flags;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct _payload {
|
||||||
|
int scn;
|
||||||
|
char *pmsg;
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef struct zst_msg_s {
|
||||||
|
void *data; /** < message payload */
|
||||||
|
unsigned int msgtype; /** < message type ID */
|
||||||
|
unsigned int qlength; /** < current queue length (actual on add moment),
|
||||||
|
* it makes no sense with few readers */
|
||||||
|
usrtc_node_t node;
|
||||||
|
} zst_msg_t;
|
||||||
|
|
||||||
|
typedef struct zst_queue_s {
|
||||||
|
unsigned int length;
|
||||||
|
/* sync */
|
||||||
|
pthread_mutex_t mutex;
|
||||||
|
pthread_cond_t cond;
|
||||||
|
/* queue data */
|
||||||
|
usrtc_t qtree;
|
||||||
|
/* cache */
|
||||||
|
usrtc_t msgcache;
|
||||||
|
} zst_queue_t;
|
||||||
|
|
||||||
|
/* This is actually internal API, it placed here just to avoid of one big
|
||||||
|
piece of C code */
|
||||||
|
/* Init job queue */
|
||||||
|
int zst_queue_init(zst_queue_t *queue);
|
||||||
|
|
||||||
|
/* Add message to queue */
|
||||||
|
int zst_queue_add(zst_queue_t *queue, void *data, unsigned int msgtype);
|
||||||
|
|
||||||
|
/* Get a message from jon queue */
|
||||||
|
int zst_queue_get(zst_queue_t *queue, const struct timespec *timeout,
|
||||||
|
zst_msg_t *msg);
|
||||||
|
|
||||||
|
unsigned int zst_queue_length(zst_queue_t *queue);
|
||||||
|
|
||||||
|
int zst_queue_destroy(zst_queue_t *queue, int freedata,
|
||||||
|
void (*free_msg)(void *));
|
||||||
|
|
||||||
|
/* this is a hash function to provide right hash from UUID and inode number */
|
||||||
|
unsigned long djb2_hash(unsigned char *str);
|
||||||
|
|
||||||
|
/* initialize storage backend */
|
||||||
|
int store_initbe(dsb_secstore_t *storage, void *priv);
|
||||||
|
|
||||||
|
/* initialize DSB link for storage */
|
||||||
|
int store_initdac(dsb_secstore_t *storage, void *priv);
|
||||||
|
|
||||||
|
int store_pushbe(dsb_secstore_t *storage, dsb_secinfo_t *info);
|
||||||
|
|
||||||
|
int store_pushdac(dsb_secstore_t *storage, dsb_secinfo_t *info);
|
||||||
|
|
||||||
|
/* convert uuid to string */
|
||||||
|
char *uuid2str(uint8_t uuid[16]);
|
||||||
|
|
||||||
|
/* free converted string from uuid */
|
||||||
|
void free_uuidstr(char *str);
|
||||||
|
|
||||||
|
/* send a message to netlink socket */
|
||||||
|
int netlink_senddsbmsg(dsb_secstore_t *storage, struct dsbnl_policy_msg *dsbmsg);
|
||||||
|
|
||||||
|
#endif /* __DSBUS_DAEMON_H__ */
|
||||||
@ -0,0 +1,87 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef __DSBUS_DATA_H__
|
||||||
|
#define __DSBUS_DATA_H__
|
||||||
|
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <tdata/usrtc.h>
|
||||||
|
|
||||||
|
#define MAX_ACL_LIST_SIZE 32
|
||||||
|
#define __MXRLE MAX_ACL_LIST_SIZE
|
||||||
|
#define MAX_CTRLED_OBJECTS 32768
|
||||||
|
|
||||||
|
#define DSB_AUDIT_EVENTS (1 << 1)
|
||||||
|
#define DSB_CONFIGURED (1 << 2)
|
||||||
|
#define DSB_GARBAGED (1 << 3)
|
||||||
|
#define DSB_DIRTY (1 << 4)
|
||||||
|
|
||||||
|
#define DSBACC_ALLOWHARDLINK (1 << 12)
|
||||||
|
|
||||||
|
typedef struct __object_access_list_entry_type {
|
||||||
|
union {
|
||||||
|
uid_t uid;
|
||||||
|
gid_t gid;
|
||||||
|
};
|
||||||
|
uint8_t mask;
|
||||||
|
} dsb_acl_entry_t;
|
||||||
|
|
||||||
|
typedef struct __object_access_list_type {
|
||||||
|
dsb_acl_entry_t uidlist[__MXRLE];
|
||||||
|
dsb_acl_entry_t gidlist[__MXRLE];
|
||||||
|
uint8_t othmask;
|
||||||
|
} dsb_acl_t;
|
||||||
|
|
||||||
|
typedef struct __object_security_info_type {
|
||||||
|
dsb_acl_t aclist;
|
||||||
|
pthread_mutex_t slock;
|
||||||
|
usrtc_node_t node;
|
||||||
|
uint8_t flags;
|
||||||
|
uint8_t blk_uuid[16]; /* 128bit uuid for a volume stored */
|
||||||
|
uint64_t inode_num; /* inode number */
|
||||||
|
char obj_name[256];
|
||||||
|
uint64_t hash;
|
||||||
|
} dsb_secinfo_t;
|
||||||
|
|
||||||
|
typedef struct __object_security_store_type {
|
||||||
|
usrtc_t curr_data;
|
||||||
|
usrtc_t garbaged_data;
|
||||||
|
pthread_rwlock_t srwlock;
|
||||||
|
int (*store_initbe)(struct __object_security_store_type *, void *);
|
||||||
|
int (*store_initdac)(struct __object_security_store_type *, void *);
|
||||||
|
int (*store_pushbe)(struct __object_security_store_type *, dsb_secinfo_t *);
|
||||||
|
int (*store_pushdac)(struct __object_security_store_type *, dsb_secinfo_t *);
|
||||||
|
void *store_be;
|
||||||
|
void *dac_be;
|
||||||
|
} dsb_secstore_t;
|
||||||
|
|
||||||
|
/* pointers */
|
||||||
|
#define dsb_sectore_setstoreptr(a, b) (a)->store_be = (b)
|
||||||
|
#define dsb_sectore_setdacptr(a, b) (a)->dac_be = (b)
|
||||||
|
#define dsb_sectore_storeptr(a) (a)->store_be
|
||||||
|
#define dsb_sectore_dacptr(a) (a)->dac_be
|
||||||
|
/* functions */
|
||||||
|
#define dsb_sectore_setinitdac(a, b) (a)->store_initdac = (b)
|
||||||
|
#define dsb_sectore_setinitbe(a, b) (a)->store_initbe = (b)
|
||||||
|
#define dsb_sectore_setpushdac(a, b) (a)->store_pushdac = (b)
|
||||||
|
#define dsb_sectore_setpushbe(a, b) (a)->store_pushbe = (b)
|
||||||
|
#define dsb_sectore_pushdac(a, b) (a)->store_pushdac((a), (b))
|
||||||
|
#define dsb_sectore_pushbe(a, b) (a)->store_pushbe((a), (b))
|
||||||
|
|
||||||
|
/* a little bit of API */
|
||||||
|
int dsb_store_allocinit(dsb_secstore_t *storage);
|
||||||
|
int dsb_store_init(dsb_secstore_t *storage, void *beptr, void *dacptr);
|
||||||
|
int dsb_store_flush(dsb_secstore_t *storage);
|
||||||
|
int dsb_store_clean(dsb_secstore_t *storage);
|
||||||
|
int dsb_store_insert(dsb_secstore_t *storage, dsb_secinfo_t *info);
|
||||||
|
int dsb_store_remove(dsb_secstore_t *storage, uint64_t hash);
|
||||||
|
int dsb_store_search(dsb_secstore_t *storage, uint64_t hash, dsb_secinfo_t **info);
|
||||||
|
|
||||||
|
int dsb_store_info_allocinit(dsb_secinfo_t *info);
|
||||||
|
int dsb_store_info_destroy(dsb_secinfo_t *info);
|
||||||
|
|
||||||
|
#endif /* __DSBUS_DATA_H__ */
|
||||||
@ -0,0 +1,16 @@
|
|||||||
|
## AUTOMAKE_OPTIONS = foreign
|
||||||
|
|
||||||
|
AM_CPPFLAGS = \
|
||||||
|
-DPACKAGE_LOCALE_DIR=\""$(localedir)"\" \
|
||||||
|
-DPACKAGE_SRC_DIR=\""$(srcdir)"\" \
|
||||||
|
-DPACKAGE_DATA_DIR=\""$(pkgdatadir)"\" \
|
||||||
|
-DCNFPATH=\""$(prefix)/etc"\" \
|
||||||
|
-I../include
|
||||||
|
|
||||||
|
AM_CFLAGS = -Wall -g
|
||||||
|
|
||||||
|
bin_PROGRAMS = dsbfcntl
|
||||||
|
|
||||||
|
dsbfcntl_SOURCES = fcntl.c
|
||||||
|
dsbfcntl_LDADD = $(LIBTDATA_LIBS) $(LIBSEXPR_LIBS) -lblkid -lpthread
|
||||||
|
|
||||||
@ -0,0 +1,251 @@
|
|||||||
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 2; tab-width: 2 -*- */
|
||||||
|
/*
|
||||||
|
* Originally written by Alexander Vdolainen <avdolainen@gmail.com>
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define _GNU_SOURCE
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <sys/socket.h>
|
||||||
|
#include <sys/un.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <getopt.h>
|
||||||
|
#include <mntent.h>
|
||||||
|
#include <blkid/blkid.h>
|
||||||
|
|
||||||
|
#define TOOLMODE_CMD 1
|
||||||
|
#define TOOLMODE_INFO 2
|
||||||
|
|
||||||
|
static void __print_version(void)
|
||||||
|
{
|
||||||
|
fprintf(stdout, "DSB user space daemon control tool version: 0.1\n\n");
|
||||||
|
fprintf(stdout, "Copyright (c) 2015-2016 Alexander Vdolainen.\nEmail: avdolainen@gmail.com\n\n");
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __print_help(void)
|
||||||
|
{
|
||||||
|
fprintf(stdout, "Usage: dsbfcntl [options]\nOptions:\n");
|
||||||
|
fprintf(stdout, " --file-info(-i)\t Get file information required to set rules.\n");
|
||||||
|
fprintf(stdout, " --control-command(-c) \"<command>\"\t Command to send to the DSB userspace daemon.\n");
|
||||||
|
fprintf(stdout, " --unix-socket-path(-u) <file>\t Use <file> as the unix socket name.\n");
|
||||||
|
fprintf(stdout, " --help(-h)\t Print there help message\n");
|
||||||
|
fprintf(stdout, " --version(-v)\t Print version information\n");
|
||||||
|
fprintf(stdout, "\nFor further information check out provided documentation.\n");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int __print_fileinfo(const char *fpath)
|
||||||
|
{
|
||||||
|
int r = 0;
|
||||||
|
struct stat buf;
|
||||||
|
FILE* fstab = NULL;
|
||||||
|
struct mntent *e;
|
||||||
|
char *devname = NULL;
|
||||||
|
char _fpath[4096];
|
||||||
|
uint64_t inode_num = 0;
|
||||||
|
blkid_probe pr;
|
||||||
|
const char *uuid;
|
||||||
|
|
||||||
|
r = stat(fpath, &buf);
|
||||||
|
if(r) {
|
||||||
|
fprintf(stderr, "FAILED: %s\n", strerror(r));
|
||||||
|
return r;
|
||||||
|
} else inode_num = buf.st_ino; /* get inode number */
|
||||||
|
|
||||||
|
/* ok now we need to get full path if required */
|
||||||
|
if(*fpath != '/') {
|
||||||
|
snprintf(_fpath, 4096, "%s/%s", get_current_dir_name(), fpath);
|
||||||
|
} else strcpy(_fpath, fpath);
|
||||||
|
|
||||||
|
fprintf(stdout, "Full pathname: %s\n", _fpath);
|
||||||
|
|
||||||
|
fstab = setmntent("/etc/mtab", "r");
|
||||||
|
|
||||||
|
/* e->mnt_dir is our hitler, mnt_fsname is a device */
|
||||||
|
while ((e = getmntent(fstab))) {
|
||||||
|
if(strlen(_fpath) < strlen(e->mnt_dir)) {
|
||||||
|
continue; /* not so interesting */
|
||||||
|
} else if(!strncmp(_fpath, e->mnt_dir, strlen(e->mnt_dir))) {
|
||||||
|
devname = strdup(e->mnt_fsname);
|
||||||
|
if(!devname) { r = ENOMEM; goto __fini; }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fprintf(stdout, "Root device of the file is: %s\n", devname);
|
||||||
|
fprintf(stdout, "File object inode number is: %lu\n", inode_num);
|
||||||
|
|
||||||
|
pr = blkid_new_probe_from_filename(devname);
|
||||||
|
if(!pr) {
|
||||||
|
r = EINVAL;
|
||||||
|
fprintf(stderr, "FAILED: %s\n", strerror(r)); goto __fini;
|
||||||
|
}
|
||||||
|
|
||||||
|
blkid_do_probe(pr);
|
||||||
|
blkid_probe_lookup_value(pr, "UUID", &uuid, NULL);
|
||||||
|
|
||||||
|
fprintf(stdout, "Root device UUID=%s\n", uuid);
|
||||||
|
|
||||||
|
blkid_free_probe(pr);
|
||||||
|
|
||||||
|
__fini:
|
||||||
|
endmntent(fstab);
|
||||||
|
if(devname) free(devname);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int __execute_cmd(const char *unxsckpath, const char *ctrlcmd)
|
||||||
|
{
|
||||||
|
int r = 0, c, s, len;
|
||||||
|
char *buf = malloc(4096);
|
||||||
|
struct sockaddr_un remote;
|
||||||
|
|
||||||
|
if(!buf) return ENOMEM;
|
||||||
|
|
||||||
|
if ((s = socket(AF_UNIX, SOCK_STREAM, 0)) == -1) {
|
||||||
|
r = errno;
|
||||||
|
goto __fini0;
|
||||||
|
}
|
||||||
|
|
||||||
|
remote.sun_family = AF_UNIX;
|
||||||
|
strcpy(remote.sun_path, unxsckpath);
|
||||||
|
len = strlen(remote.sun_path) + sizeof(remote.sun_family);
|
||||||
|
if (connect(s, (struct sockaddr *)&remote, len) == -1) {
|
||||||
|
r = errno;
|
||||||
|
goto __fini;
|
||||||
|
}
|
||||||
|
|
||||||
|
if(send(s, ctrlcmd, strlen(ctrlcmd), 0) == -1) {
|
||||||
|
r = errno;
|
||||||
|
goto __fini;
|
||||||
|
}
|
||||||
|
|
||||||
|
while((c = recv(s, buf, 4096, 0)) != 0) {
|
||||||
|
if(c < 0) {
|
||||||
|
r = errno;
|
||||||
|
goto __fini;
|
||||||
|
}
|
||||||
|
fprintf(stdout, "%s", buf);
|
||||||
|
}
|
||||||
|
|
||||||
|
__fini:
|
||||||
|
close(s);
|
||||||
|
__fini0:
|
||||||
|
free(buf);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
int toolmode = 0, c, r = 0;
|
||||||
|
char *unxsckpath = NULL;
|
||||||
|
char *ctrlcmd = NULL;
|
||||||
|
char *fpath = NULL;
|
||||||
|
|
||||||
|
while(1) {
|
||||||
|
static struct option long_options[] = {
|
||||||
|
/* These options a generic ones. */
|
||||||
|
{"help", no_argument, NULL, 'h'}, /* print out help and version info */
|
||||||
|
{"version", no_argument, NULL, 'v'}, /* just out a version info */
|
||||||
|
/* The following options about system. */
|
||||||
|
{"control-command", required_argument, NULL, 'c'},
|
||||||
|
{"unix-socket-path", required_argument, NULL, 'u'},
|
||||||
|
{"file-info", required_argument, NULL, 'i'},
|
||||||
|
{NULL, 0, NULL, 0},
|
||||||
|
};
|
||||||
|
/* getopt_long stores the option index here. */
|
||||||
|
int option_index = 0;
|
||||||
|
if((c = getopt_long(argc, argv, "hvc:u:i:", long_options,
|
||||||
|
&option_index)) == -1) break;
|
||||||
|
|
||||||
|
switch (c) {
|
||||||
|
case 'h':
|
||||||
|
__print_help();
|
||||||
|
return 0;
|
||||||
|
break;
|
||||||
|
case 'v':
|
||||||
|
__print_version();
|
||||||
|
return 0;
|
||||||
|
break;
|
||||||
|
case 'c':
|
||||||
|
if(!toolmode || toolmode == TOOLMODE_CMD) toolmode = TOOLMODE_CMD;
|
||||||
|
else {
|
||||||
|
fprintf(stderr, "Illegal mode given.\n");
|
||||||
|
r = -EINVAL;
|
||||||
|
goto __fails;
|
||||||
|
}
|
||||||
|
if(!(ctrlcmd = strdup(optarg))) { r = -ENOMEM; goto __fails; }
|
||||||
|
break;
|
||||||
|
case 'u':
|
||||||
|
if(!toolmode || toolmode == TOOLMODE_CMD) toolmode = TOOLMODE_CMD;
|
||||||
|
else {
|
||||||
|
fprintf(stderr, "Illegal mode given.\n");
|
||||||
|
r = -EINVAL;
|
||||||
|
goto __fails;
|
||||||
|
}
|
||||||
|
if(!(unxsckpath = strdup(optarg))) { r = -ENOMEM; goto __fails; }
|
||||||
|
break;
|
||||||
|
case 'i':
|
||||||
|
if(!toolmode || toolmode == TOOLMODE_INFO) toolmode = TOOLMODE_INFO;
|
||||||
|
else {
|
||||||
|
fprintf(stderr, "Illegal mode given.\n");
|
||||||
|
r = -EINVAL;
|
||||||
|
goto __fails;
|
||||||
|
}
|
||||||
|
if(!(fpath = strdup(optarg))) { r = -ENOMEM; goto __fails; }
|
||||||
|
break;
|
||||||
|
case '?':
|
||||||
|
/* getopt_long already printed an error message. */
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
abort();
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/* run it */
|
||||||
|
switch(toolmode) {
|
||||||
|
case TOOLMODE_CMD:
|
||||||
|
if(!unxsckpath) {
|
||||||
|
fprintf(stderr, "FAILED: Unix socket path doesn't pointed.\n");
|
||||||
|
goto __einval;
|
||||||
|
}
|
||||||
|
if(!ctrlcmd) {
|
||||||
|
fprintf(stderr, "FAILED: Command is absent.\n");
|
||||||
|
goto __einval;
|
||||||
|
}
|
||||||
|
r = __execute_cmd(unxsckpath, ctrlcmd);
|
||||||
|
break;
|
||||||
|
case TOOLMODE_INFO:
|
||||||
|
if(!fpath) {
|
||||||
|
fprintf(stderr, "FAILED: No input filename(s).\n");
|
||||||
|
goto __einval;
|
||||||
|
}
|
||||||
|
r = __print_fileinfo(fpath);
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
fprintf(stderr, "FAILED: Incorrect options given.\n");
|
||||||
|
__einval:
|
||||||
|
__print_version();
|
||||||
|
__print_help();
|
||||||
|
|
||||||
|
return -EINVAL;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
__fails:
|
||||||
|
if(unxsckpath) free(unxsckpath);
|
||||||
|
if(ctrlcmd) free(ctrlcmd);
|
||||||
|
if(fpath) free(fpath);
|
||||||
|
|
||||||
|
return r;
|
||||||
|
}
|
||||||
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue