uid_wrapper-1.2.1/.clang_complete 000644 001750 000144 00000000006 12247650254 016774 0 ustar 00asn users 000000 000000 -Isrc
uid_wrapper-1.2.1/COPYING 000644 001750 000144 00000104513 12247650254 015062 0 ustar 00asn users 000000 000000 GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
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.
Copyright (C)
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 .
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:
Copyright (C)
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
.
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
.
uid_wrapper-1.2.1/DefineOptions.cmake 000644 001750 000144 00000000061 12247650254 017570 0 ustar 00asn users 000000 000000 option(UNIT_TESTING "Build with unit tests" OFF)
uid_wrapper-1.2.1/cmake/ 000755 001750 000144 00000000000 12672263025 015101 5 ustar 00asn users 000000 000000 uid_wrapper-1.2.1/cmake/Modules/ 000755 001750 000144 00000000000 12672263025 016511 5 ustar 00asn users 000000 000000 uid_wrapper-1.2.1/cmake/Modules/AddCMockaTest.cmake 000644 001750 000144 00000002373 12247650254 022130 0 ustar 00asn users 000000 000000 # - ADD_CHECK_TEST(test_name test_source linklib1 ... linklibN)
# Copyright (c) 2007 Daniel Gollub
# Copyright (c) 2007-2010 Andreas Schneider
#
# Redistribution and use is allowed according to the terms of the BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
enable_testing()
include(CTest)
if(CMAKE_COMPILER_IS_GNUCC AND NOT MINGW)
set(CMAKE_C_FLAGS_PROFILING "-g -O0 -Wall -W -Wshadow -Wunused-variable -Wunused-parameter -Wunused-function -Wunused -Wno-system-headers -Wwrite-strings -fprofile-arcs -ftest-coverage" CACHE STRING "Profiling Compiler Flags")
set(CMAKE_SHARED_LINKER_FLAGS_PROFILING " -fprofile-arcs -ftest-coverage" CACHE STRING "Profiling Linker Flags")
set(CMAKE_MODULE_LINKER_FLAGS_PROFILING " -fprofile-arcs -ftest-coverage" CACHE STRING "Profiling Linker Flags")
set(CMAKE_EXEC_LINKER_FLAGS_PROFILING " -fprofile-arcs -ftest-coverage" CACHE STRING "Profiling Linker Flags")
endif(CMAKE_COMPILER_IS_GNUCC AND NOT MINGW)
function (ADD_CMOCKA_TEST _testName _testSource)
add_executable(${_testName} ${_testSource})
target_link_libraries(${_testName} ${ARGN})
add_test(${_testName} ${CMAKE_CURRENT_BINARY_DIR}/${_testName})
endfunction (ADD_CMOCKA_TEST)
uid_wrapper-1.2.1/cmake/Modules/COPYING-CMAKE-SCRIPTS 000644 001750 000144 00000002457 12247650254 021521 0 ustar 00asn users 000000 000000 Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
uid_wrapper-1.2.1/cmake/Modules/CheckCCompilerFlagSSP.cmake 000644 001750 000144 00000001755 12247646107 023522 0 ustar 00asn users 000000 000000 # - Check whether the C compiler supports a given flag in the
# context of a stack checking compiler option.
# CHECK_C_COMPILER_FLAG_SSP(FLAG VARIABLE)
#
# FLAG - the compiler flag
# VARIABLE - variable to store the result
#
# This actually calls check_c_source_compiles.
# See help for CheckCSourceCompiles for a listing of variables
# that can modify the build.
# Copyright (c) 2006, Alexander Neundorf,
#
# Redistribution and use is allowed according to the terms of the BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
include(CheckCSourceCompiles)
function(CHECK_C_COMPILER_FLAG_SSP _FLAG _RESULT)
set(SAFE_CMAKE_REQUIRED_DEFINITIONS "${CMAKE_REQUIRED_DEFINITIONS}")
set(CMAKE_REQUIRED_DEFINITIONS "${_FLAG}")
check_c_source_compiles("int main(int argc, char **argv) { char buffer[256]; return buffer[argc]=0;}" ${_RESULT})
set(CMAKE_REQUIRED_DEFINITIONS "${SAFE_CMAKE_REQUIRED_DEFINITIONS}")
endfunction(CHECK_C_COMPILER_FLAG_SSP)
uid_wrapper-1.2.1/cmake/Modules/DefinePlatformDefaults.cmake 000644 001750 000144 00000001460 12247650254 024105 0 ustar 00asn users 000000 000000 # Set system vars
if (CMAKE_SYSTEM_NAME MATCHES "Linux")
set(LINUX TRUE)
endif(CMAKE_SYSTEM_NAME MATCHES "Linux")
if (CMAKE_SYSTEM_NAME MATCHES "FreeBSD")
set(FREEBSD TRUE)
set(BSD TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "FreeBSD")
if (CMAKE_SYSTEM_NAME MATCHES "OpenBSD")
set(OPENBSD TRUE)
set(BSD TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "OpenBSD")
if (CMAKE_SYSTEM_NAME MATCHES "NetBSD")
set(NETBSD TRUE)
set(BSD TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "NetBSD")
if (CMAKE_SYSTEM_NAME MATCHES "(Solaris|SunOS)")
set(SOLARIS TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "(Solaris|SunOS)")
if (CMAKE_SYSTEM_NAME MATCHES "OS2")
set(OS2 TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "OS2")
if (CMAKE_SYSTEM_NAME MATCHES "Darwin")
set(OSX TRUE)
endif (CMAKE_SYSTEM_NAME MATCHES "Darwin")
uid_wrapper-1.2.1/cmake/Modules/FindCMocka.cmake 000644 001750 000144 00000002726 12247650254 021462 0 ustar 00asn users 000000 000000 # - Try to find CMocka
# Once done this will define
#
# CMOCKA_ROOT_DIR - Set this variable to the root installation of CMocka
#
# Read-Only variables:
# CMOCKA_FOUND - system has CMocka
# CMOCKA_INCLUDE_DIR - the CMocka include directory
# CMOCKA_LIBRARIES - Link these to use CMocka
# CMOCKA_DEFINITIONS - Compiler switches required for using CMocka
#
#=============================================================================
# Copyright (c) 2011-2012 Andreas Schneider
#
# Distributed under the OSI-approved BSD License (the "License");
# see accompanying file Copyright.txt for details.
#
# This software is distributed WITHOUT ANY WARRANTY; without even the
# implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
# See the License for more information.
#=============================================================================
#
find_path(CMOCKA_INCLUDE_DIR
NAMES
cmocka.h
PATHS
${CMOCKA_ROOT_DIR}/include
)
find_library(CMOCKA_LIBRARY
NAMES
cmocka
PATHS
${CMOCKA_ROOT_DIR}/include
)
if (CMOCKA_LIBRARY)
set(CMOCKA_LIBRARIES
${CMOCKA_LIBRARIES}
${CMOCKA_LIBRARY}
)
endif (CMOCKA_LIBRARY)
include(FindPackageHandleStandardArgs)
find_package_handle_standard_args(CMocka DEFAULT_MSG CMOCKA_LIBRARIES CMOCKA_INCLUDE_DIR)
# show the CMOCKA_INCLUDE_DIR and CMOCKA_LIBRARIES variables only in the advanced view
mark_as_advanced(CMOCKA_INCLUDE_DIR CMOCKA_LIBRARIES)
uid_wrapper-1.2.1/cmake/Modules/MacroEnsureOutOfSourceBuild.cmake 000644 001750 000144 00000001227 12247650254 025060 0 ustar 00asn users 000000 000000 # - MACRO_ENSURE_OUT_OF_SOURCE_BUILD()
# MACRO_ENSURE_OUT_OF_SOURCE_BUILD()
# Copyright (c) 2006, Alexander Neundorf,
#
# Redistribution and use is allowed according to the terms of the BSD license.
# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
macro (MACRO_ENSURE_OUT_OF_SOURCE_BUILD _errorMessage)
string(COMPARE EQUAL "${CMAKE_SOURCE_DIR}" "${CMAKE_BINARY_DIR}" _insource)
if (_insource)
message(SEND_ERROR "${_errorMessage}")
message(FATAL_ERROR "Remove the file CMakeCache.txt in ${CMAKE_SOURCE_DIR} first.")
endif (_insource)
endmacro (MACRO_ENSURE_OUT_OF_SOURCE_BUILD)
uid_wrapper-1.2.1/cmake/Modules/DefineInstallationPaths.cmake 000644 001750 000144 00000007343 12267205751 024300 0 ustar 00asn users 000000 000000 if (UNIX OR OS2)
IF (NOT APPLICATION_NAME)
MESSAGE(STATUS "${PROJECT_NAME} is used as APPLICATION_NAME")
SET(APPLICATION_NAME ${PROJECT_NAME})
ENDIF (NOT APPLICATION_NAME)
# Suffix for Linux
SET(LIB_SUFFIX
CACHE STRING "Define suffix of directory name (32/64)"
)
SET(EXEC_INSTALL_PREFIX
"${CMAKE_INSTALL_PREFIX}"
CACHE PATH "Base directory for executables and libraries"
)
SET(SHARE_INSTALL_PREFIX
"${CMAKE_INSTALL_PREFIX}/share"
CACHE PATH "Base directory for files which go to share/"
)
SET(DATA_INSTALL_PREFIX
"${SHARE_INSTALL_PREFIX}/${APPLICATION_NAME}"
CACHE PATH "The parent directory where applications can install their data")
# The following are directories where stuff will be installed to
SET(BIN_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/bin"
CACHE PATH "The ${APPLICATION_NAME} binary install dir (default prefix/bin)"
)
SET(SBIN_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/sbin"
CACHE PATH "The ${APPLICATION_NAME} sbin install dir (default prefix/sbin)"
)
SET(LIB_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/lib${LIB_SUFFIX}"
CACHE PATH "The subdirectory relative to the install prefix where libraries will be installed (default is prefix/lib)"
)
SET(LIBEXEC_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/libexec"
CACHE PATH "The subdirectory relative to the install prefix where libraries will be installed (default is prefix/libexec)"
)
SET(PLUGIN_INSTALL_DIR
"${LIB_INSTALL_DIR}/${APPLICATION_NAME}"
CACHE PATH "The subdirectory relative to the install prefix where plugins will be installed (default is prefix/lib/${APPLICATION_NAME})"
)
SET(INCLUDE_INSTALL_DIR
"${CMAKE_INSTALL_PREFIX}/include"
CACHE PATH "The subdirectory to the header prefix (default prefix/include)"
)
set(CMAKE_INSTALL_DIR
"${LIB_INSTALL_DIR}/cmake"
CACHE PATH "The subdirectory to install cmake config files")
SET(DATA_INSTALL_DIR
"${DATA_INSTALL_PREFIX}"
CACHE PATH "The parent directory where applications can install their data (default prefix/share/${APPLICATION_NAME})"
)
SET(HTML_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/doc/HTML"
CACHE PATH "The HTML install dir for documentation (default data/doc/html)"
)
SET(ICON_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/icons"
CACHE PATH "The icon install dir (default data/icons/)"
)
SET(SOUND_INSTALL_DIR
"${DATA_INSTALL_PREFIX}/sounds"
CACHE PATH "The install dir for sound files (default data/sounds)"
)
SET(LOCALE_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/locale"
CACHE PATH "The install dir for translations (default prefix/share/locale)"
)
SET(XDG_APPS_DIR
"${SHARE_INSTALL_PREFIX}/applications/"
CACHE PATH "The XDG apps dir"
)
SET(XDG_DIRECTORY_DIR
"${SHARE_INSTALL_PREFIX}/desktop-directories"
CACHE PATH "The XDG directory"
)
SET(SYSCONF_INSTALL_DIR
"${EXEC_INSTALL_PREFIX}/etc"
CACHE PATH "The ${APPLICATION_NAME} sysconfig install dir (default prefix/etc)"
)
SET(MAN_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/man"
CACHE PATH "The ${APPLICATION_NAME} man install dir (default prefix/man)"
)
SET(INFO_INSTALL_DIR
"${SHARE_INSTALL_PREFIX}/info"
CACHE PATH "The ${APPLICATION_NAME} info install dir (default prefix/info)"
)
else()
# Same same
set(BIN_INSTALL_DIR "bin" CACHE PATH "-")
set(SBIN_INSTALL_DIR "sbin" CACHE PATH "-")
set(LIB_INSTALL_DIR "lib${LIB_SUFFIX}" CACHE PATH "-")
set(INCLUDE_INSTALL_DIR "include" CACHE PATH "-")
set(CMAKE_INSTALL_DIR "CMake" CACHE PATH "-")
set(PLUGIN_INSTALL_DIR "plugins" CACHE PATH "-")
set(HTML_INSTALL_DIR "doc/HTML" CACHE PATH "-")
set(ICON_INSTALL_DIR "icons" CACHE PATH "-")
set(SOUND_INSTALL_DIR "soudns" CACHE PATH "-")
set(LOCALE_INSTALL_DIR "lang" CACHE PATH "-")
endif ()
uid_wrapper-1.2.1/cmake/Modules/DefineCMakeDefaults.cmake 000644 001750 000144 00000001741 12366374566 023316 0 ustar 00asn users 000000 000000 # Always include srcdir and builddir in include path
# This saves typing ${CMAKE_CURRENT_SOURCE_DIR} ${CMAKE_CURRENT_BINARY} in
# about every subdir
# since cmake 2.4.0
set(CMAKE_INCLUDE_CURRENT_DIR ON)
# Put the include dirs which are in the source or build tree
# before all other include dirs, so the headers in the sources
# are prefered over the already installed ones
# since cmake 2.4.1
set(CMAKE_INCLUDE_DIRECTORIES_PROJECT_BEFORE ON)
# Use colored output
# since cmake 2.4.0
set(CMAKE_COLOR_MAKEFILE ON)
# Define the generic version of the libraries here
set(GENERIC_LIB_VERSION "0.1.0")
set(GENERIC_LIB_SOVERSION "0")
# Set the default build type to release with debug info
if (NOT CMAKE_BUILD_TYPE)
set(CMAKE_BUILD_TYPE RelWithDebInfo
CACHE STRING
"Choose the type of build, options are: None Debug Release RelWithDebInfo MinSizeRel."
)
endif (NOT CMAKE_BUILD_TYPE)
# Create the compile command database for clang by default
set(CMAKE_EXPORT_COMPILE_COMMANDS ON)
uid_wrapper-1.2.1/cmake/Modules/DefineCompilerFlags.cmake 000644 001750 000144 00000005615 12565564712 023374 0 ustar 00asn users 000000 000000 # define system dependent compiler flags
include(CheckCCompilerFlag)
include(CheckCCompilerFlagSSP)
if (UNIX AND NOT WIN32)
#
# Define GNUCC compiler flags
#
if (${CMAKE_C_COMPILER_ID} MATCHES "(GNU|Clang)")
# add -Wconversion ?
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -std=gnu99 -pedantic -pedantic-errors")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Wall -Wextra -Wshadow -Wmissing-prototypes -Wdeclaration-after-statement")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Wunused -Wfloat-equal -Wpointer-arith -Wwrite-strings -Wformat-security")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Wmissing-format-attribute")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -fstrict-aliasing -Wstrict-aliasing=2")
# with -fPIC
check_c_compiler_flag("-fPIC" WITH_FPIC)
if (WITH_FPIC)
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -fPIC")
endif (WITH_FPIC)
check_c_compiler_flag_ssp("-fstack-protector" WITH_STACK_PROTECTOR)
if (WITH_STACK_PROTECTOR)
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -fstack-protector")
endif (WITH_STACK_PROTECTOR)
if (CMAKE_BUILD_TYPE)
string(TOLOWER "${CMAKE_BUILD_TYPE}" CMAKE_BUILD_TYPE_LOWER)
if (CMAKE_BUILD_TYPE_LOWER MATCHES (release|relwithdebinfo|minsizerel))
check_c_compiler_flag("-Wp,-D_FORTIFY_SOURCE=2" WITH_FORTIFY_SOURCE)
if (WITH_FORTIFY_SOURCE)
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -Wp,-D_FORTIFY_SOURCE=2")
endif (WITH_FORTIFY_SOURCE)
endif()
endif()
endif (${CMAKE_C_COMPILER_ID} MATCHES "(GNU|Clang)")
#
# Check for large filesystem support
#
if (CMAKE_SIZEOF_VOID_P MATCHES "8")
# with large file support
execute_process(
COMMAND
getconf LFS64_CFLAGS
OUTPUT_VARIABLE
_lfs_CFLAGS
ERROR_QUIET
OUTPUT_STRIP_TRAILING_WHITESPACE
)
else (CMAKE_SIZEOF_VOID_P MATCHES "8")
# with large file support
execute_process(
COMMAND
getconf LFS_CFLAGS
OUTPUT_VARIABLE
_lfs_CFLAGS
ERROR_QUIET
OUTPUT_STRIP_TRAILING_WHITESPACE
)
endif (CMAKE_SIZEOF_VOID_P MATCHES "8")
if (_lfs_CFLAGS)
string(REGEX REPLACE "[\r\n]" " " "${_lfs_CFLAGS}" "${${_lfs_CFLAGS}}")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${_lfs_CFLAGS}")
endif (_lfs_CFLAGS)
endif (UNIX AND NOT WIN32)
if (MSVC)
# Use secure functions by defaualt and suppress warnings about
#"deprecated" functions
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} /D _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES=1")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} /D _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES_COUNT=1")
set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} /D _CRT_NONSTDC_NO_WARNINGS=1 /D _CRT_SECURE_NO_WARNINGS=1")
endif (MSVC)
uid_wrapper-1.2.1/src/ 000755 001750 000144 00000000000 12672263025 014610 5 ustar 00asn users 000000 000000 uid_wrapper-1.2.1/src/CMakeLists.txt 000644 001750 000144 00000001312 12620657046 017350 0 ustar 00asn users 000000 000000 project(libuid_wrapper C)
include_directories(${CMAKE_BINARY_DIR})
add_library(uid_wrapper SHARED uid_wrapper.c)
target_link_libraries(uid_wrapper ${UIDWRAP_REQUIRED_LIBRARIES} ${CMAKE_THREAD_LIBS_INIT})
set_target_properties(
uid_wrapper
PROPERTIES
VERSION
${LIBRARY_VERSION}
SOVERSION
${LIBRARY_SOVERSION}
)
install(
TARGETS
uid_wrapper
RUNTIME DESTINATION ${BIN_INSTALL_DIR}
LIBRARY DESTINATION ${LIB_INSTALL_DIR}
ARCHIVE DESTINATION ${LIB_INSTALL_DIR}
)
# This needs to be at the end
if (POLICY CMP0026)
cmake_policy(SET CMP0026 OLD)
endif()
get_target_property(UWRAP_LOCATION uid_wrapper LOCATION)
set(UID_WRAPPER_LOCATION ${UWRAP_LOCATION} PARENT_SCOPE)
uid_wrapper-1.2.1/src/uid_wrapper.c 000644 001750 000144 00000121455 12661116221 017276 0 ustar 00asn users 000000 000000 /*
* Copyright (c) 2009 Andrew Tridgell
* Copyright (c) 2011-2013 Andreas Schneider
*
* 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 .
*/
#include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#include
#include
#ifdef HAVE_GCC_THREAD_LOCAL_STORAGE
# define UWRAP_THREAD __thread
#else
# define UWRAP_THREAD
#endif
# define UWRAP_LOCK(m) do { \
pthread_mutex_lock(&( m ## _mutex)); \
} while(0)
# define UWRAP_UNLOCK(m) do { \
pthread_mutex_unlock(&( m ## _mutex)); \
} while(0)
/* Add new global locks here please */
# define UWRAP_LOCK_ALL \
UWRAP_LOCK(uwrap_id); \
UWRAP_LOCK(libc_symbol_binding); \
UWRAP_LOCK(libpthread_symbol_binding)
# define UWRAP_UNLOCK_ALL \
UWRAP_UNLOCK(libpthread_symbol_binding); \
UWRAP_UNLOCK(libc_symbol_binding); \
UWRAP_UNLOCK(uwrap_id)
#ifdef HAVE_CONSTRUCTOR_ATTRIBUTE
#define CONSTRUCTOR_ATTRIBUTE __attribute__ ((constructor))
#else
#define CONSTRUCTOR_ATTRIBUTE
#endif /* HAVE_CONSTRUCTOR_ATTRIBUTE */
#ifdef HAVE_DESTRUCTOR_ATTRIBUTE
#define DESTRUCTOR_ATTRIBUTE __attribute__ ((destructor))
#else
#define DESTRUCTOR_ATTRIBUTE
#endif /* HAVE_DESTRUCTOR_ATTRIBUTE */
#ifdef HAVE_ADDRESS_SANITIZER_ATTRIBUTE
#define DO_NOT_SANITIZE_ADDRESS_ATTRIBUTE __attribute__((no_sanitize_address))
#else /* DO_NOT_SANITIZE_ADDRESS_ATTRIBUTE */
#define DO_NOT_SANITIZE_ADDRESS_ATTRIBUTE
#endif /* DO_NOT_SANITIZE_ADDRESS_ATTRIBUTE */
/* GCC have printf type attribute check. */
#ifdef HAVE_FUNCTION_ATTRIBUTE_FORMAT
#define PRINTF_ATTRIBUTE(a,b) __attribute__ ((__format__ (__printf__, a, b)))
#else
#define PRINTF_ATTRIBUTE(a,b)
#endif /* HAVE_FUNCTION_ATTRIBUTE_FORMAT */
#define UWRAP_DLIST_ADD(list,item) do { \
if (!(list)) { \
(item)->prev = NULL; \
(item)->next = NULL; \
(list) = (item); \
} else { \
(item)->prev = NULL; \
(item)->next = (list); \
(list)->prev = (item); \
(list) = (item); \
} \
} while (0)
#define UWRAP_DLIST_REMOVE(list,item) do { \
if ((list) == (item)) { \
(list) = (item)->next; \
if (list) { \
(list)->prev = NULL; \
} \
} else { \
if ((item)->prev) { \
(item)->prev->next = (item)->next; \
} \
if ((item)->next) { \
(item)->next->prev = (item)->prev; \
} \
} \
(item)->prev = NULL; \
(item)->next = NULL; \
} while (0)
#ifndef SAFE_FREE
#define SAFE_FREE(x) do { if ((x) != NULL) {free(x); (x)=NULL;} } while(0)
#endif
/*****************
* LOGGING
*****************/
enum uwrap_dbglvl_e {
UWRAP_LOG_ERROR = 0,
UWRAP_LOG_WARN,
UWRAP_LOG_DEBUG,
UWRAP_LOG_TRACE
};
#ifdef NDEBUG
# define UWRAP_LOG(...)
#else /* NDEBUG */
static void uwrap_log(enum uwrap_dbglvl_e dbglvl, const char *function, const char *format, ...) PRINTF_ATTRIBUTE(3, 4);
# define UWRAP_LOG(dbglvl, ...) uwrap_log((dbglvl), __func__, __VA_ARGS__)
static void uwrap_log(enum uwrap_dbglvl_e dbglvl, const char *function, const char *format, ...)
{
char buffer[1024];
va_list va;
const char *d;
unsigned int lvl = 0;
d = getenv("UID_WRAPPER_DEBUGLEVEL");
if (d != NULL) {
lvl = atoi(d);
}
va_start(va, format);
vsnprintf(buffer, sizeof(buffer), format, va);
va_end(va);
if (lvl >= dbglvl) {
const char *prefix = "UWRAP";
switch (dbglvl) {
case UWRAP_LOG_ERROR:
prefix = "UWRAP_ERROR";
break;
case UWRAP_LOG_WARN:
prefix = "UWRAP_WARN";
break;
case UWRAP_LOG_DEBUG:
prefix = "UWRAP_DEBUG";
break;
case UWRAP_LOG_TRACE:
prefix = "UWRAP_TRACE";
break;
}
fprintf(stderr,
"%s(%d) - %s: %s\n",
prefix,
(int)getpid(),
function,
buffer);
}
}
#endif /* NDEBUG */
/*****************
* LIBC
*****************/
#define LIBC_NAME "libc.so"
typedef int (*__libc_setuid)(uid_t uid);
typedef uid_t (*__libc_getuid)(void);
#ifdef HAVE_SETEUID
typedef int (*__libc_seteuid)(uid_t euid);
#endif
#ifdef HAVE_SETREUID
typedef int (*__libc_setreuid)(uid_t ruid, uid_t euid);
#endif
#ifdef HAVE_SETRESUID
typedef int (*__libc_setresuid)(uid_t ruid, uid_t euid, uid_t suid);
#endif
#ifdef HAVE_GETRESUID
typedef int (*__libc_getresuid)(uid_t *ruid, uid_t *euid, uid_t *suid);
#endif
typedef uid_t (*__libc_geteuid)(void);
typedef int (*__libc_setgid)(gid_t gid);
typedef gid_t (*__libc_getgid)(void);
#ifdef HAVE_SETEGID
typedef int (*__libc_setegid)(uid_t egid);
#endif
#ifdef HAVE_SETREGID
typedef int (*__libc_setregid)(uid_t rgid, uid_t egid);
#endif
#ifdef HAVE_SETRESGID
typedef int (*__libc_setresgid)(uid_t rgid, uid_t egid, uid_t sgid);
#endif
#ifdef HAVE_GETRESGID
typedef int (*__libc_getresgid)(gid_t *rgid, gid_t *egid, gid_t *sgid);
#endif
typedef gid_t (*__libc_getegid)(void);
typedef int (*__libc_getgroups)(int size, gid_t list[]);
typedef int (*__libc_setgroups)(size_t size, const gid_t *list);
#ifdef HAVE_SYSCALL
typedef long int (*__libc_syscall)(long int sysno, ...);
#endif
#define UWRAP_SYMBOL_ENTRY(i) \
union { \
__libc_##i f; \
void *obj; \
} _libc_##i
struct uwrap_libc_symbols {
UWRAP_SYMBOL_ENTRY(setuid);
UWRAP_SYMBOL_ENTRY(getuid);
#ifdef HAVE_SETEUID
UWRAP_SYMBOL_ENTRY(seteuid);
#endif
#ifdef HAVE_SETREUID
UWRAP_SYMBOL_ENTRY(setreuid);
#endif
#ifdef HAVE_SETRESUID
UWRAP_SYMBOL_ENTRY(setresuid);
#endif
#ifdef HAVE_GETRESUID
UWRAP_SYMBOL_ENTRY(getresuid);
#endif
UWRAP_SYMBOL_ENTRY(geteuid);
UWRAP_SYMBOL_ENTRY(setgid);
UWRAP_SYMBOL_ENTRY(getgid);
#ifdef HAVE_SETEGID
UWRAP_SYMBOL_ENTRY(setegid);
#endif
#ifdef HAVE_SETREGID
UWRAP_SYMBOL_ENTRY(setregid);
#endif
#ifdef HAVE_SETRESGID
UWRAP_SYMBOL_ENTRY(setresgid);
#endif
#ifdef HAVE_GETRESGID
UWRAP_SYMBOL_ENTRY(getresgid);
#endif
UWRAP_SYMBOL_ENTRY(getegid);
UWRAP_SYMBOL_ENTRY(getgroups);
UWRAP_SYMBOL_ENTRY(setgroups);
#ifdef HAVE_SYSCALL
UWRAP_SYMBOL_ENTRY(syscall);
#endif
};
#undef UWRAP_SYMBOL_ENTRY
/*****************
* LIBPTHREAD
*****************/
/* Yeah... I'm pig. I overloading macro here... So what? */
#define UWRAP_SYMBOL_ENTRY(i) \
union { \
__libpthread_##i f; \
void *obj; \
} _libpthread_##i
typedef int (*__libpthread_pthread_create)(pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine) (void *),
void *arg);
typedef void (*__libpthread_pthread_exit)(void *retval);
struct uwrap_libpthread_symbols {
UWRAP_SYMBOL_ENTRY(pthread_create);
UWRAP_SYMBOL_ENTRY(pthread_exit);
};
#undef UWRAP_SYMBOL_ENTRY
/*
* We keep the virtualised euid/egid/groups information here
*/
struct uwrap_thread {
bool enabled;
uid_t ruid;
uid_t euid;
uid_t suid;
gid_t rgid;
gid_t egid;
gid_t sgid;
int ngroups;
gid_t *groups;
struct uwrap_thread *next;
struct uwrap_thread *prev;
};
struct uwrap {
struct {
void *handle;
struct uwrap_libc_symbols symbols;
} libc;
struct {
void *handle;
struct uwrap_libpthread_symbols symbols;
} libpthread;
bool initialised;
/* Real uid and gid of user who run uid wrapper */
uid_t myuid;
gid_t mygid;
struct uwrap_thread *ids;
};
static struct uwrap uwrap;
/* Shortcut to the list item */
static UWRAP_THREAD struct uwrap_thread *uwrap_tls_id;
/* The mutex or accessing the id */
static pthread_mutex_t uwrap_id_mutex = PTHREAD_MUTEX_INITIALIZER;
/* The mutex for accessing the global libc.symbols */
static pthread_mutex_t libc_symbol_binding_mutex = PTHREAD_MUTEX_INITIALIZER;
/* The mutex for accessing the global libpthread.symbols */
static pthread_mutex_t libpthread_symbol_binding_mutex = PTHREAD_MUTEX_INITIALIZER;
/*********************************************************
* UWRAP PROTOTYPES
*********************************************************/
bool uid_wrapper_enabled(void);
void uwrap_constructor(void) CONSTRUCTOR_ATTRIBUTE;
void uwrap_destructor(void) DESTRUCTOR_ATTRIBUTE;
/*********************************************************
* UWRAP LIBC LOADER FUNCTIONS
*********************************************************/
enum uwrap_lib {
UWRAP_LIBC,
UWRAP_LIBNSL,
UWRAP_LIBSOCKET,
UWRAP_LIBPTHREAD,
};
static void *uwrap_load_lib_handle(enum uwrap_lib lib)
{
int flags = RTLD_LAZY;
void *handle = NULL;
int i;
#ifdef RTLD_DEEPBIND
flags |= RTLD_DEEPBIND;
#endif
switch (lib) {
case UWRAP_LIBNSL:
/* FALL TROUGH */
case UWRAP_LIBSOCKET:
/* FALL TROUGH */
case UWRAP_LIBC:
handle = uwrap.libc.handle;
if (handle == NULL) {
for (i = 10; i >= 0; i--) {
char soname[256] = {0};
snprintf(soname, sizeof(soname), "libc.so.%d", i);
handle = dlopen(soname, flags);
if (handle != NULL) {
break;
}
}
uwrap.libc.handle = handle;
}
break;
case UWRAP_LIBPTHREAD:
handle = uwrap.libpthread.handle;
if (handle == NULL) {
handle = dlopen("libpthread.so.0", flags);
if (handle != NULL) {
break;
}
}
break;
}
if (handle == NULL) {
#ifdef RTLD_NEXT
handle = uwrap.libc.handle = RTLD_NEXT;
#else
fprintf(stderr,
"Failed to dlopen library: %s\n",
dlerror());
exit(-1);
#endif
}
return handle;
}
static void *_uwrap_bind_symbol(enum uwrap_lib lib, const char *fn_name)
{
void *handle;
void *func;
handle = uwrap_load_lib_handle(lib);
func = dlsym(handle, fn_name);
if (func == NULL) {
fprintf(stderr,
"Failed to find %s: %s\n",
fn_name, dlerror());
exit(-1);
}
return func;
}
#define uwrap_bind_symbol_libc(sym_name) \
UWRAP_LOCK(libc_symbol_binding); \
if (uwrap.libc.symbols._libc_##sym_name.obj == NULL) { \
uwrap.libc.symbols._libc_##sym_name.obj = \
_uwrap_bind_symbol(UWRAP_LIBC, #sym_name); \
} \
UWRAP_UNLOCK(libc_symbol_binding)
#define uwrap_bind_symbol_libpthread(sym_name) \
UWRAP_LOCK(libpthread_symbol_binding); \
if (uwrap.libpthread.symbols._libpthread_##sym_name.obj == NULL) { \
uwrap.libpthread.symbols._libpthread_##sym_name.obj = \
_uwrap_bind_symbol(UWRAP_LIBPTHREAD, #sym_name); \
} \
UWRAP_UNLOCK(libpthread_symbol_binding)
/*
* IMPORTANT
*
* Functions expeciall from libc need to be loaded individually, you can't load
* all at once or gdb will segfault at startup. The same applies to valgrind and
* has probably something todo with with the linker.
* So we need load each function at the point it is called the first time.
*/
static int libc_setuid(uid_t uid)
{
uwrap_bind_symbol_libc(setuid);
return uwrap.libc.symbols._libc_setuid.f(uid);
}
static uid_t libc_getuid(void)
{
uwrap_bind_symbol_libc(getuid);
return uwrap.libc.symbols._libc_getuid.f();
}
#ifdef HAVE_SETEUID
static int libc_seteuid(uid_t euid)
{
uwrap_bind_symbol_libc(seteuid);
return uwrap.libc.symbols._libc_seteuid.f(euid);
}
#endif
#ifdef HAVE_SETREUID
static int libc_setreuid(uid_t ruid, uid_t euid)
{
uwrap_bind_symbol_libc(setreuid);
return uwrap.libc.symbols._libc_setreuid.f(ruid, euid);
}
#endif
#ifdef HAVE_SETRESUID
static int libc_setresuid(uid_t ruid, uid_t euid, uid_t suid)
{
uwrap_bind_symbol_libc(setresuid);
return uwrap.libc.symbols._libc_setresuid.f(ruid, euid, suid);
}
#endif
#ifdef HAVE_GETRESUID
static int libc_getresuid(uid_t *ruid, uid_t *euid, uid_t *suid)
{
uwrap_bind_symbol_libc(getresuid);
return uwrap.libc.symbols._libc_getresuid.f(ruid, euid, suid);
}
#endif
static uid_t libc_geteuid(void)
{
uwrap_bind_symbol_libc(geteuid);
return uwrap.libc.symbols._libc_geteuid.f();
}
static int libc_setgid(gid_t gid)
{
uwrap_bind_symbol_libc(setgid);
return uwrap.libc.symbols._libc_setgid.f(gid);
}
static gid_t libc_getgid(void)
{
uwrap_bind_symbol_libc(getgid);
return uwrap.libc.symbols._libc_getgid.f();
}
#ifdef HAVE_SETEGID
static int libc_setegid(gid_t egid)
{
uwrap_bind_symbol_libc(setegid);
return uwrap.libc.symbols._libc_setegid.f(egid);
}
#endif
#ifdef HAVE_SETREGID
static int libc_setregid(gid_t rgid, gid_t egid)
{
uwrap_bind_symbol_libc(setregid);
return uwrap.libc.symbols._libc_setregid.f(rgid, egid);
}
#endif
#ifdef HAVE_SETRESGID
static int libc_setresgid(gid_t rgid, gid_t egid, gid_t sgid)
{
uwrap_bind_symbol_libc(setresgid);
return uwrap.libc.symbols._libc_setresgid.f(rgid, egid, sgid);
}
#endif
#ifdef HAVE_GETRESGID
static int libc_getresgid(gid_t *rgid, gid_t *egid, gid_t *sgid)
{
uwrap_bind_symbol_libc(setresgid);
return uwrap.libc.symbols._libc_getresgid.f(rgid, egid, sgid);
}
#endif
static gid_t libc_getegid(void)
{
uwrap_bind_symbol_libc(getegid);
return uwrap.libc.symbols._libc_getegid.f();
}
static int libc_getgroups(int size, gid_t list[])
{
uwrap_bind_symbol_libc(getgroups);
return uwrap.libc.symbols._libc_getgroups.f(size, list);
}
static int libc_setgroups(size_t size, const gid_t *list)
{
uwrap_bind_symbol_libc(setgroups);
return uwrap.libc.symbols._libc_setgroups.f(size, list);
}
#ifdef HAVE_SYSCALL
DO_NOT_SANITIZE_ADDRESS_ATTRIBUTE
static long int libc_vsyscall(long int sysno, va_list va)
{
long int args[8];
long int rc;
int i;
uwrap_bind_symbol_libc(syscall);
for (i = 0; i < 8; i++) {
args[i] = va_arg(va, long int);
}
rc = uwrap.libc.symbols._libc_syscall.f(sysno,
args[0],
args[1],
args[2],
args[3],
args[4],
args[5],
args[6],
args[7]);
return rc;
}
#endif
/*
* This part is "optimistic".
* Thread can ends without pthread_exit call.
*/
static void libpthread_pthread_exit(void *retval)
{
uwrap_bind_symbol_libpthread(pthread_exit);
uwrap.libpthread.symbols._libpthread_pthread_exit.f(retval);
}
static void uwrap_pthread_exit(void *retval)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOG(UWRAP_LOG_DEBUG, "Cleanup thread");
UWRAP_LOCK(uwrap_id);
if (id == NULL) {
UWRAP_UNLOCK(uwrap_id);
libpthread_pthread_exit(retval);
return;
}
UWRAP_DLIST_REMOVE(uwrap.ids, id);
SAFE_FREE(id->groups);
SAFE_FREE(id);
uwrap_tls_id = NULL;
UWRAP_UNLOCK(uwrap_id);
libpthread_pthread_exit(retval);
}
void pthread_exit(void *retval)
{
if (!uid_wrapper_enabled()) {
libpthread_pthread_exit(retval);
};
uwrap_pthread_exit(retval);
/* Calm down gcc warning. */
exit(666);
}
static int libpthread_pthread_create(pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine) (void *),
void *arg)
{
uwrap_bind_symbol_libpthread(pthread_create);
return uwrap.libpthread.symbols._libpthread_pthread_create.f(thread,
attr,
start_routine,
arg);
}
struct uwrap_pthread_create_args {
struct uwrap_thread *id;
void *(*start_routine) (void *);
void *arg;
};
static void *uwrap_pthread_create_start(void *_a)
{
struct uwrap_pthread_create_args *a =
(struct uwrap_pthread_create_args *)_a;
void *(*start_routine) (void *) = a->start_routine;
void *arg = a->arg;
struct uwrap_thread *id = a->id;
SAFE_FREE(a);
uwrap_tls_id = id;
return start_routine(arg);
}
static int uwrap_pthread_create(pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine) (void *),
void *arg)
{
struct uwrap_pthread_create_args *args;
struct uwrap_thread *src_id = uwrap_tls_id;
int ret;
args = malloc(sizeof(struct uwrap_pthread_create_args));
if (args == NULL) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"uwrap_pthread_create: Unable to allocate memory");
errno = ENOMEM;
return -1;
}
args->start_routine = start_routine;
args->arg = arg;
args->id = calloc(1, sizeof(struct uwrap_thread));
if (args->id == NULL) {
SAFE_FREE(args);
UWRAP_LOG(UWRAP_LOG_ERROR,
"uwrap_pthread_create: Unable to allocate memory");
errno = ENOMEM;
return -1;
}
UWRAP_LOCK(uwrap_id);
args->id->groups = malloc(sizeof(gid_t) * src_id->ngroups);
if (args->id->groups == NULL) {
UWRAP_UNLOCK(uwrap_id);
SAFE_FREE(args->id);
SAFE_FREE(args);
UWRAP_LOG(UWRAP_LOG_ERROR,
"uwrap_pthread_create: Unable to allocate memory again");
errno = ENOMEM;
return -1;
}
args->id->ruid = src_id->ruid;
args->id->euid = src_id->euid;
args->id->suid = src_id->suid;
args->id->rgid = src_id->rgid;
args->id->egid = src_id->egid;
args->id->sgid = src_id->sgid;
args->id->enabled = src_id->enabled;
args->id->ngroups = src_id->ngroups;
if (src_id->groups != NULL) {
memcpy(args->id->groups, src_id->groups,
sizeof(gid_t) * src_id->ngroups);
} else {
SAFE_FREE(args->id->groups);
}
UWRAP_DLIST_ADD(uwrap.ids, args->id);
UWRAP_UNLOCK(uwrap_id);
ret = libpthread_pthread_create(thread, attr,
uwrap_pthread_create_start,
args);
if (ret != 0) {
return ret;
}
return ret;
}
int pthread_create(pthread_t *thread,
const pthread_attr_t *attr,
void *(*start_routine) (void *),
void *arg)
{
if (!uid_wrapper_enabled()) {
return libpthread_pthread_create(thread,
attr,
start_routine,
arg);
};
return uwrap_pthread_create(thread,
attr,
start_routine,
arg);
}
/*********************************************************
* UWRAP ID HANDLING
*********************************************************/
static void uwrap_thread_prepare(void)
{
struct uwrap_thread *id = uwrap_tls_id;
/* uid_wrapper is loaded but not enabled */
if (id == NULL) {
return;
}
UWRAP_LOCK_ALL;
/*
* What happens if another atfork prepare functions calls a uwrap
* function? So disable it in case another atfork prepare function
* calls a (s)uid function. We disable uid_wrapper only for thread
* (process) which called fork.
*/
id->enabled = false;
}
static void uwrap_thread_parent(void)
{
struct uwrap_thread *id = uwrap_tls_id;
/* uid_wrapper is loaded but not enabled */
if (id == NULL) {
return;
}
id->enabled = true;
UWRAP_UNLOCK_ALL;
}
static void uwrap_thread_child(void)
{
struct uwrap_thread *id = uwrap_tls_id;
struct uwrap_thread *u = uwrap.ids;
/* uid_wrapper is loaded but not enabled */
if (id == NULL) {
return;
}
/*
* "Garbage collector" - Inspired by DESTRUCTOR.
* All threads (except one which called fork()) are dead now.. Dave
* That's what posix said...
*/
while (u != NULL) {
if (u == id) {
/* Skip this item. */
u = uwrap.ids->next;
continue;
}
UWRAP_DLIST_REMOVE(uwrap.ids, u);
SAFE_FREE(u->groups);
SAFE_FREE(u);
u = uwrap.ids;
}
id->enabled = true;
UWRAP_UNLOCK_ALL;
}
static void uwrap_init(void)
{
const char *env;
UWRAP_LOCK(uwrap_id);
if (uwrap.initialised) {
struct uwrap_thread *id = uwrap_tls_id;
if (uwrap.ids == NULL) {
UWRAP_UNLOCK(uwrap_id);
return;
}
if (id == NULL) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"Invalid id for thread");
exit(-1);
}
UWRAP_UNLOCK(uwrap_id);
return;
}
UWRAP_LOG(UWRAP_LOG_DEBUG, "Initialize uid_wrapper");
uwrap.initialised = true;
env = getenv("UID_WRAPPER");
if (env != NULL && env[0] == '1') {
const char *root = getenv("UID_WRAPPER_ROOT");
struct uwrap_thread *id;
id = calloc(1, sizeof(struct uwrap_thread));
if (id == NULL) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"Unable to allocate memory for main id");
exit(-1);
}
UWRAP_DLIST_ADD(uwrap.ids, id);
uwrap_tls_id = id;
uwrap.myuid = libc_geteuid();
uwrap.mygid = libc_getegid();
/* put us in one group */
if (root != NULL && root[0] == '1') {
id->ruid = id->euid = id->suid = 0;
id->rgid = id->egid = id->sgid = 0;
id->groups = malloc(sizeof(gid_t) * 1);
if (id->groups == NULL) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"Unable to allocate memory");
exit(-1);
}
id->ngroups = 1;
id->groups[0] = 0;
} else {
id->ruid = id->euid = id->suid = uwrap.myuid;
id->rgid = id->egid = id->sgid = uwrap.mygid;
id->ngroups = libc_getgroups(0, NULL);
if (id->ngroups == -1) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"Unable to call libc_getgroups in uwrap_init.");
exit(-1);
}
id->groups = malloc(sizeof(gid_t) * id->ngroups);
if (id->groups == NULL) {
UWRAP_LOG(UWRAP_LOG_ERROR, "Unable to allocate memory");
exit(-1);
}
if (libc_getgroups(id->ngroups, id->groups) == -1) {
UWRAP_LOG(UWRAP_LOG_ERROR,
"Unable to call libc_getgroups again in uwrap_init.");
id->groups = 0;
/*
* Deallocation of uwrap.groups is handled by
* library destructor.
*/
exit(-1);
}
}
id->enabled = true;
UWRAP_LOG(UWRAP_LOG_DEBUG,
"Enabled uid_wrapper as %s (real uid=%u)",
id->ruid == 0 ? "root" : "user",
(unsigned int)uwrap.myuid);
}
UWRAP_UNLOCK(uwrap_id);
UWRAP_LOG(UWRAP_LOG_DEBUG, "Succeccfully initialized uid_wrapper");
}
bool uid_wrapper_enabled(void)
{
struct uwrap_thread *id = uwrap_tls_id;
bool enabled;
if (id == NULL) {
return false;
}
UWRAP_LOCK(uwrap_id);
enabled = id->enabled;
UWRAP_UNLOCK(uwrap_id);
return enabled;
}
/*
* UWRAP_SETxUID FUNCTIONS
*/
static int uwrap_setresuid_args(uid_t ruid, uid_t euid, uid_t suid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d, suid %d -> %d",
id->ruid, ruid, id->euid, euid, id->suid, suid);
if (id->euid != 0) {
if (ruid != (uid_t)-1 &&
ruid != id->ruid &&
ruid != id->euid &&
ruid != id->suid) {
errno = EPERM;
return -1;
}
if (euid != (uid_t)-1 &&
euid != id->ruid &&
euid != id->euid &&
euid != id->suid) {
errno = EPERM;
return -1;
}
if (suid != (uid_t)-1 &&
suid != id->ruid &&
suid != id->euid &&
suid != id->suid) {
errno = EPERM;
return -1;
}
}
return 0;
}
static int uwrap_setresuid_thread(uid_t ruid, uid_t euid, uid_t suid)
{
struct uwrap_thread *id = uwrap_tls_id;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d, suid %d -> %d",
id->ruid, ruid, id->euid, euid, id->suid, suid);
rc = uwrap_setresuid_args(ruid, euid, suid);
if (rc != 0) {
return rc;
}
UWRAP_LOCK(uwrap_id);
if (ruid != (uid_t)-1) {
id->ruid = ruid;
}
if (euid != (uid_t)-1) {
id->euid = euid;
}
if (suid != (uid_t)-1) {
id->suid = suid;
}
UWRAP_UNLOCK(uwrap_id);
return 0;
}
static int uwrap_setresuid(uid_t ruid, uid_t euid, uid_t suid)
{
struct uwrap_thread *id = uwrap_tls_id;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d, suid %d -> %d",
id->ruid, ruid, id->euid, euid, id->suid, suid);
rc = uwrap_setresuid_args(ruid, euid, suid);
if (rc != 0) {
return rc;
}
UWRAP_LOCK(uwrap_id);
for (id = uwrap.ids; id; id = id->next) {
if (ruid != (uid_t)-1) {
id->ruid = ruid;
}
if (euid != (uid_t)-1) {
id->euid = euid;
}
if (suid != (uid_t)-1) {
id->suid = suid;
}
}
UWRAP_UNLOCK(uwrap_id);
return 0;
}
static int uwrap_setreuid_args(uid_t ruid, uid_t euid,
uid_t *_new_ruid,
uid_t *_new_euid,
uid_t *_new_suid)
{
struct uwrap_thread *id = uwrap_tls_id;
uid_t new_ruid = -1, new_euid = -1, new_suid = -1;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d",
id->ruid, ruid, id->euid, euid);
if (ruid != (uid_t)-1) {
new_ruid = ruid;
if (ruid != id->ruid &&
ruid != id->euid &&
id->euid != 0) {
errno = EPERM;
return -1;
}
}
if (euid != (uid_t)-1) {
new_euid = euid;
if (euid != id->ruid &&
euid != id->euid &&
euid != id->suid &&
id->euid != 0) {
errno = EPERM;
return -1;
}
}
if (ruid != (uid_t) -1 ||
(euid != (uid_t)-1 && id->ruid != euid)) {
new_suid = new_euid;
}
*_new_ruid = new_ruid;
*_new_euid = new_euid;
*_new_suid = new_suid;
return 0;
}
static int uwrap_setreuid_thread(uid_t ruid, uid_t euid)
{
#ifndef NDEBUG
struct uwrap_thread *id = uwrap_tls_id;
#endif
uid_t new_ruid = -1, new_euid = -1, new_suid = -1;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d",
id->ruid, ruid, id->euid, euid);
rc = uwrap_setreuid_args(ruid, euid, &new_ruid, &new_euid, &new_suid);
if (rc != 0) {
return rc;
}
return uwrap_setresuid_thread(new_ruid, new_euid, new_suid);
}
#ifdef HAVE_SETREUID
static int uwrap_setreuid(uid_t ruid, uid_t euid)
{
#ifndef NDEBUG
struct uwrap_thread *id = uwrap_tls_id;
#endif
uid_t new_ruid = -1, new_euid = -1, new_suid = -1;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"ruid %d -> %d, euid %d -> %d",
id->ruid, ruid, id->euid, euid);
rc = uwrap_setreuid_args(ruid, euid, &new_ruid, &new_euid, &new_suid);
if (rc != 0) {
return rc;
}
return uwrap_setresuid(new_ruid, new_euid, new_suid);
}
#endif
static int uwrap_setuid_args(uid_t uid,
uid_t *new_ruid,
uid_t *new_euid,
uid_t *new_suid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOG(UWRAP_LOG_TRACE,
"uid %d -> %d",
id->ruid, uid);
if (uid == (uid_t)-1) {
errno = EINVAL;
return -1;
}
if (id->euid == 0) {
*new_suid = *new_ruid = uid;
} else if (uid != id->ruid &&
uid != id->suid) {
errno = EPERM;
return -1;
}
*new_euid = uid;
return 0;
}
static int uwrap_setuid_thread(uid_t uid)
{
uid_t new_ruid = -1, new_euid = -1, new_suid = -1;
int rc;
rc = uwrap_setuid_args(uid, &new_ruid, &new_euid, &new_suid);
if (rc != 0) {
return rc;
}
return uwrap_setresuid_thread(new_ruid, new_euid, new_suid);
}
static int uwrap_setuid(uid_t uid)
{
uid_t new_ruid = -1, new_euid = -1, new_suid = -1;
int rc;
rc = uwrap_setuid_args(uid, &new_ruid, &new_euid, &new_suid);
if (rc != 0) {
return rc;
}
return uwrap_setresuid(new_ruid, new_euid, new_suid);
}
/*
* UWRAP_GETxUID FUNCTIONS
*/
#ifdef HAVE_GETRESUID
static int uwrap_getresuid(uid_t *ruid, uid_t *euid, uid_t *suid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOCK(uwrap_id);
*ruid = id->ruid;
*euid = id->euid;
*suid = id->suid;
UWRAP_UNLOCK(uwrap_id);
return 0;
}
#endif
#ifdef HAVE_GETRESGID
static int uwrap_getresgid(gid_t *rgid, gid_t *egid, gid_t *sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOCK(uwrap_id);
*rgid = id->rgid;
*egid = id->egid;
*sgid = id->sgid;
UWRAP_UNLOCK(uwrap_id);
return 0;
}
#endif
/*
* UWRAP_SETxGID FUNCTIONS
*/
static int uwrap_setresgid_args(gid_t rgid, gid_t egid, gid_t sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d, sgid %d -> %d",
id->rgid, rgid, id->egid, egid, id->sgid, sgid);
if (id->euid != 0) {
if (rgid != (gid_t)-1 &&
rgid != id->rgid &&
rgid != id->egid &&
rgid != id->sgid) {
errno = EPERM;
return -1;
}
if (egid != (gid_t)-1 &&
egid != id->rgid &&
egid != id->egid &&
egid != id->sgid) {
errno = EPERM;
return -1;
}
if (sgid != (gid_t)-1 &&
sgid != id->rgid &&
sgid != id->egid &&
sgid != id->sgid) {
errno = EPERM;
return -1;
}
}
return 0;
}
static int uwrap_setresgid_thread(gid_t rgid, gid_t egid, gid_t sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d, sgid %d -> %d",
id->rgid, rgid, id->egid, egid, id->sgid, sgid);
rc = uwrap_setresgid_args(rgid, egid, sgid);
if (rc != 0) {
return rc;
}
UWRAP_LOCK(uwrap_id);
if (rgid != (gid_t)-1) {
id->rgid = rgid;
}
if (egid != (gid_t)-1) {
id->egid = egid;
}
if (sgid != (gid_t)-1) {
id->sgid = sgid;
}
UWRAP_UNLOCK(uwrap_id);
return 0;
}
static int uwrap_setresgid(gid_t rgid, gid_t egid, gid_t sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d, sgid %d -> %d",
id->rgid, rgid, id->egid, egid, id->sgid, sgid);
rc = uwrap_setresgid_args(rgid, egid, sgid);
if (rc != 0) {
return rc;
}
UWRAP_LOCK(uwrap_id);
for (id = uwrap.ids; id; id = id->next) {
if (rgid != (gid_t)-1) {
id->rgid = rgid;
}
if (egid != (gid_t)-1) {
id->egid = egid;
}
if (sgid != (gid_t)-1) {
id->sgid = sgid;
}
}
UWRAP_UNLOCK(uwrap_id);
return 0;
}
static int uwrap_setregid_args(gid_t rgid, gid_t egid,
gid_t *_new_rgid,
gid_t *_new_egid,
gid_t *_new_sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
gid_t new_rgid = -1, new_egid = -1, new_sgid = -1;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d",
id->rgid, rgid, id->egid, egid);
if (rgid != (gid_t)-1) {
new_rgid = rgid;
if (rgid != id->rgid &&
rgid != id->egid &&
id->euid != 0) {
errno = EPERM;
return -1;
}
}
if (egid != (gid_t)-1) {
new_egid = egid;
if (egid != id->rgid &&
egid != id->egid &&
egid != id->sgid &&
id->euid != 0) {
errno = EPERM;
return -1;
}
}
if (rgid != (gid_t) -1 ||
(egid != (gid_t)-1 && id->rgid != egid)) {
new_sgid = new_egid;
}
*_new_rgid = new_rgid;
*_new_egid = new_egid;
*_new_sgid = new_sgid;
return 0;
}
static int uwrap_setregid_thread(gid_t rgid, gid_t egid)
{
#ifndef NDEBUG
struct uwrap_thread *id = uwrap_tls_id;
#endif
gid_t new_rgid = -1, new_egid = -1, new_sgid = -1;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d",
id->rgid, rgid, id->egid, egid);
rc = uwrap_setregid_args(rgid, egid, &new_rgid, &new_egid, &new_sgid);
if (rc != 0) {
return rc;
}
return uwrap_setresgid_thread(new_rgid, new_egid, new_sgid);
}
#ifdef HAVE_SETREGID
static int uwrap_setregid(gid_t rgid, gid_t egid)
{
#ifndef NDEBUG
struct uwrap_thread *id = uwrap_tls_id;
#endif
gid_t new_rgid = -1, new_egid = -1, new_sgid = -1;
int rc;
UWRAP_LOG(UWRAP_LOG_TRACE,
"rgid %d -> %d, egid %d -> %d",
id->rgid, rgid, id->egid, egid);
rc = uwrap_setregid_args(rgid, egid, &new_rgid, &new_egid, &new_sgid);
if (rc != 0) {
return rc;
}
return uwrap_setresgid(new_rgid, new_egid, new_sgid);
}
#endif
static int uwrap_setgid_args(gid_t gid,
gid_t *new_rgid,
gid_t *new_egid,
gid_t *new_sgid)
{
struct uwrap_thread *id = uwrap_tls_id;
UWRAP_LOG(UWRAP_LOG_TRACE,
"gid %d -> %d",
id->rgid, gid);
if (gid == (gid_t)-1) {
errno = EINVAL;
return -1;
}
if (id->euid == 0) {
*new_sgid = *new_rgid = gid;
} else if (gid != id->rgid &&
gid != id->sgid) {
errno = EPERM;
return -1;
}
*new_egid = gid;
return 0;
}
static int uwrap_setgid_thread(gid_t gid)
{
gid_t new_rgid = -1, new_egid = -1, new_sgid = -1;
int rc;
rc = uwrap_setgid_args(gid, &new_rgid, &new_egid, &new_sgid);
if (rc != 0) {
return rc;
}
return uwrap_setresgid_thread(new_rgid, new_egid, new_sgid);
}
static int uwrap_setgid(gid_t gid)
{
gid_t new_rgid = -1, new_egid = -1, new_sgid = -1;
int rc;
rc = uwrap_setgid_args(gid, &new_rgid, &new_egid, &new_sgid);
if (rc != 0) {
return rc;
}
return uwrap_setresgid(new_rgid, new_egid, new_sgid);
}
/*
* SETUID
*/
int setuid(uid_t uid)
{
if (!uid_wrapper_enabled()) {
return libc_setuid(uid);
}
uwrap_init();
return uwrap_setuid(uid);
}
#ifdef HAVE_SETEUID
int seteuid(uid_t euid)
{
if (!uid_wrapper_enabled()) {
return libc_seteuid(euid);
}
/* On FreeBSD the uid_t -1 is set and doesn't produce and error */
if (euid == (uid_t)-1) {
errno = EINVAL;
return -1;
}
uwrap_init();
return uwrap_setresuid(-1, euid, -1);
}
#endif
#ifdef HAVE_SETREUID
int setreuid(uid_t ruid, uid_t euid)
{
if (!uid_wrapper_enabled()) {
return libc_setreuid(ruid, euid);
}
uwrap_init();
return uwrap_setreuid(ruid, euid);
}
#endif
#ifdef HAVE_SETRESUID
int setresuid(uid_t ruid, uid_t euid, uid_t suid)
{
if (!uid_wrapper_enabled()) {
return libc_setresuid(ruid, euid, suid);
}
uwrap_init();
return uwrap_setresuid(ruid, euid, suid);
}
#endif
#ifdef HAVE_GETRESUID
int getresuid(uid_t *ruid, uid_t *euid, uid_t *suid)
{
if (!uid_wrapper_enabled()) {
return libc_getresuid(ruid, euid, suid);
}
uwrap_init();
return uwrap_getresuid(ruid, euid, suid);
}
#endif
/*
* GETUID
*/
static uid_t uwrap_getuid(void)
{
struct uwrap_thread *id = uwrap_tls_id;
uid_t uid;
UWRAP_LOCK(uwrap_id);
uid = id->ruid;
UWRAP_UNLOCK(uwrap_id);
return uid;
}
uid_t getuid(void)
{
if (!uid_wrapper_enabled()) {
return libc_getuid();
}
uwrap_init();
return uwrap_getuid();
}
/*
* GETEUID
*/
static uid_t uwrap_geteuid(void)
{
const char *env = getenv("UID_WRAPPER_MYUID");
struct uwrap_thread *id = uwrap_tls_id;
uid_t uid;
UWRAP_LOCK(uwrap_id);
uid = id->euid;
UWRAP_UNLOCK(uwrap_id);
/* Disable root and return myuid */
if (env != NULL && env[0] == '1') {
uid = uwrap.myuid;
}
return uid;
}
uid_t geteuid(void)
{
if (!uid_wrapper_enabled()) {
return libc_geteuid();
}
uwrap_init();
return uwrap_geteuid();
}
/*
* SETGID
*/
int setgid(gid_t gid)
{
if (!uid_wrapper_enabled()) {
return libc_setgid(gid);
}
uwrap_init();
return uwrap_setgid(gid);
}
#ifdef HAVE_SETEGID
int setegid(gid_t egid)
{
if (!uid_wrapper_enabled()) {
return libc_setegid(egid);
}
/* On FreeBSD the uid_t -1 is set and doesn't produce and error */
if (egid == (gid_t)-1) {
errno = EINVAL;
return -1;
}
uwrap_init();
return uwrap_setresgid(-1, egid, -1);
}
#endif
#ifdef HAVE_SETREGID
int setregid(gid_t rgid, gid_t egid)
{
if (!uid_wrapper_enabled()) {
return libc_setregid(rgid, egid);
}
uwrap_init();
return uwrap_setregid(rgid, egid);
}
#endif
#ifdef HAVE_SETRESGID
int setresgid(gid_t rgid, gid_t egid, gid_t sgid)
{
if (!uid_wrapper_enabled()) {
return libc_setresgid(rgid, egid, sgid);
}
uwrap_init();
return uwrap_setresgid(rgid, egid, sgid);
}
#endif
#ifdef HAVE_GETRESGID
int getresgid(gid_t *rgid, gid_t *egid, gid_t *sgid)
{
if (!uid_wrapper_enabled()) {
return libc_getresgid(rgid, egid, sgid);
}
uwrap_init();
return uwrap_getresgid(rgid, egid, sgid);
}
#endif
/*
* GETGID
*/
static gid_t uwrap_getgid(void)
{
struct uwrap_thread *id = uwrap_tls_id;
gid_t gid;
UWRAP_LOCK(uwrap_id);
gid = id->rgid;
UWRAP_UNLOCK(uwrap_id);
return gid;
}
gid_t getgid(void)
{
if (!uid_wrapper_enabled()) {
return libc_getgid();
}
uwrap_init();
return uwrap_getgid();
}
/*
* GETEGID
*/
static uid_t uwrap_getegid(void)
{
struct uwrap_thread *id = uwrap_tls_id;
gid_t gid;
UWRAP_LOCK(uwrap_id);
gid = id->egid;
UWRAP_UNLOCK(uwrap_id);
return gid;
}
uid_t getegid(void)
{
if (!uid_wrapper_enabled()) {
return libc_getegid();
}
uwrap_init();
return uwrap_getegid();
}
static int uwrap_setgroups_thread(size_t size, const gid_t *list)
{
struct uwrap_thread *id = uwrap_tls_id;
int rc = -1;
UWRAP_LOCK(uwrap_id);
if (size == 0) {
SAFE_FREE(id->groups);
id->ngroups = 0;
} else if (size > 0) {
gid_t *tmp;
tmp = realloc(id->groups, sizeof(gid_t) * size);
if (tmp == NULL) {
errno = ENOMEM;
goto out;
}
id->groups = tmp;
id->ngroups = size;
memcpy(id->groups, list, size * sizeof(gid_t));
}
rc = 0;
out:
UWRAP_UNLOCK(uwrap_id);
return rc;
}
static int uwrap_setgroups(size_t size, const gid_t *list)
{
struct uwrap_thread *id;
int rc = -1;
UWRAP_LOCK(uwrap_id);
if (size == 0) {
for (id = uwrap.ids; id; id = id->next) {
SAFE_FREE(id->groups);
id->ngroups = 0;
}
} else if (size > 0) {
gid_t *tmp;
for (id = uwrap.ids; id; id = id->next) {
tmp = realloc(id->groups, sizeof(gid_t) * size);
if (tmp == NULL) {
errno = ENOMEM;
goto out;
}
id->groups = tmp;
id->ngroups = size;
memcpy(id->groups, list, size * sizeof(gid_t));
}
}
rc = 0;
out:
UWRAP_UNLOCK(uwrap_id);
return rc;
}
#ifdef HAVE_SETGROUPS_INT
int setgroups(int size, const gid_t *list)
#else
int setgroups(size_t size, const gid_t *list)
#endif
{
if (!uid_wrapper_enabled()) {
return libc_setgroups(size, list);
}
uwrap_init();
return uwrap_setgroups(size, list);
}
static int uwrap_getgroups(int size, gid_t *list)
{
struct uwrap_thread *id = uwrap_tls_id;
int ngroups;
UWRAP_LOCK(uwrap_id);
ngroups = id->ngroups;
if (size > ngroups) {
size = ngroups;
}
if (size == 0) {
goto out;
}
if (size < ngroups) {
errno = EINVAL;
ngroups = -1;
}
memcpy(list, id->groups, size * sizeof(gid_t));
out:
UWRAP_UNLOCK(uwrap_id);
return ngroups;
}
int getgroups(int size, gid_t *list)
{
if (!uid_wrapper_enabled()) {
return libc_getgroups(size, list);
}
uwrap_init();
return uwrap_getgroups(size, list);
}
#if (defined(HAVE_SYS_SYSCALL_H) || defined(HAVE_SYSCALL_H)) \
&& (defined(SYS_setreuid) || defined(SYS_setreuid32))
static long int uwrap_syscall (long int sysno, va_list vp)
{
long int rc;
switch (sysno) {
/* gid */
case SYS_getgid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_getgid32:
#endif
{
rc = uwrap_getgid();
}
break;
#ifdef SYS_getegid
case SYS_getegid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_getegid32:
#endif
{
rc = uwrap_getegid();
}
break;
#endif /* SYS_getegid */
case SYS_setgid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setgid32:
#endif
{
gid_t gid = (gid_t) va_arg(vp, gid_t);
rc = uwrap_setgid_thread(gid);
}
break;
case SYS_setregid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setregid32:
#endif
{
gid_t rgid = (gid_t) va_arg(vp, gid_t);
gid_t egid = (gid_t) va_arg(vp, gid_t);
rc = uwrap_setregid_thread(rgid, egid);
}
break;
#ifdef SYS_setresgid
case SYS_setresgid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setresgid32:
#endif
{
gid_t rgid = (gid_t) va_arg(vp, gid_t);
gid_t egid = (gid_t) va_arg(vp, gid_t);
gid_t sgid = (gid_t) va_arg(vp, gid_t);
rc = uwrap_setresgid_thread(rgid, egid, sgid);
}
break;
#endif /* SYS_setresgid */
#if defined(SYS_getresgid) && defined(HAVE_GETRESGID)
case SYS_getresgid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_getresgid32:
#endif
{
gid_t *rgid = (gid_t *) va_arg(vp, gid_t *);
gid_t *egid = (gid_t *) va_arg(vp, gid_t *);
gid_t *sgid = (gid_t *) va_arg(vp, gid_t *);
rc = uwrap_getresgid(rgid, egid, sgid);
}
break;
#endif /* SYS_getresgid && HAVE_GETRESGID */
/* uid */
case SYS_getuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_getuid32:
#endif
{
rc = uwrap_getuid();
}
break;
#ifdef SYS_geteuid
case SYS_geteuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_geteuid32:
#endif
{
rc = uwrap_geteuid();
}
break;
#endif /* SYS_geteuid */
case SYS_setuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setuid32:
#endif
{
uid_t uid = (uid_t) va_arg(vp, uid_t);
rc = uwrap_setuid_thread(uid);
}
break;
case SYS_setreuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setreuid32:
#endif
{
uid_t ruid = (uid_t) va_arg(vp, uid_t);
uid_t euid = (uid_t) va_arg(vp, uid_t);
rc = uwrap_setreuid_thread(ruid, euid);
}
break;
#ifdef SYS_setresuid
case SYS_setresuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setresuid32:
#endif
{
uid_t ruid = (uid_t) va_arg(vp, uid_t);
uid_t euid = (uid_t) va_arg(vp, uid_t);
uid_t suid = (uid_t) va_arg(vp, uid_t);
rc = uwrap_setresuid_thread(ruid, euid, suid);
}
break;
#endif /* SYS_setresuid */
#if defined(SYS_getresuid) && defined(HAVE_GETRESUID)
case SYS_getresuid:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_getresuid32:
#endif
{
uid_t *ruid = (uid_t *) va_arg(vp, uid_t *);
uid_t *euid = (uid_t *) va_arg(vp, uid_t *);
uid_t *suid = (uid_t *) va_arg(vp, uid_t *);
rc = uwrap_getresuid(ruid, euid, suid);
}
break;
#endif /* SYS_getresuid && HAVE_GETRESUID*/
/* groups */
case SYS_setgroups:
#ifdef HAVE_LINUX_32BIT_SYSCALLS
case SYS_setgroups32:
#endif
{
size_t size = (size_t) va_arg(vp, size_t);
gid_t *list = (gid_t *) va_arg(vp, int *);
rc = uwrap_setgroups_thread(size, list);
}
break;
default:
UWRAP_LOG(UWRAP_LOG_DEBUG,
"UID_WRAPPER calling non-wrapped syscall %lu",
sysno);
rc = libc_vsyscall(sysno, vp);
break;
}
return rc;
}
#ifdef HAVE_SYSCALL
#ifdef HAVE_SYSCALL_INT
int syscall (int sysno, ...)
#else
long int syscall (long int sysno, ...)
#endif
{
#ifdef HAVE_SYSCALL_INT
int rc;
#else
long int rc;
#endif
va_list va;
va_start(va, sysno);
if (!uid_wrapper_enabled()) {
rc = libc_vsyscall(sysno, va);
va_end(va);
return rc;
}
uwrap_init();
rc = uwrap_syscall(sysno, va);
va_end(va);
return rc;
}
#endif /* HAVE_SYSCALL */
#endif /* HAVE_SYS_SYSCALL_H || HAVE_SYSCALL_H */
/****************************
* CONSTRUCTOR
***************************/
void uwrap_constructor(void)
{
/*
* If we hold a lock and the application forks, then the child
* is not able to unlock the mutex and we are in a deadlock.
* This should prevent such deadlocks.
*/
pthread_atfork(&uwrap_thread_prepare,
&uwrap_thread_parent,
&uwrap_thread_child);
/* Here is safe place to call uwrap_init() and initialize data
* for main process.
*/
uwrap_init();
}
/****************************
* DESTRUCTOR
***************************/
/*
* This function is called when the library is unloaded and makes sure that
* resources are freed.
*/
void uwrap_destructor(void)
{
struct uwrap_thread *u = uwrap.ids;
UWRAP_LOCK_ALL;
while (u != NULL) {
UWRAP_DLIST_REMOVE(uwrap.ids, u);
SAFE_FREE(u->groups);
SAFE_FREE(u);
u = uwrap.ids;
}
if (uwrap.libc.handle != NULL) {
dlclose(uwrap.libc.handle);
}
if (uwrap.libpthread.handle != NULL) {
dlclose(uwrap.libpthread.handle);
}
UWRAP_UNLOCK_ALL;
}
uid_wrapper-1.2.1/tests/ 000755 001750 000144 00000000000 12672263025 015163 5 ustar 00asn users 000000 000000 uid_wrapper-1.2.1/tests/getuids.c 000644 001750 000144 00000000630 12247650254 016774 0 ustar 00asn users 000000 000000 #include
#include
int main(void) {
uid_t ruid, euid, suid;
gid_t rgid, egid, sgid;
int rc;
rc = getresuid(&ruid, &euid, &suid);
printf("getresuid(%d): ruid=%d, euid=%d, suid=%d\n",
rc, (int)ruid, (int)euid, (int)suid);
rc = getresgid(&rgid, &egid, &sgid);
printf("getresgid(%d): rgid=%d, egid=%d, sgid=%d\n",
rc, (int)rgid, (int)egid, (int)sgid);
return 0;
}
uid_wrapper-1.2.1/tests/valgrind.supp 000644 001750 000144 00000000320 12255032314 017665 0 ustar 00asn users 000000 000000 ### GLIBC
{
glibc_dlopen_alloc
Memcheck:Leak
fun:calloc
fun:_dlerror_run
fun:dlopen@@GLIBC_2.2.5
}
{
glibc_dlclose_alloc
Memcheck:Leak
fun:calloc
fun:_dlerror_run
fun:dlclose
}
uid_wrapper-1.2.1/tests/uwrap_enabled.c 000644 001750 000144 00000000151 12274125273 020134 0 ustar 00asn users 000000 000000 #include
bool uid_wrapper_enabled(void);
bool uid_wrapper_enabled(void)
{
return false;
}
uid_wrapper-1.2.1/tests/test_uwrap_disabled.c 000644 001750 000144 00000011624 12565564712 021367 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ZERO_STRUCTP(x) do { if ((x) != NULL) memset((char *)(x), 0, sizeof(*(x))); } while(0)
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
struct test_opts {
int root_mode;
uid_t myuid;
gid_t mygid;
uid_t nbuid;
gid_t nbgid;
};
static int setup(void **state)
{
struct test_opts *t;
struct passwd *pwd;
pwd = getpwnam("nobody");
assert_non_null(pwd);
t = malloc(sizeof(struct test_opts));
assert_non_null(t);
ZERO_STRUCTP(t);
t->myuid = getuid();
t->mygid = getgid();
t->nbuid = pwd->pw_uid;
t->nbgid = pwd->pw_gid;
if (getuid() == (uid_t)0 || geteuid() == (uid_t)0) {
t->root_mode = 1;
}
*state = t;
return 0;
}
static int teardown(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
setuid(t->myuid);
seteuid(t->myuid);
setgid(t->mygid);
setegid(t->mygid);
free(t);
return 0;
}
static void test_uwrap_setuid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
int rc;
if (t->root_mode) {
return;
} else {
rc = setuid(t->nbuid);
assert_int_equal(rc, -1);
}
}
static void test_uwrap_seteuid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = seteuid(t->nbuid);
assert_int_equal(rc, 0);
u = geteuid();
assert_int_equal(u, t->nbuid);
} else {
rc = seteuid(t->nbuid);
assert_int_equal(rc, -1);
}
}
#ifdef HAVE_SETREUID
static void test_uwrap_setreuid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = setreuid(-1, t->nbuid);
assert_int_equal(rc, 0);
u = geteuid();
assert_int_equal(u, t->nbuid);
} else {
rc = setreuid(-1, t->nbuid);
assert_int_equal(rc, -1);
}
}
#endif
#ifdef HAVE_SETRESUID
static void test_uwrap_setresuid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = setresuid(-1, t->nbuid, -1);
assert_int_equal(rc, 0);
u = geteuid();
assert_int_equal(u, t->nbuid);
} else {
rc = setresuid(-1, t->nbuid, -1);
assert_int_equal(rc, -1);
}
}
#endif
static void test_uwrap_setgid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
int rc;
if (t->root_mode) {
return;
} else {
rc = setgid(t->nbgid);
assert_int_equal(rc, -1);
}
}
static void test_uwrap_setegid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = setegid(t->nbgid);
assert_int_equal(rc, 0);
u = getegid();
assert_int_equal(u, t->nbgid);
} else {
rc = setegid(t->nbgid);
assert_int_equal(rc, -1);
}
}
#ifdef HAVE_SETREGID
static void test_uwrap_setregid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = setregid(-1, t->nbgid);
assert_int_equal(rc, 0);
u = getegid();
assert_int_equal(u, t->nbgid);
} else {
rc = setregid(-1, t->nbgid);
assert_int_equal(rc, -1);
}
}
#endif
#ifdef HAVE_SETRESGID
static void test_uwrap_setresgid(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
uid_t u;
int rc;
if (t->root_mode) {
rc = setresgid(-1, t->nbgid, -1);
assert_int_equal(rc, 0);
u = getegid();
assert_int_equal(u, t->nbgid);
} else {
rc = setresgid(-1, t->nbgid, -1);
assert_int_equal(rc, -1);
}
}
#endif
static void test_uwrap_setgroups(void **state)
{
struct test_opts *t = (struct test_opts *)*state;
gid_t glist[1];
gid_t rlist[16];
int rc;
glist[0] = t->nbgid;
(void) state; /* unused */
if (t->root_mode) {
rc = setgroups(ARRAY_SIZE(glist), glist);
assert_int_equal(rc, 0);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 1);
assert_memory_equal(glist, rlist, sizeof(glist));
} else {
rc = setgroups(ARRAY_SIZE(glist), glist);
assert_int_equal(rc, -1);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_not_equal(rc, -1);
}
}
int main(void)
{
int rc;
const struct CMUnitTest tests[] = {
cmocka_unit_test_setup_teardown(test_uwrap_setuid, setup, teardown),
cmocka_unit_test_setup_teardown(test_uwrap_seteuid, setup, teardown),
#ifdef HAVE_SETREUID
cmocka_unit_test_setup_teardown(test_uwrap_setreuid, setup, teardown),
#endif
#ifdef HAVE_SETRESUID
cmocka_unit_test_setup_teardown(test_uwrap_setresuid, setup, teardown),
#endif
cmocka_unit_test_setup_teardown(test_uwrap_setgid, setup, teardown),
cmocka_unit_test_setup_teardown(test_uwrap_setegid, setup, teardown),
#ifdef HAVE_SETREGID
cmocka_unit_test_setup_teardown(test_uwrap_setregid, setup, teardown),
#endif
#ifdef HAVE_SETRESGID
cmocka_unit_test_setup_teardown(test_uwrap_setresgid, setup, teardown),
#endif
cmocka_unit_test_setup_teardown(test_uwrap_setgroups, setup, teardown),
};
rc = cmocka_run_group_tests(tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_uwrap_enabled.c 000644 001750 000144 00000000752 12565564712 021212 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
bool uid_wrapper_enabled(void);
static void test_uid_wrapper_enabled(void **state)
{
bool ok;
(void)state; /* unused */
ok = uid_wrapper_enabled();
assert_true(ok);
}
int main(void) {
int rc;
const struct CMUnitTest tests[] = {
cmocka_unit_test(test_uid_wrapper_enabled),
};
rc = cmocka_run_group_tests(tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall.c 000644 001750 000144 00000002214 12565564712 020047 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#define ZERO_STRUCT(x) memset((char *)&(x), 0, sizeof(x))
static void test_uwrap_syscall(void **state)
{
long int rc;
struct timeval tv1, tv2;
struct timezone tz1, tz2;
(void) state; /* unused */
rc = syscall(SYS_getpid);
assert_int_equal(rc, getpid());
ZERO_STRUCT(tv1);
ZERO_STRUCT(tv2);
ZERO_STRUCT(tz1);
ZERO_STRUCT(tz2);
rc = gettimeofday(&tv1, &tz1);
assert_int_equal(rc, 0);
#ifdef OSX
tv2.tv_sec = syscall(SYS_gettimeofday, &tv2, NULL);
#else
rc = syscall(SYS_gettimeofday, &tv2, &tz2);
assert_int_equal(rc, 0);
assert_int_equal(tz1.tz_dsttime, tz2.tz_dsttime);
assert_int_equal(tz1.tz_minuteswest, tz2.tz_minuteswest);
#endif
assert_int_equal(tv1.tv_sec, tv2.tv_sec);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_gid.c 000644 001750 000144 00000005275 12576601451 020676 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
static void test_uwrap_syscall_setgid(void **state)
{
long int rc;
gid_t g;
(void) state; /* unused */
rc = syscall(SYS_setgid, 1);
assert_int_equal(rc, 0);
g = getgid();
assert_int_equal(g, 1);
assert_int_equal(g, syscall(SYS_getgid));
}
static void test_uwrap_syscall_setregid(void **state)
{
long int rc;
gid_t g;
(void) state; /* unused */
rc = syscall(SYS_setregid, 2, 0);
assert_int_equal(rc, 0);
g = getegid();
assert_int_equal(g, 0);
#ifdef SYS_getegid /* not available on Solaris */
assert_int_equal(g, syscall(SYS_getegid));
#endif
rc = syscall(SYS_setregid, -1, 42);
assert_int_equal(rc, 0);
g = getgid();
assert_int_equal(g, 2);
g = getegid();
assert_int_equal(g, 42);
}
#if defined(SYS_setresgid)
static void test_uwrap_syscall_setresgid(void **state)
{
long int rc;
gid_t g;
gid_t g_r, g_e, g_s;
(void) state; /* unused */
rc = syscall(SYS_setresgid, 42, 0, -1);
assert_int_equal(rc, 0);
g = getegid();
assert_int_equal(g, 0);
#ifdef SYS_getresgid /* not available on Solaris */
rc = syscall(SYS_getresgid, &g_r, &g_e, &g_s);
assert_return_code(rc, errno);
assert_int_equal(g_r, 42);
assert_int_equal(g, g_e);
#endif
rc = syscall(SYS_setregid, -1, 42);
assert_return_code(rc, errno);
g = getegid();
assert_int_equal(g, 42);
}
#endif
#if defined(SYS_setgroups)
static void test_uwrap_syscall_setgroups(void **state)
{
gid_t glist[] = { 100, 200, 300, 400, 500 };
gid_t rlist[16];
int rc = -1;
(void) state; /* unused */
rc = syscall(SYS_setgroups, ARRAY_SIZE(glist), glist);
assert_int_equal(rc, 0);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 5);
assert_memory_equal(glist, rlist, sizeof(glist));
/* Drop all supplementary groups. This is often done by daemons */
memset(rlist, 0, sizeof(rlist));
rc = syscall(SYS_setgroups, 0, NULL);
assert_int_equal(rc, 0);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 0);
assert_int_equal(rlist[0], 0);
}
#endif
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall_setgid),
cmocka_unit_test(test_uwrap_syscall_setregid),
#if defined(SYS_setresgid)
cmocka_unit_test(test_uwrap_syscall_setresgid),
#endif
#if defined(SYS_setgroups)
cmocka_unit_test(test_uwrap_syscall_setgroups),
#endif
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setreuid.c 000644 001750 000144 00000003757 12614662573 020235 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setreuid(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESUID
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0x0);
rc = setreuid(-1, -1);
assert_int_equal(rc, 0);
rc = setreuid(0x4444, 0x5555);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = setreuid(0, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = setreuid(-1, 0);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setreuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setresuid.c 000644 001750 000144 00000013643 12614662573 020413 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setresuid(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESUID
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0);
rc = setresuid(-1, -1, -1);
assert_return_code(rc, errno);
rc = setresuid(0x4444, 0x5555, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0);
#endif
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
/* We can go back cause the suid is 0 */
rc = setresuid(0, -1, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0);
#endif
u = getuid();
assert_int_equal(u, 0);
rc = setresuid(-1, 0, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0);
rc = setresuid(0, 0x5555, 0x6666);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x6666);
#endif
/*
* The euid needs to be 0 in order to change to an
* unknown value (here 0x4444)
*/
rc = setresuid(0x5555, 0x6666, 0x4444);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x6666);
#endif
/* But we can rotate the values */
errno = 0;
rc = setresuid(0x5555, 0x6666, 0);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x6666);
assert_int_equal(cp_suid, 0);
#endif
/*
* The euid needs to be 0 in order to change to an
* unknown value (here 0x4444)
*/
rc = setresuid(0x5555, 0x6666, 0x4444);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x6666);
assert_int_equal(cp_suid, 0);
#endif
/* But we can rotate the values */
rc = setresuid(0x5555, 0, 0x6666);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0x6666);
#endif
/*
* With euid == 0 we can change to completely unrelated values.
*/
rc = setresuid(1111, 2222, 3333);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 1111);
assert_int_equal(cp_euid, 2222);
assert_int_equal(cp_suid, 3333);
#endif
rc = setresuid(0, -1, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 1111);
assert_int_equal(cp_euid, 2222);
assert_int_equal(cp_suid, 3333);
#endif
rc = setresuid(-1, 0, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 1111);
assert_int_equal(cp_euid, 2222);
assert_int_equal(cp_suid, 3333);
#endif
rc = setresuid(-1, -1, 0);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 1111);
assert_int_equal(cp_euid, 2222);
assert_int_equal(cp_suid, 3333);
#endif
/*
* We can still roate the values
*/
rc = setresuid(2222, 3333, 1111);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 2222);
assert_int_equal(cp_euid, 3333);
assert_int_equal(cp_suid, 1111);
#endif
/*
* We can still roate the values
*/
rc = setresuid(3333, 1111, 2222);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 3333);
assert_int_equal(cp_euid, 1111);
assert_int_equal(cp_suid, 2222);
#endif
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setresuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_getresuid.c 000644 001750 000144 00000001437 12614662573 020375 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_getresuid(void **state)
{
int rc;
uid_t u, ru, eu, su;
(void) state; /* unused */
rc = setresuid(0x4444, 0x5555, -1);
assert_return_code(rc, errno);
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = getresuid(&ru, &eu, &su);
assert_return_code(rc, errno);
assert_int_equal(ru, 0x4444);
assert_int_equal(eu, 0x5555);
assert_int_equal(su, 0);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_getresuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_setresuid.c 000644 001750 000144 00000002203 12614662573 022133 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#if defined(SYS_setresuid)
static void test_uwrap_syscall_setresuid(void **state)
{
long int rc;
uid_t u;
uid_t u_r, u_e, u_s;
(void) state; /* unused */
rc = syscall(SYS_setresuid, 0x4444, 0x5555, 0x6666);
assert_return_code(rc, errno);
u = getuid();
assert_int_equal(u, 0x4444);
#ifdef SYS_getresuid /* not available on Solaris */
rc = syscall(SYS_getresuid, &u_r, &u_e, &u_s);
assert_return_code(rc, errno);
assert_int_equal(u_r, u);
assert_int_equal(u_e, 0x5555);
assert_int_equal(u_s, 0x6666);
#endif
rc = syscall(SYS_setresuid, -1, 42, -1);
assert_int_equal(rc, -1);
}
#endif
int main(void) {
int rc = 0;
#if defined(SYS_setresuid) && defined(SYS_getresuid)
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall_setresuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
#endif
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_setreuid.c 000644 001750 000144 00000004244 12614662573 021757 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
static void test_uwrap_syscall_setreuid(void **state)
{
long int rc;
uid_t u;
#ifdef SYS_getresuid
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0);
u = geteuid();
assert_int_equal(u, 0);
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
rc = syscall(SYS_setreuid, -1, -1);
assert_return_code(rc, errno);
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
rc = syscall(SYS_setreuid, 0x4444, 0x5555);
assert_return_code(rc, errno);
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
#ifdef SYS_geteuid /* not available on Solaris */
assert_int_equal(u, syscall(SYS_geteuid));
#endif
rc = syscall(SYS_setreuid, -1, 0x6666);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall_setreuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_thread_sync_setreuid.c 000644 001750 000144 00000005271 12614662573 022611 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#define NUM_THREADS 10
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
struct parm {
int id;
int ready;
};
pthread_mutex_t msg_mutex = PTHREAD_MUTEX_INITIALIZER;
static void *syscall_setreuid(void *arg)
{
long int rc;
uid_t ru;
(void) arg; /* unused */
/* This load can help with revealing race conditions. */
for (ru = 0; ru < 2048; ++ru) {
uid_t ruid, euid, suid;
rc = syscall(SYS_setreuid, -1, ru);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESUID
ruid = euid = suid = -1;
rc = getresuid(&ruid, &euid, &suid);
assert_int_equal(ruid, 0);
assert_int_equal(euid, ru);
assert_int_equal(suid, ru);
#endif
ruid = getuid();
assert_int_equal(ruid, 0);
euid = geteuid();
assert_int_equal(euid, ru);
rc = syscall(SYS_setreuid, -1, 0);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESUID
ruid = euid = suid = -1;
rc = getresuid(&ruid, &euid, &suid);
assert_int_equal(ruid, 0);
assert_int_equal(euid, 0);
assert_int_equal(suid, ru);
#endif
ruid = getuid();
assert_int_equal(ruid, 0);
euid = geteuid();
assert_int_equal(euid, 0);
}
return NULL;
}
static void *sync_setreuid(void *arg)
{
struct parm *p = (struct parm *)arg;
uid_t u;
syscall_setreuid(arg);
p->ready = 1;
pthread_mutex_lock(&msg_mutex);
u = geteuid();
assert_int_equal(u, 42);
pthread_mutex_unlock(&msg_mutex);
return NULL;
}
static void test_sync_setreuid(void **state)
{
pthread_attr_t pthread_custom_attr;
pthread_t threads[NUM_THREADS];
struct parm *p;
int rc;
int i;
(void) state; /* unused */
pthread_attr_init(&pthread_custom_attr);
p = malloc(NUM_THREADS * sizeof(struct parm));
assert_non_null(p);
pthread_mutex_lock(&msg_mutex);
for (i = 0; i < NUM_THREADS; i++) {
p[i].id = i;
p[i].ready = 0;
pthread_create(&threads[i],
&pthread_custom_attr,
sync_setreuid,
(void *)&p[i]);
}
/* wait for the reads to set euid to 0 */
for (i = 0; i < NUM_THREADS; i++) {
while (p[i].ready != 1) {
sleep(1);
}
}
rc = setreuid(-1, 42);
assert_int_equal(rc, 0);
pthread_mutex_unlock(&msg_mutex);
for (i = 0; i < NUM_THREADS; i++) {
pthread_join(threads[i], NULL);
}
pthread_attr_destroy(&pthread_custom_attr);
free(p);
}
int main(void) {
int rc;
const struct CMUnitTest thread_tests[] = {
cmocka_unit_test(test_sync_setreuid),
};
rc = cmocka_run_group_tests(thread_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_setuid.c 000644 001750 000144 00000003474 12614662573 021434 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
static void test_uwrap_syscall_setuid(void **state)
{
long int rc;
uid_t u;
#if defined(HAVE_GETRESUID) || defined(SYS_getresuid)
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0);
u = geteuid();
assert_int_equal(u, 0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
rc = syscall(SYS_setuid, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
rc = syscall(SYS_setuid, 5555);
assert_return_code(rc, errno);
#ifdef SYS_getresuid
cp_ruid = cp_euid = cp_suid = -1;
rc = syscall(SYS_getresuid, &cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 5555);
assert_int_equal(cp_euid, 5555);
assert_int_equal(cp_suid, 5555);
#endif
u = getuid();
assert_int_equal(u, 5555);
assert_int_equal(u, syscall(SYS_getuid));
rc = syscall(SYS_setuid, 0);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall_setuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_glibc_thread_support.c 000644 001750 000144 00000011164 12614662574 022604 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#define NUM_THREADS 10
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
static void *uwrap_setgid_syscall(void *arg)
{
int rc;
gid_t g;
(void) arg; /* unused */
rc = syscall(SYS_setgid, 999);
assert_int_equal(rc, 0);
g = getgid();
assert_int_equal(g, 999);
return NULL;
}
static void test_sync_setgid_syscall(void **state)
{
pthread_attr_t pthread_custom_attr;
pthread_t threads[NUM_THREADS];
gid_t go, gn;
int i;
(void) state; /* unused */
pthread_attr_init(&pthread_custom_attr);
go = getgid();
for (i = 0; i < NUM_THREADS; i++) {
pthread_create(&threads[i],
&pthread_custom_attr,
uwrap_setgid_syscall,
NULL);
}
/* wait for threaads */
for (i = 0; i < NUM_THREADS; i++) {
pthread_join(threads[i], NULL);
}
gn = getgid();
assert_int_equal(gn, go);
pthread_attr_destroy(&pthread_custom_attr);
}
static void *uwrap_setgid(void *arg)
{
int rc;
(void) arg; /* unused */
rc = setgid(999);
assert_int_equal(rc, 0);
return NULL;
}
static void *uwrap_getgid(void *arg)
{
gid_t g;
(void) arg; /* unused */
g = getgid();
assert_int_equal(g, 1999);
return NULL;
}
static void test_sync_setgid(void **state)
{
pthread_attr_t pthread_custom_attr;
pthread_t threads[NUM_THREADS];
gid_t g;
int i;
int rc;
(void) state; /* unused */
pthread_attr_init(&pthread_custom_attr);
for (i = 0; i < NUM_THREADS; i++) {
pthread_create(&threads[i],
&pthread_custom_attr,
uwrap_setgid,
NULL);
}
/* wait for threaads */
for (i = 0; i < NUM_THREADS; i++) {
pthread_join(threads[i], NULL);
}
g = getgid();
assert_int_equal(g, 999);
rc = setgid(1999);
assert_int_equal(rc, 0);
pthread_create(&threads[0],
&pthread_custom_attr,
uwrap_getgid,
NULL);
pthread_join(threads[0], NULL);
g = getgid();
assert_int_equal(g, 1999);
pthread_attr_destroy(&pthread_custom_attr);
}
static void *uwrap_setgroups(void *arg)
{
gid_t glist[] = { 100, 200, 300, 400, 500 };
int rc;
(void) arg; /* unused */
rc = setgroups(ARRAY_SIZE(glist), glist);
assert_int_equal(rc, 0);
return NULL;
}
static void *uwrap_getgroups(void *arg)
{
gid_t glist[] = { 100, 200, 300, 400, 500 };
gid_t rlist[16];
int rc;
(void) arg; /* unused */
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 5);
assert_memory_equal(glist, rlist, sizeof(glist));
return NULL;
}
static void test_sync_setgroups(void **state)
{
gid_t glist[] = { 100, 200, 300, 400, 500 };
pthread_t threads[NUM_THREADS];
gid_t rlist[16];
int rc;
int i;
(void) state; /* unused */
for (i = 0; i < NUM_THREADS; i++) {
pthread_create(&threads[i],
NULL,
uwrap_setgroups,
NULL);
}
/* wait for threaads */
for (i = 0; i < NUM_THREADS; i++) {
pthread_join(threads[i], NULL);
}
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 5);
assert_memory_equal(glist, rlist, sizeof(glist));
pthread_create(&threads[0],
NULL,
uwrap_getgroups,
NULL);
pthread_join(threads[0], NULL);
}
static void *uwrap_create_thread_setgid(void *arg)
{
pthread_t thread;
signed int tmp;
gid_t g, g_a;
int rc;
tmp = *((signed int *) arg);
if (tmp >= 0) {
g_a = (gid_t) *((unsigned int *) arg);
rc = syscall(SYS_setgid, g_a);
assert_int_equal(rc, 0);
g = getgid();
assert_int_equal(g, g_a);
tmp *= -1;
rc = pthread_create(&thread,
NULL,
&uwrap_create_thread_setgid,
(void *) &tmp);
assert_int_equal(rc, 0);
pthread_join(thread, NULL);
g = getgid();
assert_int_equal(g, g_a);
} else {
tmp *= -1;
g_a = (gid_t) tmp;
g = getgid();
assert_int_equal(g, g_a);
}
pthread_exit(NULL);
}
static void test_thread_create_thread_setgid(void **state)
{
pthread_t thread;
signed int tmp = 666;
gid_t g;
int rc;
(void) state; /* unused */
rc = setgid(555);
assert_int_equal(rc, 0);
g = getgid();
assert_int_equal(g, 555);
pthread_create(&thread,
NULL,
&uwrap_create_thread_setgid,
&tmp);
pthread_join(thread, NULL);
}
int main(void) {
int rc;
const struct CMUnitTest thread_tests[] = {
cmocka_unit_test(test_sync_setgid),
cmocka_unit_test(test_sync_setgid_syscall),
cmocka_unit_test(test_sync_setgroups),
cmocka_unit_test(test_thread_create_thread_setgid),
};
rc = cmocka_run_group_tests(thread_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_thread_setuid.c 000644 001750 000144 00000003221 12614662574 021220 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
#define NUM_THREADS 10
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
static pthread_mutex_t wait_mutex = PTHREAD_MUTEX_INITIALIZER;
static pthread_mutex_t sleep_mutex = PTHREAD_MUTEX_INITIALIZER;
static void *uwrap_getuid_sync(void *arg)
{
uid_t u;
(void) arg; /* unused */
pthread_mutex_unlock(&sleep_mutex);
pthread_mutex_lock(&wait_mutex);
u = getuid();
assert_int_equal(u, 888);
return NULL;
}
static void *uwrap_setuid_sync(void *arg)
{
int rc;
(void) arg; /* unused */
rc = setuid(888);
assert_int_equal(rc, 0);
return NULL;
}
static void test_real_sync_setuid(void **state)
{
pthread_t threads[2];
uid_t u;
(void) state; /* unused */
pthread_mutex_lock(&wait_mutex);
pthread_mutex_lock(&sleep_mutex);
/* Create thread which will wait for change. */
pthread_create(&threads[0],
NULL,
uwrap_getuid_sync,
NULL);
pthread_mutex_lock(&sleep_mutex);
pthread_create(&threads[1],
NULL,
uwrap_setuid_sync,
NULL);
pthread_join(threads[1], NULL);
pthread_mutex_unlock(&wait_mutex);
pthread_join(threads[0], NULL);
u = getuid();
assert_int_equal(u, 888);
}
int main(void) {
int rc;
const struct CMUnitTest thread_tests[] = {
cmocka_unit_test(test_real_sync_setuid),
};
rc = cmocka_run_group_tests(thread_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setgid.c 000644 001750 000144 00000005664 12614662574 017670 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setgid_root(void **state)
{
int rc;
uid_t u;
gid_t g;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
g = getgid();
assert_int_equal(g, 0x0);
g = getegid();
assert_int_equal(g, 0x0);
rc = setgid(-1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setgid(5555);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 5555);
assert_int_equal(cp_egid, 5555);
assert_int_equal(cp_sgid, 5555);
#endif
g = getgid();
assert_int_equal(g, 5555);
g = getegid();
assert_int_equal(g, 5555);
rc = setgid(0);
assert_return_code(rc, errno);
}
static void test_uwrap_setgid_user(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setuid(0x5555);
assert_return_code(rc, errno);
u = getuid();
assert_int_equal(u, 0x5555);
u = geteuid();
assert_int_equal(u, 0x5555);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setgid(5555);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setgid(0);
assert_return_code(rc, errno);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setgid_root),
cmocka_unit_test(test_uwrap_setgid_user),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setegid.c 000644 001750 000144 00000006503 12614662574 020026 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setegid_root(void **state)
{
int rc;
gid_t u;
gid_t g;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
g = getgid();
assert_int_equal(g, 0x0);
g = getegid();
assert_int_equal(g, 0x0);
rc = setegid(-1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
rc = setegid(0x4444);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0x4444);
assert_int_equal(cp_sgid, 0);
#endif
g = getegid();
assert_int_equal(g, 0x4444);
rc = setegid(0);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
g = getegid();
assert_int_equal(g, 0);
rc = setegid(0x5555);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0);
#endif
g = getegid();
assert_int_equal(g, 0x5555);
rc = setegid(0);
assert_return_code(rc, errno);
}
static void test_uwrap_setegid_user(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setuid(0x5555);
assert_return_code(rc, errno);
u = getuid();
assert_int_equal(u, 0x5555);
u = geteuid();
assert_int_equal(u, 0x5555);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setegid(0x4444);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setegid(0);
assert_return_code(rc, errno);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setegid_root),
cmocka_unit_test(test_uwrap_setegid_user),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setregid.c 000644 001750 000144 00000007710 12614662574 020211 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setregid_root(void **state)
{
int rc;
uid_t u;
gid_t g;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
g = getgid();
assert_int_equal(g, 0x0);
g = getegid();
assert_int_equal(g, 0x0);
rc = setregid(-1, -1);
assert_int_equal(rc, 0);
rc = setregid(0x4444, 0x5555);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x4444);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0x5555);
#endif
g = getgid();
assert_int_equal(g, 0x4444);
g = getegid();
assert_int_equal(g, 0x5555);
rc = setregid(0, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0x5555);
#endif
rc = setregid(-1, 0);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0x5555);
#endif
rc = setgid(0);
assert_return_code(rc, errno);
rc = setegid(0);
assert_return_code(rc, errno);
#ifdef HAVE_SETRESGID
rc = setresgid(0, 0, 0);
assert_return_code(rc, errno);
#endif
}
static void test_uwrap_setregid_user(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setuid(0x5555);
assert_return_code(rc, errno);
u = getuid();
assert_int_equal(u, 0x5555);
u = geteuid();
assert_int_equal(u, 0x5555);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setregid(0x4444, 0x5555);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setregid(0, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
rc = setregid(-1, 0);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setregid_root),
cmocka_unit_test(test_uwrap_setregid_user),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setresgid.c 000644 001750 000144 00000010723 12614662574 020372 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setresgid(void **state)
{
int rc;
uid_t u;
gid_t g;
#ifdef HAVE_GETRESGID
gid_t cp_rgid, cp_egid, cp_sgid;
#endif
(void) state; /* unused */
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0);
#endif
g = getgid();
assert_int_equal(g, 0x0);
g = getegid();
assert_int_equal(g, 0x0);
rc = setresgid(-1, -1, -1);
assert_return_code(rc, errno);
rc = setresgid(0x4444, 0x5555, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x4444);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0);
#endif
g = getgid();
assert_int_equal(g, 0x4444);
g = getegid();
assert_int_equal(g, 0x5555);
/* We can go back cause the sgid is 0 */
rc = setresgid(0, -1, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0);
#endif
u = getgid();
assert_int_equal(u, 0x0);
g = getegid();
assert_int_equal(g, 0x5555);
rc = setresgid(-1, 0, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x0);
assert_int_equal(cp_sgid, 0x0);
#endif
u = getegid();
assert_int_equal(u, 0);
rc = setresgid(0, 0x5555, 0x6666);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0x6666);
#endif
/*
* The egid needs to be 0 in order to change to an
* unknown value (here 0x4444)
*/
rc = setresgid(0x5555, 0x6666, 0x4444);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0x6666);
assert_int_equal(cp_sgid, 0x4444);
#endif
errno = 0;
rc = setresgid(0x5555, 0x6666, 0);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0x6666);
assert_int_equal(cp_sgid, 0);
#endif
rc = setresgid(0x5555, 0x6666, 0x4444);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0x6666);
assert_int_equal(cp_sgid, 0x4444);
#endif
rc = setresgid(0x5555, 0, 0x6666);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0);
assert_int_equal(cp_sgid, 0x6666);
#endif
rc = setresgid(0x1111, 0x2222, 0x3333);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x1111);
assert_int_equal(cp_egid, 0x2222);
assert_int_equal(cp_sgid, 0x3333);
#endif
rc = setresgid(0, -1, -1);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESGID
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x2222);
assert_int_equal(cp_sgid, 0x3333);
#endif
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setresgid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setresgid_unprivileged.c 000644 001750 000144 00000007146 12614662574 023154 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setresgid_unprivileged_uid(void **state)
{
int rc;
gid_t cp_rgid, cp_egid, cp_sgid;
gid_t cp_ruid, cp_euid, cp_suid;
(void) state; /* unused */
rc = setresuid(0x0, 0x9999, 0x9999);
assert_return_code(rc, errno);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x0);
assert_int_equal(cp_euid, 0x9999);
assert_int_equal(cp_suid, 0x9999);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x0);
assert_int_equal(cp_sgid, 0x0);
rc = setresgid(-1, -1, -1);
assert_return_code(rc, errno);
rc = setresgid(0x4444, -1, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x0);
assert_int_equal(cp_sgid, 0x0);
rc = setresgid(-1, 0x5555, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x0);
assert_int_equal(cp_sgid, 0x0);
rc = setresgid(-1, -1, 0x6666);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x0);
assert_int_equal(cp_egid, 0x0);
assert_int_equal(cp_sgid, 0x0);
setresuid(0x0, 0x0, 0x0);
}
static void test_uwrap_setresgid_unprivileged_uid_and_gid(void **state)
{
int rc;
gid_t cp_rgid, cp_egid, cp_sgid;
gid_t cp_ruid, cp_euid, cp_suid;
(void) state; /* unused */
rc = setresgid(0x4444, 0x5555, 0x6666);
assert_return_code(rc, errno);
rc = setresuid(0x0, 0x9999, 0x9999);
assert_return_code(rc, errno);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x0);
assert_int_equal(cp_euid, 0x9999);
assert_int_equal(cp_suid, 0x9999);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x4444);
assert_int_equal(cp_egid, 0x5555);
assert_int_equal(cp_sgid, 0x6666);
rc = setresgid(0x5555, 0x6666, 0x4444);
assert_return_code(rc, errno);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0x6666);
assert_int_equal(cp_sgid, 0x4444);
rc = setresgid(0x5555, 0x4444, -1);
assert_return_code(rc, errno);
cp_rgid = cp_egid = cp_sgid = -1;
rc = getresgid(&cp_rgid, &cp_egid, &cp_sgid);
assert_return_code(rc, errno);
assert_int_equal(cp_rgid, 0x5555);
assert_int_equal(cp_egid, 0x4444);
assert_int_equal(cp_sgid, 0x4444);
rc = setresgid(0x1111, 0x2222, 0x3333);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
setresuid(0x0, 0x0, 0x0);
setresgid(0x0, 0x0, 0x0);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setresgid_unprivileged_uid),
cmocka_unit_test(test_uwrap_setresgid_unprivileged_uid_and_gid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setgroups.c 000644 001750 000144 00000002600 12614662574 020427 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ARRAY_SIZE(a) (sizeof(a)/sizeof(a[0]))
static void test_uwrap_getgroups(void **state)
{
gid_t rlist[20] = {0};
int num_groups;
int rc;
(void) state; /* unused */
num_groups = getgroups(0, NULL);
assert_int_not_equal(num_groups, -1);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, num_groups);
assert_int_equal(rlist[0], getegid());
}
static void test_uwrap_setgroups(void **state)
{
gid_t glist[] = { 100, 200, 300, 400, 500 };
gid_t rlist[16];
int rc;
(void) state; /* unused */
rc = setgroups(ARRAY_SIZE(glist), glist);
assert_int_equal(rc, 0);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 5);
assert_memory_equal(glist, rlist, sizeof(glist));
/* Drop all supplementary groups. This is often done by daemons */
memset(rlist, 0, sizeof(rlist));
rc = setgroups(0, NULL);
assert_int_equal(rc, 0);
rc = getgroups(ARRAY_SIZE(rlist), rlist);
assert_int_equal(rc, 0);
assert_int_equal(rlist[0], 0);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_getgroups),
cmocka_unit_test(test_uwrap_setgroups),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_seteuid.c 000644 001750 000144 00000004673 12614662574 020052 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_seteuid(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESUID
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0x0);
#ifndef BSD
/* BSD sets 0xFFFFFF as the UID number in this case */
rc = seteuid(-1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
#endif
u = geteuid();
assert_int_equal(u, 0x0);
rc = seteuid(0x4444);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x4444);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0x4444);
/*
* The euid needs to be 0 in order to change to an
* unknown value (here 0x5555).
*/
rc = seteuid(0x5555);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x4444);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0x4444);
rc = seteuid(0);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0);
rc = seteuid(0x5555);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0);
#endif
u = geteuid();
assert_int_equal(u, 0x5555);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_seteuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setuid.c 000644 001750 000144 00000003211 12614662574 017670 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setuid(void **state)
{
int rc;
uid_t u;
#ifdef HAVE_GETRESUID
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
#ifndef BSD
/* BSD sets 0xFFFFFF as the UID number in this case */
rc = setuid(-1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
#endif
u = getuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
rc = setuid(0x5555);
assert_int_equal(rc, 0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
u = getuid();
assert_int_equal(u, 0x5555);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = setuid(0x0);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setuid_euid1.c 000644 001750 000144 00000003574 12614662574 020773 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setuid(void **state)
{
int rc;
uid_t u;
uid_t cp_ruid, cp_euid, cp_suid;
(void) state; /* unused */
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
u = geteuid();
assert_int_equal(u, 0x0);
rc = setresuid(0x4444, 0x5555, 0x6666);
assert_int_equal(rc, 0);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x6666);
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = setuid(0x5555);
if (rc == 0) {
/* This is BSD */
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
} else {
/* This is Linux and uid_wrapper */
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
rc = setuid(0x4444);
assert_return_code(rc, errno);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x4444);
assert_int_equal(cp_suid, 0x6666);
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x4444);
}
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_setuid_euid2.c 000644 001750 000144 00000004044 12614662574 020765 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
static void test_uwrap_setuid(void **state)
{
int rc;
uid_t u;
uid_t cp_ruid, cp_euid, cp_suid;
(void) state; /* unused */
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
u = getuid();
assert_int_equal(u, 0x0);
u = geteuid();
assert_int_equal(u, 0x0);
rc = setresuid(0x4444, 0x5555, 0x6666);
assert_int_equal(rc, 0);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x6666);
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = setuid(0x5555);
if (rc == 0) {
/* This is BSD */
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
} else {
/* This is Linux and uid_wrapper */
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
}
rc = setuid(0x6666);
if (rc == -1) {
/* This is BSD */
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
} else {
assert_return_code(rc, errno);
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x4444); /* 0x6666 */
assert_int_equal(cp_euid, 0x6666);
assert_int_equal(cp_suid, 0x6666);
u = getuid();
assert_int_equal(u, 0x4444);
u = geteuid();
assert_int_equal(u, 0x6666);
}
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_setuid),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_setuid32.c 000644 001750 000144 00000003502 12614662630 021563 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include
#include
#include
#include
#include
#ifdef HAVE_SYS_SYSCALL_H
#include
#endif
#ifdef HAVE_SYSCALL_H
#include
#endif
static void test_uwrap_syscall_setuid32(void **state)
{
long int rc;
uid_t u;
#ifdef HAVE_GETRESUID
uid_t cp_ruid, cp_euid, cp_suid;
#endif
(void) state; /* unused */
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
#ifndef BSD
/* BSD sets 0xFFFFFF as the UID number in this case */
rc = syscall(SYS_setuid32, -1);
assert_int_equal(rc, -1);
assert_int_equal(errno, EINVAL);
#endif
u = getuid();
assert_int_equal(u, 0x0);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0);
assert_int_equal(cp_euid, 0);
assert_int_equal(cp_suid, 0);
#endif
rc = syscall(SYS_setuid32, 0x5555);
assert_return_code(rc, errno);
#ifdef HAVE_GETRESUID
cp_ruid = cp_euid = cp_suid = -1;
rc = getresuid(&cp_ruid, &cp_euid, &cp_suid);
assert_return_code(rc, errno);
assert_int_equal(cp_ruid, 0x5555);
assert_int_equal(cp_euid, 0x5555);
assert_int_equal(cp_suid, 0x5555);
#endif
u = getuid();
assert_int_equal(u, 0x5555);
u = geteuid();
assert_int_equal(u, 0x5555);
rc = syscall(SYS_setuid32, 0x0);
assert_int_equal(rc, -1);
assert_int_equal(errno, EPERM);
}
int main(void) {
int rc;
const struct CMUnitTest uwrap_tests[] = {
cmocka_unit_test(test_uwrap_syscall_setuid32),
};
rc = cmocka_run_group_tests(uwrap_tests, NULL, NULL);
return rc;
}
uid_wrapper-1.2.1/tests/test_syscall_setreuid32.c 000644 001750 000144 00000004242 12614662630 022114 0 ustar 00asn users 000000 000000 #include "config.h"
#include
#include
#include
#include