diff options
author | Vito Caputo <vcaputo@pengaru.com> | 2018-04-15 14:57:17 -0700 |
---|---|---|
committer | Vito Caputo <vcaputo@pengaru.com> | 2018-04-15 14:57:17 -0700 |
commit | 1d1ce1b2df4a5f97a1c34a90337d0c3732f7959e (patch) | |
tree | be3149f96a1546e1806756488a56cecc749b35a8 |
*: initial commit of whale compo
This is my contribution to our Hungrycat production
blender 2018 entry, assets to follow.
-rw-r--r-- | .gitignore | 1 | ||||
-rw-r--r-- | HUNGRYCAT.NFO | 30 | ||||
-rw-r--r-- | LICENSE | 674 | ||||
-rw-r--r-- | Makefile.am | 2 | ||||
-rw-r--r-- | README | 46 | ||||
-rw-r--r-- | configure.ac | 50 | ||||
-rw-r--r-- | src/Makefile.am | 2 | ||||
-rw-r--r-- | src/aabb.h | 38 | ||||
-rw-r--r-- | src/credits.c | 120 | ||||
-rw-r--r-- | src/credits.h | 26 | ||||
-rw-r--r-- | src/game.c | 361 | ||||
-rw-r--r-- | src/game.h | 26 | ||||
-rw-r--r-- | src/intro.c | 128 | ||||
-rw-r--r-- | src/intro.h | 26 | ||||
-rw-r--r-- | src/list.h | 252 | ||||
-rw-r--r-- | src/macros.h | 37 | ||||
-rw-r--r-- | src/splash-node.c | 115 | ||||
-rw-r--r-- | src/stage.c | 448 | ||||
-rw-r--r-- | src/stage.h | 57 | ||||
-rw-r--r-- | src/svg-node.c | 88 | ||||
-rw-r--r-- | src/svg-node.h | 28 | ||||
-rw-r--r-- | src/v2f.h | 71 | ||||
-rw-r--r-- | src/whale-svg.c | 171 | ||||
-rw-r--r-- | src/whale-svg.h | 29 | ||||
-rw-r--r-- | src/whale.c | 239 | ||||
-rw-r--r-- | src/whale.h | 46 |
26 files changed, 3111 insertions, 0 deletions
diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..a5309e6 --- /dev/null +++ b/.gitignore @@ -0,0 +1 @@ +build*/ diff --git a/HUNGRYCAT.NFO b/HUNGRYCAT.NFO new file mode 100644 index 0000000..2e0cd21 --- /dev/null +++ b/HUNGRYCAT.NFO @@ -0,0 +1,30 @@ +[0m .s$s. .r$d. .r$s. .s$r. ,s$s. .s$s. .s$$$$$$$$d. .s$$$$$$$$s. .s$s. .s$s.
+ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ '$$$$ $$$$$ '$$$$ $$$$$ $$$$$
+ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$$ $$$$$ $$$$$[8C$$$$$ $$$$ $$$$$ $$$$$
+ $$$$$yy$$C$$ $$R$$ $$$A$ $$N$$ $$$K$$ $$S$$ g$$Y$ $$$$$ygs$$$$ $$$$yg$$$$
+ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ $$$$$ $$$$ $$$$$ $$$$$[5C$$$$$$
+ $$$ $$$ $$$ $$$ $$$ $$$ $$$ s@$$ $$$ $$$$[5C'$$$
+ '$[5C'$ '$$g$yj$ ;$[5C'$ '$$$$$$$$$ '$[5C;$ CAT $$$
+
+ Presents: Blender.2018[10C"Whales, Astrophysics, Crater Lake"
+
+[12C#blender - EFNet[6Chttp://mistigris.org/blender/blend.html
+
+[28CCode: Swivel
+
+[28CMusic: Ducky & Cranksy
+
+[28CSFX: Cranksy
+
+[28CGFX: Swivel & Cranksy
+
+[28CASCII: Cranksy
+
+ How to Play: Get the whale in the crater, of course.
+
+ Controls: Left Arrow or "a" key for aiming left
+[12CRight Arrow or "d" key for aiming right
+[12CHold "space" key for powering up and release to launch
+[12CESC to quit
+
+ How to hack: `git clone git://git.pengaru.com/whale`
@@ -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>. diff --git a/Makefile.am b/Makefile.am new file mode 100644 index 0000000..38bdf12 --- /dev/null +++ b/Makefile.am @@ -0,0 +1,2 @@ +SUBDIRS = src +dist_doc_DATA = README @@ -0,0 +1,46 @@ +Whale is an entry for the 2018 Blender 24-hour IRC compo + +Whales / Doing Astrophysics / Crater Lake + +It's a collaboration I did with some friends, we've called ourselves +"Hungrycat" (productions?) for this silly creation. + +Note much of this code is forked from an earlier project I worked on +but never finished called Maladjusted. No, I did not write all of this +in 24 hours, and I had a full night's rest during the competition. + +Building from source: + + On GNU/Linux for GNU/Linux: + + ./bootstrap; mkdir build; cd build; ../configure; make + + Optionally with svg-cairo instead (like the release windows builds) + + ./bootstrap; mkdir build; cd build; ../configure --with-svg-cairo; make + + On GNU/Linux for Windows via MinGW-w64 w/static linking: + + ./bootstrap; mkdir build-win; cd build-win \ + LDFLAGS=-static PKG_CONFIG='x86_64-w64-mingw32-pkg-config --static' \ + PKG_CONFIG_PATH=/usr/local/cross-tools/x86_64-w64-mingw32/lib/pkgconfig \ + ../configure --host=x86_64-w64-mingw32 --with-svg-cairo + + The above assumed your mingw toolchain prefix is 'x86_64-w64-mingw32', + the i686 build was configured using the following commandline: + + LDFLAGS=-static PKG_CONFIG='i686-w64-mingw32-pkg-config --static' \ + PKG_CONFIG_PATH=/usr/local/cross-tools/i686-w64-mingw32/lib/pkgconfig \ + ../configure --host=i686-w64-mingw32 --with-svg-cairo + + +Installing: + + Don't install this, that's silly, just run it in-tree. I didn't even bother + adding the assets to the automake stuff to support installation. + + Simply add a symlink to the assets directory, and run from the build root: + cd build; ln -s ../assets; src/whale + + + - <vcaputo@pengaru.com> 4/15/2018 diff --git a/configure.ac b/configure.ac new file mode 100644 index 0000000..8d358ff --- /dev/null +++ b/configure.ac @@ -0,0 +1,50 @@ +AC_INIT([whale], [1.0], [vcaputo@pengaru.com]) +AM_INIT_AUTOMAKE([-Wall -Werror foreign]) +AC_PROG_CC +AM_PROG_CC_C_O +AM_PROG_AR +AC_PROG_RANLIB +AM_SILENT_RULES([yes]) + +LIBS="$LIBS -lm" + +dnl Check for SDL2 +PKG_CHECK_MODULES(SDL2, sdl2) +CFLAGS="$CFLAGS $SDL_CFLAGS" +LIBS="$LIBS $SDL_LIBS" + +dnl Check for SDL2_mixer +PKG_CHECK_MODULES(SDL2_MIXER, SDL2_mixer) +LIBS="$SDL2_MIXER_LIBS $LIBS" +CFLAGS="$SDL2_MIXER_CFLAGS $CFLAGS" + +dnl Check for Cairo +PKG_CHECK_MODULES(CAIRO, cairo) +LIBS="$CAIRO_LIBS $LIBS" +CFLAGS="$CAIRO_CFLAGS $CFLAGS" + +AC_ARG_WITH([svg-cairo], AS_HELP_STRING([--with-svg-cairo], [build with libsvg-cairo])) + +AS_IF([test "x$with_svg_cairo" = "xyes"], + [PKG_CHECK_MODULES([SVG_CAIRO], [libsvg-cairo], + AC_DEFINE(HAVE_SVG_CAIRO, [1], [Define to 1 with libsvg-cairo present])) + LIBS="$SVG_CAIRO_LIBS $LIBS" + CFLAGS="$SVG_CAIRO_CFLAGS $CFLAGS" + ], + [PKG_CHECK_MODULES([RSVG], [librsvg-2.0]) + LIBS="$RSVG_LIBS $LIBS" + CFLAGS="$RSVG_CFLAGS $CFLAGS" + ] +) + +dnl Check for vorbisfile +PKG_CHECK_MODULES(VORBISFILE, vorbisfile) +LIBS="$LIBS $VORBISFILE_LIBS" +CFLAGS="$CFLAGS $VORBISFILE_CFLAGS" + + +AC_CONFIG_FILES([ + Makefile + src/Makefile +]) +AC_OUTPUT diff --git a/src/Makefile.am b/src/Makefile.am new file mode 100644 index 0000000..7586076 --- /dev/null +++ b/src/Makefile.am @@ -0,0 +1,2 @@ +bin_PROGRAMS = whale +whale_SOURCES = aabb.h credits.c credits.h list.h whale.c whale.h whale-svg.c whale-svg.h game.c game.h intro.c intro.h macros.h stage.c stage.h svg-node.c svg-node.h v2f.h diff --git a/src/aabb.h b/src/aabb.h new file mode 100644 index 0000000..b284022 --- /dev/null +++ b/src/aabb.h @@ -0,0 +1,38 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _AABB_H +#define _AABB_H + +#include "v2f.h" + +typedef struct aabb_t { + v2f_t min, max; +} aabb_t; + + +/* linearly interpolate between a and b by t */ +static inline aabb_t aabb_lerp(const aabb_t *a, const aabb_t *b, float t) +{ + aabb_t aabb; + + aabb.min = v2f_lerp(&a->min, &b->min, t); + aabb.max = v2f_lerp(&a->max, &b->max, t); + + return aabb; +} + +#endif diff --git a/src/credits.c b/src/credits.c new file mode 100644 index 0000000..c171d84 --- /dev/null +++ b/src/credits.c @@ -0,0 +1,120 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <assert.h> +#include <SDL.h> +#include <SDL_mixer.h> +#include <math.h> + +#include "aabb.h" +#include "macros.h" +#include "whale.h" +#include "stage.h" +#include "svg-node.h" + +/* the opening credits */ + +void whale_credits_event(whale_t *whale, SDL_Event *ev) +{ + /* no events handled in credits, their brief */ +} + +typedef enum credits_fsm_t { + CREDITS_FSM_FADEOUT, + CREDITS_FSM_FADEIN, + CREDITS_FSM_PLANETS_FADEOUT, + CREDITS_FSM_CREDITS_FADEOUT, +} credits_fsm_t; + +void whale_credits_update(whale_t *whale) +{ + static stage_node_t *bobby, *crater, *planets, *credits; + static unsigned initialized; + static credits_fsm_t state; + Uint32 now = whale_ticks(whale, WHALE_TICKS_TIMER); + stage_t *stage = whale_get_stage(whale); + + if (!initialized) { + whale_ticks_reset(whale, WHALE_TICKS_TIMER); /* get ticks approximately aligned with credits start */ + + bobby = stage_node_lookup_name(stage, "bobby"); + fatal_if(!bobby, "Unable to lookup whale node"); + + crater = stage_node_lookup_name(stage, "crater"); + fatal_if(!crater, "Unable to lookup crater node"); + + planets = stage_node_lookup_name(stage, "planets"); + fatal_if(!crater, "Unable to lookup planets node"); + + credits = svg_node_new_file(stage, "credits", "assets/credits.svg", 0, (aabb_t){{-.8f, -.8f}, {.8f, .8f}}); + fatal_if(!credits, "Unable to load credits svg"); + + now = whale_ticks(whale, WHALE_TICKS_TIMER); + + initialized = 1; + } + + + switch (state) { + case CREDITS_FSM_FADEOUT: + if (now < 2000) { + float t = 1.0f - ((float)now) * (1.0f / 2000.0f); + + stage_node_set_alpha(stage, bobby, t); + stage_node_set_alpha(stage, crater, t); + } else { + stage_node_free(stage, bobby); + stage_node_free(stage, crater); + stage_node_set_active(stage, credits); + state++; + } + break; + + case CREDITS_FSM_FADEIN: + if (now < 4000) { + stage_node_set_alpha(stage, planets, 1.0f - ((float)(now - 2000)) * (1.0f / 15000.0f)); + stage_node_set_alpha(stage, credits, ((float)(now - 2000)) * (1.0f / 2000.0f)); + } else { + stage_node_set_alpha(stage, credits, 1.0f); + state++; + } + break; + + case CREDITS_FSM_PLANETS_FADEOUT: + if (now < 17000) { + stage_node_set_alpha(stage, planets, 1.0f - ((float)(now - 2000)) * (1.0f / 15000.0f)); + } else { + stage_node_free(stage, planets); + state++; + } + break; + + case CREDITS_FSM_CREDITS_FADEOUT: + if (now < 20000) { + stage_node_set_alpha(stage, credits, 1.0f - ((float)(now - 17000)) * (1.0f / 3000.0f)); + } else { + stage_node_free(stage, credits); + exit(0); + } + break; + + default: + assert(0); + } + + if (!Mix_PlayingMusic() || now > 20000) + exit(0); +} diff --git a/src/credits.h b/src/credits.h new file mode 100644 index 0000000..08f1327 --- /dev/null +++ b/src/credits.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _CREDITS_H +#define _CREDITS_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_credits_event(whale_t *whale, SDL_Event *event); +void whale_credits_update(whale_t *whale); + +#endif diff --git a/src/game.c b/src/game.c new file mode 100644 index 0000000..41f9b1c --- /dev/null +++ b/src/game.c @@ -0,0 +1,361 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <SDL.h> +#include <SDL_mixer.h> +#include <stdarg.h> /* vsnprintf */ + +#include "aabb.h" +#include "whale.h" +#include "whale-svg.h" +#include "macros.h" +#include "stage.h" +#include "svg-node.h" + +/* the game */ + +typedef enum whale_game_fsm_t { + WHALE_GAME_SETTING_UP, + WHALE_GAME_STARTING, + WHALE_GAME_TARGETING, + WHALE_GAME_LAUNCHING, + WHALE_GAME_FLYING, + WHALE_GAME_INSIDE, + WHALE_GAME_OUTSIDE, + WHALE_GAME_LEAVE +} whale_game_fsm_t; + +static Mix_Chunk *launch_sfx, *crash_sfx, *winner_sfx; +static stage_node_t *bobby, *crater, *astro, *planets; +static unsigned bobby_armed; +static whale_game_fsm_t state; + +void whale_game_event(whale_t *whale, SDL_Event *ev) +{ + stage_t *stage = whale_get_stage(whale); + + switch (ev->type) { + case SDL_KEYDOWN: + switch (ev->key.keysym.sym) { + case SDLK_ESCAPE: + state = WHALE_GAME_LEAVE; + break; + + case SDLK_SPACE: + if (state == WHALE_GAME_INSIDE || state == WHALE_GAME_OUTSIDE) { + /* resetup game */ + state = WHALE_GAME_SETTING_UP; + } + + default: + break; + } + + break; + + case SDL_MOUSEBUTTONDOWN: + if (state == WHALE_GAME_TARGETING) { + if (!bobby_armed) + bobby_armed = whale_ticks(whale, WHALE_TICKS_TIMER); + } else if (state == WHALE_GAME_INSIDE || state == WHALE_GAME_OUTSIDE) { + /* resetup game */ + state = WHALE_GAME_SETTING_UP; + } + break; + + case SDL_MOUSEBUTTONUP: + if (state == WHALE_GAME_TARGETING) { + if (bobby_armed) { + /* launch bobby */ + Mix_PlayChannel(-1, launch_sfx, 0); + state = WHALE_GAME_LAUNCHING; + } + } + break; + + case SDL_MOUSEMOTION: + if (state == WHALE_GAME_TARGETING) { + /* convert the mouse X, Y coordinates into an angle, it's + * trivial since the whale is always in the bottom left + */ + int width, height; + double angle; + v2f_t v; + + stage_get_output_size(stage, &width, &height); + + v.x = (float)ev->motion.x; + v.y = (float)height - ev->motion.y; + + v = v2f_normalize(&v); + angle = -atan2f(v.y, v.x) * 57.4712f /* rad2deg */; + + stage_node_set_angle(stage, bobby, angle); + } + break; + + default: + break; + } +} + +#if 0 +stage_node_t * text_node(stage_t *stage, stage_node_t *node, const char *name, int layer, aabb_t aabb, int width, int height, int x, int y, const char *anchor, int font_size, const char *fmt, ...) +{ + char buf[2048]; + char str[1024]; + va_list ap; + + va_start(ap, fmt); + vsnprintf(str, sizeof(str), fmt, ap); + va_end(ap); + + snprintf(buf, sizeof(buf), + "<svg width=\"%i\" height=\"%i\"><g><text x=\"%i\" y=\"%i\" style=\"font-size:%i\" text-anchor=\"%s\">%s</text></g></svg>", + width, height, x, y, font_size, anchor, str); + if (!node) { + node = svg_node_new_buffer(stage, name, buf, strlen(buf), layer, aabb); + fatal_if(!node, "Unable to create quesiton svg \"%s\"", name); + } else { + svg_node_replace_buffer(stage, node, name, buf, strlen(buf)); + } + + return node; +} +#endif + + +stage_node_t * meter_node(stage_t *stage, const aabb_t aabb, float level) +{ + /* TODO: power meter */ +} + + +void whale_game_update(whale_t *whale) +{ + static const aabb_t bobby_end_aabb = {{-1.f, -1.f}, {-.8f, -.8f}}; + static aabb_t crater_end_aabb = {{0.f, -1.f}, {0.f, -.7f}}; + static aabb_t bobby_start_aabb, crater_start_aabb; + static int bobby_keyboard_armed, prev; + static whale_svg_t *bobby_svg, *dead_svg; + static int initialized; + static v2f_t bobby_vector; + stage_t *stage = whale_get_stage(whale); + unsigned now = whale_ticks(whale, WHALE_TICKS_TIMER); + + if (!initialized) { + bobby = stage_node_lookup_name(stage, "bobby"); + fatal_if(!bobby, "Unable to lookup whale node"); + stage_node_get_object(stage, bobby, (void **)&bobby_svg); /* XXX FIXME: NOO */ + + dead_svg = whale_svg_new_file("assets/dead.svg"); + fatal_if(!dead_svg, "Unable to load dead bobby svg"); + + crater = stage_node_lookup_name(stage, "crater"); + fatal_if(!crater, "Unable to lookup crater node"); + + astro = stage_node_lookup_name(stage, "astro"); + fatal_if(!astro, "Unable to lookup astro node"); + + planets = svg_node_new_file(stage, "planets", "assets/planets.svg", 0, (aabb_t){{-1.f, -.7f}, {1.f, 1.f}}); + fatal_if(!planets, "Unable to load planets svg"); + stage_node_set_active(stage, planets); + + stage_node_set_alpha(stage, bobby, 1.0f); + stage_node_set_alpha(stage, crater, 1.0f); + + winner_sfx = Mix_LoadWAV("assets/winner.wav"); + fatal_if(!winner_sfx, "Unable to load winner sfx"); + + launch_sfx = Mix_LoadWAV("assets/launch.wav"); + fatal_if(!launch_sfx, "Unable to load launch sfx"); + + crash_sfx = Mix_LoadWAV("assets/crash.wav"); + fatal_if(!crash_sfx, "Unable to load crash sfx"); + + initialized = 1; + } + + switch (state) { + case WHALE_GAME_SETTING_UP: { + float crater_x; + + stage_node_set_angle(stage, bobby, 0); + stage_node_get_aabb(stage, bobby, &bobby_start_aabb); + stage_node_get_aabb(stage, crater, &crater_start_aabb); + stage_node_set_object(stage, bobby, bobby_svg); + + /* place crater destination randomly along the bottom */ + crater_x = ((float)rand()) / RAND_MAX * .6f; + crater_end_aabb.min.x = crater_x - .2f; + crater_end_aabb.max.x = crater_x + .2f; + + bobby_keyboard_armed = bobby_armed = 0; + whale_ticks_reset(whale, WHALE_TICKS_TIMER); + prev = now = whale_ticks(whale, WHALE_TICKS_TIMER); + state++; + break; + } + + case WHALE_GAME_STARTING: + if (now < 500) { + float t = ((float)now) * (1.0f / 500.0f); + aabb_t aabb; + + t *= t; + + aabb = aabb_lerp(&bobby_start_aabb, &bobby_end_aabb, t); + stage_node_set_aabb(stage, bobby, &aabb); + + aabb = aabb_lerp(&crater_start_aabb, &crater_end_aabb, t); + stage_node_set_aabb(stage, crater, &aabb); + + if (astro) { /* XXX this is ugly; astro is serving as a "first start" flag */ + stage_node_set_alpha(stage, astro, 1.f - t); + stage_node_set_alpha(stage, planets, t); + } + } else { + stage_node_set_aabb(stage, bobby, &bobby_end_aabb); + stage_node_set_aabb(stage, crater, &crater_end_aabb); + + if (astro) { + astro = stage_node_free(stage, astro); + stage_node_set_alpha(stage, planets, 1.f); /* XXX: see above comment about astro abuse */ + } + + state++; + } + break; + + case WHALE_GAME_TARGETING: { + const Uint8 *key_state = SDL_GetKeyboardState(NULL); + float t = ((float)(now - prev)) * .05f; /* scale simulation things according to time passed */ + + if (key_state[SDL_SCANCODE_LEFT] || key_state[SDL_SCANCODE_A]) { + double angle; + + stage_node_get_angle(stage, bobby, &angle); + angle += -3.f * t; + stage_node_set_angle(stage, bobby, angle); + } + + if (key_state[SDL_SCANCODE_RIGHT] || key_state[SDL_SCANCODE_D]) { + double angle; + + stage_node_get_angle(stage, bobby, &angle); + angle += 3.f * t; + stage_node_set_angle(stage, bobby, angle); + } + + if (key_state[SDL_SCANCODE_SPACE]) { + /* arm bobby */ + if (!bobby_keyboard_armed) { + bobby_keyboard_armed = 1; + bobby_armed = now; + } + } else if (bobby_keyboard_armed) { + /* launch bobby */ + Mix_PlayChannel(-1, launch_sfx, 0); + state = WHALE_GAME_LAUNCHING; + } + break; + } + + case WHALE_GAME_LAUNCHING: { + double angle; + double power = (now - bobby_armed) * (1.0f / 5000); + + /* convert angle and power into a vector */ + stage_node_get_angle(stage, bobby, &angle); + angle *= -(M_PI / 180.f); /* to radians */ + bobby_vector.x = cos(angle) * power; + bobby_vector.y = sin(angle) * power; + + state++; + break; + } + + case WHALE_GAME_FLYING: { + float t = ((float)(now - prev)) * .05f; /* scale simulation things according to time passed */ + double angle; + v2f_t move; + aabb_t aabb; + + move = v2f_mult_scalar(&bobby_vector, t); + + /* spin the bobby while he's flying */ + stage_node_get_angle(stage, bobby, &angle); + angle += 4.0f * t; + stage_node_set_angle(stage, bobby, angle); + + /* move him on his trajectory */ + /* XXX: this is pretty silly, but it's the interfaces I have at the moment */ + stage_node_get_aabb(stage, bobby, &aabb); + aabb.min = v2f_add(&aabb.min, &move); + aabb.max = v2f_add(&aabb.max, &move); + stage_node_set_aabb(stage, bobby, &aabb); + + /* check if we're inside the crater (crater aabb is .4f wide) */ + /* FIXME: I should really add some generic aabb overlap test type stuff to aabb.h */ + /* FIXME XXX: yes I know the collision detection is janky/ad-hoc, there was no time! */ + if (aabb.min.x > (crater_end_aabb.min.x + .08f) && + aabb.max.x < (crater_end_aabb.max.x - .08f) && + aabb.min.y < (crater_end_aabb.max.y - .06f)) { + + state = WHALE_GAME_INSIDE; + Mix_PlayChannel(-1, winner_sfx, 0); + + } else if (aabb.min.y < -1.f) { /* or if we're in the ground */ + + state = WHALE_GAME_OUTSIDE; + Mix_PlayChannel(-1, crash_sfx, 0); + stage_node_set_object(stage, bobby, dead_svg); + } + + /* alter trajectory w/gravity */ + bobby_vector.y += -.01f * t; + break; + } + + case WHALE_GAME_INSIDE: { + aabb_t aabb; + + /* bobby simming inside crater lake */ + aabb.min.x = crater_end_aabb.min.x + .1f; + aabb.max.x = crater_end_aabb.max.x - .1f; + aabb.min.y = crater_end_aabb.max.y - .2f; + aabb.max.y = crater_end_aabb.max.y; + stage_node_set_aabb(stage, bobby, &aabb); + + stage_node_set_angle(stage, bobby, cos((double)now * .001) * 10.0); + + break; + } + + case WHALE_GAME_OUTSIDE: + break; + + case WHALE_GAME_LEAVE: + whale_set_context(whale, WHALE_CONTEXT_CREDITS); + break; + } + + /* last 20 seconds of song are credits */ + if (whale_ticks(whale, WHALE_TICKS_MUSIC) > 206000) + whale_set_context(whale, WHALE_CONTEXT_CREDITS); + + prev = now; +} diff --git a/src/game.h b/src/game.h new file mode 100644 index 0000000..7587182 --- /dev/null +++ b/src/game.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _GAME_H +#define _GAME_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_game_event(whale_t *whale, SDL_Event *event); +void whale_game_update(whale_t *whale); + +#endif diff --git a/src/intro.c b/src/intro.c new file mode 100644 index 0000000..7dc8476 --- /dev/null +++ b/src/intro.c @@ -0,0 +1,128 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <assert.h> +#include <SDL.h> +#include <SDL_mixer.h> +#include <math.h> + +#include "aabb.h" +//#include "filler-node.h" +#include "macros.h" +#include "whale.h" +#include "stage.h" +#include "svg-node.h" + +/* the opening intro */ + +void whale_intro_event(whale_t *whale, SDL_Event *ev) +{ + switch (ev->type) { + case SDL_KEYDOWN: + case SDL_MOUSEBUTTONDOWN: + /* skip intro sequence */ + whale_set_context(whale, WHALE_CONTEXT_GAME); + break; + + default: + break; + } +} + +typedef enum intro_fsm_t { + INTRO_FSM_BLACK, + INTRO_FSM_WHALE, + INTRO_FSM_ASTRO, + INTRO_FSM_CRATER, + INTRO_FSM_LEAVE, +} intro_fsm_t; + +void whale_intro_update(whale_t *whale) +{ + static stage_node_t *bobby, *astro, *crater; + static unsigned initialized; + static intro_fsm_t state; + Uint32 now = whale_ticks(whale, WHALE_TICKS_TIMER); + stage_t *stage = whale_get_stage(whale); + + if (!initialized) { + whale_set_music(whale, "assets/music.ogg", 0); + whale_ticks_reset(whale, WHALE_TICKS_MUSIC); /* get ticks approximately aligned with music start */ + whale_ticks_reset(whale, WHALE_TICKS_TIMER); /* TODO: there should be a "reset all" or something */ + + bobby = svg_node_new_file(stage, "bobby", "assets/whale.svg", 2, (aabb_t){{-1.f, -.2f},{-.4f, .2f}}); + fatal_if(!bobby, "Unable to load whale svg"); + + astro = svg_node_new_file(stage, "astro", "assets/astro.svg", 2, (aabb_t){{-.3f, -.2f},{.3f, .2f}}); + fatal_if(!astro, "Unable to load astro svg"); + + crater = svg_node_new_file(stage, "crater", "assets/crater.svg", 3, (aabb_t){{.4f, -.2f},{1.f, .2f}}); + fatal_if(!crater, "Unable to load crater svg"); + + stage_node_set_locked(stage, bobby); + stage_node_set_locked(stage, crater); + + stage_node_set_active(stage, bobby); + stage_node_set_active(stage, astro); + stage_node_set_active(stage, crater); + + now = whale_ticks(whale, WHALE_TICKS_TIMER); + + initialized = 1; + } + + + switch (state) { + case INTRO_FSM_BLACK: + if (now > 500) /* brief delay for things to settle for the viewer */ + state++; + break; + + case INTRO_FSM_WHALE: + if (now < 2000) { + stage_node_set_alpha(stage, bobby, ((float)(now - 500)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, bobby, 1.0f); + state++; + } + break; + + case INTRO_FSM_ASTRO: + if (now < 3500) { + stage_node_set_alpha(stage, astro, ((float)(now - 2000)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, astro, 1.0f); + state++; + } + break; + + case INTRO_FSM_CRATER: + if (now < 5000) { + stage_node_set_alpha(stage, crater, ((float)(now - 3500)) * (1.0f / 1500.0f)); + } else { + stage_node_set_alpha(stage, crater, 1.0f); + state++; + } + break; + + case INTRO_FSM_LEAVE: + whale_set_context(whale, WHALE_CONTEXT_GAME); + break; + + default: + assert(0); + } +} diff --git a/src/intro.h b/src/intro.h new file mode 100644 index 0000000..004d514 --- /dev/null +++ b/src/intro.h @@ -0,0 +1,26 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _INTRO_H +#define _INTRO_H + +typedef struct whale_t whale_t; +typedef union SDL_Event SDL_Event; + +void whale_intro_event(whale_t *whale, SDL_Event *event); +void whale_intro_update(whale_t *whale); + +#endif diff --git a/src/list.h b/src/list.h new file mode 100644 index 0000000..48bca36 --- /dev/null +++ b/src/list.h @@ -0,0 +1,252 @@ +#ifndef __LIST_H +#define __LIST_H + +/* linux kernel linked list interface */ + +/* + * Simple doubly linked list implementation. + * + * Some of the internal functions ("__xxx") are useful when + * manipulating whole lists rather than single entries, as + * sometimes we already know the next/prev entries and we can + * generate better code by using them directly rather than + * using the generic single-entry routines. + */ + +typedef struct list_head { + struct list_head *next, *prev; +} list_head_t; + +#define LIST_HEAD_INIT(name) { &(name), &(name) } + +#define LIST_HEAD(name) \ + struct list_head name = LIST_HEAD_INIT(name) + +#define INIT_LIST_HEAD(ptr) do { \ + (ptr)->next = (ptr); (ptr)->prev = (ptr); \ +} while (0) + +/* + * Insert a new entry between two known consecutive entries. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_add(struct list_head *new, + struct list_head *prev, + struct list_head *next) +{ + next->prev = new; + new->next = next; + new->prev = prev; + prev->next = new; +} + +/** + * list_add - add a new entry + * @new: new entry to be added + * @head: list head to add it after + * + * Insert a new entry after the specified head. + * This is good for implementing stacks. + */ +static inline void list_add(struct list_head *new, struct list_head *head) +{ + __list_add(new, head, head->next); +} + +/** + * list_add_tail - add a new entry + * @new: new entry to be added + * @head: list head to add it before + * + * Insert a new entry before the specified head. + * This is useful for implementing queues. + */ +static inline void list_add_tail(struct list_head *new, struct list_head *head) +{ + __list_add(new, head->prev, head); +} + +/* + * Delete a list entry by making the prev/next entries + * point to each other. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static inline void __list_del(struct list_head *prev, struct list_head *next) +{ + next->prev = prev; + prev->next = next; +} + +/** + * list_del - deletes entry from list. + * @entry: the element to delete from the list. + * Note: list_empty on entry does not return true after this, the entry is in an undefined state. + */ +static inline void list_del(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + entry->next = (void *) 0; + entry->prev = (void *) 0; +} + +/** + * list_del_init - deletes entry from list and reinitialize it. + * @entry: the element to delete from the list. + */ +static inline void list_del_init(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); + INIT_LIST_HEAD(entry); +} + +/** + * list_move - delete from one list and add as another's head + * @list: the entry to move + * @head: the head that will precede our entry + */ +static inline void list_move(struct list_head *list, struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add(list, head); +} + +/** + * list_move_tail - delete from one list and add as another's tail + * @list: the entry to move + * @head: the head that will follow our entry + */ +static inline void list_move_tail(struct list_head *list, + struct list_head *head) +{ + __list_del(list->prev, list->next); + list_add_tail(list, head); +} + +/** + * list_empty - tests whether a list is empty + * @head: the list to test. + */ +static inline int list_empty(struct list_head *head) +{ + return head->next == head; +} + +static inline void __list_splice(struct list_head *list, + struct list_head *head) +{ + struct list_head *first = list->next; + struct list_head *last = list->prev; + struct list_head *at = head->next; + + first->prev = head; + head->next = first; + + last->next = at; + at->prev = last; +} + +/** + * list_splice - join two lists + * @list: the new list to add. + * @head: the place to add it in the first list. + */ +static inline void list_splice(struct list_head *list, struct list_head *head) +{ + if (!list_empty(list)) + __list_splice(list, head); +} + +/** + * list_splice_init - join two lists and reinitialise the emptied list. + * @list: the new list to add. + * @head: the place to add it in the first list. + * + * The list at @list is reinitialised + */ +static inline void list_splice_init(struct list_head *list, + struct list_head *head) +{ + if (!list_empty(list)) { + __list_splice(list, head); + INIT_LIST_HEAD(list); + } +} + +/** + * list_entry - get the struct for this entry + * @ptr: the &struct list_head pointer. + * @type: the type of the struct this is embedded in. + * @member: the name of the list_struct within the struct. + */ +#define list_entry(ptr, type, member) \ + ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) + +/** + * list_for_each - iterate over a list + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); \ + pos = pos->next) +/** + * list_for_each_prev - iterate over a list backwards + * @pos: the &struct list_head to use as a loop counter. + * @head: the head for your list. + */ +#define list_for_each_prev(pos, head) \ + for (pos = (head)->prev; pos != (head); \ + pos = pos->prev) + +/** + * list_for_each_safe - iterate over a list safe against removal of list entry + * @pos: the &struct list_head to use as a loop counter. + * @n: another &struct list_head to use as temporary storage + * @head: the head for your list. + */ +#define list_for_each_safe(pos, n, head) \ + for (pos = (head)->next, n = pos->next; pos != (head); \ + pos = n, n = pos->next) + +/** + * list_for_each_entry - iterate over list of given type + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry(pos, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.next, typeof(*pos), member)) + +/** + * list_for_each_entry_prev - iterate over list of given type backwards + * @pos: the type * to use as a loop counter. + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_prev(pos, head, member) \ + for (pos = list_entry((head)->prev, typeof(*pos), member); \ + &pos->member != (head); \ + pos = list_entry(pos->member.prev, typeof(*pos), member)) + + +/** + * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry + * @pos: the type * to use as a loop counter. + * @n: another type * to use as temporary storage + * @head: the head for your list. + * @member: the name of the list_struct within the struct. + */ +#define list_for_each_entry_safe(pos, n, head, member) \ + for (pos = list_entry((head)->next, typeof(*pos), member), \ + n = list_entry(pos->member.next, typeof(*pos), member); \ + &pos->member != (head); \ + pos = n, n = list_entry(n->member.next, typeof(*n), member)) + + +#endif diff --git a/src/macros.h b/src/macros.h new file mode 100644 index 0000000..8eb8cbf --- /dev/null +++ b/src/macros.h @@ -0,0 +1,37 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _MACROS_H +#define _MACROS_H + +#include <SDL.h> + +#define fatal_if(_cond, _fmt, ...) \ + if (_cond) { \ + SDL_Log("Fatal error: " _fmt "; %s\n", ##__VA_ARGS__, SDL_GetError()); \ + exit(EXIT_FAILURE); \ + } + +#define NELEMS(_a) \ + (sizeof(_a) / sizeof(_a[0])) + +#define CSTRLEN(_str) \ + (sizeof(_str) - 1) + +#define MIN(_a, _b) \ + ((_a) < (_b) ? (_a) : (_b)) + +#endif diff --git a/src/splash-node.c b/src/splash-node.c new file mode 100644 index 0000000..a077d06 --- /dev/null +++ b/src/splash-node.c @@ -0,0 +1,115 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "whale.h" +#include "macros.h" +#include "v2f.h" +#include "stage.h" + +typedef struct droplet_t { + v2f_t trajectory; + v2f_t coordinate; + int dead:1; +} droplet_t; + +typedef struct splash_t { + Uint32 color; + unsigned count; + droplet_t droplets[]; + int dead:1; +} splash_t; + + +static splash_t * splash_new(unsigned count) +{ + splash_t *splash; + unsigned i; + + splash = calloc(1, sizeof(splash_t) + count * sizeof(droplet_t)); + fatal_if(!splash, "Unable to allocate splash_t"); + + splash->count = count; + for (i = 0; i < count; i++) { + splash->droplets[i].trajectory.y = 1.f; + splash->droplets[i].trajectory.x = ((float)rand() * (1.0f / RAND_MAX) * .25f) - .125f; + splash->droplets[i].coordinate.x = 0.f; + splash->droplets[i].coordinate.y = -1.f; + } + + return splash; +} + + +static void splash_render(splash_t *splash, SDL_Surface *surface) +{ + unsigned i; + +/* TODO */ + /* currently every time we render the splash we update it as well, they're + * rolled into one */ + for (i = 0; i < splash->count; i++) { + + } +} + + +static int splash_node_render(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture) +{ + splash_t *splash = object; + SDL_Surface *surface; + + if (splash->dead) /* TODO: expand the stage node render api to support a "delete node" return from render */ + return 0; + + if (*texture) { + /* cached textures are useless to softwre rendered particles */ + SDL_DestroyTexture(*texture); + *texture = NULL; + } + + splash_render(splash, surface); + surface = whale_svg_render((whale_svg_t *)object, width, height); + fatal_if(!surface, "Unable to render svg surface"); + + *texture = SDL_CreateTextureFromSurface(renderer, surface); + fatal_if(!*texture, "Unable to create texture from svg surface"); + + SDL_FreeSurface(surface); + + return 1; +} + +static void splash_node_free(void *object) +{ + whale_svg_free(object); +} + +stage_node_t * splash_node_new(stage_t *stage, const char *name, int layer, aabb_t aabb, unsigned count) +{ + stage_node_t *node; + splash_t *splash; + + splash = splash_new(count); + node = stage_node_new(stage, layer, name, splash, splash_node_render, splash_node_free); + fatal_if(!node, "Unable to create stage node for splash"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} diff --git a/src/stage.c b/src/stage.c new file mode 100644 index 0000000..734b46a --- /dev/null +++ b/src/stage.c @@ -0,0 +1,448 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "list.h" +#include "macros.h" +#include "stage.h" + +typedef struct stage_cached_t { + int width, height; + SDL_Texture *texture; +} stage_cached_t; + +struct stage_node_t { + list_head_t nodes; + char name[STAGE_NODE_NAME_MAX]; + stage_cached_t cached; + aabb_t aabb; /* node coordinates expressed in the space of -1.0...1.0 */ + float alpha; /* alpha for the texture when composited */ + double angle; /* angle for the texture when composited */ + unsigned active:1; /* node is active */ + unsigned locked:1; /* node is locked */ + + stage_render_func_t render; /* render object into a texture */ + stage_free_func_t free; /* free object */ + void *object; /* object */ +}; + +struct stage_t { + list_head_t layers[STAGE_LAYERS_MAX]; + SDL_Renderer *renderer; /* target renderer */ + float aspect_ratio; /* width/height ratio of stage, -1.0...1.0 range of node coordinates map to this ratio. */ +}; + + +/* minimally initialize a node to carry an object */ +static void node_init(stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + strncpy(node->name, name, sizeof(node->name)); + node->render = render_func; + node->free = free_func; + node->object = object; +} + + +/* allocate a node, no list manipulation occurs, this purely creates a node in isolation and assigns its associated name, object and functions */ +static stage_node_t * node_new(const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + stage_node_t *node; + + node = calloc(1, sizeof(stage_node_t)); + if (!node) + return NULL; + + node_init(node, name, object, render_func, free_func); + + return node; +} + + +/* free a node, no list manipulation occurs, this is purely cleanup of the node and its associated texture and object */ +static void node_free(stage_node_t *node) +{ + if (node->free) + node->free(node->object); + if (node->cached.texture) + SDL_DestroyTexture(node->cached.texture); + free(node); +} + + +/* returns a new node installed at the specified layer */ +stage_node_t * stage_node_new(stage_t *stage, int layer, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + stage_node_t *node; + + node = node_new(name, object, render_func, free_func); + if (!node) + return NULL; + + list_add_tail(&node->nodes, &stage->layers[layer]); + + return node; +} + + +/* replace a given node's object only - retain render/free hooks and everything else, invalidates cache - DOES NOT FREE OLD OBJECT */ +/* FIXME: this is being used as a kludge to swap frames in an svg - + * eliminate this bullshit and add support for animations or at least frames, + * the stage really shouldn't have anything to do with it, we can dick with + * the svg behind its back. I just don't currently have the helpers for creating + * svg nodes actually giving out the bare svg handle currently, so the stage_node_t + * is all I have to dick with at the moment. Next time! This really dicks with + * the resource lifecycle - if the stage frees the node, which object was active + * at the time and which object still needs to be freed because it wasn't in + * the stage when the node was killed? It's totally shitty, and I'm aware. + */ +void stage_node_set_object(const stage_t *stage, stage_node_t *node, void *object) +{ + if (node->cached.texture) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + node->object = object; +} + +/* FIXME: GROSS fuck me */ +void stage_node_get_object(const stage_t *stage, stage_node_t *node, void **res_object) +{ + *res_object = node->object; +} + + +/* replaces a given node's object-related properties but otherwise keeping the existing state */ +void stage_node_replace(const stage_t *stage, stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func) +{ + if (node->free) + node->free(node->object); + + if (node->cached.texture) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + node_init(node, name, object, render_func, free_func); +} + + +/* frees a given node removing it from the stage */ +stage_node_t * stage_node_free(stage_t *stage, stage_node_t *node) +{ + if (node) { + list_del(&node->nodes); + node_free(node); + } + + return NULL; +} + + +/* set the alpha on a node */ +void stage_node_set_alpha(const stage_t *stage, stage_node_t *node, float alpha) +{ + /* TODO: this should probably mark something dirty for when we stop always recomposing everything */ + node->alpha = alpha; +} + + +/* set the aabb for a node */ +void stage_node_set_aabb(const stage_t *stage, stage_node_t *node, const aabb_t *aabb) +{ + node->aabb = *aabb; +} + + +/* get the aabb for a node */ +void stage_node_get_aabb(const stage_t *stage, stage_node_t *node, aabb_t *res_aabb) +{ + *res_aabb = node->aabb; +} + + +/* set a node to active (participates in rendering) */ +void stage_node_set_active(const stage_t *stage, stage_node_t *node) +{ + node->active = 1; +} + + +/* set a node to inactive (doesn't participate in rendering) */ +void stage_node_set_inactive(const stage_t *stage, stage_node_t *node) +{ + /* TODO: should this discard the potentially cached texture? */ + node->active = 0; +} + + +/* set a node to locked (doesn't get freed by clears) */ +void stage_node_set_locked(const stage_t *stage, stage_node_t *node) +{ + node->locked = 1; +} + + +/* set a node to unlocked (default, gets freed by clears) */ +void stage_node_set_unlocked(const stage_t *stage, stage_node_t *node) +{ + node->locked = 0; +} + + +/* set a node's layer */ +void stage_node_set_layer(stage_t *stage, stage_node_t *node, int layer) +{ + /* TODO: assert layer sanity */ + list_del(&node->nodes); + list_add_tail(&node->nodes, &stage->layers[layer]); +} + + +void stage_node_set_angle(const stage_t *stage, stage_node_t *node, double angle) +{ + node->angle = angle; +} + + +void stage_node_get_angle(const stage_t *stage, stage_node_t *node, double *res_angle) +{ + *res_angle = node->angle; +} + + +/* create a new stage with the given aspect ratio */ +stage_t * stage_new(SDL_Renderer *renderer, float aspect_ratio) +{ + stage_t *stage; + int i; + + stage = calloc(1, sizeof(stage_t)); + if (!stage) + return NULL; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) + INIT_LIST_HEAD(&stage->layers[i]); + + stage->renderer = renderer; + stage->aspect_ratio = aspect_ratio; + + return stage; +} + +static void _stage_clear(stage_t *stage, int force) +{ + stage_node_t *node, *_node; + int i; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) { + list_for_each_entry_safe(node, _node, &stage->layers[i], nodes) { + if (force || !node->locked) + stage_node_free(stage, node); + } + } +} + +/* free everything in the stage, but keep the stage around */ +/* probably good hygiene to clear everything when there's no intention of + * reusing nodes at the start of a new context, in case something is left + * around unintentionally. */ +void stage_clear(stage_t *stage) +{ + _stage_clear(stage, 0); +} + + +/* free the supplied stage and all associated textures and objects */ +stage_t * stage_free(stage_t *stage) +{ + + if (stage) { + _stage_clear(stage, 1); + free(stage); + } + + return NULL; +} + + +/* fit a stage to the supplied dimensions, returns the fitted dimensions in the result pointers */ +/* the idea is this can be used in a window resize hook to enforce the stage's aspect ratio */ +void stage_fit(const stage_t *stage, int width, int height, int *res_width, int *res_height) +{ + float full_width = stage->aspect_ratio * ((float)height); + + if (full_width == width) { + /* perfect fit */ + *res_width = width; + *res_height = height; + } else if (full_width > width) { + /* height is too large */ + *res_height = (1.0f / stage->aspect_ratio) * ((float)width); + *res_width = width; + } else { + /* width is too large */ + *res_width = full_width; + *res_height = height; + } +} + + +static void aabb_to_rect(const aabb_t *aabb, const SDL_Rect *stage_rect, SDL_Rect *res_rect) +{ + float half_w = ((float)stage_rect->w) * .5f, half_h = ((float)stage_rect->h) * .5f; /* FIXME silly to recompute this repeatedly... */ + + res_rect->x = stage_rect->x; + res_rect->y = stage_rect->y; + res_rect->x += ((float)aabb->min.x) * half_w + half_w; + res_rect->y += stage_rect->h - (((float)aabb->max.y) * half_h + half_h); + + res_rect->w = (aabb->max.x - aabb->min.x) * half_w; + res_rect->h = (aabb->max.y - aabb->min.y) * half_h; +} + + +static void render_nodes(list_head_t *head, SDL_Renderer *renderer, SDL_Rect *dest_rect) +{ + stage_node_t *node; + + list_for_each_entry(node, head, nodes) { + SDL_Rect node_rect; + + if (!node->active) + continue; + + /* scale the node's aabb stage coordinates to destination renderer coordinates */ + aabb_to_rect(&node->aabb, dest_rect, &node_rect); + + /* if we have a cached texture, see if the dimensions changed */ + if (node->cached.texture && + (node_rect.w != node->cached.width || + node_rect.h != node->cached.height)) { + SDL_DestroyTexture(node->cached.texture); + node->cached.texture = NULL; + } + + /* Tell the node to draw its cached texture */ + /* The draw function may either use the existing texture when non-NULL or destroy and create a new one, + * whatever is most convenient for it. + * If the texture is NULL, a create & render must be performed, and 1 returned. + * If the texture is non-NULL, and there's no animation or anything to be done, 0 may simply be returned. + * Otherwise, if supplied a non-NULL texture and it's modified, 1 must be returned. + */ + /* XXX: at this time, the return value is ignored (it always composites the stage even when unchanged) */ + node->render(renderer, node->object, node_rect.w, node_rect.h, &node->cached.texture); + node->cached.width = node_rect.w; + node->cached.height = node_rect.h; + SDL_SetTextureAlphaMod(node->cached.texture, ((float)node->alpha * 255.0f)); + + /* copy the texture to renderer */ + if (node->angle == 0) + SDL_RenderCopy(renderer, node->cached.texture, NULL, &node_rect); + else + SDL_RenderCopyEx(renderer, node->cached.texture, NULL, &node_rect, node->angle, NULL, SDL_FLIP_NONE); + } +} + + +/* XXX: ANOTHER KLUDGE FIXME */ +/* we shouldn't need to let this out of the stage, but for the mouse aiming + * it was easier this way for now. + */ +void stage_get_output_size(stage_t *stage, int *res_width, int *res_height) +{ + SDL_GetRendererOutputSize(stage->renderer, res_width, res_height); +} + + +/* render the supplied stage into the supplied renderer */ +/* the aspect_ratio of the stage will be enforced in filling the logical size + * of the renderer. Unless the aspect ratio matches precisely, stage_render() + * will center the rendering and leave blank borders on the edges left empty. + * The renderer may be sized precisely by first calling stage_fit(). + */ +void stage_render(stage_t *stage) +{ + SDL_Rect rect; + int i, width, height; + + /* XXX TODO: investigate renderer viewports and scale factors */ + SDL_GetRendererOutputSize(stage->renderer, &width, &height); + + stage_fit(stage, width, height, &rect.w, &rect.h); + rect.x = (width - rect.w) / 2; + rect.y = (height - rect.h) / 2; + + fatal_if(SDL_RenderClear(stage->renderer) == -1, + "Unable to clear renderer"); + + for (i = 0; i < STAGE_LAYERS_MAX; i++) + render_nodes(&stage->layers[i], stage->renderer, &rect); +} + + +/* lookup a node from a name */ +stage_node_t * stage_node_lookup_name(const stage_t *stage, const char *name) +{ + stage_node_t *node; + int i; + + for (i = 0; i < STAGE_LAYERS_MAX; i++) { + list_for_each_entry(node, &stage->layers[i], nodes) { + if (!strncmp(node->name, name, sizeof(node->name))) + return node; + } + } + + return NULL; +} + + +/* lookup a node from a cartesian renderer coordinate */ +stage_node_t * stage_node_lookup_cartesian(const stage_t *stage, int x, int y) +{ + stage_node_t *node; + SDL_Rect rect; + int i, width, height; + + /* FIXME: copy-pasta with render, factor out */ + SDL_GetRendererOutputSize(stage->renderer, &width, &height); + + stage_fit(stage, width, height, &rect.w, &rect.h); + rect.x = (width - rect.w) / 2; + rect.y = (height - rect.h) / 2; + + /* this is currently very simple: find the first top-most node + * including the specified coordinate. + */ + for (i = STAGE_LAYERS_MAX - 1; i >= 0; i--) { + list_for_each_entry(node, &stage->layers[i], nodes) { + SDL_Rect node_rect; + + if (!node->active) + continue; + + aabb_to_rect(&node->aabb, &rect, &node_rect); + if (x >= node_rect.x && x < node_rect.x + node_rect.w && + y >= node_rect.y && y < node_rect.y + node_rect.h) + return node; + } + } + + return NULL; +} diff --git a/src/stage.h b/src/stage.h new file mode 100644 index 0000000..05ee3ec --- /dev/null +++ b/src/stage.h @@ -0,0 +1,57 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _STAGE_H +#define _STAGE_H + +#include <SDL.h> + +#define STAGE_NODE_NAME_MAX 16 +#define STAGE_LAYERS_MAX 10 + +typedef struct aabb_t aabb_t; +typedef struct stage_t stage_t; +typedef struct stage_node_t stage_node_t; + +typedef int (*stage_render_func_t)(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture); +typedef void (*stage_free_func_t)(void *object); + +stage_t * stage_new(SDL_Renderer *renderer, float aspect_ratio); +void stage_clear(stage_t *stage); +stage_t * stage_free(stage_t *stage); +void stage_fit(const stage_t *stage, int width, int height, int *res_width, int *res_height); +void stage_render(stage_t *stage); +stage_node_t * stage_node_new(stage_t *stage, int layer, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func); + +void stage_get_output_size(stage_t *stage, int *res_width, int *res_height); +void stage_node_set_object(const stage_t *stage, stage_node_t *node, void *object); +void stage_node_get_object(const stage_t *stage, stage_node_t *node, void **res_object); +void stage_node_replace(const stage_t *stage, stage_node_t *node, const char *name, void *object, stage_render_func_t render_func, stage_free_func_t free_func); +stage_node_t * stage_node_free(stage_t *stage, stage_node_t *node); +void stage_node_set_alpha(const stage_t *stage, stage_node_t *node, float alpha); +void stage_node_set_aabb(const stage_t *stage, stage_node_t *node, const aabb_t *aabb); +void stage_node_get_aabb(const stage_t *stage, stage_node_t *node, aabb_t *res_aabb); +void stage_node_set_active(const stage_t *stage, stage_node_t *node); +void stage_node_set_inactive(const stage_t *stage, stage_node_t *node); +void stage_node_set_locked(const stage_t *stage, stage_node_t *node); +void stage_node_set_unlocked(const stage_t *stage, stage_node_t *node); +void stage_node_set_layer(stage_t *stage, stage_node_t *node, int layer); +void stage_node_set_angle(const stage_t *stage, stage_node_t *node, double angle); +void stage_node_get_angle(const stage_t *stage, stage_node_t *node, double *res_angle); +stage_node_t * stage_node_lookup_name(const stage_t *stage, const char *name); +stage_node_t * stage_node_lookup_cartesian(const stage_t *stage, int x, int y); + +#endif diff --git a/src/svg-node.c b/src/svg-node.c new file mode 100644 index 0000000..7b5541b --- /dev/null +++ b/src/svg-node.c @@ -0,0 +1,88 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <SDL.h> + +#include "aabb.h" +#include "macros.h" +#include "whale-svg.h" +#include "stage.h" + +static int svg_node_render(SDL_Renderer *renderer, void *object, int width, int height, SDL_Texture **texture) +{ + SDL_Surface *surface; + + if (*texture) /* if there's a cached texture, do nothing. */ + return 0; + + surface = whale_svg_render((whale_svg_t *)object, width, height); + fatal_if(!surface, "Unable to render svg surface"); + + *texture = SDL_CreateTextureFromSurface(renderer, surface); + fatal_if(!*texture, "Unable to create texture from svg surface"); + + SDL_FreeSurface(surface); + + return 1; +} + +static void svg_node_free(void *object) +{ + whale_svg_free(object); +} + +stage_node_t * svg_node_new_file(stage_t *stage, const char *name, const char *file, int layer, aabb_t aabb) +{ + stage_node_t *node; + whale_svg_t *svg; + + svg = whale_svg_new_file(file); + fatal_if(!svg, "Unable to open svg \"%s\"", file); + + node = stage_node_new(stage, layer, name, svg, svg_node_render, svg_node_free); + fatal_if(!node, "Unable to create stage node"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} + +stage_node_t * svg_node_new_buffer(stage_t *stage, const char *name, const char *buf, size_t count, int layer, aabb_t aabb) +{ + stage_node_t *node; + whale_svg_t *svg; + + svg = whale_svg_new_buffer(buf, count); + fatal_if(!svg, "Unable to open svg buffer for \"%s\"", name); + + node = stage_node_new(stage, layer, name, svg, svg_node_render, svg_node_free); + fatal_if(!node, "Unable to create stage node"); + + stage_node_set_aabb(stage, node, &aabb); + + return node; +} + + +void svg_node_replace_buffer(stage_t *stage, stage_node_t *node, const char *name, const char *buf, size_t count) +{ + whale_svg_t *svg; + + svg = whale_svg_new_buffer(buf, count); + fatal_if(!svg, "Unable to open svg buffer for \"%s\"", name); + + stage_node_replace(stage, node, name, svg, svg_node_render, svg_node_free); +} diff --git a/src/svg-node.h b/src/svg-node.h new file mode 100644 index 0000000..4ea2452 --- /dev/null +++ b/src/svg-node.h @@ -0,0 +1,28 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _SVG_NODE_H +#define _SVG_NODE_H + +typedef struct stage_t stage_t; +typedef struct stage_node_t stage_node_t; +typedef struct aabb_t aabb_t; + +stage_node_t * svg_node_new_file(stage_t *stage, const char *name, const char *file, int layer, aabb_t aabb); +stage_node_t * svg_node_new_buffer(stage_t *stage, const char *name, const char *buf, size_t count, int layer, aabb_t aabb); +void svg_node_replace_buffer(stage_t *stage, stage_node_t *node, const char *name, const char *buf, size_t count); + +#endif diff --git a/src/v2f.h b/src/v2f.h new file mode 100644 index 0000000..4d40a90 --- /dev/null +++ b/src/v2f.h @@ -0,0 +1,71 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _V2F_H +#define _V2F_H + +#include <math.h> + +typedef struct v2f_t { + float x, y; +} v2f_t; + + +static inline v2f_t v2f_add(const v2f_t *a, const v2f_t *b) +{ + return (v2f_t){a->x + b->x, a->y + b->y}; +} + + +static inline v2f_t v2f_mult_scalar(const v2f_t *v, float scalar) +{ + return (v2f_t){ v->x * scalar, v->y * scalar }; +} + + +static inline float v2f_dot(v2f_t *a, v2f_t *b) +{ + return a->x * b->x + a->y + b->y; +} + + +static inline float v2f_length(v2f_t *v) +{ + return sqrtf(v2f_dot(v, v)); +} + + +static inline v2f_t v2f_normalize(v2f_t *v) +{ + float f; + + f = 1.0f / v2f_length(v); + + return (v2f_t){ .x = f * v->x, .y = f * v->y }; +} + + +static inline v2f_t v2f_lerp(const v2f_t *a, const v2f_t *b, float t) +{ + v2f_t lerp_a, lerp_b; + + lerp_a = v2f_mult_scalar(a, 1.0f - t); + lerp_b = v2f_mult_scalar(b, t); + + return v2f_add(&lerp_a, &lerp_b); +} + +#endif diff --git a/src/whale-svg.c b/src/whale-svg.c new file mode 100644 index 0000000..2c4b655 --- /dev/null +++ b/src/whale-svg.c @@ -0,0 +1,171 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <stdio.h> /* this is needed by cairo headers of all things */ +#include <cairo.h> +#ifdef HAVE_SVG_CAIRO +#include <svg-cairo.h> +#else +#include <librsvg/rsvg.h> +#endif + +#include "macros.h" + +typedef struct whale_svg_t { +#ifdef HAVE_SVG_CAIRO + svg_cairo_t *cairo_svg; + unsigned width, height; +#else + RsvgHandle *rsvg; + RsvgDimensionData dimensions; +#endif +} whale_svg_t; + + +whale_svg_t * whale_svg_new_file(const char *file) +{ + whale_svg_t *svg; + + svg = calloc(1, sizeof(whale_svg_t)); + fatal_if(!svg, "Unable to create svg"); + +#ifdef HAVE_SVG_CAIRO + fatal_if(svg_cairo_create(&svg->cairo_svg) != 0, + "Unable to create svg-cairo context"); + fatal_if(svg_cairo_parse(svg->cairo_svg, file) != 0, + "Unable to parse \"%s\"", file); + svg_cairo_get_size(svg->cairo_svg, &svg->width, &svg->height); +#else + //rsvg_init(); + svg->rsvg = rsvg_handle_new_from_file(file, NULL); + fatal_if(!svg->rsvg, + "Unable to create rsvg handle from file \"%s\"", file); + rsvg_handle_get_dimensions(svg->rsvg, &svg->dimensions); +#endif + + return svg; +} + + +whale_svg_t * whale_svg_new_buffer(const char *buf, size_t count) +{ + whale_svg_t *svg; + + svg = calloc(1, sizeof(whale_svg_t)); + fatal_if(!svg, "Unable to create svg"); + +#ifdef HAVE_SVG_CAIRO + fatal_if(svg_cairo_create(&svg->cairo_svg) != 0, + "Unable to create svg-cairo context"); + fatal_if(svg_cairo_parse_buffer(svg->cairo_svg, buf, count) != 0, + "Unable to parse svg buffer"); + svg_cairo_get_size(svg->cairo_svg, &svg->width, &svg->height); +#else + //rsvg_init(); + svg->rsvg = rsvg_handle_new_from_data(buf, count, NULL); + fatal_if(!svg->rsvg, + "Unable to create rsvg handle from buffer"); + rsvg_handle_get_dimensions(svg->rsvg, &svg->dimensions); +#endif + + return svg; +} + + + +SDL_Surface * whale_svg_render(whale_svg_t *svg, int width, int height) +{ + cairo_surface_t *cairo_surface; + SDL_Surface *sdl_surface; + cairo_t *cairo; + double xscale, yscale, scale, tx, ty, svg_width, svg_height; + +#ifdef HAVE_SVG_CAIRO + svg_width = svg->width; + svg_height = svg->height; +#else + svg_width = svg->dimensions.width; + svg_height = svg->dimensions.height; +#endif + + /* cached size is different so redo the costly SVG render */ + sdl_surface = SDL_CreateRGBSurfaceWithFormat(0, width, height, 32, SDL_PIXELFORMAT_ARGB8888); + fatal_if(!sdl_surface, "Unable to create sdl surface"); + + cairo_surface = cairo_image_surface_create_for_data(sdl_surface->pixels, + CAIRO_FORMAT_ARGB32, + width, + height, + sdl_surface->pitch); + fatal_if(!cairo_surface, "Unable to create cairo surface"); + +#if 0 + /* useful for debugging */ + SDL_FillRect(sdl_surface, NULL, 0xffff0000); +#endif + + cairo = cairo_create(cairo_surface); + fatal_if(!cairo, "Unable to create cairo target"); + + /* XXX: this scaling attempts to preserve the svg's aspect ratio, + * while filling the destination surface + */ + xscale = (double)width / svg_width; + yscale = (double)height / svg_height; + scale = xscale < yscale ? xscale : yscale; + + /* if we have a mismatch between the desired width/height aspect ratio, + * and the svg's aspect ratio, we need to translate to center the rendering + * in the resulting surface + */ + tx = scale * svg_width; + ty = scale * svg_height; + + if ((int)((double)tx + 0.5) < width) + tx = ((double)width - tx + 0.5) / 2.0; + else + tx = 0; + + if ((int)((double)ty + 0.5) < height) + ty = ((double)height - ty + 0.5) / 2.0; + else + ty = 0; + + cairo_translate(cairo, tx, ty); + cairo_scale(cairo, scale, scale); + +#ifdef HAVE_SVG_CAIRO + svg_cairo_render(svg->cairo_svg, cairo); +#else + rsvg_handle_render_cairo(svg->rsvg, cairo); +#endif + cairo_surface_flush(cairo_surface); + cairo_surface_destroy(cairo_surface); + cairo_destroy(cairo); + + return sdl_surface; +} + + +void whale_svg_free(whale_svg_t *svg) +{ +#ifdef HAVE_SVG_CAIRO + svg_cairo_destroy(svg->cairo_svg); +#else + rsvg_handle_free(svg->rsvg); +#endif + free(svg); +} diff --git a/src/whale-svg.h b/src/whale-svg.h new file mode 100644 index 0000000..b69028d --- /dev/null +++ b/src/whale-svg.h @@ -0,0 +1,29 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _WHALE_SVG_H +#define _WHALE_SVG_H + +#include <SDL.h> + +typedef struct whale_svg_t whale_svg_t; + +whale_svg_t * whale_svg_new_file(const char *file); +whale_svg_t * whale_svg_new_buffer(const char *buf, size_t count); +SDL_Surface * whale_svg_render(whale_svg_t *svg, int width, int height); +void whale_svg_free(whale_svg_t *svg); + +#endif diff --git a/src/whale.c b/src/whale.c new file mode 100644 index 0000000..17cbb5d --- /dev/null +++ b/src/whale.c @@ -0,0 +1,239 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#include <SDL.h> +#include <SDL_mixer.h> +#include <assert.h> +#include <stdlib.h> /* exit, atexit */ + +#include "credits.h" +#include "whale.h" +#include "game.h" +#include "intro.h" +#include "macros.h" +#include "stage.h" + +/* whale - Blender 2018 entry */ +/* whales / doing astrophysics / crater lake */ + +#define DEFAULT_WIDTH 800 +#define DEFAULT_HEIGHT 450 +#define WINDOW_FLAGS (SDL_WINDOW_RESIZABLE) + +typedef struct whale_t { + struct { + SDL_Window *window; + SDL_Renderer *renderer; + + Mix_Music *music; + Uint32 tick_offsets[2]; + } sdl; + + whale_context_t context; + stage_t *stage; +} whale_t; + + +stage_t * whale_get_stage(const whale_t *whale) +{ + return whale->stage; +} + + +void whale_set_music(whale_t *whale, const char *file, unsigned flags) +{ + int loop = (flags & WHALE_MUSIC_FLAG_LOOP) ? -1 : 0; + int fade = (flags & WHALE_MUSIC_FLAG_FADEIN); + + if (whale->sdl.music) { + Mix_HaltMusic(); + Mix_FreeMusic(whale->sdl.music); + whale->sdl.music = NULL; + } + + whale->sdl.music = Mix_LoadMUS(file); + fatal_if(!whale->sdl.music, + "Unable to load music \"%s\"", file); + Mix_VolumeMusic(32); /* XXX: just hard-coding music volume for now */ + if (fade) { + fatal_if(Mix_FadeInMusic(whale->sdl.music, loop, 1000), + "Unable to play music"); + } else { + fatal_if(Mix_PlayMusic(whale->sdl.music, loop), + "Unable to play music"); + } +} + + +void whale_set_context(whale_t *whale, whale_context_t context) +{ + whale->context = context; +} + + +/* return ticks counter */ +unsigned whale_ticks(whale_t *whale, whale_ticks_t type) +{ + return SDL_GetTicks() - whale->sdl.tick_offsets[type]; +} + + +/* reset ticks counter to begin counting from now */ +void whale_ticks_reset(whale_t *whale, whale_ticks_t type) +{ + whale->sdl.tick_offsets[type] = SDL_GetTicks(); +} + + +static void whale_startup(whale_t *whale) +{ + fatal_if(SDL_Init(SDL_INIT_VIDEO|SDL_INIT_AUDIO) != 0, + "Unable to initialize SDL"); + fatal_if(atexit(SDL_Quit), + "Unable to set exit handler"); + + fatal_if(Mix_OpenAudio(44100, MIX_DEFAULT_FORMAT, 2, 2048) == -1, + "Unable to open audio"); + + whale->sdl.window = SDL_CreateWindow("whale", + SDL_WINDOWPOS_UNDEFINED, + SDL_WINDOWPOS_UNDEFINED, + DEFAULT_WIDTH, DEFAULT_HEIGHT, + WINDOW_FLAGS); + fatal_if(!whale->sdl.window, + "Unable to create SDL window"); + + whale->sdl.renderer = SDL_CreateRenderer(whale->sdl.window, -1, + SDL_RENDERER_PRESENTVSYNC); + fatal_if(!whale->sdl.renderer, + "Unable to create SDL renderer"); + + whale->stage = stage_new(whale->sdl.renderer, 1.7777f); + fatal_if(!whale->stage, + "Unable to create new stage"); +} + + +static void whale_update(whale_t *whale) +{ + switch (whale->context) { + case WHALE_CONTEXT_INTRO: + whale_intro_update(whale); + break; + + case WHALE_CONTEXT_GAME: + whale_game_update(whale); + break; + + case WHALE_CONTEXT_CREDITS: + whale_credits_update(whale); + break; + + default: + assert(0); + } + + stage_render(whale->stage); + SDL_RenderPresent(whale->sdl.renderer); +} + + +static void whale_event(whale_t *whale, SDL_Event *event) +{ + switch (whale->context) { + case WHALE_CONTEXT_INTRO: + whale_intro_event(whale, event); + break; + + case WHALE_CONTEXT_GAME: + whale_game_event(whale, event); + break; + + case WHALE_CONTEXT_CREDITS: + whale_credits_event(whale, event); + break; + + default: + assert(0); + } +} + + +static int whale_shutdown(whale_t *whale) +{ + stage_free(whale->stage); + SDL_DestroyRenderer(whale->sdl.renderer); + SDL_DestroyWindow(whale->sdl.window); + Mix_CloseAudio(); + + return EXIT_SUCCESS; +} + + +static void whale_loop(whale_t *whale) +{ + for (;;) { + SDL_Event ev; + + while (SDL_PollEvent(&ev)) { + switch (ev.type) { + case SDL_APP_TERMINATING: + case SDL_QUIT: + return; + + case SDL_WINDOWEVENT: + break; + + case SDL_MOUSEMOTION: + break; + + case SDL_MOUSEBUTTONDOWN: + case SDL_MOUSEBUTTONUP: + break; + + case SDL_MOUSEWHEEL: + break; + + case SDL_FINGERDOWN: + case SDL_FINGERUP: + case SDL_FINGERMOTION: + break; + + case SDL_KEYDOWN: + case SDL_KEYUP: + break; + + default: + break; + } + + whale_event(whale, &ev); + } + + whale_update(whale); + } +} + + +int main(int argc, char *argv[]) +{ + whale_t whale = {}; + + whale_startup(&whale); + whale_loop(&whale); + + return whale_shutdown(&whale); +} diff --git a/src/whale.h b/src/whale.h new file mode 100644 index 0000000..8e2f482 --- /dev/null +++ b/src/whale.h @@ -0,0 +1,46 @@ +/* + * Copyright (C) 2018 Vito Caputo - <vcaputo@pengaru.com> + * + * This program is free software: you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 3 as published + * by the Free Software Foundation. + * + * 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/>. + */ + +#ifndef _WHALE_H +#define _WHALE_H + +#include <SDL.h> + +typedef enum whale_context_t { + WHALE_CONTEXT_INTRO, + WHALE_CONTEXT_GAME, + WHALE_CONTEXT_CREDITS +} whale_context_t; + +typedef enum whale_ticks_t { + WHALE_TICKS_TIMER, + WHALE_TICKS_MUSIC +} whale_ticks_t; + +#define WHALE_MUSIC_FLAG_LOOP (1L) +#define WHALE_MUSIC_FLAG_FADEIN (1L << 1) + +typedef struct whale_t whale_t; +typedef struct stage_t stage_t; + +stage_t * whale_get_stage(const whale_t *whale); +void whale_set_music(whale_t *whale, const char *file, unsigned flags); +void whale_set_context(whale_t *whale, whale_context_t context); +unsigned whale_ticks(whale_t *whale, whale_ticks_t type); +void whale_ticks_reset(whale_t *whale, whale_ticks_t type); + + +#endif |