From dac226fd30a76537b9b1fff3910acb7b47f22a5c Mon Sep 17 00:00:00 2001 From: Theron Spiegl Date: Sun, 7 Jun 2020 17:04:20 -0500 Subject: init --- .gitignore | 58 +++++ LICENSE | 621 ++++++++++++++++++++++++++++++++++++++++++++++++++++ Makefile | 49 +++++ README.md | 70 ++++++ bin/.gitignore | 2 + notes | 22 ++ scraps/forktest.c | 24 ++ scraps/grandchild.c | 24 ++ scraps/hashdriver.c | 89 ++++++++ scraps/random.c | 20 ++ scraps/test.c | 51 +++++ scraps/threads.c | 132 +++++++++++ src/attach.c | 271 +++++++++++++++++++++++ src/hashmap.c | 193 ++++++++++++++++ src/hashmap.h | 47 ++++ src/strings.c | 54 +++++ src/strings.h | 17 ++ src/utilities.c | 230 +++++++++++++++++++ src/whatfiles.c | 342 +++++++++++++++++++++++++++++ src/whatfiles.h | 59 +++++ 20 files changed, 2375 insertions(+) create mode 100644 .gitignore create mode 100644 LICENSE create mode 100644 Makefile create mode 100644 README.md create mode 100644 bin/.gitignore create mode 100644 notes create mode 100644 scraps/forktest.c create mode 100644 scraps/grandchild.c create mode 100644 scraps/hashdriver.c create mode 100644 scraps/random.c create mode 100644 scraps/test.c create mode 100644 scraps/threads.c create mode 100644 src/attach.c create mode 100644 src/hashmap.c create mode 100644 src/hashmap.h create mode 100644 src/strings.c create mode 100644 src/strings.h create mode 100644 src/utilities.c create mode 100644 src/whatfiles.c create mode 100644 src/whatfiles.h diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..dba564b --- /dev/null +++ b/.gitignore @@ -0,0 +1,58 @@ +whatfiles1588* + +# notes +bin/* +.vscode + +# Prerequisites +*.d + +# Object files +*.o +*.ko +*.obj +*.elf + +# Linker output +*.ilk +*.map +*.exp + +# Precompiled Headers +*.gch +*.pch + +# Libraries +*.lib +*.a +*.la +*.lo + +# Shared objects (inc. Windows DLLs) +*.dll +*.so +*.so.* +*.dylib + +# Executables +*.exe +*.out +*.app +*.i*86 +*.x86_64 +*.hex + +# Debug files +*.dSYM/ +*.su +*.idb +*.pdb + +# Kernel Module Compile Results +*.mod* +*.cmd +.tmp_versions/ +modules.order +Module.symvers +Mkfile.old +dkms.conf diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..810fce6 --- /dev/null +++ b/LICENSE @@ -0,0 +1,621 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..92cc0c2 --- /dev/null +++ b/Makefile @@ -0,0 +1,49 @@ +CC = gcc +CFLAGS = -Wall +SOURCES = $(addprefix src/, whatfiles.c attach.c utilities.c hashmap.c strings.c) + +all: bin/whatfiles + +bin/whatfiles: $(SOURCES) + $(CC) $(CFLAGS) -o $@ $(SOURCES) + +# utils + +install: + cp ./bin/whatfiles /usr/local/bin/whatfiles + +clean: + -rm whatfiles15* + rm -rf bin/* + +check: bin/whatfiles bin/hashmap + valgrind --leak-check=full bin/whatfiles cal + valgrind --leak-check=full bin/hashmap + +# ignore these, just tests used during development + +scraps: bin/forktest bin/grandchild bin/threads bin/hashmap bin/random + +bin/forktest: scraps/forktest.c + $(CC) $(CFLAGS) -o $@ $^ + +bin/grandchild: scraps/grandchild.c + $(CC) $(CFLAGS) -o $@ $^ + +bin/threads: scraps/threads.c + $(CC) $(CFLAGS) -pthread -o $@ $^ + +bin/hashmap: scraps/hashdriver.c src/hashmap.c src/strings.c + $(CC) $(CFLAGS) -o $@ $^ + +bin/random: scraps/random.c + $(CC) $(CFLAGS) -o $@ $^ + + +chain: bin/whatfiles bin/forktest bin/grandchild + bin/whatfiles bin/forktest + +redo: bin/whatfiles bin/threads + -rm whatfiles15* + bin/whatfiles bin/threads a s d f + cat whatfiles* diff --git a/README.md b/README.md new file mode 100644 index 0000000..99a8132 --- /dev/null +++ b/README.md @@ -0,0 +1,70 @@ +# whatfiles +Whatfiles is a Linux utility that logs what files other programs read/write/create/delete on your system. It traces any new processes and threads that are created as well. + +## Rationale: +I've long been frustrated at the lack of a simple utility to see which files a process touches from `main()` to exit. Whether you don't trust a software vendor or are concerned about malware, it's important to be able to know what a program or installer does to your system. There's `lsof` for *nix, but it only observes a moment in time. There's `strace` for Linux and `dtruss` for Mac, but they're complicated and intimidating to many people and have a wide range of use cases. There's Process Explorer for Windows, but it only gives you slices in time also. + +## Sample output: +``` +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-clone-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-heal-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-perspective-clone-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-convolve-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-smudge-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-dodge-burn-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/tool-options/gimp-desaturate-tool, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/plug-ins, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /usr/lib/gimp/2.0/plug-ins, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /home/theron/.gimp-2.8/pluginrc, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /usr/share/locale/en_US/LC_MESSAGES/gimp20-std-plug-ins.mo, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /usr/lib/gimp/2.0/plug-ins/script-fu, syscall: openat(), PID: 8566, process: gimp +mode: read, file: /etc/ld.so.cache, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /etc/ld.so.cache, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /usr/lib/libgimpui-2.0.so.0, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /usr/lib/libgimpwidgets-2.0.so.0, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /usr/lib/libgimpwidgets-2.0.so.0, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /usr/lib/libgimp-2.0.so.0, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +mode: read, file: /usr/lib/libgimpcolor-2.0.so.0, syscall: openat(), PID: 8574, process: /usr/lib/gimp/2.0/plug-ins/script-fu +``` + +## Use: + +- basic use, launches `ls` and writes output to a log file in the current directory: + + `$ whatfiles ls -lah ~/Documents` + +- specify output file location with `-o`: + + `$ whatfiles -o MyLogFile cd ..` + +- include debug output, print to stdout rather than log file: + + `$ whatfiles -d -s apt install zoom` + +- attach to currently running process (requires root privileges): + + `$ sudo whatfiles -p 1234` + +## Compilation (requires `gcc` and `make`): +``` +$ cd whatfiles +$ make +$ sudo make install +``` + +## Questions that could be asked at some point: + +- _Isn't this just a reimplementation of `strace -fe trace=creat,open,openat,unlink,unlinkat ./program`?_ + + Yes. Though it aims to be simpler and more user friendly. + +- _Are there Mac and Windows versions?_ + + Not for the time being. Tracing syscalls on Mac requires `task_for_pid()`, which requires code signing, which I can't get to work, and anyway I have no interest in paying Apple $100/year to write free software. I would be interested in writing a version for Windows at some point but it would have to be a complete rewrite and a steep learning curve. + +## Known issues: + +- Seems to run slowly and occasionally freeze when used to launch Firefox and Chromium. (Attaching to both with `-p [PID]` once they're running works fine.) + + +Thank you for your interest, and please also check out [Cloaker](https://github.com/spieglt/cloaker), [Nestur](https://github.com/spieglt/nestur), and [Flying Carpet](https://github.com/spieglt/flyingcarpet)! diff --git a/bin/.gitignore b/bin/.gitignore new file mode 100644 index 0000000..d6b7ef3 --- /dev/null +++ b/bin/.gitignore @@ -0,0 +1,2 @@ +* +!.gitignore diff --git a/notes b/notes new file mode 100644 index 0000000..c727776 --- /dev/null +++ b/notes @@ -0,0 +1,22 @@ +https://nullprogram.com/blog/2018/06/23/ +http://man7.org/linux/man-pages/man2/ptrace.2.html +https://www.linuxjournal.com/article/6100 +https://blog.nelhage.com/2010/08/write-yourself-an-strace-in-70-lines-of-code/ +https://stackoverflow.com/questions/18577956/how-to-use-ptrace-to-get-a-consistent-view-of-multiple-threads +https://pramode.net/articles/lfy/ptrace/pramode.html + + +https://filippo.io/linux-syscall-table/ +https://blog.rchapman.org/posts/Linux_System_Call_Table_for_x86_64/ +http://man7.org/linux/man-pages/man2/syscall.2.html + +https://www.cyphar.com/blog/post/20160703-remainroot-ptrace-hell +https://stackoverflow.com/questions/13532137/tracing-syscalls-of-a-process-and-all-forked-processes +https://stackoverflow.com/questions/5477976/how-to-ptrace-a-multi-threaded-application + + +https://groups.google.com/forum/#!topic/comp.os.linux.development.system/jJVf5Y4XUwY + +mac: +https://www.spaceflint.com/?p=150 +http://os-tres.net/blog/2010/02/17/mac-os-x-and-task-for-pid-mach-call/ diff --git a/scraps/forktest.c b/scraps/forktest.c new file mode 100644 index 0000000..40ecb86 --- /dev/null +++ b/scraps/forktest.c @@ -0,0 +1,24 @@ +#include +#include +#include +#include + +int main() { + printf("forktest pid: %d\n", getpid()); + fflush(stdout); + pid_t pid = fork(); + if (pid == 0) { + printf("grandchild pid: %d\n", getpid()); + fflush(stdout); + // printf("child ppid: %d\n", getppid()); + execl("./bin/grandchild", "./bin/grandchild", (char*)0); + } + int status; + while (1) { + waitpid(pid, &status, 0); + if(WIFEXITED(status)) { + printf("grandchild exited\n"); + return 0; + } + } +} \ No newline at end of file diff --git a/scraps/grandchild.c b/scraps/grandchild.c new file mode 100644 index 0000000..1b5a36c --- /dev/null +++ b/scraps/grandchild.c @@ -0,0 +1,24 @@ +#include +#include +#include +#include + +int main() { + printf("grandchild pid: %d\n", getpid()); + fflush(stdout); + pid_t pid = fork(); + if (pid == 0) { + printf("great-grandchild pid: %d\n", getpid()); + fflush(stdout); + // printf("child ppid: %d\n", getppid()); + execl("/bin/ls", "/bin/ls", (char*)0); + } + int status; + while (1) { + waitpid(pid, &status, 0); + if(WIFEXITED(status)) { + printf("great-grandchild exited\n"); + return 0; + } + } +} \ No newline at end of file diff --git a/scraps/hashdriver.c b/scraps/hashdriver.c new file mode 100644 index 0000000..82a285f --- /dev/null +++ b/scraps/hashdriver.c @@ -0,0 +1,89 @@ +#include +#include +#include +#include +#include +#include + +#include "../src/hashmap.h" + +#define INSERT_NUM 5000 + +#define RESET(map) \ + { \ + destroy(map); \ + init_hashmap(map); \ + } + +void insert_test(HashMap map, bool with_names) { + int num = 100000; + for (int i = 0; i < num; i++) { + int r = rand(); + insert(r, 1, map); + size_t idx = 0; + find_index(r, map, &idx); + if (!map->names[idx].data && with_names) { + set_name(r, "yeah what's up", map); + } + } + printf("collisions: %d\nsteps: %d\n", DebugStats.collisions, DebugStats.steps); + printf("used: %ld\n", map->used); + // there will be duplicates so this will fail. should pass on mac which doesn't repeat randoms till MAX_RAND-1 + // assert(map->used == num); +} + +void delete_test(HashMap map) +{ + for (int i = 0; i < map->size; i++) { + if (map->keys[i]) { + remove_pid(map->keys[i], map); + } + } +} + +void memory_leak_test() +{ + struct HashMap hashmap; + HashMap m = &hashmap; + for (int i = 0; i < 5; i++) { + init_hashmap(m); + insert_test(m, true); + delete_test(m); + insert_test(m, false); + delete_test(m); + HashError err = destroy(m); + if (err) { + printf("could not destroy\n"); + exit(1); + } + } +} + +int main() +{ + srand(time(0)); + + struct HashMap m; + HashMap map = &m; + init_hashmap(map); + insert_test(map, true); + + RESET(map); + // destroy(map); + + int pids[INSERT_NUM] = {0}; + int counts[INSERT_NUM] = {0}; + for (int i = 0; i < INSERT_NUM; i++) { + pids[i] = rand(); + counts[i] = rand(); + insert(pids[i], counts[i], map); + } + for (int i = 0; i < INSERT_NUM; i++) { + size_t res = 0; + get_status(pids[i], map, &res); + assert(res == counts[i]); + } + destroy(map); + printf("done\n"); + memory_leak_test(); +} diff --git a/scraps/random.c b/scraps/random.c new file mode 100644 index 0000000..38f6aff --- /dev/null +++ b/scraps/random.c @@ -0,0 +1,20 @@ +#include +#include +#include +#include + +int main() { + size_t size = ((size_t)RAND_MAX) + 1; + char *randoms = calloc(size, sizeof(char)); + int dups = 0; + srand(time(0)); + for (int i = 0; i < RAND_MAX; i++) { + int r = rand(); + if (randoms[r]) { + // printf("duplicate at %d\n", r); + dups++; + } + randoms[r] = 1; + } + printf("duplicates: %d\n", dups); +} diff --git a/scraps/test.c b/scraps/test.c new file mode 100644 index 0000000..33c1ef3 --- /dev/null +++ b/scraps/test.c @@ -0,0 +1,51 @@ + +#include +#include +#include +#include +#include +#include "src/strings.h" + +#define SYS_ERR(msg) { \ + perror(msg); \ + exit(errno); \ + } + +void read_file(struct String *str, size_t size, FILE *file) +{ + char c; + for (size_t read = 0; read < size && (c = fgetc(file)) != EOF; read++) { + append_char(c, str); + } +} + +char read_status(pid_t pid) +{ + char path[128] = {0}; + sprintf(path, "/proc/%d/status", pid); + + struct String string = {0}; + struct String *str = &string; + + init_string(str, 4096); + FILE *h_status = fopen(path, "rb"); + read_file(str, 4096, h_status); + + // find status line, grab value after colon and spaces + regex_t regex; + int err; + regmatch_t pmatch[2]; + if (regcomp(®ex, "State:\\W+([A-Z])", REG_EXTENDED) != 0) + SYS_ERR("regex compilation error"); + err = regexec(®ex, str->data, 2, pmatch, 0); + regfree(®ex); + if (err) SYS_ERR("failed to find regex match in /proc/[PID]/status file"); + // printf("%s\n", str->data + pmatch[1].rm_so); + return *(str->data + pmatch[1].rm_so); +} + +int main() +{ + char x = read_status(2909); + printf("%c\n", x); +} diff --git a/scraps/threads.c b/scraps/threads.c new file mode 100644 index 0000000..c69a35c --- /dev/null +++ b/scraps/threads.c @@ -0,0 +1,132 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#define handle_error_en(en, msg) \ + do { errno = en; perror(msg); exit(EXIT_FAILURE); } while (0) + +#define handle_error(msg) \ + do { perror(msg); exit(EXIT_FAILURE); } while (0) + +struct thread_info { /* Used as argument to thread_start() */ + pthread_t thread_id; /* ID returned by pthread_create() */ + int thread_num; /* Application-defined thread # */ + char *argv_string; /* From command-line argument */ +}; + +/* Thread start function: display address near top of our stack, + and return upper-cased copy of argv_string */ + +static void * +thread_start(void *arg) +{ + struct thread_info *tinfo = arg; + char *uargv, *p; + + // printf("Thread %d: top of stack near %p; argv_string=%s\n", + // tinfo->thread_num, &p, tinfo->argv_string); + // fflush(stdout); + // open("./fakefile", O_WRONLY); + fopen("./fakefile", "w"); + + uargv = strdup(tinfo->argv_string); + if (uargv == NULL) + handle_error("strdup"); + + for (p = uargv; *p != '\0'; p++) + *p = toupper(*p); + + return uargv; +} + +int +main(int argc, char *argv[]) +{ + int s, tnum, opt, num_threads; + struct thread_info *tinfo; + pthread_attr_t attr; + int stack_size; + void *res; + + /* The "-s" option specifies a stack size for our threads */ + + stack_size = -1; + while ((opt = getopt(argc, argv, "s:")) != -1) { + switch (opt) { + case 's': + stack_size = strtoul(optarg, NULL, 0); + break; + + default: + fprintf(stderr, "Usage: %s [-s stack-size] arg...\n", + argv[0]); + exit(EXIT_FAILURE); + } + } + + num_threads = argc - optind; + + /* Initialize thread creation attributes */ + + s = pthread_attr_init(&attr); + if (s != 0) + handle_error_en(s, "pthread_attr_init"); + + if (stack_size > 0) { + s = pthread_attr_setstacksize(&attr, stack_size); + if (s != 0) + handle_error_en(s, "pthread_attr_setstacksize"); + } + + /* Allocate memory for pthread_create() arguments */ + + tinfo = calloc(num_threads, sizeof(struct thread_info)); + if (tinfo == NULL) + handle_error("calloc"); + + /* Create one thread for each command-line argument */ + + for (tnum = 0; tnum < num_threads; tnum++) { + tinfo[tnum].thread_num = tnum + 1; + tinfo[tnum].argv_string = argv[optind + tnum]; + + /* The pthread_create() call stores the thread ID into + corresponding element of tinfo[] */ + + s = pthread_create(&tinfo[tnum].thread_id, &attr, + &thread_start, &tinfo[tnum]); + if (s != 0) + handle_error_en(s, "pthread_create"); + } + + /* Destroy the thread attributes object, since it is no + longer needed */ + + s = pthread_attr_destroy(&attr); + if (s != 0) + handle_error_en(s, "pthread_attr_destroy"); + + /* Now join with each thread, and display its returned value */ + + for (tnum = 0; tnum < num_threads; tnum++) { + s = pthread_join(tinfo[tnum].thread_id, &res); + if (s != 0) + handle_error_en(s, "pthread_join"); + + // printf("Joined with thread %d; returned value was %s\n", + // tinfo[tnum].thread_num, (char *) res); + // free(res); /* Free memory allocated by thread */ + } + + free(tinfo); + printf("exiting threads \n"); + fflush(stdout); + exit(EXIT_SUCCESS); +} diff --git a/src/attach.c b/src/attach.c new file mode 100644 index 0000000..ebf02a8 --- /dev/null +++ b/src/attach.c @@ -0,0 +1,271 @@ +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "whatfiles.h" + +// Most of this file gratefully adapted from Nominal Animal's answer at +// https://stackoverflow.com/questions/18577956/how-to-use-ptrace-to-get-a-consistent-view-of-multiple-threads + +void read_file(struct String *str, size_t size, FILE *file) +{ + char c; + for (size_t read = 0; read < size && (c = fgetc(file)) != EOF; read++) { + append_char(c, str); + } +} + +// returns 0 if status file couldn't be read, character of status otherwise +char read_status(pid_t pid) +{ + char c = 0; + char path[128] = {0}; + sprintf(path, "/proc/%d/status", pid); + + struct String string = {0}; + struct String *str = &string; + + init_string(str, 4096); + FILE *h_status = fopen(path, "rb"); + if (!h_status) return 0; + read_file(str, 4096, h_status); + + regex_t regex; + int err; + regmatch_t pmatch[2]; + if (regcomp(®ex, "State:\\W+([A-Za-z])", REG_EXTENDED) != 0) + SYS_ERR("regex compilation error"); + err = regexec(®ex, str->data, 2, pmatch, 0); + regfree(®ex); + if (err) { + DEBUG("failed to find regex match in /proc/%d/status file\n", pid); + } else { + c = *(str->data + pmatch[1].rm_so); + } + free(str->data); + return c; +} + +void read_task(pid_t tid, struct String *str) +{ + char path[128] = {0}; + sprintf(path, "/proc/%d/comm", tid); + FILE *h_comm = fopen(path, "rb"); + if (!h_comm) { + fprintf(stderr, "tried to read nonexistent /proc/%d/comm\n", tid); + exit(1); + } + read_file(str, 4096, h_comm); + if (str->data[str->len-1] == '\n') delete_char(str); // remove newline if present +} + +int attach_to_process(pid_t pid, HashMap map) +{ + + pid_t *tid = 0; + size_t tids = 0; + size_t tids_max = 0; + size_t t; + long r, sys_err; + + // stop the process and its threads + kill(pid, SIGSTOP); + // can't wait() on a process that's not a child + while (1) { + char status = read_status(pid); + if (status == 'T' || status == 't') break; + struct timespec ts = {0, 1000000 * 250}; // quarter second + nanosleep(&ts, &ts); + DEBUG("waiting for PID %d to stop\n", pid); + } + + // get thread IDs from /proc/[PID]/task/ + tids = get_tids(&tid, &tids_max, pid); + if (!tids) + { + DEBUG("process %d has no threads\n", pid); + // kill(pid, SIGCONT); + // return 0; + } else { + DEBUG("Process %d has %d tasks\n", (int)pid, (int)tids); + } + + /* Attach to all tasks. */ + for (t = 0; t < tids; t++) { + do { + r = ptrace(PTRACE_ATTACH, tid[t], (void *)0, (void *)0); + } while (r == -1L && (errno == EBUSY || errno == EFAULT || errno == ESRCH)); + if (r == -1L) { + DEBUG("ptrace attach error\n"); + const int saved_errno = errno; + while (t-- > 0) { + do { + r = ptrace(PTRACE_DETACH, tid[t], (void *)0, (void *)0); + } while (r == -1L && (errno == EBUSY || errno == EFAULT || errno == ESRCH)); + } + tids = 0; + errno = saved_errno; + return errno; + } + // if successfully attached, add to map + insert(tid[t], 0, map); + struct String str = {0}; + init_string(&str, 4096); + read_task(tid[t], &str); + set_name(tid[t], str.data, map); + free(str.data); + } + + // set ptrace options + // register for the ptrace events we want to catch + sys_err = ptrace(PTRACE_SETOPTIONS, pid, (char*)0, PTRACE_O_TRACEFORK | PTRACE_O_TRACEVFORK | PTRACE_O_TRACECLONE | PTRACE_O_TRACEEXEC); + if (sys_err == -1) SYS_ERR("ptrace() failed to set options"); + + for (t = 0; t < tids; t++) { + sys_err = ptrace(PTRACE_SYSCALL, tid[t], 0, 0); + if (sys_err == -1) SYS_ERR("ptrace() failed to resume thread"); + } + kill(pid, SIGCONT); + return 0; +} + +// used upon exit as signal handler when whatfiles was used to attach to a process already in progress +void detatch_from_process(HashMap map) +{ + for (int i = 0; i < map->size; i++) { + pid_t pid = map->keys[i]; + if (pid) { + int r; + int counter = 0; + char status = 0; + // make sure the thread is stopped + kill(pid, SIGSTOP); + while (1) { + status = read_status(pid); + if (status == 'T' || status == 't') break; // thread stopped, due to kill(SIGSTOP) above or ptrace syscall SIGTRAP + struct timespec ts = {0, 100000000}; // 100 million nanoseconds = tenth of a second + nanosleep(&ts, &ts); + DEBUG("waiting for PID %d to stop\n", pid); + if (counter > 9) { + DEBUG("could not detatch from PID %d\n", pid); + break; + } + counter++; + } + if (counter > 9) continue; // if we weren't able to detatch from this process, move on + do { + r = ptrace(PTRACE_DETACH, pid, (void *)0, (void *)0); + } while (r == -1L && (errno == EBUSY || errno == EFAULT || errno == ESRCH)); + if (r == -1) fprintf(stderr, "error detatching from PID %d\n", pid); + else DEBUG("detatched from process %d\n", pid); + kill(pid, SIGCONT); + } + } +} + +size_t get_tids(pid_t **const listptr, size_t *const sizeptr, const pid_t pid) +{ + char dirname[64]; + DIR *dir; + pid_t *list; + size_t size, used = 0; + + // make sure we've been given non-null pointers and a valid pid + if (!listptr || !sizeptr || pid < (pid_t)1) { + errno = EINVAL; + return (size_t)0; + } + + // if sizeptr points to 0 or less, null contents of listptr and sizeptr + if (*sizeptr > 0) { + list = *listptr; + size = *sizeptr; + } else { + list = *listptr = NULL; + size = *sizeptr = 0; + } + + if (snprintf(dirname, sizeof dirname, "/proc/%d/task/", (int)pid) >= (int)sizeof dirname) { + errno = ENOTSUP; + return (size_t)0; + } + + dir = opendir(dirname); + if (!dir) { + errno = ESRCH; + return (size_t)0; + } + + while (1) { + struct dirent *ent; + int value; + char dummy; + + errno = 0; + ent = readdir(dir); + if (!ent) break; + + /* Parse TIDs. Ignore non-numeric entries. */ + if (sscanf(ent->d_name, "%d%c", &value, &dummy) != 1) continue; + + /* Ignore obviously invalid entries. */ + if (value < 1) continue; + + /* Make sure there is room for another TID. */ + if (used >= size) { + size = (used | 127) + 128; + list = realloc(list, size * sizeof list[0]); + if (!list) { + closedir(dir); + errno = ENOMEM; + return (size_t)0; + } + *listptr = list; + *sizeptr = size; + } + + /* Add to list. */ + list[used++] = (pid_t)value; + } + + if (errno) { + const int saved_errno = errno; + closedir(dir); + errno = saved_errno; + return (size_t)0; + } + if (closedir(dir)) { + errno = EIO; + return (size_t)0; + } + + /* None? */ + if (used < 1) { + errno = ESRCH; + return (size_t)0; + } + + /* Make sure there is room for a terminating (pid_t)0. */ + if (used >= size) { + size = used + 1; + list = realloc(list, size * sizeof list[0]); + if (!list) { + errno = ENOMEM; + return (size_t)0; + } + *listptr = list; + *sizeptr = size; + } + + /* Terminate list; done. */ + list[used] = (pid_t)0; + errno = 0; + return used; +} diff --git a/src/hashmap.c b/src/hashmap.c new file mode 100644 index 0000000..106c65a --- /dev/null +++ b/src/hashmap.c @@ -0,0 +1,193 @@ +#include +#include +#include +#include +#include +#include +#include +#include + +#include "hashmap.h" +#include "strings.h" + +/* +Not the best hash map. Open addressing, quadratic probing +(which doesn't seem to perform much better than linear for random int inputs), +and wastes three quarters of its space to minimize collisions. +Would benefit from separate chaining with linked lists. But good enough for now. +Also not using all of the functionality in whatfiles, but keeping so that it can +be easily modified and reused as a generic hashmap later. +*/ + +void init_hashmap(HashMap map) +{ + map->size = INITIAL_SIZE; + map->used = 0; + map->keys = calloc(INITIAL_SIZE, sizeof(pid_t)); + map->status = calloc(INITIAL_SIZE, sizeof(size_t)); + map->names = calloc(INITIAL_SIZE, sizeof(struct String)); + if (!(map->keys && map->status && map->names)) { + perror("calloc() error"); + exit(errno); + } +} + +HashError set_name(pid_t pid, char *name, HashMap map) +{ + size_t index; + HashError err = find_index(pid, map, &index); + if (err == OK) { + init_string(&map->names[index], 64); + append_str(name, strlen(name), &map->names[index]); + } + return err; +} + +// also changes status value if pid already present +HashError insert(pid_t pid, Status status, HashMap map) +{ + if (map->used >= map->size / 4) { + resize_hashmap(map); + } + size_t index = pid % map->size; + int base = 1; + int c = 0; + + while (map->keys[index] != 0) { + if (map->keys[index] == pid) { + map->status[index] = status; + return OK; + } + c++; DebugStats.steps++; + // index = (index+1) % map->size; // linear probe + index = (index + base * base) % map->size; // quadratic probe + base++; + } + + if (c) DebugStats.collisions++; + + map->keys[index] = pid; + map->status[index] = status; + map->used++; + return OK; +} + +HashError find_index(pid_t pid, HashMap map, size_t *result) +{ + size_t index = pid % map->size; + size_t start = index; + while (map->keys[index] != pid) { + index = (index + 1) % map->size; + if (index == start) { + return KEY_NOT_FOUND; + } + } + *result = index; + return OK; +} + +HashError destroy(HashMap map) +{ + if (!(map->keys && map->status && map->names)) { + return NULL_PTR_IN_MAP; + } + // this loop never fired because I had map->size = 0 at the top. I'm an idiot. + for (int i = 0; i < map->size; i++) { + if (map->names[i].data) { + free(map->names[i].data); + } + } + free(map->keys); + free(map->status); + free(map->names); + map->size = 0; + map->used = 0; + return OK; +} + +void resize_hashmap(HashMap map) +{ + pid_t *orig_pids = map->keys; + Status *orig_status = map->status; + struct String *orig_names = map->names; + size_t orig_size = map->size; + + map->used = 0; + map->size *= 2; + map->keys = calloc(map->size, sizeof(pid_t)); + map->status = calloc(map->size, sizeof(Status)); + map->names = calloc(map->size, sizeof(struct String)); + if (!(map->keys && map->status && map->names)) { + perror("calloc() error"); + exit(errno); + } + + for (int i = 0; i < orig_size; i++) { + if (!orig_pids[i]) continue; + insert(orig_pids[i], orig_status[i], map); + if (orig_names[i].data) { + set_name(orig_pids[i], orig_names[i].data, map); + free(orig_names[i].data); + } + } + free(orig_pids); + free(orig_status); + free(orig_names); +} + +HashError get_name(pid_t pid, HashMap map, struct String *name) +{ + size_t index; + HashError err = find_index(pid, map, &index); + if (err == OK) { + name = &map->names[index]; + } + return err; +} + +HashError get_status(pid_t pid, HashMap map, size_t *result) +{ + size_t idx = 0; + HashError res = find_index(pid, map, &idx); + if (res == OK) { + *result = map->status[idx]; + } + return res; +} + +HashError increment(pid_t pid, HashMap map) +{ + size_t idx = 0; + HashError res = find_index(pid, map, &idx); +