├── .gitignore ├── LICENSE ├── README.md ├── TCCONFIG.TC ├── breakout.prj ├── game.c ├── gif.c ├── gif.h ├── mouse.c ├── mouse.h ├── root42-0.gif ├── root42-1.gif ├── root42-2.gif ├── root42-3.gif ├── root42-a.gif ├── root42-b.gif ├── root42.gif ├── run-1.gif ├── run-2.gif ├── run-3.gif ├── run-4.gif ├── run.gif ├── sb.c ├── sb.h ├── test.gif ├── types.h ├── vga.c └── vga.h /.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 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # letscode-breakout 2 | Let's Code MS DOS: Breakout Game 3 | -------------------------------------------------------------------------------- /TCCONFIG.TC: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/TCCONFIG.TC -------------------------------------------------------------------------------- /breakout.prj: -------------------------------------------------------------------------------- 1 | game (gif.h vga.h types.h) 2 | gif (gif.h types.h) 3 | vga (vga.h types.h) 4 | -------------------------------------------------------------------------------- /game.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #include "gif.h" 5 | #include "vga.h" 6 | 7 | #ifndef M_PI 8 | #define M_PI 3.14159 9 | #endif 10 | 11 | unsigned int SINEX[256]; 12 | unsigned int SINEY[256]; 13 | 14 | void init_sin() 15 | { 16 | int i; 17 | for( i = 0;i < 256; ++i ) { 18 | SINEX[i] = 320 * (( sin(2.0*M_PI*i/256.0) + 1.0) / 2.0); 19 | SINEY[i] = 200 * (( sin(2.0*M_PI*i/128.0) + 1.0) / 2.0); 20 | } 21 | } 22 | 23 | int main() 24 | { 25 | struct image *img[4]; 26 | word x, y, frame = 0; 27 | int modex = 1, i = 0; 28 | 29 | init_sin(); 30 | img[0] = load_gif("run-1.gif", modex); 31 | img[1] = load_gif("run-2.gif", modex); 32 | img[2] = load_gif("run-3.gif", modex); 33 | img[3] = load_gif("run-4.gif", modex); 34 | for( i = 0; i < 4; ++i ) { 35 | if( img[i] == NULL ) { 36 | printf( "Couldn't load image %u\n", i ); 37 | return 1; 38 | } 39 | } 40 | set_mode_y(); 41 | set_palette( &img[0]->palette[0][0] ); 42 | 43 | while( !kbhit() ) { 44 | i = frame % 4; 45 | if( modex ) { 46 | blit2page( img[i]->data, vga_page[1], 0, 0, img[i]->width, img[i]->height ); 47 | } else { 48 | copy2page( img[i]->data, vga_page[1], 0, 0, img[i]->width, img[i]->height ); 49 | } 50 | page_flip( &vga_page[0], &vga_page[1] ); 51 | frame++; 52 | delay(250); 53 | } 54 | getch(); 55 | set_text_mode(); 56 | return 0; 57 | } 58 |  -------------------------------------------------------------------------------- /gif.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | #include "gif.h" 6 | 7 | #define GIF_BLOCK_IMAGE 0x2C 8 | #define GIF_EXTENSION_APPLICATION 0xFF 9 | #define GIF_EXTENSION_COMMENT 0xFE 10 | #define GIF_EXTENSION_GFXCONTROL 0xF9 11 | #define GIF_EXTENSION_GFXCONTROL 0xF9 12 | #define GIF_EXTENSION_PLAINTEXT 0x01 13 | #define GIF_FLAG_COLOR_TABLE 0x80 14 | #define GIF_FLAG_INTERLACED 0x40 15 | #define GIF_PACK_COLOR_SIZE 0x07 16 | 17 | typedef struct gif_header { 18 | char signature[7]; 19 | unsigned int screen_width, screen_height; 20 | byte packed; 21 | byte background; 22 | byte aspect; 23 | }; 24 | 25 | struct gif_descriptor { 26 | unsigned int image_left, image_top, image_width, image_height; 27 | byte packed; 28 | }; 29 | 30 | typedef struct gif_block { 31 | byte label; 32 | byte size; 33 | }; 34 | 35 | typedef struct decoder_state { 36 | FILE *gif_file; 37 | struct image *img; 38 | 39 | unsigned int b_pointer; 40 | byte buffer[257]; 41 | byte block_size; 42 | byte code_size; 43 | char bits_in; 44 | byte temp; 45 | 46 | unsigned int first_free; 47 | unsigned int free_code; 48 | byte init_code_size; 49 | unsigned int code, old_code, max_code; 50 | unsigned int clear_code, eoi_code; 51 | unsigned int prefix[ 4096 ]; 52 | byte suffix[ 4096 ]; 53 | 54 | unsigned int x, y; 55 | unsigned int tlx, tly, brx, bry, dy; 56 | 57 | int modex; 58 | }; 59 | 60 | byte load_byte( struct decoder_state *decoder ) 61 | { 62 | if( decoder->b_pointer == decoder->block_size ) { 63 | fread( decoder->buffer, decoder->block_size + 1, 1, decoder->gif_file ); 64 | decoder->b_pointer = 0; 65 | } 66 | return decoder->buffer[ decoder->b_pointer++ ]; 67 | } 68 | 69 | unsigned int read_code( struct decoder_state *decoder ) 70 | { 71 | int counter; 72 | unsigned int code = 0; 73 | 74 | for( counter = 0; counter < decoder->code_size; ++counter ) 75 | { 76 | if( ++(decoder->bits_in) == 9 ) { 77 | decoder->temp = load_byte( decoder ); 78 | decoder->bits_in = 1; 79 | } 80 | if( decoder->temp & 1 ) { 81 | code += 1 << counter; 82 | } 83 | decoder->temp >>= 1; 84 | } 85 | return code; 86 | } 87 | 88 | void next_pixel( struct decoder_state* decoder, unsigned int c ) 89 | { 90 | word plane, x1, sx, sy, offset; 91 | sx = decoder->img->width; 92 | sy = decoder->img->height; 93 | if( decoder->modex ) { 94 | plane = decoder->x % 4; 95 | x1 = decoder->x / 4; 96 | offset = plane * (sx / 4) * sy; 97 | *(decoder->img->data + offset + decoder->y * sx / 4 + x1) = c & 255; 98 | } else { 99 | *(decoder->img->data + decoder->x + decoder->y * sx) = c & 255; 100 | } 101 | 102 | if( ++(decoder->x) == decoder->brx ) 103 | { 104 | printf("."); 105 | decoder->x = decoder->tlx; 106 | switch( decoder->dy ) { 107 | case 0: 108 | decoder->y += 1; 109 | break; 110 | case 1: 111 | decoder->y += 2; 112 | break; 113 | case 2: 114 | decoder->y += 4; 115 | break; 116 | case 3: 117 | case 4: 118 | decoder->y += 8; 119 | break; 120 | } 121 | if( decoder->y >= decoder->bry ) { 122 | switch( --decoder->dy ) { 123 | case 3: 124 | decoder->y = 4; 125 | break; 126 | case 2: 127 | decoder->y = 2; 128 | break; 129 | case 1: 130 | decoder->y = 1; 131 | break; 132 | } 133 | } 134 | } 135 | } 136 | 137 | byte out_string( struct decoder_state *decoder, unsigned int cur_code ) 138 | { 139 | unsigned int out_count; 140 | byte out_code[1024]; 141 | 142 | if( cur_code < decoder->clear_code ) { 143 | next_pixel( decoder, cur_code); 144 | } else { 145 | out_count = 0; 146 | do { 147 | out_code[out_count++] = decoder->suffix[cur_code]; 148 | cur_code = decoder->prefix[cur_code]; 149 | } while( cur_code >= decoder->clear_code ); 150 | out_code[out_count++] = cur_code; 151 | do { 152 | next_pixel( decoder, out_code[--out_count] ); 153 | } while( out_count ); 154 | } 155 | return cur_code; 156 | } 157 | 158 | struct image *load_gif( const char *filename, int modex ) 159 | { 160 | struct image *img = NULL; 161 | struct gif_header header; 162 | struct gif_descriptor descriptor; 163 | struct decoder_state *decoder; 164 | 165 | byte bits_per_pixel; 166 | byte num_of_colors; 167 | unsigned int i; 168 | 169 | FILE *gif_file; 170 | 171 | gif_file = fopen( filename, "rb" ); 172 | if( !gif_file ) { 173 | return NULL; 174 | } 175 | decoder = malloc( sizeof( struct decoder_state ) ); 176 | fread( &header.signature[0], 6, 1, gif_file ); 177 | header.signature[6] = 0; 178 | fread( &header.screen_width, sizeof( header ) - 7, 1, gif_file ); 179 | 180 | if( strncmp( header.signature, "GIF87a", 6 ) 181 | && strncmp( header.signature, "GIF89a", 6 ) ) 182 | { 183 | return NULL; 184 | } 185 | 186 | decoder->modex = modex; 187 | bits_per_pixel = 1 + (header.packed & GIF_PACK_COLOR_SIZE); 188 | num_of_colors = (1 << bits_per_pixel) - 1; 189 | if( bits_per_pixel > 1 && bits_per_pixel <= 4 ) { 190 | bits_per_pixel = 4; 191 | } 192 | 193 | img = malloc( sizeof( struct image ) ); 194 | img->width = header.screen_width; 195 | img->height = header.screen_height; 196 | printf( "far core left: %lu\n", farcoreleft() ); 197 | img->data = (byte far *)farmalloc( img->width * img->height ); 198 | if( img->data == NULL ) { 199 | printf( "Error: could not get memory for image\n" ); 200 | free( img ); 201 | return NULL; 202 | } 203 | memset( img->data, 0, sizeof( img->width * img->height ) ); 204 | 205 | if( header.packed & GIF_FLAG_COLOR_TABLE ) 206 | { 207 | fread( img->palette, 3, num_of_colors + 1, gif_file ); 208 | for( i = 0; i <= num_of_colors; ++i ) { 209 | img->palette[i][0] >>= 2; 210 | img->palette[i][1] >>= 2; 211 | img->palette[i][2] >>= 2; 212 | } 213 | } 214 | 215 | while( 1 ) 216 | { 217 | char type = 0; 218 | struct gif_block block; 219 | 220 | fread( &type, 1, 1, gif_file ); 221 | if( type == GIF_BLOCK_IMAGE ) { 222 | break; 223 | } 224 | 225 | fread( &block, sizeof(struct gif_block), 1, gif_file); 226 | 227 | switch( block.label ) { 228 | case GIF_EXTENSION_GFXCONTROL: 229 | /* skip block: 230 | * packed fields (1) 231 | * delay time (2) 232 | * transparent color (1) 233 | * block terminator (1) 234 | */ 235 | fseek( gif_file, 5, SEEK_CUR ); 236 | break; 237 | case GIF_EXTENSION_APPLICATION: 238 | case GIF_EXTENSION_COMMENT: 239 | case GIF_EXTENSION_PLAINTEXT: 240 | { 241 | fseek( gif_file, block.size, SEEK_CUR ); 242 | while( 1 ) { 243 | fread( &(block.size), 1, 1, gif_file ); 244 | if( !block.size ) { 245 | break; 246 | } 247 | fseek( gif_file, block.size, SEEK_CUR ); 248 | } 249 | break; 250 | } 251 | default: 252 | fseek( gif_file, block.size, SEEK_CUR ); 253 | fseek( gif_file, 1, SEEK_CUR ); 254 | break; 255 | } 256 | } 257 | 258 | fread( &descriptor, sizeof( descriptor ), 1, gif_file ); 259 | 260 | if( descriptor.packed & GIF_FLAG_COLOR_TABLE ) 261 | { 262 | fread( img->palette, 3, num_of_colors + 1, gif_file ); 263 | for( i = 0; i <= num_of_colors; ++i ) { 264 | img->palette[i][0] >>= 2; 265 | img->palette[i][1] >>= 2; 266 | img->palette[i][2] >>= 2; 267 | } 268 | } 269 | 270 | decoder->tlx = descriptor.image_left; 271 | decoder->tly = descriptor.image_top; 272 | decoder->brx = decoder->tlx + descriptor.image_width; 273 | decoder->bry = decoder->tly + descriptor.image_height; 274 | decoder->dy = ( descriptor.packed & GIF_FLAG_INTERLACED ) ? 4 : 0; 275 | 276 | fread( &decoder->code_size, 1, 1, gif_file ); 277 | fread( &decoder->block_size, 1, 1, gif_file ); 278 | 279 | decoder->gif_file = gif_file; 280 | decoder->b_pointer = decoder->block_size; 281 | decoder->clear_code = 1 << decoder->code_size; 282 | decoder->eoi_code = decoder->clear_code + 1; 283 | decoder->first_free = decoder->clear_code + 2; 284 | decoder->free_code = decoder->first_free; 285 | decoder->init_code_size = ++decoder->code_size; 286 | decoder->max_code = 1 << decoder->code_size; 287 | decoder->bits_in = 8; 288 | 289 | decoder->x = descriptor.image_left; 290 | decoder->y = descriptor.image_top; 291 | decoder->img = img; 292 | 293 | do { 294 | decoder->code = read_code( decoder ); 295 | if( decoder->code == decoder->eoi_code ) { 296 | break; 297 | } else if( decoder->code == decoder->clear_code ) { 298 | decoder->free_code = decoder->first_free; 299 | decoder->code_size = decoder->init_code_size; 300 | decoder->max_code = 1 << decoder->code_size; 301 | decoder->code = read_code( decoder ); 302 | decoder->old_code = decoder->code; 303 | next_pixel( decoder, decoder->code ); 304 | } else { 305 | if( decoder->code < decoder->free_code ) { 306 | decoder->suffix[decoder->free_code] = out_string( decoder, decoder->code ); 307 | } else { 308 | decoder->suffix[decoder->free_code] = out_string( decoder, decoder->old_code ); 309 | next_pixel( decoder, decoder->suffix[decoder->free_code] ); 310 | } 311 | decoder->prefix[decoder->free_code++] = decoder->old_code; 312 | if( decoder->free_code >= decoder->max_code && decoder->code_size < 12 ) { 313 | decoder->code_size++; 314 | decoder->max_code <<= 1; 315 | } 316 | decoder->old_code = decoder->code; 317 | } 318 | } while( decoder->code != decoder->eoi_code ); 319 | 320 | fclose( gif_file ); 321 | free(decoder); 322 | printf("\n"); 323 | 324 | return img; 325 | } 326 | 327 | void free_image(struct image *img) 328 | { 329 | if( img == NULL ) { 330 | return; 331 | } 332 | if( img->data != NULL ) { 333 | farfree( img->data ); 334 | } 335 | free( img ); 336 | } 337 |  -------------------------------------------------------------------------------- /gif.h: -------------------------------------------------------------------------------- 1 | #ifndef _GIF_H_ 2 | #define _GIF_H_ 3 | 4 | #include "types.h" 5 | 6 | typedef struct image { 7 | word width; 8 | word height; 9 | byte palette[256][3]; 10 | byte far *data; 11 | }; 12 | 13 | struct image *load_gif( const char *filename, int modex ); 14 | void free_image(struct image *img); 15 | 16 | #endif 17 |  -------------------------------------------------------------------------------- /mouse.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include "mouse.h" 4 | 5 | #define MOUSE_INT 0x33 6 | 7 | #define INIT_MOUSE 0x00 8 | #define SHOW_MOUSE 0x01 9 | #define HIDE_MOUSE 0x02 10 | #define GET_MOUSE_STATUS 0x03 11 | 12 | int init_mouse() 13 | { 14 | union REGS regs; 15 | regs.x.ax = INIT_MOUSE; 16 | int86( MOUSE_INT, ®s, ®s ); 17 | return 0xFFFF == regs.x.ax; 18 | } 19 | 20 | void show_mouse() 21 | { 22 | union REGS regs; 23 | regs.x.ax = SHOW_MOUSE; 24 | int86( MOUSE_INT, ®s, ®s ); 25 | } 26 | 27 | void hide_mouse() 28 | { 29 | union REGS regs; 30 | regs.x.ax = HIDE_MOUSE; 31 | int86( MOUSE_INT, ®s, ®s ); 32 | } 33 | 34 | void get_mouse( int *x, int *y, int *left, int *right ) 35 | { 36 | union REGS regs; 37 | regs.x.ax = GET_MOUSE_STATUS; 38 | int86( MOUSE_INT, ®s, ®s ); 39 | *x = regs.x.cx / 2; 40 | *y = regs.x.dx; 41 | *left = regs.x.bx & 0x1; 42 | *right = regs.x.bx & 0x2; 43 | } 44 | 45 |  46 | -------------------------------------------------------------------------------- /mouse.h: -------------------------------------------------------------------------------- 1 | #ifndef _MOUSE_H_ 2 | #define _MOUSE_H_ 3 | 4 | int init_mouse(); 5 | void show_mouse(); 6 | void hide_mouse(); 7 | void get_mouse( int *x, int *y, int *left, int *right ); 8 | 9 | #endif 10 | -------------------------------------------------------------------------------- /root42-0.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-0.gif -------------------------------------------------------------------------------- /root42-1.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-1.gif -------------------------------------------------------------------------------- /root42-2.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-2.gif -------------------------------------------------------------------------------- /root42-3.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-3.gif -------------------------------------------------------------------------------- /root42-a.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-a.gif -------------------------------------------------------------------------------- /root42-b.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42-b.gif -------------------------------------------------------------------------------- /root42.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/root42.gif -------------------------------------------------------------------------------- /run-1.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/run-1.gif -------------------------------------------------------------------------------- /run-2.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/run-2.gif -------------------------------------------------------------------------------- /run-3.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/run-3.gif -------------------------------------------------------------------------------- /run-4.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/run-4.gif -------------------------------------------------------------------------------- /run.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/run.gif -------------------------------------------------------------------------------- /sb.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | #include "sb.h" 7 | 8 | void single_cycle_playback(); 9 | void read_buffer( short buffer ); 10 | 11 | short sb_base; /* default 220h */ 12 | char sb_irq; /* default 7 */ 13 | char sb_dma; /* default 1 */ 14 | void interrupt ( *old_irq )(); 15 | 16 | short r_buffer; 17 | FILE *raw_file; 18 | long file_size; 19 | 20 | volatile int playing; 21 | volatile long to_be_played; 22 | volatile long to_be_read; 23 | unsigned char *dma_buffer; 24 | short page; 25 | short offset; 26 | 27 | #define DMA_BLOCK_LENGTH 0x7FFF 28 | #define SB_BLOCK_LENGTH 0x3FFF 29 | 30 | #define SB_RESET 0x6 31 | #define SB_READ_DATA 0xA 32 | #define SB_READ_DATA_STATUS 0xE 33 | #define SB_WRITE_DATA 0xC 34 | 35 | #define SB_PAUSE_PLAYBACK 0xD0 36 | #define SB_ENABLE_SPEAKER 0xD1 37 | #define SB_DISABLE_SPEAKER 0xD3 38 | #define SB_SET_PLAYBACK_FREQUENCY 0x40 39 | #define SB_SINGLE_CYCLE_PLAYBACK 0x14 40 | #define SB_START_AUTOINIT_PLAYBACK 0x1C 41 | #define SB_SET_BLOCK_SIZE 0x48 42 | #define SB_STOP_AUTOINIT_PLAYBACK 0xDA 43 | 44 | #define MASK_REGISTER 0x0A 45 | #define MODE_REGISTER 0x0B 46 | #define MSB_LSB_FLIP_FLOP 0x0C 47 | #define DMA_CHANNEL_0 0x87 48 | #define DMA_CHANNEL_1 0x83 49 | #define DMA_CHANNEL_3 0x82 50 | 51 | int reset_dsp(short port) 52 | { 53 | outportb( port + SB_RESET, 1 ); 54 | delay(10); 55 | outportb( port + SB_RESET, 0 ); 56 | delay(10); 57 | if( ((inportb(port + SB_READ_DATA_STATUS) & 0x80) == 0x80) 58 | && (inportb(port + SB_READ_DATA) == 0x0AA ) 59 | ) { 60 | sb_base = port; 61 | return 1; 62 | } 63 | return 0; 64 | } 65 | 66 | void write_dsp( unsigned char command ) 67 | { 68 | while( (inportb( sb_base + SB_WRITE_DATA ) & 0x80) == 0x80 ); 69 | outportb( sb_base + SB_WRITE_DATA, command ); 70 | } 71 | 72 | int sb_detect() 73 | { 74 | char temp; 75 | char *BLASTER; 76 | sb_base = 0; 77 | 78 | /* possible values: 210, 220, 230, 240, 250, 260, 280 */ 79 | for( temp = 1; temp < 9; temp++ ) { 80 | if( temp != 7 ) { 81 | if( reset_dsp( 0x200 + (temp << 4) ) ) { 82 | break; 83 | } 84 | } 85 | } 86 | if( temp == 9 ) { 87 | return 0; 88 | } 89 | 90 | BLASTER = getenv("BLASTER"); 91 | sb_dma = 0; 92 | for( temp = 0; temp < strlen( BLASTER ); ++temp ) { 93 | if((BLASTER[temp] | 32) == 'd') { 94 | sb_dma = BLASTER[temp + 1] - '0'; 95 | } 96 | } 97 | 98 | for( temp = 0; temp < strlen( BLASTER ); ++temp ) { 99 | if((BLASTER[temp] | 32) == 'i') { 100 | sb_irq = BLASTER[temp + 1] - '0'; 101 | if( BLASTER[temp + 2] != ' ' ) { 102 | sb_irq = sb_irq * 10 + BLASTER[ temp + 2 ] - '0'; 103 | } 104 | } 105 | } 106 | 107 | return sb_base != 0; 108 | } 109 | 110 | void interrupt sb_irq_handler() 111 | { 112 | inportb(sb_base + SB_READ_DATA_STATUS); 113 | outportb( 0x20, 0x20 ); 114 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 115 | outportb( 0xA0, 0x20 ); 116 | } 117 | if( playing ) { 118 | to_be_played -= 16384; 119 | if( to_be_played > 0 ) { 120 | read_buffer( r_buffer ); 121 | if( to_be_played <= 16384 ) { 122 | r_buffer ^= 1; 123 | single_cycle_playback(); 124 | } else if( to_be_played <= 32768 ) { 125 | write_dsp( SB_STOP_AUTOINIT_PLAYBACK ); 126 | } else { 127 | /* All is good! continue playing! */ 128 | } 129 | } else { 130 | playing = 0; 131 | } 132 | } 133 | r_buffer ^= 1; 134 | } 135 | 136 | void init_irq() 137 | { 138 | /* save the old irq vector */ 139 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 140 | if( sb_irq == 2) old_irq = getvect( 0x71 ); 141 | if( sb_irq == 10) old_irq = getvect( 0x72 ); 142 | if( sb_irq == 11) old_irq = getvect( 0x73 ); 143 | } else { 144 | old_irq = getvect( sb_irq + 8 ); 145 | } 146 | /* set our own irq vector */ 147 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 148 | if( sb_irq == 2) setvect( 0x71, sb_irq_handler ); 149 | if( sb_irq == 10) setvect( 0x72, sb_irq_handler ); 150 | if( sb_irq == 11) setvect( 0x73, sb_irq_handler ); 151 | } else { 152 | setvect( sb_irq + 8, sb_irq_handler ); 153 | } 154 | /* enable irq with the mainboard's PIC */ 155 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 156 | if( sb_irq == 2) outportb( 0xA1, inportb( 0xA1 ) & 253 ); 157 | if( sb_irq == 10) outportb( 0xA1, inportb( 0xA1 ) & 251 ); 158 | if( sb_irq == 11) outportb( 0xA1, inportb( 0xA1 ) & 247 ); 159 | outportb( 0x21, inportb( 0x21 ) & 251 ); 160 | } else { 161 | outportb( 0x21, inportb( 0x21 ) & !(1 << sb_irq) ); 162 | } 163 | } 164 | 165 | void deinit_irq() 166 | { 167 | /* restore the old irq vector */ 168 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 169 | if( sb_irq == 2) setvect( 0x71, old_irq ); 170 | if( sb_irq == 10) setvect( 0x72, old_irq ); 171 | if( sb_irq == 11) setvect( 0x73, old_irq ); 172 | } else { 173 | setvect( sb_irq + 8, old_irq ); 174 | } 175 | /* enable irq with the mainboard's PIC */ 176 | if( sb_irq == 2 || sb_irq == 10 || sb_irq == 11 ) { 177 | if( sb_irq == 2) outportb( 0xA1, inportb( 0xA1 ) | 2 ); 178 | if( sb_irq == 10) outportb( 0xA1, inportb( 0xA1 ) | 4 ); 179 | if( sb_irq == 11) outportb( 0xA1, inportb( 0xA1 ) | 8 ); 180 | outportb( 0x21, inportb( 0x21 ) | 4 ); 181 | } else { 182 | outportb( 0x21, inportb( 0x21 ) & (1 << sb_irq) ); 183 | } 184 | } 185 | 186 | void assign_dma_buffer() 187 | { 188 | unsigned char* temp_buf; 189 | long linear_address; 190 | short page1, page2; 191 | 192 | temp_buf = (char *) malloc(32768); 193 | linear_address = FP_SEG(temp_buf); 194 | linear_address = (linear_address << 4)+FP_OFF(temp_buf); 195 | page1 = linear_address >> 16; 196 | page2 = (linear_address + 32767) >> 16; 197 | if( page1 != page2 ) { 198 | dma_buffer = (char *)malloc(32768); 199 | free( temp_buf ); 200 | } else { 201 | dma_buffer = temp_buf; 202 | } 203 | linear_address = FP_SEG(dma_buffer); 204 | linear_address = (linear_address << 4)+FP_OFF(dma_buffer); 205 | page = linear_address >> 16; 206 | offset = linear_address & 0xFFFF; 207 | } 208 | 209 | void sb_init() 210 | { 211 | init_irq(); 212 | assign_dma_buffer(); 213 | write_dsp( SB_ENABLE_SPEAKER ); 214 | } 215 | 216 | void sb_deinit() 217 | { 218 | write_dsp( SB_DISABLE_SPEAKER ); 219 | free( dma_buffer ); 220 | deinit_irq(); 221 | } 222 | 223 | void single_cycle_playback() 224 | { 225 | playing = 1; 226 | /* program the DMA controller */ 227 | outportb( MASK_REGISTER, 4 | sb_dma ); 228 | outportb( MSB_LSB_FLIP_FLOP, 0 ); 229 | outportb( MODE_REGISTER, 0x48 | sb_dma ); 230 | outportb( sb_dma << 1, offset & 0xFF ); 231 | outportb( sb_dma << 1, offset >> 8 ); 232 | switch( sb_dma ) { 233 | case 0: 234 | outportb( DMA_CHANNEL_0, page ); 235 | break; 236 | case 1: 237 | outportb( DMA_CHANNEL_1, page ); 238 | break; 239 | case 3: 240 | outportb( DMA_CHANNEL_3, page ); 241 | break; 242 | } 243 | outportb((sb_dma << 1) + 1, to_be_played & 0xFF ); 244 | outportb((sb_dma << 1) + 1, to_be_played >> 8 ); 245 | outportb(MASK_REGISTER, sb_dma); 246 | write_dsp(SB_SINGLE_CYCLE_PLAYBACK); 247 | write_dsp(to_be_played & 0xFF); 248 | write_dsp(to_be_played >> 8); 249 | to_be_played = 0; 250 | } 251 | 252 | void sb_single_play( const char *file_name ) 253 | { 254 | memset(dma_buffer, 0, 32768); 255 | raw_file = fopen(file_name, "rb"); 256 | fseek(raw_file, 0L, SEEK_END); 257 | file_size = ftell( raw_file ); 258 | fseek(raw_file, 0L, SEEK_SET); 259 | fread(dma_buffer, 1, file_size, raw_file); 260 | write_dsp(SB_SET_PLAYBACK_FREQUENCY); 261 | write_dsp(256-1000000/11000); 262 | to_be_played = file_size; 263 | single_cycle_playback(); 264 | } 265 | 266 | void sb_stop() 267 | { 268 | write_dsp( SB_PAUSE_PLAYBACK ); 269 | playing = 0; 270 | fclose( raw_file ); 271 | } 272 | 273 | void read_buffer( short buffer ) 274 | { 275 | const int buf_off = buffer << 14; 276 | if( to_be_read <= 0 ) { 277 | return; 278 | } 279 | if( to_be_read < 16384 ) { 280 | memset( dma_buffer + buf_off, 128, 16384 ); 281 | fread( dma_buffer + buf_off, 1, to_be_read, raw_file ); 282 | to_be_read = 0; 283 | } else { 284 | fread( dma_buffer + buf_off, 1, 16384, raw_file ); 285 | to_be_read -= 16384; 286 | } 287 | } 288 | 289 | void auto_init_playback() 290 | { 291 | /* program the DMA controller */ 292 | outportb( MASK_REGISTER, 4 | sb_dma ); 293 | outportb( MSB_LSB_FLIP_FLOP, 0 ); 294 | /* 295 | * 0x58 + DMA = 010110xx 296 | * ^^ block mode 297 | * ^^ auto init 298 | * ^^ read operation (SB reads from memory) 299 | */ 300 | outportb( MODE_REGISTER, 0x58 | sb_dma ); 301 | outportb( sb_dma << 1, offset & 0xFF ); 302 | outportb( sb_dma << 1, offset >> 8 ); 303 | switch( sb_dma ) { 304 | case 0: 305 | outportb( DMA_CHANNEL_0, page ); 306 | break; 307 | case 1: 308 | outportb( DMA_CHANNEL_1, page ); 309 | break; 310 | case 3: 311 | outportb( DMA_CHANNEL_3, page ); 312 | break; 313 | } 314 | outportb((sb_dma << 1) + 1, DMA_BLOCK_LENGTH & 0xFF ); 315 | outportb((sb_dma << 1) + 1, DMA_BLOCK_LENGTH >> 8 ); 316 | outportb(MASK_REGISTER, sb_dma); 317 | write_dsp(SB_SET_BLOCK_SIZE); 318 | write_dsp(SB_BLOCK_LENGTH & 0xFF); 319 | write_dsp(SB_BLOCK_LENGTH >> 8); 320 | write_dsp(SB_START_AUTOINIT_PLAYBACK); 321 | } 322 | 323 | void sb_auto_play( const char *file_name ) 324 | { 325 | if( !dma_buffer ) { 326 | return; 327 | } 328 | r_buffer = 0; 329 | memset( dma_buffer, 0, 32768 ); 330 | raw_file = fopen( file_name, "rb" ); 331 | if( !raw_file ) { 332 | printf("error: file not found %s\n", file_name ); 333 | return; 334 | } 335 | fseek( raw_file, 0L, SEEK_END ); 336 | file_size = ftell( raw_file ); 337 | fseek( raw_file, 0L, SEEK_SET ); 338 | to_be_read = to_be_played = file_size; 339 | printf("to be read: %lu\n", to_be_read ); 340 | write_dsp( SB_SET_PLAYBACK_FREQUENCY ); 341 | write_dsp( 256-1000000/11000 ); 342 | write_dsp( SB_ENABLE_SPEAKER ); 343 | read_buffer( 0 ); 344 | read_buffer( 1 ); 345 | if( to_be_read > 0 ) { 346 | printf( "auto init playback...\n" ); 347 | auto_init_playback(); 348 | } else { 349 | printf( "single cycle playback...\n" ); 350 | single_cycle_playback(); 351 | } 352 | playing = 1; 353 | } 354 | 355 | #if 0 356 | 357 | int main() 358 | { 359 | int sb_detected = 0; 360 | 361 | sb_detected = sb_detect(); 362 | if( !sb_detected ) { 363 | printf("SoundBlaster not found!\n"); 364 | return 1; 365 | } else { 366 | printf("SoundBlaster found at A%x I%u D%u.\n", sb_base, sb_irq, sb_dma ); 367 | } 368 | 369 | sb_init(); 370 | sb_auto_play("lwhome.raw"); 371 | while( playing && !kbhit() ) 372 | ; 373 | sb_stop(); 374 | sb_deinit(); 375 | return 0; 376 | } 377 | 378 | #endif 379 |  380 | -------------------------------------------------------------------------------- /sb.h: -------------------------------------------------------------------------------- 1 | #ifndef _SB_H_ 2 | #define _SB_H_ 3 | 4 | int sb_detect(); 5 | void sb_init(); 6 | void sb_deinit(); 7 | void sb_stop(); 8 | void sb_auto_play( const char *file_name ); 9 | 10 | #endif 11 | -------------------------------------------------------------------------------- /test.gif: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/root42/letscode-breakout/0406c9442d7dfe55a7eb6f8a6ae8c41b25b5cfa5/test.gif -------------------------------------------------------------------------------- /types.h: -------------------------------------------------------------------------------- 1 | #ifndef _MY_TYPES_H_ 2 | #define _MY_TYPES_H_ 3 | 4 | typedef unsigned char byte; 5 | typedef unsigned int word; 6 | typedef unsigned long dword; 7 | 8 | #endif 9 |  -------------------------------------------------------------------------------- /vga.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | #include "vga.h" 5 | 6 | #define SET_MODE 0x00 7 | #define VIDEO_INT 0x10 8 | #define VGA_256_COLOR_MODE 0x13 9 | #define TEXT_MODE 0x03 10 | 11 | byte far * const VGA=(byte far *)0xA0000000L; 12 | 13 | /* dimensions of each page and offset */ 14 | word vga_width = 320; 15 | word vga_height = 200; 16 | word vga_page[4]; 17 | word vga_current_page = 0; 18 | word vga_x_pan = 0; 19 | byte vga_x_pel_pan = 0; 20 | word vga_y_pan = 0; 21 | 22 | void set_graphics_mode() 23 | { 24 | set_mode(VGA_256_COLOR_MODE); 25 | } 26 | 27 | void set_text_mode() 28 | { 29 | set_mode(TEXT_MODE); 30 | } 31 | 32 | void set_mode(byte mode) 33 | { 34 | union REGS regs; 35 | regs.h.ah = SET_MODE; 36 | regs.h.al = mode; 37 | int86( VIDEO_INT, ®s, ®s ); 38 | } 39 | 40 | void update_page_offsets() 41 | { 42 | vga_page[0] = 0; 43 | vga_page[1] = ((dword)vga_width*vga_height) / 4; 44 | vga_page[2] = vga_page[1] * 2; 45 | vga_page[3] = vga_page[1] * 3; 46 | } 47 | 48 | void set_mode_y() 49 | { 50 | set_mode( VGA_256_COLOR_MODE ); 51 | update_page_offsets(); 52 | /* disable chain 4 */ 53 | outportb( SC_INDEX, MEMORY_MODE ); 54 | outportb( SC_DATA, 0x06 ); 55 | /* disable doubleword mode */ 56 | outportb( CRTC_INDEX, UNDERLINE_LOCATION ); 57 | outportb( CRTC_DATA, 0x00 ); 58 | /* disable word mode */ 59 | outportb( CRTC_INDEX, MODE_CONTROL ); 60 | outportb( CRTC_DATA, 0xE3 ); 61 | /* clear all VGA mem */ 62 | outportb( SC_INDEX, MAP_MASK ); 63 | outportb( SC_DATA, 0xFF ); 64 | /* write 2^16 nulls */ 65 | memset( VGA + 0x0000, 0, 0x8000 ); /* 0x10000 / 2 = 0x8000 */ 66 | memset( VGA + 0x8000, 0, 0x8000 ); /* 0x10000 / 2 = 0x8000 */ 67 | } 68 | 69 | void set_virtual_640() 70 | { 71 | vga_width = 640; 72 | update_page_offsets(); 73 | outportb( CRTC_INDEX, LINE_OFFSET ); 74 | outportb( CRTC_DATA, vga_width / 8 ); 75 | } 76 | 77 | void set_pan_x( int x ) 78 | { 79 | vga_x_pan = x / 4; 80 | vga_x_pel_pan = x % 4; 81 | } 82 | 83 | void set_pan_y( int y ) 84 | { 85 | vga_y_pan = y; 86 | } 87 | 88 | void update_pan() 89 | { 90 | byte ac; 91 | word o,high_address,low_address; 92 | 93 | o = vga_y_pan * (vga_width >> 2) + vga_x_pan; 94 | high_address = HIGH_ADDRESS | (o & 0xFF00); 95 | low_address = LOW_ADDRESS | (o << 8); 96 | outport( CRTC_INDEX, high_address ); 97 | outport( CRTC_INDEX, low_address ); 98 | disable(); 99 | inp( INPUT_STATUS ); 100 | ac = inp( AC_WRITE ); 101 | outportb( AC_WRITE, PEL_PANNING ); 102 | outportb( AC_WRITE, vga_x_pel_pan ); 103 | outportb( AC_WRITE, ac ); 104 | while( inp( INPUT_STATUS ) & VRETRACE ); 105 | while( !(inp( INPUT_STATUS ) & VRETRACE ) ); 106 | enable(); 107 | } 108 | 109 | void setpix( word page, int x, int y, byte c ) 110 | { 111 | outportb( SC_INDEX, MAP_MASK ); 112 | outportb( SC_DATA, 1 << (x & 3) ); 113 | VGA[ page + ((dword)vga_width * y >> 2) + (x >> 2) ] = c; 114 | /* x/4 is equal to x>>2 */ 115 | } 116 | 117 | void page_flip( word *page1, word *page2 ) 118 | { 119 | byte ac; 120 | word temp; 121 | word high_address, low_address; 122 | 123 | temp = *page1; 124 | *page1 = *page2; 125 | *page2 = temp; 126 | 127 | high_address = HIGH_ADDRESS | ((*page1 + vga_x_pan) & 0xFF00); 128 | low_address = LOW_ADDRESS | ((*page1 + vga_x_pan) << 8); 129 | /* 130 | instead of: 131 | outportb( CRTC_INDEX, HIGH_ADDRESS ); 132 | outportb( CRTC_DATA, (*page1 & 0xFF00) >> 8 ); 133 | 134 | do this: 135 | high_address = HIGH_ADDRESS | (*page1 & 0xFF00); 136 | outport( CRTC_INDEX, high_address ); 137 | */ 138 | outport( CRTC_INDEX, high_address ); 139 | outport( CRTC_INDEX, low_address ); 140 | disable(); 141 | #if 0 142 | ac = inp( AC_WRITE ); 143 | outportb( AC_WRITE, PEL_PANNING ); 144 | outportb( AC_WRITE, vga_x_pel_pan ); 145 | outportb( AC_WRITE, ac ); 146 | #endif 147 | while( inp( INPUT_STATUS ) & VRETRACE ); 148 | while( !(inp( INPUT_STATUS ) & VRETRACE ) ); 149 | enable(); 150 | vga_current_page = *page1; 151 | } 152 | 153 | void copy2page( byte far *s, word page, int x0, int y0, int w, int h ) 154 | { 155 | int x,y; 156 | byte c; 157 | for( y = 0; y < h; y++ ) { 158 | for( x = 0; x < w; ++x ) { 159 | c = *(s + (dword)y * w + x); 160 | setpix( page, x0 + x, y0 + y, c); 161 | } 162 | } 163 | } 164 | 165 | void wait_for_retrace() 166 | { 167 | while( inp( INPUT_STATUS ) & VRETRACE ); 168 | while( ! (inp( INPUT_STATUS ) & VRETRACE) ); 169 | } 170 | 171 | void set_palette(byte *palette) 172 | { 173 | int i; 174 | 175 | outp( PALETTE_INDEX, 0 ); 176 | for( i = 0; i < NUM_COLORS * 3; ++i ) { 177 | outp( PALETTE_DATA, palette[ i ] ); 178 | } 179 | } 180 | 181 | void blit2mem( byte far *d, int x, int y, int w, int h ) 182 | { 183 | int i; 184 | byte far *src = (byte far *)VGA + x + y * vga_width; 185 | byte far *dst = d; 186 | for( i = y; i < y + h; ++i ) { 187 | movedata( FP_SEG( src ), FP_OFF( src ), 188 | FP_SEG( dst ), FP_OFF( dst ), w ); 189 | src += vga_width; 190 | dst += w; 191 | } 192 | } 193 | 194 | void blit2vga( byte far *s, int x, int y, int w, int h ) 195 | { 196 | int i; 197 | byte far *src = s; 198 | byte far *dst = (byte far *)VGA + x + y * vga_width; 199 | for( i = y; i < y + h; ++i ) { 200 | movedata( FP_SEG( src ), FP_OFF( src ), 201 | FP_SEG( dst ), FP_OFF( dst ), w ); 202 | src += w; 203 | dst += vga_width; 204 | } 205 | } 206 | 207 | void blit2page( byte far *s, word page, int x, int y, int w, int h ) 208 | { 209 | int j; 210 | byte p; 211 | dword screen_offset; 212 | dword bitmap_offset; 213 | 214 | for( p = 0; p < 4; p++ ) { 215 | outportb( SC_INDEX, MAP_MASK ); 216 | outportb( SC_DATA, 1 << ((p + x) & 3) ); 217 | bitmap_offset = p * w / 4 * h; 218 | screen_offset = ((dword)y * vga_width + x + p) >> 2; 219 | for(j=0; j> 2 225 | ); 226 | bitmap_offset += w >> 2; 227 | screen_offset += vga_width >> 2; 228 | } 229 | } 230 | } 231 | 232 | /* Warning: no clipping! */ 233 | void draw_rectangle( int x, int y, int w, int h, byte c ) 234 | { 235 | int i, j; 236 | for( j = y; j < y + h; ++j ) { 237 | for( i = x; i < x + w; ++i ) { 238 | byte far *dst = (byte far *)VGA + i + j * vga_width; 239 | *dst = c; 240 | } 241 | } 242 | } 243 | 244 |  -------------------------------------------------------------------------------- /vga.h: -------------------------------------------------------------------------------- 1 | #ifndef _VGA_H_ 2 | #define _VGA_H_ 3 | 4 | #include "types.h" 5 | 6 | #define NUM_COLORS 256 7 | 8 | /* VGA ports */ 9 | #define PALETTE_INDEX 0x3C8 10 | #define PALETTE_DATA 0x3C9 11 | #define INPUT_STATUS 0x03DA 12 | #define MISC_OUTPUT 0x3C2 13 | #define AC_WRITE 0x3C0 14 | #define AC_READ 0x3C1 15 | #define SC_INDEX 0x3C4 16 | #define SC_DATA 0x3C5 17 | #define GC_INDEX 0x03CE 18 | #define GC_DATA 0x03CF 19 | #define CRTC_INDEX 0x03D4 20 | #define CRTC_DATA 0x03D5 21 | 22 | /* VGA status bits */ 23 | #define DISPLAY_ENABLE 0x01 24 | #define VRETRACE 0x08 25 | 26 | /* Attribute controller registers */ 27 | #define PEL_PANNING 0x13 28 | 29 | /* Sequence controller registers */ 30 | #define MAP_MASK 0x02 31 | #define ALL_PLANES 0xFF02 32 | #define MEMORY_MODE 0x04 33 | 34 | /* CRT controller registers */ 35 | #define HIGH_ADDRESS 0x0C 36 | #define LOW_ADDRESS 0x0D 37 | #define LINE_OFFSET 0x13 38 | #define UNDERLINE_LOCATION 0x14 39 | #define MODE_CONTROL 0x17 40 | 41 | /* VGA memory pointer, dimensions of each page and offset */ 42 | extern byte far * const VGA; 43 | extern word vga_width; 44 | extern word vga_height; 45 | extern word vga_page[4]; 46 | 47 | #define MAX(x,y) ((x) > (y) ? (x) : (y)) 48 | #define MIN(x,y) ((x) < (y) ? (x) : (y)) 49 | 50 | void set_graphics_mode(); 51 | void set_mode_y(); 52 | void set_virtual_640(); 53 | void set_x_pan( int x ); 54 | void set_y_pan( int y ); 55 | void update_pan(); 56 | void set_text_mode(); 57 | void set_mode( byte mode ); 58 | void set_palette(byte *palette); 59 | void setpix(word page, int x, int y, byte c); 60 | 61 | void wait_for_retrace(); 62 | void page_flip(word *page1, word *page2); 63 | 64 | void copy2page( byte far *s, word page, int x, int y, int w, int h ); 65 | void blit2page( byte far *s, word page, int x, int y, int w, int h ); 66 | void blit2mem( byte far *d, int x, int y, int w, int h ); 67 | void blit2vga( byte far *s, int x, int y, int w, int h ); 68 | void draw_rectangle( int x, int y, int w, int h, byte c ); 69 | 70 | #endif 71 |  --------------------------------------------------------------------------------