├── .gitignore ├── AUTHORS ├── COPYING ├── ChangeLog ├── Makefile.am ├── NEWS ├── README.md ├── autogen.sh ├── configure.ac ├── m4 ├── ax_cxx_compile_stdcxx.m4 └── ax_cxx_compile_stdcxx_11.m4 └── src ├── gbafix.c ├── gbalzss.cpp ├── gbfs.c ├── gbfs.h ├── insgbfs.c ├── lsgbfs.c └── ungbfs.c /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | INSTALL 3 | Makefile 4 | Makefile.in 5 | aclocal.m4 6 | autom4te.cache 7 | compile 8 | config.guess 9 | config.log 10 | config.status 11 | config.sub 12 | configure 13 | depcomp 14 | gbafix 15 | gbalzss 16 | gbfs 17 | insgbfs 18 | install-sh 19 | lsgbfs 20 | missing 21 | src/.deps/ 22 | src/.dirstamp 23 | ungbfs 24 | -------------------------------------------------------------------------------- /AUTHORS: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/devkitPro/gba-tools/054d507f90d32784274b6cf7e03f1c43d02d7a57/AUTHORS -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 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 | -------------------------------------------------------------------------------- /ChangeLog: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/devkitPro/gba-tools/054d507f90d32784274b6cf7e03f1c43d02d7a57/ChangeLog -------------------------------------------------------------------------------- /Makefile.am: -------------------------------------------------------------------------------- 1 | # Makefile.am -- Process this file with automake to produce Makefile.in 2 | # 3 | AUTOMAKE_OPTIONS = subdir-objects 4 | 5 | bin_PROGRAMS = gbafix gbalzss gbfs insgbfs lsgbfs ungbfs 6 | 7 | gbafix_SOURCES = src/gbafix.c 8 | gbalzss_SOURCES = src/gbalzss.cpp 9 | gbfs_SOURCES = src/gbfs.c src/gbfs.h 10 | insgbfs_SOURCES = src/insgbfs.c 11 | lsgbfs_SOURCES = src/lsgbfs.c src/gbfs.h 12 | ungbfs_SOURCES = src/ungbfs.c src/gbfs.h 13 | 14 | EXTRA_DIST = autogen.sh README.md 15 | -------------------------------------------------------------------------------- /NEWS: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/devkitPro/gba-tools/054d507f90d32784274b6cf7e03f1c43d02d7a57/NEWS -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # gba-tools 2 | 3 | Collection of tools for Game Boy Advance development. 4 | 5 | ## gbafix 6 | 7 | Pads and patches GBA ROMs. 8 | 9 | Authors: [Dark Fader](https://github.com/darkfader), BlackThunder, [WinterMute](https://github.com/WinterMute), and [Diegoisawesome](https://github.com/Diegoisawesome). 10 | 11 | Usage: 12 | ``` 13 | gbafix [-p] [-t[title]] [-c] [-m] [-r] [-d] 14 | 15 | romfile ROM input file 16 | -p Pad to next exact power of 2. No minimum size! 17 | -t[] Patch title. Stripped filename if none given. 18 | -c<game_code> Patch game code (four characters) 19 | -m<maker_code> Patch maker code (two characters) 20 | -r<version> Patch game version (number) 21 | -d<debug> Enable debugging handler and set debug entry point (0 or 1) 22 | ``` 23 | 24 | ## gbalzss 25 | 26 | Compresses and uncompresses ROMs. 27 | 28 | Author: [Michael Theall](https://github.com/mtheall) 29 | 30 | Usage: 31 | ``` 32 | gbalzss [-h|--help] [--lz11] [--vram] <d|e> <infile> <outfile> 33 | 34 | -h, --help Show this help 35 | --lz11 Compress using LZ11 instead of LZ10 36 | --vram Generate VRAM-safe output (required by GBA BIOS) 37 | e Compress <infile> into <outfile> 38 | d Decompress <infile> into <outfile> 39 | <infile> Input file (use - for stdin) 40 | <outfile> Output file (use - for stdout) 41 | ``` 42 | 43 | ## gbfs 44 | 45 | Creates a GBFS archive. 46 | 47 | Author: [Damian Yerrick](https://github.com/pinobatch) 48 | 49 | Usage: 50 | ``` 51 | gbfs archive [file...] 52 | 53 | archive Output file 54 | file Input file(s) 55 | ``` 56 | 57 | ## insgbfs 58 | 59 | Inserts a GBFS file (or any other file) into a GBFS_SPACE (identified by symbol name) in a ROM. 60 | 61 | Author: [Damian Yerrick](https://github.com/pinobatch) 62 | 63 | Usage: 64 | ``` 65 | insgbfs sourcefile romfile symname 66 | 67 | sourcefile Input file 68 | romfile ROM file 69 | symname symbol name 70 | ``` 71 | 72 | ## lsgbfs 73 | 74 | Lists objects in a GBFS file. 75 | 76 | Author: [Damian Yerrick](https://github.com/pinobatch) 77 | 78 | Usage 79 | ``` 80 | lsgbfs file 81 | 82 | file Input GBFS file 83 | ``` 84 | 85 | ## ungbfs 86 | 87 | Dumps the objects in a GBFS file to separate files. 88 | 89 | Author: [Damian Yerrick](https://github.com/pinobatch) 90 | 91 | Usage: 92 | ``` 93 | ungbfs file 94 | 95 | file Input GBFS file 96 | ``` 97 | -------------------------------------------------------------------------------- /autogen.sh: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | 3 | touch AUTHORS ChangeLog NEWS 4 | aclocal 5 | autoconf 6 | automake --add-missing -c 7 | -------------------------------------------------------------------------------- /configure.ac: -------------------------------------------------------------------------------- 1 | # -*- Autoconf -*- 2 | # Process this file with autoconf to produce a configure script. 3 | 4 | AC_PREREQ([2.69]) 5 | AC_INIT([gba-tools],[1.2.0],[https://github.com/devkitpro/gba-tools/issues]) 6 | AC_CONFIG_MACRO_DIR([m4]) 7 | AC_CONFIG_SRCDIR([src/gbafix.c]) 8 | 9 | AM_INIT_AUTOMAKE([foreign]) 10 | 11 | AC_CANONICAL_BUILD 12 | AC_CANONICAL_HOST 13 | 14 | AC_PROG_CC 15 | AC_PROG_CXX 16 | 17 | AX_CXX_COMPILE_STDCXX_11(noext, mandatory) 18 | 19 | AC_CONFIG_FILES([Makefile]) 20 | AC_OUTPUT 21 | -------------------------------------------------------------------------------- /m4/ax_cxx_compile_stdcxx.m4: -------------------------------------------------------------------------------- 1 | # =========================================================================== 2 | # https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html 3 | # =========================================================================== 4 | # 5 | # SYNOPSIS 6 | # 7 | # AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional]) 8 | # 9 | # DESCRIPTION 10 | # 11 | # Check for baseline language coverage in the compiler for the specified 12 | # version of the C++ standard. If necessary, add switches to CXX and 13 | # CXXCPP to enable support. VERSION may be '11' (for the C++11 standard) 14 | # or '14' (for the C++14 standard). 15 | # 16 | # The second argument, if specified, indicates whether you insist on an 17 | # extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g. 18 | # -std=c++11). If neither is specified, you get whatever works, with 19 | # preference for an extended mode. 20 | # 21 | # The third argument, if specified 'mandatory' or if left unspecified, 22 | # indicates that baseline support for the specified C++ standard is 23 | # required and that the macro should error out if no mode with that 24 | # support is found. If specified 'optional', then configuration proceeds 25 | # regardless, after defining HAVE_CXX${VERSION} if and only if a 26 | # supporting mode is found. 27 | # 28 | # LICENSE 29 | # 30 | # Copyright (c) 2008 Benjamin Kosnik <bkoz@redhat.com> 31 | # Copyright (c) 2012 Zack Weinberg <zackw@panix.com> 32 | # Copyright (c) 2013 Roy Stogner <roystgnr@ices.utexas.edu> 33 | # Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov <sokolov@google.com> 34 | # Copyright (c) 2015 Paul Norman <penorman@mac.com> 35 | # Copyright (c) 2015 Moritz Klammler <moritz@klammler.eu> 36 | # Copyright (c) 2016 Krzesimir Nowak <qdlacz@gmail.com> 37 | # 38 | # Copying and distribution of this file, with or without modification, are 39 | # permitted in any medium without royalty provided the copyright notice 40 | # and this notice are preserved. This file is offered as-is, without any 41 | # warranty. 42 | 43 | #serial 7 44 | 45 | dnl This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro 46 | dnl (serial version number 13). 47 | 48 | AX_REQUIRE_DEFINED([AC_MSG_WARN]) 49 | AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl 50 | m4_if([$1], [11], [ax_cxx_compile_alternatives="11 0x"], 51 | [$1], [14], [ax_cxx_compile_alternatives="14 1y"], 52 | [$1], [17], [ax_cxx_compile_alternatives="17 1z"], 53 | [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl 54 | m4_if([$2], [], [], 55 | [$2], [ext], [], 56 | [$2], [noext], [], 57 | [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl 58 | m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true], 59 | [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true], 60 | [$3], [optional], [ax_cxx_compile_cxx$1_required=false], 61 | [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])]) 62 | AC_LANG_PUSH([C++])dnl 63 | ac_success=no 64 | AC_CACHE_CHECK(whether $CXX supports C++$1 features by default, 65 | ax_cv_cxx_compile_cxx$1, 66 | [AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 67 | [ax_cv_cxx_compile_cxx$1=yes], 68 | [ax_cv_cxx_compile_cxx$1=no])]) 69 | if test x$ax_cv_cxx_compile_cxx$1 = xyes; then 70 | ac_success=yes 71 | fi 72 | 73 | m4_if([$2], [noext], [], [dnl 74 | if test x$ac_success = xno; then 75 | for alternative in ${ax_cxx_compile_alternatives}; do 76 | switch="-std=gnu++${alternative}" 77 | cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch]) 78 | AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch, 79 | $cachevar, 80 | [ac_save_CXX="$CXX" 81 | CXX="$CXX $switch" 82 | AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 83 | [eval $cachevar=yes], 84 | [eval $cachevar=no]) 85 | CXX="$ac_save_CXX"]) 86 | if eval test x\$$cachevar = xyes; then 87 | CXX="$CXX $switch" 88 | if test -n "$CXXCPP" ; then 89 | CXXCPP="$CXXCPP $switch" 90 | fi 91 | ac_success=yes 92 | break 93 | fi 94 | done 95 | fi]) 96 | 97 | m4_if([$2], [ext], [], [dnl 98 | if test x$ac_success = xno; then 99 | dnl HP's aCC needs +std=c++11 according to: 100 | dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf 101 | dnl Cray's crayCC needs "-h std=c++11" 102 | for alternative in ${ax_cxx_compile_alternatives}; do 103 | for switch in -std=c++${alternative} +std=c++${alternative} "-h std=c++${alternative}"; do 104 | cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch]) 105 | AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch, 106 | $cachevar, 107 | [ac_save_CXX="$CXX" 108 | CXX="$CXX $switch" 109 | AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])], 110 | [eval $cachevar=yes], 111 | [eval $cachevar=no]) 112 | CXX="$ac_save_CXX"]) 113 | if eval test x\$$cachevar = xyes; then 114 | CXX="$CXX $switch" 115 | if test -n "$CXXCPP" ; then 116 | CXXCPP="$CXXCPP $switch" 117 | fi 118 | ac_success=yes 119 | break 120 | fi 121 | done 122 | if test x$ac_success = xyes; then 123 | break 124 | fi 125 | done 126 | fi]) 127 | AC_LANG_POP([C++]) 128 | if test x$ax_cxx_compile_cxx$1_required = xtrue; then 129 | if test x$ac_success = xno; then 130 | AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.]) 131 | fi 132 | fi 133 | if test x$ac_success = xno; then 134 | HAVE_CXX$1=0 135 | AC_MSG_NOTICE([No compiler with C++$1 support was found]) 136 | else 137 | HAVE_CXX$1=1 138 | AC_DEFINE(HAVE_CXX$1,1, 139 | [define if the compiler supports basic C++$1 syntax]) 140 | fi 141 | AC_SUBST(HAVE_CXX$1) 142 | m4_if([$1], [17], [AC_MSG_WARN([C++17 is not yet standardized, so the checks may change in incompatible ways anytime])]) 143 | ]) 144 | 145 | 146 | dnl Test body for checking C++11 support 147 | 148 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11], 149 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 150 | ) 151 | 152 | 153 | dnl Test body for checking C++14 support 154 | 155 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14], 156 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 157 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_14 158 | ) 159 | 160 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_17], 161 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_11 162 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_14 163 | _AX_CXX_COMPILE_STDCXX_testbody_new_in_17 164 | ) 165 | 166 | dnl Tests for new features in C++11 167 | 168 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[ 169 | 170 | // If the compiler admits that it is not ready for C++11, why torture it? 171 | // Hopefully, this will speed up the test. 172 | 173 | #ifndef __cplusplus 174 | 175 | #error "This is not a C++ compiler" 176 | 177 | #elif __cplusplus < 201103L 178 | 179 | #error "This is not a C++11 compiler" 180 | 181 | #else 182 | 183 | namespace cxx11 184 | { 185 | 186 | namespace test_static_assert 187 | { 188 | 189 | template <typename T> 190 | struct check 191 | { 192 | static_assert(sizeof(int) <= sizeof(T), "not big enough"); 193 | }; 194 | 195 | } 196 | 197 | namespace test_final_override 198 | { 199 | 200 | struct Base 201 | { 202 | virtual void f() {} 203 | }; 204 | 205 | struct Derived : public Base 206 | { 207 | virtual void f() override {} 208 | }; 209 | 210 | } 211 | 212 | namespace test_double_right_angle_brackets 213 | { 214 | 215 | template < typename T > 216 | struct check {}; 217 | 218 | typedef check<void> single_type; 219 | typedef check<check<void>> double_type; 220 | typedef check<check<check<void>>> triple_type; 221 | typedef check<check<check<check<void>>>> quadruple_type; 222 | 223 | } 224 | 225 | namespace test_decltype 226 | { 227 | 228 | int 229 | f() 230 | { 231 | int a = 1; 232 | decltype(a) b = 2; 233 | return a + b; 234 | } 235 | 236 | } 237 | 238 | namespace test_type_deduction 239 | { 240 | 241 | template < typename T1, typename T2 > 242 | struct is_same 243 | { 244 | static const bool value = false; 245 | }; 246 | 247 | template < typename T > 248 | struct is_same<T, T> 249 | { 250 | static const bool value = true; 251 | }; 252 | 253 | template < typename T1, typename T2 > 254 | auto 255 | add(T1 a1, T2 a2) -> decltype(a1 + a2) 256 | { 257 | return a1 + a2; 258 | } 259 | 260 | int 261 | test(const int c, volatile int v) 262 | { 263 | static_assert(is_same<int, decltype(0)>::value == true, ""); 264 | static_assert(is_same<int, decltype(c)>::value == false, ""); 265 | static_assert(is_same<int, decltype(v)>::value == false, ""); 266 | auto ac = c; 267 | auto av = v; 268 | auto sumi = ac + av + 'x'; 269 | auto sumf = ac + av + 1.0; 270 | static_assert(is_same<int, decltype(ac)>::value == true, ""); 271 | static_assert(is_same<int, decltype(av)>::value == true, ""); 272 | static_assert(is_same<int, decltype(sumi)>::value == true, ""); 273 | static_assert(is_same<int, decltype(sumf)>::value == false, ""); 274 | static_assert(is_same<int, decltype(add(c, v))>::value == true, ""); 275 | return (sumf > 0.0) ? sumi : add(c, v); 276 | } 277 | 278 | } 279 | 280 | namespace test_noexcept 281 | { 282 | 283 | int f() { return 0; } 284 | int g() noexcept { return 0; } 285 | 286 | static_assert(noexcept(f()) == false, ""); 287 | static_assert(noexcept(g()) == true, ""); 288 | 289 | } 290 | 291 | namespace test_constexpr 292 | { 293 | 294 | template < typename CharT > 295 | unsigned long constexpr 296 | strlen_c_r(const CharT *const s, const unsigned long acc) noexcept 297 | { 298 | return *s ? strlen_c_r(s + 1, acc + 1) : acc; 299 | } 300 | 301 | template < typename CharT > 302 | unsigned long constexpr 303 | strlen_c(const CharT *const s) noexcept 304 | { 305 | return strlen_c_r(s, 0UL); 306 | } 307 | 308 | static_assert(strlen_c("") == 0UL, ""); 309 | static_assert(strlen_c("1") == 1UL, ""); 310 | static_assert(strlen_c("example") == 7UL, ""); 311 | static_assert(strlen_c("another\0example") == 7UL, ""); 312 | 313 | } 314 | 315 | namespace test_rvalue_references 316 | { 317 | 318 | template < int N > 319 | struct answer 320 | { 321 | static constexpr int value = N; 322 | }; 323 | 324 | answer<1> f(int&) { return answer<1>(); } 325 | answer<2> f(const int&) { return answer<2>(); } 326 | answer<3> f(int&&) { return answer<3>(); } 327 | 328 | void 329 | test() 330 | { 331 | int i = 0; 332 | const int c = 0; 333 | static_assert(decltype(f(i))::value == 1, ""); 334 | static_assert(decltype(f(c))::value == 2, ""); 335 | static_assert(decltype(f(0))::value == 3, ""); 336 | } 337 | 338 | } 339 | 340 | namespace test_uniform_initialization 341 | { 342 | 343 | struct test 344 | { 345 | static const int zero {}; 346 | static const int one {1}; 347 | }; 348 | 349 | static_assert(test::zero == 0, ""); 350 | static_assert(test::one == 1, ""); 351 | 352 | } 353 | 354 | namespace test_lambdas 355 | { 356 | 357 | void 358 | test1() 359 | { 360 | auto lambda1 = [](){}; 361 | auto lambda2 = lambda1; 362 | lambda1(); 363 | lambda2(); 364 | } 365 | 366 | int 367 | test2() 368 | { 369 | auto a = [](int i, int j){ return i + j; }(1, 2); 370 | auto b = []() -> int { return '0'; }(); 371 | auto c = [=](){ return a + b; }(); 372 | auto d = [&](){ return c; }(); 373 | auto e = [a, &b](int x) mutable { 374 | const auto identity = [](int y){ return y; }; 375 | for (auto i = 0; i < a; ++i) 376 | a += b--; 377 | return x + identity(a + b); 378 | }(0); 379 | return a + b + c + d + e; 380 | } 381 | 382 | int 383 | test3() 384 | { 385 | const auto nullary = [](){ return 0; }; 386 | const auto unary = [](int x){ return x; }; 387 | using nullary_t = decltype(nullary); 388 | using unary_t = decltype(unary); 389 | const auto higher1st = [](nullary_t f){ return f(); }; 390 | const auto higher2nd = [unary](nullary_t f1){ 391 | return [unary, f1](unary_t f2){ return f2(unary(f1())); }; 392 | }; 393 | return higher1st(nullary) + higher2nd(nullary)(unary); 394 | } 395 | 396 | } 397 | 398 | namespace test_variadic_templates 399 | { 400 | 401 | template <int...> 402 | struct sum; 403 | 404 | template <int N0, int... N1toN> 405 | struct sum<N0, N1toN...> 406 | { 407 | static constexpr auto value = N0 + sum<N1toN...>::value; 408 | }; 409 | 410 | template <> 411 | struct sum<> 412 | { 413 | static constexpr auto value = 0; 414 | }; 415 | 416 | static_assert(sum<>::value == 0, ""); 417 | static_assert(sum<1>::value == 1, ""); 418 | static_assert(sum<23>::value == 23, ""); 419 | static_assert(sum<1, 2>::value == 3, ""); 420 | static_assert(sum<5, 5, 11>::value == 21, ""); 421 | static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, ""); 422 | 423 | } 424 | 425 | // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae 426 | // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function 427 | // because of this. 428 | namespace test_template_alias_sfinae 429 | { 430 | 431 | struct foo {}; 432 | 433 | template<typename T> 434 | using member = typename T::member_type; 435 | 436 | template<typename T> 437 | void func(...) {} 438 | 439 | template<typename T> 440 | void func(member<T>*) {} 441 | 442 | void test(); 443 | 444 | void test() { func<foo>(0); } 445 | 446 | } 447 | 448 | } // namespace cxx11 449 | 450 | #endif // __cplusplus >= 201103L 451 | 452 | ]]) 453 | 454 | 455 | dnl Tests for new features in C++14 456 | 457 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[ 458 | 459 | // If the compiler admits that it is not ready for C++14, why torture it? 460 | // Hopefully, this will speed up the test. 461 | 462 | #ifndef __cplusplus 463 | 464 | #error "This is not a C++ compiler" 465 | 466 | #elif __cplusplus < 201402L 467 | 468 | #error "This is not a C++14 compiler" 469 | 470 | #else 471 | 472 | namespace cxx14 473 | { 474 | 475 | namespace test_polymorphic_lambdas 476 | { 477 | 478 | int 479 | test() 480 | { 481 | const auto lambda = [](auto&&... args){ 482 | const auto istiny = [](auto x){ 483 | return (sizeof(x) == 1UL) ? 1 : 0; 484 | }; 485 | const int aretiny[] = { istiny(args)... }; 486 | return aretiny[0]; 487 | }; 488 | return lambda(1, 1L, 1.0f, '1'); 489 | } 490 | 491 | } 492 | 493 | namespace test_binary_literals 494 | { 495 | 496 | constexpr auto ivii = 0b0000000000101010; 497 | static_assert(ivii == 42, "wrong value"); 498 | 499 | } 500 | 501 | namespace test_generalized_constexpr 502 | { 503 | 504 | template < typename CharT > 505 | constexpr unsigned long 506 | strlen_c(const CharT *const s) noexcept 507 | { 508 | auto length = 0UL; 509 | for (auto p = s; *p; ++p) 510 | ++length; 511 | return length; 512 | } 513 | 514 | static_assert(strlen_c("") == 0UL, ""); 515 | static_assert(strlen_c("x") == 1UL, ""); 516 | static_assert(strlen_c("test") == 4UL, ""); 517 | static_assert(strlen_c("another\0test") == 7UL, ""); 518 | 519 | } 520 | 521 | namespace test_lambda_init_capture 522 | { 523 | 524 | int 525 | test() 526 | { 527 | auto x = 0; 528 | const auto lambda1 = [a = x](int b){ return a + b; }; 529 | const auto lambda2 = [a = lambda1(x)](){ return a; }; 530 | return lambda2(); 531 | } 532 | 533 | } 534 | 535 | namespace test_digit_separators 536 | { 537 | 538 | constexpr auto ten_million = 100'000'000; 539 | static_assert(ten_million == 100000000, ""); 540 | 541 | } 542 | 543 | namespace test_return_type_deduction 544 | { 545 | 546 | auto f(int& x) { return x; } 547 | decltype(auto) g(int& x) { return x; } 548 | 549 | template < typename T1, typename T2 > 550 | struct is_same 551 | { 552 | static constexpr auto value = false; 553 | }; 554 | 555 | template < typename T > 556 | struct is_same<T, T> 557 | { 558 | static constexpr auto value = true; 559 | }; 560 | 561 | int 562 | test() 563 | { 564 | auto x = 0; 565 | static_assert(is_same<int, decltype(f(x))>::value, ""); 566 | static_assert(is_same<int&, decltype(g(x))>::value, ""); 567 | return x; 568 | } 569 | 570 | } 571 | 572 | } // namespace cxx14 573 | 574 | #endif // __cplusplus >= 201402L 575 | 576 | ]]) 577 | 578 | 579 | dnl Tests for new features in C++17 580 | 581 | m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_17], [[ 582 | 583 | // If the compiler admits that it is not ready for C++17, why torture it? 584 | // Hopefully, this will speed up the test. 585 | 586 | #ifndef __cplusplus 587 | 588 | #error "This is not a C++ compiler" 589 | 590 | #elif __cplusplus <= 201402L 591 | 592 | #error "This is not a C++17 compiler" 593 | 594 | #else 595 | 596 | #if defined(__clang__) 597 | #define REALLY_CLANG 598 | #else 599 | #if defined(__GNUC__) 600 | #define REALLY_GCC 601 | #endif 602 | #endif 603 | 604 | #include <initializer_list> 605 | #include <utility> 606 | #include <type_traits> 607 | 608 | namespace cxx17 609 | { 610 | 611 | #if !defined(REALLY_CLANG) 612 | namespace test_constexpr_lambdas 613 | { 614 | 615 | // TODO: test it with clang++ from git 616 | 617 | constexpr int foo = [](){return 42;}(); 618 | 619 | } 620 | #endif // !defined(REALLY_CLANG) 621 | 622 | namespace test::nested_namespace::definitions 623 | { 624 | 625 | } 626 | 627 | namespace test_fold_expression 628 | { 629 | 630 | template<typename... Args> 631 | int multiply(Args... args) 632 | { 633 | return (args * ... * 1); 634 | } 635 | 636 | template<typename... Args> 637 | bool all(Args... args) 638 | { 639 | return (args && ...); 640 | } 641 | 642 | } 643 | 644 | namespace test_extended_static_assert 645 | { 646 | 647 | static_assert (true); 648 | 649 | } 650 | 651 | namespace test_auto_brace_init_list 652 | { 653 | 654 | auto foo = {5}; 655 | auto bar {5}; 656 | 657 | static_assert(std::is_same<std::initializer_list<int>, decltype(foo)>::value); 658 | static_assert(std::is_same<int, decltype(bar)>::value); 659 | } 660 | 661 | namespace test_typename_in_template_template_parameter 662 | { 663 | 664 | template<template<typename> typename X> struct D; 665 | 666 | } 667 | 668 | namespace test_fallthrough_nodiscard_maybe_unused_attributes 669 | { 670 | 671 | int f1() 672 | { 673 | return 42; 674 | } 675 | 676 | [[nodiscard]] int f2() 677 | { 678 | [[maybe_unused]] auto unused = f1(); 679 | 680 | switch (f1()) 681 | { 682 | case 17: 683 | f1(); 684 | [[fallthrough]]; 685 | case 42: 686 | f1(); 687 | } 688 | return f1(); 689 | } 690 | 691 | } 692 | 693 | namespace test_extended_aggregate_initialization 694 | { 695 | 696 | struct base1 697 | { 698 | int b1, b2 = 42; 699 | }; 700 | 701 | struct base2 702 | { 703 | base2() { 704 | b3 = 42; 705 | } 706 | int b3; 707 | }; 708 | 709 | struct derived : base1, base2 710 | { 711 | int d; 712 | }; 713 | 714 | derived d1 {{1, 2}, {}, 4}; // full initialization 715 | derived d2 {{}, {}, 4}; // value-initialized bases 716 | 717 | } 718 | 719 | namespace test_general_range_based_for_loop 720 | { 721 | 722 | struct iter 723 | { 724 | int i; 725 | 726 | int& operator* () 727 | { 728 | return i; 729 | } 730 | 731 | const int& operator* () const 732 | { 733 | return i; 734 | } 735 | 736 | iter& operator++() 737 | { 738 | ++i; 739 | return *this; 740 | } 741 | }; 742 | 743 | struct sentinel 744 | { 745 | int i; 746 | }; 747 | 748 | bool operator== (const iter& i, const sentinel& s) 749 | { 750 | return i.i == s.i; 751 | } 752 | 753 | bool operator!= (const iter& i, const sentinel& s) 754 | { 755 | return !(i == s); 756 | } 757 | 758 | struct range 759 | { 760 | iter begin() const 761 | { 762 | return {0}; 763 | } 764 | 765 | sentinel end() const 766 | { 767 | return {5}; 768 | } 769 | }; 770 | 771 | void f() 772 | { 773 | range r {}; 774 | 775 | for (auto i : r) 776 | { 777 | [[maybe_unused]] auto v = i; 778 | } 779 | } 780 | 781 | } 782 | 783 | namespace test_lambda_capture_asterisk_this_by_value 784 | { 785 | 786 | struct t 787 | { 788 | int i; 789 | int foo() 790 | { 791 | return [*this]() 792 | { 793 | return i; 794 | }(); 795 | } 796 | }; 797 | 798 | } 799 | 800 | namespace test_enum_class_construction 801 | { 802 | 803 | enum class byte : unsigned char 804 | {}; 805 | 806 | byte foo {42}; 807 | 808 | } 809 | 810 | namespace test_constexpr_if 811 | { 812 | 813 | template <bool cond> 814 | int f () 815 | { 816 | if constexpr(cond) 817 | { 818 | return 13; 819 | } 820 | else 821 | { 822 | return 42; 823 | } 824 | } 825 | 826 | } 827 | 828 | namespace test_selection_statement_with_initializer 829 | { 830 | 831 | int f() 832 | { 833 | return 13; 834 | } 835 | 836 | int f2() 837 | { 838 | if (auto i = f(); i > 0) 839 | { 840 | return 3; 841 | } 842 | 843 | switch (auto i = f(); i + 4) 844 | { 845 | case 17: 846 | return 2; 847 | 848 | default: 849 | return 1; 850 | } 851 | } 852 | 853 | } 854 | 855 | #if !defined(REALLY_CLANG) 856 | namespace test_template_argument_deduction_for_class_templates 857 | { 858 | 859 | // TODO: test it with clang++ from git 860 | 861 | template <typename T1, typename T2> 862 | struct pair 863 | { 864 | pair (T1 p1, T2 p2) 865 | : m1 {p1}, 866 | m2 {p2} 867 | {} 868 | 869 | T1 m1; 870 | T2 m2; 871 | }; 872 | 873 | void f() 874 | { 875 | [[maybe_unused]] auto p = pair{13, 42u}; 876 | } 877 | 878 | } 879 | #endif // !defined(REALLY_CLANG) 880 | 881 | namespace test_non_type_auto_template_parameters 882 | { 883 | 884 | template <auto n> 885 | struct B 886 | {}; 887 | 888 | B<5> b1; 889 | B<'a'> b2; 890 | 891 | } 892 | 893 | #if !defined(REALLY_CLANG) 894 | namespace test_structured_bindings 895 | { 896 | 897 | // TODO: test it with clang++ from git 898 | 899 | int arr[2] = { 1, 2 }; 900 | std::pair<int, int> pr = { 1, 2 }; 901 | 902 | auto f1() -> int(&)[2] 903 | { 904 | return arr; 905 | } 906 | 907 | auto f2() -> std::pair<int, int>& 908 | { 909 | return pr; 910 | } 911 | 912 | struct S 913 | { 914 | int x1 : 2; 915 | volatile double y1; 916 | }; 917 | 918 | S f3() 919 | { 920 | return {}; 921 | } 922 | 923 | auto [ x1, y1 ] = f1(); 924 | auto& [ xr1, yr1 ] = f1(); 925 | auto [ x2, y2 ] = f2(); 926 | auto& [ xr2, yr2 ] = f2(); 927 | const auto [ x3, y3 ] = f3(); 928 | 929 | } 930 | #endif // !defined(REALLY_CLANG) 931 | 932 | #if !defined(REALLY_CLANG) 933 | namespace test_exception_spec_type_system 934 | { 935 | 936 | // TODO: test it with clang++ from git 937 | 938 | struct Good {}; 939 | struct Bad {}; 940 | 941 | void g1() noexcept; 942 | void g2(); 943 | 944 | template<typename T> 945 | Bad 946 | f(T*, T*); 947 | 948 | template<typename T1, typename T2> 949 | Good 950 | f(T1*, T2*); 951 | 952 | static_assert (std::is_same_v<Good, decltype(f(g1, g2))>); 953 | 954 | } 955 | #endif // !defined(REALLY_CLANG) 956 | 957 | namespace test_inline_variables 958 | { 959 | 960 | template<class T> void f(T) 961 | {} 962 | 963 | template<class T> inline T g(T) 964 | { 965 | return T{}; 966 | } 967 | 968 | template<> inline void f<>(int) 969 | {} 970 | 971 | template<> int g<>(int) 972 | { 973 | return 5; 974 | } 975 | 976 | } 977 | 978 | } // namespace cxx17 979 | 980 | #endif // __cplusplus <= 201402L 981 | 982 | ]]) 983 | -------------------------------------------------------------------------------- /m4/ax_cxx_compile_stdcxx_11.m4: -------------------------------------------------------------------------------- 1 | # ============================================================================= 2 | # https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx_11.html 3 | # ============================================================================= 4 | # 5 | # SYNOPSIS 6 | # 7 | # AX_CXX_COMPILE_STDCXX_11([ext|noext], [mandatory|optional]) 8 | # 9 | # DESCRIPTION 10 | # 11 | # Check for baseline language coverage in the compiler for the C++11 12 | # standard; if necessary, add switches to CXX and CXXCPP to enable 13 | # support. 14 | # 15 | # This macro is a convenience alias for calling the AX_CXX_COMPILE_STDCXX 16 | # macro with the version set to C++11. The two optional arguments are 17 | # forwarded literally as the second and third argument respectively. 18 | # Please see the documentation for the AX_CXX_COMPILE_STDCXX macro for 19 | # more information. If you want to use this macro, you also need to 20 | # download the ax_cxx_compile_stdcxx.m4 file. 21 | # 22 | # LICENSE 23 | # 24 | # Copyright (c) 2008 Benjamin Kosnik <bkoz@redhat.com> 25 | # Copyright (c) 2012 Zack Weinberg <zackw@panix.com> 26 | # Copyright (c) 2013 Roy Stogner <roystgnr@ices.utexas.edu> 27 | # Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov <sokolov@google.com> 28 | # Copyright (c) 2015 Paul Norman <penorman@mac.com> 29 | # Copyright (c) 2015 Moritz Klammler <moritz@klammler.eu> 30 | # 31 | # Copying and distribution of this file, with or without modification, are 32 | # permitted in any medium without royalty provided the copyright notice 33 | # and this notice are preserved. This file is offered as-is, without any 34 | # warranty. 35 | 36 | #serial 18 37 | 38 | AX_REQUIRE_DEFINED([AX_CXX_COMPILE_STDCXX]) 39 | AC_DEFUN([AX_CXX_COMPILE_STDCXX_11], [AX_CXX_COMPILE_STDCXX([11], [$1], [$2])]) 40 | -------------------------------------------------------------------------------- /src/gbafix.c: -------------------------------------------------------------------------------- 1 | /* 2 | "$Id: gbafix.c,v 1.2 2008-07-30 17:12:51 wntrmute Exp $" 3 | 4 | DevkitPro GBA ROM fix utility 5 | 6 | This library is free software; you can redistribute it and/or 7 | modify it under the terms of the GNU Library General Public 8 | License as published by the Free Software Foundation; either 9 | version 2 of the License, or (at your option) any later version. 10 | 11 | This library is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14 | Library General Public License for more details. 15 | 16 | You should have received a copy of the GNU Library General Public 17 | License along with this library; if not, write to the Free Software 18 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 19 | USA. 20 | 21 | Please report all bugs and problems through the bug tracker at 22 | "http://sourceforge.net/tracker/?group_id=114505&atid=668551". 23 | 24 | "$Header: /lvm/shared/ds/ds/cvs/devkitpro-cvsbackup/tools/gba/gbatools/gbafix.c,v 1.2 2008-07-30 17:12:51 wntrmute Exp $" 25 | 26 | */ 27 | //--------------------------------------------------------------------------------- 28 | // gbafix.c 29 | //--------------------------------------------------------------------------------- 30 | /* 31 | Gameboy Advance ROM fixer (by Dark Fader / BlackThunder / WinterMute / Diegoisawesome) 32 | Validates header of GBA roms. 33 | 34 | History 35 | ------- 36 | v1.05 - added debug offset argument, (Diegoisawesome) 37 | v1.04 - converted to plain C, (WinterMute) 38 | v1.03 - header.fixed, header.device_type 39 | v1.02 - redefined the options (rgbfix style), checksum=0 40 | v1.01 - fix in parameters 41 | v1.00 - logo, complement 42 | */ 43 | 44 | #pragma pack(1) 45 | 46 | #include <stdio.h> 47 | #include <stdlib.h> 48 | #include <string.h> 49 | #include <stdint.h> 50 | 51 | #define VER "1.05" 52 | #define ARGV argv[arg] 53 | #define VALUE (ARGV+2) 54 | #define NUMBER strtoul(VALUE, NULL, 0) 55 | 56 | typedef struct 57 | { 58 | uint32_t start_code; // B instruction 59 | uint8_t logo[0xA0-0x04]; // logo data 60 | uint8_t title[0xC]; // game title name 61 | uint32_t game_code; // 62 | uint16_t maker_code; // 63 | uint8_t fixed; // 0x96 64 | uint8_t unit_code; // 0x00 65 | uint8_t device_type; // 0x00 66 | uint8_t unused[7]; // 67 | uint8_t game_version; // 0x00 68 | uint8_t complement; // 800000A0..800000BC 69 | uint16_t checksum; // 0x0000 70 | } Header; 71 | 72 | 73 | Header header; 74 | 75 | unsigned short checksum_without_header = 0; 76 | 77 | const Header good_header = 78 | { 79 | // start_code 80 | 0xEA00002E, 81 | // logo 82 | { 0x24,0xFF,0xAE,0x51,0x69,0x9A,0xA2,0x21,0x3D,0x84,0x82,0x0A,0x84,0xE4,0x09,0xAD, 83 | 0x11,0x24,0x8B,0x98,0xC0,0x81,0x7F,0x21,0xA3,0x52,0xBE,0x19,0x93,0x09,0xCE,0x20, 84 | 0x10,0x46,0x4A,0x4A,0xF8,0x27,0x31,0xEC,0x58,0xC7,0xE8,0x33,0x82,0xE3,0xCE,0xBF, 85 | 0x85,0xF4,0xDF,0x94,0xCE,0x4B,0x09,0xC1,0x94,0x56,0x8A,0xC0,0x13,0x72,0xA7,0xFC, 86 | 0x9F,0x84,0x4D,0x73,0xA3,0xCA,0x9A,0x61,0x58,0x97,0xA3,0x27,0xFC,0x03,0x98,0x76, 87 | 0x23,0x1D,0xC7,0x61,0x03,0x04,0xAE,0x56,0xBF,0x38,0x84,0x00,0x40,0xA7,0x0E,0xFD, 88 | 0xFF,0x52,0xFE,0x03,0x6F,0x95,0x30,0xF1,0x97,0xFB,0xC0,0x85,0x60,0xD6,0x80,0x25, 89 | 0xA9,0x63,0xBE,0x03,0x01,0x4E,0x38,0xE2,0xF9,0xA2,0x34,0xFF,0xBB,0x3E,0x03,0x44, 90 | 0x78,0x00,0x90,0xCB,0x88,0x11,0x3A,0x94,0x65,0xC0,0x7C,0x63,0x87,0xF0,0x3C,0xAF, 91 | 0xD6,0x25,0xE4,0x8B,0x38,0x0A,0xAC,0x72,0x21,0xD4,0xF8,0x07 } , 92 | // title 93 | { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 }, 94 | // game code 95 | 0x00000000, 96 | // maker code 97 | 0x3130, 98 | // fixed 99 | 0x96, 100 | // unit_code 101 | 0x00, 102 | // device type 103 | 0x00, 104 | // unused 105 | { 0x00,0x00,0x00,0x00,0x00,0x00,0x00 }, 106 | // game version 107 | 0x00, 108 | // complement 109 | 0x00, 110 | // checksum 111 | 0x0000 112 | }; 113 | 114 | //--------------------------------------------------------------------------------- 115 | char HeaderComplement() 116 | /*--------------------------------------------------------------------------------- 117 | Calculate Header complement check 118 | ---------------------------------------------------------------------------------*/ 119 | { 120 | int n; 121 | char c = 0; 122 | char *p = (char *)&header + 0xA0; 123 | for (n=0; n<0xBD-0xA0; n++) 124 | { 125 | c += *p++; 126 | } 127 | return -(0x19+c); 128 | } 129 | 130 | 131 | //--------------------------------------------------------------------------------- 132 | int main(int argc, char *argv[]) 133 | //--------------------------------------------------------------------------------- 134 | { 135 | int arg; 136 | char *argfile = 0; 137 | FILE *infile; 138 | 139 | int size,bit; 140 | 141 | // show syntax 142 | if (argc <= 1) 143 | { 144 | printf("GBA ROM fixer v"VER" by Dark Fader / BlackThunder / WinterMute / Diegoisawesome \n"); 145 | printf("Syntax: gbafix <rom.gba> [-p] [-t[title]] [-c<game_code>] [-m<maker_code>] [-r<version>] [-d<debug>]\n"); 146 | printf("\n"); 147 | printf("parameters:\n"); 148 | printf(" -p Pad to next exact power of 2. No minimum size!\n"); 149 | printf(" -t[<title>] Patch title. Stripped filename if none given.\n"); 150 | printf(" -c<game_code> Patch game code (four characters)\n"); 151 | printf(" -m<maker_code> Patch maker code (two characters)\n"); 152 | printf(" -r<version> Patch game version (number)\n"); 153 | printf(" -d<debug> Enable debugging handler and set debug entry point (0 or 1)\n"); 154 | return -1; 155 | } 156 | 157 | // get filename 158 | for (arg=1; arg<argc; arg++) 159 | { 160 | if ((ARGV[0] != '-')) { argfile=ARGV; break; } 161 | } 162 | 163 | // check filename 164 | if (!argfile) 165 | { 166 | printf("Filename needed!\n"); 167 | return -1; 168 | } 169 | 170 | // read file 171 | infile = fopen(argfile, "r+b"); 172 | if (!infile) { printf("Error opening input file!\n"); return -1; } 173 | fseek(infile, 0, SEEK_SET); 174 | fread(&header, sizeof(header), 1, infile); 175 | 176 | // fix some data 177 | memcpy(header.logo, good_header.logo, sizeof(header.logo)); 178 | memcpy(&header.fixed, &good_header.fixed, sizeof(header.fixed)); 179 | memcpy(&header.device_type, &good_header.device_type, sizeof(header.device_type)); 180 | 181 | // parse command line 182 | for (arg=1; arg<argc; arg++) 183 | { 184 | if ((ARGV[0] == '-')) 185 | { 186 | switch (ARGV[1]) 187 | { 188 | case 'p': // pad 189 | { 190 | fseek(infile, 0, SEEK_END); 191 | size = ftell(infile); 192 | for (bit=31; bit>=0; bit--) if (size & (1<<bit)) break; 193 | if (size != (1<<bit)) 194 | { 195 | int todo = (1<<(bit+1)) - size; 196 | while (todo--) fputc(0xFF, infile); 197 | } 198 | fseek(infile, 0, SEEK_SET); 199 | break; 200 | } 201 | 202 | case 't': // title 203 | { 204 | char title[256]; 205 | memset(title, 0, sizeof(title)); 206 | if (VALUE[0]) 207 | { 208 | strncpy(title, VALUE, sizeof(header.title)); 209 | } 210 | else 211 | { 212 | // use filename 213 | char s[256], *begin=s, *t; strcpy(s, argfile); 214 | t = strrchr(s, '\\'); if (t) begin = t+1; 215 | t = strrchr(s, '/'); if (t) begin = t+1; 216 | t = strrchr(s, '.'); if (t) *t = 0; 217 | strncpy(title, begin, sizeof(header.title)); 218 | printf("%s\n",begin); 219 | } 220 | memcpy(header.title, title, sizeof(header.title)); // copy 221 | break; 222 | } 223 | 224 | case 'c': // game code 225 | { 226 | //if (!VALUE[0]) { printf("Need value for %s\n", ARGV); break; } 227 | //header.game_code = NUMBER; 228 | header.game_code = VALUE[0] | VALUE[1]<<8 | VALUE[2]<<16 | VALUE[3]<<24; 229 | break; 230 | } 231 | 232 | case 'm': // maker code 233 | { 234 | //if (!VALUE[0]) { printf("Need value for %s\n", ARGV); break; } 235 | //header.maker_code = (unsigned short)NUMBER; 236 | header.maker_code = VALUE[0] | VALUE[1]<<8; 237 | break; 238 | } 239 | 240 | case 'v': // ignored, compatability with other gbafix 241 | { 242 | break; 243 | } 244 | 245 | case 'r': // version 246 | { 247 | if (!VALUE[0]) { printf("Need value for %s\n", ARGV); break; } 248 | header.game_version = (unsigned char)NUMBER; 249 | break; 250 | } 251 | 252 | case 'd': // debug 253 | { 254 | if (!VALUE[0]) { printf("Need value for %s\n", ARGV); break; } 255 | header.logo[0x9C-0x04] = 0xA5; // debug enable 256 | header.device_type = (unsigned char)((NUMBER & 1) << 7); // debug handler entry point 257 | break; 258 | } 259 | 260 | default: 261 | { 262 | printf("Invalid option: %s\n", ARGV); 263 | } 264 | } 265 | } 266 | } 267 | 268 | // update complement check & total checksum 269 | header.complement = 0; 270 | header.checksum = 0; // must be 0 271 | header.complement = HeaderComplement(); 272 | //header.checksum = checksum_without_header + HeaderChecksum(); 273 | 274 | fseek(infile, 0, SEEK_SET); 275 | fwrite(&header, sizeof(header), 1, infile); 276 | fclose(infile); 277 | 278 | printf("ROM fixed!\n"); 279 | 280 | return 0; 281 | } 282 | -------------------------------------------------------------------------------- /src/gbalzss.cpp: -------------------------------------------------------------------------------- 1 | /*------------------------------------------------------------------------------ 2 | * Copyright (c) 2017 3 | * Michael Theall (mtheall) 4 | * 5 | * This file is part of gba-tools. 6 | * 7 | * gbalzss is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * gbalzss is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with gbalzss. If not, see <http://www.gnu.org/licenses/>. 19 | *----------------------------------------------------------------------------*/ 20 | /** @file gbalzss.cpp 21 | * @brief GBA LZSS Encoder/Decoder 22 | */ 23 | #include <algorithm> 24 | #include <cassert> 25 | #include <cctype> 26 | #include <cstdio> 27 | #include <cstdlib> 28 | #include <cstring> 29 | #include <stdexcept> 30 | #include <vector> 31 | #include <getopt.h> 32 | #include <libgen.h> 33 | #include <cstddef> 34 | 35 | namespace 36 | { 37 | 38 | /** @brief LZSS maximum encodable size */ 39 | #define LZSS_MAX_ENCODE_LEN 0x00FFFFFF 40 | 41 | /** @brief LZSS maximum (theoretical) decodable size 42 | * (LZSS_MAX_ENCODE_LEN+1)*9/8 + 4 - 1 43 | */ 44 | #define LZSS_MAX_DECODE_LEN 0x01B00003 45 | 46 | /** @brief LZ10 maximum match length */ 47 | #define LZ10_MAX_LEN 18 48 | 49 | /** @brief LZ10 maximum displacement */ 50 | #define LZ10_MAX_DISP 4096 51 | 52 | /** @brief LZ11 maximum match length */ 53 | #define LZ11_MAX_LEN 65808 54 | 55 | /** @brief LZ11 maximum displacement */ 56 | #define LZ11_MAX_DISP 4096 57 | 58 | /** @brief LZ compression mode */ 59 | enum LZSS_t 60 | { 61 | LZ10 = 0x10, ///< LZ10 compression 62 | LZ11 = 0x11, ///< LZ11 compression 63 | }; 64 | 65 | /** @brief Buffer object */ 66 | typedef std::vector<uint8_t> Buffer; 67 | 68 | /** @brief Find last instance of a byte in a buffer 69 | * @param[in] first Beginning of buffer 70 | * @param[in] last End of buffer 71 | * @param[in] val Byte to find 72 | * 73 | * @returns iterator to found byte 74 | * @retval last if no match found 75 | */ 76 | Buffer::const_iterator 77 | rfind(Buffer::const_iterator first, Buffer::const_iterator last, 78 | const uint8_t &val) 79 | { 80 | assert(last >= first); 81 | 82 | auto it = last; 83 | while(--it >= first) 84 | { 85 | if(*it == val) 86 | return it; 87 | } 88 | 89 | return last; 90 | } 91 | 92 | /** @brief Find best buffer match 93 | * @param[in] source Source buffer 94 | * @param[in] it Position in source buffer 95 | * @param[in] len Maximum length to match 96 | * @param[in] max_disp Maximum displacement 97 | * @param[in] vram VRAM-safe 98 | * @param[out] outlen Length of match 99 | * @returns Iterator to best match 100 | * @retval source.cend() for no match 101 | */ 102 | Buffer::const_iterator 103 | find_best_match(const Buffer &source, Buffer::const_iterator it, size_t len, 104 | size_t max_disp, bool vram, size_t &outlen) 105 | { 106 | auto begin = source.cbegin(); 107 | auto end = source.cend(); 108 | 109 | assert(it > source.cbegin()); 110 | assert(it < source.cend()); 111 | 112 | // clamp start to maximum displacement from buffer 113 | if(it - begin > static_cast<ptrdiff_t>(max_disp)) 114 | begin = it - max_disp; 115 | 116 | // clamp len to end of buffer 117 | if(end - it < static_cast<ptrdiff_t>(len)) 118 | len = end - it; 119 | 120 | auto best_start = it; 121 | size_t best_len = 0; 122 | 123 | // find nearest matching start byte 124 | auto last_p = it; 125 | auto p = rfind(begin, last_p, *it); 126 | while(p != last_p) 127 | { 128 | // find length of match 129 | size_t test_len = 1; 130 | for(size_t i = 1; i < len; ++i) 131 | { 132 | if(*(p+i) == *(it+i)) 133 | ++test_len; 134 | else 135 | break; 136 | } 137 | 138 | // vram requires displacement != 1 139 | if(vram && (it - p) == 1) 140 | test_len = 0; 141 | 142 | if(test_len >= best_len) 143 | { 144 | // this match is the best so far, so save it 145 | best_start = p; 146 | best_len = test_len; 147 | } 148 | 149 | // if we maximized the match, stop here 150 | if(best_len == len) 151 | break; 152 | 153 | // find next nearest matching byte and try again 154 | last_p = p; 155 | p = rfind(begin, last_p, *it); 156 | } 157 | 158 | if(best_len) 159 | { 160 | // we found a match, so return it 161 | outlen = best_len; 162 | return best_start; 163 | } 164 | 165 | // no match found 166 | outlen = 0; 167 | return source.cend(); 168 | } 169 | 170 | /** @brief Output a GBA-style compression header 171 | * @param[out] header Output header 172 | * @param[in] type Compression type 173 | * @param[in] size Uncompressed data size 174 | */ 175 | void 176 | header(Buffer &buffer, uint8_t type, size_t size) 177 | { 178 | buffer.push_back(type); 179 | buffer.push_back(size >> 0); 180 | buffer.push_back(size >> 8); 181 | buffer.push_back(size >> 16); 182 | } 183 | 184 | /** @brief LZ10/LZ11 compression 185 | * @param[in] source Source buffer 186 | * @param[in] mode LZ mode 187 | * @param[in] vram VRAM-safe 188 | * @returns Compressed buffer 189 | */ 190 | Buffer 191 | lzss_encode(const Buffer &source, LZSS_t mode, bool vram) 192 | { 193 | // get maximum match length 194 | const size_t max_len = mode == LZ10 ? LZ10_MAX_LEN : LZ11_MAX_LEN; 195 | 196 | // get maximum displacement 197 | const size_t max_disp = mode == LZ10 ? LZ10_MAX_DISP : LZ11_MAX_DISP; 198 | 199 | assert(mode == LZ10 || mode == LZ11); 200 | 201 | // create output buffer 202 | Buffer result; 203 | 204 | // append compression header 205 | header(result, mode, source.size()); 206 | 207 | // reserve an encode byte in output buffer 208 | size_t code_pos = result.size(); 209 | result.push_back(0); 210 | 211 | // initialize shift 212 | size_t shift = 8; 213 | 214 | // encode every byte 215 | auto it = source.cbegin(); 216 | auto end = source.cend(); 217 | while(it < end) 218 | { 219 | if(shift == 0) 220 | { 221 | // we need to encode more data, so add a new code byte 222 | shift = 8; 223 | code_pos = result.size(); 224 | result.push_back(0); 225 | } 226 | 227 | // advance code byte bit position 228 | if(shift != 0) 229 | --shift; 230 | 231 | const size_t len = end - it; 232 | auto tmp = source.cend(); 233 | size_t tmplen = 0; 234 | 235 | if(it == source.cbegin()) 236 | { 237 | // beginning of stream must be primed with at least one value 238 | tmplen = 1; 239 | } 240 | else 241 | { 242 | // find best match 243 | tmp = find_best_match(source, it, std::min(len, max_len), max_disp, vram, 244 | tmplen); 245 | if(tmp != source.cend()) 246 | { 247 | assert(!vram || tmp - it != 1); 248 | assert(tmp >= source.cbegin()); 249 | assert(tmp < it); 250 | assert(it - tmp <= static_cast<ptrdiff_t>(max_disp)); 251 | assert(tmplen <= max_len); 252 | assert(tmplen <= len); 253 | assert(std::equal(it, it+tmplen, tmp)); 254 | } 255 | } 256 | 257 | if(tmplen > 2 && tmplen < len) 258 | { 259 | // this match is long enough to be compressed; let's check if it's 260 | // cheaper to encode this byte as a copy and start compression at the 261 | // next byte 262 | size_t skip_len, next_len; 263 | 264 | // get best match starting at the next byte 265 | find_best_match(source, it+1, std::min(len-1, max_len), max_disp, vram, 266 | skip_len); 267 | 268 | // check if the match is too small to compress 269 | if(skip_len < 3) 270 | skip_len = 1; 271 | 272 | // get best match for data following the current compressed chunk 273 | find_best_match(source, it+tmplen, std::min(len-tmplen, max_len), 274 | max_disp, vram, next_len); 275 | 276 | // check if the match is too small to compress 277 | if(next_len < 3) 278 | next_len = 1; 279 | 280 | // if compressing this chunk and the next chunk is less valuable than 281 | // skipping this byte and starting compression at the next byte, mark 282 | // this byte as being needed to copy 283 | if(tmplen + next_len <= skip_len + 1) 284 | tmplen = 1; 285 | } 286 | 287 | if(tmplen < 3) 288 | { 289 | // this is a copy chunk; append this byte to the output buffer 290 | result.push_back(*it); 291 | 292 | // only one byte is copied 293 | tmplen = 1; 294 | } 295 | else if(mode == LZ10) 296 | { 297 | // mark this chunk as compressed 298 | assert(code_pos < result.size()); 299 | result[code_pos] |= (1 << shift); 300 | 301 | // encode the displacement and length 302 | size_t disp = it - tmp - 1; 303 | assert(tmplen-3 <= 0xF); 304 | assert(disp <= 0xFFF); 305 | result.push_back(((tmplen-3) << 4) | (disp >> 8)); 306 | result.push_back(disp); 307 | } 308 | else if(tmplen <= 0x10) 309 | { 310 | // mark this chunk as compressed 311 | assert(code_pos < result.size()); 312 | result[code_pos] |= (1 << shift); 313 | 314 | // encode the displacement and length 315 | size_t disp = it - tmp - 1; 316 | assert(tmplen > 2); 317 | assert(tmplen-1 <= 0xF); 318 | assert(disp <= 0xFFF); 319 | result.push_back(((tmplen-1) << 4) | (disp >> 8)); 320 | result.push_back(disp); 321 | } 322 | else if(tmplen <= 0x110) 323 | { 324 | // mark this chunk as compressed 325 | assert(code_pos < result.size()); 326 | result[code_pos] |= (1 << shift); 327 | 328 | // encode the displacement and length 329 | size_t disp = it - tmp - 1; 330 | assert(tmplen >= 0x11); 331 | assert(tmplen-0x11 <= 0xFF); 332 | assert(disp <= 0xFFF); 333 | result.push_back((tmplen-0x11) >> 4); 334 | result.push_back(((tmplen-0x11) << 4) | (disp >> 8)); 335 | result.push_back(disp); 336 | } 337 | else 338 | { 339 | // mark this chunk as compressed 340 | assert(code_pos < result.size()); 341 | result[code_pos] |= (1 << shift); 342 | 343 | // encode the displacement and length 344 | size_t disp = it - tmp - 1; 345 | assert(tmplen >= 0x111); 346 | assert(tmplen-0x111 <= 0xFFFF); 347 | assert(disp <= 0xFFF); 348 | result.push_back((1 << 4) | (tmplen-0x111) >> 12); 349 | result.push_back(((tmplen-0x111) >> 4)); 350 | result.push_back(((tmplen-0x111) << 4) | (disp >> 8)); 351 | result.push_back(disp); 352 | } 353 | 354 | // advance input buffer 355 | it += tmplen; 356 | } 357 | 358 | // pad the output buffer to 4 bytes 359 | if(result.size() & 0x3) 360 | result.resize((result.size()+3) & ~0x3); 361 | 362 | // return the output data 363 | return result; 364 | } 365 | 366 | /** @brief LZ10 compression 367 | * @param[in] source Source buffer 368 | * @param[in] vram VRAM-safe 369 | * @returns Compressed buffer 370 | */ 371 | Buffer 372 | lz10_encode(const Buffer &source, bool vram) 373 | { 374 | return lzss_encode(source, LZ10, vram); 375 | } 376 | 377 | /** @brief LZ11 compression 378 | * @param[in] source Source buffer 379 | * @param[in] vram VRAM-safe 380 | * @returns Compressed buffer 381 | */ 382 | Buffer 383 | lz11_encode(const Buffer &source, bool vram) 384 | { 385 | return lzss_encode(source, LZ11, vram); 386 | } 387 | 388 | /** @brief LZ10 Decompression 389 | * @param[in] source Source buffer 390 | * @param[in] vram VRAM-safe 391 | * @returns Decompressed buffer 392 | */ 393 | Buffer 394 | lz10_decode(const Buffer &source, bool vram) 395 | { 396 | if(source.size() < 4 || source[0] != LZ10) 397 | throw std::runtime_error("Error: Invalid LZ10 header"); 398 | 399 | size_t size = source[1] | (source[2] << 8) | (source[3] << 16); 400 | 401 | bool printed_error = false; 402 | bool printed_vram_error = false; 403 | 404 | auto src = source.cbegin() + 4; 405 | uint8_t flags = 0; 406 | uint8_t mask = 0; 407 | 408 | Buffer result; 409 | 410 | while(size > 0) 411 | { 412 | if(mask == 0) 413 | { 414 | // read in the flags data 415 | // from bit 7 to bit 0: 416 | // 0: raw byte 417 | // 1: compressed block 418 | flags = *src++; 419 | mask = 0x80; 420 | } 421 | 422 | if(flags & mask) // compressed block 423 | { 424 | size_t len = (((*src) & 0xF0) >> 4) + 3; 425 | size_t disp = ((*src++) & 0x0F) << 8; 426 | disp |= *src++; 427 | ++disp; 428 | 429 | if(len > size) 430 | { 431 | if(!printed_error) 432 | { 433 | std::fprintf(stderr, "Warning: Badly encoded LZ10 stream; compressed " 434 | "block exceeds output length specified by header. " 435 | "Truncating output.\n"); 436 | printed_error = true; 437 | } 438 | 439 | // truncate output 440 | len = size; 441 | } 442 | 443 | if(result.size() < disp) 444 | throw std::runtime_error("Error: Badly encoded LZ10 stream; encoded " 445 | "displacement causes read prior to start of " 446 | "output buffer."); 447 | 448 | if(vram && !printed_vram_error) 449 | { 450 | if(disp == 1) 451 | { 452 | std::fprintf(stderr, "Warning: LZ10 stream is not vram safe.\n"); 453 | printed_vram_error = true; 454 | } 455 | } 456 | 457 | size -= len; 458 | 459 | // for len, copy data from the displacement 460 | // to the current buffer position 461 | while(len-- > 0) 462 | result.push_back(*(std::end(result)-disp)); 463 | } 464 | else // uncompressed block 465 | { 466 | // copy a raw byte from the input to the output 467 | result.push_back(*src++); 468 | --size; 469 | } 470 | 471 | mask >>= 1; 472 | } 473 | 474 | return result; 475 | } 476 | 477 | /** @brief LZ11 Decompression 478 | * @param[in] source Source buffer 479 | * @param[in] vram VRAM-safe 480 | * @returns Decompressed buffer 481 | */ 482 | Buffer 483 | lz11_decode(const Buffer &source, bool vram) 484 | { 485 | if(source.size() < 4 || source[0] != LZ11) 486 | throw std::runtime_error("Error: Invalid LZ11 header"); 487 | 488 | size_t size = source[1] | (source[2] << 8) | (source[3] << 16); 489 | 490 | bool printed_error = false; 491 | bool printed_vram_error = false; 492 | 493 | auto src = source.cbegin() + 4; 494 | uint8_t flags = 0; 495 | uint8_t mask = 0; 496 | 497 | Buffer result; 498 | 499 | while(size > 0) 500 | { 501 | if(mask == 0) 502 | { 503 | // read in the flags data 504 | // from bit 7 to bit 0: 505 | // 0: raw byte 506 | // 1: compressed block 507 | flags = *src++; 508 | mask = 0x80; 509 | } 510 | 511 | if(flags & mask) // compressed block 512 | { 513 | size_t len; 514 | switch((*src) >> 4) 515 | { 516 | case 0: // extended block 517 | len = (*src++) << 4; 518 | len |= ((*src) >> 4); 519 | len += 0x11; 520 | break; 521 | 522 | case 1: // extra extended block 523 | len = ((*src++) & 0x0F) << 12; 524 | len |= (*src++) << 4; 525 | len |= ((*src) >> 4); 526 | len += 0x111; 527 | break; 528 | 529 | default: // normal block 530 | len = ((*src) >> 4) + 1; 531 | break; 532 | } 533 | 534 | size_t disp = ((*src++) & 0x0F) << 8; 535 | disp |= *src++; 536 | ++disp; 537 | 538 | if(len > size) 539 | { 540 | if(!printed_error) 541 | { 542 | std::fprintf(stderr, "Warning: Badly encoded LZ11 stream; compressed " 543 | "block exceeds output length specified by header. " 544 | "Truncating output.\n"); 545 | printed_error = true; 546 | } 547 | 548 | // truncate output 549 | len = size; 550 | } 551 | 552 | if(result.size() < disp) 553 | throw std::runtime_error("Error: Badly encoded LZ11 stream; encoded " 554 | "displacement causes read prior to start of " 555 | "output buffer."); 556 | 557 | if(vram && !printed_vram_error) 558 | { 559 | if(disp == 1) 560 | { 561 | std::fprintf(stderr, "Warning: LZ10 stream is not vram safe.\n"); 562 | printed_vram_error = true; 563 | } 564 | } 565 | 566 | size -= len; 567 | 568 | // for len, copy data from the displacement 569 | // to the current buffer position 570 | while(len-- > 0) 571 | result.push_back(*(std::end(result)-disp)); 572 | } 573 | else // uncompressed block 574 | { 575 | // copy a raw byte from the input to the output 576 | result.push_back(*src++); 577 | --size; 578 | } 579 | 580 | mask >>= 1; 581 | } 582 | 583 | return result; 584 | } 585 | 586 | /** @brief Read input file 587 | * @param[in] fp Input file stream 588 | * @param[in] limit Maximum file size to read 589 | * @returns Buffer containing file contents 590 | */ 591 | Buffer read_file(FILE *fp, size_t limit) 592 | { 593 | Buffer buffer; 594 | Buffer tmp(4096); 595 | 596 | ssize_t rc; 597 | do 598 | { 599 | // read data into tmp buffer 600 | rc = std::fread(tmp.data(), 1, tmp.size(), fp); 601 | if(rc > 0) 602 | { 603 | // append to result buffer 604 | buffer.insert(std::end(buffer), std::begin(tmp), std::begin(tmp)+rc); 605 | 606 | if(buffer.size() > limit) 607 | throw std::runtime_error("Error: Input file too large.\n"); 608 | } 609 | } while(rc > 0); 610 | 611 | if(rc < 0) 612 | throw std::runtime_error("Error: Failed to read file"); 613 | 614 | return buffer; 615 | } 616 | 617 | /** @brief Write output file 618 | * @param[in] fp Output file stream 619 | * @param[in] limit Maximum file size to write 620 | * @returns Whether successfully written 621 | */ 622 | bool write_file(FILE *fp, const Buffer &buffer) 623 | { 624 | auto it = std::begin(buffer); 625 | while(it < std::end(buffer)) 626 | { 627 | // write to file 628 | ssize_t rc = std::fwrite(&*it, 1, std::end(buffer) - it, fp); 629 | if(rc <= 0) 630 | return false; 631 | 632 | it += rc; 633 | } 634 | 635 | return true; 636 | } 637 | 638 | /** @brief Print program usage 639 | * @param[in] fp File stream to write usage 640 | * @param[in] program Program name 641 | */ 642 | void usage(FILE *fp, const char *program) 643 | { 644 | std::fprintf(fp, 645 | "Usage: %s [-h|--help] [--lz11] [--vram] <d|e> <infile> <outfile>\n" 646 | "\tOptions:\n" 647 | "\t\t-h, --help\tShow this help\n" 648 | "\t\t--lz11 \tCompress using LZ11 instead of LZ10\n" 649 | "\t\t--vram \tGenerate VRAM-safe output (required by GBA BIOS)\n" 650 | "\n" 651 | "\tArguments\n" 652 | "\t\te \tCompress <infile> into <outfile>\n" 653 | "\t\td \tDecompress <infile> into <outfile>\n" 654 | "\t\t<infile> \tInput file (use - for stdin)\n" 655 | "\t\t<outfile> \tOutput file (use - for stdout)\n", 656 | program); 657 | } 658 | 659 | /** @brief Program long options */ 660 | const struct option long_options[] = 661 | { 662 | { "help", no_argument, nullptr, 'h', }, 663 | { "lz11", no_argument, nullptr, '1', }, 664 | { "vram", no_argument, nullptr, 'v', }, 665 | { nullptr, no_argument, nullptr, 0, }, 666 | }; 667 | 668 | } 669 | 670 | int main(int argc, char *argv[]) 671 | { 672 | // get program name 673 | const char *program = ::basename(argv[0]); 674 | 675 | bool lz11 = false; 676 | bool vram = false; 677 | 678 | // parse options 679 | int c; 680 | while((c = ::getopt_long(argc, argv, "h", long_options, nullptr)) != -1) 681 | { 682 | switch(c) 683 | { 684 | case 'h': 685 | usage(stdout, program); 686 | return EXIT_SUCCESS; 687 | 688 | case '1': 689 | lz11 = true; 690 | break; 691 | 692 | case 'v': 693 | vram = true; 694 | break; 695 | 696 | default: 697 | std::fprintf(stderr, "Error: Invalid option '%c'\n", optopt); 698 | usage(stderr, program); 699 | return EXIT_FAILURE; 700 | } 701 | } 702 | 703 | // check for valid encode/decode non-option 704 | if(argc - optind != 3 705 | || std::strlen(argv[optind]) > 1 706 | || (std::tolower(*argv[optind]) != 'e' && std::tolower(*argv[optind]) != 'd')) 707 | { 708 | usage(stderr, program); 709 | return EXIT_FAILURE; 710 | } 711 | 712 | // get program non-options 713 | bool encode = std::tolower(*argv[optind++]) == 'e'; 714 | const char *infile = argv[optind++]; 715 | const char *outfile = argv[optind++]; 716 | 717 | // open input file 718 | FILE *fp; 719 | if(std::strlen(infile) == 1 && *infile == '-') 720 | fp = stdin; 721 | else 722 | fp = std::fopen(infile, "rb"); 723 | if(!fp) 724 | { 725 | std::fprintf(stderr, "Error: Failed to open '%s' for reading\n", infile); 726 | return EXIT_FAILURE; 727 | } 728 | 729 | Buffer buffer; 730 | 731 | // read input file 732 | try 733 | { 734 | buffer = read_file(fp, encode ? LZSS_MAX_ENCODE_LEN : LZSS_MAX_DECODE_LEN); 735 | } 736 | catch(const std::runtime_error &e) 737 | { 738 | std::fprintf(stderr, "%s: %s\n", infile, e.what()); 739 | std::fclose(fp); 740 | return EXIT_FAILURE; 741 | } 742 | catch(...) 743 | { 744 | std::fprintf(stderr, "%s: Error: unhandled exception\n", infile); 745 | std::fclose(fp); 746 | return EXIT_FAILURE; 747 | } 748 | 749 | // close input file 750 | std::fclose(fp); 751 | 752 | // process input file 753 | try 754 | { 755 | if(encode) 756 | buffer = (lz11 ? lz11_encode : lz10_encode)(buffer, vram); 757 | else 758 | buffer = (lz11 ? lz11_decode : lz10_decode)(buffer, vram); 759 | } 760 | catch(const std::runtime_error &e) 761 | { 762 | std::fprintf(stderr, "%s: %s\n", infile, e.what()); 763 | return EXIT_FAILURE; 764 | } 765 | catch(...) 766 | { 767 | std::fprintf(stderr, "%s: Error: unhandled exception\n", infile); 768 | return EXIT_FAILURE; 769 | } 770 | 771 | // open output file 772 | if(std::strlen(outfile) == 1 && *outfile == '-') 773 | fp = stdout; 774 | else 775 | fp = std::fopen(outfile, "wb"); 776 | if(!fp) 777 | { 778 | std::fprintf(stderr, "Error: Failed to open '%s' for writing\n", outfile); 779 | return EXIT_FAILURE; 780 | } 781 | 782 | // write output file 783 | if(!write_file(fp, buffer)) 784 | { 785 | std::fprintf(stderr, "Error: Failed to write '%s'\n", outfile); 786 | std::fclose(fp); 787 | return EXIT_FAILURE; 788 | } 789 | 790 | // close output file 791 | std::fclose(fp); 792 | 793 | return EXIT_SUCCESS; 794 | } 795 | -------------------------------------------------------------------------------- /src/gbfs.c: -------------------------------------------------------------------------------- 1 | /* 2 | 3 | $Id: gbfs.c,v 1.1 2007-01-20 15:30:41 wntrmute Exp $ 4 | 5 | create a GBFS file 6 | 7 | Copyright (C) 2002 Damian Yerrick 8 | 9 | This program is free software; you can redistribute it and/or 10 | modify it under the terms of the GNU General Public License 11 | as published by the Free Software Foundation; either version 2 12 | of the License, or (at your option) any later version. 13 | 14 | This program is distributed in the hope that it will be useful, 15 | but WITHOUT ANY WARRANTY; without even the implied warranty of 16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 | GNU General Public License for more details. 18 | 19 | You should have received a copy of the GNU General Public License 20 | along with this program; if not, write to 21 | Free Software Foundation, Inc., 59 Temple Place - Suite 330, 22 | Boston, MA 02111-1307, USA. 23 | GNU licenses can be viewed online at http://www.gnu.org/copyleft/ 24 | 25 | In addition, as a special exception, Damian Yerrick gives 26 | permission to link the code of this program with import libraries 27 | distributed as part of the plug-in development tools published by 28 | the vendor of any image manipulation program, and distribute 29 | linked combinations including the two. You must obey the GNU 30 | General Public License in all respects for all of the code used 31 | other than the plug-in interface. If you modify this file, you 32 | may extend this exception to your version of the file, but you 33 | are not obligated to do so. If you do not wish to do so, delete 34 | this exception statement from your version. 35 | 36 | Visit http://www.pineight.com/ for more information. 37 | 38 | $Log: not supported by cvs2svn $ 39 | Revision 1.3 2005/09/13 03:08:45 wntrmute 40 | added header logging 41 | close input files when done 42 | reformatted for consistency 43 | 44 | 45 | */ 46 | 47 | #include <stdio.h> 48 | #include <stdlib.h> 49 | #include <string.h> 50 | #include <errno.h> 51 | #include <libgen.h> 52 | 53 | typedef unsigned short u16; 54 | typedef unsigned long u32; /* this needs to be changed on 64-bit systems */ 55 | 56 | #include "gbfs.h" 57 | 58 | static const char GBFS_magic[] = "PinEightGBFS\r\n\032\n"; 59 | 60 | static const char help_text[] = 61 | "Creates a GBFS archive.\n" 62 | "usage: gbfs ARCHIVE [FILE...]\n"; 63 | 64 | GBFS_FILE header; 65 | GBFS_ENTRY *entries; 66 | 67 | //--------------------------------------------------------------------------------- 68 | unsigned long fcopy(FILE *dst, FILE *src) { 69 | //--------------------------------------------------------------------------------- 70 | char buf[16384]; 71 | unsigned long sz = 0, this_sz; 72 | 73 | do { 74 | this_sz = fread(buf, 1, sizeof(buf), src); 75 | 76 | if(this_sz) { 77 | fwrite(buf, 1, this_sz, dst); /* FIXME: need error checking */ 78 | sz += this_sz; 79 | } 80 | } while(this_sz != 0); 81 | 82 | return sz; 83 | } 84 | 85 | 86 | /*--------------------------------------------------------------------------------- 87 | fputi16() 88 | write a 16-bit integer in intel format to a file 89 | ---------------------------------------------------------------------------------*/ 90 | void fputi16(unsigned int in, FILE *f) { 91 | //--------------------------------------------------------------------------------- 92 | fputc(in, f); 93 | fputc(in >> 8, f); 94 | } 95 | 96 | 97 | /*--------------------------------------------------------------------------------- 98 | fputi32() 99 | write a 32-bit integer in intel format to a file 100 | ---------------------------------------------------------------------------------*/ 101 | void fputi32(unsigned long in, FILE *f) { 102 | //--------------------------------------------------------------------------------- 103 | fputc(in, f); 104 | fputc(in >> 8, f); 105 | fputc(in >> 16, f); 106 | fputc(in >> 24, f); 107 | } 108 | 109 | 110 | /*--------------------------------------------------------------------------------- 111 | namecmp() 112 | compares the first 24 bytes of a pair of strings. 113 | useful for sorting names. 114 | ---------------------------------------------------------------------------------*/ 115 | int namecmp(const void *a, const void *b) { 116 | //--------------------------------------------------------------------------------- 117 | return memcmp(a, b, 24); 118 | } 119 | 120 | 121 | //--------------------------------------------------------------------------------- 122 | int main(int argc, char **argv) { 123 | //--------------------------------------------------------------------------------- 124 | FILE *outfile; 125 | unsigned int arg = 2; 126 | unsigned int n_entries = 0; 127 | 128 | if(argc < 3) { 129 | fputs(help_text, stderr); 130 | return 1; 131 | } 132 | 133 | entries = malloc(argc * sizeof(GBFS_ENTRY)); 134 | 135 | if(!entries) { 136 | perror("could not allocate memory for directory"); 137 | return 1; 138 | } 139 | 140 | memcpy(header.magic, GBFS_magic, sizeof(header.magic)); 141 | header.dir_off = 32; 142 | n_entries = 0; 143 | 144 | /* note that this creates some wasted space if n_entries turns out 145 | to be less than argc - 2 */ 146 | header.total_len = header.dir_off + (argc - 2) * sizeof(GBFS_ENTRY); 147 | 148 | outfile = fopen("gbfs.$$$", "wb+"); 149 | 150 | if(!outfile) { 151 | perror("could not open temporary file gbfs.$$$ for writing"); 152 | return 1; 153 | } 154 | 155 | fseek(outfile, header.total_len, SEEK_SET); 156 | 157 | while(arg < argc) { 158 | 159 | FILE *infile; 160 | unsigned long flen; 161 | 162 | infile = fopen(argv[arg], "rb"); 163 | 164 | if(!infile) { 165 | fprintf(stderr, "could not open %s: %s", argv[arg], strerror(errno)); 166 | fclose(outfile); 167 | remove("gbfs.$$$"); 168 | free(entries); 169 | return -1; 170 | } 171 | 172 | /* get current file offset */ 173 | entries[n_entries].data_offset = ftell(outfile); 174 | 175 | /* copy the file into the data area */ 176 | flen = fcopy(outfile, infile); 177 | entries[n_entries].len = flen; 178 | 179 | /* copy name */ 180 | strncpy( entries[n_entries].name, 181 | basename(argv[arg]), 182 | sizeof(entries[n_entries].name)); 183 | 184 | /* diagnostic */ 185 | { 186 | char nameout[32] = {0}; 187 | 188 | strncpy(nameout, entries[n_entries].name, sizeof(entries[n_entries].name)); 189 | printf("%10lu %s\n", flen, nameout); 190 | } 191 | 192 | /* pad file with 0's to para boundary */ 193 | 194 | while(ftell(outfile) & 0x000f) { 195 | fputc(0, outfile); 196 | } 197 | 198 | // close the current input file 199 | fclose(infile); 200 | 201 | /* next file please */ 202 | n_entries++; 203 | arg++; 204 | } 205 | 206 | header.total_len = ftell(outfile); 207 | rewind(outfile); 208 | 209 | /* sort directory by name */ 210 | qsort(entries, n_entries, sizeof(entries[0]), namecmp); 211 | 212 | /* write header */ 213 | fwrite(GBFS_magic, 16, 1, outfile); 214 | fputi32(header.total_len, outfile); 215 | fputi16(header.dir_off, outfile); 216 | fputi16(n_entries, outfile); 217 | 218 | 219 | /* write directory */ 220 | fseek(outfile, header.dir_off, SEEK_SET); 221 | 222 | { 223 | unsigned int i; 224 | 225 | for(i = 0; i < n_entries; i++) { 226 | fwrite(entries[i].name, sizeof(entries[i].name), 1, outfile); 227 | fputi32(entries[i].len, outfile); 228 | fputi32(entries[i].data_offset, outfile); 229 | } 230 | } 231 | 232 | free(entries); 233 | fclose(outfile); 234 | 235 | remove(argv[1]); /* some systems don't auto-remove the rename target */ 236 | 237 | if(rename("gbfs.$$$", argv[1])) { 238 | fputs("could not rename gbfs.$$$ to ", stderr); 239 | perror(argv[1]); 240 | fputs("leaving finished archive in gbfs.$$$\n", stderr); 241 | } 242 | 243 | return 0; 244 | } 245 | 246 | /* The behavior of this program with respect to ordering of files 247 | 248 | This information is subject to change. 249 | 250 | Currently, the app writes the objects' data in order of appearance 251 | on the command line, but it writes the directory in ABC order as 252 | required by the format spec. 253 | 254 | */ 255 | -------------------------------------------------------------------------------- /src/gbfs.h: -------------------------------------------------------------------------------- 1 | /* gbfs.h 2 | access object in a GBFS file 3 | 4 | Copyright 2002 Damian Yerrick 5 | 6 | Permission is hereby granted, free of charge, to any person obtaining 7 | a copy of this software and associated documentation files (the 8 | "Software"), to deal in the Software without restriction, including 9 | without limitation the rights to use, copy, modify, merge, publish, 10 | distribute, sublicense, and/or sell copies of the Software, and to 11 | permit persons to whom the Software is furnished to do so, subject to 12 | the following conditions: 13 | 14 | The above copyright notice and this permission notice shall be 15 | included in all copies or substantial portions of the Software. 16 | 17 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 18 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES 19 | OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 20 | NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 21 | BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN 22 | AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF 23 | OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS 24 | IN THE SOFTWARE. 25 | 26 | */ 27 | 28 | 29 | /* Dependency on prior include files 30 | 31 | Before you #include "gbfs.h", you should define the following types: 32 | typedef (unsigned 16-bit integer) u16; 33 | typedef (unsigned 32-bit integer) u32; 34 | Your gba.h should do this for you. 35 | */ 36 | 37 | #ifndef INCLUDE_GBFS_H 38 | #define INCLUDE_GBFS_H 39 | #ifdef __cplusplus 40 | extern "C" { 41 | #endif 42 | 43 | /* to make a 300 KB space called samples do GBFS_SPACE(samples, 300) */ 44 | 45 | #define GBFS_SPACE(filename, kbytes) \ 46 | const char filename[(kbytes)*1024] __attribute__ ((aligned (16))) = \ 47 | "PinEightGBFSSpace-" #filename "-" #kbytes ; 48 | 49 | typedef struct GBFS_FILE 50 | { 51 | char magic[16]; /* "PinEightGBFS\r\n\032\n" */ 52 | u32 total_len; /* total length of archive */ 53 | u16 dir_off; /* offset in bytes to directory */ 54 | u16 dir_nmemb; /* number of files */ 55 | char reserved[8]; /* for future use */ 56 | } GBFS_FILE; 57 | 58 | typedef struct GBFS_ENTRY 59 | { 60 | char name[24]; /* filename, nul-padded */ 61 | u32 len; /* length of object in bytes */ 62 | u32 data_offset; /* in bytes from beginning of file */ 63 | } GBFS_ENTRY; 64 | 65 | 66 | const GBFS_FILE *find_first_gbfs_file(const void *start); 67 | const void *skip_gbfs_file(const GBFS_FILE *file); 68 | const void *gbfs_get_obj(const GBFS_FILE *file, 69 | const char *name, 70 | u32 *len); 71 | const void *gbfs_get_nth_obj(const GBFS_FILE *file, 72 | size_t n, 73 | char *name, 74 | u32 *len); 75 | void *gbfs_copy_obj(void *dst, 76 | const GBFS_FILE *file, 77 | const char *name); 78 | size_t gbfs_count_objs(const GBFS_FILE *file); 79 | 80 | 81 | #ifdef __cplusplus 82 | } 83 | #endif 84 | #endif 85 | -------------------------------------------------------------------------------- /src/insgbfs.c: -------------------------------------------------------------------------------- 1 | /* insgbfs.c 2 | insert a GBFS file into a ROM 3 | 4 | Copyright (C) 2002 Damian Yerrick 5 | 6 | This program is free software; you can redistribute it and/or 7 | modify it under the terms of the GNU General Public License 8 | as published by the Free Software Foundation; either version 2 9 | of the License, or (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with this program; if not, write to 18 | Free Software Foundation, Inc., 59 Temple Place - Suite 330, 19 | Boston, MA 02111-1307, USA. 20 | GNU licenses can be viewed online at http://www.gnu.org/copyleft/ 21 | 22 | In addition, as a special exception, Damian Yerrick gives 23 | permission to link the code of this program with import libraries 24 | distributed as part of the plug-in development tools published by 25 | the vendor of any image manipulation program, and distribute 26 | linked combinations including the two. You must obey the GNU 27 | General Public License in all respects for all of the code used 28 | other than the plug-in interface. If you modify this file, you 29 | may extend this exception to your version of the file, but you 30 | are not obligated to do so. If you do not wish to do so, delete 31 | this exception statement from your version. 32 | 33 | Visit http://www.pineight.com/ for more information. 34 | 35 | */ 36 | 37 | #include <stdio.h> 38 | #include <stdlib.h> 39 | #include <string.h> 40 | 41 | 42 | #define SIG_LEN 18 43 | 44 | const char sig[SIG_LEN] = "PinEightGBFSSpace-"; 45 | 46 | static const char help_text[] = 47 | "Inserts a GBFS file (or any other file) into a GBFS_SPACE (identified by\n" 48 | "symbol name) in a ROM.\n\n" 49 | "usage: insgbfs SOURCEFILE ROMFILE SYMNAME\n" 50 | "example: insgbfs samples.gbfs marco.gba samples\n"; 51 | 52 | 53 | unsigned long fcopy(FILE *dst, FILE *src) 54 | { 55 | char buf[16384]; 56 | unsigned long sz = 0, this_sz; 57 | 58 | do { 59 | this_sz = fread(buf, 1, sizeof(buf), src); 60 | if(this_sz) 61 | { 62 | fwrite(buf, 1, this_sz, dst); /* FIXME: need error checking */ 63 | sz += this_sz; 64 | } 65 | } while(this_sz != 0); 66 | 67 | return sz; 68 | } 69 | 70 | 71 | 72 | /* find_signature() ******************** 73 | Finds the next GBFS_SPACE signature and places the file pointer 74 | at its end. Returns 0 for success or nonzero for failure. 75 | */ 76 | int find_signature(FILE *fp) 77 | { 78 | size_t src_offset = 0; 79 | 80 | while(src_offset < SIG_LEN) 81 | { 82 | int c = fgetc(fp); 83 | 84 | if(c == EOF) 85 | return EOF; 86 | else if(c == sig[src_offset]) 87 | { 88 | src_offset++; 89 | } 90 | } 91 | 92 | return 0; 93 | } 94 | 95 | 96 | /* find_signature_named() ************** 97 | Finds a signature of the format 98 | PinEightGBFSSpace-sym-123 99 | where sym matches name. 100 | Positions the file pointer at the beginning of the sig. 101 | Returns the number after the sig, or <0 for not found. 102 | */ 103 | int find_signature_named(const char *name, FILE *fp) 104 | { 105 | int is_eof, found = 0; 106 | int got_k = -1; 107 | 108 | for(is_eof = find_signature(fp); 109 | !found && !is_eof; 110 | found || (is_eof = find_signature(fp))) 111 | { 112 | const char *name_chr = name; 113 | size_t sig_offset = ftell(fp) - SIG_LEN; 114 | 115 | /* search for the name */ 116 | while(*name_chr && *name_chr == fgetc(fp)) 117 | name_chr++; 118 | 119 | if(*name_chr) /* if it didn't make it all the way through */ 120 | { 121 | fprintf(stderr, "didn't match at %lu\n", (unsigned long)sig_offset); 122 | continue; 123 | } 124 | 125 | /* if the name doesn't end there */ 126 | if(fgetc(fp) != '-') 127 | { 128 | fprintf(stderr, "too long at %lu\n", (unsigned long)sig_offset); 129 | continue; 130 | } 131 | 132 | found = 1; 133 | { 134 | char buf[16]; 135 | 136 | fread(buf, 1, sizeof(buf), fp); 137 | fseek(fp, sig_offset, SEEK_SET); 138 | got_k = strtoul(buf, NULL, 10); 139 | fprintf(stderr, "match at %lu, size %d\n", 140 | (unsigned long)sig_offset, 141 | got_k); 142 | } 143 | } 144 | 145 | return got_k; 146 | } 147 | 148 | 149 | 150 | int main(int argc, const char **argv) 151 | { 152 | int found; 153 | FILE *infile, *romfile; 154 | size_t infile_size; 155 | 156 | if(argc < 4) 157 | { 158 | fputs(help_text, stderr); 159 | return EXIT_FAILURE; 160 | } 161 | 162 | romfile = fopen(argv[2], "rb+"); 163 | if(!romfile) 164 | { 165 | fputs("insgbfs could not open ", stderr); 166 | perror(argv[2]); 167 | return EXIT_FAILURE; 168 | } 169 | 170 | found = find_signature_named(argv[3], romfile); 171 | if(found < 0) 172 | { 173 | fprintf(stderr, "insgbfs could not find symbol '%s' in file '%s'\n", 174 | argv[3], argv[2]); 175 | fclose(romfile); 176 | return EXIT_FAILURE; 177 | } 178 | 179 | infile = fopen(argv[1], "rb"); 180 | if(!infile) 181 | { 182 | fputs("insgbfs could not open ", stderr); 183 | perror(argv[1]); 184 | fclose(romfile); 185 | return EXIT_FAILURE; 186 | } 187 | 188 | fseek(infile, 0, SEEK_END); 189 | infile_size = ftell(infile); 190 | rewind(infile); 191 | if(infile_size > found * 1024) 192 | { 193 | fprintf(stderr, "insgbfs could not insert '%s' of %lu KB into a %d KB space in file '%s'\n", 194 | argv[1], 195 | (unsigned long)((infile_size - 1) / 1024 + 1), 196 | found, 197 | argv[2]); 198 | fclose(infile); 199 | fclose(romfile); 200 | return EXIT_FAILURE; 201 | } 202 | 203 | fcopy(romfile, infile); 204 | fclose(romfile); 205 | return EXIT_SUCCESS; 206 | } 207 | 208 | -------------------------------------------------------------------------------- /src/lsgbfs.c: -------------------------------------------------------------------------------- 1 | /* lsgbfs.c 2 | list objects in a GBFS file 3 | 4 | Copyright (C) 2002 Damian Yerrick 5 | 6 | This program is free software; you can redistribute it and/or 7 | modify it under the terms of the GNU General Public License 8 | as published by the Free Software Foundation; either version 2 9 | of the License, or (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with this program; if not, write to 18 | Free Software Foundation, Inc., 59 Temple Place - Suite 330, 19 | Boston, MA 02111-1307, USA. 20 | GNU licenses can be viewed online at http://www.gnu.org/copyleft/ 21 | 22 | In addition, as a special exception, Damian Yerrick gives 23 | permission to link the code of this program with import libraries 24 | distributed as part of the plug-in development tools published by 25 | the vendor of any image manipulation program, and distribute 26 | linked combinations including the two. You must obey the GNU 27 | General Public License in all respects for all of the code used 28 | other than the plug-in interface. If you modify this file, you 29 | may extend this exception to your version of the file, but you 30 | are not obligated to do so. If you do not wish to do so, delete 31 | this exception statement from your version. 32 | 33 | Visit http://www.pineight.com/ for more information. 34 | 35 | */ 36 | 37 | #include <stdio.h> 38 | #include <stdlib.h> 39 | #include <string.h> 40 | 41 | #define strequ(a,b) (!strcmp(a,b)) 42 | 43 | typedef unsigned short u16; 44 | typedef unsigned long u32; 45 | 46 | #include "gbfs.h" 47 | 48 | 49 | /* fgeti16() *************************** 50 | read a 16-bit integer in intel format from a file 51 | */ 52 | u32 fgeti16(FILE *fp) 53 | { 54 | return ((fgetc(fp) & 0x000000ff) ) | 55 | ((fgetc(fp) & 0x000000ff) << 8); 56 | } 57 | 58 | 59 | /* fgeti32() *************************** 60 | read a 32-bit integer in intel format from a file 61 | */ 62 | u32 fgeti32(FILE *fp) 63 | { 64 | return ((fgetc(fp) & 0x000000ff) ) | 65 | ((fgetc(fp) & 0x000000ff) << 8) | 66 | ((fgetc(fp) & 0x000000ff) << 16) | 67 | ((fgetc(fp) & 0x000000ff) << 24); 68 | } 69 | 70 | 71 | int main(int argc, char **argv) 72 | { 73 | FILE *fp; 74 | char filename[32] = {0}; 75 | u32 dir_off, dir_nmemb; 76 | unsigned int i; 77 | 78 | if(argc != 2 || strequ("-h", argv[1]) || strequ("--help", argv[1])) 79 | { 80 | fputs("lists the objects in a gbfs file\n" 81 | "syntax: lsgbfs FILE\n", stderr); 82 | return 1; 83 | } 84 | 85 | fp = fopen(argv[1], "rb"); 86 | if(!fp) 87 | { 88 | fputs("could not open ", stderr); 89 | perror(argv[1]); 90 | return 1; 91 | } 92 | 93 | /* read pertinent header fields */ 94 | fseek(fp, 20, SEEK_SET); 95 | dir_off = fgeti16(fp); 96 | dir_nmemb = fgeti16(fp); 97 | 98 | for(i = 0; i < dir_nmemb; i++) 99 | { 100 | unsigned long len; 101 | 102 | fseek(fp, dir_off + 32 * i, SEEK_SET); 103 | fread(filename, 24, 1, fp); 104 | len = fgeti32(fp); 105 | printf("%10lu %s\n", (unsigned long)len, filename); 106 | } 107 | 108 | fclose(fp); 109 | return 0; 110 | } 111 | -------------------------------------------------------------------------------- /src/ungbfs.c: -------------------------------------------------------------------------------- 1 | /* ungbfs.c 2 | dump a GBFS file to the current directory 3 | 4 | Copyright (C) 2002 Damian Yerrick 5 | 6 | This program is free software; you can redistribute it and/or 7 | modify it under the terms of the GNU General Public License 8 | as published by the Free Software Foundation; either version 2 9 | of the License, or (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with this program; if not, write to 18 | Free Software Foundation, Inc., 59 Temple Place - Suite 330, 19 | Boston, MA 02111-1307, USA. 20 | GNU licenses can be viewed online at http://www.gnu.org/copyleft/ 21 | 22 | In addition, as a special exception, Damian Yerrick gives 23 | permission to link the code of this program with import libraries 24 | distributed as part of the plug-in development tools published by 25 | the vendor of any image manipulation program, and distribute 26 | linked combinations including the two. You must obey the GNU 27 | General Public License in all respects for all of the code used 28 | other than the plug-in interface. If you modify this file, you 29 | may extend this exception to your version of the file, but you 30 | are not obligated to do so. If you do not wish to do so, delete 31 | this exception statement from your version. 32 | 33 | Visit http://www.pineight.com/ for more information. 34 | 35 | */ 36 | 37 | #include <stdio.h> 38 | #include <stdlib.h> 39 | #include <string.h> 40 | 41 | #define strequ(a,b) (!strcmp(a,b)) 42 | 43 | typedef unsigned short u16; 44 | typedef unsigned long u32; 45 | 46 | #include "gbfs.h" 47 | 48 | /* fgeti16() *************************** 49 | read a 16-bit integer in intel format from a file 50 | */ 51 | u32 fgeti16(FILE *fp) 52 | { 53 | return ((fgetc(fp) & 0x000000ff) ) | 54 | ((fgetc(fp) & 0x000000ff) << 8); 55 | } 56 | 57 | 58 | /* fgeti32() *************************** 59 | read a 32-bit integer in intel format from a file 60 | */ 61 | u32 fgeti32(FILE *fp) 62 | { 63 | return ((fgetc(fp) & 0x000000ff) ) | 64 | ((fgetc(fp) & 0x000000ff) << 8) | 65 | ((fgetc(fp) & 0x000000ff) << 16) | 66 | ((fgetc(fp) & 0x000000ff) << 24); 67 | } 68 | 69 | 70 | /* fncpy() ***************************** 71 | copy n bytes from one file to the other 72 | */ 73 | void fncpy(FILE *dst, FILE *src, unsigned long n) 74 | { 75 | char buf[16384]; 76 | 77 | while(n > 0) 78 | { 79 | unsigned long n_copy = n; 80 | 81 | if(n_copy > 16384) 82 | n_copy = 16384; 83 | fread(buf, 1, n_copy, src); 84 | fwrite(buf, 1, n_copy, dst); 85 | n -= n_copy; 86 | } 87 | } 88 | 89 | 90 | int main(int argc, char **argv) 91 | { 92 | FILE *fp; 93 | char filename[32] = {0}; 94 | u32 dir_off, dir_nmemb; 95 | unsigned int i; 96 | 97 | if(argc != 2 || strequ("-h", argv[1]) || strequ("--help", argv[1])) 98 | { 99 | fputs("dumps the objects in a gbfs file to separate files\n" 100 | "syntax: ungbfs FILE\n", stderr); 101 | return 1; 102 | } 103 | 104 | fp = fopen(argv[1], "rb"); 105 | if(!fp) 106 | { 107 | fputs("could not open ", stderr); 108 | perror(argv[1]); 109 | return 1; 110 | } 111 | 112 | /* read pertinent header fields */ 113 | fseek(fp, 20, SEEK_SET); 114 | dir_off = fgeti16(fp); 115 | dir_nmemb = fgeti16(fp); 116 | 117 | for(i = 0; i < dir_nmemb; i++) 118 | { 119 | unsigned long len, off; 120 | FILE *outfile; 121 | 122 | fseek(fp, dir_off + 32 * i, SEEK_SET); 123 | fread(filename, 24, 1, fp); 124 | len = fgeti32(fp); 125 | off = fgeti32(fp); 126 | printf("%10lu %s\n", (unsigned long)len, filename); 127 | 128 | outfile = fopen(filename, "wb"); 129 | if(!outfile) 130 | { 131 | fputs("could not open ", stderr); 132 | perror(filename); 133 | fclose(fp); 134 | return 1; 135 | } 136 | fseek(fp, off, SEEK_SET); 137 | fncpy(outfile, fp, len); 138 | fclose(outfile); 139 | } 140 | 141 | fclose(fp); 142 | return 0; 143 | } 144 | --------------------------------------------------------------------------------