├── LICENSE ├── README.md └── src └── me └── grax └── patcher ├── gui ├── MethodTable.java └── PatcherGui.java ├── task ├── LoadTask.java └── SaveTask.java └── utils ├── ASMUtils.java └── StringerUtils.java /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ### About 2 | This tool is made for patching jar archives obfuscated and signed with stringer 3.0.x 3 | ### What does it do? 4 | Stringer encrypts Strings and decrypts them only if nothing in the jar has been modified. 5 | It usually has one or more classes used for decryption and one method that returns a long value. By pressing "Patch" that value is calculated and injected into that method. 6 | "Patch Manifest" removes the signature and certificates. 7 | 8 | ![Screenshot 1](https://i.imgur.com/Ckr7CFm.png) 9 | 10 | Tested with Stringer 3.0.3 and 3.0.9 11 | -------------------------------------------------------------------------------- /src/me/grax/patcher/gui/MethodTable.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.gui; 2 | 3 | import java.util.ArrayList; 4 | 5 | import javax.swing.JTable; 6 | import javax.swing.table.DefaultTableModel; 7 | 8 | import org.objectweb.asm.tree.MethodNode; 9 | 10 | public class MethodTable extends JTable { 11 | private static final long serialVersionUID = 1L; 12 | 13 | public MethodTable() { 14 | setAutoResizeMode(AUTO_RESIZE_ALL_COLUMNS); 15 | getTableHeader().setReorderingAllowed(false); 16 | DefaultTableModel lm = new DefaultTableModel(); 17 | lm.addColumn("#"); 18 | lm.addColumn("Item"); 19 | setModel(lm); 20 | } 21 | 22 | @Override 23 | public boolean editCellAt(int row, int column) { 24 | return false; 25 | } 26 | 27 | public void addList(ArrayList mns) { 28 | DefaultTableModel lm = new DefaultTableModel(); 29 | lm.addColumn("#"); 30 | lm.addColumn("Method"); 31 | int i = 0; 32 | for (MethodNode item : mns) { 33 | lm.addRow(new Object[] { String.valueOf(i), item.owner + "." + item.name + item.desc }); 34 | i++; 35 | } 36 | setModel(lm); 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /src/me/grax/patcher/gui/PatcherGui.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.gui; 2 | 3 | import java.awt.BorderLayout; 4 | import java.awt.EventQueue; 5 | import java.awt.GridLayout; 6 | import java.io.File; 7 | import java.io.IOException; 8 | import java.util.ArrayList; 9 | import java.util.Map; 10 | 11 | import javax.swing.BorderFactory; 12 | import javax.swing.JButton; 13 | import javax.swing.JFileChooser; 14 | import javax.swing.JFrame; 15 | import javax.swing.JLabel; 16 | import javax.swing.JMenu; 17 | import javax.swing.JMenuBar; 18 | import javax.swing.JMenuItem; 19 | import javax.swing.JOptionPane; 20 | import javax.swing.JPanel; 21 | import javax.swing.JProgressBar; 22 | import javax.swing.JScrollPane; 23 | import javax.swing.JTextField; 24 | import javax.swing.UIManager; 25 | import javax.swing.border.EmptyBorder; 26 | import javax.swing.filechooser.FileNameExtensionFilter; 27 | 28 | import org.objectweb.asm.tree.ClassNode; 29 | import org.objectweb.asm.tree.MethodNode; 30 | 31 | import me.grax.patcher.task.LoadTask; 32 | import me.grax.patcher.task.SaveTask; 33 | import me.grax.patcher.utils.StringerUtils; 34 | 35 | public class PatcherGui extends JFrame { 36 | 37 | private static final long serialVersionUID = 1L; 38 | 39 | private JPanel contentPane; 40 | private JProgressBar progressBar; 41 | private MethodTable table; 42 | private JTextField extraValue; 43 | private JTextField key; 44 | private JMenuItem save; 45 | private ArrayList nodes; 46 | private JLabel label; 47 | 48 | public Map classes; 49 | public Map output; 50 | public byte[] extras; 51 | public long longKey; 52 | public JButton searchMethods; 53 | public JButton patchMeta; 54 | 55 | /** 56 | * Launch the application. 57 | */ 58 | public static void main(String[] args) { 59 | EventQueue.invokeLater(new Runnable() { 60 | public void run() { 61 | try { 62 | try { 63 | UIManager.setLookAndFeel("javax.swing.plaf.nimbus.NimbusLookAndFeel"); 64 | } catch (Exception e) { 65 | UIManager.setLookAndFeel(UIManager.getSystemLookAndFeelClassName()); 66 | } 67 | PatcherGui frame = new PatcherGui(); 68 | frame.setVisible(true); 69 | } catch (Exception e) { 70 | e.printStackTrace(); 71 | } 72 | } 73 | }); 74 | } 75 | 76 | /** 77 | * Create the frame. 78 | */ 79 | public PatcherGui() { 80 | setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); 81 | setBounds(100, 100, 500, 550); 82 | setResizable(false); 83 | setTitle("Stringer 3.0 Hash-Patcher"); 84 | contentPane = new JPanel(); 85 | contentPane.setBorder(new EmptyBorder(5, 5, 5, 5)); 86 | contentPane.setLayout(new BorderLayout(15, 15)); 87 | setContentPane(contentPane); 88 | setJMenuBar(getMyMenuBar()); 89 | JPanel top = new JPanel(); 90 | top.setLayout(new BorderLayout(15, 15)); 91 | 92 | JPanel extraBytes = new JPanel(); 93 | final JPanel input = new JPanel(new GridLayout(0, 1, 5, 5)); 94 | final JPanel fields = new JPanel(new GridLayout(0, 1, 5, 5)); 95 | extraBytes.setLayout(new BorderLayout(15, 15)); 96 | input.add(new JLabel("Extra Value:")); 97 | fields.add(extraValue = new JTextField()); 98 | extraValue.setEditable(false); 99 | input.add(new JLabel("Calculated Key:")); 100 | fields.add(key = new JTextField()); 101 | key.setEditable(false); 102 | extraBytes.add(input, BorderLayout.WEST); 103 | extraBytes.add(fields, BorderLayout.CENTER); 104 | top.add(extraBytes, BorderLayout.CENTER); 105 | contentPane.add(top, BorderLayout.NORTH); 106 | 107 | JPanel center = new JPanel(); 108 | center.setLayout(new BorderLayout(15, 15)); 109 | center.setBorder(BorderFactory.createTitledBorder("Stringer hash methods")); 110 | table = new MethodTable(); 111 | center.add(new JScrollPane(table), BorderLayout.CENTER); 112 | JPanel tableActions = new JPanel(); 113 | tableActions.setLayout(new GridLayout(1, 3, 15, 15)); 114 | patchMeta = new JButton("Patch Manifest"); 115 | patchMeta.setEnabled(false); 116 | patchMeta.addActionListener(e -> { 117 | byte[] manifest = output.get("META-INF/MANIFEST.MF"); 118 | if (manifest != null) { 119 | try { 120 | String mf = new String(manifest, "UTF-8"); 121 | String newMf = ""; 122 | int i = 0; 123 | for (String line : mf.split("\n")) { 124 | if (line.length() > 1 && !line.startsWith("JAR-Signature:") && !line.startsWith("Name:") && !line.startsWith("SHA-256-Digest:")) { 125 | newMf += line; 126 | newMf += '\n'; 127 | } else { 128 | i++; 129 | } 130 | } 131 | newMf += "\n"; //need a new line because without it won't recognize it 132 | output.remove("META-INF/CERT.RSA"); 133 | output.remove("META-INF/CERT.SF"); 134 | output.put("META-INF/MANIFEST.MF", newMf.getBytes("UTF-8")); 135 | JOptionPane.showMessageDialog(null, "Patch successful, removed " + i + " lines!", "Information", JOptionPane.INFORMATION_MESSAGE); 136 | } catch (Exception e1) { 137 | JOptionPane.showMessageDialog(null, e1.toString(), "Error", JOptionPane.ERROR_MESSAGE); 138 | e1.printStackTrace(); 139 | } 140 | } else { 141 | JOptionPane.showMessageDialog(null, "Archive does not contain META-INF/MANIFEST.MF", "Information", JOptionPane.INFORMATION_MESSAGE); 142 | } 143 | patchMeta.setEnabled(false); 144 | save.setEnabled(true); 145 | }); 146 | JButton patch = new JButton("Patch"); 147 | patch.setEnabled(false); 148 | patch.addActionListener(e -> { 149 | StringerUtils.patch(nodes, longKey); 150 | nodes = StringerUtils.getHashMethods(classes.values()); 151 | table.addList(nodes); 152 | if (nodes.isEmpty()) { 153 | JOptionPane.showMessageDialog(null, "Patch successful!", "Information", JOptionPane.INFORMATION_MESSAGE); 154 | patch.setEnabled(false); 155 | save.setEnabled(true); 156 | } else { 157 | JOptionPane.showMessageDialog(null, "Failed to patch method(s) using key " + longKey, "Warning", JOptionPane.WARNING_MESSAGE); 158 | } 159 | }); 160 | searchMethods = new JButton("Search"); 161 | searchMethods.setEnabled(false); 162 | searchMethods.addActionListener(e -> { 163 | nodes = StringerUtils.getHashMethods(classes.values()); 164 | if (!nodes.isEmpty()) { 165 | table.addList(nodes); 166 | patch.setEnabled(true); 167 | } else { 168 | JOptionPane.showMessageDialog(null, "No hashing methods found!", "Warning", JOptionPane.WARNING_MESSAGE); 169 | } 170 | }); 171 | tableActions.add(searchMethods); 172 | tableActions.add(new JPanel()); 173 | tableActions.add(patch); 174 | center.add(tableActions, BorderLayout.PAGE_END); 175 | contentPane.add(center, BorderLayout.CENTER); 176 | 177 | progressBar = new JProgressBar(); 178 | JPanel south = new JPanel(); 179 | south.setLayout(new BorderLayout(15, 15)); 180 | south.add(progressBar, BorderLayout.SOUTH); 181 | label = new JLabel(""); 182 | label.setHorizontalAlignment(JLabel.CENTER); 183 | JPanel southCenter = new JPanel(); 184 | southCenter.setLayout(new GridLayout(1, 5, 15, 15)); 185 | southCenter.setBorder(BorderFactory.createTitledBorder("Jar signature")); 186 | southCenter.add(label); 187 | southCenter.add(new JPanel()); 188 | southCenter.add(patchMeta); 189 | south.add(southCenter, BorderLayout.CENTER); 190 | contentPane.add(south, BorderLayout.SOUTH); 191 | } 192 | 193 | private JMenuBar getMyMenuBar() { 194 | JMenuBar jmb = new JMenuBar(); 195 | JMenu file = new JMenu("File"); 196 | JMenu help = new JMenu("Help"); 197 | JMenuItem load = new JMenuItem("Load"); 198 | load.addActionListener(e -> { 199 | openLoadDialogue(); 200 | }); 201 | save = new JMenuItem("Save as.."); 202 | save.setEnabled(false); 203 | save.addActionListener(e -> { 204 | openSaveDialogue(); 205 | }); 206 | JMenuItem about = new JMenuItem("About"); 207 | about.addActionListener(e -> { 208 | JOptionPane.showMessageDialog(null, 209 | "This tool was made by GraxCode\nhttps://github.com/GraxCode/Stringer-Hash-Patcher\n\nStringer 3.0 Hash-Patcher is licensed under the GNU General Public License 3\nCopyright 2018 GraxCode", 210 | "Information", JOptionPane.INFORMATION_MESSAGE); 211 | }); 212 | help.add(about); 213 | file.add(load); 214 | file.add(save); 215 | jmb.add(file); 216 | jmb.add(help); 217 | return jmb; 218 | } 219 | 220 | protected void openSaveDialogue() { 221 | JFileChooser jfc = new JFileChooser(new File(System.getProperty("user.home") + File.separator + "Desktop")); 222 | jfc.setAcceptAllFileFilterUsed(false); 223 | jfc.setFileFilter(new FileNameExtensionFilter("Java Package (*.jar)", "jar")); 224 | int result = jfc.showSaveDialog(this); 225 | if (result == JFileChooser.APPROVE_OPTION) { 226 | File output = jfc.getSelectedFile(); 227 | saveFile(output); 228 | 229 | //too lazy to reset everything manually 230 | this.dispose(); 231 | PatcherGui frame = new PatcherGui(); 232 | frame.setVisible(true); 233 | } 234 | } 235 | 236 | private void saveFile(File out) { 237 | try { 238 | new SaveTask(progressBar, out, classes.values(), output).execute(); 239 | } catch (IOException e) { 240 | e.printStackTrace(); 241 | } 242 | } 243 | 244 | protected void openLoadDialogue() { 245 | JFileChooser jfc = new JFileChooser(new File(System.getProperty("user.home") + File.separator + "Desktop")); 246 | jfc.setAcceptAllFileFilterUsed(false); 247 | jfc.setFileFilter(new FileNameExtensionFilter("Java Package (*.jar)", "jar")); 248 | int result = jfc.showOpenDialog(this); 249 | if (result == JFileChooser.APPROVE_OPTION) { 250 | File input = jfc.getSelectedFile(); 251 | loadFile(input); 252 | } 253 | } 254 | 255 | private void loadFile(File input) { 256 | try { 257 | new LoadTask(this, input, progressBar, extraValue, key, label).execute(); 258 | } catch (IOException e) { 259 | e.printStackTrace(); 260 | } 261 | } 262 | } 263 | -------------------------------------------------------------------------------- /src/me/grax/patcher/task/LoadTask.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.task; 2 | 3 | import java.io.File; 4 | import java.io.IOException; 5 | import java.io.InputStream; 6 | import java.util.Enumeration; 7 | import java.util.HashMap; 8 | import java.util.List; 9 | import java.util.Map; 10 | import java.util.jar.JarEntry; 11 | import java.util.jar.JarFile; 12 | import java.util.stream.Stream; 13 | 14 | import javax.swing.JLabel; 15 | import javax.swing.JProgressBar; 16 | import javax.swing.JTextField; 17 | import javax.swing.SwingWorker; 18 | 19 | import org.apache.commons.io.IOUtils; 20 | import org.objectweb.asm.tree.ClassNode; 21 | import org.objectweb.asm.tree.MethodNode; 22 | 23 | import me.grax.patcher.gui.PatcherGui; 24 | import me.grax.patcher.utils.ASMUtils; 25 | import me.grax.patcher.utils.StringerUtils; 26 | 27 | public class LoadTask extends SwingWorker { 28 | 29 | private JarFile inputJar; 30 | private File input; 31 | 32 | private JProgressBar progressBar; 33 | private JTextField extraValue; 34 | private JTextField key; 35 | private JLabel label; 36 | 37 | private int jarSize; 38 | private int loaded; 39 | 40 | private PatcherGui gui; 41 | 42 | public LoadTask(PatcherGui gui, File input, JProgressBar progressBar, JTextField extraValue, JTextField key, JLabel label) throws IOException { 43 | this.gui = gui; 44 | this.inputJar = new JarFile(input); 45 | this.input = input; 46 | this.jarSize = countFiles(this.inputJar); 47 | this.progressBar = progressBar; 48 | this.extraValue = extraValue; 49 | this.key = key; 50 | this.label = label; 51 | } 52 | 53 | @Override 54 | protected Void doInBackground() throws Exception { 55 | publish(0); 56 | loadFiles(inputJar); 57 | publish(67); 58 | gui.extras = StringerUtils.getExtra(input); 59 | if (gui.extras == null) { 60 | publish(100); 61 | return null; 62 | } 63 | this.extraValue.setText(gui.extras[0] + ", " + gui.extras[1] + ", " + gui.extras[2] + ", " + gui.extras[3]); 64 | publish(80); 65 | gui.longKey = StringerUtils.getStringerKey(gui.extras, input); 66 | this.key.setText(String.valueOf(gui.longKey)); 67 | gui.searchMethods.setEnabled(true); 68 | gui.patchMeta.setEnabled(true); 69 | publish(100); 70 | return null; 71 | } 72 | 73 | @Override 74 | protected void process(List chunks) { 75 | int i = chunks.get(chunks.size() - 1); 76 | progressBar.setValue(i); 77 | super.process(chunks); 78 | } 79 | 80 | @Override 81 | protected void done() { 82 | progressBar.setValue(0); 83 | super.done(); 84 | } 85 | 86 | public int countFiles(final JarFile zipFile) { 87 | final Enumeration entries = zipFile.entries(); 88 | int c = 0; 89 | while (entries.hasMoreElements()) { 90 | entries.nextElement(); 91 | ++c; 92 | } 93 | return c; 94 | } 95 | 96 | /** 97 | * loads both classes and other files at the same time 98 | */ 99 | public void loadFiles(JarFile jar) throws IOException { 100 | Map classes = new HashMap(); 101 | Map otherFiles = new HashMap(); 102 | 103 | Stream str = jar.stream(); 104 | str.forEach(z -> readJar(jar, z, classes, otherFiles)); 105 | jar.close(); 106 | gui.classes = classes; 107 | gui.output = otherFiles; 108 | setLabel(jar); 109 | return; 110 | } 111 | 112 | private void setLabel(JarFile jar) { 113 | try { 114 | String protectedBy = jar.getManifest().getMainAttributes().getValue("Protected-By"); 115 | if(protectedBy != null) { 116 | label.setText(protectedBy); 117 | } else { 118 | label.setText("Signed: true"); 119 | } 120 | } catch (IOException e) { 121 | e.printStackTrace(); 122 | label.setText("Manifest couldn't be loaded"); 123 | } 124 | } 125 | 126 | private void readJar(JarFile jar, JarEntry en, Map classes, Map otherFiles) { 127 | publish((int) ((((float) loaded++ / (float) jarSize) * 100f) * (2 / 3d))); 128 | String name = en.getName(); 129 | try (InputStream jis = jar.getInputStream(en)) { 130 | if (name.endsWith(".class")) { 131 | byte[] bytes = IOUtils.toByteArray(jis); 132 | String cafebabe = String.format("%02X%02X%02X%02X", bytes[0], bytes[1], bytes[2], bytes[3]); 133 | if (cafebabe.toLowerCase().equals("cafebabe")) { 134 | try { 135 | final ClassNode cn = ASMUtils.getNode(bytes); 136 | if (cn != null) { 137 | for (MethodNode mn : cn.methods) { 138 | mn.owner = cn.name; 139 | } 140 | classes.put(cn.name, cn); 141 | } 142 | } catch (Exception e) { 143 | e.printStackTrace(); 144 | System.err.println("Failed loading class file " + name); 145 | } 146 | } 147 | } else if (!en.isDirectory()) { 148 | byte[] bytes = IOUtils.toByteArray(jis); 149 | otherFiles.put(name, bytes); 150 | } 151 | } catch (Exception e) { 152 | e.printStackTrace(); 153 | System.err.println("Failed loading file"); 154 | } 155 | return; 156 | } 157 | } -------------------------------------------------------------------------------- /src/me/grax/patcher/task/SaveTask.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.task; 2 | 3 | import java.io.File; 4 | import java.io.FileOutputStream; 5 | import java.io.IOException; 6 | import java.util.Collection; 7 | import java.util.List; 8 | import java.util.Map; 9 | import java.util.jar.JarOutputStream; 10 | import java.util.zip.ZipEntry; 11 | 12 | import javax.swing.JProgressBar; 13 | import javax.swing.SwingWorker; 14 | 15 | import org.objectweb.asm.ClassWriter; 16 | import org.objectweb.asm.tree.ClassNode; 17 | 18 | public class SaveTask extends SwingWorker { 19 | 20 | private JProgressBar progressBar; 21 | private File outFile; 22 | private Collection nodes; 23 | private Map output; 24 | 25 | public SaveTask(JProgressBar progressBar, File outFile, Collection nodes, Map output) throws IOException { 26 | this.progressBar = progressBar; 27 | this.outFile = outFile; 28 | this.nodes = nodes; 29 | this.output = output; 30 | } 31 | 32 | @Override 33 | protected Void doInBackground() throws Exception { 34 | publish(0); 35 | double size = nodes.size(); 36 | double i = 0; 37 | for (ClassNode cn : nodes) { 38 | publish((int)((i / size) * 50d)); 39 | ClassWriter cw = new ClassWriter(0); 40 | cn.accept(cw); 41 | output.put(cn.name, cw.toByteArray()); 42 | i++; 43 | } 44 | publish(50); 45 | size = nodes.size(); 46 | i = 0; 47 | JarOutputStream out = new JarOutputStream(new FileOutputStream(outFile)); 48 | for (String entry : output.keySet()) { 49 | publish(50 + (int)((i / size) * 50d)); 50 | String ext = entry.contains(".") ? "" : ".class"; 51 | out.putNextEntry(new ZipEntry(entry + ext)); 52 | out.write(output.get(entry)); 53 | out.closeEntry(); 54 | i++; 55 | } 56 | out.close(); 57 | publish(100); 58 | return null; 59 | } 60 | 61 | @Override 62 | protected void process(List chunks) { 63 | int i = chunks.get(chunks.size() - 1); 64 | progressBar.setValue(i); 65 | super.process(chunks); 66 | } 67 | 68 | @Override 69 | protected void done() { 70 | progressBar.setValue(0); 71 | super.done(); 72 | } 73 | } -------------------------------------------------------------------------------- /src/me/grax/patcher/utils/ASMUtils.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.utils; 2 | 3 | import static org.objectweb.asm.Opcodes.*; 4 | 5 | import org.objectweb.asm.ClassReader; 6 | import org.objectweb.asm.ClassWriter; 7 | import org.objectweb.asm.Type; 8 | import org.objectweb.asm.tree.ClassNode; 9 | import org.objectweb.asm.tree.FieldInsnNode; 10 | import org.objectweb.asm.tree.InsnNode; 11 | import org.objectweb.asm.tree.MethodNode; 12 | import org.objectweb.asm.tree.VarInsnNode; 13 | 14 | public class ASMUtils { 15 | /** 16 | * Gets the bytes of a given ClassNode. 17 | * 18 | * @param cn 19 | * @param useMaxs 20 | * @return 21 | */ 22 | public static byte[] getNodeBytes(ClassNode cn, boolean useMaxs) { 23 | ClassWriter cw = new ClassWriter(useMaxs ? ClassWriter.COMPUTE_MAXS : ClassWriter.COMPUTE_FRAMES); 24 | cn.accept(cw); 25 | byte[] b = cw.toByteArray(); 26 | return b; 27 | } 28 | 29 | /** 30 | * Gets a ClassNode based on given bytes 31 | * 32 | * @param bytez 33 | * @return 34 | */ 35 | public static ClassNode getNode(final byte[] bytez) { 36 | ClassReader cr = new ClassReader(bytez); 37 | ClassNode cn = new ClassNode(); 38 | try { 39 | cr.accept(cn, ClassReader.EXPAND_FRAMES); 40 | } catch (Exception e) { 41 | try { 42 | cr.accept(cn, ClassReader.SKIP_FRAMES | ClassReader.SKIP_DEBUG); 43 | } catch (Exception e2) { 44 | // e2.printStackTrace(); 45 | } 46 | } 47 | cr = null; 48 | return cn; 49 | } 50 | 51 | /** 52 | * Generates a getter method for the specified field 53 | * 54 | * @author Xerces 55 | * @param fieldName 56 | * the name of the field 57 | * @param className 58 | * the internal class name 59 | * @param fieldDesc 60 | * the field descriptor 61 | * @param methodName 62 | * the name of the method to create 63 | * @return the method as a {@link org.objectweb.asm.tree.MethodNode} 64 | */ 65 | public static MethodNode generateGetter(String methodName, String fieldName, String className, String fieldDesc) { 66 | MethodNode methodNode = new MethodNode(ACC_PUBLIC, methodName, "()" + fieldDesc, null, null); 67 | methodNode.instructions.insert(new VarInsnNode(ALOAD, 0)); 68 | methodNode.instructions.insert(new FieldInsnNode(GETFIELD, className, fieldName, fieldDesc)); 69 | methodNode.instructions.insert(new InsnNode(Type.getType(fieldDesc).getOpcode(IRETURN))); 70 | return methodNode; 71 | } 72 | 73 | /** 74 | * Generates a setter method for the specified field 75 | * 76 | * @author Xerces 77 | * @param fieldName 78 | * the name of the field 79 | * @param className 80 | * the internal class name 81 | * @param fieldDesc 82 | * the field descriptor 83 | * @param methodName 84 | * the name of the method to create 85 | * @return the method as a {@link org.objectweb.asm.tree.MethodNode} 86 | */ 87 | public static MethodNode generateSetter(String methodName, String fieldName, String className, String fieldDesc) { 88 | MethodNode methodNode = new MethodNode(ACC_PUBLIC, methodName, "(" + fieldDesc + ")V", null, null); 89 | methodNode.instructions.insert(new VarInsnNode(ALOAD, 0)); 90 | methodNode.instructions.insert(new VarInsnNode(Type.getType(fieldDesc).getOpcode(ILOAD), 1)); 91 | methodNode.instructions.insert(new FieldInsnNode(PUTFIELD, className, fieldName, fieldDesc)); 92 | methodNode.instructions.insert(new InsnNode(RETURN)); 93 | return methodNode; 94 | } 95 | 96 | /** 97 | * Adds interfaces to a class 98 | * 99 | * @author Xerces 100 | * @param classNode 101 | * the {@link org.objectweb.asm.tree.ClassNode} to add the 102 | * interfaces too 103 | * @param interfaces 104 | * a {@link java.lang.Class} array of the interfaces to add 105 | */ 106 | public static void addInterfaces(ClassNode classNode, Class[] interfaces) { 107 | for (Class interfaceClass : interfaces) { 108 | if (interfaceClass.isInterface()) { 109 | classNode.interfaces.add(interfaceClass.getName().replaceAll(".", "/")); 110 | } 111 | } 112 | } 113 | } -------------------------------------------------------------------------------- /src/me/grax/patcher/utils/StringerUtils.java: -------------------------------------------------------------------------------- 1 | package me.grax.patcher.utils; 2 | 3 | import java.io.ByteArrayOutputStream; 4 | import java.io.File; 5 | import java.io.FileInputStream; 6 | import java.io.IOException; 7 | import java.util.ArrayList; 8 | import java.util.Arrays; 9 | import java.util.Collection; 10 | import java.util.HashMap; 11 | import java.util.zip.ZipEntry; 12 | import java.util.zip.ZipInputStream; 13 | 14 | import javax.swing.JOptionPane; 15 | 16 | import org.objectweb.asm.Opcodes; 17 | import org.objectweb.asm.tree.ClassNode; 18 | import org.objectweb.asm.tree.InsnNode; 19 | import org.objectweb.asm.tree.LdcInsnNode; 20 | import org.objectweb.asm.tree.MethodNode; 21 | 22 | public class StringerUtils implements Opcodes { 23 | public static byte[] getExtra(File file) throws IOException { 24 | ArrayList allArrays = new ArrayList(); 25 | HashMap amounts = new HashMap<>(); 26 | ZipInputStream zis = new ZipInputStream(new FileInputStream(file)); 27 | int classCount = 0; 28 | while (true) { 29 | ZipEntry e = zis.getNextEntry(); 30 | if (e == null) { 31 | break; 32 | } 33 | byte[] extra = e.getExtra(); 34 | if (extra != null) { 35 | boolean found = false; 36 | int i = 0; 37 | for (byte[] array : allArrays) { 38 | if (array[0] == extra[0] && array[1] == extra[1] && array[2] == extra[2] && array[3] == extra[3]) { 39 | found = true; 40 | break; 41 | } 42 | i++; 43 | } 44 | if (found) { 45 | amounts.put(i, amounts.getOrDefault(i, 1) + 1); 46 | } else { 47 | allArrays.add(extra); 48 | } 49 | } 50 | zis.closeEntry(); 51 | if (e.getName().endsWith(".class")) { 52 | classCount++; 53 | } 54 | } 55 | zis.close(); 56 | int i = 0; 57 | int max = 0; 58 | byte[] hightestChance = null; 59 | int extras = 0; 60 | for (byte[] array : allArrays) { 61 | int files = amounts.getOrDefault(i, 1); 62 | if (files > max) { 63 | hightestChance = array; 64 | max = files; 65 | } 66 | extras += files; 67 | System.out.println("Possible key #" + i + ": " + Arrays.toString(array) + " (" + files + " files)"); 68 | i++; 69 | } 70 | System.out.println(Math.round((extras / (double) classCount) * 100d) + "% of class files have an extra-value"); 71 | if (extras < classCount / 3d) { 72 | JOptionPane.showMessageDialog(null, 73 | "File is probably not obfuscated with Stringer 3.x (" + Math.round((extras / (double) classCount) * 100d) + "%)", "Warning", 74 | JOptionPane.ERROR_MESSAGE); 75 | return null; 76 | } 77 | return hightestChance; 78 | } 79 | 80 | public static long getStringerKey(byte[] extraValues, File file) throws IOException { 81 | ZipInputStream zis = new ZipInputStream(new FileInputStream(file)); 82 | ByteArrayOutputStream bytes = new ByteArrayOutputStream(); 83 | while (true) { 84 | ZipEntry e = zis.getNextEntry(); 85 | if (e == null) { 86 | break; 87 | } 88 | String name = e.getName(); 89 | byte[] extra = e.getExtra(); 90 | if (extra != null) { 91 | if (extra[0] == extraValues[0] && extra[1] == extraValues[1]) { 92 | if (name.contains(".")) { 93 | if (name.substring(name.lastIndexOf(".")).equals(".class")) { 94 | bytes.write(name.getBytes("UTF-8")); 95 | bytes.write(extra); 96 | } 97 | } 98 | } 99 | } 100 | zis.closeEntry(); 101 | } 102 | bytes.close(); 103 | zis.close(); 104 | return getBytes(0L, 0L, bytes.toByteArray()); 105 | } 106 | 107 | private static long getBytes(long var0, long var2, byte[] var4) { 108 | long var5 = 8317987319222330741L ^ var0; 109 | long var7 = 7237128888997146477L ^ var2; 110 | long var9 = 7816392313619706465L ^ var0; 111 | long var11 = 8387220255154660723L ^ var2; 112 | int var15 = var4.length / 8 * 8; 113 | 114 | int var16; 115 | long var13; 116 | for (var16 = 0; var16 < var15; var5 ^= var13) { 117 | var13 = (long) var4[var16++] & 255L | ((long) var4[var16++] & 255L) << 8 | ((long) var4[var16++] & 255L) << 16 118 | | ((long) var4[var16++] & 255L) << 24 | ((long) var4[var16++] & 255L) << 32 | ((long) var4[var16++] & 255L) << 40 119 | | ((long) var4[var16++] & 255L) << 48 | ((long) var4[var16++] & 255L) << 56; 120 | var11 ^= var13; 121 | var5 += var7; 122 | var9 += var11; 123 | var7 = var7 << 13 | var7 >>> 51; 124 | var11 = var11 << 16 | var11 >>> 48; 125 | var7 ^= var5; 126 | var11 ^= var9; 127 | var5 = var5 << 32 | var5 >>> 32; 128 | var9 += var7; 129 | var5 += var11; 130 | var7 = var7 << 17 | var7 >>> 47; 131 | var11 = var11 << 21 | var11 >>> 43; 132 | var7 ^= var9; 133 | var11 ^= var5; 134 | var9 = var9 << 32 | var9 >>> 32; 135 | var5 += var7; 136 | var9 += var11; 137 | var7 = var7 << 13 | var7 >>> 51; 138 | var11 = var11 << 16 | var11 >>> 48; 139 | var7 ^= var5; 140 | var11 ^= var9; 141 | var5 = var5 << 32 | var5 >>> 32; 142 | var9 += var7; 143 | var5 += var11; 144 | var7 = var7 << 17 | var7 >>> 47; 145 | var11 = var11 << 21 | var11 >>> 43; 146 | var7 ^= var9; 147 | var11 ^= var5; 148 | var9 = var9 << 32 | var9 >>> 32; 149 | } 150 | 151 | var13 = 0L; 152 | 153 | for (var16 = var4.length - 1; var16 >= var15; --var16) { 154 | var13 <<= 8; 155 | var13 |= (long) var4[var16] & 255L; 156 | } 157 | 158 | var13 |= (long) var4.length << 56; 159 | var11 ^= var13; 160 | var5 += var7; 161 | var9 += var11; 162 | var7 = var7 << 13 | var7 >>> 51; 163 | var11 = var11 << 16 | var11 >>> 48; 164 | var7 ^= var5; 165 | var11 ^= var9; 166 | var5 = var5 << 32 | var5 >>> 32; 167 | var9 += var7; 168 | var5 += var11; 169 | var7 = var7 << 17 | var7 >>> 47; 170 | var11 = var11 << 21 | var11 >>> 43; 171 | var7 ^= var9; 172 | var11 ^= var5; 173 | var9 = var9 << 32 | var9 >>> 32; 174 | var5 += var7; 175 | var9 += var11; 176 | var7 = var7 << 13 | var7 >>> 51; 177 | var11 = var11 << 16 | var11 >>> 48; 178 | var7 ^= var5; 179 | var11 ^= var9; 180 | var5 = var5 << 32 | var5 >>> 32; 181 | var9 += var7; 182 | var5 += var11; 183 | var7 = var7 << 17 | var7 >>> 47; 184 | var11 = var11 << 21 | var11 >>> 43; 185 | var7 ^= var9; 186 | var11 ^= var5; 187 | var9 = var9 << 32 | var9 >>> 32; 188 | var5 ^= var13; 189 | var9 ^= 255L; 190 | var5 += var7; 191 | var9 += var11; 192 | var7 = var7 << 13 | var7 >>> 51; 193 | var11 = var11 << 16 | var11 >>> 48; 194 | var7 ^= var5; 195 | var11 ^= var9; 196 | var5 = var5 << 32 | var5 >>> 32; 197 | var9 += var7; 198 | var5 += var11; 199 | var7 = var7 << 17 | var7 >>> 47; 200 | var11 = var11 << 21 | var11 >>> 43; 201 | var7 ^= var9; 202 | var11 ^= var5; 203 | var9 = var9 << 32 | var9 >>> 32; 204 | var5 += var7; 205 | var9 += var11; 206 | var7 = var7 << 13 | var7 >>> 51; 207 | var11 = var11 << 16 | var11 >>> 48; 208 | var7 ^= var5; 209 | var11 ^= var9; 210 | var5 = var5 << 32 | var5 >>> 32; 211 | var9 += var7; 212 | var5 += var11; 213 | var7 = var7 << 17 | var7 >>> 47; 214 | var11 = var11 << 21 | var11 >>> 43; 215 | var7 ^= var9; 216 | var11 ^= var5; 217 | var9 = var9 << 32 | var9 >>> 32; 218 | var5 += var7; 219 | var9 += var11; 220 | var7 = var7 << 13 | var7 >>> 51; 221 | var11 = var11 << 16 | var11 >>> 48; 222 | var7 ^= var5; 223 | var11 ^= var9; 224 | var5 = var5 << 32 | var5 >>> 32; 225 | var9 += var7; 226 | var5 += var11; 227 | var7 = var7 << 17 | var7 >>> 47; 228 | var11 = var11 << 21 | var11 >>> 43; 229 | var7 ^= var9; 230 | var11 ^= var5; 231 | var9 = var9 << 32 | var9 >>> 32; 232 | var5 += var7; 233 | var9 += var11; 234 | var7 = var7 << 13 | var7 >>> 51; 235 | var11 = var11 << 16 | var11 >>> 48; 236 | var7 ^= var5; 237 | var11 ^= var9; 238 | var5 = var5 << 32 | var5 >>> 32; 239 | var9 += var7; 240 | var5 += var11; 241 | var7 = var7 << 17 | var7 >>> 47; 242 | var11 = var11 << 21 | var11 >>> 43; 243 | var7 ^= var9; 244 | var11 ^= var5; 245 | var9 = var9 << 32 | var9 >>> 32; 246 | return var5 ^ var7 ^ var9 ^ var11; 247 | } 248 | 249 | public static ArrayList getHashMethods(Collection nodes) { 250 | ArrayList methods = new ArrayList<>(); 251 | for (ClassNode cn : nodes) { 252 | for (MethodNode mn : cn.methods) { 253 | if (mn.desc.equals("()J") && mn.instructions.size() > 2 && mn.instructions.getFirst().getOpcode() == LCONST_0 254 | && mn.instructions.getFirst().getNext().getOpcode() == LSTORE && mn.instructions.getLast().getOpcode() == GOTO) { 255 | methods.add(mn); 256 | } 257 | } 258 | } 259 | return methods; 260 | 261 | } 262 | 263 | public static void patch(ArrayList nodes, long key) { 264 | for (MethodNode mn : nodes) { 265 | mn.instructions.clear(); 266 | mn.instructions.add(new LdcInsnNode(key)); 267 | mn.instructions.add(new InsnNode(LRETURN)); 268 | mn.tryCatchBlocks.clear(); 269 | mn.localVariables.clear(); 270 | } 271 | } 272 | 273 | } 274 | --------------------------------------------------------------------------------