├── .github └── FUNDING.yml ├── LICENSE ├── README.md └── windbgtocstruct.py /.github/FUNDING.yml: -------------------------------------------------------------------------------- 1 | # These are supported funding model platforms 2 | 3 | github: [therealdreg] 4 | patreon: dreg 5 | custom: ["https://www.paypal.me/therealdreg", "https://www.paypal.me/therealdreg"] 6 | -------------------------------------------------------------------------------- /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 | # windbgtocstruct 2 | Helper Script to convert a Windbg dumped structure (using the 'dt' command) into a C structure. It creates dummy structs for you if needed. 3 | 4 | ``` 5 | windbgtocstruct 6 | https://github.com/therealdreg/windbgtocstruct 7 | GNU General Public License v3.0 8 | - 9 | Mod by David Reguera Garcia aka Dreg 10 | Twitter @therealdreg 11 | https://www.fr33project.org 12 | dreg@fr33project.org 13 | https://github.com/therealdreg 14 | - 15 | Based from Windbg2Struct By Aidan Khoury (dude719) 16 | Twitter @aidankhoury 17 | https://github.com/ajkhoury/Windbg2Struct 18 | ``` 19 | 20 | If you don't need all the sub/structures defined in your headers, use this project (**Python3**) 21 | 22 | ## Example of Use 23 | 24 | Get the size of an struct executing: **?? sizeof(_PEB)** on Windbg: 25 | ``` 26 | ?? sizeof(_PEB) 27 | unsigned int 0x400 28 | ``` 29 | 30 | Execute **dt _PEB** on Windbg: 31 | ``` 32 | dt nt!_PEB 33 | +0x000 InheritedAddressSpace : UChar 34 | +0x001 ReadImageFileExecOptions : UChar 35 | +0x002 BeingDebugged : UChar 36 | +0x003 BitField : UChar 37 | +0x003 ImageUsesLargePages : Pos 0, 1 Bit 38 | +0x003 IsProtectedProcess : Pos 1, 1 Bit 39 | +0x003 IsImageDynamicallyRelocated : Pos 2, 1 Bit 40 | +0x003 SkipPatchingUser32Forwarders : Pos 3, 1 Bit 41 | +0x003 IsPackagedProcess : Pos 4, 1 Bit 42 | +0x003 IsAppContainer : Pos 5, 1 Bit 43 | +0x003 IsProtectedProcessLight : Pos 6, 1 Bit 44 | +0x003 SpareBits : Pos 7, 1 Bit 45 | +0x004 Padding0 : [4] UChar 46 | +0x008 Mutant : Ptr64 Void 47 | +0x010 ImageBaseAddress : Ptr64 Void 48 | +0x018 Ldr : Ptr64 _PEB_LDR_DATA 49 | +0x020 ProcessParameters : Ptr64 _RTL_USER_PROCESS_PARAMETERS 50 | +0x028 SubSystemData : Ptr64 Void 51 | +0x030 ProcessHeap : Ptr64 Void 52 | +0x038 FastPebLock : Ptr64 _RTL_CRITICAL_SECTION 53 | +0x040 AtlThunkSListPtr : Ptr64 Void 54 | +0x048 IFEOKey : Ptr64 Void 55 | +0x050 CrossProcessFlags : Uint4B 56 | +0x050 ProcessInJob : Pos 0, 1 Bit 57 | +0x050 ProcessInitializing : Pos 1, 1 Bit 58 | +0x050 ProcessUsingVEH : Pos 2, 1 Bit 59 | +0x050 ProcessUsingVCH : Pos 3, 1 Bit 60 | +0x050 ProcessUsingFTH : Pos 4, 1 Bit 61 | +0x050 ReservedBits0 : Pos 5, 27 Bits 62 | +0x054 Padding1 : [4] UChar 63 | +0x058 KernelCallbackTable : Ptr64 Void 64 | +0x058 UserSharedInfoPtr : Ptr64 Void 65 | +0x060 SystemReserved : [1] Uint4B 66 | +0x064 AtlThunkSListPtr32 : Uint4B 67 | +0x068 ApiSetMap : Ptr64 Void 68 | +0x070 TlsExpansionCounter : Uint4B 69 | +0x074 Padding2 : [4] UChar 70 | +0x078 TlsBitmap : Ptr64 Void 71 | +0x080 TlsBitmapBits : [2] Uint4B 72 | +0x088 ReadOnlySharedMemoryBase : Ptr64 Void 73 | +0x090 SparePvoid0 : Ptr64 Void 74 | +0x098 ReadOnlyStaticServerData : Ptr64 Ptr64 Void 75 | +0x0a0 AnsiCodePageData : Ptr64 Void 76 | +0x0a8 OemCodePageData : Ptr64 Void 77 | +0x0b0 UnicodeCaseTableData : Ptr64 Void 78 | +0x0b8 NumberOfProcessors : Uint4B 79 | +0x0bc NtGlobalFlag : Uint4B 80 | +0x0c0 CriticalSectionTimeout : _LARGE_INTEGER 81 | +0x0c8 HeapSegmentReserve : Uint8B 82 | +0x0d0 HeapSegmentCommit : Uint8B 83 | +0x0d8 HeapDeCommitTotalFreeThreshold : Uint8B 84 | +0x0e0 HeapDeCommitFreeBlockThreshold : Uint8B 85 | +0x0e8 NumberOfHeaps : Uint4B 86 | +0x0ec MaximumNumberOfHeaps : Uint4B 87 | +0x0f0 ProcessHeaps : Ptr64 Ptr64 Void 88 | +0x0f8 GdiSharedHandleTable : Ptr64 Void 89 | +0x100 ProcessStarterHelper : Ptr64 Void 90 | +0x108 GdiDCAttributeList : Uint4B 91 | +0x10c Padding3 : [4] UChar 92 | +0x110 LoaderLock : Ptr64 _RTL_CRITICAL_SECTION 93 | +0x118 OSMajorVersion : Uint4B 94 | +0x11c OSMinorVersion : Uint4B 95 | +0x120 OSBuildNumber : Uint2B 96 | +0x122 OSCSDVersion : Uint2B 97 | +0x124 OSPlatformId : Uint4B 98 | +0x128 ImageSubsystem : Uint4B 99 | +0x12c ImageSubsystemMajorVersion : Uint4B 100 | +0x130 ImageSubsystemMinorVersion : Uint4B 101 | +0x134 Padding4 : [4] UChar 102 | +0x138 ActiveProcessAffinityMask : Uint8B 103 | +0x140 GdiHandleBuffer : [60] Uint4B 104 | +0x230 PostProcessInitRoutine : Ptr64 void 105 | +0x238 TlsExpansionBitmap : Ptr64 Void 106 | +0x240 TlsExpansionBitmapBits : [32] Uint4B 107 | +0x2c0 SessionId : Uint4B 108 | +0x2c4 Padding5 : [4] UChar 109 | +0x2c8 AppCompatFlags : _ULARGE_INTEGER 110 | +0x2d0 AppCompatFlagsUser : _ULARGE_INTEGER 111 | +0x2d8 pShimData : Ptr64 Void 112 | +0x2e0 AppCompatInfo : Ptr64 Void 113 | +0x2e8 CSDVersion : _UNICODE_STRING 114 | +0x2f8 ActivationContextData : Ptr64 _ACTIVATION_CONTEXT_DATA 115 | +0x300 ProcessAssemblyStorageMap : Ptr64 _ASSEMBLY_STORAGE_MAP 116 | +0x308 SystemDefaultActivationContextData : Ptr64 _ACTIVATION_CONTEXT_DATA 117 | +0x310 SystemAssemblyStorageMap : Ptr64 _ASSEMBLY_STORAGE_MAP 118 | +0x318 MinimumStackCommit : Uint8B 119 | +0x320 FlsCallback : Ptr64 _FLS_CALLBACK_INFO 120 | +0x328 FlsListHead : _LIST_ENTRY 121 | +0x338 FlsBitmap : Ptr64 Void 122 | +0x340 FlsBitmapBits : [4] Uint4B 123 | +0x350 FlsHighIndex : Uint4B 124 | +0x358 WerRegistrationData : Ptr64 Void 125 | +0x360 WerShipAssertPtr : Ptr64 Void 126 | +0x368 pUnused : Ptr64 Void 127 | +0x370 pImageHeaderHash : Ptr64 Void 128 | +0x378 TracingFlags : Uint4B 129 | +0x378 HeapTracingEnabled : Pos 0, 1 Bit 130 | +0x378 CritSecTracingEnabled : Pos 1, 1 Bit 131 | +0x378 LibLoaderTracingEnabled : Pos 2, 1 Bit 132 | +0x378 SpareTracingBits : Pos 3, 29 Bits 133 | +0x37c Padding6 : [4] UChar 134 | +0x380 CsrServerReadOnlySharedMemoryBase : Uint8B 135 | +0x388 TppWorkerpListLock : Uint8B 136 | +0x390 TppWorkerpList : _LIST_ENTRY 137 | ``` 138 | 139 | Execute **python windbgtocstruct.py SIZE_OF_STRUCT** 140 | ``` 141 | python windbgtocstruct.py 0x400 142 | ``` 143 | 144 | Paste **Windbg dt output** and press enter two times 145 | 146 | Done! this should be the C code generated: 147 | ``` 148 | #include 149 | #pragma pack(push) 150 | #pragma pack(1) 151 | 152 | #define SIZEOF__PEB 0x400 153 | 154 | typedef struct _PEB 155 | { 156 | UCHAR InheritedAddressSpace; // 0x0 157 | UCHAR ReadImageFileExecOptions; // 0x1 158 | UCHAR BeingDebugged; // 0x2 159 | union aNoN_1 160 | { 161 | UCHAR BitField; // 0x3 162 | struct aNoN_2 163 | { 164 | UCHAR ImageUsesLargePages : 1; // 0x3 165 | UCHAR IsProtectedProcess : 1; // 0x3 166 | UCHAR IsImageDynamicallyRelocated : 1; // 0x3 167 | UCHAR SkipPatchingUser32Forwarders : 1; // 0x3 168 | UCHAR IsPackagedProcess : 1; // 0x3 169 | UCHAR IsAppContainer : 1; // 0x3 170 | UCHAR IsProtectedProcessLight : 1; // 0x3 171 | UCHAR SpareBits : 1; // 0x3 172 | } aNoN_3; 173 | } aNoN_4; 174 | UCHAR Padding0[4]; // 0x4 175 | PVOID Mutant; // 0x8 176 | PVOID ImageBaseAddress; // 0x10 177 | struct _PEB_LDR_DATA* Ldr; // 0x18 178 | struct _RTL_USER_PROCESS_PARAMETERS* ProcessParameters; // 0x20 179 | PVOID SubSystemData; // 0x28 180 | PVOID ProcessHeap; // 0x30 181 | struct _RTL_CRITICAL_SECTION* FastPebLock; // 0x38 182 | PVOID AtlThunkSListPtr; // 0x40 183 | PVOID IFEOKey; // 0x48 184 | union aNoN_6 185 | { 186 | ULONG CrossProcessFlags; // 0x50 187 | struct aNoN_7 188 | { 189 | ULONG ProcessInJob : 1; // 0x50 190 | ULONG ProcessInitializing : 1; // 0x50 191 | ULONG ProcessUsingVEH : 1; // 0x50 192 | ULONG ProcessUsingVCH : 1; // 0x50 193 | ULONG ProcessUsingFTH : 1; // 0x50 194 | ULONG ReservedBits0 : 27; // 0x50 195 | } aNoN_8; 196 | } aNoN_9; 197 | UCHAR Padding1[4]; // 0x54 198 | PVOID KernelCallbackTable; // 0x58 199 | PVOID UserSharedInfoPtr; // 0x58 200 | ULONG SystemReserved[1]; // 0x60 201 | ULONG AtlThunkSListPtr32; // 0x64 202 | PVOID ApiSetMap; // 0x68 203 | ULONG TlsExpansionCounter; // 0x70 204 | UCHAR Padding2[4]; // 0x74 205 | PVOID TlsBitmap; // 0x78 206 | ULONG TlsBitmapBits[2]; // 0x80 207 | PVOID ReadOnlySharedMemoryBase; // 0x88 208 | PVOID SparePvoid0; // 0x90 209 | PVOID* ReadOnlyStaticServerData; // 0x98 210 | PVOID AnsiCodePageData; // 0xA0 211 | PVOID OemCodePageData; // 0xA8 212 | PVOID UnicodeCaseTableData; // 0xB0 213 | ULONG NumberOfProcessors; // 0xB8 214 | ULONG NtGlobalFlag; // 0xBC 215 | struct _LARGE_INTEGER CriticalSectionTimeout; // 0xC0 216 | ULONG64 HeapSegmentReserve; // 0xC8 217 | ULONG64 HeapSegmentCommit; // 0xD0 218 | ULONG64 HeapDeCommitTotalFreeThreshold; // 0xD8 219 | ULONG64 HeapDeCommitFreeBlockThreshold; // 0xE0 220 | ULONG NumberOfHeaps; // 0xE8 221 | ULONG MaximumNumberOfHeaps; // 0xEC 222 | PVOID* ProcessHeaps; // 0xF0 223 | PVOID GdiSharedHandleTable; // 0xF8 224 | PVOID ProcessStarterHelper; // 0x100 225 | ULONG GdiDCAttributeList; // 0x108 226 | UCHAR Padding3[4]; // 0x10C 227 | struct _RTL_CRITICAL_SECTION* LoaderLock; // 0x110 228 | ULONG OSMajorVersion; // 0x118 229 | ULONG OSMinorVersion; // 0x11C 230 | USHORT OSBuildNumber; // 0x120 231 | USHORT OSCSDVersion; // 0x122 232 | ULONG OSPlatformId; // 0x124 233 | ULONG ImageSubsystem; // 0x128 234 | ULONG ImageSubsystemMajorVersion; // 0x12C 235 | ULONG ImageSubsystemMinorVersion; // 0x130 236 | UCHAR Padding4[4]; // 0x134 237 | ULONG64 ActiveProcessAffinityMask; // 0x138 238 | ULONG GdiHandleBuffer[60]; // 0x140 239 | void* PostProcessInitRoutine; // 0x230 240 | PVOID TlsExpansionBitmap; // 0x238 241 | ULONG TlsExpansionBitmapBits[32]; // 0x240 242 | ULONG SessionId; // 0x2C0 243 | UCHAR Padding5[4]; // 0x2C4 244 | struct _ULARGE_INTEGER AppCompatFlags; // 0x2C8 245 | struct _ULARGE_INTEGER AppCompatFlagsUser; // 0x2D0 246 | PVOID pShimData; // 0x2D8 247 | PVOID AppCompatInfo; // 0x2E0 248 | struct _UNICODE_STRING CSDVersion; // 0x2E8 249 | struct _ACTIVATION_CONTEXT_DATA* ActivationContextData; // 0x2F8 250 | struct _ASSEMBLY_STORAGE_MAP* ProcessAssemblyStorageMap; // 0x300 251 | struct _ACTIVATION_CONTEXT_DATA* SystemDefaultActivationContextData; // 0x308 252 | struct _ASSEMBLY_STORAGE_MAP* SystemAssemblyStorageMap; // 0x310 253 | ULONG64 MinimumStackCommit; // 0x318 254 | struct _FLS_CALLBACK_INFO* FlsCallback; // 0x320 255 | struct _LIST_ENTRY FlsListHead; // 0x328 256 | PVOID FlsBitmap; // 0x338 257 | ULONG FlsBitmapBits[4]; // 0x340 258 | ULONG FlsHighIndex; // 0x350 259 | PVOID WerRegistrationData; // 0x358 260 | PVOID WerShipAssertPtr; // 0x360 261 | PVOID pUnused; // 0x368 262 | PVOID pImageHeaderHash; // 0x370 263 | union aNoN_11 264 | { 265 | ULONG TracingFlags; // 0x378 266 | struct aNoN_12 267 | { 268 | ULONG HeapTracingEnabled : 1; // 0x378 269 | ULONG CritSecTracingEnabled : 1; // 0x378 270 | ULONG LibLoaderTracingEnabled : 1; // 0x378 271 | ULONG SpareTracingBits : 29; // 0x378 272 | } aNoN_13; 273 | } aNoN_14; 274 | UCHAR Padding6[4]; // 0x37C 275 | ULONG64 CsrServerReadOnlySharedMemoryBase; // 0x380 276 | ULONG64 TppWorkerpListLock; // 0x388 277 | struct _LIST_ENTRY TppWorkerpList; // 0x390 278 | } PEB, *PPEB; 279 | 280 | // Dummy structs: 281 | struct _PEB_LDR_DATA 282 | { 283 | UCHAR data[1]; 284 | }; 285 | 286 | struct _RTL_USER_PROCESS_PARAMETERS 287 | { 288 | UCHAR data[1]; 289 | }; 290 | 291 | struct _RTL_CRITICAL_SECTION 292 | { 293 | UCHAR data[1]; 294 | }; 295 | 296 | struct _LARGE_INTEGER 297 | { 298 | UCHAR data[8]; 299 | }; 300 | 301 | struct _ULARGE_INTEGER 302 | { 303 | UCHAR data[8]; 304 | }; 305 | 306 | struct _UNICODE_STRING 307 | { 308 | UCHAR data[16]; 309 | }; 310 | 311 | struct _ACTIVATION_CONTEXT_DATA 312 | { 313 | UCHAR data[1]; 314 | }; 315 | 316 | struct _ASSEMBLY_STORAGE_MAP 317 | { 318 | UCHAR data[1]; 319 | }; 320 | 321 | struct _FLS_CALLBACK_INFO 322 | { 323 | UCHAR data[1]; 324 | }; 325 | 326 | struct _LIST_ENTRY 327 | { 328 | UCHAR data[16]; 329 | }; 330 | 331 | 332 | #pragma pack(pop) 333 | ``` 334 | 335 | Copy C code to your project and remove already defined dummy structs. 336 | 337 | **WARNING:** Dont use sizeof(STRUCT), because the last member of the struct can be non-completed. Use **SIZEOF__PEB** generated by the script 338 | 339 | Example: 340 | ``` 341 | PPEB peb_ptr = malloc(SIZEOF__PEB); 342 | .... 343 | ExternalApiUsingPEB(arg1, arg2, ..., SIZEOF__PEB, peb_ptr, ...); 344 | ``` 345 | 346 | ## TODO 347 | 348 | * Still not able to properly handle nested unions and structs. 349 | 350 | ## Related 351 | 352 | * https://github.com/ajkhoury/Windbg2Struct 353 | 354 | * https://github.com/markhc/windbg_to_c -------------------------------------------------------------------------------- /windbgtocstruct.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | PRJVER = "1.0" 4 | 5 | # Helper script for Windows kernel debugging with IDA Pro on native Bochs debugger 6 | # https://github.com/therealdreg/windbgtocstruct 7 | # GNU General Public License v3.0 8 | # 9 | # By Aidan Khoury (dude719) 10 | # Twitter @aidankhoury 11 | # https://github.com/ajkhoury/Windbg2Struct 12 | # 13 | # Mod by David Reguera Garcia aka Dreg 14 | # Twitter @therealdreg 15 | # https://www.fr33project.org 16 | # dreg@fr33project.org 17 | # https://github.com/therealdreg 18 | # 19 | # 2022/10/07 by Dreg 20 | # - project renamed to windbgtocstruct.py 21 | # - ported to python3 22 | # - code style fixed using black (python -m black windbgtocstruct.py) 23 | # - added changelog 24 | # - added some prints 25 | # - comestic changes (new header...) 26 | # - added python3 shebang 27 | # - fixed bugs 28 | # - Dummy structs 29 | # - pragma packs 30 | # - sizeof support 31 | # - included input as C comment 32 | # - Convert anonymous unions/struct to a named version. ISO C90 doesn’t support unnamed structs/unions. 33 | # 34 | # WARNING: BULLSHIT CODE x) 35 | # 36 | 37 | import sys 38 | 39 | SIZEST = "0" 40 | 41 | def printf(format, *args): 42 | sys.stdout.write(format % args) 43 | 44 | 45 | key_types = { 46 | "UChar": "UCHAR", 47 | "Char": "CHAR", 48 | "Wchar": "WCHAR", 49 | "Uint2B": "USHORT", 50 | "Uint4B": "ULONG", 51 | "Uint8B": "ULONG64", 52 | "Int2B": "SHORT", 53 | "Int4B": "LONG", 54 | "Int8B": "LONG64", 55 | "Void": "VOID", 56 | } 57 | 58 | 59 | def get_input(prompt): 60 | print(prompt) 61 | lines = [] 62 | line = input() 63 | while line != "": 64 | line = line.replace("\t", "") 65 | lines.append(line) 66 | line = input() 67 | lines = "".join(lines) 68 | return lines 69 | 70 | 71 | def get_struct_name(dt_dump): 72 | exclamation_idx = dt_dump.index("!") 73 | first_addition_idx = dt_dump.index("+") 74 | structname = dt_dump[exclamation_idx + 1 : first_addition_idx] 75 | return structname.strip() 76 | 77 | 78 | def get_fields(dt_dump): 79 | """Returns generated field list""" 80 | field_list = [] 81 | 82 | first_addition_idx = dt_dump.index("+") 83 | s = dt_dump[first_addition_idx + 1 :] 84 | s = s.split("+") 85 | 86 | for field in s: 87 | current_field = { 88 | "name": "", 89 | "type": "", 90 | "pointer": 0, 91 | "offset": -1, 92 | "size": 0, 93 | "array_sizes": [], 94 | "union": False, 95 | "bit_pos": -1, 96 | } 97 | 98 | offset_end_idx = field.index(" ") 99 | current_field["offset"] = int(field[:offset_end_idx], 16) 100 | 101 | field = field[offset_end_idx + 1 :] 102 | name, dtype = field.split(":") 103 | # strip leading and trailing whitespace 104 | name = name.strip() 105 | dtype = dtype.strip() 106 | 107 | current_field["name"] = name 108 | 109 | # Bitfield type 110 | if "Pos " in dtype: 111 | dtype = dtype.strip(" ") 112 | pos, bit = dtype.split(",") 113 | current_field["bit_pos"] = int(pos[3:]) 114 | current_field["size"] = int(bit[: bit.index("B")]) 115 | 116 | # Array field type 117 | elif "[" in dtype: 118 | dtlist = dtype.split(" ") 119 | for dt in dtlist: 120 | if "[" in dt: 121 | arr = dt.strip("[]") # drop the brackets 122 | current_field["array_sizes"].append(int(arr)) 123 | elif "Ptr64" in dt: 124 | current_field["pointer"] += 1 125 | elif "Ptr32" in dt: 126 | current_field["pointer"] += 1 127 | else: 128 | current_field["type"] = dt 129 | 130 | # Pointer field type 131 | elif "Ptr64" or "Ptr32" in dtype: 132 | dtlist = dtype.split(" ") 133 | for dt in dtlist: 134 | if "Ptr64" in dt: 135 | current_field["pointer"] += 1 136 | else: 137 | current_field["type"] = dt 138 | 139 | # Regular field type 140 | else: 141 | current_field["type"] = dtype 142 | 143 | # Finalize data for the previous field 144 | if len(field_list) > 0: 145 | if field_list[-1]["bit_pos"] == -1 and current_field["bit_pos"] == -1: 146 | # Calculate the previous field's size by subtracting the 147 | # current offset from the previous offset 148 | field_list[-1]["size"] = ( 149 | current_field["offset"] - field_list[-1]["offset"] 150 | ) 151 | # print(field_list[-1]['size']) 152 | # check if the previous or current field is a union 153 | elif ( 154 | field_list[-1]["bit_pos"] != -1 155 | and current_field["bit_pos"] == -1 156 | and field_list[-1]["offset"] == current_field["offset"] 157 | ): 158 | current_field["union"] = True 159 | elif ( 160 | field_list[-1]["bit_pos"] == -1 161 | and field_list[-1]["offset"] == current_field["offset"] 162 | ): 163 | field_list[-1]["union"] = True 164 | 165 | # Append the field to the list 166 | field_list.append(current_field) 167 | 168 | return field_list 169 | 170 | 171 | #def union_size(union_field): 172 | # total = 0 173 | # for field in fields: 174 | # if field["union"] == False and field["offset"] == union_field["offset"]: 175 | # total = total + field["size"] 176 | # return total 177 | 178 | 179 | def find_union_header(fields, union_field): 180 | for field in fields: 181 | if field["union"] == True and field["offset"] == union_field["offset"]: 182 | return field 183 | return 0 184 | 185 | 186 | def print_bitfield(bit_field, bit_field_type): 187 | printf( 188 | "\t%s %s : %d; // 0x%X\n", 189 | bit_field_type, 190 | bit_field["name"], 191 | bit_field["size"], 192 | bit_field["offset"], 193 | ) 194 | 195 | LAST_ANON_NR = 0 196 | def print_union(fields, union_field): 197 | global LAST_ANON_NR 198 | LAST_ANON_NR= LAST_ANON_NR + 1 199 | completed_fields = [] 200 | union_header = find_union_header(fields, union_field) 201 | if union_header != 0: 202 | printf("\tunion " + "aNoN_" + str(LAST_ANON_NR) + "\n\t{\n") 203 | LAST_ANON_NR= LAST_ANON_NR + 1 204 | if union_header["type"] in key_types: 205 | if union_header["pointer"] > 0: 206 | printf("\t\tP%s", key_types[union_header["type"]]) 207 | for _ in range(union_header["pointer"] - 1): 208 | printf("*") 209 | printf(" %s; // 0x%X\n", union_header["name"], union_header["offset"]) 210 | else: 211 | printf( 212 | "\t\t%s %s; // 0x%X\n", 213 | key_types[union_header["type"]], 214 | union_header["name"], 215 | union_header["offset"], 216 | ) 217 | else: 218 | if union_header["pointer"] > 0: 219 | printf("\t\t%s", union_header["type"]) 220 | for _ in range(union_header["pointer"]): 221 | printf("*") 222 | printf(" %s; // 0x%X\n", union_header["name"], union_header["offset"]) 223 | else: 224 | printf( 225 | "\t\t%s %s; // 0x%X\n", 226 | union_header["type"], 227 | union_header["name"], 228 | union_header["offset"], 229 | ) 230 | printf("\t\tstruct " + "aNoN_" + str(LAST_ANON_NR) + "\n\t\t{\n") 231 | LAST_ANON_NR= LAST_ANON_NR + 1 232 | for field in fields: 233 | if ( 234 | field["union"] == False 235 | and field["bit_pos"] != -1 236 | and field["offset"] == union_header["offset"] 237 | ): 238 | printf("\t\t") 239 | if union_header["type"] in key_types: 240 | print_bitfield(field, key_types[union_header["type"]]) 241 | else: 242 | print_bitfield(field, union_header["type"]) 243 | completed_fields.append(field) 244 | printf("\t\t} " + "aNoN_" + str(LAST_ANON_NR) + ";\n\t}") 245 | LAST_ANON_NR= LAST_ANON_NR + 1 246 | printf(" " + "aNoN_" + str(LAST_ANON_NR) + ";\n") 247 | LAST_ANON_NR= LAST_ANON_NR + 1 248 | else: 249 | printf("\tstruct " + "aNoN_" + str(LAST_ANON_NR) + "\n\t{\n") 250 | bit_field_type = "ULONG" 251 | bit_fields_sum = 0 252 | bit_fields = [] 253 | for field in fields: 254 | if field["bit_pos"] != -1 and field["offset"] == union_field["offset"]: 255 | bit_fields.append(field) 256 | bit_fields_sum += field["size"] 257 | completed_fields.append(field) 258 | # Get type based on sum of bits 259 | if bit_fields_sum > 32: 260 | bit_field_type = "ULONGLONG" 261 | elif bit_fields_sum > 16: 262 | bit_field_type = "ULONG" 263 | elif bit_fields_sum > 8: 264 | bit_field_type = "USHORT" 265 | else: 266 | bit_field_type = "UCHAR" 267 | # Dump the bitfields 268 | for bit_field in bit_fields: 269 | printf("\t") 270 | print_bitfield(bit_field, bit_field_type) 271 | printf("\t} " + "aNoN_" + str(LAST_ANON_NR) + ";\n") 272 | LAST_ANON_NR= LAST_ANON_NR + 1 273 | return completed_fields 274 | 275 | 276 | def generate_struct(dt_dump): 277 | # Main structure genertation method 278 | struct_name = get_struct_name(dt_dump) 279 | fields = get_fields(dt_dump) 280 | union_fields_completed = [] 281 | 282 | print(''' 283 | #include 284 | #pragma pack(push) 285 | #pragma pack(1) 286 | ''') 287 | 288 | print("#define SIZEOF_" + struct_name + " " + SIZEST + "\n") 289 | 290 | printf("typedef struct %s\n{\n", struct_name) 291 | 292 | # Need to use this eventually for nested structs maybe. 293 | # Would be better to create struct list in the get_fields function 294 | previous_field = None 295 | dummy_structs = [] 296 | next_index = 0 297 | drgdict = {} 298 | for field in fields: 299 | next_index = next_index + 1 300 | # print out the type 301 | if field["bit_pos"] != -1: 302 | if not any( 303 | union_field["offset"] == field["offset"] 304 | for union_field in union_fields_completed 305 | ): 306 | union_fields_completed.extend(print_union(fields, field)) 307 | elif field["union"] == True: 308 | # skip as its handled in print_union 309 | continue 310 | else: 311 | if field["type"] in key_types: 312 | if field["pointer"] > 0: 313 | printf("\tP%s", key_types[field["type"]]) 314 | for _ in range(field["pointer"] - 1): 315 | printf("*") 316 | else: 317 | printf("\t%s", key_types[field["type"]]) 318 | else: 319 | if field["type"][0] == "_": 320 | printf("\tstruct %s", field["type"]) 321 | if field["pointer"] > 0: 322 | size_ar = "1" 323 | else: 324 | try: 325 | size_ar = str(fields[next_index]["offset"] - field["offset"]) 326 | except IndexError: 327 | size_ar = "1" 328 | if field["type"] not in drgdict: 329 | dummy_structs.append("struct " + field["type"] + "\n" + "{\n" + "\tUCHAR data[" + size_ar + "];" + "\n};\n") 330 | drgdict[field["type"]] = 1 331 | else: 332 | printf("\t%s", field["type"]) 333 | if field["pointer"] > 0: 334 | for _ in range(field["pointer"]): 335 | printf("*") 336 | 337 | printf(" %s", field["name"]) 338 | if field["array_sizes"]: 339 | for arr_size in field["array_sizes"]: 340 | printf("[%d]", arr_size) 341 | printf("; // 0x%X\n", field["offset"]) 342 | 343 | # To be used eventually for nested structs (maybe) 344 | previous_field = field 345 | 346 | struct_name = struct_name[1:] 347 | printf("} %s, *P%s;\n", struct_name, struct_name) 348 | 349 | if len(dummy_structs): 350 | print("\n// Dummy structs:") 351 | for dummy_struct in dummy_structs: 352 | print(dummy_struct) 353 | 354 | print(''' 355 | #pragma pack(pop) 356 | ''') 357 | 358 | 359 | def main(): 360 | global SIZEST 361 | global PRJVER 362 | 363 | print("version: " + PRJVER) 364 | 365 | print( 366 | """ 367 | windbgtocstruct 368 | https://github.com/therealdreg/windbgtocstruct 369 | GNU General Public License v3.0 370 | - 371 | Mod by David Reguera Garcia aka Dreg 372 | Twitter @therealdreg 373 | https://www.fr33project.org 374 | dreg@fr33project.org 375 | https://github.com/therealdreg 376 | - 377 | Based from Windbg2Struct By Aidan Khoury (dude719) 378 | Twitter @aidankhoury 379 | https://github.com/ajkhoury/Windbg2Struct 380 | """ 381 | ) 382 | 383 | if len(sys.argv) > 1: 384 | SIZEST = sys.argv[1] 385 | 386 | print("/*") 387 | dt_dump = get_input("Enter dumped WinDbg data-type: ") 388 | print("*/") 389 | if dt_dump: 390 | generate_struct(dt_dump) 391 | else: 392 | print("Error: invalid input") 393 | return 394 | 395 | 396 | if __name__ == "__main__": 397 | main() 398 | --------------------------------------------------------------------------------