From 4aeef3803d638f3c380b53d8343d5269022e3371 Mon Sep 17 00:00:00 2001 From: Luc Verhaegen Date: Tue, 16 Jun 2009 14:32:22 +0200 Subject: phnxdeco: Shuffle files around, create basic makefile. --- phnxdeco-0.33.orig/COPYING | 339 -------------------- phnxdeco-0.33.orig/COPYING.LGPL | 504 ------------------------------ phnxdeco-0.33.orig/src/Makefile | 34 --- phnxdeco-0.33.orig/src/kernel.c | 342 --------------------- phnxdeco-0.33.orig/src/phnxdeco.c | 267 ---------------- phnxdeco-0.33.orig/src/phnxdeco.h | 93 ------ phnxdeco-0.33.orig/src/phnxdeco_en.txt | 26 -- phnxdeco-0.33.orig/src/phnxfunc.c | 544 --------------------------------- phnxdeco-0.33.orig/src/phnxhelp.h | 84 ----- phnxdeco-0.33.orig/src/phnxsoft.h | 18 -- phnxdeco-0.33.orig/src/phnxver.h | 17 -- phnxdeco-0.33.orig/src/readme.txt | 41 --- phnxdeco/Makefile | 11 + phnxdeco/kernel.c | 342 +++++++++++++++++++++ phnxdeco/phnxdeco.c | 267 ++++++++++++++++ phnxdeco/phnxdeco.h | 93 ++++++ phnxdeco/phnxfunc.c | 544 +++++++++++++++++++++++++++++++++ phnxdeco/phnxhelp.h | 84 +++++ phnxdeco/phnxsoft.h | 18 ++ phnxdeco/phnxver.h | 17 ++ 20 files changed, 1376 insertions(+), 2309 deletions(-) delete mode 100644 phnxdeco-0.33.orig/COPYING delete mode 100644 phnxdeco-0.33.orig/COPYING.LGPL delete mode 100644 phnxdeco-0.33.orig/src/Makefile delete mode 100644 phnxdeco-0.33.orig/src/kernel.c delete mode 100644 phnxdeco-0.33.orig/src/phnxdeco.c delete mode 100644 phnxdeco-0.33.orig/src/phnxdeco.h delete mode 100644 phnxdeco-0.33.orig/src/phnxdeco_en.txt delete mode 100644 phnxdeco-0.33.orig/src/phnxfunc.c delete mode 100644 phnxdeco-0.33.orig/src/phnxhelp.h delete mode 100644 phnxdeco-0.33.orig/src/phnxsoft.h delete mode 100644 phnxdeco-0.33.orig/src/phnxver.h delete mode 100644 phnxdeco-0.33.orig/src/readme.txt create mode 100644 phnxdeco/Makefile create mode 100644 phnxdeco/kernel.c create mode 100644 phnxdeco/phnxdeco.c create mode 100644 phnxdeco/phnxdeco.h create mode 100644 phnxdeco/phnxfunc.c create mode 100644 phnxdeco/phnxhelp.h create mode 100644 phnxdeco/phnxsoft.h create mode 100644 phnxdeco/phnxver.h diff --git a/phnxdeco-0.33.orig/COPYING b/phnxdeco-0.33.orig/COPYING deleted file mode 100644 index d511905..0000000 --- a/phnxdeco-0.33.orig/COPYING +++ /dev/null @@ -1,339 +0,0 @@ - GNU GENERAL PUBLIC LICENSE - Version 2, June 1991 - - Copyright (C) 1989, 1991 Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -License is intended to guarantee your freedom to share and change free -software--to make sure the software is free for all its users. This -General Public License applies to most of the Free Software -Foundation's software and to any other program whose authors commit to -using it. (Some other Free Software Foundation software is covered by -the GNU Lesser General Public License instead.) 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 -this service 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 make restrictions that forbid -anyone to deny you these rights or to ask you to surrender the rights. -These restrictions translate to certain responsibilities for you if you -distribute copies of the software, or if you modify it. - - For example, if you distribute copies of such a program, whether -gratis or for a fee, you must give the recipients all the rights that -you have. 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. - - We protect your rights with two steps: (1) copyright the software, and -(2) offer you this license which gives you legal permission to copy, -distribute and/or modify the software. - - Also, for each author's protection and ours, we want to make certain -that everyone understands that there is no warranty for this free -software. If the software is modified by someone else and passed on, we -want its recipients to know that what they have is not the original, so -that any problems introduced by others will not reflect on the original -authors' reputations. - - Finally, any free program is threatened constantly by software -patents. We wish to avoid the danger that redistributors of a free -program will individually obtain patent licenses, in effect making the -program proprietary. To prevent this, we have made it clear that any -patent must be licensed for everyone's free use or not licensed at all. - - The precise terms and conditions for copying, distribution and -modification follow. - - GNU GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License applies to any program or other work which contains -a notice placed by the copyright holder saying it may be distributed -under the terms of this General Public License. The "Program", below, -refers to any such program or work, and a "work based on the Program" -means either the Program or any derivative work under copyright law: -that is to say, a work containing the Program or a portion of it, -either verbatim or with modifications and/or translated into another -language. (Hereinafter, translation is included without limitation in -the term "modification".) Each licensee is addressed as "you". - -Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running the Program is not restricted, and the output from the Program -is covered only if its contents constitute a work based on the -Program (independent of having been made by running the Program). -Whether that is true depends on what the Program does. - - 1. You may copy and distribute 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 and disclaimer of warranty; keep intact all the -notices that refer to this License and to the absence of any warranty; -and give any other recipients of the Program a copy of this License -along with the Program. - -You may charge a fee for the physical act of transferring a copy, and -you may at your option offer warranty protection in exchange for a fee. - - 2. You may modify your copy or copies of the Program or any portion -of it, thus forming a work based on the Program, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) You must cause the modified files to carry prominent notices - stating that you changed the files and the date of any change. - - b) You must cause any work that you distribute or publish, that in - whole or in part contains or is derived from the Program or any - part thereof, to be licensed as a whole at no charge to all third - parties under the terms of this License. - - c) If the modified program normally reads commands interactively - when run, you must cause it, when started running for such - interactive use in the most ordinary way, to print or display an - announcement including an appropriate copyright notice and a - notice that there is no warranty (or else, saying that you provide - a warranty) and that users may redistribute the program under - these conditions, and telling the user how to view a copy of this - License. (Exception: if the Program itself is interactive but - does not normally print such an announcement, your work based on - the Program is not required to print an announcement.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Program, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Program, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Program. - -In addition, mere aggregation of another work not based on the Program -with the Program (or with a work based on the Program) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may copy and distribute the Program (or a work based on it, -under Section 2) in object code or executable form under the terms of -Sections 1 and 2 above provided that you also do one of the following: - - a) Accompany it with the complete corresponding machine-readable - source code, which must be distributed under the terms of Sections - 1 and 2 above on a medium customarily used for software interchange; or, - - b) Accompany it with a written offer, valid for at least three - years, to give any third party, for a charge no more than your - cost of physically performing source distribution, a complete - machine-readable copy of the corresponding source code, to be - distributed under the terms of Sections 1 and 2 above on a medium - customarily used for software interchange; or, - - c) Accompany it with the information you received as to the offer - to distribute corresponding source code. (This alternative is - allowed only for noncommercial distribution and only if you - received the program in object code or executable form with such - an offer, in accord with Subsection b above.) - -The source code for a work means the preferred form of the work for -making modifications to it. For an executable work, complete source -code means all the source code for all modules it contains, plus any -associated interface definition files, plus the scripts used to -control compilation and installation of the executable. However, as a -special exception, the source code distributed need not include -anything that is normally distributed (in either source or binary -form) with the major components (compiler, kernel, and so on) of the -operating system on which the executable runs, unless that component -itself accompanies the executable. - -If distribution of executable or object code is made by offering -access to copy from a designated place, then offering equivalent -access to copy the source code from the same place counts as -distribution of the source code, even though third parties are not -compelled to copy the source along with the object code. - - 4. You may not copy, modify, sublicense, or distribute the Program -except as expressly provided under this License. Any attempt -otherwise to copy, modify, sublicense or distribute the Program is -void, and will automatically terminate your rights under this License. -However, parties who have received copies, or rights, from you under -this License will not have their licenses terminated so long as such -parties remain in full compliance. - - 5. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Program or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Program (or any work based on the -Program), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Program or works based on it. - - 6. Each time you redistribute the Program (or any work based on the -Program), the recipient automatically receives a license from the -original licensor to copy, distribute or modify the Program subject to -these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties to -this License. - - 7. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -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 -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Program at all. For example, if a patent -license would not permit royalty-free redistribution of the Program by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Program. - -If any portion of this section is held invalid or unenforceable under -any particular circumstance, the balance of the section is intended to -apply and the section as a whole is intended to apply in other -circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system, which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 8. If the distribution and/or use of the Program is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Program under this License -may add an explicit geographical distribution limitation excluding -those countries, so that distribution is permitted only in or among -countries not thus excluded. In such case, this License incorporates -the limitation as if written in the body of this License. - - 9. The Free Software Foundation may publish revised and/or new versions -of the 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 a version number of this License which applies to it and "any -later version", you have the option of following the terms and conditions -either of that version or of any later version published by the Free -Software Foundation. If the Program does not specify a version number of -this License, you may choose any version ever published by the Free Software -Foundation. - - 10. If you wish to incorporate parts of the Program into other free -programs whose distribution conditions are different, write to the author -to ask for permission. For software which is copyrighted by the Free -Software Foundation, write to the Free Software Foundation; we sometimes -make exceptions for this. Our decision will be guided by the two goals -of preserving the free status of all derivatives of our free software and -of promoting the sharing and reuse of software generally. - - NO WARRANTY - - 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, 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. - - 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING -WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR -REDISTRIBUTE 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. - - 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 -convey 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 2 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, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. - -Also add information on how to contact you by electronic and paper mail. - -If the program is interactive, make it output a short notice like this -when it starts in an interactive mode: - - Gnomovision version 69, Copyright (C) year name of author - Gnomovision 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, the commands you use may -be called something other than `show w' and `show c'; they could even be -mouse-clicks or menu items--whatever suits your program. - -You should also get your employer (if you work as a programmer) or your -school, if any, to sign a "copyright disclaimer" for the program, if -necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the program - `Gnomovision' (which makes passes at compilers) written by James Hacker. - - , 1 April 1989 - Ty Coon, President of Vice - -This 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. diff --git a/phnxdeco-0.33.orig/COPYING.LGPL b/phnxdeco-0.33.orig/COPYING.LGPL deleted file mode 100644 index 5ab7695..0000000 --- a/phnxdeco-0.33.orig/COPYING.LGPL +++ /dev/null @@ -1,504 +0,0 @@ - GNU LESSER GENERAL PUBLIC LICENSE - Version 2.1, February 1999 - - Copyright (C) 1991, 1999 Free Software Foundation, Inc. - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA - Everyone is permitted to copy and distribute verbatim copies - of this license document, but changing it is not allowed. - -[This is the first released version of the Lesser GPL. It also counts - as the successor of the GNU Library Public License, version 2, hence - the version number 2.1.] - - Preamble - - The licenses for most software are designed to take away your -freedom to share and change it. By contrast, the GNU General Public -Licenses are intended to guarantee your freedom to share and change -free software--to make sure the software is free for all its users. - - This license, the Lesser General Public License, applies to some -specially designated software packages--typically libraries--of the -Free Software Foundation and other authors who decide to use it. You -can use it too, but we suggest you first think carefully about whether -this license or the ordinary General Public License is the better -strategy to use in any particular case, based on the explanations below. - - When we speak of free software, we are referring to freedom of use, -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 this service if you wish); that you receive source code or can get -it if you want it; that you can change the software and use pieces of -it in new free programs; and that you are informed that you can do -these things. - - To protect your rights, we need to make restrictions that forbid -distributors to deny you these rights or to ask you to surrender these -rights. These restrictions translate to certain responsibilities for -you if you distribute copies of the library or if you modify it. - - For example, if you distribute copies of the library, whether gratis -or for a fee, you must give the recipients all the rights that we gave -you. You must make sure that they, too, receive or can get the source -code. If you link other code with the library, you must provide -complete object files to the recipients, so that they can relink them -with the library after making changes to the library and recompiling -it. And you must show them these terms so they know their rights. - - We protect your rights with a two-step method: (1) we copyright the -library, and (2) we offer you this license, which gives you legal -permission to copy, distribute and/or modify the library. - - To protect each distributor, we want to make it very clear that -there is no warranty for the free library. Also, if the library is -modified by someone else and passed on, the recipients should know -that what they have is not the original version, so that the original -author's reputation will not be affected by problems that might be -introduced by others. - - Finally, software patents pose a constant threat to the existence of -any free program. We wish to make sure that a company cannot -effectively restrict the users of a free program by obtaining a -restrictive license from a patent holder. Therefore, we insist that -any patent license obtained for a version of the library must be -consistent with the full freedom of use specified in this license. - - Most GNU software, including some libraries, is covered by the -ordinary GNU General Public License. This license, the GNU Lesser -General Public License, applies to certain designated libraries, and -is quite different from the ordinary General Public License. We use -this license for certain libraries in order to permit linking those -libraries into non-free programs. - - When a program is linked with a library, whether statically or using -a shared library, the combination of the two is legally speaking a -combined work, a derivative of the original library. The ordinary -General Public License therefore permits such linking only if the -entire combination fits its criteria of freedom. The Lesser General -Public License permits more lax criteria for linking other code with -the library. - - We call this license the "Lesser" General Public License because it -does Less to protect the user's freedom than the ordinary General -Public License. It also provides other free software developers Less -of an advantage over competing non-free programs. These disadvantages -are the reason we use the ordinary General Public License for many -libraries. However, the Lesser license provides advantages in certain -special circumstances. - - For example, on rare occasions, there may be a special need to -encourage the widest possible use of a certain library, so that it becomes -a de-facto standard. To achieve this, non-free programs must be -allowed to use the library. A more frequent case is that a free -library does the same job as widely used non-free libraries. In this -case, there is little to gain by limiting the free library to free -software only, so we use the Lesser General Public License. - - In other cases, permission to use a particular library in non-free -programs enables a greater number of people to use a large body of -free software. For example, permission to use the GNU C Library in -non-free programs enables many more people to use the whole GNU -operating system, as well as its variant, the GNU/Linux operating -system. - - Although the Lesser General Public License is Less protective of the -users' freedom, it does ensure that the user of a program that is -linked with the Library has the freedom and the wherewithal to run -that program using a modified version of the Library. - - The precise terms and conditions for copying, distribution and -modification follow. Pay close attention to the difference between a -"work based on the library" and a "work that uses the library". The -former contains code derived from the library, whereas the latter must -be combined with the library in order to run. - - GNU LESSER GENERAL PUBLIC LICENSE - TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION - - 0. This License Agreement applies to any software library or other -program which contains a notice placed by the copyright holder or -other authorized party saying it may be distributed under the terms of -this Lesser General Public License (also called "this License"). -Each licensee is addressed as "you". - - A "library" means a collection of software functions and/or data -prepared so as to be conveniently linked with application programs -(which use some of those functions and data) to form executables. - - The "Library", below, refers to any such software library or work -which has been distributed under these terms. A "work based on the -Library" means either the Library or any derivative work under -copyright law: that is to say, a work containing the Library or a -portion of it, either verbatim or with modifications and/or translated -straightforwardly into another language. (Hereinafter, translation is -included without limitation in the term "modification".) - - "Source code" for a work means the preferred form of the work for -making modifications to it. For a library, complete source code means -all the source code for all modules it contains, plus any associated -interface definition files, plus the scripts used to control compilation -and installation of the library. - - Activities other than copying, distribution and modification are not -covered by this License; they are outside its scope. The act of -running a program using the Library is not restricted, and output from -such a program is covered only if its contents constitute a work based -on the Library (independent of the use of the Library in a tool for -writing it). Whether that is true depends on what the Library does -and what the program that uses the Library does. - - 1. You may copy and distribute verbatim copies of the Library's -complete source code as you receive it, in any medium, provided that -you conspicuously and appropriately publish on each copy an -appropriate copyright notice and disclaimer of warranty; keep intact -all the notices that refer to this License and to the absence of any -warranty; and distribute a copy of this License along with the -Library. - - You may charge a fee for the physical act of transferring a copy, -and you may at your option offer warranty protection in exchange for a -fee. - - 2. You may modify your copy or copies of the Library or any portion -of it, thus forming a work based on the Library, and copy and -distribute such modifications or work under the terms of Section 1 -above, provided that you also meet all of these conditions: - - a) The modified work must itself be a software library. - - b) You must cause the files modified to carry prominent notices - stating that you changed the files and the date of any change. - - c) You must cause the whole of the work to be licensed at no - charge to all third parties under the terms of this License. - - d) If a facility in the modified Library refers to a function or a - table of data to be supplied by an application program that uses - the facility, other than as an argument passed when the facility - is invoked, then you must make a good faith effort to ensure that, - in the event an application does not supply such function or - table, the facility still operates, and performs whatever part of - its purpose remains meaningful. - - (For example, a function in a library to compute square roots has - a purpose that is entirely well-defined independent of the - application. Therefore, Subsection 2d requires that any - application-supplied function or table used by this function must - be optional: if the application does not supply it, the square - root function must still compute square roots.) - -These requirements apply to the modified work as a whole. If -identifiable sections of that work are not derived from the Library, -and can be reasonably considered independent and separate works in -themselves, then this License, and its terms, do not apply to those -sections when you distribute them as separate works. But when you -distribute the same sections as part of a whole which is a work based -on the Library, the distribution of the whole must be on the terms of -this License, whose permissions for other licensees extend to the -entire whole, and thus to each and every part regardless of who wrote -it. - -Thus, it is not the intent of this section to claim rights or contest -your rights to work written entirely by you; rather, the intent is to -exercise the right to control the distribution of derivative or -collective works based on the Library. - -In addition, mere aggregation of another work not based on the Library -with the Library (or with a work based on the Library) on a volume of -a storage or distribution medium does not bring the other work under -the scope of this License. - - 3. You may opt to apply the terms of the ordinary GNU General Public -License instead of this License to a given copy of the Library. To do -this, you must alter all the notices that refer to this License, so -that they refer to the ordinary GNU General Public License, version 2, -instead of to this License. (If a newer version than version 2 of the -ordinary GNU General Public License has appeared, then you can specify -that version instead if you wish.) Do not make any other change in -these notices. - - Once this change is made in a given copy, it is irreversible for -that copy, so the ordinary GNU General Public License applies to all -subsequent copies and derivative works made from that copy. - - This option is useful when you wish to copy part of the code of -the Library into a program that is not a library. - - 4. You may copy and distribute the Library (or a portion or -derivative of it, under Section 2) in object code or executable form -under the terms of Sections 1 and 2 above provided that you accompany -it with the complete corresponding machine-readable source code, which -must be distributed under the terms of Sections 1 and 2 above on a -medium customarily used for software interchange. - - If distribution of object code is made by offering access to copy -from a designated place, then offering equivalent access to copy the -source code from the same place satisfies the requirement to -distribute the source code, even though third parties are not -compelled to copy the source along with the object code. - - 5. A program that contains no derivative of any portion of the -Library, but is designed to work with the Library by being compiled or -linked with it, is called a "work that uses the Library". Such a -work, in isolation, is not a derivative work of the Library, and -therefore falls outside the scope of this License. - - However, linking a "work that uses the Library" with the Library -creates an executable that is a derivative of the Library (because it -contains portions of the Library), rather than a "work that uses the -library". The executable is therefore covered by this License. -Section 6 states terms for distribution of such executables. - - When a "work that uses the Library" uses material from a header file -that is part of the Library, the object code for the work may be a -derivative work of the Library even though the source code is not. -Whether this is true is especially significant if the work can be -linked without the Library, or if the work is itself a library. The -threshold for this to be true is not precisely defined by law. - - If such an object file uses only numerical parameters, data -structure layouts and accessors, and small macros and small inline -functions (ten lines or less in length), then the use of the object -file is unrestricted, regardless of whether it is legally a derivative -work. (Executables containing this object code plus portions of the -Library will still fall under Section 6.) - - Otherwise, if the work is a derivative of the Library, you may -distribute the object code for the work under the terms of Section 6. -Any executables containing that work also fall under Section 6, -whether or not they are linked directly with the Library itself. - - 6. As an exception to the Sections above, you may also combine or -link a "work that uses the Library" with the Library to produce a -work containing portions of the Library, and distribute that work -under terms of your choice, provided that the terms permit -modification of the work for the customer's own use and reverse -engineering for debugging such modifications. - - You must give prominent notice with each copy of the work that the -Library is used in it and that the Library and its use are covered by -this License. You must supply a copy of this License. If the work -during execution displays copyright notices, you must include the -copyright notice for the Library among them, as well as a reference -directing the user to the copy of this License. Also, you must do one -of these things: - - a) Accompany the work with the complete corresponding - machine-readable source code for the Library including whatever - changes were used in the work (which must be distributed under - Sections 1 and 2 above); and, if the work is an executable linked - with the Library, with the complete machine-readable "work that - uses the Library", as object code and/or source code, so that the - user can modify the Library and then relink to produce a modified - executable containing the modified Library. (It is understood - that the user who changes the contents of definitions files in the - Library will not necessarily be able to recompile the application - to use the modified definitions.) - - b) Use a suitable shared library mechanism for linking with the - Library. A suitable mechanism is one that (1) uses at run time a - copy of the library already present on the user's computer system, - rather than copying library functions into the executable, and (2) - will operate properly with a modified version of the library, if - the user installs one, as long as the modified version is - interface-compatible with the version that the work was made with. - - c) Accompany the work with a written offer, valid for at - least three years, to give the same user the materials - specified in Subsection 6a, above, for a charge no more - than the cost of performing this distribution. - - d) If distribution of the work is made by offering access to copy - from a designated place, offer equivalent access to copy the above - specified materials from the same place. - - e) Verify that the user has already received a copy of these - materials or that you have already sent this user a copy. - - For an executable, the required form of the "work that uses the -Library" must include any data and utility programs needed for -reproducing the executable from it. However, as a special exception, -the materials to be distributed need not include anything that is -normally distributed (in either source or binary form) with the major -components (compiler, kernel, and so on) of the operating system on -which the executable runs, unless that component itself accompanies -the executable. - - It may happen that this requirement contradicts the license -restrictions of other proprietary libraries that do not normally -accompany the operating system. Such a contradiction means you cannot -use both them and the Library together in an executable that you -distribute. - - 7. You may place library facilities that are a work based on the -Library side-by-side in a single library together with other library -facilities not covered by this License, and distribute such a combined -library, provided that the separate distribution of the work based on -the Library and of the other library facilities is otherwise -permitted, and provided that you do these two things: - - a) Accompany the combined library with a copy of the same work - based on the Library, uncombined with any other library - facilities. This must be distributed under the terms of the - Sections above. - - b) Give prominent notice with the combined library of the fact - that part of it is a work based on the Library, and explaining - where to find the accompanying uncombined form of the same work. - - 8. You may not copy, modify, sublicense, link with, or distribute -the Library except as expressly provided under this License. Any -attempt otherwise to copy, modify, sublicense, link with, or -distribute the Library is void, and will automatically terminate your -rights under this License. However, parties who have received copies, -or rights, from you under this License will not have their licenses -terminated so long as such parties remain in full compliance. - - 9. You are not required to accept this License, since you have not -signed it. However, nothing else grants you permission to modify or -distribute the Library or its derivative works. These actions are -prohibited by law if you do not accept this License. Therefore, by -modifying or distributing the Library (or any work based on the -Library), you indicate your acceptance of this License to do so, and -all its terms and conditions for copying, distributing or modifying -the Library or works based on it. - - 10. Each time you redistribute the Library (or any work based on the -Library), the recipient automatically receives a license from the -original licensor to copy, distribute, link with or modify the Library -subject to these terms and conditions. You may not impose any further -restrictions on the recipients' exercise of the rights granted herein. -You are not responsible for enforcing compliance by third parties with -this License. - - 11. If, as a consequence of a court judgment or allegation of patent -infringement or for any other reason (not limited to patent issues), -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 -distribute so as to satisfy simultaneously your obligations under this -License and any other pertinent obligations, then as a consequence you -may not distribute the Library at all. For example, if a patent -license would not permit royalty-free redistribution of the Library by -all those who receive copies directly or indirectly through you, then -the only way you could satisfy both it and this License would be to -refrain entirely from distribution of the Library. - -If any portion of this section is held invalid or unenforceable under any -particular circumstance, the balance of the section is intended to apply, -and the section as a whole is intended to apply in other circumstances. - -It is not the purpose of this section to induce you to infringe any -patents or other property right claims or to contest validity of any -such claims; this section has the sole purpose of protecting the -integrity of the free software distribution system which is -implemented by public license practices. Many people have made -generous contributions to the wide range of software distributed -through that system in reliance on consistent application of that -system; it is up to the author/donor to decide if he or she is willing -to distribute software through any other system and a licensee cannot -impose that choice. - -This section is intended to make thoroughly clear what is believed to -be a consequence of the rest of this License. - - 12. If the distribution and/or use of the Library is restricted in -certain countries either by patents or by copyrighted interfaces, the -original copyright holder who places the Library under this License may add -an explicit geographical distribution limitation excluding those countries, -so that distribution is permitted only in or among countries not thus -excluded. In such case, this License incorporates the limitation as if -written in the body of this License. - - 13. The Free Software Foundation may publish revised and/or new -versions of the Lesser 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 Library -specifies a version number of this License which applies to it and -"any later version", you have the option of following the terms and -conditions either of that version or of any later version published by -the Free Software Foundation. If the Library does not specify a -license version number, you may choose any version ever published by -the Free Software Foundation. - - 14. If you wish to incorporate parts of the Library into other free -programs whose distribution conditions are incompatible with these, -write to the author to ask for permission. For software which is -copyrighted by the Free Software Foundation, write to the Free -Software Foundation; we sometimes make exceptions for this. Our -decision will be guided by the two goals of preserving the free status -of all derivatives of our free software and of promoting the sharing -and reuse of software generally. - - NO WARRANTY - - 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO -WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. -EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR -OTHER PARTIES PROVIDE THE LIBRARY "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 -LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME -THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. - - 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN -WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY -AND/OR REDISTRIBUTE THE LIBRARY 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 -LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF -SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH -DAMAGES. - - END OF TERMS AND CONDITIONS - - How to Apply These Terms to Your New Libraries - - If you develop a new library, and you want it to be of the greatest -possible use to the public, we recommend making it free software that -everyone can redistribute and change. You can do so by permitting -redistribution under these terms (or, alternatively, under the terms of the -ordinary General Public License). - - To apply these terms, attach the following notices to the library. It is -safest to attach them to the start of each source file to most effectively -convey 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 library is free software; you can redistribute it and/or - modify it under the terms of the GNU Lesser General Public - License as published by the Free Software Foundation; either - version 2.1 of the License, or (at your option) any later version. - - This library 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 - Lesser General Public License for more details. - - You should have received a copy of the GNU Lesser General Public - License along with this library; if not, write to the Free Software - Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA - -Also add information on how to contact you by electronic and paper mail. - -You should also get your employer (if you work as a programmer) or your -school, if any, to sign a "copyright disclaimer" for the library, if -necessary. Here is a sample; alter the names: - - Yoyodyne, Inc., hereby disclaims all copyright interest in the - library `Frob' (a library for tweaking knobs) written by James Random Hacker. - - , 1 April 1990 - Ty Coon, President of Vice - -That's all there is to it! - - diff --git a/phnxdeco-0.33.orig/src/Makefile b/phnxdeco-0.33.orig/src/Makefile deleted file mode 100644 index ebfcad2..0000000 --- a/phnxdeco-0.33.orig/src/Makefile +++ /dev/null @@ -1,34 +0,0 @@ -# -# Main Makefile -# (c) 2002 -# - -MAKE = make - -phnxdeco: - DEMO="" - gcc -DDEBUG $(DEMO) phnxdeco.c phnxfunc.o kernel.o -s -fpack-struct -o phnxdeco - -phnxdeco-demo: - DEMO=1 - gcc -DDEBUG=$(DEMO) phnxdeco.c phnxfunc.o kernel.o -s -fpack-struct -o phnxdeco-demo - -phnxfunc: - gcc phnxfunc.c -c -o phnxfunc.o -fpack-struct - -kernel: - gcc kernel.c -c -o kernel.o -fpack-struct - -clean: - rm -f *.o - rm -f phnxdeco - -rebuild: - make clean - make phnxfunc - make kernel - make phnxdeco - -rebuild-demo: - make clean - make phnxdeco-demo diff --git a/phnxdeco-0.33.orig/src/kernel.c b/phnxdeco-0.33.orig/src/kernel.c deleted file mode 100644 index f447086..0000000 --- a/phnxdeco-0.33.orig/src/kernel.c +++ /dev/null @@ -1,342 +0,0 @@ -/********************************************** -*** -*** -*** These decompression routines based on -*** LZHUFF algo from LHA archiver -*** -*** -***********************************************/ - -#include -#include -#include - -#define UCHAR_MAX ((1<<(sizeof(unsigned char)*8))-1) -#define CHAR_BIT 8 - -#define CBIT 9 -#define USHRT_BIT 16 /* (CHAR_BIT * sizeof(ushort)) */ - -#define MAX_DICBIT 13 -#define MAX_DICSIZ (1 << MAX_DICBIT) -#define MATCHBIT 8 -#define MAXMATCH 256 -#define THRESHOLD 3 -#define NC (UCHAR_MAX + MAXMATCH + 2 - THRESHOLD) - -#define NP (MAX_DICBIT + 1) -#define NT (USHRT_BIT + 3) -#define PBIT 4 -#define TBIT 5 -#define NPT 0x80 - -unsigned long origsize, compsize; -unsigned short dicbit; -unsigned short maxmatch; -unsigned long count; -unsigned short loc; -unsigned char *text; - -static unsigned short dicsiz; - -static unsigned char subbitbuf, bitcount; - -unsigned short crc, bitbuf; -int prev_char; -long reading_size; - -unsigned short left[2 * NC - 1], right[2 * NC - 1]; -unsigned char c_len[NC], pt_len[NPT]; -unsigned short c_table[4096], c_code[NC], - pt_table[256], pt_code[NPT]; -static unsigned char *buf; -static unsigned short bufsiz; -static unsigned short blocksize; - -FILE *infile, *outfile; - -typedef struct { - FILE *infile; - FILE *outfile; - unsigned long original; - unsigned long packed; - int dicbit; - int method; -} interfacing ; - - -static short c, n, tblsiz, len, depth, maxdepth, avail; -static unsigned short codeword, bit, *tbl; -static unsigned char *blen; - -/****************************************/ -/* mktbl() */ -/****************************************/ -static short mktbl(void) -{ - short i; - - if (len == depth) { - while (++c < n) - if (blen[c] == len) { - i = codeword; codeword += bit; - if (codeword > tblsiz) { printf("\nBad Table!"); exit(1); } - while (i < codeword) tbl[i++] = c; - return c; - } - c = -1; len++; bit >>= 1; - } - depth++; - if (depth < maxdepth) { - (void) mktbl(); (void) mktbl(); - } else if (depth > USHRT_BIT) { - { printf("\nBad Table [2]"); exit(1); } - } else { - if ((i = avail++) >= 2 * n - 1) { printf("\nBad Table [3]"); exit(1); } - left[i] = mktbl(); right[i] = mktbl(); - if (codeword >= tblsiz) { printf("\nBad Table [4]"); exit(1); } - if (depth == maxdepth) tbl[codeword++] = i; - } - depth--; - return i; -} - -/****************************************/ -/* make_table() */ -/****************************************/ -void make_table(short nchar, unsigned char bitlen[], - short tablebits, unsigned short table[]) -{ - n = avail = nchar; blen = bitlen; tbl = table; - tblsiz = 1U << tablebits; bit = tblsiz / 2; - maxdepth = tablebits + 1; - depth = len = 1; c = -1; codeword = 0; - (void) mktbl(); /* left subtree */ - (void) mktbl(); /* right subtree */ - if (codeword != tblsiz) { printf("\nBad Table [5]"); exit(1); } -} - - - -/****************************************/ -/* fillbif() */ -/****************************************/ -void fillbuf(unsigned char n) /* Shift bitbuf n bits left, read n bits */ -{ - while (n > bitcount) { - n -= bitcount; - bitbuf = (bitbuf << bitcount) + (subbitbuf >> (CHAR_BIT - bitcount)); - if (compsize != 0) { - compsize--; subbitbuf = (unsigned char) getc(infile); - } else subbitbuf = 0; - bitcount = CHAR_BIT; - } - bitcount -= n; - bitbuf = (bitbuf << n) + (subbitbuf >> (CHAR_BIT - n)); - subbitbuf <<= n; -} - - -/****************************************/ -/* getbits() */ -/****************************************/ -unsigned short getbits(unsigned char n) -{ - unsigned short x; - - x = bitbuf >> (2 * CHAR_BIT - n); fillbuf(n); - return x; -} - -/****************************************/ -/* fwrite_crc() */ -/****************************************/ -void fwrite_crc( unsigned char *p, int n, FILE *fp ) -{ - - if ( fp ) - { - if (fwrite(p, 1, n, fp) < n) - { printf("\nFatal Error"); exit(1); } - } -} - -/****************************************/ -/* init_getbits() */ -/****************************************/ -void init_getbits(void) -{ - bitbuf = 0; subbitbuf = 0; bitcount = 0; - fillbuf(2 * CHAR_BIT); -} - - -/********************************************/ -/************* DECODE ***********************/ - -static void read_pt_len(short nn, short nbit, short i_special) -{ - short i, c, n; - - n = getbits(nbit); - if (n == 0) { - c = getbits(nbit); - for (i = 0; i < nn; i++) pt_len[i] = 0; - for (i = 0; i < 256; i++) pt_table[i] = c; - } else { - i = 0; - while (i < n) { - c = bitbuf >> (16 - 3); - if (c == 7) { - unsigned short mask = 1 << (16 - 4); - while (mask & bitbuf) { mask >>= 1; c++; } - } - fillbuf((c < 7) ? 3 : c - 3); - pt_len[i++] = c; - if (i == i_special) { - c = getbits(2); - while (--c >= 0) pt_len[i++] = 0; - } - } - while (i < nn) pt_len[i++] = 0; - make_table(nn, pt_len, 8, pt_table); - } -} - -static void read_c_len(void) -{ - short i, c, n; - - n = getbits(CBIT); - if (n == 0) { - c = getbits(CBIT); - for (i = 0; i < NC; i++) c_len[i] = 0; - for (i = 0; i < 4096; i++) c_table[i] = c; - } else { - i = 0; - while (i < n) { - c = pt_table[bitbuf >> (16 - 8)]; - if (c >= NT) { - unsigned short mask = 1 << (16 - 9); - do { - if (bitbuf & mask) c = right[c]; - else c = left [c]; - mask >>= 1; - } while (c >= NT); - } - fillbuf(pt_len[c]); - if (c <= 2) { - if (c == 0) c = 1; - else if (c == 1) c = getbits(4) + 3; - else c = getbits(CBIT) + 20; - while (--c >= 0) c_len[i++] = 0; - } else c_len[i++] = c - 2; - } - while (i < NC) c_len[i++] = 0; - make_table(NC, c_len, 12, c_table); - } -} - -unsigned short decode_c_st1(void) -{ - unsigned short j, mask; - - if (blocksize == 0) { - blocksize = getbits(16); - read_pt_len(NT, TBIT, 3); - read_c_len(); - read_pt_len(NP, PBIT, -1); - } - blocksize--; - j = c_table[bitbuf >> 4]; - if (j < NC) fillbuf(c_len[j]); - else { - fillbuf(12); mask = 1 << (16 - 1); - do { - if (bitbuf & mask) j = right[j]; - else j = left [j]; - mask >>= 1; - } while (j >= NC); - fillbuf(c_len[j] - 12); - } - return j; -} - -unsigned short decode_p_st1(void) -{ - unsigned short j, mask; - - j = pt_table[bitbuf >> (16 - 8)]; - if (j < NP) fillbuf(pt_len[j]); - else { - fillbuf(8); mask = 1 << (16 - 1); - do { - if (bitbuf & mask) j = right[j]; - else j = left [j]; - mask >>= 1; - } while (j >= NP); - fillbuf(pt_len[j] - 8); - } - if (j != 0) j = (1 << (j - 1)) + getbits(j - 1); - return j; -} - -void decode_start_st1(void) -{ - init_getbits(); - blocksize = 0; -} - -/********end of decode***********************/ - -void decode(interfacing interface) -{ - int i, j, k, c, dicsiz1, offset; - - infile = interface.infile; - outfile = interface.outfile; - dicbit = interface.dicbit; - origsize = interface.original; - compsize = interface.packed; - crc = 0; - prev_char = -1; - dicsiz = 1 << dicbit; - text = (unsigned char *)malloc(dicsiz); - if (text == NULL) exit( 1 ); - - memset(text, ' ', dicsiz); - decode_start_st1(); - - dicsiz1 = dicsiz - 1; - offset = 0x100 - 3; - count = 0; loc = 0; - while (count < origsize) { - - c= decode_c_st1(); - - if (c <= UCHAR_MAX) { - text[loc++] = c; - if (loc == dicsiz) { - fwrite_crc(text, dicsiz, outfile); - loc = 0; - } - count++; - } else { - j = c - offset; - i = (loc - decode_p_st1() - 1) & dicsiz1; - count += j; - for (k = 0; k < j; k++) { - c = text[(i + k) & dicsiz1]; - text[loc++] = c; - if (loc == dicsiz) { - fwrite_crc(text, dicsiz, outfile); - loc = 0; - } - } - } - } - if (loc != 0) { - fwrite_crc(text, loc, outfile); - } - free(text); -} diff --git a/phnxdeco-0.33.orig/src/phnxdeco.c b/phnxdeco-0.33.orig/src/phnxdeco.c deleted file mode 100644 index 658892a..0000000 --- a/phnxdeco-0.33.orig/src/phnxdeco.c +++ /dev/null @@ -1,267 +0,0 @@ -/* - * Phoenix BIOS Decompress - * - * Copyright (C) 2000, 2002, 2003 Anthony Borisow - * - * 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 2, 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; see the file COPYING. If not, write to - * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. - */ - -#include -#include - -#if defined(LINUX) || defined(__LINUX__) || defined(__linux__) - #include - #define __LINUX_NOW__ -#else - #include - #include -#endif - -#include "./phnxdeco.h" -#include "./phnxsoft.h" -#include "./phnxver.h" -#include "./phnxhelp.h" - -int main(byte argc, byte *argv[]) -{ - FILE *ptx; - byte *Buf; - dword CurPos, fLen, Start, Offset; - word i, Len, FirstBLK, BBsz, BANKsz; - dword POSTOff, SYSOff, FCPOff, FirstBLKf; - byte PhBIOS[] = "Phoenix FirstBIOS", PhVersion[3], PhRelease[3], phtime[8]; - byte BCPSEGMENT[] = "BCPSEGMENT"; - byte BCPFCP[] = "BCPFCP"; - AMIDATE phdate; - byte TotalSections = 0, Action, Mods = 0; - PHNXID IDMod; - - byte __COPY__ = 0; - - -#ifndef __LINUX_NOW__ - clrscr(); -#endif - - -#ifdef __DEBUG__ -// argv[1] = "C:\\phnx\\z.bin"; - argv[1] = "C:\\phnx\\10410.bin"; -// argv[1] = "C:\\firmware.111"; - argv[2] = "-l"; - argc = 3; -#endif - - switch( HelpSystem(argc,argv) ){ - case 0x80: return 0; - case 0x50: __COPY__ = 1; - case 0x10: Action = Xtract; break; - case 0x51: __COPY__ = 1; - case 0x11: Action = List; break; - case 0x60: __COPY__ = 1; - case 0x20: Action = XtractM; break; - case 0x61: __COPY__ = 1; - case 0x21: Action = ListM; break; - default: - PrintUsage(); - printf("\n"); - return 0; - } - - PrintHeader("\n\n"); - - if( (ptx = fopen(argv[1],"rb")) == NULL ) - { - printf("\nFATAL ERROR: File %s opening error...\n", argv[1]); - return 0; - }; - - Buf = (byte*)calloc( BLOCK, 1 ); - if(!Buf) - { - printf("Memory Error..\n"); - return 0; - } - - CurPos = 0; - IDMod.Name[0] = 0xff; IDMod.Len = 0xff; - POSTOff = 0; SYSOff = 0; - - fseek( ptx, 0, 2 ); - fLen = ftell(ptx); - rewind(ptx); - printf("Filelength\t: %lX (%lu bytes)\n", fLen, fLen); - printf("Filename\t: %s\n", argv[1]); - - - while(!feof(ptx)) - { - fread(Buf, 1, BLOCK, ptx); - if( (CurPos = FoundAt(ptx, Buf, BCPSEGMENT, BLOCK)) != 0 ) break; - /*-----O'K, we got PhoenixBIOS BCPSEGMENT hook-------*/ - CurPos = ftell(ptx) - 0x100; - - } - - if(feof(ptx)) - { - printf("Searched through file. Not a PhoenixBIOS\n"); - exit(1); - } - - printf("PhoenixBIOS hook found at\t: %lX\n", CurPos); - CurPos += 10; - fseek(ptx, (dword)(CurPos), 0); - - while( IDMod.Name[0] != 0x0 && IDMod.Len != 0x0) - { - fread(&IDMod, 1, sizeof(IDMod), ptx); - - /*--------Wrong Count w/ ALR and some S/N --------- - internal errors ? - ---------------------------------------------------*/ - if( IDMod.Name[0] < 0x41 && IDMod.Name[0] != 0x0 ) - { - do { - fread(Buf, 1, 1, ptx); - } while( Buf[0] != 0x42 ); - fseek(ptx, -1L, SEEK_CUR); - CurPos = ftell(ptx); - fread(&IDMod, 1, sizeof(IDMod), ptx); - }; - - if( memcmp(IDMod.Name,"BCPOST",6) == 0 ) POSTOff = CurPos; - if( memcmp(IDMod.Name,"BCPSYS",6) == 0 ) SYSOff = CurPos; - CurPos += IDMod.Len; - fseek(ptx, (dword)(CurPos), 0); - if( IDMod.Name[0] == 0x0 || IDMod.Name[0] < 0x41 ) break; else Mods++; - } - - /*-----Looking for BCPFCP control structure------------*/ - rewind(ptx); - while(!feof(ptx)) - { - fread(Buf, 1, BLOCK, ptx); - if((CurPos = FoundAt(ptx, Buf, BCPFCP, BLOCK)) != 0) break; - /*---------O'K, we got this hook-----------*/ - CurPos = ftell(ptx) - 0x100; - - } - FCPOff = CurPos; - - printf("System Information at\t\t: %lX\n", SYSOff); - - fseek(ptx, SYSOff + 0x7E, 0); - fread(&BBsz, 1, sizeof(BBsz), ptx); - - fseek(ptx, SYSOff + 0x7B, 0); - fread(&BANKsz, 1, sizeof(BANKsz), ptx); - - fseek(ptx, SYSOff + 15, 0); - fread(&phdate, 1, sizeof(phdate), ptx); - fread(Buf, 1, 1, ptx); fread(&phtime, 1, 8, ptx); - - fseek(ptx, SYSOff + 0x77, 0); - /*-----Move to the pointer of 1st module-----*/ - fread(&Start, 1, sizeof(Start), ptx); - Offset = (0xFFFE0000-(ftell(ptx) & 0xFFFE0000)); - Start -= Offset; - - /*-----Move to the DEVEL string------------*/ - fseek(ptx, SYSOff + 0x37, 0); - fread(Buf, 1, 8, ptx); - - printf("BootBlock\t: %lX bytes\n", (BBsz == 0x0)?(0x10000):(BBsz)); - printf("BankSize\t: %li KB\n", BANKsz); - printf("Version\t\t: %8.8s\n", Buf); - printf("Start\t\t: %lX\n", Start); - printf("Offset\t\t: %lX\n", 0xFFFF0000 - Offset); - - printf("BCP Modules\t: %i\n", Mods); - printf("BCPFCP\t\t: %lX\n", FCPOff); - fseek(ptx, FCPOff + 0x18, 0); - fread(&FirstBLK, 1, sizeof(FirstBLK), ptx); - FirstBLKf = (ftell(ptx) & 0xF0000) + FirstBLK; - printf("FCP 1st module\t: %lX (%lX)\n", FirstBLK, FirstBLKf); - - printf("Released\t: %s at %8.8s\n", GetFullDate(phdate.Month, phdate.Day, phdate.Year), phtime); - - printf("/* Copyrighted Information */\n"); - - - if (__COPY__) - - /* - If .rom begins with no additional trash - this routine should be applied - */ - - { - - fseek(ptx, POSTOff + 0x1B, 0); - - fread(&CurPos, 1, sizeof(word), ptx); - - fseek(ptx, (POSTOff & 0xF0000) + (CurPos & 0xffff),0); - } else - { - - - CurPos = IsPhoenixBIOS(ptx, Buf); - fseek(ptx, (dword)(CurPos), 0); - }; - - fread(Buf, 1, 0x100, ptx); - - printf("\t%.64s\n", Buf); - - - if (__COPY__) - - /* - If .rom begins with no additional trash - this routine should be applied - */ - - { - - fseek(ptx, POSTOff + 0x38, 0); - fread(&CurPos, 1, sizeof(word), ptx); - fseek(ptx, (POSTOff & 0xF0000) + (CurPos & 0xffff), 0); - fread((Buf + 0x100), 1, 0x100, ptx); - i = 0x100; - while(Buf[i++] != 0xD); Buf[i] = 0x0; - printf("\t%s\n", Buf + 0x100); - } - - printf("/* ----------------------- */\n"); - - - switch(Action){ - case ListM: - case XtractM: TotalSections = TotalSecM( ptx, Buf, Action, Start, Offset, SYSOff ); break; - case List: - case Xtract: TotalSections = TotalSec( ptx, Buf, Action, (BANKsz) << 10 ); break; - } - - printf("\n"); - printf("Total Sections: %u\n", TotalSections); - - free(Buf); fclose(ptx); - - printf("\n"); - return 0; - } - diff --git a/phnxdeco-0.33.orig/src/phnxdeco.h b/phnxdeco-0.33.orig/src/phnxdeco.h deleted file mode 100644 index 9ce1232..0000000 --- a/phnxdeco-0.33.orig/src/phnxdeco.h +++ /dev/null @@ -1,93 +0,0 @@ -/********************************************** -** -** -** Defines & Functions for PhnxDeco -** -** -***********************************************/ - -/* ------ 26 Jan 2003 ------- -** New Name Conventions -* ------------------------- */ - -#include - -typedef unsigned char byte; -typedef unsigned long dword; -typedef unsigned short word; - -#define BLOCK 0x8000 -#define Xtract 0x10 -#define List 0x11 -#define XtractM 0x20 -#define ListM 0x21 - - -#ifndef __LINUX_NOW__ - #define IDSign "" -#else - #define IDSign "+" -#endif - - -//#define __DEBUG__ - -typedef struct { - FILE *infile; - FILE *outfile; - unsigned long original; - unsigned long packed; - int dicbit; - int method; - } interfacing; - -typedef struct - { - byte Month[2]; - byte rsrv1; - byte Day[2]; - byte rsrv2; - byte Year[2]; - } AMIDATE; - -typedef struct - { - dword Prev; - byte Sig[3]; - byte ID_HI; - byte ID_LO; - byte HeadLen; - byte isPacked; - word Offset; - word Segment; - dword ExpLen1; - dword Packed1; - dword Packed2; - dword ExpLen2; - } PHOENIXHEAD; - -typedef struct - { - byte Name[6]; - word Flags; - word Len; - } PHNXID; - -byte StrLen(byte *Str); -byte StrCmp(byte *Dst, byte *Src); - -dword FoundAt(FILE *ptx, byte *Buf, byte *Pattern, dword BLOCK_LEN); -byte* GetFullDate(byte *mon, byte *day, byte *year); - -byte* GetModuleName(byte ID); -byte* GetCompressionName(byte ID); -void decodeM3(interfacing interface); - -byte TotalSec(FILE *ptx, byte *Buf,byte Action, dword BankSize); - -/*---------------Modified Module Detection & Manipulating------------ - According to BCPSYS block ---------------------------------------------------------------------*/ -byte TotalSecM(FILE *ptx, byte *Buf,byte Action,dword Start,dword ConstOff,dword SYSOff); - -dword IsPhoenixBIOS(FILE *ptx, byte *Buf); diff --git a/phnxdeco-0.33.orig/src/phnxdeco_en.txt b/phnxdeco-0.33.orig/src/phnxdeco_en.txt deleted file mode 100644 index 1715b09..0000000 --- a/phnxdeco-0.33.orig/src/phnxdeco_en.txt +++ /dev/null @@ -1,26 +0,0 @@ -/* - * PhoenixBIOS Decompress - * - * Copyright (C) 2000, 2002, 2003 Anthony Borisow - * - */ - - There are some keys during startup: - 1) "-ls" list contents starting from the tail of file - 2) "-xs" extract contents starting from the file's tail - 3) "-l" list contents starting from the beginning - 4) "-x" extract contents from the beginning of file - 5) "-c" disable printing of copyright strings - - Ok, some info. Couple weeks ago (2003) I've downloaded an IBM-Netvista BIOS -which had a firmware update with garbage both in the beginning and in the -tail of BIOS. Of course, it's impossible to determine where the "real" -update was. And thus all offsets in that file were misplaced. I couldn't -extract it. The solution is disable printing this kind of copyright strings, -the key "-c". - If the BIOS file is broken, and we want to unpack it any way then -the keys "-x" and "-xs" should be used. What they mean - when first key used -file is decompressed from the start, in the latter case - from the tail. -Just the same with the listing - keys "-l", "-ls". - Help just prints what the program is for. - diff --git a/phnxdeco-0.33.orig/src/phnxfunc.c b/phnxdeco-0.33.orig/src/phnxfunc.c deleted file mode 100644 index 28fb1a8..0000000 --- a/phnxdeco-0.33.orig/src/phnxfunc.c +++ /dev/null @@ -1,544 +0,0 @@ -/********************************************** -** -** -** Defines & Functions for PhnxDeco -** -** -***********************************************/ - -/* ------ 26 Jan 2003 ------- -** New Name Conventions -* ------------------------- */ - -#include - -typedef unsigned char byte; -typedef unsigned long dword; -typedef unsigned short word; - -#define BLOCK 0x8000 -#define Xtract 0x10 -#define List 0x11 -#define XtractM 0x20 -#define ListM 0x21 - - -#ifndef __LINUX_NOW__ - #define IDSign "" -#else - #define IDSign "+" -#endif - -typedef struct { - FILE *infile; - FILE *outfile; - unsigned long original; - unsigned long packed; - int dicbit; - int method; - } interfacing; - -typedef struct - { - byte Month[2]; - byte rsrv1; - byte Day[2]; - byte rsrv2; - byte Year[2]; - } AMIDATE; - -typedef struct - { - dword Prev; - byte Sig[3]; - byte ID_HI; - byte ID_LO; - byte HeadLen; - byte isPacked; - word Offset; - word Segment; - dword ExpLen1; - dword Packed1; - dword Packed2; - dword ExpLen2; - } PHOENIXHEAD; -typedef struct - { - byte Name[6]; - word Flags; - word Len; - } PHNXID; - -byte StrLen(byte *Str){ int i = 0; while( *(Str+i) != 0x0 ) i++; return(i); }; -byte StrCmp(byte *Dst, byte *Src) - { - byte i; - for( i = 0;i <= StrLen(Src); i++ ) - if( Dst[i] != Src[i] ) return(1); - return(0); - } - - -dword FoundAt(FILE *ptx, byte *Buf, byte *Pattern, dword BLOCK_LEN) -{ - - dword i, Ret; - word Len; - Len = StrLen(Pattern); - for( i = 0; i < BLOCK_LEN - 0x80; i++ ){ - if(memcmp( Buf + i, Pattern, Len ) == 0 ) - { - Ret = ftell(ptx) - (BLOCK_LEN - i); - return(Ret); - } - } - return 0; -} - -byte* GetFullDate(byte *mon, byte *day, byte *year) - { - byte *Months[]={"", - "January", - "February", - "March", - "April", - "May", - "June", - "July", - "August", - "September", - "October", - "November", - "December"}; - byte Buf[20]; - - if((atoi(year) >= 0) && (atoi(year) < 70)) sprintf(Buf,"%.2s %s %s%.2s",day,Months[atoi(mon)],"20",year); - else sprintf(Buf,"%.2s %s %s%.2s",day,Months[atoi(mon)],"19",year); - - return(Buf); - } - -byte* GetModuleName(byte ID) -{ - switch(ID){ - case 'A': return("ACPI"); - case 'B': return("BIOSCODE"); - case 'C': return("UPDATE"); - case 'D': return("DISPLAY"); - case 'E': return("SETUP"); - case 'F': return("FONT"); - case 'G': return("DECOMPCODE"); - case 'I': return("BOOTBLOCK"); - case 'L': return("LOGO"); - case 'M': return("MISER"); - case 'N': return("ROMPILOTLOAD"); - case 'O': return("NETWORK"); - case 'P': return("ROMPILOTINIT"); - case 'R': return("OPROM"); - case 'S': return("STRINGS"); - case 'T': return("TEMPLATE"); - case 'U': return("USER"); - case 'X': return("ROMEXEC"); - case 'W': return("WAV"); - - case 'H': return("TCPA_H"); // TCPA (Trust Computing), USBKCLIB? - case 'K': return("TCPA_K"); // TCPA (Trust Computing), "AUTH"? - case 'Q': return("TCPA_Q"); // TCPA (Trust Computing), "SROM"? - case '<': return("TCPA_<"); - case '*': return("TCPA_*"); - case '?': return("TCPA_?"); - - case 'J': return("SmartCardPAS"); - - default: return("User-Defined"); - - - - } -} - -byte* GetCompressionName(byte ID) -{ - switch(ID){ - - case 0x0: return("NONE"); - case 0x2: return("LZARI"); - case 0x3: return("LZSS"); - case 0x4: return("LZHUF"); - case 0x5: return("LZINT"); - default : return("RSRV!"); - - } -} - -void decodeM3(interfacing interface) -{ - FILE *ptx, *bmx; - - /*------------------------*/ - word Index, Index2, DX, Loop, XorOp, i; - byte *Buffer, tmp; - dword RealLen, Now; - /*------------------------*/ - - ptx = interface.infile; - bmx = interface.outfile; - RealLen = interface.original; - - Buffer = (byte*)calloc(4096,1); - if(!Buffer) return; - - DX = 0; Index = 0xFEE; Now = 0; - - for(;;) - { - DX >>= 1; - if((DX&0x100)==0) - { - if(Now >= RealLen) { free(Buffer); return; } - fread(&tmp,1,1,ptx); - DX = (word)(0xFF)*0x100 + tmp; - }; - - if((DX&0x1)!=0) - { - if(Now++ >= RealLen) { free(Buffer); return; } - fread(&tmp,1,1,ptx); - fwrite(&tmp,1,1,bmx); - Buffer[Index++] = tmp; - Index &= 0xFFF; - continue; - }; - - Index2 = Index; - if(Now >= RealLen) { free(Buffer); return; } - fread(&tmp,1,1,ptx); - Index = (word)tmp; - if(Now >= RealLen) { free(Buffer); return; } - fread(&tmp,1,1,ptx); - Loop = (word)tmp &0xf; - Loop +=3; - XorOp = (word)tmp&0xf0; - XorOp <<=4; - Index |= XorOp; - for(i=0;i Expanded Compression Offset |\n" - "+------------------------------------------------------------------------------+\n" - ); - }; - - fseek( ptx, 0, 2 ); End = ftell(ptx); rewind(ptx); - while( (!feof(ptx)) && (CurPos < BankSize) ) - { - fseek(ptx,CurPos,0); - RealRead = fread(Buf, 1, BLOCK, ptx); - TotalRead += RealRead; - if( RealRead != BLOCK ) - { - for( i = RealRead; i < BLOCK; i++ ) - Buf[i] = 0xFF; - } - - if( RealRead < 0x80 ) break; - if( (CurPos = FoundAt( ptx, Buf, Head, RealRead )) !=0 ) - { - fseek( ptx, CurPos - 1 - 4, 0); - TotalSec++; - fread( &phhead, 1, sizeof(phhead), ptx ); - if( ( phhead.ID_HI >= 0x0 && phhead.ID_HI <= 0x20 ) && ( phhead.ID_LO <= 0x60 ) && phhead.Sig[0]=='\x0' ) - { - switch(Action) - { - case List: - - - printf("\n %c.%.2X (%12.12s) %5.5lX (%5.5lu) => %5.5lX (%6.3lu) %5.5s (%3.1i%%) %5.2lXh", - phhead.ID_LO, - phhead.ID_HI, - GetModuleName(phhead.ID_LO), - phhead.Packed1, phhead.Packed1, - phhead.ExpLen1, phhead.ExpLen1, - GetCompressionName(phhead.isPacked), - (dword)100*(dword)phhead.Packed1/(dword)phhead.ExpLen1, - CurPos - ); - break; - - case Xtract: - if(phhead.isPacked == 0) - sprintf(Buffer, "phoenix0.%1.1C%.1X", phhead.ID_LO, phhead.ID_HI); - else - sprintf(Buffer,"phoenix_.%1.1C%.1X",phhead.ID_LO,phhead.ID_HI); - - printf("%C.%.2X :: Saving %s ...", phhead.ID_LO, phhead.ID_HI, Buffer); - if((pto = fopen(Buffer,"wb")) == NULL) - { - printf("\nFile %s I/O error..Exit",Buf); - exit(1); - } - - interface.infile = ptx; - interface.outfile = pto; - interface.original = phhead.ExpLen1; - interface.packed = phhead.Packed1; - - interface.dicbit = 13; - interface.method = 5; - - /*--------------------------------------------- - isPacked == PackedLevel == CompressionName - ----------------------------------------------*/ - if( phhead.isPacked == 0x5 ) - { - decode(interface); - } - else if(phhead.isPacked==0x3) - { - fseek(ptx,-4L,1); - decodeM3(interface); - } - else - { - fseek(ptx, -4L, 1); - for(i=0;i0x100000) break; - fread(&phhead,1,sizeof(phhead),ptx); - Offset = phhead.Prev - ConstOff; - - blkend = Start + ConstOff + sizeof(PHOENIXHEAD) - 5; - blkstart = Start + 0xFFF00000; - switch(Action) - { - case ListM: - - printf("\n%.c %.1X %5.5s %4.4lX %4.4lX %4.4lX %4.4lX %5.lX %3.1i%% %4.4lX %4.4lX %5.2lXh", - phhead.ID_LO, phhead.ID_HI, - GetCompressionName(phhead.isPacked), - blkstart >> 0x10, blkstart & 0xFFFF, - (blkend + phhead.Packed1) >> 0x10, (blkend + phhead.Packed1) & 0xFFFF, - phhead.Packed1, - (dword)100*(dword)phhead.Packed1/(dword)phhead.ExpLen1, - phhead.Prev >> 0x10, phhead.Prev & 0xFFFF, - Start); - - - break; - - case XtractM: - - printf("\n%c.%1.1X",phhead.ID_LO,phhead.ID_HI); - sprintf(Buffer, "%s", GetModuleName(phhead.ID_LO)); - - if( StrLen(Buffer) > 7 ) - sprintf(Buffer, "%7.7s%1.1X.rom",GetModuleName(phhead.ID_LO),phhead.ID_HI); - else - { - sprintf(Buffer,"%s%1.1X.rom",GetModuleName(phhead.ID_LO),phhead.ID_HI); - } - - printf(" %-12.12s ... O'k",Buffer); - - - if((pto = fopen(Buffer,"wb")) == NULL) - { - printf("\nFile %s I/O error..Exit",Buf); - exit(1); - } - - - interface.infile = ptx; - interface.outfile = pto; - interface.original = phhead.ExpLen1; - interface.packed = phhead.Packed1; - - interface.dicbit = 13; - interface.method = 5; - - /*--------------------------------------------- - Evidently, isPacked == PackedLevel - ----------------------------------------------*/ - if(phhead.isPacked == 0x5) - { - decode(interface); - } - else if(phhead.isPacked==0x3) - { - fseek(ptx,-4L,1); - decodeM3(interface); - } - else - { - fseek(ptx, -4L, 1); - for(i=0;i - - -byte HelpSystem(byte argc, byte *argv[]) - { - byte x = 0, retcode = 0; - - for( x = 1; x < argc; x++) - { - if( StrCmp(argv[x], "-h" ) == 0 ) - { - printf("\n"SftName" HelpSystem Starting Now!\n"); - printf("\nThis Program Version Number %s", SftVersion); - -#ifndef __LINUX_NOW__ - printf( - "\n"SftName" - Decompressor for PhoenixBIOSes only.\n" - "\tSupported formats: Phoenix BIOS 4.0, Phoenix FirstBIOS\n\n" - ""SftName" performs on 386 or better CPU systems\n" - "under control of DOS, Win3.xx, Win9x/NT/2K or DosEmu\n\n" - "Compression schemes include: NONE, LZSS, LZINT\n\n" - "Modules marked with "IDSign" sign are compressed modules\n\n" - "\tBug reports mailto: "SftEMail"\n" - "\t\tCompiled: %s, %s\n",__DATE__,__TIME__); -#else - printf( - "\n"SftName" - Decompressor for PhoenixBIOSes only.\n" - "\tSupported formats: Phoenix BIOS 4.0, Phoenix FirstBIOS\n\n" - ""SftName" performs on 386 or better CPU systems\n" - "under control of LinuxOS\n\n" - "Compression schemes include: NONE, LZSS, LZINT\n\n" - "Modules marked with "IDSign" sign are compressed modules\n\n" - "\tBug reports mailto: "SftEMail"\n" - "\t\tCompiled: %s, %s with \n\t\t%s",__DATE__,__TIME__,__VERSION__); -#endif - printf("\n"); - retcode = 0x80; - - } - - if( StrCmp(argv[x], "-xs" ) == 0 ) retcode = 0x20; - if( StrCmp(argv[x], "-ls" ) == 0 ) retcode = 0x21; - if( StrCmp(argv[x], "-x" ) == 0 ) retcode = 0x10; - if( StrCmp(argv[x], "-l" ) == 0 ) retcode = 0x11; - if( StrCmp(argv[x], "-c" ) == 0 ) retcode += 0x40; - } - return(retcode); - - } - -void PrintHeader(byte* EOL) - { - - printf("\n%c%s%c%s", 0x4, SoftName, 0x4, EOL); - - } - -void PrintUsage() - { - - PrintHeader(""); - printf("%s", CopyRights); - printf("\n\nUsage: PhnxDeco [Options]"); - printf( - "\n" - "\t\tOptions:" - "\n\t\t\t\"-ls\" List (System) Bios Structure" - "\n\t\t\t\"-xs\" eXtract (System) Bios Modules" - "\n\t\t\t\"-l\" List Bios Structure" - "\n\t\t\t\"-x\" eXtract Bios Modules" - "\n\t\t\t\"-c\" show Bios Copyrights" - "\n\t\t\t\"-h\" Help statistics" - ); - printf("\n\n\t*%s*\n",Url); - - } diff --git a/phnxdeco-0.33.orig/src/phnxsoft.h b/phnxdeco-0.33.orig/src/phnxsoft.h deleted file mode 100644 index e4d31c3..0000000 --- a/phnxdeco-0.33.orig/src/phnxsoft.h +++ /dev/null @@ -1,18 +0,0 @@ -/********************************************** -** -** -** Defines for PhnxSoft -** -** -***********************************************/ - -#include -#include "./phnxver.h" - -#define SftName "PhoenixDeco" -#define SftEMail "Anton Borisov, anton.borisov@gmail.com" - - /********SoftWare*************/ - byte SoftName[] = "-="SftName", version "SftVersion"=-"; - byte CopyRights[] = "\n(C) Anton Borisov, 2000, 2002-2004, Portions (C) 1999-2000"; - byte Url[] = "Bug-reports direct to "SftEMail; diff --git a/phnxdeco-0.33.orig/src/phnxver.h b/phnxdeco-0.33.orig/src/phnxver.h deleted file mode 100644 index 59d9d90..0000000 --- a/phnxdeco-0.33.orig/src/phnxver.h +++ /dev/null @@ -1,17 +0,0 @@ -/********************************************** -** -** -** Defines for PhnxVer -** -** -***********************************************/ - -#include - -#ifdef __LINUX_NOW__ - #define SftPlatform "Linux" -#else - #define SftPlatform "DOS32" -#endif - -#define SftVersion "0.33 ("SftPlatform")" diff --git a/phnxdeco-0.33.orig/src/readme.txt b/phnxdeco-0.33.orig/src/readme.txt deleted file mode 100644 index 92e5123..0000000 --- a/phnxdeco-0.33.orig/src/readme.txt +++ /dev/null @@ -1,41 +0,0 @@ -PhnxDeco (PhoenixDeco) -(C) 2000, 2002, 2003 - -Anthony Borisow -email: anton.borisov@gmail.com - -http://kaos.ru/biosgfx/ -http://biosgfx.euro.ru/phoenixdeco/ -http://biosgfx.narod.ru/phoenixdeco/ - -PhoenixDeco - Ultimate Phoenix Decompressor - -/*--------------------------------*/ -/*------------ INFO --------------*/ -/*--------------------------------*/ - - -This software is intended to decompress (expand) the content of the PhoenixBIOS. -Currently supported cores are: PhoenixBIOS 4.0 Version 6.0 (any subversion), -Phoenix FirstBIOS (any version). Compression schemes to decompress are: -LZINT, LZSS, NONE. - -The best way to decompress the BIOS is to use the next example: - -1. phnxdeco PhoenixBIOS.ROM -xs - or -2. phxndeco PhoenixBIOS.ROM -x - - -N.B. While using example #1 also generates file named rom.scr - this is - script file is used for combining the uncompressed parts into solid ROM. - -/*--------------------------------*/ -/*--------- DISCLAIMER -----------*/ -/*--------------------------------*/ - -THIS SOFTWARE AND THE ACCOMPANYING FILES ARE DISTRIBUTED "AS IS" -AND WITHOUT ANY WARRANTIES WHETHER EXPRESSED OR IMPLIED. NO -RESPONSIBILITIES FOR POSSIBLE DAMAGES OR EVEN FUNCTIONALITY CAN BE -TAKEN. THE USER MUST ASSUME THE ENTIRE RISK OF USING THIS PROGRAM. -ALL TRADEMARKS ARE PROPERTY OF THEIR RESPECTIVE OWNERS. diff --git a/phnxdeco/Makefile b/phnxdeco/Makefile new file mode 100644 index 0000000..206e6c6 --- /dev/null +++ b/phnxdeco/Makefile @@ -0,0 +1,11 @@ +CFLAGS = -g -fpack-struct -Wall +CC = gcc + +all: phnxdeco + +clean: + rm -f *.o + rm phnxdeco + +phnxdeco: phnxdeco.c phnxfunc.o kernel.o + $(CC) $(CFLAGS) phnxfunc.o kernel.o phnxdeco.c -o phnxdeco diff --git a/phnxdeco/kernel.c b/phnxdeco/kernel.c new file mode 100644 index 0000000..f447086 --- /dev/null +++ b/phnxdeco/kernel.c @@ -0,0 +1,342 @@ +/********************************************** +*** +*** +*** These decompression routines based on +*** LZHUFF algo from LHA archiver +*** +*** +***********************************************/ + +#include +#include +#include + +#define UCHAR_MAX ((1<<(sizeof(unsigned char)*8))-1) +#define CHAR_BIT 8 + +#define CBIT 9 +#define USHRT_BIT 16 /* (CHAR_BIT * sizeof(ushort)) */ + +#define MAX_DICBIT 13 +#define MAX_DICSIZ (1 << MAX_DICBIT) +#define MATCHBIT 8 +#define MAXMATCH 256 +#define THRESHOLD 3 +#define NC (UCHAR_MAX + MAXMATCH + 2 - THRESHOLD) + +#define NP (MAX_DICBIT + 1) +#define NT (USHRT_BIT + 3) +#define PBIT 4 +#define TBIT 5 +#define NPT 0x80 + +unsigned long origsize, compsize; +unsigned short dicbit; +unsigned short maxmatch; +unsigned long count; +unsigned short loc; +unsigned char *text; + +static unsigned short dicsiz; + +static unsigned char subbitbuf, bitcount; + +unsigned short crc, bitbuf; +int prev_char; +long reading_size; + +unsigned short left[2 * NC - 1], right[2 * NC - 1]; +unsigned char c_len[NC], pt_len[NPT]; +unsigned short c_table[4096], c_code[NC], + pt_table[256], pt_code[NPT]; +static unsigned char *buf; +static unsigned short bufsiz; +static unsigned short blocksize; + +FILE *infile, *outfile; + +typedef struct { + FILE *infile; + FILE *outfile; + unsigned long original; + unsigned long packed; + int dicbit; + int method; +} interfacing ; + + +static short c, n, tblsiz, len, depth, maxdepth, avail; +static unsigned short codeword, bit, *tbl; +static unsigned char *blen; + +/****************************************/ +/* mktbl() */ +/****************************************/ +static short mktbl(void) +{ + short i; + + if (len == depth) { + while (++c < n) + if (blen[c] == len) { + i = codeword; codeword += bit; + if (codeword > tblsiz) { printf("\nBad Table!"); exit(1); } + while (i < codeword) tbl[i++] = c; + return c; + } + c = -1; len++; bit >>= 1; + } + depth++; + if (depth < maxdepth) { + (void) mktbl(); (void) mktbl(); + } else if (depth > USHRT_BIT) { + { printf("\nBad Table [2]"); exit(1); } + } else { + if ((i = avail++) >= 2 * n - 1) { printf("\nBad Table [3]"); exit(1); } + left[i] = mktbl(); right[i] = mktbl(); + if (codeword >= tblsiz) { printf("\nBad Table [4]"); exit(1); } + if (depth == maxdepth) tbl[codeword++] = i; + } + depth--; + return i; +} + +/****************************************/ +/* make_table() */ +/****************************************/ +void make_table(short nchar, unsigned char bitlen[], + short tablebits, unsigned short table[]) +{ + n = avail = nchar; blen = bitlen; tbl = table; + tblsiz = 1U << tablebits; bit = tblsiz / 2; + maxdepth = tablebits + 1; + depth = len = 1; c = -1; codeword = 0; + (void) mktbl(); /* left subtree */ + (void) mktbl(); /* right subtree */ + if (codeword != tblsiz) { printf("\nBad Table [5]"); exit(1); } +} + + + +/****************************************/ +/* fillbif() */ +/****************************************/ +void fillbuf(unsigned char n) /* Shift bitbuf n bits left, read n bits */ +{ + while (n > bitcount) { + n -= bitcount; + bitbuf = (bitbuf << bitcount) + (subbitbuf >> (CHAR_BIT - bitcount)); + if (compsize != 0) { + compsize--; subbitbuf = (unsigned char) getc(infile); + } else subbitbuf = 0; + bitcount = CHAR_BIT; + } + bitcount -= n; + bitbuf = (bitbuf << n) + (subbitbuf >> (CHAR_BIT - n)); + subbitbuf <<= n; +} + + +/****************************************/ +/* getbits() */ +/****************************************/ +unsigned short getbits(unsigned char n) +{ + unsigned short x; + + x = bitbuf >> (2 * CHAR_BIT - n); fillbuf(n); + return x; +} + +/****************************************/ +/* fwrite_crc() */ +/****************************************/ +void fwrite_crc( unsigned char *p, int n, FILE *fp ) +{ + + if ( fp ) + { + if (fwrite(p, 1, n, fp) < n) + { printf("\nFatal Error"); exit(1); } + } +} + +/****************************************/ +/* init_getbits() */ +/****************************************/ +void init_getbits(void) +{ + bitbuf = 0; subbitbuf = 0; bitcount = 0; + fillbuf(2 * CHAR_BIT); +} + + +/********************************************/ +/************* DECODE ***********************/ + +static void read_pt_len(short nn, short nbit, short i_special) +{ + short i, c, n; + + n = getbits(nbit); + if (n == 0) { + c = getbits(nbit); + for (i = 0; i < nn; i++) pt_len[i] = 0; + for (i = 0; i < 256; i++) pt_table[i] = c; + } else { + i = 0; + while (i < n) { + c = bitbuf >> (16 - 3); + if (c == 7) { + unsigned short mask = 1 << (16 - 4); + while (mask & bitbuf) { mask >>= 1; c++; } + } + fillbuf((c < 7) ? 3 : c - 3); + pt_len[i++] = c; + if (i == i_special) { + c = getbits(2); + while (--c >= 0) pt_len[i++] = 0; + } + } + while (i < nn) pt_len[i++] = 0; + make_table(nn, pt_len, 8, pt_table); + } +} + +static void read_c_len(void) +{ + short i, c, n; + + n = getbits(CBIT); + if (n == 0) { + c = getbits(CBIT); + for (i = 0; i < NC; i++) c_len[i] = 0; + for (i = 0; i < 4096; i++) c_table[i] = c; + } else { + i = 0; + while (i < n) { + c = pt_table[bitbuf >> (16 - 8)]; + if (c >= NT) { + unsigned short mask = 1 << (16 - 9); + do { + if (bitbuf & mask) c = right[c]; + else c = left [c]; + mask >>= 1; + } while (c >= NT); + } + fillbuf(pt_len[c]); + if (c <= 2) { + if (c == 0) c = 1; + else if (c == 1) c = getbits(4) + 3; + else c = getbits(CBIT) + 20; + while (--c >= 0) c_len[i++] = 0; + } else c_len[i++] = c - 2; + } + while (i < NC) c_len[i++] = 0; + make_table(NC, c_len, 12, c_table); + } +} + +unsigned short decode_c_st1(void) +{ + unsigned short j, mask; + + if (blocksize == 0) { + blocksize = getbits(16); + read_pt_len(NT, TBIT, 3); + read_c_len(); + read_pt_len(NP, PBIT, -1); + } + blocksize--; + j = c_table[bitbuf >> 4]; + if (j < NC) fillbuf(c_len[j]); + else { + fillbuf(12); mask = 1 << (16 - 1); + do { + if (bitbuf & mask) j = right[j]; + else j = left [j]; + mask >>= 1; + } while (j >= NC); + fillbuf(c_len[j] - 12); + } + return j; +} + +unsigned short decode_p_st1(void) +{ + unsigned short j, mask; + + j = pt_table[bitbuf >> (16 - 8)]; + if (j < NP) fillbuf(pt_len[j]); + else { + fillbuf(8); mask = 1 << (16 - 1); + do { + if (bitbuf & mask) j = right[j]; + else j = left [j]; + mask >>= 1; + } while (j >= NP); + fillbuf(pt_len[j] - 8); + } + if (j != 0) j = (1 << (j - 1)) + getbits(j - 1); + return j; +} + +void decode_start_st1(void) +{ + init_getbits(); + blocksize = 0; +} + +/********end of decode***********************/ + +void decode(interfacing interface) +{ + int i, j, k, c, dicsiz1, offset; + + infile = interface.infile; + outfile = interface.outfile; + dicbit = interface.dicbit; + origsize = interface.original; + compsize = interface.packed; + crc = 0; + prev_char = -1; + dicsiz = 1 << dicbit; + text = (unsigned char *)malloc(dicsiz); + if (text == NULL) exit( 1 ); + + memset(text, ' ', dicsiz); + decode_start_st1(); + + dicsiz1 = dicsiz - 1; + offset = 0x100 - 3; + count = 0; loc = 0; + while (count < origsize) { + + c= decode_c_st1(); + + if (c <= UCHAR_MAX) { + text[loc++] = c; + if (loc == dicsiz) { + fwrite_crc(text, dicsiz, outfile); + loc = 0; + } + count++; + } else { + j = c - offset; + i = (loc - decode_p_st1() - 1) & dicsiz1; + count += j; + for (k = 0; k < j; k++) { + c = text[(i + k) & dicsiz1]; + text[loc++] = c; + if (loc == dicsiz) { + fwrite_crc(text, dicsiz, outfile); + loc = 0; + } + } + } + } + if (loc != 0) { + fwrite_crc(text, loc, outfile); + } + free(text); +} diff --git a/phnxdeco/phnxdeco.c b/phnxdeco/phnxdeco.c new file mode 100644 index 0000000..658892a --- /dev/null +++ b/phnxdeco/phnxdeco.c @@ -0,0 +1,267 @@ +/* + * Phoenix BIOS Decompress + * + * Copyright (C) 2000, 2002, 2003 Anthony Borisow + * + * 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 2, 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; see the file COPYING. If not, write to + * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. + */ + +#include +#include + +#if defined(LINUX) || defined(__LINUX__) || defined(__linux__) + #include + #define __LINUX_NOW__ +#else + #include + #include +#endif + +#include "./phnxdeco.h" +#include "./phnxsoft.h" +#include "./phnxver.h" +#include "./phnxhelp.h" + +int main(byte argc, byte *argv[]) +{ + FILE *ptx; + byte *Buf; + dword CurPos, fLen, Start, Offset; + word i, Len, FirstBLK, BBsz, BANKsz; + dword POSTOff, SYSOff, FCPOff, FirstBLKf; + byte PhBIOS[] = "Phoenix FirstBIOS", PhVersion[3], PhRelease[3], phtime[8]; + byte BCPSEGMENT[] = "BCPSEGMENT"; + byte BCPFCP[] = "BCPFCP"; + AMIDATE phdate; + byte TotalSections = 0, Action, Mods = 0; + PHNXID IDMod; + + byte __COPY__ = 0; + + +#ifndef __LINUX_NOW__ + clrscr(); +#endif + + +#ifdef __DEBUG__ +// argv[1] = "C:\\phnx\\z.bin"; + argv[1] = "C:\\phnx\\10410.bin"; +// argv[1] = "C:\\firmware.111"; + argv[2] = "-l"; + argc = 3; +#endif + + switch( HelpSystem(argc,argv) ){ + case 0x80: return 0; + case 0x50: __COPY__ = 1; + case 0x10: Action = Xtract; break; + case 0x51: __COPY__ = 1; + case 0x11: Action = List; break; + case 0x60: __COPY__ = 1; + case 0x20: Action = XtractM; break; + case 0x61: __COPY__ = 1; + case 0x21: Action = ListM; break; + default: + PrintUsage(); + printf("\n"); + return 0; + } + + PrintHeader("\n\n"); + + if( (ptx = fopen(argv[1],"rb")) == NULL ) + { + printf("\nFATAL ERROR: File %s opening error...\n", argv[1]); + return 0; + }; + + Buf = (byte*)calloc( BLOCK, 1 ); + if(!Buf) + { + printf("Memory Error..\n"); + return 0; + } + + CurPos = 0; + IDMod.Name[0] = 0xff; IDMod.Len = 0xff; + POSTOff = 0; SYSOff = 0; + + fseek( ptx, 0, 2 ); + fLen = ftell(ptx); + rewind(ptx); + printf("Filelength\t: %lX (%lu bytes)\n", fLen, fLen); + printf("Filename\t: %s\n", argv[1]); + + + while(!feof(ptx)) + { + fread(Buf, 1, BLOCK, ptx); + if( (CurPos = FoundAt(ptx, Buf, BCPSEGMENT, BLOCK)) != 0 ) break; + /*-----O'K, we got PhoenixBIOS BCPSEGMENT hook-------*/ + CurPos = ftell(ptx) - 0x100; + + } + + if(feof(ptx)) + { + printf("Searched through file. Not a PhoenixBIOS\n"); + exit(1); + } + + printf("PhoenixBIOS hook found at\t: %lX\n", CurPos); + CurPos += 10; + fseek(ptx, (dword)(CurPos), 0); + + while( IDMod.Name[0] != 0x0 && IDMod.Len != 0x0) + { + fread(&IDMod, 1, sizeof(IDMod), ptx); + + /*--------Wrong Count w/ ALR and some S/N --------- + internal errors ? + ---------------------------------------------------*/ + if( IDMod.Name[0] < 0x41 && IDMod.Name[0] != 0x0 ) + { + do { + fread(Buf, 1, 1, ptx); + } while( Buf[0] != 0x42 ); + fseek(ptx, -1L, SEEK_CUR); + CurPos = ftell(ptx); + fread(&IDMod, 1, sizeof(IDMod), ptx); + }; + + if( memcmp(IDMod.Name,"BCPOST",6) == 0 ) POSTOff = CurPos; + if( memcmp(IDMod.Name,"BCPSYS",6) == 0 ) SYSOff = CurPos; + CurPos += IDMod.Len; + fseek(ptx, (dword)(CurPos), 0); + if( IDMod.Name[0] == 0x0 || IDMod.Name[0] < 0x41 ) break; else Mods++; + } + + /*-----Looking for BCPFCP control structure------------*/ + rewind(ptx); + while(!feof(ptx)) + { + fread(Buf, 1, BLOCK, ptx); + if((CurPos = FoundAt(ptx, Buf, BCPFCP, BLOCK)) != 0) break; + /*---------O'K, we got this hook-----------*/ + CurPos = ftell(ptx) - 0x100; + + } + FCPOff = CurPos; + + printf("System Information at\t\t: %lX\n", SYSOff); + + fseek(ptx, SYSOff + 0x7E, 0); + fread(&BBsz, 1, sizeof(BBsz), ptx); + + fseek(ptx, SYSOff + 0x7B, 0); + fread(&BANKsz, 1, sizeof(BANKsz), ptx); + + fseek(ptx, SYSOff + 15, 0); + fread(&phdate, 1, sizeof(phdate), ptx); + fread(Buf, 1, 1, ptx); fread(&phtime, 1, 8, ptx); + + fseek(ptx, SYSOff + 0x77, 0); + /*-----Move to the pointer of 1st module-----*/ + fread(&Start, 1, sizeof(Start), ptx); + Offset = (0xFFFE0000-(ftell(ptx) & 0xFFFE0000)); + Start -= Offset; + + /*-----Move to the DEVEL string------------*/ + fseek(ptx, SYSOff + 0x37, 0); + fread(Buf, 1, 8, ptx); + + printf("BootBlock\t: %lX bytes\n", (BBsz == 0x0)?(0x10000):(BBsz)); + printf("BankSize\t: %li KB\n", BANKsz); + printf("Version\t\t: %8.8s\n", Buf); + printf("Start\t\t: %lX\n", Start); + printf("Offset\t\t: %lX\n", 0xFFFF0000 - Offset); + + printf("BCP Modules\t: %i\n", Mods); + printf("BCPFCP\t\t: %lX\n", FCPOff); + fseek(ptx, FCPOff + 0x18, 0); + fread(&FirstBLK, 1, sizeof(FirstBLK), ptx); + FirstBLKf = (ftell(ptx) & 0xF0000) + FirstBLK; + printf("FCP 1st module\t: %lX (%lX)\n", FirstBLK, FirstBLKf); + + printf("Released\t: %s at %8.8s\n", GetFullDate(phdate.Month, phdate.Day, phdate.Year), phtime); + + printf("/* Copyrighted Information */\n"); + + + if (__COPY__) + + /* + If .rom begins with no additional trash + this routine should be applied + */ + + { + + fseek(ptx, POSTOff + 0x1B, 0); + + fread(&CurPos, 1, sizeof(word), ptx); + + fseek(ptx, (POSTOff & 0xF0000) + (CurPos & 0xffff),0); + } else + { + + + CurPos = IsPhoenixBIOS(ptx, Buf); + fseek(ptx, (dword)(CurPos), 0); + }; + + fread(Buf, 1, 0x100, ptx); + + printf("\t%.64s\n", Buf); + + + if (__COPY__) + + /* + If .rom begins with no additional trash + this routine should be applied + */ + + { + + fseek(ptx, POSTOff + 0x38, 0); + fread(&CurPos, 1, sizeof(word), ptx); + fseek(ptx, (POSTOff & 0xF0000) + (CurPos & 0xffff), 0); + fread((Buf + 0x100), 1, 0x100, ptx); + i = 0x100; + while(Buf[i++] != 0xD); Buf[i] = 0x0; + printf("\t%s\n", Buf + 0x100); + } + + printf("/* ----------------------- */\n"); + + + switch(Action){ + case ListM: + case XtractM: TotalSections = TotalSecM( ptx, Buf, Action, Start, Offset, SYSOff ); break; + case List: + case Xtract: TotalSections = TotalSec( ptx, Buf, Action, (BANKsz) << 10 ); break; + } + + printf("\n"); + printf("Total Sections: %u\n", TotalSections); + + free(Buf); fclose(ptx); + + printf("\n"); + return 0; + } + diff --git a/phnxdeco/phnxdeco.h b/phnxdeco/phnxdeco.h new file mode 100644 index 0000000..9ce1232 --- /dev/null +++ b/phnxdeco/phnxdeco.h @@ -0,0 +1,93 @@ +/********************************************** +** +** +** Defines & Functions for PhnxDeco +** +** +***********************************************/ + +/* ------ 26 Jan 2003 ------- +** New Name Conventions +* ------------------------- */ + +#include + +typedef unsigned char byte; +typedef unsigned long dword; +typedef unsigned short word; + +#define BLOCK 0x8000 +#define Xtract 0x10 +#define List 0x11 +#define XtractM 0x20 +#define ListM 0x21 + + +#ifndef __LINUX_NOW__ + #define IDSign "" +#else + #define IDSign "+" +#endif + + +//#define __DEBUG__ + +typedef struct { + FILE *infile; + FILE *outfile; + unsigned long original; + unsigned long packed; + int dicbit; + int method; + } interfacing; + +typedef struct + { + byte Month[2]; + byte rsrv1; + byte Day[2]; + byte rsrv2; + byte Year[2]; + } AMIDATE; + +typedef struct + { + dword Prev; + byte Sig[3]; + byte ID_HI; + byte ID_LO; + byte HeadLen; + byte isPacked; + word Offset; + word Segment; + dword ExpLen1; + dword Packed1; + dword Packed2; + dword ExpLen2; + } PHOENIXHEAD; + +typedef struct + { + byte Name[6]; + word Flags; + word Len; + } PHNXID; + +byte StrLen(byte *Str); +byte StrCmp(byte *Dst, byte *Src); + +dword FoundAt(FILE *ptx, byte *Buf, byte *Pattern, dword BLOCK_LEN); +byte* GetFullDate(byte *mon, byte *day, byte *year); + +byte* GetModuleName(byte ID); +byte* GetCompressionName(byte ID); +void decodeM3(interfacing interface); + +byte TotalSec(FILE *ptx, byte *Buf,byte Action, dword BankSize); + +/*---------------Modified Module Detection & Manipulating------------ + According to BCPSYS block +--------------------------------------------------------------------*/ +byte TotalSecM(FILE *ptx, byte *Buf,byte Action,dword Start,dword ConstOff,dword SYSOff); + +dword IsPhoenixBIOS(FILE *ptx, byte *Buf); diff --git a/phnxdeco/phnxfunc.c b/phnxdeco/phnxfunc.c new file mode 100644 index 0000000..28fb1a8 --- /dev/null +++ b/phnxdeco/phnxfunc.c @@ -0,0 +1,544 @@ +/********************************************** +** +** +** Defines & Functions for PhnxDeco +** +** +***********************************************/ + +/* ------ 26 Jan 2003 ------- +** New Name Conventions +* ------------------------- */ + +#include + +typedef unsigned char byte; +typedef unsigned long dword; +typedef unsigned short word; + +#define BLOCK 0x8000 +#define Xtract 0x10 +#define List 0x11 +#define XtractM 0x20 +#define ListM 0x21 + + +#ifndef __LINUX_NOW__ + #define IDSign "" +#else + #define IDSign "+" +#endif + +typedef struct { + FILE *infile; + FILE *outfile; + unsigned long original; + unsigned long packed; + int dicbit; + int method; + } interfacing; + +typedef struct + { + byte Month[2]; + byte rsrv1; + byte Day[2]; + byte rsrv2; + byte Year[2]; + } AMIDATE; + +typedef struct + { + dword Prev; + byte Sig[3]; + byte ID_HI; + byte ID_LO; + byte HeadLen; + byte isPacked; + word Offset; + word Segment; + dword ExpLen1; + dword Packed1; + dword Packed2; + dword ExpLen2; + } PHOENIXHEAD; +typedef struct + { + byte Name[6]; + word Flags; + word Len; + } PHNXID; + +byte StrLen(byte *Str){ int i = 0; while( *(Str+i) != 0x0 ) i++; return(i); }; +byte StrCmp(byte *Dst, byte *Src) + { + byte i; + for( i = 0;i <= StrLen(Src); i++ ) + if( Dst[i] != Src[i] ) return(1); + return(0); + } + + +dword FoundAt(FILE *ptx, byte *Buf, byte *Pattern, dword BLOCK_LEN) +{ + + dword i, Ret; + word Len; + Len = StrLen(Pattern); + for( i = 0; i < BLOCK_LEN - 0x80; i++ ){ + if(memcmp( Buf + i, Pattern, Len ) == 0 ) + { + Ret = ftell(ptx) - (BLOCK_LEN - i); + return(Ret); + } + } + return 0; +} + +byte* GetFullDate(byte *mon, byte *day, byte *year) + { + byte *Months[]={"", + "January", + "February", + "March", + "April", + "May", + "June", + "July", + "August", + "September", + "October", + "November", + "December"}; + byte Buf[20]; + + if((atoi(year) >= 0) && (atoi(year) < 70)) sprintf(Buf,"%.2s %s %s%.2s",day,Months[atoi(mon)],"20",year); + else sprintf(Buf,"%.2s %s %s%.2s",day,Months[atoi(mon)],"19",year); + + return(Buf); + } + +byte* GetModuleName(byte ID) +{ + switch(ID){ + case 'A': return("ACPI"); + case 'B': return("BIOSCODE"); + case 'C': return("UPDATE"); + case 'D': return("DISPLAY"); + case 'E': return("SETUP"); + case 'F': return("FONT"); + case 'G': return("DECOMPCODE"); + case 'I': return("BOOTBLOCK"); + case 'L': return("LOGO"); + case 'M': return("MISER"); + case 'N': return("ROMPILOTLOAD"); + case 'O': return("NETWORK"); + case 'P': return("ROMPILOTINIT"); + case 'R': return("OPROM"); + case 'S': return("STRINGS"); + case 'T': return("TEMPLATE"); + case 'U': return("USER"); + case 'X': return("ROMEXEC"); + case 'W': return("WAV"); + + case 'H': return("TCPA_H"); // TCPA (Trust Computing), USBKCLIB? + case 'K': return("TCPA_K"); // TCPA (Trust Computing), "AUTH"? + case 'Q': return("TCPA_Q"); // TCPA (Trust Computing), "SROM"? + case '<': return("TCPA_<"); + case '*': return("TCPA_*"); + case '?': return("TCPA_?"); + + case 'J': return("SmartCardPAS"); + + default: return("User-Defined"); + + + + } +} + +byte* GetCompressionName(byte ID) +{ + switch(ID){ + + case 0x0: return("NONE"); + case 0x2: return("LZARI"); + case 0x3: return("LZSS"); + case 0x4: return("LZHUF"); + case 0x5: return("LZINT"); + default : return("RSRV!"); + + } +} + +void decodeM3(interfacing interface) +{ + FILE *ptx, *bmx; + + /*------------------------*/ + word Index, Index2, DX, Loop, XorOp, i; + byte *Buffer, tmp; + dword RealLen, Now; + /*------------------------*/ + + ptx = interface.infile; + bmx = interface.outfile; + RealLen = interface.original; + + Buffer = (byte*)calloc(4096,1); + if(!Buffer) return; + + DX = 0; Index = 0xFEE; Now = 0; + + for(;;) + { + DX >>= 1; + if((DX&0x100)==0) + { + if(Now >= RealLen) { free(Buffer); return; } + fread(&tmp,1,1,ptx); + DX = (word)(0xFF)*0x100 + tmp; + }; + + if((DX&0x1)!=0) + { + if(Now++ >= RealLen) { free(Buffer); return; } + fread(&tmp,1,1,ptx); + fwrite(&tmp,1,1,bmx); + Buffer[Index++] = tmp; + Index &= 0xFFF; + continue; + }; + + Index2 = Index; + if(Now >= RealLen) { free(Buffer); return; } + fread(&tmp,1,1,ptx); + Index = (word)tmp; + if(Now >= RealLen) { free(Buffer); return; } + fread(&tmp,1,1,ptx); + Loop = (word)tmp &0xf; + Loop +=3; + XorOp = (word)tmp&0xf0; + XorOp <<=4; + Index |= XorOp; + for(i=0;i Expanded Compression Offset |\n" + "+------------------------------------------------------------------------------+\n" + ); + }; + + fseek( ptx, 0, 2 ); End = ftell(ptx); rewind(ptx); + while( (!feof(ptx)) && (CurPos < BankSize) ) + { + fseek(ptx,CurPos,0); + RealRead = fread(Buf, 1, BLOCK, ptx); + TotalRead += RealRead; + if( RealRead != BLOCK ) + { + for( i = RealRead; i < BLOCK; i++ ) + Buf[i] = 0xFF; + } + + if( RealRead < 0x80 ) break; + if( (CurPos = FoundAt( ptx, Buf, Head, RealRead )) !=0 ) + { + fseek( ptx, CurPos - 1 - 4, 0); + TotalSec++; + fread( &phhead, 1, sizeof(phhead), ptx ); + if( ( phhead.ID_HI >= 0x0 && phhead.ID_HI <= 0x20 ) && ( phhead.ID_LO <= 0x60 ) && phhead.Sig[0]=='\x0' ) + { + switch(Action) + { + case List: + + + printf("\n %c.%.2X (%12.12s) %5.5lX (%5.5lu) => %5.5lX (%6.3lu) %5.5s (%3.1i%%) %5.2lXh", + phhead.ID_LO, + phhead.ID_HI, + GetModuleName(phhead.ID_LO), + phhead.Packed1, phhead.Packed1, + phhead.ExpLen1, phhead.ExpLen1, + GetCompressionName(phhead.isPacked), + (dword)100*(dword)phhead.Packed1/(dword)phhead.ExpLen1, + CurPos + ); + break; + + case Xtract: + if(phhead.isPacked == 0) + sprintf(Buffer, "phoenix0.%1.1C%.1X", phhead.ID_LO, phhead.ID_HI); + else + sprintf(Buffer,"phoenix_.%1.1C%.1X",phhead.ID_LO,phhead.ID_HI); + + printf("%C.%.2X :: Saving %s ...", phhead.ID_LO, phhead.ID_HI, Buffer); + if((pto = fopen(Buffer,"wb")) == NULL) + { + printf("\nFile %s I/O error..Exit",Buf); + exit(1); + } + + interface.infile = ptx; + interface.outfile = pto; + interface.original = phhead.ExpLen1; + interface.packed = phhead.Packed1; + + interface.dicbit = 13; + interface.method = 5; + + /*--------------------------------------------- + isPacked == PackedLevel == CompressionName + ----------------------------------------------*/ + if( phhead.isPacked == 0x5 ) + { + decode(interface); + } + else if(phhead.isPacked==0x3) + { + fseek(ptx,-4L,1); + decodeM3(interface); + } + else + { + fseek(ptx, -4L, 1); + for(i=0;i0x100000) break; + fread(&phhead,1,sizeof(phhead),ptx); + Offset = phhead.Prev - ConstOff; + + blkend = Start + ConstOff + sizeof(PHOENIXHEAD) - 5; + blkstart = Start + 0xFFF00000; + switch(Action) + { + case ListM: + + printf("\n%.c %.1X %5.5s %4.4lX %4.4lX %4.4lX %4.4lX %5.lX %3.1i%% %4.4lX %4.4lX %5.2lXh", + phhead.ID_LO, phhead.ID_HI, + GetCompressionName(phhead.isPacked), + blkstart >> 0x10, blkstart & 0xFFFF, + (blkend + phhead.Packed1) >> 0x10, (blkend + phhead.Packed1) & 0xFFFF, + phhead.Packed1, + (dword)100*(dword)phhead.Packed1/(dword)phhead.ExpLen1, + phhead.Prev >> 0x10, phhead.Prev & 0xFFFF, + Start); + + + break; + + case XtractM: + + printf("\n%c.%1.1X",phhead.ID_LO,phhead.ID_HI); + sprintf(Buffer, "%s", GetModuleName(phhead.ID_LO)); + + if( StrLen(Buffer) > 7 ) + sprintf(Buffer, "%7.7s%1.1X.rom",GetModuleName(phhead.ID_LO),phhead.ID_HI); + else + { + sprintf(Buffer,"%s%1.1X.rom",GetModuleName(phhead.ID_LO),phhead.ID_HI); + } + + printf(" %-12.12s ... O'k",Buffer); + + + if((pto = fopen(Buffer,"wb")) == NULL) + { + printf("\nFile %s I/O error..Exit",Buf); + exit(1); + } + + + interface.infile = ptx; + interface.outfile = pto; + interface.original = phhead.ExpLen1; + interface.packed = phhead.Packed1; + + interface.dicbit = 13; + interface.method = 5; + + /*--------------------------------------------- + Evidently, isPacked == PackedLevel + ----------------------------------------------*/ + if(phhead.isPacked == 0x5) + { + decode(interface); + } + else if(phhead.isPacked==0x3) + { + fseek(ptx,-4L,1); + decodeM3(interface); + } + else + { + fseek(ptx, -4L, 1); + for(i=0;i + + +byte HelpSystem(byte argc, byte *argv[]) + { + byte x = 0, retcode = 0; + + for( x = 1; x < argc; x++) + { + if( StrCmp(argv[x], "-h" ) == 0 ) + { + printf("\n"SftName" HelpSystem Starting Now!\n"); + printf("\nThis Program Version Number %s", SftVersion); + +#ifndef __LINUX_NOW__ + printf( + "\n"SftName" - Decompressor for PhoenixBIOSes only.\n" + "\tSupported formats: Phoenix BIOS 4.0, Phoenix FirstBIOS\n\n" + ""SftName" performs on 386 or better CPU systems\n" + "under control of DOS, Win3.xx, Win9x/NT/2K or DosEmu\n\n" + "Compression schemes include: NONE, LZSS, LZINT\n\n" + "Modules marked with "IDSign" sign are compressed modules\n\n" + "\tBug reports mailto: "SftEMail"\n" + "\t\tCompiled: %s, %s\n",__DATE__,__TIME__); +#else + printf( + "\n"SftName" - Decompressor for PhoenixBIOSes only.\n" + "\tSupported formats: Phoenix BIOS 4.0, Phoenix FirstBIOS\n\n" + ""SftName" performs on 386 or better CPU systems\n" + "under control of LinuxOS\n\n" + "Compression schemes include: NONE, LZSS, LZINT\n\n" + "Modules marked with "IDSign" sign are compressed modules\n\n" + "\tBug reports mailto: "SftEMail"\n" + "\t\tCompiled: %s, %s with \n\t\t%s",__DATE__,__TIME__,__VERSION__); +#endif + printf("\n"); + retcode = 0x80; + + } + + if( StrCmp(argv[x], "-xs" ) == 0 ) retcode = 0x20; + if( StrCmp(argv[x], "-ls" ) == 0 ) retcode = 0x21; + if( StrCmp(argv[x], "-x" ) == 0 ) retcode = 0x10; + if( StrCmp(argv[x], "-l" ) == 0 ) retcode = 0x11; + if( StrCmp(argv[x], "-c" ) == 0 ) retcode += 0x40; + } + return(retcode); + + } + +void PrintHeader(byte* EOL) + { + + printf("\n%c%s%c%s", 0x4, SoftName, 0x4, EOL); + + } + +void PrintUsage() + { + + PrintHeader(""); + printf("%s", CopyRights); + printf("\n\nUsage: PhnxDeco [Options]"); + printf( + "\n" + "\t\tOptions:" + "\n\t\t\t\"-ls\" List (System) Bios Structure" + "\n\t\t\t\"-xs\" eXtract (System) Bios Modules" + "\n\t\t\t\"-l\" List Bios Structure" + "\n\t\t\t\"-x\" eXtract Bios Modules" + "\n\t\t\t\"-c\" show Bios Copyrights" + "\n\t\t\t\"-h\" Help statistics" + ); + printf("\n\n\t*%s*\n",Url); + + } diff --git a/phnxdeco/phnxsoft.h b/phnxdeco/phnxsoft.h new file mode 100644 index 0000000..e4d31c3 --- /dev/null +++ b/phnxdeco/phnxsoft.h @@ -0,0 +1,18 @@ +/********************************************** +** +** +** Defines for PhnxSoft +** +** +***********************************************/ + +#include +#include "./phnxver.h" + +#define SftName "PhoenixDeco" +#define SftEMail "Anton Borisov, anton.borisov@gmail.com" + + /********SoftWare*************/ + byte SoftName[] = "-="SftName", version "SftVersion"=-"; + byte CopyRights[] = "\n(C) Anton Borisov, 2000, 2002-2004, Portions (C) 1999-2000"; + byte Url[] = "Bug-reports direct to "SftEMail; diff --git a/phnxdeco/phnxver.h b/phnxdeco/phnxver.h new file mode 100644 index 0000000..59d9d90 --- /dev/null +++ b/phnxdeco/phnxver.h @@ -0,0 +1,17 @@ +/********************************************** +** +** +** Defines for PhnxVer +** +** +***********************************************/ + +#include + +#ifdef __LINUX_NOW__ + #define SftPlatform "Linux" +#else + #define SftPlatform "DOS32" +#endif + +#define SftVersion "0.33 ("SftPlatform")" -- cgit v1.2.3