diff options
Diffstat (limited to 'bin')
| -rw-r--r-- | bin/gpl-3.0.txt | 674 | ||||
| -rwxr-xr-x | bin/repositories-checker.py | 130 | ||||
| -rwxr-xr-x | bin/sort_repositories.py | 162 | ||||
| -rwxr-xr-x | bin/uidgid2wiki.awk | 63 | ||||
| -rwxr-xr-x | bin/update-wiki-table.py | 101 | ||||
| -rwxr-xr-x | bin/used_free_uidgids.sh | 318 |
6 files changed, 1448 insertions, 0 deletions
diff --git a/bin/gpl-3.0.txt b/bin/gpl-3.0.txt new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/bin/gpl-3.0.txt @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <https://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 <https://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 +<https://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 +<https://www.gnu.org/licenses/why-not-lgpl.html>. diff --git a/bin/repositories-checker.py b/bin/repositories-checker.py new file mode 100755 index 0000000..2810bc3 --- /dev/null +++ b/bin/repositories-checker.py @@ -0,0 +1,130 @@ +#!/usr/bin/env python3 + +""" +Copyright (C) 2022-2023 Arthur Zamarin <arthurzam@gentoo.org> + +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 <https://www.gnu.org/licenses/>. +""" + +import argparse +import sys +from http.client import HTTPSConnection +from typing import Iterable, Tuple +from urllib.parse import quote_plus + +from lxml import etree + +ok_flag = True + + +def output_xml_error(xml: etree._Element, title: str, content: str): + start = xml.sourceline + if args.github: + end = start + len(etree.tostring(xml).strip().split(b'\n')) - 1 + print(f'::error file={args.current},line={start},endLine={end},title={title}::{content}') + else: + print(f'\033[91m{args.current}:{start} - {title} - {content}\033[0m') + + global ok_flag + ok_flag = False + + +def output_xml_warning(xml: etree._Element, title: str, content: str): + start = xml.sourceline + if args.github: + end = start + len(etree.tostring(xml).strip().split()) + print(f'::warning file={args.current},line={start},endLine={end},title={title}::{content}') + else: + print(f'\033[93m{args.current}:{start} - {title} - {content}\033[0m') + + +class Overlay: + def __init__(self, xml: etree._Element): + self.xml = xml + + if (repo_name := xml.find('./name')) is not None: + self.repo_name = repo_name.text + else: + self.repo_name = '' + output_xml_error(xml, 'Missing overlay name', 'Missing tag "name" for the overlay') + + if (owner_email := xml.find('./owner/email')) is not None: + self.owner_email = owner_email.text + else: + output_xml_error(xml.find('./owner'), 'Missing owner email', 'Missing tag "email" for the overlay\'s owner') + + def check_details(self, client: HTTPSConnection): + if not getattr(self, 'owner_email', None): + return + try: + client.request("GET", f"/rest/user?names={quote_plus(self.owner_email)}") + resp = client.getresponse() + resp.read() + if resp.status != 200: + output_xml_error(self.xml.find('owner/email'), 'Unknown email', f'email address "{self.owner_email}" not found at bugzilla') + else: + print(f'\033[92m\u2713 repo="{self.repo_name}" <{self.owner_email}>\033[0m') + except Exception: + output_xml_warning(self.xml.find('owner/email'), 'Failed check against bugzilla', + f'Checking for bugzilla email [{self.owner_email}] failed') + + def __hash__(self): + return hash(self.repo_name) + + def __eq__(self, o) -> bool: + return isinstance(o, Overlay) and o.repo_name == self.repo_name + + +def read_repositories(file: str) -> Iterable[Overlay]: + return map(Overlay, etree.parse(file).findall('./repo')) + + +def check_maintainers(overlays: Iterable[Overlay]): + try: + client = HTTPSConnection('bugs.gentoo.org') + for m in overlays: + m.check_details(client) + finally: + client.close() + + +def check_sorted(curr: Tuple[Overlay, ...], adds: Iterable[Overlay]): + for addition in adds: + index = curr.index(addition) + repo_name = addition.repo_name + if index > 0 and curr[index - 1].repo_name.lower() >= repo_name.lower(): + output_xml_error(addition.xml, 'Unsorted overlay list', + f"overlay {repo_name!r} in wrong place: {repo_name!r} isn't before {curr[index - 1].repo_name!r}") + elif index + 1 < len(curr) and curr[index + 1].repo_name.lower() <= repo_name.lower(): + output_xml_error(addition.xml, 'Unsorted overlay list', + f"overlay {repo_name!r} in wrong place: {repo_name!r} isn't after {curr[index + 1].repo_name!r}") + + +if __name__ == '__main__': + parser = argparse.ArgumentParser(description='Check repositories.xml') + parser.add_argument('base', help='Original repositories.xml, pass "-" to perform full check') + parser.add_argument('current', help='Current repositories.xml') + parser.add_argument('--github', help='print errors in GitHub Actions format', action='store_true') + args = parser.parse_args() + + current = tuple(read_repositories(args.current)) + + if args.base != '-': + base = tuple(read_repositories(args.base)) + additions = frozenset(current).difference(base) + check_maintainers(additions) + check_sorted(current, additions) + else: + check_sorted(current, current) + sys.exit(int(not ok_flag)) diff --git a/bin/sort_repositories.py b/bin/sort_repositories.py new file mode 100755 index 0000000..18e512e --- /dev/null +++ b/bin/sort_repositories.py @@ -0,0 +1,162 @@ +#!/usr/bin/env python3 + +""" +This script is aimed to automate repositories.xml file formatting. +<repo> nodes are sorted by name field value as a part of the process. +python version >= 3.5 is required + +Copyright (C) 2018 Eugene Bright <eugene@bright.gdn> + +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 <https://www.gnu.org/licenses/>. +""" + +import sys +import argparse +from lxml import etree +import typing + +parser = argparse.ArgumentParser( + "Sort overlay repos list by name") +parser.add_argument( + "path", + help="path to repositories.xml") + + +def find_repositories_node( + etree: etree.ElementTree + ) -> etree.Element: + return repo_etree.xpath("/repositories")[0] + + +def find_repo_nodes( + repositories_node: etree.Element + ) -> typing.List[etree.Element]: + """ + This function is designed to work + on <repositories> node, returned + by `find_repositories_node()` function. + + """ + + return repositories_node.xpath("./repo") + + +name_xpath = etree.XPath("./name/text()") + +def extract_repo_name( + repo_node: etree.Element + ) -> str: + """ + Extract repo name from repo node. + """ + + return name_xpath(repo_node)[0] + + +def sort_repo_nodes( + repo_nodes: typing.List[etree.Element] + ) -> None: + """ + Sort nodes list by name case insensitively. + + It does work in-place on the list provided. + Python sorting algorithm is stable, + so original order must be preserved + if appropriate. + """ + + repo_nodes.sort( + key=lambda node: + extract_repo_name(node) + .lower()) + + +def reinsert_repo_nodes( + repositories_node: etree.Element, + repo_nodes: typing.List[etree.Element] + ) -> None: + """ + Remove all <repo> node from <repositories> + and reinsert them back in the order + provided in the list. + """ + + for repo_node in repo_nodes: + repositories_node.remove(repo_node) + + for repo_node in repo_nodes: + repositories_node.append(repo_node) + + +def vim_modelines_fixup( + repositories_node: etree.Element + ) -> None: + """ + Find, remove and reinsert modeline comment + to the end of the file. + """ + + vim_comments = [] + for node in repositories_node: + if ( + isinstance(node, etree._Comment) + and node.text.startswith(" vim:") + ): + vim_comments.append(node) + + for vim_comment in vim_comments: + repositories_node.remove(vim_comment) + repositories_node.append(vim_comment) + + +def format_xml( + repo_etree: etree.Element + ) -> str: + """ + Return text pretty-printed representation + of chosen XML node. + + Works best on document root as it preserves <!DOCTYPE>. + """ + + return ( + etree.tostring( + repo_etree, + xml_declaration=True, + encoding="utf-8", + pretty_print=2) + .decode()) + + +if __name__ == "__main__": + args = parser.parse_args() + + repo_file = open(args.path, "rb") + repo_etree = etree.parse( + repo_file, + etree.XMLParser(remove_blank_text=True)) + + repositories_node = find_repositories_node(repo_etree) + repo_nodes = find_repo_nodes(repositories_node) + + sort_repo_nodes(repo_nodes) + reinsert_repo_nodes( + repositories_node, + repo_nodes) + + vim_modelines_fixup(repositories_node) + + sys.stdout.write( + format_xml(repo_etree)) + diff --git a/bin/uidgid2wiki.awk b/bin/uidgid2wiki.awk new file mode 100755 index 0000000..6387e3b --- /dev/null +++ b/bin/uidgid2wiki.awk @@ -0,0 +1,63 @@ +#!/usr/bin/gawk -f +# Copyright 2019-2023 Gentoo Authors +# Distributed under the terms of the MIT license + +BEGIN { + print "<!-- DO NOT EDIT, generated automatically by uidgid2wiki.awk -->" + print "{|class=\"wikitable sortable\"" + print "! Name" + print "! data-sort-type=\"number\" | UID" + print "! data-sort-type=\"number\" | GID" + print "! Provider" + print "! class=unsortable | Notes" +} + +function md2wiki(str) { + return gensub(/\[([^\]]+)\]\(([^)]+)\)/, "[\\2 \\1]", "g", str) +} + +/^[^#]/ { + print "|-" + # name + print "| " $1 + # uid + print "| " $2 + # gid + print "| " $3 + # provider + switch ($4) { + case "baselayout": + print "| style=\"background: #cff;\" | baselayout (linux)" + break + case "baselayout-fbsd": + print "| style=\"background: #ccf;\" | baselayout (fbsd)" + break + case "acct": + printf "%s", "| style=\"background: #9fc;\" |" + if ($2 != "-") printf " %s", "[https://gitweb.gentoo.org/repo/gentoo.git/tree/acct-user/" $1 " u:" $1 "]" + if ($3 != "-") printf " %s", "[https://gitweb.gentoo.org/repo/gentoo.git/tree/acct-group/" $1 " g:" $1 "]" + print "" + break + case "requested": + print "| style=\"background: #ffe;\" | requested" + break + case "reserved": + print "| style=\"background: #fcf;\" | reserved" + break + case "user.eclass": + print "| style=\"background: #dca;\" | user.eclass" + break + case "historical": + print "| style=\"background: #fee;\" | historical" + break + default: + print "| " $4 + } + # notes + $1=$2=$3=$4="" + print gensub(/[ \t]+$/, "", 1, "| " md2wiki(substr($0, 5))) +} + +END { + print "|}" +} diff --git a/bin/update-wiki-table.py b/bin/update-wiki-table.py new file mode 100755 index 0000000..b845e7f --- /dev/null +++ b/bin/update-wiki-table.py @@ -0,0 +1,101 @@ +#!/usr/bin/env python3 + +import argparse +import os.path +import requests +import subprocess +import sys + + +def main(argv): + default_api_url = 'https://wiki.gentoo.org/api.php' + default_script_path = os.path.join(os.path.dirname(__file__), + 'uidgid2wiki.awk') + default_title = 'UID_GID_Assignment_Table' + + argp = argparse.ArgumentParser(prog=argv[0]) + argp.add_argument('--api-url', default=default_api_url, + help='URL to MediaWiki API (default: {})' + .format(default_api_url)) + argp.add_argument('-p', '--password', required=True, + help='Bot password to log in with') + argp.add_argument('--script', default=default_script_path, + help='Path to uidgid2wiki script') + argp.add_argument('--title', default=default_title, + help='Title of page to edit (default: {})' + .format(default_title)) + argp.add_argument('-u', '--username', required=True, + help='Username to log in with') + argp.add_argument('path', nargs=1, metavar='uid-gid.txt', + type=argparse.FileType('r', encoding='utf-8'), + help='UID/GID listing to process') + args = argp.parse_args(argv[1:]) + + # Get converted contents first. + with subprocess.Popen([args.script], + stdin=args.path[0], + stdout=subprocess.PIPE) as s: + page_data, _ = s.communicate() + assert s.returncode == 0 + + # MediaWiki API is just HORRIBLE! Editing a page requires obtaining + # a login token, logging in, obtaining a CSRF (!) token + # and apparently preserving cookies as well! + with requests.Session() as s: + # get login token + params = { + 'action': 'query', + 'meta': 'tokens', + 'type': 'login', + 'format': 'json', + } + with s.get(args.api_url, params=params) as r: + token = r.json()['query']['tokens']['logintoken'] + + # log in + params = { + 'action': 'login', + 'lgname': args.username, + 'lgpassword': args.password, + 'lgtoken': token, + 'format': 'json', + } + with s.post(args.api_url, data=params) as r: + assert r.json()['login']['result'] == 'Success', r.json() + + # get CSRF token (wtf?!) + params = { + 'action': 'query', + 'meta': 'tokens', + 'format': 'json', + } + with s.get(args.api_url, params=params) as r: + token = r.json()['query']['tokens']['csrftoken'] + + # edit page (finally) + params = { + 'action': 'edit', + 'title': args.title, + 'token': token, + 'format': 'json', + 'text': page_data, + 'summary': 'Automatic update from uid-gid.txt', + 'bot': True, + } + with s.post(args.api_url, data=params) as r: + assert 'error' not in r.json(), r.json() + print(r.json()) + + # logout + params = { + 'action': 'logout', + 'token': token, + } + with s.get(args.api_url, params=params) as r: + pass + + return 0 + + +if __name__ == '__main__': + sys.exit(main(sys.argv)) diff --git a/bin/used_free_uidgids.sh b/bin/used_free_uidgids.sh new file mode 100755 index 0000000..dae2517 --- /dev/null +++ b/bin/used_free_uidgids.sh @@ -0,0 +1,318 @@ +#! /bin/bash +# +# Copyright 2021 Gentoo Authors +# Distributed under the terms of the GNU General Public License v2 +# +# Author: Jaco Kroon <jaco@uls.co.za> +# So that you can contact me if you need help with the below insanity. +# +# Configuration options: +# selection_ranges => an array of start-stop values. There is an assumption of +# incremental ordering, ie, start values should be in incrementing order, and +# debug => if non-zero outputs some cryptic debug output (will inherit from environment). +# +selection_ranges=( + 499-101 + 500-749 + #60001-60999 +) +debug=${debug:+1} # set non-zero to enable debug output. + +# +# Basic Design: +# +# There is nothing beautiful about this script, it's downright nasty and I +# (Jaco Kroon <jaco@uls.co.za>) will be the first to admit that. +# +# For each of the uid and gid ranges, we primarily keep two variables. +# ranges and reason. reason is simply one of USED or RESERVED. Free ranges +# are not mapped into these arrays. +# ranges_ maps a start index onto an end index. So for example, let's say +# uid range 0..10 is USED (allocated, for whatever purposes): +# +# ranges_uid[0]=10 +# reasons_uid[0]=USED +# +# The above says that UID 0 to 10 is USED. +# +# We start with an initially empty set, and then insert into, either merging or +# potentially splitting as we go, by way of the consume function, once completed +# we compact some things and then output. +# + +ranges_uid=() +ranges_gid=() +reason_uid=() +reason_gid=() + +# Colours to be used if output is a TTY. +colour_USED="\e[0;91m" # brightred +colour_FREE="\e[0;92m" # brightgreen +colour_RESERVED="\e[0;94m" # brightblue +colour_RESET="\e[0m" # reset all styles. + +if ! [[ -t 1 ]]; then + colour_USED= + colour_FREE= + colour_RESERVED= + colour_RESET= +fi + +# Find input file if not piped in on stdin, or show a warning about it on +# stderr if we can't find the file. +if [[ -t 0 ]]; then + def_infile="$(dirname "$0")/../files/uid-gid.txt" + if ! [[ -r "${def_infile}" ]] || ! exec <"${def_infile}"; then + echo "Reading from stdin (which happens to be a tty, you should pipe input file to stdin)" >&2 + fi +fi + +consume() +{ + # The basic principle here is that we can either add a new range, or split + # an existing range. Partial overlaps not dealt with, nor range + # extensions. Which would (I believe) negate the need for compact. + # TODO: deal with range merging here, eg, if we have 0..10, and adding 11, then + # we can simply adjust the range to 0..11, for example. + local variant="$1" + local ids="$2" + local type=$([[ "$3" == reserved ]] && echo RESERVED || echo USED) + local range_start="${ids%..*}" + local range_end="${ids#*..}" + declare -n ranges="ranges_${variant}" + declare -n reasons="reason_${variant}" + + [[ -z "${ids}" ]] && return + [[ "${ids}" == - ]] && return + + for k in "${!ranges[@]}"; do + # can the new range be inserted before the next range already in the set? + [[ ${k} -gt ${range_end} ]] && break + [[ ${ranges[k]} -lt ${range_start} ]] && continue + if [[ ${k} -le ${range_start} && ${range_end} -le ${ranges[k]} ]]; then + # new range is contained completely inside. + [[ ${reasons[k]} == ${type} ]] && return # same type. + [[ ${type} == RESERVED ]] && return # USED takes precedence over RESERVED. + + if [[ ${range_end} -lt ${ranges[k]} ]]; then + ranges[range_end+1]=${ranges[k]} + reasons[range_end+1]=${reasons[k]} + fi + [[ ${range_start} -gt ${k} ]] && ranges[k]=$(( range_start - 1 )) + break + else + echo "${range_start}..${range_end} (${type}) overlaps with ${k}..${ranges[k]} (${reasons[k]}" + echo "Cannot handle partial overlap." + exit 1 + fi + done + + ranges[range_start]="${range_end}" + reasons[range_start]="${type}" +} + +compact() +{ + # This simply coalesces ranges that follow directly on each other. In + # other words, if range ends at 10 and the next range starts at 11, just + # merge the two by adjusting the end of the first range, and removing the + # immediately following. + # Param: uid or gid to determine which set we're working with. + declare -n ranges="ranges_$1" + declare -n reasons="reason_$1" + local k e ne + for k in "${ranges[@]}"; do + [[ -n "${ranges[k]:+set}" ]] || continue + e=${ranges[k]} + while [[ -n "${ranges[e+1]:+set}" && "${reasons[k]}" == "${reasons[e+1]}" ]]; do + ne=${ranges[e+1]} + unset "ranges[e+1]" + e=${ne} + done + ranges[k]=${e} + done +} + +output() +{ + # Outputs the raw list as provided (param: uid or gid) + declare -n ranges="ranges_$1" + declare -n reasons="reason_$1" + local k c=0 + + echo "$1 list:" + for k in "${!ranges[@]}"; do + echo "$(( c++ )): ${k} => ${ranges[k]} / ${reasons[k]}" + done +} + +# Read the input file which is structured as "username uid gid provider and +# potentially more stuff" Lines starting with # are comments, thus we can +# filter those out. +while read un uid gid provider rest; do + [[ "${un}" == \#* ]] && continue + consume uid "${uid}" "${provider}" + consume gid "${gid}" "${provider}" +done + +compact uid +compact gid + +# If we're debugging, just output both lists so we can inspect that everything is correct here. +if [[ -n "${debug}" ]]; then + output uid + output gid +fi + +# Get the various range starts. +uids=("${!ranges_uid[@]}") +gids=("${!ranges_gid[@]}") + +# Set max to 2^32-1 if set to -. +if [[ ${max} == - ]]; then + max=$((2 ** 32 - 1)) +fi + +ui=0 # index into uids array. +gi=0 # index into gids array. + +free_total_uid=0 +free_total_gid=0 +free_total_pair=0 + +for r in "${selection_ranges[@]}"; do + min=${r%-*} # "start" of range about to be output. + max=${r#*-} # "end" of range about to be output. + selection=min + if [[ $max -lt $min ]]; then + selection=max + t=${max} + max=${min} + min=${t} + fi + + freeuid=0 # count number of free UIDs + freegid=0 # count number of free GIDs + freepair=0 # count number of free UID+GID pairs. + + echo "Range: ${min}..${max} (${selection})" + printf "%-*s%10s%10s\n" $(( ${#max} * 2 + 5 )) "#ID" UID GID + + idbase=${min} + while [[ ${idbase} -le ${max} ]]; do + # skip over uid and gid ranges that we're no longer interested in (end of range is + # lower than start of output range). + while [[ ${ui} -lt ${#uids[@]} && ${ranges_uid[uids[ui]]} -lt ${idbase} ]]; do + (( ui++ )) + done + while [[ ${gi} -lt ${#gids[@]} && ${ranges_gid[gids[gi]]} -lt ${idbase} ]]; do + (( gi++ )) + done + # Assume that range we're going to output is the remainder of the legal + # space we're interested in, and then adjust downwards as needed. For each + # of the UID and GID space, if the start range is beyond the current output + # start we're looking at a FREE range, so downward adjust re (range end) to + # the next non-FREE range's start - 1, or if we're in the non-FREE range, + # adjust downward to that range's end. + re=${max} + uid_start=-1 + gid_start=-1 + if [[ ${ui} -lt ${#uids[@]} ]]; then + uid_start=${uids[ui]} + if [[ ${uid_start} -gt ${idbase} && ${uid_start} -le ${re} ]]; then + re=$(( ${uid_start} - 1 )) + fi + if [[ ${ranges_uid[uid_start]} -lt ${re} ]]; then + re=${ranges_uid[uid_start]} + fi + fi + if [[ ${gi} -lt ${#gids[@]} ]]; then + gid_start=${gids[gi]} + if [[ ${gid_start} -gt ${idbase} && ${gid_start} -le ${re} ]]; then + re=$(( ${gid_start} - 1 )) + fi + if [[ ${ranges_gid[gid_start]} -lt ${re} ]]; then + re=${ranges_gid[gid_start]} + fi + fi + + # If we're debugging, just dump various variables above, which allows + # validating that the above logic works correctly. + [[ -n "${debug}" ]] && echo "ui=${ui} (${uid_start}..${ranges_uid[uid_start]}), gi=${gi} (${gid_start}..${ranges_gid[gid_start]}), idbase=${idbase}, re=${re}" + + # Determine the state of the UID and GID ranges. + if [[ ${ui} -lt ${#uids[@]} && ${uid_start} -le ${idbase} ]]; then + uidstate="${reason_uid[uid_start]}" + else + uidstate=FREE + freeuid=$(( freeuid + re - idbase + 1 )) + fi + + if [[ ${gi} -lt ${#gids[@]} && ${gid_start} -le ${idbase} ]]; then + gidstate="${reason_gid[gids[gi]]}" + else + gidstate=FREE + freegid=$(( freegid + re - idbase + 1 )) + fi + + # If the ranges are FREE (or at least one of), adjust selection recommendations + # accordingly. + if [[ "${gidstate}" == FREE ]]; then + if [[ "${uidstate}" == FREE ]]; then + case "${selection}" in + min) + [[ -z "${uidgidboth}" ]] && uidgidboth=${idbase} + ;; + max) + [[ -z "${uidgidboth}" || ${uidgidboth} -ge ${min} ]] && uidgidboth=${re} + ;; + esac + freepair=$(( freepair + re - idbase + 1 )) + else + case "${selection}" in + min) + [[ -z "${gidonly}" ]] && gidonly=${idbase} + ;; + max) + [[ -z "${gidonly}" || ${gidonly} -ge ${min} ]] && gidonly=${re} + ;; + esac + fi + elif [[ "${uidstate}" == FREE ]]; then + case "${selection}" in + min) + [[ -z "${uidonly}" ]] && uidonly=${idbase} + ;; + max) + [[ -z "${uidonly}" || ${uidonly} -ge ${min} ]] && uidonly=${re} + ;; + esac + fi + + vn="colour_${uidstate}" + colour_uid="${!vn}" + vn="colour_${gidstate}" + colour_gid="${!vn}" + printf "%-*s${colour_uid}%10s${colour_gid}%10s${colour_RESET}\n" $(( ${#max} * 2 + 5 )) "${idbase}$([[ ${re} -gt ${idbase} ]] && echo "..${re}")" "${uidstate}" "${gidstate}" + idbase=$(( re + 1 )) + done + echo "Range Free UIDs: ${freeuid}" + echo "Range Free GIDs: ${freegid}" + echo "Range Free UID+GID pairs: ${freepair}" + echo + (( free_total_uid += freeuid )) + (( free_total_gid += freegid )) + (( free_total_pair += freepair )) +done + +echo "Free UIDs: ${free_total_uid}" +echo "Free GIDs: ${free_total_gid}" +echo "Free UID+GID pairs: ${free_total_pair}" +echo + +for out in "Recommended GID only: ${gidonly:-${uidgidboth:-none}}" \ + "Recommended UID only: ${uidonly:-${uidgidboth:-none}}" \ + "Recommended UID+GID pair: ${uidgidboth:-none}"; do + [[ ${out} == *none ]] && colour=${colour_USED} || colour=${colour_FREE} + echo -e "${out%%: *}: ${colour}${out#*: }${colour_RESET}" +done |