commit d6c117fce77f008779a609f3887ad89b44937278
Author: Richard Ipsum <richardipsum@vx21.xyz>
Date: Wed, 30 Sep 2020 15:01:52 +0100
Initial commit
Diffstat:
| A | COPYING | | | 674 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | Makefile | | | 33 | +++++++++++++++++++++++++++++++++ |
| A | README | | | 63 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | libsfakeroot.c | | | 282 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | sfakeroot.1 | | | 42 | ++++++++++++++++++++++++++++++++++++++++++ |
| A | sfakeroot.c | | | 733 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | sfakeroot.h | | | 86 | +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ |
| A | strlcpy.c | | | 48 | ++++++++++++++++++++++++++++++++++++++++++++++++ |
8 files changed, 1961 insertions(+), 0 deletions(-)
diff --git a/COPYING b/COPYING
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Makefile b/Makefile
@@ -0,0 +1,33 @@
+PREFIX ?= /usr/local
+
+all: libsfakeroot.so sfakeroot
+
+CFLAGS=-Wall -Wextra -Werror -pedantic -std=c99 -D_POSIX_C_SOURCE=200809L -D_DEFAULT_SOURCE -D_BSD_SOURCE -DSFAKEROOT_LIBDIR=\"$(DESTDIR)$(PREFIX)/lib\"
+LDFLAGS=-L .
+
+libsfakeroot.o: libsfakeroot.c
+ $(CC) -c -fPIC $(CFLAGS) -o $@ libsfakeroot.c
+
+strlcpy.o: strlcpy.c
+ $(CC) -c -fPIC $(CFLAGS) -o $@ strlcpy.c
+
+libsfakeroot.so: libsfakeroot.o strlcpy.o
+ $(CC) -fPIC $(CFLAGS) $(LDFLAGS) -shared -o $@ libsfakeroot.o strlcpy.o
+
+sfakeroot: sfakeroot.o strlcpy.o
+ $(CC) $(CFLAGS) $(LDFLAGS) -o $@ sfakeroot.o strlcpy.o -l sfakeroot
+
+install:
+ install sfakeroot $(DESTDIR)$(PREFIX)/bin
+ install libsfakeroot.so $(DESTDIR)$(PREFIX)/lib
+ install *.1 $(DESTDIR)$(PREFIX)/man/man1/
+
+uninstall:
+ rm -f $(DESTDIR)$(PREFIX)/bin/sfakeroot
+ rm -f $(DESTDIR)$(PREFIX)/lib/libsfakeroot.so
+ rm -f $(DESTDIR)$(PREFIX)/man/man1/sfakeroot.1
+
+clean:
+ rm -f *.o *.so sfakeroot
+
+.PHONY: all clean install uninstall
diff --git a/README b/README
@@ -0,0 +1,63 @@
+sfakeroot
+=========
+
+sfakeroot is a minimalist fakeroot[1]. It uses the same LD_PRELOAD tricks
+as fakeroot to provide an environment in which stat() and related calls
+return uid/gid 0, so that files appear to be owned by root even when they're
+not. Inside the fakeroot environment permissions can be modified as if the
+current user is root, though ownership of the underlying files is never
+really changed. Any permissions set within the fakeroot environment will
+last only for the duration of the session, once sfakeroot exits all changes
+are lost.
+
+Why?
+----
+
+sfakeroot was written because there is no OpenBSD compatible fakeroot
+equivalent, I considered porting fakeroot but it seemed too difficult.
+
+Installation
+------------
+
+To build just run:
+
+ $ make
+
+followed by (as root),
+
+ # make install
+
+to install to standard locations.
+
+You can also uninstall with (as root),
+
+ # make uninstall
+
+Contributing
+------------
+
+Please feel welcome to submit patches and bug reports via email
+to my public-inbox ~richardipsum/public-inbox@lists.sr.ht
+alternatively patches may be submitted in private using the address
+found in the git log.
+
+See https://git-send-email.io/ for details on contributing
+via email with git.
+
+The archive of my public-inbox can be found at
+https://lists.sr.ht/~richardipsum/public-inbox.
+
+Known issues
+------------
+
+Since OpenBSD's base utils are statically linked sfakeroot may be less
+useful on OpenBSD than it is on Linux, since the LD_PRELOAD tricks only
+work with dynamically linked executables. Even with dynamically linked
+executables sfakeroot may be of limited use for any programs using pledge(),
+since sfakeroot may try to make use of syscalls not specified in the pledge()
+call thereby causing sfakeroot to be terminated with SIGABRT.
+
+To make better use of sfakeroot on OpenBSD you may wish to use it with sbase[2].
+
+[1]: http://freshmeat.sourceforge.net/projects/fakeroot
+[2]: https://git.suckless.org/sbase/
diff --git a/libsfakeroot.c b/libsfakeroot.c
@@ -0,0 +1,282 @@
+/* sfakeroot
+ *
+ * Copyright © 2020 Richard Ipsum
+ *
+ * This file is part of sfakeroot.
+ *
+ * sfakeroot 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, version 3 of the License.
+ *
+ * sfakeroot 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 sfakeroot. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <fcntl.h>
+#include <unistd.h>
+#include <string.h>
+#include <errno.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include <sys/socket.h>
+#include <sys/wait.h>
+#include <sys/un.h>
+
+#include "sfakeroot.h"
+
+int sfakeroot_readwriten(int fd, char bytes[], size_t len, bool is_write)
+{
+ ssize_t n;
+ size_t remaining = len;
+
+ while (remaining > 0) {
+ n = is_write ? write(fd, bytes, remaining) : read(fd, bytes, remaining);
+ switch (n) {
+ case 0:
+ if (is_write) {
+ /* not necessarily an error if we're writing... */
+ continue;
+ }
+ fprintf(stderr, "sfakeroot: %s: data truncated, remaining: %zu\n",
+ is_write ? "write" : "read", remaining);
+ return -1;
+ case -1:
+ if (errno == EINTR) {
+ continue;
+ }
+ fprintf(stderr, "sfakeroot: %s: %s\n",
+ is_write ? "write" : "read", strerror(errno));
+ return -1;
+ default:
+ remaining -= n;
+ bytes += n;
+ }
+ }
+
+ return len - remaining;
+}
+
+int sfakeroot_recvmsg(int fd, struct sfakeroot_msg *m)
+{
+ if (sfakeroot_readwriten(fd, (char *) m, sizeof (*m), false) != sizeof (*m)) {
+ fprintf(stderr, "sfakeroot_recvmsg: error reading message\n");
+ return -1;
+ }
+
+ return 0;
+}
+
+int sfakeroot_sendmsg(int fd, struct sfakeroot_msg *m)
+{
+ if (sfakeroot_readwriten(fd, (char *) m, sizeof (*m), true) != sizeof (*m)) {
+ fprintf(stderr, "sfakeroot_sendmsg: error writing message\n");
+ return -1;
+ }
+
+ return 0;
+}
+
+static int sfakeroot__session_open_internal(bool session_expected)
+{
+ struct sockaddr_un sa = {.sun_family = AF_UNIX};
+ int sockfd;
+ socklen_t socklen;
+ char *sockpath = getenv("SFAKEROOT_SOCKET_PATH");
+
+ if (sockpath == NULL) {
+ fprintf(stderr, "environment variable SFAKEROOT_SOCKET_PATH not set!\n");
+ return -1;
+ }
+
+ sockfd = socket(AF_UNIX, SOCK_STREAM, 0);
+ if (sockfd == -1) {
+ fprintf(stderr, "socket: %s\n", strerror(errno));
+ return -1;
+ }
+
+ strlcpy(sa.sun_path, sockpath, sizeof (sa.sun_path));
+ socklen = strlen(sa.sun_path) + 1 + sizeof (sa.sun_family);
+
+ if (connect(sockfd, (struct sockaddr *) &sa, socklen) == -1) {
+ if (session_expected) {
+ fprintf(stderr, "connect: %s\n", strerror(errno));
+ }
+ return -1;
+ }
+
+ return sockfd;
+}
+
+int sfakeroot_session_open(void)
+{
+ return sfakeroot__session_open_internal(true);
+}
+
+bool sfakeroot_daemon_running(void)
+{
+ int sockfd = sfakeroot__session_open_internal(false);
+ close(sockfd);
+ return sockfd != -1;
+}
+
+static int sfakeroot__call(struct sfakeroot_msg *m)
+{
+ int sockfd;
+ char *wd;
+
+ sockfd = sfakeroot_session_open();
+ if (sockfd == -1) {
+ return -1;
+ }
+
+ if ((wd = getcwd(NULL, 0)) == NULL) {
+ return -1;
+ }
+
+ strlcpy(m->working_dir, wd, sizeof (m->working_dir));
+ free(wd);
+
+ if (sfakeroot_sendmsg(sockfd, m) == -1) {
+ return -1;
+ }
+ if (sfakeroot_recvmsg(sockfd, m) == -1) {
+ return -1;
+ }
+
+ close(sockfd);
+ errno = m->reterrno;
+ return m->retcode;
+}
+
+int chmod(const char *path, mode_t mode)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_CHMOD, .mode = mode};
+ debug("chmod %s %o\n", path, mode);
+ strlcpy(m.path, path, sizeof (m.path));
+ return sfakeroot__call(&m);
+}
+
+int chown(const char *path, uid_t uid, gid_t gid)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_CHOWN, .uid = uid, .gid = gid};
+ strlcpy(m.path, path, sizeof (m.path));
+ debug("chown: path: %s, uid: %d, gid: %d\n", path, (int) uid, (int) gid);
+ return sfakeroot__call(&m);
+}
+
+int lchown(const char *path, uid_t uid, gid_t gid)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_LCHOWN, .uid = uid, .gid = gid};
+ strlcpy(m.path, path, sizeof (m.path));
+ debug("lchown: path: %s, uid: %d, gid: %d\n", path, (int) uid, (int) gid);
+ return sfakeroot__call(&m);
+}
+
+int fchown(int fd, uid_t uid, gid_t gid)
+{
+ struct sfakeroot_msg m = {
+ .type = SFAKEROOT_MSG_FCHOWN,
+ .fd = fd,
+ .uid = uid,
+ .gid = gid
+ };
+ return sfakeroot__call(&m);
+}
+
+int fchownat(int fd, const char *path, uid_t uid, gid_t gid, int flag)
+{
+ struct sfakeroot_msg m = {
+ .type = SFAKEROOT_MSG_FCHOWNAT,
+ .fd = fd,
+ .flag = flag,
+ .uid = uid,
+ .gid = gid
+ };
+ debug("fchownat %d %s %u %u %u\n", fd, path, uid, gid, flag);
+ strlcpy(m.path, path, sizeof (m.path));
+ return sfakeroot__call(&m);
+}
+
+static int sfakeroot__stat(struct sfakeroot_msg *m, struct stat *s)
+{
+ int ret;
+ if ((ret = sfakeroot__call(m)) == -1) {
+ return -1;
+ }
+ *s = m->st;
+ return ret;
+}
+
+int stat(const char *path, struct stat *s)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_STAT};
+ debug("stat\n");
+ strlcpy(m.path, path, sizeof (m.path));
+ return sfakeroot__stat(&m, s);
+}
+
+int __xstat(int ver, const char *path, struct stat *s)
+{
+ (void) ver;
+ return stat(path, s);
+}
+
+int lstat(const char *path, struct stat *s)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_LSTAT};
+ debug("lstat\n");
+ strlcpy(m.path, path, sizeof (m.path));
+ return sfakeroot__stat(&m, s);
+}
+
+int __lxstat(int ver, const char *path, struct stat *s)
+{
+ (void) ver;
+ return lstat(path, s);
+}
+
+int fstat(int fd, struct stat *s)
+{
+ struct sfakeroot_msg m = {.type = SFAKEROOT_MSG_FSTAT, .fd = fd};
+ return sfakeroot__stat(&m, s);
+}
+
+int __fxstat(int ver, int fd, struct stat *sb)
+{
+ (void) ver;
+ return fstat(fd, sb);
+}
+
+int fstatat(int fd, const char *path, struct stat *s, int flag)
+{
+ struct sfakeroot_msg m = {
+ .type = SFAKEROOT_MSG_FSTATAT,
+ .fd = fd,
+ .flag = flag,
+ };
+ strlcpy(m.path, path, sizeof (m.path));
+ return sfakeroot__stat(&m, s);
+}
+
+#undef __xstat
+#undef __fxstat
+#undef __lxstat
+#undef __xstat64
+#undef __fxstat64
+#undef __lxstat64
+#undef _FILE_OFFSET_BITS
+
+// TODO:
+// int
+// utimes(const char *path, const struct timeval *times);
+//
+// int
+// futimes(int fd, const struct timeval *times);
diff --git a/sfakeroot.1 b/sfakeroot.1
@@ -0,0 +1,42 @@
+.Dd 2020-09-30
+.Dt sfakeroot 1
+.Sh NAME
+.Nm sfakeroot
+.Nd manipulate files with faked root privileges
+.Sh SYNOPSIS
+.Nm
+.Op Ar command
+.Sh DESCRIPTION
+.Nm
+runs
+.Ar command
+within an environment that has faked root privileges. If
+.Ar command
+is not specified then by default the shell specified by the SHELL environment
+variable is used as the command, if SHELL is unset then /bin/sh is used instead.
+.Sh OPTIONS
+.Bl -tag -width Ds
+.It Fl f Ar file
+Use
+.Ar file
+to initialise session state. On exit the session file is updated with
+the current state of the session. This can be used to preserve the session
+state between invocations of
+.Nm .
+.It Fl F Ar file
+Same as -f but exit if session cannot be loaded from
+.Ar file
+at startup.
+.El
+.Sh EXIT STATUS
+.Bl -tag -width "1-125"
+.It 126
+.Ar command
+was found but was not executable.
+.It 127
+.Ar command
+was not found.
+.El
+.Pp
+Otherwise sfakeroot returns the exit status of
+.Ar command .
diff --git a/sfakeroot.c b/sfakeroot.c
@@ -0,0 +1,733 @@
+/* sfakeroot: manipulate files faking root privileges
+ *
+ * Copyright © 2020 Richard Ipsum
+ *
+ * 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, version 3 of the License.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#include <limits.h>
+#include <dirent.h>
+#include <unistd.h>
+#include <string.h>
+#include <errno.h>
+#include <arpa/inet.h>
+#include <sys/types.h>
+#include <sys/socket.h>
+#include <sys/wait.h>
+#include <sys/un.h>
+#include <signal.h>
+
+#include "sfakeroot.h"
+
+#include <sys/syscall.h>
+
+#define FALLBACK_SHELL "/bin/sh"
+#define SONAME "libsfakeroot.so"
+
+#ifdef __linux__
+#ifndef __x86_64__
+#error "Architectures other than amd64 are not supported on Linux"
+#endif
+/*./x86_64-linux-gnu/asm/unistd_64.h:#define __NR_newfstatat 262 */
+#define SYS_fstatat 262
+#define SESSION_FILE_LINE_FMT "%lu,%u,%u,%u\n"
+#else
+#define SESSION_FILE_LINE_FMT "%llu,%u,%u,%u\n"
+#endif
+
+static char *argv0;
+
+struct sfakeroot_list {
+ struct sfakeroot_ent *first;
+ struct sfakeroot_ent *last;
+};
+
+struct sfakeroot_list ents;
+
+struct cmdline_options {
+ bool require_session_file;
+ char *session_file;
+};
+
+struct cmdline_arguments {
+ struct cmdline_options options;
+ char **args;
+ size_t args_len;
+};
+
+static void xsend(int sockfd, struct sfakeroot_msg *m)
+{
+ if (sfakeroot_sendmsg(sockfd, m) == -1) {
+ exit(1);
+ }
+}
+
+static struct sfakeroot_ent *lookupent(struct sfakeroot_list *list, ino_t st_ino)
+{
+ for (struct sfakeroot_ent *e = list->first; e != NULL; e = e->next) {
+ debug("checking st_ino %llu\n", e->st.st_ino);
+ if (e->st.st_ino == st_ino) {
+ return e;
+ }
+ }
+
+ return NULL;
+}
+
+static struct sfakeroot_ent *addent(struct sfakeroot_list *list,
+ const struct stat *s, bool stale)
+{
+ struct sfakeroot_ent *ent;
+
+ ent = malloc(sizeof (*ent));
+ if (ent == NULL) {
+ return NULL;
+ }
+
+ debug("add ent: %llu\n", s->st_ino);
+
+ ent->stale = stale;
+ ent->next = NULL;
+ ent->st = *s;
+
+ if (list->first == NULL) {
+ list->first = ent;
+ goto out;
+ }
+
+ if (list->last != NULL) {
+ list->last->next = ent;
+ }
+
+out:
+ list->last = ent;
+ return ent;
+}
+
+static int real_stat_internal(int fd, const char *path, struct stat *sb,
+ int flag, const char *working_dir, int *errno_out,
+ int sysno)
+{
+ int cwdfd, ret;
+ DIR *cwd = opendir(".");
+
+ if (cwd == NULL) {
+ *errno_out = errno;
+ return -1;
+ }
+
+ debug("chdir %s\n", working_dir);
+ cwdfd = dirfd(cwd);
+ if (chdir(working_dir) == -1) {
+ *errno_out = errno;
+ closedir(cwd);
+ return -1;
+ }
+
+ debug("do syscall\n");
+ switch (sysno) {
+ case SYS_fstatat:
+ ret = syscall(sysno, fd, path, sb, flag);
+ break;
+ case SYS_stat:
+ case SYS_lstat:
+ ret = syscall(sysno, path, sb);
+ break;
+ default:
+ ret = -1;
+ errno = EINVAL;
+ break;
+ }
+
+ *errno_out = errno;
+ fchdir(cwdfd);
+ closedir(cwd);
+ return ret;
+}
+
+static int real_stat(const char *path, struct stat *sb, bool islstat,
+ char *working_dir, int *errno_out)
+{
+ int sysno = islstat ? SYS_lstat : SYS_stat;
+ return real_stat_internal(-1, path, sb, 0, working_dir, errno_out, sysno);
+}
+
+static int real_fstatat(int fd, const char *path, struct stat *sb, int flag,
+ const char *working_dir, int *errno_out)
+{
+ return real_stat_internal(fd, path, sb, flag, working_dir,
+ errno_out, SYS_fstatat);
+}
+
+static int real_fstat(int fd, struct stat *sb, int *errno_out)
+{
+ int ret = syscall(SYS_fstat, fd, sb);
+ *errno_out = errno;
+ return ret;
+}
+
+static void handle_stat(struct sfakeroot_msg *m)
+{
+ struct sfakeroot_ent *ent;
+ int errno_sv = 0;
+
+ debug("handle_fstat\n");
+
+ switch (m->type) {
+ case SFAKEROOT_MSG_FSTAT:
+ m->retcode = real_fstat(m->fd, &m->st, &errno_sv);
+ break;
+ case SFAKEROOT_MSG_STAT:
+ case SFAKEROOT_MSG_LSTAT:
+ m->retcode = real_stat(m->path, &m->st,
+ m->type == SFAKEROOT_MSG_LSTAT,
+ m->working_dir, &errno_sv);
+ break;
+ case SFAKEROOT_MSG_FSTATAT:
+ m->retcode = real_fstatat(m->fd, m->path, &m->st, m->flag,
+ m->working_dir, &errno_sv);
+ break;
+ default:
+ debug("non stat message in handle_stat\n");
+ return;
+ }
+
+ if (m->retcode != 0) {
+ m->reterrno = errno_sv;
+ return;
+ }
+
+ if ((ent = lookupent(&ents, m->st.st_ino)) != NULL) {
+ if (ent->stale) {
+ /* update the entry with the new stat data */
+ m->st.st_uid = ent->st.st_uid;
+ m->st.st_gid = ent->st.st_gid;
+ m->st.st_mode = ent->st.st_mode;
+ ent->st = m->st;
+ ent->stale = false;
+ }
+ else {
+ m->st = ent->st;
+ }
+ if ((int) m->st.st_uid == -1) {
+ m->st.st_uid = 0;
+ }
+ if ((int) m->st.st_gid == -1) {
+ m->st.st_gid = 0;
+ }
+ return;
+ }
+
+ m->st.st_uid = 0;
+ m->st.st_gid = 0;
+}
+
+static void handle_perms_change(struct sfakeroot_msg *m)
+{
+ struct stat s;
+ int errno_sv;
+ struct sfakeroot_ent *ent;
+
+ debug("handle_perms_change: m->path: %s, m->working_dir: %s\n",
+ m->path, m->working_dir);
+
+ switch (m->type) {
+ case SFAKEROOT_MSG_LCHOWN:
+ m->retcode = real_stat(m->path, &s, true, m->working_dir, &errno_sv);
+ break;
+ case SFAKEROOT_MSG_CHOWN:
+ case SFAKEROOT_MSG_CHMOD:
+ m->retcode = real_stat(m->path, &s, false, m->working_dir, &errno_sv);
+ break;
+ case SFAKEROOT_MSG_FCHOWNAT:
+ m->retcode = real_fstatat(m->fd, m->path, &s, m->flag,
+ m->working_dir, &errno_sv);
+ break;
+ case SFAKEROOT_MSG_FCHOWN:
+ m->retcode = real_fstat(m->fd, &s, &errno_sv);
+ break;
+ default:
+ debug("non chown/chmod message in handle_perms_change\n");
+ return;
+ }
+
+ if (m->retcode == -1) {
+ debug("stat returned error\n");
+ m->reterrno = errno_sv;
+ return;
+ }
+
+ /* path exists */
+ switch (m->type) {
+ case SFAKEROOT_MSG_LCHOWN:
+ case SFAKEROOT_MSG_CHOWN:
+ case SFAKEROOT_MSG_FCHOWNAT:
+ s.st_uid = m->uid;
+ s.st_gid = m->gid;
+ break;
+ case SFAKEROOT_MSG_CHMOD:
+ s.st_mode = (s.st_mode & S_IFMT) | m->mode;
+ break;
+ default:
+ debug("non chown/chmod message in handle_perms_change\n");
+ return;
+ }
+
+ if ((ent = lookupent(&ents, s.st_ino)) != NULL) {
+ uid_t u = ent->st.st_uid;
+ gid_t g = ent->st.st_gid;
+ ent->st = s;
+ ent->st.st_uid = ((int) m->uid == -1) ? u : m->uid;
+ ent->st.st_gid = ((int) m->gid == -1) ? g : m->gid;
+ m->retcode = 0;
+ return;
+ }
+
+ s.st_uid = m->uid;
+ s.st_gid = m->gid;
+
+ if (addent(&ents, &s, false) == NULL) {
+ m->reterrno = ENOMEM;
+ m->retcode = -1;
+ return;
+ }
+
+ m->retcode = 0;
+}
+
+/* listen for new connections */
+static int sfakeroot_create_listener(const char *session_socket_path)
+{
+ static struct sockaddr_un sa = {.sun_family = AF_UNIX};
+ socklen_t sock_namelen;
+ int sock;
+
+ sock = socket(AF_UNIX, SOCK_STREAM, 0);
+ if (sock == -1) {
+ fprintf(stderr, "%s: socket: %s\n", argv0, strerror(errno));
+ exit(1);
+ }
+
+ strlcpy(sa.sun_path, session_socket_path, sizeof (sa.sun_path));
+ if (unlink(session_socket_path) == -1 && errno != ENOENT) {
+ fprintf(stderr, "%s: unlink \"%s\" failed: %s\n",
+ argv0, sa.sun_path, strerror(errno));
+ exit(1);
+ }
+
+ sock_namelen = strlen(sa.sun_path) + 1 + sizeof (sa.sun_family);
+ if (bind(sock, (struct sockaddr *) &sa, sock_namelen) == -1) {
+ fprintf(stderr, "%s: bind: %s\n", argv0, strerror(errno));
+ exit(1);
+ }
+
+ if (listen(sock, 21) == -1) {
+ fprintf(stderr, "%s: listen: %s\n", argv0, strerror(errno));
+ exit(1);
+ }
+
+ return sock;
+}
+
+static int write_session_to_file(const char *save_path)
+{
+ FILE *f = fopen(save_path, "w");
+
+ debug("write session to `%s'\n", save_path);
+
+ if (f == NULL) {
+ goto error;
+ }
+
+ for (struct sfakeroot_ent *p = ents.first; p != NULL; p = p->next) {
+ struct stat *s = &p->st;
+ if (fprintf(f, SESSION_FILE_LINE_FMT, s->st_ino, s->st_uid, s->st_gid, s->st_mode) < 0) {
+ goto error;
+ }
+ debug(SESSION_FILE_LINE_FMT, s->st_ino, s->st_uid, s->st_gid, s->st_mode);
+ }
+
+ if (fclose(f) != 0) {
+ goto error;
+ }
+
+ return 0;
+
+error:
+ fprintf(stderr, "%s: error saving session to `%s': %s\n",
+ argv0, save_path, strerror(errno));
+ return -1;
+}
+
+static int sfakeroot_finish_session(const struct cmdline_arguments *args)
+{
+ if (args->options.session_file != NULL) {
+ if (write_session_to_file(args->options.session_file) == -1) {
+ return -1;
+ }
+ }
+
+ return 0;
+}
+
+int estrtol(const char *s, long *out)
+{
+ char *e;
+
+ long n = strtol(s, &e, 10);
+
+ if (*s == '\0' || *e != '\0') {
+ fprintf(stderr, "%s: estrtol: `%s' not a number\n", argv0, s);
+ return -1;
+ }
+
+ if ((errno == ERANGE && (n == LONG_MIN || n == LONG_MAX))) {
+ fprintf(stderr, "%s: estrtol: `%s' out of range\n", argv0, s);
+ return -1;
+ }
+
+ *out = n;
+ return 0;
+}
+
+static int sfakeroot_load_session_from_file(const struct cmdline_arguments *args)
+{
+ char *line = NULL, *session_filepath;
+ size_t n = 0;
+ ssize_t count;
+ FILE *f;
+
+ session_filepath = args->options.session_file;
+ f = fopen(session_filepath, "r");
+ if (f == NULL) {
+ char *errfmt = "%s: couldn't open session file `%s': %s\n";
+ debug(errfmt, argv0, session_filepath, strerror(errno));
+ if (args->options.require_session_file) {
+ fprintf(stderr, errfmt, argv0, session_filepath, strerror(errno));
+ return -1;
+ }
+ return 0;
+ }
+
+ debug("loading session from `%s'\n", session_filepath);
+
+ while ((count = getline(&line, &n, f)) != -1) {
+ struct stat s = {0};
+ long values[4];
+ int i = 0;
+ line[count - 1] = '\0'; /* strip '\n' */
+ for (char *s = strtok(line, ","); s != NULL && i < 4; s = strtok(NULL, ","), i++) {
+ if (estrtol(s, values + i) == -1) {
+ free(line);
+ return -1;
+ }
+ }
+ s.st_ino = (ino_t) values[0];
+ s.st_uid = (uid_t) values[1];
+ s.st_gid = (gid_t) values[2];
+ s.st_mode = (mode_t) values[3];
+ addent(&ents, &s, true);
+ }
+
+ if (ferror(f)) {
+ fprintf(stderr, "%s: error reading from `%s': %s\n",
+ argv0, session_filepath, strerror(errno));
+ free(line);
+ return -1;
+ }
+
+ free(line);
+ return 0;
+}
+
+static void sfakeroot_server(int pipewfd, const char *session_socket_path,
+ const struct cmdline_arguments *args)
+{
+ static struct sockaddr_un sa;
+ int listen_sock, sock;
+ socklen_t namelen;
+
+ if (args->options.session_file != NULL) {
+ if (sfakeroot_load_session_from_file(args) == -1) {
+ exit(1);
+ }
+ }
+
+ listen_sock = sfakeroot_create_listener(session_socket_path);
+
+ /* close write end of pipe to indicate to parent process that we
+ * are now ready to accept incoming connections
+ */
+ close(pipewfd);
+
+ for (;;) {
+ struct sfakeroot_msg m;
+
+ sock = accept(listen_sock, (struct sockaddr *) &sa, &namelen);
+ if (sock == -1) {
+ fprintf(stderr, "%s: accept: %s\n", argv0, strerror(errno));
+ exit(1);
+ }
+ if (sfakeroot_recvmsg(sock, &m) == -1) {
+ fprintf(stderr, "eof?\n");
+ continue;
+ }
+
+ switch (m.type) {
+ case SFAKEROOT_MSG_FSTAT:
+ case SFAKEROOT_MSG_LSTAT:
+ case SFAKEROOT_MSG_STAT:
+ case SFAKEROOT_MSG_FSTATAT:
+ handle_stat(&m);
+ break;
+ case SFAKEROOT_MSG_CHOWN:
+ case SFAKEROOT_MSG_LCHOWN:
+ case SFAKEROOT_MSG_CHMOD:
+ // TODO: fchmod
+ // TODO: fchmodat
+ case SFAKEROOT_MSG_FCHOWN:
+ case SFAKEROOT_MSG_FCHOWNAT:
+ handle_perms_change(&m);
+ break;
+ case SFAKEROOT_MSG_FINISH:
+ if (sfakeroot_finish_session(args) == -1) {
+ exit(1);
+ }
+ exit(0);
+ }
+ xsend(sock, &m);
+ close(sock);
+ }
+}
+
+static int sfakeroot_daemon(const char *session_socket_path,
+ const struct cmdline_arguments *args)
+{
+ int pipefds[2];
+ char buf[1];
+ pid_t pid;
+ int status;
+
+ if (pipe(pipefds) == -1) {
+ fprintf(stderr, "%s: pipe: %s\n", argv0, strerror(errno));
+ return -1;
+ }
+
+ switch ((pid = fork())) {
+ case 0:
+ /* child */
+ close(pipefds[0]); /* close read end */
+ if (daemon(1, 1) == -1) {
+ fprintf(stderr, "%s: failed to daemonise: %s\n",
+ argv0, strerror(errno));
+ exit(1);
+ }
+ sfakeroot_server(pipefds[1], session_socket_path, args);
+ break;
+ case -1:
+ fprintf(stderr, "%s: fork: %s\n", argv0, strerror(errno));
+ return -1;
+ default:
+ /* parent */
+ close(pipefds[1]); /* close write end */
+ /* This read will block until the child process signals it
+ * is ready, i.e. it's ready to accept connections from us.
+ */
+ if (read(pipefds[0], buf, sizeof (buf)) == -1) {
+ fprintf(stderr, "%s: error reading from pipe: %s\n",
+ argv0, strerror(errno));
+ return -1;
+ }
+ if (waitpid(pid, &status, 0) == -1) {
+ fprintf(stderr, "%s: waitpid: %s\n", argv0, strerror(errno));
+ return -1;
+ }
+ if (!(WIFEXITED(status) && WEXITSTATUS(status) == 0)) {
+ fprintf(stderr, "%s: sfakeroot daemon unexpected condition\n",
+ argv0);
+ return -1;
+ }
+ }
+
+ return 0;
+}
+
+int sfakeroot_session_open(void);
+
+static int setenvvars(const char *session_socket_path)
+{
+ char *wd = SFAKEROOT_LIBDIR, *path = NULL;
+ size_t len;
+
+ len = snprintf(NULL, 0, "%s/%s", wd, SONAME);
+ path = malloc(len + 1);
+ if (path == NULL) {
+ goto error;
+ }
+ snprintf(path, len + 1, "%s/%s", wd, SONAME);
+
+ if (setenv("LD_PRELOAD", path, 1) == -1) {
+ goto error;
+ }
+ free(path);
+
+ if (setenv("SFAKEROOT_SOCKET_PATH", session_socket_path, 1) == -1) {
+ goto error;
+ }
+
+ return 0;
+
+error:
+ fprintf(stderr, "%s: setenv: %s\n", argv0, strerror(errno));
+ return -1;
+}
+
+static void usage(void)
+{
+ fprintf(stderr, "usage: %s [-Ff file]\n", argv0);
+}
+
+static void parse_options(int argc, char *argv[], struct cmdline_arguments *args)
+{
+ int ch;
+ extern int optind;
+ extern char *optarg;
+
+ while ((ch = getopt(argc, argv, "F:f:")) != -1) {
+ switch (ch) {
+ case 'F':
+ args->options.require_session_file = true;
+ /* fallthrough */
+ case 'f':
+ args->options.session_file = optarg;
+ break;
+ default:
+ usage();
+ exit(1);
+ }
+ }
+
+ args->args = argv + optind;
+ args->args_len = argc - optind;
+}
+
+int main(int argc, char *argv[])
+{
+ int sockfd, status, exit_status, len;
+ pid_t pid;
+ struct sfakeroot_msg m;
+ char *sargv[] = {FALLBACK_SHELL, NULL}, *shell, **exec_argvp;
+ char tempdir_path[8192] = "/tmp/sfakeroot.XXXXXXXXXX";
+ char session_socket_path[8192];
+ static struct cmdline_arguments args;
+
+ argv0 = argv[0];
+ parse_options(argc, argv, &args);
+
+ if ((shell = getenv("SHELL")) != NULL) {
+ sargv[0] = shell;
+ }
+
+ if (mkdtemp(tempdir_path) == NULL) {
+ fprintf(stderr, "%s: mkdtemp: %s\n", argv0, strerror(errno));
+ exit_status = 1;
+ goto cleanup;
+ }
+
+ len = snprintf(session_socket_path, sizeof (session_socket_path), "%s/%s",
+ tempdir_path, "uds.sock");
+ if (len == -1) {
+ fprintf(stderr, "%s: snprintf\n", argv0);
+ exit_status = 1;
+ goto cleanup;
+ }
+ else if ((size_t) len > sizeof (session_socket_path)) {
+ fprintf(stderr, "%s: path too long\n", argv0);
+ exit_status = 1;
+ goto cleanup;
+ }
+
+ if (setenvvars(session_socket_path) == -1) {
+ exit_status = 1;
+ goto cleanup;
+ }
+
+ if (!sfakeroot_daemon_running()) {
+ if (sfakeroot_daemon(session_socket_path, &args) == -1) {
+ exit_status = 1;
+ goto cleanup;
+ }
+ }
+
+ exec_argvp = args.args_len > 0 ? args.args : sargv;
+ switch (pid = fork()) {
+ case 0:
+ execvp(exec_argvp[0], exec_argvp);
+ fprintf(stderr, "%s: exec `%s': %s\n",
+ argv0, exec_argvp[0], strerror(errno));
+ switch (errno) {
+ case EACCES:
+ exit_status = 126;
+ goto cleanup;
+ case ENOENT:
+ exit_status = 127;
+ goto cleanup;
+ default:
+ exit_status = 1;
+ goto cleanup;
+ }
+ case -1:
+ fprintf(stderr, "%s: fork: %s\n", argv0, strerror(errno));
+ exit_status = 1;
+ goto cleanup;
+ default:
+ waitpid(pid, &status, 0);
+ debug("instructing daemon to finish...\n");
+ m.type = SFAKEROOT_MSG_FINISH;
+ sockfd = sfakeroot_session_open();
+ if (sockfd == -1) {
+ fprintf(stderr, "%s: failed to open session\n", argv0);
+ exit_status = 1;
+ goto cleanup;
+ }
+ if (sfakeroot_sendmsg(sockfd, &m) == -1) {
+ exit_status = 1;
+ goto cleanup;
+ }
+ close(sockfd);
+ if (WIFEXITED(status) && WEXITSTATUS(status) != 0) {
+ exit_status = WEXITSTATUS(status);
+ goto cleanup;
+ }
+ if (WIFSIGNALED(status)) {
+ exit_status = 127 + WTERMSIG(status);
+ goto cleanup;
+ }
+ else if (!(WIFEXITED(status) && WEXITSTATUS(status) == 0)) {
+ exit_status = 1;
+ goto cleanup;
+ }
+ break;
+ }
+
+ exit_status = 0;
+
+cleanup:
+ unlink(session_socket_path);
+ rmdir(tempdir_path);
+ return exit_status;
+}
diff --git a/sfakeroot.h b/sfakeroot.h
@@ -0,0 +1,86 @@
+/* sfakeroot
+ *
+ * Copyright © 2020 Richard Ipsum
+ *
+ * This file is part of sfakeroot.
+ *
+ * sfakeroot 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, version 3 of the License.
+ *
+ * sfakeroot 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 sfakeroot. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#pragma once
+
+#include <stdarg.h>
+#include <sys/stat.h>
+
+#define SOCK_PATH ".sfakeroot_socket"
+#define MAX_PATHLEN 8192
+
+static void debug(const char *fmt, ...)
+{
+#ifdef DEBUG
+ va_list ap;
+ va_start(ap, fmt);
+ vfprintf(stderr, fmt, ap);
+ va_end(ap);
+#else
+ (void) fmt;
+#endif
+}
+
+struct sfakeroot_ent {
+ struct stat st;
+ struct sfakeroot_ent *next;
+ bool stale;
+};
+
+enum sfakeroot_msg_type {
+ SFAKEROOT_MSG_STAT,
+ SFAKEROOT_MSG_LSTAT,
+ SFAKEROOT_MSG_FSTAT,
+ SFAKEROOT_MSG_FSTATAT,
+ SFAKEROOT_MSG_CHOWN,
+ SFAKEROOT_MSG_LCHOWN,
+ SFAKEROOT_MSG_FCHOWN,
+ SFAKEROOT_MSG_FCHOWNAT,
+ SFAKEROOT_MSG_CHMOD,
+ SFAKEROOT_MSG_FINISH
+};
+
+struct sfakeroot_msg {
+ /* message type */
+ enum sfakeroot_msg_type type;
+
+ /* current working directory of client process */
+ char working_dir[MAX_PATHLEN];
+
+ /* system call parameters */
+ char path[MAX_PATHLEN];
+ int fd;
+ int flag;
+ struct stat st;
+ uid_t uid;
+ gid_t gid;
+ mode_t mode;
+
+ /* system call return data */
+ int retcode;
+ int reterrno;
+};
+
+int sfakeroot_recvmsg(int fd, struct sfakeroot_msg *m);
+int sfakeroot_sendmsg(int fd, struct sfakeroot_msg *m);
+
+int sfakeroot_stat(const char *path, struct stat *s, bool lstat);
+bool sfakeroot_daemon_running(void);
+
+size_t strlcpy(char *, const char *, size_t);
diff --git a/strlcpy.c b/strlcpy.c
@@ -0,0 +1,48 @@
+/*
+ * Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
+ *
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose with or without fee is hereby granted, provided that the above
+ * copyright notice and this permission notice appear in all copies.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+ * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+ * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+ * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+ * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+
+/*
+ * Copy src to string dst of size siz. At most siz-1 characters
+ * will be copied. Always NUL terminates (unless siz == 0).
+ * Returns strlen(src); if retval >= siz, truncation occurred.
+ */
+size_t
+strlcpy(char *dst, const char *src, size_t siz)
+{
+ char *d = dst;
+ const char *s = src;
+ size_t n = siz;
+ /* Copy as many bytes as will fit */
+ if (n != 0) {
+ while (--n != 0) {
+ if ((*d++ = *s++) == '\0')
+ break;
+ }
+ }
+ /* Not enough room in dst, add NUL and traverse rest of src */
+ if (n == 0) {
+ if (siz != 0)
+ *d = '\0'; /* NUL-terminate dst */
+ while (*s++)
+ ;
+ }
+ return(s - src - 1); /* count does not include NUL */
+}
