├── COPYING ├── README ├── TODO ├── assets ├── atari8.uf1 ├── courier12.uf2 ├── geneva14.uf2 ├── losangeles12.uf2 └── venice14.uf2 └── src ├── assets.finw ├── input.finw └── main.finw /COPYING: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /README: -------------------------------------------------------------------------------- 1 | Tuor 2 | ==== 3 | 4 | Tuor is a small Gemini client for Varvara, written in Finwë. It was created to 5 | demonstrate Finwë's `Net` device extension. 6 | 7 | Currently it lacks many basic features, but the plan it to eventually polish it 8 | into one worth using. 9 | 10 | Usage 11 | ----- 12 | 13 | You will need `Finwë` installed. 14 | 15 | $ finwe -g src/main.finw 16 | 17 | You can create a standalone ROM with with Finwë's `-x` flag, but that'll require 18 | an emulator that supports the `Net` device. As of now, only Finwë's builtin 19 | emulator has this feature. 20 | 21 | Limitations 22 | ----------- 23 | 24 | * No mouse support, at all. 25 | * Tuor, being a Varvara ROM, is memory-constrained and will fail to load large 26 | webpages. (Currently the limit is quite low, since the ROM is stuffed with 27 | useless fonts.) 28 | * No multiple tabs. 29 | * No automatic redirections. 30 | * Client certifications is not supported. 31 | * User input is not supported. 32 | * No support for Gopher. (Yes, all serious Gemini clients should include some 33 | basic Gopher abilities.) 34 | 35 | All this will *eventually* be worked on (see the TODO). For now, the priority is 36 | to polish the `Net` device and work on the shortcomings in Finwë which Tuor has 37 | surfaced (rg 'TODO: Finwe:' src). 38 | -------------------------------------------------------------------------------- /TODO: -------------------------------------------------------------------------------- 1 | Roadmap 2 | ======= 3 | x :launch 4 | - Handle other status codes 5 | - 1*: Inputs, :input command 6 | - 3*: Automatic redirects 7 | - 4*, 5*: Show as text 8 | - 6*: Certificates, :cert command 9 | x Handle connection failures 10 | - Read buffer into alternate memory bank 11 | x :wq, :q, g 12 | 13 | Roadmap v2 14 | ========== 15 | - Gopher 16 | - Use multiple memory banks as "tabs" 17 | - :newgo, F keybind (link follow) 18 | - Look into history forwards feature 19 | - Mouse 20 | - Click input line to move cursor 21 | - Scroll 22 | - Click input line to edit URL 23 | - Click link 24 | - :help command 25 | - G keybind 26 | 27 | Polishing 28 | ========= 29 | - Validate arg length -- print usage if too many (or too few) args 30 | -------------------------------------------------------------------------------- /assets/atari8.uf1: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kiedtl/tuor/d6eb4cc450ec2388623e4b7839b8c1472a0c4e21/assets/atari8.uf1 -------------------------------------------------------------------------------- /assets/courier12.uf2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kiedtl/tuor/d6eb4cc450ec2388623e4b7839b8c1472a0c4e21/assets/courier12.uf2 -------------------------------------------------------------------------------- /assets/geneva14.uf2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kiedtl/tuor/d6eb4cc450ec2388623e4b7839b8c1472a0c4e21/assets/geneva14.uf2 -------------------------------------------------------------------------------- /assets/losangeles12.uf2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kiedtl/tuor/d6eb4cc450ec2388623e4b7839b8c1472a0c4e21/assets/losangeles12.uf2 -------------------------------------------------------------------------------- /assets/venice14.uf2: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/kiedtl/tuor/d6eb4cc450ec2388623e4b7839b8c1472a0c4e21/assets/venice14.uf2 -------------------------------------------------------------------------------- /src/assets.finw: -------------------------------------------------------------------------------- 1 | (struct Sprite8 [data [U8 8]]) 2 | 3 | // Taken from left 4 | (let MOUSE Sprite8 [ 5 | 0x80c0s 0xe0f0s 0xf8e0s 0x1000s 6 | ]) 7 | 8 | (let BLINKER Sprite8 [ 9 | 0x8080s 0x8080s 0x8080s 0x8080s 10 | 0x8080s 0x8080s 0x8080s 0x8080s 11 | ]) 12 | 13 | (let FONT-NORM [U8] (embed "../assets/geneva14.uf2")) 14 | (let FONT-FAT [U8] (embed "../assets/venice14.uf2")) 15 | (let FONT-EMPH [U8] (embed "../assets/losangeles12.uf2")) 16 | (let FONT-MONO [U8] (embed "../assets/courier12.uf2")) 17 | -------------------------------------------------------------------------------- /src/input.finw: -------------------------------------------------------------------------------- 1 | (use* core) 2 | (use std) 3 | 4 | (struct Ctx 5 | [cursor U16] // U16 because it leads to less casting 6 | [len U16] 7 | [buffer [U8 128]] 8 | ) 9 | 10 | #(method Ctx) 11 | (word reset (@Ctx -- ) [ 12 | move 13 | 0s (r copy) :len <- 14 | 0 128s (r move) std/memset8 15 | ]) 16 | 17 | #(method Ctx) 18 | (word cursor-left (@Ctx -- ) [ 19 | dup :cursor -> 0<> (when [ 20 | dup :cursor -> 1- swap :cursor <- 21 | ] [ drop ]) 22 | ]) 23 | 24 | #(method Ctx) 25 | (word cursor-right (@Ctx -- ) [ 26 | dup :cursor -> over :len -> < (when [ 27 | dup :cursor -> 1+ swap :cursor <- 28 | ] [ drop ]) 29 | ]) 30 | 31 | #(method Ctx) 32 | (word backspace (@Ctx -- ) [ 33 | dup :cursor -> 0= (when [ drop return ]) 34 | 35 | move 36 | 37 | (r copy) :cursor -> (r copy) :len -> swap - 38 | (r copy) :buffer (r copy) :cursor -> + (as @U8) 39 | dup 1- 40 | std/memcpy drop 41 | 42 | (r copy) :len -> 1- (r copy) :len <- 43 | 0 (r copy) :buffer (r copy) :len -> + (as @U8) <- 44 | (r copy) :cursor -> 1- (r move) :cursor <- 45 | ]) 46 | 47 | #(method Ctx) 48 | (word insert (U8 @Ctx -- ) [ 49 | move 50 | 51 | (r copy) :len -> 1+ (r copy) :len <- 52 | 53 | (r copy) :cursor -> (r copy) :len -> swap - 54 | (r copy) :buffer (r copy) :cursor -> + (as @U8) 55 | dup 1+ 56 | std/memcpyr 57 | 58 | (r copy) :buffer (r copy) :cursor -> + (as @U8) <- 59 | (r copy) :cursor -> 1+ (r move) :cursor <- 60 | ]) 61 | 62 | // Appends a string to the end of the buffer and 63 | // moves the cursor to the very end. 64 | // 65 | #(method Ctx) 66 | (word append-string (@U8 @Ctx -- ) [ 67 | move 68 | 69 | dup 70 | (r copy) :buffer 71 | (r copy) :len -> + (as @U8) 72 | std/strcat drop 73 | 74 | std/strlen 75 | (r copy) :len -> + (r copy) :len <- 76 | 77 | (r copy) :len -> 78 | (r move) :cursor <- 79 | ]) 80 | -------------------------------------------------------------------------------- /src/main.finw: -------------------------------------------------------------------------------- 1 | // TODO: Finwe: need for dummy values when using while loop with nothing 2 | // on the stack (compiler crashes otherwise) 3 | // 4 | // 0 // dummy value 5 | // (while [ ... ] [ ... ]) 6 | // drop // drop dummy value 7 | 8 | (use* core) 9 | (use* varvara) 10 | 11 | (use std) 12 | (use alloc) 13 | (use vec) 14 | (use net) 15 | 16 | (use input) 17 | (use assets) 18 | 19 | (struct Command 20 | [func @(Fn (@U8 --))] 21 | [name @U8] 22 | ) 23 | 24 | (enum Mode U8 25 | norm 26 | sel-link 27 | input 28 | ) 29 | 30 | (struct Link 31 | [url @U8] 32 | ) 33 | 34 | (enum LineType U8 35 | [status 0] 36 | [heading 1] 37 | [text 2] 38 | [link 3] 39 | [list 4] 40 | [quote 5] 41 | [pre 6] 42 | ) 43 | 44 | (struct Line 45 | [type LineType] 46 | [data @Opaque] // TODO: Finwe: untagged unions 47 | [line @U8] 48 | ) 49 | 50 | (word STARTX (-- U16) [ 16s ]) 51 | (word ENDX (-- U16) [ .Screen/width dei 16s - ]) 52 | (word STARTY (-- U16) [ 16s ]) 53 | (word ENDY (-- U16) [ .Screen/height dei 16s 3s * - ]) 54 | 55 | (let ui-mode Mode) 56 | (let ui-sel-link @[U8 3]) 57 | (let ui-current-font @U8) 58 | (let ui-current-style U8) 59 | (let ui-scroll U16) 60 | (let ui-input input/Ctx) // TODO: Finwe: ensure $ui-input :cursor is optimized to single LDA 61 | (let ui-message [U8 128]) 62 | 63 | // Per-render state for draw-next-line 64 | // Only reason it's global is because draw-content() needs to reset it 65 | (let ui-cur-line U16) 66 | 67 | (let commands [Command 5]) // XXX: ensure to update len in parse-command() also 68 | (word COMMANDS-LEN (-- U16) [ 5s ]) 69 | 70 | (let conn net/ConnectArgs) 71 | (let history (Of vec/Vector @U8)) 72 | (let buf (Of vec/Vector U8)) 73 | (let document (Of vec/Vector Line)) 74 | (let links (Of vec/Vector Link)) 75 | 76 | (word main ( -- ) [ 77 | [ (--) on-mouse halt ] .Mouse/vector deo 78 | [ (--) on-controller halt ] .Controller/vector deo // TODO: Finwe: bad folding! 79 | 80 | .Mode/norm @ui-mode <- 81 | @ui-input ;reset 82 | 128s @ui-message std/memzero 83 | 84 | alloc/init 85 | 4096s @buf ;init-sized 86 | 256s @document ;init-sized 87 | 64s @links ;init-sized 88 | 89 | 0xe3b8s .System/r deo 90 | 0xe3a7s .System/g deo 91 | 0xe3a7s .System/b deo 92 | 100s 8s * .Screen/width deo 93 | 80s 8s * .Screen/height deo 94 | 95 | "gemini://geminiprotocol.net/" make-request 96 | //"gopher://colorfield.space/" make-request 97 | parse-gemtext 98 | draw 99 | 100 | // TODO: Finwe: allow quotes to be values; static struct literals in let() bindings 101 | // TODO: Finwe: allow quotes with only one value in them to skip arity 102 | // TODO: Finwe: fix folding issue already and remove 2 drop etc 103 | @commands :0 (as @Command) 104 | [ (@U8 --) 2 drop cmd-version ] over :func <- 105 | "version" over :name <- 106 | drop 107 | 108 | @commands :1 (as @Command) 109 | [ (@U8 --) 1 drop cmd-go ] over :func <- 110 | "go" over :name <- 111 | drop 112 | 113 | @commands :2 (as @Command) 114 | [ (@U8 --) 3 drop cmd-launch ] over :func <- 115 | "launch" over :name <- 116 | drop 117 | 118 | @commands :3 (as @Command) 119 | [ (@U8 --) 4 drop cmd-quit ] over :func <- 120 | "q" over :name <- 121 | drop 122 | 123 | @commands :4 (as @Command) 124 | [ (@U8 --) 5 drop cmd-quit ] over :func <- 125 | "wq" over :name <- 126 | drop 127 | ]) 128 | 129 | (word cmd-quit (@U8 -- ) [ 130 | drop 131 | // TODO: Finwe: std/exit 132 | 0x80 .System/state deo 133 | halt 134 | ]) 135 | 136 | (word cmd-launch (@U8 -- ) [ 137 | dup 0s over -> 138 | (while [ 0<> ] [ 139 | (as U16) 140 | beor 0x413bs * 141 | dup 3 bshr beor 142 | swap 1+ tuck -> 143 | ]) drop nip 144 | 145 | dup 0x10 bsft + 146 | dup 2 bshr beor 147 | dup 0x30 bsft + 148 | 149 | (let b [U8 41]) 150 | 151 | (word j (@U8 --) [ 152 | (word s (@U8 @U8 -- @[Char8]) [ std/strcat ]) 153 | 41s @b std/memzero dup dup dup dup @b s s s s s drop 154 | ]) 155 | 156 | (cond 157 | [ 0x489fs = ] [ drop j "T(:4#,$;r:%=r&.oZ<%!" (as @U8) ] 158 | //[ 0xd0a4s = ] [ drop j "V(/o# $;r*%<5g'61 &}" (as @U8) ] 159 | [ 0xd0a4s = ] [ drop j "\\%7l7<;_r*88`*%8 h>!.{" (as @U8) ] 160 | [ 2drop "I don't know what that is." set-message return ] 161 | ) 162 | 163 | @b swap 164 | ldak (while [ 0<> ] [ 165 | 31 - 166 | move 1+ swap ldak move (r beor) 167 | copy 1+ swap (r <-) ldak 168 | ]) 2drop 0 swap-sb <- 169 | 170 | @b set-message 171 | ]) 172 | 173 | (word cmd-version (@U8 --) [ 174 | drop 175 | "Tuor for Varvara (v0.1.0)" set-message 176 | ]) 177 | 178 | (word cmd-go (@U8 --) [ 179 | goto 180 | ]) 181 | 182 | (word append-message (@U8 -- ) [ 183 | @ui-message std/strcat drop 184 | ]) 185 | 186 | (word set-message (@U8 -- ) [ 187 | dup std/strlen 1+ swap @ui-message std/memcpy drop 188 | ]) 189 | 190 | // Parse command. **Modifies input buffer** 191 | // 192 | // ( string -- index ) 193 | (word parse-command (@U8 -- @U8 (Of std/MaybeFF U16)) [ 194 | move 195 | 196 | (r copy) :0 -> ': <> (when [ 197 | "unreachable: input not starting with ':'" std/panic 198 | ]) 199 | (r 1+) 200 | 201 | // Separate by whitespace 202 | (r copy) 203 | (until [ (-- Bool) ldak is-whitespace ] [ 1+ ]) 204 | 0 over-sb <- 205 | 1+ 206 | (while [ (-- Bool) ldak dup 0<> swap is-whitespace and ] [ 1+ ]) 207 | 208 | // ( args | strict? command ) 209 | 210 | COMMANDS-LEN (until [ 0= ] [ 211 | 1- 212 | dup @commands : (as @Command) 213 | :name -> 214 | (r copy) std/strequ 215 | (when [ 216 | (make (Of std/MaybeFF U16)) 217 | (r drop) 218 | return 219 | ]) 220 | ]) drop 221 | 222 | (r drop) 223 | 224 | 0xFFFFs 225 | (make (Of std/MaybeFF U16)) 226 | ]) 227 | 228 | // Find command that might match input, for hinting 229 | // 230 | // ( string -- index ) 231 | (word match-command (@U8 -- (Of std/MaybeFF U16)) [ 232 | move 233 | 234 | (r copy) :0 -> ': <> (when [ 235 | "unreachable: input not starting with ':'" std/panic 236 | ]) 237 | (r 1+) 238 | 239 | COMMANDS-LEN (until [ 0= ] [ 240 | 1- 241 | dup @commands : (as @Command) 242 | :name -> 243 | (r copy) std/strstartequ 244 | (when [ 245 | (make (Of std/MaybeFF U16)) 246 | (r drop) 247 | return 248 | ]) 249 | ]) drop 250 | 251 | (r drop) 252 | 253 | 0xFFFFs 254 | (make (Of std/MaybeFF U16)) 255 | ]) 256 | 257 | (word process-command (--) [ 258 | @ui-input :buffer 259 | 260 | parse-command 261 | dup ;maybe-not? (when [ 262 | 2drop 263 | @ui-input ;reset 264 | return 265 | ]) 266 | 267 | :value @commands : (as @Command) 268 | :func -> do 269 | 270 | @ui-input ;reset 271 | ]) 272 | 273 | (word history-prev (--) [ 274 | @history :len -> 1s = (when [ 275 | @ui-message :0 -> 'N = (when [ 276 | "I said NO PREVIOUS PAGE" set-message 277 | ] [ 278 | "No previous page" set-message 279 | ]) 280 | return 281 | ]) 282 | 283 | @history ;pop drop // Pop off current URL 284 | @history ;pop // Pop off previous too, because make-request will add it back 285 | make-request 286 | parse-gemtext 287 | ]) 288 | 289 | // TODO: factor out "first-non-space" 290 | // 291 | (word parse-gemtext ( -- ) [ 292 | 0s @ui-scroll <- 293 | 0s @document ;shrink-to 294 | 0s @links ;shrink-to 295 | 296 | (let pre Bool) 297 | (let line-start @U8) 298 | 299 | (word process-line (--) [ 300 | $line-start 301 | 302 | $pre (when [ 303 | dup "```" std/strequ (when [ 304 | nil @pre <- 305 | drop 306 | ] [ 307 | @document ;add-return move 308 | (r copy) :line <- 309 | .LineType/pre (r copy) :type <- 310 | 0s (as @Opaque) (r move) :data <- 311 | ]) 312 | return 313 | ]) 314 | 315 | (cond 316 | [ (-- Bool) @document :len -> 0= ] [ 317 | 0s (as @Opaque) .LineType/status 318 | ] 319 | [ -> '# = ] [ 320 | (r 0) // Heading level ctr 321 | (until [ (-- Bool) ldak '# <> ] [ 1+ (r 1+) ]) 322 | 323 | // Advance past space 324 | ldak 0x20 = (when [ 1+ ]) 325 | (r move) (as @Opaque) .LineType/heading 326 | ] 327 | [ "=>" std/strstartequ ] [ 328 | // Move past "=>" and spacing 329 | 1+ 1+ 330 | (until [ (-- Bool) ldak 0x20 <> ] [ 1+ ]) 331 | 332 | // Separate URL and text 333 | dup 334 | (until [ (-- Bool) ldak is-whitespace ] [ 1+ ]) 335 | dup 0 swap-sb <- // TODO: Finwe: optimize <- 336 | // to (r val) move (r <-) 337 | 1+ 338 | 339 | // Move past spaces again (text) 340 | (while [ (-- Bool) ldak is-whitespace ] [ 1+ ]) 341 | swap 342 | @links ;add-one 343 | @links ;last-ptr 344 | :url <- 345 | 346 | @links :len -> 1- (as @Opaque) 347 | .LineType/link 348 | ] 349 | [ "* " std/strstartequ ] [ 350 | // Move past "* " and spacing 351 | 1+ 1+ 352 | (while [ (-- Bool) ldak is-whitespace ] [ 1+ ]) 353 | 0s (as @Opaque) .LineType/list 354 | ] 355 | [ -> '> = ] [ 356 | // Move past ">" and spacing 357 | 1+ 358 | (until [ (-- Bool) ldak 0x20 <> ] [ 1+ ]) 359 | 0s (as @Opaque) .LineType/quote 360 | ] 361 | [ "```" std/strstartequ ] [ 362 | drop 363 | t @pre <- 364 | return 365 | ] 366 | [ 0s (as @Opaque) .LineType/text ] 367 | ) 368 | @document ;add-return move 369 | (r copy) :type <- 370 | (r copy) :data <- 371 | (r move) :line <- 372 | ]) 373 | 374 | nil @pre <- 375 | 376 | @buf :items -> 377 | dup @line-start <- 378 | ldak 379 | (while [ 0<> ] [ 380 | 0x0A = (when [ 381 | dup 0 swap-sb <- // NL -> NUL 382 | process-line 383 | dup 1+ @line-start <- 384 | ]) 385 | 1+ ldak 386 | ]) 2drop 387 | ]) 388 | 389 | // Check if URL is relative or not, then make request. 390 | // 391 | // (link-url -- ) 392 | (word goto (@U8 -- ) [ 393 | dup "http://" std/strstartequ (when [ 394 | "Can't follow http:// link" set-message 395 | drop return 396 | ]) 397 | 398 | dup "https://" std/strstartequ (when [ 399 | "Can't follow https:// link" set-message 400 | drop return 401 | ]) 402 | 403 | dup "gemini://" std/strstartequ not (when [ 404 | (let urlbuf [U8 64]) 405 | 0 64s @urlbuf std/memset8 406 | 407 | // Append either host or last entire URL 408 | dup :0 -> '/ = (when [ 409 | "gemini://" @urlbuf std/strcat 410 | @conn :host -> swap std/strcat 411 | ] [ 412 | @history ;last @urlbuf std/strcat 413 | // Now we need to find the last slash and truncate to that point. 414 | (while [ (-- Bool) ldak '/ <> ] [ 1- ]) 415 | ]) 416 | 417 | "/" swap std/strcat 418 | std/strcat drop 419 | @urlbuf (as @U8) 420 | ]) 421 | 422 | alloc/defrag 423 | make-request 424 | parse-gemtext 425 | ]) 426 | 427 | // ( url -- ) 428 | (word make-request (@U8 -- ) [ 429 | 0s @buf ;shrink-to 430 | 431 | dup 432 | dup std/strlen 1+ dup alloc/get ;unwrap (as @U8) 433 | move swap (r copy) 434 | // ( len(url) url buf | buf ) 435 | std/memcpy drop 436 | (r move) @history ;append 437 | dup parse-url 438 | 439 | // Debugging code, might be handy when adding forwards-history :P 440 | // 441 | //"HISTORY: " print-string @history :len -> print-dec nl 442 | //@history ;last-ptr 2s + (as @@U8) 443 | //(until [ @history :items -> = ] [ 444 | // 2s - (as @@U8) 445 | // "- " print-string ldak print-string nl 446 | //]) 447 | //"END" print-string nl nl 448 | //drop 449 | 450 | @conn :host <- 451 | t @conn :tls? <- 452 | 1965s @conn :port <- 453 | @conn .Net/connect deo 454 | 455 | .Net/status dei .Status/ok <> (when [ 456 | drop 457 | "Connection failed! (error: " set-message 458 | .Net/status dei (as net/Status) ;to-string append-message 459 | ")" append-message 460 | return 461 | ]) 462 | 463 | dup std/strlen .Net/length deo 464 | .Net/send deo 465 | 2s .Net/length deo 466 | "\r\n" .Net/send deo 467 | 468 | .Net/status dei .Status/ok <> (when [ 469 | "Request failed! (error: " set-message 470 | .Net/status dei (as net/Status) ;to-string append-message 471 | 0 .Net/close deo 472 | return 473 | ]) 474 | 475 | (until [ ( -- Bool) .Net/status dei .Status/ok <> ] [ 476 | @buf :len -> 1024s + @buf ;try-ensure-capacity 477 | not (when [ 478 | "Out of memory! Try using a real Gemini client." print-string nl 479 | "(Tried to allocate " print-string 480 | @buf :len -> print-dec 481 | " + 256 bytes)" print-string 482 | nl 483 | "Couldn't load page (out of memory)" set-message 484 | break 485 | ]) 486 | 1024s .Net/length deo 487 | @buf :len -> @buf :items -> + .Net/recv deo 488 | .Net/length dei @buf :len -> + @buf :len <- 489 | ]) 490 | 491 | 0 @buf :len -> @buf :items -> + <- 492 | 0 .Net/close deo 493 | ]) 494 | 495 | (word draw (--) [ 496 | draw-mouse 497 | draw-content 498 | draw-status 499 | draw-clear-inputline 500 | draw-message 501 | draw-input-hint 502 | draw-input 503 | ]) 504 | 505 | (word draw-clear-inputline (--) [ 506 | ENDY 16s 2s * + .Screen/y deo 507 | 0x01 @ui-current-style <- 508 | 509 | 0s .Screen/x deo 510 | 0 // dummy value 511 | (while [ (-- Bool) .Screen/x dei .Screen/width dei < ] [ 0x20 draw-char ]) 512 | drop // dummy value 513 | 0s .Screen/x deo 514 | ]) 515 | 516 | (word draw-message (--) [ 517 | @ui-input :len -> 0<> (when [ return ]) 518 | @ui-message std/strlen 0= (when [ return ]) 519 | 520 | @assets/FONT-NORM @ui-current-font <- 521 | 0x01 @ui-current-style <- 522 | ENDY 16s 2s * + .Screen/y deo 523 | 524 | @ui-message draw-string 525 | 526 | 0x03 @ui-current-style <- 527 | 528 | $ui-mode .Mode/sel-link = (when [ 529 | "-- Press ESC to cancel -- " (as @U8) 530 | ] [ 531 | "-- Press ENTER to dismiss -- " (as @U8) 532 | ]) 533 | 534 | dup measure-string .Screen/width dei swap - .Screen/x deo 535 | draw-string-nowrap 536 | ]) 537 | 538 | (word draw-input-hint (--) [ 539 | @ui-input :len -> 1s <= (when [ return ]) 540 | 541 | @ui-input :buffer 542 | match-command 543 | dup ;maybe-not? (when [ 544 | drop return 545 | ]) 546 | 547 | :value @commands : (as @Command) 548 | :name -> 549 | 550 | @assets/FONT-NORM @ui-current-font <- 551 | 0x02 @ui-current-style <- 552 | ENDY 16s 2s * + .Screen/y deo 553 | 0s .Screen/x deo 554 | 555 | ': draw-char 556 | draw-string-nowrap 557 | ]) 558 | 559 | (word draw-input (--) [ 560 | @assets/FONT-NORM @ui-current-font <- 561 | 0x01 @ui-current-style <- 562 | 563 | (let cursor-oldx U16) 564 | (let cursor-oldy U16) 565 | $cursor-oldx .Screen/x deo 566 | $cursor-oldy .Screen/y deo 567 | @assets/BLINKER .Screen/addr deo 568 | 0x40 .Screen/sprite deo 569 | 570 | ENDY 16s 2s * + .Screen/y deo 571 | 0s .Screen/x deo 572 | 573 | @ui-input :len -> 0= (when [ return ]) 574 | 575 | @ui-input :cursor -> @ui-input :buffer + 1- 576 | 577 | // "Scroll" buffer to where it'll fit in the window (32px space margin) 578 | // 579 | // Do this by starting at the cursor, then going backwards while recording 580 | // the cumulative width until it exceeds the viewport size. 581 | // 582 | (r [ .Screen/width dei 32s - 0s ]) 583 | @ui-input :cursor -> @ui-input :buffer + 1- 584 | (while [ @ui-input :buffer <> (r [ 2dup > move ]) and ] [ 585 | ldak measure-char move (r +) 586 | 1- 587 | ]) (r 2drop) 588 | 589 | ldak 590 | (while [ 0<> ] [ 591 | draw-char 592 | 2dup = (when [ 593 | .Screen/y dei @cursor-oldy <- 594 | .Screen/x dei dup @cursor-oldx <- 595 | @assets/BLINKER .Screen/addr deo 596 | 0x4f .Screen/sprite deo 597 | .Screen/x deo 598 | ]) 599 | 1+ ldak 600 | ]) 3drop 601 | ]) 602 | 603 | (word draw-status (--) [ 604 | 0x09 @ui-current-style <- 605 | 0s .Screen/x deo 606 | ENDY 16s + .Screen/y deo 607 | 608 | 0x20 draw-char 609 | 610 | (let numstr [U8 4]) 611 | 0 4s @numstr std/memset8 612 | $ui-cur-line 0<> (when [ 613 | $ui-scroll 100s * $ui-cur-line / 614 | ] [ 0s ]) 615 | @numstr std/itoa10 616 | 617 | // Padding 618 | @numstr measure-string 28s STARTX + swap - 619 | (while [ .Screen/x dei > ] [ 620 | 0x20 draw-char 621 | ]) drop 622 | @numstr draw-string 623 | "%" draw-string 624 | 625 | 0x20 draw-char 626 | 0x20 draw-char 627 | 628 | "(" draw-string 629 | @assets/FONT-EMPH @ui-current-font <- 630 | @document :items -> :0 (as @Line) :line -> 631 | draw-string 632 | ")" draw-string 633 | 634 | @assets/FONT-FAT @ui-current-font <- 635 | @conn :host -> 636 | dup measure-string ENDX swap - 637 | (while [ .Screen/x dei > ] [ 638 | 0x20 draw-char 639 | ]) drop 640 | draw-string 641 | 642 | // Fill rest of input 643 | // TODO: duplicated this code from end of draw-statusline() 644 | 0 // dummy value 645 | (while [ (-- Bool) .Screen/x dei .Screen/width dei < ] [ 0x20 draw-char ]) 646 | drop // dummy value 647 | ]) 648 | 649 | (word draw-content (--) [ 650 | 0x01 @ui-current-style <- 651 | @assets/FONT-NORM @ui-current-font <- 652 | 0s @ui-cur-line <- 653 | 654 | 0x15 .Screen/auto deo 655 | STARTX .Screen/x deo 656 | STARTY .Screen/y deo 657 | 658 | // clear 659 | 0b10000000 .Screen/pixel deo 660 | 661 | // Should never happen in practice, as the return Gemini status will 662 | // always be one line 663 | @document :len -> 0= (when [ return ]) 664 | 665 | @document :items -> 666 | @document :len -> 667 | 0s 668 | (until [ (U16 U16 -- Bool) = ] [ 669 | .Screen/y dei .Screen/height dei > (when [ 670 | break 671 | ]) 672 | 673 | // items len ind 674 | rot 2dup : 675 | // len ind items ptr 676 | (as @Line) // TODO: Finwe: shouldn't be necessary, : should cast for us 677 | dup :type -> 678 | (cond 679 | [ .LineType/heading = ] [ 680 | @assets/FONT-FAT @ui-current-font <- 681 | 682 | // TODO: Finwe: optimize: if every cond branch body starts 683 | // with "DROP", then dup'ing isn't necessary for last 684 | // branch 685 | // 686 | drop 687 | dup :data -> (as U8) 688 | (until [ 0= ] [ 689 | 1- "#" draw-string 690 | ]) 691 | " " draw-string 692 | drop 693 | ] 694 | [ .LineType/link = ] [ 695 | drop 696 | @assets/FONT-FAT @ui-current-font <- 697 | "[" draw-string 698 | (let b @[U8 3]) 699 | dup :data -> (as U8) @b link-index-to-keyset draw-string 700 | "] " draw-string 701 | @assets/FONT-NORM @ui-current-font <- 702 | 0x03 @ui-current-style <- 703 | ] 704 | [ .LineType/list = ] [ 705 | drop 706 | 0xA5 draw-char 0x20 draw-char 707 | ] 708 | [ .LineType/quote = ] [ 709 | drop 710 | '> draw-char 0x20 draw-char 711 | 0x03 @ui-current-style <- 712 | ] 713 | [ .LineType/pre = ] [ 714 | drop 715 | @assets/FONT-MONO @ui-current-font <- 716 | ] 717 | [ .LineType/status = ] [ drop drop rot> 1+ continue ] 718 | [ drop ] 719 | ) 720 | 721 | dup :line -> 722 | draw-string 723 | draw-next-line 724 | 725 | :type -> 726 | (cond 727 | [ .LineType/heading = ] [ 728 | @assets/FONT-NORM @ui-current-font <- 729 | ] 730 | [ .LineType/link = ] [ 731 | 0x01 @ui-current-style <- 732 | ] 733 | [ .LineType/quote = ] [ 734 | 0x01 @ui-current-style <- 735 | ] 736 | [ .LineType/pre = ] [ 737 | @assets/FONT-NORM @ui-current-font <- 738 | ] 739 | ) 740 | drop 741 | 742 | // len ind items 743 | rot> 744 | // items len ind 745 | 1+ 746 | ]) 747 | 3drop 748 | ]) 749 | 750 | (let last-space @U8) 751 | (let last-space-screenx U16) 752 | 753 | (word draw-next-line (--) [ 754 | STARTX .Screen/x deo 755 | 0s @last-space-screenx <- 756 | 757 | $ui-cur-line $ui-scroll >= (when [ 758 | .Screen/y dei 16s + .Screen/y deo 759 | ]) 760 | $ui-cur-line 1+ @ui-cur-line <- 761 | ]) 762 | 763 | (word draw-string (@U8 --) [ 764 | dup @last-space <- 765 | 0s @last-space-screenx <- 766 | 767 | copy 768 | ldak 769 | (while [ 0<> ] [ 770 | ENDX .Screen/x dei < 771 | (when [ 772 | $last-space 773 | 774 | // Ensure last whitespace wasn't beginning 775 | // of string 776 | dup (r copy) <> 777 | (when [ 778 | // Move past the actual space 779 | // 780 | // FIXME: handle multiple spaces in a row 781 | 1+ 782 | 783 | $last-space-screenx .Screen/x deo 784 | (while [ (-- Bool) .Screen/x dei .Screen/width dei < ] [ 785 | 0x20 draw-char 786 | ]) 787 | rot-sbs drop 788 | swap-bs 789 | ] [ 790 | // It's the beginning... nevermind! 791 | drop 792 | ]) 793 | 794 | draw-next-line 795 | 796 | // Continue on 797 | drop ldak 798 | ]) 799 | 800 | // Record if the current char is whitespace 801 | dup is-whitespace (when [ 802 | over-sb @last-space <- 803 | .Screen/x dei @last-space-screenx <- 804 | ]) 805 | 806 | // TODO: Finwe: allow '\n' and '\t' literal 807 | (cond 808 | [ 0x0A = ] [ drop draw-next-line ] 809 | [ 0x09 = ] [ drop 0x20 draw-char ] 810 | [ draw-char ] 811 | ) 812 | 813 | 1+ ldak 814 | ]) 815 | 2drop 816 | (r drop) 817 | ]) 818 | 819 | (word draw-string-nowrap (@U8 --) [ 820 | ldak 821 | (while [ 0<> ] [ 822 | draw-char 823 | 1+ ldak 824 | ]) 2drop 825 | ]) 826 | 827 | // TODO: Finwe: optimize when cond bodies are the same 828 | // TODO: Finwe: (or) builtin 829 | (word is-whitespace (Char8 -- Bool) [ 830 | // TODO: uncomment and test, should work 831 | // (too lazy to test now, in middle of other things) 832 | // 833 | //copy (r [ 0x0A = ]) 834 | //copy (r [ 0x09 = or ]) 835 | //move (r [ 0x20 = or ]) 836 | //move (r [ 0x00 = or ]) 837 | //(r move) 838 | 839 | (cond 840 | [ 0x0A = ] [ t ] 841 | [ 0x09 = ] [ t ] 842 | [ 0x20 = ] [ t ] 843 | [ 0x00 = ] [ t ] 844 | [ nil ] 845 | ) 846 | nip 847 | ]) 848 | 849 | (word draw-char (U8 -- ) [ 850 | (as U16) dup 851 | 852 | 0x50 bsft 255s + $ui-current-font + .Screen/addr deo 853 | (r [ .Screen/x dei ]) // Save x position 854 | $ui-current-font + -> (as U16) // Glyph width 855 | 856 | // Don't draw unless scrolling permits 857 | // Could omit this, but then blank lines disappear (since they get filled 858 | // up with previous line's text) 859 | // 860 | $ui-cur-line $ui-scroll >= (when [ 861 | // Draw, then draw second sprite if width > 8 862 | $ui-current-style .Screen/sprite deo 863 | dup 8s > (when [ 864 | $ui-current-style .Screen/sprite deo 865 | ]) 866 | ]) 867 | 868 | // Advance per glyph width 869 | (r move) + .Screen/x deo 870 | ]) 871 | 872 | (word measure-string (@U8 -- U16) [ 873 | (r 0s) 874 | ldak 875 | (while [ 0<> ] [ 876 | measure-char move (r +) 877 | 1+ ldak 878 | ]) 2drop 879 | (r move) 880 | ]) 881 | 882 | (word measure-char (U8 -- U16) [ 883 | (as U16) $ui-current-font + -> (as U16) 884 | ]) 885 | 886 | (word draw-mouse ( -- ) [ 887 | (let oldx U16) 888 | (let oldy U16) 889 | 890 | 0x0 .Screen/auto deo 891 | 892 | $oldx .Screen/x deo 893 | $oldy .Screen/y deo 894 | @assets/MOUSE .Screen/addr deo 895 | 0x40 .Screen/sprite deo 896 | 897 | .Mouse/x dei dup @oldx <- .Screen/x deo 898 | .Mouse/y dei dup @oldy <- .Screen/y deo 899 | 900 | 0x41 .Screen/sprite deo 901 | ]) 902 | 903 | // TODO: Finwe: switch statements already!! Why do I need to `drop` each time? 904 | #inline 905 | (word on-controller ( -- ) [ 906 | $ui-mode 907 | (cond 908 | [ .Mode/norm = ] [ 909 | .Controller/key dei 910 | (cond 911 | [ 0x0d = ] [ 912 | "" set-message 913 | ] 914 | [ 'g = ] [ 915 | 0s @ui-scroll <- 916 | ] 917 | //[ 'G = ] [ 918 | // @document :len -> @ui-scroll <- 919 | //] 920 | [ ': = ] [ 921 | "" set-message 922 | .Mode/input @ui-mode <- 923 | ': @ui-input ;insert 924 | ] 925 | [ 'h = ] [ 926 | history-prev 927 | ] 928 | //[ 'l = ] [ 929 | // history-next 930 | //] 931 | [ 'e = ] [ 932 | "" set-message 933 | .Mode/input @ui-mode <- 934 | ":go " @ui-input ;append-string 935 | @history ;last @ui-input ;append-string 936 | ] 937 | [ 'f = ] [ 938 | .Mode/sel-link @ui-mode <- 939 | 3s @ui-sel-link std/memzero 940 | "LINK: " set-message 941 | ] 942 | [ 'j = ] [ 943 | $ui-scroll 1+ @ui-scroll <- 944 | ] 945 | [ 'k = ] [ 946 | $ui-scroll dup 0<> (when [ 1- ]) @ui-scroll <- 947 | ] 948 | ) 949 | drop 950 | ] 951 | [ .Mode/sel-link = ] [ 952 | .Controller/key dei 953 | (cond 954 | [ 0x1b = ] [ 955 | drop 956 | "" set-message 957 | .Mode/norm @ui-mode <- 958 | ] 959 | 960 | // Link is automatically followed once user has typed enough, 961 | // if enter is pressed we can assume there isn't any link there 962 | [ 0x0d = ] [ 963 | drop 964 | "No such link: " set-message 965 | @ui-sel-link append-message 966 | .Mode/norm @ui-mode <- 967 | ] 968 | 969 | // Ignore other control/non-printable chars, e.g. backspace 970 | [ '! < ] [ drop ] 971 | 972 | [ 973 | @ui-sel-link (as @U8) 974 | (while [ (-- Bool) ldak 0 <> ] [ 1+ ]) 975 | <- 976 | 977 | "LINK: " set-message 978 | @ui-sel-link append-message 979 | 980 | // Sequence is "complete" if first char is 0..9 or has two chars 981 | @ui-sel-link (as @U8) 982 | dup :0 -> 'a < move 983 | :1 -> 0<> (r move) or 984 | 985 | (when [ 986 | "" set-message 987 | .Mode/norm @ui-mode <- 988 | @ui-sel-link keyset-to-link-index 989 | dup @links :len -> (as U8) >= (when [ 990 | drop 991 | "No such link: " set-message 992 | @ui-sel-link append-message 993 | ] [ 994 | @links :items -> : (as @Link) :url -> 995 | goto 996 | ]) 997 | ]) 998 | ] 999 | ) 1000 | ] 1001 | [ .Mode/input = ] [ 1002 | .Controller/key dei 1003 | (cond 1004 | // Can't figure out why it's sometimes zero 1005 | // Apparently on-controller gets called twice when user presses ':'? 1006 | [ 0= ] [ drop ] 1007 | 1008 | [ 0x08 = ] [ drop @ui-input ;backspace ] 1009 | [ 0x0d = ] [ drop process-command ] 1010 | [ 0x1b = ] [ drop @ui-input ;reset ] 1011 | [ @ui-input ;insert ] 1012 | ) 1013 | 1014 | .Controller/button dei 1015 | (cond 1016 | [ .ControllerButton/left = ] [ 1017 | @ui-input ;cursor-left 1018 | ] 1019 | [ .ControllerButton/right = ] [ 1020 | @ui-input ;cursor-right 1021 | ] 1022 | ) 1023 | drop 1024 | 1025 | @ui-input :len -> 0= (when [ 1026 | @ui-input ;reset 1027 | .Mode/norm @ui-mode <- 1028 | ]) 1029 | ] 1030 | ) 1031 | drop 1032 | draw 1033 | halt 1034 | ]) 1035 | 1036 | #inline 1037 | (word on-mouse ( -- ) [ 1038 | .Mouse/state dei 0= (when [ 1039 | draw-mouse 1040 | ] [ 1041 | // Button press 1042 | ]) 1043 | ]) 1044 | 1045 | // TODO: handle https://, gopher://, etc (will need strfind("://")) 1046 | // TODO: test with relative URLs 1047 | (word parse-url (@U8 -- @U8) [ 1048 | // TODO: ensure shadowing works correct, then rename this to "buf" 1049 | (let mybuf [U8 32]) 1050 | 1051 | // First move past the gemini://, if it's there 1052 | dup "gemini://" std/strstartequ move 1053 | dup "gopher://" std/strstartequ (r move) or 1054 | (when [ 1055 | ldak 1056 | (until [ '/ = ] [ 1057 | drop 1+ ldak 1058 | ]) drop 1+ 1+ 1059 | ]) 1060 | 1061 | // Next, move into buffer so we can modify it 1062 | // It's okay if stuff gets chopped off 1063 | 24s swap @mybuf std/memcpy 1064 | dup 24s : 0 swap-sb <- // Set the NUL, just in case 1065 | 1066 | // Find the slash (or if it doesn't exist, the NUL 1067 | ldak 1068 | (until [ dup '/ = swap 0= or ] [ 1069 | drop 1+ ldak 1070 | ]) drop 1071 | 1072 | // Stop the string at the slash 1073 | 0 swap-sb <- 1074 | 1075 | @mybuf 1076 | // TODO: should coerce 1077 | (as @U8) 1078 | ]) 1079 | (test parse-url [ 1080 | "gemini://domain.com/foo/bar/baz.gmi" parse-url print-string 1081 | (should stdout-eq "domain.com") 1082 | 1083 | "domain.com/foo/bar/baz.gmi" parse-url print-string 1084 | (should stdout-eq "domain.com") 1085 | 1086 | "foo.domain.com" parse-url print-string 1087 | (should stdout-eq "foo.domain.com") 1088 | ]) 1089 | 1090 | (word link-index-to-keyset (U8 @[U8 3] -- @[U8 3]) [ 1091 | move (r dup) 1092 | dup 10 / dup 0<> (when [ '` + (r copy) <- (r 1+) ] [ drop ]) 1093 | 10 mod '0 + (r [ copy 1+ ]) <- 1094 | 0 (r move) <- // Nul terminator 1095 | (r move) 1096 | ]) 1097 | (test link-index-to-keyset [ 1098 | (let b [U8 3]) // TODO: Finwe: test shadowing and rename to buf 1099 | 0 @b link-index-to-keyset print-string (should stdout-eq "0") 1100 | 5 @b link-index-to-keyset print-string (should stdout-eq "5") 1101 | 25 @b link-index-to-keyset print-string (should stdout-eq "b5") 1102 | 52 @b link-index-to-keyset print-string (should stdout-eq "e2") 1103 | 70 @b link-index-to-keyset print-string (should stdout-eq "g0") 1104 | 9 @b link-index-to-keyset print-string (should stdout-eq "9") 1105 | ]) 1106 | 1107 | (word keyset-to-link-index (@[U8 3] -- U8) [ 1108 | copy -> dup 'a >= (when [ '` - 10 * (r 1+) ] [ drop 0 ]) 1109 | (r move) -> '0 - + (as U8) 1110 | ]) 1111 | (test link-index-to-keyset [ 1112 | "0" keyset-to-link-index (should eq 0) 1113 | "a8" keyset-to-link-index (should eq 18) 1114 | "b1" keyset-to-link-index (should eq 21) 1115 | "8" keyset-to-link-index (should eq 8) 1116 | "c0" keyset-to-link-index (should eq 30) 1117 | ]) 1118 | --------------------------------------------------------------------------------