moparisthebest/saturn-patch
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Initial commit

Browse Source
This commit is contained in:
Travis Burtrum 2021-02-16 01:40:40 -05:00
commit 19e420221e
9 changed files with 1610 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
.gitignore vendored Normal file
View File

@ -0,0 +1,6 @@
/target
*.bin*
*.diff
*.sync-conflict*
*.kate-swp
/.idea

1
.rustfmt.toml Normal file
View File

@ -0,0 +1 @@
max_width = 200

28
Cargo.lock generated Normal file
View File

@ -0,0 +1,28 @@
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
[[package]]
name = "anyhow"
version = "1.0.38"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "afddf7f520a80dbf76e6f50a35bca42a2331ef227a28b3b6dc5c2e2338d114b1"
[[package]]
name = "hmac-sha256"
version = "0.1.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "219d368c625166098039429766941449ebf303da35d642eb339503a2bdad3423"
[[package]]
name = "libc"
version = "0.2.86"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "b7282d924be3275cec7f6756ff4121987bc6481325397dde6ba3e7802b1a8b1c"
[[package]]
name = "saturn-patch"
version = "1.0.0"
dependencies = [
"anyhow",
"hmac-sha256",
"libc",
]

17
Cargo.toml Normal file
View File

@ -0,0 +1,17 @@
[package]
name = "saturn-patch"
version = "1.0.0"
authors = ["moparisthebest <admin@moparisthebest.com>"]
edition = "2018"
description = "patch and unpatch region and manufacturer code on saturn games"
repository = "https://code.moparisthebest.com/moparisthebest/saturn-patch"
keywords = ["saturn", "sega", "rom", "iso", "bin", "region"]
license = "AGPL-3.0-or-later"
readme = "README.md"
[dependencies]
anyhow = "1.0"
hmac-sha256 = "0.1.6"
libc = "0.2.72"

660
LICENSE.md Normal file
View File

@ -0,0 +1,660 @@
### GNU AFFERO GENERAL PUBLIC LICENSE
Version 3, 19 November 2007
Copyright (C) 2007 Free Software Foundation, Inc.
<https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies of this
license document, but changing it is not allowed.
### Preamble
The GNU Affero General Public License is a free, copyleft license for
software and other kinds of works, specifically designed to ensure
cooperation with the community in the case of network server software.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
our General Public Licenses are intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains
free software for all its users.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
them if you wish), that you receive source code or can get it if you
want it, that you can change the software or use pieces of it in new
free programs, and that you know you can do these things.
Developers that use our General Public Licenses protect your rights
with two steps: (1) assert copyright on the software, and (2) offer
you this License which gives you legal permission to copy, distribute
and/or modify the software.
A secondary benefit of defending all users' freedom is that
improvements made in alternate versions of the program, if they
receive widespread use, become available for other developers to
incorporate. Many developers of free software are heartened and
encouraged by the resulting cooperation. However, in the case of
software used on network servers, this result may fail to come about.
The GNU General Public License permits making a modified version and
letting the public access it on a server without ever releasing its
source code to the public.
The GNU Affero General Public License is designed specifically to
ensure that, in such cases, the modified source code becomes available
to the community. It requires the operator of a network server to
provide the source code of the modified version running there to the
users of that server. Therefore, public use of a modified version, on
a publicly accessible server, gives the public access to the source
code of the modified version.
An older license, called the Affero General Public License and
published by Affero, was designed to accomplish similar goals. This is
a different license, not a version of the Affero GPL, but Affero has
released a new version of the Affero GPL which permits relicensing
under this license.
The precise terms and conditions for copying, distribution and
modification follow.
### TERMS AND CONDITIONS
#### 0. Definitions.
"This License" refers to version 3 of the GNU Affero General Public
License.
"Copyright" also means copyright-like laws that apply to other kinds
of works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of
an exact copy. The resulting work is called a "modified version" of
the earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user
through a computer network, with no transfer of a copy, is not
conveying.
An interactive user interface displays "Appropriate Legal Notices" to
the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
#### 1. Source Code.
The "source code" for a work means the preferred form of the work for
making modifications to it. "Object code" means any non-source form of
a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users can
regenerate automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same
work.
#### 2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey,
without conditions so long as your license otherwise remains in force.
You may convey covered works to others for the sole purpose of having
them make modifications exclusively for you, or provide you with
facilities for running those works, provided that you comply with the
terms of this License in conveying all material for which you do not
control copyright. Those thus making or running the covered works for
you must do so exclusively on your behalf, under your direction and
control, on terms that prohibit them from making any copies of your
copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under the
conditions stated below. Sublicensing is not allowed; section 10 makes
it unnecessary.
#### 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such
circumvention is effected by exercising rights under this License with
respect to the covered work, and you disclaim any intention to limit
operation or modification of the work as a means of enforcing, against
the work's users, your or third parties' legal rights to forbid
circumvention of technological measures.
#### 4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you
receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
#### 5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these
conditions:
- a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
- b) The work must carry prominent notices stating that it is
released under this License and any conditions added under
section 7. This requirement modifies the requirement in section 4
to "keep intact all notices".
- c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
- d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
#### 6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of
sections 4 and 5, provided that you also convey the machine-readable
Corresponding Source under the terms of this License, in one of these
ways:
- a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
- b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the Corresponding
Source from a network server at no charge.
- c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
- d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
- e) Convey the object code using peer-to-peer transmission,
provided you inform other peers where the object code and
Corresponding Source of the work are being offered to the general
public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal,
family, or household purposes, or (2) anything designed or sold for
incorporation into a dwelling. In determining whether a product is a
consumer product, doubtful cases shall be resolved in favor of
coverage. For a particular product received by a particular user,
"normally used" refers to a typical or common use of that class of
product, regardless of the status of the particular user or of the way
in which the particular user actually uses, or expects or is expected
to use, the product. A product is a consumer product regardless of
whether the product has substantial commercial, industrial or
non-consumer uses, unless such uses represent the only significant
mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to
install and execute modified versions of a covered work in that User
Product from a modified version of its Corresponding Source. The
information must suffice to ensure that the continued functioning of
the modified object code is in no case prevented or interfered with
solely because modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or
updates for a work that has been modified or installed by the
recipient, or for the User Product in which it has been modified or
installed. Access to a network may be denied when the modification
itself materially and adversely affects the operation of the network
or violates the rules and protocols for communication across the
network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
#### 7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders
of that material) supplement the terms of this License with terms:
- a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
- b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
- c) Prohibiting misrepresentation of the origin of that material,
or requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
- d) Limiting the use for publicity purposes of names of licensors
or authors of the material; or
- e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
- f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions
of it) with contractual assumptions of liability to the recipient,
for any liability that these contractual assumptions directly
impose on those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions; the
above requirements apply either way.
#### 8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your license
from a particular copyright holder is reinstated (a) provisionally,
unless and until the copyright holder explicitly and finally
terminates your license, and (b) permanently, if the copyright holder
fails to notify you of the violation by some reasonable means prior to
60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
#### 9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run
a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
#### 10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
#### 11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims owned
or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within the
scope of its coverage, prohibits the exercise of, or is conditioned on
the non-exercise of one or more of the rights that are specifically
granted under this License. You may not convey a covered work if you
are a party to an arrangement with a third party that is in the
business of distributing software, under which you make payment to the
third party based on the extent of your activity of conveying the
work, and under which the third party grants, to any of the parties
who would receive the covered work from you, a discriminatory patent
license (a) in connection with copies of the covered work conveyed by
you (or copies made from those copies), or (b) primarily for and in
connection with specific products or compilations that contain the
covered work, unless you entered into that arrangement, or that patent
license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
#### 12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot convey a
covered work so as to satisfy simultaneously your obligations under
this License and any other pertinent obligations, then as a
consequence you may not convey it at all. For example, if you agree to
terms that obligate you to collect a royalty for further conveying
from those to whom you convey the Program, the only way you could
satisfy both those terms and this License would be to refrain entirely
from conveying the Program.
#### 13. Remote Network Interaction; Use with the GNU General Public License.
Notwithstanding any other provision of this License, if you modify the
Program, your modified version must prominently offer all users
interacting with it remotely through a computer network (if your
version supports such interaction) an opportunity to receive the
Corresponding Source of your version by providing access to the
Corresponding Source from a network server at no charge, through some
standard or customary means of facilitating copying of software. This
Corresponding Source shall include the Corresponding Source for any
work covered by version 3 of the GNU General Public License that is
incorporated pursuant to the following paragraph.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the work with which it is combined will remain governed by version
3 of the GNU General Public License.
#### 14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions
of the GNU Affero General Public License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies that a certain numbered version of the GNU Affero General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU Affero General Public License, you may choose any version ever
published by the Free Software Foundation.
If the Program specifies that a proxy can decide which future versions
of the GNU Affero General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
#### 15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT
WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND
PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
CORRECTION.
#### 16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR
CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT
NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR
LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM
TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER
PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
#### 17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
### How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these
terms.
To do so, attach the following notices to the program. It is safest to
attach them to the start of each source file to most effectively state
the exclusion of warranty; and each file should have at least the
"copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as
published by the Free Software Foundation, either version 3 of the
License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper
mail.
If your software can interact with users remotely through a computer
network, you should also make sure that it provides a way for users to
get its source. For example, if your program is a web application, its
interface could display a "Source" link that leads users to an archive
of the code. There are many ways you could offer source, and different
solutions will be better for different programs; see section 13 for
the specific requirements.
You should also get your employer (if you work as a programmer) or
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. For more information on this, and how to apply and follow
the GNU AGPL, see <https://www.gnu.org/licenses/>.

18
README.md Normal file
View File

@ -0,0 +1,18 @@
saturn-patch
------------
Reversible region and manufacturer patcher for sega saturn games.
Unlike other utilities that do this, this is open source, safe, cross platform, but most importantly, allows you to
"unpatch" your changed files by storing small backup files. The sha256 hash of the original file and the backup file are
stored in the backup so you can be confident your games can be put back to byte-for-byte original whenever you wish.
Examples
--------
```sh
# patch all bin files recursively in this directory
find -type f -name '*.bin' -print0 | xargs -0 saturn-patch 2>&1 | tee saturn-patch.log
# unpatch all bin files for which we have a .saturnpatchbak file for recursively in this directory
find -type f -name '*.saturnpatchbak' -print0 | xargs -0 saturn-unpatch 2>&1 | tee saturn-unpatch.log
```

446
src/cdrom.rs Normal file
View File

@ -0,0 +1,446 @@
/*----------------------------------------------------------------------------*/
/*-- converted from cdrom.inc with https://c2rust.com/ --*/
/*-- Rebuild CD sector fields --*/
/*-- Copyright (C) 2012 CUE --*/
/*-- --*/
/*-- This program is free software: you can redistribute it and/or modify --*/
/*-- it under the terms of the GNU General Public License as published by --*/
/*-- the Free Software Foundation, either version 3 of the License, or --*/
/*-- (at your option) any later version. --*/
/*-- --*/
/*-- This program is distributed in the hope that it will be useful, --*/
/*-- but WITHOUT ANY WARRANTY; without even the implied warranty of --*/
/*-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --*/
/*-- GNU General Public License for more details. --*/
/*-- --*/
/*-- You should have received a copy of the GNU General Public License --*/
/*-- along with this program. If not, see <http://www.gnu.org/licenses/>. --*/
/*----------------------------------------------------------------------------*/
#![allow(dead_code, mutable_transmutes, non_camel_case_types, non_snake_case,
non_upper_case_globals, unused_assignments, unused_mut)]
use libc;
/*----------------------------------------------------------------------------*/
#[no_mangle]
static mut CDROM_crc: [libc::c_uint; 256] = [0; 256];
#[no_mangle]
static mut CDROM_exp: [libc::c_uchar; 256] = [0; 256];
#[no_mangle]
static mut CDROM_log: [libc::c_uchar; 256] = [0; 256];
#[no_mangle]
static mut CDROM_enabled: libc::c_uint = 0 as libc::c_int as libc::c_uint;
/*----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Init_Tables() {
let mut edc: libc::c_uint = 0;
let mut ecc: libc::c_uint = 0;
let mut i: libc::c_uint = 0;
let mut j: libc::c_uint = 0;
i = 0 as libc::c_int as libc::c_uint;
while i < 0x100 as libc::c_int as libc::c_uint {
edc = i;
j = 0 as libc::c_int as libc::c_uint;
while j < 8 as libc::c_int as libc::c_uint {
edc = if edc & 1 as libc::c_int as libc::c_uint != 0 {
(edc >> 1 as libc::c_int) ^ 0xd8018001 as libc::c_uint
} else {
(edc) >> 1 as libc::c_int
};
j = j.wrapping_add(1)
}
CDROM_crc[i as usize] = edc;
ecc = if i & 0x80 as libc::c_int as libc::c_uint != 0 {
(i << 1 as libc::c_int) ^ 0x11d as libc::c_int as libc::c_uint
} else {
(i) << 1 as libc::c_int
};
CDROM_exp[i as usize] = ecc as libc::c_uchar;
CDROM_log[(i ^ ecc) as usize] = i as libc::c_uchar;
i = i.wrapping_add(1)
}
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_NUM2BCD(mut value: libc::c_char) -> libc::c_char {
return ((value as libc::c_int / 10 as libc::c_int) << 4 as libc::c_int | value as libc::c_int % 10 as libc::c_int) as libc::c_char;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_BCD2NUM(mut value: libc::c_char) -> libc::c_char {
return ((value as libc::c_int >> 4 as libc::c_int) * 10 as libc::c_int | value as libc::c_int & 0xf as libc::c_int) as libc::c_char;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Update(mut sector: *mut libc::c_char, mut lba: libc::c_int, mut cdmode: libc::c_int, mut flags: libc::c_int, mut check: libc::c_int) -> libc::c_int {
if CDROM_enabled == 0 {
CDROM_Init_Tables();
CDROM_enabled = 1 as libc::c_int as libc::c_uint
}
if check != 0 && CDROM_Check(sector, cdmode) != 0 {
return 1 as libc::c_int;
}
match cdmode {
1 => {
CDROM_Put_Sync(sector.offset(0 as libc::c_int as isize));
CDROM_Put_Header(sector.offset(0xc as libc::c_int as isize), lba, cdmode);
CDROM_Put_Intermediate(sector.offset(0x814 as libc::c_int as isize));
CDROM_Put_EDC(sector.offset(0 as libc::c_int as isize), 0x810 as libc::c_int, sector.offset(0x810 as libc::c_int as isize));
CDROM_Put_ECC_P(sector.offset(0xc as libc::c_int as isize), sector.offset(0x81c as libc::c_int as isize));
CDROM_Put_ECC_Q(sector.offset(0xc as libc::c_int as isize), sector.offset(0x8c8 as libc::c_int as isize));
}
2 => {
CDROM_Put_Sync(sector.offset(0 as libc::c_int as isize));
CDROM_Put_Header(sector.offset(0xc as libc::c_int as isize), lba, cdmode);
}
21 => {
CDROM_Put_Sync(sector.offset(0 as libc::c_int as isize));
//CDROM_Put_Header(sector + POS_HEADER, lba, cdmode);
CDROM_Put_SubHeader(sector.offset(0x10 as libc::c_int as isize), flags);
CDROM_Put_EDC(sector.offset(0x10 as libc::c_int as isize), 0x808 as libc::c_int, sector.offset(0x818 as libc::c_int as isize));
*(sector.offset(0xc as libc::c_int as isize) as *mut libc::c_uint) = 0 as libc::c_int as libc::c_uint;
CDROM_Put_ECC_P(sector.offset(0xc as libc::c_int as isize), sector.offset(0x81c as libc::c_int as isize));
CDROM_Put_ECC_Q(sector.offset(0xc as libc::c_int as isize), sector.offset(0x8c8 as libc::c_int as isize));
CDROM_Put_Header(sector.offset(0xc as libc::c_int as isize), lba, cdmode);
}
22 => {
CDROM_Put_Sync(sector.offset(0 as libc::c_int as isize));
CDROM_Put_Header(sector.offset(0xc as libc::c_int as isize), lba, cdmode);
CDROM_Put_SubHeader(sector.offset(0x10 as libc::c_int as isize), flags);
CDROM_Put_EDC(sector.offset(0x10 as libc::c_int as isize), 0x91c as libc::c_int, sector.offset(0x92c as libc::c_int as isize));
}
_ => {}
}
return 0 as libc::c_int;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Check(mut sector: *mut libc::c_char, mut cdmode: libc::c_int) -> libc::c_int {
let mut tmp1: libc::c_int = 0;
let mut tmp2: libc::c_int = 0;
let mut tmp3: libc::c_int = 0;
match cdmode {
1 => {
if *(sector.offset(0 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff00 as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffffff as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(8 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff as libc::c_int as libc::c_uint {
return 1 as libc::c_int;
}
if *sector.offset(0xf as libc::c_int as isize) as libc::c_int != 1 as libc::c_int {
return 1 as libc::c_int;
}
if *(sector.offset(0x814 as libc::c_int as isize) as *mut libc::c_int) != 0 {
return 1 as libc::c_int;
}
if *(sector.offset(0x814 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_int) != 0 {
return 1 as libc::c_int;
}
}
2 => {
if *(sector.offset(0 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff00 as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffffff as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(8 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff as libc::c_int as libc::c_uint {
return 1 as libc::c_int;
}
if *sector.offset(0xf as libc::c_int as isize) as libc::c_int != 2 as libc::c_int {
return 1 as libc::c_int;
}
}
21 => {
if *(sector.offset(0 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff00 as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffffff as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(8 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff as libc::c_int as libc::c_uint {
return 1 as libc::c_int;
}
if *sector.offset(0xf as libc::c_int as isize) as libc::c_int != 2 as libc::c_int {
return 1 as libc::c_int;
}
tmp1 = *(sector.offset(0x10 as libc::c_int as isize) as *mut libc::c_int);
tmp2 = *(sector.offset(0x10 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_int);
tmp3 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x20 as libc::c_int;
if tmp1 == 0 || tmp1 != tmp2 || tmp3 != 0 {
return 1 as libc::c_int;
}
tmp1 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x2 as libc::c_int;
tmp2 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x4 as libc::c_int;
tmp3 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x8 as libc::c_int;
if tmp1 != 0 && (tmp2 != 0 || tmp3 != 0) {
return 1 as libc::c_int;
}
if tmp2 != 0 && (tmp3 != 0 || tmp1 != 0) {
return 1 as libc::c_int;
}
if tmp3 != 0 && (tmp1 != 0 || tmp2 != 0) {
return 1 as libc::c_int;
}
}
22 => {
if *(sector.offset(0 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff00 as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffffff as libc::c_uint {
return 1 as libc::c_int;
}
if *(sector.offset(0 as libc::c_int as isize).offset(8 as libc::c_int as isize) as *mut libc::c_uint) != 0xffffff as libc::c_int as libc::c_uint {
return 1 as libc::c_int;
}
if *sector.offset(0xf as libc::c_int as isize) as libc::c_int != 2 as libc::c_int {
return 1 as libc::c_int;
}
tmp1 = *(sector.offset(0x10 as libc::c_int as isize) as *mut libc::c_int);
tmp2 = *(sector.offset(0x10 as libc::c_int as isize).offset(4 as libc::c_int as isize) as *mut libc::c_int);
tmp3 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x20 as libc::c_int;
if tmp1 == 0 || tmp1 != tmp2 || tmp3 == 0 {
return 1 as libc::c_int;
}
tmp1 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x2 as libc::c_int;
tmp2 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x4 as libc::c_int;
tmp3 = *sector.offset(0x12 as libc::c_int as isize) as libc::c_int & 0x8 as libc::c_int;
if tmp1 != 0 && (tmp2 != 0 || tmp3 != 0) {
return 1 as libc::c_int;
}
if tmp2 != 0 && (tmp3 != 0 || tmp1 != 0) {
return 1 as libc::c_int;
}
if tmp3 != 0 && (tmp1 != 0 || tmp2 != 0) {
return 1 as libc::c_int;
}
}
_ => {
return 1 as libc::c_int;
}
}
return 0 as libc::c_int;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_Sync(mut source: *mut libc::c_char) {
*(source as *mut libc::c_uint) = 0xffffff00 as libc::c_uint;
*(source.offset(4 as libc::c_int as isize) as *mut libc::c_uint) = 0xffffffff as libc::c_uint;
*(source.offset(8 as libc::c_int as isize) as *mut libc::c_uint) = 0xffffff as libc::c_int as libc::c_uint;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_Header(mut source: *mut libc::c_char, mut lba: libc::c_int, mut cdmode: libc::c_int) {
lba += 150 as libc::c_int;
*source = CDROM_NUM2BCD((lba / 75 as libc::c_int / 60 as libc::c_int) as libc::c_char);
*source.offset(1 as libc::c_int as isize) = CDROM_NUM2BCD((lba / 75 as libc::c_int % 60 as libc::c_int) as libc::c_char);
*source.offset(2 as libc::c_int as isize) = CDROM_NUM2BCD((lba % 75 as libc::c_int) as libc::c_char);
*source.offset(3 as libc::c_int as isize) = cdmode as libc::c_char;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_SubHeader(mut source: *mut libc::c_char, mut flags: libc::c_int) {
*(source as *mut libc::c_uint) = flags as libc::c_uint;
*(source.offset(4 as libc::c_int as isize) as *mut libc::c_uint) = flags as libc::c_uint;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_Intermediate(mut source: *mut libc::c_char) {
*(source as *mut libc::c_uint) = 0 as libc::c_int as libc::c_uint;
*(source.offset(4 as libc::c_int as isize) as *mut libc::c_uint) = 0 as libc::c_int as libc::c_uint;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_EDC(mut source: *mut libc::c_char, mut length: libc::c_int, mut target: *mut libc::c_char) {
let mut edc: libc::c_uint = 0;
let mut i: libc::c_uint = 0;
edc = 0 as libc::c_int as libc::c_uint;
i = 0 as libc::c_int as libc::c_uint;
while i < length as libc::c_uint {
edc = edc >> 8 as libc::c_int ^ CDROM_crc[((edc ^ *source.offset(i as isize) as libc::c_uint) & 0xff as libc::c_int as libc::c_uint) as usize];
i = i.wrapping_add(1)
}
*(target as *mut libc::c_uint) = edc;
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_ECC_P(mut source: *mut libc::c_char, mut target: *mut libc::c_char) {
let mut table: libc::c_uint = 0;
let mut column: libc::c_uint = 0;
let mut row: libc::c_uint = 0;
let mut index: libc::c_uint = 0;
let mut ecc: libc::c_uchar = 0;
let mut xor: libc::c_uchar = 0;
table = 0 as libc::c_int as libc::c_uint;
while table < 2 as libc::c_int as libc::c_uint {
column = 0 as libc::c_int as libc::c_uint;
while column < 43 as libc::c_int as libc::c_uint {
xor = 0 as libc::c_int as libc::c_uchar;
ecc = xor;
row = 0 as libc::c_int as libc::c_uint;
while row < 24 as libc::c_int as libc::c_uint {
index = (1 as libc::c_int as libc::c_uint)
.wrapping_mul(column)
.wrapping_add((43 as libc::c_int as libc::c_uint).wrapping_mul(row))
.wrapping_rem((24 as libc::c_int * 43 as libc::c_int) as libc::c_uint);
ecc = (ecc as libc::c_int ^ *source.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(index).wrapping_add(table) as isize) as libc::c_int) as libc::c_uchar;
ecc = CDROM_exp[ecc as usize];
xor = (xor as libc::c_int ^ *source.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(index).wrapping_add(table) as isize) as libc::c_int) as libc::c_uchar;
row = row.wrapping_add(1)
}
ecc = CDROM_log[(CDROM_exp[ecc as usize] as libc::c_int ^ xor as libc::c_int) as usize];
*target.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(column).wrapping_add(table) as isize) = ecc as libc::c_char;
*target.offset(
(2 as libc::c_int as libc::c_uint)
.wrapping_mul(column.wrapping_add(43 as libc::c_int as libc::c_uint))
.wrapping_add(table) as isize,
) = (ecc as libc::c_int ^ xor as libc::c_int) as libc::c_char;
column = column.wrapping_add(1)
}
table = table.wrapping_add(1)
}
}
/*----------------------------------------------------------------------------*/
#[no_mangle]
unsafe extern "C" fn CDROM_Put_ECC_Q(mut source: *mut libc::c_char, mut target: *mut libc::c_char) {
let mut table: libc::c_uint = 0;
let mut row: libc::c_uint = 0;
let mut column: libc::c_uint = 0;
let mut index: libc::c_uint = 0;
let mut ecc: libc::c_uchar = 0;
let mut xor: libc::c_uchar = 0;
table = 0 as libc::c_int as libc::c_uint;
while table < 2 as libc::c_int as libc::c_uint {
row = 0 as libc::c_int as libc::c_uint;
while row < 26 as libc::c_int as libc::c_uint {
xor = 0 as libc::c_int as libc::c_uchar;
ecc = xor;
column = 0 as libc::c_int as libc::c_uint;
while column < 43 as libc::c_int as libc::c_uint {
index = (43 as libc::c_int as libc::c_uint)
.wrapping_mul(row)
.wrapping_add(((1 as libc::c_int + 43 as libc::c_int) as libc::c_uint).wrapping_mul(column))
.wrapping_rem((26 as libc::c_int * 43 as libc::c_int) as libc::c_uint);
ecc = (ecc as libc::c_int ^ *source.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(index).wrapping_add(table) as isize) as libc::c_int) as libc::c_uchar;
ecc = CDROM_exp[ecc as usize];
xor = (xor as libc::c_int ^ *source.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(index).wrapping_add(table) as isize) as libc::c_int) as libc::c_uchar;
column = column.wrapping_add(1)
}
ecc = CDROM_log[(CDROM_exp[ecc as usize] as libc::c_int ^ xor as libc::c_int) as usize];
*target.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(row).wrapping_add(table) as isize) = ecc as libc::c_char;
*target.offset((2 as libc::c_int as libc::c_uint).wrapping_mul(row.wrapping_add(26 as libc::c_int as libc::c_uint)).wrapping_add(table) as isize) =
(ecc as libc::c_int ^ xor as libc::c_int) as libc::c_char;
row = row.wrapping_add(1)
}
table = table.wrapping_add(1)
}
}
#[no_mangle]
unsafe extern "C" fn Check_Image(mut sector: &[u8], mut length: *mut libc::c_int, mut offset: *mut libc::c_int, mut position: *mut libc::c_int) -> libc::c_int {
let mut buffer: [u8; 8192] = [0; 8192];
let mut i: libc::c_int = 0;
let mut n: libc::c_int = 0;
let mut tabla: [[libc::c_int; 3]; 8] = [
[0 as libc::c_int, 0x800 as libc::c_int, 0 as libc::c_int],
[1 as libc::c_int, 0x930 as libc::c_int, 0x10 as libc::c_int],
[21 as libc::c_int, 0x930 as libc::c_int, 0x18 as libc::c_int],
[1 as libc::c_int, 0x990 as libc::c_int, 0x10 as libc::c_int],
[21 as libc::c_int, 0x990 as libc::c_int, 0x18 as libc::c_int],
[1 as libc::c_int, 0x940 as libc::c_int, 0x10 as libc::c_int],
[21 as libc::c_int, 0x940 as libc::c_int, 0x18 as libc::c_int],
[-(1 as libc::c_int), -(1 as libc::c_int), -(1 as libc::c_int)],
];
n = 0 as libc::c_int;
while n < 2 as libc::c_int {
i = 0 as libc::c_int;
while tabla[i as usize][0 as libc::c_int as usize] != -(1 as libc::c_int) {
*length = tabla[i as usize][1 as libc::c_int as usize];
*position = tabla[i as usize][2 as libc::c_int as usize];
loop {
*offset = *length * 150 as libc::c_int * n;
//fseek(fp, *offset + 0x000010 * *length, SEEK_SET);
//if (fread(buffer, 2, *length, fp) != *length) return -1;
// manually implement above fseek+fread
{
let copy_start = (*offset + 0x000010 * *length) as usize;
let copy_end = copy_start + (2 * *length) as usize;
if copy_start >= sector.len() || copy_end >= sector.len() {
return -1;
}
let src = &sector[copy_start..copy_end];
&buffer[0..src.len()].copy_from_slice(src);
}
if *(buffer.as_mut_ptr().offset(*position as isize) as *mut libc::c_int) == 0x30444301 as libc::c_int {
if *(buffer.as_mut_ptr().offset(*position as isize).offset(4 as libc::c_int as isize) as *mut libc::c_int) == 0x13130 as libc::c_int {
if *(buffer.as_mut_ptr().offset(*position as isize).offset(*length as isize).offset(1 as libc::c_int as isize) as *mut libc::c_int) == 0x30304443 as libc::c_int {
return tabla[i as usize][0 as libc::c_int as usize];
}
}
}
if *position < 0x10 as libc::c_int {
break;
}
*length -= 0x10 as libc::c_int;
*position -= 0x10 as libc::c_int
}
i += 1
}
n += 1
}
return -(1 as libc::c_int);
}
/*----------------------------------------------------------------------------*/
/*-- EOF Copyright (C) 2012 CUE --*/
/*----------------------------------------------------------------------------*/
/*----------------------------------------------------------------------------*/
// above as you can see was roughly and unsafely converted from C, until I get around to cleaning that
// mess up, write some slightly nicer and rustier APIs to use
use anyhow::{bail, Result};
pub struct CDRomImage {
mode: i32,
length: usize,
offset: usize,
position: usize,
}
impl CDRomImage {
pub fn new(bytes: &[u8]) -> Result<CDRomImage> {
let mode: i32;
let mut length = 0;
let mut offset = 0;
let mut position = 0;
unsafe {
mode = Check_Image(&bytes, &mut length, &mut offset, &mut position);
}
if mode == -1 {
bail!("File not supported or invalid");
}
Ok(CDRomImage {
mode,
length: length as usize,
offset: offset as usize,
position: position as usize,
})
}
pub fn update_sectors(&self, bytes: &mut [u8]) {
unsafe {
CDROM_Update(bytes.as_mut_ptr() as *mut i8, 0, self.mode, 0, 0);
CDROM_Update(bytes[self.length..].as_mut_ptr() as *mut i8, 1, self.mode, 0, 0);
}
}
pub fn debug(&self) {
println!("mode: {}, length: {}, offset: {}, position: {}", self.mode, self.length, self.offset, self.position);
}
}

392
src/lib.rs Normal file
View File

@ -0,0 +1,392 @@
use std::cmp::min;
use std::convert::TryInto;
use std::ffi::OsString;
use std::fs::File;
use std::io::{Read, Write};
use std::path::Path;
use anyhow::{bail, Result};
use hmac_sha256::Hash;
mod cdrom;
use crate::cdrom::CDRomImage;
// you may change this if you wish
pub const DESIRED_SATURN_DISC: SaturnDisc = SaturnDisc {
// desired regions in order of preference (some disks only support 1 region, in which case first would be picked)
desired_region_bytes: *br"JUBLKTEA",
// will replace manufacturer bytes, so you can boot with KD02 black boot disc, requires 16 bytes exactly
desired_mfr_bytes: *br"SEGA TP T-81 ",
// this is what https://madroms.satakore.com/ uses
//desired_mfr_bytes: *br"SEGA TP ERPRISES"
};
// don't change below here
const SEGA_SATURN_BYTES: &[u8; 16] = br"SEGA SEGASATURN ";
const BACKUP_FILE_EXT: &str = ".saturnpatchbak";
// the order here has to match the order in REGION_STRINGS
const REGION_CODES: &[u8; 8] = br"JTUBKAEL";
const REGION_STRING_LEN: usize = 32;
const REGION_STRINGS: &[&[u8; REGION_STRING_LEN]] = &[
b"\xA0\x0E\x00\x09For JAPAN. ",
b"\xA0\x0E\x00\x09For TAIWAN and PHILIPINES. ",
b"\xA0\x0E\x00\x09For USA and CANADA. ",
b"\xA0\x0E\x00\x09For BRAZIL. ",
b"\xA0\x0E\x00\x09For KOREA. ",
b"\xA0\x0E\x00\x09For ASIA PAL area. ",
b"\xA0\x0E\x00\x09For EUROPE. ",
b"\xA0\x0E\x00\x09For LATIN AMERICA. ",
];
// 1 byte version, 32 byte header hash, and more bytes after but that's verified with a hash so it's fine
const MIN_BACKUP_SIZE: usize = 1 + 32 + 1;
fn region_index(region: &u8) -> Result<usize> {
let mut i = 0;
for c in REGION_CODES {
if c == region {
return Ok(i);
}
i += 1;
}
bail!("invalid region: {}", *region as char);
}
fn region_copy_sort_pad(regions: &[u8]) -> Vec<u8> {
let mut ret = regions.to_vec();
ret.sort_by(|a, b| region_index(a).unwrap_or(10).cmp(&region_index(b).unwrap_or(10)));
while ret.len() < 16 {
ret.push(b' ');
}
ret
}
fn region_count(regions: &[u8]) -> usize {
let mut ret = 0;
while ret < regions.len() {
if regions[ret] == b' ' {
return ret;
}
ret += 1;
}
ret
}
fn first_index_of(file_name: &OsString, haystack: &[u8], needle: &[u8]) -> Result<usize> {
for i in 0..haystack.len() - needle.len() + 1 {
if haystack[i..i + needle.len()] == needle[..] {
return Ok(i);
}
}
bail!("not saturn image? {:?}", file_name);
}
pub struct SaturnDisc {
pub desired_region_bytes: [u8; 8],
pub desired_mfr_bytes: [u8; 16],
}
impl SaturnDisc {
pub fn from_env_args() -> Result<SaturnDisc> {
let desired_mfr_bytes = match std::env::var("SATURN_MANUFACTURER") {
Ok(k) => {
let mfr_bytes = k.as_bytes();
if mfr_bytes.len() == 0 {
DESIRED_SATURN_DISC.desired_mfr_bytes
} else {
if mfr_bytes.len() > 16 {
bail!("SATURN_MANUFACTURER length {} exceeds max length of 16", mfr_bytes.len());
}
let mut ret = [20u8; 16];
ret[0..mfr_bytes.len()].copy_from_slice(mfr_bytes);
ret
}
}
Err(_) => DESIRED_SATURN_DISC.desired_mfr_bytes,
};
let desired_region_bytes = match std::env::var("SATURN_REGION") {
Ok(k) => {
let k = k.to_ascii_uppercase();
let region_bytes = k.as_bytes();
if region_bytes.len() == 0 {
DESIRED_SATURN_DISC.desired_region_bytes
} else {
if region_bytes.len() > 8 {
bail!("SATURN_REGION length {} exceeds max length of 8", region_bytes.len());
}
// validate each character is a supported region
for region in region_bytes {
region_index(region)?;
}
{
// ensure no duplicates exist
let mut region_vec = region_bytes.to_vec();
region_vec.sort();
region_vec.dedup();
if region_bytes.len() != region_bytes.len() {
bail!("SATURN_REGION must not have duplicate regions");
}
}
let mut empty = [20u8; 8];
empty[0..region_bytes.len()].copy_from_slice(region_bytes);
if region_bytes.len() != 8 {
// pad it out, we always want all possible regions so we can always overwrite entire region string
let mut x = region_bytes.len();
REGION_CODES.iter().filter(|r| !region_bytes.contains(r)).for_each(|r| {
empty[x] = *r;
x += 1;
});
}
println!("SATURN_REGION: {}", String::from_utf8_lossy(&empty));
empty
}
}
Err(_) => DESIRED_SATURN_DISC.desired_region_bytes,
};
Ok(SaturnDisc {
desired_region_bytes,
desired_mfr_bytes,
})
}
pub fn patch(&self, file_name: &OsString) -> Result<()> {
let path = Path::new(file_name);
if !path.is_file() {
bail!("file does not exist: {:?}", file_name);
}
let mut file = File::open(file_name)?;
let mut bytes = Vec::new();
file.read_to_end(&mut bytes)?;
// only look in first 256 bytes
let header_offset = first_index_of(file_name, &bytes[0..min(bytes.len(), 256)], SEGA_SATURN_BYTES)?;
let cdrom = CDRomImage::new(&bytes)?;
let orig_hash = Hash::hash(&bytes);
// now update the sectors which shouldn't do anything, and ensure it didn't do anything, if it did, bail
cdrom.update_sectors(&mut bytes);
if orig_hash != Hash::hash(&bytes) {
bail!("existing CD has bad sectors? refusing to update because won't be able to restore original file: {:?}", file_name);
}
let change_mfr = self.desired_mfr_bytes != &bytes[(header_offset + 16)..(header_offset + 32)];
let region_bytes = &bytes[(header_offset + 64)..(header_offset + 80)];
let region_count = region_count(&region_bytes);
let new_region = region_copy_sort_pad(&self.desired_region_bytes[0..region_count]);
let change_region = new_region != region_bytes;
// copy this for use later replacing strings
let region_bytes = &region_bytes[0..region_count].to_vec();
if change_mfr || change_region {
// first we need to find first region string index
let mut first_region_string_index = bytes.len();
let mut region_string_indices = Vec::with_capacity(region_count);
let mut string_begin = header_offset + 80 + 16; // end of header
let mut string_end = bytes.len();
// replace strings
for i in 0..region_count {
// these do NOT appear to be in the same order as the characters in the header, so just look anywhere, I guess...
let region_string = REGION_STRINGS[region_index(&region_bytes[i])?];
// have to add string_begin back in because first_index_of returns based on 0, and we are sending in a slice
let string_offset = first_index_of(file_name, &bytes[string_begin..string_end], region_string)? + string_begin;
if i == 0 && region_count > 1 {
// calculate max/min for future searches
// we might have found the last, so first would be this far back exactly
string_begin = string_offset - ((region_count - 1) * REGION_STRING_LEN);
// and if we found the first, then we might be twice the length back
string_end = string_begin + (region_count * REGION_STRING_LEN * 2);
}
if string_offset < first_region_string_index {
first_region_string_index = string_offset;
}
region_string_indices.push(string_offset);
}
let mut backup_file_path = file_name.clone();
backup_file_path.push(BACKUP_FILE_EXT);
let backup_file_path = Path::new(&backup_file_path);
let write_header = !backup_file_path.is_file();
let mut backup_vec = Vec::new();
if write_header {
// only write a header backup if one doesn't exist
// first write original file sha256 hash, exactly 32 bytes
backup_vec.write_all(&orig_hash)?;
// next write region_count as a u8
backup_vec.push(region_count as u8);
// next write first_region_string_index as a u32 in be/network byte order
backup_vec.write_all(&(first_region_string_index as u32).to_be_bytes())?;
// next write original manufacturer, always 16 bytes
backup_vec.write_all(&bytes[(header_offset + 16)..(header_offset + 32)])?;
// next write original regions, always 16 bytes
backup_vec.write_all(&bytes[(header_offset + 64)..(header_offset + 80)])?;
// next write original region strings, length depends on region_count
backup_vec.write_all(&bytes[first_region_string_index..(first_region_string_index + (region_count * REGION_STRING_LEN))])?;
}
if change_mfr {
&bytes[(header_offset + 16)..(header_offset + 32)].copy_from_slice(&self.desired_mfr_bytes);
}
if change_region {
&bytes[(header_offset + 64)..(header_offset + 80)].copy_from_slice(&new_region);
// this way does it in order vs using region_string_indices which replaces them in the order
// the disc already had them in, is one more right than the other?
//let mut string_offset = first_region_string_index;
// replace strings
for i in 0..region_count {
let new_region_string = REGION_STRINGS[region_index(&new_region[i])?];
let string_offset = region_string_indices[i];
&bytes[string_offset..(string_offset + REGION_STRING_LEN)].copy_from_slice(new_region_string);
//string_offset += REGION_STRING_LEN;
}
}
cdrom.update_sectors(&mut bytes);
if write_header {
// only write a header backup if one doesn't exist
let mut backup_file = File::create(backup_file_path)?;
// first write 1 byte for a version number in case this format changes, 0 for now
backup_file.write_all(&[0])?;
// next write the sha256 hash of the rest of this backup file so we can verify it's good when we read it in, exactly 32 bytes
backup_file.write_all(&Hash::hash(&backup_vec))?;
// then write the rest of the file
backup_file.write_all(&backup_vec)?;
drop(backup_vec); // we don't need this anymore
}
let mut file = File::create(file_name)?;
file.write_all(&bytes)?;
print!("SUCCESS: ");
if write_header {
print!("wrote header backup, ");
}
if change_mfr {
print!("changed manufacturer, ");
}
if change_region {
print!("changed regions, ");
}
println!("patched: {:?}", file_name);
} else {
println!("SUCCESS: already desired manufacturer and regions {:?}", file_name);
}
Ok(())
}
pub fn unpatch(file_name: &OsString) -> Result<()> {
let path = Path::new(file_name);
if !path.is_file() {
bail!("file does not exist: {:?}", file_name);
}
let (file_name, header_backup_str) = if path.extension().map_or(false, |ext| ext.eq(&BACKUP_FILE_EXT[1..])) {
// let's support sending in this too, in which case we'll patch the corresponding non-backup file
let mut new_path = path.to_path_buf();
new_path.set_file_name(path.file_stem().expect("no file name? impossible without extension I think..."));
(new_path.into_os_string(), file_name.to_owned())
} else {
let mut header_backup_str = file_name.clone();
header_backup_str.push(BACKUP_FILE_EXT);
(file_name.to_owned(), header_backup_str)
};
let path = Path::new(&file_name);
if !path.is_file() {
bail!("file {:?} does not exist for backup file {:?}", file_name, header_backup_str);
}
let header_backup = Path::new(&header_backup_str);
if !header_backup.is_file() {
bail!("backup file {:?} does not exist for file {:?}", header_backup_str, file_name);
}
let mut file = File::open(path)?;
let mut bytes = Vec::new();
file.read_to_end(&mut bytes)?;
let mut header_backup = File::open(header_backup)?;
let mut header_bytes = Vec::new();
header_backup.read_to_end(&mut header_bytes)?;
if header_bytes.len() < MIN_BACKUP_SIZE {
bail!(
"backup file {:?} length {} is less than minimum length of {} for file {:?}",
header_backup_str,
header_bytes.len(),
MIN_BACKUP_SIZE,
file_name
);
}
if header_bytes[0] != 0 {
bail!("corrupt backup file or unsupported version {}, only version 0 supported: {:?}", header_bytes[0], header_backup_str);
}
if header_bytes[1..33] != Hash::hash(&header_bytes[33..]) {
bail!("corrupt backup file, hash mismatch: {:?}", header_backup_str);
}
// let's cut the cruft we won't need off header_bytes for easier math
let header_bytes = &header_bytes[33..];
// only look in first 256 bytes
let header_offset = first_index_of(&file_name, &bytes[0..min(bytes.len(), 256)], SEGA_SATURN_BYTES)?;
let cdrom = CDRomImage::new(&bytes)?;
// let's slice up some views into header_bytes
let orig_hash = &header_bytes[0..32];
let region_count = header_bytes[32] as usize;
let first_region_string_index = u32::from_be_bytes(header_bytes[33..37].try_into()?) as usize;
// and again to make math more comfortable
let header_bytes = &header_bytes[37..];
let manufacturer = &header_bytes[0..16];
let regions = &header_bytes[16..32];
let region_strings = &header_bytes[32..];
if &bytes[(header_offset + 16)..(header_offset + 32)] != manufacturer
|| &bytes[(header_offset + 64)..(header_offset + 80)] != regions
|| &bytes[first_region_string_index..(first_region_string_index + (region_count * REGION_STRING_LEN))] != region_strings
{
&bytes[(header_offset + 16)..(header_offset + 32)].copy_from_slice(manufacturer);
&bytes[(header_offset + 64)..(header_offset + 80)].copy_from_slice(regions);
&bytes[first_region_string_index..(first_region_string_index + (region_count * REGION_STRING_LEN))].copy_from_slice(region_strings);
cdrom.update_sectors(&mut bytes);
if orig_hash != Hash::hash(&bytes) {
bail!("restore failed, hash mismatch: {:?}", file_name);
}
let mut file = File::create(&file_name)?;
file.write_all(&bytes)?;
file.flush()?;
drop(file);
// we've successfully written the restored file to disk, might as well delete the backup file
// but we don't want to fail based on this so ignore any errors
std::fs::remove_file(header_backup_str).ok();
println!("SUCCESS: unpatched: {:?}", file_name);
} else if orig_hash == Hash::hash(&bytes) {
// let's go ahead and try to delete un-needed backup file, but again, ignore errors
std::fs::remove_file(header_backup_str).ok();
println!("SUCCESS: already unpatched: {:?}", file_name);
} else {
bail!("restore failed, unknown problem: {:?}", file_name);
}
Ok(())
}
}

42
src/main.rs Normal file
View File

@ -0,0 +1,42 @@
use saturn_patch::{SaturnDisc, DESIRED_SATURN_DISC};
use std::env;
use std::ffi::OsString;
use anyhow::Result;
fn main() {
let mut args = env::args_os().peekable();
// let's go by name of executable to decide what operation to run
let mut patch = args.next().map_or(true, |exe| !exe.to_string_lossy().to_ascii_lowercase().contains("unpatch"));
// but also support a single arg in the first position, if people wish
if args.peek().map_or(false, |arg| arg.eq("-u") || arg.eq("--unpatch")) {
args.next(); // just skip the next one
patch = false;
}
let saturn_disc = if patch {
match SaturnDisc::from_env_args() {
Ok(sat_p) => sat_p,
Err(err) => {
eprintln!("ERROR: {}", err);
std::process::exit(2);
}
}
} else {
DESIRED_SATURN_DISC
};
let patch: Box<dyn Fn(&OsString) -> Result<()>> = if patch { Box::new(|f| saturn_disc.patch(f)) } else { Box::new(|f| SaturnDisc::unpatch(f)) };
let mut exit_code = 0;
for file_name in args {
if let Err(err) = patch(&file_name) {
eprintln!("ERROR: {}", err);
exit_code = 1;
}
}
std::process::exit(exit_code);
}