forked from zenolith/zenolith-sdl2
init
This commit is contained in:
commit
1cd4a5479e
13 changed files with 1739 additions and 0 deletions
1
.gitignore
vendored
Normal file
1
.gitignore
vendored
Normal file
|
@ -0,0 +1 @@
|
|||
/zig-*
|
661
LICENSE
Normal file
661
LICENSE
Normal file
|
@ -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/>.
|
14
README.md
Normal file
14
README.md
Normal file
|
@ -0,0 +1,14 @@
|
|||
# Zenolith-SDL2
|
||||
|
||||
An experimental SDL2 backend for [Zenolith](https://git.mzte.de/zenolith/zenolith).
|
||||
This backend mostly exists as an early prototype for early development.
|
||||
|
||||
## TODO
|
||||
|
||||
- [x] Implementation of the painter API
|
||||
- [x] Font rendering (FreeType-Based)
|
||||
- [ ] Word Wrap
|
||||
- [ ] Character Wrap
|
||||
- [ ] Font discovery
|
||||
- [ ] Multi-Window
|
||||
- [ ] Window property API
|
63
build.zig
Normal file
63
build.zig
Normal file
|
@ -0,0 +1,63 @@
|
|||
const std = @import("std");
|
||||
|
||||
pub fn build(b: *std.Build) void {
|
||||
const target = b.standardTargetOptions(.{});
|
||||
const optimize = b.standardOptimizeOption(.{});
|
||||
|
||||
//const zenolith_mod = b.addModule("zenolith", .{
|
||||
// .source_file = .{ .path = "../zenolith/src/main.zig" },
|
||||
// .dependencies = &.{.{
|
||||
// .name = "statspatch",
|
||||
// .module = b.dependency("statspatch", .{
|
||||
// .target = target,
|
||||
// .optimize = optimize,
|
||||
// }).module("statspatch"),
|
||||
// }},
|
||||
//});
|
||||
|
||||
const zenolith_mod = b.dependency("zenolith", .{
|
||||
.target = target,
|
||||
.optimize = optimize,
|
||||
}).module("zenolith");
|
||||
|
||||
const mod = b.addModule("zenolith-sdl2", .{
|
||||
.source_file = .{ .path = "src/main.zig" },
|
||||
.dependencies = &.{.{ .name = "zenolith", .module = zenolith_mod }},
|
||||
});
|
||||
|
||||
const main_tests = b.addTest(.{
|
||||
.root_source_file = .{ .path = "src/main.zig" },
|
||||
.target = target,
|
||||
.optimize = optimize,
|
||||
});
|
||||
main_tests.addModule("zenolith", zenolith_mod);
|
||||
addPlatformDeps(main_tests);
|
||||
|
||||
const run_main_tests = b.addRunArtifact(main_tests);
|
||||
|
||||
const test_step = b.step("test", "Run library tests");
|
||||
test_step.dependOn(&run_main_tests.step);
|
||||
|
||||
const example_exe = b.addExecutable(.{
|
||||
.name = "zenolith-sdl2-example",
|
||||
.root_source_file = .{ .path = "example/main.zig" },
|
||||
.target = target,
|
||||
.optimize = optimize,
|
||||
});
|
||||
example_exe.addModule("zenolith", zenolith_mod);
|
||||
example_exe.addModule("zenolith-sdl2", mod);
|
||||
addPlatformDeps(example_exe);
|
||||
|
||||
b.installArtifact(example_exe);
|
||||
|
||||
const run_example = b.addRunArtifact(example_exe);
|
||||
|
||||
const run_example_step = b.step("run-example", "Runs the example");
|
||||
run_example_step.dependOn(&run_example.step);
|
||||
}
|
||||
|
||||
fn addPlatformDeps(artifact: *std.Build.Step.Compile) void {
|
||||
artifact.linkLibC();
|
||||
artifact.linkSystemLibrary("SDL2");
|
||||
artifact.linkSystemLibrary("freetype2");
|
||||
}
|
20
build.zig.zon
Normal file
20
build.zig.zon
Normal file
|
@ -0,0 +1,20 @@
|
|||
.{
|
||||
.name = "zenolith-sdl2",
|
||||
// The version number here currently serves little purpose and is also not retrievable from
|
||||
// the build script. For this reason, it's set to 0.0.0 here and the actual version
|
||||
// number is declared in build.zig.
|
||||
.version = "0.0.0",
|
||||
|
||||
.paths = .{""},
|
||||
|
||||
.dependencies = .{
|
||||
//.statspatch = .{
|
||||
// .url = "https://git.mzte.de/LordMZTE/statspatch/archive/231e3ce529efa9a084fb095ff570dfd985ca9a7d.tar.gz",
|
||||
// .hash = "1220685f1c039a53076ef169ef2e2959aeb054c86d4eda5aac736885daa0bf2f6910",
|
||||
//},
|
||||
.zenolith = .{
|
||||
.url = "https://git.mzte.de/zenolith/zenolith/archive/4705b425154b40a1718d2102ab6ad4eecf5135d9.tar.gz",
|
||||
.hash = "122039dbae23348c8d9320af685c4d43420b8f362d53898a1d57f7ec0ced04ab8711",
|
||||
},
|
||||
},
|
||||
}
|
82
example/main.zig
Normal file
82
example/main.zig
Normal file
|
@ -0,0 +1,82 @@
|
|||
const std = @import("std");
|
||||
const zenolith = @import("zenolith");
|
||||
const zsdl2 = @import("zenolith-sdl2");
|
||||
|
||||
pub const zenolith_options = struct {
|
||||
pub const platform_impls = [_]type{zsdl2.Sdl2Platform};
|
||||
pub const painter_impls = [_]type{zsdl2.Sdl2Painter};
|
||||
};
|
||||
|
||||
pub fn main() !void {
|
||||
const alloc = std.heap.c_allocator;
|
||||
|
||||
var platform = try zsdl2.Sdl2Platform.init(.{
|
||||
.alloc = alloc,
|
||||
});
|
||||
defer platform.deinit();
|
||||
|
||||
var font = zenolith.font.Font.create(try platform.createFont(.{
|
||||
.source = .{ .path = "/usr/share/fonts/noto/NotoSans-Regular.ttf" },
|
||||
}), {});
|
||||
defer font.deinit();
|
||||
var zplatform = zenolith.platform.Platform.create(platform, {});
|
||||
|
||||
const root = try zenolith.widget.Box.init(alloc, .vertical);
|
||||
defer root.deinit();
|
||||
|
||||
{
|
||||
var attrs = zenolith.attreebute.AttreebuteMap.init();
|
||||
errdefer attrs.deinit(alloc);
|
||||
|
||||
(try attrs.mod(alloc, zenolith.attreebute.CurrentFont)).* = .{ .font = &font };
|
||||
(try attrs.mod(alloc, zenolith.attreebute.ButtonStyle)).* = .{
|
||||
.background = .{
|
||||
.stroked = .{
|
||||
.stroke = zenolith.Color.fromInt(0xeba0acff),
|
||||
.fill = zenolith.Color.fromInt(0x1e1e2eff),
|
||||
.width = 4,
|
||||
},
|
||||
},
|
||||
.background_hovered = .{
|
||||
.stroked = .{
|
||||
.stroke = zenolith.Color.fromInt(0xeba0acff),
|
||||
.fill = zenolith.Color.fromInt(0x313244ff),
|
||||
.width = 3,
|
||||
},
|
||||
},
|
||||
.padding = 10,
|
||||
.font_size = 32,
|
||||
.text_color = zenolith.Color.fromInt(0xcdd6f4ff),
|
||||
};
|
||||
|
||||
root.data.attreebutes = attrs;
|
||||
}
|
||||
|
||||
root.downcast(zenolith.widget.Box).?.orth_expand = true;
|
||||
try root.downcast(zenolith.widget.Box).?.addChildPositioned(root, null, try zenolith.widget.Label.init(.{
|
||||
.alloc = alloc,
|
||||
.font = &font,
|
||||
.text = "Hello, Zenolith!",
|
||||
.size = 64,
|
||||
}), .center);
|
||||
|
||||
try root.addChild(null, try zenolith.widget.Label.init(.{
|
||||
.alloc = alloc,
|
||||
.font = &font,
|
||||
.text = "Labels!",
|
||||
.size = 32,
|
||||
}));
|
||||
|
||||
try root.addChild(null, try zenolith.widget.Button.init(alloc, "Click Me!"));
|
||||
|
||||
try root.treevent(zenolith.treevent.Link{
|
||||
.parent = null,
|
||||
.platform = &zplatform,
|
||||
});
|
||||
|
||||
while (try platform.run(root)) |ev| {
|
||||
if (ev.downcast(zenolith.backevent.ButtonActivated)) |btn| {
|
||||
std.debug.print("Button @ {*} clicked!\n", .{btn.btn_widget});
|
||||
}
|
||||
}
|
||||
}
|
276
src/Sdl2Font.zig
Normal file
276
src/Sdl2Font.zig
Normal file
|
@ -0,0 +1,276 @@
|
|||
//! A font backed by a texture atlas (SDL2 Texture) using a custom lazy bin-packing algorithm
|
||||
//! and freetype. Create this using Sdl2Platform.createFont.
|
||||
const std = @import("std");
|
||||
const zenolith = @import("zenolith");
|
||||
|
||||
const util = @import("util.zig");
|
||||
const ffi = @import("ffi.zig");
|
||||
const c = ffi.c;
|
||||
|
||||
face: c.FT_Face,
|
||||
atlas: *c.SDL_Texture,
|
||||
renderer: *c.SDL_Renderer,
|
||||
|
||||
/// This is an ArrayHashMap to speed up iteration which is requried for collision checking.
|
||||
glyphs: std.AutoArrayHashMap(GlyphProperties, Glyph),
|
||||
|
||||
/// A buffer for creating glyph pixel data in for SDL2 textures.
|
||||
pixel_buf: std.ArrayList(u8),
|
||||
|
||||
const Sdl2Font = @This();
|
||||
|
||||
pub const Chunk = struct {
|
||||
font: *Sdl2Font,
|
||||
glyphs: std.ArrayList(PositionedGlyph),
|
||||
// Saving the size here to improve performance by not recalculating this.
|
||||
// This is an immutable data structure.
|
||||
size: zenolith.layout.Size,
|
||||
|
||||
pub fn deinit(self: Chunk) void {
|
||||
self.glyphs.deinit();
|
||||
}
|
||||
|
||||
pub fn getSize(self: Chunk) zenolith.layout.Size {
|
||||
return self.size;
|
||||
}
|
||||
};
|
||||
|
||||
const PositionedGlyph = struct {
|
||||
glyph: Glyph,
|
||||
pos: zenolith.layout.Position,
|
||||
};
|
||||
|
||||
pub const Glyph = struct {
|
||||
/// Rectangle in atlas-local coordinates of this glyph.
|
||||
sprite: zenolith.layout.Rectangle,
|
||||
|
||||
/// Offset the glyph is rendered at.
|
||||
bearing: [2]i32,
|
||||
advance: usize,
|
||||
};
|
||||
|
||||
pub const GlyphProperties = struct {
|
||||
codepoint: u21,
|
||||
size: u32,
|
||||
};
|
||||
|
||||
pub fn deinit(self_: Sdl2Font) void {
|
||||
var self = self_;
|
||||
c.SDL_DestroyTexture(self.atlas);
|
||||
_ = c.FT_Done_Face(self.face);
|
||||
self.glyphs.deinit();
|
||||
self.pixel_buf.deinit();
|
||||
}
|
||||
|
||||
pub fn getGlyph(self: *Sdl2Font, props: GlyphProperties) !Glyph {
|
||||
if (self.glyphs.get(props)) |g| return g;
|
||||
|
||||
try ffi.handleFTError(c.FT_Set_Pixel_Sizes(self.face, 0, props.size));
|
||||
try ffi.handleFTError(c.FT_Load_Char(self.face, props.codepoint, c.FT_LOAD_RENDER));
|
||||
|
||||
const bmp = self.face.*.glyph.*.bitmap;
|
||||
|
||||
const rect: zenolith.layout.Rectangle = if (bmp.rows * bmp.width == 0) .{
|
||||
.pos = .{ .x = 0, .y = 0 },
|
||||
.size = .{ .width = 0, .height = 0 },
|
||||
} else try self.addAtlastSprite(bmp.buffer[0 .. bmp.rows * bmp.width], bmp.width);
|
||||
|
||||
const glyph = Glyph{
|
||||
.sprite = rect,
|
||||
.bearing = .{
|
||||
self.face.*.glyph.*.bitmap_left,
|
||||
self.face.*.glyph.*.bitmap_top,
|
||||
},
|
||||
// I see no point in supporting negative glyph advance.
|
||||
.advance = @intCast(@max(0, self.face.*.glyph.*.advance.x) >> 6),
|
||||
};
|
||||
|
||||
try self.glyphs.put(props, glyph);
|
||||
return glyph;
|
||||
}
|
||||
|
||||
fn getSize(self: *Sdl2Font) zenolith.layout.Size {
|
||||
var w: c_int = 0;
|
||||
var h: c_int = 0;
|
||||
|
||||
// This will only error if I messed up somewhere.
|
||||
if (c.SDL_QueryTexture(self.atlas, null, null, &w, &h) != 0) unreachable;
|
||||
|
||||
return .{ .width = @intCast(w), .height = @intCast(h) };
|
||||
}
|
||||
|
||||
pub fn addAtlastSprite(self: *Sdl2Font, data: []const u8, width: usize) !zenolith.layout.Rectangle {
|
||||
std.debug.assert(data.len % width == 0);
|
||||
|
||||
// Amount of pixels to leave empty between glyphs to avoid scaling artifacts.
|
||||
const padding = 2;
|
||||
|
||||
const size = self.getSize();
|
||||
|
||||
var collision = zenolith.layout.Rectangle{
|
||||
// start in bottom right
|
||||
.pos = .{
|
||||
.x = size.width - width,
|
||||
.y = size.height,
|
||||
},
|
||||
|
||||
// size of glyph + padding
|
||||
.size = .{
|
||||
.width = width + padding,
|
||||
.height = @divExact(data.len, width) + padding,
|
||||
},
|
||||
};
|
||||
|
||||
// This is the state of the state machine. We continually keep moving up/left
|
||||
// until we hit a wall that prevents us from moving.
|
||||
//
|
||||
// This is probably not the fastest bin packing algorithm, but it doesn't require knowing
|
||||
// all glyphs before adding them.
|
||||
var state: enum { up, left } = .up;
|
||||
while (true) switch (state) {
|
||||
.up => {
|
||||
if (self.isTouchingAnyOnTop(collision)) {
|
||||
state = .left;
|
||||
} else {
|
||||
collision.pos.y -= 1;
|
||||
}
|
||||
},
|
||||
.left => {
|
||||
if (!self.isTouchingAnyOnTop(collision)) {
|
||||
state = .up;
|
||||
} else if (!self.isTouchingAnyOnLeft(collision)) {
|
||||
collision.pos.x -= 1;
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
},
|
||||
};
|
||||
|
||||
if (collision.pos.y + collision.size.height - padding > size.height)
|
||||
return error.AtlastTooSmall;
|
||||
|
||||
try self.pixel_buf.resize(data.len * 4);
|
||||
|
||||
for (data, 0..) |pix, i| {
|
||||
@memset(self.pixel_buf.items[i * 4 .. i * 4 + 4], pix);
|
||||
}
|
||||
|
||||
const rect = .{
|
||||
.pos = collision.pos,
|
||||
.size = .{
|
||||
.width = width,
|
||||
.height = @divExact(data.len, width),
|
||||
},
|
||||
};
|
||||
|
||||
const rec = util.toSdlRect(rect);
|
||||
if (c.SDL_UpdateTexture(
|
||||
self.atlas,
|
||||
&rec,
|
||||
self.pixel_buf.items.ptr,
|
||||
@intCast(width * 4),
|
||||
) != 0) return error.UpdateTexture;
|
||||
|
||||
return rect;
|
||||
}
|
||||
|
||||
pub fn layout(
|
||||
self: *Sdl2Font,
|
||||
text: []const u8,
|
||||
size: usize,
|
||||
wrap: zenolith.font.TextWrap,
|
||||
) !zenolith.font.Chunk {
|
||||
_ = wrap;
|
||||
var glyphs = std.ArrayList(PositionedGlyph).init(self.pixel_buf.allocator);
|
||||
errdefer glyphs.deinit();
|
||||
|
||||
var cur_pos = zenolith.layout.Position{
|
||||
// We start in the middle of the possible range to leave as much space in all directions
|
||||
// as possible. This is all aligned to 0/0 in the last layout step.
|
||||
.x = std.math.maxInt(usize) / 2,
|
||||
.y = std.math.maxInt(usize) / 2,
|
||||
};
|
||||
|
||||
// This is the position of the top-left-most glyph. This is later subtracted from all positions.
|
||||
var min_pos = zenolith.layout.Position{
|
||||
.x = std.math.maxInt(usize),
|
||||
.y = std.math.maxInt(usize),
|
||||
};
|
||||
|
||||
// The height of the current line of text.
|
||||
var cur_line_height: usize = 0;
|
||||
|
||||
var iter = std.unicode.Utf8Iterator{ .i = 0, .bytes = text };
|
||||
while (iter.nextCodepoint()) |codepoint| {
|
||||
// TODO: correctly calculate size of next line first
|
||||
if (codepoint == '\n') {
|
||||
cur_pos.x = std.math.maxInt(usize) / 2;
|
||||
cur_pos.y += @intCast(self.face.*.size.*.metrics.height >> 6);
|
||||
|
||||
cur_line_height = 0;
|
||||
|
||||
continue;
|
||||
}
|
||||
|
||||
const glyph = try self.getGlyph(.{
|
||||
.size = @intCast(size),
|
||||
.codepoint = codepoint,
|
||||
});
|
||||
const gpos = zenolith.layout.Position{
|
||||
// hacky addition with negative numbers
|
||||
.x = cur_pos.x +% @as(usize, @bitCast(@as(isize, glyph.bearing[0]))),
|
||||
.y = cur_pos.y -% @as(usize, @bitCast(@as(isize, glyph.bearing[1]))),
|
||||
};
|
||||
|
||||
try glyphs.append(.{
|
||||
.glyph = glyph,
|
||||
.pos = gpos,
|
||||
});
|
||||
|
||||
cur_pos.x += glyph.advance;
|
||||
|
||||
if (glyph.sprite.size.height > cur_line_height) cur_line_height = glyph.sprite.size.height;
|
||||
|
||||
if (gpos.x < min_pos.x) min_pos.x = gpos.x;
|
||||
if (gpos.y < min_pos.y) min_pos.y = gpos.y;
|
||||
}
|
||||
|
||||
var csize = zenolith.layout.Size.zero;
|
||||
|
||||
// Position glyphs at top left and calculate chunk size.
|
||||
for (glyphs.items) |*g| {
|
||||
const new_pos = g.pos.sub(min_pos);
|
||||
g.pos = new_pos;
|
||||
|
||||
const xmax = g.pos.x + g.glyph.sprite.size.width;
|
||||
const ymax = g.pos.y + g.glyph.sprite.size.height;
|
||||
if (xmax > csize.width) csize.width = xmax;
|
||||
if (ymax > csize.height) csize.height = ymax;
|
||||
}
|
||||
|
||||
return zenolith.font.Chunk.create(Chunk{
|
||||
.font = self,
|
||||
.glyphs = glyphs,
|
||||
.size = csize,
|
||||
}, {});
|
||||
}
|
||||
|
||||
fn isTouchingAnyOnTop(self: *Sdl2Font, rect: zenolith.layout.Rectangle) bool {
|
||||
if (rect.pos.y == 0) return true;
|
||||
for (self.glyphs.unmanaged.entries.items(.value)) |other| {
|
||||
if (other.sprite.pos.y + other.sprite.size.height == rect.pos.y and
|
||||
other.sprite.pos.x < rect.pos.x + rect.size.width and
|
||||
other.sprite.pos.x + other.sprite.size.width > rect.pos.x) return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
fn isTouchingAnyOnLeft(self: *Sdl2Font, rect: zenolith.layout.Rectangle) bool {
|
||||
if (rect.pos.x == 0) return true;
|
||||
for (self.glyphs.unmanaged.entries.items(.value)) |other| {
|
||||
if (other.sprite.pos.x + other.sprite.size.width == rect.pos.x and
|
||||
other.sprite.pos.y < rect.pos.y + rect.size.height and
|
||||
other.sprite.pos.y + other.sprite.size.height > rect.pos.y) return true;
|
||||
}
|
||||
return false;
|
||||
}
|
64
src/Sdl2Painter.zig
Normal file
64
src/Sdl2Painter.zig
Normal file
|
@ -0,0 +1,64 @@
|
|||
const std = @import("std");
|
||||
const zenolith = @import("zenolith");
|
||||
|
||||
const util = @import("util.zig");
|
||||
const c = @import("ffi.zig").c;
|
||||
|
||||
const Sdl2Font = @import("Sdl2Font.zig");
|
||||
const Sdl2Texture = @import("Sdl2Texture.zig");
|
||||
|
||||
renderer: *c.SDL_Renderer,
|
||||
|
||||
const Sdl2Painter = @This();
|
||||
|
||||
pub fn rect(
|
||||
self: *Sdl2Painter,
|
||||
rectangle: zenolith.layout.Rectangle,
|
||||
color: zenolith.Color,
|
||||
) !void {
|
||||
if (c.SDL_SetRenderDrawColor(
|
||||
self.renderer,
|
||||
color.r,
|
||||
color.g,
|
||||
color.b,
|
||||
color.a,
|
||||
) != 0) return error.Render;
|
||||
|
||||
if (c.SDL_RenderFillRect(self.renderer, &util.toSdlRect(rectangle)) != 0) return error.Render;
|
||||
}
|
||||
|
||||
pub fn texturedRect(
|
||||
self: *Sdl2Painter,
|
||||
src: zenolith.layout.Rectangle,
|
||||
dest: zenolith.layout.Rectangle,
|
||||
texture: *zenolith.texture.Texture,
|
||||
) !void {
|
||||
if (c.SDL_RenderCopy(
|
||||
self.renderer,
|
||||
(texture.downcast(Sdl2Texture) orelse unreachable).tex,
|
||||
&util.toSdlRect(src),
|
||||
&util.toSdlRect(dest),
|
||||
) != 0) return error.Render;
|
||||
}
|
||||
|
||||
pub fn text(
|
||||
self: *Sdl2Painter,
|
||||
pos: zenolith.layout.Position,
|
||||
zchunk: zenolith.font.Chunk,
|
||||
color: zenolith.Color,
|
||||
) !void {
|
||||
const chunk = zchunk.downcast(Sdl2Font.Chunk) orelse unreachable;
|
||||
if (c.SDL_SetTextureColorMod(chunk.font.atlas, color.r, color.g, color.b) != 0) return error.Render;
|
||||
if (c.SDL_SetTextureAlphaMod(chunk.font.atlas, color.a) != 0) return error.Render;
|
||||
for (chunk.glyphs.items) |g| {
|
||||
if (c.SDL_RenderCopy(
|
||||
self.renderer,
|
||||
chunk.font.atlas,
|
||||
&util.toSdlRect(g.glyph.sprite),
|
||||
&util.toSdlRect(.{
|
||||
.pos = pos.add(g.pos),
|
||||
.size = g.glyph.sprite.size,
|
||||
}),
|
||||
) != 0) return error.Render;
|
||||
}
|
||||
}
|
313
src/Sdl2Platform.zig
Normal file
313
src/Sdl2Platform.zig
Normal file
|
@ -0,0 +1,313 @@
|
|||
const std = @import("std");
|
||||
const zenolith = @import("zenolith");
|
||||
|
||||
const ffi = @import("ffi.zig");
|
||||
const c = ffi.c;
|
||||
|
||||
const Sdl2Font = @import("Sdl2Font.zig");
|
||||
const Sdl2Painter = @import("Sdl2Painter.zig");
|
||||
const Sdl2Texture = @import("Sdl2Texture.zig");
|
||||
|
||||
// These decls are public so that zenolith includes them in it's statspatch types.
|
||||
pub const Font = Sdl2Font;
|
||||
pub const Texture = Sdl2Texture;
|
||||
|
||||
alloc: std.mem.Allocator,
|
||||
window: *c.SDL_Window,
|
||||
renderer: *c.SDL_Renderer,
|
||||
freetype: c.FT_Library,
|
||||
backevent_id: u32,
|
||||
mouse_pos: ?zenolith.layout.Position,
|
||||
initial_run: bool,
|
||||
|
||||
const Sdl2Platform = @This();
|
||||
|
||||
pub const InitOptions = struct {
|
||||
alloc: std.mem.Allocator,
|
||||
/// The title of the window the platform will create.
|
||||
window_title: [*:0]const u8 = "Zenolith SDL2",
|
||||
|
||||
/// An optional initial window position.
|
||||
window_position: ?[2]c_int = null,
|
||||
|
||||
/// Initial window size
|
||||
window_size: [2]c_int = .{ 800, 600 },
|
||||
};
|
||||
|
||||
pub const InitializeError = error{
|
||||
/// An error has occured trying to initialize the SDL2 library.
|
||||
InitializeSDL2,
|
||||
|
||||
/// An error has occured trying to initialize the freetype2 library.
|
||||
InitializeFreetype,
|
||||
|
||||
/// SDL2 failed to create a window.
|
||||
CreateWindow,
|
||||
|
||||
/// SDL2 failed to create a renderer.
|
||||
CreateRenderer,
|
||||
};
|
||||
|
||||
/// Create a new SDL2 Platform. Initializes the SDL2 and FreeType libraries and creates a
|
||||
/// window. Do not create multiple Sdl2Platforms at once!
|
||||
// TODO: Window API
|
||||
pub fn init(options: InitOptions) InitializeError!Sdl2Platform {
|
||||
if (c.SDL_Init(c.SDL_INIT_VIDEO) != 0) return error.InitializeSDL2;
|
||||
errdefer c.SDL_Quit();
|
||||
|
||||
const window_pos = options.window_position orelse [1]c_int{c.SDL_WINDOWPOS_UNDEFINED} ** 2;
|
||||
const window = c.SDL_CreateWindow(
|
||||
options.window_title,
|
||||
window_pos[0],
|
||||
window_pos[1],
|
||||
options.window_size[0],
|
||||
options.window_size[1],
|
||||
c.SDL_WINDOW_SHOWN, // TODO: add API to change this
|
||||
) orelse return error.CreateWindow;
|
||||
errdefer c.SDL_DestroyWindow(window);
|
||||
|
||||
const renderer = c.SDL_CreateRenderer(
|
||||
window,
|
||||
-1,
|
||||
c.SDL_RENDERER_ACCELERATED,
|
||||
) orelse return error.CreateRenderer;
|
||||
errdefer c.SDL_DestroyRenderer(renderer);
|
||||
|
||||
const backevent_id = c.SDL_RegisterEvents(1);
|
||||
if (backevent_id == std.math.maxInt(u32)) return error.InitializeSDL2;
|
||||
|
||||
var freetype: c.FT_Library = undefined;
|
||||
if (c.FT_Init_FreeType(&freetype) != 0) return error.InitializeFreetype;
|
||||
errdefer _ = c.FT_Done_FreeType(freetype);
|
||||
|
||||
return .{
|
||||
.alloc = options.alloc,
|
||||
.window = window,
|
||||
.renderer = renderer,
|
||||
.freetype = freetype,
|
||||
.backevent_id = backevent_id,
|
||||
.mouse_pos = null,
|
||||
.initial_run = true,
|
||||
};
|
||||
}
|
||||
|
||||
/// Runs the event loop until a backevent is received. This is typically used with a while loop.
|
||||
pub fn run(
|
||||
self: *Sdl2Platform,
|
||||
root: *zenolith.widget.Widget,
|
||||
) anyerror!?zenolith.backevent.Backevent {
|
||||
// Initial layout pass before we get a resize event.
|
||||
if (self.initial_run) {
|
||||
var width: c_int = 0;
|
||||
var height: c_int = 0;
|
||||
c.SDL_GetWindowSize(self.window, &width, &height);
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.LayoutSize{
|
||||
.final = true,
|
||||
.constraints = .{
|
||||
.min = .{ .width = 0, .height = 0 },
|
||||
.max = .{ .width = @intCast(width), .height = @intCast(height) },
|
||||
},
|
||||
});
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.LayoutPosition{
|
||||
.position = .{ .x = 0, .y = 0 },
|
||||
});
|
||||
|
||||
self.initial_run = false;
|
||||
}
|
||||
|
||||
while (true) {
|
||||
var ev: c.SDL_Event = undefined;
|
||||
|
||||
if (c.SDL_WaitEvent(&ev) != 1) return error.GetEvents;
|
||||
|
||||
if (ev.type == self.backevent_id) {
|
||||
const evp: *zenolith.backevent.Backevent = @ptrCast(@alignCast(ev.user.data1));
|
||||
defer self.alloc.destroy(evp);
|
||||
return evp.*;
|
||||
}
|
||||
|
||||
switch (ev.type) {
|
||||
// quit event - exit
|
||||
c.SDL_QUIT => return null,
|
||||
|
||||
c.SDL_WINDOWEVENT => switch (ev.window.event) {
|
||||
// window resized - redo tree layout
|
||||
c.SDL_WINDOWEVENT_RESIZED => {
|
||||
const size = zenolith.layout.Size{
|
||||
.width = @intCast(ev.window.data1),
|
||||
.height = @intCast(ev.window.data2),
|
||||
};
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.LayoutSize{
|
||||
.final = true,
|
||||
.constraints = .{
|
||||
.min = .{ .width = 0, .height = 0 },
|
||||
.max = size,
|
||||
},
|
||||
});
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.LayoutPosition{
|
||||
.position = .{ .x = 0, .y = 0 },
|
||||
});
|
||||
},
|
||||
else => {},
|
||||
},
|
||||
|
||||
c.SDL_MOUSEMOTION => {
|
||||
const mouse_pos = zenolith.layout.Position{
|
||||
.x = @intCast(ev.motion.x),
|
||||
.y = @intCast(ev.motion.y),
|
||||
};
|
||||
self.mouse_pos = mouse_pos;
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.MouseMove{
|
||||
.pos = mouse_pos,
|
||||
.dx = ev.motion.xrel,
|
||||
.dy = ev.motion.yrel,
|
||||
});
|
||||
},
|
||||
|
||||
c.SDL_MOUSEBUTTONDOWN, c.SDL_MOUSEBUTTONUP => {
|
||||
const button: ?zenolith.treevent.Click.MouseButton = switch (ev.button.button) {
|
||||
c.SDL_BUTTON_LEFT => .left,
|
||||
c.SDL_BUTTON_MIDDLE => .middle,
|
||||
c.SDL_BUTTON_RIGHT => .right,
|
||||
else => null,
|
||||
};
|
||||
|
||||
const actions: []const zenolith.treevent.Click.Action = switch (ev.type) {
|
||||
c.SDL_MOUSEBUTTONDOWN => &.{ .down, .click },
|
||||
c.SDL_MOUSEBUTTONUP => &.{.up},
|
||||
else => unreachable,
|
||||
};
|
||||
|
||||
if (button) |but| {
|
||||
for (actions) |act| {
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.Click{
|
||||
.pos = .{
|
||||
.x = @intCast(ev.button.x),
|
||||
.y = @intCast(ev.button.y),
|
||||
},
|
||||
.button = but,
|
||||
.action = act,
|
||||
});
|
||||
}
|
||||
}
|
||||
},
|
||||
|
||||
c.SDL_MOUSEWHEEL => if (self.mouse_pos) |mp| {
|
||||
const btn: zenolith.treevent.Click.MouseButton = if (ev.wheel.y > 0)
|
||||
.scroll_up
|
||||
else if (ev.wheel.y < 0)
|
||||
.scroll_down
|
||||
else if (ev.wheel.x > 0)
|
||||
.scroll_right
|
||||
else if (ev.wheel.x < 0)
|
||||
.scroll_left
|
||||
else
|
||||
unreachable;
|
||||
|
||||
try zenolith.treevent.fire(root, zenolith.treevent.Click{
|
||||
.pos = mp,
|
||||
.button = btn,
|
||||
.action = .click,
|
||||
});
|
||||
},
|
||||
else => {},
|
||||
}
|
||||
|
||||
// do render pass after events
|
||||
// TODO: lazify
|
||||
if (c.SDL_SetRenderDrawColor(self.renderer, 0, 0, 0, 0xff) != 0) return error.Render;
|
||||
if (c.SDL_RenderClear(self.renderer) != 0) return error.Render;
|
||||
|
||||
var painter = zenolith.painter.Painter.create(Sdl2Painter{ .renderer = self.renderer }, {});
|
||||
try root.treevent(zenolith.treevent.Draw{ .painter = &painter });
|
||||
|
||||
c.SDL_RenderPresent(self.renderer);
|
||||
}
|
||||
}
|
||||
|
||||
pub fn deinit(self: Sdl2Platform) void {
|
||||
_ = c.FT_Done_FreeType(self.freetype);
|
||||
c.SDL_DestroyRenderer(self.renderer);
|
||||
c.SDL_DestroyWindow(self.window);
|
||||
c.SDL_Quit();
|
||||
}
|
||||
|
||||
pub const CreateFontOptions = struct {
|
||||
/// Source data to open the font from.
|
||||
source: union(enum) {
|
||||
/// Read the font at a given file path.
|
||||
path: [*:0]const u8,
|
||||
/// Use the data of the slice as font. Useful with @embedFile.
|
||||
/// The data must remain alive until .deinit() is called on the returned font!
|
||||
data: []const u8,
|
||||
},
|
||||
|
||||
/// This is FreeType's infamous face_index parameter. You should either consider reading the
|
||||
/// short novel of historical design mistakes that is it's documentation here:
|
||||
/// https://freetype.org/freetype2/docs/reference/ft2-face_creation.html#ft_open_face
|
||||
/// ...or leave it as 0.
|
||||
face_index: c_long = 0,
|
||||
|
||||
/// Size of the font atlas texture. Increase this if you needs to render lots of glyphs.
|
||||
/// The bin packing algorithm performs best with tall rather than wide atlases.
|
||||
atlas_size: zenolith.layout.Size = .{ .width = 512, .height = 1024 },
|
||||
};
|
||||
|
||||
pub const CreateFontError = ffi.FreeTypeError || error{CreateTexture};
|
||||
|
||||
pub fn createFont(self: Sdl2Platform, opts: CreateFontOptions) CreateFontError!Sdl2Font {
|
||||
var face: c.FT_Face = undefined;
|
||||
switch (opts.source) {
|
||||
.path => |p| try ffi.handleFTError(c.FT_New_Face(
|
||||
self.freetype,
|
||||
p,
|
||||
opts.face_index,
|
||||
&face,
|
||||
)),
|
||||
.data => |d| try ffi.handleFTError(c.FT_New_Memory_Face(
|
||||
self.freetype,
|
||||
d.ptr,
|
||||
@intCast(d.len),
|
||||
opts.face_index,
|
||||
&face,
|
||||
)),
|
||||
}
|
||||
errdefer _ = c.FT_Done_Face(face);
|
||||
|
||||
const atlas = c.SDL_CreateTexture(
|
||||
self.renderer,
|
||||
c.SDL_PIXELFORMAT_RGBA8888,
|
||||
c.SDL_TEXTUREACCESS_STATIC,
|
||||
@intCast(opts.atlas_size.width),
|
||||
@intCast(opts.atlas_size.height),
|
||||
) orelse return error.CreateTexture;
|
||||
errdefer c.SDL_DestroyTexture(atlas);
|
||||
|
||||
if (c.SDL_SetTextureBlendMode(atlas, c.SDL_BLENDMODE_BLEND) != 0) return error.CreateTexture;
|
||||
|
||||
return .{
|
||||
.face = face,
|
||||
.atlas = atlas,
|
||||
.renderer = self.renderer,
|
||||
.glyphs = std.AutoArrayHashMap(Sdl2Font.GlyphProperties, Sdl2Font.Glyph).init(self.alloc),
|
||||
.pixel_buf = std.ArrayList(u8).init(self.alloc),
|
||||
};
|
||||
}
|
||||
|
||||
pub fn pushBackevent(self: *Sdl2Platform, ev: zenolith.backevent.Backevent) !void {
|
||||
const evp = try self.alloc.create(zenolith.backevent.Backevent);
|
||||
errdefer self.alloc.destroy(evp);
|
||||
evp.* = ev;
|
||||
|
||||
var sdl_ev = c.SDL_Event{ .user = .{
|
||||
.type = self.backevent_id,
|
||||
.code = 1,
|
||||
.data1 = evp,
|
||||
} };
|
||||
if (c.SDL_PushEvent(&sdl_ev) < 0) return error.PushEvent;
|
||||
}
|
23
src/Sdl2Texture.zig
Normal file
23
src/Sdl2Texture.zig
Normal file
|
@ -0,0 +1,23 @@
|
|||
//! A wrapper around SDL2's SDL_Texture which acts as the platform's texture type.
|
||||
const std = @import("std");
|
||||
const zenolith = @import("zenolith");
|
||||
|
||||
const c = @import("ffi.zig").c;
|
||||
|
||||
const log = std.log.scoped(.zenolith_sdl2);
|
||||
|
||||
tex: *c.SDL_Texture,
|
||||
|
||||
const Sdl2Texture = @This();
|
||||
|
||||
pub fn getSize(self: Sdl2Texture) zenolith.layout.Size {
|
||||
var w: c_int = 0;
|
||||
var h: c_int = 0;
|
||||
|
||||
if (c.SDL_QueryTexture(self.tex, null, null, &w, &h) != 0) {
|
||||
// probably not the best error handling, but this is probably not a likely failure state
|
||||
log.err("getting SDL2 texture size: {s}", .{c.SDL_GetError()});
|
||||
}
|
||||
|
||||
return .{ .width = @intCast(w), .height = @intCast(h) };
|
||||
}
|
195
src/ffi.zig
Normal file
195
src/ffi.zig
Normal file
|
@ -0,0 +1,195 @@
|
|||
pub const c = @cImport({
|
||||
@cInclude("SDL2/SDL.h");
|
||||
@cInclude("freetype/freetype.h");
|
||||
});
|
||||
|
||||
|
||||
// This error union as well as the handleFTError function has been kindly involuntarily donated
|
||||
// by the awesome mach-freetype library.
|
||||
pub const FreeTypeError = error{
|
||||
CannotOpenResource,
|
||||
UnknownFileFormat,
|
||||
InvalidFileFormat,
|
||||
InvalidVersion,
|
||||
LowerModuleVersion,
|
||||
InvalidArgument,
|
||||
UnimplementedFeature,
|
||||
InvalidTable,
|
||||
InvalidOffset,
|
||||
ArrayTooLarge,
|
||||
MissingModule,
|
||||
MissingProperty,
|
||||
InvalidGlyphIndex,
|
||||
InvalidCharacterCode,
|
||||
InvalidGlyphFormat,
|
||||
CannotRenderGlyph,
|
||||
InvalidOutline,
|
||||
InvalidComposite,
|
||||
TooManyHints,
|
||||
InvalidPixelSize,
|
||||
InvalidHandle,
|
||||
InvalidLibraryHandle,
|
||||
InvalidDriverHandle,
|
||||
InvalidFaceHandle,
|
||||
InvalidSizeHandle,
|
||||
InvalidSlotHandle,
|
||||
InvalidCharMapHandle,
|
||||
InvalidCacheHandle,
|
||||
InvalidStreamHandle,
|
||||
TooManyDrivers,
|
||||
TooManyExtensions,
|
||||
OutOfMemory,
|
||||
UnlistedObject,
|
||||
CannotOpenStream,
|
||||
InvalidStreamSeek,
|
||||
InvalidStreamSkip,
|
||||
InvalidStreamRead,
|
||||
InvalidStreamOperation,
|
||||
InvalidFrameOperation,
|
||||
NestedFrameAccess,
|
||||
InvalidFrameRead,
|
||||
RasterUninitialized,
|
||||
RasterCorrupted,
|
||||
RasterOverflow,
|
||||
RasterNegativeHeight,
|
||||
TooManyCaches,
|
||||
InvalidOpcode,
|
||||
TooFewArguments,
|
||||
StackOverflow,
|
||||
CodeOverflow,
|
||||
BadArgument,
|
||||
DivideByZero,
|
||||
InvalidReference,
|
||||
DebugOpCode,
|
||||
ENDFInExecStream,
|
||||
NestedDEFS,
|
||||
InvalidCodeRange,
|
||||
ExecutionTooLong,
|
||||
TooManyFunctionDefs,
|
||||
TooManyInstructionDefs,
|
||||
TableMissing,
|
||||
HorizHeaderMissing,
|
||||
LocationsMissing,
|
||||
NameTableMissing,
|
||||
CMapTableMissing,
|
||||
HmtxTableMissing,
|
||||
PostTableMissing,
|
||||
InvalidHorizMetrics,
|
||||
InvalidCharMapFormat,
|
||||
InvalidPPem,
|
||||
InvalidVertMetrics,
|
||||
CouldNotFindContext,
|
||||
InvalidPostTableFormat,
|
||||
InvalidPostTable,
|
||||
Syntax,
|
||||
StackUnderflow,
|
||||
Ignore,
|
||||
NoUnicodeGlyphName,
|
||||
MissingStartfontField,
|
||||
MissingFontField,
|
||||
MissingSizeField,
|
||||
MissingFontboundingboxField,
|
||||
MissingCharsField,
|
||||
MissingStartcharField,
|
||||
MissingEncodingField,
|
||||
MissingBbxField,
|
||||
BbxTooBig,
|
||||
CorruptedFontHeader,
|
||||
CorruptedFontGlyphs,
|
||||
};
|
||||
|
||||
pub fn handleFTError(err: c_int) FreeTypeError!void {
|
||||
return switch (err) {
|
||||
c.FT_Err_Ok => {},
|
||||
c.FT_Err_Cannot_Open_Resource => error.CannotOpenResource,
|
||||
c.FT_Err_Unknown_File_Format => error.UnknownFileFormat,
|
||||
c.FT_Err_Invalid_File_Format => error.InvalidFileFormat,
|
||||
c.FT_Err_Invalid_Version => error.InvalidVersion,
|
||||
c.FT_Err_Lower_Module_Version => error.LowerModuleVersion,
|
||||
c.FT_Err_Invalid_Argument => error.InvalidArgument,
|
||||
c.FT_Err_Unimplemented_Feature => error.UnimplementedFeature,
|
||||
c.FT_Err_Invalid_Table => error.InvalidTable,
|
||||
c.FT_Err_Invalid_Offset => error.InvalidOffset,
|
||||
c.FT_Err_Array_Too_Large => error.ArrayTooLarge,
|
||||
c.FT_Err_Missing_Module => error.MissingModule,
|
||||
c.FT_Err_Missing_Property => error.MissingProperty,
|
||||
c.FT_Err_Invalid_Glyph_Index => error.InvalidGlyphIndex,
|
||||
c.FT_Err_Invalid_Character_Code => error.InvalidCharacterCode,
|
||||
c.FT_Err_Invalid_Glyph_Format => error.InvalidGlyphFormat,
|
||||
c.FT_Err_Cannot_Render_Glyph => error.CannotRenderGlyph,
|
||||
c.FT_Err_Invalid_Outline => error.InvalidOutline,
|
||||
c.FT_Err_Invalid_Composite => error.InvalidComposite,
|
||||
c.FT_Err_Too_Many_Hints => error.TooManyHints,
|
||||
c.FT_Err_Invalid_Pixel_Size => error.InvalidPixelSize,
|
||||
c.FT_Err_Invalid_Handle => error.InvalidHandle,
|
||||
c.FT_Err_Invalid_Library_Handle => error.InvalidLibraryHandle,
|
||||
c.FT_Err_Invalid_Driver_Handle => error.InvalidDriverHandle,
|
||||
c.FT_Err_Invalid_Face_Handle => error.InvalidFaceHandle,
|
||||
c.FT_Err_Invalid_Size_Handle => error.InvalidSizeHandle,
|
||||
c.FT_Err_Invalid_Slot_Handle => error.InvalidSlotHandle,
|
||||
c.FT_Err_Invalid_CharMap_Handle => error.InvalidCharMapHandle,
|
||||
c.FT_Err_Invalid_Cache_Handle => error.InvalidCacheHandle,
|
||||
c.FT_Err_Invalid_Stream_Handle => error.InvalidStreamHandle,
|
||||
c.FT_Err_Too_Many_Drivers => error.TooManyDrivers,
|
||||
c.FT_Err_Too_Many_Extensions => error.TooManyExtensions,
|
||||
c.FT_Err_Out_Of_Memory => error.OutOfMemory,
|
||||
c.FT_Err_Unlisted_Object => error.UnlistedObject,
|
||||
c.FT_Err_Cannot_Open_Stream => error.CannotOpenStream,
|
||||
c.FT_Err_Invalid_Stream_Seek => error.InvalidStreamSeek,
|
||||
c.FT_Err_Invalid_Stream_Skip => error.InvalidStreamSkip,
|
||||
c.FT_Err_Invalid_Stream_Read => error.InvalidStreamRead,
|
||||
c.FT_Err_Invalid_Stream_Operation => error.InvalidStreamOperation,
|
||||
c.FT_Err_Invalid_Frame_Operation => error.InvalidFrameOperation,
|
||||
c.FT_Err_Nested_Frame_Access => error.NestedFrameAccess,
|
||||
c.FT_Err_Invalid_Frame_Read => error.InvalidFrameRead,
|
||||
c.FT_Err_Raster_Uninitialized => error.RasterUninitialized,
|
||||
c.FT_Err_Raster_Corrupted => error.RasterCorrupted,
|
||||
c.FT_Err_Raster_Overflow => error.RasterOverflow,
|
||||
c.FT_Err_Raster_Negative_Height => error.RasterNegativeHeight,
|
||||
c.FT_Err_Too_Many_Caches => error.TooManyCaches,
|
||||
c.FT_Err_Invalid_Opcode => error.InvalidOpcode,
|
||||
c.FT_Err_Too_Few_Arguments => error.TooFewArguments,
|
||||
c.FT_Err_Stack_Overflow => error.StackOverflow,
|
||||
c.FT_Err_Code_Overflow => error.CodeOverflow,
|
||||
c.FT_Err_Bad_Argument => error.BadArgument,
|
||||
c.FT_Err_Divide_By_Zero => error.DivideByZero,
|
||||
c.FT_Err_Invalid_Reference => error.InvalidReference,
|
||||
c.FT_Err_Debug_OpCode => error.DebugOpCode,
|
||||
c.FT_Err_ENDF_In_Exec_Stream => error.ENDFInExecStream,
|
||||
c.FT_Err_Nested_DEFS => error.NestedDEFS,
|
||||
c.FT_Err_Invalid_CodeRange => error.InvalidCodeRange,
|
||||
c.FT_Err_Execution_Too_Long => error.ExecutionTooLong,
|
||||
c.FT_Err_Too_Many_Function_Defs => error.TooManyFunctionDefs,
|
||||
c.FT_Err_Too_Many_Instruction_Defs => error.TooManyInstructionDefs,
|
||||
c.FT_Err_Table_Missing => error.TableMissing,
|
||||
c.FT_Err_Horiz_Header_Missing => error.HorizHeaderMissing,
|
||||
c.FT_Err_Locations_Missing => error.LocationsMissing,
|
||||
c.FT_Err_Name_Table_Missing => error.NameTableMissing,
|
||||
c.FT_Err_CMap_Table_Missing => error.CMapTableMissing,
|
||||
c.FT_Err_Hmtx_Table_Missing => error.HmtxTableMissing,
|
||||
c.FT_Err_Post_Table_Missing => error.PostTableMissing,
|
||||
c.FT_Err_Invalid_Horiz_Metrics => error.InvalidHorizMetrics,
|
||||
c.FT_Err_Invalid_CharMap_Format => error.InvalidCharMapFormat,
|
||||
c.FT_Err_Invalid_PPem => error.InvalidPPem,
|
||||
c.FT_Err_Invalid_Vert_Metrics => error.InvalidVertMetrics,
|
||||
c.FT_Err_Could_Not_Find_Context => error.CouldNotFindContext,
|
||||
c.FT_Err_Invalid_Post_Table_Format => error.InvalidPostTableFormat,
|
||||
c.FT_Err_Invalid_Post_Table => error.InvalidPostTable,
|
||||
c.FT_Err_Syntax_Error => error.Syntax,
|
||||
c.FT_Err_Stack_Underflow => error.StackUnderflow,
|
||||
c.FT_Err_Ignore => error.Ignore,
|
||||
c.FT_Err_No_Unicode_Glyph_Name => error.NoUnicodeGlyphName,
|
||||
c.FT_Err_Missing_Startfont_Field => error.MissingStartfontField,
|
||||
c.FT_Err_Missing_Font_Field => error.MissingFontField,
|
||||
c.FT_Err_Missing_Size_Field => error.MissingSizeField,
|
||||
c.FT_Err_Missing_Fontboundingbox_Field => error.MissingFontboundingboxField,
|
||||
c.FT_Err_Missing_Chars_Field => error.MissingCharsField,
|
||||
c.FT_Err_Missing_Startchar_Field => error.MissingStartcharField,
|
||||
c.FT_Err_Missing_Encoding_Field => error.MissingEncodingField,
|
||||
c.FT_Err_Missing_Bbx_Field => error.MissingBbxField,
|
||||
c.FT_Err_Bbx_Too_Big => error.BbxTooBig,
|
||||
c.FT_Err_Corrupted_Font_Header => error.CorruptedFontHeader,
|
||||
c.FT_Err_Corrupted_Font_Glyphs => error.CorruptedFontGlyphs,
|
||||
else => unreachable,
|
||||
};
|
||||
}
|
15
src/main.zig
Normal file
15
src/main.zig
Normal file
|
@ -0,0 +1,15 @@
|
|||
const std = @import("std");
|
||||
|
||||
test {
|
||||
_ = Sdl2Font;
|
||||
_ = Sdl2Painter;
|
||||
_ = Sdl2Platform;
|
||||
_ = Sdl2Texture;
|
||||
}
|
||||
|
||||
pub const FreeTypeError = @import("ffi.zig").FreeTypeError;
|
||||
|
||||
pub const Sdl2Font = @import("Sdl2Font.zig");
|
||||
pub const Sdl2Painter = @import("Sdl2Painter.zig");
|
||||
pub const Sdl2Platform = @import("Sdl2Platform.zig");
|
||||
pub const Sdl2Texture = @import("Sdl2Texture.zig");
|
12
src/util.zig
Normal file
12
src/util.zig
Normal file
|
@ -0,0 +1,12 @@
|
|||
const zenolith = @import("zenolith");
|
||||
|
||||
const c = @import("ffi.zig").c;
|
||||
|
||||
pub fn toSdlRect(rect: zenolith.layout.Rectangle) c.SDL_Rect {
|
||||
return .{
|
||||
.x = @intCast(rect.pos.x),
|
||||
.y = @intCast(rect.pos.y),
|
||||
.w = @intCast(rect.size.width),
|
||||
.h = @intCast(rect.size.height),
|
||||
};
|
||||
}
|
Loading…
Reference in a new issue