diff --git a/README.md b/README.md index 1f407c3..f7f59ce 100644 --- a/README.md +++ b/README.md @@ -8,11 +8,13 @@ Tools to extract data from Star Wars: Rogue Squadron 3D. * Image exporter - exports some images to pnm/pgm/tga files (according to their internal format). * HOB parser - parses mesh data files. * HMT parser - parses material data files and exports stored textures. +* HOB display - utilizes HOB & HMT parsers to view 3d objects used in game. Uses OpenGL and SDL for display & input handling. Compilation ----------- Use recent Lazarus (1.2.x) with Freepascal (2.6.x) to compile. +HOB display needs SDL 1.2 and OpenGL 1.x support to work. TODO ----------- @@ -21,3 +23,4 @@ TODO * hob parser: parse more header fields * mesh viewer: reuse hmt & hob parsers to display data * bundle repack: extract & compile bundle.00x archives +* terrain viewer diff --git a/hob_display/COPYING b/hob_display/COPYING new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/hob_display/COPYING @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/hob_display/genericstructlist.pas b/hob_display/genericstructlist.pas new file mode 100644 index 0000000..581263a --- /dev/null +++ b/hob_display/genericstructlist.pas @@ -0,0 +1,224 @@ +{ + Based on FPC FGL unit, copyright by FPC team. + License of FPC RTL is the same as our engine (modified LGPL, + see COPYING.txt for details). + Fixed to compile also under FPC 2.4.0 and 2.2.4. + Some small comfortable methods added. +} + +{ Generic list of any type (TGenericStructList). } +unit GenericStructList; + +{$mode objfpc}{$H+} + +{$IF defined(VER2_2)} {$DEFINE OldSyntax} {$IFEND} +{$IF defined(VER2_4)} {$DEFINE OldSyntax} {$IFEND} + +{$define HAS_ENUMERATOR} +{$ifdef VER2_2} {$undef HAS_ENUMERATOR} {$endif} +{$ifdef VER2_4_0} {$undef HAS_ENUMERATOR} {$endif} +{ Just undef enumerator always, in FPC 2.7.1 it's either broken + or I shouldn't overuse TFPGListEnumeratorSpec. } +{$undef HAS_ENUMERATOR} + +{ FPC < 2.6.0 had buggy version of the Extract function, + also with different interface, see http://bugs.freepascal.org/view.php?id=19960. } +{$define HAS_EXTRACT} +{$ifdef VER2_2} {$undef HAS_EXTRACT} {$endif} +{$ifdef VER2_4} {$undef HAS_EXTRACT} {$endif} + +interface + +uses FGL; + +type + { Generic list of types that are compared by CompareByte. + + This is equivalent to TFPGList, except it doesn't override IndexOf, + so your type doesn't need to have a "=" operator built-in inside FPC. + When calling IndexOf or Remove, it will simply compare values using + CompareByte, this is what TFPSList.IndexOf uses. + This way it works to create lists of records, vectors (constant size arrays), + old-style TP objects, and also is suitable to create a list of methods + (since for methods, the "=" is broken, for Delphi compatibility, + see http://bugs.freepascal.org/view.php?id=9228). + + We also add some trivial helper methods like @link(Add) and @link(L). } + + { TGenericStructList } + + generic TGenericStructList = class(TFPSList) + private + type + TCompareFunc = function(const Item1, Item2: T): Integer; + TTypeList = array[0..MaxGListSize] of T; + PTypeList = ^TTypeList; + PT = ^T; + {$ifdef HAS_ENUMERATOR} TFPGListEnumeratorSpec = specialize TFPGListEnumerator; {$endif} + {$ifndef OldSyntax}protected var{$else} + {$ifdef PASDOC}protected var{$else} { PasDoc can't handle "var protected", and I don't know how/if they should be handled? } + var protected{$endif}{$endif} + FOnCompare: TCompareFunc; + procedure CopyItem(Src, Dest: Pointer); override; + procedure Deref(Item: Pointer); override; + function Get(Index: Integer): T; {$ifdef CLASSESINLINE} inline; {$endif} + function GetList: PTypeList; {$ifdef CLASSESINLINE} inline; {$endif} + function ItemPtrCompare(Item1, Item2: Pointer): Integer; + procedure Put(Index: Integer; const Item: T); {$ifdef CLASSESINLINE} inline; {$endif} + public + constructor Create; + function Add(const Item: T): Integer; {$ifdef CLASSESINLINE} inline; {$endif} + {$ifdef HAS_EXTRACT} function Extract(const Item: T): T; {$ifdef CLASSESINLINE} inline; {$endif} {$endif} + function First: T; {$ifdef CLASSESINLINE} inline; {$endif} + {$ifdef HAS_ENUMERATOR} function GetEnumerator: TFPGListEnumeratorSpec; {$ifdef CLASSESINLINE} inline; {$endif} {$endif} + function IndexOf(const Item: T): Integer; + procedure Insert(Index: Integer; const Item: T); {$ifdef CLASSESINLINE} inline; {$endif} + function Last: T; {$ifdef CLASSESINLINE} inline; {$endif} +{$ifndef OldSyntax} + procedure Assign(Source: TGenericStructList); +{$endif OldSyntax} + function Remove(const Item: T): Integer; {$ifdef CLASSESINLINE} inline; {$endif} + procedure Sort(Compare: TCompareFunc); + property Items[Index: Integer]: T read Get write Put; default; + property List: PTypeList read GetList; + + { Pointer to items. Exactly like @link(List), but this points to a single item, + which means you can access particular item by @code(L[I]) instead of + @code(List^[I]) in FPC objfpc mode. + + This is just trivial shortcut, but we use direct access a @italic(lot) + for structures. Reasonis: using Items[] default + property means copying the structures, which is + @orderedList( + @item(very dangerous (you can trivially easy modify a temporary result)) + @item(slow (important for us, since these are used for vector arrays that + are crucial for renderer and various processing).) + ) } + function L: PT; + + { Increase Count and return pointer to new item. + Comfortable and efficient way to add a new item that you want to immediately + initialize. } + function Add: PT; + + function Copy: TGenericStructList; + end; + +implementation + +constructor TGenericStructList.Create; +begin + inherited Create(sizeof(T)); +end; + +procedure TGenericStructList.CopyItem(Src, Dest: Pointer); +begin + T(Dest^) := T(Src^); +end; + +procedure TGenericStructList.Deref(Item: Pointer); +begin + Finalize(T(Item^)); +end; + +function TGenericStructList.Get(Index: Integer): T; +begin + Result := T(inherited Get(Index)^); +end; + +function TGenericStructList.GetList: PTypeList; +begin + Result := PTypeList(FList); +end; + +function TGenericStructList.ItemPtrCompare(Item1, Item2: Pointer): Integer; +begin + Result := FOnCompare(T(Item1^), T(Item2^)); +end; + +procedure TGenericStructList.Put(Index: Integer; const Item: T); +begin + inherited Put(Index, @Item); +end; + +function TGenericStructList.Add(const Item: T): Integer; +begin + Result := inherited Add(@Item); +end; + +{$ifdef HAS_EXTRACT} +function TGenericStructList.Extract(const Item: T): T; +begin + inherited Extract(@Item, @Result); +end; +{$endif} + +function TGenericStructList.First: T; +begin + Result := T(inherited First^); +end; + +{$ifdef HAS_ENUMERATOR} +function TGenericStructList.GetEnumerator: TFPGListEnumeratorSpec; +begin + Result := TFPGListEnumeratorSpec.Create(Self); +end; +{$endif} + +function TGenericStructList.IndexOf(const Item: T): Integer; +begin + Result := inherited IndexOf(@Item); +end; + +procedure TGenericStructList.Insert(Index: Integer; const Item: T); +begin + T(inherited Insert(Index)^) := Item; +end; + +function TGenericStructList.Last: T; +begin + Result := T(inherited Last^); +end; + +{$ifndef OldSyntax} +procedure TGenericStructList.Assign(Source: TGenericStructList); +var + i: Integer; +begin + Clear; + for I := 0 to Source.Count - 1 do + Add(Source[i]); +end; +{$endif OldSyntax} + +function TGenericStructList.Remove(const Item: T): Integer; +begin + Result := IndexOf(Item); + if Result >= 0 then + Delete(Result); +end; + +procedure TGenericStructList.Sort(Compare: TCompareFunc); +begin + FOnCompare := Compare; + inherited Sort(@ItemPtrCompare); +end; + +function TGenericStructList.L: PT; +begin + Result := PT(FList); +end; + +function TGenericStructList.Add: PT; +begin + Count := Count + 1; + Result := Addr(L[Count - 1]); +end; + +function TGenericStructList.Copy: TGenericStructList; +begin + result := TGenericStructList.Create; + result.Assign(Self); +end; + +end. diff --git a/hob_display/hmt_parser.pas b/hob_display/hmt_parser.pas new file mode 100644 index 0000000..a6ac51d --- /dev/null +++ b/hob_display/hmt_parser.pas @@ -0,0 +1,180 @@ +unit hmt_parser; +{$mode objfpc}{$H+} + +interface + +uses + sysutils, Classes, + rs_image; + +type + THmtMaterial = record + type1, type2: shortint; + unknown_float1, unknown_float2: single; + zero: integer; + hex_a: integer; + name: array[0..15] of byte; + name_string: string; + end; + + THmtTexture = record + data_offset: integer; + palette_offset: integer; + name_offset: integer; + width, height: word; + name: array[0..15] of byte; + name_string: string; + image: TRSImage; + end; + + THmtFile = record + material_count: integer; + texture_offset: integer; + texture_count: integer; + materials: array of THmtMaterial; + textures: array of THmtTexture; + end; + + function ParseHmtFile(const fname: string): THmtFile; + +//************************************************************************************************** +implementation + +function NameToString(name: array of byte): string; +var + i: Integer; +begin + result := ''; + for i := 0 to length(name) - 1 do begin + if name[i] = 0 then break; + result += char( name[i] ); + end; +end; + + +procedure ReadTexture(var tex: THmtTexture; var f: TMemoryStream); +const + ImageDescription: array[0..5] of TImageDescription = ( + (palette_entries: 16; sample_bits: 4), + (palette_entries: 256; sample_bits: 8), + (palette_entries: 0; sample_bits: 16), + (palette_entries: 0; sample_bits: 32), + (palette_entries: 0; sample_bits: 4), + (palette_entries: 0; sample_bits: 16) + ); +var + image: TRSImage; + buf: array[0..27] of byte; + description: TImageDescription; + bpp: byte; + color_rgba: integer; + pos: int64; +begin + tex.data_offset := f.ReadDWord; + f.ReadBuffer(buf, 28); + tex.palette_offset := f.ReadDWord; + tex.name_offset := f.ReadDWord; + tex.width := f.ReadWord; + tex.height := f.ReadWord; + + f.ReadByte; //0x01 + bpp := f.ReadByte; + image.type_ := f.ReadByte; + f.ReadByte; + color_rgba := f.ReadDWord; + + pos := f.Position; + f.Seek(tex.name_offset, TSeekOrigin.soBeginning); + f.ReadBuffer(tex.name, 16); + tex.name_string := NameToString(tex.name); + f.Seek(pos, TSeekOrigin.soBeginning); + + description := ImageDescription[image.type_]; + image.sampleBits := description.sample_bits; + image.paletteEntries := description.palette_entries; + image.width := tex.width; + //if (image.width and 1) > 1 then image.width += 1; + image.height := tex.height; + + writeln('name: ', tex.name_string); + writeln('size: ', tex.width, 'x', tex.height); + writeln('subtype: ', image.type_, ' bpp: ', bpp); + writeln('sample bits: ', image.sampleBits); + writeln('palette offset: ', tex.palette_offset); + writeln('data offset: ', tex.data_offset); + + if tex.palette_offset > 0 then begin + writeln('palette entries: ', image.paletteEntries); + f.Seek(tex.palette_offset, TSeekOrigin.soBeginning); + LoadPalette(image, f); + end; + f.Seek(tex.data_offset, TSeekOrigin.soBeginning); + LoadSamples(image, f); + DecodePixels(image); + + f.Seek(pos, TSeekOrigin.soBeginning); + writeln; + tex.image := image; +end; + + +procedure ReadMaterial(var mat: THmtMaterial; var f: TMemoryStream); +begin + mat.type1 := f.ReadWord; + mat.type2 := f.ReadWord; + mat.unknown_float1 := f.ReadDWord; + mat.unknown_float2 := f.ReadDWord; + mat.zero := f.ReadDWord; + mat.hex_a := f.ReadDWord; + f.ReadBuffer(mat.name, 16); + mat.name_string := NameToString(mat.name); + + writeln(mat.name_string); + if (mat.zero <> 0) or (mat.hex_a <> $A) then + writeln('unusual file'); +end; + + +function ParseHmtFile(const fname: string): THmtFile; +var + f: TMemoryStream; + hmt: THmtFile; + i: Integer; +begin + f := TMemoryStream.Create; + f.LoadFromFile(fname); + + //read main info + hmt.material_count := f.ReadDWord; + hmt.texture_offset := f.ReadDWord; + f.Seek(hmt.texture_offset, TSeekOrigin.soBeginning); + hmt.texture_count := f.ReadDWord; + f.Seek(8, TSeekOrigin.soBeginning); + + //read materials + writeln('materials: ', hmt.material_count); + SetLength(hmt.materials, hmt.material_count); + for i := 0 to hmt.material_count - 1 do begin + ReadMaterial(hmt.materials[i], f); + end; + + if hmt.texture_count = 0 then begin + result := hmt; + f.Free; + exit; + end; + + //read textures + writeln('textures: ', hmt.texture_count); + f.Seek(hmt.texture_offset + 4, TSeekOrigin.soBeginning); + SetLength(hmt.textures, hmt.texture_count); + for i := 0 to hmt.texture_count - 1 do begin + ReadTexture(hmt.textures[i], f); + end; + + f.Free; + result := hmt; +end; + +end. + diff --git a/hob_display/hob_parser.pas b/hob_display/hob_parser.pas new file mode 100644 index 0000000..be8ac79 --- /dev/null +++ b/hob_display/hob_parser.pas @@ -0,0 +1,307 @@ +unit hob_parser; +{$mode objfpc}{$H+} + +interface + +uses + Classes, SysUtils; + +type + TRGBA = record + color: integer; + end; + + TTexCoord = record + u, v: smallint; + end; + + THobFace = record + flags: integer; + b1, b2, b3: byte; + bsize: byte; + ftype: byte; //3 - tri, 4 - quad + material_index: word; + indices: array[0..3] of word; + vertex_colors: array[0..3] of TRGBA; + tex_coords: array[0..3] of TTexCoord; + end; + + THobFaceGroup = record + meshdef1_offset: integer; + + face_block_end_offset, + face_block_offset, + vertex_block_offset: integer; + + face_count: integer; + faces: array of THobFace; + + vertex_count: integer; + vertices: array of record + x, y, z, unknown: smallint; //+-2^15 + end; + end; + + THobObject = record + name: array[0..15] of byte; + face_group_offset: integer; + face_group_header_offset: integer; + face_group_header2_offset: integer; + + face_group_count: integer; + face_group_count0: integer; + + face_groups: array of THobFaceGroup; + end; + + THobFile = record + obj_count: integer; + objects: array of THobObject; + end; + +function ParseHobFile(const fname: string): THobFile; + +//************************************************************************************************** +implementation + +const + DumpFaces = false; + +function NameToString(name: array of byte): string; +var + i: Integer; +begin + result := ''; + for i := 0 to length(name) - 1 do begin + if name[i] = 0 then break; + result += char( name[i] ); + end; +end; + +procedure ReadFaces(var group: THobFaceGroup; var f: TMemoryStream); +const + FACE_UV = %100; + FACE_QUAD = %1000; + FACE_VCOLORS = %10000; + FACE_COLOR = %100000; + FACE_EXT = %1000000; +var + i, k: integer; + face: THobFace; + unknown: integer; + file_pos: integer; + color: integer; +begin + unknown := f.ReadDWord; + if (unknown <> 0) then + writeln('unusual file: zero'); + unknown := f.ReadDWord; + if (unknown <> 0) then + writeln('unusual file: zero'); + file_pos := f.ReadDWord; + if file_pos <> f.Position + 4 then + writeln('unusual file: face data start position'); + group.face_count := f.ReadDWord; + writeln('faces: ', group.face_count); + + SetLength(group.faces, group.face_count); + for i := 0 to group.face_count - 1 do begin + file_pos := f.Position; + face.flags := f.ReadDWord; //? + face.b1 := f.ReadByte; //46/49/4B + face.b2 := f.ReadByte; //51/71 + face.b3 := f.ReadByte; //0C + face.bsize := f.ReadByte * 4; //block size: A = 40B, 9 = 36 + + unknown := f.ReadWord; + if (unknown <> 0) then + writeln('unusual file: face header separator'); + + //material index + face.material_index := f.ReadWord; + + //face type: quad or triangle + if face.flags and FACE_QUAD > 0 then + face.ftype := 4 + else + face.ftype := 3; + + //read vertex indices + for k := 0 to 3 do + face.indices[k] := f.ReadWord; + + //ext0 + if face.flags and FACE_EXT > 0 then begin + f.ReadDWord; + f.ReadDWord; + end; + + //vertex colors - either per vertex, or the same for all vertices + if face.flags and FACE_COLOR > 0 then begin + if face.flags and FACE_VCOLORS > 0 then begin + for k := 0 to face.ftype - 1 do + face.vertex_colors[k].color := f.ReadDWord; + end else begin + color := f.ReadDWord; + for k := 0 to face.ftype - 1 do + face.vertex_colors[k].color := color; + end; + end; + + //uv coords + if face.flags and FACE_UV > 0 then begin + for k := 0 to face.ftype - 1 do begin + face.tex_coords[k].u := f.ReadWord; + face.tex_coords[k].v := f.ReadWord; + end; + end; + + if DumpFaces then begin + if (face.flags and FACE_QUAD) = 0 then write('t') else write('q'); + write(face.flags:5, face.b1:3, face.b2:4, face.b3:3, face.bsize:3); + write(' mt: ', face.material_index); + write(' verts: '); + for k := 0 to face.ftype - 1 do + write(face.indices[k]:4); + write(' colors: '); + for k := 0 to face.ftype - 1 do + write(IntToHex(face.vertex_colors[k].color, 8), ' '); + if (face.flags and FACE_UV) > 0 then begin + write(' uvs: '); + for k := 0 to face.ftype - 1 do + write('(', face.tex_coords[k].u, ', ', face.tex_coords[k].v, ') '); + end; + end; + + //hack for awing.hob + if f.Position <> (file_pos + face.bsize) then begin + write(' rest:'); + for k := f.Position to file_pos + face.bsize - 1 do + write(IntToHex(f.ReadByte, 2):3); + end; + + if DumpFaces then + writeln; + + group.faces[i] := face; + end; +end; + + +procedure ReadVertices(var group: THobFaceGroup; var f: TMemoryStream; const vertex_count: integer); +var + i: integer; +begin + SetLength(group.vertices, vertex_count); + for i := 0 to vertex_count - 1 do begin + group.vertices[i].x := SmallInt(f.ReadWord); + group.vertices[i].y := SmallInt(f.ReadWord); + group.vertices[i].z := SmallInt(f.ReadWord); + group.vertices[i].unknown := SmallInt(f.ReadWord); + end; +end; + + +procedure ReadFaceGroup(var fg: THobFaceGroup; var f: TMemoryStream); +var + filepos: int64; +begin + //save file position before seeking to face/vertex data and restore it, to read next group properly + filepos := f.Position; + + //read group/meshdef0 + f.Seek(16, fsFromCurrent); //unknown + fg.meshdef1_offset := f.ReadDWord; + writeln('fg meshdef offset:', fg.meshdef1_offset); + + if fg.meshdef1_offset > 0 then begin + //read meshdef1 + f.Seek(fg.meshdef1_offset - 4, fsFromBeginning); + fg.face_block_end_offset := f.ReadDWord; + f.Seek(20, fsFromCurrent); //zero + fg.vertex_count := f.ReadDWord; + f.Seek(8, fsFromCurrent); //zero + fg.face_block_offset := f.ReadDWord; + fg.vertex_block_offset := f.ReadDWord; + + //faces + writeln('faces at: ', fg.face_block_offset, hexStr(fg.face_block_offset, 4):6); + f.Seek(fg.face_block_offset, fsFromBeginning); + ReadFaces(fg, f); + + //vertices + writeln('vertices at: ', fg.vertex_block_offset, hexStr(fg.vertex_block_offset, 4):6); + f.Seek(fg.vertex_block_offset, fsFromBeginning); + ReadVertices(fg, f, fg.vertex_count); + end; + + f.Seek(filepos + 132, fsFromBeginning); +end; + + +procedure ReadObject(var mesh: THobObject; var f: TMemoryStream); +var + i: integer; +begin + f.ReadBuffer(mesh.name, 16); + mesh.face_group_offset := f.ReadDWord; + mesh.face_group_header_offset := f.ReadDWord; + mesh.face_group_header2_offset := f.ReadDWord; + + writeln('object: ', NameToString(mesh.name)); + writeln('face group offset: ', mesh.face_group_offset); + + //get face group count + f.Seek(mesh.face_group_header_offset, fsFromBeginning); //16B zero + mesh.face_group_count := f.ReadWord; //which? + mesh.face_group_count0 := f.ReadWord; + if mesh.face_group_count <> mesh.face_group_count0 then begin + writeln('facegroup counts don''t match!: ', mesh.face_group_count, mesh.face_group_count0:5); + end; + + //read face group defs + SetLength(mesh.face_groups, mesh.face_group_count); + f.Seek(mesh.face_group_offset, fsFromBeginning); + for i := 0 to mesh.face_group_count - 1 do begin + ReadFaceGroup(mesh.face_groups[i], f); + end; + writeln; +end; + + +function ParseHobFile(const fname: string): THobFile; +var + f: TMemoryStream; + hob: THobFile; + i: integer; + filepos: int64; +begin + f := TMemoryStream.Create; + f.LoadFromFile(fname); + + hob.obj_count := f.ReadDWord; + f.ReadDWord; //sometimes face block start, but useless in general + + writeln('objects: ', hob.obj_count); + if hob.obj_count = 0 then begin + writeln('hob file is empty!'); + result := hob; + exit; + end; + + SetLength(hob.objects, hob.obj_count); + for i := 0 to hob.obj_count - 1 do begin + filepos := f.Position; + ReadObject(hob.objects[i], f); + + //seek to next object header + if i + 1 < hob.obj_count then + f.Seek(filepos + 116, fsFromBeginning); + end; + + f.Free; + result := hob; +end; + +end. + diff --git a/hob_display/hob_viewer.lpi b/hob_display/hob_viewer.lpi new file mode 100644 index 0000000..33d0d59 --- /dev/null +++ b/hob_display/hob_viewer.lpi @@ -0,0 +1,95 @@ + + + + + + + + + + + + + + <UseAppBundle Value="False"/> + <ResourceType Value="res"/> + </General> + <i18n> + <EnableI18N LFM="False"/> + </i18n> + <VersionInfo> + <StringTable ProductVersion=""/> + </VersionInfo> + <BuildModes Count="1"> + <Item1 Name="Default" Default="True"/> + </BuildModes> + <PublishOptions> + <Version Value="2"/> + </PublishOptions> + <RunParams> + <local> + <FormatVersion Value="1"/> + <CommandLineParams Value="xwing.hob"/> + </local> + </RunParams> + <RequiredPackages Count="1"> + <Item1> + <PackageName Value="LCL"/> + </Item1> + </RequiredPackages> + <Units Count="5"> + <Unit0> + <Filename Value="hob_viewer.pas"/> + <IsPartOfProject Value="True"/> + <UnitName Value="hob_viewer"/> + </Unit0> + <Unit1> + <Filename Value="simple_model.pas"/> + <IsPartOfProject Value="True"/> + <UnitName Value="simple_model"/> + </Unit1> + <Unit2> + <Filename Value="hob_parser.pas"/> + <IsPartOfProject Value="True"/> + <UnitName Value="hob_parser"/> + </Unit2> + <Unit3> + <Filename Value="hmt_parser.pas"/> + <IsPartOfProject Value="True"/> + <UnitName Value="hmt_parser"/> + </Unit3> + <Unit4> + <Filename Value="rs_image.pas"/> + <IsPartOfProject Value="True"/> + <UnitName Value="rs_image"/> + </Unit4> + </Units> + </ProjectOptions> + <CompilerOptions> + <Version Value="11"/> + <PathDelim Value="\"/> + <Target> + <Filename Value="hob_viewer"/> + </Target> + <SearchPaths> + <IncludeFiles Value="$(ProjOutDir)"/> + <UnitOutputDirectory Value="lib\$(TargetCPU)-$(TargetOS)"/> + </SearchPaths> + <Other> + <CompilerMessages> + <MsgFileName Value=""/> + </CompilerMessages> + <CompilerPath Value="$(CompPath)"/> + </Other> + </CompilerOptions> + <Debugging> + <Exceptions Count="2"> + <Item1> + <Name Value="ECodetoolError"/> + </Item1> + <Item2> + <Name Value="EFOpenError"/> + </Item2> + </Exceptions> + </Debugging> +</CONFIG> diff --git a/hob_display/hob_viewer.pas b/hob_display/hob_viewer.pas new file mode 100644 index 0000000..3983815 --- /dev/null +++ b/hob_display/hob_viewer.pas @@ -0,0 +1,441 @@ +(* +hob_viewer.pas +Copyright (c) 2014 David Pethes + +This file is part of HOB viewer. + +HOB viewer is free software: you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation, either version 3 of the License, or +(at your option) any later version. + +HOB viewer is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. + +You should have received a copy of the GNU General Public License +along with HOB viewer. If not, see <http://www.gnu.org/licenses/>. +*) +program hob_viewer; + +uses + sysutils, + gl, glu, glext, sdl, + simple_model, GenericStructList, hob_parser, hmt_parser, rs_image; + +const + SCR_W_fscrn = 1024; + SCR_H_fscrn = 768; + SCR_W_INIT = 1280; + SCR_H_INIT = 720; + SCREEN_BPP = 0; + RotationAngleIncrement = 1; + ZoomIncrement = 0.3; + MouseZoomDistanceMultiply = 0.15; + PitchIncrement = 0.5; + MouseTranslateMultiply = 0.025; + +var + surface: PSDL_Surface; + done, + fullscreen: boolean; + model: TModel; + + view: record + rotation_angle: single; + distance: single; + pitch: single; + wireframe: boolean; + points: boolean; + vcolors: boolean; + textures: boolean; + autorotate: boolean; + x, y: single; + end; + + key_pressed: record + wireframe: boolean; + vcolors: boolean; + points: boolean; + textures: boolean; + fullscreen: boolean; + autorotate: boolean; + end; + + mouse: record + drag: boolean; + translate: boolean; + last_x, last_y: integer; + resume_autorotate_on_release: boolean; + end; + + +procedure ReportError(s: string); +begin + writeln(s); + halt; +end; + + +// initial parameters +procedure InitGL; +var + ogl_info: string; +begin + ogl_info := format('vendor: %s renderer: %s', [glGetString(GL_VENDOR), glGetString(GL_RENDERER)]); + writeln(ogl_info); + ogl_info := 'version: ' + glGetString(GL_VERSION); + writeln(ogl_info); + + //glShadeModel( GL_SMOOTH ); // Enable smooth shading + glClearColor( 0.0, 0.0, 0.0, 0.0 ); + glClearDepth( 1.0 ); // Depth buffer setup + glEnable( GL_DEPTH_TEST ); // Enables Depth Testing + glDepthFunc( GL_LEQUAL ); // The Type Of Depth Test To Do + glHint( GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST ); // Really Nice Perspective Calculations + + //glEnable( GL_CULL_FACE ); //backface culling + //glCullFace( GL_BACK ); + + glEnable(GL_TEXTURE_2D); +end; + + +// function to reset our viewport after a window resize +procedure ResizeWindow( width, height : integer ); +begin + if ( height = 0 ) then + height := 1; // Protect against a divide by zero + + glViewport( 0, 0, width, height ); // Setup our viewport. + glMatrixMode( GL_PROJECTION ); // change to the projection matrix and set our viewing volume. + glLoadIdentity; + gluPerspective( 45.0, width / height, 0.1, 1000.0 ); // Set our perspective + + glMatrixMode( GL_MODELVIEW ); // Make sure we're changing the model view and not the projection + glLoadIdentity; // Reset The View +end; + +procedure DrawModel; +var + verts: TVertexList; + vert: TVertex; + polygons: TPolyList; + i: integer; + mats: array of TMaterial; + + procedure DrawPoly(quad: TQuad; elements: integer); + var + mat: TMaterial; + k: Integer; + begin + mat := mats[quad.material_index]; + if mat.has_texture then begin + glEnable(GL_TEXTURE_2D); + glBindTexture(GL_TEXTURE_2D, mat.gl_tex_id); + end else + glDisable(GL_TEXTURE_2D); + + if elements = 3 then + glBegin( GL_TRIANGLES ) + else + glBegin( GL_QUADS ); + for k := 0 to elements - 1 do begin + if view.vcolors then + glColor4ubv(@quad.colors[k]); + if view.textures then + glTexCoord2fv(@quad.tex_coords[k, 0]); + glVertex3fv(@quad.vertices[k]); + end; + glEnd; + end; + +begin + glDisable(GL_TEXTURE_2D); + if view.points then begin + verts := model.GetVertices; + glBegin( GL_POINTS ); + glColor3f(0, 1, 0); + for i := 0 to verts.Count - 1 do begin + vert := verts[i]; + glVertex3fv(@vert); + end; + glEnd; + end; + + glColor3f(1, 1, 1); + mats := model.GetMaterials; + + polygons := model.GetTriangles; + for i := 0 to polygons.Count - 1 do + DrawPoly(polygons[i], 3); + + polygons := model.GetQuads; + for i := 0 to polygons.Count - 1 do + DrawPoly(polygons[i], 4); +end; + + +// The main drawing function. +procedure DrawGLScene; +begin + glClear( GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT ); + glLoadIdentity; + + if view.distance < ZoomIncrement then + view.distance := ZoomIncrement; + + glTranslatef(view.x, view.y, -view.distance); + glRotatef(view.rotation_angle, 0.0, 1.0, 0.0); + glRotatef(view.pitch, 1, 0, 0); + + if view.autorotate then + view.rotation_angle += RotationAngleIncrement; + if view.rotation_angle > 360 then + view.rotation_angle -= 360; + + if view.wireframe then + glPolygonMode(GL_FRONT_AND_BACK, GL_LINE) + else + glPolygonMode(GL_FRONT_AND_BACK, GL_FILL); + + DrawModel; + + SDL_GL_SwapBuffers; +end; + + + +procedure SetMode(w, h: word; fullscreen: boolean = false); +var + flags: UInt32; +begin + if fullscreen then + flags := SDL_OPENGL or SDL_FULLSCREEN + else + flags := SDL_OPENGL or SDL_RESIZABLE; + surface := SDL_SetVideoMode( w, h, SCREEN_BPP, flags); + if surface = nil then + ReportError('SDL_SetVideoMode failed'); + SDL_WM_SetCaption('HOB viewer', nil); +end; + +procedure WindowScreenshot(const width, height : integer); +const + head: array[0..8] of word = (0, 2, 0, 0, 0, 0, 0, 0, 24); + counter: integer = 0; +var + buf: pbyte; + f: file; + fname: string; +begin + buf := getmem(width * height * 4); + glReadBuffer(GL_FRONT); + glReadPixels(0, 0, width, height, GL_BGR, GL_UNSIGNED_BYTE, buf); + + fname := format('screenshot_%.4d.tga', [counter]); + AssignFile(f, fname); + Rewrite(f, 1); + head[6] := width; + head[7] := height; + BlockWrite(f, head, sizeof(head)); + BlockWrite(f, buf^, width * height * 3); + CloseFile(f); + counter += 1; + + Freemem(buf); +end; + +procedure InitView; +begin + view.rotation_angle := 0; + view.distance := 6; + view.pitch := 0; + view.x := 0; + view.y := 0; + view.wireframe := false; + view.points := false; + view.autorotate := true; + view.vcolors := true; + view.textures := true; +end; + + +procedure HandleEvent; +var + event: TSDL_Event; +begin + SDL_PollEvent( @event ); + case event.type_ of + SDL_QUITEV: + Done := true; + + SDL_VIDEORESIZE: + begin + SetMode (event.resize.w, event.resize.h); + ResizeWindow( surface^.w, surface^.h ); + end; + + SDL_KEYDOWN: + case event.key.keysym.sym of + SDLK_ESCAPE: + Done := true; + SDLK_F1: + if not key_pressed.fullscreen then begin + if not fullscreen then begin + SetMode(SCR_W_fscrn, SCR_H_fscrn, true); + fullscreen := true; + end else begin + SetMode(SCR_W_INIT, SCR_H_INIT, false); + fullscreen := false; + end; + InitGL; + ResizeWindow( surface^.w, surface^.h ); + key_pressed.fullscreen := true; + end; + SDLK_s: + WindowScreenshot( surface^.w, surface^.h ); + SDLK_PAGEUP: + view.distance += ZoomIncrement; + SDLK_PAGEDOWN: + view.distance -= ZoomIncrement; + SDLK_w: + if not key_pressed.wireframe then begin + view.wireframe := not view.wireframe; + key_pressed.wireframe := true; + end; + SDLK_v: + if not key_pressed.vcolors then begin + view.vcolors := not view.vcolors; + key_pressed.vcolors := true; + end; + SDLK_p: + if not key_pressed.points then begin + view.points := not view.points; + key_pressed.points := true; + end; + SDLK_t: + if not key_pressed.textures then begin + view.textures := not view.textures; + key_pressed.textures := true; + end; + SDLK_r: + if not key_pressed.autorotate then begin + view.autorotate := not view.autorotate; + key_pressed.autorotate := true; + end; + end; + + SDL_KEYUP: + case event.key.keysym.sym of + SDLK_F1: + key_pressed.fullscreen := false; + SDLK_w: + key_pressed.wireframe := false; + SDLK_v: + key_pressed.vcolors := false; + SDLK_p: + key_pressed.points := false; + SDLK_t: + key_pressed.textures := false; + SDLK_r: + key_pressed.autorotate := false; + end; + + SDL_MOUSEBUTTONDOWN: begin + mouse.resume_autorotate_on_release := view.autorotate; + if event.button.button in [1..3] then begin + mouse.drag := true; + mouse.translate := event.button.button in [2]; + mouse.last_x := event.button.x; + mouse.last_y := event.button.y; + view.autorotate := false; + end; + if event.button.button = 5 then + view.distance += view.distance * MouseZoomDistanceMultiply; + if event.button.button = 4 then + view.distance -= view.distance * MouseZoomDistanceMultiply; + end; + SDL_MOUSEBUTTONUP: begin + mouse.drag := false; + view.autorotate := mouse.resume_autorotate_on_release; + end; + + SDL_MOUSEMOTION: begin + if mouse.drag then begin + if not mouse.translate then begin + if event.motion.y <> mouse.last_y then begin + view.pitch += PitchIncrement * event.motion.yrel; + mouse.last_y := event.motion.y; + end; + if event.motion.x <> mouse.last_x then begin + view.rotation_angle += RotationAngleIncrement * event.motion.xrel; + mouse.last_x := event.motion.x; + end; + end else begin + if event.motion.y <> mouse.last_y then begin + view.y -= MouseTranslateMultiply * event.motion.yrel; + mouse.last_y := event.motion.y; + end; + if event.motion.x <> mouse.last_x then begin + view.x += MouseTranslateMultiply * event.motion.xrel; + mouse.last_x := event.motion.x; + end; + end; + end; + end; + end; +end; + +//****************************************************************************** +var + sec, frames: integer; + hob_file, hmt_file: string; + +begin + if Paramcount < 1 then begin + writeln('specify HOB file'); + exit; + end; + hob_file := ParamStr(1); + hmt_file := StringReplace(hob_file, '.hob', '.hmt', [rfIgnoreCase]); + model := TModel.Create; + model.Load(hob_file, hmt_file); + + writeln('Init SDL...'); + SDL_Init( SDL_INIT_VIDEO ); + SDL_GL_SetAttribute( SDL_GL_DOUBLEBUFFER, 1 ); + + SetMode(SCR_W_INIT, SCR_H_INIT); + writeln('Init OpenGL...'); + InitGL; + ResizeWindow( surface^.w, surface^.h ); + + InitView; + model.InitGL; + + sec := SDL_GetTicks; + frames := 0; + Done := False; + key_pressed.wireframe := false; + key_pressed.fullscreen := false; + while not Done do begin + HandleEvent; + + // draw the scene + DrawGLScene; + frames += 1; + if (SDL_GetTicks - sec) >= 1000 then begin + write(frames:3, ' dist: ', view.distance:5:1, ' rot: ', view.rotation_angle:5:1, #13); + frames := 0; + sec := SDL_GetTicks; + end; + SDL_Delay(10); + //WindowScreenshot( surface^.w, surface^.h ); + end; + + model.Free; + SDL_Quit; +end. + diff --git a/hob_display/rs_image.pas b/hob_display/rs_image.pas new file mode 100644 index 0000000..c12a98d --- /dev/null +++ b/hob_display/rs_image.pas @@ -0,0 +1,168 @@ +unit rs_image; +{$mode objfpc}{$H+} + +interface + +uses + Classes, SysUtils; + +type + TRGB = array[0..2] of byte; + PRGB = ^TRGB; + TPalette = array[0..255] of TRGB; + + TRSImage = record + data_size: integer; + width, height: integer; + type_: byte; + sampleBits: byte; + paletteEntries: integer; + pixels: pbyte; + samples: pbyte; + palette: TPalette; + end; + +type + TImageDescription = record + palette_entries: integer; + sample_bits: integer; + //alpha: byte; + end; + +procedure LoadPalette(var image: TRSImage; var f: TMemoryStream); +procedure LoadSamples(var image: TRSImage; var f: TMemoryStream); +procedure DecodePixels(var img: TRSImage); + +//************************************************************************************************** +implementation + +procedure Unpack4To8bit(const src: PByte; const samples: integer; const dst: PByte); +var + i: Integer; + v: byte; +begin + for i := 0 to samples div 2 - 1 do begin + v := src[i]; + dst[i * 2 ] := ((v shr 4) and %1111) shl 4; + dst[i * 2 + 1] := (v and %1111) shl 4; + end; +end; + + +procedure Unpack4bitTo24bitRGB(const src: PByte; const size: integer; const dst: PByte; const pal: TPalette); +var + i: Integer; + index: integer; + dest: PRGB; +begin + dest := PRGB(dst); + for i := 0 to size div 2 - 1 do begin + index := src[i]; + dest[i * 2 ] := pal[(index shr 4) and 15]; + dest[i * 2 + 1] := pal[index and 15]; + end; +end; + + +procedure Unpack8bitTo24bitRGB(const src: PByte; const size: integer; const dst: PByte; const pal: TPalette); +var + i: Integer; + index: integer; + dest: PRGB; +begin + dest := PRGB(dst); + for i := 0 to size - 1 do begin + index := src[i]; + dest[i] := pal[index]; + end; +end; + + +procedure UseOddBytes(const src: PByte; const size: integer; const dst: pbyte); +var + i: integer; +begin + for i := 0 to size - 1 do begin + dst[i] := src[i * 2 + 1]; + end; +end; + + +procedure DecodePixels(var img: TRSImage); +var + size: integer; +begin + img.pixels := nil; + if not(img.type_ in [0, 1, 2, 3, 4, 5]) then exit; + + if img.sampleBits = 32 then begin + size := img.width * img.height * 4; + img.pixels := GetMem(size); + Move(img.samples^, img.pixels^, size); + end; + + if img.sampleBits = 4 then begin + //4bit grayscale + if img.paletteEntries = 0 then begin + size := img.width * img.height; + img.pixels := GetMem(size); + Unpack4To8bit(img.samples, size, img.pixels); + end; + //24bit RGB palettized + if img.paletteEntries = 16 then begin + size := img.width * img.height; + img.pixels := GetMem(size * 3); + Unpack4bitTo24bitRGB(img.samples, size, img.pixels, img.palette); + end; + end; + + if img.sampleBits = 8 then begin + //8bit grayscale + if img.paletteEntries = 0 then begin + size := img.width * img.height; + img.pixels := GetMem(size); + move(img.samples^, img.pixels^, size); + end; + //24bit RGB palettized + if img.paletteEntries = 256 then begin + size := img.width * img.height; + img.pixels := GetMem(size * 3); + Unpack8bitTo24bitRGB(img.samples, size, img.pixels, img.palette); + end; + end; + + if img.sampleBits = 16 then begin + size := img.width * img.height; + img.pixels := GetMem(size); + UseOddBytes(img.samples, size, img.pixels); + end; +end; + + +procedure LoadPalette(var image: TRSImage; var f: TMemoryStream); +var + entries: integer; +begin + entries := image.paletteEntries; + case entries of + 16, 256: f.ReadBuffer(image.palette, entries * 3); //RGB + end; +end; + + +procedure LoadSamples(var image: TRSImage; var f: TMemoryStream); +var + sample_bits: integer; + size: integer; +begin + sample_bits := image.sampleBits; + size := image.width * image.height * sample_bits div 8; + image.samples := getmem(size); + f.ReadBuffer(image.samples^, size); + if image.type_ = 2 then + f.ReadBuffer(image.samples^, size div 4); +end; + + +end. + diff --git a/hob_display/simple_model.pas b/hob_display/simple_model.pas new file mode 100644 index 0000000..a5e0734 --- /dev/null +++ b/hob_display/simple_model.pas @@ -0,0 +1,263 @@ +unit simple_model; +{$mode objfpc}{$H+} + +interface + +uses + Classes, SysUtils, gl, + fgl, GenericStructList, hob_parser, hmt_parser; + +type + TVertex = record + x, y, z: single; + end; + + TQuad = record + vertices: array [0..3] of TVertex; + material_index: integer; + tex_coords: array [0..3, 0..1] of single; + colors: array[0..3] of TRGBA; + end; + + TMaterial = record + has_texture: boolean; + bpp: byte; + gl_tex_id: integer; + width, height: integer; + pixels: pbyte; + end; + + TVertexList = specialize TGenericStructList<TVertex>; + TPolyList = specialize TGenericStructList<TQuad>; + TMaterialArray = array of TMaterial; + + { TModel } + + TModel = class + private + _vertices: TVertexList; + _triangles: TPolyList; + _quads: TPolyList; + _materials: array of TMaterial; + _hmt: THmtFile; + procedure HmtRead(const filename: string); + procedure HobRead(const filename: string); + procedure HobReadMesh(const mesh: THobObject); + public + destructor Destroy; override; + procedure Load(const hob_filename, hmt_filename: string); + function GetTriangles: TPolyList; + function GetQuads: TPolyList; + function GetVertices: TVertexList; + function GetMaterials: TMaterialArray; + procedure InitGL; + end; + +implementation + +{ TModel } + +function FixRange(const coord_i16: smallint): single; +begin + result := 0; + if coord_i16 <> 0 then + result := coord_i16 * (1 / 4000); +end; + +function FixUvRange(const coord_i16: smallint): single; +begin + result := 0; + if coord_i16 <> 0 then + result := coord_i16 * (1 / 4096); +end; + + +procedure TModel.HobReadMesh(const mesh: THobObject); +var + i, k, idx: Integer; + fg: THobFaceGroup; + v: TVertex; + group_vertices: TVertexList; + quad: TQuad; +begin + group_vertices := TVertexList.Create; + for fg in mesh.face_groups do begin + for i := 0 to fg.vertex_count - 1 do begin + v.x := FixRange(fg.vertices[i].x); + v.y := FixRange(fg.vertices[i].y); + v.z := FixRange(fg.vertices[i].z); + //flip Y for OpenGL coord system, otherwise the model is upside down. + //Causes flipping of the texture too, compared to what the game shows + v.y := -v.y; + _vertices.Add(v); + group_vertices.Add(v); + end; + + for i := 0 to fg.face_count - 1 do begin + for k := 0 to fg.faces[i].ftype - 1 do begin + idx := fg.faces[i].indices[k]; + quad.vertices[k] := group_vertices[idx]; + quad.colors[k] := fg.faces[i].vertex_colors[k]; + + quad.material_index := fg.faces[i].material_index; + quad.tex_coords[k, 0] := FixUvRange(fg.faces[i].tex_coords[k].u); + quad.tex_coords[k, 1] := FixUvRange(fg.faces[i].tex_coords[k].v); + end; + if fg.faces[i].ftype = 3 then + _triangles.Add(quad) + else + _quads.Add(quad); + end; + group_vertices.Clear; + end; + group_vertices.Free; +end; + + +procedure TModel.HobRead(const filename: string); +var + i: Integer; + hob: THobFile; +begin + hob := ParseHobFile(filename); + for i := 0 to hob.obj_count - 1 do + HobReadMesh(hob.objects[i]); + WriteLn('vertices: ', _vertices.Count); + WriteLn('faces (tri/quad): ', _triangles.Count + _quads.Count, _triangles.Count:6, _quads.Count:6); +end; + + +procedure TModel.HmtRead(const filename: string); + procedure SetTexByName (var mat: TMaterial; const name: string); + var + i: integer; + tex: THmtTexture; + begin + mat.has_texture := false; + for i := 0 to _hmt.texture_count - 1 do + if _hmt.textures[i].name_string = name then begin + tex := _hmt.textures[i]; + if not (tex.image.type_ in [0,1,3,4]) then + break; + + mat.bpp := 24; + if tex.image.type_ = 4 then + mat.bpp := 8; + + mat.width := tex.width; + mat.height := tex.height; + mat.pixels := tex.image.pixels; + mat.has_texture := true; + + writeln('material texture found: ', name); + break; + end; + end; +var + i: integer; +begin + _hmt := ParseHmtFile(filename); + SetLength(_materials, _hmt.material_count); + for i := 0 to _hmt.material_count - 1 do + SetTexByName(_materials[i], _hmt.materials[i].name_string); +end; + + +destructor TModel.Destroy; +begin + inherited Destroy; + _triangles.Free; +end; + +procedure TModel.Load(const hob_filename, hmt_filename: string); +begin + _vertices := TVertexList.Create; + _triangles := TPolyList.Create; + _quads := TPolyList.Create; + WriteLn('Loading mesh file ', hob_filename); + HobRead(hob_filename); + WriteLn('Loading material file ', hmt_filename); + HmtRead(hmt_filename); +end; + +function TModel.GetTriangles: TPolyList; +begin + result := _triangles; +end; + +function TModel.GetQuads: TPolyList; +begin + result := _quads; +end; + +function TModel.GetVertices: TVertexList; +begin + result := _vertices; +end; + +function TModel.GetMaterials: TMaterialArray; +begin + result := _materials; +end; + +procedure pnm_save(const fname: string; const p: pbyte; const w, h: integer); +var + f: file; + c: PChar; +Begin + c := PChar(format('P6'#10'%d %d'#10'255'#10, [w, h])); + AssignFile (f, fname); + Rewrite (f, 1); + BlockWrite (f, c^, strlen(c)); + BlockWrite (f, p^, w * h * 3); + CloseFile (f); +end; + +procedure pgm_save(fname: string; p: pbyte; w, h: integer) ; +var + f: file; + c: PChar; +Begin + c := PChar(format('P5'#10'%d %d'#10'255'#10, [w, h])); + AssignFile (f, fname); + Rewrite (f, 1); + BlockWrite (f, c^, strlen(c)); + BlockWrite (f, p^, w * h); + CloseFile (f); +end; + +procedure TModel.InitGL; + + procedure GenTexture(var mat: TMaterial); + begin + glGenTextures(1, @mat.gl_tex_id); + glBindTexture(GL_TEXTURE_2D, mat.gl_tex_id); + glPixelStorei(GL_UNPACK_ALIGNMENT, 1); + + if mat.bpp = 24 then begin + glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB8, mat.width, mat.height, 0, GL_RGB, GL_UNSIGNED_BYTE, mat.pixels); + //pnm_save(IntToStr(mat.gl_tex_id)+'.pnm', mat.pixels, mat.width, mat.height); + end; + if mat.bpp = 8 then begin + glTexImage2D(GL_TEXTURE_2D, 0, GL_LUMINANCE, mat.width, mat.height, 0, GL_RED, GL_UNSIGNED_BYTE, mat.pixels); + //pgm_save(IntToStr(mat.gl_tex_id)+'.pgm', mat.pixels, mat.width, mat.height); + end; + + glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR ); + glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR ); + //which mode? + // glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP); + // glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP); + end; + +var + i: integer; +begin + for i := 0 to _hmt.material_count - 1 do begin + if _materials[i].has_texture then + GenTexture(_materials[i]); + end; +end; + +end. +