Brad Parker
3 years ago
commit
2f0c6ffb76
7 changed files with 5435 additions and 0 deletions
@ -0,0 +1,674 @@ |
|||||
|
GNU GENERAL PUBLIC LICENSE |
||||
|
Version 3, 29 June 2007 |
||||
|
|
||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> |
||||
|
Everyone is permitted to copy and distribute verbatim copies |
||||
|
of this license document, but changing it is not allowed. |
||||
|
|
||||
|
Preamble |
||||
|
|
||||
|
The GNU General Public License is a free, copyleft license for |
||||
|
software and other kinds of works. |
||||
|
|
||||
|
The licenses for most software and other practical works are designed |
||||
|
to take away your freedom to share and change the works. By contrast, |
||||
|
the GNU General Public License is intended to guarantee your freedom to |
||||
|
share and change all versions of a program--to make sure it remains free |
||||
|
software for all its users. We, the Free Software Foundation, use the |
||||
|
GNU General Public License for most of our software; it applies also to |
||||
|
any other work released this way by its authors. You can apply it to |
||||
|
your programs, too. |
||||
|
|
||||
|
When we speak of free software, we are referring to freedom, not |
||||
|
price. Our General Public Licenses are designed to make sure that you |
||||
|
have the freedom to distribute copies of free software (and charge for |
||||
|
them if you wish), that you receive source code or can get it if you |
||||
|
want it, that you can change the software or use pieces of it in new |
||||
|
free programs, and that you know you can do these things. |
||||
|
|
||||
|
To protect your rights, we need to prevent others from denying you |
||||
|
these rights or asking you to surrender the rights. Therefore, you have |
||||
|
certain responsibilities if you distribute copies of the software, or if |
||||
|
you modify it: responsibilities to respect the freedom of others. |
||||
|
|
||||
|
For example, if you distribute copies of such a program, whether |
||||
|
gratis or for a fee, you must pass on to the recipients the same |
||||
|
freedoms that you received. You must make sure that they, too, receive |
||||
|
or can get the source code. And you must show them these terms so they |
||||
|
know their rights. |
||||
|
|
||||
|
Developers that use the GNU GPL protect your rights with two steps: |
||||
|
(1) assert copyright on the software, and (2) offer you this License |
||||
|
giving you legal permission to copy, distribute and/or modify it. |
||||
|
|
||||
|
For the developers' and authors' protection, the GPL clearly explains |
||||
|
that there is no warranty for this free software. For both users' and |
||||
|
authors' sake, the GPL requires that modified versions be marked as |
||||
|
changed, so that their problems will not be attributed erroneously to |
||||
|
authors of previous versions. |
||||
|
|
||||
|
Some devices are designed to deny users access to install or run |
||||
|
modified versions of the software inside them, although the manufacturer |
||||
|
can do so. This is fundamentally incompatible with the aim of |
||||
|
protecting users' freedom to change the software. The systematic |
||||
|
pattern of such abuse occurs in the area of products for individuals to |
||||
|
use, which is precisely where it is most unacceptable. Therefore, we |
||||
|
have designed this version of the GPL to prohibit the practice for those |
||||
|
products. If such problems arise substantially in other domains, we |
||||
|
stand ready to extend this provision to those domains in future versions |
||||
|
of the GPL, as needed to protect the freedom of users. |
||||
|
|
||||
|
Finally, every program is threatened constantly by software patents. |
||||
|
States should not allow patents to restrict development and use of |
||||
|
software on general-purpose computers, but in those that do, we wish to |
||||
|
avoid the special danger that patents applied to a free program could |
||||
|
make it effectively proprietary. To prevent this, the GPL assures that |
||||
|
patents cannot be used to render the program non-free. |
||||
|
|
||||
|
The precise terms and conditions for copying, distribution and |
||||
|
modification follow. |
||||
|
|
||||
|
TERMS AND CONDITIONS |
||||
|
|
||||
|
0. Definitions. |
||||
|
|
||||
|
"This License" refers to version 3 of the GNU General Public License. |
||||
|
|
||||
|
"Copyright" also means copyright-like laws that apply to other kinds of |
||||
|
works, such as semiconductor masks. |
||||
|
|
||||
|
"The Program" refers to any copyrightable work licensed under this |
||||
|
License. Each licensee is addressed as "you". "Licensees" and |
||||
|
"recipients" may be individuals or organizations. |
||||
|
|
||||
|
To "modify" a work means to copy from or adapt all or part of the work |
||||
|
in a fashion requiring copyright permission, other than the making of an |
||||
|
exact copy. The resulting work is called a "modified version" of the |
||||
|
earlier work or a work "based on" the earlier work. |
||||
|
|
||||
|
A "covered work" means either the unmodified Program or a work based |
||||
|
on the Program. |
||||
|
|
||||
|
To "propagate" a work means to do anything with it that, without |
||||
|
permission, would make you directly or secondarily liable for |
||||
|
infringement under applicable copyright law, except executing it on a |
||||
|
computer or modifying a private copy. Propagation includes copying, |
||||
|
distribution (with or without modification), making available to the |
||||
|
public, and in some countries other activities as well. |
||||
|
|
||||
|
To "convey" a work means any kind of propagation that enables other |
||||
|
parties to make or receive copies. Mere interaction with a user through |
||||
|
a computer network, with no transfer of a copy, is not conveying. |
||||
|
|
||||
|
An interactive user interface displays "Appropriate Legal Notices" |
||||
|
to the extent that it includes a convenient and prominently visible |
||||
|
feature that (1) displays an appropriate copyright notice, and (2) |
||||
|
tells the user that there is no warranty for the work (except to the |
||||
|
extent that warranties are provided), that licensees may convey the |
||||
|
work under this License, and how to view a copy of this License. If |
||||
|
the interface presents a list of user commands or options, such as a |
||||
|
menu, a prominent item in the list meets this criterion. |
||||
|
|
||||
|
1. Source Code. |
||||
|
|
||||
|
The "source code" for a work means the preferred form of the work |
||||
|
for making modifications to it. "Object code" means any non-source |
||||
|
form of a work. |
||||
|
|
||||
|
A "Standard Interface" means an interface that either is an official |
||||
|
standard defined by a recognized standards body, or, in the case of |
||||
|
interfaces specified for a particular programming language, one that |
||||
|
is widely used among developers working in that language. |
||||
|
|
||||
|
The "System Libraries" of an executable work include anything, other |
||||
|
than the work as a whole, that (a) is included in the normal form of |
||||
|
packaging a Major Component, but which is not part of that Major |
||||
|
Component, and (b) serves only to enable use of the work with that |
||||
|
Major Component, or to implement a Standard Interface for which an |
||||
|
implementation is available to the public in source code form. A |
||||
|
"Major Component", in this context, means a major essential component |
||||
|
(kernel, window system, and so on) of the specific operating system |
||||
|
(if any) on which the executable work runs, or a compiler used to |
||||
|
produce the work, or an object code interpreter used to run it. |
||||
|
|
||||
|
The "Corresponding Source" for a work in object code form means all |
||||
|
the source code needed to generate, install, and (for an executable |
||||
|
work) run the object code and to modify the work, including scripts to |
||||
|
control those activities. However, it does not include the work's |
||||
|
System Libraries, or general-purpose tools or generally available free |
||||
|
programs which are used unmodified in performing those activities but |
||||
|
which are not part of the work. For example, Corresponding Source |
||||
|
includes interface definition files associated with source files for |
||||
|
the work, and the source code for shared libraries and dynamically |
||||
|
linked subprograms that the work is specifically designed to require, |
||||
|
such as by intimate data communication or control flow between those |
||||
|
subprograms and other parts of the work. |
||||
|
|
||||
|
The Corresponding Source need not include anything that users |
||||
|
can regenerate automatically from other parts of the Corresponding |
||||
|
Source. |
||||
|
|
||||
|
The Corresponding Source for a work in source code form is that |
||||
|
same work. |
||||
|
|
||||
|
2. Basic Permissions. |
||||
|
|
||||
|
All rights granted under this License are granted for the term of |
||||
|
copyright on the Program, and are irrevocable provided the stated |
||||
|
conditions are met. This License explicitly affirms your unlimited |
||||
|
permission to run the unmodified Program. The output from running a |
||||
|
covered work is covered by this License only if the output, given its |
||||
|
content, constitutes a covered work. This License acknowledges your |
||||
|
rights of fair use or other equivalent, as provided by copyright law. |
||||
|
|
||||
|
You may make, run and propagate covered works that you do not |
||||
|
convey, without conditions so long as your license otherwise remains |
||||
|
in force. You may convey covered works to others for the sole purpose |
||||
|
of having them make modifications exclusively for you, or provide you |
||||
|
with facilities for running those works, provided that you comply with |
||||
|
the terms of this License in conveying all material for which you do |
||||
|
not control copyright. Those thus making or running the covered works |
||||
|
for you must do so exclusively on your behalf, under your direction |
||||
|
and control, on terms that prohibit them from making any copies of |
||||
|
your copyrighted material outside their relationship with you. |
||||
|
|
||||
|
Conveying under any other circumstances is permitted solely under |
||||
|
the conditions stated below. Sublicensing is not allowed; section 10 |
||||
|
makes it unnecessary. |
||||
|
|
||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
||||
|
|
||||
|
No covered work shall be deemed part of an effective technological |
||||
|
measure under any applicable law fulfilling obligations under article |
||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
||||
|
similar laws prohibiting or restricting circumvention of such |
||||
|
measures. |
||||
|
|
||||
|
When you convey a covered work, you waive any legal power to forbid |
||||
|
circumvention of technological measures to the extent such circumvention |
||||
|
is effected by exercising rights under this License with respect to |
||||
|
the covered work, and you disclaim any intention to limit operation or |
||||
|
modification of the work as a means of enforcing, against the work's |
||||
|
users, your or third parties' legal rights to forbid circumvention of |
||||
|
technological measures. |
||||
|
|
||||
|
4. Conveying Verbatim Copies. |
||||
|
|
||||
|
You may convey verbatim copies of the Program's source code as you |
||||
|
receive it, in any medium, provided that you conspicuously and |
||||
|
appropriately publish on each copy an appropriate copyright notice; |
||||
|
keep intact all notices stating that this License and any |
||||
|
non-permissive terms added in accord with section 7 apply to the code; |
||||
|
keep intact all notices of the absence of any warranty; and give all |
||||
|
recipients a copy of this License along with the Program. |
||||
|
|
||||
|
You may charge any price or no price for each copy that you convey, |
||||
|
and you may offer support or warranty protection for a fee. |
||||
|
|
||||
|
5. Conveying Modified Source Versions. |
||||
|
|
||||
|
You may convey a work based on the Program, or the modifications to |
||||
|
produce it from the Program, in the form of source code under the |
||||
|
terms of section 4, provided that you also meet all of these conditions: |
||||
|
|
||||
|
a) The work must carry prominent notices stating that you modified |
||||
|
it, and giving a relevant date. |
||||
|
|
||||
|
b) The work must carry prominent notices stating that it is |
||||
|
released under this License and any conditions added under section |
||||
|
7. This requirement modifies the requirement in section 4 to |
||||
|
"keep intact all notices". |
||||
|
|
||||
|
c) You must license the entire work, as a whole, under this |
||||
|
License to anyone who comes into possession of a copy. This |
||||
|
License will therefore apply, along with any applicable section 7 |
||||
|
additional terms, to the whole of the work, and all its parts, |
||||
|
regardless of how they are packaged. This License gives no |
||||
|
permission to license the work in any other way, but it does not |
||||
|
invalidate such permission if you have separately received it. |
||||
|
|
||||
|
d) If the work has interactive user interfaces, each must display |
||||
|
Appropriate Legal Notices; however, if the Program has interactive |
||||
|
interfaces that do not display Appropriate Legal Notices, your |
||||
|
work need not make them do so. |
||||
|
|
||||
|
A compilation of a covered work with other separate and independent |
||||
|
works, which are not by their nature extensions of the covered work, |
||||
|
and which are not combined with it such as to form a larger program, |
||||
|
in or on a volume of a storage or distribution medium, is called an |
||||
|
"aggregate" if the compilation and its resulting copyright are not |
||||
|
used to limit the access or legal rights of the compilation's users |
||||
|
beyond what the individual works permit. Inclusion of a covered work |
||||
|
in an aggregate does not cause this License to apply to the other |
||||
|
parts of the aggregate. |
||||
|
|
||||
|
6. Conveying Non-Source Forms. |
||||
|
|
||||
|
You may convey a covered work in object code form under the terms |
||||
|
of sections 4 and 5, provided that you also convey the |
||||
|
machine-readable Corresponding Source under the terms of this License, |
||||
|
in one of these ways: |
||||
|
|
||||
|
a) Convey the object code in, or embodied in, a physical product |
||||
|
(including a physical distribution medium), accompanied by the |
||||
|
Corresponding Source fixed on a durable physical medium |
||||
|
customarily used for software interchange. |
||||
|
|
||||
|
b) Convey the object code in, or embodied in, a physical product |
||||
|
(including a physical distribution medium), accompanied by a |
||||
|
written offer, valid for at least three years and valid for as |
||||
|
long as you offer spare parts or customer support for that product |
||||
|
model, to give anyone who possesses the object code either (1) a |
||||
|
copy of the Corresponding Source for all the software in the |
||||
|
product that is covered by this License, on a durable physical |
||||
|
medium customarily used for software interchange, for a price no |
||||
|
more than your reasonable cost of physically performing this |
||||
|
conveying of source, or (2) access to copy the |
||||
|
Corresponding Source from a network server at no charge. |
||||
|
|
||||
|
c) Convey individual copies of the object code with a copy of the |
||||
|
written offer to provide the Corresponding Source. This |
||||
|
alternative is allowed only occasionally and noncommercially, and |
||||
|
only if you received the object code with such an offer, in accord |
||||
|
with subsection 6b. |
||||
|
|
||||
|
d) Convey the object code by offering access from a designated |
||||
|
place (gratis or for a charge), and offer equivalent access to the |
||||
|
Corresponding Source in the same way through the same place at no |
||||
|
further charge. You need not require recipients to copy the |
||||
|
Corresponding Source along with the object code. If the place to |
||||
|
copy the object code is a network server, the Corresponding Source |
||||
|
may be on a different server (operated by you or a third party) |
||||
|
that supports equivalent copying facilities, provided you maintain |
||||
|
clear directions next to the object code saying where to find the |
||||
|
Corresponding Source. Regardless of what server hosts the |
||||
|
Corresponding Source, you remain obligated to ensure that it is |
||||
|
available for as long as needed to satisfy these requirements. |
||||
|
|
||||
|
e) Convey the object code using peer-to-peer transmission, provided |
||||
|
you inform other peers where the object code and Corresponding |
||||
|
Source of the work are being offered to the general public at no |
||||
|
charge under subsection 6d. |
||||
|
|
||||
|
A separable portion of the object code, whose source code is excluded |
||||
|
from the Corresponding Source as a System Library, need not be |
||||
|
included in conveying the object code work. |
||||
|
|
||||
|
A "User Product" is either (1) a "consumer product", which means any |
||||
|
tangible personal property which is normally used for personal, family, |
||||
|
or household purposes, or (2) anything designed or sold for incorporation |
||||
|
into a dwelling. In determining whether a product is a consumer product, |
||||
|
doubtful cases shall be resolved in favor of coverage. For a particular |
||||
|
product received by a particular user, "normally used" refers to a |
||||
|
typical or common use of that class of product, regardless of the status |
||||
|
of the particular user or of the way in which the particular user |
||||
|
actually uses, or expects or is expected to use, the product. A product |
||||
|
is a consumer product regardless of whether the product has substantial |
||||
|
commercial, industrial or non-consumer uses, unless such uses represent |
||||
|
the only significant mode of use of the product. |
||||
|
|
||||
|
"Installation Information" for a User Product means any methods, |
||||
|
procedures, authorization keys, or other information required to install |
||||
|
and execute modified versions of a covered work in that User Product from |
||||
|
a modified version of its Corresponding Source. The information must |
||||
|
suffice to ensure that the continued functioning of the modified object |
||||
|
code is in no case prevented or interfered with solely because |
||||
|
modification has been made. |
||||
|
|
||||
|
If you convey an object code work under this section in, or with, or |
||||
|
specifically for use in, a User Product, and the conveying occurs as |
||||
|
part of a transaction in which the right of possession and use of the |
||||
|
User Product is transferred to the recipient in perpetuity or for a |
||||
|
fixed term (regardless of how the transaction is characterized), the |
||||
|
Corresponding Source conveyed under this section must be accompanied |
||||
|
by the Installation Information. But this requirement does not apply |
||||
|
if neither you nor any third party retains the ability to install |
||||
|
modified object code on the User Product (for example, the work has |
||||
|
been installed in ROM). |
||||
|
|
||||
|
The requirement to provide Installation Information does not include a |
||||
|
requirement to continue to provide support service, warranty, or updates |
||||
|
for a work that has been modified or installed by the recipient, or for |
||||
|
the User Product in which it has been modified or installed. Access to a |
||||
|
network may be denied when the modification itself materially and |
||||
|
adversely affects the operation of the network or violates the rules and |
||||
|
protocols for communication across the network. |
||||
|
|
||||
|
Corresponding Source conveyed, and Installation Information provided, |
||||
|
in accord with this section must be in a format that is publicly |
||||
|
documented (and with an implementation available to the public in |
||||
|
source code form), and must require no special password or key for |
||||
|
unpacking, reading or copying. |
||||
|
|
||||
|
7. Additional Terms. |
||||
|
|
||||
|
"Additional permissions" are terms that supplement the terms of this |
||||
|
License by making exceptions from one or more of its conditions. |
||||
|
Additional permissions that are applicable to the entire Program shall |
||||
|
be treated as though they were included in this License, to the extent |
||||
|
that they are valid under applicable law. If additional permissions |
||||
|
apply only to part of the Program, that part may be used separately |
||||
|
under those permissions, but the entire Program remains governed by |
||||
|
this License without regard to the additional permissions. |
||||
|
|
||||
|
When you convey a copy of a covered work, you may at your option |
||||
|
remove any additional permissions from that copy, or from any part of |
||||
|
it. (Additional permissions may be written to require their own |
||||
|
removal in certain cases when you modify the work.) You may place |
||||
|
additional permissions on material, added by you to a covered work, |
||||
|
for which you have or can give appropriate copyright permission. |
||||
|
|
||||
|
Notwithstanding any other provision of this License, for material you |
||||
|
add to a covered work, you may (if authorized by the copyright holders of |
||||
|
that material) supplement the terms of this License with terms: |
||||
|
|
||||
|
a) Disclaiming warranty or limiting liability differently from the |
||||
|
terms of sections 15 and 16 of this License; or |
||||
|
|
||||
|
b) Requiring preservation of specified reasonable legal notices or |
||||
|
author attributions in that material or in the Appropriate Legal |
||||
|
Notices displayed by works containing it; or |
||||
|
|
||||
|
c) Prohibiting misrepresentation of the origin of that material, or |
||||
|
requiring that modified versions of such material be marked in |
||||
|
reasonable ways as different from the original version; or |
||||
|
|
||||
|
d) Limiting the use for publicity purposes of names of licensors or |
||||
|
authors of the material; or |
||||
|
|
||||
|
e) Declining to grant rights under trademark law for use of some |
||||
|
trade names, trademarks, or service marks; or |
||||
|
|
||||
|
f) Requiring indemnification of licensors and authors of that |
||||
|
material by anyone who conveys the material (or modified versions of |
||||
|
it) with contractual assumptions of liability to the recipient, for |
||||
|
any liability that these contractual assumptions directly impose on |
||||
|
those licensors and authors. |
||||
|
|
||||
|
All other non-permissive additional terms are considered "further |
||||
|
restrictions" within the meaning of section 10. If the Program as you |
||||
|
received it, or any part of it, contains a notice stating that it is |
||||
|
governed by this License along with a term that is a further |
||||
|
restriction, you may remove that term. If a license document contains |
||||
|
a further restriction but permits relicensing or conveying under this |
||||
|
License, you may add to a covered work material governed by the terms |
||||
|
of that license document, provided that the further restriction does |
||||
|
not survive such relicensing or conveying. |
||||
|
|
||||
|
If you add terms to a covered work in accord with this section, you |
||||
|
must place, in the relevant source files, a statement of the |
||||
|
additional terms that apply to those files, or a notice indicating |
||||
|
where to find the applicable terms. |
||||
|
|
||||
|
Additional terms, permissive or non-permissive, may be stated in the |
||||
|
form of a separately written license, or stated as exceptions; |
||||
|
the above requirements apply either way. |
||||
|
|
||||
|
8. Termination. |
||||
|
|
||||
|
You may not propagate or modify a covered work except as expressly |
||||
|
provided under this License. Any attempt otherwise to propagate or |
||||
|
modify it is void, and will automatically terminate your rights under |
||||
|
this License (including any patent licenses granted under the third |
||||
|
paragraph of section 11). |
||||
|
|
||||
|
However, if you cease all violation of this License, then your |
||||
|
license from a particular copyright holder is reinstated (a) |
||||
|
provisionally, unless and until the copyright holder explicitly and |
||||
|
finally terminates your license, and (b) permanently, if the copyright |
||||
|
holder fails to notify you of the violation by some reasonable means |
||||
|
prior to 60 days after the cessation. |
||||
|
|
||||
|
Moreover, your license from a particular copyright holder is |
||||
|
reinstated permanently if the copyright holder notifies you of the |
||||
|
violation by some reasonable means, this is the first time you have |
||||
|
received notice of violation of this License (for any work) from that |
||||
|
copyright holder, and you cure the violation prior to 30 days after |
||||
|
your receipt of the notice. |
||||
|
|
||||
|
Termination of your rights under this section does not terminate the |
||||
|
licenses of parties who have received copies or rights from you under |
||||
|
this License. If your rights have been terminated and not permanently |
||||
|
reinstated, you do not qualify to receive new licenses for the same |
||||
|
material under section 10. |
||||
|
|
||||
|
9. Acceptance Not Required for Having Copies. |
||||
|
|
||||
|
You are not required to accept this License in order to receive or |
||||
|
run a copy of the Program. Ancillary propagation of a covered work |
||||
|
occurring solely as a consequence of using peer-to-peer transmission |
||||
|
to receive a copy likewise does not require acceptance. However, |
||||
|
nothing other than this License grants you permission to propagate or |
||||
|
modify any covered work. These actions infringe copyright if you do |
||||
|
not accept this License. Therefore, by modifying or propagating a |
||||
|
covered work, you indicate your acceptance of this License to do so. |
||||
|
|
||||
|
10. Automatic Licensing of Downstream Recipients. |
||||
|
|
||||
|
Each time you convey a covered work, the recipient automatically |
||||
|
receives a license from the original licensors, to run, modify and |
||||
|
propagate that work, subject to this License. You are not responsible |
||||
|
for enforcing compliance by third parties with this License. |
||||
|
|
||||
|
An "entity transaction" is a transaction transferring control of an |
||||
|
organization, or substantially all assets of one, or subdividing an |
||||
|
organization, or merging organizations. If propagation of a covered |
||||
|
work results from an entity transaction, each party to that |
||||
|
transaction who receives a copy of the work also receives whatever |
||||
|
licenses to the work the party's predecessor in interest had or could |
||||
|
give under the previous paragraph, plus a right to possession of the |
||||
|
Corresponding Source of the work from the predecessor in interest, if |
||||
|
the predecessor has it or can get it with reasonable efforts. |
||||
|
|
||||
|
You may not impose any further restrictions on the exercise of the |
||||
|
rights granted or affirmed under this License. For example, you may |
||||
|
not impose a license fee, royalty, or other charge for exercise of |
||||
|
rights granted under this License, and you may not initiate litigation |
||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that |
||||
|
any patent claim is infringed by making, using, selling, offering for |
||||
|
sale, or importing the Program or any portion of it. |
||||
|
|
||||
|
11. Patents. |
||||
|
|
||||
|
A "contributor" is a copyright holder who authorizes use under this |
||||
|
License of the Program or a work on which the Program is based. The |
||||
|
work thus licensed is called the contributor's "contributor version". |
||||
|
|
||||
|
A contributor's "essential patent claims" are all patent claims |
||||
|
owned or controlled by the contributor, whether already acquired or |
||||
|
hereafter acquired, that would be infringed by some manner, permitted |
||||
|
by this License, of making, using, or selling its contributor version, |
||||
|
but do not include claims that would be infringed only as a |
||||
|
consequence of further modification of the contributor version. For |
||||
|
purposes of this definition, "control" includes the right to grant |
||||
|
patent sublicenses in a manner consistent with the requirements of |
||||
|
this License. |
||||
|
|
||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free |
||||
|
patent license under the contributor's essential patent claims, to |
||||
|
make, use, sell, offer for sale, import and otherwise run, modify and |
||||
|
propagate the contents of its contributor version. |
||||
|
|
||||
|
In the following three paragraphs, a "patent license" is any express |
||||
|
agreement or commitment, however denominated, not to enforce a patent |
||||
|
(such as an express permission to practice a patent or covenant not to |
||||
|
sue for patent infringement). To "grant" such a patent license to a |
||||
|
party means to make such an agreement or commitment not to enforce a |
||||
|
patent against the party. |
||||
|
|
||||
|
If you convey a covered work, knowingly relying on a patent license, |
||||
|
and the Corresponding Source of the work is not available for anyone |
||||
|
to copy, free of charge and under the terms of this License, through a |
||||
|
publicly available network server or other readily accessible means, |
||||
|
then you must either (1) cause the Corresponding Source to be so |
||||
|
available, or (2) arrange to deprive yourself of the benefit of the |
||||
|
patent license for this particular work, or (3) arrange, in a manner |
||||
|
consistent with the requirements of this License, to extend the patent |
||||
|
license to downstream recipients. "Knowingly relying" means you have |
||||
|
actual knowledge that, but for the patent license, your conveying the |
||||
|
covered work in a country, or your recipient's use of the covered work |
||||
|
in a country, would infringe one or more identifiable patents in that |
||||
|
country that you have reason to believe are valid. |
||||
|
|
||||
|
If, pursuant to or in connection with a single transaction or |
||||
|
arrangement, you convey, or propagate by procuring conveyance of, a |
||||
|
covered work, and grant a patent license to some of the parties |
||||
|
receiving the covered work authorizing them to use, propagate, modify |
||||
|
or convey a specific copy of the covered work, then the patent license |
||||
|
you grant is automatically extended to all recipients of the covered |
||||
|
work and works based on it. |
||||
|
|
||||
|
A patent license is "discriminatory" if it does not include within |
||||
|
the scope of its coverage, prohibits the exercise of, or is |
||||
|
conditioned on the non-exercise of one or more of the rights that are |
||||
|
specifically granted under this License. You may not convey a covered |
||||
|
work if you are a party to an arrangement with a third party that is |
||||
|
in the business of distributing software, under which you make payment |
||||
|
to the third party based on the extent of your activity of conveying |
||||
|
the work, and under which the third party grants, to any of the |
||||
|
parties who would receive the covered work from you, a discriminatory |
||||
|
patent license (a) in connection with copies of the covered work |
||||
|
conveyed by you (or copies made from those copies), or (b) primarily |
||||
|
for and in connection with specific products or compilations that |
||||
|
contain the covered work, unless you entered into that arrangement, |
||||
|
or that patent license was granted, prior to 28 March 2007. |
||||
|
|
||||
|
Nothing in this License shall be construed as excluding or limiting |
||||
|
any implied license or other defenses to infringement that may |
||||
|
otherwise be available to you under applicable patent law. |
||||
|
|
||||
|
12. No Surrender of Others' Freedom. |
||||
|
|
||||
|
If conditions are imposed on you (whether by court order, agreement or |
||||
|
otherwise) that contradict the conditions of this License, they do not |
||||
|
excuse you from the conditions of this License. If you cannot convey a |
||||
|
covered work so as to satisfy simultaneously your obligations under this |
||||
|
License and any other pertinent obligations, then as a consequence you may |
||||
|
not convey it at all. For example, if you agree to terms that obligate you |
||||
|
to collect a royalty for further conveying from those to whom you convey |
||||
|
the Program, the only way you could satisfy both those terms and this |
||||
|
License would be to refrain entirely from conveying the Program. |
||||
|
|
||||
|
13. Use with the GNU Affero General Public License. |
||||
|
|
||||
|
Notwithstanding any other provision of this License, you have |
||||
|
permission to link or combine any covered work with a work licensed |
||||
|
under version 3 of the GNU Affero General Public License into a single |
||||
|
combined work, and to convey the resulting work. The terms of this |
||||
|
License will continue to apply to the part which is the covered work, |
||||
|
but the special requirements of the GNU Affero General Public License, |
||||
|
section 13, concerning interaction through a network will apply to the |
||||
|
combination as such. |
||||
|
|
||||
|
14. Revised Versions of this License. |
||||
|
|
||||
|
The Free Software Foundation may publish revised and/or new versions of |
||||
|
the GNU General Public License from time to time. Such new versions will |
||||
|
be similar in spirit to the present version, but may differ in detail to |
||||
|
address new problems or concerns. |
||||
|
|
||||
|
Each version is given a distinguishing version number. If the |
||||
|
Program specifies that a certain numbered version of the GNU General |
||||
|
Public License "or any later version" applies to it, you have the |
||||
|
option of following the terms and conditions either of that numbered |
||||
|
version or of any later version published by the Free Software |
||||
|
Foundation. If the Program does not specify a version number of the |
||||
|
GNU General Public License, you may choose any version ever published |
||||
|
by the Free Software Foundation. |
||||
|
|
||||
|
If the Program specifies that a proxy can decide which future |
||||
|
versions of the GNU General Public License can be used, that proxy's |
||||
|
public statement of acceptance of a version permanently authorizes you |
||||
|
to choose that version for the Program. |
||||
|
|
||||
|
Later license versions may give you additional or different |
||||
|
permissions. However, no additional obligations are imposed on any |
||||
|
author or copyright holder as a result of your choosing to follow a |
||||
|
later version. |
||||
|
|
||||
|
15. Disclaimer of Warranty. |
||||
|
|
||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY |
||||
|
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, |
||||
|
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
||||
|
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM |
||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
||||
|
|
||||
|
16. Limitation of Liability. |
||||
|
|
||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
||||
|
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY |
||||
|
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE |
||||
|
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF |
||||
|
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD |
||||
|
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
||||
|
SUCH DAMAGES. |
||||
|
|
||||
|
17. Interpretation of Sections 15 and 16. |
||||
|
|
||||
|
If the disclaimer of warranty and limitation of liability provided |
||||
|
above cannot be given local legal effect according to their terms, |
||||
|
reviewing courts shall apply local law that most closely approximates |
||||
|
an absolute waiver of all civil liability in connection with the |
||||
|
Program, unless a warranty or assumption of liability accompanies a |
||||
|
copy of the Program in return for a fee. |
||||
|
|
||||
|
END OF TERMS AND CONDITIONS |
||||
|
|
||||
|
How to Apply These Terms to Your New Programs |
||||
|
|
||||
|
If you develop a new program, and you want it to be of the greatest |
||||
|
possible use to the public, the best way to achieve this is to make it |
||||
|
free software which everyone can redistribute and change under these terms. |
||||
|
|
||||
|
To do so, attach the following notices to the program. It is safest |
||||
|
to attach them to the start of each source file to most effectively |
||||
|
state the exclusion of warranty; and each file should have at least |
||||
|
the "copyright" line and a pointer to where the full notice is found. |
||||
|
|
||||
|
<one line to give the program's name and a brief idea of what it does.> |
||||
|
Copyright (C) <year> <name of author> |
||||
|
|
||||
|
This program is free software: you can redistribute it and/or modify |
||||
|
it under the terms of the GNU General Public License as published by |
||||
|
the Free Software Foundation, either version 3 of the License, or |
||||
|
(at your option) any later version. |
||||
|
|
||||
|
This program is distributed in the hope that it will be useful, |
||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
|
GNU General Public License for more details. |
||||
|
|
||||
|
You should have received a copy of the GNU General Public License |
||||
|
along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
Also add information on how to contact you by electronic and paper mail. |
||||
|
|
||||
|
If the program does terminal interaction, make it output a short |
||||
|
notice like this when it starts in an interactive mode: |
||||
|
|
||||
|
<program> Copyright (C) <year> <name of author> |
||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
||||
|
This is free software, and you are welcome to redistribute it |
||||
|
under certain conditions; type `show c' for details. |
||||
|
|
||||
|
The hypothetical commands `show w' and `show c' should show the appropriate |
||||
|
parts of the General Public License. Of course, your program's commands |
||||
|
might be different; for a GUI interface, you would use an "about box". |
||||
|
|
||||
|
You should also get your employer (if you work as a programmer) or school, |
||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary. |
||||
|
For more information on this, and how to apply and follow the GNU GPL, see |
||||
|
<http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
The GNU General Public License does not permit incorporating your program |
||||
|
into proprietary programs. If your program is a subroutine library, you |
||||
|
may consider it more useful to permit linking proprietary applications with |
||||
|
the library. If this is what you want to do, use the GNU Lesser General |
||||
|
Public License instead of this License. But first, please read |
||||
|
<http://www.gnu.org/philosophy/why-not-lgpl.html>. |
@ -0,0 +1,17 @@ |
|||||
|
gong.so: gong.c |
||||
|
gcc \
|
||||
|
-std=c99 \
|
||||
|
-pedantic \
|
||||
|
-Wall \
|
||||
|
-Wno-unused-variable \
|
||||
|
-s \
|
||||
|
gong.c \
|
||||
|
-Ilibretro-common/include/ \
|
||||
|
-shared \
|
||||
|
-fPIC \
|
||||
|
-Wl,--no-undefined \
|
||||
|
-lm \
|
||||
|
-o gong.so |
||||
|
|
||||
|
clean: |
||||
|
rm -f gong.so |
@ -0,0 +1,939 @@ |
|||||
|
/* RetroArch - A frontend for libretro.
|
||||
|
* Copyright (C) 2010-2014 - Hans-Kristian Arntzen |
||||
|
* Copyright (C) 2011-2017 - Daniel De Matteis |
||||
|
* Copyright (C) 2016-2019 - Brad Parker |
||||
|
* |
||||
|
* RetroArch is free software: you can redistribute it and/or modify it under the terms |
||||
|
* of the GNU General Public License as published by the Free Software Found- |
||||
|
* ation, either version 3 of the License, or (at your option) any later version. |
||||
|
* |
||||
|
* RetroArch is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; |
||||
|
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR |
||||
|
* PURPOSE. See the GNU General Public License for more details. |
||||
|
* |
||||
|
* You should have received a copy of the GNU General Public License along with RetroArch. |
||||
|
* If not, see <http://www.gnu.org/licenses/>.
|
||||
|
*/ |
||||
|
|
||||
|
/* Libretro port by Brad Parker,
|
||||
|
Original source code by Dan Zaidan: https://danzaidan.itch.io/
|
||||
|
Original license: |
||||
|
"You can do whatever you want with the code, but I am providing it as is without any warranty whatsoever." |
||||
|
*/ |
||||
|
|
||||
|
#include <stdlib.h> |
||||
|
#include <string.h> |
||||
|
#include <libretro.h> |
||||
|
#include <retro_math.h> |
||||
|
#include <retro_inline.h> |
||||
|
#include <retro_endianness.h> |
||||
|
|
||||
|
#ifdef RARCH_INTERNAL |
||||
|
#include "internal_cores.h" |
||||
|
#define GONG_CORE_PREFIX(s) libretro_gong_##s |
||||
|
#else |
||||
|
#define GONG_CORE_PREFIX(s) s |
||||
|
#endif |
||||
|
|
||||
|
#define WIDTH 356 |
||||
|
#define HEIGHT 200 |
||||
|
#define MAX_PLAYERS 2 |
||||
|
#define STATE_SIZE 4096 /* can be anything as long as it's large enough to hold everything */ |
||||
|
|
||||
|
static retro_log_printf_t GONG_CORE_PREFIX(log_cb); |
||||
|
static retro_video_refresh_t GONG_CORE_PREFIX(video_cb); |
||||
|
static retro_input_poll_t GONG_CORE_PREFIX(input_poll_cb); |
||||
|
static retro_input_state_t GONG_CORE_PREFIX(input_state_cb); |
||||
|
static retro_audio_sample_t GONG_CORE_PREFIX(audio_cb); |
||||
|
static retro_audio_sample_batch_t GONG_CORE_PREFIX(audio_batch_cb); |
||||
|
static retro_environment_t GONG_CORE_PREFIX(environ_cb); |
||||
|
|
||||
|
static const char *GONG_CORE_PREFIX(valid_extensions) = "gong"; |
||||
|
|
||||
|
static unsigned char *video_buf = NULL; |
||||
|
|
||||
|
enum |
||||
|
{ |
||||
|
B_MOVE_UP, |
||||
|
B_MOVE_DOWN, |
||||
|
B_SPEED_UP, |
||||
|
B_COUNT /* This should always be in the bottom */ |
||||
|
}; |
||||
|
|
||||
|
/* any changes here must be handled in serialization code too */ |
||||
|
typedef struct |
||||
|
{ |
||||
|
union { float f; unsigned u; } py; |
||||
|
union { float f; unsigned u; } dpy; |
||||
|
} Player; |
||||
|
|
||||
|
/* any changes here must be handled in serialization code too */ |
||||
|
typedef struct |
||||
|
{ |
||||
|
int half_transition_count; |
||||
|
bool ended_down; |
||||
|
} Game_Button_State; |
||||
|
|
||||
|
/* any changes here must be handled in serialization code too */ |
||||
|
typedef struct |
||||
|
{ |
||||
|
Game_Button_State buttons[B_COUNT]; |
||||
|
float last_dt; /* not in savestate */ |
||||
|
} Game_Input; |
||||
|
|
||||
|
typedef struct |
||||
|
{ |
||||
|
uint16_t input; |
||||
|
uint16_t not_input; |
||||
|
uint16_t realinput; |
||||
|
int16_t analogYLeft; |
||||
|
int16_t analogYRight; |
||||
|
} retro_inputs; |
||||
|
|
||||
|
/* any changes here must be handled in serialization code too */ |
||||
|
typedef struct |
||||
|
{ |
||||
|
unsigned version; |
||||
|
unsigned player1_score; |
||||
|
unsigned player2_score; |
||||
|
union { float f; unsigned u; } player2_speed; |
||||
|
union { float f; unsigned u; } ball_px; |
||||
|
union { float f; unsigned u; } ball_py; |
||||
|
union { float f; unsigned u; } ball_dpx; |
||||
|
union { float f; unsigned u; } ball_dpy; |
||||
|
union { float f; unsigned u; } ball_speed; |
||||
|
union { float f; unsigned u; } current_play_points; |
||||
|
float refresh; /* not in savestate */ |
||||
|
bool is_initialized; |
||||
|
bool player2_human; |
||||
|
uint16_t previnput[MAX_PLAYERS]; |
||||
|
Game_Input g_input[MAX_PLAYERS]; |
||||
|
Player player[MAX_PLAYERS]; |
||||
|
} State; |
||||
|
|
||||
|
typedef struct |
||||
|
{ |
||||
|
/* Pixels are always 32-bit wide, memory order XX BB GG RR */ |
||||
|
int width; |
||||
|
int height; |
||||
|
int pitch; |
||||
|
void *memory; |
||||
|
} Game_Offscreen_Buffer; |
||||
|
|
||||
|
static State *g_state = NULL; |
||||
|
static Game_Offscreen_Buffer game_buffer = {0}; |
||||
|
static void game_update_and_render(Game_Input *input, Game_Offscreen_Buffer *draw_buffer); |
||||
|
|
||||
|
static const struct retro_controller_description pads1[] = { |
||||
|
{ "Joypad", RETRO_DEVICE_JOYPAD }, |
||||
|
{ NULL, 0 }, |
||||
|
}; |
||||
|
|
||||
|
static const struct retro_controller_description pads2[] = { |
||||
|
{ "Joypad", RETRO_DEVICE_JOYPAD }, |
||||
|
{ NULL, 0 }, |
||||
|
}; |
||||
|
|
||||
|
static const struct retro_controller_info ports[] = { |
||||
|
{ pads1, 1 }, |
||||
|
{ pads2, 1 }, |
||||
|
{ 0 }, |
||||
|
}; |
||||
|
|
||||
|
struct retro_input_descriptor desc[] = { |
||||
|
{ 0, RETRO_DEVICE_JOYPAD, 0, RETRO_DEVICE_ID_JOYPAD_UP, "D-Pad Up" }, |
||||
|
{ 0, RETRO_DEVICE_JOYPAD, 0, RETRO_DEVICE_ID_JOYPAD_DOWN, "D-Pad Down" }, |
||||
|
{ 0, RETRO_DEVICE_ANALOG, RETRO_DEVICE_INDEX_ANALOG_LEFT, RETRO_DEVICE_ID_ANALOG_Y, "Left Analog Y" }, |
||||
|
{ 0, RETRO_DEVICE_ANALOG, RETRO_DEVICE_INDEX_ANALOG_RIGHT, RETRO_DEVICE_ID_ANALOG_Y, "Right Analog Y" }, |
||||
|
|
||||
|
{ 0 }, |
||||
|
}; |
||||
|
|
||||
|
static void check_variables(void) |
||||
|
{ |
||||
|
struct retro_variable var = {0}; |
||||
|
|
||||
|
var.key = "gong_refresh"; |
||||
|
if (GONG_CORE_PREFIX(environ_cb)(RETRO_ENVIRONMENT_GET_VARIABLE, &var) && var.value) |
||||
|
{ |
||||
|
int i; |
||||
|
g_state->refresh = atoi(var.value); |
||||
|
|
||||
|
for (i = 0; i < (int)(sizeof(g_state->g_input) / sizeof(g_state->g_input[0])); i++) |
||||
|
g_state->g_input[i].last_dt = 1.0f / g_state->refresh; |
||||
|
} |
||||
|
|
||||
|
var.key = "gong_player2"; |
||||
|
if (GONG_CORE_PREFIX(environ_cb)(RETRO_ENVIRONMENT_GET_VARIABLE, &var) && var.value) |
||||
|
{ |
||||
|
if (!strncmp(var.value, "CPU", 3)) |
||||
|
g_state->player2_human = false; |
||||
|
else if (!strncmp(var.value, "Human", 5)) |
||||
|
g_state->player2_human = true; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
static void save_state(void *data, size_t size) |
||||
|
{ |
||||
|
int i = 0; |
||||
|
int j = 0; |
||||
|
unsigned char *buf = (unsigned char*)data; |
||||
|
unsigned version = swap_if_little32(g_state->version); |
||||
|
unsigned player1_score = swap_if_little32(g_state->player1_score); |
||||
|
unsigned player2_score = swap_if_little32(g_state->player2_score); |
||||
|
unsigned player2_speed = swap_if_little32(g_state->player2_speed.u); |
||||
|
unsigned ball_px = swap_if_little32(g_state->ball_px.u); |
||||
|
unsigned ball_py = swap_if_little32(g_state->ball_py.u); |
||||
|
unsigned ball_dpx = swap_if_little32(g_state->ball_dpx.u); |
||||
|
unsigned ball_dpy = swap_if_little32(g_state->ball_dpy.u); |
||||
|
unsigned ball_speed = swap_if_little32(g_state->ball_speed.u); |
||||
|
unsigned current_play_points = swap_if_little32(g_state->current_play_points.u); |
||||
|
unsigned is_initialized = g_state->is_initialized; |
||||
|
unsigned player2_human = g_state->player2_human; |
||||
|
|
||||
|
(void)size; |
||||
|
|
||||
|
memcpy(buf, &version, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &player1_score, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &player2_score, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &player2_speed, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &ball_px, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &ball_py, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &ball_dpx, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &ball_dpy, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &ball_speed, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, ¤t_play_points, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &is_initialized, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
memcpy(buf, &player2_human, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
/* previnput */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
uint16_t previnput = swap_if_little16(g_state->previnput[i]); |
||||
|
memcpy(buf, &previnput, sizeof(uint16_t)); |
||||
|
buf += sizeof(uint16_t); |
||||
|
} |
||||
|
|
||||
|
/* g_input */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
for (j = 0; j < B_COUNT; j++) |
||||
|
{ |
||||
|
int half_transition_count = swap_if_little32(g_state->g_input[i].buttons[j].half_transition_count); |
||||
|
unsigned ended_down = g_state->g_input[i].buttons[j].ended_down; |
||||
|
|
||||
|
memcpy(buf, &half_transition_count, sizeof(int)); |
||||
|
buf += sizeof(int); |
||||
|
|
||||
|
memcpy(buf, &ended_down, sizeof(unsigned)); |
||||
|
buf += sizeof(unsigned); |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
/* player */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
unsigned py = swap_if_little32((unsigned)g_state->player[i].py.u); |
||||
|
|
||||
|
memcpy(buf, &py, sizeof(unsigned)); |
||||
|
buf += sizeof(uint16_t); |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
static void load_state(const void *data, size_t size) |
||||
|
{ |
||||
|
int i = 0; |
||||
|
int j = 0; |
||||
|
const unsigned char *buf = (const unsigned char*)data; |
||||
|
|
||||
|
(void)size; |
||||
|
|
||||
|
memset(g_state, 0, sizeof(*g_state)); |
||||
|
|
||||
|
g_state->version = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->player1_score = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->player2_score = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->player2_speed.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->ball_px.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->ball_py.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->ball_dpx.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->ball_dpy.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->ball_speed.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->current_play_points.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->is_initialized = (bool)swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->player2_human = (bool)swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
/* previnput */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
uint16_t previnput = swap_if_little16(*(uint16_t*)buf); |
||||
|
g_state->previnput[i] = previnput; |
||||
|
buf += sizeof(uint16_t); |
||||
|
} |
||||
|
|
||||
|
/* g_input */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
for (j = 0; j < B_COUNT; j++) |
||||
|
{ |
||||
|
int half_transition_count; |
||||
|
bool ended_down; |
||||
|
|
||||
|
half_transition_count = (int)swap_if_little32(*(unsigned*)buf); |
||||
|
|
||||
|
g_state->g_input[i].buttons[j].half_transition_count = half_transition_count; |
||||
|
buf += sizeof(int); |
||||
|
|
||||
|
ended_down = (bool)swap_if_little32(*(unsigned*)buf); |
||||
|
|
||||
|
g_state->g_input[i].buttons[j].ended_down = ended_down; |
||||
|
buf += sizeof(unsigned); |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
/* player */ |
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
g_state->player[i].py.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
|
||||
|
g_state->player[i].dpy.u = swap_if_little32(*(unsigned*)buf); |
||||
|
buf += sizeof(unsigned); |
||||
|
} |
||||
|
|
||||
|
check_variables(); |
||||
|
} |
||||
|
|
||||
|
static INLINE bool is_down(Game_Button_State state) |
||||
|
{ |
||||
|
return state.ended_down; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_get_system_info)(struct retro_system_info *info) |
||||
|
{ |
||||
|
info->library_name = "gong"; |
||||
|
info->library_version = "v1.0"; |
||||
|
info->need_fullpath = false; |
||||
|
info->block_extract = false; |
||||
|
info->valid_extensions = GONG_CORE_PREFIX(valid_extensions); |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_get_system_av_info)(struct retro_system_av_info *info) |
||||
|
{ |
||||
|
info->geometry.base_width = WIDTH; |
||||
|
info->geometry.base_height = HEIGHT; |
||||
|
info->geometry.max_width = WIDTH; |
||||
|
info->geometry.max_height = HEIGHT; |
||||
|
info->geometry.aspect_ratio = 16.0f / 9.0f; |
||||
|
info->timing.fps = g_state->refresh; |
||||
|
info->timing.sample_rate = 44100.0; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_init)(void) |
||||
|
{ |
||||
|
struct retro_log_callback log; |
||||
|
|
||||
|
g_state = (State*)calloc(1, sizeof(*g_state)); |
||||
|
|
||||
|
if (GONG_CORE_PREFIX(environ_cb)(RETRO_ENVIRONMENT_GET_LOG_INTERFACE, &log)) |
||||
|
GONG_CORE_PREFIX(log_cb) = log.log; |
||||
|
else |
||||
|
GONG_CORE_PREFIX(log_cb) = NULL; |
||||
|
|
||||
|
video_buf = (unsigned char*)calloc(1, WIDTH * HEIGHT * sizeof(unsigned)); |
||||
|
|
||||
|
game_buffer.width = WIDTH; |
||||
|
game_buffer.height = HEIGHT; |
||||
|
game_buffer.pitch = WIDTH * sizeof(unsigned); |
||||
|
game_buffer.memory = video_buf; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_deinit)(void) |
||||
|
{ |
||||
|
if (video_buf) |
||||
|
free(video_buf); |
||||
|
|
||||
|
video_buf = NULL; |
||||
|
game_buffer.memory = NULL; |
||||
|
|
||||
|
if (g_state) |
||||
|
free(g_state); |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_environment)(retro_environment_t cb) |
||||
|
{ |
||||
|
bool no_content = true; |
||||
|
|
||||
|
static const struct retro_variable vars[] = { |
||||
|
{ "gong_player2", "Player 2; CPU|Human" }, |
||||
|
{ "gong_refresh", "Video Refresh Rate (restart); 60|70|72|75|100|119|120|140|144" }, |
||||
|
{ NULL, NULL }, |
||||
|
}; |
||||
|
|
||||
|
GONG_CORE_PREFIX(environ_cb) = cb; |
||||
|
|
||||
|
cb(RETRO_ENVIRONMENT_SET_SUPPORT_NO_GAME, &no_content); |
||||
|
cb(RETRO_ENVIRONMENT_SET_VARIABLES, (void*)vars); |
||||
|
cb(RETRO_ENVIRONMENT_SET_CONTROLLER_INFO, (void*)ports); |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_video_refresh)(retro_video_refresh_t cb) |
||||
|
{ |
||||
|
GONG_CORE_PREFIX(video_cb) = cb; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_audio_sample)(retro_audio_sample_t cb) |
||||
|
{ |
||||
|
GONG_CORE_PREFIX(audio_cb) = cb; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_audio_sample_batch)(retro_audio_sample_batch_t cb) |
||||
|
{ |
||||
|
GONG_CORE_PREFIX(audio_batch_cb) = cb; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_input_poll)(retro_input_poll_t cb) |
||||
|
{ |
||||
|
GONG_CORE_PREFIX(input_poll_cb) = cb; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_input_state)(retro_input_state_t cb) |
||||
|
{ |
||||
|
GONG_CORE_PREFIX(input_state_cb) = cb; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_set_controller_port_device)(unsigned a, unsigned b) |
||||
|
{ |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_reset)(void) |
||||
|
{ |
||||
|
memset(g_state, 0, sizeof(*g_state)); |
||||
|
check_variables(); |
||||
|
} |
||||
|
|
||||
|
size_t GONG_CORE_PREFIX(retro_serialize_size)(void) |
||||
|
{ |
||||
|
return STATE_SIZE; |
||||
|
} |
||||
|
|
||||
|
bool GONG_CORE_PREFIX(retro_serialize)(void *data, size_t size) |
||||
|
{ |
||||
|
if (size != STATE_SIZE) |
||||
|
return false; |
||||
|
|
||||
|
save_state(data, size); |
||||
|
return true; |
||||
|
} |
||||
|
|
||||
|
bool GONG_CORE_PREFIX(retro_unserialize)(const void *data, size_t size) |
||||
|
{ |
||||
|
if (size != STATE_SIZE) |
||||
|
return false; |
||||
|
|
||||
|
load_state(data, size); |
||||
|
return true; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_cheat_reset)(void) |
||||
|
{ |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_cheat_set)(unsigned a, bool b, const char * c) |
||||
|
{ |
||||
|
} |
||||
|
|
||||
|
bool GONG_CORE_PREFIX(retro_load_game)(const struct retro_game_info *info) |
||||
|
{ |
||||
|
enum retro_pixel_format fmt = RETRO_PIXEL_FORMAT_XRGB8888; |
||||
|
|
||||
|
check_variables(); |
||||
|
|
||||
|
if (!GONG_CORE_PREFIX(environ_cb)(RETRO_ENVIRONMENT_SET_PIXEL_FORMAT, &fmt)) |
||||
|
{ |
||||
|
if (GONG_CORE_PREFIX(log_cb)) |
||||
|
GONG_CORE_PREFIX(log_cb)(RETRO_LOG_INFO, "XRGB8888 is not supported.\n"); |
||||
|
return false; |
||||
|
} |
||||
|
|
||||
|
return true; |
||||
|
} |
||||
|
|
||||
|
bool GONG_CORE_PREFIX(retro_load_game_special)(unsigned a, const struct retro_game_info *b, size_t c) |
||||
|
{ |
||||
|
return false; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_unload_game)(void) |
||||
|
{ |
||||
|
} |
||||
|
|
||||
|
unsigned GONG_CORE_PREFIX(retro_get_region)(void) |
||||
|
{ |
||||
|
return RETRO_REGION_NTSC; |
||||
|
} |
||||
|
|
||||
|
void* GONG_CORE_PREFIX(retro_get_memory_data)(unsigned id) |
||||
|
{ |
||||
|
return NULL; |
||||
|
} |
||||
|
|
||||
|
size_t GONG_CORE_PREFIX(retro_get_memory_size)(unsigned id) |
||||
|
{ |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static void process_joypad(Game_Button_State *new_state, bool is_down) |
||||
|
{ |
||||
|
if (new_state->ended_down != is_down) |
||||
|
{ |
||||
|
new_state->ended_down = is_down; |
||||
|
new_state->half_transition_count += 1; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
static bool is_key_up_or_down(int16_t input, int16_t not_input, int key) |
||||
|
{ |
||||
|
if (input & (1 << key) || not_input & (1 << key)) |
||||
|
return true; |
||||
|
|
||||
|
return false; |
||||
|
} |
||||
|
|
||||
|
void GONG_CORE_PREFIX(retro_run)(void) |
||||
|
{ |
||||
|
int i = 0; |
||||
|
int port = 0; |
||||
|
bool updated = false; |
||||
|
retro_inputs inputs[MAX_PLAYERS] = {{0}}; |
||||
|
|
||||
|
if (GONG_CORE_PREFIX(environ_cb)(RETRO_ENVIRONMENT_GET_VARIABLE_UPDATE, &updated) && updated) |
||||
|
check_variables(); |
||||
|
|
||||
|
GONG_CORE_PREFIX(input_poll_cb)(); |
||||
|
|
||||
|
for (port = 0; port < MAX_PLAYERS; port++) |
||||
|
{ |
||||
|
for (i = 0; i < 16; i++) |
||||
|
{ |
||||
|
if (GONG_CORE_PREFIX(input_state_cb)(port, RETRO_DEVICE_JOYPAD, 0, i)) |
||||
|
{ |
||||
|
inputs[port].realinput |= 1 << i; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
inputs[port].analogYLeft = GONG_CORE_PREFIX(input_state_cb)(port, RETRO_DEVICE_ANALOG, RETRO_DEVICE_INDEX_ANALOG_LEFT, RETRO_DEVICE_ID_ANALOG_Y) / 5000.0f; |
||||
|
inputs[port].analogYRight = GONG_CORE_PREFIX(input_state_cb)(port, RETRO_DEVICE_ANALOG, RETRO_DEVICE_INDEX_ANALOG_RIGHT, RETRO_DEVICE_ID_ANALOG_Y) / 5000.0f; |
||||
|
|
||||
|
if (inputs[port].analogYLeft > 0) |
||||
|
inputs[port].realinput |= (1 << RETRO_DEVICE_ID_JOYPAD_DOWN); |
||||
|
else if (inputs[port].analogYRight > 0) |
||||
|
inputs[port].realinput |= (1 << RETRO_DEVICE_ID_JOYPAD_DOWN); |
||||
|
|
||||
|
if (inputs[port].analogYLeft < 0) |
||||
|
inputs[port].realinput |= (1 << RETRO_DEVICE_ID_JOYPAD_UP); |
||||
|
else if (inputs[port].analogYRight < 0) |
||||
|
inputs[port].realinput |= (1 << RETRO_DEVICE_ID_JOYPAD_UP); |
||||
|
|
||||
|
inputs[port].input = inputs[port].realinput & ~g_state->previnput[port]; |
||||
|
inputs[port].not_input = g_state->previnput[port] & ~inputs[port].realinput; |
||||
|
|
||||
|
if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_UP)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_MOVE_UP], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_UP)); |
||||
|
else if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_DOWN)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_MOVE_DOWN], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_DOWN)); |
||||
|
else if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_DOWN)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_MOVE_DOWN], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_DOWN)); |
||||
|
|
||||
|
if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_A)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_SPEED_UP], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_A)); |
||||
|
else if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_B)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_SPEED_UP], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_B)); |
||||
|
else if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_X)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_SPEED_UP], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_X)); |
||||
|
else if (is_key_up_or_down(inputs[port].input, inputs[port].not_input, RETRO_DEVICE_ID_JOYPAD_Y)) |
||||
|
process_joypad(&g_state->g_input[port].buttons[B_SPEED_UP], inputs[port].realinput & (1 << RETRO_DEVICE_ID_JOYPAD_Y)); |
||||
|
|
||||
|
g_state->previnput[port] = inputs[port].realinput; |
||||
|
} |
||||
|
|
||||
|
game_update_and_render(g_state->g_input, &game_buffer); |
||||
|
|
||||
|
GONG_CORE_PREFIX(video_cb)(video_buf, WIDTH, HEIGHT, WIDTH * sizeof(uint32_t)); |
||||
|
} |
||||
|
|
||||
|
unsigned GONG_CORE_PREFIX(retro_api_version)(void) |
||||
|
{ |
||||
|
return RETRO_API_VERSION; |
||||
|
} |
||||
|
|
||||
|
static void draw_rect_in_pixels(Game_Offscreen_Buffer *buffer, unsigned color, int min_x, int min_y, int max_x, int max_y) |
||||
|
{ |
||||
|
int y; |
||||
|
|
||||
|
min_x = MAX(min_x, 0); |
||||
|
min_y = MAX(min_y, 0); |
||||
|
max_x = MIN(max_x, buffer->width); |
||||
|
max_y = MIN(max_y, buffer->height); |
||||
|
|
||||
|
for (y = min_y; y < max_y; y++) |
||||
|
{ |
||||
|
int x; |
||||
|
|
||||
|
for (x = min_x; x < max_x; x++) |
||||
|
{ |
||||
|
unsigned *pixel = (unsigned*)((unsigned char*)buffer->memory + ((buffer->width * (buffer->height - y - 1) + x) * sizeof(unsigned))); |
||||
|
|
||||
|
*pixel++ = color; |
||||
|
} |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
static void clear(Game_Offscreen_Buffer *buffer, unsigned color) |
||||
|
{ |
||||
|
draw_rect_in_pixels(buffer, color, 0, 0, buffer->width, buffer->height); |
||||
|
} |
||||
|
|
||||
|
static void draw_rect(Game_Offscreen_Buffer *buffer, unsigned color, float x, float y, float half_size_x, float half_size_y) |
||||
|
{ |
||||
|
/* @Hardcoded to always keep the playing field area on screen, no matter the aspect ratio */ |
||||
|
float scale = .01f; |
||||
|
float relative_axis = (float)buffer->height; |
||||
|
int min_x, min_y, max_x, max_y; |
||||
|
|
||||
|
if ((float)buffer->width / (float)buffer->height < 1.77f) |
||||
|
{ |
||||
|
relative_axis = (float)buffer->width; |
||||
|
scale = .0056f; |
||||
|
} |
||||
|
|
||||
|
half_size_x *= relative_axis * scale; |
||||
|
half_size_y *= relative_axis * scale; |
||||
|
x *= relative_axis * scale; |
||||
|
y *= relative_axis * scale; |
||||
|
|
||||
|
x = x + buffer->width / 2; |
||||
|
y = y + buffer->height / 2; |
||||
|
|
||||
|
min_x = (unsigned)(x - half_size_x); |
||||
|
min_y = (unsigned)(y - half_size_y); |
||||
|
max_x = (unsigned)(x + half_size_x); |
||||
|
max_y = (unsigned)(y + half_size_y); |
||||
|
|
||||
|
draw_rect_in_pixels(buffer, color, min_x, min_y, max_x, max_y); |
||||
|
} |
||||
|
|
||||
|
static void draw_number(Game_Offscreen_Buffer *buffer, unsigned number, unsigned color, float x, float y) |
||||
|
{ |
||||
|
float at_x = x; |
||||
|
|
||||
|
do { |
||||
|
unsigned alg = number % 10; |
||||
|
|
||||
|
number /= 10; |
||||
|
|
||||
|
switch (alg) |
||||
|
{ |
||||
|
case 0: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x - 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
} |
||||
|
|
||||
|
case 1: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.5f); |
||||
|
break; |
||||
|
} |
||||
|
|
||||
|
case 2: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x - 2.f, y - 2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x + 2.f, y + 2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
} |
||||
|
|
||||
|
case 3: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 4: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.5f); |
||||
|
draw_rect(buffer, color, at_x - 2.f, y+2.5f, .5f, 2.f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 5: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x + 2.f, y-2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x - 2.f, y+2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 6: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x + 2.f, y-2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x - 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 7: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.5f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 8: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x - 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
case 9: |
||||
|
{ |
||||
|
draw_rect(buffer, color, at_x - 2.f, y + 2.f, .5f, 2.f); |
||||
|
draw_rect(buffer, color, at_x + 2.f, y, .5f, 4.f); |
||||
|
draw_rect(buffer, color, at_x, y + 4.f, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y, 2.5f, .5f); |
||||
|
draw_rect(buffer, color, at_x, y - 4.f, 2.5f, .5f); |
||||
|
break; |
||||
|
}; |
||||
|
|
||||
|
default: |
||||
|
break; |
||||
|
} |
||||
|
|
||||
|
at_x -= 7.f; |
||||
|
} while(number > 0); |
||||
|
} |
||||
|
|
||||
|
static void game_update_and_render(Game_Input *input, Game_Offscreen_Buffer *draw_buffer) |
||||
|
{ |
||||
|
const float initial_ball_speed = 80.f; |
||||
|
float playing_field_x = 85.f; |
||||
|
float playing_field_y = 48.f; |
||||
|
float player_size_x = 2.5f; |
||||
|
float player_size_y = 10.f; |
||||
|
int i; |
||||
|
|
||||
|
if (!g_state->is_initialized) |
||||
|
{ |
||||
|
g_state->is_initialized = 1; |
||||
|
g_state->ball_px.f = 0; |
||||
|
g_state->ball_py.f = 0; |
||||
|
g_state->ball_dpx.f = initial_ball_speed; |
||||
|
g_state->ball_dpy.f = 0; |
||||
|
g_state->current_play_points.f = 10.f; |
||||
|
g_state->player2_speed.f = 80.f; |
||||
|
} |
||||
|
|
||||
|
for (i = 0; i < MAX_PLAYERS; i++) |
||||
|
{ |
||||
|
float speed = 80.f; |
||||
|
|
||||
|
if (i == 1 && !g_state->player2_human) |
||||
|
break; |
||||
|
|
||||
|
g_state->player[i].dpy.f = 0.f; |
||||
|
|
||||
|
if (is_down(input[i].buttons[B_SPEED_UP])) |
||||
|
speed = 150.f; |
||||
|
|
||||
|
if (is_down(input[i].buttons[B_MOVE_UP])) |
||||
|
{ |
||||
|
if (g_state->player[i].py.f < playing_field_y - player_size_y) |
||||
|
{ |
||||
|
g_state->player[i].dpy.f = speed; |
||||
|
} |
||||
|
|
||||
|
if (g_state->player[i].py.f < -playing_field_y + player_size_y) |
||||
|
{ |
||||
|
g_state->player[i].py.f = -playing_field_y + player_size_y; |
||||
|
g_state->player[i].dpy.f = 0.f; |
||||
|
} |
||||
|
} |
||||
|
if (is_down(input[i].buttons[B_MOVE_DOWN])) |
||||
|
{ |
||||
|
if (g_state->player[i].py.f > -playing_field_y + player_size_y) |
||||
|
{ |
||||
|
g_state->player[i].dpy.f = -speed; |
||||
|
} |
||||
|
|
||||
|
if (g_state->player[i].py.f < -playing_field_y + player_size_y) |
||||
|
{ |
||||
|
g_state->player[i].py.f = -playing_field_y + player_size_y; |
||||
|
g_state->player[i].dpy.f = 0.f; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
g_state->player[i].py.f += g_state->player[i].dpy.f * input->last_dt; |
||||
|
} |
||||
|
|
||||
|
if (!g_state->player2_human) |
||||
|
{ |
||||
|
g_state->player[1].dpy.f = (g_state->ball_py.f - g_state->player[1].py.f) * 100.f; |
||||
|
g_state->player[1].dpy.f = MIN(g_state->player[1].dpy.f, g_state->player2_speed.f); |
||||
|
g_state->player[1].dpy.f = MAX(g_state->player[1].dpy.f, -g_state->player2_speed.f); |
||||
|
g_state->player[1].py.f += g_state->player[1].dpy.f * input->last_dt; |
||||
|
|
||||
|
if (g_state->player[1].py.f < -playing_field_y + player_size_y) |
||||
|
{ |
||||
|
g_state->player[1].py.f = -playing_field_y + player_size_y; |
||||
|
g_state->player[1].dpy.f = 0.f; |
||||
|
} |
||||
|
|
||||
|
if (g_state->player[1].py.f > playing_field_y - player_size_y) |
||||
|
{ |
||||
|
g_state->player[1].py.f = playing_field_y - player_size_y; |
||||
|
g_state->player[1].dpy.f = 0.f; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
g_state->ball_px.f += g_state->ball_dpx.f * input->last_dt; |
||||
|
|
||||
|
if (g_state->ball_dpx.f > 0) |
||||
|
{ |
||||
|
g_state->ball_dpx.f += 10.f * input->last_dt; |
||||
|
} |
||||
|
else |
||||
|
{ |
||||
|
g_state->ball_dpx.f -= 10.f * input->last_dt; |
||||
|
} |
||||
|
|
||||
|
g_state->ball_py.f += g_state->ball_dpy.f * input->last_dt; |
||||
|
|
||||
|
if (g_state->ball_py.f > playing_field_y - 1.f) |
||||
|
{ |
||||
|
g_state->ball_py.f = playing_field_y - 1.f; |
||||
|
g_state->ball_dpy.f *= -1.f; |
||||
|
} |
||||
|
else if (g_state->ball_py.f < -playing_field_y + 1) |
||||
|
{ |
||||
|
g_state->ball_py.f = -playing_field_y + 1.f; |
||||
|
g_state->ball_dpy.f *= -1; |
||||
|
} |
||||
|
|
||||
|
if (g_state->ball_px.f > 80.f - 2.5f - 1.f) /* @Hardcoded */ |
||||
|
{ |
||||
|
if ((g_state->ball_py.f >= (g_state->player[1].py.f - 10.f)) && (g_state->ball_py.f <= (g_state->player[1].py.f + 10.f))) |
||||
|
{ |
||||
|
g_state->ball_dpx.f *= -1.f; |
||||
|
g_state->ball_px.f = 80.f - 2.5f - 1.f; /* @Hardcoded */ |
||||
|
g_state->ball_dpy.f = (g_state->ball_py.f - g_state->player[1].py.f) + g_state->player[1].dpy.f; |
||||
|
++g_state->current_play_points.f; |
||||
|
} |
||||
|
else if (g_state->ball_px.f >= playing_field_x - 1) |
||||
|
{ |
||||
|
g_state->ball_px.f = 0; |
||||
|
g_state->ball_py.f = 0; |
||||
|
g_state->ball_dpy.f = 0; |
||||
|
g_state->ball_dpx.f = -initial_ball_speed; |
||||
|
g_state->player2_score += (unsigned)g_state->current_play_points.f; |
||||
|
g_state->current_play_points.f = 10.f; |
||||
|
} |
||||
|
} |
||||
|
else if (g_state->ball_px.f < -80 + 2.5f + 1.f) /* @Hardcoded */ |
||||
|
{ |
||||
|
if ((g_state->ball_py.f >= (g_state->player[0].py.f - 10.f)) && (g_state->ball_py.f <= (g_state->player[0].py.f + 10.f))) |
||||
|
{ |
||||
|
g_state->ball_dpx.f *= -1.f; |
||||
|
g_state->ball_px.f = -80 + 2.5f + 1.f; /* @Hardcoded */ |
||||
|
g_state->ball_dpy.f = (g_state->ball_py.f - g_state->player[0].py.f) + g_state->player[0].dpy.f; |
||||
|
++g_state->current_play_points.f; |
||||
|
} |
||||
|
else if (g_state->ball_px.f <= -playing_field_x + 1) |
||||
|
{ |
||||
|
g_state->ball_px.f = 0; |
||||
|
g_state->ball_py.f = 0; |
||||
|
g_state->ball_dpy.f = 0; |
||||
|
g_state->ball_dpx.f = initial_ball_speed; |
||||
|
g_state->player1_score += (unsigned)g_state->current_play_points.f; |
||||
|
g_state->current_play_points.f = 10.f; |
||||
|
|
||||
|
if (!g_state->player2_human) |
||||
|
g_state->player2_speed.f += g_state->current_play_points.f * 0.01f; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
clear(draw_buffer, 0x021077); |
||||
|
draw_rect(draw_buffer, 0x000530, 0.f, 0.f, playing_field_x, playing_field_y); |
||||
|
|
||||
|
draw_rect(draw_buffer, 0x00ffff, -80.f, g_state->player[0].py.f, player_size_x, player_size_y); |
||||
|
draw_rect(draw_buffer, 0x00ffff, 80.f, g_state->player[1].py.f, player_size_x, player_size_y); |
||||
|
|
||||
|
draw_rect(draw_buffer, 0xffff00, g_state->ball_px.f, g_state->ball_py.f, 1.f, 1.f); |
||||
|
|
||||
|
draw_number(draw_buffer, (unsigned)g_state->current_play_points.f, 0xaaaaaa, 0.f, 38.f); |
||||
|
draw_number(draw_buffer, g_state->player1_score, 0xff6611, 20.f, 38.f); |
||||
|
draw_number(draw_buffer, g_state->player2_score, 0xff6611, -20.f, 38.f); |
||||
|
} |
File diff suppressed because it is too large
@ -0,0 +1,579 @@ |
|||||
|
/* Copyright (C) 2010-2020 The RetroArch team
|
||||
|
* |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* The following license statement only applies to this file (retro_endianness.h). |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* |
||||
|
* Permission is hereby granted, free of charge, |
||||
|
* to any person obtaining a copy of this software and associated documentation files (the "Software"), |
||||
|
* to deal in the Software without restriction, including without limitation the rights to |
||||
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, |
||||
|
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions: |
||||
|
* |
||||
|
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. |
||||
|
* |
||||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, |
||||
|
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
||||
|
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |
||||
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||||
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
||||
|
*/ |
||||
|
|
||||
|
#ifndef __LIBRETRO_SDK_ENDIANNESS_H |
||||
|
#define __LIBRETRO_SDK_ENDIANNESS_H |
||||
|
|
||||
|
#include <retro_inline.h> |
||||
|
#include <stdint.h> |
||||
|
#include <stdlib.h> |
||||
|
|
||||
|
#if defined(_MSC_VER) && _MSC_VER > 1200 |
||||
|
#define SWAP16 _byteswap_ushort |
||||
|
#define SWAP32 _byteswap_ulong |
||||
|
#else |
||||
|
static INLINE uint16_t SWAP16(uint16_t x) |
||||
|
{ |
||||
|
return ((x & 0x00ff) << 8) | |
||||
|
((x & 0xff00) >> 8); |
||||
|
} |
||||
|
|
||||
|
static INLINE uint32_t SWAP32(uint32_t x) |
||||
|
{ |
||||
|
return ((x & 0x000000ff) << 24) | |
||||
|
((x & 0x0000ff00) << 8) | |
||||
|
((x & 0x00ff0000) >> 8) | |
||||
|
((x & 0xff000000) >> 24); |
||||
|
} |
||||
|
|
||||
|
#endif |
||||
|
|
||||
|
#if defined(_MSC_VER) && _MSC_VER <= 1200 |
||||
|
static INLINE uint64_t SWAP64(uint64_t val) |
||||
|
{ |
||||
|
return |
||||
|
((val & 0x00000000000000ff) << 56) |
||||
|
| ((val & 0x000000000000ff00) << 40) |
||||
|
| ((val & 0x0000000000ff0000) << 24) |
||||
|
| ((val & 0x00000000ff000000) << 8) |
||||
|
| ((val & 0x000000ff00000000) >> 8) |
||||
|
| ((val & 0x0000ff0000000000) >> 24) |
||||
|
| ((val & 0x00ff000000000000) >> 40) |
||||
|
| ((val & 0xff00000000000000) >> 56); |
||||
|
} |
||||
|
#else |
||||
|
static INLINE uint64_t SWAP64(uint64_t val) |
||||
|
{ |
||||
|
return ((val & 0x00000000000000ffULL) << 56) |
||||
|
| ((val & 0x000000000000ff00ULL) << 40) |
||||
|
| ((val & 0x0000000000ff0000ULL) << 24) |
||||
|
| ((val & 0x00000000ff000000ULL) << 8) |
||||
|
| ((val & 0x000000ff00000000ULL) >> 8) |
||||
|
| ((val & 0x0000ff0000000000ULL) >> 24) |
||||
|
| ((val & 0x00ff000000000000ULL) >> 40) |
||||
|
| ((val & 0xff00000000000000ULL) >> 56); |
||||
|
} |
||||
|
#endif |
||||
|
|
||||
|
|
||||
|
#if defined (LSB_FIRST) || defined (MSB_FIRST) |
||||
|
# warning Defining MSB_FIRST and LSB_FIRST in compile options is deprecated |
||||
|
# undef LSB_FIRST |
||||
|
# undef MSB_FIRST |
||||
|
#endif |
||||
|
|
||||
|
#ifdef _MSC_VER |
||||
|
/* MSVC pre-defines macros depending on target arch */ |
||||
|
#if defined (_M_IX86) || defined (_M_AMD64) || defined (_M_ARM) || defined (_M_ARM64) |
||||
|
#define LSB_FIRST 1 |
||||
|
#elif _M_PPC |
||||
|
#define MSB_FIRST 1 |
||||
|
#else |
||||
|
/* MSVC can run on _M_ALPHA and _M_IA64 too, but they're both bi-endian; need to find what mode MSVC runs them at */ |
||||
|
#error "unknown platform, can't determine endianness" |
||||
|
#endif |
||||
|
#else |
||||
|
#if __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__ |
||||
|
#define MSB_FIRST 1 |
||||
|
#elif __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ |
||||
|
#define LSB_FIRST 1 |
||||
|
#else |
||||
|
#error "Invalid endianness macros" |
||||
|
#endif |
||||
|
#endif |
||||
|
|
||||
|
#if defined(MSB_FIRST) && defined(LSB_FIRST) |
||||
|
# error "Bug in LSB_FIRST/MSB_FIRST definition" |
||||
|
#endif |
||||
|
|
||||
|
#if !defined(MSB_FIRST) && !defined(LSB_FIRST) |
||||
|
# error "Bug in LSB_FIRST/MSB_FIRST definition" |
||||
|
#endif |
||||
|
|
||||
|
#ifdef MSB_FIRST |
||||
|
# define RETRO_IS_BIG_ENDIAN 1 |
||||
|
# define RETRO_IS_LITTLE_ENDIAN 0 |
||||
|
/* For compatibility */ |
||||
|
# define WORDS_BIGENDIAN 1 |
||||
|
#else |
||||
|
# define RETRO_IS_BIG_ENDIAN 0 |
||||
|
# define RETRO_IS_LITTLE_ENDIAN 1 |
||||
|
/* For compatibility */ |
||||
|
# undef WORDS_BIGENDIAN |
||||
|
#endif |
||||
|
|
||||
|
|
||||
|
/**
|
||||
|
* is_little_endian: |
||||
|
* |
||||
|
* Checks if the system is little endian or big-endian. |
||||
|
* |
||||
|
* Returns: greater than 0 if little-endian, |
||||
|
* otherwise big-endian. |
||||
|
**/ |
||||
|
#define is_little_endian() RETRO_IS_LITTLE_ENDIAN |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_big64: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 64-bit value if system is big-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is big-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_big64(val) (SWAP64(val)) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_big64(val) (val) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_big32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 32-bit value if system is big-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is big-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_big32(val) (SWAP32(val)) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_big32(val) (val) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_little64: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 64-bit value if system is little-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is little-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_little64(val) (val) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_little64(val) (SWAP64(val)) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_little32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 32-bit value if system is little-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is little-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_little32(val) (val) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_little32(val) (SWAP32(val)) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_big16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 16-bit value if system is big-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is big-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_big16(val) (SWAP16(val)) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_big16(val) (val) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* swap_if_little16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Byteswap unsigned 16-bit value if system is little-endian. |
||||
|
* |
||||
|
* Returns: Byteswapped value in case system is little-endian, |
||||
|
* otherwise returns same value. |
||||
|
**/ |
||||
|
|
||||
|
#if RETRO_IS_BIG_ENDIAN |
||||
|
#define swap_if_little16(val) (val) |
||||
|
#elif RETRO_IS_LITTLE_ENDIAN |
||||
|
#define swap_if_little16(val) (SWAP16(val)) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* store32be: |
||||
|
* @addr : pointer to unsigned 32-bit buffer |
||||
|
* @data : unsigned 32-bit value to write |
||||
|
* |
||||
|
* Write data to address. Endian-safe. Byteswaps the data |
||||
|
* first if necessary before storing it. |
||||
|
**/ |
||||
|
static INLINE void store32be(uint32_t *addr, uint32_t data) |
||||
|
{ |
||||
|
*addr = swap_if_little32(data); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* load32be: |
||||
|
* @addr : pointer to unsigned 32-bit buffer |
||||
|
* |
||||
|
* Load value from address. Endian-safe. |
||||
|
* |
||||
|
* Returns: value from address, byte-swapped if necessary. |
||||
|
**/ |
||||
|
static INLINE uint32_t load32be(const uint32_t *addr) |
||||
|
{ |
||||
|
return swap_if_little32(*addr); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_le16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned 16-bit value from system to little-endian. |
||||
|
* |
||||
|
* Returns: Little-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_le16(val) swap_if_big16(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_le32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned 32-bit value from system to little-endian. |
||||
|
* |
||||
|
* Returns: Little-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_le32(val) swap_if_big32(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_le64: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned 64-bit value from system to little-endian. |
||||
|
* |
||||
|
* Returns: Little-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_le64(val) swap_if_big64(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_le_to_cpu16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned 16-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_le_to_cpu16(val) swap_if_big16(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_le_to_cpu32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned 32-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_le_to_cpu32(val) swap_if_big32(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_le_to_cpu16: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned 64-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_le_to_cpu64(val) swap_if_big64(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_be16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned 16-bit value from system to big-endian. |
||||
|
* |
||||
|
* Returns: Big-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_be16(val) swap_if_little16(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_be32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned 32-bit value from system to big-endian. |
||||
|
* |
||||
|
* Returns: Big-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_be32(val) swap_if_little32(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_cpu_to_be64: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned 64-bit value from system to big-endian. |
||||
|
* |
||||
|
* Returns: Big-endian representation of val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_cpu_to_be64(val) swap_if_little64(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_be_to_cpu16: |
||||
|
* @val : unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned 16-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_be_to_cpu16(val) swap_if_little16(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_be_to_cpu32: |
||||
|
* @val : unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned 32-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_be_to_cpu32(val) swap_if_little32(val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_be_to_cpu64: |
||||
|
* @val : unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned 64-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
#define retro_be_to_cpu64(val) swap_if_little64(val) |
||||
|
|
||||
|
#ifdef __GNUC__ |
||||
|
/* This attribute means that the same memory may be referred through
|
||||
|
pointers to different size of the object (aliasing). E.g. that u8 * |
||||
|
and u32 * may actually be pointing to the same object. */ |
||||
|
#define MAY_ALIAS __attribute__((__may_alias__)) |
||||
|
#else |
||||
|
#define MAY_ALIAS |
||||
|
#endif |
||||
|
|
||||
|
#pragma pack(push, 1) |
||||
|
struct retro_unaligned_uint16_s |
||||
|
{ |
||||
|
uint16_t val; |
||||
|
} MAY_ALIAS; |
||||
|
struct retro_unaligned_uint32_s |
||||
|
{ |
||||
|
uint32_t val; |
||||
|
} MAY_ALIAS; |
||||
|
struct retro_unaligned_uint64_s |
||||
|
{ |
||||
|
uint64_t val; |
||||
|
} MAY_ALIAS; |
||||
|
#pragma pack(pop) |
||||
|
|
||||
|
typedef struct retro_unaligned_uint16_s retro_unaligned_uint16_t; |
||||
|
typedef struct retro_unaligned_uint32_s retro_unaligned_uint32_t; |
||||
|
typedef struct retro_unaligned_uint64_s retro_unaligned_uint64_t; |
||||
|
|
||||
|
/* L-value references to unaligned pointers. */ |
||||
|
#define retro_unaligned16(p) (((retro_unaligned_uint16_t *)p)->val) |
||||
|
#define retro_unaligned32(p) (((retro_unaligned_uint32_t *)p)->val) |
||||
|
#define retro_unaligned64(p) (((retro_unaligned_uint64_t *)p)->val) |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_16be: |
||||
|
* @addr : pointer to unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 16-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint16_t retro_get_unaligned_16be(void *addr) { |
||||
|
return retro_be_to_cpu16(retro_unaligned16(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_32be: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 32-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint32_t retro_get_unaligned_32be(void *addr) { |
||||
|
return retro_be_to_cpu32(retro_unaligned32(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_64be: |
||||
|
* @addr : pointer to unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 64-bit value from big-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of big-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint64_t retro_get_unaligned_64be(void *addr) { |
||||
|
return retro_be_to_cpu64(retro_unaligned64(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_16le: |
||||
|
* @addr : pointer to unsigned 16-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 16-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint16_t retro_get_unaligned_16le(void *addr) { |
||||
|
return retro_le_to_cpu16(retro_unaligned16(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_32le: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 32-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint32_t retro_get_unaligned_32le(void *addr) { |
||||
|
return retro_le_to_cpu32(retro_unaligned32(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_get_unaligned_64le: |
||||
|
* @addr : pointer to unsigned 64-bit value |
||||
|
* |
||||
|
* Convert unsigned unaligned 64-bit value from little-endian to native. |
||||
|
* |
||||
|
* Returns: Native representation of little-endian val. |
||||
|
**/ |
||||
|
|
||||
|
static INLINE uint64_t retro_get_unaligned_64le(void *addr) { |
||||
|
return retro_le_to_cpu64(retro_unaligned64(addr)); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_16le: |
||||
|
* @addr : pointer to unsigned 16-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 16-bit little-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_16le(void *addr, uint16_t v) { |
||||
|
retro_unaligned16(addr) = retro_cpu_to_le16(v); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_32le: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 32-bit little-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_32le(void *addr, uint32_t v) { |
||||
|
retro_unaligned32(addr) = retro_cpu_to_le32(v); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_32le: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 32-bit little-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_64le(void *addr, uint64_t v) { |
||||
|
retro_unaligned64(addr) = retro_cpu_to_le64(v); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_16be: |
||||
|
* @addr : pointer to unsigned 16-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 16-bit big-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_16be(void *addr, uint16_t v) { |
||||
|
retro_unaligned16(addr) = retro_cpu_to_be16(v); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_32be: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 32-bit big-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_32be(void *addr, uint32_t v) { |
||||
|
retro_unaligned32(addr) = retro_cpu_to_be32(v); |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* retro_set_unaligned_32be: |
||||
|
* @addr : pointer to unsigned 32-bit value |
||||
|
* @val : value to store |
||||
|
* |
||||
|
* Convert native value to unsigned unaligned 32-bit big-endian value |
||||
|
* |
||||
|
**/ |
||||
|
|
||||
|
static INLINE void retro_set_unaligned_64be(void *addr, uint64_t v) { |
||||
|
retro_unaligned64(addr) = retro_cpu_to_be64(v); |
||||
|
} |
||||
|
|
||||
|
|
||||
|
#endif |
@ -0,0 +1,39 @@ |
|||||
|
/* Copyright (C) 2010-2020 The RetroArch team
|
||||
|
* |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* The following license statement only applies to this file (retro_inline.h). |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* |
||||
|
* Permission is hereby granted, free of charge, |
||||
|
* to any person obtaining a copy of this software and associated documentation files (the "Software"), |
||||
|
* to deal in the Software without restriction, including without limitation the rights to |
||||
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, |
||||
|
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions: |
||||
|
* |
||||
|
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. |
||||
|
* |
||||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, |
||||
|
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
||||
|
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |
||||
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||||
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
||||
|
*/ |
||||
|
|
||||
|
#ifndef __LIBRETRO_SDK_INLINE_H |
||||
|
#define __LIBRETRO_SDK_INLINE_H |
||||
|
|
||||
|
#ifndef INLINE |
||||
|
|
||||
|
#if defined(_WIN32) || defined(__INTEL_COMPILER) |
||||
|
#define INLINE __inline |
||||
|
#elif defined(__STDC_VERSION__) && __STDC_VERSION__>=199901L |
||||
|
#define INLINE inline |
||||
|
#elif defined(__GNUC__) |
||||
|
#define INLINE __inline__ |
||||
|
#else |
||||
|
#define INLINE |
||||
|
#endif |
||||
|
|
||||
|
#endif |
||||
|
#endif |
@ -0,0 +1,94 @@ |
|||||
|
/* Copyright (C) 2010-2020 The RetroArch team
|
||||
|
* |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* The following license statement only applies to this file (retro_math.h). |
||||
|
* --------------------------------------------------------------------------------------- |
||||
|
* |
||||
|
* Permission is hereby granted, free of charge, |
||||
|
* to any person obtaining a copy of this software and associated documentation files (the "Software"), |
||||
|
* to deal in the Software without restriction, including without limitation the rights to |
||||
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, |
||||
|
* and to permit persons to whom the Software is furnished to do so, subject to the following conditions: |
||||
|
* |
||||
|
* The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. |
||||
|
* |
||||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, |
||||
|
* INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. |
||||
|
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, |
||||
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||||
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
||||
|
*/ |
||||
|
|
||||
|
#ifndef _LIBRETRO_COMMON_MATH_H |
||||
|
#define _LIBRETRO_COMMON_MATH_H |
||||
|
|
||||
|
#include <stdint.h> |
||||
|
|
||||
|
#if defined(_WIN32) && !defined(_XBOX) |
||||
|
#define WIN32_LEAN_AND_MEAN |
||||
|
#include <windows.h> |
||||
|
#elif defined(_WIN32) && defined(_XBOX) |
||||
|
#include <Xtl.h> |
||||
|
#endif |
||||
|
|
||||
|
#include <limits.h> |
||||
|
|
||||
|
#ifdef _MSC_VER |
||||
|
#include <compat/msvc.h> |
||||
|
#endif |
||||
|
#include <retro_inline.h> |
||||
|
|
||||
|
#ifndef M_PI |
||||
|
#if !defined(USE_MATH_DEFINES) |
||||
|
#define M_PI 3.14159265358979323846264338327 |
||||
|
#endif |
||||
|
#endif |
||||
|
|
||||
|
#ifndef MAX |
||||
|
#define MAX(a, b) ((a) > (b) ? (a) : (b)) |
||||
|
#endif |
||||
|
|
||||
|
#ifndef MIN |
||||
|
#define MIN(a, b) ((a) < (b) ? (a) : (b)) |
||||
|
#endif |
||||
|
|
||||
|
/**
|
||||
|
* next_pow2: |
||||
|
* @v : initial value |
||||
|
* |
||||
|
* Get next power of 2 value based on initial value. |
||||
|
* |
||||
|
* Returns: next power of 2 value (derived from @v). |
||||
|
**/ |
||||
|
static INLINE uint32_t next_pow2(uint32_t v) |
||||
|
{ |
||||
|
v--; |
||||
|
v |= v >> 1; |
||||
|
v |= v >> 2; |
||||
|
v |= v >> 4; |
||||
|
v |= v >> 8; |
||||
|
v |= v >> 16; |
||||
|
v++; |
||||
|
return v; |
||||
|
} |
||||
|
|
||||
|
/**
|
||||
|
* prev_pow2: |
||||
|
* @v : initial value |
||||
|
* |
||||
|
* Get previous power of 2 value based on initial value. |
||||
|
* |
||||
|
* Returns: previous power of 2 value (derived from @v). |
||||
|
**/ |
||||
|
static INLINE uint32_t prev_pow2(uint32_t v) |
||||
|
{ |
||||
|
v |= v >> 1; |
||||
|
v |= v >> 2; |
||||
|
v |= v >> 4; |
||||
|
v |= v >> 8; |
||||
|
v |= v >> 16; |
||||
|
return v - (v >> 1); |
||||
|
} |
||||
|
|
||||
|
#endif |
Loading…
Reference in new issue