[
{
"path": ".application/zps.desktop",
"content": "[Desktop Entry]\nType=Application\nName=zps\nComment=A small utility for listing and reaping zombie processes.\nExec=zps\nIcon=utilities-system-monitor\nTerminal=true\nCategories=System;Monitor;ConsoleOnly;\nNoDisplay=true\n"
},
{
"path": ".clang-format",
"content": "---\nAccessModifierOffset: -4\nAlignAfterOpenBracket: Align\nAlignArrayOfStructures: Right\nAlignConsecutiveAssignments: true\nAlignConsecutiveDeclarations: false\nAlignConsecutiveMacros: true\nAlignEscapedNewlines: Left\nAlignOperands: true\nAlignTrailingComments: false\nAllowAllParametersOfDeclarationOnNextLine: false\nAllowShortBlocksOnASingleLine: false\nAllowShortCaseLabelsOnASingleLine: false\nAllowShortFunctionsOnASingleLine: None\nAllowShortIfStatementsOnASingleLine: false\nAllowShortLoopsOnASingleLine: false\nAlwaysBreakAfterDefinitionReturnType: None\nAlwaysBreakAfterReturnType: None\nAlwaysBreakBeforeMultilineStrings: false\nAlwaysBreakTemplateDeclarations: false\nBinPackArguments: true\nBinPackParameters: true\nBraceWrapping:\n AfterClass: false\n AfterControlStatement: false\n AfterEnum: false\n AfterFunction: true\n AfterNamespace: true\n AfterObjCDeclaration: false\n AfterStruct: false\n AfterUnion: false\n AfterExternBlock: false\n BeforeCatch: false\n BeforeElse: false\n IndentBraces: false\n SplitEmptyFunction: true\n SplitEmptyRecord: true\n SplitEmptyNamespace: true\nBreakBeforeBinaryOperators: None\nBreakBeforeBraces: Custom\nBreakBeforeInheritanceComma: false\nBreakBeforeTernaryOperators: false\nBreakConstructorInitializersBeforeComma: false\nBreakConstructorInitializers: BeforeComma\nBreakAfterJavaFieldAnnotations: false\nBreakStringLiterals: false\nColumnLimit: 80\nCommentPragmas: '^ IWYU pragma:'\nCompactNamespaces: false\nConstructorInitializerAllOnOneLineOrOnePerLine: false\nConstructorInitializerIndentWidth: 4\nContinuationIndentWidth: 4\nCpp11BracedListStyle: true\nDerivePointerAlignment: false\nDisableFormat: false\nExperimentalAutoDetectBinPacking: false\nFixNamespaceComments: false\nIncludeBlocks: Preserve\nIncludeCategories:\n - Regex: '.*'\n Priority: 1\nIncludeIsMainRegex: '(Test)?$'\nIndentCaseLabels: false\nIndentGotoLabels: false\nIndentPPDirectives: None\nIndentWidth: 4\nIndentWrappedFunctionNames: false\nJavaScriptQuotes: Leave\nJavaScriptWrapImports: true\nKeepEmptyLinesAtTheStartOfBlocks: false\nMacroBlockBegin: ''\nMacroBlockEnd: ''\nMaxEmptyLinesToKeep: 1\nNamespaceIndentation: None\nObjCBinPackProtocolList: Auto\nObjCBlockIndentWidth: 4\nObjCSpaceAfterProperty: true\nObjCSpaceBeforeProtocolList: true\nPenaltyBreakAssignment: 10\nPenaltyBreakBeforeFirstCallParameter: 30\nPenaltyBreakComment: 10\nPenaltyBreakFirstLessLess: 0\nPenaltyBreakString: 10\nPenaltyExcessCharacter: 100\nPenaltyReturnTypeOnItsOwnLine: 60\nPointerAlignment: Right\nReflowComments: false\nSortIncludes: false\nSortUsingDeclarations: false\nSpaceAfterCStyleCast: false\nSpaceAfterTemplateKeyword: true\nSpaceBeforeAssignmentOperators: true\nSpaceBeforeCtorInitializerColon: true\nSpaceBeforeInheritanceColon: true\nSpaceBeforeParens: ControlStatementsExceptForEachMacros\nSpaceBeforeRangeBasedForLoopColon: true\nSpaceInEmptyParentheses: false\nSpacesBeforeTrailingComments: 1\nSpacesInAngles: false\nSpacesInContainerLiterals: false\nSpacesInCStyleCastParentheses: false\nSpacesInParentheses: false\nSpacesInSquareBrackets: false\nStandard: Auto\nTabWidth: 4\nUseTab: Never\n...\n"
},
{
"path": ".github/FUNDING.yml",
"content": "github: orhun\npatreon: orhunp\ncustom: [\"https://www.buymeacoffee.com/orhun\"]\n"
},
{
"path": ".github/workflows/ci.yml",
"content": "name: Continuous Integration\n\non:\n push:\n branches:\n - master\n pull_request:\n branches:\n - master\n\njobs:\n build:\n name: Build & Test\n runs-on: ubuntu-latest\n steps:\n - name: Checkout\n uses: actions/checkout@v3\n - name: Run tests\n shell: bash\n run: ./test.sh\n working-directory: scripts\n env:\n UPLOAD: true\n"
},
{
"path": ".github/workflows/docker.yml",
"content": "name: Docker Automated Builds\n\non:\n push:\n branches:\n - master\n tags:\n - '*'\n pull_request:\n branches:\n - master\n\njobs:\n docker:\n name: Docker Build and Push\n runs-on: ubuntu-latest\n steps:\n - name: Checkout\n uses: actions/checkout@v3\n\n - name: Docker meta\n id: meta\n uses: docker/metadata-action@v3\n with:\n images: |\n orhunp/zps\n ghcr.io/${{ github.repository_owner }}/zps\n tags: |\n type=schedule\n type=ref,event=branch\n type=ref,event=pr\n type=sha\n type=raw,value=latest\n type=semver,pattern={{version}}\n\n - name: Set up QEMU\n uses: docker/setup-qemu-action@v1\n with:\n platforms: arm64\n\n - name: Set up Docker Buildx\n id: buildx\n uses: docker/setup-buildx-action@v1\n\n - name: Cache Docker layers\n uses: actions/cache@v2\n with:\n path: /tmp/.buildx-cache\n key: ${{ runner.os }}-buildx-${{ github.sha }}\n restore-keys: |\n ${{ runner.os }}-buildx-\n\n - name: Login to Docker Hub\n if: github.event_name != 'pull_request'\n uses: docker/login-action@v1\n with:\n username: orhunp\n password: ${{ secrets.DOCKER_HUB_ACCESS_TOKEN }}\n\n - name: Login to GHCR\n if: github.event_name != 'pull_request'\n uses: docker/login-action@v1\n with:\n registry: ghcr.io\n username: ${{ github.repository_owner }}\n password: ${{ secrets.GITHUB_TOKEN }}\n\n - name: Build and push\n id: docker_build\n uses: docker/build-push-action@v2\n with:\n context: ./\n file: ./docker/Dockerfile\n platforms: linux/amd64,linux/arm64\n builder: ${{ steps.buildx.outputs.name }}\n push: ${{ github.event_name != 'pull_request' }}\n tags: ${{ steps.meta.outputs.tags }}\n labels: ${{ steps.meta.outputs.labels }}\n cache-from: type=local,src=/tmp/.buildx-cache\n cache-to: type=local,dest=/tmp/.buildx-cache\n\n - name: Image digest\n run: echo ${{ steps.docker_build.outputs.digest }}\n"
},
{
"path": ".gitignore",
"content": "### C ###\n# Prerequisites\n*.d\n\n# Object files\n*.o\n*.ko\n*.obj\n*.elf\n\n# Linker output\n*.ilk\n*.map\n*.exp\n\n# Precompiled Headers\n*.gch\n*.pch\n\n# Libraries\n*.lib\n*.a\n*.la\n*.lo\n\n# Shared objects (inc. Windows DLLs)\n*.dll\n*.so\n*.so.*\n*.dylib\n\n# Executables\n*.exe\n*.out\n*.app\n*.i*86\n*.x86_64\n*.hex\n\n# Debug files\n*.dSYM/\n*.su\n*.idb\n*.pdb\n\n# Kernel Module Compile Results\n*.mod*\n*.cmd\n.tmp_versions/\nmodules.order\nModule.symvers\nMkfile.old\ndkms.conf\n\n# Build directory\nbuild/*\n"
},
{
"path": "CMakeLists.txt",
"content": "# CMake minimum required: 3.15\ncmake_minimum_required(VERSION 3.15)\n# Project information\nproject(zps C)\n# Target\nset(TARGET \"zps\")\n# Add project source\nadd_executable(${TARGET})\ntarget_sources(${TARGET} PRIVATE src/${TARGET}.c src/${TARGET}.h)\n# Compile options\ntarget_compile_options(${TARGET} PRIVATE -s -O3 -Wall -Wextra -pedantic)\ntarget_compile_definitions(${TARGET} PRIVATE NDEBUG)\n# Install\ninstall(TARGETS ${TARGET} RUNTIME DESTINATION bin)\n"
},
{
"path": "LICENSE",
"content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nstate the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n \n Copyright (C) \n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\nAlso add information on how to contact you by electronic and paper mail.\n\n If the program does terminal interaction, make it output a short\nnotice like this when it starts in an interactive mode:\n\n Copyright (C) \n This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, your program's commands\nmight be different; for a GUI interface, you would use an \"about box\".\n\n You should also get your employer (if you work as a programmer) or school,\nif any, to sign a \"copyright disclaimer\" for the program, if necessary.\nFor more information on this, and how to apply and follow the GNU GPL, see\n.\n\n The GNU General Public License does not permit incorporating your program\ninto proprietary programs. If your program is a subroutine library, you\nmay consider it more useful to permit linking proprietary applications with\nthe library. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License. But first, please read\n.\n"
},
{
"path": "Makefile",
"content": "# Project and compiler information\nNAME := zps\nCFLAGS := -s -O3 -Wall -Wextra -pedantic -DNDEBUG\nifeq ($(CC),)\n CC := gcc\nendif\nall: clean build\n# Build the project\nbuild:\n\tmkdir -p build\n\t$(CC) $(CFLAGS) src/$(NAME).c -o build/$(NAME)\n\tcp -prf .application/$(NAME).desktop build/$(NAME).desktop\n# Make the installation\ninstall:\n\t# Create directories if doesn't exist\n\tmkdir -p $(TARGET)/usr/bin\n\tmkdir -p $(TARGET)/usr/share/applications\n\t# Install\n\tinstall build/$(NAME) $(TARGET)/usr/bin/$(NAME)\n\tinstall build/$(NAME).desktop $(TARGET)/usr/share/applications/$(NAME).desktop\n# Clean\nclean:\n\trm -rf build\n\n.PHONY: all build install clean\n"
},
{
"path": "README.md",
"content": "\n\n# zps [](https://github.com/orhun/zps/releases)\n\n### A small utility for listing and reaping zombie processes on GNU/Linux.\n\n\n\n[](https://github.com/orhun/zps/actions?query=workflow%3A%22Continuous+Integration%22)\n[](https://github.com/orhun/zps/actions?query=workflow%3A%22Docker+Automated+Builds%22)\n[](https://www.codacy.com/manual/orhun/zps?utm_source=github.com&utm_medium=referral&utm_content=orhun/zps&utm_campaign=Badge_Grade)\n[](https://codecov.io/gh/orhun/zps)\n[](https://github.com/orhun/zps/stargazers) [](./LICENSE)\n\nOn Unix and Unix-like computer operating systems, a [zombie process](https://en.wikipedia.org/wiki/Zombie_process) or defunct process is a process that has completed execution (via the [exit]() system call) but still has an entry in the process table. This occurs for child processes, where the entry is still needed to allow the parent process to read its child's exit status: once the exit status is read via the [wait]() system call, the zombie's entry is removed from the process table and it is said to be \"reaped\".\n\nUnlike the normal processes, zombie processes cannot be removed from a system with the [kill]() command since they are already dead. (This is where the term's metaphor [zombie - an undead person] comes from.) To reap a zombie process, `SIGCHLD` signal can be sent to the parent process manually using the [kill]() command. If the parent process refuses to reap the zombie, then terminating the parent process (mostly with `SIGTERM` signal) can be an option. When a child process loses its parent, [init](https://en.wikipedia.org/wiki/Init) process becomes its new parent and it will reap any zombies since it executes the [wait]() system call periodically.\n\nZombie processes are not harmful since they are not affecting other processes or using any system resources. However, they do retain their [process ID](https://en.wikipedia.org/wiki/Process_identifier). This can lead to preventing new processes to launch if all the available PIDs were assigned to zombie processes. Considering Unix-like systems have a finite number of process IDs (`/proc/sys/kernel/pid_max`), it's one of the problems that zombie processes can cause. Another danger of zombie processes is that they can cause [resource leak](https://en.wikipedia.org/wiki/Resource_leak) if they stay as a zombie in the process table for a long time. Apart from these issues, having a few zombie processes won't be a big deal for the system although they might indicate a bug with their parent process.\n\n[zproc.c](https://github.com/orhun/zps/blob/master/example/zproc.c) file can be compiled and run to see how zombie processes are created.\n\n```\ncd example/ && gcc -O3 -Wall zproc.c -o zproc && ./zproc\n```\n\n**zps** aims to list the running processes at a particular time with stats and indicate the zombie processes on this list. It can also reap these zombie processes automatically based on the arguments provided (by default using `SIGTERM`). See [usage](https://github.com/orhun/zps#usage) for more information.\nTechnically, **zps** reads process stats from [/proc](https://www.tldp.org/LDP/Linux-Filesystem-Hierarchy/html/proc.html) filesystem and uses [C POSIX library](https://en.wikipedia.org/wiki/C_POSIX_library) to handle listing, sending signals and other operations.\n\n\n Table of Contents
\n\n\n\n- [Installation](#installation)\n - [Arch Linux](#arch-linux)\n - [Alpine Linux](#alpine-linux)\n - [Fedora Linux](#fedora-linux)\n - [CMake](#cmake)\n - [Make](#make)\n - [GCC](#gcc)\n - [Docker](#docker)\n - [Building an image](#building-an-image)\n - [Running the image in container](#running-the-image-in-container)\n- [Usage](#usage)\n - [zps -r](#zps--r--reap)\n - [zps -s](#zps--s--signal)\n - [zps -p](#zps--p--prompt)\n - [zps -q](#zps--q--quiet)\n - [zps -n](#zps--n--no-color)\n- [TODO(s)](#todos)\n- [License](#license)\n- [Copyright](#copyright)\n\n\n\n \n\n## Installation\n\n### Arch Linux\n\n```\npacman -S zps\n```\n\n### Alpine Linux\n\n```\napk add zps\n```\n\n### Fedora Linux\n\n```\ndnf install zps\n```\n\n### CMake\n\n```\nmkdir -p build && cd build\ncmake ../ -DCMAKE_INSTALL_PREFIX=/usr\nmake\nsudo make install\nsudo ldconfig\n```\n\n### Make\n\n```\nmake\nsudo make install\n```\n\n### GCC\n\nWith manual compilation, you might want to also pass\n`-DNDEBUG` to disable runtime assertions.\n\n```\ncd src/ && gcc -s -O3 -Wall -Wextra -pedantic zps.c -o zps\n```\n\n### Docker\n\n#### Building an image\n\n```\ndocker build -f docker/Dockerfile -t zps .\n```\n\n#### Running the image in container\n\n```\ndocker run zps\n```\n\n## Usage\n\n```\nUsage:\n zps [options]\n\nOptions:\n -v, --version show version\n -h, --help show help\n -a, --all list all user-space processes\n -r, --reap reap zombie processes\n -s, --signal signal to be used on zombie parents\n -p, --prompt show prompt for selecting processes\n -q, --quiet reap in quiet mode\n -n, --no-color disable color output\n```\n\n### zps -r/--reap\n\n\n\n### zps -s/--signal\n\n\n\n### zps -p/--prompt\n\n\n\n### zps -q/--quiet\n\n\n\n### zps -n/--no-color\n\n\n\n## License\n\nGNU General Public License v3.0 only ([GPL-3.0-only](https://www.gnu.org/licenses/gpl.txt))\n\n## Copyright\n\nCopyright © 2019-2024, [Orhun Parmaksız](mailto:orhunparmaksiz@gmail.com)\n"
},
{
"path": "README_KO.md",
"content": "\n\n# zps [](https://github.com/orhun/zps/releases)\n\n### GNU/Linux에서 좀비 프로세스를 나열하고 끄는(reaping) 작은 유틸리티성 프로그램\n\n\n\n[](https://github.com/orhun/zps/actions?query=workflow%3A%22Continuous+Integration%22)\n[](https://github.com/orhun/zps/actions?query=workflow%3A%22Docker+Automated+Builds%22)\n[](https://www.codacy.com/manual/orhun/zps?utm_source=github.com&utm_medium=referral&utm_content=orhun/zps&utm_campaign=Badge_Grade)\n[](https://codecov.io/gh/orhun/zps)\n[](https://github.com/orhun/zps/stargazers) [](./LICENSE)\n\nUnix와 컴퓨터 운영체제와 같은 Unix에서, [좀비 프로세스](https://en.wikipedia.org/wiki/Zombie_process) 또는 Defunct 프로세스는 (시스템 호출 [종료]()을 통해 이루어진) 종료가 되어도 프로세스 목록에 남아 있습니다. 이 현상은 부모 프로세스가 (시스템 호출 [중단]()을 통해) 자식의 종료 상태를 알 필요가 있는 목록에서 자식 프로세스들에게 발생됩니다. 그렇게 좀비 프로세스를 목록에서 제거할 수 있었고, 이것을 \"reaped\"라고 합니다.\n\n일반 프로세스들과 다르게, 좀비프로세스들은 이미 죽었기 때문에 [Kill]() 명령어로 좀비프로세스들을 시스템에서 제거할 수 없습니다. (This is where the term's metaphor [zombie - an undead person] comes from.) 좀비 프로세스를 끄기 위해서, `SIGCHLD` 신호를 부모 프로세스에게 [Kill]() 명령어로 보내야 한다. 만약, 부모 프로세스가 좀비 프로세스를 끄는 것을 방해하는 경우에, 부모 프로세스는 대부분 `SIGTERM` 신호로 종료할 수 있는 방법도 있다. 자식 프로세스가 부모 프로세스를 잃었을 때, [init](https://en.wikipedia.org/wiki/Init) 프로세스(PID가 1번인 프로세스, 모든 프로세스의 조상 역할을 함.)가 자식 프로세스의 새로운 조상이 되고, 그것은 좀비 프로세스들을 시스템 호출 [중단]()을 해서 끌 수 있습니다.\n\n좀비 프로세스들은 다른 프로세스들에 영향을 끼치거나 시스템 자원을 사용하지 않기 때문에 해롭지 않습니다. 하지만, 그들은 [프로세스 ID](https://en.wikipedia.org/wiki/Process_identifier)를 소유하고 있습니다. 이것은 모든 사용 가능한 PID를 좀비 프로세스가 차지하고 있다면 새로운 프로세스를 실행하는 것이 불가능 할 수 있습니다. Unix와 같은 시스템들에서는 프로세스 ID (`/proc/sys/kernel/pid_max`)를 한정된 양(제 우분투에서는 32768이 최댓값이네요.)만 갖고 있습니다. 이것만이 좀비 프로세스가 일으킬 수 있는 문제점입니다. 좀비 프로세스의 다른 위험성은 만약 좀비 프로세스가 프로세스 목록에 오랫동안 머무른다면, [메모리 누수](https://en.wikipedia.org/wiki/Resource_leak)를 일으킬 수 있다는 것입니다. 이러한 문제 외에도, 적은 양의 좀비 프로세스는 그들의 부모 프로세스에 버그를 생성할 지라도 시스템에 큰 영향을 주지는 않을 것입니다.\n\n[zproc.c](https://github.com/orhun/zps/blob/master/example/zproc.c) 파일을 컴파일 할 수 있고, 어떻게 좀비 프로세스가 생성되는지 확인할 수 있습니다.\n\n```\ncd example/ && gcc -O3 -Wall zproc.c -o zproc && ./zproc\n```\n\n특정 시간에 실행하고 있는 프로세스들의 정보의 리스트와 좀비 프로세스들을 표시하기 위해 **zps**를 만들었습니다. 이 프로그램은, 자동으로 좀비 프로세스들을 종료할 수 있습니다. 좀 더 자세한 정보를 보려면 [사용법](https://github.com/orhun/zps#usage)을 보세요.\n기술적으로, **zps**는 [/proc](https://www.tldp.org/LDP/Linux-Filesystem-Hierarchy/html/proc.html) 파일 시스템에서 프로세스 정보를 얻어오고, 프로세스를 출력하고 신호를 보내고 이외의 다른 동작들을 하기 위해 [C POSIX library](https://en.wikipedia.org/wiki/C_POSIX_library)를 이용합니다.\n\n\n\n- [설치 방법](#설치-방법)\n - [Arch Linux](#arch-linux)\n - [Alpine Linux](#alpine-linux)\n - [Fedora Linux](#fedora-linux)\n - [CMake](#cmake)\n - [Make](#make)\n - [GCC](#gcc)\n - [Docker](#docker)\n - [이미지 생성](#이미지-생성)\n - [컨테이너에서 이미지 실행](#컨테이너에서-이미지-실행)\n- [사용법](#사용법)\n - [zps -r](#zps--r--reap)\n - [zps -s](#zps--s--signal)\n - [zps -p](#zps--p--prompt)\n - [zps -q](#zps--q--quiet)\n - [zps -n](#zps--n--no-color)\n- [TODO(s)](#todos)\n- [License](#license)\n- [Copyright](#copyright)\n\n\n\n## 설치 방법\n\n### Arch Linux\n\n```\npacman -S zps\n```\n\n### Alpine Linux\n\n```\napk add zps\n```\n\n### Fedora Linux\n\n```\ndnf install zps\n```\n\n### CMake\n\n```\nmkdir -p build && cd build\ncmake ../ -DCMAKE_INSTALL_PREFIX=/usr\nmake\nsudo make install\nsudo ldconfig\n```\n\n### Make\n\n```\nmake\nsudo make install\n```\n\n### GCC\n\n수동 컴파일 시에는 런타임 어설션을 비활성화하려면 `-DNDEBUG`도 전달하실 수 있습니다.\n\n```\ncd src/ && gcc -s -O3 -Wall -Wextra -pedantic zps.c -o zps\n```\n\n### Docker\n\n#### 이미지 생성\n\n```\ndocker build -f docker/Dockerfile -t zps .\n```\n\n#### 컨테이너에서 이미지 실행\n\n```\ndocker run zps\n```\n\n## 사용법\n\n```\n사용법:\n zps [options]\n\n옵션:\n -v, --version 버전 보기\n -h, --help 사용법 보기\n -a, --all 모든 사용자 공간 프로세스 나열\n -r, --reap 좀비 프로세스 종료하기\n -s, --signal 좀비 부모에 사용할 신호\n -p, --prompt 프로세스 선택을 위한 프롬프트 표시\n -q, --quiet quiet 모드로 실행하기\n -n, --no-color 색상 출력 비활성화\n```\n\n### zps -r/--reap\n\n\n\n### zps -s/--signal\n\n\n\n### zps -p/--prompt\n\n\n\n### zps -q/--quiet\n\n\n\n### zps -n/--no-color\n\n\n\n## License\n\nGNU General Public License v3.0 only ([GPL-3.0-only](https://www.gnu.org/licenses/gpl.txt))\n\n## Copyright\n\nCopyright © 2019-2024, [Orhun Parmaksız](mailto:orhunparmaksiz@gmail.com)\n\nTranslated to Korean by ahdelron.\n"
},
{
"path": "docker/Dockerfile",
"content": "# Create Alpine image for build\nFROM alpine:3.16.2 AS build-image\n# Set locale\nENV LC_ALL=C.UTF-8\n# Install compiler and standard library\nRUN apk add --no-cache gcc musl-dev\n# Set working directory\nWORKDIR /app/\n# Copy source files to working directory\nCOPY src .\n# Compile\nRUN gcc -s -O3 -Wall -Wextra -pedantic -DNDEBUG zps.c -o zps\n# Create Alpine image for runtime\nFROM alpine:3.16.2 AS runtime-image\n# Set working directory\nWORKDIR /root/\n# Copy executable to working directory\nCOPY --from=build-image /app/zps .\n# Execute\nCMD [\"./zps\"]\n"
},
{
"path": "example/zproc.c",
"content": "/**!\n * On Unix and Unix-like computer operating systems, a zombie process\n * or defunct process is a process that has completed execution but still\n * has an entry in the process table. (Wikipedia)\n * This program illustrates how zombie or defunct processes are created.\n * Copyright © 2019-2024 by Orhun Parmaksız \n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, version 3.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n */\n\n#include \n#include \n#include \n#include \n\n/*!\n * Entry point\n */\nint main(int argc, char *argv[])\n{\n unsigned int sleep_seconds = 60;\n if (argc == 2) { /* Parse command line argument. */\n sscanf(argv[1], \"%u\", &sleep_seconds);\n }\n pid_t pid = fork();\n if (pid > 0) { /* Parent process */\n /**\n * Sleep and eventually exit without the wait call.\n * This will cause child process to be a defunct process.\n */\n fprintf(stderr, \"PPID: %d\\n\", getpid());\n sleep(sleep_seconds);\n } else if (!pid) { /* Child process */\n fprintf(stderr, \"PID: %d\\n\", getpid());\n }\n return EXIT_SUCCESS;\n}\n"
},
{
"path": "man/zps.1",
"content": ".\\\" Manpage for zps.\n.TH ZPS \"1\" \"January 2024\" \"zps\" \"User Commands\"\n.SH NAME\nzps \\- list/reap zombie processes\n.SH SYNOPSIS\n.B zps\n[options]\n.SH DESCRIPTION\nzps lists the running processes with their stats and indicates/reaps the zombie processes.\n.SH OPTIONS\n.TP\n.BR \\-v \", \" \\-\\-version\nShow version information.\n.TP\n.BR \\-h \", \" \\-\\-help\nShow the help text.\n.TP\n.BR \\-a \", \" \\-\\-all\nList all user-space processes (not just zombies).\n.TP\n.BR \\-r \", \" \\-\\-reap\nReap zombie processes.\n.TP\n.BI \\-s\\ sig \\fR,\\ \\fB\\-\\-signal= sig \\fR,\\ \\fB\\-\\-signal \\ sig\nUse signal\n.I sig\non zombie parents (default:\n.BR SIGTERM ).\n.TP\n.BR \\-p \", \" \\-\\-prompt\nShow prompt for selecting processes.\n.TP\n.BR \\-q \", \" \\-\\-quiet\nReap in quiet mode.\n.TP\n.BR \\-n \", \" \\-\\-no-color\nDisable color output.\n.SH BUGS\nNo known bugs.\nUse \"Issues\" page for reporting bugs: \n.SH AUTHOR\nWritten by Orhun Parmaksız \n.SH COPYRIGHT\nCopyright © 2019-2024 Orhun Parmaksız\n.P\nGNU General Public License v3.0 only\n"
},
{
"path": "scripts/release.sh",
"content": "#!/usr/bin/env bash\n\nset -e\n\nproject_dir=\"$(pwd)/..\"\n\n# Create tag\nread -rp \"Tag: \" tag\ngit -c user.signingkey=\"B928720AEC532117\" tag -s -a \"$tag\"\n\n# Create assets\ncd \"$project_dir\"\nmake\ncd \"$project_dir/build/\" || exit\ntar -czvf \"zps-$tag.tar.gz\" zps ../README.md \\\n ../LICENSE ../man/zps.1 zps.desktop\ngpg --local-user \"B928720AEC532117\" \\\n --detach-sign \"zps-$tag.tar.gz\"\nshasum -a 512 \"zps-$tag.tar.gz\" > \"zps-$tag.tar.gz.sha512\"\n\n# Upload assets\n# https://github.com/buildkite/github-release\ngh-release \"v$tag\" \"zps-$tag\".* \\\n --tag \"$tag\" \\\n --github-repository \"orhun/zps\" \\\n\n# Push tag\ngit push --tags\n\n# Clean up\n#rm -f \"zps-$tag\".*\ncd .. || exit\necho \"New release locked and ready (v$tag)\"\n"
},
{
"path": "scripts/test.sh",
"content": "#!/usr/bin/env bash\n\nset -e\n\nproject_dir=\"$(pwd)/..\"\n# Compile the example & run\ncd \"${project_dir}/example\"\ngcc -O3 -Wall zproc.c -o z.o\n./z.o &>/dev/null &\n./z.o &>/dev/null &\n# Compile the main source & run\ncd \"${project_dir}/src\"\ngcc -fprofile-arcs -ftest-coverage -s -O3 -Wall -Wextra -pedantic zps.c -o zps\n./zps -v && ./zps -h && printf '1' | ./zps -p\n./zps -a && ./zps -r\n./zps -q && ./zps -s 9 && ./zps -s SIGTERM && ./zps -s term\n./zps -n\n# Print code coverage information\ngcov zps.c\n# Send report to codecov\n[ \"$UPLOAD\" == 'true' ] && bash <(curl -s https://codecov.io/bash)\n# Cleanup\nrm -v zps zps.c.* zps.gc*\n"
},
{
"path": "src/zps.c",
"content": "/**!\n * zps, a small utility for listing and reaping zombie processes.\n * Copyright © 2019-2024 by Orhun Parmaksız \n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, version 3.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n */\n\n#define _GNU_SOURCE\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"zps.h\"\n\n#ifndef PATH_MAX\n#define PATH_MAX MAX_BUF_SIZE\n#endif\n\n/* Array used for lookup of common signals' abbreviations */\nstatic const char *const abbrevs[NSIG] = {\n [SIGHUP] = \"HUP\", [SIGINT] = \"INT\", [SIGQUIT] = \"QUIT\",\n [SIGILL] = \"ILL\", [SIGTRAP] = \"TRAP\", [SIGABRT] = \"ABRT\",\n [SIGFPE] = \"FPE\", [SIGKILL] = \"KILL\", [SIGBUS] = \"BUS\",\n [SIGSYS] = \"SYS\", [SIGSEGV] = \"SEGV\", [SIGPIPE] = \"PIPE\",\n [SIGALRM] = \"ALRM\", [SIGTERM] = \"TERM\", [SIGURG] = \"URG\",\n [SIGSTOP] = \"STOP\", [SIGTSTP] = \"TSTP\", [SIGCONT] = \"CONT\",\n [SIGCHLD] = \"CHLD\", [SIGTTIN] = \"TTIN\", [SIGTTOU] = \"TTOU\",\n [SIGPOLL] = \"POLL\", [SIGXCPU] = \"XCPU\", [SIGXFSZ] = \"XFSZ\",\n [SIGVTALRM] = \"VTALRM\", [SIGPROF] = \"PROF\", [SIGUSR1] = \"USR1\",\n [SIGUSR2] = \"USR2\", [SIGWINCH] = \"WINCH\",\n};\n\n/*!\n * Helper to get the string abbreviation of signal constants\n *\n * @param[in] sig Signal number to get the string representation of\n *\n * @return String representing the signal constant (abbreviated),\n * or NULL if no corresponding signal string was found\n */\nstatic const char *sig_abbrev(int sig)\n{\n if (sig < 0 || !((size_t)sig < sizeof(abbrevs))) {\n return NULL;\n }\n return abbrevs[sig];\n}\n\n/*!\n * Attempts to find the corresponding signal number to the\n * given signal constant's name\n *\n * @param[in] sig_str Signal name to convert\n *\n * @return -1 on error, the corresponding signal number otherwise\n */\nstatic int sig_str_to_num(const char *sig_str)\n{\n assert(sig_str);\n\n const char *const prefix = \"SIG\";\n const size_t prefix_len = strlen(prefix);\n if (!strncasecmp(sig_str, prefix, prefix_len)) {\n sig_str += prefix_len;\n }\n\n for (size_t sig = 0; sig < sizeof(abbrevs) / sizeof(abbrevs[0]); ++sig) {\n if (!abbrevs[sig]) {\n continue;\n }\n if (!strcasecmp(sig_str, abbrevs[sig])) {\n return sig;\n }\n }\n return -1;\n}\n\n/*!\n * Tries to associate the user's signal input with a known\n * signal number\n *\n * @param[in] sig_str Signal characters to convert\n *\n * @return -1 on error, the corresponding signal number otherwise\n */\nstatic int user_signal(const char *sig_str)\n{\n if (!sig_str) {\n return -1;\n }\n if (!isdigit(*sig_str)) {\n return sig_str_to_num(sig_str);\n }\n\n int sig = -1;\n if (sscanf(sig_str, \"%d\", &sig) != 1 || sig < 0 || NSIG <= sig) {\n return -1;\n }\n return abbrevs[sig] ? sig : -1;\n}\n\n/*!\n * Checks if the standard I/O streams refer to a terminal and deduces\n * whether to use colored output.\n *\n * @param[out] settings Settings struct to update\n *\n * @return void\n */\nstatic void check_interactive(struct zps_settings *settings)\n{\n assert(settings);\n\n settings->color_allowed = settings->interactive =\n isatty(STDIN_FILENO) && isatty(STDOUT_FILENO) && isatty(STDERR_FILENO);\n}\n\n/*!\n * Write colored and formatted text to the specified stream.\n *\n * Resets the display attributes before returning\n *\n * @param[in] color ANSI SGR control sequence parameter n (color code)\n * @param[in] color_allowed Boolean specifying whether we can print color\n * @param[out] stream Pointer to the file to write to\n * @param[in] format Format string specifying the text to print\n * @param[in] ... Variable format string arguments\n *\n * @return void\n */\nstatic void cfprintf(enum ansi_fg_color_code color, bool color_allowed,\n FILE *stream, const char *format, ...)\n{\n va_list vargs;\n\n assert(stream);\n assert(format);\n\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", color);\n }\n va_start(vargs, format);\n vfprintf(stream, format, vargs);\n va_end(vargs);\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", ANSI_FG_NORMAL);\n }\n}\n\n/*!\n * Write bold, colored and formatted text to the specified stream.\n *\n * Resets the display attributes before returning\n *\n * @param[in] color ANSI SGR control sequence parameter n (color code)\n * @param[in] color_allowed Boolean specifying whether we can print color\n * @param[out] stream Pointer to the file to write to\n * @param[in] format Format string specifying the text to print\n * @param[in] ... Variable format string arguments\n *\n * @return void\n */\nstatic void cbfprintf(enum ansi_fg_color_code color, bool color_allowed,\n FILE *stream, const char *format, ...)\n{\n va_list vargs;\n\n assert(stream);\n assert(format);\n\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", ANSI_DISPLAY_MODE_BOLD);\n if (color) {\n fprintf(stream, \"\\x1b[%dm\", color);\n }\n }\n va_start(vargs, format);\n vfprintf(stream, format, vargs);\n va_end(vargs);\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", ANSI_DISPLAY_MODE_NORMAL);\n }\n}\n\n/*!\n * Write bold, colored and formatted text to the specified stream.\n *\n * Encloses the bold and colored text.\n *\n * @param[in] color ANSI SGR control sequence parameter n (color code)\n * @param[in] color_allowed Boolean specifying whether we can print color\n * @param[in] before String to put before the colored content\n * @param[in] after String to put after the colored content\n * @param[out] stream Pointer to the file to write to\n * @param[in] format Format string specifying the text to print\n * @param[in] ... Variable format string arguments\n *\n * @return void\n */\nstatic void cbfprintf_enclosed(enum ansi_fg_color_code color,\n bool color_allowed, const char *before,\n const char *after, FILE *stream,\n const char *format, ...)\n{\n va_list vargs;\n\n assert(before);\n assert(after);\n assert(stream);\n assert(format);\n\n fprintf(stream, \"%s\", before);\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", ANSI_DISPLAY_MODE_BOLD);\n if (color) {\n fprintf(stream, \"\\x1b[%dm\", color);\n }\n }\n va_start(vargs, format);\n vfprintf(stream, format, vargs);\n va_end(vargs);\n if (color_allowed) {\n fprintf(stream, \"\\x1b[%dm\", ANSI_DISPLAY_MODE_NORMAL);\n }\n fprintf(stream, \"%s\", after);\n}\n\n/*!\n * Print version and exit\n *\n * @param[in] status Exit status to use\n * @param[in] settings Pointer to settings determining output coloring (bold)\n */\nstatic void __attribute__((noreturn))\nversion_exit(int status, struct zps_settings *settings)\n{\n assert(settings);\n\n cbfprintf(ANSI_FG_NORMAL, settings->interactive, status ? stderr : stdout,\n \"\\n -hhhhdddddd/\\n\"\n \" `++++++mMN+\\n\"\n \" :dMy.\\n\"\n \" -yMMh.\\n\"\n \" `oNNo:shy:`\\n\"\n \" .dMm:```.+dNh`\\n\"\n \" .github/orhun/zps v%s\\n\\n\",\n VERSION);\n exit(status);\n}\n\n/*!\n * Print help and exit\n *\n * @param[in] status Exit status to use\n */\nstatic void __attribute__((noreturn)) help_exit(int status)\n{\n fprintf(status ? stderr : stdout,\n \"\\nUsage:\\n\"\n \" zps [options]\\n\\n\"\n \"Options:\\n\"\n \" -v, --version show version\\n\"\n \" -h, --help show help\\n\"\n \" -a, --all list all user-space processes\\n\"\n \" -r, --reap reap zombie processes\\n\"\n \" -s, --signal signal to be used on zombie parents\\n\"\n \" -p, --prompt show prompt for selecting processes\\n\"\n \" -q, --quiet reap in quiet mode\\n\"\n \" -n, --no-color disable color output\\n\\n\");\n exit(status);\n}\n\n/*!\n * Redirect `stream` to file `\"/dev/null\"`\n *\n * @param[out] stream I/O stream to silence\n *\n * @return void\n */\nstatic void silence(FILE *stream)\n{\n assert(stream);\n\n const int fd = open(\"/dev/null\", O_WRONLY);\n if (fd != -1) {\n dup2(fd, fileno(stream));\n close(fd);\n }\n}\n\n/*!\n * Function performing sanity checks on the configured settings\n *\n * This function will call `exit()` if the settings are erroneous.\n *\n * @param[in] settings Settings to check\n *\n * @return void\n */\nstatic void settings_check(const struct zps_settings *settings)\n{\n assert(settings);\n\n bool failed = false;\n if (settings->sig == -1) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"Unknown signal\\n\");\n failed = true;\n }\n if (settings->sig && !settings->signal) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"The -s option has to be used with either -r or -p\\n\");\n failed = true;\n }\n if (settings->quiet) {\n if (settings->show_all) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"Incompatible options: -q, -a\\n\");\n failed = true;\n }\n if (settings->prompt) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"Incompatible options: -q, -p\\n\");\n failed = true;\n }\n }\n if (failed) {\n help_exit(EXIT_FAILURE);\n }\n}\n\n/*!\n * Parse command line arguments.\n *\n * @param[in] argc Argument count\n * @param[in,out] argv Argument vector (which may be permuted (GNU))\n * @param[out] settings Pointer to struct for user-specified settings\n *\n * @return void\n */\nstatic void parse_args(int argc, char *argv[], struct zps_settings *settings)\n{\n /* Long options for command line arguments */\n static const struct option longopts[] = {\n { \"version\", no_argument, NULL, 'v'},\n { \"help\", no_argument, NULL, 'h'},\n { \"all\", no_argument, NULL, 'a'},\n { \"reap\", no_argument, NULL, 'r'},\n { \"signal\", required_argument, NULL, 's'},\n { \"prompt\", no_argument, NULL, 'p'},\n { \"quiet\", no_argument, NULL, 'q'},\n {\"no-color\", no_argument, NULL, 'n'},\n { NULL, 0, NULL, 0},\n };\n\n assert(argv);\n assert(settings);\n\n for (int opt;\n (opt = getopt_long(argc, argv, \"vhars:pqn\", longopts, NULL)) != -1;) {\n switch (opt) {\n case 'v': /* Show version information. */\n version_exit(EXIT_SUCCESS, settings);\n case 'h': /* Show help message. */\n help_exit(EXIT_SUCCESS);\n case 'a': /* List all processes. */\n settings->show_all = true;\n break;\n case 'r': /* Actually reap the zombies. */\n settings->signal = true;\n break;\n case 's': /* User-specified zombie parent signal. */\n settings->sig = user_signal(optarg);\n break;\n case 'p': /* Show a prompt for interactive reaping. */\n settings->prompt = true;\n settings->signal = true;\n break;\n case 'q': /* Quiet reap mode. */\n settings->quiet = true;\n settings->signal = true;\n break;\n case 'n': /* Disable color output. */\n settings->color_allowed = false;\n break;\n default:\n help_exit(EXIT_FAILURE);\n }\n }\n\n settings_check(settings);\n}\n\n/*!\n * Read the given file and return its content.\n *\n * @param[in,out] buf Buffer to read bytes from the file into\n * @param[in] bufsiz Size of allocated `buf`\n * @param[in] format Format string specifying the file path\n * @param[in] ... Variable format string arguments\n *\n * @return number of bytes successfully read (max: `bufsiz - 1`),\n `-1` on error\n */\nstatic ssize_t read_file(char *buf, size_t bufsiz, const char *format, ...)\n{\n va_list vargs;\n char path[PATH_MAX] = {0};\n\n assert(buf);\n assert(bufsiz > 0);\n assert(format);\n\n va_start(vargs, format);\n int num_required = vsnprintf(path, sizeof(path), format, vargs);\n va_end(vargs);\n /* Check for errors or truncation */\n if (num_required < 0 || (size_t)num_required >= sizeof(path)) {\n return -1;\n }\n\n const int fd = open(path, O_RDONLY);\n if (fd == -1) {\n return -1;\n }\n memset(buf, '\\0', bufsiz);\n ssize_t read_rc = read(fd, buf, bufsiz - 1);\n close(fd);\n\n return read_rc;\n}\n\n/*!\n * Parse the content of `\"/proc//stat\"` into `proc_stats`.\n *\n * @param[in,out] stat_buf Null-terminated buffer containing the contents of\n `\"/proc//stat\"` from offset `0`; will be\n modified during execution\n * @param[out] proc_stats Pointer to write the process information to\n *\n * @return `-1` on error, otherwise `0` is returned\n */\nstatic int parse_stat_content(char *stat_buf, struct proc_stats *proc_stats)\n{\n assert(stat_buf);\n assert(proc_stats);\n\n /* Start with the PID field */\n if (sscanf(stat_buf, \"%d\", &proc_stats->pid) != 1) {\n return -1;\n }\n\n /* Pointer bounds for `comm` in the buffer */\n const char *begin = strchr(stat_buf, '(');\n if (!begin) {\n return -1;\n }\n char *const end = strrchr(begin, ')');\n if (!end || end[1] == '\\0') {\n return -1;\n }\n ++begin;\n const char *const last_fields = end + 2;\n /*\n begin:\n %d (...) %c %d\n ^\n end:\n %d (...) %c %d\n ^\n last_fields:\n %d (...) %c %d\n ^\n */\n /* Extract the last fields first */\n if (sscanf(last_fields, \"%c %d\", &proc_stats->state, &proc_stats->ppid) !=\n 2) {\n return -1;\n }\n\n /* Limit `comm_strlen` */\n *end = '\\0';\n const size_t comm_strlen = strnlen(begin, sizeof(proc_stats->name) - 1);\n /* Extract the process name (limited by `comm_strlen`) */\n memcpy(proc_stats->name, begin, comm_strlen);\n /* Make sure string ends here */\n proc_stats->name[comm_strlen] = '\\0';\n\n return 0;\n}\n\n/*!\n * Parse and return the stats for a given PID.\n *\n * @param[in] pid String containing the PID\n * @param[out] proc_stats Pointer to the struct to write to\n *\n * @return `-1` on error, `0` otherwise\n */\nstatic int get_proc_stats(const char *pid, struct proc_stats *proc_stats)\n{\n char stat_buf[MAX_BUF_SIZE] = {0};\n\n assert(pid);\n assert(proc_stats);\n\n /* Read the `\"/proc//stat\"` file. */\n if (read_file(stat_buf, sizeof(stat_buf), \"%s/%s/%s\", PROC_FILESYSTEM, pid,\n STAT_FILE) == -1) {\n return -1;\n }\n if (parse_stat_content(stat_buf, proc_stats)) {\n return -1;\n }\n /* We do not want kernel processes/threads */\n if (proc_stats->ppid == KTHREADD_PID || proc_stats->pid == KTHREADD_PID) {\n return -1;\n }\n\n /* Read the `\"/proc//cmdline\"` file */\n const ssize_t cmd_len = read_file(proc_stats->cmd, sizeof(proc_stats->cmd),\n \"%s/%s/%s\", PROC_FILESYSTEM, pid,\n CMD_FILE);\n if (cmd_len == -1) {\n return -1;\n }\n\n /* Replace any null bytes with spaces to also print further arguments */\n for (size_t i = 0; i < (size_t)cmd_len; ++i) {\n if (!proc_stats->cmd[i]) {\n proc_stats->cmd[i] = ' ';\n }\n }\n\n return 0;\n}\n\n/*!\n * Send signal to the given PPID of the `proc_stats` entry.\n *\n * @param[in] proc_stats Pointer to the entry to send the signal for\n * @param[in] settings Pointer to user-specified settings (signal?)\n * @param[out] stats The `signaled_procs` field will be updated\n * @param[in] verbose Boolean specifying the behavior (print result)\n *\n * @return `-1` on error, otherwise `0` is returned\n */\nstatic int handle_zombie(const struct proc_stats *proc_stats,\n const struct zps_settings *settings,\n struct zps_stats *stats, bool verbose)\n{\n assert(proc_stats);\n assert(settings);\n assert(stats);\n\n const pid_t ppid = proc_stats->ppid;\n if (ppid <= 0 || ppid == INIT_PID || ppid == KTHREADD_PID) {\n return -1;\n }\n const int sig = settings->sig ? settings->sig : SIGTERM;\n const int kill_rc = kill(ppid, sig);\n if (!kill_rc) {\n ++stats->signaled_procs;\n const char *const sigabbrev = sig_abbrev(sig);\n if (verbose) {\n cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, \"\\n[\", \"]\",\n stdout, \"SIG%s\",\n sigabbrev ? sigabbrev : \"Unknown signal\");\n }\n } else if (verbose) {\n cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, \"\\n[\", \"]\",\n stdout, \"Failed to signal\");\n }\n return kill_rc;\n}\n\n/*!\n * Iterate over found zombies and list information while doing so.\n *\n * If the user is not to be prompted, this function immediately sends a signal.\n *\n * @param[in] defunct_procs Pointer to the zombie process vector\n * @param[in] settings Pointer to user-specified settings (signal?)\n * @param[out] stats The `signaled_procs` field will be updated\n *\n * @return void\n */\nstatic void handle_found_zombies(const struct proc_vec *defunct_procs,\n const struct zps_settings *settings,\n struct zps_stats *stats)\n{\n assert(defunct_procs);\n assert(settings);\n assert(stats);\n\n for (size_t i = 0, sz = proc_vec_size(defunct_procs); i < sz; ++i) {\n const struct proc_stats *const entry = proc_vec_at(defunct_procs, i);\n if (!settings->prompt) {\n handle_zombie(entry, settings, stats, true);\n } else {\n cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, \"\\n[\", \"]\",\n stdout, \"%zu\", i + 1);\n }\n\n fprintf(stdout,\n \"\\n Name: %s\\n PID: %d\\n PPID: %d\\n State: %c\\n\",\n entry->name, entry->pid, entry->ppid, entry->state);\n }\n}\n\n/*!\n * Iterate through `\"/proc\"` and save found zombie entries.\n *\n * @param[out] defunct_procs Pointer to the zombie process vector to fill\n * @param[in] settings Pointer to user-specified settings (list?)\n * @param[out] stats The `defunct_count` field will be updated\n *\n * @return void\n */\nstatic void proc_iter(struct proc_vec *defunct_procs,\n const struct zps_settings *settings,\n struct zps_stats *stats)\n{\n assert(defunct_procs);\n assert(settings);\n assert(stats);\n\n DIR *dir = opendir(PROC_FILESYSTEM);\n if (dir == NULL) {\n return;\n }\n\n for (;;) {\n struct dirent *d = readdir(dir);\n if (d == NULL) {\n break;\n }\n if (!(d->d_type == DT_DIR && isdigit(d->d_name[0]))) {\n continue;\n }\n\n struct proc_stats proc_stats = {0};\n /* Get the process stats from the path. */\n if (get_proc_stats(d->d_name, &proc_stats)) {\n continue;\n } else if (proc_stats.state == STATE_ZOMBIE) {\n ++stats->defunct_count;\n /* Add process to the array of defunct processes (could fail) */\n proc_vec_add(defunct_procs, proc_stats);\n }\n /* Print the process's stats. */\n if (settings->show_all || proc_stats.state == STATE_ZOMBIE) {\n cfprintf(\n proc_stats.state == STATE_ZOMBIE ? ANSI_FG_RED : ANSI_FG_NORMAL,\n settings->color_allowed, stdout, \"%-*d %-*d %-*c %*.*s %s\\n\",\n PID_COL_WIDTH, proc_stats.pid, PPID_COL_WIDTH, proc_stats.ppid,\n STATE_COL_WIDTH, proc_stats.state, NAME_COL_WIDTH,\n NAME_COL_WIDTH, proc_stats.name, proc_stats.cmd);\n }\n }\n\n closedir(dir);\n}\n\n/*!\n * Request user input to explicitly signal processes.\n *\n * @param[in,out] defunct_procs Pointer to the zombie process vector\n * @param[in] settings Pointer to user-specified settings (signal?)\n * @param[out] stats The `signaled_procs` field will be updated\n *\n * @return void\n */\nstatic void prompt_user(const struct proc_vec *defunct_procs,\n const struct zps_settings *settings,\n struct zps_stats *stats)\n{\n char index_prompt[MAX_BUF_SIZE] = {0};\n\n assert(defunct_procs);\n assert(settings);\n assert(stats);\n\n /* Print user input message and ask for input. */\n fprintf(stdout, \"\\nEnter process index(es) to proceed: \");\n fflush(stdout);\n if (!fgets(index_prompt, sizeof(index_prompt), stdin)) {\n return;\n }\n\n /* Split the given input. */\n char *saveptr = NULL;\n for (char *token = strtok_r(index_prompt, DELIMS, &saveptr); token;\n token = strtok_r(NULL, DELIMS, &saveptr)) {\n size_t index = 0;\n if (token[0] == '-' || sscanf(token, \"%zu\", &index) != 1) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"\\nInvalid input: %s\\n\", token);\n continue;\n }\n --index;\n if (!(index < proc_vec_size(defunct_procs))) {\n cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,\n \"\\nIndex not in range: %zu\\n\", index + 1);\n continue;\n }\n\n const struct proc_stats *entry = proc_vec_at(defunct_procs, index);\n handle_zombie(entry, settings, stats, true);\n cbfprintf_enclosed(ANSI_FG_MAGENTA, settings->color_allowed, \" -> \",\n \" \", stdout, \"%s\", entry->name);\n cbfprintf_enclosed(ANSI_FG_MAGENTA, settings->color_allowed,\n \"[PID (Z): \", \", \", stdout, \"%d\", entry->pid);\n cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed,\n \"PPID: \", \"]\\n\", stdout, \"%d\", entry->ppid);\n }\n}\n\n/*!\n * Check running process's states using the `\"/proc\"` filesystem.\n *\n * @param[in] settings Pointer to user-specified settings\n * @param[out] stats Pointer to statistics to update for the zombies found\n *\n * @return -1 on error, 0 otherwise\n */\nstatic int check_procs(struct zps_settings *settings, struct zps_stats *stats)\n{\n assert(settings);\n assert(stats);\n\n struct proc_vec *const defunct_procs = proc_vec();\n if (!defunct_procs) {\n return -1;\n }\n\n /* Print column titles (header line). */\n cbfprintf(ANSI_FG_NORMAL, settings->color_allowed, stdout,\n \"%-*s %-*s %-*s %*.*s %s\\n\", PID_COL_WIDTH, \"PID\", PPID_COL_WIDTH,\n \"PPID\", STATE_COL_WIDTH, \"STATE\", NAME_COL_WIDTH, NAME_COL_WIDTH,\n \"NAME\", \"COMMAND\");\n\n /* Main function logic */\n proc_iter(defunct_procs, settings, stats);\n if (settings->signal) {\n handle_found_zombies(defunct_procs, settings, stats);\n }\n if (settings->prompt && proc_vec_size(defunct_procs)) {\n prompt_user(defunct_procs, settings, stats);\n }\n\n proc_vec_free(defunct_procs);\n\n return 0;\n}\n\n/*!\n * Entry point\n */\nint main(int argc, char *argv[])\n{\n struct zps_settings settings = {\n .sig = 0,\n .signal = false,\n .show_all = false,\n .prompt = false,\n .quiet = false,\n .interactive = true,\n .color_allowed = true,\n };\n struct zps_stats stats = {\n .defunct_count = 0,\n .signaled_procs = 0,\n };\n struct timespec start = {0}, end = {0};\n\n clock_gettime(CLOCK_REALTIME, &start);\n check_interactive(&settings);\n parse_args(argc, argv, &settings);\n if (settings.quiet) {\n silence(stdout);\n silence(stderr);\n }\n const int rc = check_procs(&settings, &stats);\n clock_gettime(CLOCK_REALTIME, &end);\n\n const double duration_ms = (end.tv_sec - start.tv_sec) * 1e3 +\n (end.tv_nsec - start.tv_nsec) * 1e-6;\n if (stats.signaled_procs) {\n /* Show signal count and taken time. */\n fprintf(stdout,\n \"\\nParent(s) signaled: %zu/%zu\\nElapsed time: %.2f ms\\n\",\n stats.signaled_procs, stats.defunct_count, duration_ms);\n }\n\n return rc ? EXIT_FAILURE : EXIT_SUCCESS;\n}\n"
},
{
"path": "src/zps.h",
"content": "/**!\n * zps, a small utility for listing and reaping zombie processes.\n * Copyright © 2019-2024 by Orhun Parmaksız \n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, version 3.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n */\n\n#ifndef ZPS_H\n#define ZPS_H\n\n#include \n#include \n#include \n#include \n\n/* Version number string */\n#define VERSION \"2.0.0\"\n\n#define DELIMS \", \\n\"\n\n/* PID of `init` */\n#define INIT_PID 1\n/* PID of `kthreadd` */\n#define KTHREADD_PID 2\n\n/* Maximum length of userland process names (incl. '\\0') */\n#define TASK_COMM_LEN 16\n/* We will truncate the cmdline string (incl. '\\0') */\n#define CMD_MAX_LEN 32\n\n/* Formatting widths for our columns */\n#define PID_COL_WIDTH 10\n#define PPID_COL_WIDTH PID_COL_WIDTH\n#define STATE_COL_WIDTH 5\n#define NAME_COL_WIDTH (TASK_COMM_LEN - 1)\n\n/* `/proc` filesystem */\n#define PROC_FILESYSTEM \"/proc\"\n/* PID status file */\n#define STAT_FILE \"stat\"\n/* PID command file */\n#define CMD_FILE \"cmdline\"\n\n/* Fixed buffer size */\n#define MAX_BUF_SIZE 4096\n\n/* Status file entry of zombie state */\n#define STATE_ZOMBIE 'Z'\n\n/* Enum for relevant ANSI SGR display modes */\nenum ansi_display_mode_code {\n ANSI_DISPLAY_MODE_NORMAL = 0,\n ANSI_DISPLAY_MODE_BOLD = 1,\n};\n\n/* Enum for the different standard ANSI SGR color options */\nenum ansi_fg_color_code {\n ANSI_FG_NORMAL = 0,\n ANSI_FG_BLACK = 30,\n ANSI_FG_RED = 31,\n ANSI_FG_GREEN = 32,\n ANSI_FG_YELLOW = 33,\n ANSI_FG_BLUE = 34,\n ANSI_FG_MAGENTA = 35,\n ANSI_FG_CYAN = 36,\n ANSI_FG_WHITE = 37,\n};\n\n/* Struct for keeping track of the `zps` CLI options */\nstruct zps_settings {\n /* Signal to use */\n int sig;\n /* Boolean value for signaling defunct processes' parents */\n bool signal;\n /* Boolean value for listing all running processes */\n bool show_all;\n /* Boolean value for showing a prompt for the reaping option */\n bool prompt;\n /* Boolean value for quiet mode */\n bool quiet;\n /* Boolean value for connection to a terminal */\n bool interactive;\n /* Boolean value for colored output */\n bool color_allowed;\n};\n\n/* Struct for keeping track of the zombies */\nstruct zps_stats {\n /* Number of found defunct processes */\n size_t defunct_count;\n /* Number of signaled processes */\n size_t signaled_procs;\n};\n\n/* Struct for storing process stats */\nstruct proc_stats {\n pid_t pid;\n pid_t ppid;\n char state;\n char padding[7];\n char name[TASK_COMM_LEN];\n char cmd[CMD_MAX_LEN];\n};\n\n/* Struct to be used as a dynamically growing vector with immutable elements */\nstruct proc_vec {\n struct proc_stats *ptr;\n size_t sz;\n size_t max_sz;\n};\n\n/*!\n * Constructs an initial process vector with `max_sz` of `64`.\n *\n * The `proc_vec_free()` function should be called on this return value\n * in order to free the resources.\n *\n * @return Pointer to the allocated structure, `NULL` on error\n */\nstatic inline struct proc_vec *proc_vec(void)\n{\n struct proc_vec *proc_v = (struct proc_vec *)malloc(sizeof(*proc_v));\n if (!proc_v) {\n return NULL;\n }\n\n proc_v->max_sz = 64;\n proc_v->sz = 0;\n proc_v->ptr =\n (struct proc_stats *)malloc(proc_v->max_sz * sizeof(*proc_v->ptr));\n if (!proc_v->ptr) {\n free(proc_v);\n return NULL;\n }\n\n return proc_v;\n}\n\n/*!\n * Frees and invalidates the process vector pointed to by the `proc_v`.\n *\n * @param[out] proc_v Process vector to deallocate\n *\n * @return void\n */\nstatic inline void proc_vec_free(struct proc_vec *proc_v)\n{\n if (!proc_v) {\n return;\n }\n free(proc_v->ptr);\n free(proc_v);\n}\n\n/*!\n * Adds `entry` to the end of the `proc_v` vector.\n *\n * @param[out] proc_v Process vector to use\n * @param[in] entry Entry to add to the vector\n *\n * @return `false` on error, `true` otherwise\n */\nstatic inline bool proc_vec_add(struct proc_vec *proc_v,\n struct proc_stats entry)\n{\n assert(proc_v);\n\n if (proc_v->sz == proc_v->max_sz) {\n proc_v->max_sz *= 2;\n struct proc_stats *tmp = (struct proc_stats *)realloc(\n proc_v->ptr, proc_v->max_sz * sizeof(*proc_v->ptr));\n if (!tmp) {\n return false;\n } else {\n proc_v->ptr = tmp;\n }\n }\n\n proc_v->ptr[proc_v->sz++] = entry;\n return true;\n}\n\n/*!\n * Returns a pointer to the element at index `i` in `proc_v`.\n *\n * @param[out] proc_v Process vector to use\n * @param[in] i Vector index to access\n *\n * @return `NULL` if out of bounds, a pointer to the respective entry otherwise\n */\nstatic inline const struct proc_stats *\nproc_vec_at(const struct proc_vec *proc_v, size_t i)\n{\n assert(proc_v);\n\n return i < proc_v->sz ? &proc_v->ptr[i] : NULL;\n}\n\n/*!\n * Returns the current number of elements stored in `proc_v`\n *\n * @param[in] proc_v Process vector to use\n *\n * @return Size of the vector pointed to by `proc_v`\n */\nstatic inline size_t proc_vec_size(const struct proc_vec *proc_v)\n{\n assert(proc_v);\n\n return proc_v->sz;\n}\n\n#endif // ZPS_H\n"
}
]