Repository: orhun/zps
Branch: master
Commit: 76ffe8051248
Files: 18
Total size: 87.9 KB
Directory structure:
gitextract_757w5lgm/
├── .application/
│ └── zps.desktop
├── .clang-format
├── .github/
│ ├── FUNDING.yml
│ └── workflows/
│ ├── ci.yml
│ └── docker.yml
├── .gitignore
├── CMakeLists.txt
├── LICENSE
├── Makefile
├── README.md
├── README_KO.md
├── docker/
│ └── Dockerfile
├── example/
│ └── zproc.c
├── man/
│ └── zps.1
├── scripts/
│ ├── release.sh
│ └── test.sh
└── src/
├── zps.c
└── zps.h
================================================
FILE CONTENTS
================================================
================================================
FILE: .application/zps.desktop
================================================
[Desktop Entry]
Type=Application
Name=zps
Comment=A small utility for listing and reaping zombie processes.
Exec=zps
Icon=utilities-system-monitor
Terminal=true
Categories=System;Monitor;ConsoleOnly;
NoDisplay=true
================================================
FILE: .clang-format
================================================
---
AccessModifierOffset: -4
AlignAfterOpenBracket: Align
AlignArrayOfStructures: Right
AlignConsecutiveAssignments: true
AlignConsecutiveDeclarations: false
AlignConsecutiveMacros: true
AlignEscapedNewlines: Left
AlignOperands: true
AlignTrailingComments: false
AllowAllParametersOfDeclarationOnNextLine: false
AllowShortBlocksOnASingleLine: false
AllowShortCaseLabelsOnASingleLine: false
AllowShortFunctionsOnASingleLine: None
AllowShortIfStatementsOnASingleLine: false
AllowShortLoopsOnASingleLine: false
AlwaysBreakAfterDefinitionReturnType: None
AlwaysBreakAfterReturnType: None
AlwaysBreakBeforeMultilineStrings: false
AlwaysBreakTemplateDeclarations: false
BinPackArguments: true
BinPackParameters: true
BraceWrapping:
AfterClass: false
AfterControlStatement: false
AfterEnum: false
AfterFunction: true
AfterNamespace: true
AfterObjCDeclaration: false
AfterStruct: false
AfterUnion: false
AfterExternBlock: false
BeforeCatch: false
BeforeElse: false
IndentBraces: false
SplitEmptyFunction: true
SplitEmptyRecord: true
SplitEmptyNamespace: true
BreakBeforeBinaryOperators: None
BreakBeforeBraces: Custom
BreakBeforeInheritanceComma: false
BreakBeforeTernaryOperators: false
BreakConstructorInitializersBeforeComma: false
BreakConstructorInitializers: BeforeComma
BreakAfterJavaFieldAnnotations: false
BreakStringLiterals: false
ColumnLimit: 80
CommentPragmas: '^ IWYU pragma:'
CompactNamespaces: false
ConstructorInitializerAllOnOneLineOrOnePerLine: false
ConstructorInitializerIndentWidth: 4
ContinuationIndentWidth: 4
Cpp11BracedListStyle: true
DerivePointerAlignment: false
DisableFormat: false
ExperimentalAutoDetectBinPacking: false
FixNamespaceComments: false
IncludeBlocks: Preserve
IncludeCategories:
- Regex: '.*'
Priority: 1
IncludeIsMainRegex: '(Test)?$'
IndentCaseLabels: false
IndentGotoLabels: false
IndentPPDirectives: None
IndentWidth: 4
IndentWrappedFunctionNames: false
JavaScriptQuotes: Leave
JavaScriptWrapImports: true
KeepEmptyLinesAtTheStartOfBlocks: false
MacroBlockBegin: ''
MacroBlockEnd: ''
MaxEmptyLinesToKeep: 1
NamespaceIndentation: None
ObjCBinPackProtocolList: Auto
ObjCBlockIndentWidth: 4
ObjCSpaceAfterProperty: true
ObjCSpaceBeforeProtocolList: true
PenaltyBreakAssignment: 10
PenaltyBreakBeforeFirstCallParameter: 30
PenaltyBreakComment: 10
PenaltyBreakFirstLessLess: 0
PenaltyBreakString: 10
PenaltyExcessCharacter: 100
PenaltyReturnTypeOnItsOwnLine: 60
PointerAlignment: Right
ReflowComments: false
SortIncludes: false
SortUsingDeclarations: false
SpaceAfterCStyleCast: false
SpaceAfterTemplateKeyword: true
SpaceBeforeAssignmentOperators: true
SpaceBeforeCtorInitializerColon: true
SpaceBeforeInheritanceColon: true
SpaceBeforeParens: ControlStatementsExceptForEachMacros
SpaceBeforeRangeBasedForLoopColon: true
SpaceInEmptyParentheses: false
SpacesBeforeTrailingComments: 1
SpacesInAngles: false
SpacesInContainerLiterals: false
SpacesInCStyleCastParentheses: false
SpacesInParentheses: false
SpacesInSquareBrackets: false
Standard: Auto
TabWidth: 4
UseTab: Never
...
================================================
FILE: .github/FUNDING.yml
================================================
github: orhun
patreon: orhunp
custom: ["https://www.buymeacoffee.com/orhun"]
================================================
FILE: .github/workflows/ci.yml
================================================
name: Continuous Integration
on:
push:
branches:
- master
pull_request:
branches:
- master
jobs:
build:
name: Build & Test
runs-on: ubuntu-latest
steps:
- name: Checkout
uses: actions/checkout@v3
- name: Run tests
shell: bash
run: ./test.sh
working-directory: scripts
env:
UPLOAD: true
================================================
FILE: .github/workflows/docker.yml
================================================
name: Docker Automated Builds
on:
push:
branches:
- master
tags:
- '*'
pull_request:
branches:
- master
jobs:
docker:
name: Docker Build and Push
runs-on: ubuntu-latest
steps:
- name: Checkout
uses: actions/checkout@v3
- name: Docker meta
id: meta
uses: docker/metadata-action@v3
with:
images: |
orhunp/zps
ghcr.io/${{ github.repository_owner }}/zps
tags: |
type=schedule
type=ref,event=branch
type=ref,event=pr
type=sha
type=raw,value=latest
type=semver,pattern={{version}}
- name: Set up QEMU
uses: docker/setup-qemu-action@v1
with:
platforms: arm64
- name: Set up Docker Buildx
id: buildx
uses: docker/setup-buildx-action@v1
- name: Cache Docker layers
uses: actions/cache@v2
with:
path: /tmp/.buildx-cache
key: ${{ runner.os }}-buildx-${{ github.sha }}
restore-keys: |
${{ runner.os }}-buildx-
- name: Login to Docker Hub
if: github.event_name != 'pull_request'
uses: docker/login-action@v1
with:
username: orhunp
password: ${{ secrets.DOCKER_HUB_ACCESS_TOKEN }}
- name: Login to GHCR
if: github.event_name != 'pull_request'
uses: docker/login-action@v1
with:
registry: ghcr.io
username: ${{ github.repository_owner }}
password: ${{ secrets.GITHUB_TOKEN }}
- name: Build and push
id: docker_build
uses: docker/build-push-action@v2
with:
context: ./
file: ./docker/Dockerfile
platforms: linux/amd64,linux/arm64
builder: ${{ steps.buildx.outputs.name }}
push: ${{ github.event_name != 'pull_request' }}
tags: ${{ steps.meta.outputs.tags }}
labels: ${{ steps.meta.outputs.labels }}
cache-from: type=local,src=/tmp/.buildx-cache
cache-to: type=local,dest=/tmp/.buildx-cache
- name: Image digest
run: echo ${{ steps.docker_build.outputs.digest }}
================================================
FILE: .gitignore
================================================
### C ###
# 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
# Build directory
build/*
================================================
FILE: CMakeLists.txt
================================================
# CMake minimum required: 3.15
cmake_minimum_required(VERSION 3.15)
# Project information
project(zps C)
# Target
set(TARGET "zps")
# Add project source
add_executable(${TARGET})
target_sources(${TARGET} PRIVATE src/${TARGET}.c src/${TARGET}.h)
# Compile options
target_compile_options(${TARGET} PRIVATE -s -O3 -Wall -Wextra -pedantic)
target_compile_definitions(${TARGET} PRIVATE NDEBUG)
# Install
install(TARGETS ${TARGET} RUNTIME DESTINATION bin)
================================================
FILE: LICENSE
================================================
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the
Program specifies that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU General Public License does not permit incorporating your program
into proprietary programs. If your program is a subroutine library, you
may consider it more useful to permit linking proprietary applications with
the library. If this is what you want to do, use the GNU Lesser General
Public License instead of this License. But first, please read
.
================================================
FILE: Makefile
================================================
# Project and compiler information
NAME := zps
CFLAGS := -s -O3 -Wall -Wextra -pedantic -DNDEBUG
ifeq ($(CC),)
CC := gcc
endif
all: clean build
# Build the project
build:
mkdir -p build
$(CC) $(CFLAGS) src/$(NAME).c -o build/$(NAME)
cp -prf .application/$(NAME).desktop build/$(NAME).desktop
# Make the installation
install:
# Create directories if doesn't exist
mkdir -p $(TARGET)/usr/bin
mkdir -p $(TARGET)/usr/share/applications
# Install
install build/$(NAME) $(TARGET)/usr/bin/$(NAME)
install build/$(NAME).desktop $(TARGET)/usr/share/applications/$(NAME).desktop
# Clean
clean:
rm -rf build
.PHONY: all build install clean
================================================
FILE: README.md
================================================
# zps [](https://github.com/orhun/zps/releases)
### A small utility for listing and reaping zombie processes on GNU/Linux.
[](https://github.com/orhun/zps/actions?query=workflow%3A%22Continuous+Integration%22)
[](https://github.com/orhun/zps/actions?query=workflow%3A%22Docker+Automated+Builds%22)
[](https://www.codacy.com/manual/orhun/zps?utm_source=github.com&utm_medium=referral&utm_content=orhun/zps&utm_campaign=Badge_Grade)
[](https://codecov.io/gh/orhun/zps)
[](https://github.com/orhun/zps/stargazers) [](./LICENSE)
On 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".
Unlike 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.
Zombie 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.
[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.
```
cd example/ && gcc -O3 -Wall zproc.c -o zproc && ./zproc
```
**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.
Technically, **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.
Table of Contents
- [Installation](#installation)
- [Arch Linux](#arch-linux)
- [Alpine Linux](#alpine-linux)
- [Fedora Linux](#fedora-linux)
- [CMake](#cmake)
- [Make](#make)
- [GCC](#gcc)
- [Docker](#docker)
- [Building an image](#building-an-image)
- [Running the image in container](#running-the-image-in-container)
- [Usage](#usage)
- [zps -r](#zps--r--reap)
- [zps -s](#zps--s--signal)
- [zps -p](#zps--p--prompt)
- [zps -q](#zps--q--quiet)
- [zps -n](#zps--n--no-color)
- [TODO(s)](#todos)
- [License](#license)
- [Copyright](#copyright)
## Installation
### Arch Linux
```
pacman -S zps
```
### Alpine Linux
```
apk add zps
```
### Fedora Linux
```
dnf install zps
```
### CMake
```
mkdir -p build && cd build
cmake ../ -DCMAKE_INSTALL_PREFIX=/usr
make
sudo make install
sudo ldconfig
```
### Make
```
make
sudo make install
```
### GCC
With manual compilation, you might want to also pass
`-DNDEBUG` to disable runtime assertions.
```
cd src/ && gcc -s -O3 -Wall -Wextra -pedantic zps.c -o zps
```
### Docker
#### Building an image
```
docker build -f docker/Dockerfile -t zps .
```
#### Running the image in container
```
docker run zps
```
## Usage
```
Usage:
zps [options]
Options:
-v, --version show version
-h, --help show help
-a, --all list all user-space processes
-r, --reap reap zombie processes
-s, --signal signal to be used on zombie parents
-p, --prompt show prompt for selecting processes
-q, --quiet reap in quiet mode
-n, --no-color disable color output
```
### zps -r/--reap
### zps -s/--signal
### zps -p/--prompt
### zps -q/--quiet
### zps -n/--no-color
## License
GNU General Public License v3.0 only ([GPL-3.0-only](https://www.gnu.org/licenses/gpl.txt))
## Copyright
Copyright © 2019-2024, [Orhun Parmaksız](mailto:orhunparmaksiz@gmail.com)
================================================
FILE: README_KO.md
================================================
# zps [](https://github.com/orhun/zps/releases)
### GNU/Linux에서 좀비 프로세스를 나열하고 끄는(reaping) 작은 유틸리티성 프로그램
[](https://github.com/orhun/zps/actions?query=workflow%3A%22Continuous+Integration%22)
[](https://github.com/orhun/zps/actions?query=workflow%3A%22Docker+Automated+Builds%22)
[](https://www.codacy.com/manual/orhun/zps?utm_source=github.com&utm_medium=referral&utm_content=orhun/zps&utm_campaign=Badge_Grade)
[](https://codecov.io/gh/orhun/zps)
[](https://github.com/orhun/zps/stargazers) [](./LICENSE)
Unix와 컴퓨터 운영체제와 같은 Unix에서, [좀비 프로세스](https://en.wikipedia.org/wiki/Zombie_process) 또는 Defunct 프로세스는 (시스템 호출 [종료]()을 통해 이루어진) 종료가 되어도 프로세스 목록에 남아 있습니다. 이 현상은 부모 프로세스가 (시스템 호출 [중단]()을 통해) 자식의 종료 상태를 알 필요가 있는 목록에서 자식 프로세스들에게 발생됩니다. 그렇게 좀비 프로세스를 목록에서 제거할 수 있었고, 이것을 "reaped"라고 합니다.
일반 프로세스들과 다르게, 좀비프로세스들은 이미 죽었기 때문에 [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번인 프로세스, 모든 프로세스의 조상 역할을 함.)가 자식 프로세스의 새로운 조상이 되고, 그것은 좀비 프로세스들을 시스템 호출 [중단]()을 해서 끌 수 있습니다.
좀비 프로세스들은 다른 프로세스들에 영향을 끼치거나 시스템 자원을 사용하지 않기 때문에 해롭지 않습니다. 하지만, 그들은 [프로세스 ID](https://en.wikipedia.org/wiki/Process_identifier)를 소유하고 있습니다. 이것은 모든 사용 가능한 PID를 좀비 프로세스가 차지하고 있다면 새로운 프로세스를 실행하는 것이 불가능 할 수 있습니다. Unix와 같은 시스템들에서는 프로세스 ID (`/proc/sys/kernel/pid_max`)를 한정된 양(제 우분투에서는 32768이 최댓값이네요.)만 갖고 있습니다. 이것만이 좀비 프로세스가 일으킬 수 있는 문제점입니다. 좀비 프로세스의 다른 위험성은 만약 좀비 프로세스가 프로세스 목록에 오랫동안 머무른다면, [메모리 누수](https://en.wikipedia.org/wiki/Resource_leak)를 일으킬 수 있다는 것입니다. 이러한 문제 외에도, 적은 양의 좀비 프로세스는 그들의 부모 프로세스에 버그를 생성할 지라도 시스템에 큰 영향을 주지는 않을 것입니다.
[zproc.c](https://github.com/orhun/zps/blob/master/example/zproc.c) 파일을 컴파일 할 수 있고, 어떻게 좀비 프로세스가 생성되는지 확인할 수 있습니다.
```
cd example/ && gcc -O3 -Wall zproc.c -o zproc && ./zproc
```
특정 시간에 실행하고 있는 프로세스들의 정보의 리스트와 좀비 프로세스들을 표시하기 위해 **zps**를 만들었습니다. 이 프로그램은, 자동으로 좀비 프로세스들을 종료할 수 있습니다. 좀 더 자세한 정보를 보려면 [사용법](https://github.com/orhun/zps#usage)을 보세요.
기술적으로, **zps**는 [/proc](https://www.tldp.org/LDP/Linux-Filesystem-Hierarchy/html/proc.html) 파일 시스템에서 프로세스 정보를 얻어오고, 프로세스를 출력하고 신호를 보내고 이외의 다른 동작들을 하기 위해 [C POSIX library](https://en.wikipedia.org/wiki/C_POSIX_library)를 이용합니다.
- [설치 방법](#설치-방법)
- [Arch Linux](#arch-linux)
- [Alpine Linux](#alpine-linux)
- [Fedora Linux](#fedora-linux)
- [CMake](#cmake)
- [Make](#make)
- [GCC](#gcc)
- [Docker](#docker)
- [이미지 생성](#이미지-생성)
- [컨테이너에서 이미지 실행](#컨테이너에서-이미지-실행)
- [사용법](#사용법)
- [zps -r](#zps--r--reap)
- [zps -s](#zps--s--signal)
- [zps -p](#zps--p--prompt)
- [zps -q](#zps--q--quiet)
- [zps -n](#zps--n--no-color)
- [TODO(s)](#todos)
- [License](#license)
- [Copyright](#copyright)
## 설치 방법
### Arch Linux
```
pacman -S zps
```
### Alpine Linux
```
apk add zps
```
### Fedora Linux
```
dnf install zps
```
### CMake
```
mkdir -p build && cd build
cmake ../ -DCMAKE_INSTALL_PREFIX=/usr
make
sudo make install
sudo ldconfig
```
### Make
```
make
sudo make install
```
### GCC
수동 컴파일 시에는 런타임 어설션을 비활성화하려면 `-DNDEBUG`도 전달하실 수 있습니다.
```
cd src/ && gcc -s -O3 -Wall -Wextra -pedantic zps.c -o zps
```
### Docker
#### 이미지 생성
```
docker build -f docker/Dockerfile -t zps .
```
#### 컨테이너에서 이미지 실행
```
docker run zps
```
## 사용법
```
사용법:
zps [options]
옵션:
-v, --version 버전 보기
-h, --help 사용법 보기
-a, --all 모든 사용자 공간 프로세스 나열
-r, --reap 좀비 프로세스 종료하기
-s, --signal 좀비 부모에 사용할 신호
-p, --prompt 프로세스 선택을 위한 프롬프트 표시
-q, --quiet quiet 모드로 실행하기
-n, --no-color 색상 출력 비활성화
```
### zps -r/--reap
### zps -s/--signal
### zps -p/--prompt
### zps -q/--quiet
### zps -n/--no-color
## License
GNU General Public License v3.0 only ([GPL-3.0-only](https://www.gnu.org/licenses/gpl.txt))
## Copyright
Copyright © 2019-2024, [Orhun Parmaksız](mailto:orhunparmaksiz@gmail.com)
Translated to Korean by ahdelron.
================================================
FILE: docker/Dockerfile
================================================
# Create Alpine image for build
FROM alpine:3.16.2 AS build-image
# Set locale
ENV LC_ALL=C.UTF-8
# Install compiler and standard library
RUN apk add --no-cache gcc musl-dev
# Set working directory
WORKDIR /app/
# Copy source files to working directory
COPY src .
# Compile
RUN gcc -s -O3 -Wall -Wextra -pedantic -DNDEBUG zps.c -o zps
# Create Alpine image for runtime
FROM alpine:3.16.2 AS runtime-image
# Set working directory
WORKDIR /root/
# Copy executable to working directory
COPY --from=build-image /app/zps .
# Execute
CMD ["./zps"]
================================================
FILE: example/zproc.c
================================================
/**!
* On Unix and Unix-like computer operating systems, a zombie process
* or defunct process is a process that has completed execution but still
* has an entry in the process table. (Wikipedia)
* This program illustrates how zombie or defunct processes are created.
* Copyright © 2019-2024 by Orhun Parmaksız
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#include
#include
#include
#include
/*!
* Entry point
*/
int main(int argc, char *argv[])
{
unsigned int sleep_seconds = 60;
if (argc == 2) { /* Parse command line argument. */
sscanf(argv[1], "%u", &sleep_seconds);
}
pid_t pid = fork();
if (pid > 0) { /* Parent process */
/**
* Sleep and eventually exit without the wait call.
* This will cause child process to be a defunct process.
*/
fprintf(stderr, "PPID: %d\n", getpid());
sleep(sleep_seconds);
} else if (!pid) { /* Child process */
fprintf(stderr, "PID: %d\n", getpid());
}
return EXIT_SUCCESS;
}
================================================
FILE: man/zps.1
================================================
.\" Manpage for zps.
.TH ZPS "1" "January 2024" "zps" "User Commands"
.SH NAME
zps \- list/reap zombie processes
.SH SYNOPSIS
.B zps
[options]
.SH DESCRIPTION
zps lists the running processes with their stats and indicates/reaps the zombie processes.
.SH OPTIONS
.TP
.BR \-v ", " \-\-version
Show version information.
.TP
.BR \-h ", " \-\-help
Show the help text.
.TP
.BR \-a ", " \-\-all
List all user-space processes (not just zombies).
.TP
.BR \-r ", " \-\-reap
Reap zombie processes.
.TP
.BI \-s\ sig \fR,\ \fB\-\-signal= sig \fR,\ \fB\-\-signal \ sig
Use signal
.I sig
on zombie parents (default:
.BR SIGTERM ).
.TP
.BR \-p ", " \-\-prompt
Show prompt for selecting processes.
.TP
.BR \-q ", " \-\-quiet
Reap in quiet mode.
.TP
.BR \-n ", " \-\-no-color
Disable color output.
.SH BUGS
No known bugs.
Use "Issues" page for reporting bugs:
.SH AUTHOR
Written by Orhun Parmaksız
.SH COPYRIGHT
Copyright © 2019-2024 Orhun Parmaksız
.P
GNU General Public License v3.0 only
================================================
FILE: scripts/release.sh
================================================
#!/usr/bin/env bash
set -e
project_dir="$(pwd)/.."
# Create tag
read -rp "Tag: " tag
git -c user.signingkey="B928720AEC532117" tag -s -a "$tag"
# Create assets
cd "$project_dir"
make
cd "$project_dir/build/" || exit
tar -czvf "zps-$tag.tar.gz" zps ../README.md \
../LICENSE ../man/zps.1 zps.desktop
gpg --local-user "B928720AEC532117" \
--detach-sign "zps-$tag.tar.gz"
shasum -a 512 "zps-$tag.tar.gz" > "zps-$tag.tar.gz.sha512"
# Upload assets
# https://github.com/buildkite/github-release
gh-release "v$tag" "zps-$tag".* \
--tag "$tag" \
--github-repository "orhun/zps" \
# Push tag
git push --tags
# Clean up
#rm -f "zps-$tag".*
cd .. || exit
echo "New release locked and ready (v$tag)"
================================================
FILE: scripts/test.sh
================================================
#!/usr/bin/env bash
set -e
project_dir="$(pwd)/.."
# Compile the example & run
cd "${project_dir}/example"
gcc -O3 -Wall zproc.c -o z.o
./z.o &>/dev/null &
./z.o &>/dev/null &
# Compile the main source & run
cd "${project_dir}/src"
gcc -fprofile-arcs -ftest-coverage -s -O3 -Wall -Wextra -pedantic zps.c -o zps
./zps -v && ./zps -h && printf '1' | ./zps -p
./zps -a && ./zps -r
./zps -q && ./zps -s 9 && ./zps -s SIGTERM && ./zps -s term
./zps -n
# Print code coverage information
gcov zps.c
# Send report to codecov
[ "$UPLOAD" == 'true' ] && bash <(curl -s https://codecov.io/bash)
# Cleanup
rm -v zps zps.c.* zps.gc*
================================================
FILE: src/zps.c
================================================
/**!
* zps, a small utility for listing and reaping zombie processes.
* Copyright © 2019-2024 by Orhun Parmaksız
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#define _GNU_SOURCE
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include "zps.h"
#ifndef PATH_MAX
#define PATH_MAX MAX_BUF_SIZE
#endif
/* Array used for lookup of common signals' abbreviations */
static const char *const abbrevs[NSIG] = {
[SIGHUP] = "HUP", [SIGINT] = "INT", [SIGQUIT] = "QUIT",
[SIGILL] = "ILL", [SIGTRAP] = "TRAP", [SIGABRT] = "ABRT",
[SIGFPE] = "FPE", [SIGKILL] = "KILL", [SIGBUS] = "BUS",
[SIGSYS] = "SYS", [SIGSEGV] = "SEGV", [SIGPIPE] = "PIPE",
[SIGALRM] = "ALRM", [SIGTERM] = "TERM", [SIGURG] = "URG",
[SIGSTOP] = "STOP", [SIGTSTP] = "TSTP", [SIGCONT] = "CONT",
[SIGCHLD] = "CHLD", [SIGTTIN] = "TTIN", [SIGTTOU] = "TTOU",
[SIGPOLL] = "POLL", [SIGXCPU] = "XCPU", [SIGXFSZ] = "XFSZ",
[SIGVTALRM] = "VTALRM", [SIGPROF] = "PROF", [SIGUSR1] = "USR1",
[SIGUSR2] = "USR2", [SIGWINCH] = "WINCH",
};
/*!
* Helper to get the string abbreviation of signal constants
*
* @param[in] sig Signal number to get the string representation of
*
* @return String representing the signal constant (abbreviated),
* or NULL if no corresponding signal string was found
*/
static const char *sig_abbrev(int sig)
{
if (sig < 0 || !((size_t)sig < sizeof(abbrevs))) {
return NULL;
}
return abbrevs[sig];
}
/*!
* Attempts to find the corresponding signal number to the
* given signal constant's name
*
* @param[in] sig_str Signal name to convert
*
* @return -1 on error, the corresponding signal number otherwise
*/
static int sig_str_to_num(const char *sig_str)
{
assert(sig_str);
const char *const prefix = "SIG";
const size_t prefix_len = strlen(prefix);
if (!strncasecmp(sig_str, prefix, prefix_len)) {
sig_str += prefix_len;
}
for (size_t sig = 0; sig < sizeof(abbrevs) / sizeof(abbrevs[0]); ++sig) {
if (!abbrevs[sig]) {
continue;
}
if (!strcasecmp(sig_str, abbrevs[sig])) {
return sig;
}
}
return -1;
}
/*!
* Tries to associate the user's signal input with a known
* signal number
*
* @param[in] sig_str Signal characters to convert
*
* @return -1 on error, the corresponding signal number otherwise
*/
static int user_signal(const char *sig_str)
{
if (!sig_str) {
return -1;
}
if (!isdigit(*sig_str)) {
return sig_str_to_num(sig_str);
}
int sig = -1;
if (sscanf(sig_str, "%d", &sig) != 1 || sig < 0 || NSIG <= sig) {
return -1;
}
return abbrevs[sig] ? sig : -1;
}
/*!
* Checks if the standard I/O streams refer to a terminal and deduces
* whether to use colored output.
*
* @param[out] settings Settings struct to update
*
* @return void
*/
static void check_interactive(struct zps_settings *settings)
{
assert(settings);
settings->color_allowed = settings->interactive =
isatty(STDIN_FILENO) && isatty(STDOUT_FILENO) && isatty(STDERR_FILENO);
}
/*!
* Write colored and formatted text to the specified stream.
*
* Resets the display attributes before returning
*
* @param[in] color ANSI SGR control sequence parameter n (color code)
* @param[in] color_allowed Boolean specifying whether we can print color
* @param[out] stream Pointer to the file to write to
* @param[in] format Format string specifying the text to print
* @param[in] ... Variable format string arguments
*
* @return void
*/
static void cfprintf(enum ansi_fg_color_code color, bool color_allowed,
FILE *stream, const char *format, ...)
{
va_list vargs;
assert(stream);
assert(format);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", color);
}
va_start(vargs, format);
vfprintf(stream, format, vargs);
va_end(vargs);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", ANSI_FG_NORMAL);
}
}
/*!
* Write bold, colored and formatted text to the specified stream.
*
* Resets the display attributes before returning
*
* @param[in] color ANSI SGR control sequence parameter n (color code)
* @param[in] color_allowed Boolean specifying whether we can print color
* @param[out] stream Pointer to the file to write to
* @param[in] format Format string specifying the text to print
* @param[in] ... Variable format string arguments
*
* @return void
*/
static void cbfprintf(enum ansi_fg_color_code color, bool color_allowed,
FILE *stream, const char *format, ...)
{
va_list vargs;
assert(stream);
assert(format);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", ANSI_DISPLAY_MODE_BOLD);
if (color) {
fprintf(stream, "\x1b[%dm", color);
}
}
va_start(vargs, format);
vfprintf(stream, format, vargs);
va_end(vargs);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", ANSI_DISPLAY_MODE_NORMAL);
}
}
/*!
* Write bold, colored and formatted text to the specified stream.
*
* Encloses the bold and colored text.
*
* @param[in] color ANSI SGR control sequence parameter n (color code)
* @param[in] color_allowed Boolean specifying whether we can print color
* @param[in] before String to put before the colored content
* @param[in] after String to put after the colored content
* @param[out] stream Pointer to the file to write to
* @param[in] format Format string specifying the text to print
* @param[in] ... Variable format string arguments
*
* @return void
*/
static void cbfprintf_enclosed(enum ansi_fg_color_code color,
bool color_allowed, const char *before,
const char *after, FILE *stream,
const char *format, ...)
{
va_list vargs;
assert(before);
assert(after);
assert(stream);
assert(format);
fprintf(stream, "%s", before);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", ANSI_DISPLAY_MODE_BOLD);
if (color) {
fprintf(stream, "\x1b[%dm", color);
}
}
va_start(vargs, format);
vfprintf(stream, format, vargs);
va_end(vargs);
if (color_allowed) {
fprintf(stream, "\x1b[%dm", ANSI_DISPLAY_MODE_NORMAL);
}
fprintf(stream, "%s", after);
}
/*!
* Print version and exit
*
* @param[in] status Exit status to use
* @param[in] settings Pointer to settings determining output coloring (bold)
*/
static void __attribute__((noreturn))
version_exit(int status, struct zps_settings *settings)
{
assert(settings);
cbfprintf(ANSI_FG_NORMAL, settings->interactive, status ? stderr : stdout,
"\n -hhhhdddddd/\n"
" `++++++mMN+\n"
" :dMy.\n"
" -yMMh.\n"
" `oNNo:shy:`\n"
" .dMm:```.+dNh`\n"
" .github/orhun/zps v%s\n\n",
VERSION);
exit(status);
}
/*!
* Print help and exit
*
* @param[in] status Exit status to use
*/
static void __attribute__((noreturn)) help_exit(int status)
{
fprintf(status ? stderr : stdout,
"\nUsage:\n"
" zps [options]\n\n"
"Options:\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");
exit(status);
}
/*!
* Redirect `stream` to file `"/dev/null"`
*
* @param[out] stream I/O stream to silence
*
* @return void
*/
static void silence(FILE *stream)
{
assert(stream);
const int fd = open("/dev/null", O_WRONLY);
if (fd != -1) {
dup2(fd, fileno(stream));
close(fd);
}
}
/*!
* Function performing sanity checks on the configured settings
*
* This function will call `exit()` if the settings are erroneous.
*
* @param[in] settings Settings to check
*
* @return void
*/
static void settings_check(const struct zps_settings *settings)
{
assert(settings);
bool failed = false;
if (settings->sig == -1) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"Unknown signal\n");
failed = true;
}
if (settings->sig && !settings->signal) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"The -s option has to be used with either -r or -p\n");
failed = true;
}
if (settings->quiet) {
if (settings->show_all) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"Incompatible options: -q, -a\n");
failed = true;
}
if (settings->prompt) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"Incompatible options: -q, -p\n");
failed = true;
}
}
if (failed) {
help_exit(EXIT_FAILURE);
}
}
/*!
* Parse command line arguments.
*
* @param[in] argc Argument count
* @param[in,out] argv Argument vector (which may be permuted (GNU))
* @param[out] settings Pointer to struct for user-specified settings
*
* @return void
*/
static void parse_args(int argc, char *argv[], struct zps_settings *settings)
{
/* Long options for command line arguments */
static const struct option longopts[] = {
{ "version", no_argument, NULL, 'v'},
{ "help", no_argument, NULL, 'h'},
{ "all", no_argument, NULL, 'a'},
{ "reap", no_argument, NULL, 'r'},
{ "signal", required_argument, NULL, 's'},
{ "prompt", no_argument, NULL, 'p'},
{ "quiet", no_argument, NULL, 'q'},
{"no-color", no_argument, NULL, 'n'},
{ NULL, 0, NULL, 0},
};
assert(argv);
assert(settings);
for (int opt;
(opt = getopt_long(argc, argv, "vhars:pqn", longopts, NULL)) != -1;) {
switch (opt) {
case 'v': /* Show version information. */
version_exit(EXIT_SUCCESS, settings);
case 'h': /* Show help message. */
help_exit(EXIT_SUCCESS);
case 'a': /* List all processes. */
settings->show_all = true;
break;
case 'r': /* Actually reap the zombies. */
settings->signal = true;
break;
case 's': /* User-specified zombie parent signal. */
settings->sig = user_signal(optarg);
break;
case 'p': /* Show a prompt for interactive reaping. */
settings->prompt = true;
settings->signal = true;
break;
case 'q': /* Quiet reap mode. */
settings->quiet = true;
settings->signal = true;
break;
case 'n': /* Disable color output. */
settings->color_allowed = false;
break;
default:
help_exit(EXIT_FAILURE);
}
}
settings_check(settings);
}
/*!
* Read the given file and return its content.
*
* @param[in,out] buf Buffer to read bytes from the file into
* @param[in] bufsiz Size of allocated `buf`
* @param[in] format Format string specifying the file path
* @param[in] ... Variable format string arguments
*
* @return number of bytes successfully read (max: `bufsiz - 1`),
`-1` on error
*/
static ssize_t read_file(char *buf, size_t bufsiz, const char *format, ...)
{
va_list vargs;
char path[PATH_MAX] = {0};
assert(buf);
assert(bufsiz > 0);
assert(format);
va_start(vargs, format);
int num_required = vsnprintf(path, sizeof(path), format, vargs);
va_end(vargs);
/* Check for errors or truncation */
if (num_required < 0 || (size_t)num_required >= sizeof(path)) {
return -1;
}
const int fd = open(path, O_RDONLY);
if (fd == -1) {
return -1;
}
memset(buf, '\0', bufsiz);
ssize_t read_rc = read(fd, buf, bufsiz - 1);
close(fd);
return read_rc;
}
/*!
* Parse the content of `"/proc//stat"` into `proc_stats`.
*
* @param[in,out] stat_buf Null-terminated buffer containing the contents of
`"/proc//stat"` from offset `0`; will be
modified during execution
* @param[out] proc_stats Pointer to write the process information to
*
* @return `-1` on error, otherwise `0` is returned
*/
static int parse_stat_content(char *stat_buf, struct proc_stats *proc_stats)
{
assert(stat_buf);
assert(proc_stats);
/* Start with the PID field */
if (sscanf(stat_buf, "%d", &proc_stats->pid) != 1) {
return -1;
}
/* Pointer bounds for `comm` in the buffer */
const char *begin = strchr(stat_buf, '(');
if (!begin) {
return -1;
}
char *const end = strrchr(begin, ')');
if (!end || end[1] == '\0') {
return -1;
}
++begin;
const char *const last_fields = end + 2;
/*
begin:
%d (...) %c %d
^
end:
%d (...) %c %d
^
last_fields:
%d (...) %c %d
^
*/
/* Extract the last fields first */
if (sscanf(last_fields, "%c %d", &proc_stats->state, &proc_stats->ppid) !=
2) {
return -1;
}
/* Limit `comm_strlen` */
*end = '\0';
const size_t comm_strlen = strnlen(begin, sizeof(proc_stats->name) - 1);
/* Extract the process name (limited by `comm_strlen`) */
memcpy(proc_stats->name, begin, comm_strlen);
/* Make sure string ends here */
proc_stats->name[comm_strlen] = '\0';
return 0;
}
/*!
* Parse and return the stats for a given PID.
*
* @param[in] pid String containing the PID
* @param[out] proc_stats Pointer to the struct to write to
*
* @return `-1` on error, `0` otherwise
*/
static int get_proc_stats(const char *pid, struct proc_stats *proc_stats)
{
char stat_buf[MAX_BUF_SIZE] = {0};
assert(pid);
assert(proc_stats);
/* Read the `"/proc//stat"` file. */
if (read_file(stat_buf, sizeof(stat_buf), "%s/%s/%s", PROC_FILESYSTEM, pid,
STAT_FILE) == -1) {
return -1;
}
if (parse_stat_content(stat_buf, proc_stats)) {
return -1;
}
/* We do not want kernel processes/threads */
if (proc_stats->ppid == KTHREADD_PID || proc_stats->pid == KTHREADD_PID) {
return -1;
}
/* Read the `"/proc//cmdline"` file */
const ssize_t cmd_len = read_file(proc_stats->cmd, sizeof(proc_stats->cmd),
"%s/%s/%s", PROC_FILESYSTEM, pid,
CMD_FILE);
if (cmd_len == -1) {
return -1;
}
/* Replace any null bytes with spaces to also print further arguments */
for (size_t i = 0; i < (size_t)cmd_len; ++i) {
if (!proc_stats->cmd[i]) {
proc_stats->cmd[i] = ' ';
}
}
return 0;
}
/*!
* Send signal to the given PPID of the `proc_stats` entry.
*
* @param[in] proc_stats Pointer to the entry to send the signal for
* @param[in] settings Pointer to user-specified settings (signal?)
* @param[out] stats The `signaled_procs` field will be updated
* @param[in] verbose Boolean specifying the behavior (print result)
*
* @return `-1` on error, otherwise `0` is returned
*/
static int handle_zombie(const struct proc_stats *proc_stats,
const struct zps_settings *settings,
struct zps_stats *stats, bool verbose)
{
assert(proc_stats);
assert(settings);
assert(stats);
const pid_t ppid = proc_stats->ppid;
if (ppid <= 0 || ppid == INIT_PID || ppid == KTHREADD_PID) {
return -1;
}
const int sig = settings->sig ? settings->sig : SIGTERM;
const int kill_rc = kill(ppid, sig);
if (!kill_rc) {
++stats->signaled_procs;
const char *const sigabbrev = sig_abbrev(sig);
if (verbose) {
cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, "\n[", "]",
stdout, "SIG%s",
sigabbrev ? sigabbrev : "Unknown signal");
}
} else if (verbose) {
cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, "\n[", "]",
stdout, "Failed to signal");
}
return kill_rc;
}
/*!
* Iterate over found zombies and list information while doing so.
*
* If the user is not to be prompted, this function immediately sends a signal.
*
* @param[in] defunct_procs Pointer to the zombie process vector
* @param[in] settings Pointer to user-specified settings (signal?)
* @param[out] stats The `signaled_procs` field will be updated
*
* @return void
*/
static void handle_found_zombies(const struct proc_vec *defunct_procs,
const struct zps_settings *settings,
struct zps_stats *stats)
{
assert(defunct_procs);
assert(settings);
assert(stats);
for (size_t i = 0, sz = proc_vec_size(defunct_procs); i < sz; ++i) {
const struct proc_stats *const entry = proc_vec_at(defunct_procs, i);
if (!settings->prompt) {
handle_zombie(entry, settings, stats, true);
} else {
cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed, "\n[", "]",
stdout, "%zu", i + 1);
}
fprintf(stdout,
"\n Name: %s\n PID: %d\n PPID: %d\n State: %c\n",
entry->name, entry->pid, entry->ppid, entry->state);
}
}
/*!
* Iterate through `"/proc"` and save found zombie entries.
*
* @param[out] defunct_procs Pointer to the zombie process vector to fill
* @param[in] settings Pointer to user-specified settings (list?)
* @param[out] stats The `defunct_count` field will be updated
*
* @return void
*/
static void proc_iter(struct proc_vec *defunct_procs,
const struct zps_settings *settings,
struct zps_stats *stats)
{
assert(defunct_procs);
assert(settings);
assert(stats);
DIR *dir = opendir(PROC_FILESYSTEM);
if (dir == NULL) {
return;
}
for (;;) {
struct dirent *d = readdir(dir);
if (d == NULL) {
break;
}
if (!(d->d_type == DT_DIR && isdigit(d->d_name[0]))) {
continue;
}
struct proc_stats proc_stats = {0};
/* Get the process stats from the path. */
if (get_proc_stats(d->d_name, &proc_stats)) {
continue;
} else if (proc_stats.state == STATE_ZOMBIE) {
++stats->defunct_count;
/* Add process to the array of defunct processes (could fail) */
proc_vec_add(defunct_procs, proc_stats);
}
/* Print the process's stats. */
if (settings->show_all || proc_stats.state == STATE_ZOMBIE) {
cfprintf(
proc_stats.state == STATE_ZOMBIE ? ANSI_FG_RED : ANSI_FG_NORMAL,
settings->color_allowed, stdout, "%-*d %-*d %-*c %*.*s %s\n",
PID_COL_WIDTH, proc_stats.pid, PPID_COL_WIDTH, proc_stats.ppid,
STATE_COL_WIDTH, proc_stats.state, NAME_COL_WIDTH,
NAME_COL_WIDTH, proc_stats.name, proc_stats.cmd);
}
}
closedir(dir);
}
/*!
* Request user input to explicitly signal processes.
*
* @param[in,out] defunct_procs Pointer to the zombie process vector
* @param[in] settings Pointer to user-specified settings (signal?)
* @param[out] stats The `signaled_procs` field will be updated
*
* @return void
*/
static void prompt_user(const struct proc_vec *defunct_procs,
const struct zps_settings *settings,
struct zps_stats *stats)
{
char index_prompt[MAX_BUF_SIZE] = {0};
assert(defunct_procs);
assert(settings);
assert(stats);
/* Print user input message and ask for input. */
fprintf(stdout, "\nEnter process index(es) to proceed: ");
fflush(stdout);
if (!fgets(index_prompt, sizeof(index_prompt), stdin)) {
return;
}
/* Split the given input. */
char *saveptr = NULL;
for (char *token = strtok_r(index_prompt, DELIMS, &saveptr); token;
token = strtok_r(NULL, DELIMS, &saveptr)) {
size_t index = 0;
if (token[0] == '-' || sscanf(token, "%zu", &index) != 1) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"\nInvalid input: %s\n", token);
continue;
}
--index;
if (!(index < proc_vec_size(defunct_procs))) {
cfprintf(ANSI_FG_RED, settings->color_allowed, stderr,
"\nIndex not in range: %zu\n", index + 1);
continue;
}
const struct proc_stats *entry = proc_vec_at(defunct_procs, index);
handle_zombie(entry, settings, stats, true);
cbfprintf_enclosed(ANSI_FG_MAGENTA, settings->color_allowed, " -> ",
" ", stdout, "%s", entry->name);
cbfprintf_enclosed(ANSI_FG_MAGENTA, settings->color_allowed,
"[PID (Z): ", ", ", stdout, "%d", entry->pid);
cbfprintf_enclosed(ANSI_FG_RED, settings->color_allowed,
"PPID: ", "]\n", stdout, "%d", entry->ppid);
}
}
/*!
* Check running process's states using the `"/proc"` filesystem.
*
* @param[in] settings Pointer to user-specified settings
* @param[out] stats Pointer to statistics to update for the zombies found
*
* @return -1 on error, 0 otherwise
*/
static int check_procs(struct zps_settings *settings, struct zps_stats *stats)
{
assert(settings);
assert(stats);
struct proc_vec *const defunct_procs = proc_vec();
if (!defunct_procs) {
return -1;
}
/* Print column titles (header line). */
cbfprintf(ANSI_FG_NORMAL, settings->color_allowed, stdout,
"%-*s %-*s %-*s %*.*s %s\n", PID_COL_WIDTH, "PID", PPID_COL_WIDTH,
"PPID", STATE_COL_WIDTH, "STATE", NAME_COL_WIDTH, NAME_COL_WIDTH,
"NAME", "COMMAND");
/* Main function logic */
proc_iter(defunct_procs, settings, stats);
if (settings->signal) {
handle_found_zombies(defunct_procs, settings, stats);
}
if (settings->prompt && proc_vec_size(defunct_procs)) {
prompt_user(defunct_procs, settings, stats);
}
proc_vec_free(defunct_procs);
return 0;
}
/*!
* Entry point
*/
int main(int argc, char *argv[])
{
struct zps_settings settings = {
.sig = 0,
.signal = false,
.show_all = false,
.prompt = false,
.quiet = false,
.interactive = true,
.color_allowed = true,
};
struct zps_stats stats = {
.defunct_count = 0,
.signaled_procs = 0,
};
struct timespec start = {0}, end = {0};
clock_gettime(CLOCK_REALTIME, &start);
check_interactive(&settings);
parse_args(argc, argv, &settings);
if (settings.quiet) {
silence(stdout);
silence(stderr);
}
const int rc = check_procs(&settings, &stats);
clock_gettime(CLOCK_REALTIME, &end);
const double duration_ms = (end.tv_sec - start.tv_sec) * 1e3 +
(end.tv_nsec - start.tv_nsec) * 1e-6;
if (stats.signaled_procs) {
/* Show signal count and taken time. */
fprintf(stdout,
"\nParent(s) signaled: %zu/%zu\nElapsed time: %.2f ms\n",
stats.signaled_procs, stats.defunct_count, duration_ms);
}
return rc ? EXIT_FAILURE : EXIT_SUCCESS;
}
================================================
FILE: src/zps.h
================================================
/**!
* zps, a small utility for listing and reaping zombie processes.
* Copyright © 2019-2024 by Orhun Parmaksız
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#ifndef ZPS_H
#define ZPS_H
#include
#include
#include
#include
/* Version number string */
#define VERSION "2.0.0"
#define DELIMS ", \n"
/* PID of `init` */
#define INIT_PID 1
/* PID of `kthreadd` */
#define KTHREADD_PID 2
/* Maximum length of userland process names (incl. '\0') */
#define TASK_COMM_LEN 16
/* We will truncate the cmdline string (incl. '\0') */
#define CMD_MAX_LEN 32
/* Formatting widths for our columns */
#define PID_COL_WIDTH 10
#define PPID_COL_WIDTH PID_COL_WIDTH
#define STATE_COL_WIDTH 5
#define NAME_COL_WIDTH (TASK_COMM_LEN - 1)
/* `/proc` filesystem */
#define PROC_FILESYSTEM "/proc"
/* PID status file */
#define STAT_FILE "stat"
/* PID command file */
#define CMD_FILE "cmdline"
/* Fixed buffer size */
#define MAX_BUF_SIZE 4096
/* Status file entry of zombie state */
#define STATE_ZOMBIE 'Z'
/* Enum for relevant ANSI SGR display modes */
enum ansi_display_mode_code {
ANSI_DISPLAY_MODE_NORMAL = 0,
ANSI_DISPLAY_MODE_BOLD = 1,
};
/* Enum for the different standard ANSI SGR color options */
enum ansi_fg_color_code {
ANSI_FG_NORMAL = 0,
ANSI_FG_BLACK = 30,
ANSI_FG_RED = 31,
ANSI_FG_GREEN = 32,
ANSI_FG_YELLOW = 33,
ANSI_FG_BLUE = 34,
ANSI_FG_MAGENTA = 35,
ANSI_FG_CYAN = 36,
ANSI_FG_WHITE = 37,
};
/* Struct for keeping track of the `zps` CLI options */
struct zps_settings {
/* Signal to use */
int sig;
/* Boolean value for signaling defunct processes' parents */
bool signal;
/* Boolean value for listing all running processes */
bool show_all;
/* Boolean value for showing a prompt for the reaping option */
bool prompt;
/* Boolean value for quiet mode */
bool quiet;
/* Boolean value for connection to a terminal */
bool interactive;
/* Boolean value for colored output */
bool color_allowed;
};
/* Struct for keeping track of the zombies */
struct zps_stats {
/* Number of found defunct processes */
size_t defunct_count;
/* Number of signaled processes */
size_t signaled_procs;
};
/* Struct for storing process stats */
struct proc_stats {
pid_t pid;
pid_t ppid;
char state;
char padding[7];
char name[TASK_COMM_LEN];
char cmd[CMD_MAX_LEN];
};
/* Struct to be used as a dynamically growing vector with immutable elements */
struct proc_vec {
struct proc_stats *ptr;
size_t sz;
size_t max_sz;
};
/*!
* Constructs an initial process vector with `max_sz` of `64`.
*
* The `proc_vec_free()` function should be called on this return value
* in order to free the resources.
*
* @return Pointer to the allocated structure, `NULL` on error
*/
static inline struct proc_vec *proc_vec(void)
{
struct proc_vec *proc_v = (struct proc_vec *)malloc(sizeof(*proc_v));
if (!proc_v) {
return NULL;
}
proc_v->max_sz = 64;
proc_v->sz = 0;
proc_v->ptr =
(struct proc_stats *)malloc(proc_v->max_sz * sizeof(*proc_v->ptr));
if (!proc_v->ptr) {
free(proc_v);
return NULL;
}
return proc_v;
}
/*!
* Frees and invalidates the process vector pointed to by the `proc_v`.
*
* @param[out] proc_v Process vector to deallocate
*
* @return void
*/
static inline void proc_vec_free(struct proc_vec *proc_v)
{
if (!proc_v) {
return;
}
free(proc_v->ptr);
free(proc_v);
}
/*!
* Adds `entry` to the end of the `proc_v` vector.
*
* @param[out] proc_v Process vector to use
* @param[in] entry Entry to add to the vector
*
* @return `false` on error, `true` otherwise
*/
static inline bool proc_vec_add(struct proc_vec *proc_v,
struct proc_stats entry)
{
assert(proc_v);
if (proc_v->sz == proc_v->max_sz) {
proc_v->max_sz *= 2;
struct proc_stats *tmp = (struct proc_stats *)realloc(
proc_v->ptr, proc_v->max_sz * sizeof(*proc_v->ptr));
if (!tmp) {
return false;
} else {
proc_v->ptr = tmp;
}
}
proc_v->ptr[proc_v->sz++] = entry;
return true;
}
/*!
* Returns a pointer to the element at index `i` in `proc_v`.
*
* @param[out] proc_v Process vector to use
* @param[in] i Vector index to access
*
* @return `NULL` if out of bounds, a pointer to the respective entry otherwise
*/
static inline const struct proc_stats *
proc_vec_at(const struct proc_vec *proc_v, size_t i)
{
assert(proc_v);
return i < proc_v->sz ? &proc_v->ptr[i] : NULL;
}
/*!
* Returns the current number of elements stored in `proc_v`
*
* @param[in] proc_v Process vector to use
*
* @return Size of the vector pointed to by `proc_v`
*/
static inline size_t proc_vec_size(const struct proc_vec *proc_v)
{
assert(proc_v);
return proc_v->sz;
}
#endif // ZPS_H