From e8edf6455ebed241edb2f5a0933ac77a238c1149 Mon Sep 17 00:00:00 2001 From: Brian Holman Date: Mon, 9 Nov 2026 23:45:11 -0700 Subject: [PATCH] Import Color8 0.1.14 upstream source snapshot Original author: Pierre Sarrazin. Source: http://sarrazip.com/dev/color8-0.1.14.tar.gz Archive SHA-256: a98828720d91ac2b9c0939102bf5873650cd3df79323c7d6e086db9604546361 --- COPYING | 674 +++++++++++++++++++++++ Makefile | 146 +++++ README | 35 ++ autostart.c | 80 +++ color8.c | 1501 +++++++++++++++++++++++++++++++++++++++++++++++++++ 5 files changed, 2436 insertions(+) create mode 100644 COPYING create mode 100644 Makefile create mode 100644 README create mode 100644 autostart.c create mode 100644 color8.c diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/COPYING @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + 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. + + + Copyright (C) + + 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 . + +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: + + Copyright (C) + 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 +. + + 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 +. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..eb5133a --- /dev/null +++ b/Makefile @@ -0,0 +1,146 @@ +# Pass CARTRIDGE_ROM=1 to make to position the code and data for a +# ROM cartridge. + +PACKAGE = color8 +VERSION = 0.1.14 +TARGET = coco + +ifneq "$(TARGET)" "os9" +EXEEXT = .bin +endif + +# Required libraries. +CARDGAME_LIB = cardgame +CARDGAME_LIB_DIR = ../cardgame +# BControl is only used by the OS-9 version. +BCONTROL_LIB = bcontrol +BCONTROL_LIB_DIR = ../bcontrol + +# Main program. +SRC = $(PACKAGE).c +HEADERS = +LIBS = \ + -L $(CARDGAME_LIB_DIR) -l$(CARDGAME_LIB) \ + -L $(BCONTROL_LIB_DIR) -l$(BCONTROL_LIB) +DSK = $(PACKAGE)-$(VERSION)-$(TARGET).dsk +ROM = $(PACKAGE)-$(VERSION).rom + +# Compilation and linking flags. +ifdef CARTRIDGE_ROM +BIN = $(ROM) +RAW = --raw # generate raw binary instead of .BIN format +ORG = --org=C000 --data=3800 +CARTDEF = -DCARTRIDGE_ROM=1 +NO_RELOCATE = --no-relocate +else +BIN = $(PACKAGE)$(EXEEXT) +RAW = +ifneq "$(TARGET)" "os9" # --org not permitted when targetting OS-9 +ORG = --org=2800 +endif +endif + +INTERMEDIATE = #--intermediate +NDEBUG = -DNDEBUG +WARNINGS = -Wfor-condition-sizes +WERROR = -Werror +CFLAGS = --$(TARGET) $(WARNINGS) $(WERROR) $(NDEBUG) $(INTERMEDIATE) $(NO_RELOCATE) $(CARTDEF) \ + -DVERSION=\"$(VERSION)\" \ + -I $(CARDGAME_LIB_DIR) \ + -I $(BCONTROL_LIB_DIR) +LDFLAGS = --$(TARGET) $(ORG) $(INTERMEDIATE) $(RAW) + +OBJ = $(SRC:.c=.o) + +DISTFILES = README COPYING Makefile $(SRC) $(HEADERS) autostart.c + +# Tools. +CMOC = cmoc +PERL = perl +TAR = tar +WRITECOCOFILE = writecocofile +INSTALL_LOADER = install-coco-boot-loader +XROAR = xroar +OS9 = os9 # Toolshed + +all: $(BIN) + +# The executable only depends on libbcontrol.a if targeting OS-9. +ifeq "$(TARGET)" "os9" +BCONTROL_DEPS = $(BCONTROL_LIB_DIR)/lib$(BCONTROL_LIB).a +else +BCONTROL_DEPS = +endif + +$(BIN): $(OBJ) $(CARDGAME_LIB_DIR)/lib$(CARDGAME_LIB).a $(BCONTROL_DEPS) + $(CMOC) -o $(BIN) $(LDFLAGS) $(OBJ) $(LIBS) + +$(DSK): dsk + +.PHONY: dsk +ifneq "$(TARGET)" "os9" +dsk: $(BIN) autostart.bin + $(PERL) -e 'print chr(255) x (35*18*256)' > $(DSK) + $(INSTALL_LOADER) $(DSK) autostart.bin + $(PERL) -Mstrict -e 'printf qq{\r0 PCLEAR4:LOADM"%s":EXEC\r}, uc("$(PACKAGE)")' > $(PACKAGE).bas + $(WRITECOCOFILE) --ascii $(DSK) $(PACKAGE).bas + rm $(PACKAGE).bas + $(WRITECOCOFILE) $(DSK) $(BIN) +else +dsk: $(BIN) + $(OS9) format $(DSK) -ds -t80 -e -9 + $(OS9) copy $(BIN) $(DSK), + $(OS9) attr -q -epe $(DSK),/$(BIN) +endif + +# Loader that goes on track 34 to be executed by the CoCo DOS command. +autostart.bin: autostart.c + $(CMOC) --dos -o $@ -D'COMMAND="PCLEAR4:LOADM\"$(PACKAGE)\":EXEC"' autostart.c + +# Build a ROM file. This assumes a cleaned directory. +# The -f argument is the name of the current makefile. +# +# After compiling to a raw binary (not in .BIN format), we need to pad +# the binary with null bytes to make its length divisible by 256. +# This is apparently necessary to avoid a crash in XRoar (as of 0.35). +# +.PHONY: rom +rom: + $(MAKE) -f $(firstword $(MAKEFILE_LIST)) CARTRIDGE_ROM=1 clean $(ROM) + $(PERL) -e 'print chr(0) x (256 - (-s "$(ROM)") % 256)' >> $(ROM) + +# Have the XRoar CoCo 1/2 emulator run the ROM image. +.PHONY: run +run: rom + $(XROAR) -machine cocous -cart-autorun -cart $(ROM) + +%.o: %.c + $(CMOC) -c $(CFLAGS) -o $@ $< + +clean: + rm -f $(BIN) autostart.bin $(OBJ) $(ROM) + +.PHONY: dist +dist: + $(TAR) -czf $(PACKAGE)-$(VERSION).tar.gz --transform 's,^,$(PACKAGE)-$(VERSION)/,' $(DISTFILES) + +# Runs make with arguments $(RECURSION) in the library projects used by this package. +# Supports the -n (dry run) option. +# Example: make recurse RECURSION=clean +# +.PHONY: recurse +recurse: + $(MAKE) -C $(CARDGAME_LIB_DIR) TARGET=$(TARGET) $(RECURSION) +ifeq "$(TARGET)" "os9" + $(MAKE) -C $(BCONTROL_LIB_DIR) TARGET=$(TARGET) $(RECURSION) +endif + +# Automatic prerequisite generation. +%.d: %.c + $(CMOC) --deps-only $(CFLAGS) $< + +.PHONY: cleandeps +cleandeps: + rm -f $(SRC:.c=.d) + +include $(SRC:.c=.d) diff --git a/README b/README new file mode 100644 index 0000000..4d8630b --- /dev/null +++ b/README @@ -0,0 +1,35 @@ +Color Eights +Copyright (C) 2015-2024 Pierre Sarrazin + +License: see the COPYING file. + +Home page: http://sarrazip.com/dev/color8.html + +Version history: +0.1.0 2015-05-31 First public release. +0.1.1 2015-06-06 Resolved warnings on some function calls. +0.1.2 2015-06-09 Fixed bug in putOrdinaryCardOnTopOfDeck(). +0.1.3 2015-06-13 Added support for cartridge ROM format. +0.1.4 2015-07-05 Adapted for CMOC 0.1.8. +0.1.5 2015-07-12 Hide help/quit prompt when not relevant. + Fixed a typo in the help page. +0.1.6 2016-04-03 Restructured to make generic card game code + reusable in other games. +0.1.7 2018-04-03 Emulates PMODE 4 in a CoCo 3 mode to + approximate the artifact colors. + Converted to compile in linker mode. + Compatible with CMOC 0.1.51 (float, long, const). +0.1.8 2018-08-04 Now links with libcardgame.a as a separate project. +0.1.9 2018-09-20 Adapted for CMOC 0.1.53. +0.1.10 2018-10-04 Now using single-argument pcls(). +0.1.11 2018-11-25 Now requires cardgame 0.1.8. Now compilable for the Dragon. +0.1.12 2019-06-03 OS-9 port. Requires cardgame 0.1.9. + Also requires bcontrol 0.1.1 if targeting OS-9. +0.1.13 2023-06-27 ROM image now created with CMOC's --raw option (>= 0.1.70). + bin-to-xroar-rom.pl obsolete, not distributed anymore. + Adapted to version 0.1.11 of the cardgame library. + OS-9 support is suspended. +0.1.14 2024-06-08 OS-9 support restored. + The presentation and help screen prompts now wait + for the space key specifically, the "any" key being + a mythological creature. diff --git a/autostart.c b/autostart.c new file mode 100644 index 0000000..f0df897 --- /dev/null +++ b/autostart.c @@ -0,0 +1,80 @@ +// autostart.c - Program to be run by the Disk Basic DOS command. +// By Pierre Sarrazin +// This file is in the public domain. +// +// Reference: Roger Schrag, "A Special Use For The DOS Command", +// The Rainbow, November 1984, p.140. +// +// To compile: cmoc --dos autostart.c +// To install on CoCo disk image: install-coco-boot-loader some-image.dsk autostart.bin +// To run on CoCo: type DOS and to automatically run *.BAS. +// +// Version history: +// 0.1.0 2016-01-16 Use of legacy.h discontinued. +// 0.1.1 2018-04-03 Adapted to CMOC 0.1.51 (const). +// 0.1.2 2018-08-04 Basic line now forced to be uppercase. + +#include + +#define ENDFLG 0x00 // STOP/END FLAG: POSITIVE=STOP, NEG=END +#define CINBFL 0x70 // CONSOLE IN BUFFER FLAG: 00=NOT EMPTY, $FF=EMPTY +#define RVEC4 0x016a // RAM hook: CONSOLE IN + + +byte oldHookInstr; +word oldHookAddr; +const char *basicLineReader; + + +void feedKeyboard() +{ + word preservedX; + asm("stx", preservedX); + + * (byte *) CINBFL = 0; // console in buffer now not empty + + char nextBasicByte = (char) toupper(*basicLineReader); + ++basicLineReader; + if (nextBasicByte == 0) // if finished returning Basic line + { + * (byte *) RVEC4 = oldHookInstr; + * (word *) (RVEC4 + 1) = oldHookAddr; + nextBasicByte = '\r'; // return "Enter" to cause execution of Basic line + } + + asm { + lda nextBasicByte + ldx preservedX + tfr u,s // discard stack frame + leas 4,s // discard previous stack frame ptr and return addr + rts // return to caller of CONSOLE IN + } +} + + +int main() +{ + * (byte *) ENDFLG = - * (byte *) ENDFLG; // why? + + basicLineReader = + #ifndef COMMAND + "RUN\"*.BAS\"" + #else + COMMAND + #endif + ; + + // Install function feedKeyboard() as CONSOLE IN routine. + // + oldHookInstr = * (byte *) RVEC4; + oldHookAddr = * (word *) (RVEC4 + 1); + + * (byte *) RVEC4 = 0x7e; // JMP instruction + * (void **) (RVEC4 + 1) = feedKeyboard; + + * (word *) 0x2600 = 0; // overwrite "OS" marker with two null bytes + + asm("jmp", "$ac7c"); // go interpret a Basic line (which is read from console) + + return 0; // avoids compiler error +} diff --git a/color8.c b/color8.c new file mode 100644 index 0000000..10c6b1c --- /dev/null +++ b/color8.c @@ -0,0 +1,1501 @@ +/* color8.c - COLOR EIGHTS - A game of Eights for the Color Computer (1, 2 and 3). + + Copyright (C) 2003-2024 Pierre Sarrazin + + 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 . +*/ + +/* To compile into color8.bin (for Disk Basic), see the Makefile. + To test in the XRoar emulator: + xroar -machine cocous -cart-autorun -cart color8.rom +*/ + +#include "cardgame.h" + + +/////////////////////////////////////////////////////////////////////////////// + + +#ifdef OS9 + + +#include "Keyboard.h" /* bcontrol */ + + +// bcontrol keyboard support. +// +Keyboard keyboard; + + +#define inkey() (Keyboard_poll(&keyboard)) + + +// blinkCursor: TRUE is not supported. +// +byte +waitkey(byte blinkCursor) +{ + for (;;) + { + byte key = inkey(); + if (key) + return key; + } +} + + +void +pcls(byte byteToClearWith) +{ + memset(scrnBuffer, byteToClearWith, BYTES_PER_SCREEN); +} + + +// OS9Timer_init() must have been called successfully. +// +#define getTimer() (OS9Timer_getTimer()) + + +// OS9Timer_init() must have been called successfully. +// +#define setTimer(newValue) (OS9Timer_setTimer(newValue)) + + +#endif /* OS9 */ + + +/////////////////////////////////////////////////////////////////////////////// + + +#define PROGRAM_FULL_NAME "Color Eights" +#define BY_LINE "By Pierre Sarrazin" +#define COLOR_EIGHTS_URL "sarrazip.com/dev/color8.html" + +#define USER_HAND_ROW 149 +#define DISPLAYED_CARD_COL 14 +#define DISPLAYED_CARD_ROW 48 + +#define CARDS_PER_ROW 15 + +#define OVERLAY_HEIGHT 30 /* A card on top of another one must be drawn this many pixels lower, so enough of the bottom card shows. */ + +#define STATUS_COL 6 +#define STATUS_ROW 1 // in characters + +#define DECK_COL 21 // in bytes of pixels +#define DECK_ROW 8 // in pixels + +#define EVENT_ROW 13 + +#define REQUESTED_SUIT_COL 19 // in characters +#define REQUESTED_SUIT_ROW 9 // in characters + +#define QUIT_GAME 0 +#define NEXT_PLAYER_PLAYS 1 +#define NEXT_PLAYER_PASSES 2 +#define PLAY_NEW_GAME 3 + + +/////////////////////////////////////////////////////////////////////////////// + + +byte mainDeck[NUMCARDS]; +byte numCardsMainDeck; +byte discardDeck[NUMCARDS]; +byte numDiscardedCards; +byte displayedCard; +byte requestedSuit; + +byte userHand[NUMCARDS]; +byte numUserCards; +byte computerHand[NUMCARDS]; +byte numComputerCards; + + +void initDecks() +{ + numCardsMainDeck = NUMCARDS; + for (byte i = 0; i < numCardsMainDeck; ++i) + mainDeck[i] = i + 1; + numDiscardedCards = 0; + displayedCard = 0; + numUserCards = 0; + numComputerCards = 0; +} + + +void shuffleMainDeck() +{ + shuffleDeck(mainDeck, numCardsMainDeck); +} + + +// Transfers all cards from the discarded deck into the main deck, +// then calls shuffleMainDeck(). +// +void reshuffle() +{ + assertf(numCardsMainDeck + numDiscardedCards <= NUMCARDS, "%u, %u", numCardsMainDeck, numDiscardedCards); + for (byte i = 0; i < numDiscardedCards; i++) + mainDeck[numCardsMainDeck++] = discardDeck[i]; + numCardsMainDeck = numDiscardedCards; + numDiscardedCards = 0; + shuffleMainDeck(); +} + + +// Determines if 'card' is a card that does not make the other player +// pick cards, pass a turn or change the requested suit. +// +byte isOrdinaryCard(byte card) +{ + if (getCardType(card) == SUIT_JOKER) + return FALSE; + + switch (getCardValue(card)) + { + case 2: + case 8: + case 11: // jack + return FALSE; + default: + return TRUE; + } +} + + +void putOrdinaryCardOnTopOfDeck() +{ + if (numCardsMainDeck == 0) + return; + + // Find the topmost (highest index) powerless card in the main deck. + // + byte i; + for (i = numCardsMainDeck; i--; ) + if (isOrdinaryCard(mainDeck[i])) + break; + if (i == 0xFF) // if no ordinary card + return; // do nothing + byte topIndex = numCardsMainDeck - 1; + if (i == topIndex) // if topmost ordinary card is already on top + return; // nothing to do + + // Swap found card with top card. + // + byte found = mainDeck[i]; + mainDeck[i] = mainDeck[topIndex]; + mainDeck[topIndex] = found; +} + + +byte pickCardFromMainDeck() +{ + return pickCardFromDeck(mainDeck, &numCardsMainDeck); +} + + +byte isPlayableCard(byte card) +{ + byte type = getCardType(card); + if (type == SUIT_JOKER) + return TRUE; + + byte val = getCardValue(card); + if (val == 8) + return TRUE; + if (type == requestedSuit) + return TRUE; + return getCardType(displayedCard) != SUIT_JOKER + && val == getCardValue(displayedCard); +} + + +byte atLeastOnePlayable(byte *hand, byte numCards) +{ + byte i; + for (i = 0; i < numCards; i++) + if (isPlayableCard(hand[i])) + return TRUE; + return FALSE; +} + + +// Ordering of cards that puts the 8s at the end. +// Jokers go after the 8s because they are cards #53 and #54 +// (see getCardType() in cardgame.h). +// +byte cardComesAfter(byte card0, byte card1) +{ + assertf(card0 != card1, "%u", card0); + + if (getCardValue(card0) == 8) + if (getCardValue(card1) == 8) + return card0 > card1; + else + return TRUE; // card0, being an 8, comes after card1, which is not an 8 + else if (getCardValue(card1) == 8) + return FALSE; + else + return card0 > card1; +} + + +// Returns the index in hand[] where newCard was inserted. +// +byte insertCardInDisplayOrder(byte *hand, byte initNumCards, byte newCard) +{ + assertf(initNumCards <= NUMCARDS, "%u", initNumCards); + assertf(newCard >= 1 && newCard <= NUMCARDS, "%u", newCard); + + // Find the first card in hand[] that comes after 'newCard'. + // + byte i = 0; + for ( ; i < initNumCards; ++i) + if (cardComesAfter(hand[i], newCard)) + break; + + // Insert newCard at i (which may be initNumCards). + // + if (initNumCards > 0) + for (byte j = initNumCards; j > i; --j) + hand[j] = hand[j - 1]; + hand[i] = newCard; + return i; + +#if 0 // Debugging. + printf("Inserted %2u at %2u (init # %2u):", newCard, i, initNumCards); + for (byte j = 0; j < initNumCards + 1; ++j) + printf(" %3u", hand[j]); + printf("\n"); + + debugBufIndex = 0; + printf("[%3u] [%3u]\n", 7, 0); + byte debugBufIndex_ = debugBufIndex; + restoreOriginalTextMode(); + printf("debugBufIndex=%u\n", debugBufIndex_); + for (byte j = 0; j < debugBufIndex_; ++j) + printf(" %02x", debugBuf[j]); + printf(".\n"); + exit(0); +#endif +} + + +// Evaluates hand[], of length 'numCards' and returns a score for each suit +// in suitScores[4], the number of 8-cards in *nbEights and the number of +// jokers in *nbJokers. +// The score of a suit is higher if the player would be more advantaged +// if that suit were the required one. +// If 'playableCardsOnly' is true, then the score of a suit is zero if +// that suit is currently not playable. Passing FALSE is useful when +// playing an 8 or joker and any suit becomes admissible. +// Returns the suit (suit_{HEARTS,SPADES,DIAMONDS,CLUBS} with the +// highest score (as returned in suitScores[]). +// +byte evaluateHand(byte *suitScores, byte *nbEights, byte *nbJokers, + byte *hand, byte numCards, byte playableCardsOnly) +{ + suitScores[0] = 0; + suitScores[1] = 0; + suitScores[2] = 0; + suitScores[3] = 0; + *nbEights = 0; + *nbJokers = 0; + + byte playableSuit[4]; + playableSuit[0] = FALSE; + playableSuit[1] = FALSE; + playableSuit[2] = FALSE; + playableSuit[3] = FALSE; + + byte i; + for (i = 0; i < numCards; i++) + { + byte card = hand[i]; + byte suit = getCardType(card); + byte val; + if (suit == SUIT_JOKER) + (*nbJokers)++; + else if ((val = getCardValue(card)) == 8) + (*nbEights)++; + else + { + if (isPlayableCard(card)) + playableSuit[suit] = TRUE; + byte s = 2; + if (val == 11) // if jack + s += 2; + if (val == 2) // 2 forces 2- or 4-card pick + { + s += 8; + if (suit == SUIT_SPADES) // 2 of spades forces 4-card pick + s += 6; + } + suitScores[suit] += s; + } + } + + if (playableCardsOnly) + for (byte suit = 0; suit < 4; suit++) + if (!playableSuit[suit]) + suitScores[suit] = 0; + + byte bestSuit = 0; + for (byte suit = 0; suit < 4; suit++) + if (suitScores[suit] > suitScores[bestSuit]) + bestSuit = suit; + return bestSuit; +} + + +byte eventRowUsed = FALSE; // text row where most messages appear + +#define autoMode FALSE // for debugging: when TRUE, user always picks + + +void clearEventRow() +{ + moveCursor(0, EVENT_ROW); + printf(" "); + eventRowUsed = FALSE; +} + + +void printEvent(const char *str) +{ + if (eventRowUsed) + { + optDelay(60); + clearEventRow(); + } + + printCentered(EVENT_ROW, str); + eventRowUsed = TRUE; +} + + +// Changes requestedSuit in the computer's interest. +// +void chooseComputerSuit() +{ + byte suitScores[4]; + byte nbEights; + byte nbJokers; + requestedSuit = evaluateHand(suitScores, &nbEights, &nbJokers, + computerHand, numComputerCards, FALSE); + char msg[33]; + concat(msg, sizeof(msg), "I change the suit to ", getSuitName(requestedSuit), ".", NULL); + printEvent(msg); +} + + +// Puts a card on the discarded deck and makes it the new displayed card. +// This function must be the only way to make a card the displayed card. +// +void discardCard(byte card) +{ + assertf(card >= 1 && card <= NUMCARDS, "%u", card); + assertf(numDiscardedCards < NUMCARDS, "%u", numDiscardedCards); + + discardDeck[numDiscardedCards++] = card; + displayedCard = card; +} + + +byte getPixelRowOfFirstCard(byte numCards, byte lastAdmissibleRow) +{ + if (numCards > 30) + numCards = 30; // fallback + + assertf(numCards <= NUMCARDS, "%u", numCards); + assertf(lastAdmissibleRow >= OVERLAY_HEIGHT && lastAdmissibleRow < PIXEL_ROWS_PER_SCREEN, "%u", lastAdmissibleRow); + + byte numRowsUsed = (numCards + (CARDS_PER_ROW - 1)) / CARDS_PER_ROW; + assertf(numRowsUsed > 0 && numRowsUsed <= 2, "%u, %u", numRowsUsed, numCards); + + byte row = lastAdmissibleRow - (numRowsUsed - 1) * OVERLAY_HEIGHT; + assertf(row < PIXEL_ROWS_PER_SCREEN, "%u", row); + + return row; +} + + +// CARDS_PER_ROW is the max number of cards per screen row. +// OVERLAY_HEIGHT is used if more than one row necessary. +// Continue putting cards towards the top of the screen +// if continueUpwards is true, towards the bottom otherwise. +// +void drawHand(byte *hand, byte numCards, byte y, byte continueUpwards) +{ + if (numCards == 0) + return; + if (numCards > 30) + numCards = 30; // fallback + + y = getPixelRowOfFirstCard(numCards, y); + + byte col = 0; + byte x = 0; + + for (byte i = 0; i < numCards; ++i) + { + byte card = hand[i]; + byte suit = getCardType(card); + byte val = getCardValue(card); + + //printf("%2u. %2u %2u %2u ", i, card, suit, val); + drawCompiledCard(val, suit, x, y); + + x += 2; + ++col; + if (col == CARDS_PER_ROW) // if next card will be on a new row: + { + col = 0; + x = 0; + y += OVERLAY_HEIGHT; + } + } +} + + +void drawUserHand() +{ + // Black out card region before drawing cards. + byte y = getPixelRowOfFirstCard(CARDS_PER_ROW << 1, USER_HAND_ROW); + word byteOffset = (word) y * BYTES_PER_SCREEN_ROW; + assertf(byteOffset < 0x1800, "%u", byteOffset); + memset(scrnBuffer + byteOffset, 0, 0x1800 - byteOffset); + + drawHand(userHand, numUserCards, USER_HAND_ROW, TRUE); +} + + +// Show the given card sliding to the place of the displayed card. +// +void animatePlayedCard(byte card, byte isUsersTurn) +{ + byte rowsPerCard = getNumPixelRowsPerCard(); + byte val = getCardValue(card); + byte type = getCardType(card); + + byte ticks = 15; + + // Slide the card up or down. + // + byte col = DISPLAYED_CARD_COL - 5; + byte rowInc = (isUsersTurn ? -8 : 8); + byte row = DISPLAYED_CARD_ROW + (isUsersTurn ? +24 : -24); + for (byte i = 0; i < 4; ++i, row += rowInc) + { + drawCompiledCard(val, type, col, row); + optDelay(ticks); + + // Blacken the bottom or top 8 pixel rows of the currently displayed card. + // + byte firstRowToBlacken = row; + if (isUsersTurn) + firstRowToBlacken += rowsPerCard - 8; + word *writer = (word *) (scrnBuffer + (word) firstRowToBlacken * BYTES_PER_SCREEN_ROW + col); + for (byte r = 8; r--; writer += WORDS_PER_SCREEN_ROW) + *writer = writer[1] = 0x0000; + } + + ticks = 0; + + // Slide to the right. + // + for ( ; col < DISPLAYED_CARD_COL; ++col) + { + drawCompiledCard(val, type, col, DISPLAYED_CARD_ROW); + optDelay(ticks); + ticks = 15; + + // Blacken the left column of the currently displayed card. + // + byte *writer = scrnBuffer + (word) DISPLAYED_CARD_ROW * BYTES_PER_SCREEN_ROW + col; + for (byte i = rowsPerCard; i--; writer += BYTES_PER_SCREEN_ROW) + *writer = 0x00; + } + drawCompiledCard(val, type, col, DISPLAYED_CARD_ROW); +} + + +void drawDisplayedCard() +{ + drawCompiledCard(getCardValue(displayedCard), getCardType(displayedCard), DISPLAYED_CARD_COL, DISPLAYED_CARD_ROW); +} + + +// Blackens the area where the "which suit" menu is drawn. +// +void clearSuitMenu() +{ + byte *dest = scrnBuffer + ((word) EVENT_ROW * PIXEL_ROWS_PER_TEXT_ROW - 1) * BYTES_PER_SCREEN_ROW; + word numBytes = (word) BYTES_PER_SCREEN_ROW * ((word) ROWS_PER_SUIT * 2 + 2); + memset(dest, 0, numBytes); +} + + +// Returns whether the next player must pass their turn. +// +byte playCard(byte card, byte isUsersTurn) +{ + animatePlayedCard(card, isUsersTurn); + + discardCard(card); + drawDisplayedCard(); + + byte cardType = getCardType(card); + byte cardValue = getCardValue(card); + + byte nextPlayerPasses = FALSE; + byte nextPlayerPicks = 0; // number of cards + byte changesRequestedSuit = FALSE; + + // Determine the effects of the played card: + if (cardType != SUIT_JOKER) + { + if (cardValue == 2) + { + nextPlayerPasses = TRUE; + if (cardType == SUIT_SPADES) + nextPlayerPicks = 4; + else + nextPlayerPicks = 2; + } + else if (cardValue == 8) + changesRequestedSuit = TRUE; + else if (cardValue == 11) + nextPlayerPasses = TRUE; + } + else + { + nextPlayerPasses = TRUE; + nextPlayerPicks = 5; + changesRequestedSuit = TRUE; + } + + // Apply the effects of the played card. + + if (nextPlayerPicks) + { + char msg[33], s[11]; // argument of dwtoa() MUST have at least 11 bytes + concat(msg, sizeof(msg), + isUsersTurn ? "You" : "I", + " make ", + isUsersTurn ? "me" : "you", + " pick ", + dwtoa(s, 0, nextPlayerPicks), + " card", + nextPlayerPicks > 1 ? "s." : ".", + NULL); + assertf(strlen(msg) < sizeof(msg), "%u", strlen(msg)); + printEvent(msg); + + for ( ; nextPlayerPicks; --nextPlayerPicks) + { + if (numCardsMainDeck == 0) + reshuffle(); + if (numCardsMainDeck == 0) + break; + byte pickedCard = pickCardFromMainDeck(); + if (isUsersTurn) + computerHand[numComputerCards++] = pickedCard; + else + { + insertCardInDisplayOrder(userHand, numUserCards, pickedCard); + ++numUserCards; + } + } + } + + if (nextPlayerPasses) + { + if (isUsersTurn) + printEvent("You make me pass a turn."); + else + printEvent("I make you pass a turn."); + } + + // If the card just played allows its player to change the requested suit, + // but no player has won yet, then let the player choose a suit. + // If a player has won, don't bother: the caller is expected to end the game. + // + if (changesRequestedSuit && numUserCards > 0 && numComputerCards > 0) + { + if (isUsersTurn) + { + // Redraw the user hand and the displayed card so that + // the screen shows the 8 or joker has been played. + // + drawUserHand(); + drawDisplayedCard(); + + // Draw a menu of suits to choose from. + // + printEvent("Which suit? H S D C "); + for (byte suit = 0; suit < 4; ++suit) + drawSuit(14 + suit * 5, EVENT_ROW * PIXEL_ROWS_PER_TEXT_ROW, suit); + + // Process keyboard input. + // + for (;;) + { + char c = (autoMode ? 'H' : (char) toupper(waitkey(FALSE))); + if (c == 'H') + requestedSuit = SUIT_HEARTS; + else if (c == 'S') + requestedSuit = SUIT_SPADES; + else if (c == 'D') + requestedSuit = SUIT_DIAMONDS; + else if (c == 'C') + requestedSuit = SUIT_CLUBS; + else + continue; + break; + } + + clearSuitMenu(); + } + else + chooseComputerSuit(); + } + else + requestedSuit = cardType; + + return nextPlayerPasses; +} + + +/* Utility function to draw a horizontal line. +void drawPixelRow(byte y, byte byteToWrite) +{ + byte *row = scrnBuffer + (word) y * BYTES_PER_SCREEN_ROW; + for (int i = BYTES_PER_SCREEN_ROW; i--; ) + *++row = byteToWrite; +} +*/ + + +void drawStatus() +{ + byte statusRow = STATUS_ROW; + moveCursor(STATUS_COL, statusRow); + printf("Computer:"); + moveCursor(STATUS_COL, ++statusRow); + if (numComputerCards == 0) + printf("no cards"); + else + printf("%u card%s ", numComputerCards, numComputerCards > 1 ? "s" : ""); + moveCursor(DECK_COL + 1, (DECK_ROW >> 3) + 3); + printf("%2u", numCardsMainDeck); +} + + +void drawAllCards() +{ + drawUserHand(); + drawDisplayedCard(); + + byte requestedCol = REQUESTED_SUIT_COL; + byte requestedRow = REQUESTED_SUIT_ROW; + moveCursor(requestedCol, requestedRow); + printf("Requested:"); + drawSuit(requestedCol + 3, ((requestedRow + 1) << 3) + 2, requestedSuit); + + drawStatus(); +} + + +#define NUM_CURSOR_ROWS 4 + +word savedBG[NUM_CURSOR_ROWS]; +word *cursorAddr; + + +// Changes cursorAddr and saves the new cursor background in savedBG[]. +// selectedCardIndex: Must be < numUserCards. +// +void computeCursorAddress(byte selectedCardIndex) +{ + byte cursorByteCol = (selectedCardIndex % CARDS_PER_ROW) << 1; + byte rowOfFirstCard = getPixelRowOfFirstCard(numUserCards, USER_HAND_ROW); + byte cursorPixelRow = rowOfFirstCard + selectedCardIndex / CARDS_PER_ROW * OVERLAY_HEIGHT + 1; + assertf(cursorPixelRow < PIXEL_ROWS_PER_SCREEN, "%u", cursorPixelRow); + cursorAddr = (word *) (scrnBuffer + (word) cursorPixelRow * BYTES_PER_SCREEN_ROW + (word) cursorByteCol); + assertf(cursorAddr >= scrnBuffer && cursorAddr < scrnBuffer + BYTES_PER_SCREEN, "%p, %p", cursorAddr, scrnBuffer); + + for (byte i = 0; i < NUM_CURSOR_ROWS; ++i) + savedBG[i] = cursorAddr[((word) i) << 4]; +} + + +// Uses cursorAddr and savedBG. +// +void restoreCursorBG() +{ + assertf(cursorAddr >= scrnBuffer && cursorAddr < scrnBuffer + BYTES_PER_SCREEN, "%p, %p", cursorAddr, scrnBuffer); + for (byte i = 0; i < NUM_CURSOR_ROWS; ++i) + cursorAddr[((word) i) << 4] = savedBG[i]; +} + + +byte basicHelpShown; // is the H=HELP Q=QUIT prompt currently shown + + +void showBasicHelp() +{ + if (basicHelpShown) + return; + + moveCursor(1, REQUESTED_SUIT_ROW); + printf("H=help"); + moveCursor(1, REQUESTED_SUIT_ROW + 1); + printf("Q=quit"); + + basicHelpShown = TRUE; +} + + +void hideBasicHelp() +{ + if (! basicHelpShown) + return; + + moveCursor(1, REQUESTED_SUIT_ROW); + putstr(" ", 6); + moveCursor(1, REQUESTED_SUIT_ROW + 1); + putstr(" ", 6); + + basicHelpShown = FALSE; +} + + +void initPlayScreen() +{ + pcls(0); + + // Draw the deck as a face-down card. + // + moveCursor(DECK_COL, DECK_ROW >> 3); + printf("Deck"); + drawFaceDownCard(DECK_ROW + PIXEL_ROWS_PER_TEXT_ROW, DECK_COL); + + basicHelpShown = FALSE; +} + + +// Help lines must be at most 30 characters. + + +const char *helpLines0[] = +{ + "", + "|" PROGRAM_FULL_NAME, + "|" "V" VERSION, + "", + "|" BY_LINE, + "|" COLOR_EIGHTS_URL, + "", + "", + "Derived from Crazy Eights.", + "", + "Left and right arrows: move", + "the cursor over your cards.", + "", + "SPACE: play the current card.", + "P: pick a card.", + "Q: quit the program.", + "", + "You cannot pick if one of your", + "cards is playable. If the card", + "picked is playable, it is", + "played.", + "", + "|" "Press [Space] to continue.", + 0 +}; + +const char *helpLines1[] = +{ + "", + "An 8 changes the requested", + "suit.", + "", + "So does the joker, which also", + "makes the opponent pass their", + "turn and makes them pick five", + "cards.", + "", + "A 2 makes the opponent pass", + "their turn and pick 2 cards", + "(4 cards if it is a 2 of", + "spades).", + "", + "A jack makes the opponent", + "pass their turn.", + "", + "", + "", + "", + "", + "|" "Press [Space] to return", + "|" "to the game.", + 0 +}; + + +// A line that starts with '|' gets centered instead of +// being left-justified. +// +void showTextLines(const char *lines[]) +{ + for (byte i = 0; lines[i]; ++i) + { + byte row = i; + if (row >= TEXT_ROWS_PER_SCREEN) + return; + const char *line = lines[i]; + byte len = (byte) strlen(line); + byte col; + if (line[0] == '|') // if centered line + { + ++line; + --len; + col = (TEXT_COLS_PER_ROW - len) / 2; + } + else + col = 1; + + moveCursor(col, row); + putstr(line, len); + } +} + + +void waitForSpaceKey(void) +{ + while (waitkey(FALSE) != ' ') + ; +} + + +void showHelpScreen() +{ + pcls(0); + showTextLines(helpLines0); + waitForSpaceKey(); + + pcls(0); + showTextLines(helpLines1); + waitForSpaceKey(); + + initPlayScreen(); + drawAllCards(); +} + + +void warnIfComputerLowOnCards() +{ + byte writtenByte; + if (numComputerCards >= 3) + writtenByte = 0x00; + else + writtenByte = (getTimer() & 0x20 ? 0x00 : 0xAA); // blinking red line + + // Point + byte *p = scrnBuffer + (STATUS_ROW + 2) * BYTES_PER_TEXT_ROW + STATUS_COL; + byte numBytes = (numComputerCards > 1 ? 7 : 6); + memset(p, writtenByte, numBytes); +} + + +void eraseLowCardWarning() +{ + byte *p = scrnBuffer + (STATUS_ROW + 2) * BYTES_PER_TEXT_ROW + STATUS_COL; + memset(p, 0, 7); +} + + +byte selectedCardIndex = 0; // index in userHand[], must be < numUserCards + + +byte playUserTurn() +{ + if (numUserCards == 0) + return NEXT_PLAYER_PLAYS; // failsafe + + if (selectedCardIndex >= numUserCards) + selectedCardIndex = numUserCards - 1; + + computeCursorAddress(selectedCardIndex); // init cursorAddr and resave background + + word prevPattern = 0; + byte result = QUIT_GAME; + for (;;) + { + byte key = autoMode ? 'P' : (char) toupper(inkey()); + if (key == '?' || key == 'H') + { + showHelpScreen(); + continue; + } + if (key == 'Q') + { + hideBasicHelp(); + restoreCursorBG(); + clearEventRow(); // avoid delay that would occur if printEvent() called on non-empty event row + #ifdef CARTRIDGE_ROM + printEvent("Start a new game? (Y/N)"); + #else + printEvent("Quit this program? (Y/N)"); + #endif + byte key = (byte) toupper(waitkey(FALSE)); + if (key != 'Y') + { + clearEventRow(); + continue; + } + result = QUIT_GAME; + break; + } + if (key && eventRowUsed) + { + clearEventRow(); + eventRowUsed = FALSE; + } + if (key == 'P') // if user picks + { + result = NEXT_PLAYER_PLAYS; + + #ifndef ALWAYS_ALLOW_PICKING + if (atLeastOnePlayable(userHand, numUserCards)) + { + printEvent("You are not allowed to pick."); + continue; + } + #endif + + if (numCardsMainDeck == 0) + reshuffle(); + if (numCardsMainDeck == 0) + { + hideBasicHelp(); + restoreCursorBG(); + printEvent("No more cards to be picked."); + if (!autoMode) waitkey(FALSE); + printEvent("Another game? (Y/N)"); + byte key = autoMode ? 'Y' : (char) toupper(waitkey(FALSE)); + return key == 'Y' ? PLAY_NEW_GAME : QUIT_GAME; + } + else + { + byte pickedCard = pickCardFromMainDeck(); + selectedCardIndex = insertCardInDisplayOrder(userHand, numUserCards, pickedCard); + ++numUserCards; + assertf(numUserCards <= NUMCARDS, "%u", numUserCards); + if (isPlayableCard(pickedCard)) + { + key = ' '; // simulate manual selection on picked card + printEvent("You pick a card and play it."); + + // Wait and clear, because the animation will draw over the event row. + optDelay(60); + clearEventRow(); + } + else + { + printEvent("You pick a card: not playable."); + break; + } + } + } + if (key == ' ') // [Space] to play current card + { + assertf(numUserCards <= NUMCARDS, "%u", numUserCards); + assertf(selectedCardIndex < numUserCards, "%u", selectedCardIndex); + + if (! isPlayableCard(userHand[selectedCardIndex])) + { + printEvent("This card cannot be played."); + continue; + } + + hideBasicHelp(); + restoreCursorBG(); + + // Take the card out of the user's hand: + byte selectedCard = userHand[selectedCardIndex]; + for (byte j = selectedCardIndex + 1; j < numUserCards; ++j) + userHand[j - 1] = userHand[j]; + --numUserCards; + + drawUserHand(); + + byte computerPasses = playCard(selectedCard, TRUE); + if (numUserCards == 0) + { + #ifdef CARTRIDGE_ROM + printEvent("You win."); + waitkey(FALSE); + return PLAY_NEW_GAME; + #else + printEvent("You win. Another game? (Y/N)"); + byte key = (byte) toupper(waitkey(FALSE)); + return key == 'Y' ? PLAY_NEW_GAME : QUIT_GAME; + #endif + } + if (computerPasses) + result = NEXT_PLAYER_PASSES; + else + result = NEXT_PLAYER_PLAYS; + break; + } + if (key == 8 || key == 9) // if left or right arrow + { + restoreCursorBG(); + if (key == 8) // if left + selectedCardIndex = (selectedCardIndex == 0 ? numUserCards - 1 : selectedCardIndex - 1); + else if (key == 9) + selectedCardIndex = (selectedCardIndex == numUserCards - 1 ? 0 : selectedCardIndex + 1); + + assertf(selectedCardIndex < numUserCards, "%u, %u", selectedCardIndex, numUserCards); + computeCursorAddress(selectedCardIndex); // update cursorAddr and resave background + } + + showBasicHelp(); // if not already shown + + // Change cursor pattern a few times per second, using TIMER. + // + word curPattern = (getTimer() & 0x10) ? (word) 0x5555 : 0xAAAA; + if (curPattern != prevPattern) + { + word *dest = cursorAddr; + for (byte i = 0; i < NUM_CURSOR_ROWS; ++i) + { + *dest = curPattern; + dest += WORDS_PER_SCREEN_ROW; + } + prevPattern = curPattern; + } + + warnIfComputerLowOnCards(); + } + + hideBasicHelp(); + restoreCursorBG(); + eraseLowCardWarning(); + + return result; +} + + +byte findSuitChangingCard(byte eightWanted) +{ + assertf(numComputerCards < NUMCARDS, "%u", numComputerCards); + for (byte i = 0; i < numComputerCards; i++) + { + byte card = computerHand[i]; + byte suit = getCardType(card); + if (eightWanted && suit != SUIT_JOKER && getCardValue(card) == 8) + return i; + if (!eightWanted && suit == SUIT_JOKER) + return i; + } + return BAD_INDEX; +} + + +/** Find a card of the appropriate suit in the computer's hand. + Does not choose a card whose value is 8 nor cards that are jokers. + @param suit requested suit (not SUIT_JOKER) + @param danger boolean that indicates that the computer + should give preference to cards that can + make the user pick cards and pass his turn + @returns an index into computerHand[], or 0xFF on failure +*/ +byte findComputerCard(byte suit, byte danger) +{ + byte maxScore = 0; + byte index = 0xFF; + byte i; + for (i = 0; i < numComputerCards; i++) + { + byte card = computerHand[i]; + byte cardValue = getCardValue(card); + byte cardType = getCardType(card); + if (cardType == suit && cardValue != 8 && isPlayableCard(card)) + { + byte score = 6; + if (cardValue == 2 || cardValue == 11) + { + score++; + if (cardValue == 2) + { + score += 2; + if (cardType == SUIT_SPADES) + score += 2; + } + } + // Here, score is expected to be between 6 and 11 inclusively. + + if (!danger) + score = 12 - score; + + if (score > maxScore) + { + maxScore = score; + index = i; + } + } + } + return index; +} + + +byte chooseComputerCard() +{ + byte suitScores[4]; + byte nbEights; + byte nbJokers; + byte bestSuit = evaluateHand(suitScores, &nbEights, &nbJokers, + computerHand, numComputerCards, TRUE); + assertf(bestSuit < 4, "%u", bestSuit); + + byte danger = (numUserCards <= 4); + if (danger) + { + if (nbJokers > 0) + return findSuitChangingCard(FALSE); + if (suitScores[bestSuit] > 0) + return findComputerCard(bestSuit, TRUE); + if (nbEights > 0) + return findSuitChangingCard(TRUE); + } + else + { + if (suitScores[bestSuit] > 0) + return findComputerCard(bestSuit, FALSE); + if (nbEights > 0) + return findSuitChangingCard(TRUE); + if (nbJokers > 0) + return findSuitChangingCard(FALSE); + } + return 99; // pick +} + + +byte playComputerTurn() +{ + optDelay(60); + + byte index = chooseComputerCard(); + + if (index == 99) + { + if (numCardsMainDeck == 0) + reshuffle(); + if (numCardsMainDeck == 0) + printEvent("No more cards to be picked."); + else + { + byte pickedCard = pickCardFromMainDeck(); + assertf(numComputerCards < NUMCARDS, "%u", numComputerCards); + computerHand[numComputerCards++] = pickedCard; + if (isPlayableCard(pickedCard)) + { + printEvent("I pick a card and play it."); + optDelay(60); + index = numComputerCards - 1; + } + else + { + printEvent("I pick a card: not playable."); + } + } + } + + if (index == 99) + return NEXT_PLAYER_PLAYS; + + // Take the card out of the computer's hand: + assertf(index < numComputerCards, "%u, %u", index, numComputerCards); + byte chosenCard = computerHand[index]; + assertf(numComputerCards > 0 && index < NUMCARDS, "%u, %u", numComputerCards, index); + computerHand[index] = computerHand[--numComputerCards]; + + byte userPasses = playCard(chosenCard, FALSE); + if (numComputerCards == 0) + { + drawAllCards(); + #ifdef CARTRIDGE_ROM + printEvent("I win."); + waitkey(FALSE); + return PLAY_NEW_GAME; + #else + printEvent("I win. Another game (Y/N)?"); + byte key = autoMode ? 'Y' : (byte) toupper(waitkey(FALSE)); + return key == 'Y' ? PLAY_NEW_GAME : QUIT_GAME; + #endif + } + if (userPasses) + return NEXT_PLAYER_PASSES; + return NEXT_PLAYER_PLAYS; +} + +#define assertNumCards() assertf(numUserCards + numComputerCards + numCardsMainDeck + numDiscardedCards == NUMCARDS, \ + "%u %u %u %u", numUserCards, numComputerCards, numCardsMainDeck, numDiscardedCards) + +void eights() +{ + for (;;) + { + initPlayScreen(); + initDecks(); + assertNumCards(); + shuffleMainDeck(); + assertNumCards(); + + // Initialize the two players' hands: + byte i; + for (i = 8; i > 0; i--) + { + insertCardInDisplayOrder(userHand, numUserCards, pickCardFromMainDeck()); + ++numUserCards; + + computerHand[numComputerCards++] = pickCardFromMainDeck(); + } + assertNumCards(); + + putOrdinaryCardOnTopOfDeck(); + discardCard(pickCardFromMainDeck()); + requestedSuit = getCardType(displayedCard); + if (requestedSuit == SUIT_JOKER) + requestedSuit = SUIT_HEARTS; + + clearEventRow(); + drawAllCards(); + + byte userPasses = FALSE; + byte code = NEXT_PLAYER_PLAYS; + for (;;) + { + assertNumCards(); + if (userPasses) + { + code = NEXT_PLAYER_PLAYS; + } + else + { + code = playUserTurn(); + if (code == QUIT_GAME || code == PLAY_NEW_GAME) + break; + drawAllCards(); + } + + assertNumCards(); + if (code == NEXT_PLAYER_PASSES) + { + code = NEXT_PLAYER_PLAYS; + } + else + { + code = playComputerTurn(); + if (code == QUIT_GAME || code == PLAY_NEW_GAME) + break; + drawAllCards(); + userPasses = (code == NEXT_PLAYER_PASSES); + } + } + + #ifndef CARTRIDGE_ROM // The cart version does not return from this function. + if (code == QUIT_GAME) + return; + #endif + } +} + + +/////////////////////////////////////////////////////////////////////////////// + + +// Returns the key pressed by the user to start the game. +// +byte showPresentation() +{ + byte row = 0; + printCentered(++row, PROGRAM_FULL_NAME); + ++row; + ++row; + printCentered(++row, BY_LINE); + ++row; + ++row; + printCentered(++row, "Version " VERSION); // this statement defines the version number + printCentered(++row, "Copyright (C) 2003-2024"); + ++row; + printCentered(++row, COLOR_EIGHTS_URL); + + printCentered(TEXT_ROWS_PER_SCREEN - 2, "Press [Space] to start."); + + // Wait for a key while drawing the 8 card in different suits. + // + word origTimer = getTimer(); + setTimer(0); + byte key = 0; + for (byte prevSuit = SUIT_NONE; key != ' '; key = inkey()) + { + byte curSuit = (byte) ((getTimer() & 0x00C0) >> 6); + if (curSuit != prevSuit) + { + drawCompiledCard(8, curSuit, 14, 108); + prevSuit = curSuit; + } + } + setTimer(getTimer() + origTimer); // allows use of original timer for srand() seed + return key; +} + + +asm void printUpperCase(const char *str) +{ +#if 0 // Original code: + for ( ; *str; ++str) + putchar(toupper(*str)); +#else + asm + { + ldx 2,s // str (not using U because of 'asm' on function definition) + bra printUpperCase_cond +printUpperCase_loop + cmpa #97 // 'a' + blo printUpperCase_putchar + cmpa #122 // 'z' + bhi printUpperCase_putchar + suba #32 // to upper-case +printUpperCase_putchar +#ifndef CMOC_MONOLITH +CHROUT IMPORT +#endif + jsr [CHROUT,PCR] +printUpperCase_cond + lda ,x+ // get char + bne printUpperCase_loop // loop if not end of string +printUpperCase_end + } +#endif +} + + +#ifdef CHECK_NULL + +void nullPointerHandler(char *addressOfFailedCheck) +{ + moveCursor(0, 0); + printf("*** NULL AT %p ***", addressOfFailedCheck); + for (;;) + ; +} + +#endif + + +int main() +{ + #ifdef CARTRIDGE_ROM + asm + { + // We come here from a JMP $C000 in Color Basic (normally at $A10A in v1.2). + // At this point, the 60 Hz interrupt has not been enabled yet, so enable it. + lda $ff03 // get control register of PIA0, port B + ora #1 + sta $ff03 // enable 60 Hz interrupt + + // Unmask interrupts to allow the timer IRQ to be processed. + andcc #$af + } + #endif + + void *screenBuffer; + + #ifdef OS9 + { + byte err = OS9Timer_init(1); // increment a counter at every 60 Hz tick + if (err != 0) + { + printf("FAILED TO INIT OS-9 TIMER: ERROR #%u\n", err); + return 1; + } + } + + Keyboard_init(&keyboard); + + screenBuffer = NULL; + #else + screenBuffer = (void *) (((word) * (byte *) 0x00BC) << 8); + #endif + + openCardGame(screenBuffer, TRUE); + + #ifdef CHECK_NULL + // Install a null pointer handler. It will only be called if this program + // is compiled with --check-null -DCHECK_NULL=1 + // + set_null_ptr_handler(nullPointerHandler); + #endif + + byte key = showPresentation(); + + word seed = getTimer(); + #if 0 // For debugging: pressing S uses fixed seed. + if (toupper(key) == 'S') + seed = 1; + #endif + srand(seed); + + pcls(0); + + eights(); + + closeCardGame(); + + #ifndef OS9 + screen(0, 0); // text mode + cls(255); + printf("THANK YOU FOR PLAYING\nCOLOR EIGHTS.\n\n" + "VERSION: " VERSION "\n" + "COPYRIGHT 2003-23\n\n"); + printUpperCase(COLOR_EIGHTS_URL); + printf("\n\n"); + #else + putstr("\x12\x0E", 2); // End Graphics, Display Alpha (text mode) + #endif + + //printf("SEED WAS %u.\n", seed); + + #ifdef OS9 + Keyboard_shutdown(&keyboard); + + { + byte err = OS9Timer_shutdown(); + if (err != 0) + { + printf("FAILED TO CLOSE OS-9 TIMER: ERROR #%u\n", err); + return 1; + } + } + #endif + + return 0; +}