├── .gitignore ├── LICENSE ├── Lesson1 ├── Lesson1.odp ├── Lesson1_Script.odt └── load.asm ├── Lesson10 ├── Lesson10.odp ├── Lesson10_Script.odt ├── build.sh └── rom.asm ├── Lesson11 ├── Lesson11.odp ├── Lesson11_Script.odt ├── bitmap.png ├── bitmap.xcf ├── bitmap_bin.png ├── bitmap_bin_no_il.png ├── build.sh ├── graphics.asm ├── png2spectrum.py ├── presents.ods └── sg_40x24.png ├── Lesson12 ├── Lesson12.odp ├── Lesson12_Script.odt ├── build.sh ├── irq.asm ├── sprite.xcf ├── sprite0.png ├── sprite1.png ├── sprite2.png ├── sprite3.png └── sprite4.png ├── Lesson2 ├── Lesson2.odp ├── Lesson2_Script.odt ├── build.sh └── modes.asm ├── Lesson3 ├── Lesson3.odp ├── Lesson3_Script.odt ├── build.sh └── data.asm ├── Lesson4 ├── Lesson4.odp ├── Lesson4_Script.odt ├── build.sh └── cond.asm ├── Lesson5 ├── Lesson5.odp ├── Lesson5_Script.odt ├── build.sh └── math.asm ├── Lesson6 ├── Lesson6.odp ├── Lesson6_Script.odt ├── build.sh └── stack.asm ├── Lesson7 ├── Lesson7.odp ├── Lesson7_Script.odt ├── bit.asm └── build.sh ├── Lesson8 ├── Lesson8.odp ├── Lesson8_Script.odt ├── build.sh ├── io.asm ├── keyboard.asm └── sound.asm ├── Lesson9 ├── Lesson9.odp ├── Lesson9_Script.odt ├── build.sh └── rest.asm └── README.md /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Object files 5 | *.o 6 | *.ko 7 | *.obj 8 | *.elf 9 | 10 | # Linker output 11 | *.ilk 12 | *.map 13 | *.exp 14 | 15 | # Precompiled Headers 16 | *.gch 17 | *.pch 18 | 19 | # Libraries 20 | *.lib 21 | *.a 22 | *.la 23 | *.lo 24 | 25 | # Shared objects (inc. Windows DLLs) 26 | *.dll 27 | *.so 28 | *.so.* 29 | *.dylib 30 | 31 | # Executables 32 | *.exe 33 | *.out 34 | *.app 35 | *.i*86 36 | *.x86_64 37 | *.hex 38 | 39 | # Debug files 40 | *.dSYM/ 41 | *.su 42 | *.idb 43 | *.pdb 44 | 45 | # Kernel Module Compile Results 46 | *.mod* 47 | *.cmd 48 | .tmp_versions/ 49 | modules.order 50 | Module.symvers 51 | Mkfile.old 52 | dkms.conf 53 | 54 | *.lst 55 | *.bin 56 | *.tap 57 | *.sna 58 | *.szx 59 | .~* 60 | ~* 61 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /Lesson1/Lesson1.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson1/Lesson1.odp -------------------------------------------------------------------------------- /Lesson1/Lesson1_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson1/Lesson1_Script.odt -------------------------------------------------------------------------------- /Lesson1/load.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | ld a,$D6 7 | ld ($5800),a 8 | ret 9 | 10 | ; Deployment: Snapshot 11 | SAVESNA "load.sna", start 12 | -------------------------------------------------------------------------------- /Lesson10/Lesson10.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson10/Lesson10.odp -------------------------------------------------------------------------------- /Lesson10/Lesson10_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson10/Lesson10_Script.odt -------------------------------------------------------------------------------- /Lesson10/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst rom.asm 4 | -------------------------------------------------------------------------------- /Lesson10/rom.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | ; Routines 6 | CL_ALL = $0DAF 7 | KEY_INPUT = $10A8 8 | 9 | ; Character Codes 10 | SPACE = $20 11 | COPYRIGHT = $7F 12 | 13 | ; Control Codes 14 | ENTER = $0D 15 | INK = $10 16 | AT = $AC 17 | 18 | start: 19 | im 1 ; Use ROM-based interrupt routine 20 | ei ; Enable maskable interrupts 21 | call CL_ALL ; Clear screen, reset cursor to top 22 | key_loop: 23 | call KEY_INPUT ; Get last key pressed 24 | jp nc,key_loop ; If C is clear, keep waiting for key press 25 | cp AT ; Key has been pressed 26 | jp z,do_ink ; If AT code (Symbol Shift + I), wait for ink color 27 | cp ENTER 28 | jp z,print ; If ENTER code, print 29 | cp SPACE 30 | jp m,key_loop ; If code < space character, ignore 31 | cp COPYRIGHT+1 32 | jp p,key_loop ; If code > copyright character, ignore 33 | jp print ; Else, print the character 34 | do_ink: 35 | ld a,INK 36 | rst $10 ; "print" INK code 37 | ink_loop: 38 | call KEY_INPUT 39 | jp nc,ink_loop ; wait for another key press 40 | cp $30 41 | jp m,reset_ink ; if code < '0', reset ink color 42 | cp $38 43 | jp p,reset_ink ; if code >= '8', reset ink color 44 | sub $30 ; get numerical value of numeral character... 45 | jp print ; ...and "print" it as ink value 46 | reset_ink: 47 | ld a,0 ; reset ink to black by "printing" zero 48 | print: 49 | rst $10 ; print final code 50 | jp key_loop ; keep looping indefinitely 51 | 52 | ; Deployment: Snapshot 53 | SAVESNA "rom.sna", start 54 | -------------------------------------------------------------------------------- /Lesson11/Lesson11.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/Lesson11.odp -------------------------------------------------------------------------------- /Lesson11/Lesson11_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/Lesson11_Script.odt -------------------------------------------------------------------------------- /Lesson11/bitmap.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/bitmap.png -------------------------------------------------------------------------------- /Lesson11/bitmap.xcf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/bitmap.xcf -------------------------------------------------------------------------------- /Lesson11/bitmap_bin.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/bitmap_bin.png -------------------------------------------------------------------------------- /Lesson11/bitmap_bin_no_il.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/bitmap_bin_no_il.png -------------------------------------------------------------------------------- /Lesson11/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | python3 -m pip install Pillow 3 | python3 png2spectrum.py bitmap.png 64 4 | sjasmplus --lst graphics.asm 5 | -------------------------------------------------------------------------------- /Lesson11/graphics.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | ; Routines 6 | CL_ALL = $0DAF 7 | 8 | ; Character Codes 9 | ENTER = $0D 10 | INK = $10 11 | PAPER = $11 12 | FLASH = $12 13 | BRIGHT = $13 14 | GFX_0 = $80 15 | GFX_1 = GFX_0+1 16 | GFX_2 = GFX_0+2 17 | GFX_3 = GFX_0+3 18 | GFX_4 = GFX_0+4 19 | GFX_5 = GFX_0+5 20 | GFX_6 = GFX_0+6 21 | GFX_7 = GFX_0+7 22 | GFX_8 = GFX_0+8 23 | GFX_9 = GFX_0+9 24 | GFX_A = GFX_0+$A 25 | GFX_B = GFX_0+$B 26 | GFX_C = GFX_0+$C 27 | GFX_D = GFX_0+$D 28 | GFX_E = GFX_0+$E 29 | GFX_F = GFX_0+$F 30 | UDG_0 = $90 31 | UDG_1 = UDG_0+1 32 | UDG_2 = UDG_0+2 33 | UDG_3 = UDG_0+3 34 | UDG_4 = UDG_0+4 35 | UDG_5 = UDG_0+5 36 | UDG_6 = UDG_0+6 37 | UDG_7 = UDG_0+7 38 | UDG_8 = UDG_0+8 39 | UDG_9 = UDG_0+9 40 | STOP = $E2 41 | 42 | ; UDG 43 | udg0_bitmap: 44 | db %00000000 45 | db %00000000 46 | db %00000000 47 | db %00001100 48 | db %00001100 49 | db %00011001 50 | db %00011001 51 | db %00011000 52 | 53 | udg1_bitmap: 54 | db %00000000 55 | db %00000000 56 | db %00000000 57 | db %00000000 58 | db %00001100 59 | db %10011000 60 | db %10011000 61 | db %00011000 62 | 63 | udg2_bitmap: 64 | db %00000000 65 | db %00000000 66 | db %00000000 67 | db %01111110 68 | db %01100000 69 | db %11000000 70 | db %11000000 71 | db %11000000 72 | 73 | udg3_bitmap: 74 | db %00011111 75 | db %00110000 76 | db %00110000 77 | db %00111110 78 | db %00000011 79 | db %00000011 80 | db %00000110 81 | db %01111100 82 | 83 | udg4_bitmap: 84 | db %00011001 85 | db %00110001 86 | db %00110011 87 | db %00110011 88 | db %00110011 89 | db %01100110 90 | db %01100110 91 | db %01100110 92 | 93 | udg5_bitmap: 94 | db %10011100 95 | db %10110000 96 | db %00110001 97 | db %00110001 98 | db %00110001 99 | db %01100011 100 | db %01100011 101 | db %01110011 102 | 103 | udg6_bitmap: 104 | db %11111100 105 | db %11001100 106 | db %10001100 107 | db %10001100 108 | db %10011001 109 | db %00011001 110 | db %00011001 111 | db %00011001 112 | 113 | udg7_bitmap: 114 | db %01100110 115 | db %11000110 116 | db %11000110 117 | db %11001100 118 | db %10001100 119 | db %10001100 120 | db %10011000 121 | db %11111000 122 | 123 | udg8_bitmap: 124 | db %00000000 125 | db %00000000 126 | db %00000000 127 | db %00000000 128 | db %00000011 129 | db %00000000 130 | db %00000000 131 | db %00000000 132 | 133 | udg9_bitmap: 134 | db %00011000 135 | db %00011000 136 | db %00010000 137 | db %00110000 138 | db %11100000 139 | db %00000000 140 | db %00000000 141 | db %00000000 142 | 143 | SIZE_UDG = $ - udg0_bitmap 144 | 145 | banner: 146 | db BRIGHT,1,FLASH,0,PAPER,7,INK,4," ",UDG_0,UDG_1,UDG_2," ",BRIGHT,0,PAPER,2 147 | db " ",ENTER 148 | db BRIGHT,1,PAPER,7,UDG_3,UDG_4,UDG_5,UDG_6,UDG_7," ",BRIGHT,0,PAPER,2,INK,7," " 149 | db GFX_B,GFX_6,GFX_5,GFX_3,GFX_8,GFX_B,GFX_3,GFX_4,GFX_3,GFX_2,GFX_B 150 | db GFX_3,GFX_5,GFX_8,GFX_5,GFX_1,GFX_7,GFX_3,GFX_4,GFX_3,GFX_2,ENTER 151 | db BRIGHT,1,PAPER,7,INK,4," ",UDG_8,UDG_9," ",BRIGHT,0,PAPER,2,INK,7," " 152 | db GFX_B,GFX_2,GFX_5,GFX_3,GFX_8,GFX_B,GFX_2,GFX_0,GFX_3,GFX_8,GFX_B 153 | db GFX_2,GFX_5,GFX_7,GFX_D,GFX_0,GFX_5,GFX_0,GFX_0,GFX_3,GFX_8,ENTER 154 | db BRIGHT,1,PAPER,7,INK,0,"GAMES ",BRIGHT,0,PAPER,2,INK,7," " 155 | db GFX_A,GFX_0,GFX_5,GFX_0,GFX_A,GFX_E,GFX_C,GFX_4,GFX_C,GFX_2,GFX_E 156 | db GFX_C,GFX_5,GFX_0,GFX_7,GFX_0,GFX_5,GFX_0,GFX_4,GFX_C,GFX_2,ENTER 157 | db BRIGHT,1,PAPER,7," ",BRIGHT,0,PAPER,2 158 | db " ",ENTER,STOP 159 | 160 | bitmap: 161 | INCBIN "bitmap.bin" 162 | 163 | attributes: 164 | INCBIN "colors.bin" 165 | 166 | BITMAP_START = $4800 ; start of pixel row 64 (top of character row 8) 167 | BITMAP_SIZE = 2048 ; 256x64 (all of character rows 8-15) 168 | ATTR_START = $5800 + 8*32 169 | ATTR_SIZE = BITMAP_SIZE/8 170 | 171 | FOOTER_START = $5000 ; start of pixel row 128 (top of character row 16) 172 | 173 | UDG_START = $FF58 174 | 175 | start: 176 | im 1 ; Use ROM-based interrupt routine 177 | ei ; Enable maskable interrupts 178 | call CL_ALL ; Clear screen, reset cursor to top 179 | ld hl,udg0_bitmap 180 | ld de,UDG_START 181 | ld bc,SIZE_UDG 182 | ldir ; overwrite UDGs with custom bitmaps 183 | ld hl,banner ; Load address of start of banner string 184 | banner_loop: 185 | ld a,(hl) ; Get next character from banner 186 | cp STOP 187 | jr z,load_bitmap ; if STOP, jump out of loop 188 | rst $10 ; print character 189 | inc hl ; increment address 190 | jp banner_loop ; continue loop 191 | load_bitmap: 192 | ld hl,bitmap 193 | ld de,BITMAP_START 194 | ld bc,BITMAP_SIZE 195 | ldir ; copy bitmap to screen bitmap RAM 196 | ld hl,attributes 197 | ld de,ATTR_START 198 | ld bc,ATTR_SIZE 199 | ldir ; copy color attributes to screen attribute RAM 200 | ld hl,FOOTER_START ; initialize with starting address of footer bitmap 201 | ld b,$ff ; start end loop with all ink pixels 202 | end_loop: 203 | halt ; wait for next video frame 204 | ld (hl),b ; write pixels to screen bitmap RAM 205 | inc hl ; go to next address 206 | bit 3,h ; check to see if it puts us into attribute RAM 207 | jp z,end_loop ; if still in bitmap RAM, continue loop 208 | ld hl,FOOTER_START ; reset loop to top of footer again 209 | ld a,b 210 | xor $FF 211 | ld b,a ; invert pixel pattern 212 | jp end_loop ; continue loop with new pattern 213 | 214 | ; Deployment: Snapshot 215 | SAVESNA "graphics.sna", start 216 | -------------------------------------------------------------------------------- /Lesson11/png2spectrum.py: -------------------------------------------------------------------------------- 1 | from PIL import Image 2 | import sys 3 | 4 | def bitmapline(sourceline): 5 | return (sourceline & 0xC0) | ((sourceline & 0x38) >> 3) | ((sourceline & 0x07) << 3) 6 | 7 | if len(sys.argv) < 2: 8 | print("Usage: python3 ", sys.argv[0], " [PNG filename] [starting screen line] [starting screen column]") 9 | sys.exit() 10 | 11 | startline = 0 12 | if len(sys.argv) >= 3: 13 | startline = int(sys.argv[2]) 14 | 15 | startcol = 0 16 | if len(sys.argv) >= 4: 17 | startcol = int(sys.argv[3]) 18 | 19 | pngdata = Image.open(sys.argv[1]) 20 | 21 | if pngdata.format != "PNG": 22 | print("Error: ", pngdata.format, " format not supported, must be PNG") 23 | sys.exit(); 24 | 25 | if pngdata.mode != "P": 26 | print("Error: PNG must use 8-bit palette indexed color") 27 | sys.exit(); 28 | 29 | if ((pngdata.width+startcol) > 256) or ((pngdata.height+startline) > 192): 30 | print("Error: PNG must fit within 256x192 screen") 31 | sys.exit(); 32 | 33 | if (len(pngdata.palette.getdata()[1]) > 48): 34 | print("Error: PNG palette must be 16 colors or smaller") 35 | sys.exit(); 36 | 37 | colorpixels = pngdata.load(); 38 | 39 | attrrows = int(pngdata.height / 8) 40 | 41 | if (startline % 8 != 0): 42 | print("Warning: startline is not divisible by 8, attributes may clash") 43 | attrrows = attrrows+1 44 | 45 | if (pngdata.height % 8 != 0): 46 | print("Warning: image height is not divisible by 8, attributes may clash") 47 | if ((pngdata.height + startline) % 8 != 0): 48 | attrrows = attrrows+1 49 | 50 | attributes = [[0 for y in range(attrrows)] for x in range(32)] 51 | 52 | bmlines_start = startline 53 | bmlines_stop = startline+pngdata.height 54 | bmrows = range(bmlines_start,bmlines_stop) 55 | 56 | for i in bmrows: 57 | line = bitmapline(i) 58 | if (line < bmlines_start): 59 | bmlines_start = line 60 | elif (line > bmlines_stop): 61 | bmlines_stop = line 62 | 63 | attry_start = int(startline / 8) 64 | bitmap = [[0 for y in range(bmlines_stop-bmlines_start)] for x in range(256)] 65 | 66 | for x in range(pngdata.width): 67 | bitmapx = x+startcol 68 | attrx = int(bitmapx / 8) 69 | for y in range(pngdata.height): 70 | bitmapy = bitmapline(y+startline) - bmlines_start 71 | attry = int((y+startline) / 8) - attry_start 72 | isink = False 73 | if (x % 8 == 0) and ((y+startline) % 8 == 0): 74 | attributes[attrx][attry] = colorpixels[x,y] << 3 75 | elif (attributes[attrx][attry] & 0x07) == 0: 76 | bgcolor = attributes[attrx][attry] >> 3 77 | if colorpixels[x,y] != bgcolor: 78 | if ((colorpixels[x,y] ^ bgcolor) & 0x08) != 0: 79 | print("Warning: brightness mismatch found at ", x, ",", y) 80 | fgcolor = colorpixels[x,y] & 0x07 81 | if (bgcolor & 0x07) != fgcolor: 82 | isink = True 83 | attributes[attrx][attry] = attributes[attrx][attry] | fgcolor 84 | else: 85 | bgcolor = (attributes[attrx][attry] >> 3) & 0x07 86 | fgcolor = attributes[attrx][attry] & 0x07 87 | pixelcolor = colorpixels[x,y] & 0x07 88 | if pixelcolor == fgcolor: 89 | isink = True 90 | elif pixelcolor != bgcolor: 91 | print("Warning: unexpected color found at ", x, ",", y, ", will be set as paper") 92 | bitmap[bitmapx][bitmapy] = 1 if isink else 0 93 | #print("colorpixels[",x,",",y,"] = ", colorpixels[x,y]) 94 | #print("bitmap[",bitmapx,",",bitmapy,"] = ", bitmap[bitmapx][bitmapy]) 95 | #print("attributes[",attrx,"][",attry,"] = ",attributes[attrx][attry]) 96 | 97 | bitmap_array = bytearray(len(bitmap[0])*32) 98 | i = 0 99 | for y in range(len(bitmap[0])): 100 | for x in range(32): 101 | octet = 0 102 | for pixel in range(8): 103 | bit = bitmap[x*8+pixel][y] << (7 - pixel) 104 | octet = octet | bit 105 | bitmap_array[i] = octet 106 | i = i+1 107 | outfile = open("bitmap.bin","wb") 108 | outfile.write(bitmap_array) 109 | 110 | attr_array = bytearray(len(attributes[0])*32) 111 | i = 0 112 | for y in range(len(attributes[0])): 113 | for x in range(32): 114 | attr_array[i] = attributes[x][y] 115 | i = i+1 116 | outfile = open("colors.bin","wb") 117 | outfile.write(attr_array) 118 | -------------------------------------------------------------------------------- /Lesson11/presents.ods: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/presents.ods -------------------------------------------------------------------------------- /Lesson11/sg_40x24.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson11/sg_40x24.png -------------------------------------------------------------------------------- /Lesson12/Lesson12.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/Lesson12.odp -------------------------------------------------------------------------------- /Lesson12/Lesson12_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/Lesson12_Script.odt -------------------------------------------------------------------------------- /Lesson12/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst irq.asm 4 | -------------------------------------------------------------------------------- /Lesson12/irq.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | IM2_TABLE = $FE00 6 | IM2_VECTOR = $FDFD 7 | 8 | SCREEN_LINE = $4860 ; Line 88 9 | 10 | position: 11 | db 124,0 12 | 13 | sprite: 14 | db %00111100 15 | db %01100110 16 | db %11111011 17 | db %11111101 18 | db %11111101 19 | db %11111111 20 | db %01111110 21 | db %00111100 22 | 23 | line_buffer: 24 | .256 db 0 25 | 26 | start: 27 | ; Setup Interrupt Mode 2 28 | di ; disable interrupts 29 | ld de,IM2_TABLE ; de = beginning of 257 bytes to set to $FD 30 | ld hl,IM2_VECTOR ; hl = vector location ($FDFD) 31 | ld a,d ; 32 | ld i,a ; i = custom IM2 table page 33 | ld a,l ; a = $FD 34 | .fill_loop: 35 | ld (de),a ; set byte in IM2 table to $FD 36 | inc e ; de = next byte (unless e = 0) 37 | jp nz,.fill_loop ; loop until whole page is set to $FD (e = 0) 38 | inc d ; de = 257th byte of table 39 | ld (de),a ; set last byte to $FD 40 | ld (hl),$C3 ; place unconditional JP opcode at vector 41 | inc l ; hl = vector + 1 42 | ld (hl),low im2_handler ; low byte of custom handler address 43 | inc l ; hl = vector + 2 44 | ld (hl),high im2_handler ; high byte of custom handler address 45 | im 2 ; set interrupt mode 2 46 | ei ; re-enable interrupts 47 | 48 | ; Main thread of execution: 49 | jp draw_sprite ; draw sprite at initial position, then loop back 50 | main_loop: 51 | halt ; wait for interrupt 52 | ld bc,$FEFE ; BC = Port $FEFE (in: keyboard[Shift,Z,X,C,V] 53 | in a,(c) ; scan keyboard 54 | and $06 ; check for Z or X 55 | jp z,main_loop ; if both pressed, return to top of loop 56 | cp $06 57 | jp z,main_loop ; if neither pressed, return to top of loop 58 | ld hl,position ; HL = address of position 59 | bit 1,a ; check state of Z key (Bit 1) 60 | jp z,.go_left ; if Z pressed, go left 61 | ld a,(HL) ; X must be pressed, get current position 62 | cp 248 ; check to see if already at the far right end 63 | jp z,main_loop ; if already there, don't move, return to top 64 | inc (hl) ; move one pixel to right 65 | jp draw_sprite ; ready to draw 66 | .go_left: 67 | ld a,(HL) ; Z must be pressed, get current position 68 | cp 0 69 | jp z,main_loop ; if already zero, don't move, return to top 70 | dec (hl) ; move one pixel to left 71 | 72 | ; now, update line buffer with new sprite position 73 | draw_sprite: 74 | ld hl,line_buffer ; HL = beginning line buffer 75 | ld bc,(position) ; BC = starting sprite pixel position 76 | srl c 77 | srl c 78 | srl c ; BC = position/8 79 | add hl,bc ; HL = starting address of sprite destination 80 | push hl 81 | pop ix ; IX = HL 82 | ld a,(position) ; A = position 83 | cp 0 84 | jp z,.draw ; If A=0, jump to drawing sprite 85 | and $07 ; A = A%8 86 | jp nz,.draw ; If A > 0, no need clear previous, jump ahead 87 | dec hl ; go back to previous address 88 | ld b,8 ; loop through 8 lines 89 | ld de,32 ; 32 bytes per line 90 | .prev_loop: 91 | ld (hl),0 ; clear pixels to left 92 | add hl,de ; next line 93 | dec b ; decrement loop index 94 | jp nz,.prev_loop ; keep looping until zero 95 | .draw: 96 | and $07 ; A = A%8 97 | ld b,a ; B = A; store shift loop init 98 | ld c,8 ; C = line loop index (sprite height) 99 | ld hl,sprite ; HL = sprite pixels 100 | .line_loop: 101 | ld d,(hl) ; DE = sprite line 102 | ld e,0 103 | ld a,b ; init shift loop 104 | cp 0 105 | jp z,.draw_line ; if A already zero, no need to shift 106 | .shift_loop: 107 | srl d 108 | rr e ; shift sprite line to right 109 | dec a ; decrement loop index 110 | jp nz,.shift_loop ; keep looping until zero 111 | .draw_line: 112 | ld (ix),d ; draw left byte 113 | ld (ix+1),e ; draw right byte 114 | ld de,32 ; 32 bytes per line 115 | add ix,de ; go to next line in buffer 116 | inc hl ; and get next line of sprite 117 | dec c ; decrement line loop index 118 | jp nz,.line_loop ; keep looping until zero 119 | jp main_loop ; forever wait for next interrupt 120 | 121 | im2_handler: 122 | ; stash all registers to stack 123 | push af 124 | push bc 125 | push de 126 | push hl 127 | ex af,af' ; exchange AF and AF' 128 | exx ; exchange BE,DE,HL with BE',DE',HL' 129 | push af 130 | push bc 131 | push de 132 | push hl 133 | push ix 134 | push iy 135 | 136 | ; Interrupt routine: 137 | ld hl,line_buffer ; HL = start of line buffer 138 | ld de,SCREEN_LINE ; DE = start of destination screen memory 139 | ld b,8 ; line index 140 | .line_loop: 141 | ld c,32 ; pixel byte loop index 142 | .byte_loop: 143 | ld a,(hl) 144 | ld (de),a ; copy byte from line buffer to screen memory 145 | inc hl 146 | inc e 147 | dec c ; decrement loop index for next byte 148 | jp nz,.byte_loop ; keep looping for all bytes in line 149 | ld e,low SCREEN_LINE 150 | inc d ; DE = next line in screen memory 151 | dec b ; decrement loop index for next line 152 | jp nz,.line_loop ; loop until all lines are copied 153 | 154 | ; restore all registers from stack 155 | pop iy 156 | pop ix 157 | pop hl 158 | pop de 159 | pop bc 160 | pop af 161 | ex af,af' ; exchange AF and AF' 162 | exx ; exchange BE,DE,HL with BE',DE',HL' 163 | pop hl 164 | pop de 165 | pop bc 166 | pop af 167 | ei ; re-enable interrupts 168 | ret 169 | 170 | ; Deployment: Snapshot 171 | SAVESNA "irq.sna", start 172 | -------------------------------------------------------------------------------- /Lesson12/sprite.xcf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite.xcf -------------------------------------------------------------------------------- /Lesson12/sprite0.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite0.png -------------------------------------------------------------------------------- /Lesson12/sprite1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite1.png -------------------------------------------------------------------------------- /Lesson12/sprite2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite2.png -------------------------------------------------------------------------------- /Lesson12/sprite3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite3.png -------------------------------------------------------------------------------- /Lesson12/sprite4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson12/sprite4.png -------------------------------------------------------------------------------- /Lesson2/Lesson2.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson2/Lesson2.odp -------------------------------------------------------------------------------- /Lesson2/Lesson2_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson2/Lesson2_Script.odt -------------------------------------------------------------------------------- /Lesson2/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst modes.asm 4 | -------------------------------------------------------------------------------- /Lesson2/modes.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | jp start ; jump over data to code (extended immediate) 6 | 7 | string: 8 | db "hello" 9 | 10 | STRING_LENGTH = 5 11 | 12 | ROM_CLS = $0DAF ; ROM address for "Clear Screen" routine 13 | COLOR_ATTR = $5800 ; start of color attribute memory 14 | ENTER = $0D ; Character code for Enter key 15 | BLACK_WHITE = $47 ; black paper, white ink 16 | 17 | start: 18 | im 1 ; Set interrupt mode to 1 (interrupt mode) 19 | call ROM_CLS ; Call clear screen routine from ROM (extended immediate) 20 | ld hl,string ; HL = address of string (register,extended immediate) 21 | ld b,STRING_LENGTH ; B = length of string (register,immediate) 22 | loop: 23 | ld a,(hl) ; A = byte at address in HL (register,register indirect) 24 | rst $10 ; print character code in A (modified page zero) 25 | inc hl ; increment HL to address of next character (register) 26 | dec b ; decrement B (register) 27 | jr nz,loop ; if B not zero, jump back to top of loop (condition,relative) 28 | ld a,ENTER ; A = Enter character code (register,immediate) 29 | rst $10 ; print Enter for new line (modified page zero) 30 | 31 | ; Let's change the color of the first character we printed 32 | ld a,BLACK_WHITE ; A = black/white color attribute (register,immediate) 33 | ld (COLOR_ATTR),a ; Color attribute(0,0) = A (extended,register) 34 | 35 | ; Let's do it again, but unrolled and with the first letter capitalized 36 | ld ix,string ; IX = address of string (register,extended immediate) 37 | res 5,(ix) ; reset bit 5 of first character (bit,indexed) 38 | ld a,(ix) ; A = string[0] (register,indexed) 39 | rst $10 ; print character (modified page zero) 40 | ld a,(ix+1) ; A = string[1] (register,indexed) 41 | rst $10 ; print character (modified page zero) 42 | ld a,(ix+2) ; A = string[2] (register,indexed) 43 | rst $10 ; print character (modified page zero) 44 | ld a,(ix+3) ; A = string[3] (register,indexed) 45 | rst $10 ; print character (modified page zero) 46 | ld a,(ix+4) ; A = string[4] (register,indexed) 47 | rst $10 ; print character (modified page zero) 48 | ld a,ENTER ; A = Enter character code (register,immediate) 49 | rst $10 ; print Enter for new line (modified page zero) 50 | 51 | ; And, we're done 52 | ret ; return from call (implied) 53 | 54 | 55 | ; Deployment: Snapshot 56 | SAVESNA "modes.sna", start 57 | -------------------------------------------------------------------------------- /Lesson3/Lesson3.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson3/Lesson3.odp -------------------------------------------------------------------------------- /Lesson3/Lesson3_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson3/Lesson3_Script.odt -------------------------------------------------------------------------------- /Lesson3/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst data.asm 4 | -------------------------------------------------------------------------------- /Lesson3/data.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | ld a,%11001100 7 | ld de,$4000 8 | ld (de),a 9 | ex de,hl 10 | ld de,$4001 11 | ld bc,$200 12 | bitmap_loop: 13 | ldi ; fill first 16 rows with vertical bars 14 | ld a,b 15 | or c 16 | jr nz,bitmap_loop 17 | srl (hl) ; shift pattern to right 18 | ld bc,$200 19 | ldir ; fill the next 16 rows with shifted bars 20 | srl (hl) ; shift pattern to right once more 21 | ld de,$45FF 22 | ldd ; copy new pattern to end of next block, decrement DE 23 | ld bc,$1FE 24 | ld hl,$45FF 25 | lddr ; fill in third block backwards 26 | ld hl,$4600 27 | ld (hl),%10011001 28 | ld de,$4601 29 | ld bc,$1FF 30 | exx ; we'll get back to the fourth block later 31 | ld hl,$5800 32 | ld (hl),$41 ; blue ink on black paper 33 | ld de,$5801 34 | ld bc,$FF 35 | color_loop: 36 | ldi 37 | inc (hl) ; increment ink color 38 | ld a,$07 39 | and (hl) ; check to see if ink set to zero (black) 40 | jr nz,next 41 | ld (hl),$41 ; re-initialize color 42 | next: 43 | ld a,b 44 | or c 45 | jr nz,color_loop 46 | exx ; bring back fourth block addresses 47 | ldir ; fill in fourth block 48 | ret 49 | 50 | ; Deployment: Snapshot 51 | SAVESNA "data.sna", start 52 | -------------------------------------------------------------------------------- /Lesson4/Lesson4.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson4/Lesson4.odp -------------------------------------------------------------------------------- /Lesson4/Lesson4_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson4/Lesson4_Script.odt -------------------------------------------------------------------------------- /Lesson4/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst cond.asm 4 | -------------------------------------------------------------------------------- /Lesson4/cond.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | jp start 6 | 7 | ; Character Codes 8 | ENTER = $0D 9 | UPPER_A = $41 10 | UPPER_Z = $5A 11 | LOWER_A = $61 12 | LOWER_Z = $7A 13 | 14 | message: 15 | db "Like And Subscribe!",ENTER 16 | 17 | MSG_LEN = $ - message 18 | 19 | start: 20 | ; Print original message 21 | ld hl,message 22 | ld b,MSG_LEN 23 | orig_loop: 24 | ld a,(hl) 25 | rst $10 26 | inc hl 27 | djnz orig_loop 28 | 29 | ; Print as all lowercase 30 | ld hl,message 31 | ld a,(hl) 32 | lower_loop: 33 | cp UPPER_A 34 | jr c,print_lower_char 35 | cp UPPER_Z+1 36 | call c,tolower 37 | print_lower_char: 38 | rst $10 39 | inc hl 40 | ld a,(hl) 41 | cp ENTER 42 | jr nz,lower_loop 43 | rst $10 44 | 45 | ; Print as all uppercase 46 | ld hl,message 47 | ld b,MSG_LEN 48 | upper_loop: 49 | ld a,(hl) 50 | call toupper 51 | rst $10 52 | inc hl 53 | djnz upper_loop 54 | 55 | ; All done 56 | ret 57 | 58 | tolower: 59 | add $20 60 | ret 61 | 62 | toupper: 63 | cp LOWER_A 64 | ret c 65 | cp LOWER_Z+1 66 | ret nc 67 | sub $20 68 | ret 69 | 70 | ; Deployment: Snapshot 71 | SAVESNA "cond.sna", start 72 | -------------------------------------------------------------------------------- /Lesson5/Lesson5.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson5/Lesson5.odp -------------------------------------------------------------------------------- /Lesson5/Lesson5_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson5/Lesson5_Script.odt -------------------------------------------------------------------------------- /Lesson5/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst math.asm 4 | -------------------------------------------------------------------------------- /Lesson5/math.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | jp start 6 | 7 | ENTER = $0D 8 | 9 | scratch: 10 | dw 0 ; 2 bytes of RAM for general temporary use 11 | 12 | start: 13 | ld a,$10 14 | add a,$02 ; A = $10 + $02 = $12, clears all flags 15 | ld hl,$3456 16 | call print_afhl ; Print contents of A,F,H,L registers 17 | ld d,$0E 18 | add a,d ; A = $12 + $0E = $20, sets H 19 | call print_afhl 20 | ld hl,scratch ; HL = scratch address ($8003) 21 | ld (hl),$60 22 | add a,(hl) ; A = $20 + $60 = $80, sets S and P/V 23 | call print_afhl 24 | add a,h ; A = $80 + $80 = $00, sets Z , P/V and C 25 | call print_afhl 26 | inc a ; A = $00 + $01 = $01, clears all flags, but leaves C set 27 | call print_afhl 28 | neg ; A = $00 - $01 = $FF, sets S, H, N, and C 29 | call print_afhl 30 | ld bc,$0003 31 | sbc hl,bc ; HL = $8003 - $0003 - 1 = $7FFF, sets H, P/V, and N 32 | call print_afhl 33 | sbc hl,hl ; HL = $7FFF - $7FFF - 0 = $0000, set Z and N 34 | call print_afhl 35 | ret 36 | 37 | print_afhl: 38 | push hl 39 | push af 40 | call print_hex ; print A in hex 41 | ld (scratch),sp ; copy SP to RAM 42 | ld bc,(scratch) ; BC = stack pointer addresss 43 | ld a,(bc) ; A = F at top of the stack 44 | call print_hex ; print F in hex 45 | ld a,h ; A = H 46 | call print_hex ; print H in hex 47 | ld a,l ; A = L 48 | call print_hex ; print L in hex 49 | ld a,ENTER 50 | rst $10 ; new line 51 | pop af 52 | pop hl 53 | ret 54 | 55 | print_hex: 56 | push hl 57 | push af 58 | srl a 59 | srl a 60 | srl a 61 | srl a ; A = A >> 4 62 | call print_hex_digit ; print high nybble 63 | pop af ; restore A 64 | and $0F ; clear high nybble 65 | call print_hex_digit ; print low nybble 66 | pop hl 67 | ret 68 | 69 | print_hex_digit: 70 | cp $0A 71 | jp p,print_letter ; if S clear, A >= $0A 72 | or $30 ; A < $0A, just put $3 in upper nybble for number code 73 | jp print_char 74 | print_letter: 75 | add $37 ; A >= $0A, add $37 to get letter code 76 | print_char: 77 | rst $10 ; print code for digit 78 | ret 79 | 80 | 81 | ; Deployment: Snapshot 82 | SAVESNA "math.sna", start 83 | -------------------------------------------------------------------------------- /Lesson6/Lesson6.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson6/Lesson6.odp -------------------------------------------------------------------------------- /Lesson6/Lesson6_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson6/Lesson6_Script.odt -------------------------------------------------------------------------------- /Lesson6/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst stack.asm 4 | -------------------------------------------------------------------------------- /Lesson6/stack.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | jp start 6 | 7 | SCREEN_BITMAP = $4000 8 | BITMAP_SIZE = $1800 9 | SCREEN_COLOR = $5800 10 | COLOR_SIZE = $0300 11 | 12 | sp_backup: 13 | dw 0 14 | 15 | start: 16 | exx 17 | push hl ; preserve HL' 18 | 19 | ; make stripes 20 | ld hl,SCREEN_BITMAP ; start at beginning of screen memory 21 | ld de,$FF00 ; 16-pixel pattern 22 | ld bc,BITMAP_SIZE/2 ; whole screen 23 | call fill_ram ; fill in pixel data 24 | 25 | ld hl,SCREEN_COLOR ; start at beginning of color attribute memory 26 | ld de,$2A2A ; red on cyan for 2 squares 27 | ld bc,COLOR_SIZE/2 ; whole screen 28 | call fill_ram ; fill in color attributes 29 | 30 | pop hl 31 | exx ; restore HL' to gracefully return to BASIC 32 | ret 33 | 34 | fill_ram: ; HL = RAM address 35 | ; BC = number of words 36 | ; DE = word to write 37 | ld (sp_backup),sp ; back up the stack pointer 38 | add hl,bc 39 | add hl,bc ; HL = address after target segment 40 | ld sp,hl ; make the RAM the stack 41 | ld a,$FF 42 | .loop: 43 | push de ; write pattern 44 | dec c ; decrement loop index 45 | jp nz,.loop 46 | dec b ; lower byte wrapped around, decrement upper byte 47 | cp b ; check for underflow 48 | jp nz,.loop 49 | ld sp,(sp_backup) ; restore stack pointer 50 | ret 51 | 52 | ; Deployment: Snapshot 53 | SAVESNA "stack.sna", start 54 | -------------------------------------------------------------------------------- /Lesson7/Lesson7.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson7/Lesson7.odp -------------------------------------------------------------------------------- /Lesson7/Lesson7_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson7/Lesson7_Script.odt -------------------------------------------------------------------------------- /Lesson7/bit.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | jp start 6 | 7 | ; ROM routines 8 | ROM_CLS = $0DAF 9 | ROM_PRINT = $203C 10 | 11 | header: 12 | db "[ A ][ B ][ C ][ (HL) ]" 13 | 14 | hlvar: 15 | db 0 16 | 17 | start: 18 | exx 19 | push hl ; preserve HL' 20 | 21 | ; demo instructions: rlca, rrca, rla, rra, cpl, and, xor, or, rrd, rld, 22 | ; rlc, rrc, rl, rr, sla, sra, sll, srl, bit, res, set 23 | call ROM_CLS 24 | ld de,header 25 | ld bc,32 26 | call ROM_PRINT 27 | 28 | ; set initial register values 29 | ld a,%01101010 30 | ld b,%10010101 31 | ld c,%11001100 32 | ld hl,hlvar 33 | ld (hl),%00111100 34 | 35 | call binregs 36 | rrca ; A: 01101010 --> 00110101, carry clear 37 | rrca ; A: 00110101 --> 10011010, carry set 38 | call binregs 39 | sll a ; A: 10011010 --> 00110101, carry set 40 | sla a ; A: 00110101 --> 01101010, carry clear 41 | call binregs 42 | sra a ; A: 01101010 --> 00110101, carry clear 43 | rr b ; B: 10010101 --> 01001010, carry set 44 | rr c ; C: 11001100 --> 11100110, carry clear 45 | rr (hl) ; (HL): 00111100 --> 00011110, carry clear 46 | call binregs 47 | or b ; A: 00110101 --> 00110101 | 01001010 = 01111111 48 | call binregs 49 | and c ; A: 01111111 --> 01111111 & 11100110 = 01100110 50 | call binregs 51 | xor (hl) ; A: 01100110 --> 01100110 ^ 00011110 = 01111000 52 | call binregs 53 | rld ; A: 01111000, (HL): 00011110 --> A: 01110001, (HL): 11101000 54 | call binregs 55 | rrd ; A: 01110001, (HL): 11101000 --> A: 01111000, (HL): 00011110 56 | call binregs 57 | set 0,a ; A: 01111000 --> 01111001 58 | res 1,b ; B: 01001010 --> 01001000 59 | call binregs 60 | cpl ; A: 01111001 --> 10000110 61 | call binregs 62 | scf ; set carry flag 63 | .bitloop: ; C: 11100110 --> 11001101 --> 10011011 64 | rl c 65 | call binregs 66 | bit 4,c 67 | jp z,.bitloop 68 | 69 | ; set colors 70 | ld b,22 ; set color attributes for first 22 lines 71 | ld hl,$5800 ; starting at top 72 | .rowloop: 73 | ld d,0 74 | call setcolor ; First column (A) = black 75 | inc d 76 | call setcolor ; B = blue 77 | inc d 78 | call setcolor ; C = red 79 | inc d 80 | call setcolor ; (HL) = magenta 81 | dec b 82 | jp nz,.rowloop ; loop until B = 0 83 | 84 | pop hl 85 | exx ; restore HL' to gracefully return to BASIC 86 | ret 87 | 88 | binregs: ; Prints A, B, C and (HL) in binary 89 | push af ; preserve A on stack 90 | call bina ; Print A 91 | ld a,b 92 | call bina ; Print B 93 | ld a,c 94 | call bina ; Print C 95 | ld a,(hl) 96 | call bina ; Print (HL) 97 | pop af ; Restore A 98 | ret 99 | 100 | bina: ; Prints A in binary 101 | push bc ; Preserve BC on stack 102 | ld b,8 ; Loop for all 8 bits 103 | .bitloop: 104 | rlca ; Shift high bit of A into carry bit 105 | ld c,a ; Preserve A in C 106 | jr c,.print1 ; Print "1" if carry bit set 107 | ld a,$30 ; Carry bit clear, A = "0" 108 | jp .next 109 | .print1: 110 | ld a,$31 ; A = "1" 111 | .next: 112 | rst $10 ; Print character code in A ("0" or "1") 113 | ld a,c ; Restore A 114 | dec b 115 | jp nz,.bitloop ; Continue looping until B = 0 116 | pop bc ; Restore BC 117 | ret 118 | 119 | setcolor: ; Input: D = new ink color, HL = color attribute address 120 | ld c,8 ; Loop for 8 color attributes 121 | .attrloop: 122 | ld a,(hl) ; A = current color attribute (ink assumed to be black) 123 | or d ; A = A | D (set new ink color) 124 | ld (hl),a ; Write back new color attribute 125 | inc hl ; HL = next color attribute 126 | dec c 127 | jp nz,.attrloop ; loop until C = 0 128 | ret 129 | 130 | ; Deployment: Snapshot 131 | SAVESNA "bit.sna", start 132 | -------------------------------------------------------------------------------- /Lesson7/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst bit.asm 4 | -------------------------------------------------------------------------------- /Lesson8/Lesson8.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson8/Lesson8.odp -------------------------------------------------------------------------------- /Lesson8/Lesson8_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson8/Lesson8_Script.odt -------------------------------------------------------------------------------- /Lesson8/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst io.asm 4 | -------------------------------------------------------------------------------- /Lesson8/io.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | ld bc,$FEFE ; BC = Port $FEFE (in: keyboard[Shift,Z,X,C,V]; out: beeper) 7 | ld d,0 ; D = byte to output (bit 4 toggled for beeper frequency) 8 | .keyloop: 9 | in a,(c) ; A = key states 10 | bit 2,a ; Check bit 2 (X key) 11 | jp nz,.soundoff ; If bit is set, key is not pressed, turn off sound 12 | ld a,d ; A = last output byte 13 | xor $10 ; flip bit 4 14 | ld d,a ; save new byte back to D 15 | jp .output 16 | .soundoff: 17 | ld a,0 ; hold output to zero 18 | .output: 19 | out (c),a ; output determined byte value 20 | .500 nop ; do a busy wait (2000 T-states = 0.57 ms) 21 | jp .keyloop ; loop indefinitely 22 | 23 | ; Deployment: Snapshot 24 | SAVESNA "io.sna", start 25 | -------------------------------------------------------------------------------- /Lesson8/keyboard.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | ld a,$FE 7 | in a,($FE) 8 | ld bc,$FDFE 9 | in d,(c) 10 | ld b,$FB 11 | in e,(c) 12 | ld b,$F7 13 | in h,(c) 14 | ld b,$EF 15 | in l,(c) 16 | ld b,h 17 | ld c,l 18 | exx 19 | ld bc,$DFFE 20 | in d,(c) 21 | ld b,$BF 22 | in e,(c) 23 | ld b,$7F 24 | in h,(c) 25 | ld b,h 26 | ld c,a 27 | jp start 28 | 29 | ; B = SPACE, SYM SHFT, M, N, B 30 | ; C = SHIFT, Z, X, C, V 31 | ; D = P, O, I, U, Y 32 | ; E = ENTER, L, K, J, H 33 | ; B' = 1, 2, 3, 4, 5 34 | ; C' = 0, 9, 8, 7, 6 35 | ; D' = A, S, D, F, G 36 | ; E' = Q, W, E, R, T 37 | 38 | ret 39 | 40 | ; Deployment: Snapshot 41 | SAVESNA "kb.sna", start 42 | -------------------------------------------------------------------------------- /Lesson8/sound.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | ei 7 | ld c,$fe 8 | sound_loop: 9 | xor $10 10 | halt 11 | out (c),a 12 | jp sound_loop 13 | 14 | ; Deployment: Snapshot 15 | SAVESNA "sound.sna", start 16 | -------------------------------------------------------------------------------- /Lesson9/Lesson9.odp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson9/Lesson9.odp -------------------------------------------------------------------------------- /Lesson9/Lesson9_Script.odt: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/SlithyMatt/zxs-assembly-tutorial/f00d9c560c176bc499b5d95454555ba24726fe1b/Lesson9/Lesson9_Script.odt -------------------------------------------------------------------------------- /Lesson9/build.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | sjasmplus --lst rest.asm 4 | -------------------------------------------------------------------------------- /Lesson9/rest.asm: -------------------------------------------------------------------------------- 1 | DEVICE ZXSPECTRUM48 2 | 3 | org $8000 4 | 5 | start: 6 | exx 7 | push hl ; preserve HL' 8 | 9 | nop ; Do absolutely nothing but waste time! 10 | 11 | ld hl,$3657 ; Load 3657 as BCD into HL 12 | ld bc,$2845 ; Load 2845 as BCD into bc 13 | ld a,l 14 | add a,c ; Add ones and tens places 15 | daa ; Do BCD adjustment 16 | ld l,a 17 | ld a,h 18 | adc a,b ; Add hundreds and thousands places (with possible carry) 19 | daa ; Do BCD adjustment 20 | ld h,a ; HL = HL + BC (BCD) 21 | call printhex ; print decimal digits in H (thousands, hundreds) 22 | ld a,l 23 | call printhex ; print decimal digits in L (tens, ones) 24 | ld a,$0D 25 | rst $10 ; print newline 26 | 27 | ; find the first NOP in main routine 28 | ld hl,start 29 | ld bc,printhex-start ; stop searching after end of routine code 30 | ld a,0 ; A = NOP opcode 31 | cpir 32 | dec hl 33 | ld a,h 34 | call printhex ; print upper byte of first NOP address 35 | ld a,l 36 | call printhex ; print lower byte 37 | ld a,$0D 38 | rst $10 ; print newline 39 | 40 | ; find the last NOP in main routine 41 | ld hl,printhex-1 ; start with last byte 42 | ld bc,printhex-start ; stop searching at beginning of routine code 43 | ld a,0 ; A = NOP opcode 44 | cpdr 45 | inc hl 46 | ld a,h 47 | call printhex ; print upper byte of last NOP address 48 | ld a,l 49 | call printhex ; print lower byte 50 | ld a,$0D 51 | rst $10 ; print newline 52 | 53 | nop ; one more to do even more nothing 54 | 55 | pop hl 56 | exx ; restore HL' to gracefully return to BASIC 57 | ret 58 | 59 | printhex: ; print A as hex byte 60 | push af ; save full byte on stack 61 | srl a 62 | srl a 63 | srl a 64 | srl a ; move upper nybble to lower spot 65 | call printhex_digit ; print upper nybble 66 | pop af ; restore byte 67 | and $0F ; clear out upper nybble 68 | call printhex_digit ; print lower nybble 69 | ret 70 | 71 | printhex_digit: ; print A as hex digit 72 | cp $0A 73 | jp p,print_letter 74 | or $30 75 | jp print_character 76 | print_letter: 77 | add a,$37 78 | print_character: 79 | rst $10 80 | ret 81 | 82 | ; Deployment: Snapshot 83 | SAVESNA "rest.sna", start 84 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # zxs-assembly-tutorial 2 | Z80 Assembly Tutorial for Sinclair ZX Spectrum Development 3 | 4 | This is a repo containing all the materials from my YouTube series. Available 5 | now are the following lessons: 6 | 7 | - Lesson 1: The Basics 8 | - Lesson 2: Addressing Modes 9 | - Lesson 3: Data in Motion 10 | - Lesson 4: Conditionality 11 | - Lesson 5: Arithmetic 12 | - Lesson 6: The Stack 13 | - Lesson 7: Bit by Bit 14 | - Lesson 8: In and Out 15 | - Lesson 9: The Rest 16 | - Lesson 10: The ROM 17 | - Lesson 11: Graphics 18 | 19 | *Coming Soon:* 20 | - Lesson 12: Interrupts 21 | 22 | More to come! 23 | 24 | Each lesson has its own directory here. Please feel free to do what you want 25 | with these code examples - it is all [free and open source](LICENSE). 26 | 27 | ## Tools Required 28 | - Any text editor 29 | - [sjasmplus](https://github.com/z00m128/sjasmplus) 30 | - ZX Spectrum emulator 31 | 32 | ## Tools Recommended 33 | - Text Editor: [Atom](https://atom.io/) 34 | - Packages: [file-types](https://atom.io/packages/file-types), [language-z80asm](https://atom.io/packages/language-z80asm), [language-assembler-sjasmplus](https://atom.io/packages/language-assembler-sjasmplus) 35 | - Emulators: [ZEsarUX](https://github.com/chernandezba/zesarux), [Fuse](http://fuse-emulator.sourceforge.net/) 36 | 37 | ## Further Reading 38 | 39 | - https://en.wikipedia.org/wiki/Hexadecimal 40 | - https://en.wikipedia.org/wiki/Endianness 41 | - https://en.wikipedia.org/wiki/Computer_memory 42 | - https://en.wikipedia.org/wiki/Boolean_algebra 43 | - [Z80 Opcodes](http://z80-heaven.wikidot.com/opcode-reference-chart) 44 | - [Break Into Program: ZX Spectrum](http://www.breakintoprogram.co.uk/computers/zx-spectrum) 45 | - [ZX Spectrum ROM Disassembly](https://skoolkid.github.io/rom/maps/all.html) 46 | --------------------------------------------------------------------------------