First commit.
This commit is contained in:
Rebecca Buckingham
commit
cafbf52f2f
|
|
@ -0,0 +1,61 @@
|
|||
# Prerequisites
|
||||
*.d
|
||||
|
||||
# Object files
|
||||
*.o
|
||||
*.ko
|
||||
*.obj
|
||||
*.elf
|
||||
|
||||
# Linker output
|
||||
*.ilk
|
||||
*.map
|
||||
*.exp
|
||||
|
||||
# Precompiled Headers
|
||||
*.gch
|
||||
*.pch
|
||||
|
||||
# Libraries
|
||||
*.lib
|
||||
*.a
|
||||
*.la
|
||||
*.lo
|
||||
|
||||
# Shared objects (inc. Windows DLLs)
|
||||
*.dll
|
||||
*.so
|
||||
*.so.*
|
||||
*.dylib
|
||||
|
||||
# Executables
|
||||
*.exe
|
||||
*.out
|
||||
*.app
|
||||
*.i*86
|
||||
*.x86_64
|
||||
*.hex
|
||||
|
||||
# Debug files
|
||||
*.dSYM/
|
||||
*.su
|
||||
*.idb
|
||||
*.pdb
|
||||
|
||||
# Kernel Module Compile Results
|
||||
*.mod*
|
||||
*.cmd
|
||||
.tmp_versions/
|
||||
modules.order
|
||||
Module.symvers
|
||||
Mkfile.old
|
||||
dkms.conf
|
||||
|
||||
# Other
|
||||
bsx
|
||||
xcuserdata/
|
||||
*.hmap
|
||||
*.dSYM.zip
|
||||
*.dSYM
|
||||
.build/
|
||||
|
||||
|
|
@ -0,0 +1,674 @@
|
|||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 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 General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<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 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 <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
|
|
@ -0,0 +1,26 @@
|
|||
# Variables
|
||||
CC = gcc
|
||||
CFLAGS = -Wall -Wextra -std=c11 -I/usr/local/include/SDL2
|
||||
LDFLAGS = -L/usr/local/lib -lSDL2
|
||||
SRC_DIR = src
|
||||
SOURCES = $(wildcard $(SRC_DIR)/*.c)
|
||||
OBJECTS = $(SOURCES:$(SRC_DIR)/%.c=%.o)
|
||||
TARGET = bsx
|
||||
|
||||
# Default target
|
||||
all: $(TARGET)
|
||||
|
||||
# Linking
|
||||
$(TARGET): $(OBJECTS)
|
||||
$(CC) $(LDFLAGS) -o $@ $^
|
||||
|
||||
# Compiling
|
||||
%.o: $(SRC_DIR)/%.c
|
||||
$(CC) $(CFLAGS) -c -o $@ $<
|
||||
|
||||
# Clean up
|
||||
clean:
|
||||
rm -f $(OBJECTS) $(TARGET)
|
||||
|
||||
# Phony targets
|
||||
.PHONY: all clean
|
||||
|
|
@ -0,0 +1,34 @@
|
|||
#+TITLE: Bsx : Sentinel 65X System Emulator
|
||||
|
||||
(C)opyright 2024, Rebecca Buckingham.
|
||||
|
||||
* License
|
||||
- lib65816 code is licensed GPL3.
|
||||
- VERA emulation is licensed 2-clause BSD.
|
||||
- All other code is licensed GPL3.
|
||||
|
||||
* Requirements
|
||||
- SDL2 development libraries need to be installed.
|
||||
|
||||
* Installation
|
||||
- Run make, then copy the bsx executable whereever you want it.
|
||||
|
||||
* Usage
|
||||
- bsx path_to_rom_file
|
||||
|
||||
* Status
|
||||
** What's done
|
||||
1) 65C816 emulation via lib65816.
|
||||
2) Selected 65C265 features. (Can be disabled by undefining CPU65265 in opcodes.h.)
|
||||
- 65C265 Vectors are implemented. (COP, ABORT, NMI, IRQ)
|
||||
- Added some 65C265-specific IRQ sources and vectors: IRQT5, IRNE64.
|
||||
3) VERA emulation via code extracted from X16 emulator.
|
||||
4) Loading of selected BIOS ROM.
|
||||
** What's not done (i.e. TODO List)
|
||||
1) System timing. Emulation always runs flat out instead at stable 8 Mhz.
|
||||
2) Clean up dispatch loop in dispatch.c for easier maintenance.
|
||||
3) Keyboard emulation.
|
||||
4) Timer emulation. (Start with timer #5)
|
||||
5) SD Card emulation.
|
||||
6) Audio emulation.
|
||||
7) SNES controller emulation.
|
||||
|
|
@ -0,0 +1,297 @@
|
|||
// !$*UTF8*$!
|
||||
{
|
||||
archiveVersion = 1;
|
||||
classes = {
|
||||
};
|
||||
objectVersion = 56;
|
||||
objects = {
|
||||
|
||||
/* Begin PBXFileReference section */
|
||||
B309DC412C489D4500A7FE20 /* sdl_events.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = sdl_events.h; sourceTree = "<group>"; };
|
||||
B309DC422C489D4500A7FE20 /* sdl_events.c */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.c; path = sdl_events.c; sourceTree = "<group>"; };
|
||||
B334DFC62C485851001B5E35 /* Makefile */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.make; path = Makefile; sourceTree = "<group>"; };
|
||||
B334DFC72C485851001B5E35 /* config.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = config.h; sourceTree = "<group>"; };
|
||||
B334DFC82C485851001B5E35 /* cpu.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = cpu.c; sourceTree = "<group>"; };
|
||||
B334DFC92C485851001B5E35 /* cpu.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cpu.h; sourceTree = "<group>"; };
|
||||
B334DFCA2C485851001B5E35 /* cpuevent.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = cpuevent.c; sourceTree = "<group>"; };
|
||||
B334DFCB2C485851001B5E35 /* cpuevent.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cpuevent.h; sourceTree = "<group>"; };
|
||||
B334DFCC2C485851001B5E35 /* cpumacro.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cpumacro.h; sourceTree = "<group>"; };
|
||||
B334DFCD2C485851001B5E35 /* cpumicro.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cpumicro.h; sourceTree = "<group>"; };
|
||||
B334DFCE2C485851001B5E35 /* cputable.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cputable.h; sourceTree = "<group>"; };
|
||||
B334DFCF2C485851001B5E35 /* cycles.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cycles.h; sourceTree = "<group>"; };
|
||||
B334DFD02C485851001B5E35 /* debugger.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = debugger.c; sourceTree = "<group>"; };
|
||||
B334DFD12C485851001B5E35 /* dispatch.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = dispatch.c; sourceTree = "<group>"; };
|
||||
B334DFD22C485851001B5E35 /* glue.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = glue.c; sourceTree = "<group>"; };
|
||||
B334DFD32C485851001B5E35 /* glue.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = glue.h; sourceTree = "<group>"; };
|
||||
B334DFD42C485851001B5E35 /* main.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = main.c; sourceTree = "<group>"; };
|
||||
B334DFD52C485851001B5E35 /* opcodes.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = opcodes.h; sourceTree = "<group>"; };
|
||||
B334DFD62C485851001B5E35 /* opcodes1.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = opcodes1.c; sourceTree = "<group>"; };
|
||||
B334DFD72C485851001B5E35 /* opcodes2.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = opcodes2.c; sourceTree = "<group>"; };
|
||||
B334DFD82C485851001B5E35 /* opcodes3.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = opcodes3.c; sourceTree = "<group>"; };
|
||||
B334DFD92C485851001B5E35 /* opcodes4.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = opcodes4.c; sourceTree = "<group>"; };
|
||||
B334DFDA2C485851001B5E35 /* opcodes5.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = opcodes5.c; sourceTree = "<group>"; };
|
||||
B334DFDB2C485851001B5E35 /* table.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = table.c; sourceTree = "<group>"; };
|
||||
B334DFDC2C485851001B5E35 /* util.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = util.c; sourceTree = "<group>"; };
|
||||
B334DFDD2C485851001B5E35 /* util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = util.h; sourceTree = "<group>"; };
|
||||
B334DFDE2C485851001B5E35 /* video.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = video.c; sourceTree = "<group>"; };
|
||||
B334DFDF2C485851001B5E35 /* video.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = video.h; sourceTree = "<group>"; };
|
||||
B3C64FF12C496BE3005A12B6 /* README.md */ = {isa = PBXFileReference; lastKnownFileType = net.daringfireball.markdown; path = README.md; sourceTree = "<group>"; };
|
||||
B3C64FF22C496BF4005A12B6 /* todo.org */ = {isa = PBXFileReference; lastKnownFileType = text; path = todo.org; sourceTree = "<group>"; };
|
||||
/* End PBXFileReference section */
|
||||
|
||||
/* Begin PBXGroup section */
|
||||
B334DFBB2C4857EB001B5E35 = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
B3C64FF22C496BF4005A12B6 /* todo.org */,
|
||||
B3C64FF12C496BE3005A12B6 /* README.md */,
|
||||
B334DFC62C485851001B5E35 /* Makefile */,
|
||||
B334DFE02C485851001B5E35 /* src */,
|
||||
);
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
B334DFE02C485851001B5E35 /* src */ = {
|
||||
isa = PBXGroup;
|
||||
children = (
|
||||
B334DFC72C485851001B5E35 /* config.h */,
|
||||
B334DFC82C485851001B5E35 /* cpu.c */,
|
||||
B334DFC92C485851001B5E35 /* cpu.h */,
|
||||
B334DFCA2C485851001B5E35 /* cpuevent.c */,
|
||||
B334DFCB2C485851001B5E35 /* cpuevent.h */,
|
||||
B334DFCC2C485851001B5E35 /* cpumacro.h */,
|
||||
B334DFCD2C485851001B5E35 /* cpumicro.h */,
|
||||
B334DFCE2C485851001B5E35 /* cputable.h */,
|
||||
B334DFCF2C485851001B5E35 /* cycles.h */,
|
||||
B334DFD02C485851001B5E35 /* debugger.c */,
|
||||
B334DFD12C485851001B5E35 /* dispatch.c */,
|
||||
B334DFD22C485851001B5E35 /* glue.c */,
|
||||
B334DFD32C485851001B5E35 /* glue.h */,
|
||||
B334DFD42C485851001B5E35 /* main.c */,
|
||||
B334DFD52C485851001B5E35 /* opcodes.h */,
|
||||
B334DFD62C485851001B5E35 /* opcodes1.c */,
|
||||
B334DFD72C485851001B5E35 /* opcodes2.c */,
|
||||
B334DFD82C485851001B5E35 /* opcodes3.c */,
|
||||
B334DFD92C485851001B5E35 /* opcodes4.c */,
|
||||
B334DFDA2C485851001B5E35 /* opcodes5.c */,
|
||||
B334DFDB2C485851001B5E35 /* table.c */,
|
||||
B334DFDC2C485851001B5E35 /* util.c */,
|
||||
B334DFDD2C485851001B5E35 /* util.h */,
|
||||
B334DFDE2C485851001B5E35 /* video.c */,
|
||||
B334DFDF2C485851001B5E35 /* video.h */,
|
||||
B309DC422C489D4500A7FE20 /* sdl_events.c */,
|
||||
B309DC412C489D4500A7FE20 /* sdl_events.h */,
|
||||
);
|
||||
path = src;
|
||||
sourceTree = "<group>";
|
||||
};
|
||||
/* End PBXGroup section */
|
||||
|
||||
/* Begin PBXLegacyTarget section */
|
||||
B334DFC02C4857EB001B5E35 /* bsxmac */ = {
|
||||
isa = PBXLegacyTarget;
|
||||
buildArgumentsString = "$(ACTION)";
|
||||
buildConfigurationList = B334DFC32C4857EB001B5E35 /* Build configuration list for PBXLegacyTarget "bsxmac" */;
|
||||
buildPhases = (
|
||||
);
|
||||
buildToolPath = /usr/bin/make;
|
||||
dependencies = (
|
||||
);
|
||||
name = bsxmac;
|
||||
passBuildSettingsInEnvironment = 1;
|
||||
productName = bsxmac;
|
||||
};
|
||||
/* End PBXLegacyTarget section */
|
||||
|
||||
/* Begin PBXProject section */
|
||||
B334DFBC2C4857EB001B5E35 /* Project object */ = {
|
||||
isa = PBXProject;
|
||||
attributes = {
|
||||
BuildIndependentTargetsInParallel = 1;
|
||||
LastUpgradeCheck = 1530;
|
||||
TargetAttributes = {
|
||||
B334DFC02C4857EB001B5E35 = {
|
||||
CreatedOnToolsVersion = 15.3;
|
||||
};
|
||||
};
|
||||
};
|
||||
buildConfigurationList = B334DFBF2C4857EB001B5E35 /* Build configuration list for PBXProject "bsxmac" */;
|
||||
compatibilityVersion = "Xcode 14.0";
|
||||
developmentRegion = en;
|
||||
hasScannedForEncodings = 0;
|
||||
knownRegions = (
|
||||
en,
|
||||
Base,
|
||||
);
|
||||
mainGroup = B334DFBB2C4857EB001B5E35;
|
||||
projectDirPath = "";
|
||||
projectRoot = "";
|
||||
targets = (
|
||||
B334DFC02C4857EB001B5E35 /* bsxmac */,
|
||||
);
|
||||
};
|
||||
/* End PBXProject section */
|
||||
|
||||
/* Begin XCBuildConfiguration section */
|
||||
B334DFC12C4857EB001B5E35 /* Debug */ = {
|
||||
isa = XCBuildConfiguration;
|
||||
buildSettings = {
|
||||
ALWAYS_SEARCH_USER_PATHS = NO;
|
||||
ASSETCATALOG_COMPILER_GENERATE_SWIFT_ASSET_SYMBOL_EXTENSIONS = YES;
|
||||
CLANG_ANALYZER_NONNULL = YES;
|
||||
CLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;
|
||||
CLANG_CXX_LANGUAGE_STANDARD = "gnu++20";
|
||||
CLANG_ENABLE_MODULES = YES;
|
||||
CLANG_ENABLE_OBJC_ARC = YES;
|
||||
CLANG_ENABLE_OBJC_WEAK = YES;
|
||||
CLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;
|
||||
CLANG_WARN_BOOL_CONVERSION = YES;
|
||||
CLANG_WARN_COMMA = YES;
|
||||
CLANG_WARN_CONSTANT_CONVERSION = YES;
|
||||
CLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;
|
||||
CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
|
||||
CLANG_WARN_DOCUMENTATION_COMMENTS = YES;
|
||||
CLANG_WARN_EMPTY_BODY = YES;
|
||||
CLANG_WARN_ENUM_CONVERSION = YES;
|
||||
CLANG_WARN_INFINITE_RECURSION = YES;
|
||||
CLANG_WARN_INT_CONVERSION = YES;
|
||||
CLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;
|
||||
CLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;
|
||||
CLANG_WARN_OBJC_LITERAL_CONVERSION = YES;
|
||||
CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
|
||||
CLANG_WARN_QUOTED_INCLUDE_IN_FRAMEWORK_HEADER = YES;
|
||||
CLANG_WARN_RANGE_LOOP_ANALYSIS = YES;
|
||||
CLANG_WARN_STRICT_PROTOTYPES = YES;
|
||||
CLANG_WARN_SUSPICIOUS_MOVE = YES;
|
||||
CLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;
|
||||
CLANG_WARN_UNREACHABLE_CODE = YES;
|
||||
CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
|
||||
COPY_PHASE_STRIP = NO;
|
||||
DEBUG_INFORMATION_FORMAT = dwarf;
|
||||
ENABLE_STRICT_OBJC_MSGSEND = YES;
|
||||
ENABLE_TESTABILITY = YES;
|
||||
ENABLE_USER_SCRIPT_SANDBOXING = YES;
|
||||
GCC_C_LANGUAGE_STANDARD = gnu17;
|
||||
GCC_DYNAMIC_NO_PIC = NO;
|
||||
GCC_NO_COMMON_BLOCKS = YES;
|
||||
GCC_OPTIMIZATION_LEVEL = 0;
|
||||
GCC_PREPROCESSOR_DEFINITIONS = (
|
||||
"DEBUG=1",
|
||||
"$(inherited)",
|
||||
);
|
||||
GCC_WARN_64_TO_32_BIT_CONVERSION = YES;
|
||||
GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;
|
||||
GCC_WARN_UNDECLARED_SELECTOR = YES;
|
||||
GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;
|
||||
GCC_WARN_UNUSED_FUNCTION = YES;
|
||||
GCC_WARN_UNUSED_VARIABLE = YES;
|
||||
LOCALIZATION_PREFERS_STRING_CATALOGS = YES;
|
||||
MTL_ENABLE_DEBUG_INFO = INCLUDE_SOURCE;
|
||||
MTL_FAST_MATH = YES;
|
||||
ONLY_ACTIVE_ARCH = YES;
|
||||
};
|
||||
name = Debug;
|
||||
};
|
||||
B334DFC22C4857EB001B5E35 /* Release */ = {
|
||||
isa = XCBuildConfiguration;
|
||||
buildSettings = {
|
||||
ALWAYS_SEARCH_USER_PATHS = NO;
|
||||
ASSETCATALOG_COMPILER_GENERATE_SWIFT_ASSET_SYMBOL_EXTENSIONS = YES;
|
||||
CLANG_ANALYZER_NONNULL = YES;
|
||||
CLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;
|
||||
CLANG_CXX_LANGUAGE_STANDARD = "gnu++20";
|
||||
CLANG_ENABLE_MODULES = YES;
|
||||
CLANG_ENABLE_OBJC_ARC = YES;
|
||||
CLANG_ENABLE_OBJC_WEAK = YES;
|
||||
CLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;
|
||||
CLANG_WARN_BOOL_CONVERSION = YES;
|
||||
CLANG_WARN_COMMA = YES;
|
||||
CLANG_WARN_CONSTANT_CONVERSION = YES;
|
||||
CLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;
|
||||
CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
|
||||
CLANG_WARN_DOCUMENTATION_COMMENTS = YES;
|
||||
CLANG_WARN_EMPTY_BODY = YES;
|
||||
CLANG_WARN_ENUM_CONVERSION = YES;
|
||||
CLANG_WARN_INFINITE_RECURSION = YES;
|
||||
CLANG_WARN_INT_CONVERSION = YES;
|
||||
CLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;
|
||||
CLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;
|
||||
CLANG_WARN_OBJC_LITERAL_CONVERSION = YES;
|
||||
CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
|
||||
CLANG_WARN_QUOTED_INCLUDE_IN_FRAMEWORK_HEADER = YES;
|
||||
CLANG_WARN_RANGE_LOOP_ANALYSIS = YES;
|
||||
CLANG_WARN_STRICT_PROTOTYPES = YES;
|
||||
CLANG_WARN_SUSPICIOUS_MOVE = YES;
|
||||
CLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;
|
||||
CLANG_WARN_UNREACHABLE_CODE = YES;
|
||||
CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
|
||||
COPY_PHASE_STRIP = NO;
|
||||
DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
|
||||
ENABLE_NS_ASSERTIONS = NO;
|
||||
ENABLE_STRICT_OBJC_MSGSEND = YES;
|
||||
ENABLE_USER_SCRIPT_SANDBOXING = YES;
|
||||
GCC_C_LANGUAGE_STANDARD = gnu17;
|
||||
GCC_NO_COMMON_BLOCKS = YES;
|
||||
GCC_WARN_64_TO_32_BIT_CONVERSION = YES;
|
||||
GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;
|
||||
GCC_WARN_UNDECLARED_SELECTOR = YES;
|
||||
GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;
|
||||
GCC_WARN_UNUSED_FUNCTION = YES;
|
||||
GCC_WARN_UNUSED_VARIABLE = YES;
|
||||
LOCALIZATION_PREFERS_STRING_CATALOGS = YES;
|
||||
MTL_ENABLE_DEBUG_INFO = NO;
|
||||
MTL_FAST_MATH = YES;
|
||||
};
|
||||
name = Release;
|
||||
};
|
||||
B334DFC42C4857EB001B5E35 /* Debug */ = {
|
||||
isa = XCBuildConfiguration;
|
||||
buildSettings = {
|
||||
CODE_SIGN_STYLE = Automatic;
|
||||
DEBUGGING_SYMBOLS = YES;
|
||||
DEBUG_INFORMATION_FORMAT = dwarf;
|
||||
DEVELOPMENT_TEAM = 4GA2885M3Y;
|
||||
GCC_GENERATE_DEBUGGING_SYMBOLS = YES;
|
||||
GCC_OPTIMIZATION_LEVEL = 0;
|
||||
OTHER_CFLAGS = "";
|
||||
OTHER_LDFLAGS = "";
|
||||
PRODUCT_NAME = "$(TARGET_NAME)";
|
||||
};
|
||||
name = Debug;
|
||||
};
|
||||
B334DFC52C4857EB001B5E35 /* Release */ = {
|
||||
isa = XCBuildConfiguration;
|
||||
buildSettings = {
|
||||
CODE_SIGN_STYLE = Automatic;
|
||||
DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
|
||||
DEVELOPMENT_TEAM = 4GA2885M3Y;
|
||||
OTHER_CFLAGS = "";
|
||||
OTHER_LDFLAGS = "";
|
||||
PRODUCT_NAME = "$(TARGET_NAME)";
|
||||
};
|
||||
name = Release;
|
||||
};
|
||||
/* End XCBuildConfiguration section */
|
||||
|
||||
/* Begin XCConfigurationList section */
|
||||
B334DFBF2C4857EB001B5E35 /* Build configuration list for PBXProject "bsxmac" */ = {
|
||||
isa = XCConfigurationList;
|
||||
buildConfigurations = (
|
||||
B334DFC12C4857EB001B5E35 /* Debug */,
|
||||
B334DFC22C4857EB001B5E35 /* Release */,
|
||||
);
|
||||
defaultConfigurationIsVisible = 0;
|
||||
defaultConfigurationName = Release;
|
||||
};
|
||||
B334DFC32C4857EB001B5E35 /* Build configuration list for PBXLegacyTarget "bsxmac" */ = {
|
||||
isa = XCConfigurationList;
|
||||
buildConfigurations = (
|
||||
B334DFC42C4857EB001B5E35 /* Debug */,
|
||||
B334DFC52C4857EB001B5E35 /* Release */,
|
||||
);
|
||||
defaultConfigurationIsVisible = 0;
|
||||
defaultConfigurationName = Release;
|
||||
};
|
||||
/* End XCConfigurationList section */
|
||||
};
|
||||
rootObject = B334DFBC2C4857EB001B5E35 /* Project object */;
|
||||
}
|
||||
|
|
@ -0,0 +1,7 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<Workspace
|
||||
version = "1.0">
|
||||
<FileRef
|
||||
location = "self:">
|
||||
</FileRef>
|
||||
</Workspace>
|
||||
|
|
@ -0,0 +1,8 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
|
||||
<plist version="1.0">
|
||||
<dict>
|
||||
<key>IDEDidComputeMac32BitWarning</key>
|
||||
<true/>
|
||||
</dict>
|
||||
</plist>
|
||||
|
|
@ -0,0 +1,72 @@
|
|||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<Scheme
|
||||
LastUpgradeVersion = "1530"
|
||||
version = "2.3">
|
||||
<BuildAction
|
||||
parallelizeBuildables = "YES"
|
||||
buildImplicitDependencies = "YES"
|
||||
buildArchitectures = "Automatic">
|
||||
<BuildActionEntries>
|
||||
<BuildActionEntry
|
||||
buildForTesting = "YES"
|
||||
buildForRunning = "YES"
|
||||
buildForProfiling = "YES"
|
||||
buildForArchiving = "YES"
|
||||
buildForAnalyzing = "YES">
|
||||
<BuildableReference
|
||||
BuildableIdentifier = "primary"
|
||||
BlueprintIdentifier = "B334DFC02C4857EB001B5E35"
|
||||
BuildableName = "bsxmac"
|
||||
BlueprintName = "bsxmac"
|
||||
ReferencedContainer = "container:bsxmac.xcodeproj">
|
||||
</BuildableReference>
|
||||
</BuildActionEntry>
|
||||
</BuildActionEntries>
|
||||
</BuildAction>
|
||||
<TestAction
|
||||
buildConfiguration = "Debug"
|
||||
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
|
||||
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
|
||||
shouldUseLaunchSchemeArgsEnv = "YES"
|
||||
shouldAutocreateTestPlan = "YES">
|
||||
</TestAction>
|
||||
<LaunchAction
|
||||
buildConfiguration = "Debug"
|
||||
selectedDebuggerIdentifier = "Xcode.DebuggerFoundation.Debugger.LLDB"
|
||||
selectedLauncherIdentifier = "Xcode.DebuggerFoundation.Launcher.LLDB"
|
||||
launchStyle = "0"
|
||||
useCustomWorkingDirectory = "NO"
|
||||
ignoresPersistentStateOnLaunch = "NO"
|
||||
debugDocumentVersioning = "YES"
|
||||
debugServiceExtension = "internal"
|
||||
allowLocationSimulation = "YES">
|
||||
<PathRunnable
|
||||
runnableDebuggingMode = "0"
|
||||
Location = "workspace"
|
||||
FilePath = "bsx">
|
||||
</PathRunnable>
|
||||
</LaunchAction>
|
||||
<ProfileAction
|
||||
buildConfiguration = "Release"
|
||||
shouldUseLaunchSchemeArgsEnv = "YES"
|
||||
savedToolIdentifier = ""
|
||||
useCustomWorkingDirectory = "NO"
|
||||
debugDocumentVersioning = "YES">
|
||||
<MacroExpansion>
|
||||
<BuildableReference
|
||||
BuildableIdentifier = "primary"
|
||||
BlueprintIdentifier = "B334DFC02C4857EB001B5E35"
|
||||
BuildableName = "bsxmac"
|
||||
BlueprintName = "bsxmac"
|
||||
ReferencedContainer = "container:bsxmac.xcodeproj">
|
||||
</BuildableReference>
|
||||
</MacroExpansion>
|
||||
</ProfileAction>
|
||||
<AnalyzeAction
|
||||
buildConfiguration = "Debug">
|
||||
</AnalyzeAction>
|
||||
<ArchiveAction
|
||||
buildConfiguration = "Release"
|
||||
revealArchiveInOrganizer = "YES">
|
||||
</ArchiveAction>
|
||||
</Scheme>
|
||||
|
|
@ -0,0 +1,9 @@
|
|||
#ifndef LIB65816_CONFIG_H
|
||||
#define LIB65816_CONFIG_H
|
||||
/* DO NOT MODIFY THIS FILE; THIS FILE IS AUTOMATICALLY GENERATED. */
|
||||
|
||||
#define SIZEOF_LONG 8
|
||||
#define SIZEOF_INT 4
|
||||
#define SIZEOF_SHORT 2
|
||||
#define DEBUG 1
|
||||
#endif
|
||||
|
|
@ -0,0 +1,92 @@
|
|||
/*
|
||||
* lib65816/cpu.c Release 1p1
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Code originally from XGS: Apple IIGS Emulator (cpu.c)
|
||||
*
|
||||
* Originally written and Copyright (C)1996 by Joshua M. Thompson
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
*
|
||||
* Modified for greater portability and virtual hardware independence.
|
||||
*/
|
||||
|
||||
#include "config.h"
|
||||
#include "cpu.h"
|
||||
|
||||
int cpu_reset;
|
||||
int cpu_abort;
|
||||
int cpu_nmi;
|
||||
word32 cpu_irq;
|
||||
int cpu_stop;
|
||||
int cpu_wait;
|
||||
int cpu_trace;
|
||||
int cpu_irne64;
|
||||
int cpu_irqt5;
|
||||
|
||||
word32 cpu_update_period;
|
||||
#if defined( __sparc__ ) && defined( __GNUC__ )
|
||||
register word32 cpu_cycle_count asm ("g5");
|
||||
#else
|
||||
word32 cpu_cycle_count;
|
||||
#endif
|
||||
|
||||
void CPU_setUpdatePeriod(word32 period)
|
||||
{
|
||||
cpu_update_period = period;
|
||||
}
|
||||
|
||||
void CPU_setTrace(int mode)
|
||||
{
|
||||
cpu_trace = mode;
|
||||
}
|
||||
|
||||
void CPU_reset(void)
|
||||
{
|
||||
cpu_reset = 1;
|
||||
}
|
||||
|
||||
void CPU_abort(void)
|
||||
{
|
||||
cpu_abort = 1;
|
||||
}
|
||||
|
||||
void CPU_nmi(void)
|
||||
{
|
||||
cpu_nmi = 1;
|
||||
}
|
||||
|
||||
void CPU_addIRQ( word32 m )
|
||||
{
|
||||
cpu_irq |= m;
|
||||
}
|
||||
|
||||
void CPU_clearIRQ( word32 m )
|
||||
{
|
||||
cpu_irq &= ~m;
|
||||
}
|
||||
|
||||
void CPU_setRunAddress(word32 address)
|
||||
{
|
||||
PC.W.PC = address & 0xffff;
|
||||
PC.B.PB = (address >> 16) & 0xff;
|
||||
}
|
||||
|
||||
void CPU_addIrne64( word32 m )
|
||||
{
|
||||
cpu_irne64 |= m;
|
||||
}
|
||||
|
||||
void CPU_clearIrne64( word32 m )
|
||||
{
|
||||
cpu_irne64 &= ~m;
|
||||
}
|
||||
|
||||
void CPU_addIrqt5( word32 m )
|
||||
{
|
||||
cpu_irqt5 |= m;
|
||||
}
|
||||
|
||||
void CPU_clearIrqt5( word32 m)
|
||||
{
|
||||
cpu_irqt5 &= ~m;
|
||||
}
|
||||
|
|
@ -0,0 +1,230 @@
|
|||
#ifndef LIB65816_CPU_H
|
||||
#define LIB65816_CPU_H
|
||||
|
||||
/*
|
||||
* lib65816/cpu.h Release 1p1
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Code originally from XGS: Apple IIGS Emulator (gscpu.h)
|
||||
*
|
||||
* Originally written and Copyright (C)1996 by Joshua M. Thompson
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
*
|
||||
* Modified for greater portability and virtual hardware independence.
|
||||
*/
|
||||
|
||||
#include "config.h"
|
||||
|
||||
|
||||
/* Type definitions for convenience. These are not intended to be used
|
||||
* outside the scope of lib65816, since it might conflict with other
|
||||
* libraries type definitions.
|
||||
*/
|
||||
|
||||
typedef unsigned char byte;
|
||||
typedef signed char sbyte;
|
||||
|
||||
#if SIZEOF_LONG == 4
|
||||
typedef unsigned long word32;
|
||||
typedef signed long sword32;
|
||||
#elif SIZEOF_INT == 4
|
||||
typedef unsigned int word32;
|
||||
typedef signed int sword32;
|
||||
#endif
|
||||
|
||||
#if SIZEOF_SHORT == 2
|
||||
typedef unsigned short word16;
|
||||
typedef signed short sword16;
|
||||
#elif SIZEOF_INT == 2
|
||||
typedef unsigned int word16;
|
||||
typedef signed int sword16;
|
||||
#endif
|
||||
|
||||
typedef signed char offset_s; /* short offset */
|
||||
typedef signed short offset_l; /* long offset */
|
||||
|
||||
|
||||
|
||||
/*
|
||||
* Union definition of a 16-bit value that can also be
|
||||
* accessed as its component 8-bit values. Useful for
|
||||
* registers, which change sized based on teh settings
|
||||
* the M and X program status register bits.
|
||||
*/
|
||||
|
||||
typedef union {
|
||||
#ifdef WORDS_BIGENDIAN
|
||||
struct { byte H,L; } B;
|
||||
#else
|
||||
struct { byte L,H; } B;
|
||||
#endif
|
||||
word16 W;
|
||||
} dualw;
|
||||
|
||||
/* Same as above but for addresses. */
|
||||
|
||||
typedef union {
|
||||
#ifdef WORDS_BIGENDIAN
|
||||
struct { byte Z,B,H,L; } B;
|
||||
struct { word16 H,L; } W;
|
||||
#else
|
||||
struct { byte L,H,B,Z; } B;
|
||||
struct { word16 L,H; } W;
|
||||
#endif
|
||||
word32 A;
|
||||
} duala;
|
||||
|
||||
|
||||
|
||||
/* Definitions of the 65816 registers, in case you want
|
||||
* to access these from your own routines (such as from
|
||||
* a WDM opcode handler routine.
|
||||
*
|
||||
* ATTENTION: DO NOT DEPEND ON THESE -- THESE WILL EVENTUALLY BE REPLACED
|
||||
* WITH A STRUCTURE THAT MAINTAINS ALL CPU STATE.
|
||||
*/
|
||||
|
||||
extern dualw A; /* Accumulator */
|
||||
extern dualw D; /* Direct Page Register */
|
||||
extern byte P; /* Processor Status Register */
|
||||
extern int E; /* Emulation Mode Flag */
|
||||
extern dualw S; /* Stack Pointer */
|
||||
extern dualw X; /* X Index Register */
|
||||
extern dualw Y; /* Y Index Register */
|
||||
extern byte DB; /* Data Bank Register */
|
||||
|
||||
#ifndef CPU_DISPATCH
|
||||
|
||||
extern union { /* Program Counter */
|
||||
#ifdef WORDS_BIGENDIAN
|
||||
struct { byte Z,PB,H,L; } B;
|
||||
struct { word16 Z,PC; } W;
|
||||
#else
|
||||
struct { byte L,H,PB,Z; } B;
|
||||
struct { word16 PC,Z; } W;
|
||||
#endif
|
||||
word32 A;
|
||||
} PC;
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
|
||||
/* Current cycle count */
|
||||
|
||||
#if defined ( __sparc__ ) && defined ( __GNUC__ )
|
||||
register word32 cpu_cycle_count asm ("g5");
|
||||
#else
|
||||
extern word32 cpu_cycle_count;
|
||||
#endif
|
||||
|
||||
|
||||
|
||||
/* These are the core memory access macros used in the 65816 emulator.
|
||||
* Set these to point to routines which handle your emulated machine's
|
||||
* memory access (generally these routines will check for access to
|
||||
* memory-mapped I/O and things of that nature.)
|
||||
*
|
||||
* The SYNC pin is useful to trap OS calls, whereas the VP pin is
|
||||
* needed to emulate hardware which modifies the vector addresses.
|
||||
*/
|
||||
|
||||
#define EMUL_PIN_SYNC 1 // much more work to provide VPD and VPA
|
||||
#define EMUL_PIN_VP 2
|
||||
#define M_READ(a) MEM_readMem(a, cpu_cycle_count, 0)
|
||||
#define M_READ_OPCODE(a) MEM_readMem(a, cpu_cycle_count, EMUL_PIN_SYNC)
|
||||
#define M_READ_VECTOR(a) MEM_readMem(a, cpu_cycle_count, EMUL_PIN_VP)
|
||||
#define M_WRITE(a,v) MEM_writeMem((a),(v), cpu_cycle_count)
|
||||
|
||||
|
||||
/* Set this macro to your emulator's "update" routine. Your update
|
||||
* routine would probably do things like update hardware sprites,
|
||||
* and check for user keypresses. CPU_run() calls this routine
|
||||
* periodically to make sure the rest of your emulator gets time
|
||||
* to run.
|
||||
*
|
||||
* v is the number of CPU clock cycles that have elapsed since the last
|
||||
* call.
|
||||
*/
|
||||
|
||||
#define E_UPDATE(v) EMUL_hardwareUpdate(v)
|
||||
|
||||
|
||||
|
||||
/* Set this macro to your emulator's routine for handling the WDM
|
||||
* pseudo-opcode. Useful for trapping certain emulated machine
|
||||
* functions and emulating them in fast C code.
|
||||
*
|
||||
* v is the operand byte immediately following the WDM opcode.
|
||||
*/
|
||||
|
||||
#define E_WDM(v) EMUL_handleWDM( (v), cpu_cycle_count )
|
||||
|
||||
|
||||
|
||||
/* Set the 65816 emulator's update period (the number of cycles
|
||||
* elapsed between calls to the E_UPDATE routine.)
|
||||
*/
|
||||
|
||||
void CPU_setUpdatePeriod(word32 period);
|
||||
|
||||
/* Set the 65816 emulator's trace mode to off (0) or on (nonzero) */
|
||||
|
||||
void CPU_setTrace(int mode);
|
||||
|
||||
/* Send a reset to the 65816 emulator. You should do this at */
|
||||
/* startup before you call CPU_run(). */
|
||||
|
||||
void CPU_reset(void);
|
||||
|
||||
/* Send an abort to the 65816 emulator. */
|
||||
|
||||
void CPU_abort(void);
|
||||
|
||||
/* Send a non-maskable interrupt to the 65816 emulator */
|
||||
|
||||
void CPU_nmi(void);
|
||||
|
||||
/* Send a standard (maskable) interrupt to the 65816 emulator. Up to 32
|
||||
* IRQ sources are supported. */
|
||||
|
||||
void CPU_addIRQ( word32 mask );
|
||||
|
||||
/* Clear a previously sent interrupt (if one is still pending) */
|
||||
|
||||
void CPU_clearIRQ( word32 mask );
|
||||
|
||||
/* This routine never returns; it sits in a loop processing opcodes */
|
||||
/* until the emulator exits. Periodic calls to the emulator update */
|
||||
/* macro are made to allow the rest of the emulator to function. */
|
||||
|
||||
void CPU_run(void);
|
||||
|
||||
/* Internal routine called when the mode bits (e/m/x) change */
|
||||
|
||||
void CPU_modeSwitch(void);
|
||||
|
||||
/* Internal routine to print the next instruction in trace mode */
|
||||
|
||||
void CPU_debug(void);
|
||||
|
||||
void CPU_single_step_init(void);
|
||||
void CPU_single_step(void);
|
||||
|
||||
/* These are used by the various macros above, so make sure that we
|
||||
* declare them for type safety purposes! Thanks to fabys for these on
|
||||
* the 6502.org forum.
|
||||
*
|
||||
* Thanks to BigEd on 6502.org for implementing support for memory access
|
||||
* modes -- see EMUL_* macros above, near MEM_READ_*, et. al.
|
||||
*/
|
||||
|
||||
void EMUL_handleWDM(byte opcode, word32 timestamp);
|
||||
void EMUL_hardwareUpdate(word32 timestamp);
|
||||
byte MEM_readMem(word32 address, word32 timestamp, word32 emulFlags);
|
||||
void MEM_writeMem(word32 address, byte b, word32 timestamp);
|
||||
|
||||
void CPU_setRunAddress(word32 address);
|
||||
|
||||
#endif /* _CPU_H */
|
||||
|
||||
|
|
@ -0,0 +1,99 @@
|
|||
/*
|
||||
* lib65816/cpuevent.c Release 1p2
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Copyright 2007 by Samuel A. Falvo II
|
||||
*/
|
||||
|
||||
#include "cpuevent.h"
|
||||
#include <stdio.h>
|
||||
|
||||
struct List
|
||||
{
|
||||
CPUEvent * head;
|
||||
void * null;
|
||||
CPUEvent * tail;
|
||||
};
|
||||
|
||||
static struct List eventList;
|
||||
|
||||
void
|
||||
CPUEvent_initialize( void )
|
||||
{
|
||||
eventList.head = (CPUEvent *)(&eventList.null);
|
||||
eventList.null = 0;
|
||||
eventList.tail = (CPUEvent *)(&eventList);
|
||||
}
|
||||
|
||||
void
|
||||
CPUEvent_elapse( word32 cycles )
|
||||
{
|
||||
eventList.head -> counter -= cycles;
|
||||
if( eventList.head -> counter < 0 )
|
||||
{
|
||||
eventList.head -> counter = 0;
|
||||
CPUEvent_dispatch();
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
CPUEvent_schedule( CPUEvent *thisEvent, word32 when, CPUHandler *proc )
|
||||
{
|
||||
CPUEvent *p, *q;
|
||||
|
||||
thisEvent -> counter = when;
|
||||
thisEvent -> handler = proc;
|
||||
|
||||
p = (CPUEvent *)&eventList;
|
||||
q = p -> next;
|
||||
|
||||
while( ( thisEvent -> counter ) && ( q -> next ) )
|
||||
{
|
||||
/* Newly scheduled event is before 'q', so insert it in front of
|
||||
* q and compensate q's countdown accordingly.
|
||||
*/
|
||||
|
||||
if( thisEvent -> counter < q -> counter )
|
||||
{
|
||||
p -> next = thisEvent; thisEvent -> next = q;
|
||||
q -> previous = thisEvent; thisEvent -> previous = p;
|
||||
|
||||
q -> counter -= thisEvent -> counter;
|
||||
return;
|
||||
}
|
||||
|
||||
/* Otherwise, q occurs before thisEvent, so we compensate thisEvent's counter
|
||||
* as we continue to find the ideal insertion point.
|
||||
*/
|
||||
|
||||
thisEvent -> counter -= q -> counter;
|
||||
if( thisEvent -> counter < 0 ) thisEvent -> counter = 0;
|
||||
p = q;
|
||||
q = q -> next;
|
||||
}
|
||||
|
||||
p -> next = thisEvent; thisEvent -> next = q;
|
||||
q -> previous = thisEvent; thisEvent -> previous = p;
|
||||
}
|
||||
|
||||
void
|
||||
CPUEvent_dispatch( void )
|
||||
{
|
||||
CPUEvent *p, *nextEvent, *thisEvent;
|
||||
|
||||
thisEvent = eventList.head;
|
||||
while( thisEvent -> next )
|
||||
{
|
||||
if( thisEvent -> counter != 0 ) return;
|
||||
|
||||
/* We need to dequeue the node FIRST, because the called
|
||||
* handler may attempt to reschedule the event.
|
||||
*/
|
||||
|
||||
p = thisEvent -> previous; nextEvent = thisEvent -> next;
|
||||
p -> next = nextEvent; nextEvent -> previous = p;
|
||||
|
||||
thisEvent -> handler( 0 ); thisEvent = nextEvent;
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -0,0 +1,28 @@
|
|||
#ifndef LIB65816_CPUEVENT_H
|
||||
#define LIB65816_CPUEVENT_H
|
||||
|
||||
/* CPUtrel 2 Emulator Release 1p2
|
||||
* Copyright (c) 2007 Samuel A. Falvo II
|
||||
* See LICENSE file for more information.
|
||||
*/
|
||||
|
||||
#include "cpu.h"
|
||||
|
||||
typedef struct CPUEvent CPUEvent;
|
||||
typedef void CPUHandler( word32 timestamp );
|
||||
|
||||
struct CPUEvent
|
||||
{
|
||||
CPUEvent * next;
|
||||
CPUEvent * previous;
|
||||
long counter;
|
||||
CPUHandler * handler;
|
||||
};
|
||||
|
||||
void CPUEvent_elapse( word32 delta );
|
||||
void CPUEvent_dispatch( void );
|
||||
void CPUEvent_initialize( void );
|
||||
void CPUEvent_schedule( CPUEvent *, word32, CPUHandler * );
|
||||
|
||||
#endif
|
||||
|
||||
|
|
@ -0,0 +1,435 @@
|
|||
/*
|
||||
* lib65816/cpumacro.h Release 1p1
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Code originally from XGS: Apple IIGS Emulator (cpumacro.h)
|
||||
*
|
||||
* Originally written and Copyright (C)1996 by Joshua M. Thompson
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
*
|
||||
* Modified for greater portability and virtual hardware independence.
|
||||
*/
|
||||
|
||||
/* This file contains the macros which are affected by the E, M, or X */
|
||||
/* bits (as opposed to the macros in micros.h, which aren't affected). */
|
||||
|
||||
/* First some #undef's to prevent a lot of annoying compiler warnings. */
|
||||
|
||||
#undef C_LDA
|
||||
#undef C_LDX
|
||||
#undef C_LDY
|
||||
#undef C_STA
|
||||
#undef C_STX
|
||||
#undef C_STY
|
||||
#undef C_STZ
|
||||
#undef C_INC
|
||||
#undef C_DEC
|
||||
#undef C_ASL
|
||||
#undef C_LSR
|
||||
#undef C_ROL
|
||||
#undef C_ROR
|
||||
#undef C_TSB
|
||||
#undef C_TRB
|
||||
#undef C_AND
|
||||
#undef C_ORA
|
||||
#undef C_EOR
|
||||
#undef C_BIT
|
||||
#undef C_ADC
|
||||
#undef C_SBC
|
||||
#undef C_CMP
|
||||
#undef C_CPX
|
||||
#undef C_CPY
|
||||
#undef S_PUSH
|
||||
#undef S_PULL
|
||||
#undef O_i8
|
||||
#undef O_i16
|
||||
#undef O_a
|
||||
#undef O_al
|
||||
#undef O_d
|
||||
#undef O_dix
|
||||
#undef O_dixl
|
||||
#undef O_dxi
|
||||
#undef O_dxx
|
||||
#undef O_dxy
|
||||
#undef O_axx
|
||||
#undef O_axy
|
||||
#undef O_alxx
|
||||
#undef O_pcr
|
||||
#undef O_pcrl
|
||||
#undef O_ai
|
||||
#undef O_ail
|
||||
#undef O_di
|
||||
#undef O_dil
|
||||
#undef O_axi
|
||||
#undef O_sr
|
||||
#undef O_srix
|
||||
|
||||
/*------- Routines that operate on a memory address -------*/
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_LDA(a) otmp.B.L = M_READ(a.A); \
|
||||
C_LDA8(otmp.B.L)
|
||||
#else
|
||||
#define C_LDA(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_LDA16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_LDX(a) otmp.B.L = M_READ(a.A); \
|
||||
C_LDX8(otmp.B.L)
|
||||
#else
|
||||
#define C_LDX(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_LDX16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_LDY(a) otmp.B.L = M_READ(a.A); \
|
||||
C_LDY8(otmp.B.L)
|
||||
#else
|
||||
#define C_LDY(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_LDY16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_STA(a) M_WRITE(a.A,A.B.L)
|
||||
#else
|
||||
#define C_STA(a) M_WRITE(a.A,A.B.L); \
|
||||
M_WRITE(a.A+1,A.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_STX(a) M_WRITE(a.A,X.B.L)
|
||||
#else
|
||||
#define C_STX(a) M_WRITE(a.A,X.B.L); \
|
||||
M_WRITE(a.A+1,X.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_STY(a) M_WRITE(a.A,Y.B.L)
|
||||
#else
|
||||
#define C_STY(a) M_WRITE(a.A,Y.B.L); \
|
||||
M_WRITE(a.A+1,Y.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_STZ(a) M_WRITE(a.A,0)
|
||||
#else
|
||||
#define C_STZ(a) M_WRITE(a.A,0); \
|
||||
M_WRITE(a.A+1,0)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_INC(a) otmp.B.L = M_READ(a.A); \
|
||||
C_INC8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_INC(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_INC16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_DEC(a) otmp.B.L = M_READ(a.A); \
|
||||
C_DEC8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_DEC(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_DEC16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_ASL(a) otmp.B.L = M_READ(a.A); \
|
||||
C_ASL8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_ASL(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_ASL16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_LSR(a) otmp.B.L = M_READ(a.A); \
|
||||
C_LSR8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_LSR(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_LSR16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_ROL(a) otmp.B.L = M_READ(a.A); \
|
||||
C_ROL8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_ROL(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_ROL16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_ROR(a) otmp.B.L = M_READ(a.A); \
|
||||
C_ROR8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_ROR(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_ROR16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_TSB(a) otmp.B.L = M_READ(a.A); \
|
||||
C_TSB8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_TSB(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_TSB16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_TRB(a) otmp.B.L = M_READ(a.A); \
|
||||
C_TRB8(otmp.B.L); \
|
||||
M_WRITE(a.A,otmp.B.L)
|
||||
#else
|
||||
#define C_TRB(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_TRB16(otmp.W); \
|
||||
M_WRITE(a.A,otmp.B.L); \
|
||||
M_WRITE(a.A+1,otmp.B.H)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_AND(a) otmp.B.L = M_READ(a.A); \
|
||||
C_AND8(otmp.B.L)
|
||||
#else
|
||||
#define C_AND(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_AND16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_ORA(a) otmp.B.L = M_READ(a.A); \
|
||||
C_ORA8(otmp.B.L)
|
||||
#else
|
||||
#define C_ORA(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_ORA16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_EOR(a) otmp.B.L = M_READ(a.A); \
|
||||
C_EOR8(otmp.B.L)
|
||||
#else
|
||||
#define C_EOR(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_EOR16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_BIT(a) otmp.B.L = M_READ(a.A); \
|
||||
C_BIT8(otmp.B.L)
|
||||
#else
|
||||
#define C_BIT(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_BIT16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_ADC(a) otmp.B.L = M_READ(a.A); \
|
||||
C_ADC8(otmp.B.L)
|
||||
#else
|
||||
#define C_ADC(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_ADC16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_SBC(a) otmp.B.L = M_READ(a.A); \
|
||||
C_SBC8(otmp.B.L)
|
||||
#else
|
||||
#define C_SBC(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_SBC16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_M
|
||||
#define C_CMP(a) otmp.B.L = M_READ(a.A); \
|
||||
C_CMP8(otmp.B.L)
|
||||
#else
|
||||
#define C_CMP(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_CMP16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_CPX(a) otmp.B.L = M_READ(a.A); \
|
||||
C_CPX8(otmp.B.L)
|
||||
#else
|
||||
#define C_CPX(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_CPX16(otmp.W)
|
||||
#endif
|
||||
|
||||
#ifdef SHORT_X
|
||||
#define C_CPY(a) otmp.B.L = M_READ(a.A); \
|
||||
C_CPY8(otmp.B.L)
|
||||
#else
|
||||
#define C_CPY(a) otmp.B.L = M_READ(a.A); \
|
||||
otmp.B.H = M_READ(a.A+1); \
|
||||
C_CPY16(otmp.W)
|
||||
#endif
|
||||
|
||||
/* Macros for pushing or pulling bytes on the 65816 stack */
|
||||
|
||||
#ifdef NATIVE_MODE
|
||||
#define S_PUSH(v) M_WRITE(S.W,v); S.W--
|
||||
#define S_PULL(v) ++S.W; v = M_READ(S.W)
|
||||
#else
|
||||
#define S_PUSH(v) M_WRITE(S.W,v); S.B.L--
|
||||
#define S_PULL(v) S.B.L++; v = M_READ(S.W)
|
||||
#endif
|
||||
|
||||
/* Macros to retrieve an 8 or 16-bit operand. They take as their parameter */
|
||||
/* a "dualw" union variable, which they set to the operand. */
|
||||
|
||||
#define O_i8(v) v.B.L = M_READ(PC.A); v.B.H = 0; PC.W.PC++
|
||||
|
||||
#define O_i16(v) v.B.L = M_READ(PC.A); v.B.H = M_READ(PC.A+1); PC.W.PC += 2
|
||||
|
||||
/* Macros to retrieve the operand address. These take as their parameter */
|
||||
/* a "duala" union variable, which they set to the operand address. */
|
||||
|
||||
#define O_a(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; PC.W.PC += 2;
|
||||
|
||||
#define O_al(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = M_READ(PC.A+2); PC.W.PC += 3
|
||||
|
||||
#define O_d(a) if (D.B.L) cpu_cycle_count++; \
|
||||
a.A = D.W + M_READ(PC.A); a.B.B = 0; PC.W.PC++
|
||||
|
||||
#ifdef SHORT_X
|
||||
|
||||
#define O_dix(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = D.W + M_READ(PC.A); atmp.B.B = 0; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = DB; \
|
||||
atmp.A = a.A; \
|
||||
a.A += Y.W; \
|
||||
if (atmp.B.H != a.B.H) cpu_cycle_count++;
|
||||
|
||||
#else
|
||||
|
||||
#define O_dix(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = D.W + M_READ(PC.A); atmp.B.B = 0; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = DB; \
|
||||
a.A += Y.W;
|
||||
|
||||
#endif
|
||||
|
||||
#define O_dixl(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = D.W + M_READ(PC.A); atmp.B.B = 0; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = M_READ(atmp.A+2); \
|
||||
a.A += Y.W
|
||||
|
||||
#define O_dxi(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = D.W + M_READ(PC.A) + X.W; atmp.B.B = 0; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = DB
|
||||
|
||||
#ifdef NATIVE_MODE
|
||||
|
||||
#define O_dxx(a) if (D.B.L) cpu_cycle_count++; \
|
||||
a.W.L = (M_READ(PC.A) + D.W + X.W); a.B.B = 0; PC.W.PC++
|
||||
|
||||
#define O_dxy(a) if (D.B.L) cpu_cycle_count++; \
|
||||
a.W.L = (M_READ(PC.A) + D.W + Y.W); a.B.B = 0; PC.W.PC++
|
||||
|
||||
#ifdef SHORT_X
|
||||
|
||||
#define O_axx(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
atmp.A = a.A; a.A += X.W; \
|
||||
if (atmp.B.H != a.B.H) cpu_cycle_count++; \
|
||||
PC.W.PC+=2
|
||||
|
||||
#define O_axy(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
atmp.A = a.A; a.A += Y.W; \
|
||||
if (atmp.B.H != a.B.H) cpu_cycle_count++; \
|
||||
PC.W.PC+=2
|
||||
#else
|
||||
|
||||
#define O_axx(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
a.A += X.W; \
|
||||
PC.W.PC+=2
|
||||
|
||||
#define O_axy(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
a.A += Y.W; \
|
||||
PC.W.PC+=2
|
||||
#endif
|
||||
|
||||
#else
|
||||
|
||||
#define O_dxx(a) if (D.B.L) cpu_cycle_count++; \
|
||||
a.W.L = (M_READ(PC.A) + D.W + X.W); a.B.H = 0; a.B.B = 0; PC.W.PC++;
|
||||
|
||||
#define O_dxy(a) if (D.B.L) cpu_cycle_count++; \
|
||||
a.W.L = (M_READ(PC.A) + D.W + Y.W); a.B.H = 0; a.B.B = 0; PC.W.PC++;
|
||||
|
||||
#define O_axx(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
atmp.A = a.A; a.W.L += X.W; \
|
||||
if (atmp.B.H != a.B.H) cpu_cycle_count++; \
|
||||
PC.W.PC+=2
|
||||
|
||||
#define O_axy(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = DB; \
|
||||
atmp.A = a.A; a.W.L += Y.W; \
|
||||
if (atmp.B.H != a.B.H) cpu_cycle_count++; \
|
||||
PC.W.PC+=2
|
||||
|
||||
#endif
|
||||
|
||||
#define O_alxx(a) a.B.L = M_READ(PC.A); a.B.H = M_READ(PC.A+1); a.B.B = M_READ(PC.A+2); a.A += X.W; \
|
||||
PC.W.PC += 3;
|
||||
|
||||
#define O_pcr(a) wtmp.B.L = M_READ(PC.A); PC.W.PC++; \
|
||||
a.W.L = PC.W.PC + (offset_s) wtmp.B.L; a.B.B = PC.B.PB;
|
||||
|
||||
#define O_pcrl(a) wtmp.B.L = M_READ(PC.A); wtmp.B.H = M_READ(PC.A+1); PC.W.PC += 2; \
|
||||
a.W.L = PC.W.PC + (offset_l) wtmp.W; a.B.B = PC.B.PB;
|
||||
|
||||
#define O_ai(a) atmp.B.L = M_READ(PC.A); atmp.B.H = M_READ(PC.A+1); atmp.B.B = 0; PC.W.PC += 2; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = 0;
|
||||
|
||||
#define O_ail(a) atmp.B.L = M_READ(PC.A); atmp.B.H = M_READ(PC.A+1); atmp.B.B = 0; PC.W.PC += 2; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = M_READ(atmp.A+2)
|
||||
|
||||
#define O_di(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = M_READ(PC.A) + D.W; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = DB
|
||||
|
||||
#define O_dil(a) if (D.B.L) cpu_cycle_count++; \
|
||||
atmp.A = M_READ(PC.A) + D.W; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = M_READ(atmp.A+2)
|
||||
|
||||
#define O_axi(a) atmp.B.L = M_READ(PC.A); atmp.B.H = M_READ(PC.A+1); \
|
||||
atmp.A += X.W; atmp.B.B = PC.B.PB; \
|
||||
PC.W.PC += 2; a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = PC.B.PB
|
||||
|
||||
#define O_sr(a) a.W.L = M_READ(PC.A) + S.W; a.B.B = 0; PC.W.PC++
|
||||
|
||||
#define O_srix(a) atmp.W.L = M_READ(PC.A) + S.W; atmp.B.B = 0; PC.W.PC++; \
|
||||
a.B.L = M_READ(atmp.A); a.B.H = M_READ(atmp.A+1); a.B.B = DB; a.A += Y.W
|
||||
|
|
@ -0,0 +1,305 @@
|
|||
/*
|
||||
* lib65816/cpumicro.h Release 1p1
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Code originally from XGS: Apple IIGS Emulator (cpumicro.h)
|
||||
*
|
||||
* Originally written and Copyright (C)1996 by Joshua M. Thompson
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
*
|
||||
* Modified for greater portability and virtual hardware independence.
|
||||
*/
|
||||
|
||||
/* This file defines "micro operation" macros; that is, very low-level */
|
||||
/* operations that are independent of the state of the E, M, or X bits. */
|
||||
|
||||
/* Macros for setting/clearing program status register bits */
|
||||
|
||||
#define F_setN(v) if (v) P |= 0x80; else P &= ~0x80
|
||||
#define F_setV(v) if (v) P |= 0x40; else P &= ~0x40
|
||||
#define F_setM(v) if (v) P |= 0x20; else P &= ~0x20
|
||||
#define F_setX(v) if (v) P |= 0x10; else P &= ~0x10
|
||||
#define F_setB(v) if (v) P |= 0x10; else P &= ~0x10
|
||||
#define F_setD(v) if (v) P |= 0x08; else P &= ~0x08
|
||||
#define F_setI(v) if (v) P |= 0x04; else P &= ~0x04
|
||||
#define F_setZ(v) if (v) P |= 0x02; else P &= ~0x02
|
||||
#define F_setC(v) if (v) P |= 0x01; else P &= ~0x01
|
||||
|
||||
/* Macros for testing program status register bits */
|
||||
|
||||
#define F_getN ((P & 0x80)? 1:0)
|
||||
#define F_getV ((P & 0x40)? 1:0)
|
||||
#define F_getM ((P & 0x20)? 1:0)
|
||||
#define F_getX ((P & 0x10)? 1:0)
|
||||
#define F_getD ((P & 0x08)? 1:0)
|
||||
#define F_getI ((P & 0x04)? 1:0)
|
||||
#define F_getZ ((P & 0x02)? 1:0)
|
||||
#define F_getC ((P & 0x01)? 1:0)
|
||||
|
||||
/*------- Routines that operate on an 8/16-bit value -------*/
|
||||
|
||||
#define C_SETF8(v) F_setN(v & 0x80); \
|
||||
F_setZ(!v)
|
||||
|
||||
#define C_SETF16(v) F_setN(v & 0x8000); \
|
||||
F_setZ(!v)
|
||||
|
||||
#define C_LDA8(v) A.B.L = v; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_LDA16(v) A.W = v; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_LDX8(v) X.B.L = v; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_LDX16(v) X.W = v; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_LDY8(v) Y.B.L = v; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_LDY16(v) Y.W = v; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_INC8(v) v++; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_INC16(v) v++; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_DEC8(v) v--; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_DEC16(v) v--; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_ASL8(v) F_setC(v & 0x80); \
|
||||
v = v << 1; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_ASL16(v) F_setC(v & 0x8000); \
|
||||
v = v << 1; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_LSR8(v) F_setC(v & 0x01); \
|
||||
v = v >> 1; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_LSR16(v) F_setC(v & 0x0001); \
|
||||
v = v >> 1; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_ROL8(v) wtmp.B.L = P & 0x01; \
|
||||
F_setC(v & 0x80); \
|
||||
v = (v << 1) | wtmp.B.L; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_ROL16(v) wtmp.W = P & 0x01; \
|
||||
F_setC(v & 0x8000); \
|
||||
v = (v << 1) | wtmp.W; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_ROR8(v) wtmp.B.L = (P & 0x01) << 7; \
|
||||
F_setC(v & 0x01); \
|
||||
v = (v >> 1) | wtmp.B.L; \
|
||||
C_SETF8(v)
|
||||
|
||||
#define C_ROR16(v) wtmp.W = (P & 0x01) << 15; \
|
||||
F_setC(v & 0x0001); \
|
||||
v = (v >> 1) | wtmp.W; \
|
||||
C_SETF16(v)
|
||||
|
||||
#define C_TSB8(v) F_setZ(!(v & A.B.L)); \
|
||||
v |= A.B.L;
|
||||
|
||||
#define C_TSB16(v) F_setZ(!(v & A.W)); \
|
||||
v |= A.W;
|
||||
|
||||
#define C_TRB8(v) F_setZ(!(v & A.B.L)); \
|
||||
v &= ~A.B.L;
|
||||
|
||||
#define C_TRB16(v) F_setZ(!(v & A.W)); \
|
||||
v &= ~A.W;
|
||||
|
||||
#define C_AND8(v) A.B.L &= v; \
|
||||
C_SETF8(A.B.L)
|
||||
|
||||
#define C_AND16(v) A.W &= v; \
|
||||
C_SETF16(A.W)
|
||||
|
||||
#define C_ORA8(v) A.B.L |= v; \
|
||||
C_SETF8(A.B.L)
|
||||
|
||||
#define C_ORA16(v) A.W |= v; \
|
||||
C_SETF16(A.W)
|
||||
|
||||
#define C_EOR8(v) A.B.L ^= v; \
|
||||
C_SETF8(A.B.L)
|
||||
|
||||
#define C_EOR16(v) A.W ^= v; \
|
||||
C_SETF16(A.W)
|
||||
|
||||
#define C_BIT8(v) F_setN(v & 0x80); \
|
||||
F_setV(v & 0x40); \
|
||||
F_setZ(!(v & A.B.L)); \
|
||||
|
||||
#define C_BIT16(v) F_setN(v & 0x8000); \
|
||||
F_setV(v & 0x4000); \
|
||||
F_setZ(!(v & A.W)); \
|
||||
|
||||
#define C_ADC8(v) if (F_getD) { \
|
||||
a1 = A.B.L & 0x0F; \
|
||||
a2 = (A.B.L >> 4) & 0x0F; \
|
||||
o1 = v & 0x0F; \
|
||||
o2 = (v >> 4) & 0x0F; \
|
||||
a1 += (o1 + F_getC); \
|
||||
a2 += o2; \
|
||||
if (a1>9) { \
|
||||
a1 -= 10; \
|
||||
a2++; \
|
||||
} \
|
||||
if (a2>9) { \
|
||||
a2 -= 10; \
|
||||
F_setC(1); \
|
||||
} else { \
|
||||
F_setC(0); \
|
||||
} \
|
||||
wtmp.W = (a2 << 4) | a1; \
|
||||
} else { \
|
||||
wtmp.W = A.B.L + v + F_getC; \
|
||||
F_setC(wtmp.B.H); \
|
||||
} \
|
||||
F_setV(~(A.B.L ^ v) & (A.B.L ^ wtmp.B.L) & 0x80); \
|
||||
A.B.L = wtmp.B.L; \
|
||||
C_SETF8(A.B.L);
|
||||
|
||||
#define C_ADC16(v) if (F_getD) { \
|
||||
a1 = A.W & 0x0F; \
|
||||
a2 = (A.W >> 4) & 0x0F; \
|
||||
a3 = (A.W >> 8) & 0x0F; \
|
||||
a4 = (A.W >> 12) & 0x0F; \
|
||||
o1 = v & 0x0F; \
|
||||
o2 = (v >> 4) & 0x0F; \
|
||||
o3 = (v >> 8) & 0x0F; \
|
||||
o4 = (v >> 12) & 0x0F; \
|
||||
a1 += (o1 + F_getC); \
|
||||
a2 += o2; \
|
||||
a3 += o3; \
|
||||
a4 += o4; \
|
||||
if (a1>9) { \
|
||||
a1 -= 10; \
|
||||
a2++; \
|
||||
} \
|
||||
if (a2>9) { \
|
||||
a2 -= 10; \
|
||||
a3++; \
|
||||
} \
|
||||
if (a3>9) { \
|
||||
a3 -= 10; \
|
||||
a4++; \
|
||||
} \
|
||||
if (a4>9) { \
|
||||
a4 -= 10; \
|
||||
F_setC(1); \
|
||||
} else { \
|
||||
F_setC(0); \
|
||||
} \
|
||||
atmp.A = (a4 << 12) | (a3 << 8) | (a2 << 4) | a1; \
|
||||
} else { \
|
||||
atmp.A = A.W + v + F_getC; \
|
||||
F_setC(atmp.W.H); \
|
||||
} \
|
||||
F_setV(~(A.W ^ v) & (A.W ^ atmp.W.L) & 0x8000); \
|
||||
A.W = atmp.W.L; \
|
||||
C_SETF16(A.W);
|
||||
|
||||
#define C_SBC8(v) if (F_getD) { \
|
||||
a1 = A.B.L & 0x0F; \
|
||||
a2 = (A.B.L >> 4) & 0x0F; \
|
||||
o1 = v & 0x0F; \
|
||||
o2 = (v >> 4) & 0x0F; \
|
||||
a1 -= (o1 + !F_getC); \
|
||||
a2 -= o2; \
|
||||
if (a1<0) { \
|
||||
a1 += 10; \
|
||||
a2--; \
|
||||
} \
|
||||
if (a2<0) { \
|
||||
a2 += 10; \
|
||||
F_setC(0); \
|
||||
} else { \
|
||||
F_setC(1); \
|
||||
} \
|
||||
wtmp.W = (a2 << 4) | a1; \
|
||||
} else { \
|
||||
wtmp.W = (A.B.L - v) - !F_getC; \
|
||||
F_setC(!wtmp.B.H); \
|
||||
} \
|
||||
F_setV((A.B.L ^ v) & (A.B.L ^ wtmp.B.L) & 0x80); \
|
||||
A.B.L = wtmp.B.L; \
|
||||
C_SETF8(A.B.L);
|
||||
|
||||
#define C_SBC16(v) if (F_getD) { \
|
||||
a1 = A.W & 0x0F; \
|
||||
a2 = (A.W >> 4) & 0x0F; \
|
||||
a3 = (A.W >> 8) & 0x0F; \
|
||||
a4 = (A.W >> 12) & 0x0F; \
|
||||
o1 = v & 0x0F; \
|
||||
o2 = (v >> 4) & 0x0F; \
|
||||
o3 = (v >> 8) & 0x0F; \
|
||||
o4 = (v >> 12) & 0x0F; \
|
||||
a1 -= (o1 + !F_getC); \
|
||||
a2 -= o2; \
|
||||
a3 -= o3; \
|
||||
a4 -= o4; \
|
||||
if (a1<0) { \
|
||||
a1 += 10; \
|
||||
a2--; \
|
||||
} \
|
||||
if (a2<0) { \
|
||||
a2 += 10; \
|
||||
a3--; \
|
||||
} \
|
||||
if (a3<0) { \
|
||||
a3 += 10; \
|
||||
a4--; \
|
||||
} \
|
||||
if (a4<0) { \
|
||||
a4 += 10; \
|
||||
F_setC(0); \
|
||||
} else { \
|
||||
F_setC(1); \
|
||||
} \
|
||||
atmp.A = (a4 << 12) | (a3 << 8) | (a2 << 4) | a1; \
|
||||
} else { \
|
||||
atmp.A = (A.W - v) - !F_getC; \
|
||||
F_setC(!atmp.W.H); \
|
||||
} \
|
||||
A.W = atmp.W.L; \
|
||||
F_setV((A.W ^ v) & (A.W ^ atmp.W.L) & 0x8000); \
|
||||
C_SETF16(A.W);
|
||||
|
||||
#define C_CMP8(v) wtmp.W = A.B.L - v; \
|
||||
F_setC(!wtmp.B.H); \
|
||||
C_SETF8(wtmp.B.L)
|
||||
|
||||
#define C_CMP16(v) atmp.A = A.W - v; \
|
||||
F_setC(!atmp.W.H); \
|
||||
C_SETF16(atmp.W.L)
|
||||
|
||||
#define C_CPX8(v) wtmp.W = X.B.L - v; \
|
||||
F_setC(!wtmp.B.H); \
|
||||
C_SETF8(wtmp.B.L)
|
||||
|
||||
#define C_CPX16(v) atmp.A = X.W - v; \
|
||||
F_setC(!atmp.W.H); \
|
||||
C_SETF16(atmp.W.L)
|
||||
|
||||
#define C_CPY8(v) wtmp.W = Y.B.L - v; \
|
||||
F_setC(!wtmp.B.H); \
|
||||
C_SETF8(wtmp.B.L)
|
||||
|
||||
#define C_CPY16(v) atmp.A = Y.W - v; \
|
||||
F_setC(!atmp.W.H); \
|
||||
C_SETF16(atmp.W.L)
|
||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,320 @@
|
|||
/*
|
||||
* lib65816/debugger.c Release 1p1
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* 2007 Jan 5 saf2
|
||||
* Complete rewrite as the old "debugger" (really a tracer) was just rife
|
||||
* with bugs and utterly lacking in suitable features.
|
||||
*/
|
||||
|
||||
#include "config.h"
|
||||
|
||||
#ifdef DEBUG
|
||||
|
||||
#include "cpu.h"
|
||||
#include <stdio.h>
|
||||
|
||||
#include "cpumicro.h"
|
||||
|
||||
/* 65816 debugger module */
|
||||
|
||||
char *mnemonics[256] = {
|
||||
"BRK", "ORA", "COP", "ORA", "TSB", "ORA", "ASL", "ORA",
|
||||
"PHP", "ORA", "ASL", "PHD", "TSB", "ORA", "ASL", "ORA",
|
||||
"BPL", "ORA", "ORA", "ORA", "TRB", "ORA", "ASL", "ORA",
|
||||
"CLC", "ORA", "INC", "TCS", "TRB", "ORA", "ASL", "ORA",
|
||||
"JSR", "AND", "JSL", "AND", "BIT", "AND", "ROL", "AND",
|
||||
"PLP", "AND", "ROL", "PLD", "BIT", "AND", "ROL", "AND",
|
||||
"BMI", "AND", "AND", "AND", "BIT", "AND", "ROL", "AND",
|
||||
"SEC", "AND", "DEC", "TSC", "BIT", "AND", "ROL", "AND",
|
||||
"RTI", "EOR", "WDM", "EOR", "MVP", "EOR", "LSR", "EOR",
|
||||
"PHA", "EOR", "LSR", "PHK", "JMP", "EOR", "LSR", "EOR",
|
||||
"BVC", "EOR", "EOR", "EOR", "MVN", "EOR", "LSR", "EOR",
|
||||
"CLI", "EOR", "PHY", "TCD", "JMP", "EOR", "LSR", "EOR",
|
||||
"RTS", "ADC", "PER", "ADC", "STZ", "ADC", "ROR", "ADC",
|
||||
"PLA", "ADC", "ROR", "RTL", "JMP", "ADC", "ROR", "ADC",
|
||||
"BVS", "ADC", "ADC", "ADC", "STZ", "ADC", "ROR", "ADC",
|
||||
"SEI", "ADC", "PLY", "TDC", "JMP", "ADC", "ROR", "ADC",
|
||||
"BRA", "STA", "BRL", "STA", "STY", "STA", "STX", "STA",
|
||||
"DEY", "BIT", "TXA", "PHB", "STY", "STA", "STX", "STA",
|
||||
"BCC", "STA", "STA", "STA", "STY", "STA", "STX", "STA",
|
||||
"TYA", "STA", "TXS", "TXY", "STZ", "STA", "STZ", "STA",
|
||||
"LDY", "LDA", "LDX", "LDA", "LDY", "LDA", "LDX", "LDA",
|
||||
"TAY", "LDA", "TAX", "PLB", "LDY", "LDA", "LDX", "LDA",
|
||||
"BCS", "LDA", "LDA", "LDA", "LDY", "LDA", "LDX", "LDA",
|
||||
"CLV", "LDA", "TSX", "TYX", "LDY", "LDA", "LDX", "LDA",
|
||||
"CPY", "CMP", "REP", "CMP", "CPY", "CMP", "DEC", "CMP",
|
||||
"INY", "CMP", "DEX", "WAI", "CPY", "CMP", "DEC", "CMP",
|
||||
"BNE", "CMP", "CMP", "CMP", "PEI", "CMP", "DEC", "CMP",
|
||||
"CLD", "CMP", "PHX", "STP", "JML", "CMP", "DEC", "CMP",
|
||||
"CPX", "SBC", "SEP", "SBC", "CPX", "SBC", "INC", "SBC",
|
||||
"INX", "SBC", "NOP", "XBA", "CPX", "SBC", "INC", "SBC",
|
||||
"BEQ", "SBC", "SBC", "SBC", "PEA", "SBC", "INC", "SBC",
|
||||
"SED", "SBC", "PLX", "XCE", "JSR", "SBC", "INC", "SBC"
|
||||
};
|
||||
|
||||
enum modes {
|
||||
IMM8,
|
||||
IMM,
|
||||
IMMX,
|
||||
ACC,
|
||||
PCR,
|
||||
PCRL,
|
||||
IMPL,
|
||||
DP,
|
||||
DPX,
|
||||
DPY,
|
||||
DPI,
|
||||
DPIX,
|
||||
DPIY,
|
||||
DPIL,
|
||||
DPILY,
|
||||
ABS,
|
||||
ABSX,
|
||||
ABSY,
|
||||
ABSL,
|
||||
ABSLX,
|
||||
STK,
|
||||
STKIY,
|
||||
ABSI,
|
||||
ABSIX,
|
||||
BLK
|
||||
};
|
||||
|
||||
int addrmodes[256] = {
|
||||
IMM8, DPIX, IMM8, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, ACC, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DP, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, ACC, IMPL, ABS, ABSX, ABSX, ABSLX,
|
||||
ABS, DPIX, ABSL, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, ACC, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DPX, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, ACC, IMPL, ABSX, ABSX, ABSX, ABSLX,
|
||||
|
||||
IMPL, DPIX, IMM8, STK, BLK, DP, DP, DPIL,
|
||||
IMPL, IMM, ACC, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, BLK, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABSL, ABSX, ABSX, ABSX,
|
||||
IMPL, DPIX, IMPL, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, ACC, IMPL, ABSI, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DPX, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABSIX, ABSX, ABSX, ABSLX,
|
||||
|
||||
|
||||
PCR, DPIX, PCRL, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, IMPL, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DPX, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABS, ABSX, ABSX, ABSLX,
|
||||
IMMX, DPIX, IMMX, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, IMPL, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DPX, DPX, DPY, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABSX, ABSX, ABSY, ABSLX,
|
||||
|
||||
IMMX, DPIX, IMM8, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, IMPL, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, DPI, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABSI, ABSX, ABSX, ABSLX,
|
||||
IMMX, DPIX, IMM8, STK, DP, DP, DP, DPIL,
|
||||
IMPL, IMM, IMPL, IMPL, ABS, ABS, ABS, ABSL,
|
||||
PCR, DPIY, DPI, STKIY, ABS, DPX, DPX, DPILY,
|
||||
IMPL, ABSY, IMPL, IMPL, ABSIX, ABSX, ABSX, ABSLX
|
||||
};
|
||||
|
||||
extern int cpu_irq;
|
||||
|
||||
void CPU_debug(void) {
|
||||
int opcode;
|
||||
int mode;
|
||||
int operand;
|
||||
int ea;
|
||||
char operands[40];
|
||||
|
||||
opcode = M_READ(PC.A);
|
||||
mode = addrmodes[opcode];
|
||||
printf("A=%04X X=%04X Y=%04X S=%04X D=%04X B=%02X P=%02X E=%1d ",
|
||||
(int) A.W, (int) X.W,
|
||||
(int) Y.W, (int) S.W,
|
||||
(int) D.W, (int) DB,
|
||||
(int) P, (int) E);
|
||||
printf("%02X/%04X %s ",(int) PC.B.PB,(int) PC.W.PC,mnemonics[opcode]);
|
||||
switch (mode) {
|
||||
case IMM8:
|
||||
sprintf( operands, "#$%02X", M_READ(PC.A+1) );
|
||||
break;
|
||||
|
||||
case IMM:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
if( F_getM ) sprintf( operands, "#$%02X", (operand & 0xFF));
|
||||
else sprintf( operands, "#$%04X", operand );
|
||||
break;
|
||||
|
||||
case IMMX:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
if( F_getX ) sprintf( operands, "#$%02X", (operand & 0xFF));
|
||||
else sprintf( operands, "#$%04X", operand );
|
||||
break;
|
||||
|
||||
case ACC:
|
||||
sprintf( operands, "A" );
|
||||
break;
|
||||
|
||||
case PCR:
|
||||
operand = M_READ(PC.A+1);
|
||||
sprintf( operands, "$%02X ($%02X%04X)", operand, PC.B.PB, PC.W.PC + operand + 2);
|
||||
break;
|
||||
|
||||
case PCRL:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
sprintf( operands, "$%02X ($%02X%04X)", operand, PC.B.PB, PC.W.PC + operand + 3);
|
||||
break;
|
||||
|
||||
case IMPL:
|
||||
sprintf( operands, "" );
|
||||
break;
|
||||
|
||||
case DP:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = D.W + operand;
|
||||
sprintf( operands, "$%02X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPX:
|
||||
operand = M_READ(PC.A+1);
|
||||
if( F_getX ) ea = D.W + operand + X.B.L;
|
||||
else ea = D.W + operand + X.W;
|
||||
sprintf( operands, "$%02X,X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPY:
|
||||
operand = M_READ(PC.A+1);
|
||||
if( F_getX ) ea = D.W + operand + Y.B.L;
|
||||
else ea = D.W + operand + Y.W;
|
||||
sprintf( operands, "$%02X,Y (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPI:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = D.W + operand;
|
||||
ea = M_READ(ea) | (M_READ(ea+1)<<8) | (DB<<16);
|
||||
sprintf( operands, "($%02X) (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPIX:
|
||||
operand = M_READ(PC.A+1);
|
||||
if( F_getX ) ea = D.W + operand + X.B.L;
|
||||
else ea = D.W + operand + X.W;
|
||||
ea = M_READ(ea) | (M_READ(ea+1)<<8) | (DB<<16);
|
||||
sprintf( operands, "($%02X,X) (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPIY:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = D.W + operand;
|
||||
if( F_getX ) ea = M_READ(ea) | (M_READ(ea+1)<<8) | (DB<<16) + Y.B.L;
|
||||
else ea = M_READ(ea) | (M_READ(ea+1)<<8) | (DB<<16) + Y.W;
|
||||
sprintf( operands, "($%02X),Y (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPIL:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = D.W + operand;
|
||||
ea = M_READ(ea) | (M_READ(ea+1)<<8) | (M_READ(ea+2)<<16);
|
||||
sprintf( operands, "[$%02X] (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case DPILY:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = D.W + operand;
|
||||
if( F_getX ) ea = M_READ(ea) | (M_READ(ea+1)<<8) | (M_READ(ea+2)<<16) + Y.B.L;
|
||||
else ea = M_READ(ea) | (M_READ(ea+1)<<8) | (M_READ(ea+2)<<16) + Y.W;
|
||||
sprintf( operands, "[$%02X],Y (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABS:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
ea = operand + (DB<<16);
|
||||
sprintf( operands, "$%04X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSX:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
if( F_getX ) ea = operand + (DB<<16) + X.B.L;
|
||||
else ea = operand + (DB<<16) + X.W;
|
||||
sprintf( operands, "$%04X,X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSY:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
if( F_getX ) ea = operand + (DB<<16) + Y.B.L;
|
||||
else ea = operand + (DB<<16) + Y.W;
|
||||
sprintf( operands, "$%04X,Y (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSL:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8) | (M_READ(PC.A+3)<<16);
|
||||
ea = operand;
|
||||
sprintf( operands, "$%06X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSLX:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8) | (M_READ(PC.A+3)<<16);
|
||||
if( F_getX ) ea = operand + X.B.L;
|
||||
else ea = operand + X.W;
|
||||
sprintf( operands, "$%06X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSI:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
ea = M_READ(operand) + (M_READ(operand+1)<<8) + (DB<<16);
|
||||
sprintf( operands, "$%04X (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case ABSIX:
|
||||
operand = M_READ(PC.A+1) | (M_READ(PC.A+2)<<8);
|
||||
ea = operand | (PC.B.PB << 16);
|
||||
ea = M_READ(ea) + (M_READ(ea+1)<<8) + (PC.B.PB<<16);
|
||||
sprintf( operands, "($%04X,X) (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case STK:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = operand + S.W;
|
||||
sprintf( operands, "$%02X,S (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case STKIY:
|
||||
operand = M_READ(PC.A+1);
|
||||
ea = operand + S.W;
|
||||
if( F_getX ) ea = M_READ(ea) + (M_READ(ea+1)<<8) + (DB<<16) + Y.B.L;
|
||||
else ea = M_READ(ea) + (M_READ(ea+1)<<8) + (DB<<16) + Y.W;
|
||||
|
||||
sprintf( operands, "$%02X,S (@%06X %02X %02X %02X ...)",
|
||||
operand, ea, M_READ(ea), M_READ(ea+1), M_READ(ea+2) );
|
||||
break;
|
||||
|
||||
case BLK:
|
||||
sprintf( operands, "$%02X, $%02X", M_READ(PC.A+2), M_READ(PC.A+1) );
|
||||
break;
|
||||
}
|
||||
printf( "%s\n", operands );
|
||||
fflush(stdout);
|
||||
}
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,277 @@
|
|||
/*
|
||||
* lib65816/dispatch.c Release 1p1
|
||||
* See LICENSE for more details.
|
||||
*
|
||||
* Code originally from XGS: Apple IIGS Emulator (dispatch.c)
|
||||
*
|
||||
* Originally written and Copyright (C)1996 by Joshua M. Thompson
|
||||
* Copyright (C) 2006 by Samuel A. Falvo II
|
||||
*
|
||||
* Modified for greater portability and virtual hardware independence.
|
||||
*/
|
||||
|
||||
#define CPU_DISPATCH
|
||||
|
||||
#include "cpu.h"
|
||||
#include "cpumicro.h"
|
||||
#include "util.h"
|
||||
|
||||
//#define LIMIT_INSTRUCTION_COUNT 10000
|
||||
|
||||
//void CPUEvent_elapse( word32 cycles );
|
||||
|
||||
int dispatch_quit = 0;
|
||||
|
||||
dualw A; /* Accumulator */
|
||||
dualw D; /* Direct Page Register */
|
||||
byte P; /* Processor Status Register */
|
||||
int E; /* Emulation Mode Flag */
|
||||
dualw S; /* Stack Pointer */
|
||||
dualw X; /* X Index Register */
|
||||
dualw Y; /* Y Index Register */
|
||||
byte DB; /* Data Bank Register */
|
||||
|
||||
union {
|
||||
#ifdef WORDS_BIGENDIAN
|
||||
struct { byte Z,PB,H,L; } B;
|
||||
struct { word16 Z,PC; } W;
|
||||
#else
|
||||
struct { byte L,H,PB,Z; } B;
|
||||
struct { word16 PC,Z; } W;
|
||||
#endif
|
||||
word32 A;
|
||||
} PC;
|
||||
|
||||
duala atmp,opaddr;
|
||||
dualw wtmp,otmp,operand;
|
||||
int a1,a2,a3,a4,o1,o2,o3,o4;
|
||||
|
||||
#ifdef OLDCYCLES
|
||||
byte *cpu_curr_cycle_table;
|
||||
#endif
|
||||
void (**cpu_curr_opcode_table)();
|
||||
|
||||
extern int cpu_reset,cpu_abort,cpu_nmi,cpu_irq,cpu_stop,cpu_wait,cpu_trace;
|
||||
extern int cpu_update_period;
|
||||
|
||||
extern int cpu_irne64,cpu_irqt5;
|
||||
|
||||
extern void (*cpu_opcode_table[1310])();
|
||||
|
||||
#ifdef OLDCYCLES
|
||||
/* Base cycle counts for all possible 1310 opcodes (262 opcodes x 5 modes). */
|
||||
/* The opcode handlers may add additional cycles to handle special cases such */
|
||||
/* a non-page-aligned direct page register or taking a branch. */
|
||||
|
||||
byte cpu_cycle_table[1310] =
|
||||
{
|
||||
8, 6, 8, 4, 5, 3, 5, 6, 3, 2, 2, 4, 6, 4, 6, 5, /* e=0, m=1, x=1 */
|
||||
2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 2, 2, 6, 4, 7, 5,
|
||||
6, 6, 8, 4, 3, 3, 5, 6, 4, 2, 2, 5, 4, 4, 6, 5,
|
||||
2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 2, 2, 4, 4, 7, 5,
|
||||
7, 6, 2, 4, 7, 3, 5, 6, 3, 2, 2, 3, 3, 4, 6, 5,
|
||||
2, 5, 5, 7, 7, 4, 6, 6, 2, 4, 3, 2, 4, 4, 7, 5,
|
||||
6, 6, 6, 4, 3, 3, 5, 6, 4, 2, 2, 6, 5, 4, 6, 5,
|
||||
2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5,
|
||||
2, 6, 3, 4, 3, 3, 3, 6, 2, 2, 2, 3, 4, 4, 4, 5,
|
||||
2, 6, 5, 7, 4, 4, 4, 6, 2, 5, 2, 2, 4, 5, 5, 5,
|
||||
2, 6, 2, 4, 3, 3, 3, 6, 2, 2, 2, 4, 4, 4, 4, 5,
|
||||
2, 5, 5, 7, 4, 4, 4, 6, 2, 4, 2, 2, 4, 4, 4, 5,
|
||||
2, 6, 3, 4, 3, 3, 5, 6, 2, 2, 2, 3, 4, 4, 4, 5,
|
||||
2, 5, 5, 7, 6, 4, 6, 6, 2, 4, 3, 3, 6, 4, 7, 5,
|
||||
2, 6, 3, 4, 3, 3, 5, 6, 2, 2, 2, 3, 4, 4, 6, 5,
|
||||
2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5,
|
||||
0, 0, 0, 0, 0, 0,
|
||||
|
||||
8, 6, 8, 4, 5, 3, 5, 6, 3, 2, 2, 4, 6, 4, 6, 5, /* e=0, m=1, x=0 */
|
||||
2, 6, 5, 7, 5, 4, 6, 6, 2, 5, 2, 2, 6, 5, 7, 5,
|
||||
6, 6, 8, 4, 3, 3, 5, 6, 4, 2, 2, 5, 4, 4, 6, 5,
|
||||
2, 6, 5, 7, 4, 4, 6, 6, 2, 5, 2, 2, 5, 5, 7, 5,
|
||||
7, 6, 2, 4, 0, 3, 5, 6, 4, 2, 2, 3, 3, 4, 6, 5,
|
||||
2, 6, 5, 7, 0, 4, 6, 6, 2, 5, 4, 2, 4, 5, 7, 5,
|
||||
6, 6, 6, 4, 3, 3, 5, 6, 5, 2, 2, 6, 5, 4, 6, 5,
|
||||
2, 6, 5, 7, 4, 4, 6, 6, 2, 5, 5, 2, 6, 5, 7, 5,
|
||||
2, 6, 3, 4, 4, 3, 4, 6, 2, 2, 2, 3, 5, 4, 5, 5,
|
||||
2, 6, 5, 7, 5, 4, 5, 6, 2, 5, 2, 2, 4, 5, 5, 5,
|
||||
3, 6, 3, 4, 4, 3, 4, 6, 2, 2, 2, 4, 5, 4, 5, 5,
|
||||
2, 6, 5, 7, 5, 4, 5, 6, 2, 5, 2, 2, 5, 5, 5, 5,
|
||||
3, 6, 3, 4, 4, 3, 6, 6, 2, 2, 2, 3, 5, 4, 6, 5,
|
||||
2, 6, 5, 7, 6, 4, 8, 6, 2, 5, 4, 3, 6, 5, 7, 5,
|
||||
3, 6, 3, 4, 4, 3, 6, 6, 2, 2, 2, 3, 5, 4, 6, 5,
|
||||
2, 6, 5, 7, 5, 4, 8, 6, 2, 5, 5, 2, 6, 5, 7, 5,
|
||||
0, 0, 0, 0, 0, 0,
|
||||
|
||||
8, 7, 8, 5, 7, 4, 7, 7, 3, 3, 2, 4, 8, 5, 8, 6, /* e=0, m=0, x=1 */
|
||||
2, 6, 6, 8, 7, 5, 8, 7, 2, 5, 2, 2, 8, 5, 9, 6,
|
||||
6, 7, 8, 5, 4, 4, 7, 7, 4, 3, 2, 5, 5, 5, 8, 6,
|
||||
2, 6, 6, 8, 5, 5, 8, 7, 2, 5, 2, 2, 5, 5, 9, 6,
|
||||
7, 7, 2, 5, 0, 4, 7, 7, 4, 3, 2, 3, 3, 5, 8, 6,
|
||||
2, 6, 6, 8, 0, 5, 8, 7, 2, 5, 3, 2, 4, 5, 9, 6,
|
||||
6, 7, 6, 5, 4, 4, 7, 7, 5, 3, 2, 6, 5, 5, 8, 6,
|
||||
2, 6, 6, 8, 5, 5, 8, 7, 2, 5, 4, 2, 6, 5, 9, 6,
|
||||
2, 7, 3, 5, 3, 4, 3, 7, 2, 3, 2, 3, 4, 5, 4, 6,
|
||||
2, 6, 6, 8, 4, 5, 4, 7, 2, 5, 2, 2, 5, 5, 5, 6,
|
||||
2, 7, 2, 5, 3, 4, 3, 7, 2, 3, 2, 4, 4, 5, 4, 6,
|
||||
2, 6, 6, 8, 4, 5, 4, 7, 2, 5, 2, 2, 4, 5, 4, 6,
|
||||
2, 7, 3, 5, 3, 4, 7, 7, 2, 3, 2, 3, 4, 5, 8, 6,
|
||||
2, 6, 6, 8, 6, 5, 8, 7, 2, 5, 3, 3, 6, 5, 9, 6,
|
||||
2, 7, 3, 5, 3, 4, 7, 7, 2, 3, 2, 3, 4, 5, 8, 6,
|
||||
2, 6, 6, 8, 5, 5, 8, 7, 2, 5, 4, 2, 6, 5, 9, 6,
|
||||
0, 0, 0, 0, 0, 0,
|
||||
|
||||
8, 7, 8, 5, 7, 4, 7, 7, 3, 3, 2, 4, 8, 5, 8, 6, /* e=0, m=0, x=0 */
|
||||
2, 7, 6, 8, 7, 5, 8, 7, 2, 6, 2, 2, 8, 6, 9, 6,
|
||||
6, 7, 8, 5, 4, 4, 7, 7, 4, 3, 2, 5, 5, 5, 8, 6,
|
||||
2, 7, 6, 8, 5, 5, 8, 7, 2, 6, 2, 2, 6, 6, 9, 6,
|
||||
7, 7, 2, 5, 0, 4, 7, 7, 3, 3, 2, 3, 3, 5, 8, 6,
|
||||
2, 7, 6, 8, 0, 5, 8, 7, 2, 6, 4, 2, 4, 6, 9, 6,
|
||||
6, 7, 6, 5, 4, 4, 7, 7, 4, 3, 2, 6, 5, 5, 8, 6,
|
||||
2, 7, 6, 8, 5, 5, 8, 7, 2, 6, 5, 2, 6, 6, 9, 6,
|
||||
2, 7, 3, 5, 4, 4, 4, 7, 2, 3, 2, 3, 5, 5, 5, 6,
|
||||
2, 7, 6, 8, 5, 5, 5, 7, 2, 6, 2, 2, 5, 6, 6, 6,
|
||||
3, 7, 3, 5, 4, 4, 4, 7, 2, 3, 2, 4, 5, 5, 5, 6,
|
||||
2, 7, 6, 8, 5, 5, 5, 7, 2, 6, 2, 2, 5, 6, 5, 6,
|
||||
3, 7, 3, 5, 4, 4, 7, 7, 2, 3, 2, 3, 5, 5, 8, 6,
|
||||
2, 7, 6, 8, 6, 5, 8, 7, 2, 6, 4, 3, 6, 6, 9, 6,
|
||||
3, 7, 3, 5, 4, 4, 7, 7, 2, 3, 2, 3, 5, 5, 8, 6,
|
||||
2, 7, 6, 8, 5, 5, 8, 7, 2, 6, 5, 2, 6, 6, 9, 6,
|
||||
0, 0, 0, 0, 0, 0,
|
||||
|
||||
8, 6, 8, 4, 5, 3, 5, 6, 3, 2, 2, 4, 6, 4, 6, 5, /* e=1, m=1, x=1 */
|
||||
2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 2, 2, 6, 4, 7, 5,
|
||||
6, 6, 8, 4, 3, 3, 5, 6, 4, 2, 2, 5, 4, 4, 6, 5,
|
||||
2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 2, 2, 4, 4, 7, 5,
|
||||
7, 6, 2, 4, 0, 3, 5, 6, 3, 2, 2, 3, 3, 4, 6, 5,
|
||||
2, 5, 5, 7, 0, 4, 6, 6, 2, 4, 3, 2, 4, 4, 7, 5,
|
||||
6, 6, 6, 4, 3, 3, 5, 6, 4, 2, 2, 6, 5, 4, 6, 5,
|
||||
2, 5, 5, 7, 4, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5,
|
||||
2, 6, 3, 4, 3, 3, 3, 6, 2, 2, 2, 3, 4, 4, 4, 5,
|
||||
2, 5, 5, 7, 4, 4, 4, 6, 2, 4, 2, 2, 4, 4, 4, 5,
|
||||
2, 6, 2, 4, 3, 3, 3, 6, 2, 2, 2, 4, 4, 4, 4, 5,
|
||||
2, 5, 5, 7, 4, 4, 4, 6, 2, 4, 2, 2, 4, 4, 4, 5,
|
||||
2, 6, 3, 4, 3, 3, 5, 6, 2, 2, 2, 3, 4, 4, 6, 5,
|
||||
2, 5, 5, 7, 6, 4, 6, 6, 2, 4, 3, 3, 6, 4, 7, 5,
|
||||
2, 6, 3, 4, 3, 3, 5, 6, 2, 2, 2, 3, 4, 4, 6, 5,
|
||||
2, 5, 5, 7, 5, 4, 6, 6, 2, 4, 4, 2, 6, 4, 7, 5,
|
||||
0, 0, 0, 0, 0, 0
|
||||
};
|
||||
#endif
|
||||
|
||||
void CPU_run(void)
|
||||
{
|
||||
word32 last_update,next_update;
|
||||
int opcode;
|
||||
|
||||
#ifdef LIMIT_INSTRUCTION_COUNT
|
||||
long instructionCount = 0;
|
||||
#endif
|
||||
|
||||
cpu_cycle_count = 0;
|
||||
last_update = 0;
|
||||
next_update = cpu_update_period;
|
||||
E = 1;
|
||||
F_setM(1);
|
||||
F_setX(1);
|
||||
CPU_modeSwitch();
|
||||
|
||||
dispatch:
|
||||
// CPUEvent_elapse( cpu_cycle_count );
|
||||
// cpu_cycle_count = 0;
|
||||
if (dispatch_quit)
|
||||
return;
|
||||
|
||||
// TODO remove this.
|
||||
#ifdef LIMIT_INSTRUCTION_COUNT
|
||||
instructionCount++;
|
||||
if (instructionCount > LIMIT_INSTRUCTION_COUNT)
|
||||
return;
|
||||
#endif
|
||||
// #ifdef E_UPDATE
|
||||
if (cpu_cycle_count >= next_update) goto update;
|
||||
update_resume:
|
||||
// #endif
|
||||
|
||||
#ifdef DEBUG
|
||||
if (cpu_trace) goto debug;
|
||||
debug_resume:
|
||||
#endif
|
||||
if (cpu_reset) goto reset;
|
||||
if (cpu_stop) goto dispatch;
|
||||
if (cpu_abort) goto abort;
|
||||
if (cpu_nmi) goto nmi;
|
||||
if (cpu_irq) goto irq;
|
||||
if (cpu_irne64) goto irne64;
|
||||
if (cpu_irqt5) goto irqt5;
|
||||
irq_return:
|
||||
if (cpu_wait) { cpu_cycle_count++; goto dispatch; }
|
||||
opcode = M_READ_OPCODE(PC.A);
|
||||
PC.W.PC++;
|
||||
|
||||
#ifdef OLDCYCLES
|
||||
cpu_cycle_count += cpu_curr_cycle_table[opcode];
|
||||
#endif
|
||||
(**cpu_curr_opcode_table[opcode])();
|
||||
|
||||
goto dispatch;
|
||||
|
||||
/* Special cases. Since these don't happen a lot more often than they */
|
||||
/* do happen, accessing them this way means most of the time the */
|
||||
/* generated code is _not_ branching. Only during the special cases do */
|
||||
/* we take the branch penalty (if there is one). */
|
||||
|
||||
// #ifdef E_UPDATE
|
||||
update:
|
||||
E_UPDATE(cpu_cycle_count);
|
||||
last_update = cpu_cycle_count;
|
||||
next_update = last_update + cpu_update_period;
|
||||
goto update_resume;
|
||||
// #endif
|
||||
|
||||
#ifdef DEBUG
|
||||
debug:
|
||||
CPU_debug();
|
||||
goto debug_resume;
|
||||
#endif
|
||||
reset:
|
||||
(**cpu_curr_opcode_table[256])();
|
||||
goto dispatch;
|
||||
abort:
|
||||
(**cpu_curr_opcode_table[257])();
|
||||
goto dispatch;
|
||||
nmi:
|
||||
(**cpu_curr_opcode_table[258])();
|
||||
goto dispatch;
|
||||
irq:
|
||||
if (P & 0x04) goto irq_return;
|
||||
(**cpu_curr_opcode_table[259])();
|
||||
goto dispatch;
|
||||
irne64:
|
||||
if (P & 0x04) goto irq_return;
|
||||
(**cpu_curr_opcode_table[260])();
|
||||
goto dispatch;
|
||||
irqt5:
|
||||
if (P & 0x04) goto irq_return;
|
||||
(**cpu_curr_opcode_table[261])();
|
||||
goto dispatch;
|
||||
}
|
||||
|
||||
/* Recalculate opcode_offset based on the new processor mode */
|
||||
|
||||
void CPU_modeSwitch(void) {
|
||||
|
||||
int opcode_offset;
|
||||
|
||||
if (E) {
|
||||
opcode_offset = 1048;
|
||||
} else {
|
||||
if (F_getX) {
|
||||
X.B.H = 0;
|
||||
Y.B.H = 0;
|
||||
}
|
||||
opcode_offset = ((~P >> 4) & 0x03) * 262;
|
||||
}
|
||||
#ifdef OLDCYCLES
|
||||
cpu_curr_cycle_table = cpu_cycle_table + opcode_offset;
|
||||
#endif
|
||||
cpu_curr_opcode_table = cpu_opcode_table + opcode_offset;
|
||||
}
|
||||
|
|
@ -0,0 +1,57 @@
|
|||
#include <stdio.h>
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <SDL.h>
|
||||
|
||||
// implement these later
|
||||
void psg_reset(void) {
|
||||
|
||||
}
|
||||
|
||||
void pcm_reset(void) {
|
||||
|
||||
}
|
||||
|
||||
void machine_dump(const char* msg) {
|
||||
|
||||
}
|
||||
|
||||
void machine_reset() { }
|
||||
void machine_nmi() { }
|
||||
void machine_paste(const char* text) { }
|
||||
void machine_toggle_warp() { }
|
||||
void sdcard_attach() { }
|
||||
void sdcard_detach() { }
|
||||
void mouse_button_down(int num) { }
|
||||
void mouse_button_up(int num) { }
|
||||
void mouse_move(int x, int y) { }
|
||||
void mouse_set_wheel(int y) { }
|
||||
void mouse_send_state() { }
|
||||
void audio_render() { }
|
||||
void joystick_add(int index) { }
|
||||
void joystick_remove(int index) { }
|
||||
void joystick_button_down(int instance_id, uint8_t button) { }
|
||||
void joystick_button_up(int instance_id, uint8_t button) { }
|
||||
|
||||
bool grab_mouse = false;
|
||||
bool warp_mode = false;
|
||||
bool disable_emu_cmd_keys = false;
|
||||
bool enable_midline = false;
|
||||
|
||||
bool log_video = false;
|
||||
|
||||
// TODO this needs to be moved to smc.c
|
||||
uint8_t activity_led = 0;
|
||||
|
||||
uint32_t key_modifiers = 0;
|
||||
uint32_t key_scancode = 0;
|
||||
|
||||
uint8_t machine_mhz = 8;
|
||||
|
||||
extern bool video_init(int window_scale, float screen_x_scale, char *quality, bool fullscreen, float opacity);
|
||||
extern bool video_step(float mhz, float steps, bool midline);
|
||||
extern bool video_update(void);
|
||||
extern void video_end(void);
|
||||
extern void video_reset(void);
|
||||
extern void video_write(uint8_t reg, uint8_t value);
|
||||
extern uint8_t video_read(uint8_t reg, bool debugOn);
|
||||
|
|
@ -0,0 +1,44 @@
|
|||
#ifndef _GLUE_H_
|
||||
#define _GLUE_H_
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <SDL.h>
|
||||
|
||||
#define WINDOW_TITLE "Vera Window"
|
||||
#define MOUSE_GRAB_MSG " (Ctrl+M to end mouse/keyboard capture)"
|
||||
#define MHZ machine_mhz
|
||||
|
||||
extern bool grab_mouse;
|
||||
extern bool warp_mode;
|
||||
extern uint8_t activity_led;
|
||||
extern bool disable_emu_cmd_keys;
|
||||
extern bool enable_midline;
|
||||
extern uint8_t machine_mhz;
|
||||
|
||||
extern bool log_video;
|
||||
|
||||
void psg_reset(void);
|
||||
void pcm_reset(void);
|
||||
void machine_dump(const char* msg);
|
||||
void machine_reset();
|
||||
void machine_nmi();
|
||||
void machine_paste(const char* text);
|
||||
void machine_toggle_warp();
|
||||
void sdcard_attach();
|
||||
void sdcard_detach();
|
||||
void mouse_button_down(int num);
|
||||
void mouse_button_up(int num);
|
||||
void mouse_move(int x, int y);
|
||||
void mouse_set_wheel(int y);
|
||||
void mouse_send_state();
|
||||
|
||||
void audio_render();
|
||||
void joystick_add(int index);
|
||||
void joystick_remove(int index);
|
||||
void joystick_button_down(int instance_id, uint8_t button);
|
||||
void joystick_button_up(int instance_id, uint8_t button);
|
||||
|
||||
//extern SDL_Event event;
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,185 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "cpu.h"
|
||||
#include "util.h"
|
||||
#include "video.h"
|
||||
|
||||
//#define DEBUG_READ 1
|
||||
//#define DEBUG_WRITE 1
|
||||
|
||||
extern void handleEvent(SDL_Event *event);
|
||||
extern int cpu_reset, cpu_abort, cpu_nmi, cpu_irq, cpu_stop, cpu_wait;
|
||||
|
||||
byte *memory = NULL;
|
||||
word32 runAddress = 0;
|
||||
|
||||
SDL_Event sdl_event;
|
||||
|
||||
void EMUL_hardwareUpdate(word32 timestamp) {
|
||||
static word32 lastUpdate = 0;
|
||||
int steps = timestamp - lastUpdate;
|
||||
|
||||
bool newFrame = video_step(8.0, steps, false);
|
||||
if (newFrame) {
|
||||
video_update();
|
||||
}
|
||||
|
||||
if (SDL_PollEvent(&sdl_event)) {
|
||||
puts("got an event!");
|
||||
handleEvent(&sdl_event);
|
||||
}
|
||||
|
||||
lastUpdate = timestamp;
|
||||
}
|
||||
|
||||
void EMUL_handleWDM(byte opcode, word32 timestamp) {
|
||||
printf("got WDM(%d) @ %u\n", opcode, timestamp);
|
||||
}
|
||||
|
||||
byte MEM_readMem(word32 address, word32 timestamp, word32 emulFlags) {
|
||||
if (address >= 0xdf00 && address < 0xdf20) {
|
||||
#ifdef DEBUG_READ
|
||||
printf("readMem: address:%06x, offset:%06x\n", address, address);
|
||||
#endif
|
||||
return video_read(address - 0xdf00, false);
|
||||
}
|
||||
|
||||
int offset = 0;
|
||||
bool outOfRange = false;
|
||||
|
||||
if (address < 0x080000) {
|
||||
offset = address;
|
||||
} else if (address > 0xc00000 && address < 0xc80000) {
|
||||
offset = address - 0xb80000;
|
||||
} else {
|
||||
// out of range, just return 0xff.
|
||||
outOfRange = true;
|
||||
return 0xff;
|
||||
}
|
||||
|
||||
byte b = 0xff;
|
||||
|
||||
if (!outOfRange) {
|
||||
b = *((byte *)(memory + offset));
|
||||
}
|
||||
|
||||
#ifdef DEBUG_READ
|
||||
printf("readMem: address:%06x, offset:%06x, value:%02x\n", address, offset, b);
|
||||
#endif
|
||||
|
||||
return b;
|
||||
}
|
||||
|
||||
void MEM_writeMem(word32 address, byte b, word32 timestamp) {
|
||||
if (address >= 0xdf00 && address < 0xdf20) {
|
||||
video_write(address - 0xdf00, b);
|
||||
#ifdef DEBUG_WRITE
|
||||
printf("writeMem: address:%06x, offset:%06x\n", address, address);
|
||||
#endif
|
||||
return;
|
||||
}
|
||||
|
||||
int offset = 0;
|
||||
|
||||
if (address < 0x080000) {
|
||||
offset = address;
|
||||
} else if (address > 0xc00000 && address < 0xc80000) {
|
||||
offset = address - 0xb80000;
|
||||
} else {
|
||||
// out of range, ignore the write.
|
||||
return;
|
||||
}
|
||||
|
||||
#ifdef DEBUG_WRITE
|
||||
printf("writeMem: address:%06x, offset:%06x\n", address, offset);
|
||||
#endif
|
||||
|
||||
*((byte *) memory + offset) = b;
|
||||
}
|
||||
|
||||
void initialize() {
|
||||
puts("initializing memory...");
|
||||
memory = (byte *) malloc(0x100000);
|
||||
if (memory == NULL) {
|
||||
puts("Couldn't create memory.");
|
||||
} else {
|
||||
puts("initializing vera...");
|
||||
video_init(2, (float) 1, "best", 0, 1.0);
|
||||
video_reset();
|
||||
}
|
||||
}
|
||||
|
||||
bool endsWith(const char *source_str, const char *search_str) {
|
||||
int idx = strlen(source_str) - strlen(search_str);
|
||||
if (idx > 0) {
|
||||
const char *tmp = (const char *)(source_str + idx);
|
||||
if (strncmp(tmp, search_str, strlen(search_str)) == 0) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
int loadBin(const char *filename) {
|
||||
FILE *file = fopen(filename, "rb");
|
||||
if (!file) {
|
||||
perror("Could not open file.");
|
||||
return -1;
|
||||
}
|
||||
|
||||
// 0x80000 because we shift addresses
|
||||
size_t bytesRead = fread((char *)(memory + 0x80000), 1, 0x80000, file);
|
||||
if (bytesRead != 0x80000) {
|
||||
perror("Failed to read the complete file");
|
||||
fclose(file);
|
||||
return -1;
|
||||
}
|
||||
|
||||
runAddress = 0xc08004;
|
||||
|
||||
puts("this is shifted, so $08:0000 is $c0:0000");
|
||||
hexDump(memory, 0x88000, 64);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[]) {
|
||||
bool runOk = true;
|
||||
if (argc < 2) {
|
||||
puts("bsx file-to-run.bin");
|
||||
return -1;
|
||||
}
|
||||
initialize();
|
||||
if (endsWith(argv[1], ".bin")) {
|
||||
if (loadBin(argv[1]))
|
||||
runOk = false;
|
||||
}
|
||||
|
||||
if (runOk) {
|
||||
//CPUEvent_initialize();
|
||||
CPU_setUpdatePeriod(1000);
|
||||
CPU_setTrace(0);
|
||||
cpu_reset = 0;
|
||||
cpu_abort = 0;
|
||||
cpu_nmi = 0;
|
||||
cpu_irq = 0;
|
||||
cpu_stop = 0;
|
||||
cpu_wait = 0;
|
||||
P = 0x34;
|
||||
E = 1;
|
||||
D.W = 0;
|
||||
DB = 0;
|
||||
PC.B.PB = (runAddress >> 16);
|
||||
S.W = 0x01FF;
|
||||
A.W = 0;
|
||||
X.W = 0;
|
||||
Y.W = 0;
|
||||
PC.B.L = (runAddress & 0xff);
|
||||
PC.B.H = ((runAddress >> 8) & 0xff);
|
||||
CPU_modeSwitch();
|
||||
CPU_run();
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,5 @@
|
|||
#undef NATIVE_MODE
|
||||
#define SHORT_M
|
||||
#define SHORT_X
|
||||
#define CPUMODE e1m1x1
|
||||
#include "opcodes.h"
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
#define NATIVE_MODE
|
||||
#define SHORT_M
|
||||
#define SHORT_X
|
||||
#define CPUMODE e0m1x1
|
||||
#include "opcodes.h"
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
#define NATIVE_MODE
|
||||
#undef SHORT_M
|
||||
#define SHORT_X
|
||||
#define CPUMODE e0m0x1
|
||||
#include "opcodes.h"
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
#define NATIVE_MODE
|
||||
#define SHORT_M
|
||||
#undef SHORT_X
|
||||
#define CPUMODE e0m1x0
|
||||
#include "opcodes.h"
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
#define NATIVE_MODE
|
||||
#undef SHORT_M
|
||||
#undef SHORT_X
|
||||
#define CPUMODE e0m0x0
|
||||
#include "opcodes.h"
|
||||
|
|
@ -0,0 +1,57 @@
|
|||
#include "cpu.h"
|
||||
#include "sdl_events.h"
|
||||
#include <stdbool.h>
|
||||
|
||||
extern int dispatch_quit;
|
||||
|
||||
u_int8_t keyboard_keyReady = 0;
|
||||
SDL_Keysym keyboard_keySym;
|
||||
u_int8_t keyboard_repeat;
|
||||
u_int8_t keyboard_state;
|
||||
|
||||
|
||||
|
||||
void keyboard_init() {
|
||||
|
||||
}
|
||||
|
||||
byte keyboard_read(u_int8_t register) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
void keyboard_write(u_int8_t register, byte value) {
|
||||
|
||||
}
|
||||
|
||||
char translateSDLKey(SDL_Keysym keysym) {
|
||||
// todo: expand this to handle more keys
|
||||
// special keys like home/end/etc probably need to send multiple bytes.
|
||||
// not sure how to deal with that unless ascii key & mod are separate reads.
|
||||
if (keysym.sym >= SDLK_a && keysym.sym <= SDLK_z) {
|
||||
// todo: include keysym.mod to get shift state.
|
||||
return 'a' + (keysym.sym - SDLK_a);
|
||||
} else if (keysym.sym >= SDLK_0 && keysym.sym <= SDLK_9) {
|
||||
return '0' + (keysym.sym - SDLK_0);
|
||||
} else if (keysym.sym == SDLK_SPACE) {
|
||||
return ' ';
|
||||
} else if (keysym.sym == SDLK_RETURN) {
|
||||
return '\n';
|
||||
} else if (keysym.sym == SDLK_TAB) {
|
||||
return '\t';
|
||||
}
|
||||
// Add more keys as needed
|
||||
|
||||
return '\0'; // Return null character for unsupported keys
|
||||
}
|
||||
|
||||
void handleEvent(SDL_Event *event) {
|
||||
if (event->type == SDL_QUIT) {
|
||||
puts("SDL_QUIT happened!");
|
||||
dispatch_quit = 1;
|
||||
} else if (event->type == SDL_KEYDOWN || event->type == SDL_KEYUP) {
|
||||
SDL_KeyboardEvent *ke = (SDL_KeyboardEvent *) event;
|
||||
keyboard_keySym = ke->keysym;
|
||||
keyboard_repeat = ke->repeat;
|
||||
keyboard_state = ke->state;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,7 @@
|
|||
#ifndef sdl_events_h
|
||||
#define sdl_events_h
|
||||
|
||||
#include <stdio.h>
|
||||
#include <SDL.h>
|
||||
|
||||
#endif /* sdl_events_h */
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,56 @@
|
|||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "cpu.h"
|
||||
|
||||
char *toHex(unsigned long value, unsigned int digits)
|
||||
{
|
||||
static char buffer[16];
|
||||
unsigned int offset = sizeof(buffer);;
|
||||
|
||||
buffer[--offset] = 0;
|
||||
while (digits-- > 0) {
|
||||
buffer[--offset] = "0123456789ABCDEF"[value & 0xf];
|
||||
value >>= 4;
|
||||
}
|
||||
return (&(buffer[offset]));
|
||||
}
|
||||
|
||||
void hexDump(char *memory, int offset, int length) {
|
||||
char buffer[256];
|
||||
char ascii[17] = "";
|
||||
for (int i = 0; i < 256; i++)
|
||||
buffer[i] = 0;
|
||||
|
||||
for (int i = 0; i < length; i += 16) {
|
||||
sprintf((char *) buffer, "%04x: ", offset + i);
|
||||
for (int j = 0; j < 16; j++) {
|
||||
byte b = memory[offset + j + i];
|
||||
sprintf((char *) (6 + buffer + j*3), "%02x ", b);
|
||||
|
||||
if (b >= 0x20 && b < 0x7f) {
|
||||
ascii[j] = b;
|
||||
} else {
|
||||
ascii[j] = '.';
|
||||
}
|
||||
}
|
||||
strcat(buffer, ascii);
|
||||
puts(buffer);
|
||||
}
|
||||
}
|
||||
|
||||
// int main() {
|
||||
// char buffer[65];
|
||||
// for (int i = 0; i < 64; i++) {
|
||||
// buffer[i] = 'A' + i;
|
||||
// }
|
||||
// buffer[64] = '\0';
|
||||
|
||||
// //hexDump( (const char *) buffer, 0, 64);
|
||||
// // for (int i = 0; i < 64; i++) {
|
||||
// // printf("%d = '%c'\n", i, buffer[i]);
|
||||
// // }
|
||||
|
||||
// // puts(buffer);
|
||||
// hexDump(buffer, 16, 48);
|
||||
// }
|
||||
|
|
@ -0,0 +1,5 @@
|
|||
#pragma once
|
||||
#include "cpu.h"
|
||||
|
||||
char *toHex(unsigned long value, unsigned int digits);
|
||||
void hexDump(char *memory, int offset, int length);
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,38 @@
|
|||
// Commander X16 Emulator
|
||||
// Copyright (c) 2019 Michael Steil
|
||||
// All rights reserved. License: 2-clause BSD
|
||||
|
||||
#ifndef _VIDEO_H_
|
||||
#define _VIDEO_H_
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
#include <stdio.h>
|
||||
#include <SDL.h>
|
||||
//#include "glue.h"
|
||||
|
||||
bool video_init(int window_scale, float screen_x_scale, char *quality, bool fullscreen, float opacity);
|
||||
void video_reset(void);
|
||||
bool video_step(float mhz, float steps, bool midline);
|
||||
void video_update(void);
|
||||
void video_end(void);
|
||||
bool video_get_irq_out(void);
|
||||
void video_save(SDL_RWops *f);
|
||||
uint8_t video_read(uint8_t reg, bool debugOn);
|
||||
void video_write(uint8_t reg, uint8_t value);
|
||||
void video_update_title(const char* window_title);
|
||||
|
||||
uint8_t via1_read(uint8_t reg, bool debug);
|
||||
void via1_write(uint8_t reg, uint8_t value);
|
||||
|
||||
// For debugging purposes only:
|
||||
uint8_t video_space_read(uint32_t address);
|
||||
void video_space_write(uint32_t address, uint8_t value);
|
||||
|
||||
bool video_is_tilemap_address(int addr);
|
||||
bool video_is_tiledata_address(int addr);
|
||||
bool video_is_special_address(int addr);
|
||||
|
||||
uint32_t video_get_address(uint8_t sel);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,28 @@
|
|||
* DONE add 65c265 compatibility
|
||||
** DONE Change hard coded vectors to defined ones based on tables below.
|
||||
** DONE Change references to '260' to '262'
|
||||
** DONE Change references to '1300' to '1310'
|
||||
** DONE Add '0,0,' to cpu_cycle_table (5 places?)
|
||||
** DONE Add 'irne64' flag (like irq flag) and appropriate code in dispatch.c
|
||||
-> cpu_irne64 CPU_addIrne64()/CPU_clearIrne64
|
||||
** DONE Add 'irqt5' flag and appropriate code in dispatch.c
|
||||
-> cpu_irqt5 CPU_addIrqt5()/CPU_clearIrqt5
|
||||
** DONE update table.c
|
||||
* TODO Need a Vera demo with new kernel code
|
||||
* TODO address timing - bsx just runs flat out right now, want stable 8 Mhz.
|
||||
- instrumentation: how fast are we going?
|
||||
* TODO Rename sdl_events.c/sdl_events.h
|
||||
* TODO Keyboard Device.
|
||||
** TODO 1) Create a new Keyboard device.
|
||||
- base this on bexemu/keyboard.c
|
||||
- takes 80 bytes in memory (might want to cut this down)
|
||||
** TODO 2) Patch the Keyboard device into main.c (mem read/write)
|
||||
- maybe at $DF20-$DF6F
|
||||
* TODO SDL_Event logic
|
||||
- update sdl_events.c logic to process keyboard events and put them info memory.
|
||||
* TODO Possibly rewrite dispatch loop to be more readable.
|
||||
- we don't *have* to be as general as the library intends.
|
||||
* TODO Add more hardware to emulation.
|
||||
** TODO 65C816 Timer(s) - Start with Timer #5 for now.
|
||||
- includes interrupt processing.
|
||||
|
||||
Loading…
Reference in New Issue