├── LICENSE ├── README.md ├── demo.gif ├── main.c ├── makefile ├── map.c ├── map.h ├── snake.c ├── snake.h ├── term.c ├── term.h ├── window.c └── window.h /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | The [snake](https://en.wikipedia.org/wiki/Snake_(1998_video_game)) game written in C for the terminal. 2 | 3 | ![demo](demo.gif) 4 | 5 | The game is little (around 500 lines of code) and the code is commented. 6 | 7 | Build instructions: 8 | 9 | ```sh 10 | git clone https://github.com/ormai/snake.git 11 | cd snake/ 12 | make 13 | ./snake 14 | ``` 15 | 16 | You can move with w a s d or with h j k l, or just with the arrow keys. Press q to quit. 17 | -------------------------------------------------------------------------------- /demo.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ormai/snake/089e2eb50d4d5de95f836745f5823537e75fbd2c/demo.gif -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #define _POSIX_C_SOURCE 200809L 5 | 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | 13 | #include "map.h" 14 | #include "snake.h" 15 | #include "term.h" 16 | #include "window.h" 17 | 18 | struct game_state { 19 | float progress; 20 | bool wall_collision, self_collision; 21 | bool quit; 22 | bool pre_game; // The game waits for the first input of the player 23 | enum difficulty difficulty; 24 | }; 25 | 26 | static void new_game(struct game_state *game, struct map **m, 27 | struct snake **s) { 28 | struct map *map = *m; 29 | map_destroy(map); 30 | *m = map = map_create(); 31 | 32 | struct snake *snake = *s; 33 | snake_destroy(snake); 34 | const struct point map_center = {map->width / 2, map->height / 2}; 35 | *s = snake = snake_create(map_center, map->area); 36 | 37 | erase(); 38 | draw_walls(map); 39 | spawn_apple(map); 40 | update_score(map, snake->length); 41 | set_color(BRIGHT_GREEN); 42 | draw_point(map, snake->head); 43 | set_color(DEFAULT_COLOR); 44 | print(map->offset.y + map->height + 2, map->offset.x, 45 | "Move in any direction to start the game."); 46 | nonblocking_input(false); 47 | game->pre_game = true; 48 | game->progress = 0; 49 | } 50 | 51 | int main(void) { 52 | setlocale(LC_ALL, ""); 53 | term_init(); 54 | 55 | static const struct timespec delay[] = { 56 | {0, 83333333}, {0, 83333333}, {0, 50000000}, {0, 33333333}}; 57 | 58 | struct map *map = NULL; 59 | struct snake *snake = NULL; 60 | struct game_state game = {0, false, false, false, true, INCREMENTAL}; 61 | if (!(game.quit = welcome_dialog(&game.difficulty))) { 62 | new_game(&game, &map, &snake); 63 | } 64 | 65 | while (!game.quit) { // Main loop 66 | switch (getch()) { 67 | case 'w': 68 | case 'k': 69 | case ARROW_UP: 70 | change_direction(snake, UP); 71 | break; 72 | case 'l': 73 | case 'd': 74 | case ARROW_RIGHT: 75 | change_direction(snake, RIGHT); 76 | break; 77 | case 'j': 78 | case 's': 79 | case ARROW_DOWN: 80 | change_direction(snake, DOWN); 81 | break; 82 | case 'h': 83 | case 'a': 84 | case ARROW_LEFT: 85 | change_direction(snake, LEFT); 86 | break; 87 | case 'q': 88 | game.quit = true; 89 | } 90 | 91 | if (game.pre_game) { 92 | game.pre_game = false; 93 | erase_line(map->offset.y + map->height + 2); // Hide tooltip below the map 94 | nonblocking_input(true); 95 | } 96 | 97 | if (snake->head.x == map->apple.x && snake->head.y == map->apple.y) { 98 | snake->growing = true; 99 | ++snake->length; 100 | spawn_apple(map); 101 | update_score(map, snake->length); 102 | game.progress = (snake->length + .0) / map->area; 103 | if (snake->length == map->area) { 104 | if (!(game.quit = win_dialog(map, &game.difficulty, snake->length))) { 105 | new_game(&game, &map, &snake); 106 | } 107 | } 108 | } 109 | 110 | advance(snake); 111 | 112 | // Game over after collision 113 | if ((game.wall_collision = !is_inside(map, snake))) { 114 | set_color(RED); 115 | draw_point(map, snake->length > 1 ? snake->body[snake->length - 2] 116 | : snake->old_tail); 117 | } else { 118 | redraw_snake(map, snake); 119 | } 120 | if ((game.self_collision = self_collision(snake))) { 121 | set_color(RED); 122 | draw_point(map, snake->head); 123 | } 124 | if ((game.wall_collision || game.self_collision) && 125 | !(game.quit = over_dialog(map, &game.difficulty, snake->length))) { 126 | new_game(&game, &map, &snake); 127 | } 128 | 129 | if (game.difficulty == INCREMENTAL) { 130 | const struct timespec sleep = { 131 | 0, delay[EASY].tv_nsec - delay[HARD].tv_nsec * game.progress}; 132 | nanosleep(&sleep, NULL); 133 | } else { 134 | nanosleep(&delay[game.difficulty], NULL); 135 | } 136 | } 137 | 138 | snake_destroy(snake); 139 | map_destroy(map); 140 | term_finalize(); 141 | return 0; 142 | } 143 | -------------------------------------------------------------------------------- /makefile: -------------------------------------------------------------------------------- 1 | .POSIX: 2 | .PHONY: all clean 3 | 4 | SANITIZERS = -fsanitize=address,leak,undefined 5 | WARNINGS = -Wall -Wextra -Wpedantic \ 6 | -Wformat=2 -Wno-unused-parameter -Wshadow \ 7 | -Wwrite-strings -Wstrict-prototypes -Wold-style-definition \ 8 | -Wredundant-decls -Wnested-externs -Wmissing-include-dirs 9 | 10 | 11 | # `make DEBUG=whatever` to enable a sort of dev profile 12 | CFLAGS = -O0 -g $(SANITIZERS) $(WARNINGS) 13 | CFLAGS$(DEBUG) = -O3 -DNDEBUG 14 | 15 | all: snake 16 | 17 | snake: main.c snake.o window.o map.o term.o 18 | $(CC) $(CFLAGS) -o $@ $^ 19 | snake.o: snake.c snake.h 20 | window.o: window.c snake.h term.h window.h 21 | map.o: map.c map.h snake.h term.h window.h 22 | term.o: term.c term.h 23 | 24 | 25 | clean: 26 | rm -f snake *.o 27 | -------------------------------------------------------------------------------- /map.c: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #include 5 | #include 6 | 7 | #include "map.h" 8 | #include "snake.h" 9 | #include "term.h" 10 | #include "window.h" 11 | 12 | struct map *map_create(void) { 13 | struct map *map = malloc(sizeof(struct map)); 14 | 15 | const struct winsize ws = get_term_size(); 16 | map->width = ws.ws_col / 3; // see translate() 17 | map->height = ws.ws_row * 2 / 3; 18 | map->area = map->width * map->height; 19 | map->offset = (struct point){(ws.ws_col - map->width * 2) / 2, 20 | (ws.ws_row - map->height) / 2}; 21 | 22 | map->grid = malloc(sizeof(int * [map->height + 1])); 23 | for (int i = 0; i <= map->height; ++i) { 24 | map->grid[i] = calloc(map->width + 1, sizeof(int)); 25 | } 26 | 27 | return map; 28 | } 29 | 30 | void map_destroy(struct map *map) { 31 | if (map != NULL) { 32 | if (map->grid != NULL) { 33 | for (int i = 0; i <= map->height; ++i) { 34 | free(map->grid[i]); 35 | } 36 | free(map->grid); 37 | } 38 | free(map); 39 | map = NULL; 40 | } 41 | } 42 | 43 | bool is_inside(const struct map *map, const struct snake *snake) { 44 | const struct point head = snake->body[snake->length - 1]; 45 | return head.x <= map->width && head.x >= 0 && head.y <= map->height && 46 | head.y >= 0; 47 | } 48 | 49 | void spawn_apple(struct map *map) { 50 | static const unsigned max_tries = 5; 51 | unsigned tries = 0; 52 | do { 53 | if (tries++ > max_tries) { 54 | // After max_tries use the first available point 55 | bool found_it = false; 56 | for (int i = 0; i < map->height && !found_it; ++i) { 57 | for (int j = 0; j < map->width && !found_it; ++j) { 58 | if (map->grid[i][j] == false) { 59 | found_it = true; 60 | map->grid[i][j] = true; 61 | map->apple = (struct point){i, j}; 62 | } 63 | } 64 | } 65 | } 66 | map->apple.x = rand() % (map->width + 1); 67 | map->apple.y = rand() % (map->height + 1); 68 | } while (map->grid[map->apple.y][map->apple.x] == true); 69 | set_color(MAGENTA); 70 | draw_point(map, map->apple); 71 | } 72 | -------------------------------------------------------------------------------- /map.h: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #ifndef MAP_H 5 | #define MAP_H 6 | 7 | #include 8 | 9 | #include "snake.h" 10 | 11 | struct map { 12 | int width, height; 13 | unsigned area; 14 | struct point offset; // top-left offset to center the map 15 | struct point apple; 16 | int **grid; 17 | }; 18 | 19 | struct map *map_create(void); 20 | void map_destroy(struct map *map); 21 | 22 | // Check for collision with the walls 23 | bool is_inside(const struct map *map, const struct snake *snake); 24 | 25 | // Spawn a new apple and draw it on the map 26 | void spawn_apple(struct map *map); 27 | 28 | #endif // MAP_H 29 | -------------------------------------------------------------------------------- /snake.c: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #include 5 | #include 6 | #include 7 | 8 | #include "snake.h" 9 | 10 | struct snake *snake_create(const struct point head, const size_t size) { 11 | struct snake *snake = calloc(1, sizeof(struct snake)); 12 | snake->body = malloc(sizeof(struct point[size + 1])); 13 | snake->body[0] = head; 14 | snake->head = head; 15 | snake->length = 1; 16 | snake->growing = false; 17 | snake->direction = DOWN; 18 | return snake; 19 | } 20 | 21 | void snake_destroy(struct snake *snake) { 22 | if (snake != NULL) { 23 | free(snake->body); 24 | free(snake); 25 | snake = NULL; 26 | } 27 | } 28 | 29 | bool self_collision(const struct snake *snake) { 30 | for (size_t i = 0; i < snake->length - 1; ++i) { 31 | if (snake->body[i].x == snake->head.x && 32 | snake->body[i].y == snake->head.y) { 33 | return true; 34 | } 35 | } 36 | return false; 37 | } 38 | 39 | void advance(struct snake *snake) { 40 | snake->old_tail = snake->body[0]; 41 | 42 | if (snake->growing) { 43 | snake->growing = false; 44 | snake->body[snake->length - 1] = snake->head; 45 | } else if (snake->length > 1) { 46 | memmove(snake->body, snake->body + 1, 47 | sizeof(struct point[snake->length - 1])); 48 | } 49 | 50 | switch (snake->direction) { 51 | case UP: 52 | --snake->head.y; 53 | break; 54 | case RIGHT: 55 | ++snake->head.x; 56 | break; 57 | case DOWN: 58 | ++snake->head.y; 59 | break; 60 | case LEFT: 61 | --snake->head.x; 62 | break; 63 | } 64 | snake->body[snake->length - 1] = snake->head; 65 | } 66 | 67 | void change_direction(struct snake *self, enum direction direction) { 68 | // Disallow moving from DOWN to UP and from RIGHT to LEFT and vice versa when 69 | // the snake is longer than 1. 70 | if (direction != self->direction && 71 | !(self->length > 1 && direction == (self->direction + 2) % (LEFT + 1))) { 72 | self->direction = direction; 73 | } 74 | } 75 | -------------------------------------------------------------------------------- /snake.h: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #ifndef SNAKE_H 5 | #define SNAKE_H 6 | 7 | #include 8 | #include 9 | 10 | enum direction { UP, RIGHT, DOWN, LEFT }; 11 | 12 | // Coordinates from the top left corner of the map 13 | struct point { 14 | int x, y; 15 | }; 16 | 17 | struct snake { 18 | size_t length; // Also the score 19 | struct point old_tail; // Previous position of the tail 20 | bool growing; 21 | enum direction direction; 22 | struct point head; // would be body[length - 1], for easy access 23 | struct point *body; 24 | }; 25 | 26 | struct snake *snake_create(const struct point head, const size_t size); 27 | void snake_destroy(struct snake *self); 28 | 29 | // Move the snake one cell forward in the current direction 30 | void advance(struct snake *self); 31 | 32 | void change_direction(struct snake *self, const enum direction direction); 33 | 34 | // Check whether the snake's head overlaps with any other point of its body 35 | bool self_collision(const struct snake *snake); 36 | 37 | #endif // SNAKE_H 38 | -------------------------------------------------------------------------------- /term.c: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #include "term.h" 13 | 14 | static struct termios saved_attr; 15 | 16 | void term_init(void) { 17 | // Switch to alternative screen, so that the previous terminal can be restored 18 | printf(CSI "?1049h"); 19 | 20 | tcgetattr(STDIN_FILENO, &saved_attr); 21 | nonblocking_input(true); 22 | 23 | struct termios t; 24 | tcgetattr(STDIN_FILENO, &t); 25 | t.c_lflag &= ~(ECHO | ICANON); // disable echo and canonical input mode 26 | tcsetattr(STDIN_FILENO, TCSANOW, &t); 27 | 28 | printf(CSI "?25l"); // make cursor invisible 29 | } 30 | 31 | void term_finalize(void) { 32 | printf(CSI "?25h"); // make cursor visible 33 | tcsetattr(STDIN_FILENO, TCSANOW, &saved_attr); 34 | printf(CSI "?1049l"); // switch back from alternative screen 35 | } 36 | 37 | int getch(void) { 38 | const int c = getchar(); 39 | if (c == ESC) { 40 | getchar(); // skip [ 41 | return ESC + '[' + getchar(); 42 | } 43 | return c; 44 | } 45 | 46 | struct winsize get_term_size(void) { 47 | struct winsize w; 48 | ioctl(STDOUT_FILENO, TIOCGWINSZ, &w); 49 | return w; 50 | } 51 | 52 | void nonblocking_input(const bool enabled) { 53 | if (enabled) { 54 | fcntl(STDIN_FILENO, F_SETFL, O_NONBLOCK); 55 | } else { 56 | const int flag = fcntl(STDIN_FILENO, F_GETFL); 57 | fcntl(STDIN_FILENO, F_SETFL, flag & ~O_NONBLOCK); 58 | } 59 | } 60 | 61 | void set_color(const enum color color) { printf(CSI "%dm", color); } 62 | 63 | void erase(void) { printf(CSI "2J"); } 64 | 65 | static inline void move(const int y, const int x) { 66 | printf(CSI "%d;%dH", y + 1, x + 1); 67 | } 68 | 69 | void erase_line(const int y) { 70 | move(y, 0); 71 | printf(CSI "2K"); 72 | } 73 | 74 | void print(const int y, const int x, const char *fmt, ...) { 75 | move(y, x); 76 | 77 | char buf[2048]; 78 | va_list ap; 79 | va_start(ap, fmt); 80 | vsnprintf(buf, 2048, fmt, ap); 81 | buf[2047] = '\0'; 82 | va_end(ap); 83 | 84 | printf("%s", buf); 85 | } 86 | -------------------------------------------------------------------------------- /term.h: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | // This header and the accompanying term.c provide a subset of the features of 5 | // ncurses. This is accomplished by relying on the POSIX interface for the 6 | // terminal, and on terminal escape sequences. 7 | // 8 | // - This helped me get started: https://github.com/byllgrim/ansicurses 9 | // - Escape codes: https://gist.github.com/fnky/458719343aabd01cfb17a3a4f7296797 10 | 11 | #ifndef TERM_H 12 | #define TERM_H 13 | 14 | #include 15 | #include 16 | 17 | #define ESC '\033' 18 | #define CSI "\033[" // Control Sequence Introducer 19 | 20 | enum color { 21 | BLACK = 30, 22 | RED, 23 | GREEN, 24 | YELLOW, 25 | BLUE, 26 | MAGENTA, 27 | CYAN, 28 | WHITE, 29 | DEFAULT_COLOR = 39, 30 | BRIGHT_BLACK = 90, 31 | BRIGHT_RED, 32 | BRIGHT_GREEN, 33 | BRIGHT_YELLO, 34 | BRIGHT_BLUE, 35 | BRIGHT_MAGENTA, 36 | BRIGHT_CYAN, 37 | BRIGHT_WHITE 38 | }; 39 | 40 | enum arrow_key { 41 | ARROW_UP = '\033' + '[' + 'A', 42 | ARROW_DOWN, 43 | ARROW_RIGHT, 44 | ARROW_LEFT 45 | }; 46 | 47 | // Makes changes to the terminal 48 | void term_init(void); 49 | 50 | // Restores the terminal behavior and its previous state 51 | void term_finalize(void); 52 | 53 | // Terminals treat the arrow keys as escape sequences 54 | // up: ^[[A, down: ^[[B, right: ^[[C, left: ^[[D; where ^[ is ESC. 55 | // This can be seen by launching cat without a file and pressing the arrow keys. 56 | // This function is just a wrapper around getchar that detects the arrow keys. 57 | int getch(void); 58 | 59 | // Returns the terminal size in rows and cols inside the struct winsize 60 | struct winsize get_term_size(void); 61 | 62 | // Enable/disable non blocking mode for standard input 63 | void nonblocking_input(const bool enabled); 64 | 65 | // Sets the foreground color for standard output 66 | void set_color(const enum color color); 67 | 68 | // Erase everything on the terminal, like 'clear' in the command line 69 | void erase(void); 70 | 71 | // Erase the y-th line in the terminal 72 | void erase_line(const int y); 73 | 74 | // Print a formatted string at line y and column x. 75 | // For multi byte characters to work an appropriate locale must be set. 76 | void print(int y, int x, const char *fmt, ...); 77 | 78 | #endif // TERM_H 79 | -------------------------------------------------------------------------------- /window.c: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #define _POSIX_C_SOURCE 200809L 5 | 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | 12 | #include "snake.h" 13 | #include "term.h" 14 | #include "window.h" 15 | 16 | // Translate an x coordinate to display on the map. Two cells represent one 17 | // point: "██". Eg. x = 4 maps to the 9th actual terminal column. 18 | static int translate(const int x) { return x + x + 1; } 19 | 20 | void draw_point(const struct map *map, const struct point position) { 21 | print(position.y + map->offset.y, translate(position.x) + map->offset.x, 22 | "██"); 23 | } 24 | 25 | void update_score(const struct map *map, const size_t score) { 26 | set_color(DEFAULT_COLOR); 27 | print(map->offset.y - 2, map->offset.x, "Score: %d", score); 28 | } 29 | 30 | void draw_walls(const struct map *map) { 31 | set_color(YELLOW); 32 | struct point up_left = {map->offset.x, map->offset.y - 1}, 33 | down_right = {translate(map->width) + map->offset.x + 2, 34 | map->height + map->offset.y + 1}; 35 | for (int x = up_left.x; x <= down_right.x; ++x) { 36 | print(up_left.y, x, "▄"); 37 | print(down_right.y, x, "▀"); 38 | } 39 | for (int y = up_left.y + 1; y < down_right.y; ++y) { 40 | print(y, up_left.x, "█"); 41 | print(y, down_right.x, "█"); 42 | } 43 | } 44 | 45 | void redraw_snake(const struct map *map, struct snake *snake) { 46 | map->grid[snake->old_tail.y][snake->old_tail.x] = false; 47 | 48 | if (snake->length > 1) { 49 | set_color(GREEN); 50 | draw_point(map, snake->body[snake->length - 2]); 51 | } 52 | set_color(BRIGHT_GREEN); 53 | draw_point(map, snake->head); 54 | map->grid[snake->head.y][snake->head.x] = true; 55 | 56 | print(snake->old_tail.y + map->offset.y, 57 | translate(snake->old_tail.x) + map->offset.x, " "); 58 | } 59 | 60 | static inline void update_doodle(struct snake *doodle, 61 | const struct point dialog_begin, 62 | const int dialog_height, 63 | const int dialog_width) { 64 | doodle->old_tail = doodle->body[0]; 65 | memmove(doodle->body, doodle->body + 1, 66 | sizeof(struct point[doodle->length - 1])); 67 | 68 | // Head moves forward. The doodle moves in a loop. 69 | switch (doodle->direction) { 70 | case UP: 71 | if (doodle->head.y >= dialog_begin.y) { 72 | --doodle->head.y; 73 | break; 74 | } 75 | doodle->direction = LEFT; 76 | // fallthrough 77 | case LEFT: 78 | if (doodle->head.x > dialog_begin.x) { 79 | doodle->head.x -= 2; 80 | break; 81 | } 82 | doodle->direction = DOWN; 83 | // fallthrough 84 | case DOWN: 85 | if (doodle->head.y - 1 < dialog_begin.y + dialog_height) { 86 | ++doodle->head.y; 87 | break; 88 | } 89 | doodle->direction = RIGHT; 90 | // fallthrough 91 | case RIGHT: 92 | if (doodle->head.x < dialog_begin.x + dialog_width - 1) { 93 | doodle->head.x += 2; 94 | break; 95 | } 96 | doodle->direction = UP; 97 | --doodle->head.y; 98 | } 99 | doodle->body[doodle->length - 1] = doodle->head; 100 | set_color(BRIGHT_GREEN); 101 | print(doodle->head.y, doodle->head.x, "██"); 102 | if (doodle->length >= 2) { 103 | set_color(GREEN); 104 | const struct point pre_head = doodle->body[doodle->length - 2]; 105 | print(pre_head.y, pre_head.x, "██"); 106 | } 107 | print(doodle->old_tail.y, doodle->old_tail.x, " "); 108 | nanosleep(&(struct timespec){0, 33333333}, NULL); 109 | } 110 | 111 | static const char *diff[] = {" incremental >", " < easy > ", 112 | " < medium > ", " < hard "}; 113 | 114 | bool welcome_dialog(enum difficulty *difficulty) { 115 | static const char *welcome[] = { 116 | "", 117 | " _", 118 | " | |", 119 | " ___ _ __ __ _| | _____ ___", 120 | " / __| '_ \\ / _` | |/ / _ \\ / __|", 121 | " \\__ \\ | | | (_| | < __/| (__", 122 | " |___/_| |_|\\__,_|_|\\_\\___(_)___|", 123 | "", 124 | "", 125 | " by Mario D'Andrea ", 126 | "", 127 | " Difficulty %s", 128 | "", 129 | " Quit [q] Play [⏎]", 130 | "", 131 | ""}; 132 | static const int height = 16, width = 57; 133 | const struct winsize ws = get_term_size(); 134 | const struct point begin = {ws.ws_col / 2 - width / 2 + 1, 135 | ws.ws_row / 2 - height / 2 + 1}; 136 | 137 | struct snake *doodle = snake_create((struct point){begin.x, begin.y + 2}, 7); 138 | doodle->direction = DOWN; 139 | set_color(GREEN); 140 | for (int i = 0; i < 7; ++i) { // Make it long 7 141 | doodle->head = doodle->body[doodle->length] = 142 | (struct point){begin.x, doodle->head.y + 1}; 143 | ++doodle->length; 144 | print(doodle->head.y, doodle->head.x, "██"); 145 | } 146 | 147 | set_color(DEFAULT_COLOR); 148 | for (int y = begin.y, i = 0; y < begin.y + height; ++y, ++i) { 149 | if (i == 11) { 150 | print(y, begin.x + 3, welcome[i], diff[*difficulty]); 151 | } else { 152 | print(y, begin.x, welcome[i]); 153 | } 154 | } 155 | 156 | while (true) { 157 | switch (getch()) { 158 | case '\n': 159 | case 'y': { 160 | snake_destroy(doodle); 161 | return false; 162 | } 163 | case '>': 164 | case ARROW_RIGHT: 165 | if (*difficulty != HARD) { 166 | ++*difficulty; 167 | set_color(DEFAULT_COLOR); 168 | print(begin.y + 11, begin.x + 3, welcome[11], diff[*difficulty]); 169 | } 170 | break; 171 | case '<': 172 | case ARROW_LEFT: 173 | if (*difficulty != INCREMENTAL) { 174 | --*difficulty; 175 | set_color(DEFAULT_COLOR); 176 | print(begin.y + 11, begin.x + 3, welcome[11], diff[*difficulty]); 177 | } 178 | break; 179 | case 'n': 180 | case 'q': 181 | snake_destroy(doodle); 182 | return true; 183 | } 184 | update_doodle(doodle, begin, height, width); 185 | } 186 | } 187 | 188 | static bool end_game_dialog(const struct map *map, enum difficulty *difficulty, 189 | const size_t score, const char *banner[]) { 190 | static const int height = 16, width = 57; 191 | const struct point begin = {map->offset.x + map->width - width / 2 + 1, 192 | map->offset.y + map->height / 2 - height / 2 + 1}; 193 | 194 | set_color(DEFAULT_COLOR); 195 | for (int y = begin.y, i = 0; y < begin.y + height; ++y, ++i) { 196 | if (i == 9) { // Plug in the score 197 | print(y, begin.x, banner[i], score); 198 | } else if (i == 11) { // Plug in the difficulty 199 | print(y, begin.x, banner[i], diff[*difficulty]); 200 | } else { 201 | print(y, begin.x, banner[i]); 202 | } 203 | } 204 | 205 | nonblocking_input(false); 206 | while (true) { 207 | switch (getch()) { 208 | case '\n': 209 | case 'y': { 210 | return false; 211 | } 212 | case '>': 213 | case ARROW_RIGHT: 214 | if (*difficulty != HARD) { 215 | ++*difficulty; 216 | set_color(DEFAULT_COLOR); 217 | print(begin.y + 11, begin.x, banner[11], diff[*difficulty]); 218 | } 219 | break; 220 | case '<': 221 | case ARROW_LEFT: 222 | if (*difficulty != INCREMENTAL) { 223 | --*difficulty; 224 | set_color(DEFAULT_COLOR); 225 | print(begin.y + 11, begin.x, banner[11], diff[*difficulty]); 226 | } 227 | break; 228 | case 'n': 229 | case 'q': 230 | return true; 231 | } 232 | } 233 | } 234 | 235 | bool over_dialog(const struct map *map, enum difficulty *difficulty, 236 | const size_t score) { 237 | static const char *over[] = { 238 | "┏━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓", 239 | "┃ _____ _____ ┃", 240 | "┃ | __ \\ | _ | ┃", 241 | "┃ | | \\/ __ _ _ __ ___ ___ | | | |_ _____ _ __ ┃", 242 | "┃ | | __ / _` | '_ ` _ \\ / _ \\ | | | \\ \\ / / _ \\ '__| ┃", 243 | "┃ | |_\\ \\ (_| | | | | | | __/ \\ \\_/ /\\ V / __/ | ┃", 244 | "┃ \\____/\\__,_|_| |_| |_|\\___| \\___/ \\_/ \\___|_| ┃", 245 | "┃ ┃", 246 | "┃ ┃", 247 | "┃ Your score was %-4d ┃", 248 | "┃ ┃", 249 | "┃ Difficulty %s ┃", 250 | "┃ ┃", 251 | "┃ Quit [q] Play again [⏎] ┃", 252 | "┃ ┃", 253 | "┗━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┛"}; 254 | return end_game_dialog(map, difficulty, score, over); 255 | } 256 | 257 | bool win_dialog(const struct map *map, enum difficulty *difficulty, 258 | const size_t score) { 259 | static const char *win[] = { 260 | "┏━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┓", 261 | "┃ __ __ _ _ ┃", 262 | "┃ \\ \\ / / | | | | ┃", 263 | "┃ \\ V /___ _ _ | | | | ___ _ __ ┃", 264 | "┃ \\ // _ \\| | | | | |/\\| |/ _ \\| '_ \\ ┃", 265 | "┃ | | (_) | |_| | \\ /\\ / (_) | | | | ┃", 266 | "┃ \\_/\\___/ \\__,_| \\/ \\/ \\___/|_| |_| ┃", 267 | "┃ ┃", 268 | "┃ ┃", 269 | "┃ Your score was %-4d ┃", 270 | "┃ ┃", 271 | "┃ Difficulty: %s ┃", 272 | "┃ ┃", 273 | "┃ Quit [q] Play again [⏎] ┃", 274 | "┃ ┃", 275 | "┗━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━┛"}; 276 | return end_game_dialog(map, difficulty, score, win); 277 | } 278 | -------------------------------------------------------------------------------- /window.h: -------------------------------------------------------------------------------- 1 | // SPDX-License-Identifier: GPL-3.0-only 2 | // Copyright © 2024 Mario D'Andrea https://ormai.dev 3 | 4 | #ifndef WINDOW_H 5 | #define WINDOW_H 6 | 7 | #include 8 | #include 9 | 10 | #include "map.h" 11 | #include "snake.h" 12 | 13 | enum difficulty { INCREMENTAL, EASY, MEDIUM, HARD }; 14 | 15 | // Draw a point consiting of "██" at position 16 | void draw_point(const struct map *map, const struct point position); 17 | 18 | void update_score(const struct map *map, const size_t score); 19 | 20 | void draw_walls(const struct map *map); 21 | 22 | // Draw the snake on the screen after it has advanced 23 | void redraw_snake(const struct map *map, struct snake *snake); 24 | 25 | // Returns true if the user wants to quit, false otherwise. 26 | bool welcome_dialog(enum difficulty *difficulty); 27 | 28 | // Returns true if the user wants to quit, false otherwise. 29 | bool over_dialog(const struct map *map, enum difficulty *difficulty, 30 | const size_t score); 31 | 32 | // Returns true if the user wants to quit, false otherwise. 33 | bool win_dialog(const struct map *map, enum difficulty *difficulty, 34 | const size_t score); 35 | 36 | #endif // WINDOW_H 37 | --------------------------------------------------------------------------------