diff options
| -rw-r--r-- | .gitignore | 1 | ||||
| -rw-r--r-- | CMakeLists.txt | 21 | ||||
| -rw-r--r-- | asset.h | 72 | ||||
| -rw-r--r-- | cards/.gitignore | 5 | ||||
| -rw-r--r-- | cards/CMakeLists.txt | 18 | ||||
| -rw-r--r-- | cards/LICENSE | 661 | ||||
| -rw-r--r-- | cards/cards.3 (renamed from cards.3) | 0 | ||||
| -rw-r--r-- | cards/cards.c (renamed from cards.c) | 0 | ||||
| -rw-r--r-- | cards/cards.h (renamed from cards.h) | 0 | ||||
| -rw-r--r-- | cards/dump.1 (renamed from dump.1) | 0 | ||||
| -rw-r--r-- | cards/dump.c (renamed from dump.c) | 0 | ||||
| -rw-r--r-- | cards/example.c (renamed from example.c) | 0 | ||||
| -rw-r--r-- | cards/exefmt.txt (renamed from exefmt.txt) | 0 | ||||
| -rw-r--r-- | freecell.c | 630 | ||||
| -rw-r--r-- | layout.h | 110 | ||||
| -rw-r--r-- | sol.c | 395 | ||||
| -rw-r--r-- | stack.h | 122 |
17 files changed, 2027 insertions, 8 deletions
diff --git a/.gitignore b/.gitignore index eb62ecc..4629025 100644 --- a/.gitignore +++ b/.gitignore @@ -1,4 +1,3 @@ -*.bmp CARDS.DLL FREECELL.EXE SOL.EXE diff --git a/CMakeLists.txt b/CMakeLists.txt index 06ae91f..926fed0 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -1,18 +1,25 @@ cmake_minimum_required(VERSION 3.10) -project(cards) +project(WEP) find_package(SDL2 REQUIRED) +include_directories(${SDL2_INCLUDE_DIRS}) if(NOT MSVC) add_compile_options(-Wall -Wextra -pedantic) endif() -add_library(cards STATIC cards.c) -target_link_libraries(cards SDL2::SDL2) +include_directories(cards) +add_library(cards STATIC cards/cards.c) -add_executable(example EXCLUDE_FROM_ALL example.c) -target_link_libraries(example cards SDL2::SDL2main) +add_executable(sol sol.c) +add_executable(freecell freecell.c) -add_executable(dump EXCLUDE_FROM_ALL dump.c) -target_link_libraries(dump cards) +target_link_libraries(sol cards SDL2::SDL2 SDL2::SDL2main) +target_link_libraries(freecell cards SDL2::SDL2 SDL2::SDL2main) + +# Avoid conflicting with SOL.EXE, FREECELL.EXE on Windows +if(WIN32) + set_target_properties(sol PROPERTIES OUTPUT_NAME wepsol) + set_target_properties(freecell PROPERTIES OUTPUT_NAME wepfreecell) +endif() diff --git a/asset.h b/asset.h new file mode 100644 index 0000000..cc37709 --- /dev/null +++ b/asset.h @@ -0,0 +1,72 @@ +/* Copyright (C) 2019 C. McEnroe <june@causal.agency> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +#ifndef ASSET_H +#define ASSET_H + +#include <SDL_filesystem.h> +#include <SDL_rwops.h> +#include <stdio.h> +#include <stdlib.h> + +struct Paths { + char *base; + char *pref; +}; + +static inline int assetPaths(struct Paths *paths) { + paths->base = SDL_GetBasePath(); + if (!paths->base) return -1; + paths->pref = SDL_GetPrefPath("Causal Agency", "Entertainment Pack"); + if (!paths->pref) return -1; + return 0; +} + +static inline SDL_RWops * +assetOpen(const struct Paths *paths, const char *names[], size_t len) { + const char *dirs[3] = { paths->pref, paths->base, "" }; + for (size_t i = 0; i < 3; ++i) { + for (size_t j = 0; j < len; ++j) { + char path[1024]; + snprintf(path, sizeof(path), "%s%s", dirs[i], names[j]); + SDL_RWops *rw = SDL_RWFromFile(path, "rb"); + if (rw) return rw; + } + } + return NULL; +} + +static inline SDL_RWops *assetOpenCards(const struct Paths *paths) { + const char *names[3] = { "CARDS.DLL", "SOL.EXE", "cards.dll" }; + SDL_RWops *rw = assetOpen(paths, names, 3); + if (rw) return rw; + char msg[4096]; + snprintf( + msg, sizeof(msg), "%s or %s not found in:\n%s\n%s", + names[0], names[1], paths->pref, paths->base + ); + SDL_ShowSimpleMessageBox( + SDL_MESSAGEBOX_ERROR, "Entertainment Pack", msg, NULL + ); + return NULL; +} + +static inline SDL_RWops *assetOpenFreeCell(const struct Paths *paths) { + const char *names[2] = { "FREECELL.EXE", "freecell.exe" }; + return assetOpen(paths, names, 2); +} + +#endif diff --git a/cards/.gitignore b/cards/.gitignore new file mode 100644 index 0000000..eb62ecc --- /dev/null +++ b/cards/.gitignore @@ -0,0 +1,5 @@ +*.bmp +CARDS.DLL +FREECELL.EXE +SOL.EXE +build/ diff --git a/cards/CMakeLists.txt b/cards/CMakeLists.txt new file mode 100644 index 0000000..06ae91f --- /dev/null +++ b/cards/CMakeLists.txt @@ -0,0 +1,18 @@ +cmake_minimum_required(VERSION 3.10) + +project(cards) + +find_package(SDL2 REQUIRED) + +if(NOT MSVC) + add_compile_options(-Wall -Wextra -pedantic) +endif() + +add_library(cards STATIC cards.c) +target_link_libraries(cards SDL2::SDL2) + +add_executable(example EXCLUDE_FROM_ALL example.c) +target_link_libraries(example cards SDL2::SDL2main) + +add_executable(dump EXCLUDE_FROM_ALL dump.c) +target_link_libraries(dump cards) diff --git a/cards/LICENSE b/cards/LICENSE new file mode 100644 index 0000000..dba13ed --- /dev/null +++ b/cards/LICENSE @@ -0,0 +1,661 @@ + GNU AFFERO GENERAL PUBLIC LICENSE + Version 3, 19 November 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 Affero General Public License is a free, copyleft license for +software and other kinds of works, specifically designed to ensure +cooperation with the community in the case of network server software. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +our General Public Licenses are intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + Developers that use our General Public Licenses protect your rights +with two steps: (1) assert copyright on the software, and (2) offer +you this License which gives you legal permission to copy, distribute +and/or modify the software. + + A secondary benefit of defending all users' freedom is that +improvements made in alternate versions of the program, if they +receive widespread use, become available for other developers to +incorporate. Many developers of free software are heartened and +encouraged by the resulting cooperation. However, in the case of +software used on network servers, this result may fail to come about. +The GNU General Public License permits making a modified version and +letting the public access it on a server without ever releasing its +source code to the public. + + The GNU Affero General Public License is designed specifically to +ensure that, in such cases, the modified source code becomes available +to the community. It requires the operator of a network server to +provide the source code of the modified version running there to the +users of that server. Therefore, public use of a modified version, on +a publicly accessible server, gives the public access to the source +code of the modified version. + + An older license, called the Affero General Public License and +published by Affero, was designed to accomplish similar goals. This is +a different license, not a version of the Affero GPL, but Affero has +released a new version of the Affero GPL which permits relicensing under +this license. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU Affero General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Remote Network Interaction; Use with the GNU General Public License. + + Notwithstanding any other provision of this License, if you modify the +Program, your modified version must prominently offer all users +interacting with it remotely through a computer network (if your version +supports such interaction) an opportunity to receive the Corresponding +Source of your version by providing access to the Corresponding Source +from a network server at no charge, through some standard or customary +means of facilitating copying of software. This Corresponding Source +shall include the Corresponding Source for any work covered by version 3 +of the GNU General Public License that is incorporated pursuant to the +following paragraph. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the work with which it is combined will remain governed by version +3 of the GNU General Public License. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU Affero General Public License from time to time. Such new versions +will be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU Affero General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU Affero General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU Affero General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU Affero General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with this program. If not, see <http://www.gnu.org/licenses/>. + +Also add information on how to contact you by electronic and paper mail. + + If your software can interact with users remotely through a computer +network, you should also make sure that it provides a way for users to +get its source. For example, if your program is a web application, its +interface could display a "Source" link that leads users to an archive +of the code. There are many ways you could offer source, and different +solutions will be better for different programs; see section 13 for the +specific requirements. + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU AGPL, see +<http://www.gnu.org/licenses/>. diff --git a/cards.3 b/cards/cards.3 index 26c142c..26c142c 100644 --- a/cards.3 +++ b/cards/cards.3 diff --git a/cards.c b/cards/cards.c index ddc5b86..ddc5b86 100644 --- a/cards.c +++ b/cards/cards.c diff --git a/cards.h b/cards/cards.h index 9625cb8..9625cb8 100644 --- a/cards.h +++ b/cards/cards.h diff --git a/dump.1 b/cards/dump.1 index a7fc3db..a7fc3db 100644 --- a/dump.1 +++ b/cards/dump.1 diff --git a/dump.c b/cards/dump.c index 127d6b1..127d6b1 100644 --- a/dump.c +++ b/cards/dump.c diff --git a/example.c b/cards/example.c index 859adc1..859adc1 100644 --- a/example.c +++ b/cards/example.c diff --git a/exefmt.txt b/cards/exefmt.txt index 51fa9a7..51fa9a7 100644 --- a/exefmt.txt +++ b/cards/exefmt.txt diff --git a/freecell.c b/freecell.c new file mode 100644 index 0000000..06276d3 --- /dev/null +++ b/freecell.c @@ -0,0 +1,630 @@ +/* Copyright (C) 2019 C. McEnroe <june@causal.agency> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +#include <stdbool.h> +#include <stdio.h> +#include <stdlib.h> +#include <time.h> + +#include <SDL.h> +#include <cards.h> + +#include "asset.h" +#include "stack.h" + +typedef unsigned uint; + +enum { + Foundation1, + Foundation2, + Foundation3, + Foundation4, + Cell1, + Cell2, + Cell3, + Cell4, + Tableau1, + Tableau2, + Tableau3, + Tableau4, + Tableau5, + Tableau6, + Tableau7, + Tableau8, + StacksLen, +}; + +static struct Stack stacks[StacksLen]; + +static uint kingIndex = Cards_KingRight; + +struct Move { + uint dst; + uint src; +}; + +enum { QueueLen = 16 }; +static struct { + struct Move moves[QueueLen]; + uint r, w, u; +} queue; + +static void enqueue(uint dst, uint src) { + queue.moves[queue.w % QueueLen].dst = dst; + queue.moves[queue.w % QueueLen].src = src; + queue.w++; +} + +static void dequeue(void) { + struct Move move = queue.moves[queue.r++ % QueueLen]; + push(&stacks[move.dst], pop(&stacks[move.src])); + if (move.dst <= Foundation4) { + kingIndex = Cards_KingRight; + } else if (move.dst <= Cell4) { + kingIndex = Cards_KingLeft; + } +} + +static bool undo(void) { + uint len = queue.w - queue.u; + if (!len || len > QueueLen) return false; + for (uint i = len - 1; i < len; --i) { + struct Move move = queue.moves[(queue.u + i) % QueueLen]; + push(&stacks[move.src], pop(&stacks[move.dst])); + } + queue.r = queue.w = queue.u; + return true; +} + +static uint lcgState = 1; +static uint lcgRand(void) { + lcgState = (214013 * lcgState + 2531011) % (1 << 31); + return lcgState / (1 << 16); +} + +// <https://rosettacode.org/wiki/Deal_cards_for_FreeCell> +static void deal(uint game) { + lcgState = game; + + queue.r = queue.w = queue.u = 0; + for (uint i = 0; i < StacksLen; ++i) { + clear(&stacks[i]); + } + kingIndex = Cards_KingRight; + + struct Stack deck = {0}; + for (Card i = Cards_A; i <= Cards_K; ++i) { + push(&deck, Cards_Club + i); + push(&deck, Cards_Diamond + i); + push(&deck, Cards_Heart + i); + push(&deck, Cards_Spade + i); + } + + uint stack = 0; + while (deck.len) { + uint i = lcgRand() % deck.len; + Card card = deck.cards[i]; + deck.cards[i] = deck.cards[--deck.len]; + push(&stacks[Tableau1 + stack++ % 8], card); + } +} + +static bool win(void) { + for (uint i = Foundation1; i <= Foundation4; ++i) { + if (stacks[i].len != 13) return false; + } + return true; +} + +static bool valid(uint dst, Card card) { + Card top = peek(&stacks[dst]); + if (dst <= Foundation4) { + if (!top) return rank(card) == Cards_A; + return suit(card) == suit(top) + && rank(card) == rank(top) + 1; + } + if (!top) return true; + if (dst >= Tableau1) { + return color(card) != color(top) + && rank(card) == rank(top) - 1; + } + return false; +} + +static void autoEnqueue(void) { + Card min[] = { Cards_K, Cards_K }; + for (uint i = Cell1; i <= Tableau8; ++i) { + for (uint j = 0; j < stacks[i].len; ++j) { + Card card = stacks[i].cards[j]; + if (rank(card) < min[color(card)]) { + min[color(card)] = rank(card); + } + } + } + + for (uint src = Cell1; src <= Tableau8; ++src) { + Card card = peek(&stacks[src]); + if (!card) continue; + if (rank(card) > Cards_2) { + if (min[!color(card)] < rank(card)) continue; + } + for (uint dst = Foundation1; dst <= Foundation4; ++dst) { + if (valid(dst, card)) { + enqueue(dst, src); + return; + } + } + } +} + +static void moveSingle(uint dst, uint src) { + if (valid(dst, peek(&stacks[src]))) { + queue.u = queue.w; + enqueue(dst, src); + } +} + +static uint moveDepth(uint src) { + struct Stack stack = stacks[src]; + if (stack.len < 2) return stack.len; + uint n = 1; + for (uint i = stack.len - 2; i < stack.len; --i, ++n) { + if (color(stack.cards[i]) == color(stack.cards[i + 1])) break; + if (rank(stack.cards[i]) != rank(stack.cards[i + 1]) + 1) break; + } + return n; +} + +static uint freeCells(uint cells[], uint dst) { + uint len = 0; + for (uint i = Cell1; i <= Tableau8; ++i) { + if (i == dst) continue; + if (!stacks[i].len) cells[len++] = i; + } + return len; +} + +static void moveColumn(uint dst, uint src) { + uint cells[StacksLen]; + uint free = freeCells(cells, dst); + + uint depth; + for (depth = moveDepth(src); depth; --depth) { + if (free < depth - 1) continue; + if (valid(dst, stacks[src].cards[stacks[src].len - depth])) break; + } + if (depth < 2 || dst <= Cell4) { + moveSingle(dst, src); + return; + } + + queue.u = queue.w; + for (uint i = 0; i < depth - 1; ++i) { + enqueue(cells[i], src); + } + enqueue(dst, src); + for (uint i = depth - 2; i < depth - 1; --i) { + enqueue(dst, cells[i]); + } +} + +enum { + CardWidth = Cards_CardWidth, + CardHeight = Cards_CardHeight, + + CellX = 0, + CellY = 0, + + KingMarginX = 13, + KingX = CellX + 4 * CardWidth + KingMarginX, + KingY = 18, + KingPadX = 3, + KingPadY = 3, + KingWidth = Cards_KingWidth + 2 * KingPadX, + KingHeight = Cards_KingHeight + 2 * KingPadY, + + FoundationX = KingX + KingWidth + KingMarginX, + FoundationY = CellY, + + StackMarginX = 7, + StackMarginY = 10, + StackDeltaY = 17, + + TableauX = StackMarginX, + TableauY = CellY + CardHeight + StackMarginY, + + KingWinMarginX = 10, + KingWinMarginY = 10, + KingWinX = KingWinMarginX, + KingWinY = CellY + CardHeight + KingWinMarginY, + KingWinWidth = 320, + KingWinHeight = 320, + + WindowWidth = 8 * CardWidth + 9 * StackMarginX + 1, + WindowHeight = KingWinY + KingWinHeight + KingWinMarginY, +}; + +static struct SDL_Rect rects[StacksLen]; + +static void initRects(void) { + SDL_Rect rect = { CellX, CellY, CardWidth, CardHeight }; + for (uint i = Cell1; i <= Cell4; ++i) { + rects[i] = rect; + rect.x += CardWidth; + } + + rect.x = FoundationX; + rect.y = FoundationY; + for (uint i = Foundation1; i <= Foundation4; ++i) { + rects[i] = rect; + rect.x += CardWidth; + } + + rect.x = TableauX; + rect.y = TableauY; + rect.h = WindowHeight - TableauY; + for (uint i = Tableau1; i <= Tableau8; ++i) { + rects[i] = rect; + rect.x += CardWidth + StackMarginX; + } +} + +static uint pointStack(SDL_Point point) { + uint i; + for (i = 0; i < StacksLen; ++i) { + if (SDL_PointInRect(&point, &rects[i])) break; + } + return i; +} + +static SDL_Window *window; + +static void err(const char *title) { + int error = SDL_ShowSimpleMessageBox( + SDL_MESSAGEBOX_ERROR, title, SDL_GetError(), window + ); + if (error) fprintf(stderr, "%s\n", SDL_GetError()); + exit(EXIT_FAILURE); +} + +static bool playAgain(void) { + SDL_MessageBoxButtonData buttons[] = { + { SDL_MESSAGEBOX_BUTTON_RETURNKEY_DEFAULT, true, "Yes" }, + { SDL_MESSAGEBOX_BUTTON_ESCAPEKEY_DEFAULT, false, "No" }, + }; + SDL_MessageBoxData data = { + .window = window, + .title = "Game Over", + .message = "Congratulations, you win!\n\nDo you want to play again?", + .buttons = buttons, + .numbuttons = SDL_arraysize(buttons), + }; + int choice; + if (SDL_ShowMessageBox(&data, &choice) < 0) err("SDL_ShowMessageBox"); + return choice; +} + +enum Choice { + Cancel, + Column, + Single, +}; + +static enum Choice chooseMove(void) { + SDL_MessageBoxButtonData buttons[] = { + { SDL_MESSAGEBOX_BUTTON_RETURNKEY_DEFAULT, Column, "Move column" }, + { 0, Single, "Move single card" }, + { SDL_MESSAGEBOX_BUTTON_ESCAPEKEY_DEFAULT, Cancel, "Cancel" }, + }; + SDL_MessageBoxData data = { + .window = window, + .title = "Move to Empty Column...", + .message = "", + .buttons = buttons, + .numbuttons = SDL_arraysize(buttons), + }; + int choice; + if (SDL_ShowMessageBox(&data, &choice) < 0) err("SDL_ShowMessageBox"); + return choice; +} + +static void newGame(uint game) { + if (!game) game = 1 + randUniform(32000); + deal(game); + char buf[sizeof("FreeCell Game #32000")]; + snprintf(buf, sizeof(buf), "FreeCell Game #%u", game); + SDL_SetWindowTitle(window, buf); +} + +static Card hiliteRank; +static SDL_Point revealPoint; +static uint fromStack = StacksLen; + +static bool keyDown(SDL_KeyboardEvent key) { + switch (key.keysym.sym) { + case SDLK_F2: newGame(0); return true; + case SDLK_BACKSPACE: return undo(); + } + if (key.repeat) return false; + switch (key.keysym.sym) { + break; case SDLK_a: hiliteRank = Cards_A; + break; case SDLK_2: hiliteRank = Cards_2; + break; case SDLK_3: hiliteRank = Cards_3; + break; case SDLK_4: hiliteRank = Cards_4; + break; case SDLK_5: hiliteRank = Cards_5; + break; case SDLK_6: hiliteRank = Cards_6; + break; case SDLK_7: hiliteRank = Cards_7; + break; case SDLK_8: hiliteRank = Cards_8; + break; case SDLK_9: hiliteRank = Cards_9; + break; case SDLK_1: hiliteRank = Cards_10; + break; case SDLK_0: hiliteRank = Cards_10; + break; case SDLK_j: hiliteRank = Cards_J; + break; case SDLK_q: hiliteRank = Cards_Q; + break; case SDLK_k: hiliteRank = Cards_K; + break; default: return false; + } + return true; +} + +static bool keyUp(SDL_KeyboardEvent key) { + (void)key; + if (hiliteRank) { + hiliteRank = 0; + return true; + } + return false; +} + +static bool mouseButtonDown(SDL_MouseButtonEvent button) { + if (button.button == SDL_BUTTON_RIGHT) { + revealPoint.x = button.x; + revealPoint.y = button.y; + return true; + } + return false; +} + +static bool mouseButtonUp(SDL_MouseButtonEvent button) { + if (win() && playAgain()) { + newGame(0); + return true; + } + + if (button.button == SDL_BUTTON_RIGHT && revealPoint.x) { + revealPoint.x = 0; + revealPoint.y = 0; + return true; + } + + SDL_Point point = { button.x, button.y }; + uint stack = pointStack(point); + if (button.clicks % 2 == 0) { + for (stack = Cell1; stack <= Cell4; ++stack) { + if (!stacks[stack].len) break; + } + } + + if (fromStack < StacksLen && stack < StacksLen) { + if (moveDepth(fromStack) > 1 && stack > Cell4 && !stacks[stack].len) { + switch (chooseMove()) { + break; case Single: moveSingle(stack, fromStack); + break; case Column: moveColumn(stack, fromStack); + break; case Cancel: break; + } + } else { + moveColumn(stack, fromStack); + } + } + + if (fromStack < StacksLen) { + fromStack = StacksLen; + return true; + } + if (stack < StacksLen && stack > Foundation4 && stacks[stack].len) { + fromStack = stack; + return true; + } + + return false; +} + +static SDL_Renderer *render; +static struct { + SDL_Texture *cards[Cards_Empty]; + SDL_Texture *hilites[Cards_Empty]; + SDL_Texture *kings[Cards_FreeCellCount]; +} tex; + +static void renderOutline(SDL_Rect rect, bool out) { + int right = rect.x + rect.w - 1; + int bottom = rect.y + rect.h - 1; + SDL_Point topLeft[3] = { + { rect.x, bottom - 1 }, + { rect.x, rect.y }, + { right - 1, rect.y }, + }; + SDL_Point bottomRight[3] = { + { rect.x + 1, bottom }, + { right, bottom }, + { right, rect.y + 1 }, + }; + SDL_SetRenderDrawColor(render, 0x00, 0x00, 0x00, 0xFF); + SDL_RenderDrawLines(render, out ? bottomRight : topLeft, 3); + SDL_SetRenderDrawColor(render, 0x00, 0xFF, 0x00, 0xFF); + SDL_RenderDrawLines(render, out ? topLeft : bottomRight, 3); +} + +static void renderOutlines(void) { + for (uint i = Foundation1; i <= Cell4; ++i) { + renderOutline(rects[i], false); + } +} + +static void renderKing(void) { + SDL_Rect box = { KingX, KingY, KingWidth, KingHeight }; + renderOutline(box, true); + if (win()) { + SDL_Rect king = { KingWinX, KingWinY, KingWinWidth, KingWinHeight }; + SDL_RenderCopy(render, tex.kings[Cards_KingWin], NULL, &king); + } else { + SDL_Rect king = { + KingX + KingPadX, KingY + KingPadY, + Cards_KingWidth, Cards_KingHeight, + }; + SDL_RenderCopy(render, tex.kings[kingIndex], NULL, &king); + } +} + +static void renderCard(SDL_Rect rect, Card card, bool hilite) { + SDL_Texture *texture = (hilite ? tex.hilites : tex.cards)[card]; + SDL_RenderCopy(render, texture, NULL, &rect); +} + +static void renderStack(uint stack) { + Card revealCard = 0; + SDL_Rect revealRect = {0}; + SDL_Rect rect = { rects[stack].x, rects[stack].y, CardWidth, CardHeight }; + for (uint i = 0; i < stacks[stack].len; ++i) { + Card card = stacks[stack].cards[i]; + if (SDL_PointInRect(&revealPoint, &rect)) { + revealCard = card; + revealRect = rect; + } + bool hilite = (stack == fromStack && i == stacks[stack].len - 1); + renderCard(rect, card, hilite || rank(card) == hiliteRank); + rect.y += StackDeltaY; + } + if (revealCard) { + renderCard(revealRect, revealCard, false); + } +} + +static void renderStacks(void) { + for (uint i = Foundation1; i <= Cell4; ++i) { + Card card = peek(&stacks[i]); + if (!card) continue; + bool hilite = (i == fromStack || rank(card) == hiliteRank); + renderCard(rects[i], card, hilite); + } + for (uint i = Tableau1; i <= Tableau8; ++i) { + renderStack(i); + } +} + +int main(int argc, char *argv[]) { + int error; + + if (SDL_Init(SDL_INIT_VIDEO) < 0) err("SDL_Init"); + atexit(SDL_Quit); + + struct Paths paths; + if (assetPaths(&paths) < 0) err("SDL_GetPrefPath"); + + bool haveFreeCell = false; + struct { + SDL_Surface *cards[Cards_Empty]; + SDL_Surface *freeCell[Cards_FreeCellCount]; + } res; + + SDL_RWops *rw = assetOpenCards(&paths); + if (!rw) return EXIT_FAILURE; + error = Cards_LoadCards( + res.cards, Cards_Empty, rw, + Cards_AlphaCorners | Cards_BlackBorders + ); + if (error) err("Cards_LoadCards"); + SDL_RWclose(rw); + + rw = assetOpenFreeCell(&paths); + if (rw) { + haveFreeCell = true; + error = Cards_LoadFreeCell( + res.freeCell, Cards_FreeCellCount, rw, + Cards_ColorKey + ); + if (error) err("Cards_LoadFreeCell"); + SDL_RWclose(rw); + } + + error = SDL_CreateWindowAndRenderer( + WindowWidth, WindowHeight, SDL_WINDOW_ALLOW_HIGHDPI, + &window, &render + ); + if (error) err("SDL_CreateWindowAndRenderer"); + SDL_SetWindowTitle(window, "FreeCell"); + + SDL_RenderSetIntegerScale(render, SDL_TRUE); + SDL_RenderSetLogicalSize(render, WindowWidth, WindowHeight); + + for (uint i = 0; i < Cards_Empty; ++i) { + if (!res.cards[i]) continue; + + tex.cards[i] = SDL_CreateTextureFromSurface(render, res.cards[i]); + if (!tex.cards[i]) err("SDL_CreateTextureFromSurface"); + + if (Cards_InvertSurface(res.cards[i]) < 0) err("Cards_hilitesurface"); + tex.hilites[i] = SDL_CreateTextureFromSurface(render, res.cards[i]); + if (!tex.hilites[i]) err("SDL_CreateTextureFromSurface"); + + SDL_FreeSurface(res.cards[i]); + } + + if (haveFreeCell) { + for (uint i = 0; i < Cards_FreeCellCount; ++i) { + if (!res.freeCell[i]) continue; + tex.kings[i] = SDL_CreateTextureFromSurface(render, res.freeCell[i]); + if (!tex.kings[i]) err("SDL_CreateTextureFromSurface"); + SDL_FreeSurface(res.freeCell[i]); + } + } + + srand(time(NULL)); + newGame(argc > 1 ? strtoul(argv[1], NULL, 10) : 0); + + initRects(); + for (;;) { + SDL_SetRenderDrawColor(render, 0x00, 0xAA, 0x55, 0xFF); + SDL_RenderClear(render); + renderOutlines(); + renderStacks(); + if (haveFreeCell) renderKing(); + SDL_RenderPresent(render); + + if (queue.r < queue.w) { + dequeue(); + if (queue.r == queue.w) autoEnqueue(); + if (queue.r < queue.w) SDL_Delay(50); + continue; + } + + bool update = false; + while (!update) { + SDL_Event event; + SDL_WaitEvent(&event); + switch (event.type) { + break; case SDL_QUIT: return EXIT_SUCCESS; + break; case SDL_KEYDOWN: update = keyDown(event.key); + break; case SDL_KEYUP: update = keyUp(event.key); + break; case SDL_MOUSEBUTTONDOWN: { + update = mouseButtonDown(event.button); + } + break; case SDL_MOUSEBUTTONUP: { + update = mouseButtonUp(event.button); + } + } + } + } +} diff --git a/layout.h b/layout.h new file mode 100644 index 0000000..cbff6df --- /dev/null +++ b/layout.h @@ -0,0 +1,110 @@ +/* Copyright (C) 2019 C. McEnroe <june@causal.agency> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +#ifndef LAYOUT_H +#define LAYOUT_H + +#include <SDL_rect.h> +#include <assert.h> + +#include "stack.h" + +#ifndef LAYOUT_CAP +#define LAYOUT_CAP 64 +#endif + +typedef unsigned uint; + +struct Item { + SDL_Rect rect; + Card card; +}; + +struct List { + uint len; + struct Item items[LAYOUT_CAP]; +}; + +static inline void listClear(struct List *list) { + list->len = 0; +} + +static inline void +listPush(struct List *list, const struct SDL_Rect *rect, Card card) { + assert(list->len < LAYOUT_CAP); + struct Item item = { *rect, card }; + list->items[list->len++] = item; +} + +static inline struct Item *listFind(struct List *list, const SDL_Point *point) { + for (uint i = list->len - 1; i < list->len; --i) { + if (SDL_PointInRect(point, &list->items[i].rect)) { + return &list->items[i]; + } + } + return NULL; +} + +struct Layout { + struct List main; + struct List drag; + struct Item dragItem; +}; + +static inline void layoutClear(struct Layout *layout) { + listClear(&layout->main); + listClear(&layout->drag); +} + +struct Style { + uint increment; + int deltaXBack; + int deltaYBack; + int deltaXFront; + int deltaYFront; +}; + +enum { + SquareIncrement = 24 / 3, + SquareDeltaX = 2, + SquareDeltaY = 1, +}; +static const struct Style Flat = { 1, 0, 0, 0, 0 }; +static const struct Style Square = { + SquareIncrement, SquareDeltaX, SquareDeltaY, SquareDeltaX, SquareDeltaY, +}; + +static inline void +layoutStack( + struct Layout *layout, SDL_Rect *rect, + const struct Stack *stack, const struct Style *style +) { + struct List *list = &layout->main; + for (uint i = 0; i < stack->len; ++i) { + Card card = stack->cards[i]; + if (card == layout->dragItem.card) { + list = &layout->drag; + *rect = layout->dragItem.rect; + } + listPush(list, rect, card); + if ((i + 1) % style->increment == 0) { + rect->x += (card > 0 ? style->deltaXFront : style->deltaXBack); + rect->y += (card > 0 ? style->deltaYFront : style->deltaYBack); + } + } +} + +#endif diff --git a/sol.c b/sol.c new file mode 100644 index 0000000..48a61a2 --- /dev/null +++ b/sol.c @@ -0,0 +1,395 @@ +/* Copyright (C) 2019 C. McEnroe <june@causal.agency> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +#include <stdbool.h> +#include <stdio.h> +#include <stdlib.h> +#include <time.h> + +#include <SDL.h> +#include <cards.h> + +#include "asset.h" +#include "layout.h" +#include "stack.h" + +#define ARRAY_LEN(a) (sizeof(a) / sizeof((a)[0])) + +enum { + Stock, + Waste1, + Waste3, + Foundation1, + Foundation2, + Foundation3, + Foundation4, + Tableau1, + Tableau2, + Tableau3, + Tableau4, + Tableau5, + Tableau6, + Tableau7, + StacksLen, +}; + +static struct Stack stacks[StacksLen]; + +// TODO: Scoring method, score, time. +static struct { + uint draw; +} game = { + .draw = 3, +}; + +typedef void StackFn(struct Stack *dst, struct Stack *src, Uint8 len); + +static struct { + StackFn *fn; + uint dst; + uint src; + uint len; +} undo; + +static void gameDo(StackFn *fn, uint dst, uint src, uint len) { + undo.fn = fn; + undo.dst = src; + undo.src = dst; + undo.len = len; + fn(&stacks[dst], &stacks[src], len); +} + +static bool gameUndo(void) { + if (!undo.fn) return false; + undo.fn(&stacks[undo.dst], &stacks[undo.src], undo.len); + undo.fn = NULL; + return true; +} + +static void gameDeal(void) { + undo.fn = NULL; + for (uint i = 0; i < StacksLen; ++i) { + clear(&stacks[i]); + } + stacks[Stock] = Deck; + shuffle(&stacks[Stock]); + for (uint i = Tableau1; i <= Tableau7; ++i) { + moveTo(&stacks[i], &stacks[Stock], i - Tableau1); + flipTo(&stacks[i], &stacks[Stock], 1); + } +} + +static void gameDraw(void) { + moveTo(&stacks[Waste1], &stacks[Waste3], stacks[Waste3].len); + if (stacks[Stock].len) { + if (game.draw > 1) { + gameDo(flipTo, Waste3, Stock, game.draw); + } else { + gameDo(flipTo, Waste1, Stock, 1); + } + } else { + gameDo(flipTo, Stock, Waste1, stacks[Waste1].len); + } +} + +static bool gameFind(uint *stack, uint *index, Card card) { + for (*stack = 0; *stack < StacksLen; ++*stack) { + for (*index = 0; *index < stacks[*stack].len; ++*index) { + if (stacks[*stack].cards[*index] == card) return true; + } + } + return false; +} + +static bool gameAvail(Card card) { + uint stack, index; + if (card < 0) return false; + if (!gameFind(&stack, &index, card)) return false; + + bool top = (card == peek(&stacks[stack])); + if (stack == Waste1) { + return top && !stacks[Waste3].len; + } else if (stack == Waste3) { + return top; + } else if (stack >= Foundation1 && stack <= Foundation4) { + return top; + } else if (stack >= Tableau1 && stack <= Tableau7) { + return true; + } else { + return false; + } +} + +static bool gameReveal(Card card) { + uint stack, index; + if (!gameFind(&stack, &index, card)) return false; + if (stack < Tableau1 || stack > Tableau7) return false; + if (card != peek(&stacks[stack])) return false; + if (card > 0) return false; + gameDo(flipTo, stack, stack, 1); + return true; +} + +static bool gameMove(uint dest, Card card) { + uint source, index; + if (!gameFind(&source, &index, card)) return false; + if (source == dest) return false; + + uint count = stacks[source].len - index; + Card destTop = peek(&stacks[dest]); + + if (dest >= Foundation1 && dest <= Foundation4) { + if (count > 1) return false; + if (!destTop && rank(card) != Cards_A) return false; + if (destTop && suit(card) != suit(destTop)) return false; + if (destTop && rank(card) != rank(destTop) + 1) return false; + gameDo(moveTo, dest, source, 1); + return true; + } + + if (dest >= Tableau1 && dest <= Tableau7) { + if (!destTop && rank(card) != Cards_K) return false; + if (destTop && color(card) == color(destTop)) return false; + if (destTop && rank(card) != rank(destTop) - 1) return false; + gameDo(moveTo, dest, source, count); + return true; + } + + return false; +} + +enum { + CardWidth = Cards_CardWidth, + CardHeight = Cards_CardHeight, + + StackMarginX = 11, + StackMarginY = 6, + + StockX = StackMarginX, + StockY = StackMarginY, + + WasteX = StockX + CardWidth + StackMarginX, + WasteY = StackMarginY, + + FoundationX = WasteX + 2 * (CardWidth + StackMarginX), + FoundationY = StackMarginY, + + TableauX = StackMarginX, + TableauY = StockY + CardHeight + StackMarginY, + + FanRightDeltaX = 14, + FanDownDeltaYBack = 3, + FanDownDeltaYFront = 15, + + WindowWidth = 7 * CardWidth + 8 * StackMarginX, + WindowHeight = 2 * (StackMarginY + CardHeight) + + 6 * FanDownDeltaYBack + + 12 * FanDownDeltaYFront + + StackMarginY, +}; + +static const struct Style FanRight = { + 1, 0, 0, FanRightDeltaX, SquareDeltaY +}; +static const struct Style FanDown = { + 1, 0, FanDownDeltaYBack, 0, FanDownDeltaYFront +}; + +static struct SDL_Rect stackRects[StacksLen]; +static struct Layout layout; +static uint backTexture = Cards_Back1; + +static void updateLayout(void) { + layoutClear(&layout); + + SDL_Rect stock = { StockX, StockY, CardWidth, CardHeight }; + stackRects[Stock] = stock; + listPush(&layout.main, &stock, Cards_O); + layoutStack(&layout, &stock, &stacks[Stock], &Square); + + SDL_Rect waste = { WasteX, WasteY, CardWidth, CardHeight }; + layoutStack(&layout, &waste, &stacks[Waste1], &Square); + layoutStack(&layout, &waste, &stacks[Waste3], &FanRight); + + SDL_Rect found = { FoundationX, FoundationY, CardWidth, CardHeight }; + for (uint i = Foundation1; i <= Foundation4; ++i) { + stackRects[i] = found; + listPush(&layout.main, &found, Cards_Empty); + SDL_Rect rect = found; + layoutStack(&layout, &rect, &stacks[i], &Square); + found.x += CardWidth + StackMarginX; + } + + SDL_Rect table = { TableauX, TableauY, CardWidth, CardHeight }; + for (uint i = Tableau1; i <= Tableau7; ++i) { + stackRects[i] = table; + stackRects[i].h = WindowHeight; + SDL_Rect rect = table; + layoutStack(&layout, &rect, &stacks[i], &FanDown); + table.x += CardWidth + StackMarginX; + } +} + +static bool keyDown(SDL_KeyboardEvent key) { + switch (key.keysym.sym) { + case SDLK_F2: gameDeal(); return true; + case SDLK_BACKSPACE: return gameUndo(); + case SDLK_b: { + backTexture -= Cards_Back1; + backTexture += 1; + backTexture %= 12; + backTexture += Cards_Back1; + return true; + } + case SDLK_d: { + game.draw = (game.draw == 1 ? 3 : 1); + gameDeal(); + return true; + } + default: return false; + } +} + +static bool mouseButtonDown(SDL_MouseButtonEvent button) { + struct SDL_Point point = { button.x, button.y }; + if (SDL_PointInRect(&point, &stackRects[Stock])) { + gameDraw(); + return true; + } + struct Item *item = listFind(&layout.main, &point); + if (!item) return false; + if (!gameAvail(item->card)) return gameReveal(item->card); + if (button.clicks % 2 == 0) { + for (uint dest = Foundation1; dest <= Foundation4; ++dest) { + if (gameMove(dest, item->card)) return true; + } + return false; + } + layout.dragItem = *item; + return true; +} + +static bool mouseButtonUp(SDL_MouseButtonEvent button) { + (void)button; + if (!layout.dragItem.card) return false; + for (uint dest = 0; dest < StacksLen; ++dest) { + if (SDL_HasIntersection(&layout.dragItem.rect, &stackRects[dest])) { + if (gameMove(dest, layout.dragItem.card)) break; + } + } + layout.dragItem.card = 0; + return true; +} + +static bool mouseMotion(SDL_MouseMotionEvent motion) { + if (!motion.state) return false; + layout.dragItem.rect.x += motion.xrel; + layout.dragItem.rect.y += motion.yrel; + return true; +} + +static SDL_Renderer *render; +static SDL_Texture *textures[Cards_CardCount]; + +static void renderList(const struct List *list) { + for (uint i = 0; i < list->len; ++i) { + int tex = list->items[i].card; + if (tex < 0) tex = backTexture; + SDL_RenderCopy(render, textures[tex], NULL, &list->items[i].rect); + } +} + +static void err(const char *title) { + int error = SDL_ShowSimpleMessageBox( + SDL_MESSAGEBOX_ERROR, title, SDL_GetError(), NULL + ); + if (error) fprintf(stderr, "%s\n", SDL_GetError()); + exit(EXIT_FAILURE); +} + +int main(int argc, char *argv[]) { + (void)argc; + (void)argv; + + if (SDL_Init(SDL_INIT_VIDEO) < 0) err("SDL_Init"); + atexit(SDL_Quit); + + struct Paths paths; + if (assetPaths(&paths) < 0) err("SDL_GetPrefPath"); + + SDL_RWops *rw = assetOpenCards(&paths); + if (!rw) return EXIT_FAILURE; + + SDL_Surface *surfaces[Cards_CardCount]; + int error = Cards_LoadCards( + surfaces, Cards_CardCount, + rw, Cards_ColorKey | Cards_AlphaCorners | Cards_BlackBorders + ); + if (error) err("Cards_LoadCards"); + SDL_RWclose(rw); + + SDL_Window *window; + error = SDL_CreateWindowAndRenderer( + WindowWidth, WindowHeight, SDL_WINDOW_ALLOW_HIGHDPI, + &window, &render + ); + if (error) err("SDL_CreateWindowAndRenderer"); + SDL_SetWindowTitle(window, "Solitaire"); + + SDL_RenderSetIntegerScale(render, SDL_TRUE); + SDL_RenderSetLogicalSize(render, WindowWidth, WindowHeight); + + for (uint i = 0; i < Cards_CardCount; ++i) { + textures[i] = NULL; + if (!surfaces[i]) continue; + textures[i] = SDL_CreateTextureFromSurface(render, surfaces[i]); + if (!textures[i]) err("SDL_CreateTextureFromSurface"); + SDL_FreeSurface(surfaces[i]); + } + + srand(time(NULL)); + backTexture = Cards_Back1 + randUniform(12); + gameDeal(); + + for (;;) { + updateLayout(); + + SDL_SetRenderDrawColor(render, 0x00, 0xAA, 0x55, 0xFF); + SDL_RenderClear(render); + renderList(&layout.main); + renderList(&layout.drag); + SDL_RenderPresent(render); + + SDL_Event event; + for (;;) { + SDL_WaitEvent(&event); + if (event.type == SDL_QUIT) { + goto quit; + } else if (event.type == SDL_KEYDOWN) { + if (keyDown(event.key)) break; + } else if (event.type == SDL_MOUSEBUTTONDOWN) { + if (mouseButtonDown(event.button)) break; + } else if (event.type == SDL_MOUSEBUTTONUP) { + if (mouseButtonUp(event.button)) break; + } else if (event.type == SDL_MOUSEMOTION) { + if (mouseMotion(event.motion)) break; + } + } + } + +quit: + SDL_Quit(); +} diff --git a/stack.h b/stack.h new file mode 100644 index 0000000..c315729 --- /dev/null +++ b/stack.h @@ -0,0 +1,122 @@ +/* Copyright (C) 2019 C. McEnroe <june@causal.agency> + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +#ifndef STACK_H +#define STACK_H + +#include <assert.h> +#include <stdlib.h> + +#include <SDL_stdinc.h> +#include <cards.h> + +#ifndef STACK_CAP +#define STACK_CAP 52 +#endif + +#if STACK_CAP < 52 +#error "Stack capacity too small for deck" +#endif + +typedef Sint8 Card; + +static inline int suit(Card card) { + card = abs(card); + if (card > Cards_Spade) { + return Cards_Spade; + } else if (card > Cards_Heart) { + return Cards_Heart; + } else if (card > Cards_Diamond) { + return Cards_Diamond; + } else { + return Cards_Club; + } +} + +static inline int color(Card card) { + return suit(card) == Cards_Diamond || suit(card) == Cards_Heart; +} + +static inline int rank(Card card) { + return abs(card) - suit(card); +} + +struct Stack { + Uint8 len; + Card cards[STACK_CAP]; +}; + +static const struct Stack Deck = { + .len = 52, + .cards = { + -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, + -14, -15, -16, -17, -18, -19, -20, -21, -22, -23, -24, -25, -26, + -27, -28, -29, -30, -31, -32, -33, -34, -35, -36, -37, -38, -39, + -40, -41, -42, -43, -44, -45, -46, -47, -48, -49, -50, -51, -52, + }, +}; + +static inline void clear(struct Stack *stack) { + stack->len = 0; +} + +static inline void push(struct Stack *stack, Card card) { + assert(stack->len < STACK_CAP); + stack->cards[stack->len++] = card; +} + +static inline Card pop(struct Stack *stack) { + if (!stack->len) return 0; + return stack->cards[--stack->len]; +} + +static inline Card peek(const struct Stack *stack) { + if (!stack->len) return 0; + return stack->cards[stack->len - 1]; +} + +static inline void flipTo(struct Stack *dst, struct Stack *src, Uint8 n) { + if (n > src->len) n = src->len; + for (Uint8 i = 0; i < n; ++i) { + push(dst, -pop(src)); + } +} + +static inline void moveTo(struct Stack *dst, struct Stack *src, Uint8 n) { + if (n > src->len) n = src->len; + for (Uint8 i = 0; i < n; ++i) { + push(dst, src->cards[src->len - n + i]); + } + src->len -= n; +} + +static inline int randUniform(int bound) { + for (;;) { + int r = rand(); + if (r >= RAND_MAX % bound) return r % bound; + } +} + +static inline void shuffle(struct Stack *stack) { + for (Uint8 i = stack->len - 1; i > 0; --i) { + Uint8 j = randUniform(i + 1); + Card x = stack->cards[i]; + stack->cards[i] = stack->cards[j]; + stack->cards[j] = x; + } +} + +#endif |