initial commit

9 files changed, 1731 insertions, 0 deletions

diff --git a/LICENSE b/LICENSE
new file mode 100644
index 0000000..346a1ba
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,675 @@
+              GNU GENERAL PUBLIC LICENSE
+                Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://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 <http://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
+<http://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
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
diff --git a/Main.hs b/Main.hs
new file mode 100644
index 0000000..354bc82
--- /dev/null
+++ b/Main.hs
@@ -0,0 +1,28 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+import           SHARC.Kernel
+import           System.Environment (getArgs)
+import qualified Data.ByteString.Lazy as B
+
+main :: IO ()
+main = do
+  args <- getArgs
+  contents <- B.readFile (head args)
+  printKernel contents
diff --git a/SHARC/ComputeField.hs b/SHARC/ComputeField.hs
new file mode 100644
index 0000000..d82d75f
--- /dev/null
+++ b/SHARC/ComputeField.hs
@@ -0,0 +1,210 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+{-# LANGUAGE QuasiQuotes #-}
+
+module SHARC.ComputeField where
+
+import           SHARC.Types
+import           SHARC.Word48
+
+import           Language.Literals.Binary
+import           Data.Map (fromList, findWithDefault)
+import           Data.Word (Word8, Word16, Word64)
+import           Data.Bits ((.&.), (.|.), shift, shiftL, shiftR)
+import           Text.Printf (printf)
+
+{-
+The Compute Field
+
+See page 6-1 for full description.
+
+The compute field of an instruction is 23 bit wide and structured like this:
+
+1 unused bit
+2 CU bits (00=ALU, 01=Multiplier, 10=Shifter)
+8 bit opcode
+3 register addresses (result, x operand, y operand), each 4 bit wide
+-}
+
+-- 23 bit compute field
+data ComputeField = ComputeField
+                    { compFieldCU     :: ComputationUnit
+                    , compFieldOpCode :: OpCode
+                    , compFieldRn     :: Dreg
+                    , compFieldRx     :: Dreg
+                    , compFieldRy     :: Dreg
+                    }
+
+data ComputationUnit = ALU | Multiplier | Shifter deriving Show
+type OpCode = Word8
+
+mkComputeField :: Word48 -> ComputeField
+mkComputeField w = ComputeField cu op rn rx ry
+  where
+    word64 = word48ToWord64 w
+    w' = word64 `cutMask` 0x000000FFFFFF
+    cu = case w' `cutMask` [b| 011 0000 0000 0000 0000 0000 |] of
+      0 -> ALU
+      1 -> Multiplier
+      2 -> Shifter
+    op = w' `cutMask` [b| 000 1111 1111 0000 0000 0000 |]
+    rn = mkDreg $ w' `cutMask` [b| 000 0000 0000 1111 0000 0000 |]
+    rx = mkDreg $ w' `cutMask` [b| 000 0000 0000 0000 1111 0000 |]
+    ry = mkDreg $ w' `cutMask` [b| 000 0000 0000 0000 0000 1111 |]
+
+instance Show ComputeField where
+  show cf = printer rn rx ry
+    where
+      dict = case compFieldCU cf of
+        ALU        -> opCodesALU
+        Multiplier -> opCodesMultiplier
+        Shifter    -> opCodesShifter
+      rn = show (compFieldRn cf)
+      rx = show (compFieldRx cf)
+      ry = show (compFieldRy cf)
+      def = rawPrintCF (show (compFieldCU cf)) (compFieldOpCode cf)
+      rawPrintCF cu op rn rx ry = printf "[%s] %s = %s [0x%02X] %s" cu rn rx op ry
+      printer = findWithDefault def (compFieldOpCode cf) dict
+
+-- special type for Type 6 instruction
+type ShiftOp = Word8
+data ImmediateShift = ImmediateShift
+                      ShiftOp {-6 bits-}
+                      Word16 {-dependent on shiftop: either 6 bit shift value + 6 bit length; or 8 bit value-}
+                      Dreg {-4 bit Rn register-}
+                      Dreg {-4 bit Rx register-}
+
+-- TODO
+instance Show ImmediateShift where
+  show (ImmediateShift op dat rn rx) =
+    "[" ++ show rn ++ " = " ++ printf "0x%02X" op ++ " " ++ show rx ++ " data:" ++ printf "0x%02X" dat ++ "]"
+
+
+
+opCodesALU = fromList
+  -- fixed point ALU operations (table 6-1)
+  [ (0, \n x y -> "") -- print nothing if the opcode is empty
+  , ([b| 0000 0001 |], \n x y -> n ++ " = " ++ x ++ " + " ++ y)                -- Rn = Rx + Ry
+  , ([b| 0000 0010 |], \n x y -> n ++ " = " ++ x ++ " - " ++ y)                -- Rn = Rx – Ry
+  , ([b| 0000 0101 |], \n x y -> n ++ " = " ++ x ++ " + " ++ y ++ " + CI")     -- Rn = Rx + Ry + CI
+  , ([b| 0000 0110 |], \n x y -> n ++ " = " ++ x ++ " - " ++ y ++ " + CI - 1") -- Rn = Rx – Ry + CI – 1
+  , ([b| 0000 1001 |], \n x y -> n ++ " = (" ++ x ++ " + " ++ y ++ ")/2")      -- Rn = (Rx + Ry)/2
+  , ([b| 0000 1010 |], \n x y -> "COMP("  ++ x ++ ", " ++ y ++ ")")            -- COMP(Rx, Ry)
+  , ([b| 0000 1011 |], \n x y -> "COMPU(" ++ x ++ ", " ++ y ++ ")")            -- COMPU(Rx, Ry)
+  , ([b| 0010 0101 |], \n x y -> n ++ " = " ++ x ++ " + CI")                   -- Rn = Rx + CI
+  , ([b| 0010 0110 |], \n x y -> n ++ " = " ++ x ++ " + CI - 1")               -- Rn = Rx + CI – 1
+  , ([b| 0010 1001 |], \n x y -> n ++ " = " ++ x ++ " + 1")                    -- Rn = Rx + 1
+  , ([b| 0010 1010 |], \n x y -> n ++ " = " ++ x ++ " - 1")                    -- Rn = Rx – 1
+  , ([b| 0010 0010 |], \n x y -> n ++ " = - " ++ x)                            -- Rn = – Rx
+  , ([b| 0011 0000 |], \n x y -> n ++ " = ABS " ++ x)                          -- Rn = ABS Rx
+  , ([b| 0010 0001 |], \n x y -> n ++ " = PASS " ++ x)                         -- Rn = PASS Rx
+  , ([b| 0100 0000 |], \n x y -> n ++ " = " ++ x ++ " AND " ++ y)              -- Rn = Rx AND Ry
+  , ([b| 0100 0001 |], \n x y -> n ++ " = " ++ x ++ " OR " ++ y)               -- Rn = Rx OR Ry
+  , ([b| 0100 0010 |], \n x y -> n ++ " = " ++ x ++ " XOR " ++ y)              -- Rn = Rx XOR Ry
+  , ([b| 0100 0011 |], \n x y -> n ++ " = NOT " ++ x)                          -- Rn = NOT Rx
+  , ([b| 0110 0001 |], \n x y -> n ++ " = MIN(" ++ x ++ ",  " ++ y ++ ")")     -- Rn = MIN(Rx, Ry)
+  , ([b| 0110 0010 |], \n x y -> n ++ " = MAX(" ++ x ++ ", " ++ y ++ ")")      -- Rn = MAX(Rx, Ry)
+  , ([b| 0110 0011 |], \n x y -> n ++ " = CLIP " ++ x ++ " BY " ++ y)          -- Rn = CLIP Rx BY Ry
+  -- floating-point ALU operations (table 6-2)
+  , ([b| 1000 0001 |], \n x y -> n ++ " = " ++ x ++ " + " ++ y)                -- Fn = Fx + Fy
+  , ([b| 1000 0010 |], \n x y -> n ++ " = " ++ x ++ " - " ++ y)                -- Fn = Fx – Fy
+  , ([b| 1001 0001 |], \n x y -> n ++ " = ABS (" ++ x ++ " + " ++ y ++ ")")    -- Fn = ABS (Fx + Fy)
+  , ([b| 1001 0010 |], \n x y -> n ++ " = ABS (" ++ x ++ " - " ++ y ++ ")")    -- Fn = ABS (Fx – Fy)
+  , ([b| 1000 1001 |], \n x y -> n ++ " = (" ++ x ++ " + " ++ y ++ ")/2")      -- Fn = (Fx + Fy)/2
+  , ([b| 1000 1010 |], \n x y -> n ++ " = COMP(" ++ x ++ ", " ++ y ++ ")")     -- Fn = COMP(Fx, Fy)
+  , ([b| 1010 0010 |], \n x y -> n ++ " = -" ++ x)                             -- Fn = –Fx
+  , ([b| 1011 0000 |], \n x y -> n ++ " = ABS " ++ x)                          -- Fn = ABS Fx
+  , ([b| 1010 0001 |], \n x y -> n ++ " = PASS " ++ x)                         -- Fn = PASS Fx
+  , ([b| 1010 0101 |], \n x y -> n ++ " = RND " ++ x)                          -- Fn = RND Fx
+  , ([b| 1011 1101 |], \n x y -> n ++ " = SCALB " ++ x ++ " BY " ++ y)         -- Fn = SCALB Fx BY Ry
+  , ([b| 1010 1101 |], \n x y -> n ++ " = MANT " ++ x)                         -- Rn = MANT Fx
+  , ([b| 1100 0001 |], \n x y -> n ++ " = LOGB " ++ x)                         -- Rn = LOGB Fx
+  , ([b| 1101 1001 |], \n x y -> n ++ " = FIX " ++ x ++ " BY " ++ y)           -- Rn = FIX Fx BY Ry
+  , ([b| 1100 1001 |], \n x y -> n ++ " = FIX " ++ x)                          -- Rn = FIX Fx
+  , ([b| 1101 1101 |], \n x y -> n ++ " = TRUNC " ++ x ++ " BY " ++ y)         -- Rn = TRUNC Fx BY Ry
+  , ([b| 1100 1101 |], \n x y -> n ++ " = TRUNC " ++ x)                        -- Rn = TRUNC Fx
+  , ([b| 1101 1010 |], \n x y -> n ++ " = FLOAT " ++ x ++ " BY " ++ y)         -- Fn = FLOAT Rx BY Ry
+  , ([b| 1100 1010 |], \n x y -> n ++ " = FLOAT " ++ x)                        -- Fn = FLOAT Rx
+  , ([b| 1100 0100 |], \n x y -> n ++ " = RECIPS " ++ x)                       -- Fn = RECIPS Fx
+  , ([b| 1100 0101 |], \n x y -> n ++ " = RSQRTS " ++ x)                       -- Fn = RSQRTS Fx
+  , ([b| 1110 0000 |], \n x y -> n ++ " = " ++ x ++ " COPYSIGN " ++ y)         -- Fn = Fx COPYSIGN Fy
+  , ([b| 1110 0001 |], \n x y -> n ++ " = MIN(" ++ x ++ ", " ++ y ++ ")")      -- Fn = MIN(Fx, Fy)
+  , ([b| 1110 0010 |], \n x y -> n ++ " = MAX(" ++ x ++ ", " ++ y ++ ")")      -- Fn = MAX(Fx, Fy)
+  , ([b| 1110 0011 |], \n x y -> n ++ " = CLIY " ++ x ++ " BY " ++ y)          -- Fn = CLIP Fx BY Fy
+  ]
+
+
+opCodesMultiplier = fromList []  -- TODO
+{-
+-- fixed-point multiplier operations (table 6-3)
+-- TODO: check table 6-5 and table 6-6 for y/x/f/r flags
+[b| 01yx f00r ] -- on page 6-56 -- Rn = Rx*Ry mod2
+[b| 01yx f10r ] -- on page 6-56 -- MRF = Rx*Ry mod2
+[b| 01yx f11r ] -- on page 6-56 -- MRB = Rx*Ry mod2
+[b| 10yx f00r ] -- on page 6-57 -- Rn = MRF +Rx*Ry mod2
+[b| 10yx f01r ] -- on page 6-57 -- Rn = MRB +Rx*Ry mod2
+[b| 10yx f10r ] -- on page 6-57 -- MRF = MRF +Rx*Ry mod2
+[b| 10yx f11r ] -- on page 6-57 -- MRB = MRB +Rx*Ry mod2
+[b| 11yx f00r ] -- on page 6-58 -- Rn = MRF –Rx*Ry mod2
+[b| 11yx f01r ] -- on page 6-58 -- Rn = MRB –Rx*Ry mod2
+[b| 11yx f10r ] -- on page 6-58 -- MRF = MRF –Rx*Ry mod2
+[b| 11yx f11r ] -- on page 6-58 -- MRB = MRB –Rx*Ry mod2
+[b| 0000 f00x ] -- on page 6-59 -- Rn = SAT MRF mod1
+[b| 0000 f01x ] -- on page 6-59 -- Rn = SAT MRB mod1
+[b| 0000 f10x ] -- on page 6-59 -- MRF = SAT MRF mod1
+[b| 0000 f11x ] -- on page 6-59 -- MRB = SAT MRB mod1
+[b| 0001 100x ] -- on page 6-60 -- Rn =RND MRF mod1
+[b| 0001 101x ] -- on page 6-60 -- Rn = RND MRB mod1
+[b| 0001 110x ] -- on page 6-60 -- MRF = RND MRF mod1
+[b| 0001 111x ] -- on page 6-60 -- MRB = RND MRB mod1
+[b| 0001 0100 ] -- on page 6-61 -- MRF = 0
+[b| 0001 0110r ] -- on page 6-61 -- MRB = 0
+-- MR = Rn on page 6-62
+-- Rn = MR on page 6-62
+
+-- floating-point multiplier operations (table 6-4)
+[b| 0011 0000 ] -- on page 6-64 -- Fn = Fx*Fy
+-}
+
+
+opCodesShifter = fromList
+  -- shifter operations (table 6-8)
+  [ ([b| 0000 0000 |], \n x y -> n ++ " = LSHIFT " ++ x ++ " BY " ++ y)               -- Rn = LSHIFT Rx BY Ry|<data8>
+  , ([b| 0010 0000 |], \n x y -> n ++ " = OR LSHIFT " ++ x ++ " BY " ++ y)            -- Rn = Rn OR LSHIFT Rx BY Ry|<data8>
+  , ([b| 0000 0100 |], \n x y -> n ++ " = ASHIFT " ++ x ++ " BY " ++ y)               -- Rn = ASHIFT Rx BY Ry|<data8>
+  , ([b| 0010 0100 |], \n x y -> n ++ " = " ++ n ++ " OR ASHIFT " ++ x ++ " BY "++ y) -- Rn = Rn OR ASHIFT Rx BY Ry|<data8>
+  , ([b| 0000 1000 |], \n x y -> n ++ " = ROT " ++ x ++ " BY " ++ y)                  -- Rn = ROT Rx BY Ry|<data8>
+  , ([b| 1100 0100 |], \n x y -> n ++ " = BCLR " ++ x ++ " BY " ++ y)                 -- Rn = BCLR Rx BY Ry|<data8>
+  , ([b| 1100 0000 |], \n x y -> n ++ " = BSET " ++ x ++ " BY " ++ y)                 -- Rn = BSET Rx BY Ry|<data8>
+  , ([b| 1100 1000 |], \n x y -> n ++ " = BTGL " ++ x ++ " BY " ++ y)                 -- Rn = BTGL Rx BY Ry|<data8>
+  , ([b| 1100 1100 |], \n x y -> "BTST " ++ x ++ " BY " ++ y)                         -- BTST Rx BY Ry|<data8>
+  , ([b| 0100 0100 |], \n x y -> n ++ " = FDEP " ++ x ++ " BY " ++ y)                 -- Rn = FDEP Rx BY Ry|<bit6>:<len6>
+  , ([b| 0110 0100 |], \n x y -> n ++ " = " ++ n ++ " OR FDEP " ++ x ++ " BY " ++ y)  -- Rn = Rn OR FDEP Rx BY Ry|<bit6>:<len6>
+  , ([b| 0100 1100 |], \n x y -> n ++ " = FDEP " ++ x ++ " BY " ++ y)                 -- Rn = FDEP Rx BY Ry|<bit6>:<len6> (SE)
+  , ([b| 0110 1100 |], \n x y -> n ++ " = " ++ n ++ " OR FDEP " ++ x ++ " BY " ++ y)  -- Rn = Rn OR FDEP Rx BY Ry|<bit6>:<len6>(SE)
+  , ([b| 0100 0000 |], \n x y -> n ++ " = FEXT " ++ x ++ " BY " ++ y)                 -- Rn = FEXT RX BY Ry|<bit6>:<len6>
+  , ([b| 0100 1000 |], \n x y -> n ++ " = FEXT " ++ x ++ " BY " ++ y ++ " (SE)")      -- Rn = FEXT Rx BY Ry|<bit6>:<len6> (SE)
+  , ([b| 1000 0000 |], \n x y -> n ++ " = EXP " ++ x)                                 -- Rn = EXP Rx
+  , ([b| 1000 0100 |], \n x y -> n ++ " = EXP " ++ x ++ " (EX)")                      -- Rn = EXP Rx (EX)
+  , ([b| 1000 1000 |], \n x y -> n ++ " = LEFTZ " ++ x)                               -- Rn = LEFTZ Rx
+  , ([b| 1000 1100 |], \n x y -> n ++ " = LEFTO " ++ x)                               -- Rn = LEFTO Rx
+  , ([b| 1001 0000 |], \n x y -> n ++ " = FPACK " ++ x)                               -- Rn = FPACK Fx
+  , ([b| 1001 0100 |], \n x y -> n ++ " = FUNPACK " ++ x)                             -- Fn = FUNPACK Rx
+  ]
diff --git a/SHARC/Instruction.hs b/SHARC/Instruction.hs
new file mode 100644
index 0000000..5c3b1bf
--- /dev/null
+++ b/SHARC/Instruction.hs
@@ -0,0 +1,500 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+{-# LANGUAGE QuasiQuotes #-}
+
+module SHARC.Instruction where
+
+import           SHARC.Types
+import           SHARC.Word48
+import           SHARC.ComputeField
+
+import           Language.Literals.Binary
+import           Data.Bits ((.&.), (.|.), xor, shift, shiftL, shiftR, testBit)
+import           Data.Word
+import           Data.List (intercalate)
+import           Text.Printf (printf)
+import           Data.Binary.Get
+
+
+data Instruction = Type1 Word48
+                 | Type2 Cond ComputeField
+                 | Type3
+                   Cond
+                   ComputeField
+                   Ireg
+                   Mreg
+                   Ureg
+                   AccessType
+                   Memory
+                   WordAccess
+                   Update
+                 | Type4
+                   Cond
+                   ComputeField
+                   Word8 {-6 bit data-}
+                   Dreg
+                   Ireg
+                   AccessType
+                   Memory
+                   Update
+                 | Type5Transfer
+                   Cond
+                   ComputeField
+                   Ureg {-source register, 7 bit-}
+                   Ureg {-destination register, 7 bit-}
+                 | Type5Swap
+                   Cond
+                   ComputeField
+                   Dreg {-x, 4 bit-}
+                   Dreg {-y, 4 bit-}
+                 | Type6WithDataAccess -- with data access
+                   Cond
+                   ImmediateShift
+                   Dreg
+                   Ireg
+                   Mreg
+                   AccessType
+                   Memory
+                 | Type6WithoutDataAccess -- without data access
+                   Cond
+                   ImmediateShift
+                 | Type7 Word48
+                 | Type8
+                   BranchType
+                   Cond
+                   Address24
+                   Bool {-loop abort-}
+                   Bool {-branch delayed or not-}
+                   Bool {-clear interrupt-}
+                 | Type9 Word48
+                 | Type10 Word48
+                 | Type11
+                   ReturnSource {- subroutine or interrupt -}
+                   Cond
+                   Bool {-return delayed or not-}
+                   Bool {-else clause used or not-}
+                   Bool {-loop reentry modifier specified or not-}
+                   ComputeField
+                 | Type12Ureg Ureg Address24
+                 | Type12Immediate Word16 Address24
+                 | Type13 TermCond Address24
+                 | Type14 AccessType Memory WordAccess Ureg Address32
+                 | Type15 Word48
+                 | Type16 Word48
+                 | Type17 Ureg Word32
+                 | Type18 BitOp Sreg Word32
+                 | Type19 Word48
+                 | Type20
+                   ([String], [String]) {-list of pushes and pops-}
+                   Bool    {-cause a cash flush-}
+                 | NOP  -- Type 21
+                 | IDLE -- Type 22
+                 | Type25 Word48
+                 | UndefinedInstruction Word48
+                 | InvalidInstruction Word48
+
+instance Show Instruction where
+  show NOP  = "NOP"
+  show IDLE = "IDLE"
+  show (UndefinedInstruction w) = "!! UNDEFINED: " ++ show w
+  show (InvalidInstruction w)   = "!! INVALID: " ++ show w
+  show t = let f = printf "%-46s; %s" in case t of
+    Type1 w                  -> f (showType1 w) "type 1"
+    Type2{}                  -> f (showType2 t) "type 2"
+    Type3{}                  -> f (showType3 t) "type 3"
+    Type4{}                  -> f (showType4 t) "type 4"
+    Type5Transfer{}          -> f (showType5 t) "type 5 (transfer)"
+    Type5Swap{}              -> f (showType5 t) "type 5 (swap)"
+    Type6WithDataAccess{}    -> f (showType6 t) "type 6 (with data access)"
+    Type6WithoutDataAccess{} -> f (showType6 t) "type 6 (without data access)"
+    Type7 w                  -> f (showType7 w) "type 7"
+    Type8{}                  -> f (showType8 t) "type 8"
+    Type9 w                  -> f (showType9 w) "type 9"
+    Type10 w                 -> f (showType10 w) "type 10"
+    Type11{}                 -> f (showType11 t) "type 11"
+    Type12Immediate{}        -> f (showType12 t) "type 12 (immediate)"
+    Type12Ureg{}             -> f (showType12 t) "type 12 (from ureg)"
+    Type13{}                 -> f (showType13 t) "type 13"
+    Type14{}                 -> f (showType14 t) "type 14"
+    Type15 w                 -> f (showType15 w) "type 15"
+    Type16 w                 -> f (showType16 w) "type 16"
+    Type17{}                 -> f (showType17 t) "type 17"
+    Type18{}                 -> f (showType18 t) "type 18"
+    Type19 w                 -> f (showType19 w) "type 19"
+    Type20{}                 -> f (showType20 t) "type 20"
+    Type25 w                 -> f (showType25 w) "type 25"
+
+
+showType1 w = "  TODO: " ++ show w
+
+showType2 (Type2 cond cf) = show cond ++ show cf
+
+showType3 (Type3 cond compute ireg mreg ureg rw mem wa up) =
+  show cond ++ show compute ++ assignment ++ flag
+  where
+    imOrder = case up of
+               PreModify -> [show mreg, show ireg]
+               PostModify -> [show ireg, show mreg]
+    pair = "(" ++ intercalate ", " imOrder ++ ")"
+    mem' = case mem of
+      Prog -> "PM" ++ pair
+      Data -> "DM" ++ pair
+    assignment = case rw of
+      Read  -> show ureg ++ "=" ++ mem'
+      Write -> mem' ++ "=" ++ show ureg
+    flag = case wa of
+      LW -> " (LW)"
+      _ -> ""
+
+showType4 (Type4 cond compute dat dreg ireg rw mem up) =
+  show cond ++ show compute ++ assignment
+  where
+    -- print 6 bit data as two's complement
+    dat' = if dat `testBit` 5
+           then '-' : show (dat `xor` 0x3F)
+           else show dat
+    order = case up of
+      PreModify -> [dat', show ireg]
+      PostModify -> [show ireg, dat']
+    pair = "(" ++ intercalate ", " order ++ ")"
+    mem' = case mem of
+      Prog -> "PM" ++ pair
+      Data -> "DM" ++ pair
+    assignment = case rw of
+      Read  -> show dreg ++ "=" ++ mem'
+      Write -> mem' ++ "=" ++ show dreg
+
+showType5 (Type5Transfer cond compute src dest) =
+  optional ++ sep ++ show dest ++ "=" ++ show src
+  where
+    optional = show cond ++ show compute
+    sep = if optional == "" then "" else ", "
+showType5 (Type5Swap cond compute x y) =
+  optional ++ sep ++ show x ++ "<->" ++ show y
+  where
+    optional = show cond ++ show compute
+    sep = if optional == "" then "" else ", "
+
+showType6 (Type6WithDataAccess cond shiftField dreg ireg mreg rw mem) =
+  show cond ++ show shiftField ++ assignment
+  where
+    pair = "(" ++ intercalate ", " [show ireg, show mreg] ++ ")"
+    mem' = case mem of
+      Prog -> "PM" ++ pair
+      Data -> "DM" ++ pair
+    assignment = case rw of
+      Read  -> show dreg ++ "=" ++ mem'
+      Write -> mem' ++ "=" ++ show dreg
+
+showType6 (Type6WithoutDataAccess cond shiftField) =
+  show cond ++ show shiftField
+
+showType7 w = "  TODO: " ++ show w
+
+-- TODO: if Call, ignore LA and CI
+-- TODO: flag handling is ugly
+showType8 (Type8 t cond addr a d c) = show cond ++ t' ++ flags
+  where
+    t' = case t of
+      Jump -> "JUMP " ++ show addr
+      Call -> "CALL " ++ show addr
+    a' = if a then "LA" else ""
+    d' = if d then "DB" else ""
+    c' = if c then "CI" else ""
+    flags = if a || d || c
+            then " (" ++ intercalate ", " (filter (/= "") [a', d', c']) ++ ")"
+            else ""
+
+showType9 w = "  TODO: " ++ show w
+
+showType10 w = "  TODO: " ++ show w
+
+showType11 (Type11 rs cond d e l cf) = show cond ++ rs' ++ flags ++ elseCompute
+  where
+    rs' = case rs of
+      Subroutine -> "RTS"
+      Interrupt  -> "RTI"
+    -- TODO: this is ugly
+    d' = if d then "DB" else ""
+    l' = if l then "LR" else ""
+    flags = if d || l
+            then " (" ++ intercalate ", " (filter (/= "") [d', l']) ++ ")"
+            else ""
+    e' = if e then ", ELSE " else ", "
+    -- do not print at all if opcode in compute field is empty
+    -- TODO: can this be encoded in the type instead of doing an ugly string comparison?
+    elseCompute = if show cf == "" then "" else e' ++ show cf
+
+showType12 (Type12Immediate dat reladdr) =
+  "LNCTR=" ++ show dat ++ ", DO " ++ show reladdr ++ " UNTIL LCE"
+showType12 (Type12Ureg ureg reladdr) =
+  "LNCTR=" ++ show ureg ++ ", DO " ++ show reladdr ++ " UNTIL LCE"
+
+showType13 (Type13 term reladdr) =
+  "DO " ++ show reladdr ++ " UNTIL " ++ show term
+
+showType14 (Type14 rw mem wa ureg addr) = lhs ++ " = " ++ rhs ++ lwflag
+  where
+    lwflag = case wa of
+              LW -> " (LW)"
+              _ -> ""
+    memloc = case mem of
+              Data -> "DM(" ++ show addr ++ ")"
+              Prog -> "PM(" ++ show addr ++ ")"
+    lhs = case rw of
+           Write -> memloc
+           Read  -> show ureg
+    rhs = case rw of
+           Write -> show ureg
+           Read  -> memloc
+
+showType15 w = "  TODO: " ++ show w
+
+showType16 w = "  TODO: " ++ show w
+
+showType17 (Type17 ureg dat) = show ureg ++ " = " ++ printf "0x%08X" dat
+
+showType18 (Type18 bop sreg w) =
+  "BIT " ++ show bop ++ " " ++ show sreg ++ " " ++ printf "0x%08X" w
+
+showType19 w = "  TODO: " ++ show w
+
+showType20 (Type20 (pushes,pops) fc) = intercalate ", " (pu ++ po ++ [flush])
+  where
+    pu = map (\x -> "PUSH " ++ x) pushes
+    po = map (\x -> "POP "  ++ x) pops
+    flush = if fc then "FLUSH CACHE" else ""
+
+showType25 w = "  TODO: " ++ show w
+
+
+
+-- TODO
+parseType1 = Type1
+
+parseType2 w = Type2 cond (mkComputeField w)
+  where
+    cond = mkCond w
+
+parseType3 w = Type3 cond compute ireg mreg ureg rw mem wa up
+  where
+    w64 = word48ToWord64 w
+    cond = mkCond w
+    compute = mkComputeField w
+    ireg = mkIreg $ w64 `cutMask` [b| 000 0 111 000 00000 000 0000000 0000000 00000000 00000000 |]
+    mreg = mkMreg $ w64 `cutMask` [b| 000 0 000 111 00000 000 0000000 0000000 00000000 00000000 |]
+    ureg = mkUreg $ w64 `cutMask` [b| 000 0 000 000 00000 000 1111111 0000000 00000000 00000000 |]
+    rw   = if w64 `testBit` 31 then Read else Write
+    mem  = if w64 `testBit` 32 then Data else Prog
+    wa   = if w64 `testBit` 30 then LW else NW
+    up   = if w64 `testBit` 44 then PostModify else PreModify
+
+parseType4 w = Type4 cond compute dat dreg ireg rw mem up
+  where
+    w64 = word48ToWord64 w
+    cond = mkCond w
+    compute = mkComputeField w
+    dat  = w64 `cutMask` 0x0001F8000000
+    dreg = mkDreg $ w64 `cutMask` 0x000007800000
+    ireg = mkIreg $ w64 `cutMask` [b| 000 0 111 000 00000 000 0000000 0000000 00000000 00000000 |]
+    rw   = if w64 `testBit` 39 then Read else Write
+    mem  = if w64 `testBit` 40 then Data else Prog
+    up   = if w64 `testBit` 38 then PostModify else PreModify
+
+parseType5 w = if w64 `testBit` 43
+               then let
+                 x = mkDreg $ w64 `cutMask` 0x000007800000
+                 y = mkDreg $ w64 `cutMask` 0x03C000000000
+                 in Type5Swap cond compute x y
+               else let
+                 src  = mkUreg $ ((w64 `cutMask` 0x07C000000000) `shiftL` 2) .|. (w64 `cutMask` 0x000180000000)
+                 dest = mkUreg $ w64 `cutMask` 0x00003F800000
+                 in Type5Transfer cond compute src dest
+  where
+    w64 = word48ToWord64 w
+    cond = mkCond w
+    compute = mkComputeField w
+
+parseType6 w = if w64 `testBit` 47
+               then let -- with data access
+                 dreg = mkDreg $ w64 `cutMask` [b| 0000 000 000 00000 00 0000 1111 0 000000 00000000 0000 0000 |]
+                 ireg = mkIreg $ w64 `cutMask` [b| 0000 111 000 00000 00 0000 0000 0 000000 00000000 0000 0000 |]
+                 mreg = mkMreg $ w64 `cutMask` [b| 0000 000 111 00000 00 0000 0000 0 000000 00000000 0000 0000 |]
+                 rw   = if w64 `testBit` 31 then Read else Write
+                 mem  = if w64 `testBit` 32 then Data else Prog
+                 in
+                  Type6WithDataAccess cond shiftField dreg ireg mreg rw mem
+               else -- without data access
+                 Type6WithoutDataAccess cond shiftField
+  where
+    w64 = word48ToWord64 w
+    cond = mkCond w
+    shiftField = ImmediateShift op dat rn rx
+    op  = w64 `cutMask` 0x0000003F0000
+    dat = (w64 `cutMask` 0x000078000000) `shiftL` 8 .|. (w64 `cutMask` 0x00000000FF00)
+    rn = Dreg $ w64 `cutMask` 0xF0
+    rx = Dreg $ w64 `cutMask` 0x0F
+
+-- TODO
+parseType7 = Type7
+
+parseType8 :: (Word32 -> Address24) -> Word48 -> Instruction
+parseType8 addressConstr w = Type8 t cond addr a d c
+  where
+    w64 = word48ToWord64 w
+    t = if w64 `testBit` 39 then Jump else Call
+    cond = mkCond w
+    addr = addressConstr $ w64 `cutMask` 0x000000FFFFFF
+    a = w64 `testBit` 38 -- loop abort
+    d = w64 `testBit` 26 -- branch delayed or not
+    c = w64 `testBit` 24 -- clear interrupt
+
+-- TODO
+parseType9 = Type9
+
+-- TODO
+parseType10 = Type10
+
+parseType11 rs w = Type11 rs cond d e l cf where
+    cond = mkCond w
+    w64 = word48ToWord64 w
+    d = w64 `testBit` 26 -- return delayed
+    e = w64 `testBit` 25 -- else clause
+    l = w64 `testBit` 24 -- loop reentry
+    cf = mkComputeField w
+
+parseType12 w = if w64 `testBit` 40
+                then let -- loop counter load from a Ureg
+                  ureg = mkUreg $ w64 `cutMask` 0x007F00000000
+                  in Type12Ureg ureg reladdr
+                else let -- immediate loop counter load
+                  dat = w64 `cutMask` 0x00FFFF000000
+                  in Type12Immediate dat reladdr
+  where
+    w64 = word48ToWord64 w
+    reladdr = RelAddress24 $ w64 `cutMask` 0xFFFFFF -- lowest 24 bit
+
+parseType13 w = Type13 term reladdr
+  where
+    w64 = word48ToWord64 w
+    term = mkTermCond w
+    reladdr = RelAddress24 $ w64 `cutMask` 0xFFFFFF -- lowest 24 bit
+
+parseType14 w = Type14 rw mem wa ureg addr
+  where
+    w64 = word48ToWord64 w
+    rw   = if w64 `testBit` 40 then Read else Write
+    mem  = if w64 `testBit` 41 then Data else Prog
+    wa   = if w64 `testBit` 39 then LW   else NW
+    ureg = mkUreg $ w64 `cutMask` 0x00EF00000000
+    addr = Address32 $ w64 `cutMask` 0x0000FFFFFFFF
+
+-- TODO
+parseType15 = Type15
+parseType16 = Type16
+
+parseType17 w = Type17 ureg dat
+  where
+    w64 = word48ToWord64 w
+    dat = w64 `cutMask` 0x0000FFFFFFFF
+    ureg = mkUreg $ w64 `cutMask` 0x00EF00000000
+
+parseType18 w = Type18 bop sreg dat
+  where
+    w64 = word48ToWord64 w
+    dat = w64 `cutMask` 0x0000FFFFFFFF
+    bop = [ SET, CLR, TGL, TST, XOR ] !! (w64 `cutMask` 0x00E000000000)
+    sreg = mkSreg $ w64 `cutMask` 0x00FF00000000
+
+-- TODO
+parseType19 = Type19
+
+parseType20 w = Type20 (pushes, pops) fc
+  where
+    w64 = word48ToWord64 w
+    lpu = if w64 `testBit` 39 then "LOOP"  else ""
+    lpo = if w64 `testBit` 38 then "LOOP"  else ""
+    spu = if w64 `testBit` 37 then "STS"   else ""
+    spo = if w64 `testBit` 36 then "STS"   else ""
+    ppu = if w64 `testBit` 35 then "PCSTK" else ""
+    ppo = if w64 `testBit` 34 then "PCSTK" else ""
+    pushes = filter (/= "") [lpu, spu, ppu]
+    pops = filter (/= "") [lpo, spo, ppo]
+    fc = w64 `testBit` 33
+
+-- TODO
+parseType25 = Type25
+
+
+parseInstruction :: Word48 -> Instruction
+parseInstruction word =
+  let
+    w64 = word48ToWord64 word
+    b1 = (w64 `cutMask` 0xFF0000000000) :: Word8
+    b2 = (w64 `cutMask` 0x00FF00000000) :: Word8
+  in case fromIntegral b1 of
+   [b| 0000 0000 |] -> if b2 `testBit` 7
+                       then IDLE
+                       else NOP
+   [b| 0000 0001 |] -> parseType2 word
+   [b| 0000 0010 |] -> parseType6 word
+   [b| 0000 0011 |] -> UndefinedInstruction word
+   [b| 0000 0100 |] -> parseType7 word
+   [b| 0000 0101 |] -> UndefinedInstruction word
+   [b| 0000 0110 |] -> parseType8 Address24 word
+   [b| 0000 0111 |] -> parseType8 RelAddress24 word
+   [b| 0000 1000 |] -> parseType9 word
+   [b| 0000 1001 |] -> parseType9 word
+   [b| 0000 1010 |] -> parseType11 Subroutine word
+   [b| 0000 1011 |] -> parseType11 Interrupt word
+   [b| 0000 1100 |] -> parseType12 word
+   [b| 0000 1101 |] -> parseType12 word
+   [b| 0000 1110 |] -> parseType13 word
+   [b| 0000 1111 |] -> parseType17 word
+
+   [b| 0001 0100 |] -> parseType18 word
+   [b| 0001 0101 |] -> UndefinedInstruction word
+   [b| 0001 0110 |] -> parseType19 word
+   [b| 0001 0111 |] -> parseType20 word
+   [b| 0001 1000 |] -> parseType25 word
+
+   -- check six bit prefix
+   _ -> case b1 .&. 0xFC of
+     [b| 0001 0000 |] -> parseType14 word
+     -- check four bit prefix
+     _ -> case b1 .&. 0xF0 of
+       [b| 0110 0000 |] -> parseType4 word
+       [b| 0111 0000 |] -> parseType5 word
+       [b| 1000 0000 |] -> parseType6 word
+       [b| 1001 0000 |] -> parseType16 word
+       -- check three bit prefix
+       _ -> case b1 .&. 0xE0 of
+         [b| 001 00000 |] -> parseType1 word
+         [b| 010 00000 |] -> parseType3 word
+         [b| 101 00000 |] -> parseType15 word
+         [b| 110 00000 |] -> parseType10 word
+         [b| 111 00000 |] -> parseType10 word
+         _ -> InvalidInstruction word
+
+getInstruction :: Get Instruction
+getInstruction = fmap parseInstruction getPackedWord48
+
+printInstructionWithAddr :: (Word64, Instruction) -> IO ()
+printInstructionWithAddr (addr, instr) = printf "0x%05X: %s\n" addr (show instr)
diff --git a/SHARC/Kernel.hs b/SHARC/Kernel.hs
new file mode 100644
index 0000000..c074f36
--- /dev/null
+++ b/SHARC/Kernel.hs
@@ -0,0 +1,51 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+{-# LANGUAGE OverloadedStrings #-}
+
+module SHARC.Kernel where
+
+import           SHARC.Types
+import           SHARC.Word48
+import           SHARC.Instruction
+
+import           Control.Monad (replicateM,mapM_)
+import           Data.Word (Word64)
+import           Data.Binary.Get
+import qualified Data.ByteString.Lazy as B
+
+
+type Kernel = [Instruction]
+
+-- the boot kernel is 256 48-bit words long,
+-- each 48-bit is read as six 8-bit packages (LSB first)
+getKernel :: Get Kernel
+getKernel = replicateM 256 getInstruction
+
+parseKernel :: B.ByteString -> Kernel
+parseKernel = runGet getKernel
+
+-- p.609, hw.pdf
+-- ivt_start_address = 0x90000 :: Word64
+-- ivt_end_address   = 0x900ff :: Word64
+printKernel :: B.ByteString -> IO ()
+printKernel bs = mapM_ printInstructionWithAddr $ zip [offset..] kernel
+  where
+    offset = 0x90000 :: Word64
+    kernel = parseKernel bs
diff --git a/SHARC/Types.hs b/SHARC/Types.hs
new file mode 100644
index 0000000..47e4686
--- /dev/null
+++ b/SHARC/Types.hs
@@ -0,0 +1,184 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+module SHARC.Types where
+
+import           SHARC.Word48
+
+import           Data.Word
+import           Data.Map (fromList, findWithDefault)
+import           Data.Bits ((.&.), (.|.), xor, testBit, shift, shiftR)
+import           Text.Printf (printf)
+
+-- TODO: check other register assigments as well!  They may need to be shifted first.
+
+
+data Cond = Cond Word8
+-- the 5 bit condition codes are at an odd position in the byte, so we
+-- have to cut them out [ 00111110 ]
+-- TODO: valid values go from 0 to 31, restrict!
+mkCond :: Word48 -> Cond
+mkCond w = Cond $ w64 `cutMask` 0x003E00000000
+  where
+    w64 = word48ToWord64 w
+
+data TermCond = TermCond Word8
+-- the 5 bit condition codes are at an odd position in the byte, so we
+-- have to cut them out [ 00111110 ]
+-- TODO: valid values go from 0 to 31, restrict!
+mkTermCond :: Word48 -> TermCond
+mkTermCond w = TermCond $ w64 `cutMask` 0x003E00000000
+  where
+    w64 = word48ToWord64 w
+
+-- from table 1-4 (isr.pdf) "Conditional Execution Codes Summary"
+condCodes = [
+  "EQ",
+  "NE",
+  "GT",
+  "LT",
+  "GE",
+  "LE",
+  "AC",
+  "NOT AC",
+  "AV",
+  "NOT AV",
+  "MV",
+  "NOT MV",
+  "MS",
+  "NOT MS",
+  "SV",
+  "NOT SV",
+  "SZ",
+  "NOT SZ",
+  "TF",
+  "NOT TF",
+  "FLAG0_IN",
+  "NOT FLAG0_IN",
+  "FLAG1_IN",
+  "NOT FLAG1_IN",
+  "FLAG2_IN",
+  "NOT FLAG2_IN",
+  "FLAG3_IN",
+  "NOT FLAG3_IN",
+  "BM",
+  "NOT BM",
+  "NOT ICE",
+  "TRUE" ]
+
+condCodeMap = fromList $ zip [0..] condCodes
+termCodeMap = fromList $ zip [0..] $ (init . init) condCodes ++ ["LCE", "FOREVER"]
+
+instance Show Cond where
+  -- do not print if code is "TRUE" (31)
+  show (Cond n) = if n == 31 then ""
+                  else "IF " ++ findWithDefault (printf "0x%02X" n) n condCodeMap ++ " "
+
+instance Show TermCond where
+  show (TermCond n) = findWithDefault (printf "0x%02X" n) n termCodeMap
+
+
+data Ireg = Ireg Word8
+mkIreg :: Word8 -> Ireg
+mkIreg n = Ireg $ n .&. 0x07
+instance Show Ireg where
+  show (Ireg n) = printf "I%d" n
+
+data Mreg = Mreg Word8
+mkMreg :: Word8 -> Mreg
+mkMreg n = Mreg $ n .&. 0x07
+instance Show Mreg where
+  show (Mreg n) = printf "M%d" n
+
+-- TODO: see table 1-8 and 1-11 in isr.pdf
+-- 7 bit universal register
+data Ureg = Ureg Word8
+mkUreg :: Word8 -> Ureg
+mkUreg n = Ureg $ n .&. 0xEF
+instance Show Ureg where
+  show (Ureg n) = printf "0x%02X" n
+
+-- 4 bit system register
+data Sreg = Sreg Word8
+mkSreg :: Word8 -> Sreg
+mkSreg n = Sreg $ n .&. 0x0F
+instance Show Sreg where
+  show (Sreg n) = printf "0x%01X" n
+
+-- 4 bit data register
+data Dreg = Dreg Word8
+mkDreg :: Word8 -> Dreg
+mkDreg n = Dreg $ n .&. 0x0F
+instance Show Dreg where
+  show (Dreg n) = printf "R%d" n -- TODO: according to the docs this is R15-R0 *and* F15-F0
+
+data Address24 = Address24 Word32    -- absolute 24 bit address
+               | RelAddress24 Word32 -- relative 24 bit address
+data Address32 = Address32 Word32    -- absolute 32 bit address
+               | RelAddress32 Word32 -- relative 24 bit address
+
+instance Show Address24 where
+  show (Address24 w) = printf "0x%06X" w
+  show (RelAddress24 w) = printf "(PC,%s)" w' -- two's complement
+    where w' = if w `testBit` 23 then '-' : show (w `xor` 0xFFFFFF) else show w
+
+instance Show Address32 where
+  show (Address32 w) = printf "0x%08X" w
+  show (RelAddress32 w) = printf "(PC,%s)" w' -- two's complement
+    where w' = if w `testBit` 31 then '-' : show (w `xor` 0xFFFFFFFF) else show w
+
+
+toWord32 :: (Word8, Word8, Word8, Word8) -> Word32
+toWord32 (a,b,c,d) = fromIntegral a `shift` 24 .|.
+                     fromIntegral b `shift` 16 .|.
+                     fromIntegral c `shift`  8 .|.
+                     fromIntegral d
+
+data Update = PreModify -- 0, no update
+            | PostModify -- 1, with update
+
+-- TODO: check again Table 1-7 Opcode Acronyms to be sure that the mapping order is right!
+type PushPops = ([String], [String])
+
+data Memory = Data -- data memory
+            | Prog -- programme memory
+            deriving Show
+data AccessType = Read | Write  -- memory acces
+                deriving Show
+data WordAccess = NW | LW  -- LW forces a long word access when address is in normal word address
+                deriving Show
+
+data BranchAbsRel = Abs -- direct branch (absolute address)
+                  | Rel -- PC-relative branch
+                  deriving Show
+
+data BranchType = Jump
+                | Call
+                deriving Show
+
+data ReturnSource = Subroutine
+                  | Interrupt
+                  deriving Show
+
+data BitOp = SET
+           | CLR
+           | TGL
+           | TST
+           | XOR
+           deriving Show
diff --git a/SHARC/Word48.hs b/SHARC/Word48.hs
new file mode 100644
index 0000000..42e1075
--- /dev/null
+++ b/SHARC/Word48.hs
@@ -0,0 +1,58 @@
+{-
+  This file is part of shark-disassembler.
+
+  Copyright (C) 2014 Ricardo Wurmus
+
+  This program is free software: you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation, either version 3 of the License, or
+  (at your option) any later version.
+
+  This program is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  You should have received a copy of the GNU General Public License
+  along with this program.  If not, see <http://www.gnu.org/licenses/>.
+-}
+
+module SHARC.Word48 where
+
+import           Text.Printf (printf)
+import           Data.Word (Word8, Word64)
+import           Data.Bits ((.&.), (.|.), shiftL, shiftR, testBit)
+import           Data.Binary.Get
+import           Control.Monad (replicateM)
+
+data Word48 = Word48 (Word8, Word8, Word8, Word8, Word8, Word8)
+instance Show Word48 where
+  show (Word48 (a,b,c,d,e,f)) =
+    unwords $ map (printf "0x%02X") [a,b,c,d,e,f]
+
+unpackWord8Word48 :: [Word8] -> Word48
+unpackWord8Word48 [a,b,c,d,e,f] = Word48 (f,e,d,c,b,a)
+
+getWord48 :: ([Word8] -> Word48) -> Get Word48
+getWord48 p = fmap p $ replicateM 6 getWord8
+
+getPackedWord48 :: Get Word48
+getPackedWord48 = getWord48 unpackWord8Word48
+
+word48ToWord64 :: Word48 -> Word64
+word48ToWord64 (Word48 (a,b,c,d,e,f)) = fromIntegral a `shiftL` 40 .|.
+                                        fromIntegral b `shiftL` 32 .|.
+                                        fromIntegral c `shiftL` 24 .|.
+                                        fromIntegral d `shiftL` 16 .|.
+                                        fromIntegral e `shiftL`  8 .|.
+                                        fromIntegral f
+
+-- apply mask and shift result to the very right
+-- TODO: find a laxer type signature
+cutMask :: Integral n => Word64 -> Word64 -> n
+cutMask w mask = fromIntegral . fst $ until p shifter (w .&. mask, mask)
+  where
+    -- shift word by as much as we need to shift the mask to the very right
+    p (x, mask') = mask' `testBit` 0
+    shifter (x, m) = (x `shiftR` 1, m `shiftR` 1)
+
diff --git a/Setup.hs b/Setup.hs
new file mode 100644
index 0000000..9a994af
--- /dev/null
+++ b/Setup.hs
@@ -0,0 +1,2 @@
+import Distribution.Simple
+main = defaultMain
diff --git a/sharc-disassembler.cabal b/sharc-disassembler.cabal
new file mode 100644
index 0000000..bcc9178
--- /dev/null
+++ b/sharc-disassembler.cabal
@@ -0,0 +1,23 @@
+name:                sharc-disassembler
+version:             0.0.0.1
+synopsis:            disassembler for SHARC binaries
+-- description:
+homepage:            http://elephly.net
+license:             GPL-3
+license-file:        LICENSE
+author:              Ricardo Wurmus
+maintainer:          rekado plus code at elephly dot net
+-- copyright:
+category:            Disassembler
+build-type:          Simple
+cabal-version:       >=1.8
+
+Executable sharc-disassembler
+  Main-is:             Main.hs
+  build-depends:       base ==4.*,
+                       containers,
+                       text,
+                       binary,
+                       bytestring,
+                       binary-literal-qq
+