Update to ares v115 release.

[No official changelog available for this version. -Ed.]
Update to ares v114r25 release.
2026-11-10 17:02:56 -10:00 · 2020-07-24 21:18:00 +00:00 · 2020-07-23 03:48:00 +00:00 · 2020-07-19 19:53:00 +00:00 · 2020-07-17 20:14:00 +00:00 · 2020-07-17 00:07:00 +00:00
2353 changed files with 42362 additions and 18349 deletions
@@ -1,99 +0,0 @@
-linux-x86_64-binaries_task:
-    container:
-        image: ubuntu:latest
-
-    setup_script:
-        - apt-get update && apt-get -y install build-essential libgtk2.0-dev libpulse-dev mesa-common-dev libgtksourceview2.0-dev libcairo2-dev libsdl2-dev libxv-dev libao-dev libopenal-dev libudev-dev zip
-
-    compile_script:
-        - make -C higan target=higan local=false
-        - make -C icarus
-        - make -C genius
-
-    package_script:
-        - mkdir higan-nightly
-        - cp -a higan/out/higan higan-nightly/higan
-        - cp -a higan/System higan-nightly
-        - cp -a icarus/out/icarus higan-nightly/icarus
-        - cp -a icarus/Database higan-nightly
-        - cp -a icarus/Firmware higan-nightly
-        - cp -a genius/out/genius higan-nightly/genius
-        - cp -a GPLv3.txt higan-nightly
-        - zip -r higan-nightly.zip higan-nightly
-
-    higan-nightly_artifacts:
-        path: "higan-nightly.zip"
-
-freebsd-x86_64-binaries_task:
-    freebsd_instance:
-        image: freebsd-12-0-release-amd64
-
-    setup_script:
-        - pkg install --yes gmake gdb gcc8 pkgconf sdl2 openal-soft gtksourceview2 libXv zip
-
-    compile_script:
-        - gmake -C higan target=higan local=false
-        - gmake -C icarus
-        - gmake -C genius
-
-    package_script:
-        - mkdir higan-nightly
-        - cp -a higan/out/higan higan-nightly/higan
-        - cp -a higan/System higan-nightly
-        - cp -a icarus/out/icarus higan-nightly/icarus
-        - cp -a icarus/Database higan-nightly
-        - cp -a icarus/Firmware higan-nightly
-        - cp -a genius/out/genius higan-nightly/genius
-        - cp -a GPLv3.txt higan-nightly
-        - zip -r higan-nightly.zip higan-nightly
-
-    higan-nightly_artifacts:
-        path: "higan-nightly.zip"
-
-windows-x86_64-binaries_task:
-    container:
-        image: ubuntu:latest
-
-    setup_script:
-        - apt-get update && apt-get -y install build-essential mingw-w64 zip
-
-    compile_script:
-        - make -C higan target=higan local=false platform=windows compiler="x86_64-w64-mingw32-g++" windres="x86_64-w64-mingw32-windres"
-        - make -C icarus platform=windows compiler="x86_64-w64-mingw32-g++" windres="x86_64-w64-mingw32-windres"
-
-    package_script:
-        - mkdir higan-nightly
-        - cp -a higan/out/higan higan-nightly/higan.exe
-        - cp -a icarus/out/icarus higan-nightly/icarus.exe
-        - cp -a higan/System higan-nightly/Templates
-        - mkdir higan-nightly/Systems
-        - cp -a icarus/Database higan-nightly
-        - cp -a icarus/Firmware higan-nightly
-        - cp -a GPLv3.txt higan-nightly
-        - echo "templates: ./Templates/" >> higan-nightly/paths.bml
-        - echo "data: ./Systems/" >> higan-nightly/paths.bml
-        - zip -r higan-nightly.zip higan-nightly
-
-    higan-nightly_artifacts:
-        path: "higan-nightly.zip"
-
-macOS-x86_64-binaries_task:
-    osx_instance:
-        image: mojave-base
-
-    compile_script:
-        - make -C higan target=higan local=false
-        - make -C icarus
-
-    package_script:
-        - mkdir higan-nightly
-        - cp -a higan/out/higan.app higan-nightly
-        - cp -a higan/System higan-nightly
-        - cp -a icarus/out/icarus.app higan-nightly
-        - cp -a icarus/Database higan-nightly
-        - cp -a icarus/Firmware higan-nightly
-        - cp -a GPLv3.txt higan-nightly
-        - zip -r higan-nightly.zip higan-nightly
-
-    higan-nightly_artifacts:
-        path: "higan-nightly.zip"
@@ -1,2 +0,0 @@
-*.fs linguist-detectable=false
-*.vs linguist-detectable=false
@@ -1 +0,0 @@
-patreon: byuu
@@ -1,89 +0,0 @@
-Contributing
-============
-
-Code contributions are most welcome and highly appreciated!
-
-But first, please note that although higan is licensed under the GPLv3 license,
-in order to be merged upstream, any code contributions must be provided under
-the ISC source code license.
-
-This is *not* a CLA (community license agreement), no legal contract needs to be
-signed, and you will maintain full and exclusive copyright ownership over any
-contributed source code.
-
-There are two reasons for this requirement:
-
-GPLv4+
------
-
-higan is currently licensed under the GPLv3 license only. I do not license higan
-under the GPLv3 or later license, because there is no way of knowing what the
-GPLv4 and later licenses will change, and if they will be in the best interests
-of emulator development and video game preservation.
-
-Although I put a good deal of trust into the FSF, no one is an oracle that can
-predict the future. Would *you* agree to a license before being able to read it?
-
-However, the GPLv4 may prove beneficial, and close important holes in the GPLv3
-license, just as the GPLv3 license closed the GPLv2's TiVoization loophole. And
-so it is important that higan retains the option of relicensing to the GPLv4+ in
-the future.
-
-As a point of interest, there have been projects with similar concerns about
-using a GPLv2 or later clause, that are now permanently stuck on the GPLv2
-license. There have also been projects that did use a GPLv2 or later clause,
-only to disagree with the changes introduced in the GPLv3.
-
-ISC
---
-
-The more important reason for this requirement is that it is my intention to
-release the entirety of higan under the ISC license once official upstream
-development has ceased.
-
-The reason I would want to relicense higan to the ISC license upon its official
-discontinuation is because once again, no one is an oracle, and I cannot predict
-what future issues higan permanently remaining under the GPLv3 license may
-cause.
-
-For instance, imagine a world where a certain vendor took over the world, and
-the only way to distribute applications was with their approval, and their store
-rules forbade GPLv3 software. Or perhaps a world where the GPL was abandoned in
-favor of the new OSSv1 license. But GPLv3 software was incompatible with the
-OSSv1 license. Other open source developers would not be able to use higan in
-that scenario.
-
-It would be very disappointing if all of our work ended up unusable 50+ years
-into the future because it was permanently bound to the GPLv3 license.
-
-GPLv3
-----
-
-The reason I use the GPLv3 license currently is because it is a balance between
-altruism and self-interest. The GPLv3 allows other vendors to sell my own code
-without sharing revenue with me, and indeed this has already happened. But the
-GPLv3 also prevents other vendors from improving upon higan without sharing
-their work with everyone else as I have.
-
-While I am actively developing higan, I do not wish to compete against myself.
-
-As such, I believe the GPLv3 is the best license during active development, and
-the ISC is the best license once higan is officially discontinued.
-
-Considerations
--------------
-
-This is the part that should concern you as a contributor: I am not requesting
-contributed source code to be released under the ISC so that I personally may
-sell GPLv3 commercial license exemptions to your work, but in the future when
-higan is released under the ISC license, that will open the door for anyone to
-sell the work commercially in a closed source form.
-
-If this is not acceptable to you, I wholly understand and I welcome you to
-release your work under the GPLv3 in the form of a higan fork. And if your work
-is not an essential part of the core emulation -- that is to say, it may be
-optionally disabled -- then I am still willing to work with you in merging such
-work upstream anyway under the full GPLv3 license, but please reach out to me
-first before developing under the assumption your work will be merged upstream.
-
-Thank you very much for reading and hopefully for your understanding.
@@ -1,55 +0,0 @@
-higan was created and is maintained by byuu (Near), but many people have contributed to the project.
-
-This software would not be where it is today without the help and support of the following individuals:
-
-  - Andreas Naive
-  - Ange Albertini
-  - anomie
-  - AWJ
-  - Bisqwit
-  - blargg
-  - Łukasz Krawczyk
-  - Danish
-  - DerKoun
-  - DMV27
-  - Dr. Decapitator
-  - endrift
-  - Fatbag
-  - FitzRoy
-  - gekkio
-  - GIGO
-  - Hendricks266
-  - hex_usr
-  - ikari_01
-  - jchadwick
-  - Jonas Quinn
-  - kode54
-  - krom
-  - Lioncash
-  - Lord Nightmare
-  - lowkey
-  - Matthew Callis
-  - Max833
-  - MerryMage
-  - mightymo
-  - Nach
-  - ncbncb
-  - neviksti
-  - OV2
-  - Overload
-  - p4plus2
-  - quequotion
-  - RedDwarf
-  - Richard Bannister
-  - Ryphecha
-  - segher
-  - Sintendo
-  - SuperMikeMan
-  - Talarubi
-  - tetsuo55
-  - TmEE
-  - TRAC
-  - wareya
-  - zones
-
-If your contributions have been missed here, please reach out [here](https://byuu.org/contact) to have this corrected, thank you!
@@ -1,674 +0,0 @@
-                    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>.
@@ -1,45 +0,0 @@
----------------------------------------------------------------------
-higan  - Suite of videogame emulators
-icarus - Game library importer for higan
-genius - Game database editor for higan
-
-  Copyright © 2004-2019 byuu
-
-  https://byuu.org
-
-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, specifically version 3 of the License
-and no other 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/>.
----------------------------------------------------------------------
-
----------------------------------------------------------------------
-libco - C cooperative threading library
-nall  - C++ template library
-ruby  - Hardware abstraction library
-hiro  - User interface library
-
-  Copyright © 2006-2019 byuu
-
-Permission to use, copy, modify, and/or distribute this software for
-any purpose with or without fee is hereby granted, provided that the
-above copyright notice and this permission notice appear in all
-copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
-WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
-AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
-DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
-PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
-TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-PERFORMANCE OF THIS SOFTWARE.
----------------------------------------------------------------------
@@ -1,60 +0,0 @@
-higan
-=====
-
-![higan logo © byuu](https://byuu.org/images/higan/github/byuu-higan-logo.png)
-
-higan is a multi-system emulator from [byuu](https://byuu.org/about) with an
-uncompromising focus on accuracy and code readability.
-
-It is a research project meant to improve all emulators through open source
-collaboration, and as such is not meant to be used as a standard emulator for
-playing games (although it can be used as such with some patience.)
-
-Testing is greatly appreciated so that the emulation quality can be improved.
-Such improvements will migrate downstream to user-focused emulators such as
-bsnes.
-
-It currently emulates the following systems: Famicom, Famicom Disk System,
-Super Famicom, Super Game Boy, Game Boy, Game Boy Color, Game Boy Advance,
-Game Boy Player, SG-1000, SC-3000, Master System, Game Gear, Mega Drive,
-Mega CD, PC Engine, SuperGrafx, MSX, MSX2, ColecoVision, Neo Geo Pocket,
-Neo Geo Pocket Color, WonderSwan, WonderSwan Color, SwanCrystal,
-Pocket Challenge V2.
-
-Development
-----------
-
-Git is used for the development of new releases, and represents a staging
-environment. As higan is rather mature, things should generally be quite stable.
-However, bugs will exist, regressions will occur, so proceed at your own risk.
-
-If stability is required, please download the latest stable release from the
-[official website.](https://byuu.org/higan)
-
-Links
-----
-
-  - [Official website](https://byuu.org/higan)
-  - [Official git repository](https://github.com/byuu/higan)
-  - [Donations](https://patreon.com/byuu)
-
-Release Builds
--------------
-
-  - [Windows binaries](https://byuu.itch.io/higan)
-
-Nightly Builds
--------------
-
-  - [Download](https://cirrus-ci.com/github/byuu/higan/master)
-  - ![Build status](https://api.cirrus-ci.com/github/byuu/higan.svg?task=windows-x86_64-binaries)
-  - ![Build status](https://api.cirrus-ci.com/github/byuu/higan.svg?task=macOS-x86_64-binaries)
-  - ![Build status](https://api.cirrus-ci.com/github/byuu/higan.svg?task=linux-x86_64-binaries)
-  - ![Build status](https://api.cirrus-ci.com/github/byuu/higan.svg?task=freebsd-x86_64-binaries)
-
-Preview
-------
-
-![higan user interface © byuu](https://byuu.org/images/higan/github/byuu-higan-user-interface.png)
-![higan running Bahamut Lagoon (SNES) © byuu](https://byuu.org/images/higan/github/byuu-higan-bahamut-lagoon.png)
-![higan running Riviera (GBA) © byuu](https://byuu.org/images/higan/github/byuu-higan-riviera.png)
@@ -1,19 +1,3 @@
-target := higan
-#target := byuu
-build := performance
-openmp := false
-local := true
-flags += -I. -I..
-
-$(info Targeting $(target) ...)
-
-nall.path := ../nall
-include $(nall.path)/GNUmakefile
-
-ifeq ($(platform),local)
-  flags += -march=native
-endif
-
 ifeq ($(platform),windows)
  options += -luuid -lkernel32 -luser32 -lgdi32 -lcomctl32 -lcomdlg32 -lshell32
  options += -Wl,-enable-auto-import
@@ -26,20 +10,9 @@ else
  $(error "unsupported platform")
 endif

-objects := libco emulator
+ares.objects := ares

-obj/libco.o: ../libco/libco.c
-obj/emulator.o: emulator/emulator.cpp
-
-ifeq ($(target),higan)
-  profile := accuracy
-  cores := fc sfc sg ms md pce msx cv gb gba ws ngp
-endif
-
-ifeq ($(target),byuu)
-  profile := performance
-  cores := fc sfc sg ms md pce msx gb gba ws ngp
-endif
+$(object.path)/ares.o: $(ares.path)/ares/ares.cpp

 ifeq ($(profile),accuracy)
  flags += -DPROFILE_ACCURACY
@@ -50,60 +23,63 @@ ifeq ($(profile),performance)
 endif

 ifneq ($(filter $(cores),fc),)
-  include fc/GNUmakefile
+  include $(ares.path)/fc/GNUmakefile
 endif

 ifneq ($(filter $(cores),sfc),)
-  include sfc/GNUmakefile
+  include $(ares.path)/sfc/GNUmakefile
+endif
+
+ifneq ($(filter $(cores),n64),)
+  include $(ares.path)/n64/GNUmakefile
 endif

 ifneq ($(filter $(cores),sg),)
-  include sg/GNUmakefile
+  include $(ares.path)/sg/GNUmakefile
 endif

 ifneq ($(filter $(cores),ms),)
-  include ms/GNUmakefile
+  include $(ares.path)/ms/GNUmakefile
 endif

 ifneq ($(filter $(cores),md),)
-  include md/GNUmakefile
+  include $(ares.path)/md/GNUmakefile
+endif
+
+ifneq ($(filter $(cores),ps1),)
+  include $(ares.path)/ps1/GNUmakefile
 endif

 ifneq ($(filter $(cores),pce),)
-  include pce/GNUmakefile
+  include $(ares.path)/pce/GNUmakefile
 endif

 ifneq ($(filter $(cores),msx),)
-  include msx/GNUmakefile
+  include $(ares.path)/msx/GNUmakefile
 endif

 ifneq ($(filter $(cores),cv),)
-  include cv/GNUmakefile
+  include $(ares.path)/cv/GNUmakefile
 endif

 ifneq ($(filter $(cores),gb),)
-  include gb/GNUmakefile
+  include $(ares.path)/gb/GNUmakefile
 endif

 ifneq ($(filter $(cores),gba),)
-  include gba/GNUmakefile
+  include $(ares.path)/gba/GNUmakefile
 endif

 ifneq ($(filter $(cores),ws),)
-  include ws/GNUmakefile
+  include $(ares.path)/ws/GNUmakefile
 endif

 ifneq ($(filter $(cores),ngp),)
-  include ngp/GNUmakefile
+  include $(ares.path)/ngp/GNUmakefile
 endif

-include component/GNUmakefile
+include $(ares.path)/component/GNUmakefile

 flags += $(foreach c,$(call strupper,$(cores)),-DCORE_$c)
-ui := target-$(target)
-include $(ui)/GNUmakefile
-include obj/*.d

-clean:
-	$(call delete,obj/*)
-	$(call delete,out/*)
+ares.objects := $(ares.objects:%=$(object.path)/%.o)
@@ -1,5 +1,5 @@
 database
-  revision: 2020-01-21
+  revision: 2020-06-07

 //Boards (Production)

@@ -587,7 +587,7 @@ board: SHVC-YJ0N-01
 //Boards (Generic)

 database
-  revision: 2020-01-01
+  revision: 2020-06-07

 board: ARM-LOROM-RAM
  memory type=ROM content=Program
@@ -887,6 +887,16 @@ board: OBC1-LOROM-RAM
    map address=70-71,f0-f1:6000-7fff,e000-ffff mask=0xe000
    memory type=RAM content=Save

+board: SA1
+  processor architecture=W65C816S
+    map address=00-3f,80-bf:2200-23ff
+    mcu
+      map address=00-3f,80-bf:8000-ffff mask=0x408000
+      map address=c0-ff:0000-ffff
+      memory type=ROM content=Program
+    memory type=RAM content=Internal
+      map address=00-3f,80-bf:3000-37ff size=0x800
+
 board: SA1-RAM
  processor architecture=W65C816S
    map address=00-3f,80-bf:2200-23ff
@@ -0,0 +1,11 @@
+#include <ares/ares.hpp>
+#include <ares/debug/debug.cpp>
+#include <ares/node/node.cpp>
+#include <ares/resource/resource.cpp>
+
+namespace ares {
+
+Platform* platform = nullptr;
+bool _runAhead = false;
+
+}
@@ -6,6 +6,7 @@
 #include <nall/adaptive-array.hpp>
 #include <nall/any.hpp>
 #include <nall/array.hpp>
+#include <nall/bump-allocator.hpp>
 #include <nall/chrono.hpp>
 #include <nall/directory.hpp>
 #include <nall/dl.hpp>
@@ -17,6 +18,7 @@
 #include <nall/set.hpp>
 #include <nall/shared-pointer.hpp>
 #include <nall/string.hpp>
+#include <nall/terminal.hpp>
 #include <nall/traits.hpp>
 #include <nall/unique-pointer.hpp>
 #include <nall/variant.hpp>
@@ -30,31 +32,7 @@
 #include <nall/hash/sha256.hpp>
 using namespace nall;

-namespace higan {
-  extern bool _runAhead;
-  inline auto runAhead() -> bool { return _runAhead; }
-  inline auto setRunAhead(bool runAhead) -> void { _runAhead = runAhead; }
-}
-
-#include <emulator/types.hpp>
-#include <emulator/random.hpp>
-#include <emulator/node/node.hpp>
-#include <emulator/platform.hpp>
-#include <emulator/interface.hpp>
-#include <emulator/memory/readable.hpp>
-#include <emulator/memory/writable.hpp>
-#include <emulator/resource/resource.hpp>
-
-namespace higan {
-  static const string Name      = "higan";
-  static const string Version   = "110";
-  static const string Copyright = "byuu";
-  static const string License   = "GPLv3";
-  static const string Website   = "https://byuu.org";
-
-  //incremented only when serialization format changes
-  static const string SerializerVersion = "109";
-
+namespace ares {
  namespace Constants {
    namespace Colorburst {
      static constexpr double NTSC = 315.0 / 88.0 * 1'000'000.0;
@@ -73,4 +51,19 @@ namespace higan {
  namespace Shared {
    using File = shared_pointer<vfs::file>;
  }
+
+  extern bool _runAhead;
+  inline auto runAhead() -> bool { return _runAhead; }
+  inline auto setRunAhead(bool runAhead) -> void { _runAhead = runAhead; }
 }
+
+#include <ares/information.hpp>
+#include <ares/types.hpp>
+#include <ares/random.hpp>
+#include <ares/debug/debug.hpp>
+#include <ares/node/node.hpp>
+#include <ares/platform.hpp>
+#include <ares/interface.hpp>
+#include <ares/memory/readable.hpp>
+#include <ares/memory/writable.hpp>
+#include <ares/resource/resource.hpp>
@@ -0,0 +1,17 @@
+namespace ares {
+
+Debug _debug;
+
+auto Debug::reset() -> void {
+  _unimplementedNotices.reset();
+}
+
+auto Debug::_unimplemented(const string& text) -> void {
+  //only warn about missing unimplemented functionality once per type
+  if(_unimplementedNotices.find(text)) return;
+  _unimplementedNotices.append(text);
+
+  print(terminal::color::magenta("[unimplemented] "), text, "\n");
+}
+
+}
@@ -0,0 +1,22 @@
+namespace ares {
+
+struct Debug {
+  static constexpr bool enabled = true;
+
+  auto reset() -> void;
+
+  template<typename... P> auto unimplemented(P&&... p) -> void {
+    return _unimplemented({forward<P>(p)...});
+  }
+
+private:
+  auto _unimplemented(const string&) -> void;
+
+  vector<string> _unimplementedNotices;
+};
+
+extern Debug _debug;
+
+}
+
+#define debug(function, ...) if constexpr(ares::_debug.enabled) ares::_debug.function(__VA_ARGS__)
@@ -0,0 +1,14 @@
+#pragma once
+
+namespace ares {
+  static const string Name       = "ares";
+  static const string Version    = "115";
+  static const string Copyright  = "ares team";
+  static const string License    = "ISC";
+  static const string LicenseURI = "https://opensource.org/licenses/ISC";
+  static const string Website    = "ares.dev";
+  static const string WebsiteURI = "https://ares.dev";
+
+  //incremented only when serialization format changes
+  static const string SerializerVersion = "115";
+}
@@ -0,0 +1,4 @@
+#include <ares/scheduler/thread.hpp>
+#include <ares/scheduler/scheduler.hpp>
+#include <ares/scheduler/thread.cpp>
+#include <ares/scheduler/scheduler.cpp>
@@ -1,6 +1,6 @@
 #pragma once

-namespace higan {
+namespace ares {

 struct Interface {
  virtual ~Interface() = default;
@@ -11,7 +11,7 @@ struct Interface {

  //system interface
  virtual auto root() -> Node::Object { return {}; }
-  virtual auto load(Node::Object&, string tree = {}) -> void {}
+  virtual auto load(Node::Object&) -> void {}
  virtual auto power() -> void {}
  virtual auto run() -> void {}
  virtual auto save() -> void {}
@@ -1,6 +1,6 @@
 #pragma once

-namespace higan::Memory {
+namespace ares::Memory {

 inline auto mirror(uint address, uint size) -> uint {
  if(size == 0) return 0;
@@ -1,21 +1,21 @@
 #pragma once

-#include <emulator/memory/memory.hpp>
+#include <ares/memory/memory.hpp>

-namespace higan::Memory {
+namespace ares::Memory {

 template<typename T>
 struct Readable {
  ~Readable() { reset(); }

-  inline auto reset() -> void {
+  auto reset() -> void {
    delete[] self.data;
    self.data = nullptr;
    self.size = 0;
    self.mask = 0;
  }

-  inline auto allocate(uint size, T fill = ~0ull) -> void {
+  auto allocate(uint size, T fill = ~0ull) -> void {
    if(!size) return reset();
    delete[] self.data;
    self.size = size;
@@ -24,13 +24,13 @@ struct Readable {
    memory::fill<T>(self.data, self.mask + 1, fill);
  }

-  inline auto fill(T fill = ~0ull) -> void {
+  auto fill(T fill = ~0ull) -> void {
    for(uint address : range(self.size)) {
      self.data[address] = fill;
    }
  }

-  inline auto load(shared_pointer<vfs::file> fp) -> void {
+  auto load(shared_pointer<vfs::file> fp) -> void {
    if(!self.size) return;
    fp->read(self.data, min(fp->size(), self.size * sizeof(T)));
    for(uint address = self.size; address <= self.mask; address++) {
@@ -38,20 +38,20 @@ struct Readable {
    }
  }

-  inline auto save(shared_pointer<vfs::file> fp) -> void {
+  auto save(shared_pointer<vfs::file> fp) -> void {
    if(!self.size) return;
    fp->write(self.data, self.size * sizeof(T));
  }

  explicit operator bool() const { return (bool)self.data; }
-  inline auto data() const -> const T* { return self.data; }
-  inline auto size() const -> uint { return self.size; }
-  inline auto mask() const -> uint { return self.mask; }
+  auto data() const -> const T* { return self.data; }
+  auto size() const -> uint { return self.size; }
+  auto mask() const -> uint { return self.mask; }

-  inline auto operator[](uint address) const -> T { return self.data[address & self.mask]; }
-  inline auto read(uint address) const -> T { return self.data[address & self.mask]; }
-  inline auto write(uint address, T data) const -> void {}
-  inline auto program(uint address, T data) const -> void { self.data[address & self.mask] = data; }
+  auto operator[](uint address) const -> T { return self.data[address & self.mask]; }
+  auto read(uint address) const -> T { return self.data[address & self.mask]; }
+  auto write(uint address, T data) const -> void {}
+  auto program(uint address, T data) const -> void { self.data[address & self.mask] = data; }

  auto begin() -> T* { return &self.data[0]; }
  auto end() -> T* { return &self.data[self.size]; }
@@ -1,21 +1,21 @@
 #pragma once

-#include <emulator/memory/memory.hpp>
+#include <ares/memory/memory.hpp>

-namespace higan::Memory {
+namespace ares::Memory {

 template<typename T>
 struct Writable {
  ~Writable() { reset(); }

-  inline auto reset() -> void {
+  auto reset() -> void {
    delete[] self.data;
    self.data = nullptr;
    self.size = 0;
    self.mask = 0;
  }

-  inline auto allocate(uint size, T fill = ~0ull) -> void {
+  auto allocate(uint size, T fill = ~0ull) -> void {
    if(!size) return reset();
    delete[] self.data;
    self.size = size;
@@ -24,13 +24,13 @@ struct Writable {
    memory::fill<T>(self.data, self.mask + 1, fill);
  }

-  inline auto fill(T fill = ~0ull) -> void {
+  auto fill(T fill = ~0ull) -> void {
    for(uint address : range(self.size)) {
      self.data[address] = fill;
    }
  }

-  inline auto load(shared_pointer<vfs::file> fp) -> void {
+  auto load(shared_pointer<vfs::file> fp) -> void {
    if(!self.size) return;
    fp->read(self.data, min(fp->size(), self.size * sizeof(T)));
    for(uint address = self.size; address <= self.mask; address++) {
@@ -38,22 +38,22 @@ struct Writable {
    }
  }

-  inline auto save(shared_pointer<vfs::file> fp) -> void {
+  auto save(shared_pointer<vfs::file> fp) -> void {
    if(!self.size) return;
    fp->write(self.data, self.size * sizeof(T));
  }

  explicit operator bool() const { return (bool)self.data; }
-  inline auto data() -> T* { return self.data; }
-  inline auto data() const -> const T* { return self.data; }
-  inline auto size() const -> uint { return self.size; }
-  inline auto mask() const -> uint { return self.mask; }
+  auto data() -> T* { return self.data; }
+  auto data() const -> const T* { return self.data; }
+  auto size() const -> uint { return self.size; }
+  auto mask() const -> uint { return self.mask; }

-  inline auto operator[](uint address) -> T& { return self.data[address & self.mask]; }
-  inline auto operator[](uint address) const -> T { return self.data[address & self.mask]; }
-  inline auto read(uint address) const -> T { return self.data[address & self.mask]; }
-  inline auto write(uint address, T data) -> void { self.data[address & self.mask] = data; }
-  inline auto program(uint address, T data) -> void { self.data[address & self.mask] = data; }
+  auto operator[](uint address) -> T& { return self.data[address & self.mask]; }
+  auto operator[](uint address) const -> T { return self.data[address & self.mask]; }
+  auto read(uint address) const -> T { return self.data[address & self.mask]; }
+  auto write(uint address, T data) -> void { self.data[address & self.mask] = data; }
+  auto program(uint address, T data) -> void { self.data[address & self.mask] = data; }

  auto begin() -> T* { return &self.data[0]; }
  auto end() -> T* { return &self.data[self.size]; }
@@ -31,6 +31,10 @@ auto Stream::setResamplerFrequency(double resamplerFrequency) -> void {
  }
 }

+auto Stream::setMuted(bool muted) -> void {
+  _muted = muted;
+}
+
 auto Stream::resetFilters() -> void {
  for(auto& channel : _channels) {
    channel.filters.reset();
@@ -100,7 +104,7 @@ auto Stream::pending() const -> bool {
 }

 auto Stream::read(double samples[]) -> uint {
-  for(uint c : range(_channels.size())) samples[c] = _channels[c].resampler.read();
+  for(uint c : range(_channels.size())) samples[c] = _channels[c].resampler.read() * !muted();
  return _channels.size();
 }

@@ -2,13 +2,15 @@ struct Stream : Object {
  DeclareClass(Stream, "Stream")
  using Object::Object;

-  inline auto channels() const -> uint { return _channels.size(); }
-  inline auto frequency() const -> double { return _frequency; }
-  inline auto resamplerFrequency() const -> double { return _resamplerFrequency; }
+  auto channels() const -> uint { return _channels.size(); }
+  auto frequency() const -> double { return _frequency; }
+  auto resamplerFrequency() const -> double { return _resamplerFrequency; }
+  auto muted() const -> bool { return _muted; }

  auto setChannels(uint channels) -> void;
  auto setFrequency(double frequency) -> void;
  auto setResamplerFrequency(double resamplerFrequency) -> void;
+  auto setMuted(bool muted) -> void;

  auto resetFilters() -> void;
  auto addLowPassFilter(double cutoffFrequency, uint order, uint passes = 1) -> void;
@@ -21,7 +23,7 @@ struct Stream : Object {
  auto write(const double samples[]) -> void;

  template<typename... P>
-  inline auto sample(P&&... p) -> void {
+  auto sample(P&&... p) -> void {
    if(runAhead()) return;
    double samples[sizeof...(p)] = {forward<P>(p)...};
    write(samples);
@@ -43,4 +45,5 @@ protected:
  vector<Channel> _channels;
  double _frequency = 48000.0;
  double _resamplerFrequency = 48000.0;
+  bool _muted = false;
 };
@@ -0,0 +1,26 @@
+struct Graphics : Object {
+  DeclareClass(Graphics, "Graphics")
+
+  Graphics(string name = {}) : Object(name) {
+  }
+
+  auto width() const -> uint { return _width; }
+  auto height() const -> uint { return _height; }
+  auto capture() const -> vector<uint32_t> { if(_capture) return _capture(); return {}; }
+
+  auto setSize(uint width, uint height) -> void { _width = width, _height = height; }
+  auto setCapture(function<vector<uint32_t> ()> capture) -> void { _capture = capture; }
+
+  auto serialize(string& output, string depth) -> void override {
+    Object::serialize(output, depth);
+  }
+
+  auto unserialize(Markup::Node node) -> void override {
+    Object::unserialize(node);
+  }
+
+protected:
+  uint _width = 0;
+  uint _height = 0;
+  function<vector<uint32_t> ()> _capture;
+};
@@ -1,12 +1,12 @@
-struct Instruction : Event {
+struct Instruction : Tracer {
  DeclareClass(Instruction, "Instruction")

-  Instruction(string name = {}, string component = {}) : Event(name, component) {
+  Instruction(string name = {}, string component = {}) : Tracer(name, component) {
    setDepth(_depth);
  }

-  inline auto depth() const -> uint { return _depth; }
-  inline auto addressBits() const -> uint { return _addressBits; }
+  auto depth() const -> uint { return _depth; }
+  auto addressBits() const -> uint { return _addressBits; }

  auto setDepth(uint depth) -> void {
    _depth = depth;
@@ -60,13 +60,13 @@ struct Instruction : Event {
  }

  auto serialize(string& output, string depth) -> void override {
-    Event::serialize(output, depth);
+    Tracer::serialize(output, depth);
    output.append(depth, "  depth: ", _depth, "\n");
    output.append(depth, "  addressBits: ", _addressBits, "\n");
  }

  auto unserialize(Markup::Node node) -> void override {
-    Event::unserialize(node);
+    Tracer::unserialize(node);
    _depth = node["depth"].natural();
    _addressBits = node["addressBits"].natural();

@@ -0,0 +1,27 @@
+struct Memory : Object {
+  DeclareClass(Memory, "Memory")
+
+  Memory(string name = {}) : Object(name) {
+  }
+
+  auto size() const -> uint { return _size; }
+  auto read(uint32 address) const -> uint8 { if(_read) return _read(address); return 0; }
+  auto write(uint32 address, uint8 data) const -> void { if(_write) return _write(address, data); }
+
+  auto setSize(uint size) -> void { _size = size; }
+  auto setRead(function<uint8 (uint32)> read) -> void { _read = read; }
+  auto setWrite(function<void (uint32, uint8)> write) -> void { _write = write; }
+
+  auto serialize(string& output, string depth) -> void override {
+    Object::serialize(output, depth);
+  }
+
+  auto unserialize(Markup::Node node) -> void override {
+    Object::unserialize(node);
+  }
+
+protected:
+  uint _size = 0;
+  function<uint8 (uint32)> _read;
+  function<void (uint32, uint8)> _write;
+};
@@ -1,7 +1,7 @@
-struct Notification : Event {
+struct Notification : Tracer {
  DeclareClass(Notification, "Notification")

-  Notification(string name = {}, string component = {}) : Event(name, component) {
+  Notification(string name = {}, string component = {}) : Tracer(name, component) {
  }

  auto notify(string_view message = {}) -> void {
@@ -0,0 +1,21 @@
+struct Properties : Object {
+  DeclareClass(Properties, "Properties")
+
+  Properties(string name = {}) : Object(name) {
+  }
+
+  auto query() const -> string { if(_query) return _query(); return {}; }
+
+  auto setQuery(function<string ()> query) -> void { _query = query; }
+
+  auto serialize(string& output, string depth) -> void override {
+    Object::serialize(output, depth);
+  }
+
+  auto unserialize(Markup::Node node) -> void override {
+    Object::unserialize(node);
+  }
+
+protected:
+  function<string ()> _query;
+};
@@ -1,12 +1,12 @@
-struct Event : Object {
-  DeclareClass(Event, "Event")
+struct Tracer : Object {
+  DeclareClass(Tracer, "Tracer")

-  Event(string name = {}, string component = {}) : Object(name) {
+  Tracer(string name = {}, string component = {}) : Object(name) {
    _component = component;
  }

-  inline auto component() const -> string { return _component; }
-  inline auto enabled() const -> bool { return _enabled; }
+  auto component() const -> string { return _component; }
+  auto enabled() const -> bool { return _enabled; }

  auto setComponent(string component) -> void { _component = component; }
  auto setEnabled(bool enabled) -> void { _enabled = enabled; }
@@ -7,8 +7,8 @@ struct Button : Input {
  DeclareClass(Button, "Button")
  using Input::Input;

-  inline auto value() const -> boolean { return _value; }
-  inline auto setValue(boolean value) -> void { _value = value; }
+  auto value() const -> boolean { return _value; }
+  auto setValue(boolean value) -> void { _value = value; }

 protected:
  boolean _value;
@@ -18,8 +18,8 @@ struct Axis : Input {
  DeclareClass(Axis, "Axis")
  using Input::Input;

-  inline auto value() const -> integer { return _value; }
-  inline auto setValue(integer value) -> void { _value = value; }
+  auto value() const -> integer { return _value; }
+  auto setValue(integer value) -> void { _value = value; }

 protected:
  integer _value;
@@ -31,8 +31,8 @@ struct Trigger : Input {
  DeclareClass(Trigger, "Trigger")
  using Input::Input;

-  inline auto value() const -> integer { return _value; }
-  inline auto setValue(integer value) -> void { _value = value; }
+  auto value() const -> integer { return _value; }
+  auto setValue(integer value) -> void { _value = value; }

 protected:
  integer _value;
@@ -44,8 +44,8 @@ struct Rumble : Input {
  DeclareClass(Rumble, "Rumble")
  using Input::Input;

-  inline auto enable() const -> boolean { return _enable; }
-  inline auto setEnable(boolean enable) -> void { _enable = enable; }
+  auto enable() const -> boolean { return _enable; }
+  auto setEnable(boolean enable) -> void { _enable = enable; }

 protected:
  boolean _enable;
@@ -0,0 +1,5 @@
+namespace ares::Core {
+  #include <ares/node/video/sprite.cpp>
+  #include <ares/node/video/screen.cpp>
+  #include <ares/node/audio/stream.cpp>
+}
@@ -0,0 +1,133 @@
+namespace ares::Core {
+  struct Object;
+    struct System;
+    struct Component;
+    struct RealTimeClock;
+    struct Peripheral;
+    struct Port;
+    struct Input;
+      struct Button;
+      struct Axis;
+      struct Trigger;
+      struct Rumble;
+    struct Settings;
+    struct Setting;
+      struct Boolean;
+      struct Natural;
+      struct Integer;
+      struct Real;
+      struct String;
+  //struct Video;
+      struct Sprite;
+      struct Screen;
+  //struct Audio;
+      struct Stream;
+  //struct Debug;
+      struct Memory;
+      struct Graphics;
+      struct Properties;
+      struct Tracer;
+        struct Notification;
+        struct Instruction;
+}
+
+namespace ares::Node {
+  using Object             = shared_pointer<Core::Object>;
+    using System           = shared_pointer<Core::System>;
+    using Component        = shared_pointer<Core::Component>;
+    using RealTimeClock    = shared_pointer<Core::RealTimeClock>;
+    using Peripheral       = shared_pointer<Core::Peripheral>;
+    using Port             = shared_pointer<Core::Port>;
+    using Input            = shared_pointer<Core::Input>;
+      using Button         = shared_pointer<Core::Button>;
+      using Axis           = shared_pointer<Core::Axis>;
+      using Trigger        = shared_pointer<Core::Trigger>;
+      using Rumble         = shared_pointer<Core::Rumble>;
+    using Settings         = shared_pointer<Core::Settings>;
+    using Setting          = shared_pointer<Core::Setting>;
+      using Boolean        = shared_pointer<Core::Boolean>;
+      using Natural        = shared_pointer<Core::Natural>;
+      using Integer        = shared_pointer<Core::Integer>;
+      using Real           = shared_pointer<Core::Real>;
+      using String         = shared_pointer<Core::String>;
+  //using Video;
+      using Sprite         = shared_pointer<Core::Sprite>;
+      using Screen         = shared_pointer<Core::Screen>;
+  //using Audio;
+      using Stream         = shared_pointer<Core::Stream>;
+  //using Debug;
+      using Memory         = shared_pointer<Core::Memory>;
+      using Graphics       = shared_pointer<Core::Graphics>;
+      using Properties     = shared_pointer<Core::Properties>;
+      using Tracer         = shared_pointer<Core::Tracer>;
+        using Notification = shared_pointer<Core::Notification>;
+        using Instruction  = shared_pointer<Core::Instruction>;
+}
+
+namespace ares::Core {
+  // <emulator/platform.hpp> forward declarations (dependent on <emulator/node.hpp>)
+  static auto PlatformAttach(Node::Object) -> void;
+  static auto PlatformDetach(Node::Object) -> void;
+  static auto PlatformLog(string_view) -> void;
+
+  #include <ares/node/attribute.hpp>
+  #include <ares/node/class.hpp>
+  #include <ares/node/object.hpp>
+  #include <ares/node/system.hpp>
+  #include <ares/node/component.hpp>
+  #include <ares/node/real-time-clock.hpp>
+  #include <ares/node/peripheral.hpp>
+  #include <ares/node/port.hpp>
+  #include <ares/node/input.hpp>
+  #include <ares/node/setting.hpp>
+  #include <ares/node/video/sprite.hpp>
+  #include <ares/node/video/screen.hpp>
+  #include <ares/node/audio/stream.hpp>
+  #include <ares/node/debug/memory.hpp>
+  #include <ares/node/debug/graphics.hpp>
+  #include <ares/node/debug/properties.hpp>
+  #include <ares/node/debug/tracer.hpp>
+  #include <ares/node/debug/notification.hpp>
+  #include <ares/node/debug/instruction.hpp>
+}
+
+namespace ares::Node {
+  static inline auto create(string identifier) -> Object {
+    return Core::Class::create(identifier);
+  }
+
+  static inline auto serialize(Object node) -> string {
+    if(!node) return {};
+    string result;
+    node->serialize(result, {});
+    return result;
+  }
+
+  static inline auto unserialize(string markup) -> Object {
+    auto document = BML::unserialize(markup);
+    if(!document) return {};
+    auto node = Core::Class::create(document["node"].text());
+    node->unserialize(document["node"]);
+    return node;
+  }
+
+  static inline auto parent(Object child) -> Object {
+    if(!child || !child->parent()) return {};
+    if(auto parent = child->parent().acquire()) return parent;
+    return {};
+  }
+
+  template<typename T>
+  static inline auto find(Object from, string name) -> Object {
+    if(!from) return {};
+    if(auto object = from->find<T>(name)) return object;
+    return {};
+  }
+
+  template<typename T>
+  static inline auto enumerate(Object from) -> vector<T> {
+    vector<T> objects;
+    if(from) from->enumerate<T>(objects);
+    return objects;
+  }
+}
@@ -13,8 +13,8 @@ struct Object : shared_pointer_this<Object> {
  Object(string name = {}) : _name(name) {}
  virtual ~Object() = default;

-  inline auto name() const -> string { return _name; }
-  inline auto parent() const -> shared_pointer_weak<Object> { return _parent; }
+  auto name() const -> string { return _name; }
+  auto parent() const -> shared_pointer_weak<Object> { return _parent; }

  auto setName(string_view name) -> void { _name = name; }

@@ -190,6 +190,18 @@ struct Object : shared_pointer_this<Object> {
    }
  }

+  virtual auto copy(Node::Object source) -> void {
+    _attributes = source->_attributes;
+    for(auto& from : source->_nodes) {
+      for(auto& to : _nodes) {
+        if(from->identity() != to->identity()) continue;
+        if(from->name() != to->name()) continue;
+        to->copy(from);
+        break;
+      }
+    }
+  }
+
  auto begin() { return _nodes.begin(); }
  auto end() { return _nodes.end(); }

@@ -2,7 +2,7 @@ struct Peripheral : Object {
  DeclareClass(Peripheral, "Peripheral")
  using Object::Object;

-  inline auto manifest() -> string { if(_manifest) return _manifest(); return {}; }
+  auto manifest() -> string { if(_manifest) return _manifest(); return {}; }

  auto setManifest(function<string()> manifest) -> void { _manifest = manifest; }

@@ -0,0 +1,74 @@
+struct Port : Object {
+  DeclareClass(Port, "Port")
+  using Object::Object;
+
+  auto type() const -> string { return _type; }
+  auto family() const -> string { return _family; }
+  auto hotSwappable() const -> bool { return _hotSwappable; }
+  auto supported() const -> vector<string> { return _supported; }
+
+  auto setAllocate(function<Node::Peripheral (string)> allocate) -> void { _allocate = allocate; }
+  auto setConnect(function<void ()> connect) -> void { _connect = connect; }
+  auto setDisconnect(function<void ()> disconnect) -> void { _disconnect = disconnect; }
+  auto setType(string type) -> void { _type = type; }
+  auto setFamily(string family) -> void { _family = family; }
+  auto setHotSwappable(bool hotSwappable) -> void { _hotSwappable = hotSwappable; }
+  auto setSupported(vector<string> supported) -> void { _supported = supported; }
+
+  auto connected() -> Node::Peripheral {
+    return find<Node::Peripheral>(0);
+  }
+
+  auto allocate(string name = {}) -> Node::Peripheral {
+    disconnect();
+    if(_allocate) return _allocate(name);
+    return {};
+  }
+
+  auto connect() -> void {
+    if(_connect) _connect();
+  }
+
+  auto disconnect() -> void {
+    if(auto peripheral = connected()) {
+      if(_disconnect) _disconnect();
+      remove(peripheral);
+    }
+  }
+
+  auto serialize(string& output, string depth) -> void override {
+    Object::serialize(output, depth);
+    output.append(depth, "  type: ", _type, "\n");
+    output.append(depth, "  family: ", _family, "\n");
+    output.append(depth, "  hotSwappable: ", _hotSwappable, "\n");
+  }
+
+  auto unserialize(Markup::Node node) -> void override {
+    Object::unserialize(node);
+    _type = node["type"].string();
+    _family = node["family"].string();
+    _hotSwappable = node["hotSwappable"].boolean();
+  }
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::Port>()) {
+      Object::copy(source);
+      if(auto peripheral = source->find<Node::Peripheral>(0)) {
+        if(auto node = allocate(peripheral->name())) {
+          node->copy(peripheral);
+          connect();
+          node->copy(peripheral);
+        }
+      }
+    }
+  }
+
+protected:
+  function<Node::Peripheral (string)> _allocate;
+  function<void ()> _connect;
+  function<void ()> _disconnect;
+  string _type;
+  string _family;
+  bool _hotSwappable = false;
+  vector<string> _supported;
+};
@@ -2,8 +2,8 @@ struct RealTimeClock : Object {
  DeclareClass(RealTimeClock, "Real Time Clock")
  using Object::Object;

-  inline auto update() -> void { if(_update) return _update(); }
-  inline auto timestamp() const -> uint64 { return _timestamp; }
+  auto update() -> void { if(_update) return _update(); }
+  auto timestamp() const -> uint64 { return _timestamp; }

  auto setUpdate(function<void ()> update) { _update = update; }
  auto setTimestamp(uint64 timestamp) -> void { _timestamp = timestamp; }
@@ -7,7 +7,7 @@ struct Setting : Object {
  DeclareClass(Setting, "Setting")
  using Object::Object;

-  inline auto dynamic() const -> bool { return _dynamic; }
+  auto dynamic() const -> bool { return _dynamic; }

  auto setDynamic(bool dynamic) -> void {
    _dynamic = dynamic;
@@ -44,9 +44,9 @@ template<typename Cast, typename Type> struct Abstract : Setting {
    _modify = modify;
  }

-  inline auto modify(Type value) const -> void { if(_modify) return _modify(value); }
-  inline auto value() const -> Type { return _currentValue; }
-  inline auto latch() const -> Type { return _latchedValue; }
+  auto modify(Type value) const -> void { if(_modify) return _modify(value); }
+  auto value() const -> Type { return _currentValue; }
+  auto latch() const -> Type { return _latchedValue; }

  auto setModify(function<void (Type)> modify) {
    _modify = modify;
@@ -129,24 +129,64 @@ protected:
 struct Boolean : Abstract<Boolean, boolean> {
  DeclareClass(Boolean, "Boolean")
  using Abstract::Abstract;
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::Boolean>()) {
+      Object::copy(source);
+      setValue(source->value());
+      setLatch();
+    }
+  }
 };

 struct Natural : Abstract<Natural, natural> {
  DeclareClass(Natural, "Natural")
  using Abstract::Abstract;
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::Natural>()) {
+      Object::copy(source);
+      setValue(source->value());
+      setLatch();
+    }
+  }
 };

 struct Integer : Abstract<Integer, integer> {
  DeclareClass(Integer, "Integer")
  using Abstract::Abstract;
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::Integer>()) {
+      Object::copy(source);
+      setValue(source->value());
+      setLatch();
+    }
+  }
 };

 struct Real : Abstract<Real, real> {
  DeclareClass(Real, "Real")
  using Abstract::Abstract;
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::Real>()) {
+      Object::copy(source);
+      setValue(source->value());
+      setLatch();
+    }
+  }
 };

 struct String : Abstract<String, string> {
  DeclareClass(String, "String")
  using Abstract::Abstract;
+
+  auto copy(Node::Object object) -> void override {
+    if(auto source = object->cast<Node::String>()) {
+      Object::copy(source);
+      setValue(source->value());
+      setLatch();
+    }
+  }
 };
@@ -2,21 +2,21 @@ struct Screen : Object {
  DeclareClass(Screen, "Screen")
  using Object::Object;

-  inline auto width() const -> uint { return _width; }
-  inline auto height() const -> uint { return _height; }
-  inline auto scaleX() const -> double { return _scaleX; }
-  inline auto scaleY() const -> double { return _scaleY; }
-  inline auto aspectX() const -> double { return _aspectX; }
-  inline auto aspectY() const -> double { return _aspectY; }
-  inline auto colors() const -> uint { return _colors; }
+  auto width() const -> uint { return _width; }
+  auto height() const -> uint { return _height; }
+  auto scaleX() const -> double { return _scaleX; }
+  auto scaleY() const -> double { return _scaleY; }
+  auto aspectX() const -> double { return _aspectX; }
+  auto aspectY() const -> double { return _aspectY; }
+  auto colors() const -> uint { return _colors; }

-  inline auto saturation() const -> double { return _saturation; }
-  inline auto gamma() const -> double { return _gamma; }
-  inline auto luminance() const -> double { return _luminance; }
+  auto saturation() const -> double { return _saturation; }
+  auto gamma() const -> double { return _gamma; }
+  auto luminance() const -> double { return _luminance; }

-  inline auto colorBleed() const -> bool { return _colorBleed; }
-  inline auto interframeBlending() const -> bool { return _interframeBlending; }
-  inline auto rotation() const -> uint { return _rotation; }
+  auto colorBleed() const -> bool { return _colorBleed; }
+  auto interframeBlending() const -> bool { return _interframeBlending; }
+  auto rotation() const -> uint { return _rotation; }

  auto resetPalette() -> void;
  auto resetSprites() -> void;
@@ -2,12 +2,12 @@ struct Sprite : Object {
  DeclareClass(Sprite, "Sprite")
  using Object::Object;

-  inline auto visible() const -> bool { return _visible; }
-  inline auto x() const -> uint { return _x; }
-  inline auto y() const -> uint { return _y; }
-  inline auto width() const -> uint { return _width; }
-  inline auto height() const -> uint { return _height; }
-  inline auto image() const -> const uint32* { return _pixels.data(); }
+  auto visible() const -> bool { return _visible; }
+  auto x() const -> uint { return _x; }
+  auto y() const -> uint { return _y; }
+  auto width() const -> uint { return _width; }
+  auto height() const -> uint { return _height; }
+  auto image() const -> const uint32* { return _pixels.data(); }

  auto setVisible(bool visible) -> void;
  auto setPosition(uint x, uint y) -> void;
@@ -1,6 +1,6 @@
 #pragma once

-namespace higan {
+namespace ares {

 enum class Event : uint {
  None,
@@ -25,7 +25,7 @@ extern Platform* platform;

 }

-namespace higan::Core {
+namespace ares::Core {
  auto PlatformAttach(Node::Object node) -> void { if(platform && node->name()) platform->attach(node); }
  auto PlatformDetach(Node::Object node) -> void { if(platform && node->name()) platform->detach(node); }
  auto PlatformLog(string_view text) -> void { if(platform) platform->log(text); }
@@ -1,6 +1,6 @@
 #pragma once

-namespace higan {
+namespace ares {

 struct Random {
  enum class Entropy : uint { None, Low, High };
@@ -1,4 +1,7 @@
 namespace name=Resource
+  namespace name=Ares
+    binary name=Icon file=icon.png
+    binary name=Logo file=logo.png
  namespace name=Sprite
    namespace name=SuperFamicom
      binary name=CrosshairBlue file=sprite/sfc/crosshair-blue.png