├── Makefile ├── README ├── gpl-3.0.txt ├── libntldd.c ├── libntldd.h ├── makeldd.cmd ├── makeldd.sh └── ntldd.c /Makefile: -------------------------------------------------------------------------------- 1 | 2 | CC=/usr/bin/x86_64-w64-mingw32-gcc 3 | AR=/usr/bin/x86_64-w64-mingw32-ar 4 | RM=rm 5 | CFLAGS= -fno-common -g -O3 -Wall -D__USE_MINGW_ANSI_STDIO=1 -D_WIN32_WINNT=0x501 6 | LDFLAGS=$(CFLAGS) -L. -lntldd -limagehlp 7 | 8 | all: ntldd.exe 9 | 10 | %.o: %.c 11 | $(CC) -c $(CFLAGS) $< -o $@ 12 | 13 | %.a: %.o 14 | $(AR) rs $@ $< 15 | 16 | ntldd.exe: ntldd.o libntldd.a 17 | $(CC) $< $(LDFLAGS) -o $@ 18 | 19 | clean: 20 | $(RM) *.o *.a *.exe 21 | -------------------------------------------------------------------------------- /README: -------------------------------------------------------------------------------- 1 | This small utility will do the one thing that most people want from ldd - it 2 | will give you a list of libraries a library or executable depends upon. 3 | 4 | Pros: 5 | * Knows about delayed loading. 6 | * Can list dependencies recursively (like depends.exe does, but without 7 | duplicating entries) 8 | * Free software 9 | * Output tries to mimic ldd (might be usable as a drop-in replacement for ldd) 10 | 11 | Cons: 12 | * Is likely buggy and might fail spectacularly on uncommon PE files 13 | (especially created by toolsets other than MSVC or GCC) 14 | * Might not work on Windows CE or in relatively uncommon environments 15 | * Does not have any advanced features of ldd (most options do not work) 16 | * Does not mimic ldd completely 17 | 18 | Run makeldd.cmd to compile. Requires GCC and win32api MinGW packages. -------------------------------------------------------------------------------- /gpl-3.0.txt: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /libntldd.c: -------------------------------------------------------------------------------- 1 | /* 2 | libntldd - builds a dependency tree of a module, with symbols 3 | 4 | Copyright (C) 2010 LRN 5 | 6 | This program is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with this program. If not, see . 18 | */ 19 | 20 | /* 21 | Code is mostly written after 22 | "An In-Depth Look into the Win32 Portable Executable File Format" 23 | MSDN Magazine articles 24 | */ 25 | 26 | #include 27 | 28 | #include 29 | 30 | #include 31 | 32 | #include 33 | #include 34 | #include 35 | 36 | #include "libntldd.h" 37 | 38 | typedef struct _soff_entry soff_entry; 39 | 40 | struct _soff_entry 41 | { 42 | DWORD start; 43 | DWORD end; 44 | void *off; 45 | }; 46 | 47 | void *MapPointer (soff_entry *soffs, int soffs_len, DWORD in_ptr, int *section) 48 | { 49 | int i; 50 | for (i = 0; i < soffs_len; i++) 51 | if (soffs[i].start <= in_ptr && soffs[i].end >= in_ptr) 52 | { 53 | if (section != NULL) 54 | *section = i; 55 | if (soffs[i].off) 56 | return soffs[i].off + in_ptr; 57 | } 58 | return NULL; 59 | } 60 | 61 | /* 62 | int FindSectionID (IMAGE_OPTIONAL_HEADER *oh, DWORD address, DWORD size) 63 | { 64 | int i; 65 | for (i = 0; i < oh->NumberOfRvaAndSizes; i++) 66 | { 67 | if (oh->DataDirectory[i].VirtualAddress == address && 68 | oh->DataDirectory[i].Size == size) 69 | return i; 70 | } 71 | return -1; 72 | } 73 | */ 74 | 75 | int FindSectionByRawData (LOADED_IMAGE *img, DWORD address) 76 | { 77 | ULONG i; 78 | for (i = 0; i < img->NumberOfSections; i++) 79 | { 80 | DWORD start = img->Sections[i].VirtualAddress; 81 | DWORD end = start + img->Sections[i].SizeOfRawData; 82 | if (address >= start && address < end) 83 | return i; 84 | } 85 | return -1; 86 | } 87 | 88 | void ResizeArray (void **data, uint64_t *data_size, size_t sizeof_data) 89 | { 90 | uint64_t new_size = (*data_size) > 0 ? (*data_size) * 2 : 64; 91 | void *new_data; 92 | new_data = realloc (*data, new_size * sizeof_data); 93 | memset (((unsigned char *) new_data) + (*data_size * sizeof_data), 0, (new_size - (*data_size)) * sizeof_data); 94 | *data = new_data; 95 | *data_size = new_size; 96 | } 97 | 98 | #define ResizeDepList(ptr_deptree, ptr_deptree_size) ResizeArray ((void **) ptr_deptree, ptr_deptree_size, sizeof (struct DepTreeElement *)) 99 | #define ResizeImportList(ptr_import_list, ptr_import_list_size) ResizeArray ((void **) ptr_import_list, ptr_import_list_size, sizeof (struct ImportTableItem)) 100 | #define ResizeStack(ptr_stack, ptr_stack_size) ResizeArray ((void **) ptr_stack, ptr_stack_size, sizeof (char *)) 101 | 102 | void AddDep (struct DepTreeElement *parent, struct DepTreeElement *child) 103 | { 104 | if (parent->childs_len >= parent->childs_size) 105 | { 106 | ResizeDepList (&parent->childs, &parent->childs_size); 107 | } 108 | parent->childs[parent->childs_len] = child; 109 | parent->childs_len += 1; 110 | } 111 | 112 | struct ImportTableItem *AddImport (struct DepTreeElement *self) 113 | { 114 | if (self->imports_len >= self->imports_size) 115 | { 116 | ResizeImportList (&self->imports, &self->imports_size); 117 | } 118 | self->imports_len += 1; 119 | return &self->imports[self->imports_len - 1]; 120 | } 121 | 122 | int FindDep (struct DepTreeElement *root, char *name, struct DepTreeElement **result) 123 | { 124 | int ret = -1; 125 | uint64_t i; 126 | if (root->flags & DEPTREE_VISITED) 127 | { 128 | return -2; 129 | } 130 | root->flags |= DEPTREE_VISITED; 131 | for (i = 0; i < root->childs_len; i++) 132 | { 133 | if (stricmp (root->childs[i]->module, name) == 0) 134 | { 135 | if (result != NULL) 136 | *result = root->childs[i]; 137 | root->flags &= ~DEPTREE_VISITED; 138 | return (root->childs[i]->flags & DEPTREE_UNRESOLVED) ? 1 : 0; 139 | } 140 | } 141 | for (i = 0; i < root->childs_len && ret < 0; i++) 142 | { 143 | ret = FindDep (root->childs[i], name, result); 144 | } 145 | root->flags &= ~DEPTREE_VISITED; 146 | return ret; 147 | } 148 | 149 | int BuildDepTree (BuildTreeConfig* cfg, char *name, struct DepTreeElement *root, struct DepTreeElement *self); 150 | 151 | struct DepTreeElement *ProcessDep (BuildTreeConfig* cfg, soff_entry *soffs, int soffs_len, DWORD name, struct DepTreeElement *root, struct DepTreeElement *self, int deep) 152 | { 153 | struct DepTreeElement *child = NULL; 154 | int found; 155 | int64_t i; 156 | char *dllname = (char *) MapPointer (soffs, soffs_len, name, NULL); 157 | if (dllname == NULL) 158 | return NULL; 159 | if (strlen (dllname) > 10 && strnicmp ("api-ms-win", dllname, 10) == 0) 160 | { 161 | /* TODO: find a better way to identify api stubs. Versioninfo, maybe? */ 162 | return NULL; 163 | } 164 | for (i = (int64_t)*cfg->stack_len - 1; i >= 0; i--) 165 | { 166 | if ((*cfg->stack)[i] && stricmp ((*cfg->stack)[i], dllname) == 0) 167 | return NULL; 168 | if (i == 0) 169 | break; 170 | } 171 | found = FindDep (root, dllname, &child); 172 | if (found < 0) 173 | { 174 | child = (struct DepTreeElement *) malloc (sizeof (struct DepTreeElement)); 175 | memset (child, 0, sizeof (struct DepTreeElement)); 176 | if (deep == 0) 177 | { 178 | child->module = strdup (dllname); 179 | AddDep (self, child); 180 | } 181 | } 182 | if (deep == 1) 183 | { 184 | BuildDepTree (cfg, dllname, root, child); 185 | } 186 | return child; 187 | } 188 | 189 | 190 | /* 191 | struct ExportTableItem *FindExportForward (struct DepTreeElement *self, char *dllname, char *export_name, DWORD export_ordinal) 192 | { 193 | return NULL; 194 | } 195 | */ 196 | 197 | int ClearDepStatus (struct DepTreeElement *self, uint64_t flags) 198 | { 199 | uint64_t i; 200 | for (i = 0; i < self->childs_len; i++) 201 | ClearDepStatus (self->childs[i], flags); 202 | self->flags &= ~flags; 203 | return 0; 204 | } 205 | 206 | void PushStack (char ***stack, uint64_t *stack_len, uint64_t *stack_size, char *name) 207 | { 208 | if (*stack_len >= *stack_size) 209 | { 210 | ResizeStack (stack, stack_size); 211 | } 212 | (*stack)[*stack_len] = strdup (name); 213 | (*stack_len) += 1; 214 | } 215 | 216 | void PopStack (char ***stack, uint64_t *stack_len, uint64_t *stack_size, char *name) 217 | { 218 | (*stack)[*stack_len] = NULL; 219 | (*stack_len) -= 1; 220 | } 221 | 222 | static uint64_t thunk_data_u1_function (void *thunk_array, DWORD index, BuildTreeConfig *cfg) 223 | { 224 | if (cfg->machineType == IMAGE_FILE_MACHINE_I386) 225 | return ((IMAGE_THUNK_DATA32 *) thunk_array)[index].u1.Function; 226 | else 227 | return ((IMAGE_THUNK_DATA64 *) thunk_array)[index].u1.Function; 228 | } 229 | 230 | static void *opt_header_get_dd_entry (void *opt_header, DWORD entry_type, BuildTreeConfig *cfg) 231 | { 232 | if (cfg->machineType == IMAGE_FILE_MACHINE_I386) 233 | return &(((PIMAGE_OPTIONAL_HEADER32) opt_header)->DataDirectory[entry_type]); 234 | else 235 | return &(((PIMAGE_OPTIONAL_HEADER64) opt_header)->DataDirectory[entry_type]); 236 | } 237 | 238 | static void BuildDepTree32or64 (LOADED_IMAGE *img, BuildTreeConfig* cfg, struct DepTreeElement *root, struct DepTreeElement *self, soff_entry *soffs, int soffs_len) 239 | { 240 | IMAGE_DATA_DIRECTORY *idata; 241 | IMAGE_IMPORT_DESCRIPTOR *iid; 242 | IMAGE_EXPORT_DIRECTORY *ied; 243 | IMAGE_DELAYLOAD_DESCRIPTOR *idd; 244 | void *ith, *oith; 245 | void *opt_header = &img->FileHeader->OptionalHeader; 246 | DWORD i, j; 247 | 248 | idata = opt_header_get_dd_entry (opt_header, IMAGE_DIRECTORY_ENTRY_EXPORT, cfg); 249 | if (idata->Size > 0 && idata->VirtualAddress != 0) 250 | { 251 | int export_section = -2; 252 | ied = (IMAGE_EXPORT_DIRECTORY *) MapPointer (soffs, soffs_len, idata->VirtualAddress, &export_section); 253 | if (ied && ied->Name != 0) 254 | { 255 | char *export_module = MapPointer (soffs, soffs_len, ied->Name, NULL); 256 | if (export_module != NULL) 257 | { 258 | if (self->export_module == NULL) 259 | self->export_module = strdup (export_module); 260 | } 261 | } 262 | if (ied && ied->NumberOfFunctions > 0) 263 | { 264 | DWORD *addrs, *names; 265 | WORD *ords; 266 | int section = -1; 267 | self->exports_len = ied->NumberOfFunctions; 268 | self->exports = (struct ExportTableItem *) malloc (sizeof (struct ExportTableItem) * self->exports_len); 269 | memset (self->exports, 0, sizeof (struct ExportTableItem) * self->exports_len); 270 | addrs = (DWORD *) MapPointer (soffs, soffs_len, ied->AddressOfFunctions, NULL); 271 | ords = (WORD *) MapPointer (soffs, soffs_len, ied->AddressOfNameOrdinals, NULL); 272 | names = (DWORD *) MapPointer (soffs, soffs_len, ied->AddressOfNames, NULL); 273 | for (i = 0; i < ied->NumberOfNames; i++) 274 | { 275 | self->exports[ords[i]].ordinal = ords[i] + ied->Base; 276 | if (names[i] != 0) 277 | { 278 | char *s_name = (char *) MapPointer (soffs, soffs_len, names[i], NULL); 279 | if (s_name != NULL) 280 | self->exports[ords[i]].name = strdup (s_name); 281 | } 282 | } 283 | for (i = 0; i < ied->NumberOfFunctions; i++) 284 | { 285 | if (addrs[i] != 0) 286 | { 287 | int section_index = FindSectionByRawData (img, addrs[i]); 288 | if ((idata->VirtualAddress <= addrs[i]) && (idata->VirtualAddress + idata->Size > addrs[i])) 289 | { 290 | self->exports[i].address = NULL; 291 | self->exports[i].forward_str = strdup ((char *) MapPointer (soffs, soffs_len, addrs[i], NULL)); 292 | } 293 | else 294 | self->exports[i].address = MapPointer (soffs, soffs_len, addrs[i], §ion); 295 | self->exports[i].ordinal = i + ied->Base; 296 | self->exports[i].section_index = section_index; 297 | self->exports[i].address_offset = addrs[i]; 298 | } 299 | } 300 | } 301 | } 302 | 303 | idata = opt_header_get_dd_entry (opt_header, IMAGE_DIRECTORY_ENTRY_IMPORT, cfg); 304 | if (idata->Size > 0 && idata->VirtualAddress != 0) 305 | { 306 | iid = (IMAGE_IMPORT_DESCRIPTOR *) MapPointer (soffs, soffs_len, 307 | idata->VirtualAddress, NULL); 308 | if (iid) 309 | for (i = 0; iid[i].Characteristics || iid[i].TimeDateStamp || 310 | iid[i].ForwarderChain || iid[i].Name || iid[i].FirstThunk; i++) 311 | { 312 | struct DepTreeElement *dll; 313 | uint64_t impaddress; 314 | dll = ProcessDep (cfg, soffs, soffs_len, iid[i].Name, root, self, 0); 315 | if (dll == NULL) 316 | continue; 317 | ith = (void *) MapPointer (soffs, soffs_len, iid[i].FirstThunk, NULL); 318 | oith = (void *) MapPointer (soffs, soffs_len, iid[i].OriginalFirstThunk, NULL); 319 | for (j = 0; (impaddress = thunk_data_u1_function (ith, j, cfg)) != 0; j++) 320 | { 321 | struct ImportTableItem *imp = AddImport (self); 322 | imp->dll = dll; 323 | imp->ordinal = -1; 324 | if (oith) 325 | imp->orig_address = thunk_data_u1_function (oith, j, cfg); 326 | if (cfg->on_self) 327 | { 328 | imp->address = impaddress; 329 | } 330 | if (oith && imp->orig_address & (1 << (sizeof (DWORD) * 8 - 1))) 331 | { 332 | imp->ordinal = imp->orig_address & ~(1 << (sizeof (DWORD) * 8 - 1)); 333 | } 334 | else if (oith) 335 | { 336 | IMAGE_IMPORT_BY_NAME *byname = (IMAGE_IMPORT_BY_NAME *) MapPointer (soffs, soffs_len, imp->orig_address, NULL); 337 | if (byname != NULL) 338 | imp->name = strdup ((char *) byname->Name); 339 | } 340 | } 341 | } 342 | } 343 | 344 | idata = opt_header_get_dd_entry (opt_header, IMAGE_DIRECTORY_ENTRY_DELAY_IMPORT, cfg); 345 | if (idata->Size > 0 && idata->VirtualAddress != 0) 346 | { 347 | idd = (IMAGE_DELAYLOAD_DESCRIPTOR *) MapPointer (soffs, soffs_len, idata->VirtualAddress, NULL); 348 | if (idd) 349 | for (i = 0; idd[i].Attributes.AllAttributes || idd[i].DllNameRVA || 350 | idd[i].ModuleHandleRVA || idd[i].ImportAddressTableRVA || idd[i].ImportNameTableRVA || 351 | idd[i].BoundImportAddressTableRVA || idd[i].UnloadInformationTableRVA || 352 | idd[i].TimeDateStamp; i++) 353 | { 354 | struct DepTreeElement *dll; 355 | uint64_t impaddress; 356 | dll = ProcessDep (cfg, soffs, soffs_len, idd[i].DllNameRVA, root, self, 0); 357 | if (dll == NULL) 358 | continue; 359 | if (idd[i].Attributes.AllAttributes & 0x00000001) 360 | { 361 | ith = (void *) MapPointer (soffs, soffs_len, idd[i].ImportAddressTableRVA, NULL); 362 | oith = (void *) MapPointer (soffs, soffs_len, idd[i].ImportNameTableRVA, NULL); 363 | } 364 | else 365 | { 366 | ith = (void *) idd[i].ImportAddressTableRVA; 367 | oith = (void *) idd[i].ImportNameTableRVA; 368 | } 369 | for (j = 0; (impaddress = thunk_data_u1_function (ith, j, cfg)) != 0; j++) 370 | { 371 | struct ImportTableItem *imp = AddImport (self); 372 | imp->dll = dll; 373 | imp->ordinal = -1; 374 | if (oith) 375 | imp->orig_address = thunk_data_u1_function (oith, j, cfg); 376 | if (cfg->on_self) 377 | { 378 | imp->address = impaddress; 379 | } 380 | if (oith && imp->orig_address & (1 << (sizeof (DWORD) * 8 - 1))) 381 | { 382 | imp->ordinal = imp->orig_address & ~(1 << (sizeof (DWORD) * 8 - 1)); 383 | } 384 | else if (oith) 385 | { 386 | IMAGE_IMPORT_BY_NAME *byname = (IMAGE_IMPORT_BY_NAME *) MapPointer (soffs, soffs_len, imp->orig_address, NULL); 387 | if (byname != NULL) 388 | imp->name = strdup ((char *) byname->Name); 389 | } 390 | } 391 | } 392 | } 393 | 394 | idata = opt_header_get_dd_entry (opt_header, IMAGE_DIRECTORY_ENTRY_IMPORT, cfg); 395 | if (idata->Size > 0 && idata->VirtualAddress != 0) 396 | { 397 | iid = (IMAGE_IMPORT_DESCRIPTOR *) MapPointer (soffs, soffs_len, 398 | idata->VirtualAddress, NULL); 399 | if (iid) 400 | for (i = 0; iid[i].Characteristics || iid[i].TimeDateStamp || 401 | iid[i].ForwarderChain || iid[i].Name || iid[i].FirstThunk; i++) 402 | ProcessDep (cfg, soffs, soffs_len, iid[i].Name, root, self, 1); 403 | } 404 | 405 | idata = opt_header_get_dd_entry (opt_header, IMAGE_DIRECTORY_ENTRY_DELAY_IMPORT, cfg); 406 | if (idata->Size > 0 && idata->VirtualAddress != 0) 407 | { 408 | idd = (IMAGE_DELAYLOAD_DESCRIPTOR *) MapPointer (soffs, soffs_len, idata->VirtualAddress, NULL); 409 | if (idd) 410 | for (i = 0; idd[i].Attributes.AllAttributes || idd[i].DllNameRVA || 411 | idd[i].ModuleHandleRVA || idd[i].ImportAddressTableRVA || idd[i].ImportNameTableRVA || 412 | idd[i].BoundImportAddressTableRVA || idd[i].UnloadInformationTableRVA || 413 | idd[i].TimeDateStamp; i++) 414 | ProcessDep (cfg, soffs, soffs_len, idd[i].DllNameRVA, root, self, 1); 415 | } 416 | } 417 | 418 | BOOL TryMapAndLoad (PCSTR name, PCSTR path, PLOADED_IMAGE loadedImage, int requiredMachineType) 419 | { 420 | BOOL success = MapAndLoad (name, path, loadedImage, FALSE, TRUE); 421 | if (!success && GetLastError () == ERROR_FILE_NOT_FOUND) 422 | success = MapAndLoad (name, path, loadedImage, TRUE, TRUE); 423 | if (success && requiredMachineType != -1 && (int)loadedImage->FileHeader->FileHeader.Machine != requiredMachineType) 424 | { 425 | UnMapAndLoad (loadedImage); 426 | return FALSE; 427 | } 428 | return success; 429 | } 430 | 431 | int BuildDepTree (BuildTreeConfig* cfg, char *name, struct DepTreeElement *root, struct DepTreeElement *self) 432 | { 433 | LOADED_IMAGE loaded_image; 434 | LOADED_IMAGE *img; 435 | IMAGE_DOS_HEADER *dos; 436 | HMODULE hmod; 437 | BOOL success; 438 | 439 | DWORD i, j; 440 | int soffs_len; 441 | soff_entry *soffs; 442 | 443 | if (self->flags & DEPTREE_PROCESSED) 444 | { 445 | return 0; 446 | } 447 | 448 | if (cfg->on_self) 449 | { 450 | char modpath[MAX_PATH]; 451 | success = GetModuleHandleExA (GET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT, name, &hmod); 452 | if (!success) 453 | return 1; 454 | if (GetModuleFileNameA (hmod, modpath, MAX_PATH) == 0) 455 | return 1; 456 | if (self->resolved_module == NULL) 457 | self->resolved_module = strdup (modpath); 458 | 459 | dos = (IMAGE_DOS_HEADER *) hmod; 460 | loaded_image.FileHeader = (IMAGE_NT_HEADERS *) ((char *) hmod + dos->e_lfanew); 461 | loaded_image.Sections = (IMAGE_SECTION_HEADER *) ((char *) hmod + dos->e_lfanew + sizeof (IMAGE_NT_HEADERS)); 462 | loaded_image.NumberOfSections = loaded_image.FileHeader->FileHeader.NumberOfSections; 463 | loaded_image.MappedAddress = (void *) hmod; 464 | if (cfg->machineType != -1 && (int)loaded_image.FileHeader->FileHeader.Machine != cfg->machineType) 465 | return 1; 466 | } 467 | else 468 | { 469 | success = FALSE; 470 | for (i = 0; i < cfg->searchPaths->count && !success; ++i) 471 | { 472 | success = TryMapAndLoad (name, cfg->searchPaths->path[i], &loaded_image, cfg->machineType); 473 | } 474 | if (!success) 475 | success = TryMapAndLoad (name, NULL, &loaded_image, cfg->machineType); 476 | if (!success) 477 | { 478 | self->flags |= DEPTREE_UNRESOLVED; 479 | return 1; 480 | } 481 | if (self->resolved_module == NULL) 482 | self->resolved_module = strdup (loaded_image.ModuleName); 483 | } 484 | if (cfg->machineType == -1) 485 | cfg->machineType = (int)loaded_image.FileHeader->FileHeader.Machine; 486 | img = &loaded_image; 487 | 488 | PushStack (cfg->stack, cfg->stack_len, cfg->stack_size, name); 489 | 490 | self->mapped_address = loaded_image.MappedAddress; 491 | 492 | self->flags |= DEPTREE_PROCESSED; 493 | 494 | soffs_len = img->NumberOfSections; 495 | soffs = (soff_entry *) malloc (sizeof(soff_entry) * (soffs_len + 1)); 496 | for (i = 0; i < img->NumberOfSections; i++) 497 | { 498 | soffs[i].start = img->Sections[i].VirtualAddress; 499 | soffs[i].end = soffs[i].start + img->Sections[i].Misc.VirtualSize; 500 | if (cfg->on_self) 501 | soffs[i].off = img->MappedAddress/* + img->Sections[i].VirtualAddress*/; 502 | else if (img->Sections[i].PointerToRawData != 0) 503 | soffs[i].off = img->MappedAddress + img->Sections[i].PointerToRawData - 504 | img->Sections[i].VirtualAddress; 505 | else 506 | soffs[i].off = NULL; 507 | } 508 | soffs[img->NumberOfSections].start = 0; 509 | soffs[img->NumberOfSections].end = 0; 510 | soffs[img->NumberOfSections].off = 0; 511 | 512 | BuildDepTree32or64 (img, cfg, root, self, soffs, soffs_len); 513 | free (soffs); 514 | 515 | if (!cfg->on_self) 516 | UnMapAndLoad (&loaded_image); 517 | 518 | /* Not sure if a forwarded export warrants an import. If it doesn't, then the dll to which the export is forwarded will NOT 519 | * be among the dependencies of this dll and it will be necessary to do yet another ProcessDep... 520 | for (i = 0; i < self->exports_len; i++) 521 | { 522 | if (self->exports[i]->forward_str != NULL && self-.exports[i]->forward == NULL) 523 | { 524 | char *forward_str_copy = NULL, *export_name = NULL, *rdot = NULL; 525 | DWORD export_ordinal = 0; 526 | forward_str_copy = strdup (self->exports[i]->forward_str); 527 | rdot = strrchr (forward_str_copy, '.'); 528 | if (rdot != NULL && rdot[1] != 0) 529 | { 530 | rdot[0] = 0; 531 | export_name = &rdot[1]; 532 | if (export_name[0] == '#' && export_name[1] >= '0' && export_name[1] <= '9') 533 | { 534 | export_ordinal = strtol (&export_name[1], NULL, 10); 535 | export_name = NULL; 536 | } 537 | self->exports[i]->forward = FindExportForward (forward_str_copy, export_name, export_ordinal); 538 | } 539 | free (forward_str_copy); 540 | } 541 | } 542 | */ 543 | for (i = 0; i < self->imports_len; i++) 544 | { 545 | if (self->imports[i].mapped == NULL && self->imports[i].dll != NULL && (self->imports[i].name != NULL || self->imports[i].ordinal > 0)) 546 | { 547 | struct DepTreeElement *dll = self->imports[i].dll; 548 | for (j = 0; j < dll->exports_len; j++) 549 | { 550 | if ((self->imports[i].name != NULL && dll->exports[j].name != NULL && strcmp (self->imports[i].name, dll->exports[j].name) == 0) || 551 | (self->imports[i].ordinal > 0 && dll->exports[j].ordinal > 0 && self->imports[i].ordinal == dll->exports[j].ordinal)) 552 | { 553 | self->imports[i].mapped = &dll->exports[j]; 554 | break; 555 | } 556 | } 557 | /* 558 | if (self->imports[i].mapped == NULL) 559 | printf ("Could not match %s (%d) in %s to %s\n", self->imports[i].name, self->imports[i].ordinal, self->module, dll->module); 560 | */ 561 | } 562 | } 563 | /* By keeping items in the stack we turn it into a list of all 564 | * processed modules, this should be more effective at preventing 565 | * us from processing modules multiple times 566 | */ 567 | /*PopStack (stack, stack_len, stack_size, name);*/ 568 | return 0; 569 | } 570 | -------------------------------------------------------------------------------- /libntldd.h: -------------------------------------------------------------------------------- 1 | #ifndef __LIBNTLDD_H__ 2 | #define __LIBNTLDD_H__ 3 | 4 | #include 5 | #include 6 | 7 | #define NTLDD_VERSION_MAJOR 0 8 | #define NTLDD_VERSION_MINOR 2 9 | 10 | struct DepTreeElement; 11 | 12 | struct ExportTableItem 13 | { 14 | void *address; 15 | char *name; 16 | WORD ordinal; 17 | char *forward_str; 18 | struct ExportTableItem *forward; 19 | int section_index; 20 | DWORD address_offset; 21 | }; 22 | 23 | struct ImportTableItem 24 | { 25 | uint64_t orig_address; 26 | uint64_t address; 27 | char *name; 28 | int ordinal; 29 | struct DepTreeElement *dll; 30 | struct ExportTableItem *mapped; 31 | }; 32 | 33 | struct DepTreeElement 34 | { 35 | uint64_t flags; 36 | char *module; 37 | char *export_module; 38 | char *resolved_module; 39 | void *mapped_address; 40 | struct DepTreeElement **childs; 41 | uint64_t childs_size; 42 | uint64_t childs_len; 43 | uint64_t imports_len; 44 | uint64_t imports_size; 45 | struct ImportTableItem *imports; 46 | uint64_t exports_len; 47 | struct ExportTableItem *exports; 48 | }; 49 | 50 | #define DEPTREE_VISITED 0x00000001 51 | #define DEPTREE_UNRESOLVED 0x00000002 52 | #define DEPTREE_PROCESSED 0x00000004 53 | 54 | int ClearDepStatus (struct DepTreeElement *self, uint64_t flags); 55 | 56 | void AddDep (struct DepTreeElement *parent, struct DepTreeElement *child); 57 | 58 | typedef struct SearchPaths_t 59 | { 60 | unsigned count; 61 | char** path; 62 | } SearchPaths; 63 | 64 | 65 | typedef struct BuildTreeConfig_t 66 | { 67 | int datarelocs; 68 | int functionrelocs; 69 | int recursive; 70 | int on_self; 71 | char ***stack; 72 | uint64_t *stack_len; 73 | uint64_t *stack_size; 74 | int machineType; 75 | SearchPaths* searchPaths; 76 | } BuildTreeConfig; 77 | 78 | int BuildDepTree (BuildTreeConfig* cfg, char *name, struct DepTreeElement *root, struct DepTreeElement *self); 79 | 80 | 81 | #endif 82 | -------------------------------------------------------------------------------- /makeldd.cmd: -------------------------------------------------------------------------------- 1 | gcc -fno-common -g -O3 -Wall -D__USE_MINGW_ANSI_STDIO=1 -D_WIN32_WINNT=0x501 -c libntldd.c -o libntldd.o 2 | ar rs libntldd.a libntldd.o 3 | gcc -fno-common -g -O3 -Wall -D__USE_MINGW_ANSI_STDIO=1 -L. ntldd.c -lntldd -limagehlp -o ntldd.exe -------------------------------------------------------------------------------- /makeldd.sh: -------------------------------------------------------------------------------- 1 | #! /bin/sh 2 | gcc -fno-common -g -O3 -Wall -D__USE_MINGW_ANSI_STDIO=1 -D_WIN32_WINNT=0x501 -c libntldd.c -o libntldd.o 3 | ar rs libntldd.a libntldd.o 4 | gcc -fno-common -g -O3 -Wall -D__USE_MINGW_ANSI_STDIO=1 -L. ntldd.c -lntldd -limagehlp -o ntldd.exe -------------------------------------------------------------------------------- /ntldd.c: -------------------------------------------------------------------------------- 1 | /* 2 | ntldd - lists dynamic dependencies of a module 3 | 4 | Copyright (C) 2010 LRN 5 | 6 | This program is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with this program. If not, see . 18 | */ 19 | 20 | /* 21 | Code is mostly written after 22 | "An In-Depth Look into the Win32 Portable Executable File Format" 23 | MSDN Magazine articles 24 | */ 25 | 26 | #include 27 | 28 | #include 29 | 30 | #include 31 | 32 | #include 33 | #include 34 | 35 | #include "libntldd.h" 36 | 37 | void printversion() 38 | { 39 | printf ("ntldd %d.%d\n\ 40 | Copyright (C) 2010-2015 LRN\n\ 41 | This is free software; see the source for conditions. There is NO\n\ 42 | warranty; not event for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\ 43 | Written by LRN.", NTLDD_VERSION_MAJOR, NTLDD_VERSION_MINOR); 44 | } 45 | 46 | void printhelp(char *argv0) 47 | { 48 | printf("Usage: %s [OPTION]... FILE...\n\ 49 | OPTIONS:\n\ 50 | --version Displays version\n\ 51 | -v, --verbose Does not work\n\ 52 | -u, --unused Does not work\n\ 53 | -d, --data-relocs Does not work\n\ 54 | -r, --function-relocs Does not work\n\ 55 | -R, --recursive Lists dependencies recursively,\n\ 56 | eliminating duplicates\n\ 57 | -D, --search-dir Additional search directory\n\ 58 | --list-exports Lists exports of a module (single file only)\n\ 59 | --list-imports Lists imports of modules\n\ 60 | --help Displays this message\n\ 61 | \n\ 62 | Use -- option to pass filenames that start with `--' or `-'\n\ 63 | For bug reporting instructions, please see:\n\ 64 | .", argv0); 65 | } 66 | 67 | int PrintImageLinks (int first, int verbose, int unused, int datarelocs, int functionrelocs, struct DepTreeElement *self, int recursive, int list_exports, int list_imports, int depth) 68 | { 69 | uint64_t i; 70 | int unresolved = 0; 71 | self->flags |= DEPTREE_VISITED; 72 | 73 | if (list_exports) 74 | { 75 | for (i = 0; i < self->exports_len; i++) 76 | { 77 | struct ExportTableItem *item = &self->exports[i]; 78 | 79 | printf ("%*s[%u] %s (0x%lx)%s%s <%d>\n", depth, depth > 0 ? " " : "", \ 80 | item->ordinal, item->name, item->address_offset, \ 81 | item->forward_str ? " ->" : "", \ 82 | item->forward_str ? item->forward_str : "", 83 | item->section_index); 84 | } 85 | return 0; 86 | } 87 | if (self->flags & DEPTREE_UNRESOLVED) 88 | { 89 | if (!first) 90 | printf (" => not found\n"); 91 | else 92 | fprintf (stderr, "%s: not found\n", self->module); 93 | unresolved = 1; 94 | } 95 | 96 | if (!unresolved && !first) 97 | { 98 | if (stricmp (self->module, self->resolved_module) == 0) 99 | printf (" (0x%p)\n", self->mapped_address); 100 | else 101 | printf (" => %s (0x%p)\n", self->resolved_module, 102 | self->mapped_address); 103 | } 104 | 105 | if (list_imports) 106 | { 107 | for (i = 0; i < self->imports_len; i++) 108 | { 109 | struct ImportTableItem *item = &self->imports[i]; 110 | 111 | printf ("\t%*s%llX %llX %3d %s %s %s\n", depth, depth > 0 ? " " : "", \ 112 | item->orig_address, item->address, item->ordinal, \ 113 | item->name ? item->name : "", 114 | item->mapped ? "" : "", 115 | item->dll == NULL ? "" : item->dll->module ? item->dll->module : ""); 116 | } 117 | } 118 | 119 | if (unresolved) 120 | return -1; 121 | 122 | if (first || recursive) 123 | { 124 | for (i = 0; i < self->childs_len; i++) 125 | { 126 | if (!(self->childs[i]->flags & DEPTREE_VISITED)) 127 | { 128 | printf ("\t%*s%s", depth, depth > 0 ? " " : "", self->childs[i]->module); 129 | PrintImageLinks (0, verbose, unused, datarelocs, functionrelocs, self->childs[i], recursive, list_exports, list_imports, depth + 1); 130 | } 131 | } 132 | } 133 | return 0; 134 | } 135 | 136 | int main (int argc, char **argv) 137 | { 138 | int i; 139 | int verbose = 0; 140 | int unused = 0; 141 | int datarelocs = 0; 142 | int functionrelocs = 0; 143 | int skip = 0; 144 | int files = 0; 145 | int recursive = 0; 146 | int list_exports = 0; 147 | int list_imports = 0; 148 | int files_start = -1; 149 | int files_count = 0; 150 | 151 | SearchPaths sp; 152 | memset(&sp, 0, sizeof (sp)); 153 | sp.path = calloc (1, sizeof (char*)); 154 | 155 | for (i = 1; i < argc; i++) 156 | { 157 | if (strcmp (argv[i], "--version") == 0) 158 | printversion (); 159 | else if (strcmp (argv[i], "-v") == 0 || strcmp (argv[i], "--verbose") == 0) 160 | verbose = 1; 161 | else if (strcmp (argv[i], "-u") == 0 || strcmp (argv[i], "--unused") == 0) 162 | unused = 1; 163 | else if (strcmp (argv[i], "-d") == 0 || 164 | strcmp (argv[i], "--data-relocs") == 0) 165 | datarelocs = 1; 166 | else if (strcmp (argv[i], "-r") == 0 || 167 | strcmp (argv[i], "--function-relocs") == 0) 168 | functionrelocs = 1; 169 | else if (strcmp (argv[i], "-R") == 0 || 170 | strcmp (argv[i], "--recursive") == 0) 171 | recursive = 1; 172 | else if (strcmp (argv[i], "-e") == 0 || 173 | strcmp (argv[i], "--list-exports") == 0) 174 | list_exports = 1; 175 | else if (strcmp (argv[i], "-i") == 0 || 176 | strcmp (argv[i], "--list-imports") == 0) 177 | list_imports = 1; 178 | else if ((strcmp (argv[i], "-D") == 0 || strcmp (argv[i], "--search-dir") == 0) && i < argc - 1) 179 | { 180 | char* add_dirs = argv[i+1]; 181 | if (*add_dirs == '"') 182 | add_dirs++; 183 | char* sep = strchr(add_dirs, ';'); 184 | do { 185 | if (sep) 186 | *sep = '\0'; 187 | sp.count++; 188 | sp.path = (char**)realloc(sp.path, sp.count * sizeof(char*)); 189 | if (!sep) 190 | { 191 | char* p = strrchr(add_dirs, '"'); 192 | if (p) 193 | *p = '\0'; 194 | } 195 | sp.path[sp.count - 1] = strdup(add_dirs); 196 | add_dirs = sep + 1; 197 | if (!sep) 198 | break; 199 | sep = strchr(add_dirs, ';'); 200 | } while (1); 201 | i++; 202 | } 203 | else if (strcmp (argv[i], "--help") == 0) 204 | { 205 | printhelp (argv[0]); 206 | skip = 1; 207 | break; 208 | } 209 | else if (strcmp (argv[i], "--") == 0) 210 | { 211 | files = 1; 212 | } 213 | else if (strlen (argv[i]) > 1 && argv[i][0] == '-' && (argv[i][1] == '-' || 214 | strlen (argv[i]) == 2) && !files) 215 | { 216 | fprintf (stderr, "Unrecognized option `%s'\n\ 217 | Try `ntldd --help' for more information\n", argv[i]); 218 | skip = 1; 219 | break; 220 | } 221 | else if (files_start < 0) 222 | { 223 | skip = 0; 224 | files_start = i; 225 | break; 226 | } 227 | } 228 | 229 | if (!skip && files_start > 0) 230 | { 231 | files_count = argc - files_start; 232 | sp.count += files_count; 233 | sp.path = realloc(sp.path, sp.count * sizeof(char*)); 234 | for (i = 0; i < files_count; ++i) 235 | { 236 | char buff[MAX_PATH] = {}; 237 | strcpy(buff, argv[files_start+i]); 238 | char* p = strrchr(buff, '\\'); 239 | if (!p) 240 | p = strrchr(buff, '/'); 241 | if (p++) 242 | *p = '\0'; 243 | 244 | sp.path[sp.count - files_count + i] = strdup(buff); 245 | } 246 | int multiple = files_start + 1 < argc; 247 | struct DepTreeElement root; 248 | memset (&root, 0, sizeof (struct DepTreeElement)); 249 | for (i = files_start; i < argc; i++) 250 | { 251 | struct DepTreeElement *child = (struct DepTreeElement *) malloc (sizeof (struct DepTreeElement)); 252 | memset (child, 0, sizeof (struct DepTreeElement)); 253 | child->module = strdup (argv[i]); 254 | AddDep (&root, child); 255 | char **stack = NULL; 256 | uint64_t stack_len = 0; 257 | uint64_t stack_size = 0; 258 | BuildTreeConfig cfg; 259 | memset(&cfg, 0, sizeof(cfg)); 260 | cfg.machineType = -1; 261 | cfg.on_self = 0; 262 | cfg.datarelocs = datarelocs; 263 | cfg.recursive = recursive; 264 | cfg.functionrelocs = functionrelocs; 265 | cfg.stack = &stack; 266 | cfg.stack_len = &stack_len; 267 | cfg.stack_size = &stack_size; 268 | cfg.searchPaths = &sp; 269 | BuildDepTree (&cfg, argv[i], &root, child); 270 | } 271 | ClearDepStatus (&root, DEPTREE_VISITED | DEPTREE_PROCESSED); 272 | for (i = files_start; i < argc; i++) 273 | { 274 | if (multiple) 275 | printf ("%s:\n", argv[i]); 276 | PrintImageLinks (1, verbose, unused, datarelocs, functionrelocs, root.childs[i - files_start], recursive, list_exports, list_imports, 0); 277 | } 278 | } 279 | return 0; 280 | } 281 | --------------------------------------------------------------------------------