File tools-0.6.8.obscpio of Package interception-tools
07070100000000000081A4000000000000000000000001619A3A03000001DD000000000000000000000000000000000000001A00000000tools-0.6.8/.clang-formatBasedOnStyle: Google
Standard: Cpp11
SortIncludes: false
SortUsingDeclarations: false
AccessModifierOffset: -4
PointerBindsToType: false
DerivePointerBinding: false
AllowShortLoopsOnASingleLine: false
AllowShortBlocksOnASingleLine : false
AllowShortIfStatementsOnASingleLine: false
AlwaysBreakTemplateDeclarations: false
AlignConsecutiveAssignments: true
AlignEscapedNewlinesLeft: true
AlignTrailingComments: true
AlignOperands: true
ColumnLimit: 80
IndentWidth: 4
TabWidth: 4
07070100000001000081A4000000000000000000000001619A3A03000000DD000000000000000000000000000000000000001A00000000tools-0.6.8/.editorconfigroot = true
[*]
charset = utf-8
end_of_line = lf
indent_size = 4
indent_style = space
insert_final_newline = true
trim_trailing_whitespace = true
[*.{md}]
trim_trailing_whitespace = false
[*.{c,cpp}]
max_line_length = 80
07070100000002000081A4000000000000000000000001619A3A0300000514000000000000000000000000000000000000001700000000tools-0.6.8/.gitignore
# Created by https://www.gitignore.io/api/c,c++,vim,linux
### 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
modules.order
Module.symvers
Mkfile.old
dkms.conf
### C++ ###
# Prerequisites
# Compiled Object files
*.slo
# Precompiled Headers
# Compiled Dynamic libraries
# Fortran module files
*.mod
*.smod
# Compiled Static libraries
*.lai
# Executables
### Vim ###
# swap
[._]*.s[a-v][a-z]
[._]*.sw[a-p]
[._]s[a-v][a-z]
[._]sw[a-p]
# session
Session.vim
# temporary
.netrwhist
*~
# auto-generated tag files
tags
### Linux ###
# temporary files which can be created if a process still has a handle open of a deleted file
.fuse_hidden*
# KDE directory preferences
.directory
# Linux trash folder which might appear on any partition or disk
.Trash-*
# .nfs files are created when an open file is removed but is still being accessed
.nfs*
# End of https://www.gitignore.io/api/c,c++,vim,linux
### Custom ###
.lvimrc
.tmuxp.yaml
.gdb_history
.ycm_extra_conf.py
07070100000003000081A4000000000000000000000001619A3A0300000509000000000000000000000000000000000000001B00000000tools-0.6.8/CMakeLists.txtcmake_minimum_required(VERSION 3.0)
project(interception-tools)
find_package(Boost REQUIRED)
find_package(Threads REQUIRED)
find_package(PkgConfig)
pkg_check_modules(LIBEVDEV REQUIRED libevdev)
add_executable(udevmon udevmon.cpp)
target_include_directories(udevmon PRIVATE ${LIBEVDEV_INCLUDE_DIRS})
target_compile_options(udevmon PRIVATE -Wall -Wextra -pedantic -std=c++11)
target_link_libraries(udevmon evdev udev yaml-cpp)
add_executable(intercept intercept.c)
target_include_directories(intercept PRIVATE ${LIBEVDEV_INCLUDE_DIRS})
target_compile_options(intercept PRIVATE -Wall -Wextra)
target_link_libraries(intercept evdev)
add_executable(uinput uinput.cpp)
target_include_directories(uinput PRIVATE ${LIBEVDEV_INCLUDE_DIRS})
target_compile_options(uinput PRIVATE -Wall -Wextra -pedantic -std=c++11)
target_link_libraries(uinput evdev udev yaml-cpp)
add_executable(mux mux.cpp)
target_include_directories(mux PRIVATE ${Boost_INCLUDE_DIRS})
target_compile_options(mux PRIVATE -Wall -Wextra -pedantic -std=c++11 -DBOOST_DATE_TIME_NO_LIB)
target_link_libraries(mux Threads::Threads rt)
install(TARGETS udevmon RUNTIME DESTINATION bin)
install(TARGETS intercept RUNTIME DESTINATION bin)
install(TARGETS uinput RUNTIME DESTINATION bin)
install(TARGETS mux RUNTIME DESTINATION bin)
07070100000004000081A4000000000000000000000001619A3A0300008862000000000000000000000000000000000000001700000000tools-0.6.8/LICENSE.md### GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
<http://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies of this
license document, but changing it is not allowed.
### Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom
to share and change all versions of a program--to make sure it remains
free software for all its users. We, the Free Software Foundation, use
the GNU General Public License for most of our software; it applies
also to any other work released this way by its authors. You can apply
it to your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you
have certain responsibilities if you distribute copies of the
software, or if you modify it: responsibilities to respect the freedom
of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. You must make sure that they, too, receive
or can get the source code. And you must show them these terms so they
know their rights.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the
manufacturer can do so. This is fundamentally incompatible with the
aim of protecting users' freedom to change the software. The
systematic pattern of such abuse occurs in the area of products for
individuals to use, which is precisely where it is most unacceptable.
Therefore, we have designed this version of the GPL to prohibit the
practice for those products. If such problems arise substantially in
other domains, we stand ready to extend this provision to those
domains in future versions of the GPL, as needed to protect the
freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish
to avoid the special danger that patents applied to a free program
could make it effectively proprietary. To prevent this, the GPL
assures that patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
### TERMS AND CONDITIONS
#### 0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds
of works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of
an exact copy. The resulting work is called a "modified version" of
the earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user
through a computer network, with no transfer of a copy, is not
conveying.
An interactive user interface displays "Appropriate Legal Notices" to
the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
#### 1. Source Code.
The "source code" for a work means the preferred form of the work for
making modifications to it. "Object code" means any non-source form of
a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users can
regenerate automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same
work.
#### 2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey,
without conditions so long as your license otherwise remains in force.
You may convey covered works to others for the sole purpose of having
them make modifications exclusively for you, or provide you with
facilities for running those works, provided that you comply with the
terms of this License in conveying all material for which you do not
control copyright. Those thus making or running the covered works for
you must do so exclusively on your behalf, under your direction and
control, on terms that prohibit them from making any copies of your
copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under the
conditions stated below. Sublicensing is not allowed; section 10 makes
it unnecessary.
#### 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such
circumvention is effected by exercising rights under this License with
respect to the covered work, and you disclaim any intention to limit
operation or modification of the work as a means of enforcing, against
the work's users, your or third parties' legal rights to forbid
circumvention of technological measures.
#### 4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
#### 5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these
conditions:
- a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
- b) The work must carry prominent notices stating that it is
released under this License and any conditions added under
section 7. This requirement modifies the requirement in section 4
to "keep intact all notices".
- c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
- d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
#### 6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of
sections 4 and 5, provided that you also convey the machine-readable
Corresponding Source under the terms of this License, in one of these
ways:
- a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
- b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the Corresponding
Source from a network server at no charge.
- c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
- d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
- e) Convey the object code using peer-to-peer transmission,
provided you inform other peers where the object code and
Corresponding Source of the work are being offered to the general
public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal,
family, or household purposes, or (2) anything designed or sold for
incorporation into a dwelling. In determining whether a product is a
consumer product, doubtful cases shall be resolved in favor of
coverage. For a particular product received by a particular user,
"normally used" refers to a typical or common use of that class of
product, regardless of the status of the particular user or of the way
in which the particular user actually uses, or expects or is expected
to use, the product. A product is a consumer product regardless of
whether the product has substantial commercial, industrial or
non-consumer uses, unless such uses represent the only significant
mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to
install and execute modified versions of a covered work in that User
Product from a modified version of its Corresponding Source. The
information must suffice to ensure that the continued functioning of
the modified object code is in no case prevented or interfered with
solely because modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or
updates for a work that has been modified or installed by the
recipient, or for the User Product in which it has been modified or
installed. Access to a network may be denied when the modification
itself materially and adversely affects the operation of the network
or violates the rules and protocols for communication across the
network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
#### 7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders
of that material) supplement the terms of this License with terms:
- a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
- b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
- c) Prohibiting misrepresentation of the origin of that material,
or requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
- d) Limiting the use for publicity purposes of names of licensors
or authors of the material; or
- e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
- f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions
of it) with contractual assumptions of liability to the recipient,
for any liability that these contractual assumptions directly
impose on those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions; the
above requirements apply either way.
#### 8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your license
from a particular copyright holder is reinstated (a) provisionally,
unless and until the copyright holder explicitly and finally
terminates your license, and (b) permanently, if the copyright holder
fails to notify you of the violation by some reasonable means prior to
60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
#### 9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run
a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
#### 10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
#### 11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims owned
or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within the
scope of its coverage, prohibits the exercise of, or is conditioned on
the non-exercise of one or more of the rights that are specifically
granted under this License. You may not convey a covered work if you
are a party to an arrangement with a third party that is in the
business of distributing software, under which you make payment to the
third party based on the extent of your activity of conveying the
work, and under which the third party grants, to any of the parties
who would receive the covered work from you, a discriminatory patent
license (a) in connection with copies of the covered work conveyed by
you (or copies made from those copies), or (b) primarily for and in
connection with specific products or compilations that contain the
covered work, unless you entered into that arrangement, or that patent
license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
#### 12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under
this License and any other pertinent obligations, then as a
consequence you may not convey it at all. For example, if you agree to
terms that obligate you to collect a royalty for further conveying
from those to whom you convey the Program, the only way you could
satisfy both those terms and this License would be to refrain entirely
from conveying the Program.
#### 13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
#### 14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions
of the GNU General Public License from time to time. Such new versions
will be similar in spirit to the present version, but may differ in
detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies that a certain numbered version of the GNU General Public
License "or any later version" applies to it, you have the option of
following the terms and conditions either of that numbered version or
of any later version published by the Free Software Foundation. If the
Program does not specify a version number of the GNU General Public
License, you may choose any version ever published by the Free
Software Foundation.
If the Program specifies that a proxy can decide which future versions
of the GNU General Public License can be used, that proxy's public
statement of acceptance of a version permanently authorizes you to
choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
#### 15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT
WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND
PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
#### 16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT
NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR
LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER
PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
#### 17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
### How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these
terms.
To do so, attach the following notices to the program. It is safest to
attach them to the start of each source file to most effectively state
the exclusion of warranty; and each file should have at least the
"copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper
mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
<program> Copyright (C) <year> <name of author>
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands \`show w' and \`show c' should show the
appropriate parts of the General Public License. Of course, your
program's commands might be different; for a GUI interface, you would
use an "about box".
You should also get your employer (if you work as a programmer) or
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. For more information on this, and how to apply and follow
the GNU GPL, see <http://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your
program into proprietary programs. If your program is a subroutine
library, you may consider it more useful to permit linking proprietary
applications with the library. If this is what you want to do, use the
GNU Lesser General Public License instead of this License. But first,
please read <http://www.gnu.org/philosophy/why-not-lgpl.html>.
07070100000005000081A4000000000000000000000001619A3A0300005828000000000000000000000000000000000000001600000000tools-0.6.8/README.md# Interception Tools
A minimal composable infrastructure on top of [`libudev`][libudev] and
[`libevdev`][libevdev].
The _Interception Tools_ is a small set of utilities for operating on input
events of `evdev` devices:
### udevmon
```text
udevmon - monitor input devices for launching tasks
usage: udevmon [-h | -c configuration.yaml]
options:
-h show this message and exit
-c configuration.yaml use configuration.yaml as configuration
/etc/interception/udevmon.d/*.yaml is also read if present
```
### intercept
```text
intercept - redirect device input events to stdout
usage: intercept [-h | [-g] devnode]
options:
-h show this message and exit
-g grab device
devnode path of device to capture events from
```
### uinput
```text
uinput - redirect device input events from stdin to virtual device
usage: uinput [-h | [-p] [-c device.yaml] [-d devnode]]
options:
-h show this message and exit
-p show resulting YAML device description merge and exit
-c device.yaml merge YAML device description to resulting virtual
device (repeatable)
-d devnode merge reference device description to resulting virtual
device (repeatable)
```
### mux
```text
mux - mux streams of input events
usage: mux [-h | [-s size] -c name | [-i name] [-o name]]
options:
-h show this message and exit
-s size muxer's queue size (default: 100)
-c name name of muxer to create (repeatable)
-i name name of muxer to read input from or switch on
(repeatable in switch mode)
-o name name of muxer to write output to (repeatable)
```
## Runtime dependencies
- [libevdev][]
- [libudev][]
- [yaml-cpp][]
- [glibc][]
## Build dependencies
- [CMake][cmake]
- [Boost.Interprocess][interprocess]
## Additional Tools
- [uswitch][]: _redirect stdin to a muxer if logged user matches_
- [xswitch][]: _redirect stdin to a muxer if window matches_
## Official Plugins
- [caps2esc][]: _transforming the most useless key ever in the most useful one_
- [space2meta][]: _turn your space key into the meta key when chorded to
another key (on key release only)_
- [hideaway][]: _move the mouse pointer out of sight after a couple of seconds_
- [dual-function-keys][]: _tap for one key, hold for another_
## Some Community Plugins
- [ralt2hyper][]: _Remap Right Alt (commonly AltGr) to Hyper (i.e. Control, Alt and Super)_
- [chorded_keymap][]
- [interception-vimproved][]
- [interception-k2k][]
## Execution
The following daemonized sample execution increases `udevmon` priority (since
it'll be responsible for a vital input device, just to make sure it stays
responsible):
```text
$ sudo nice -n -20 udevmon -c udevmon.yaml >udevmon.log 2>udevmon.err &
```
The usual route, though, is simply to use the provided systemd unit or OpenRC
init script.
## Installation
### Archlinux
It's available from [community](https://archlinux.org/packages/community/x86_64/interception-tools/):
```text
$ pacman -S interception-tools
```
### Void Linux
```text
$ xbps-install -S interception-tools
```
### Ubuntu ([independent package][ubuntu])
```text
sudo add-apt-repository ppa:deafmute/interception
sudo apt install interception-tools
```
<sub>For Debian and other derivatives you can download directly at
<https://launchpad.net/~deafmute/+archive/ubuntu/interception/+packages>.</sub>
Or if building from sources, these are the dependencies:
```text
$ sudo apt install cmake libevdev-dev libudev-dev libyaml-cpp-dev libboost-dev
```
[ubuntu]: https://gitlab.com/interception/linux/tools/-/issues/38
### Fedora ([independent package][fedora])
```text
$ sudo dnf copr enable fszymanski/interception-tools
$ sudo dnf install interception-tools
```
Or if building from sources, these are the dependencies:
```text
$ dnf install cmake libevdev-devel systemd-devel yaml-cpp-devel boost-devel
```
[fedora]: https://gitlab.com/interception/linux/tools/-/merge_requests/11
## Building
```text
$ git clone https://gitlab.com/interception/linux/tools.git interception-tools
$ cd interception-tools
$ cmake -B build -DCMAKE_BUILD_TYPE=Release
$ cmake --build build
```
## How It Works
First, lets check where [`libevdev`][libevdev] sits in the input system from its
documentation:
> ### Where does libevdev sit?
>
> libevdev is essentially a read(2) on steroids for /dev/input/eventX devices.
> It sits below the process that handles input events, in between the kernel and
> that process. In the simplest case, e.g. an evtest-like tool the stack would
> look like this:
>
> `kernel → libevdev → evtest`
>
> For X.Org input modules, the stack would look like this:
>
> `kernel → libevdev → xf86-input-evdev → X server → X client`
>
> For Weston/Wayland, the stack would look like this:
>
> `kernel → libevdev → Weston → Wayland client`
>
> libevdev does **not** have knowledge of X clients or Wayland clients, it is
> too low in the stack.
The tools here relying on [`libevdev`][libevdev] are `intercept` and `uinput`.
`intercept`'s purpose is to capture input from a given device (optionally
_grabbing_ it) and write such raw input to `stdout`. `uinput` does the reverse,
it receives raw input from `stdin` and write it to a virtual `uinput` device
created by cloning characteristics of real devices, from YAML configuration, or
both.
So, assuming `$DEVNODE` as the path of the device, something like
`/dev/input/by-id/some-kbd-id`, the following results in a no-op:
`intercept -g $DEVNODE | uinput -d $DEVNODE`
In this case using `-g` is important so that the target device is _grabbed_ for
exclusive access, allowing the new virtual device created by `uinput` to
substitute it completely: we grab it and others can grab the clone.
Now additional processing can be added in the middle easily. For example, with
this trivial program (let's call it `x2y`):
```c
#include <stdio.h>
#include <stdlib.h>
#include <linux/input.h>
int main(void) {
setbuf(stdin, NULL), setbuf(stdout, NULL);
struct input_event event;
while (fread(&event, sizeof(event), 1, stdin) == 1) {
if (event.type == EV_KEY && event.code == KEY_X)
event.code = KEY_Y;
fwrite(&event, sizeof(event), 1, stdout);
}
}
```
We replace `x` and `y` for a given keyboard with:
`intercept -g $DEVNODE | x2y | uinput -d $DEVNODE`
Now if we also have a `y2z` program we can compose both as
`intercept -g $DEVNODE | x2y | y2z | uinput -d $DEVNODE`
or as
`intercept -g $DEVNODE | y2z | x2y | uinput -d $DEVNODE`
and notice how the composition order `x2y | y2z` vs `y2z | x2y` is relevant in
this case. The first most probably doesn't produce the desired composition
because one affects the other and the final behavior actually becomes `x2z` and
`y2z`, which doesn't happen in the later composition.
**The `uinput` tool has another purpose besides emulation which is just to print
a device's description in YAML format**. `uinput -p -d /dev/input/by-id/my-kbd`
prints `my-kbd` characteristics in YAML, which itself can be fed back to
`uinput` as `uinput -c my-kbd.yaml`. It can also merge device and YAML
characteristics, for example,
```text
uinput -p -d /dev/input/by-id/my-kbd -d /dev/input/by-id/my-mouse -c my-extra.yaml
```
merges `my-kbd`, `my-mouse` and `my-extra.yaml` into a single YAML output (the
characteristics that aren't lists are “merged” by overriding the previous when
they are present on both inputs). This allows creating hybrid virtual devices
that, for example, act as both keyboard and mouse (see caveats section on
hybrid devices).
Explicitly calling `intercept` and `uinput` on specific devices can be
cumbersome, that's where `udevmon` helps. `udevmon` accepts a YAML
configuration with a list of _jobs_ (`sh` commands by default) to be executed
in case the device matches a given description. For example:
```yaml
- JOB: intercept -g $DEVNODE | y2z | x2y | uinput -d $DEVNODE
DEVICE:
EVENTS:
EV_KEY: [KEY_X, KEY_Y]
```
Calling `udevmon` with this configuration sets it to launch the given command
for whatever device that responds to `KEY_X` or `KEY_Y`. It will monitor for
any device that is already attached or that gets attached. The `$DEVNODE`
environment variable is set to the path of the matching device.
To only match devices that produce _all the given events_ instead of just _any
of the given events_, you do:
```yaml
- JOB: intercept -g $DEVNODE | magic | uinput -d $DEVNODE
DEVICE:
EVENTS:
EV_KEY: [KEY_A, KEY_B, [KEY_X, KEY_Y]]
```
Which will match if the device responds to either `KEY_A`, `KEY_B`, `KEY_X`
_and_ `KEY_Y`.
If device specific interception is more desirable, it's simpler to use the
`LINK` configuration as the device selector, for example:
```yaml
- JOB: intercept -g $DEVNODE | caps2esc | uinput -d $DEVNODE
DEVICE:
LINK: /dev/input/by-id/usb-SEMITEK_USB-HID_Gaming_Keyboard_SN0000000001-event-kbd
```
This way, only [the device that produces that link][sk61] will have
[caps2esc][] applied.
A more involved configuration may need to combine (or just observe) the input
of two devices to make decisions. That's where the `mux` tool comes at hand:
```yaml
- CMD: mux -c caps2esc
- JOB: mux -i caps2esc | caps2esc | uinput -c /etc/interception/gaming-keyboard.yaml
- JOB: intercept -g $DEVNODE | mux -o caps2esc
DEVICE:
LINK: /dev/input/by-id/usb-SEMITEK_USB-HID_Gaming_Keyboard_SN0000000001-event-kbd
- JOB: intercept $DEVNODE | mux -o caps2esc
DEVICE:
LINK: /dev/input/by-id/usb-Logitech_USB_Receiver-if02-event-mouse
```
The `mux` tool serves to combine multiple pipelines into one. A _muxer_ first
needs to be created with a name in a `CMD` (differently from `JOB`s, `CMD`s are
executed sequentially when the service starts and are waited for successful
termination). The muxer can then be used from multiple pipelines as an output
or as the input of a given pipeline. After the muxer creation, a _standalone
job_ not associated with any device (which makes it just a command executed
when `udevmon` starts, but not waited for) is launched to consume the muxer and
pass what arrives from it to `caps2esc` and, finally, to the virtual device
created from `gaming-keyboard.yaml` (see caveats section on device links).
In the example above, when the keyboard is connected, it's grabbed and its
input events are sent to the “caps2esc” muxer that was initially created.
_Observed_ input (not grabbed) from mouse is also sent to the same muxer. The
buttons of the mouse generate `EV_KEY` events, so `caps2esc` will accept them,
making “Caps Lock + Click” work as “Control + Click”.
As in this case the final target cloned device clones the keyboard, not a
mouse, if mouse events reach it from muxing multiple pipelines, they won't be
reproduced, hence not duplicating the _observed_ mouse events.
If a device happens to match multiple job descriptions, only the first job that
matches gets executed. This allows for device specific jobs, while still having
fallback configurations:
```yaml
- JOB: intercept -g $DEVNODE | caps2esc -m 2 | uinput -d $DEVNODE
DEVICE:
LINK: /dev/input/by-id/usb-SEMITEK_USB-HID_Gaming_Keyboard_SN0000000001-event-kbd
- JOB: intercept -g $DEVNODE | caps2esc | uinput -d $DEVNODE
DEVICE:
EVENTS:
EV_KEY: [[KEY_CAPSLOCK, KEY_ESC]]
LINK: .*-event-kbd
```
In the above example, if an attached keyboard produces the given link,
`caps2esc -m 2` will be applied to it, otherwise, `caps2esc` in default mode
will be applied (_if_ the keyboard has both `KEY_CAPSLOCK` _and_ `KEY_ESC` and a
device link that ends with `-event-kbd`, [to exclude mice that report those
keys][caps2esc-issue-15-note]). Also, note that configuration files found on
`/etc/interception/udevmon.d/` are read first, so you can have device specific
configurations there, and fallbacks on `/etc/interception/udevmon.yaml`.
Besides combining pipelines, the `mux` tool can duplicate them (multiple `-o`s)
and even act as a _switch_, based on activity in other pipelines (`-i` and `-o`
intermixed). Which brings us to our lasting, _slightly complex_, use case:
Let's imagine the following setup:
- You want to grab keyboards (here after referred as `K`) and mice (`M`) and
combine input coming from these two groups into `KM`, to apply multi device
chording
- You have a generic filter (`caps2esc`) you want to apply to combined
keyboard/mouse input
- But when you're using some specific keyboards (`X`), you want the combined
input (`XM`) to go through a different filter (`caps2esc -m 2`)
Voilà:
```yaml
- CMD: mux -c K -c X -c M -c KM -c XM -c H
- JOB:
- mux -i M | mux -o KM -i K -o KM -i X -o XM
- mux -i KM | caps2esc | mux -o H
- mux -i XM | caps2esc -m 2 | mux -o H
- mux -i H | uinput -c /etc/interception/hybrid.yaml
- JOB: intercept -g $DEVNODE | mux -o X -o XM
DEVICE:
LINK: /dev/input/by-id/usb-SEMITEK_USB-HID_Gaming_Keyboard_SN0000000001-event-kbd
- JOB: intercept -g $DEVNODE | mux -o M
DEVICE:
EVENTS:
EV_KEY: [BTN_LEFT, BTN_TOUCH]
- JOB: intercept -g $DEVNODE | mux -o K -o KM
DEVICE:
EVENTS:
EV_KEY: [[KEY_CAPSLOCK, KEY_ESC]]
NAME: .*[Kk]eyboard.*
LINK: .*-event-kbd
```
Don't be afraid as it's pretty simple to break it down.
First, as can be seen, at the bottom we have device detection for three device
groups (as modeled previously).
The keyboard events are consumed and duplicated out, this happens so that
consumption of these events can happen in parallel both for purposes of
checking there's activity in a particular group (`mux -o K …` and `mux -o X
…`), as for the final consumption of keyboard and mouse events muxed together
(`mux … -o KM` and `mux … -o XM`).
The mouse events are consumed and sent to the `M` muxer for further processing.
<sub>_**Notice** that when multiple devices match a given device job
description, a job instance per device will run, so, consuming a muxer (`mux …
-i …`) from device jobs would create a race condition of multiple job instances
competing for the same events of a given muxer. That's why, here, device jobs
solely write to muxers (`mux -o`), which is fine for muxing the events of all
matching devices into a single stream, but the reading of a muxer only happens
in standalone jobs, for which there's only one instance running for its
consumption. Also, muxer writing doesn't implicate in any problem in case the
device disconnects and its job gets dropped. Dropping a pipeline in reading
state ends up leading to muxer corruption, while standalone jobs only finish
when the `udevmon` service is stopped._</sub>
On `mux -i M | mux -o KM -i K -o KM -i X -o XM` we get to the core of the
design. Here `M` is consumed and gets redirected either to `KM`, if there's
activity in `K` (`-i K -o KM`), or `XM`, if there's activity in `X` (`-i X -o
XM`). The first `-o KM` makes `KM` the default route for input coming from `M`
(in case no activity ever happens in `K` or `X`).
In the end we only have `KM` and `XM` to consume input from, as we have that
input from group `K` goes to `KM`, input from group `X` goes to `XM`, and input
from group `M` goes either to `KM` or `XM`.
For `KM` then we apply `caps2esc`, but for `XM` we apply `caps2esc -m 2`. And
regardless the route that input goes through, we send it to the final `H`
endpoint, which gets consumed by a hybrid virtual device (e.g. `sudo uinput -p
-d /dev/input/by-id/usb-Logitech_USB_Receiver-if02-event-mouse -d
/dev/input/by-id/usb-SEMITEK_USB-HID_Gaming_Keyboard_SN0000000001-event-kbd |
sudo tee /etc/interception/hybrid.yaml`).
As a final note on the `mux` tool in switch mode, `mux -i e | mux -o o -i i`
would redirect `e` to `o` by default, but once there's activity in `i`, `e` is
redirected to nowhere. And if you have `mux -i e | mux -i i -o o`, as there
isn't any default output, `e` gets redirected to `o` only after first detected
activity in `i`.
Besides that, you can have `-i x -i y -i etc -o z` to redirect to `z` out of
activity either from `x`, `y` or `etc` and you can have `-i x -o y -o z -o etc`
to redirect to `y`, `z` and `etc` out of `x` activity. Both aspects can be
combined in `-i w -i x -o y -o z`.
The “full” YAML based spec is as follows:
```yaml
SHELL: LA
---
- CMD: S | LS
- JOB: S | LS
DEVICE:
LINK: R
NAME: R
LOCATION: R
PRODUCT: R
VENDOR: R
BUSTYPE: R
DRIVER_VERSION: R
PROPERTIES: LP
EVENTS:
EV_KEY: LE
EV_REL: LE
...
```
Where:
- `LA`: shell replacement, like `[zsh, -c]`, default is `[sh, -c]`.
- `S` | `LS` : shell command string, or a list of shell command strings.
- `R`: regular expression string.
- `LP`: list of any _properties or set of properties_ (by name or code), the
device can have.
- `LE`: list of any _events or set of events_ (by name or code), of a given
type, that the device can produce.
- The regular expression grammar supported is [Modified ECMAScript][ecmascript].
- There can be any number of jobs.
- An empty event list means the device should respond to whatever event of the
given event type.
- Property names and event types and names are taken from
[`<linux/input-event-codes.h>`][input-event-codes].
## Plugin Guidelines
### Correct synthesization of event sequences
A plugin that's going to synthesize event sequences programmatically (not the
case for simple key swapping, like `x2y` above), for keyboard at least, is
required to provide `EV_SYN` events and a short delay (to have different
event timestamps), between key events. This is what happens when you type on a
real keyboard, and [has been proved necessary][ev-syn] for applications to
behave well. As a general guideline, one should explore how real devices behave
while generating events (with `evtest` for example) for mimicking them with
success.
## Caveats
### Correct process priority
Always use a high process priority (low _niceness_ level, `udevmon.service`
uses `-20`) when executing tools that manipulate input, otherwise you may get
[unwanted effects][niceness]. Without _Interception Tools_, your input is
treated with high priority at kernel level, and you should try to resemble that
now on user mode, which is the level where the tools run.
### Hybrid device configurations
_Note that hybrid devices may not always work_.
For example, on my PC, merging my mouse and keyboard into a single device does
create a working hybrid device that can respond for all their events, but on an
old laptop, merging the built-in i8042 keyboard and i8042 touchpad created a
non-working hybrid that can only respond for the touchpad's events (it seems
`EV_ABS` and keyboard `EV_KEY`s didn't work together in this machine). To fix
that I stored the configurations in different files, and checked they didn't
respond for any identical events. Then I used these two as virtual output for
the same muxed stream of events, but given that the virtual devices don't
respond for the same events, these don't get duplicated but instead effectively
get split from a single stream into their relevant virtual devices:
```yaml
- CMD: mux -c caps2esc -c keyboard -c mouse
- JOB:
- mux -i caps2esc | caps2esc | mux -o keyboard -o mouse
- mux -i keyboard | uinput -c /etc/interception/keyboard.yaml
- mux -i mouse | uinput -c /etc/interception/mouse.yaml
- JOB: intercept -g $DEVNODE | mux -o caps2esc
DEVICE:
NAME: AT Translated Set 2 keyboard
- JOB: intercept -g $DEVNODE | mux -o caps2esc
DEVICE:
NAME: ETPS/2 Elantech Touchpad
```
### Device links
Depending on the system, device links (`by-id`, `by-path`, etc) may not exist
at all, or not be readily available when the machine boots, which may make it
unreliable to refer to them on _standalone jobs_ which execute when `udevmon`
starts on boot. It's safe to refer to them on device jobs, as these only start
when the link actually becomes present.
Hence, on standalone jobs it's generally better practice to refer to previously
stored YAML device configurations instead.
On a machine that produce links, referring to them on standalone jobs may or
may not work on boot. You may verify that by rebooting and checking whether
`udevmon` give errors on boot or not.
## Software Alternatives
- [mxk](http://welz.org.za/projects/mxk)
- [uinput-mapper](https://github.com/MerlijnWajer/uinput-mapper/)
[cmake]: https://cmake.org
[uinput]: https://www.kernel.org/doc/html/latest/input/uinput.html
[libudev]: https://www.freedesktop.org/software/systemd/man/libudev.html
[libevdev]: https://www.freedesktop.org/software/libevdev/doc/latest/index.html
[yaml-cpp]: https://github.com/jbeder/yaml-cpp
[glibc]: https://www.gnu.org/software/libc
[interprocess]: https://www.boost.org/doc/libs/release/libs/interprocess
[uswitch]: https://gitlab.com/interception/linux/plugins/uswitch
[xswitch]: https://gitlab.com/interception/linux/plugins/xswitch
[caps2esc]: https://gitlab.com/interception/linux/plugins/caps2esc
[space2meta]: https://gitlab.com/interception/linux/plugins/space2meta
[hideaway]: https://gitlab.com/interception/linux/plugins/hideaway
[dual-function-keys]: https://gitlab.com/interception/linux/plugins/dual-function-keys
[ralt2hyper]: https://gitlab.com/oarmstrong/ralt2hyper
[chorded_keymap]: https://gitlab.com/wsha/chorded_keymap
[interception-vimproved]: https://github.com/maricn/interception-vimproved
[interception-k2k]: https://github.com/zsugabubus/interception-k2k
[sk61]: https://epomaker.com/products/epomaker-sk61
[caps2esc-issue-15-note]: https://gitlab.com/interception/linux/plugins/caps2esc/-/issues/15#note_476593423
[ecmascript]: http://en.cppreference.com/w/cpp/regex/ecmascript
[input-event-codes]: https://github.com/torvalds/linux/blob/master/include/uapi/linux/input-event-codes.h
[ev-syn]: https://gitlab.com/interception/linux/tools/-/issues/29#note_474260470
[niceness]: https://gitlab.com/interception/linux/tools/-/issues/29#note_474310306
## License
_Interception Tools_ is **dual-licensed**.
To be embedded and redistributed as part of a proprietary solution, contact me
at francisco+interception@nosubstance.me for commercial licensing, otherwise
it's under
<a href="https://gitlab.com/interception/linux/tools/blob/master/LICENSE.md">
<img src="https://www.gnu.org/graphics/gplv3-127x51.png" alt="GPLv3">
</a>
Copyright © 2017 Francisco Lopes da Silva
07070100000006000081A4000000000000000000000001619A3A0300000868000000000000000000000000000000000000001800000000tools-0.6.8/intercept.c#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <fcntl.h>
#include <unistd.h>
#include <libevdev/libevdev.h>
void print_usage(FILE *stream, const char *program) {
fprintf(stream,
"intercept - redirect device input events to stdout\n"
"\n"
"usage: %s [-h | [-g] devnode]\n"
"\n"
"options:\n"
" -h show this message and exit\n"
" -g grab device\n"
" devnode path of device to capture events from\n",
program);
}
int main(int argc, char *argv[]) {
int grab = 0;
for (int opt; (opt = getopt(argc, argv, "hg")) != -1;) {
switch (opt) {
case 'h':
return print_usage(stdout, argv[0]), EXIT_SUCCESS;
case 'g':
if (grab)
break;
grab = 1;
continue;
}
return print_usage(stderr, argv[0]), EXIT_FAILURE;
}
if (optind != argc - 1)
return print_usage(stderr, argv[0]), EXIT_FAILURE;
int fd = open(argv[optind], O_RDONLY);
if (fd < 0)
return perror("open failed"), EXIT_FAILURE;
int result = EXIT_FAILURE;
struct libevdev *dev;
if (libevdev_new_from_fd(fd, &dev) < 0)
goto teardown_fd;
if (grab && libevdev_grab(dev, LIBEVDEV_GRAB) < 0)
goto teardown_dev;
setbuf(stdout, NULL);
for (;;) {
struct input_event input;
int rc = libevdev_next_event(
dev, LIBEVDEV_READ_FLAG_NORMAL | LIBEVDEV_READ_FLAG_BLOCKING,
&input);
while (rc == LIBEVDEV_READ_STATUS_SYNC)
rc = libevdev_next_event(dev, LIBEVDEV_READ_FLAG_SYNC, &input);
if (rc == -EAGAIN)
continue;
if (rc != LIBEVDEV_READ_STATUS_SUCCESS)
break;
if (fwrite(&input, sizeof input, 1, stdout) != 1)
goto teardown_grab;
}
result = EXIT_SUCCESS;
teardown_grab:
if (grab)
libevdev_grab(dev, LIBEVDEV_UNGRAB);
teardown_dev:
libevdev_free(dev);
teardown_fd:
close(fd);
return result;
}
07070100000007000081A4000000000000000000000001619A3A0300002021000000000000000000000000000000000000001400000000tools-0.6.8/mux.cpp#include <map>
#include <atomic>
#include <cstdio>
#include <memory>
#include <string>
#include <thread>
#include <vector>
#include <cstdlib>
#include <stdexcept>
extern "C" {
#include <unistd.h>
#include <linux/input.h>
}
#include <boost/interprocess/ipc/message_queue.hpp>
using boost::interprocess::open_only;
using boost::interprocess::create_only;
using boost::interprocess::message_queue;
void print_usage(std::FILE *stream, const char *program) {
// clang-format off
std::fprintf(stream,
"mux - mux streams of input events\n"
"\n"
"usage: %s [-h | [-s size] -c name | [-i name] [-o name]]\n"
"\n"
"options:\n"
" -h show this message and exit\n"
" -s size muxer's queue size (default: 100)\n"
" -c name name of muxer to create (repeatable)\n"
" -i name name of muxer to read input from or switch on\n"
" (repeatable in switch mode)\n"
" -o name name of muxer to write output to (repeatable)\n",
program);
// clang-format on
}
std::atomic<size_t> current_muxer{0};
int main(int argc, char *argv[]) try {
enum {
NO_MODE,
CREATE_MODE,
INPUT_MODE,
OUTPUT_MODE,
SWITCH_MODE
} mode = NO_MODE;
std::map<std::string, std::vector<std::string>> muxer_names;
std::vector<size_t> muxer_sizes;
size_t muxer_size = 100;
std::vector<std::string> input_muxer_names = {""};
for (int opt, last_opt = 0;
(opt = getopt(argc, argv, "hs:c:i:o:")) != -1;) {
switch (opt) {
case 'h':
return print_usage(stdout, argv[0]), EXIT_SUCCESS;
case 's':
if (last_opt && last_opt != 'c')
break;
muxer_size = std::stoul(optarg);
last_opt = 's';
continue;
case 'c':
if (last_opt && last_opt != 'c' && last_opt != 's')
break;
mode = CREATE_MODE;
muxer_names[""].push_back(optarg);
muxer_sizes.push_back(muxer_size);
last_opt = 'c';
continue;
case 'i':
if (last_opt && last_opt != 'i' && last_opt != 'o')
break;
if (!last_opt) {
mode = INPUT_MODE;
input_muxer_names = {};
} else if (last_opt == 'o') {
mode = SWITCH_MODE;
input_muxer_names = {};
}
muxer_names[optarg];
input_muxer_names.push_back(optarg);
last_opt = 'i';
continue;
case 'o':
if (last_opt && last_opt != 'i' && last_opt != 'o')
break;
if (!last_opt)
mode = OUTPUT_MODE;
else if (last_opt == 'i')
mode = SWITCH_MODE;
for (const auto &name : input_muxer_names)
muxer_names[name].push_back(optarg);
last_opt = 'o';
continue;
}
return print_usage(stderr, argv[0]), EXIT_FAILURE;
}
switch (mode) {
case NO_MODE:
return print_usage(stderr, argv[0]), EXIT_FAILURE;
case CREATE_MODE: {
auto muxer_size = muxer_sizes.begin();
for (const auto &muxer_name : muxer_names[""]) {
message_queue::remove(muxer_name.c_str());
message_queue(create_only, muxer_name.c_str(), *muxer_size,
sizeof(input_event), 0600);
++muxer_size;
}
} break;
case INPUT_MODE: {
if (muxer_names.size() != 1)
return print_usage(stderr, argv[0]), EXIT_FAILURE;
message_queue muxer(open_only, muxer_names.begin()->first.c_str());
std::setbuf(stdout, nullptr);
input_event input;
unsigned int priority;
message_queue::size_type size;
for (;;) {
muxer.receive(&input, sizeof input, size, priority);
if (size != sizeof input)
throw std::runtime_error(
"unexpected input event size while reading from input "
"event queue");
else if (std::fwrite(&input, sizeof input, 1, stdout) != 1)
throw std::runtime_error(
"error writing input event to stdout");
}
} break;
case OUTPUT_MODE: {
std::vector<std::unique_ptr<message_queue>> muxers;
for (const auto &muxer_name : muxer_names[""])
muxers.emplace_back(
new message_queue(open_only, muxer_name.c_str()));
std::setbuf(stdin, nullptr);
input_event input;
for (;;)
if (std::fread(&input, sizeof input, 1, stdin) == 1) {
for (auto &muxer : muxers)
if (!muxer->try_send(&input, sizeof input, 0))
throw std::runtime_error(
"outgoing muxer is full, exiting");
} else if (std::ferror(stdin))
throw std::runtime_error(
"error reading input event from stdin");
else if (std::feof(stdin))
break;
} break;
case SWITCH_MODE: {
std::vector<std::vector<std::unique_ptr<message_queue>>> muxers;
muxers.emplace_back();
for (const auto &muxer_name : muxer_names[""])
muxers.back().emplace_back(
new message_queue(open_only, muxer_name.c_str()));
size_t id = 0;
for (const auto &muxer_name : muxer_names) {
if (muxer_name.first.empty())
continue;
muxers.emplace_back();
for (const auto &name : muxer_name.second)
muxers.back().emplace_back(
new message_queue(open_only, name.c_str()));
std::thread(
[](std::unique_ptr<message_queue> muxer, size_t id) {
try {
input_event input;
unsigned int priority;
message_queue::size_type size;
for (;;) {
muxer->receive(&input, sizeof input, size,
priority);
if (size == sizeof input)
current_muxer = id;
}
} catch (...) {
}
},
std::unique_ptr<message_queue>(
new message_queue(open_only, muxer_name.first.c_str())),
++id)
.detach();
}
std::setbuf(stdin, nullptr);
input_event input;
for (;;)
if (std::fread(&input, sizeof input, 1, stdin) == 1) {
size_t current = current_muxer;
for (auto &muxer : muxers[current])
if (!muxer->try_send(&input, sizeof input, 0))
throw std::runtime_error(
"outgoing muxer is full, exiting");
} else if (std::ferror(stdin))
throw std::runtime_error(
"error reading input event from stdin");
else if (std::feof(stdin))
break;
} break;
}
} catch (const std::exception &e) {
return std::fprintf(stderr,
R"(an exception occurred: "%s")"
"\n",
e.what()),
EXIT_FAILURE;
}
07070100000008000081A4000000000000000000000001619A3A0300006854000000000000000000000000000000000000001800000000tools-0.6.8/udevmon.cpp#include <map>
#include <regex>
#include <cctype>
#include <cerrno>
#include <cstdio>
#include <memory>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <stdexcept>
extern "C" {
#include <fcntl.h>
#include <dirent.h>
#include <signal.h>
#include <unistd.h>
#include <sys/wait.h>
#include <sys/types.h>
#include <sys/select.h>
}
#include <libudev.h>
#include <libevdev/libevdev.h>
#include <libevdev/libevdev-uinput.h>
#include <yaml-cpp/yaml.h>
using yaml = std::vector<YAML::Node>;
void print_usage(std::FILE *stream, const char *program) {
// clang-format off
std::fprintf(stream,
"udevmon - monitor input devices for launching tasks\n"
"\n"
"usage: %s [-h | -c configuration.yaml]\n"
"\n"
"options:\n"
" -h show this message and exit\n"
" -c configuration.yaml use configuration.yaml as configuration\n"
"\n"
"/etc/interception/udevmon.d/*.yaml is also read if present\n",
program);
// clang-format on
}
struct cmd {
cmd(const YAML::Node &job_node, const YAML::Node &settings_doc = {}) {
using std::string;
using std::vector;
using std::invalid_argument;
if (job_node.size() != 1)
throw invalid_argument("wrong number of fields in job node");
YAML::Node cmd_node;
if (job_node["CMD"]) {
this->wait = true;
cmd_node = job_node["CMD"];
} else if (job_node["JOB"]) {
this->wait = false;
cmd_node = job_node["JOB"];
} else
throw invalid_argument("missing JOB or CMD field in job node");
vector<string> cmd_pieces = {"sh", "-c"};
if (auto shell = settings_doc["SHELL"])
cmd_pieces = shell.as<vector<string>>();
if (!cmd_node.IsSequence()) {
cmd_pieces.push_back(cmd_node.as<string>());
this->cmds.push_back(cmd_pieces);
} else
for (const auto &subcmd_node : cmd_node) {
auto pieces = cmd_pieces;
pieces.push_back(subcmd_node.as<string>());
this->cmds.push_back(pieces);
}
}
std::vector<pid_t> launch() const {
std::vector<pid_t> pids;
for (size_t i = 0; i < cmds.size(); ++i) {
pid_t pid = fork();
switch (pid) {
case -1: {
for (auto pid : pids)
kill(-pid, SIGTERM);
std::string e = "fork failed for \"";
e.append(cmds[i].back());
e.append("\" with error \"");
e.append(std::strerror(errno));
e.append("\"");
throw std::runtime_error(e);
}
case 0: {
std::unique_ptr<char *[]> command {
new char *[cmds[i].size() + 1]
};
for (size_t j = 0; j < cmds[i].size(); ++j)
command[j] = const_cast<char *>(cmds[i][j].c_str());
command[cmds[i].size()] = nullptr;
char *environment[] = {nullptr};
setpgid(0, 0);
execvpe(command[0], command.get(), environment);
std::string e = "exec failed for \"";
e.append(cmds[i].back());
e.append("\" with error \"");
e.append(std::strerror(errno));
e.append("\"");
throw std::runtime_error(e);
} break;
default:
if (wait) {
siginfo_t info;
waitid(P_PID, pid, &info, WEXITED);
if (info.si_code != CLD_EXITED) {
for (auto pid : pids)
kill(-pid, SIGTERM);
std::string e = "command \"";
e.append(cmds[i].back());
e.append("\" terminated abnormally");
throw std::runtime_error(e);
} else if (info.si_status != EXIT_SUCCESS) {
for (auto pid : pids)
kill(-pid, SIGTERM);
std::string e = "command \"";
e.append(cmds[i].back());
e.append("\" exited with error \"");
e.append(std::strerror(info.si_errno));
e.append("\"");
throw std::runtime_error(e);
}
} else
pids.push_back(pid);
break;
}
}
return pids;
}
bool wait;
std::vector<std::vector<std::string>> cmds;
};
struct job {
job(const YAML::Node &job_node, const YAML::Node &settings_doc = {}) {
using std::regex;
using std::string;
using std::vector;
using std::invalid_argument;
if (job_node.size() != 2)
throw invalid_argument("wrong number of fields in job node");
if (!job_node["JOB"])
throw invalid_argument("missing JOB field in job node");
if (!job_node["DEVICE"])
throw invalid_argument("missing DEVICE field in job node");
auto cmd_node = job_node["JOB"];
vector<string> cmd_pieces = {"sh", "-c"};
if (auto shell = settings_doc["SHELL"])
cmd_pieces = shell.as<vector<string>>();
if (!cmd_node.IsSequence()) {
cmd_pieces.push_back(cmd_node.as<string>());
this->cmds.push_back(cmd_pieces);
} else
for (const auto &subcmd_node : cmd_node) {
auto pieces = cmd_pieces;
pieces.push_back(subcmd_node.as<string>());
this->cmds.push_back(pieces);
}
auto device = job_node["DEVICE"];
if (auto link = device["LINK"]) {
this->has_link = true;
this->link.assign(link.as<string>(), regex::optimize);
}
if (auto name = device["NAME"])
this->name.assign(name.as<string>(), regex::optimize);
if (auto location = device["LOCATION"])
this->location.assign(location.as<string>(), regex::optimize);
if (auto id = device["ID"])
this->id.assign(id.as<string>(), regex::optimize);
if (auto product = device["PRODUCT"])
this->product.assign(product.as<string>(), regex::optimize);
if (auto vendor = device["VENDOR"])
this->vendor.assign(vendor.as<string>(), regex::optimize);
if (auto bustype = device["BUSTYPE"])
this->bustype.assign(bustype.as<string>(), regex::optimize);
if (auto driver_version = device["DRIVER_VERSION"])
this->driver_version.assign(driver_version.as<string>(),
regex::optimize);
auto is_int = [](const std::string &s) {
return s.find_first_not_of("0123456789") == std::string::npos;
};
if (auto properties = device["PROPERTIES"]) {
for (const auto &property_node : properties) {
vector<string> property_names;
if (property_node.IsScalar())
property_names.push_back(property_node.as<string>());
else
property_names = property_node.as<vector<string>>();
vector<int> properties;
for (const auto &property_name : property_names) {
int property = is_int(property_name)
? stoi(property_name)
: libevdev_property_from_name(
property_name.c_str());
if (property < 0)
throw invalid_argument("invalid EVENT CODE: " +
property_name);
properties.push_back(property);
}
this->properties.push_back(std::move(properties));
}
}
if (auto events = device["EVENTS"]) {
for (const auto &event : events) {
auto event_type_name = event.first.as<string>();
int event_type = is_int(event_type_name)
? stoi(event_type_name)
: libevdev_event_type_from_name(
event_type_name.c_str());
if (event_type < 0)
throw invalid_argument("invalid EVENT TYPE: " +
event_type_name);
this->events[event_type] = {};
for (const auto &event_code_node : event.second) {
vector<string> event_code_names;
if (event_code_node.IsScalar())
event_code_names.push_back(
event_code_node.as<string>());
else
event_code_names = event_code_node.as<vector<string>>();
vector<int> event_codes;
for (const auto &event_code_name : event_code_names) {
int event_code =
is_int(event_code_name)
? stoi(event_code_name)
: libevdev_event_code_from_name(
event_type, event_code_name.c_str());
if (event_code < 0)
throw invalid_argument("invalid EVENT CODE: " +
event_code_name);
event_codes.push_back(event_code);
}
this->events[event_type].push_back(std::move(event_codes));
}
}
}
}
bool matches(udev_device *u, libevdev *e) const {
using std::pair;
using std::all_of;
using std::any_of;
using std::vector;
using std::none_of;
using std::to_string;
using std::regex_match;
if (has_link) {
udev_list_entry *dev_list_entry;
udev_list_entry_foreach(dev_list_entry,
udev_device_get_devlinks_list_entry(u)) {
if (regex_match(udev_list_entry_get_name(dev_list_entry), link))
goto next;
}
return false;
}
next:
auto empty_if_null = [](const char *s) { return s ? s : ""; };
if (!regex_match(empty_if_null(libevdev_get_name(e)), name))
return false;
if (!regex_match(empty_if_null(libevdev_get_phys(e)), location))
return false;
if (!regex_match(empty_if_null(libevdev_get_uniq(e)), id))
return false;
if (!regex_match(to_string(libevdev_get_id_product(e)), product) ||
!regex_match(to_string(libevdev_get_id_vendor(e)), vendor) ||
!regex_match(to_string(libevdev_get_id_bustype(e)), bustype) ||
!regex_match(to_string(libevdev_get_driver_version(e)),
driver_version))
return false;
if (!properties.empty() &&
none_of(properties.begin(), properties.end(),
[e](const vector<int> &property) {
return all_of(property.begin(), property.end(),
[e](int property) {
return libevdev_has_property(
e, property);
});
}))
return false;
return all_of(
events.begin(), events.end(),
[e](const pair<int, vector<vector<int>>> &event) {
return libevdev_has_event_type(e, event.first) &&
(event.second.empty() ||
any_of(event.second.begin(), event.second.end(),
[e, &event](const vector<int> &event_codes) {
return all_of(
event_codes.begin(), event_codes.end(),
[e, &event](int event_code) {
return libevdev_has_event_code(
e, event.first, event_code);
});
}));
});
}
std::vector<pid_t> launch_for(const std::string &devnode) const {
std::vector<pid_t> pids;
for (size_t i = 0; i < cmds.size(); ++i) {
pid_t pid = fork();
switch (pid) {
case -1:
std::fprintf(stderr,
R"(fork failed for devnode %s, job "%s" )"
R"(with error "%s")"
"\n",
devnode.c_str(), cmds[i].back().c_str(),
std::strerror(errno));
break;
case 0: {
std::unique_ptr<char *[]> command {
new char *[cmds[i].size() + 1]
};
for (size_t j = 0; j < cmds[i].size(); ++j)
command[j] = const_cast<char *>(cmds[i][j].c_str());
command[cmds[i].size()] = nullptr;
std::string variables = "DEVNODE=" + devnode;
char *environment[] = {
const_cast<char *>(variables.c_str()), nullptr};
setpgid(0, 0);
execvpe(command[0], command.get(), environment);
std::string e = "exec failed for devnode ";
e.append(devnode);
e.append(", job \"");
e.append(cmds[i].back());
e.append("\" with error \"");
e.append(std::strerror(errno));
e.append("\"");
throw std::runtime_error(e);
} break;
default:
pids.push_back(pid);
break;
}
}
return pids;
}
std::vector<std::vector<std::string>> cmds;
// clang-format off
bool has_link {false};
std::regex link;
std::regex name {".*", std::regex::optimize};
std::regex location {".*", std::regex::optimize};
std::regex id {".*", std::regex::optimize};
std::regex product {".*", std::regex::optimize};
std::regex vendor {".*", std::regex::optimize};
std::regex bustype {".*", std::regex::optimize};
std::regex driver_version {".*", std::regex::optimize};
// clang-format on
std::vector<std::vector<int>> properties;
std::map<int, std::vector<std::vector<int>>> events;
};
struct jobs_manager {
jobs_manager(const std::vector<yaml> &configs) {
using std::invalid_argument;
for (const auto &config : configs)
switch (config.size()) {
case 1:
if (!config[0].IsSequence())
throw invalid_argument(
"configuration must contain a job node's sequence "
"document");
for (const auto &job_node : config[0])
if (job_node["JOB"] && job_node.size() == 2)
jobs.emplace_back(job_node);
else
cmds.emplace_back(job_node);
break;
case 2:
if (config[0].IsSequence() == config[1].IsSequence())
throw invalid_argument(
"configuration must contain one job node's "
"sequence document");
size_t settings, sequence;
if (config[0].IsSequence())
settings = 1, sequence = 0;
else
settings = 0, sequence = 1;
for (const auto &job_node : config[sequence])
if (job_node["JOB"] && job_node.size() == 2)
jobs.emplace_back(job_node, config[settings]);
else
cmds.emplace_back(job_node, config[settings]);
break;
default:
throw invalid_argument(
"unexpected number of documents in configuration");
break;
}
}
void launch() {
for (const auto &cmd : cmds)
for (auto pid : cmd.launch())
running_cmds.push_back(pid);
}
void launch_for(udev_device *u) {
const char virtual_devices_directory[] = "/sys/devices/virtual/input/";
if (strncmp(udev_device_get_syspath(u), virtual_devices_directory,
sizeof(virtual_devices_directory) - 1) == 0)
return;
const char input_prefix[] = "/dev/input/event";
const char *devnode = udev_device_get_devnode(u);
if (!devnode ||
std::strncmp(devnode, input_prefix, sizeof(input_prefix) - 1))
return;
int fd = open(devnode, O_RDONLY);
if (fd < 0) {
std::fprintf(stderr,
R"(failed to open %s with error "%s")"
"\n",
devnode, std::strerror(errno));
return;
}
struct defer1 {
int fd;
~defer1() { close(fd); }
} defer1{fd};
libevdev *e;
if (libevdev_new_from_fd(fd, &e) < 0) {
std::fprintf(
stderr,
R"(failed to create evdev device for %s with error "%s")"
"\n",
devnode, std::strerror(errno));
return;
}
struct defer2 {
libevdev *e;
~defer2() { libevdev_free(e); }
} defer2{e};
for (const auto &job : jobs)
if (job.matches(u, e)) {
auto pids = running_jobs.find(devnode);
if (pids == running_jobs.end()) {
auto new_pids = job.launch_for(devnode);
if (!new_pids.empty())
running_jobs[devnode] = new_pids;
}
break;
}
}
void manage(udev_device *u) {
const char virtual_devices_directory[] = "/sys/devices/virtual/input/";
if (strncmp(udev_device_get_syspath(u), virtual_devices_directory,
sizeof(virtual_devices_directory) - 1) == 0)
return;
const char input_prefix[] = "/dev/input/event";
const char *devnode = udev_device_get_devnode(u);
if (!devnode ||
std::strncmp(devnode, input_prefix, sizeof(input_prefix) - 1))
return;
const char *action = udev_device_get_action(u);
if (!action)
return;
if (!std::strcmp(action, "add")) {
int fd = open(devnode, O_RDONLY);
if (fd < 0) {
std::fprintf(stderr,
R"(failed to open %s with error "%s")"
"\n",
devnode, std::strerror(errno));
return;
}
struct defer1 {
int fd;
~defer1() { close(fd); }
} defer1{fd};
libevdev *e;
if (libevdev_new_from_fd(fd, &e) < 0) {
std::fprintf(
stderr,
R"(failed to create evdev device for %s with error "%s")"
"\n",
devnode, std::strerror(errno));
return;
}
struct defer2 {
libevdev *e;
~defer2() { libevdev_free(e); }
} defer2{e};
for (const auto &job : jobs)
if (job.matches(u, e)) {
auto pids = running_jobs.find(devnode);
if (pids == running_jobs.end()) {
auto new_pids = job.launch_for(devnode);
if (!new_pids.empty())
running_jobs[devnode] = new_pids;
}
break;
}
} else if (!std::strcmp(action, "remove")) {
auto pids = running_jobs.find(devnode);
if (pids != running_jobs.end()) {
for (auto pid : pids->second)
kill(-pid, SIGTERM);
running_jobs.erase(pids);
}
}
}
~jobs_manager() {
for (auto pid : running_cmds)
kill(-pid, SIGTERM);
for (const auto &running_job : running_jobs)
for (auto pid : running_job.second)
kill(-pid, SIGTERM);
}
std::vector<cmd> cmds;
std::vector<job> jobs;
std::vector<pid_t> running_cmds;
std::map<std::string, std::vector<pid_t>> running_jobs;
};
std::vector<yaml> scan_config(const std::string &directory) {
static const std::regex yaml_extension{R"(.*\.ya?ml)",
std::regex::optimize};
std::vector<yaml> configs;
if (DIR *dir = opendir(directory.c_str()))
while (dirent *entry = readdir(dir))
if ((entry->d_type == DT_REG || entry->d_type == DT_LNK) &&
regex_match(entry->d_name, yaml_extension))
configs.push_back(
YAML::LoadAllFromFile(directory + '/' + entry->d_name));
return configs;
}
void kill_zombies(int /*signum*/) {
int status;
while (waitpid(-1, &status, WNOHANG) > 0)
;
}
volatile sig_atomic_t quit = false;
void set_quit_handler(int /*signal*/) { quit = true; }
int main(int argc, char *argv[]) try {
using std::perror;
std::regex default_config("/etc/interception/udevmon.ya?ml");
std::vector<yaml> configs = scan_config("/etc/interception/udevmon.d");
if (configs.size() > 0)
printf(
"%zu configuration files read from /etc/interception/udevmon.d\n",
configs.size());
for (int opt; (opt = getopt(argc, argv, "hc:")) != -1;) {
switch (opt) {
case 'h':
return print_usage(stdout, argv[0]), EXIT_SUCCESS;
case 'c':
try {
configs.push_back(YAML::LoadAllFromFile(optarg));
} catch (const YAML::BadFile &e) {
if (std::regex_match(optarg, default_config) &&
configs.size() > 0)
continue;
printf("ignoring %s, reason: %s\n", optarg, e.msg.c_str());
}
continue;
}
return print_usage(stderr, argv[0]), EXIT_FAILURE;
}
if (configs.empty())
return perror("couldn't read any configuration"), EXIT_FAILURE;
jobs_manager jobs(configs);
struct sigaction sa {};
sa.sa_flags = SA_NOCLDSTOP;
sa.sa_handler = &kill_zombies;
if (sigaction(SIGCHLD, &sa, nullptr) == -1)
return perror("couldn't summon zombie killer"), EXIT_FAILURE;
sa.sa_flags = 0;
sigemptyset(&sa.sa_mask);
sa.sa_handler = &set_quit_handler;
if (sigaction(SIGINT, &sa, nullptr) == -1)
return perror("couldn't register SIGINT signal handler"), EXIT_FAILURE;
if (sigaction(SIGTERM, &sa, nullptr) == -1)
return perror("couldn't register SIGTERM signal handler"), EXIT_FAILURE;
jobs.launch();
udev *udev = udev_new();
if (!udev)
return perror("can't create udev"), EXIT_FAILURE;
struct defer {
struct udev *udev;
~defer() { udev_unref(udev); }
} defer{udev};
{
udev_enumerate *enumerate = udev_enumerate_new(udev);
struct defer {
udev_enumerate *enumerate;
~defer() { udev_enumerate_unref(enumerate); }
} defer{enumerate};
udev_enumerate_add_match_subsystem(enumerate, "input");
udev_enumerate_scan_devices(enumerate);
udev_list_entry *dev_list_entry;
udev_list_entry_foreach(dev_list_entry,
udev_enumerate_get_list_entry(enumerate)) {
if (udev_device *u = udev_device_new_from_syspath(
udev, udev_list_entry_get_name(dev_list_entry))) {
struct defer {
udev_device *u;
~defer() { udev_device_unref(u); }
} defer{u};
jobs.launch_for(u);
}
}
}
{
udev_monitor *monitor = udev_monitor_new_from_netlink(udev, "udev");
if (!monitor)
return perror("can't create monitor"), EXIT_FAILURE;
struct defer {
udev_monitor *monitor;
~defer() { udev_monitor_unref(monitor); }
} defer{monitor};
udev_monitor_filter_add_match_subsystem_devtype(monitor, "input",
nullptr);
udev_monitor_enable_receiving(monitor);
int fd = udev_monitor_get_fd(monitor);
while (!quit) {
fd_set fds;
FD_ZERO(&fds);
FD_SET(fd, &fds);
if (select(fd + 1, &fds, nullptr, nullptr, nullptr) > 0 &&
FD_ISSET(fd, &fds)) {
if (udev_device *u = udev_monitor_receive_device(monitor)) {
struct defer {
udev_device *u;
~defer() { udev_device_unref(u); }
} defer{u};
jobs.manage(u);
}
}
}
}
} catch (const std::exception &e) {
return std::fprintf(stderr,
R"(an exception occurred: "%s")"
"\n",
e.what()),
EXIT_FAILURE;
}
07070100000009000081A4000000000000000000000001619A3A03000000E6000000000000000000000000000000000000001900000000tools-0.6.8/udevmon.init#!/sbin/openrc-run
depend() {
want udev-settle
after udev-settle
}
command=/usr/bin/udevmon
command_args='-c /etc/interception/udevmon.yaml'
start_stop_daemon_args='-N -20'
pidfile=/var/run/udevmon.pid
command_background=true
0707010000000A000081A4000000000000000000000001619A3A030000013A000000000000000000000000000000000000001C00000000tools-0.6.8/udevmon.service[Unit]
Description=Monitor input devices for launching tasks
Wants=systemd-udev-settle.service
After=systemd-udev-settle.service
Documentation=man:udev(7)
[Service]
ExecStart=/usr/bin/udevmon -c /etc/interception/udevmon.yaml
Nice=-20
Restart=on-failure
OOMScoreAdjust=-1000
[Install]
WantedBy=multi-user.target
0707010000000B000081A4000000000000000000000001619A3A0300004AF8000000000000000000000000000000000000001700000000tools-0.6.8/uinput.cpp#include <map>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <stdexcept>
extern "C" {
#include <fcntl.h>
#include <unistd.h>
}
#include <yaml-cpp/yaml.h>
#include <libevdev/libevdev-uinput.h>
std::map<int, std::string> bus_string = {
#ifdef BUS_PCI
{BUS_PCI, "BUS_PCI"},
#endif
#ifdef BUS_ISAPNP
{BUS_ISAPNP, "BUS_ISAPNP"},
#endif
#ifdef BUS_USB
{BUS_USB, "BUS_USB"},
#endif
#ifdef BUS_HIL
{BUS_HIL, "BUS_HIL"},
#endif
#ifdef BUS_BLUETOOTH
{BUS_BLUETOOTH, "BUS_BLUETOOTH"},
#endif
#ifdef BUS_VIRTUAL
{BUS_VIRTUAL, "BUS_VIRTUAL"},
#endif
#ifdef BUS_ISA
{BUS_ISA, "BUS_ISA"},
#endif
#ifdef BUS_I8042
{BUS_I8042, "BUS_I8042"},
#endif
#ifdef BUS_XTKBD
{BUS_XTKBD, "BUS_XTKBD"},
#endif
#ifdef BUS_RS232
{BUS_RS232, "BUS_RS232"},
#endif
#ifdef BUS_GAMEPORT
{BUS_GAMEPORT, "BUS_GAMEPORT"},
#endif
#ifdef BUS_PARPORT
{BUS_PARPORT, "BUS_PARPORT"},
#endif
#ifdef BUS_AMIGA
{BUS_AMIGA, "BUS_AMIGA"},
#endif
#ifdef BUS_ADB
{BUS_ADB, "BUS_ADB"},
#endif
#ifdef BUS_I2C
{BUS_I2C, "BUS_I2C"},
#endif
#ifdef BUS_HOST
{BUS_HOST, "BUS_HOST"},
#endif
#ifdef BUS_GSC
{BUS_GSC, "BUS_GSC"},
#endif
#ifdef BUS_ATARI
{BUS_ATARI, "BUS_ATARI"},
#endif
#ifdef BUS_SPI
{BUS_SPI, "BUS_SPI"},
#endif
#ifdef BUS_RMI
{BUS_RMI, "BUS_RMI"},
#endif
#ifdef BUS_CEC
{BUS_CEC, "BUS_CEC"},
#endif
#ifdef BUS_INTEL_ISHTP
{BUS_INTEL_ISHTP, "BUS_INTEL_ISHTP"},
#endif
};
std::map<std::string, int> string_bus = {
#ifdef BUS_PCI
{"BUS_PCI", BUS_PCI},
#endif
#ifdef BUS_ISAPNP
{"BUS_ISAPNP", BUS_ISAPNP},
#endif
#ifdef BUS_USB
{"BUS_USB", BUS_USB},
#endif
#ifdef BUS_HIL
{"BUS_HIL", BUS_HIL},
#endif
#ifdef BUS_BLUETOOTH
{"BUS_BLUETOOTH", BUS_BLUETOOTH},
#endif
#ifdef BUS_VIRTUAL
{"BUS_VIRTUAL", BUS_VIRTUAL},
#endif
#ifdef BUS_ISA
{"BUS_ISA", BUS_ISA},
#endif
#ifdef BUS_I8042
{"BUS_I8042", BUS_I8042},
#endif
#ifdef BUS_XTKBD
{"BUS_XTKBD", BUS_XTKBD},
#endif
#ifdef BUS_RS232
{"BUS_RS232", BUS_RS232},
#endif
#ifdef BUS_GAMEPORT
{"BUS_GAMEPORT", BUS_GAMEPORT},
#endif
#ifdef BUS_PARPORT
{"BUS_PARPORT", BUS_PARPORT},
#endif
#ifdef BUS_AMIGA
{"BUS_AMIGA", BUS_AMIGA},
#endif
#ifdef BUS_ADB
{"BUS_ADB", BUS_ADB},
#endif
#ifdef BUS_I2C
{"BUS_I2C", BUS_I2C},
#endif
#ifdef BUS_HOST
{"BUS_HOST", BUS_HOST},
#endif
#ifdef BUS_GSC
{"BUS_GSC", BUS_GSC},
#endif
#ifdef BUS_ATARI
{"BUS_ATARI", BUS_ATARI},
#endif
#ifdef BUS_SPI
{"BUS_SPI", BUS_SPI},
#endif
#ifdef BUS_RMI
{"BUS_RMI", BUS_RMI},
#endif
#ifdef BUS_CEC
{"BUS_CEC", BUS_CEC},
#endif
#ifdef BUS_INTEL_ISHTP
{"BUS_INTEL_ISHTP", BUS_INTEL_ISHTP},
#endif
};
void print_usage(std::FILE *stream, const char *program) {
// clang-format off
std::fprintf(stream,
"uinput - redirect device input events from stdin to virtual device\n"
"\n"
"usage: %s [-h | [-p] [-c device.yaml] [-d devnode]]\n"
"\n"
"options:\n"
" -h show this message and exit\n"
" -p show resulting YAML device description merge and exit\n"
" -c device.yaml merge YAML device description to resulting virtual\n"
" device (repeatable)\n"
" -d devnode merge reference device description to resulting virtual\n"
" device (repeatable)\n",
program);
// clang-format on
}
bool is_int(const std::string &s) {
return s.find_first_not_of("0123456789") == std::string::npos;
}
using block_type = unsigned long;
constexpr int block_size = sizeof(block_type) * 8;
constexpr int blocks_needed(int n_bits) {
return (n_bits - 1) / block_size + 1;
}
bool bit(const block_type buffer[], int bit_index) {
return buffer[bit_index / block_size] &
(block_type{1} << (bit_index % block_size));
}
std::string yaml_create_from_evdev(libevdev *dev) {
using std::map;
using std::vector;
using std::string;
using std::any_of;
YAML::Emitter yaml;
yaml << YAML::BeginMap;
if (auto name = libevdev_get_name(dev))
yaml << YAML::Key << "NAME" << YAML::Value << name;
if (auto location = libevdev_get_phys(dev))
yaml << YAML::Key << "LOCATION" << YAML::Value << location;
if (auto id = libevdev_get_uniq(dev))
yaml << YAML::Key << "ID" << YAML::Value << id;
if (auto product = libevdev_get_id_product(dev))
yaml << YAML::Key << "PRODUCT" << YAML::Value << product;
if (auto vendor = libevdev_get_id_vendor(dev))
yaml << YAML::Key << "VENDOR" << YAML::Value << vendor;
if (auto bustype = libevdev_get_id_bustype(dev)) {
if (bus_string.find(bustype) != bus_string.end())
yaml << YAML::Key << "BUSTYPE" << YAML::Value
<< bus_string[bustype];
else
yaml << YAML::Key << "BUSTYPE" << YAML::Value << bustype;
}
if (auto driver_version = libevdev_get_driver_version(dev))
yaml << YAML::Key << "DRIVER_VERSION" << YAML::Value << driver_version;
vector<string> properties;
if (libevdev_has_property(dev, INPUT_PROP_POINTER))
properties.push_back("INPUT_PROP_POINTER");
if (libevdev_has_property(dev, INPUT_PROP_DIRECT))
properties.push_back("INPUT_PROP_DIRECT");
if (libevdev_has_property(dev, INPUT_PROP_BUTTONPAD))
properties.push_back("INPUT_PROP_BUTTONPAD");
if (libevdev_has_property(dev, INPUT_PROP_SEMI_MT))
properties.push_back("INPUT_PROP_SEMI_MT");
if (libevdev_has_property(dev, INPUT_PROP_TOPBUTTONPAD))
properties.push_back("INPUT_PROP_TOPBUTTONPAD");
if (libevdev_has_property(dev, INPUT_PROP_POINTING_STICK))
properties.push_back("INPUT_PROP_POINTING_STICK");
if (libevdev_has_property(dev, INPUT_PROP_ACCELEROMETER))
properties.push_back("INPUT_PROP_ACCELEROMETER");
if (!properties.empty())
yaml << YAML::Key << "PROPERTIES" << YAML::Value << properties;
int fd = libevdev_get_fd(dev);
block_type type_mask[blocks_needed(EV_MAX)] = {};
block_type event_mask[blocks_needed(KEY_MAX)] = {};
if (ioctl(fd, EVIOCGBIT(0, EV_MAX), type_mask) != -1 &&
any_of(type_mask, type_mask + blocks_needed(EV_MAX),
[](block_type block) { return block != block_type{}; })) {
yaml << YAML::Key << "EVENTS" << YAML::Value;
yaml << YAML::BeginMap;
for (int type_code = 0; type_code <= EV_MAX; ++type_code) {
if (!bit(type_mask, type_code))
continue;
int event_max = libevdev_event_type_get_max(type_code);
const char *type_name = libevdev_event_type_get_name(type_code);
yaml << YAML::Key;
if (type_name)
yaml << libevdev_event_type_get_name(type_code);
else
yaml << type_code;
yaml << YAML::Value;
switch (type_code) {
case EV_SYN:
yaml << YAML::Flow << YAML::BeginSeq;
if (libevdev_has_event_code(dev, EV_SYN, SYN_REPORT))
yaml << "SYN_REPORT";
if (libevdev_has_event_code(dev, EV_SYN, SYN_CONFIG))
yaml << "SYN_CONFIG";
if (libevdev_has_event_code(dev, EV_SYN, SYN_MT_REPORT))
yaml << "SYN_MT_REPORT";
if (libevdev_has_event_code(dev, EV_SYN, SYN_DROPPED))
yaml << "SYN_DROPPED";
yaml << YAML::EndSeq;
break;
case EV_REP: {
int delay, period;
libevdev_get_repeat(dev, &delay, &period);
yaml << YAML::BeginMap;
yaml << YAML::Key << "REP_DELAY" << YAML::Value << delay;
yaml << YAML::Key << "REP_PERIOD" << YAML::Value << period;
yaml << YAML::EndMap;
} break;
case EV_ABS:
if (ioctl(fd, EVIOCGBIT(type_code, event_max),
event_mask) != -1) {
yaml << YAML::BeginMap;
for (int event_code = 0; event_code <= event_max;
++event_code) {
if (!bit(event_mask, event_code))
continue;
if (auto absinfo =
libevdev_get_abs_info(dev, event_code)) {
if (auto event_name =
libevdev_event_code_get_name(
type_code, event_code))
yaml << YAML::Key << event_name
<< YAML::Value;
else
yaml << YAML::Key << event_code
<< YAML::Value;
yaml << YAML::BeginMap;
yaml << YAML::Key << "VALUE" << YAML::Value
<< absinfo->value;
yaml << YAML::Key << "MIN" << YAML::Value
<< absinfo->minimum;
yaml << YAML::Key << "MAX" << YAML::Value
<< absinfo->maximum;
if (absinfo->flat > 0)
yaml << YAML::Key << "FLAT" << YAML::Value
<< absinfo->flat;
if (absinfo->fuzz > 0)
yaml << YAML::Key << "FUZZ" << YAML::Value
<< absinfo->fuzz;
if (absinfo->resolution > 0)
yaml << YAML::Key << "RES" << YAML::Value
<< absinfo->resolution;
yaml << YAML::EndMap;
}
}
yaml << YAML::EndMap;
}
break;
default:
if (ioctl(fd, EVIOCGBIT(type_code, event_max),
event_mask) != -1) {
yaml << YAML::Flow << YAML::BeginSeq;
for (int event_code = 0; event_code <= event_max;
++event_code) {
if (!bit(event_mask, event_code))
continue;
if (auto event_name = libevdev_event_code_get_name(
type_code, event_code))
yaml << event_name;
else
yaml << event_code;
}
yaml << YAML::EndSeq;
}
break;
}
}
yaml << YAML::EndMap;
}
yaml << YAML::EndMap;
return yaml.c_str();
}
libevdev *evdev_create_from_yaml(const std::vector<YAML::Node> &configs) {
using std::map;
using std::stoi;
using std::vector;
using std::string;
libevdev *dev = libevdev_new();
for (const auto &config : configs) {
if (auto name = config["NAME"])
libevdev_set_name(dev, name.as<string>().c_str());
if (auto id = config["ID"])
libevdev_set_uniq(dev, id.as<string>().c_str());
if (auto product = config["PRODUCT"])
libevdev_set_id_product(dev, product.as<int>());
if (auto vendor = config["VENDOR"])
libevdev_set_id_vendor(dev, vendor.as<int>());
if (auto bustype = config["BUSTYPE"])
libevdev_set_id_bustype(dev, string_bus[bustype.as<string>()]);
if (auto version = config["VERSION"])
libevdev_set_id_version(dev, version.as<int>());
if (auto property = config["PROPERTIES"])
for (auto it = property.begin(); it != property.end(); ++it) {
auto property =
libevdev_property_from_name(it->as<string>().c_str());
if (property != -1)
libevdev_enable_property(dev, property);
}
if (auto event_types = config["EVENTS"]) {
for (const auto &event_type : event_types) {
auto event_type_string = event_type.first.as<string>();
if (event_type_string == "EV_REP") {
if (auto rep_delay = event_type.second["REP_DELAY"]) {
auto rep_delay_value = rep_delay.as<int>();
libevdev_enable_event_code(dev, EV_REP, REP_DELAY,
&rep_delay_value);
}
if (auto rep_period = event_type.second["REP_PERIOD"]) {
auto rep_period_value = rep_period.as<int>();
libevdev_enable_event_code(dev, EV_REP, REP_PERIOD,
&rep_period_value);
}
} else if (event_type_string == "EV_ABS") {
for (const auto &axis : event_type.second) {
input_absinfo absinfo = {};
if (auto axis_value = axis.second["VALUE"])
absinfo.value = axis_value.as<int>();
if (auto axis_min = axis.second["MIN"])
absinfo.minimum = axis_min.as<int>();
if (auto axis_max = axis.second["MAX"])
absinfo.maximum = axis_max.as<int>();
if (auto axis_flat = axis.second["FLAT"])
absinfo.flat = axis_flat.as<int>();
if (auto fuzz = axis.second["FUZZ"])
absinfo.fuzz = fuzz.as<int>();
if (auto res = axis.second["RES"])
absinfo.resolution = res.as<int>();
if (!axis.second["VALUE"] && axis.second["MAX"])
absinfo.value = absinfo.maximum;
if (!axis.second["VALUE"] && axis.second["MIN"])
absinfo.value = absinfo.minimum;
auto axis_code = libevdev_event_code_from_name(
EV_ABS, axis.first.as<string>().c_str());
if (axis_code != -1)
libevdev_enable_event_code(dev, EV_ABS, axis_code,
&absinfo);
}
} else {
auto event_type_code = libevdev_event_type_from_name(
event_type_string.c_str());
for (const auto &event : event_type.second) {
auto event_string = event.as<string>();
if (is_int(event_string))
libevdev_enable_event_code(dev, event_type_code,
stoi(event_string),
nullptr);
else {
auto event_code = libevdev_event_code_from_name(
event_type_code, event_string.c_str());
if (event_code != -1)
libevdev_enable_event_code(dev, event_type_code,
event_code, nullptr);
}
}
}
}
}
}
return dev;
}
int main(int argc, char *argv[]) try {
using std::perror;
std::vector<YAML::Node> configs;
bool print = false;
for (int opt; (opt = getopt(argc, argv, "hc:d:p")) != -1;) {
switch (opt) {
case 'h':
return print_usage(stdout, argv[0]), EXIT_SUCCESS;
case 'c':
configs.push_back(YAML::LoadFile(optarg));
continue;
case 'd': {
int fd = open(optarg, O_RDONLY);
if (fd < 0)
return perror("open failed"), EXIT_FAILURE;
struct defer1 {
int fd;
~defer1() { close(fd); }
} defer1{fd};
libevdev *dev;
if (libevdev_new_from_fd(fd, &dev) < 0)
return perror("libevdev_new_from_fd failed"), EXIT_FAILURE;
struct defer2 {
libevdev *dev;
~defer2() { libevdev_free(dev); }
} defer2{dev};
configs.push_back(YAML::Load(yaml_create_from_evdev(dev)));
continue;
}
case 'p':
if (print)
break;
print = true;
continue;
}
return print_usage(stderr, argv[0]), EXIT_FAILURE;
}
if (configs.empty())
return print_usage(stderr, argv[0]), EXIT_FAILURE;
libevdev *dev = evdev_create_from_yaml(configs);
struct defer1 {
libevdev *dev;
~defer1() { libevdev_free(dev); }
} defer1{dev};
libevdev_uinput *uidev;
if (libevdev_uinput_create_from_device(dev, LIBEVDEV_UINPUT_OPEN_MANAGED,
&uidev) < 0)
return perror("libevdev_uinput_create_from_device failed"),
EXIT_FAILURE;
struct defer2 {
libevdev_uinput *uidev;
~defer2() { libevdev_uinput_destroy(uidev); }
} defer2{uidev};
if (print) {
int fd = open(libevdev_uinput_get_devnode(uidev), O_RDONLY);
if (fd < 0)
return perror("open failed"), EXIT_FAILURE;
struct defer1 {
int fd;
~defer1() { close(fd); }
} defer1{fd};
libevdev *dev;
if (libevdev_new_from_fd(fd, &dev) < 0)
return perror("libevdev_new_from_fd failed"), EXIT_FAILURE;
struct defer2 {
libevdev *dev;
~defer2() { libevdev_free(dev); }
} defer2{dev};
return puts(yaml_create_from_evdev(dev).c_str()), EXIT_SUCCESS;
}
std::setbuf(stdin, nullptr);
input_event input;
while (fread(&input, sizeof input, 1, stdin) == 1)
if (libevdev_uinput_write_event(uidev, input.type, input.code,
input.value) < 0)
return perror("libevdev_uinput_write_event failed"), EXIT_FAILURE;
} catch (const std::exception &e) {
return std::fprintf(stderr,
R"(an exception occurred: "%s")"
"\n",
e.what()),
EXIT_FAILURE;
}
07070100000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000B00000000TRAILER!!!234 blocks
