├── LICENSE ├── README.md ├── ida9rewriter ├── __main__.py ├── cli.py └── codemods │ ├── replace_complex.py │ └── replace_simple.py ├── pyproject.toml ├── requirements.txt └── setup.py /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 | # ida9rewriter 2 | 3 | ## Installation 4 | 5 | ```sh 6 | pip install git+https://github.com/rand-tech/ida9rewriter 7 | ``` 8 | 9 | ## Usage 10 | 11 | ```sh 12 | usage: ida9rewriter [-h] [-d] [-r] source 13 | 14 | positional arguments: 15 | source Path to the source file/directory 16 | 17 | options: 18 | -h, --help show this help message and exit 19 | -d, --dryrun Print the updated code without saving it 20 | -r, --recursive Recursively rewrite all Python files in the 21 | directory 22 | ``` 23 | -------------------------------------------------------------------------------- /ida9rewriter/__main__.py: -------------------------------------------------------------------------------- 1 | from ida9rewriter.cli import cli 2 | 3 | 4 | def main(): 5 | cli() 6 | 7 | 8 | if __name__ == "__main__": 9 | main() 10 | -------------------------------------------------------------------------------- /ida9rewriter/cli.py: -------------------------------------------------------------------------------- 1 | import argparse 2 | import difflib 3 | import os 4 | import sys 5 | from concurrent.futures import ProcessPoolExecutor, as_completed 6 | 7 | from tqdm import tqdm 8 | 9 | from ida9rewriter.codemods.replace_complex import bump_ida_complex 10 | from ida9rewriter.codemods.replace_simple import bump_ida_simple 11 | 12 | 13 | def bump_ida(source_code: str) -> str: 14 | passes = [bump_ida_complex, bump_ida_simple] 15 | for pass_ in passes: 16 | source_code = pass_(source_code) 17 | return source_code 18 | 19 | 20 | def process_file(file: str, is_dryrun: bool): 21 | with open(file, "r") as f: 22 | source_code = f.read() 23 | new_source = bump_ida(source_code) 24 | if is_dryrun: 25 | diff = list(difflib.unified_diff(source_code.splitlines(), new_source.splitlines(), fromfile=file, tofile=f"{file} (modified)", lineterm="")) 26 | if diff: 27 | return file, "\n".join(diff) 28 | else: 29 | with open(file, "w") as f: 30 | f.write(new_source) 31 | return file, None 32 | 33 | 34 | def run(source: str, is_dryrun: bool, recursive: bool): 35 | if os.path.isdir(source): 36 | if not recursive: 37 | print(f"Error: {source} is a directory. Use -r/--recursive to rewrite all Python files in the directory.", file=sys.stderr) 38 | exit(1) 39 | files = [os.path.join(root, file) for root, _, files in os.walk(source) for file in files if file.endswith(".py")] 40 | else: 41 | files = [source] 42 | 43 | results = {} 44 | total_files = len(files) 45 | 46 | with ProcessPoolExecutor() as executor: 47 | futures = {executor.submit(process_file, file, is_dryrun): file for file in files} 48 | with tqdm(total=total_files, desc="Processing files", unit="file") as pbar: 49 | for future in as_completed(futures): 50 | file, result = future.result() 51 | if result: 52 | results[file] = result 53 | pbar.update(1) 54 | if results: 55 | print("\nModified files:") 56 | for file in sorted(results.keys()): 57 | print(f"\nFile: {file}") 58 | print(results[file]) 59 | else: 60 | print("\nNo files were modified.") 61 | 62 | 63 | def cli(): 64 | parser = argparse.ArgumentParser(description="Rewrite IDA Pro API calls") 65 | parser.add_argument("source", help="Path to the source file/directory") 66 | parser.add_argument("-d", "--dryrun", action="store_true", help="Print the updated code without saving it", default=False) 67 | parser.add_argument("-r", "--recursive", action="store_true", help="Recursively rewrite all Python files in the directory", default=False) 68 | args = parser.parse_args() 69 | run(args.source, args.dryrun, args.recursive) 70 | 71 | 72 | if __name__ == "__main__": 73 | cli() 74 | -------------------------------------------------------------------------------- /ida9rewriter/codemods/replace_complex.py: -------------------------------------------------------------------------------- 1 | import argparse 2 | import difflib 3 | import sys 4 | from dataclasses import dataclass 5 | from typing import Dict, List, Tuple 6 | 7 | import libcst as cst 8 | from libcst.metadata import PositionProvider 9 | 10 | @dataclass 11 | class APIConfig: 12 | old_call_signature: str 13 | new_call_signature: str 14 | is_callable: bool 15 | 16 | def parse_config(config: Dict[str, str]) -> List[APIConfig]: 17 | configs = [] 18 | for k, v in config.items(): 19 | is_callable = k.endswith("()") 20 | configs.append(APIConfig(old_call_signature=k, new_call_signature=v, is_callable=is_callable)) 21 | return configs 22 | 23 | CONFIG = { 24 | "idaapi.get_inf_structure().is_64bit()": "ida_ida.inf_is_64bit()", 25 | "idaapi.get_inf_structure().is_32bit()": "ida_ida.inf_is_32bit_exactly()", 26 | "idaapi.get_inf_structure().is_16bit()": "ida_ida.inf_is_16bit()", 27 | "idaapi.get_inf_structure().is_be()": "ida_ida.inf_is_be()", 28 | "idaapi.get_inf_structure().is_dll()": "ida_ida.inf_is_dll()", 29 | "idaapi.get_inf_structure().procname": "ida_ida.inf_get_procname()", 30 | "idaapi.get_inf_structure().max_ea": "ida_ida.inf_get_max_ea()", 31 | "idaapi.get_inf_structure().min_ea": "ida_ida.inf_get_min_ea()", 32 | "idaapi.get_inf_structure().filetype": "ida_ida.inf_get_filetype()", 33 | "idaapi.get_inf_structure().lflags": "ida_ida.inf_get_lflags()", 34 | } 35 | 36 | ################################################################################ 37 | 38 | class APIReplacer(cst.CSTTransformer): 39 | METADATA_DEPENDENCIES = (PositionProvider,) 40 | 41 | def __init__(self, configs: List[APIConfig]): 42 | super().__init__() 43 | self.func_configs = {config.old_call_signature: config for config in configs} 44 | self.references: Dict[str, List[Tuple[int, int, str]]] = {} 45 | self.tracked_vars: Dict[str, str] = {} 46 | 47 | def leave_Assign(self, original_node: cst.Assign, updated_node: cst.Assign) -> cst.RemovalSentinel: 48 | if len(updated_node.targets) == 1 and isinstance(updated_node.targets[0].target, cst.Name): 49 | var_name = updated_node.targets[0].target.value 50 | value = updated_node.value 51 | if isinstance(value, cst.Call): 52 | call_signature = self._get_full_name(value) 53 | if any(config.old_call_signature.startswith(call_signature) for config in self.func_configs.values()): 54 | self.tracked_vars[var_name] = call_signature 55 | # Remove the assignment since it's being replaced 56 | return cst.RemoveFromParent() 57 | return updated_node 58 | 59 | def leave_Call(self, original_node: cst.Call, updated_node: cst.Call) -> cst.BaseExpression: 60 | call_signature = self._get_full_name(updated_node) 61 | if call_signature in self.func_configs: 62 | config = self.func_configs[call_signature] 63 | self._add_reference(call_signature, original_node, "function call") 64 | return self._create_replacement(config) 65 | return updated_node 66 | 67 | def leave_Attribute(self, original_node: cst.Attribute, updated_node: cst.Attribute) -> cst.BaseExpression: 68 | attr_signature = self._get_full_name(updated_node) 69 | if attr_signature in self.func_configs: 70 | config = self.func_configs[attr_signature] 71 | self._add_reference(attr_signature, original_node, "attribute access") 72 | return self._create_replacement(config) 73 | return updated_node 74 | 75 | def _create_replacement(self, config: APIConfig) -> cst.BaseExpression: 76 | return cst.parse_expression(config.new_call_signature) 77 | 78 | def _get_full_name(self, node: cst.BaseExpression) -> str: 79 | if isinstance(node, cst.Name): 80 | var_name = node.value 81 | if var_name in self.tracked_vars: 82 | return self.tracked_vars[var_name] 83 | else: 84 | return var_name 85 | elif isinstance(node, cst.Attribute): 86 | return f"{self._get_full_name(node.value)}.{node.attr.value}" 87 | elif isinstance(node, cst.Call): 88 | return f"{self._get_full_name(node.func)}()" 89 | else: 90 | return "" 91 | 92 | def _add_reference(self, call_signature: str, node: cst.CSTNode, ref_type: str): 93 | position = self.get_metadata(PositionProvider, node).start 94 | self.references.setdefault(call_signature, []).append((position.line, position.column, ref_type)) 95 | 96 | def replace_api_calls(source_code: str, configs: List[APIConfig]) -> Tuple[str, Dict[str, List[Tuple[int, int, str]]]]: 97 | module = cst.parse_module(source_code) 98 | wrapper = cst.metadata.MetadataWrapper(module) 99 | transformer = APIReplacer(configs) 100 | modified_module = wrapper.visit(transformer) 101 | return modified_module.code, transformer.references 102 | 103 | def bump_ida_complex(source_code: str, configs: List[APIConfig] = parse_config(CONFIG)) -> str: 104 | code, _ = replace_api_calls(source_code, configs) 105 | return code 106 | 107 | def main(): 108 | parser = argparse.ArgumentParser(description="Replace API calls in Python code") 109 | parser.add_argument("file", help="Input Python file") 110 | parser.add_argument("--dryrun", action="store_true", help="Print the updated code without saving it") 111 | args = parser.parse_args() 112 | 113 | configs = parse_config(CONFIG) 114 | with open(args.file, "r") as f: 115 | source_code = f.read() 116 | modified_code, references = replace_api_calls(source_code, configs) 117 | if args.dryrun: 118 | diff = difflib.unified_diff(source_code.splitlines(), modified_code.splitlines(), fromfile=args.file, tofile=f"{args.file} (modified)", lineterm="") 119 | sys.stdout.writelines("\n".join(diff)) 120 | else: 121 | with open(args.file, "w") as f: 122 | f.write(modified_code) 123 | print(f"Updated {args.file}", file=sys.stderr) 124 | 125 | if __name__ == "__main__": 126 | main() 127 | -------------------------------------------------------------------------------- /ida9rewriter/codemods/replace_simple.py: -------------------------------------------------------------------------------- 1 | import os 2 | import sys 3 | from typing import List, Set, Dict, Tuple 4 | 5 | import libcst as cst 6 | from libcst.codemod import CodemodContext, VisitorBasedCodemodCommand 7 | 8 | REPLACEMENTS = { 9 | # ida_struct replacements 10 | "ida_struct.add_struc": "idc.add_struc", 11 | "ida_struct.add_struc_member": "idc.add_struc_member", 12 | "ida_struct.del_struc": "idc.del_struc", 13 | "ida_struct.del_struc_member": "idc.del_struc_member", 14 | "ida_struct.expand_struc": "idc.expand_struc", 15 | "ida_struct.get_member_cmt": "idc.get_member_cmt", 16 | "ida_struct.get_member_id": "idc.get_member_id", 17 | "ida_struct.get_member_name": "idc.get_member_name", 18 | "ida_struct.get_member_size": "idc.get_member_size", 19 | "ida_struct.get_struc_cmt": "idc.get_struc_cmt", 20 | "ida_struct.get_struc_id": "idc.get_struc_id", 21 | "ida_struct.get_struc_name": "idc.get_struc_name", 22 | "ida_struct.get_struc_size": "idc.get_struc_size", 23 | "ida_struct.is_member_id": "idc.is_member_id", 24 | "ida_struct.is_union": "idc.is_union", 25 | "ida_struct.set_member_cmt": "idc.set_member_cmt", 26 | "ida_struct.set_member_name": "idc.set_member_name", 27 | "ida_struct.set_member_type": "idc.set_member_type", 28 | "ida_struct.set_struc_cmt": "idc.set_struc_cmt", 29 | "ida_struct.set_struc_name": "idc.set_struc_name", 30 | # idk (learned from IDArling) 31 | "ida_struct.get_struc": "idc.get_struc", 32 | "ida_struct.get_member_by_name": "idc.get_member_by_name", 33 | "ida_struct.get_member_by_fullname": "idc.get_member_by_fullname", 34 | "ida_struct.retrieve_member_info": "idc.retrieve_member_info", 35 | # ida_enum replacements 36 | "ida_enum.add_enum": "idc.add_enum", 37 | "ida_enum.add_enum_member": "idc.add_enum_member", 38 | "ida_enum.del_enum": "idc.del_enum", 39 | "ida_enum.del_enum_member": "idc.del_enum_member", 40 | "ida_enum.get_bmask_cmt": "idc.get_bmask_cmt", 41 | "ida_enum.get_bmask_name": "idc.get_bmask_name", 42 | "ida_enum.get_enum": "idc.get_enum", 43 | "ida_enum.get_enum_cmt": "idc.get_enum_cmt", 44 | "ida_enum.get_enum_flag": "idc.get_enum_flag", 45 | "ida_enum.get_enum_member": "idc.get_enum_member", 46 | "ida_enum.get_enum_member_bmask": "idc.get_enum_member_bmask", 47 | "ida_enum.get_enum_member_by_name": "idc.get_enum_member_by_name", 48 | "ida_enum.get_enum_member_cmt": "idc.get_enum_member_cmt", 49 | "ida_enum.get_enum_member_enum": "idc.get_enum_member_enum", 50 | "ida_enum.get_enum_member_name": "idc.get_enum_member_name", 51 | "ida_enum.get_enum_member_value": "idc.get_enum_member_value", 52 | "ida_enum.get_enum_name": "idc.get_enum_name", 53 | "ida_enum.get_enum_size": "idc.get_enum_size", 54 | "ida_enum.get_enum_width": "idc.get_enum_width", 55 | "ida_enum.get_first_bmask": "idc.get_first_bmask", 56 | "ida_enum.get_first_enum_member": "idc.get_first_enum_member", 57 | "ida_enum.get_last_bmask": "idc.get_last_bmask", 58 | "ida_enum.get_last_enum_member": "idc.get_last_enum_member", 59 | "ida_enum.get_next_bmask": "idc.get_next_bmask", 60 | "ida_enum.get_next_enum_member": "idc.get_next_enum_member", 61 | "ida_enum.get_prev_bmask": "idc.get_prev_bmask", 62 | "ida_enum.get_prev_enum_member": "idc.get_prev_enum_member", 63 | "ida_enum.is_bf": "idc.is_bf", 64 | "ida_enum.set_bmask_cmt": "idc.set_bmask_cmt", 65 | "ida_enum.set_bmask_name": "idc.set_bmask_name", 66 | "ida_enum.set_enum_bf": "idc.set_enum_bf", 67 | "ida_enum.set_enum_cmt": "idc.set_enum_cmt", 68 | "ida_enum.set_enum_flag": "idc.set_enum_flag", 69 | "ida_enum.set_enum_member_cmt": "idc.set_enum_member_cmt", 70 | "ida_enum.set_enum_member_name": "idc.set_enum_member_name", 71 | "ida_enum.set_enum_name": "idc.set_enum_name", 72 | "ida_enum.set_enum_width": "idc.set_enum_width", 73 | # idk (learned from IDArling) 74 | "ida_enum.get_enum_idx": "idc.get_enum_idx", 75 | "ida_enum.get_enum_member_serial": "idc.get_enum_member_serial", 76 | # other stuff 77 | "ida_bytes.get_octet2": "ida_bytes.get_octet", 78 | "ida_graph.abstract_graph_t": "ida_graph.drawable_graph_t", 79 | "ida_graph.mutable_graph_t": "ida_graph.interactive_graph_t", 80 | "ida_graph.create_mutable_graph": "ida_graph.create_interactive_graph", 81 | "ida_graph.delete_mutable_graph": "ida_graph.delete_interactive_graph", 82 | "ida_graph.grcode_create_mutable_graph": "ida_graph.grcode_create_interactive_graph", 83 | "ida_ua.construct_macro2": "ida_ua.construct_macro", 84 | "idaapi.cvar.inf.is_be": "ida_ida.inf_is_be", 85 | "idaapi.is_align_insn": "ida_ida.is_align_insn", 86 | "idaapi.get_item_head": "idc.get_item_head", 87 | "idaapi.del_items": "idc.del_items", 88 | # diaphora 89 | "idc.get_ordinal_qty": "idaapi.get_ordinal_count", 90 | # 91 | "ida_dirtree.DIRTREE_STRUCTS": "ida_dirtree.DIRTREE_LOCAL_TYPES", 92 | "ida_dirtree.DIRTREE_ENUMS": "ida_dirtree.DIRTREE_LOCAL_TYPES", 93 | "ida_dirtree.DIRTREE_STRUCTS_BOOKMARKS": "ida_dirtree.DIRTREE_LTYPES_BOOKMARKS", 94 | "ida_dirtree.DIRTREE_ENUMS_BOOKMARKS": "ida_dirtree.DIRTREE_LTYPES_BOOKMARKS", 95 | } 96 | 97 | ################################################################################ 98 | class IDAAPIUpdater(VisitorBasedCodemodCommand): 99 | def __init__(self, context: CodemodContext): 100 | super().__init__(context) 101 | self.import_aliases = {} # alias → full module (e.g. "idc") 102 | self.import_from_names = {} # imported name → full module.name 103 | self.glob_imports: Set[str] = set() 104 | self.required_imports: Set[str] = set() 105 | self.existing_imports: Set[str] = set() # Track which modules are already imported 106 | self.used_names: Set[str] = set() # Track all names used in the code 107 | 108 | self.module_functions_used = {} # module → set of functions used 109 | self.module_functions_replaced = {} # module → set of functions replaced 110 | 111 | self.star_imported_funcs_replaced: Dict[str, Set[str]] = {} # module → set of star-imported func names replaced 112 | 113 | def visit_Import(self, node: cst.Import) -> None: 114 | for alias in node.names: 115 | module_name = alias.name.value 116 | asname = alias.asname.name.value if alias.asname else module_name 117 | self.import_aliases[asname] = module_name 118 | self.existing_imports.add(module_name) 119 | 120 | def visit_ImportFrom(self, node: cst.ImportFrom) -> None: 121 | module = "" 122 | if node.module: 123 | # e.g. "from idc import *" or "from idc import add_struc" 124 | module = node.module.value 125 | self.existing_imports.add(module) 126 | 127 | if isinstance(node.names, cst.ImportStar): 128 | self.glob_imports.add(module) 129 | else: 130 | for alias in node.names: 131 | name = alias.name.value 132 | asname = alias.asname.name.value if alias.asname else name 133 | self.import_from_names[asname] = f"{module}.{name}".lstrip(".") 134 | 135 | def visit_Name(self, node: cst.Name) -> None: 136 | self.used_names.add(node.value) 137 | if node.value in self.import_from_names: 138 | full_name = self.import_from_names[node.value] 139 | mod = full_name.split(".", 1)[0] 140 | if mod not in self.module_functions_used: 141 | self.module_functions_used[mod] = set() 142 | self.module_functions_used[mod].add(full_name) 143 | 144 | def leave_Attribute( 145 | self, original_node: cst.Attribute, updated_node: cst.Attribute 146 | ) -> cst.BaseExpression: 147 | full = self._get_full_name(updated_node) 148 | if any( 149 | key.startswith(full + ".") 150 | for key in REPLACEMENTS 151 | if key.split(".", 1)[0] == full.split(".", 1)[0] 152 | ): 153 | return updated_node 154 | 155 | parts = full.split(".") 156 | if len(parts) > 1: 157 | mod = parts[0] 158 | if mod not in self.module_functions_used: 159 | self.module_functions_used[mod] = set() 160 | self.module_functions_used[mod].add(full) 161 | 162 | if full in REPLACEMENTS: 163 | new_full = REPLACEMENTS[full] 164 | mod = new_full.split(".", 1)[0] 165 | self.required_imports.add(mod) 166 | 167 | orig_mod = full.split(".", 1)[0] 168 | if orig_mod not in self.module_functions_replaced: 169 | self.module_functions_replaced[orig_mod] = set() 170 | self.module_functions_replaced[orig_mod].add(full) 171 | 172 | return self._construct_attribute(new_full) 173 | return updated_node 174 | 175 | def leave_Call(self, original_node: cst.Call, updated_node: cst.Call) -> cst.Call: 176 | func_name = None 177 | full = None 178 | 179 | if isinstance(updated_node.func, cst.Attribute): 180 | full = self._get_full_name(updated_node.func) 181 | elif isinstance(updated_node.func, cst.Name): 182 | func_name = updated_node.func.value 183 | self.used_names.add(func_name) 184 | 185 | if func_name in self.import_from_names: 186 | full = self.import_from_names[func_name] 187 | 188 | mod = full.split(".", 1)[0] 189 | if mod not in self.module_functions_used: 190 | self.module_functions_used[mod] = set() 191 | self.module_functions_used[mod].add(full) 192 | else: 193 | for mod in self.glob_imports: 194 | potential_full = f"{mod}.{func_name}" 195 | if potential_full in REPLACEMENTS: 196 | full = potential_full 197 | if mod not in self.star_imported_funcs_replaced: 198 | self.star_imported_funcs_replaced[mod] = set() 199 | self.star_imported_funcs_replaced[mod].add(func_name) 200 | break 201 | 202 | if not full: 203 | full = self.import_aliases.get(func_name, func_name) 204 | 205 | if full and (new_full := REPLACEMENTS.get(full)): 206 | module = new_full.split(".")[0] 207 | self.required_imports.add(module) 208 | 209 | if full: 210 | orig_mod = full.split(".", 1)[0] 211 | if orig_mod not in self.module_functions_replaced: 212 | self.module_functions_replaced[orig_mod] = set() 213 | self.module_functions_replaced[orig_mod].add(full) 214 | 215 | return self._replace_func(updated_node, new_full) 216 | return updated_node 217 | 218 | def leave_Module(self, original_node: cst.Module, updated_node: cst.Module) -> cst.Module: 219 | modules_to_keep = set() 220 | modules_to_remove = set() 221 | 222 | needed_imports = set(self.required_imports) 223 | 224 | for mod in self.module_functions_used: 225 | used_funcs = self.module_functions_used.get(mod, set()) 226 | replaced_funcs = self.module_functions_replaced.get(mod, set()) 227 | 228 | if used_funcs and not used_funcs.issubset(replaced_funcs): 229 | modules_to_keep.add(mod) 230 | elif used_funcs and used_funcs.issubset(replaced_funcs): 231 | modules_to_remove.add(mod) 232 | 233 | for mod in self.glob_imports: 234 | if mod in self.star_imported_funcs_replaced and mod not in modules_to_keep: 235 | modules_to_remove.add(mod) 236 | else: 237 | modules_to_keep.add(mod) 238 | 239 | modules_to_keep.update(needed_imports) 240 | 241 | to_add: List[cst.SimpleStatementLine] = [] 242 | for mod in sorted(needed_imports): 243 | if mod not in self.existing_imports: 244 | imp = cst.Import([cst.ImportAlias(name=cst.Name(mod))]) 245 | to_add.append(cst.SimpleStatementLine([imp])) 246 | 247 | filtered_body = [] 248 | for stmt in updated_node.body: 249 | keep_stmt = True 250 | 251 | if isinstance(stmt, cst.SimpleStatementLine) and len(stmt.body) == 1: 252 | if isinstance(stmt.body[0], cst.Import): 253 | import_stmt = stmt.body[0] 254 | new_names = [] 255 | 256 | for alias in import_stmt.names: 257 | module_name = alias.name.value 258 | if module_name in modules_to_keep: 259 | new_names.append(alias) 260 | elif module_name in modules_to_remove: 261 | continue 262 | else: 263 | new_names.append(alias) 264 | if not new_names: 265 | keep_stmt = False 266 | elif len(new_names) != len(import_stmt.names): 267 | stmt = stmt.with_changes( 268 | body=[import_stmt.with_changes(names=new_names)] 269 | ) 270 | 271 | elif isinstance(stmt.body[0], cst.ImportFrom): 272 | from_import = stmt.body[0] 273 | module_name = from_import.module.value if from_import.module else "" 274 | 275 | if isinstance(from_import.names, cst.ImportStar): 276 | if module_name in modules_to_remove: 277 | keep_stmt = False 278 | else: 279 | if module_name in modules_to_remove: 280 | keep_stmt = False 281 | else: 282 | new_names = [] 283 | for alias in from_import.names: 284 | name = alias.name.value 285 | full_name = f"{module_name}.{name}" 286 | if full_name in REPLACEMENTS: 287 | print(f'{full_name = }, {full_name in REPLACEMENTS}') 288 | continue 289 | else: 290 | new_names.append(alias) 291 | 292 | if not new_names: 293 | keep_stmt = False 294 | elif len(new_names) != len(from_import.names): 295 | stmt = stmt.with_changes( 296 | body=[from_import.with_changes(names=new_names)] 297 | ) 298 | 299 | if keep_stmt: 300 | filtered_body.append(stmt) 301 | 302 | insert_at = 0 303 | if ( 304 | filtered_body 305 | and isinstance(filtered_body[0], cst.SimpleStatementLine) 306 | and isinstance(filtered_body[0].body[0], cst.Expr) 307 | and isinstance(filtered_body[0].body[0].value, cst.SimpleString) 308 | ): 309 | insert_at = 1 310 | 311 | new_body = filtered_body[:insert_at] + to_add + filtered_body[insert_at:] 312 | return updated_node.with_changes(body=new_body) 313 | 314 | def _get_full_name(self, node: cst.Attribute|cst.Name) -> str: 315 | assert isinstance(node, cst.Attribute) or isinstance(node, cst.Name), f"Expected Attribute, got {type(node)} instead" 316 | parts = [] 317 | while isinstance(node, cst.Attribute): 318 | parts.append(node.attr.value) 319 | node = node.value 320 | if isinstance(node, cst.Name): 321 | name = node.value 322 | parts.append(name) 323 | self.used_names.add(name) 324 | else: 325 | return "" 326 | parts.reverse() 327 | first = parts[0] 328 | 329 | if first in self.import_aliases: 330 | resolved = self.import_aliases[first] 331 | parts[0] = resolved 332 | elif first in self.import_from_names: 333 | full_path = self.import_from_names[first] 334 | module_parts = full_path.split(".") 335 | parts[0] = module_parts[0] 336 | if len(module_parts) > 1: 337 | parts.insert(1, module_parts[1]) 338 | 339 | return ".".join(parts) 340 | 341 | @staticmethod 342 | def _construct_attribute(full: str) -> cst.BaseExpression: 343 | parts = full.split(".") 344 | node: cst.BaseExpression = cst.Name(parts[0]) 345 | for attr in parts[1:]: 346 | node = cst.Attribute(value=node, attr=cst.Name(attr)) 347 | return node 348 | 349 | def _replace_func(self, call: cst.Call, full: str) -> cst.Call: 350 | # rebuild the .func 351 | new_func = self._construct_attribute(full) 352 | return call.with_changes(func=new_func) 353 | 354 | 355 | def bump_ida_simple(source_code: str) -> str: 356 | module = cst.parse_module(source_code) 357 | transformer = IDAAPIUpdater(CodemodContext()) 358 | modified = module.visit(transformer) 359 | 360 | code = modified.code 361 | lines = code.splitlines() 362 | 363 | last_import_idx = -1 364 | for i, line in enumerate(lines): 365 | stripped = line.strip() 366 | if stripped.startswith("import ") or stripped.startswith("from "): 367 | last_import_idx = i 368 | 369 | if last_import_idx >= 0 and last_import_idx + 1 < len(lines): 370 | if lines[last_import_idx + 1].strip() != "": 371 | lines.insert(last_import_idx + 1, "") 372 | 373 | trailing_newline = "\n" if code.endswith("\n") else "" 374 | return "\n".join(lines) + trailing_newline 375 | 376 | if __name__ == "__main__": 377 | import argparse 378 | 379 | parser = argparse.ArgumentParser(description="Update IDA API calls in a Python script.") 380 | parser.add_argument("input", type=str, help="Input Python script") 381 | parser.add_argument("--dryrun", action="store_true", help="Print the updated code without saving it") 382 | args = parser.parse_args() 383 | if not os.path.exists(args.input): 384 | print(f"File not found: {args.input}", file=sys.stderr) 385 | exit(1) 386 | 387 | with open(args.input, "r") as f: 388 | old_code = f.read() 389 | updated_code = bump_ida_simple(old_code) 390 | if args.dryrun: 391 | import difflib 392 | 393 | diff = difflib.unified_diff(old_code.splitlines(), updated_code.splitlines(), lineterm="") 394 | print("\n".join(diff)) 395 | else: 396 | with open(args.input, "w") as f: 397 | f.write(updated_code) 398 | print(f"Updated {args.input}") 399 | -------------------------------------------------------------------------------- /pyproject.toml: -------------------------------------------------------------------------------- 1 | [tool.poetry] 2 | name = "ida9rewriter" 3 | version = "0.2.0" 4 | description = "" 5 | authors = ["random <54098069+rand-tech@users.noreply.github.com>"] 6 | readme = "README.md" 7 | 8 | [tool.poetry.scripts] 9 | ida9rewriter = "ida9rewriter.cli:cli" 10 | 11 | [tool.poetry.dependencies] 12 | python = "^3.10" 13 | libcst = "^1.4.0" 14 | tqdm = "^4.66.5" 15 | 16 | 17 | [build-system] 18 | requires = ["poetry-core"] 19 | build-backend = "poetry.core.masonry.api" 20 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | libcst==1.4.0 ; python_version >= "3.10" and python_version < "4.0" 2 | pyyaml==6.0.2 ; python_version >= "3.10" and python_version < "4.0" 3 | -------------------------------------------------------------------------------- /setup.py: -------------------------------------------------------------------------------- 1 | from setuptools import setup, find_packages 2 | 3 | with open("README.md", "r", encoding="utf-8") as fh: 4 | long_description = fh.read() 5 | with open("requirements.txt", "r", encoding="utf-8") as f: 6 | requirements = f.read().splitlines() 7 | 8 | setup( 9 | name="ida9rewriter", 10 | version="0.2.0", 11 | author="rand0m", 12 | author_email="54098069+rand-tech@users.noreply.github.com", 13 | description="A tool to update IDA Python scripts to IDA 9.0+", 14 | long_description=long_description, 15 | long_description_content_type="text/markdown", 16 | url="https://github.com/rand-tech/ida9rewriter", 17 | packages=find_packages(), 18 | classifiers=[ 19 | "Programming Language :: Python :: 3", 20 | "Operating System :: OS Independent", 21 | ], 22 | python_requires=">=3.10", 23 | install_requires=requirements, 24 | entry_points={ 25 | "console_scripts": [ 26 | "ida9rewriter=ida9rewriter.cli:cli", 27 | ], 28 | }, 29 | ) 30 | --------------------------------------------------------------------------------