Add C++20 RAII wrapper around wlroots 0.20 + scenefx
Wraps wlroots' C ABI behind owning types (Display, Backend, Compositor, Output, XdgShell/Toplevel, Seat/Cursor/Keyboard, Scene/Node/Tree) with wl_signal -> std::function callbacks. Links the scenefx effect engine and ships a wlr::fx animation helper. Includes a runnable tinywl-style compositor and a scene/blur demo. License: AGPL-3.0-only.
This commit is contained in:
AstralZX
@@ -0,0 +1 @@
|
|||||||
|
build/
|
||||||
@@ -0,0 +1,38 @@
|
|||||||
|
cmake_minimum_required(VERSION 3.16)
|
||||||
|
project(wlrootspp VERSION 0.1.0 LANGUAGES C CXX)
|
||||||
|
|
||||||
|
set(CMAKE_CXX_STANDARD 20)
|
||||||
|
set(CMAKE_CXX_STANDARD_REQUIRED ON)
|
||||||
|
set(CMAKE_POSITION_INDEPENDENT_CODE ON)
|
||||||
|
|
||||||
|
if(NOT CMAKE_BUILD_TYPE)
|
||||||
|
set(CMAKE_BUILD_TYPE Release)
|
||||||
|
endif()
|
||||||
|
|
||||||
|
find_package(PkgConfig REQUIRED)
|
||||||
|
pkg_check_modules(WLROOTS REQUIRED IMPORTED_TARGET wlroots-0.20)
|
||||||
|
pkg_check_modules(SCENEFX REQUIRED IMPORTED_TARGET scenefx-0.5)
|
||||||
|
pkg_check_modules(WAYLAND_SERVER REQUIRED IMPORTED_TARGET wayland-server)
|
||||||
|
pkg_check_modules(XKBCOMMON REQUIRED IMPORTED_TARGET xkbcommon)
|
||||||
|
pkg_check_modules(PIXMAN REQUIRED IMPORTED_TARGET pixman-1)
|
||||||
|
|
||||||
|
file(GLOB_RECURSE WLROOTSPP_SOURCES CONFIGURE_DEPENDS
|
||||||
|
"${CMAKE_CURRENT_SOURCE_DIR}/src/*.cpp")
|
||||||
|
file(GLOB_RECURSE WLROOTSPP_HEADERS CONFIGURE_DEPENDS
|
||||||
|
"${CMAKE_CURRENT_SOURCE_DIR}/include/*.hpp")
|
||||||
|
|
||||||
|
add_library(wlrootspp ${WLROOTSPP_SOURCES} ${WLROOTSPP_HEADERS})
|
||||||
|
target_include_directories(wlrootspp PUBLIC
|
||||||
|
"${CMAKE_CURRENT_SOURCE_DIR}/include")
|
||||||
|
target_compile_definitions(wlrootspp PUBLIC WLR_USE_UNSTABLE)
|
||||||
|
target_link_libraries(wlrootspp PUBLIC
|
||||||
|
PkgConfig::SCENEFX
|
||||||
|
PkgConfig::WLROOTS
|
||||||
|
PkgConfig::WAYLAND_SERVER
|
||||||
|
PkgConfig::XKBCOMMON
|
||||||
|
PkgConfig::PIXMAN)
|
||||||
|
set_target_properties(wlrootspp PROPERTIES
|
||||||
|
CXX_VISIBILITY_PRESET hidden
|
||||||
|
VISIBILITY_INLINES_HIDDEN YES)
|
||||||
|
|
||||||
|
add_subdirectory(examples)
|
||||||
@@ -0,0 +1,661 @@
|
|||||||
|
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 19 November 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The GNU Affero General Public License is a free, copyleft license for
|
||||||
|
software and other kinds of works, specifically designed to ensure
|
||||||
|
cooperation with the community in the case of network server software.
|
||||||
|
|
||||||
|
The licenses for most software and other practical works are designed
|
||||||
|
to take away your freedom to share and change the works. By contrast,
|
||||||
|
our General Public Licenses are 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.
|
||||||
|
|
||||||
|
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.
|
||||||
|
|
||||||
|
Developers that use our General Public Licenses protect your rights
|
||||||
|
with two steps: (1) assert copyright on the software, and (2) offer
|
||||||
|
you this License which gives you legal permission to copy, distribute
|
||||||
|
and/or modify the software.
|
||||||
|
|
||||||
|
A secondary benefit of defending all users' freedom is that
|
||||||
|
improvements made in alternate versions of the program, if they
|
||||||
|
receive widespread use, become available for other developers to
|
||||||
|
incorporate. Many developers of free software are heartened and
|
||||||
|
encouraged by the resulting cooperation. However, in the case of
|
||||||
|
software used on network servers, this result may fail to come about.
|
||||||
|
The GNU General Public License permits making a modified version and
|
||||||
|
letting the public access it on a server without ever releasing its
|
||||||
|
source code to the public.
|
||||||
|
|
||||||
|
The GNU Affero General Public License is designed specifically to
|
||||||
|
ensure that, in such cases, the modified source code becomes available
|
||||||
|
to the community. It requires the operator of a network server to
|
||||||
|
provide the source code of the modified version running there to the
|
||||||
|
users of that server. Therefore, public use of a modified version, on
|
||||||
|
a publicly accessible server, gives the public access to the source
|
||||||
|
code of the modified version.
|
||||||
|
|
||||||
|
An older license, called the Affero General Public License and
|
||||||
|
published by Affero, was designed to accomplish similar goals. This is
|
||||||
|
a different license, not a version of the Affero GPL, but Affero has
|
||||||
|
released a new version of the Affero GPL which permits relicensing under
|
||||||
|
this license.
|
||||||
|
|
||||||
|
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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
|
||||||
|
|
||||||
|
Notwithstanding any other provision of this License, if you modify the
|
||||||
|
Program, your modified version must prominently offer all users
|
||||||
|
interacting with it remotely through a computer network (if your version
|
||||||
|
supports such interaction) an opportunity to receive the Corresponding
|
||||||
|
Source of your version by providing access to the Corresponding Source
|
||||||
|
from a network server at no charge, through some standard or customary
|
||||||
|
means of facilitating copying of software. This Corresponding Source
|
||||||
|
shall include the Corresponding Source for any work covered by version 3
|
||||||
|
of the GNU General Public License that is incorporated pursuant to the
|
||||||
|
following paragraph.
|
||||||
|
|
||||||
|
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 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 work with which it is combined will remain governed by version
|
||||||
|
3 of the GNU General Public License.
|
||||||
|
|
||||||
|
14. Revised Versions of this License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions of
|
||||||
|
the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Affero General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If your software can interact with users remotely through a computer
|
||||||
|
network, you should also make sure that it provides a way for users to
|
||||||
|
get its source. For example, if your program is a web application, its
|
||||||
|
interface could display a "Source" link that leads users to an archive
|
||||||
|
of the code. There are many ways you could offer source, and different
|
||||||
|
solutions will be better for different programs; see section 13 for the
|
||||||
|
specific requirements.
|
||||||
|
|
||||||
|
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 AGPL, see
|
||||||
|
<https://www.gnu.org/licenses/>.
|
||||||
@@ -0,0 +1,142 @@
|
|||||||
|
# wlroots++
|
||||||
|
|
||||||
|
A modern **C++20 RAII wrapper** around the
|
||||||
|
[wlroots](https://gitlab.freedesktop.org/wlroots/wlroots) 0.20 Wayland
|
||||||
|
compositor library. It wraps wlroots' C ABI behind owning object types so a
|
||||||
|
compositor can be written in idiomatic C++, and it links in the
|
||||||
|
[scenefx](https://github.com/wlrfx/scenefx) effect engine (blur, shadows,
|
||||||
|
rounded corners) plus a small `wlr::fx` animation helper.
|
||||||
|
|
||||||
|
wlroots has no stable ABI across versions, so wlroots++ pins a target and
|
||||||
|
exposes the scene graph, surface tree, seat, output and XDG-shell plumbing as
|
||||||
|
RAII classes with `wl_signal` → `std::function` callbacks.
|
||||||
|
|
||||||
|
## License
|
||||||
|
|
||||||
|
**AGPL-3.0-only.** This is a deliberate strong-copyleft choice: any project that
|
||||||
|
links against or uses wlroots++ must itself be released under the AGPL-3.0. See
|
||||||
|
`COPYING`.
|
||||||
|
|
||||||
|
## Target
|
||||||
|
|
||||||
|
wlroots has no stable ABI across versions, so wlroots++ pins a target:
|
||||||
|
|
||||||
|
* **wlroots 0.20** (pkg-config name `wlroots-0.20`)
|
||||||
|
* **scenefx 0.5** (pkg-config name `scenefx-0.5`)
|
||||||
|
|
||||||
|
## Building
|
||||||
|
|
||||||
|
```sh
|
||||||
|
cmake -B build -DCMAKE_BUILD_TYPE=Release
|
||||||
|
cmake --build build
|
||||||
|
```
|
||||||
|
|
||||||
|
Requires development files for: `wlroots-0.20`, `scenefx-0.5`, `wayland-server`,
|
||||||
|
`xkbcommon`, `pixman`. The library is compiled with `-DWLR_USE_UNSTABLE`, which
|
||||||
|
is propagated as a public definition to consumers.
|
||||||
|
|
||||||
|
This produces `libwlrootspp.a` plus the `scene_demo` and `tinywl` examples.
|
||||||
|
|
||||||
|
## Layout
|
||||||
|
|
||||||
|
```
|
||||||
|
include/wlr/wlr.hpp C++20 compat shim + wlroots/scenefx includes
|
||||||
|
include/wlr/signals.hpp SignalSink: wl_signal -> std::function<void(void*)>
|
||||||
|
include/wlr/display.hpp Display (wl_display lifecycle, socket, run loop)
|
||||||
|
include/wlr/backend.hpp Backend (autocreate, start, new_output/new_input)
|
||||||
|
include/wlr/compositor.hpp Renderer, Allocator, DataDeviceManager, Compositor
|
||||||
|
include/wlr/output.hpp Output, SceneOutput, OutputLayout
|
||||||
|
include/wlr/xdg_shell.hpp XdgSurface, Toplevel, XdgShell
|
||||||
|
include/wlr/seat.hpp Cursor, Keyboard, Seat
|
||||||
|
include/wlr/scene.hpp Scene, Box, Color, CornerRadii
|
||||||
|
include/wlr/node.hpp Node, Tree, Rect, Shadow, Blur, OptimizedBlur, Buffer, Surface
|
||||||
|
include/wlr/scenefx/anim.hpp wlr::fx::Easing, wlr::fx::Animated<>
|
||||||
|
include/wlr/scenefx/effect.hpp wlr::fx::Effect
|
||||||
|
src/wlrootspp.cpp version() and Node::as<T> conversions
|
||||||
|
examples/ runnable demos (scene_demo, tinywl)
|
||||||
|
```
|
||||||
|
|
||||||
|
## Examples
|
||||||
|
|
||||||
|
* `examples/scene_demo.cpp` — exercises the scene graph and scenefx blur.
|
||||||
|
* `examples/tinywl.cpp` — a minimal C++ compositor: boots, creates a headless
|
||||||
|
output, serves the full Wayland protocol (xdg_wm_base, wl_seat, wl_output,
|
||||||
|
…), and maps XDG toplevels into the scene graph.
|
||||||
|
|
||||||
|
Run the compositor (headless, for testing):
|
||||||
|
|
||||||
|
```sh
|
||||||
|
WLR_BACKENDS=headless WLR_HEADLESS_OUTPUTS=1 ./build/examples/tinywl
|
||||||
|
# prints: tinywl: WAYLAND_DISPLAY=wayland-N
|
||||||
|
WAYLAND_DISPLAY=wayland-N your-wayland-client
|
||||||
|
```
|
||||||
|
|
||||||
|
## Usage
|
||||||
|
|
||||||
|
```cpp
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/backend.hpp"
|
||||||
|
#include "wlr/compositor.hpp"
|
||||||
|
#include "wlr/output.hpp"
|
||||||
|
#include "wlr/xdg_shell.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
wlr::Display display;
|
||||||
|
wlr::Backend backend(display);
|
||||||
|
wlr::Renderer renderer(wlr_renderer_autocreate(backend.raw()));
|
||||||
|
renderer.init_wl_display(display);
|
||||||
|
wlr::Allocator alloc(wlr_allocator_autocreate(backend.raw(), renderer.raw()));
|
||||||
|
wlr::Compositor comp(display, renderer);
|
||||||
|
wlr::XdgShell xdg(display);
|
||||||
|
wlr::OutputLayout layout(display);
|
||||||
|
wlr::Scene scene;
|
||||||
|
|
||||||
|
backend.on_new_output([&](void* data) {
|
||||||
|
auto* o = static_cast<struct wlr_output*>(data);
|
||||||
|
wlr_output_init_render(o, alloc.raw(), renderer.raw());
|
||||||
|
wlr_scene_output_create(scene.raw(), o);
|
||||||
|
layout.add_auto_output(o);
|
||||||
|
});
|
||||||
|
|
||||||
|
xdg.on_new_toplevel([&](void* data) {
|
||||||
|
auto* t = static_cast<struct wlr_xdg_toplevel*>(data);
|
||||||
|
wlr_scene_xdg_surface_create(scene.root(), t->base);
|
||||||
|
wlr_xdg_surface_schedule_configure(t->base);
|
||||||
|
});
|
||||||
|
|
||||||
|
display.add_socket_auto();
|
||||||
|
backend.start();
|
||||||
|
display.run();
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
## Effects
|
||||||
|
|
||||||
|
`wlr::Scene` exposes scenefx blur controls directly:
|
||||||
|
|
||||||
|
```cpp
|
||||||
|
wlr::Scene scene;
|
||||||
|
scene.set_blur_radius(14);
|
||||||
|
scene.set_blur_num_passes(2);
|
||||||
|
scene.set_blur_brightness(1.0f);
|
||||||
|
```
|
||||||
|
|
||||||
|
Per-node corner radii, shadows and blur are available through the `Rect`,
|
||||||
|
`Shadow`, `Blur` and `Buffer` node wrappers in `wlr/node.hpp`.
|
||||||
|
|
||||||
|
## Animation helper
|
||||||
|
|
||||||
|
`wlr::fx` provides easing and an `Animated<T>` value plus an `Effect` aggregator
|
||||||
|
for driving per-node properties over time:
|
||||||
|
|
||||||
|
```cpp
|
||||||
|
wlr::fx::Effect fx;
|
||||||
|
fx.opacity().set_duration(300);
|
||||||
|
fx.opacity().set_easing(wlr::fx::Easing::InOutQuad);
|
||||||
|
fx.opacity().set(0.3f);
|
||||||
|
for (std::uint64_t t = 0; fx.animating(); t += 16) {
|
||||||
|
fx.on_frame(t);
|
||||||
|
fx.apply_to(node);
|
||||||
|
}
|
||||||
|
```
|
||||||
@@ -0,0 +1,5 @@
|
|||||||
|
add_executable(scene_demo scene_demo.cpp)
|
||||||
|
target_link_libraries(scene_demo PRIVATE wlrootspp)
|
||||||
|
|
||||||
|
add_executable(tinywl tinywl.cpp)
|
||||||
|
target_link_libraries(tinywl PRIVATE wlrootspp)
|
||||||
@@ -0,0 +1,48 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#include <cstdio>
|
||||||
|
#include <cstdint>
|
||||||
|
|
||||||
|
#include <wlr/scene.hpp>
|
||||||
|
#include <wlr/node.hpp>
|
||||||
|
#include <wlr/scenefx/anim.hpp>
|
||||||
|
#include <wlr/scenefx/effect.hpp>
|
||||||
|
|
||||||
|
int main(int argc, char** argv) {
|
||||||
|
(void)argc; (void)argv;
|
||||||
|
|
||||||
|
wlr::Scene scene;
|
||||||
|
if (!scene)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::Tree root{wlr_scene_tree_create(&scene.raw()->tree)};
|
||||||
|
|
||||||
|
const float color[4] = {1.0f, 0.2f, 0.2f, 1.0f};
|
||||||
|
wlr::Rect r{wlr_scene_rect_create(root.raw(), 200, 120, color)};
|
||||||
|
r.set_position(40, 60);
|
||||||
|
|
||||||
|
wlr::fx::Effect fx;
|
||||||
|
fx.position_y().set_duration(500);
|
||||||
|
fx.position_y().set_easing(wlr::fx::Easing::OutCubic);
|
||||||
|
fx.opacity().set_duration(300);
|
||||||
|
fx.opacity().set_easing(wlr::fx::Easing::InOutQuad);
|
||||||
|
|
||||||
|
fx.position_y().set(240.0f);
|
||||||
|
fx.opacity().set(0.3f);
|
||||||
|
|
||||||
|
std::uint64_t t = 0;
|
||||||
|
while (fx.animating()) {
|
||||||
|
t += 16;
|
||||||
|
fx.on_frame(t);
|
||||||
|
fx.apply_to(r);
|
||||||
|
}
|
||||||
|
|
||||||
|
wlr::Box box = {10, 20, 300, 40};
|
||||||
|
wlr::Box back = wlr::Box::from_box(box.to_box());
|
||||||
|
std::printf("wlroots++ demo: x=%d y=%d box=%dx%d anim=%s version=%s\n",
|
||||||
|
r.position().first, r.position().second,
|
||||||
|
back.width, back.height,
|
||||||
|
fx.animating() ? "yes" : "no",
|
||||||
|
wlr::version().c_str());
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
@@ -0,0 +1,213 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#include <cstdio>
|
||||||
|
#include <vector>
|
||||||
|
#include <string>
|
||||||
|
#include <algorithm>
|
||||||
|
#include <ctime>
|
||||||
|
#include <xkbcommon/xkbcommon.h>
|
||||||
|
|
||||||
|
#include <wayland-server-core.h>
|
||||||
|
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/backend.hpp"
|
||||||
|
#include "wlr/compositor.hpp"
|
||||||
|
#include "wlr/output.hpp"
|
||||||
|
#include "wlr/xdg_shell.hpp"
|
||||||
|
#include "wlr/seat.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
#include "wlr/node.hpp"
|
||||||
|
|
||||||
|
struct FrameScheduler {
|
||||||
|
wl_event_source* source = nullptr;
|
||||||
|
struct wlr_scene* scene = nullptr;
|
||||||
|
std::vector<struct wlr_scene_output*>* outputs = nullptr;
|
||||||
|
};
|
||||||
|
|
||||||
|
static void commit_outputs(FrameScheduler* s) {
|
||||||
|
for (struct wlr_scene_output* so : *s->outputs)
|
||||||
|
wlr_scene_output_commit(so, nullptr);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int frame_tick(void* data) {
|
||||||
|
FrameScheduler* s = static_cast<FrameScheduler*>(data);
|
||||||
|
commit_outputs(s);
|
||||||
|
wl_event_source_timer_update(s->source, 16);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
struct ToplevelState {
|
||||||
|
wlr::XdgSurface xdg;
|
||||||
|
wlr::Tree scene_tree;
|
||||||
|
bool mapped = false;
|
||||||
|
std::string title;
|
||||||
|
};
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
wlr::Display display;
|
||||||
|
if (!display)
|
||||||
|
return 1;
|
||||||
|
const char* socket = display.add_socket_auto();
|
||||||
|
if (!socket)
|
||||||
|
return 1;
|
||||||
|
fprintf(stderr, "tinywl: WAYLAND_DISPLAY=%s\n", socket);
|
||||||
|
fflush(stderr);
|
||||||
|
|
||||||
|
wlr::Backend backend(display);
|
||||||
|
if (!backend)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::Renderer renderer(wlr_renderer_autocreate(backend.raw()));
|
||||||
|
if (!renderer)
|
||||||
|
return 1;
|
||||||
|
if (!renderer.init_wl_display(display))
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::Allocator allocator(wlr_allocator_autocreate(backend.raw(), renderer.raw()));
|
||||||
|
if (!allocator)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::Compositor compositor(display, renderer);
|
||||||
|
if (!compositor)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::XdgShell xdg_shell(display);
|
||||||
|
if (!xdg_shell)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::DataDeviceManager data_device_manager(wlr_data_device_manager_create(display.raw()));
|
||||||
|
(void)data_device_manager;
|
||||||
|
|
||||||
|
wlr::Seat seat(display, "seat0");
|
||||||
|
if (!seat)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::Cursor cursor;
|
||||||
|
if (!cursor)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
wlr::OutputLayout layout(display);
|
||||||
|
if (!layout)
|
||||||
|
return 1;
|
||||||
|
cursor.attach_output_layout(layout.raw());
|
||||||
|
|
||||||
|
wlr::Scene scene;
|
||||||
|
scene.set_blur_radius(14);
|
||||||
|
scene.set_blur_num_passes(2);
|
||||||
|
scene.set_blur_noise(0.0f);
|
||||||
|
scene.set_blur_brightness(1.0f);
|
||||||
|
scene.set_blur_contrast(1.0f);
|
||||||
|
scene.set_blur_saturation(1.0f);
|
||||||
|
|
||||||
|
wlr::Tree toplevels(wlr_scene_tree_create(scene.root()));
|
||||||
|
if (!toplevels)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
std::vector<struct wlr_scene_output*> outputs;
|
||||||
|
std::vector<ToplevelState*> toplevel_nodes;
|
||||||
|
|
||||||
|
FrameScheduler scheduler;
|
||||||
|
scheduler.scene = scene.raw();
|
||||||
|
scheduler.outputs = &outputs;
|
||||||
|
scheduler.source = wl_event_loop_add_timer(display.event_loop(), frame_tick, &scheduler);
|
||||||
|
|
||||||
|
backend.on_new_output([&](void* data) {
|
||||||
|
struct wlr_output* o = static_cast<struct wlr_output*>(data);
|
||||||
|
wlr::Output out(o);
|
||||||
|
out.set_preferred_mode();
|
||||||
|
wlr_output_init_render(o, allocator.raw(), renderer.raw());
|
||||||
|
wlr_output_create_global(o, display.raw());
|
||||||
|
|
||||||
|
struct wlr_scene_output* so = wlr_scene_output_create(scene.raw(), o);
|
||||||
|
wlr_scene_output_set_position(so, 0, 0);
|
||||||
|
outputs.push_back(so);
|
||||||
|
layout.add_auto_output(o);
|
||||||
|
wl_event_source_timer_update(scheduler.source, 0);
|
||||||
|
});
|
||||||
|
|
||||||
|
backend.on_new_input([&](void* data) {
|
||||||
|
struct wlr_input_device* device = static_cast<struct wlr_input_device*>(data);
|
||||||
|
cursor.attach_input_device(device);
|
||||||
|
if (device->type != WLR_INPUT_DEVICE_KEYBOARD)
|
||||||
|
return;
|
||||||
|
struct wlr_keyboard* kb = wlr_keyboard_from_input_device(device);
|
||||||
|
wlr::Keyboard k(kb);
|
||||||
|
k.set_default_keymap();
|
||||||
|
seat.set_keyboard(k);
|
||||||
|
seat.set_capabilities(WL_SEAT_CAPABILITY_POINTER | WL_SEAT_CAPABILITY_KEYBOARD);
|
||||||
|
});
|
||||||
|
|
||||||
|
int toplevel_count = 0;
|
||||||
|
xdg_shell.on_new_toplevel([&](void* data) {
|
||||||
|
struct wlr_xdg_toplevel* t = static_cast<struct wlr_xdg_toplevel*>(data);
|
||||||
|
wl_event_loop_add_idle(display.event_loop(),
|
||||||
|
[](void* data) {
|
||||||
|
auto* s = static_cast<struct wlr_xdg_surface*>(data);
|
||||||
|
if (s->initialized)
|
||||||
|
wlr_xdg_surface_schedule_configure(s);
|
||||||
|
}, t->base);
|
||||||
|
ToplevelState* tn = new ToplevelState{
|
||||||
|
wlr::XdgSurface{t->base},
|
||||||
|
wlr::Tree(wlr_scene_xdg_surface_create(toplevels.raw(), t->base)),
|
||||||
|
};
|
||||||
|
toplevel_nodes.push_back(tn);
|
||||||
|
|
||||||
|
tn->xdg.on_map([&, tn](void*) {
|
||||||
|
struct wlr_box lb = layout.box();
|
||||||
|
int w = lb.width > 80 ? lb.width - 80 : 40;
|
||||||
|
int h = lb.height > 80 ? lb.height - 80 : 40;
|
||||||
|
int x = lb.x + 40 + (toplevel_count * 24) % w;
|
||||||
|
int y = lb.y + 40 + (toplevel_count * 24) % h;
|
||||||
|
toplevel_count++;
|
||||||
|
tn->scene_tree.set_position(x, y);
|
||||||
|
tn->scene_tree.raise_to_top();
|
||||||
|
tn->mapped = true;
|
||||||
|
});
|
||||||
|
tn->xdg.on_unmap([tn](void*) {
|
||||||
|
tn->mapped = false;
|
||||||
|
});
|
||||||
|
tn->xdg.on_destroy([&, tn](void*) {
|
||||||
|
if (tn->scene_tree)
|
||||||
|
wlr_scene_node_destroy(&tn->scene_tree.raw()->node);
|
||||||
|
auto it = std::find(toplevel_nodes.begin(), toplevel_nodes.end(), tn);
|
||||||
|
if (it != toplevel_nodes.end())
|
||||||
|
toplevel_nodes.erase(it);
|
||||||
|
delete tn;
|
||||||
|
});
|
||||||
|
|
||||||
|
wlr::Toplevel toplevel(t);
|
||||||
|
toplevel.on_set_title([tn](void* d) {
|
||||||
|
const char* s = static_cast<struct wlr_xdg_toplevel*>(d)->title;
|
||||||
|
tn->title = s ? s : "";
|
||||||
|
});
|
||||||
|
toplevel.on_set_app_id([](void*) {});
|
||||||
|
toplevel.on_request_maximize([&, tn, t](void* d) {
|
||||||
|
auto* e = static_cast<struct wlr_xdg_toplevel_requested*>(d);
|
||||||
|
wlr::Toplevel{t}.set_maximized(e->maximized);
|
||||||
|
struct wlr_box lb = layout.box();
|
||||||
|
tn->scene_tree.set_position(lb.x, lb.y);
|
||||||
|
tn->scene_tree.set_enabled(true);
|
||||||
|
});
|
||||||
|
toplevel.on_request_minimize([&, tn, t](void* d) {
|
||||||
|
auto* e = static_cast<struct wlr_xdg_toplevel_requested*>(d);
|
||||||
|
tn->scene_tree.set_enabled(!e->minimized);
|
||||||
|
});
|
||||||
|
toplevel.on_request_fullscreen([&, tn, t](void* d) {
|
||||||
|
auto* e = static_cast<struct wlr_xdg_toplevel_requested*>(d);
|
||||||
|
wlr::Toplevel{t}.set_maximized(e->fullscreen);
|
||||||
|
struct wlr_box lb = layout.box();
|
||||||
|
tn->scene_tree.set_position(lb.x, lb.y);
|
||||||
|
tn->scene_tree.set_enabled(true);
|
||||||
|
});
|
||||||
|
toplevel.on_request_move([](void*) {});
|
||||||
|
toplevel.on_request_resize([](void*) {});
|
||||||
|
});
|
||||||
|
|
||||||
|
if (!backend.start())
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
display.run();
|
||||||
|
|
||||||
|
for (ToplevelState* tn : toplevel_nodes)
|
||||||
|
delete tn;
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
@@ -0,0 +1,47 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <functional>
|
||||||
|
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/signals.hpp"
|
||||||
|
#include "wlr/compositor.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Backend {
|
||||||
|
public:
|
||||||
|
explicit Backend(Display& display, bool headless = false) {
|
||||||
|
m_backend = wlr_backend_autocreate(display.event_loop(), nullptr);
|
||||||
|
}
|
||||||
|
|
||||||
|
~Backend() {
|
||||||
|
m_newOutput.disconnect();
|
||||||
|
m_newInput.disconnect();
|
||||||
|
if (m_backend)
|
||||||
|
wlr_backend_destroy(m_backend);
|
||||||
|
}
|
||||||
|
|
||||||
|
Backend(const Backend&) = delete;
|
||||||
|
Backend& operator=(const Backend&) = delete;
|
||||||
|
|
||||||
|
struct wlr_backend* raw() const { return m_backend; }
|
||||||
|
explicit operator bool() const { return m_backend != nullptr; }
|
||||||
|
bool start() { return wlr_backend_start(m_backend); }
|
||||||
|
|
||||||
|
// cb receives struct wlr_output*
|
||||||
|
void on_new_output(std::function<void(void*)> cb) {
|
||||||
|
m_newOutput.connect(&m_backend->events.new_output, std::move(cb));
|
||||||
|
}
|
||||||
|
// cb receives struct wlr_input_device*
|
||||||
|
void on_new_input(std::function<void(void*)> cb) {
|
||||||
|
m_newInput.connect(&m_backend->events.new_input, std::move(cb));
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_backend* m_backend;
|
||||||
|
SignalSink m_newOutput;
|
||||||
|
SignalSink m_newInput;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,57 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/signals.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
#include "wlr/node.hpp"
|
||||||
|
#include "wlr/output.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Renderer {
|
||||||
|
public:
|
||||||
|
Renderer(struct wlr_renderer* r) : m_renderer(r) {}
|
||||||
|
struct wlr_renderer* raw() const { return m_renderer; }
|
||||||
|
explicit operator bool() const { return m_renderer != nullptr; }
|
||||||
|
bool init_wl_display(Display& d) { return wlr_renderer_init_wl_display(m_renderer, d.raw()); }
|
||||||
|
void destroy() { if (m_renderer) { wlr_renderer_destroy(m_renderer); m_renderer = nullptr; } }
|
||||||
|
~Renderer() { destroy(); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_renderer* m_renderer;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Allocator {
|
||||||
|
public:
|
||||||
|
Allocator(struct wlr_allocator* a) : m_allocator(a) {}
|
||||||
|
struct wlr_allocator* raw() const { return m_allocator; }
|
||||||
|
explicit operator bool() const { return m_allocator != nullptr; }
|
||||||
|
void destroy() { if (m_allocator) { wlr_allocator_destroy(m_allocator); m_allocator = nullptr; } }
|
||||||
|
~Allocator() { destroy(); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_allocator* m_allocator;
|
||||||
|
};
|
||||||
|
|
||||||
|
class DataDeviceManager {
|
||||||
|
public:
|
||||||
|
DataDeviceManager(struct wlr_data_device_manager* m) : m_manager(m) {}
|
||||||
|
struct wlr_data_device_manager* raw() const { return m_manager; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_data_device_manager* m_manager;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Compositor {
|
||||||
|
public:
|
||||||
|
Compositor(Display& display, Renderer& renderer)
|
||||||
|
: m_compositor(wlr_compositor_create(display.raw(), 6, renderer.raw())) {}
|
||||||
|
struct wlr_compositor* raw() const { return m_compositor; }
|
||||||
|
explicit operator bool() const { return m_compositor != nullptr; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_compositor* m_compositor;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,37 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <wayland-server-core.h>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Display {
|
||||||
|
public:
|
||||||
|
Display() : m_display(wl_display_create()) {}
|
||||||
|
~Display() { if (m_display) wl_display_destroy(m_display); }
|
||||||
|
|
||||||
|
Display(const Display&) = delete;
|
||||||
|
Display& operator=(const Display&) = delete;
|
||||||
|
Display(Display&&) = delete;
|
||||||
|
Display& operator=(Display&&) = delete;
|
||||||
|
|
||||||
|
struct wl_display* raw() const { return m_display; }
|
||||||
|
explicit operator bool() const { return m_display != nullptr; }
|
||||||
|
struct wl_event_loop* event_loop() const { return wl_display_get_event_loop(m_display); }
|
||||||
|
|
||||||
|
void set_terminate() { wl_display_terminate(m_display); }
|
||||||
|
void run() { wl_display_run(m_display); }
|
||||||
|
bool init_shm() { return wl_display_init_shm(m_display); }
|
||||||
|
const char* add_socket_auto() {
|
||||||
|
const char* name = wl_display_add_socket_auto(m_display);
|
||||||
|
return name;
|
||||||
|
}
|
||||||
|
void flush_clients() { wl_display_flush_clients(m_display); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wl_display* m_display;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,130 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <utility>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Node {
|
||||||
|
public:
|
||||||
|
Node(struct wlr_scene_node* node) : m_node(node) {}
|
||||||
|
struct wlr_scene_node* raw() const { return m_node; }
|
||||||
|
explicit operator bool() const { return m_node != nullptr; }
|
||||||
|
|
||||||
|
void set_position(int x, int y) { wlr_scene_node_set_position(m_node, x, y); }
|
||||||
|
std::pair<int, int> position() const { return {m_node->x, m_node->y}; }
|
||||||
|
|
||||||
|
void set_enabled(bool enabled) { wlr_scene_node_set_enabled(m_node, enabled); }
|
||||||
|
bool enabled() const { return m_node->enabled; }
|
||||||
|
|
||||||
|
void raise_to_top() { wlr_scene_node_raise_to_top(m_node); }
|
||||||
|
void lower_to_bottom() { wlr_scene_node_lower_to_bottom(m_node); }
|
||||||
|
void place_above(Node& sibling) { wlr_scene_node_place_above(m_node, sibling.raw()); }
|
||||||
|
void place_below(Node& sibling) { wlr_scene_node_place_below(m_node, sibling.raw()); }
|
||||||
|
|
||||||
|
enum wlr_scene_node_type type() const { return m_node->type; }
|
||||||
|
struct wlr_scene_tree* parent() const { return m_node->parent; }
|
||||||
|
void*& data() { return m_node->data; }
|
||||||
|
void* data() const { return m_node->data; }
|
||||||
|
|
||||||
|
template <typename T> T as() const;
|
||||||
|
|
||||||
|
protected:
|
||||||
|
struct wlr_scene_node* m_node;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Tree : public Node {
|
||||||
|
public:
|
||||||
|
Tree(struct wlr_scene_tree* tree) : Node(&tree->node), m_tree(tree) {}
|
||||||
|
struct wlr_scene_tree* raw() const { return m_tree; }
|
||||||
|
void reparent(Node& n) { wlr_scene_node_reparent(n.raw(), m_tree); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_tree* m_tree;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Rect : public Node {
|
||||||
|
public:
|
||||||
|
Rect(struct wlr_scene_rect* rect) : Node(&rect->node), m_rect(rect) {}
|
||||||
|
struct wlr_scene_rect* raw() const { return m_rect; }
|
||||||
|
|
||||||
|
void set_size(int w, int h) { wlr_scene_rect_set_size(m_rect, w, h); }
|
||||||
|
void set_color(const Color& c) { c.apply(m_rect->color); }
|
||||||
|
void set_corner_radius(int radius) { wlr_scene_rect_set_corner_radius(m_rect, radius); }
|
||||||
|
void set_corner_radii(const CornerRadii& r) { wlr_scene_rect_set_corner_radii(m_rect, r.raw()); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_rect* m_rect;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Shadow : public Node {
|
||||||
|
public:
|
||||||
|
Shadow(struct wlr_scene_shadow* shadow) : Node(&shadow->node), m_shadow(shadow) {}
|
||||||
|
struct wlr_scene_shadow* raw() const { return m_shadow; }
|
||||||
|
|
||||||
|
void set_size(int w, int h) { wlr_scene_shadow_set_size(m_shadow, w, h); }
|
||||||
|
void set_corner_radius(int radius) { wlr_scene_shadow_set_corner_radius(m_shadow, radius); }
|
||||||
|
void set_blur_sigma(float sigma) { wlr_scene_shadow_set_blur_sigma(m_shadow, sigma); }
|
||||||
|
void set_color(const Color& c) { c.apply(m_shadow->color); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_shadow* m_shadow;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Blur : public Node {
|
||||||
|
public:
|
||||||
|
Blur(struct wlr_scene_blur* blur) : Node(&blur->node), m_blur(blur) {}
|
||||||
|
struct wlr_scene_blur* raw() const { return m_blur; }
|
||||||
|
|
||||||
|
void set_size(int w, int h) { wlr_scene_blur_set_size(m_blur, w, h); }
|
||||||
|
void set_corner_radius(int radius) { wlr_scene_blur_set_corner_radius(m_blur, radius); }
|
||||||
|
void set_corner_radii(const CornerRadii& r) { wlr_scene_blur_set_corner_radii(m_blur, r.raw()); }
|
||||||
|
void set_alpha(float alpha) { wlr_scene_blur_set_alpha(m_blur, alpha); }
|
||||||
|
void set_strength(float strength) { wlr_scene_blur_set_strength(m_blur, strength); }
|
||||||
|
void set_should_only_blur_bottom_layer(bool v) { wlr_scene_blur_set_should_only_blur_bottom_layer(m_blur, v); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_blur* m_blur;
|
||||||
|
};
|
||||||
|
|
||||||
|
class OptimizedBlur : public Node {
|
||||||
|
public:
|
||||||
|
OptimizedBlur(struct wlr_scene_optimized_blur* b) : Node(&b->node), m_blur(b) {}
|
||||||
|
struct wlr_scene_optimized_blur* raw() const { return m_blur; }
|
||||||
|
|
||||||
|
void set_size(int w, int h) { wlr_scene_optimized_blur_set_size(m_blur, w, h); }
|
||||||
|
void mark_dirty() { wlr_scene_optimized_blur_mark_dirty(m_blur); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_optimized_blur* m_blur;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Buffer : public Node {
|
||||||
|
public:
|
||||||
|
Buffer(struct wlr_scene_buffer* buf) : Node(&buf->node), m_buffer(buf) {}
|
||||||
|
struct wlr_scene_buffer* raw() const { return m_buffer; }
|
||||||
|
|
||||||
|
void set_buffer(struct wlr_buffer* b) { wlr_scene_buffer_set_buffer(m_buffer, b); }
|
||||||
|
void set_opacity(float o) { wlr_scene_buffer_set_opacity(m_buffer, o); }
|
||||||
|
float opacity() const { return m_buffer->opacity; }
|
||||||
|
void set_dest_size(int w, int h) { wlr_scene_buffer_set_dest_size(m_buffer, w, h); }
|
||||||
|
void set_corner_radius(int radius) { wlr_scene_buffer_set_corner_radius(m_buffer, radius); }
|
||||||
|
void set_corner_radii(const CornerRadii& r) { wlr_scene_buffer_set_corner_radii(m_buffer, r.raw()); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_buffer* m_buffer;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Surface : public Buffer {
|
||||||
|
public:
|
||||||
|
Surface(struct wlr_scene_surface* s) : Buffer(s ? s->buffer : nullptr), m_surface(s) {}
|
||||||
|
struct wlr_scene_surface* raw() const { return m_surface; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_surface* m_surface;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,79 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <functional>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
#include "wlr/signals.hpp"
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Output {
|
||||||
|
public:
|
||||||
|
Output(struct wlr_output* o) : m_output(o) {}
|
||||||
|
struct wlr_output* raw() const { return m_output; }
|
||||||
|
explicit operator bool() const { return m_output != nullptr; }
|
||||||
|
const char* name() const { return m_output->name; }
|
||||||
|
const char* make() const { return m_output->make; }
|
||||||
|
const char* model() const { return m_output->model; }
|
||||||
|
|
||||||
|
struct wlr_output_mode* preferred_mode() const {
|
||||||
|
return wlr_output_preferred_mode(m_output);
|
||||||
|
}
|
||||||
|
bool set_preferred_mode() {
|
||||||
|
struct wlr_output_mode* mode = wlr_output_preferred_mode(m_output);
|
||||||
|
if (!mode) return false;
|
||||||
|
struct wlr_output_state state;
|
||||||
|
wlr_output_state_init(&state);
|
||||||
|
wlr_output_state_set_mode(&state, mode);
|
||||||
|
bool ok = wlr_output_commit_state(m_output, &state);
|
||||||
|
wlr_output_state_finish(&state);
|
||||||
|
return ok;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_output* m_output;
|
||||||
|
};
|
||||||
|
|
||||||
|
class SceneOutput {
|
||||||
|
public:
|
||||||
|
SceneOutput(struct wlr_scene_output* so) : m_so(so) {}
|
||||||
|
struct wlr_scene_output* raw() const { return m_so; }
|
||||||
|
explicit operator bool() const { return m_so != nullptr; }
|
||||||
|
struct wlr_output* output() const { return m_so->output; }
|
||||||
|
void set_position(int x, int y) { wlr_scene_output_set_position(m_so, x, y); }
|
||||||
|
bool commit() { return wlr_scene_output_commit(m_so, nullptr); }
|
||||||
|
bool needs_frame() { return wlr_scene_output_needs_frame(m_so); }
|
||||||
|
void send_frame_done(struct timespec* when) { wlr_scene_output_send_frame_done(m_so, when); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene_output* m_so;
|
||||||
|
};
|
||||||
|
|
||||||
|
class OutputLayout {
|
||||||
|
public:
|
||||||
|
OutputLayout(Display& display) : m_layout(wlr_output_layout_create(display.raw())) {}
|
||||||
|
~OutputLayout() { if (m_layout) wlr_output_layout_destroy(m_layout); }
|
||||||
|
OutputLayout(const OutputLayout&) = delete;
|
||||||
|
OutputLayout& operator=(const OutputLayout&) = delete;
|
||||||
|
struct wlr_output_layout* raw() const { return m_layout; }
|
||||||
|
explicit operator bool() const { return m_layout != nullptr; }
|
||||||
|
struct wlr_output_layout_output* add_auto_output(struct wlr_output* o) {
|
||||||
|
return wlr_output_layout_add_auto(m_layout, o);
|
||||||
|
}
|
||||||
|
struct wlr_output_layout_output* add_output(struct wlr_output* o, int x, int y) {
|
||||||
|
return wlr_output_layout_add(m_layout, o, x, y);
|
||||||
|
}
|
||||||
|
struct wlr_box box() const {
|
||||||
|
struct wlr_box b;
|
||||||
|
wlr_output_layout_get_box(m_layout, nullptr, &b);
|
||||||
|
return b;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_output_layout* m_layout;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,74 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <pixman.h>
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
std::string version();
|
||||||
|
|
||||||
|
class Scene {
|
||||||
|
public:
|
||||||
|
Scene() : m_scene(wlr_scene_create()) {}
|
||||||
|
~Scene() { if (m_scene) wlr_scene_node_destroy(&m_scene->tree.node); }
|
||||||
|
|
||||||
|
Scene(const Scene&) = delete;
|
||||||
|
Scene& operator=(const Scene&) = delete;
|
||||||
|
Scene(Scene&&) = delete;
|
||||||
|
Scene& operator=(Scene&&) = delete;
|
||||||
|
|
||||||
|
struct wlr_scene* raw() const { return m_scene; }
|
||||||
|
explicit operator bool() const { return m_scene != nullptr; }
|
||||||
|
|
||||||
|
void set_blur_data(int num_passes, int radius, float noise,
|
||||||
|
float brightness, float contrast, float saturation) {
|
||||||
|
wlr_scene_set_blur_data(m_scene, num_passes, radius,
|
||||||
|
noise, brightness, contrast, saturation);
|
||||||
|
}
|
||||||
|
void set_blur_num_passes(int num_passes) { wlr_scene_set_blur_num_passes(m_scene, num_passes); }
|
||||||
|
void set_blur_radius(int radius) { wlr_scene_set_blur_radius(m_scene, radius); }
|
||||||
|
void set_blur_noise(float noise) { wlr_scene_set_blur_noise(m_scene, noise); }
|
||||||
|
void set_blur_brightness(float brightness) { wlr_scene_set_blur_brightness(m_scene, brightness); }
|
||||||
|
void set_blur_contrast(float contrast) { wlr_scene_set_blur_contrast(m_scene, contrast); }
|
||||||
|
void set_blur_saturation(float saturation) { wlr_scene_set_blur_saturation(m_scene, saturation); }
|
||||||
|
struct wlr_scene_tree* root() { return &m_scene->tree; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_scene* m_scene;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct Box {
|
||||||
|
int x = 0, y = 0, width = 0, height = 0;
|
||||||
|
pixman_box32 to_box() const { return {x, y, x + width, y + height}; }
|
||||||
|
static Box from_box(pixman_box32 b) {
|
||||||
|
return {b.x1, b.y1, b.x2 - b.x1, b.y2 - b.y1};
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
struct Color {
|
||||||
|
float r = 1.0f, g = 1.0f, b = 1.0f, a = 1.0f;
|
||||||
|
void apply(float out[4]) const {
|
||||||
|
out[0] = r; out[1] = g; out[2] = b; out[3] = a;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
struct CornerRadii {
|
||||||
|
uint16_t top_left = 0, top_right = 0, bottom_right = 0, bottom_left = 0;
|
||||||
|
|
||||||
|
CornerRadii() = default;
|
||||||
|
CornerRadii(uint16_t all) : top_left(all), top_right(all), bottom_right(all), bottom_left(all) {}
|
||||||
|
CornerRadii(uint16_t tl, uint16_t tr, uint16_t br, uint16_t bl)
|
||||||
|
: top_left(tl), top_right(tr), bottom_right(br), bottom_left(bl) {}
|
||||||
|
|
||||||
|
fx_corner_radii raw() const {
|
||||||
|
return fx_corner_radii{top_left, top_right, bottom_right, bottom_left};
|
||||||
|
}
|
||||||
|
static CornerRadii from_radii(fx_corner_radii r) {
|
||||||
|
return {r.top_left, r.top_right, r.bottom_right, r.bottom_left};
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,99 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <algorithm>
|
||||||
|
#include <cmath>
|
||||||
|
#include <cstdint>
|
||||||
|
#include <functional>
|
||||||
|
|
||||||
|
namespace wlr::fx {
|
||||||
|
|
||||||
|
enum class Easing {
|
||||||
|
Linear,
|
||||||
|
InQuad, OutQuad, InOutQuad,
|
||||||
|
InCubic, OutCubic, InOutCubic,
|
||||||
|
InElastic, OutElastic, InOutElastic,
|
||||||
|
};
|
||||||
|
|
||||||
|
inline float ease(Easing e, float t) {
|
||||||
|
t = std::clamp(t, 0.0f, 1.0f);
|
||||||
|
switch (e) {
|
||||||
|
case Easing::Linear: return t;
|
||||||
|
case Easing::InQuad: return t * t;
|
||||||
|
case Easing::OutQuad: return t * (2.0f - t);
|
||||||
|
case Easing::InCubic: return t * t * t;
|
||||||
|
case Easing::OutCubic: { float u = t - 1.0f; return u * u * u + 1.0f; }
|
||||||
|
case Easing::InOutQuad: return t < 0.5f ? 2.0f * t * t : -1.0f + (4.0f - 2.0f * t) * t;
|
||||||
|
case Easing::InOutCubic: return t < 0.5f ? 4.0f * t * t * t : (t - 1.0f) * (2.0f * t - 2.0f) * (2.0f * t - 2.0f) + 1.0f;
|
||||||
|
case Easing::InElastic: {
|
||||||
|
const float c4 = (2.0f * M_PI) / 3.0f;
|
||||||
|
return t <= 0.0f ? 0.0f : t >= 1.0f ? 1.0f
|
||||||
|
: -std::pow(2.0f, 10.0f * t - 10.0f) * std::sin((t * 10.0f - 10.75f) * c4);
|
||||||
|
}
|
||||||
|
case Easing::OutElastic: {
|
||||||
|
const float c4 = (2.0f * M_PI) / 3.0f;
|
||||||
|
return t <= 0.0f ? 0.0f : t >= 1.0f ? 1.0f
|
||||||
|
: std::pow(2.0f, -10.0f * t) * std::sin((t * 10.0f - 0.75f) * c4) + 1.0f;
|
||||||
|
}
|
||||||
|
case Easing::InOutElastic: {
|
||||||
|
const float c5 = (2.0f * M_PI) / 4.5f;
|
||||||
|
return t <= 0.0f ? 0.0f : t >= 1.0f ? 1.0f
|
||||||
|
: t < 0.5f
|
||||||
|
? -(std::pow(2.0f, 20.0f * t - 10.0f) * std::sin((20.0f * t - 11.125f) * c5)) / 2.0f
|
||||||
|
: (std::pow(2.0f, -20.0f * t + 10.0f) * std::sin((20.0f * t - 11.125f) * c5)) / 2.0f + 1.0f;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return t;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename Clock = std::uint64_t>
|
||||||
|
class Animated {
|
||||||
|
public:
|
||||||
|
Animated() = default;
|
||||||
|
Animated(float value) : m_value(value), m_target(value), m_equal(true) {}
|
||||||
|
|
||||||
|
void set(float value) {
|
||||||
|
if (value == m_target && !m_equal) { jump_to(value); return; }
|
||||||
|
m_target = value;
|
||||||
|
if (m_duration == 0) { jump_to(value); return; }
|
||||||
|
m_startValue = m_value;
|
||||||
|
m_startTime = now();
|
||||||
|
m_elapsed = 0;
|
||||||
|
m_equal = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
void jump_to(float value) {
|
||||||
|
m_value = value; m_target = value; m_equal = true; m_startTime = now();
|
||||||
|
}
|
||||||
|
|
||||||
|
void on_frame(Clock time) {
|
||||||
|
if (m_equal) return;
|
||||||
|
m_elapsed = time - m_startTime;
|
||||||
|
if (m_elapsed >= m_duration) { m_value = m_target; m_equal = true; return; }
|
||||||
|
const float t = ease(m_easing, static_cast<float>(m_elapsed) / static_cast<float>(m_duration));
|
||||||
|
m_value = m_startValue + (m_target - m_startValue) * t;
|
||||||
|
}
|
||||||
|
|
||||||
|
void set_duration(Clock d) { m_duration = d > 0 ? d : 1; }
|
||||||
|
void set_easing(Easing e) { m_easing = e; }
|
||||||
|
void set_clock_source(std::function<Clock()> src) { m_clock = std::move(src); }
|
||||||
|
|
||||||
|
float value() const { return m_value; }
|
||||||
|
float target() const { return m_target; }
|
||||||
|
bool animating() const { return !m_equal; }
|
||||||
|
Clock remaining() const { return m_equal ? 0 : m_duration - m_elapsed; }
|
||||||
|
|
||||||
|
private:
|
||||||
|
Clock now() { return m_clock ? m_clock() : Clock(0); }
|
||||||
|
float m_value = 0.0f;
|
||||||
|
float m_startValue = 0.0f;
|
||||||
|
float m_target = 0.0f;
|
||||||
|
Clock m_duration = 1;
|
||||||
|
Clock m_startTime = 0;
|
||||||
|
Clock m_elapsed = 0;
|
||||||
|
bool m_equal = true;
|
||||||
|
Easing m_easing = Easing::OutCubic;
|
||||||
|
std::function<Clock()> m_clock;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,52 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <type_traits>
|
||||||
|
|
||||||
|
#include "wlr/scenefx/anim.hpp"
|
||||||
|
#include "wlr/scene.hpp"
|
||||||
|
#include "wlr/node.hpp"
|
||||||
|
|
||||||
|
namespace wlr::fx {
|
||||||
|
|
||||||
|
class Effect {
|
||||||
|
public:
|
||||||
|
Animated<>& position_x() { return m_x; }
|
||||||
|
Animated<>& position_y() { return m_y; }
|
||||||
|
Animated<>& scale() { return m_scale; }
|
||||||
|
Animated<>& opacity() { return m_opacity; }
|
||||||
|
|
||||||
|
void on_frame(std::uint64_t time) {
|
||||||
|
m_x.on_frame(time);
|
||||||
|
m_y.on_frame(time);
|
||||||
|
m_scale.on_frame(time);
|
||||||
|
m_opacity.on_frame(time);
|
||||||
|
}
|
||||||
|
|
||||||
|
void apply_to(Node& node) {
|
||||||
|
node.set_position((int)m_x.value(), (int)m_y.value());
|
||||||
|
if (node.type() != WLR_SCENE_NODE_BUFFER)
|
||||||
|
return;
|
||||||
|
Buffer b = node.as<Buffer>();
|
||||||
|
b.set_opacity(m_opacity.value());
|
||||||
|
const float s = m_scale.value();
|
||||||
|
const int dw = b.raw()->dst_width;
|
||||||
|
const int dh = b.raw()->dst_height;
|
||||||
|
if (s != 1.0f && dw > 0 && dh > 0)
|
||||||
|
b.set_dest_size((int)(s * dw), (int)(s * dh));
|
||||||
|
}
|
||||||
|
|
||||||
|
bool animating() const {
|
||||||
|
return m_x.animating() || m_y.animating() ||
|
||||||
|
m_scale.animating() || m_opacity.animating();
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
Animated<> m_x;
|
||||||
|
Animated<> m_y;
|
||||||
|
Animated<> m_scale{1.0f};
|
||||||
|
Animated<> m_opacity{1.0f};
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,90 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <functional>
|
||||||
|
#include <xkbcommon/xkbcommon.h>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/signals.hpp"
|
||||||
|
#include "wlr/output.hpp"
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class Cursor {
|
||||||
|
public:
|
||||||
|
Cursor() : m_cursor(wlr_cursor_create()) {}
|
||||||
|
~Cursor() { if (m_cursor) wlr_cursor_destroy(m_cursor); }
|
||||||
|
Cursor(const Cursor&) = delete;
|
||||||
|
Cursor& operator=(const Cursor&) = delete;
|
||||||
|
struct wlr_cursor* raw() const { return m_cursor; }
|
||||||
|
explicit operator bool() const { return m_cursor != nullptr; }
|
||||||
|
|
||||||
|
void attach_output_layout(struct wlr_output_layout* layout) {
|
||||||
|
wlr_cursor_attach_output_layout(m_cursor, layout);
|
||||||
|
}
|
||||||
|
void attach_input_device(struct wlr_input_device* dev) {
|
||||||
|
wlr_cursor_attach_input_device(m_cursor, dev);
|
||||||
|
}
|
||||||
|
void warp(double x, double y) { wlr_cursor_warp(m_cursor, nullptr, x, y); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_cursor* m_cursor;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Keyboard {
|
||||||
|
public:
|
||||||
|
Keyboard(struct wlr_keyboard* kb) : m_keyboard(kb) {}
|
||||||
|
struct wlr_keyboard* raw() const { return m_keyboard; }
|
||||||
|
explicit operator bool() const { return m_keyboard != nullptr; }
|
||||||
|
|
||||||
|
void set_keymap(struct xkb_keymap* keymap) { wlr_keyboard_set_keymap(m_keyboard, keymap); }
|
||||||
|
void set_default_keymap() {
|
||||||
|
struct xkb_context* ctx = xkb_context_new(XKB_CONTEXT_NO_FLAGS);
|
||||||
|
if (!ctx) return;
|
||||||
|
struct xkb_keymap* km = xkb_keymap_new_from_names(ctx, nullptr, XKB_KEYMAP_COMPILE_NO_FLAGS);
|
||||||
|
xkb_context_unref(ctx);
|
||||||
|
if (km) {
|
||||||
|
wlr_keyboard_set_keymap(m_keyboard, km);
|
||||||
|
xkb_keymap_unref(km);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void on_key(std::function<void(void*)> cb) { m_keys.connect(&m_keyboard->events.key, std::move(cb)); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_keyboard* m_keyboard;
|
||||||
|
SignalSink m_keys;
|
||||||
|
};
|
||||||
|
|
||||||
|
class Seat {
|
||||||
|
public:
|
||||||
|
Seat(Display& display, const char* name)
|
||||||
|
: m_seat(wlr_seat_create(display.raw(), name)) {}
|
||||||
|
~Seat() { if (m_seat) wlr_seat_destroy(m_seat); }
|
||||||
|
Seat(const Seat&) = delete;
|
||||||
|
Seat& operator=(const Seat&) = delete;
|
||||||
|
|
||||||
|
struct wlr_seat* raw() const { return m_seat; }
|
||||||
|
explicit operator bool() const { return m_seat != nullptr; }
|
||||||
|
|
||||||
|
void set_capabilities(uint32_t caps) { wlr_seat_set_capabilities(m_seat, caps); }
|
||||||
|
void set_keyboard(Keyboard& kb) { wlr_seat_set_keyboard(m_seat, kb.raw()); }
|
||||||
|
void keyboard_notify_key(uint32_t time, uint32_t keycode, enum wl_keyboard_key_state state) {
|
||||||
|
wlr_seat_keyboard_notify_key(m_seat, time, keycode, state);
|
||||||
|
}
|
||||||
|
void pointer_notify_motion(uint32_t time, double sx, double sy) {
|
||||||
|
wlr_seat_pointer_notify_motion(m_seat, time, sx, sy);
|
||||||
|
}
|
||||||
|
uint32_t pointer_notify_button(uint32_t time, uint32_t button, enum wl_pointer_button_state state) {
|
||||||
|
return wlr_seat_pointer_notify_button(m_seat, time, button, state);
|
||||||
|
}
|
||||||
|
void pointer_notify_axis(uint32_t time, enum wl_pointer_axis axis, double value, int value_discrete, enum wl_pointer_axis_source source) {
|
||||||
|
wlr_seat_pointer_notify_axis(m_seat, time, axis, value, value_discrete, source,
|
||||||
|
WL_POINTER_AXIS_RELATIVE_DIRECTION_IDENTICAL);
|
||||||
|
}
|
||||||
|
void pointer_notify_frame() { wlr_seat_pointer_notify_frame(m_seat); }
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_seat* m_seat;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,56 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <functional>
|
||||||
|
#include <utility>
|
||||||
|
|
||||||
|
#include <wayland-server-core.h>
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class SignalSink {
|
||||||
|
public:
|
||||||
|
SignalSink() = default;
|
||||||
|
SignalSink(const SignalSink&) = delete;
|
||||||
|
SignalSink& operator=(const SignalSink&) = delete;
|
||||||
|
|
||||||
|
void connect(struct wl_signal* sig, std::function<void(void*)> fn) {
|
||||||
|
if (m_listener && m_listener->attached)
|
||||||
|
return;
|
||||||
|
if (!m_listener)
|
||||||
|
m_listener = new Listener;
|
||||||
|
m_listener->attached = true;
|
||||||
|
m_listener->fn = std::move(fn);
|
||||||
|
m_listener->listener.notify = &SignalSink::trampoline;
|
||||||
|
wl_signal_add(sig, &m_listener->listener);
|
||||||
|
}
|
||||||
|
|
||||||
|
void disconnect() {
|
||||||
|
if (m_listener && m_listener->attached) {
|
||||||
|
wl_list_remove(&m_listener->listener.link);
|
||||||
|
m_listener->attached = false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
~SignalSink() {
|
||||||
|
disconnect();
|
||||||
|
delete m_listener;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct Listener {
|
||||||
|
struct wl_listener listener{};
|
||||||
|
std::function<void(void*)> fn;
|
||||||
|
bool attached = false;
|
||||||
|
};
|
||||||
|
|
||||||
|
static void trampoline(struct wl_listener* l, void* data) {
|
||||||
|
auto* self = wl_container_of(l, static_cast<Listener*>(nullptr), listener);
|
||||||
|
if (self->fn)
|
||||||
|
self->fn(data);
|
||||||
|
}
|
||||||
|
|
||||||
|
Listener* m_listener = nullptr;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,29 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <cmath>
|
||||||
|
#include <cstdlib>
|
||||||
|
#include <functional>
|
||||||
|
#include <iterator>
|
||||||
|
#include <limits>
|
||||||
|
#include <string>
|
||||||
|
#include <utility>
|
||||||
|
|
||||||
|
#define static
|
||||||
|
extern "C" {
|
||||||
|
#include <scenefx/types/wlr_scene.h>
|
||||||
|
#include <wlr/types/wlr_compositor.h>
|
||||||
|
#include <wlr/types/wlr_output.h>
|
||||||
|
#include <wlr/types/wlr_output_layout.h>
|
||||||
|
#include <wlr/types/wlr_seat.h>
|
||||||
|
#include <wlr/types/wlr_keyboard.h>
|
||||||
|
#include <wlr/types/wlr_pointer.h>
|
||||||
|
#include <wlr/types/wlr_cursor.h>
|
||||||
|
#include <wlr/types/wlr_xdg_shell.h>
|
||||||
|
#include <wlr/types/wlr_data_device.h>
|
||||||
|
#include <wlr/backend.h>
|
||||||
|
#include <wlr/render/wlr_renderer.h>
|
||||||
|
#include <wlr/render/allocator.h>
|
||||||
|
#include <wlr/version.h>
|
||||||
|
}
|
||||||
|
#undef static
|
||||||
@@ -0,0 +1,124 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
#include "wlr/wlr.hpp"
|
||||||
|
#include "wlr/display.hpp"
|
||||||
|
#include "wlr/signals.hpp"
|
||||||
|
#include "wlr/node.hpp"
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
class XdgSurface;
|
||||||
|
|
||||||
|
class Toplevel {
|
||||||
|
public:
|
||||||
|
Toplevel(struct wlr_xdg_toplevel* t) : m_toplevel(t) {}
|
||||||
|
struct wlr_xdg_toplevel* raw() const { return m_toplevel; }
|
||||||
|
explicit operator bool() const { return m_toplevel != nullptr; }
|
||||||
|
|
||||||
|
XdgSurface base() const;
|
||||||
|
struct wlr_surface* surface() const;
|
||||||
|
|
||||||
|
std::string title() const { return m_toplevel->title ? m_toplevel->title : ""; }
|
||||||
|
std::string app_id() const { return m_toplevel->app_id ? m_toplevel->app_id : ""; }
|
||||||
|
int width() const { return m_toplevel->current.width; }
|
||||||
|
int height() const { return m_toplevel->current.height; }
|
||||||
|
bool maximized() const { return m_toplevel->current.maximized; }
|
||||||
|
bool activated() const { return m_toplevel->current.activated; }
|
||||||
|
struct wlr_xdg_toplevel* parent() const { return m_toplevel->parent; }
|
||||||
|
|
||||||
|
uint32_t set_size(int w, int h) { return wlr_xdg_toplevel_set_size(m_toplevel, w, h); }
|
||||||
|
uint32_t set_activated(bool activated) { return wlr_xdg_toplevel_set_activated(m_toplevel, activated); }
|
||||||
|
uint32_t set_maximized(bool maximized) { return wlr_xdg_toplevel_set_maximized(m_toplevel, maximized); }
|
||||||
|
|
||||||
|
void on_request_move(std::function<void(void*)> cb) {
|
||||||
|
m_requestMove.connect(&m_toplevel->events.request_move, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_request_resize(std::function<void(void*)> cb) {
|
||||||
|
m_requestResize.connect(&m_toplevel->events.request_resize, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_request_maximize(std::function<void(void*)> cb) {
|
||||||
|
m_requestMaximize.connect(&m_toplevel->events.request_maximize, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_request_minimize(std::function<void(void*)> cb) {
|
||||||
|
m_requestMinimize.connect(&m_toplevel->events.request_minimize, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_request_fullscreen(std::function<void(void*)> cb) {
|
||||||
|
m_requestFullscreen.connect(&m_toplevel->events.request_fullscreen, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_set_title(std::function<void(void*)> cb) {
|
||||||
|
m_setTitle.connect(&m_toplevel->events.set_title, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_set_app_id(std::function<void(void*)> cb) {
|
||||||
|
m_setAppId.connect(&m_toplevel->events.set_app_id, std::move(cb));
|
||||||
|
}
|
||||||
|
|
||||||
|
public:
|
||||||
|
struct wlr_xdg_toplevel* m_toplevel;
|
||||||
|
SignalSink m_requestMove;
|
||||||
|
SignalSink m_requestResize;
|
||||||
|
SignalSink m_requestMaximize;
|
||||||
|
SignalSink m_requestMinimize;
|
||||||
|
SignalSink m_requestFullscreen;
|
||||||
|
SignalSink m_setTitle;
|
||||||
|
SignalSink m_setAppId;
|
||||||
|
};
|
||||||
|
|
||||||
|
class XdgSurface {
|
||||||
|
public:
|
||||||
|
XdgSurface(struct wlr_xdg_surface* s) : m_surface(s) {}
|
||||||
|
struct wlr_xdg_surface* raw() const { return m_surface; }
|
||||||
|
explicit operator bool() const { return m_surface != nullptr; }
|
||||||
|
bool toplevel_role() const { return m_surface->role == WLR_XDG_SURFACE_ROLE_TOPLEVEL && m_surface->toplevel; }
|
||||||
|
bool popup_role() const { return m_surface->role == WLR_XDG_SURFACE_ROLE_POPUP && m_surface->popup; }
|
||||||
|
struct wlr_surface* surface() const { return m_surface->surface; }
|
||||||
|
uint32_t geometry_width() const { return m_surface->geometry.width; }
|
||||||
|
uint32_t geometry_height() const { return m_surface->geometry.height; }
|
||||||
|
Toplevel toplevel() const { return Toplevel{m_surface->toplevel}; }
|
||||||
|
struct wlr_box geometry() const {
|
||||||
|
return m_surface->geometry;
|
||||||
|
}
|
||||||
|
|
||||||
|
void on_map(std::function<void(void*)> cb) {
|
||||||
|
m_map.connect(&m_surface->surface->events.map, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_unmap(std::function<void(void*)> cb) {
|
||||||
|
m_unmap.connect(&m_surface->surface->events.unmap, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_destroy(std::function<void(void*)> cb) {
|
||||||
|
m_destroy.connect(&m_surface->events.destroy, std::move(cb));
|
||||||
|
}
|
||||||
|
|
||||||
|
public:
|
||||||
|
struct wlr_xdg_surface* m_surface;
|
||||||
|
SignalSink m_map;
|
||||||
|
SignalSink m_unmap;
|
||||||
|
SignalSink m_destroy;
|
||||||
|
};
|
||||||
|
|
||||||
|
inline XdgSurface Toplevel::base() const { return XdgSurface{m_toplevel->base}; }
|
||||||
|
inline struct wlr_surface* Toplevel::surface() const { return m_toplevel->base->surface; }
|
||||||
|
|
||||||
|
class XdgShell {
|
||||||
|
public:
|
||||||
|
explicit XdgShell(Display& display, uint32_t version = 5)
|
||||||
|
: m_shell(wlr_xdg_shell_create(display.raw(), version)) {}
|
||||||
|
struct wlr_xdg_shell* raw() const { return m_shell; }
|
||||||
|
explicit operator bool() const { return m_shell != nullptr; }
|
||||||
|
|
||||||
|
void on_new_toplevel(std::function<void(void*)> cb) {
|
||||||
|
m_newToplevel.connect(&m_shell->events.new_toplevel, std::move(cb));
|
||||||
|
}
|
||||||
|
void on_new_surface(std::function<void(void*)> cb) {
|
||||||
|
m_newSurface.connect(&m_shell->events.new_surface, std::move(cb));
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
struct wlr_xdg_shell* m_shell;
|
||||||
|
SignalSink m_newToplevel;
|
||||||
|
SignalSink m_newSurface;
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
@@ -0,0 +1,26 @@
|
|||||||
|
// SPDX-License-Identifier: AGPL-3.0-only
|
||||||
|
#include "wlr/node.hpp"
|
||||||
|
#include <string>
|
||||||
|
#include <wlr/version.h>
|
||||||
|
|
||||||
|
namespace wlr {
|
||||||
|
|
||||||
|
std::string version() {
|
||||||
|
return std::to_string(wlr_version_get_major()) + "." +
|
||||||
|
std::to_string(wlr_version_get_minor()) + "." +
|
||||||
|
std::to_string(wlr_version_get_micro());
|
||||||
|
}
|
||||||
|
|
||||||
|
template <> Tree Node::as<Tree>() const { return Tree{wlr_scene_tree_from_node(m_node)}; }
|
||||||
|
template <> Rect Node::as<Rect>() const { return Rect{wlr_scene_rect_from_node(m_node)}; }
|
||||||
|
template <> Shadow Node::as<Shadow>() const { return Shadow{wlr_scene_shadow_from_node(m_node)}; }
|
||||||
|
template <> Blur Node::as<Blur>() const { return Blur{wlr_scene_blur_from_node(m_node)}; }
|
||||||
|
template <> OptimizedBlur Node::as<OptimizedBlur>() const {
|
||||||
|
return OptimizedBlur{wlr_scene_optimized_blur_from_node(m_node)};
|
||||||
|
}
|
||||||
|
template <> Buffer Node::as<Buffer>() const { return Buffer{wlr_scene_buffer_from_node(m_node)}; }
|
||||||
|
template <> Surface Node::as<Surface>() const {
|
||||||
|
return Surface{wlr_scene_surface_try_from_buffer(wlr_scene_buffer_from_node(m_node))};
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
Reference in New Issue
Block a user