Inital commit

11 files changed, 3142 insertions, 0 deletions

diff --git a/COPYING b/COPYING
new file mode 100644
index 0000000..94a9ed0
--- /dev/null
+++ b/COPYING
@@ -0,0 +1,674 @@
+                    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/README.md b/README.md
new file mode 100644
index 0000000..dbd1e2b
--- /dev/null
+++ b/README.md
@@ -0,0 +1,388 @@
+# C TemplateS
+
+If you found this page using a search engine, you may be looking for the
+original [libctemplate](http://libctemplate.sourceforge.net) by Stephen C. Losen
+
+libctemplates is a template expander written for use with HTML. It's goals are
+to be simple, versitile, and fast. This is a library that started off as a
+fork of libctemplate, but eventually became a total rewrite. libctemplate,
+the original, was built primarily for cgi applications. It was tightly coupled
+with file streams, while libctemplate**s** allows you to output templates to
+strings for use in any application. If you think libctemplates is missing a
+feature, feel free to suggest it to
+[alexandermpickering@gmail.com](mailto://alexandermpickering@gmail),
+or, even better, write it yourself and send the patch! You can find
+instructions on createing and sending git patches [here](http://cogarr.net/source/cgit.cgi/?p=about)
+
+## Contents
+
+1. [Installation](#Installation)
+2. [Usage](#Usage)
+3. [Quick refrence](#Quick refernce)
+4. [Examples](#Examples)
+
+
+
+<section id="Installation"></section>
+## Installation
+
+Run the make file. libctemplates should compile on any system with a c99
+complient c compiler. If you are on linux, run `make; make install`.
+
+<section id="Usage"></section>
+## Usage
+
+Just include the ctemplates.h header and make sure you're linking against
+libctemplates.a
+
+<section id="Quick refrence"></section>
+## Quick refrence
+
+### Structs
+
+* struct TMPL\_templates  
+  Holds a template
+* struct TMPL\_varlist  
+  Holds a list of variables to be used when rendering a template
+  loops can be held in a varlist, and varlists can be held in loops.
+* struct TMPL\_loop  
+  Used to defien things to loop through in a varlist.
+
+### Functions
+
+	struct TMPL_templates* TMPL_alloc_template(char* template_string)
+
+Creates a template from the given string. This can be pretty expensive
+so try to only do it once for each template you need, and call render()
+as many times as you need on that template.
+
+	void TMPL_free_template(struct TMPL_templates* template)
+
+Frees a previously allocated template.
+
+	struct TMPL_varlist* TMPL_alloc_varlist()
+
+Allocates a variable list that you can add variables and loops to.
+
+	void TMPL_free_varlist(struct TMPL_varlist* varlist)
+
+Frees a previously allocated varlist, and any loops that have been added.
+
+	struct TMPL_loop* TMPL_alloc_loop()
+
+Allocates a loop that you can add varlists to.
+
+	void TMPL_free_loop(struct TMPL_loop* loop)
+
+Frees a previously allocated loop, and any varlists that have been added.
+
+	void TMPL_add_var_to_varlist(struct TMPL_varlist* vl, char* name, char* value)  
+
+Adds a variable to a variable list
+
+	void TMPL_add_loop_to_varlist(struct TMPL_varlist* vl,char* name,struct TMPL_loop* loop)  
+
+Adds a loop to a varlist
+
+	void TMPL_add_varlist_to_loop(struct TMPL_loop* l, struct TMPL_varlist* vl)  
+
+Adds a varlist that should be used one iteration through the loop
+
+	char* TMPL_render(struct TMPL_templates* t, struct TMPL_varlist* vl)  
+
+Turns a template and varlist into a string. the returned char\* should NOT be freed. The returned char\* is only valid until TMPL\_render() is called again. If you need it even after TMPL\_render() is called, copy it.
+
+<section id="Examples"></section>
+## Examples
+
+### Hello, World!
+
+At it's most simple, libctemplates just copies whatever template you give it.
+For example:
+
+*main.c*
+	
+	#include <ctemplate.h>
+	#include <stdio.h>
+	#include <stdlib.h>
+
+	char* template = "Hello, world!";
+
+	int main(){
+		struct TMPL_templates* t = TMPL_alloc_template(template);
+		if(t == NULL){
+			printf("Failed to compile\n");
+			exit(-1);
+		}
+		struct TMPL_varlist* vl = TMPL_alloc_varlist();
+		char* output = TMPL_render(t,vl);
+		printf("Output: %s\n",output);
+		TMPL_free_varlist(vl);
+		TMPL_free_template(t);
+		return 0;
+	}
+
+*output*
+
+	Output: Hello, world!
+
+### Variable substitution
+
+*template.html*
+
+	Value is:<TMPL_VAR name="varname" default="optional default">
+
+*main.c*
+
+	#include <ctemplate.h>
+
+	int main(){
+		/* 
+		It usually helps to seperate the template from the
+		C code. It does mean to need to read in a file though.
+		Try to only call TMPL_alloc_template once for each
+		template you have, and then use TMPL_render() whenever
+		you need to use them.
+		*/
+		FILE* fp = fopen("template.html","r");
+		if(fp == NULL){
+			printf("Failed to open file!\n");
+			exit(-1);
+		}
+		fseek(fp,0,SEEK_END);
+		size_t file_len = ftell(fp);
+		char template[file_len];
+		fread(template,sizeof(char),file_len,fp);
+
+		struct TMPL_templates* t;
+		struct TMPL_varlist* vl;
+
+		/*
+		Render the template without a variable named "varname"
+		This will use the variable's default, if it has one.
+		If the variable has no default, and is not supplied a value,
+		it errors, and stores a message that can be retrived with
+		TMPL_get_error(...)
+		*/
+		t = TMPL_alloc_template(template);
+		vl = TMPL_alloc_varlist();
+		char* without_variable = TMPL_render(t,vl);
+		printf("Without variable: %s\n",without_variable);
+		TMPL_free_template(t);
+		TMPL_free_varlist(vl);
+
+		/*
+		Now render a template with a variable, use the
+		TMPL_add_var_to_varlist(...) to supply the template with
+		variables.
+		*/
+		t = TMPL_alloc_template(template);
+		vl = TMPL_alloc_varlist();
+		TMPL_add_var_to_varlist(vl,"varname","Hello, world!");
+		char* with_variable = TMPL_render(t,vl);
+		printf("With variable:%s\n",with_variable);
+		TMPL_free_template(t);
+		TMPL_free_varlist(vl);
+
+		return 0;
+	}
+
+*output*
+
+	Without variable:
+	Value is:optional default
+
+
+	With variable:
+	Value is:Hello, world!
+
+### If/Elseif/Else
+
+If and elseif statements check if strings are the same. They do a strcmp(), so be mindful not to use really long strings if you don't need them.
+
+*template.html*
+
+	What happened:
+	<TMPL_IF name="varname" value="1234">
+		"varname" was "1234"
+	<TMPL_ELSEIF name="var2" value="pass">
+		"var2" was "pass"
+	<TMPL_ELSE>
+		"varname" was not "1234", and "var2" was not "pass"
+	<TMPL_END>
+
+*main.c*
+
+	#include <stdlib.h>
+	#include <stdio.h>
+	#include <ctemplate.h>
+
+	int main(){
+		/* 
+		Same as before, just read a file in
+		*/
+		FILE* fp = fopen("template.html","r");
+		if(fp == NULL){
+			printf("Failed to open file!\n");
+			exit(-1);
+		}
+		fseek(fp,0,SEEK_END);
+		size_t file_len = ftell(fp);
+		rewind(fp);
+		char template[file_len];
+		fread(template,sizeof(char),file_len,fp);
+
+		/*
+		No need to rebuild the template each time,
+		just alloc it once.
+		*/
+		struct TMPL_templates* t = TMPL_alloc_template(template);
+		struct TMPL_varlist* vl;
+
+		/*
+		If the variable the "if" or "elseif" is looking for dosn't exist,
+		the condition is considered false.
+		*/
+		vl = TMPL_alloc_varlist();
+		char* without_variable = TMPL_render(t,vl);
+		printf("Without variable:\n%s\n",without_variable);
+
+		/*
+		Add a variable to make the second condition true, and reprint
+		After we call TMPL_render() again, whatever pointer it returned
+		last time may have been freed. Be sure to copy it into your own
+		buffer if you still need it.
+		*/
+		TMPL_add_var_to_varlist(vl,"var2","pass");
+		char* with_one = TMPL_render(t,vl);
+		printf("With 1 variable:\n%s\n",TMPL_render(t,vl));
+
+		/*
+		Always be sure to free things!
+		*/
+		TMPL_free_varlist(vl);
+		TMPL_free_template(t);
+
+		return 0;
+	}
+
+*output*
+
+	Without variable:
+
+	What happened:
+		
+		"varname" was not "1234", and "var2" was not "pass"
+
+
+
+	With 1 variable:
+
+	What happened:
+	
+		"var2" was "pass"
+
+
+Notice that the tabs in the template are preserved in the output. This is not
+a minifier! Just a template expander!
+
+### Loops
+
+Loops are special in libctemplates, loops each have their own namespace, and 
+only variables that have been added to the namespace are acessable in the loop.
+
+*template.html*
+
+	What happened:
+	<TMPL_LOOP name="myloop">
+		This time through the loop, my variable is <TMPL_VAR name="loopvar">
+	<TMPL_END>
+
+
+*main.c*
+
+	#include <stdlib.h>
+	#include <stdio.h>
+	#include <ctemplate.h>
+
+	int main(){
+		/* 
+		Same as before
+		*/
+		FILE* fp = fopen("template.html","r");
+		if(fp == NULL){
+			printf("Failed to open file!\n");
+			exit(-1);
+		}
+		fseek(fp,0,SEEK_END);
+		size_t file_len = ftell(fp);
+		rewind(fp);
+		char template[file_len];
+		fread(template,sizeof(char),file_len,fp);
+
+		/*
+		Same as before
+		*/
+		struct TMPL_templates* t = TMPL_alloc_template(template);
+		struct TMPL_varlist* vl = TMPL_alloc_varlist();
+
+		/*
+		Now create a loop variable and add some things to it.
+		This is usually not as verbose as it looks here, since you'll
+		usually do this in a C loop.
+		*/
+		struct TMPL_loop* loop = TMPL_alloc_loop();
+
+		struct TMPL_varlist* first = TMPL_alloc_varlist();
+		TMPL_add_var_to_varlist(first,"loopvar","first");
+		TMPL_add_varlist_to_loop(loop,first);
+		
+		struct TMPL_varlist* second = TMPL_alloc_varlist();
+		TMPL_add_var_to_varlist(second,"loopvar","second");
+		TMPL_add_varlist_to_loop(loop,second);
+
+		struct TMPL_varlist* third = TMPL_alloc_varlist();
+		TMPL_add_var_to_varlist(third,"loopvar","third");
+		TMPL_add_varlist_to_loop(loop,third);
+
+		/*
+		Remember to add the loop to the varlist you'll eventually
+		pass to TMPL_render() with the correct name.
+		*/
+		TMPL_add_loop_to_varlist(vl,"myloop",loop);
+
+		char* output = TMPL_render(t,vl);
+		printf("Output:\n%s\n",output);
+
+		/*
+		When freeing a varlist, any loops it has are automatically
+		also freed. When freeing a loop, any varlists it contains
+		are also automatically freed. This means you only need to
+		free your top-level varlist!
+		*/
+		TMPL_free_varlist(vl);
+		TMPL_free_template(t);
+	}
+
+*output*
+
+	Output:
+	What happened:
+	This time through the loop, my variable is first
+	This time through the loop, my variable is second
+	This time through the loop, my variable is theird
+	Done!
+
+<!-- Some styleing, make it pretty! -->
+<style>
+body,html{
+	line-height:1.2;
+	font-size:18;
+	color:#333;
+}
+pre{
+	background-color:#eee;
+	padding:10;
+	border-radius:5;
+}
+</style>
diff --git a/ctemplate.c b/ctemplate.c
new file mode 100644
index 0000000..291c6f9
--- /dev/null
+++ b/ctemplate.c
@@ -0,0 +1,1063 @@
+/*
+ * C TemplateS : template expander
+ * Based on the original libctemplate by Stephen C. Losen
+ * 
+ * Version 0.1
+ *
+ * Copyright (c) 2017 Alexander M. Pickering (alexandermpickering@gmail.com)
+ *
+ * Distributed under the terms of the GNU General Public Liscense
+ * (GPL). See COPYING for more information.
+ *
+ */
+
+#include <string.h>
+#include <ctype.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <stdio.h>
+#include <sys/stat.h>
+#include <stdarg.h>
+#include <ctemplate_i.h>
+void TMPL_free_loop(struct TMPL_loop* tl);
+
+struct TMPL_token* TMPL_alloc_token(){
+	struct TMPL_token* ret = (struct TMPL_token*)malloc(sizeof(struct TMPL_token));
+	ret->next = NULL;
+	return ret;
+}
+
+void TMPL_free_token(struct TMPL_token* token){
+	struct TMPL_token* cursor = token;
+	while(cursor != NULL){
+		struct TMPL_token* this = cursor;
+		cursor = cursor->next;
+		free(this);
+	}
+}
+
+/*Check if it starts with the names of any of our tokens*/
+enum TMPL_tagtype starts_with_token(char* str, size_t strlen){
+	//printf("hit starts_with_token, \"%s\"\n",str);
+	//Make sure we get TMPL_ first
+	if(strlen < 5){
+		return tag_null;
+	}
+	if(*str != 'T'
+	|| *(str + 1) != 'M'
+	|| *(str + 2) != 'P'
+	|| *(str + 3) != 'L'
+	|| *(str + 4) != '_'){
+		//printf("Didn't even start with tmpl_\n");
+		return tag_null;
+	}
+	//printf("Did start with tmpl\n");
+	if(strlen > TAG_VAR_LENGTH
+	&& *(str + 5) == 'V'
+	&& *(str + 6) == 'A'
+	&& *(str + 7) == 'R'
+	&& *(str + 8) == ' '){
+		//printf("Hit var\n");
+		return tag_var;
+	}else if(strlen > TAG_IF_LENGTH
+	&& *(str + 5) == 'I'
+	&& *(str + 6) == 'F'
+	&& *(str + 7) == ' '){
+		return tag_if;
+	}else if(strlen > TAG_END_LENGTH
+	&& *(str + 5) == 'E'
+	&& *(str + 6) == 'N'
+	&& *(str + 7) == 'D'){
+		return tag_end;
+	}else if(strlen > TAG_ELSE_LENGTH
+	&& *(str + 5) == 'E'//Check for both else and elseif
+	&& *(str + 6) == 'L'
+	&& *(str + 7) == 'S'
+	&& *(str + 8) == 'E'){
+		if(*(str + 9) != 'I'){
+			return tag_else;
+		}else if(strlen > TAG_ELSEIF_LENGTH
+		&& *(str + 9) == 'I'
+		&& *(str + 10) == 'F'
+		&& *(str + 11) == ' '){
+			return tag_elseif;
+		}else{
+			return tag_null;
+		}
+	}else if(strlen > TAG_LOOP_LENGTH
+	&& *(str + 5) == 'L'
+	&& *(str + 6) == 'O'
+	&& *(str + 7) == 'O'
+	&& *(str + 8) == 'P'
+	&& *(str + 9) == ' '){
+		return tag_loop;
+	}else if(strlen > TAG_BREAK_LENGTH
+	&& *(str + 5) == 'B'
+	&& *(str + 6) == 'R'
+	&& *(str + 7) == 'E'
+	&& *(str + 8) == 'A'
+	&& *(str + 9) == 'K'
+	&& *(str + 10) == ' '){
+		return tag_break;
+	}else if(strlen > TAG_CONTINUE_LENGTH
+	&& *(str + 5) == 'C'
+	&& *(str + 6) == 'O'
+	&& *(str + 7) == 'N'
+	&& *(str + 8) == 'T'
+	&& *(str + 9) == 'I'
+	&& *(str + 10) == 'N'
+	&& *(str + 11) == 'U'
+	&& *(str + 12) == 'E'
+	&& *(str + 13) == ' '){
+		return tag_continue;
+	}else{
+		return tag_null;
+	}
+}
+
+size_t tagtype_len(enum TMPL_tagtype t){
+	switch(t){
+		case tag_null:
+			return TAG_NULL_LENGTH;
+		case tag_text:
+			return TAG_TEXT_LENGTH;
+		case tag_var:
+			return TAG_VAR_LENGTH;
+		case tag_if:
+			return TAG_IF_LENGTH;
+		case tag_end:
+			return TAG_END_LENGTH;
+		case tag_elseif:
+			return TAG_ELSEIF_LENGTH;
+		case tag_else:
+			return TAG_ELSE_LENGTH;
+		case tag_loop:
+			return TAG_LOOP_LENGTH;
+		case tag_break:
+			return TAG_BREAK_LENGTH;
+		case tag_continue:
+			return TAG_CONTINUE_LENGTH;
+	}
+	return 0;
+}
+
+/*Quickly find the token*/
+struct TMPL_token* scan_text(char* start, size_t strlen, size_t* consumed){
+	//printf("Scan starting at %p\n",start);
+	//printf("Size of string was %d \"%s\"\n",(int)strlen,start);
+	struct TMPL_token* t = TMPL_alloc_token();
+	t->start = start;
+	enum TMPL_tagtype type = tag_null;
+	char* cursor = start;
+	while(type == tag_null){
+		cursor = (char*)memchr(cursor,'<',strlen);
+		if(cursor == NULL){
+			//printf("Cursor was null\n");
+			cursor = start + (strlen > 0 ? strlen : 1);
+			break;
+		}
+		//printf("Return of memchr was %s\n",cursor);
+		type = starts_with_token(cursor+1,strlen);
+		if(type == tag_null){
+			cursor++;
+		}
+	}
+	t->end = cursor;
+	t->length = t->end - t->start;
+	*consumed = t->length;
+	//printf("Consumed length is %d\n",(int)*consumed);
+	//printf("Scan_text is returning token:\n");
+	char* c;
+	for(c = start; c < cursor; c++){
+		//printf("%c",*c);
+	}
+	//printf("\n");
+	return t;
+}
+
+struct TMPL_token* scan_tag(char* start, size_t strlen, size_t* consumed){
+	//printf("Scanning tag\n");
+	struct TMPL_token* t = TMPL_alloc_token();
+	t->start = start;
+	char* cursor = (char*)memchr(start,'>',strlen);
+	//printf("Managed to get through memchr, cursor is now %s\n",cursor);
+	t->end = cursor+1;//Include the '>'
+	t->length = t->end - t->start;
+	*consumed = t->length;
+	return t;
+}
+
+void print_tokens(struct TMPL_token* head){
+	struct TMPL_token* cursor = head;
+	while(cursor != NULL){
+		printf("char start is %p char end is %p cursor is %p type is %d\n",cursor->start, cursor->end,(void*)cursor,(int)cursor->type);
+		char* i;
+		for(i = cursor->start; i != cursor->end; i++){
+			printf("%c",*i);
+		}
+		printf("\n----\n");
+		cursor = cursor->next;
+	}
+	printf("Finished printing tokens\n");
+}
+
+struct TMPL_varitem* TMPL_alloc_varitem(){
+	struct TMPL_varitem* ret = (struct TMPL_varitem*)malloc(sizeof(struct TMPL_varitem));
+	return ret;
+}
+
+void TMPL_free_varitem(struct TMPL_varitem* vi){
+	//printf("Freeing varitem\n");
+	if(vi->type == vartype_var){
+		////printf("Freeing string at %p(%s)\n",vi->item.s,vi->item.s);
+		//free(vi->item.s);
+	}else{
+		//printf("Freeing loop\n");
+		TMPL_free_loop(vi->item.l);
+	}
+	free(vi);
+}
+
+void TMPL_add_var_to_varlist(struct TMPL_varlist* t, char* varname, char* var){
+	//printf("Adding \"%s\" to varlist under \"%s\"(%p)\n",var,varname,(void*)varname);
+	struct TMPL_varitem* vi = TMPL_alloc_varitem();
+	vi->type = vartype_var;
+	size_t slen = strlen(var);
+	vi->item.s = (char*)malloc(sizeof(char)*slen);
+	memcpy(vi->item.s,var,slen);
+	int succ = hashmap_put(t->map,varname,vi);
+	if(succ != MAP_OK){
+		//printf("FAiled to put item in %d\n",succ);
+		exit(-1);
+	}
+	//printf("Done\n");
+}
+
+void print_ast_helper(struct TMPL_tagnode* cursor, int level){
+	int i;
+	for(i = 0; i < level; i++){
+		printf("|");
+	}
+	printf("} %d ->",(int)cursor->type);
+	switch(cursor->type){
+		case tag_null:
+			printf("TAG NULL");
+			break;
+		case tag_text:
+			printf("TAG Text %d\n", (int)cursor->TMPL_tag.text.len);
+			break;
+		case tag_var:
+			printf("TAG var(%s)",cursor->TMPL_tag.var.varname);
+			if(cursor->TMPL_tag.var.default_len > 0){
+				printf(" +default:%d",(int)cursor->TMPL_tag.var.default_len);
+			}
+			printf("\n");
+			break;
+		case tag_if:
+		case tag_elseif:
+			printf("TAG If/elseif,(%s) == (%s)\n",cursor->TMPL_tag.ifelse.varname,cursor->TMPL_tag.ifelse.testval);
+			level++;
+			for(i=0;i<level;i++){
+				printf("|");
+			}
+			printf("True:\n");
+			print_ast_helper(cursor->TMPL_tag.ifelse.tbranch,level);
+			if(cursor->TMPL_tag.ifelse.fbranch != NULL){
+				for(i=0;i<level;i++){
+					printf("|");
+				}
+				printf("False:\n");
+				print_ast_helper(cursor->TMPL_tag.ifelse.fbranch,level);
+			}
+			level--;
+			break;
+		case tag_else:
+			printf("TAG Else\n");
+			break;
+		case tag_end:
+			printf("TAG End\n");
+			break;
+		case tag_loop:
+			printf("TAG Loop (%s), body:\n",cursor->TMPL_tag.loop.loopname);
+			print_ast_helper(cursor->TMPL_tag.loop.body,level+1);
+			break;
+		case tag_break:
+			printf("TAG Break\n");
+			break;
+		case tag_continue:
+			printf("TAG Continue\n");
+			break;
+	}
+	if(cursor->next != NULL){
+		print_ast_helper(cursor->next,level);
+	}
+}
+void print_ast(struct TMPL_tagnode* root){
+	print_ast_helper(root,0);
+}
+
+struct TMPL_token* TMPL_tokenize(char* tmplstr, size_t strlen){
+	if(strlen == 0) return NULL;
+	struct TMPL_token* first;
+	char* textcursor = tmplstr;
+	size_t newlength;
+	enum TMPL_tagtype ttype;
+	ttype = starts_with_token(tmplstr+1,strlen);
+	//printf("First ttype is %d\n",(int)ttype);
+	if(ttype == tag_null){
+		first = scan_text(textcursor,strlen,&newlength);
+		first->type = tag_text;
+	}else{
+		first = scan_tag(textcursor,strlen,&newlength);
+		first->type = ttype;
+	}
+	//printf("I got a first consumed length of %d\n",(int)newlength);
+	textcursor += newlength;
+	first->end = textcursor;
+	first->length = newlength;
+	strlen -= newlength;
+	struct TMPL_token* tokencursor = first;
+	struct TMPL_token* newnode;
+	//print_tokens(first);
+	while(*textcursor != '\0'){
+		//printf("Getting a new token... size was %d textcursor is %d\n", (int)newlength, (int)*textcursor);
+		ttype = starts_with_token(textcursor+1,strlen);
+		//printf("Loop ttype is %d\n",(int)ttype);
+		if(ttype == tag_null){
+			newnode = scan_text(textcursor,strlen,&newlength);
+			newnode->type = tag_text;
+		}else{
+			newnode = scan_tag(textcursor,strlen,&newlength);
+			newnode->type = ttype;
+		}
+		tokencursor->next = newnode;
+		textcursor += newlength;
+		strlen -= newlength;
+		tokencursor = newnode;
+	}
+	//printf("Returning from tokenize\n");
+	return first;
+}
+void print_varlist_helper(struct TMPL_varlist* vl, int indent);
+void print_varlist(struct TMPL_varlist* vl);
+
+struct TMPL_tagnode* parse(struct TMPL_token* head, struct TMPL_buf* errbuf);
+
+struct TMPL_tagnode* alloc_tagnode(){
+	struct TMPL_tagnode* t = malloc(sizeof(struct TMPL_tagnode));
+	return t;
+}
+
+//Finds a quoted string, allows for \"
+size_t get_quoted_string(char* start, size_t len){
+	size_t i;
+	int setup;
+	for(i = 0; i < len; i++){
+		if(*(start+i) == '\\'){
+			setup = 1;
+		}else if(*(start+i) == '"'){
+			if( setup == 1){
+				//Do nothing, this is \"
+			}else{
+				return i;
+			}
+		}else{
+			setup = 0;
+		}
+	}
+	return i;
+}
+
+struct TMPL_tagnode* parse_text(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	//printf("Parsing text node\n");
+	struct TMPL_tagnode* t = alloc_tagnode();
+	t->TMPL_tag.text.start = head->start;
+	t->TMPL_tag.text.len = head->length;
+	t->type = head->type;
+	//printf("About to call parse again\n");
+	struct TMPL_tagnode* n = parse(head->next, errbuf);
+	//printf("Parsed next\n");
+	t->next = n;
+	return t;
+}
+
+struct TMPL_tagnode* parse_else(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	struct TMPL_tagnode* branch = parse(head->next,errbuf);
+	return branch;
+}
+
+struct TMPL_tagnode* parse_elseif(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	struct TMPL_tagnode* t = alloc_tagnode();
+	//printf("Parsing elseif..., token was %s\n",head->start);
+	char* start_of_attribs = head->start + TAG_ELSEIF_LENGTH;
+	//printf("Start of attribs was %s\n",start_of_attribs);
+	int name_offset = kmp(start_of_attribs,head->length, ATTRIBUTE_VARNAME,ATTRIBUTE_VARNAME_LENGTH);
+	//printf("Found an elseif statement, offset is %d\n",name_offset);
+	char* start_of_name = start_of_attribs + name_offset + ATTRIBUTE_VARNAME_LENGTH;
+	//printf("Looking for name starting from %s\n",start_of_name);
+	size_t name_length = get_quoted_string(start_of_name,head->length);
+	//printf("Length of name was %d\n",(int)name_length);
+	char* name = (char*)malloc(sizeof(char)*name_length);
+	memcpy(name,start_of_name,name_length);
+	name[name_length] = '\0';
+	//printf("Makeing elseif with name: %s\n",name);
+	t->TMPL_tag.ifelse.varname = name;
+
+	int testval_offset = kmp(start_of_attribs,head->length, ATTRIBUTE_VALUE,ATTRIBUTE_VALUE_LENGTH);
+	char* start_of_value = start_of_attribs + testval_offset + ATTRIBUTE_VALUE_LENGTH;
+	size_t value_length = get_quoted_string(start_of_value,head->length);
+	char* value = (char*)malloc(sizeof(char)*value_length);
+	memcpy(value,start_of_value,value_length);
+	value[value_length] = '\0';
+	t->TMPL_tag.ifelse.testval = value;
+	struct TMPL_token* cursor = head->next;
+	int nest_level = 0;
+	struct TMPL_token* fstart = NULL;
+	while(nest_level > 0 || cursor->type != tag_end){
+		if(nest_level == 0 && fstart == NULL){
+			if(cursor->type == tag_elseif){
+				fstart = cursor;
+			}else if(cursor->type == tag_else){
+				fstart = cursor;
+			}
+		}
+		if(cursor->type == tag_if || cursor->type == tag_loop){
+			nest_level++;
+		}else if(cursor->type == tag_end){
+			nest_level--;
+		}
+		cursor = cursor->next;
+	}
+	if(fstart != NULL){
+		//printf("Found the fstart token to be %s\n",fstart->start);
+		if(fstart->type == tag_elseif){
+			t->TMPL_tag.ifelse.fbranch = parse_elseif(fstart,errbuf);
+		}else if(fstart->type == tag_else){
+			t->TMPL_tag.ifelse.fbranch = parse_else(fstart,errbuf);
+		}else{
+			t->TMPL_tag.ifelse.fbranch = parse(fstart,errbuf);
+		}
+	}else{
+		//printf("Did not find an fstart token\n");
+		t->TMPL_tag.ifelse.fbranch = NULL;
+	}
+
+	t->TMPL_tag.ifelse.tbranch = parse(head->next,errbuf);
+	t->next = NULL;//parse(cursor->next,errbuf);
+	
+	t->type = tag_elseif;
+	//printf("Parsed elseif statement:\n");
+	//print_ast(t);
+	return t;
+
+}
+
+struct TMPL_tagnode* parse_if(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	//printf("Parsing if...\n");
+	struct TMPL_tagnode* t = alloc_tagnode();
+	char* start_of_attribs = head->start + TAG_IF_LENGTH;
+	/*Find the name of the varialbe*/	
+	int name_offset = kmp(start_of_attribs,head->length,ATTRIBUTE_VARNAME,ATTRIBUTE_VARNAME_LENGTH);
+	//printf("Found an if statement, name offset is %d\n",name_offset);
+	char* start_of_name = start_of_attribs + name_offset + ATTRIBUTE_VARNAME_LENGTH;
+	size_t name_length = get_quoted_string(start_of_name,head->length);
+	char* name = (char*)malloc(sizeof(char)*name_length);
+	memcpy(name,start_of_name,name_length);
+	name[name_length] = '\0';
+	//printf("Found if name:\"%s\"\n",name);
+	t->TMPL_tag.ifelse.varname = name;
+	/*Find the name to check against*/
+	int testval_offset = kmp(start_of_attribs,head->length, ATTRIBUTE_VALUE,ATTRIBUTE_VALUE_LENGTH);
+	char* start_of_value = start_of_attribs + testval_offset + ATTRIBUTE_VALUE_LENGTH;
+	size_t value_length = get_quoted_string(start_of_value,head->length);
+	char* value = (char*)malloc(sizeof(char)*value_length);
+	memcpy(value,start_of_value,value_length);
+	value[value_length] = '\0';
+	//printf("Found if value:\"%s\"\n",value);
+	t->TMPL_tag.ifelse.testval = value;
+	/*Find the true branch*/
+	struct TMPL_token* cursor = head->next;
+	int nest_level = 0;
+	struct TMPL_token* fstart = NULL;
+	while(nest_level > 0 || cursor->type != tag_end){
+		if(fstart == NULL){
+			if(cursor->type == tag_elseif){
+				fstart = cursor;
+			}else if(cursor->type == tag_else){
+				fstart = cursor;
+			}
+		}
+		if(cursor->type == tag_if || cursor->type == tag_loop){
+			nest_level++;
+		}else if(cursor->type == tag_end){
+			nest_level--;
+		}
+		cursor = cursor->next;
+	}
+	if(fstart != NULL){
+		//printf("Found the fstart token to be %s\n",fstart->start);
+		if(fstart->type == tag_elseif){
+			t->TMPL_tag.ifelse.fbranch = parse_elseif(fstart,errbuf);
+		}else if(fstart->type == tag_else){
+			//printf("Type was else, parsing...\n");
+			//printf("Tokens were:\n");
+			//print_tokens(fstart);
+			//struct TMPL_tagnode* tn = parse_else(fstart,errbuf);
+			//printf("Got tagnode back:\n");
+			//print_ast(tn);
+			t->TMPL_tag.ifelse.fbranch = parse_else(fstart,errbuf);
+		}else{
+			t->TMPL_tag.ifelse.fbranch = parse(fstart,errbuf);
+		}
+	}else{
+		//printf("Did not find an fstart token\n");
+		t->TMPL_tag.ifelse.fbranch = NULL;
+	}
+
+	t->TMPL_tag.ifelse.tbranch = parse(head->next,errbuf);
+	//Walk the tbranch and try to find if we have elseifs
+	t->next = parse(cursor->next,errbuf);
+	
+	t->type = tag_if;
+	//printf("Parsed if statement:\n");
+	//print_ast(t);
+	return t;
+}
+
+
+struct TMPL_tagnode* parse_loop(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	//printf("Parsing loop that starts at %s\n",head->start);
+	struct TMPL_tagnode* t = alloc_tagnode();
+	char* loop_start = head->start + TAG_LOOP_LENGTH;
+	int loop_length = head->length - TAG_LOOP_LENGTH;
+	int name_offset = kmp(loop_start,loop_length, ATTRIBUTE_VARNAME, ATTRIBUTE_VARNAME_LENGTH);
+	//printf("In parse loop, name offset was %d\n",name_offset);
+	if(name_offset == -1 && DEBUGGING){
+		bputs(errbuf,"Parsing error: Could not find name attribute for loop near\n");
+		bputsn(errbuf,head->start, ERRBUF_HINTLEN);
+		return NULL;
+	}
+	if(name_offset >= 0){
+		char* start_of_name = loop_start + name_offset + ATTRIBUTE_VARNAME_LENGTH;
+		//printf("Start of name is at %s\n",start_of_name);
+		size_t name_size = get_quoted_string(start_of_name,head->length);
+		char* loopname = (char*)malloc(sizeof(char)*name_size);
+		loopname[name_size] = '\0';
+		//printf("Loop name size is %d\n", (int)name_size);
+		memcpy(loopname,start_of_name,name_size);
+		//printf("Got loop name %s\n",loopname);
+		t->TMPL_tag.loop.loopname = loopname;
+
+	}
+	t->type = tag_loop;
+	int nest_level = 0;
+	struct TMPL_token* cursor = head->next;
+	while(cursor != NULL && (nest_level > 0 || cursor->type != tag_end)){
+		//printf("Trying to find end of loop, cursor is");
+		//print_tokens(cursor);
+		if(cursor == NULL){
+			bputs(errbuf,"Parse error : tried parsing loop and hit end of stream near\n");
+			bputsn(errbuf,head->start,ERRBUF_HINTLEN);
+			return NULL;
+		}
+		if(cursor->type == tag_if ||
+		   cursor->type == tag_loop){
+			nest_level++;
+		}else if(cursor->type == tag_end){
+			nest_level--;
+		}
+		cursor = cursor->next;
+	}
+	if(cursor == NULL){
+		bputs(errbuf,"Parse error: Tried parsing loop and hit end of stream near\n");
+		bputsn(errbuf,head->start,ERRBUF_HINTLEN);
+		return NULL;
+	}
+	//printf("Found end of loop near %20s\n",cursor->start);
+	t->TMPL_tag.loop.body = parse(head->next,errbuf);
+	t->next = parse(cursor->next,errbuf);
+	return t;
+}
+
+struct TMPL_tagnode* parse_variable(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	//printf("Parsing variable\n");
+	struct TMPL_tagnode* t = alloc_tagnode();
+	char* start_of_attribs = head->start + TAG_VAR_LENGTH;
+	int attribs_length = head->length - TAG_VAR_LENGTH;
+	int in_name = kmp(start_of_attribs,attribs_length,ATTRIBUTE_VARNAME,ATTRIBUTE_VARNAME_LENGTH);
+	int in_default = kmp(start_of_attribs,attribs_length,ATTRIBUTE_DEFAULT,ATTRIBUTE_DEFAULT_LENGTH);
+	//printf("parse: start of attribs is %s\n",start_of_attribs);
+	//printf("parse: length of 1 was %d, length of 2 was %d\n",(int)attribs_length,(int)ATTRIBUTE_VARNAME_LENGTH);
+	//printf("While parseing variable, kmp search gave %d\n",in_name);
+	if(in_name == -1 && DEBUGGING){
+		char buf[ERR_MSG_LEN];
+		snprintf(buf,ERR_MSG_LEN,"Parsing error: Could not find name=\"name\" near %s\n",head->start);
+		bputs(errbuf,buf);
+	}
+	if(in_name >= 0){
+		char* start_of_name = start_of_attribs + in_name + ATTRIBUTE_VARNAME_LENGTH;
+		size_t name_size = get_quoted_string(start_of_name,head->length);
+		char* name = (char*)malloc(sizeof(char)*name_size);
+		memcpy(name,start_of_name,name_size);
+		name[name_size] = '\0';
+		t->TMPL_tag.var.varname = name;
+		t->TMPL_tag.var.name_len = name_size;
+		//printf("Found a varname\n");
+	}
+	if(in_default >= 0){
+		char* start_of_default = start_of_attribs + in_default + ATTRIBUTE_DEFAULT_LENGTH;
+		size_t default_size = get_quoted_string(start_of_default,head->length);
+		char* def = (char*) malloc(sizeof(char)*default_size);
+		def[default_size] = '\0';
+		memcpy(def,start_of_default,default_size);
+		t->TMPL_tag.var.defaultval = def;
+		t->TMPL_tag.var.default_len = default_size;
+		//printf("Found a default\n");
+	}else{
+		t->TMPL_tag.var.default_len = 0;
+	}
+	t->type = tag_var;
+	t->next = parse(head->next,errbuf);
+	//printf("Returning %p From parse_variable\n",(void*)t);
+	//t->TMPL_tag.var.varname
+	return t;
+}
+
+struct TMPL_varlist* TMPL_alloc_varlist(){
+	struct TMPL_varlist* ret = (struct TMPL_varlist*)malloc(sizeof(struct TMPL_varlist));
+	ret->map = hashmap_new();
+	return ret;
+}
+
+
+int TMPL_free_hashmapitems(any_t a, any_t b){
+	//printf("Freeing hashmap item at %p\n",(void*)b);
+	struct TMPL_varitem* vi = (struct TMPL_varitem*)b;
+	TMPL_free_varitem(vi);
+	return MAP_OK;
+}
+
+void TMPL_free_varlist(struct TMPL_varlist* vl){
+	//printf("Freeing varlist:\n");
+	//print_varlist(vl);
+	hashmap_iterate(vl->map,TMPL_free_hashmapitems,NULL);
+	//printf("done interatively freeing\n");
+	hashmap_free(vl->map);
+	free(vl);
+}
+
+struct TMPL_loop* TMPL_alloc_loop(){
+	struct TMPL_loop* ret = (struct TMPL_loop*)malloc(sizeof(struct TMPL_loop));
+	ret->loop_len = 0;
+	ret->varlist = NULL;
+	ret->next = NULL;
+	ret->tail = NULL;
+	return ret;
+}
+
+void TMPL_free_loop(struct TMPL_loop* tl){
+	//printf("Freeing loop\n");
+	if(tl->next != NULL){
+		TMPL_free_loop(tl->next);
+	}
+	TMPL_free_varlist(tl->varlist);
+	free(tl);
+}
+
+void TMPL_add_varlist_to_loop(struct TMPL_loop* tl,struct TMPL_varlist* vl){
+	//printf("Adding varlist to loop\n");
+	//print_varlist(vl);
+	if(tl->loop_len == 0){// Add the first node
+		tl->varlist = vl;
+		tl->tail = tl;
+		tl->loop_len++;
+	}else{
+		struct TMPL_loop* new = TMPL_alloc_loop();
+		new->varlist = vl;
+		tl->tail->next = new;
+		tl->tail = new;
+	}
+}
+
+void TMPL_add_loop_to_varlist(struct TMPL_varlist* vl, char* name, struct TMPL_loop* l){
+	//printf("Adding loop to varlist under \"%s\"\n",name);
+	struct TMPL_varitem* vi = TMPL_alloc_varitem();
+	vi->type = vartype_loop;
+	vi->item.l = l;
+	int err = hashmap_put(vl->map,name,vi);
+	if(err != MAP_OK){
+		//printf("Failed to add loop to varlist:%d\n",err);
+	}
+	struct TMPL_varitem* back;
+	hashmap_get(vl->map,name,(void**)&back);
+	//printf("Trying to get %s back out: %p\n",name,(void*)back);
+	//printf("Varlist is now:\n");
+	//print_varlist(vl);
+}
+
+
+
+//Parses tokens into a syntax tree
+struct TMPL_tagnode* parse(struct TMPL_token* head, struct TMPL_buf* errbuf){
+	struct TMPL_tagnode* root;
+	if(head == NULL){
+		//printf("Asked to parse null");
+		return NULL;
+	}
+	//printf("In parse, type is %d\n",(int)head->type);
+	switch(head->type){
+		case tag_text:
+			root = parse_text(head,errbuf);
+			break;
+		case tag_var:
+			root = parse_variable(head,errbuf);
+			break;
+		case tag_loop:
+			root = parse_loop(head,errbuf);
+			break;
+		case tag_end:
+			root = NULL;
+			//root = prase(head->next, errbuf);
+			break;
+		case tag_if:
+			root = parse_if(head,errbuf);
+			//printf("Returned from parsing if\n");
+			break;
+		case tag_elseif:
+			root = NULL;
+			//root = parse_elseif(head,errbuf);
+			//printf("Returned from parsing elseif\n");
+			break;
+		case tag_else:
+			root = NULL;
+			//root = parse_else(head,errbuf);
+			break;
+		default:
+			//printf("Exiting parse early\n");
+			exit(-1);
+			break;
+	}
+	//size_t dummy;
+	//printf("Errbuf was %s\n",bstringify(errbuf,&dummy));
+	if(errbuf->total_len > 0){
+		//printf("FAiled to parse\n");
+		return NULL;
+	}
+	return root;
+}
+
+struct TMPL_templates* alloc_templates(){
+	struct TMPL_templates* t = malloc(sizeof(struct TMPL_templates));
+	return t;
+}
+
+struct TMPL_templates* compile(char* tmplstr){
+	size_t slen = strlen(tmplstr);
+	struct TMPL_templates* ret = alloc_templates();
+	ret->out = alloc_tmpl_buf();
+	ret->errout = alloc_tmpl_buf();
+	struct TMPL_token* tokens = TMPL_tokenize(tmplstr,slen);
+	//printf("Tokenized %p\n",(void*)tokens);
+	//print_tokens(tokens);
+	struct TMPL_tagnode* ast = parse(tokens,ret->errout);
+	//printf("Ast was:\n");
+	//print_ast(ast);
+	if(ast == NULL){
+		//printf("ast was null");
+	}else{
+		ret->roottag = ast;
+	}
+	//printf("ret roottag is %p\n",(void*)ret->roottag);
+	return ret;
+}
+
+int render_any(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist);
+
+int render_variable(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	//printf("Rendering variable...\n");
+	struct TMPL_varitem* vi;
+	char* varname = node->TMPL_tag.var.varname;
+	//printf("Looking for var name %s in\n",varname);
+	//print_varlist(varlist);
+	int err = hashmap_get(varlist->map,varname,(void**)&vi);
+	//printf("Err is %d\n",err);
+	if(err == MAP_OK){
+		//printf("Rendering val: %s\n", vi->item.s);
+		bputs(t->out,vi->item.s);
+	}else if(err == MAP_MISSING){
+		//printf("Missing var named %s\n",varname);
+		size_t has_default = node->TMPL_tag.var.default_len;
+		if(has_default){
+			bputs(t->out,node->TMPL_tag.var.defaultval);
+		}else{
+			/*Error, not bound and no default*/
+			return -1;
+		}
+	}else{
+		//printf("Failed to put in var\n");
+		return -1;
+	}
+	return 0;
+}
+
+int render_text(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	struct TMPL_buf* buf = t->out;
+	char* text = (char*)node->TMPL_tag.text.start;
+	size_t length = node->TMPL_tag.text.len;
+	bputsn(buf,text,length);
+	return 0;
+}
+
+int print_pair(any_t indent, any_t b){
+	struct TMPL_varitem* vi = (struct TMPL_varitem*)b;
+	int* ip = (int*)indent;
+	int ind = *ip;
+	if(vi->type == vartype_var){
+		int i;
+		for(i = 0; i < ind; i++)
+			printf("\t");
+		printf("%s\n",vi->item.s);
+	}else{
+		struct TMPL_loop* cursor;
+		printf("{\n");
+		ind++;
+		for(cursor = vi->item.l; cursor != NULL; cursor = cursor->next){
+			print_varlist_helper(cursor->varlist,ind);
+		}
+		printf("}\n");
+	}
+	return MAP_OK;
+}
+
+void print_varlist_helper(struct TMPL_varlist* vl, int indent){
+	hashmap_iterate(vl->map, print_pair,&indent);
+}
+
+
+void print_varlist(struct TMPL_varlist* vl){
+	print_varlist_helper(vl,0);
+}
+
+int render_if(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	//printf("Rendering if...\n");
+	//printf("Node %p tag %p\n",(void*)node,(void*)node->TMPL_tag.ifelse.varname);
+	char* varname = node->TMPL_tag.ifelse.varname;
+	//printf("Got varname: %s\n",varname);
+	char* testval = node->TMPL_tag.ifelse.testval;
+	//printf("Got varname %s and testval %s\n",varname,testval);
+	struct TMPL_varitem* vi;
+	//printf("About to hashmap get\n");
+	int err = hashmap_get(varlist->map,varname,(void**)&vi);
+	//printf("Found variable with key \"%s\" : \"%s\"\n",varname,vi->item.s);
+	struct TMPL_tagnode* cursor;
+	if(err == MAP_OK && strcmp(vi->item.s,testval) == 0){
+		//printf("Rendering true branch\n");
+		cursor = node->TMPL_tag.ifelse.tbranch;
+		while(cursor != NULL){
+			render_any(t,cursor,varlist);
+			cursor = cursor->next;
+		}
+	}else if(node->TMPL_tag.ifelse.fbranch != NULL){
+		//printf("Rendering false branch\n");
+		//render_any(t,node->TMPL_tag.ifelse.fbranch,varlist);
+		cursor = node->TMPL_tag.ifelse.fbranch;
+		while(cursor != NULL){
+			render_any(t,cursor,varlist);
+			cursor = cursor->next;
+		}
+	}
+	return 0;
+}
+
+int render_elseif(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	char* varname = node->TMPL_tag.ifelse.varname;
+	char* testval = node->TMPL_tag.ifelse.testval;
+	struct TMPL_varitem* vi;
+	int err = hashmap_get(varlist->map,varname,(void**)&vi);
+	//printf("Rendering elseif ast:\n");
+	//print_ast(node);
+	struct TMPL_tagnode* cursor;
+	if(err == MAP_OK && strcmp(vi->item.s, testval) == 0){
+		//printf("Rendering true branch\n");
+		cursor = node->TMPL_tag.ifelse.tbranch;
+		while(cursor != NULL){
+			render_any(t,cursor,varlist);
+			cursor = cursor->next;
+		}
+	}else if(node->TMPL_tag.ifelse.fbranch != NULL){
+		//printf("Rendering false branch\n");
+		cursor = node->TMPL_tag.ifelse.fbranch;
+		while(cursor != NULL){
+			render_any(t,cursor,varlist);
+			cursor = cursor->next;
+		}
+	}
+	return 0;
+}	
+void TMPL_render_helper(struct TMPL_templates* t, struct TMPL_varlist* varlist);
+
+int render_loop(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	char* loopname = node->TMPL_tag.loop.loopname;
+	struct TMPL_varitem* loop;
+	//printf("Attempting to render loop:\n");
+	//print_ast(node);
+	//printf("With varlist:\n");
+	//print_varlist(varlist);
+	//printf("Looking for loop name %s\n", loopname);
+	int err = hashmap_get(varlist->map,loopname,(void*)&loop);
+	if(err != MAP_OK){
+		//printf("Failed to get loop struct, %d\n",err);
+		return -1;
+	}
+	//printf("Got loop struct %p\n",(void*)loop);
+	//printf("First varlist is\n");
+	//print_varlist(loop->item.l->varlist);
+	struct TMPL_templates* nt = (struct TMPL_templates*)malloc(sizeof(struct TMPL_templates));
+	nt->out = t->out;
+	nt->errout = t->errout;
+	nt->roottag = node->TMPL_tag.loop.body;
+	struct TMPL_loop* cursor;
+	for(cursor = loop->item.l; cursor != NULL; cursor = cursor->next){
+		//printf("Rendering loop.This varlist is\n");
+		//print_varlist(cursor->varlist);
+		//int err = render_any(t,node->TMPL_tag.loop.body,cursor->varlist);
+		if(err != 0){
+			//printf("Failed to render loop\n");
+		}
+		TMPL_render_helper(nt,cursor->varlist);
+	}
+	//struct TMPL_buf* buf = t->out;
+	//printf("Done rendering loop\n");
+	free(nt);
+	return 0;
+}
+
+int render_any(struct TMPL_templates* t, struct TMPL_tagnode* node, struct TMPL_varlist* varlist){
+	/*Interpret the template*/
+	int err;
+	switch(node->type){
+		case tag_text:
+			//printf("Rendering text\n");
+			err = render_text(t,node,varlist);
+			if(err < 0){
+				//printf("Failed to render text\n");
+			}
+			//printf("Done rendering text\n");
+			break;
+		case tag_var:
+			//printf("Rendering var\n");
+			err = render_variable(t,node,varlist);
+			if(err < 0){
+				//printf("Failed to render variable\n");
+			}
+			break;
+		case tag_loop:
+			//printf("Rendering loop\n");
+			err = render_loop(t,node,varlist);
+			if(err < 0){
+				//printf("Failed to render loop\n");
+			}
+			break;
+		case tag_if:
+			//printf("Rendering if\n");
+			err = render_if(t,node,varlist);
+			if(err < 0){
+				//printf("Failed to render if\n");
+			}
+			break;
+		case tag_elseif:
+			//printf("Rendering elseif\n");
+			err = render_elseif(t,node,varlist);
+			if(err < 0){
+				//printf("Failed to render elseif\n");
+			}
+			break;
+		default:
+			//printf("Rendering default %d\n",(int)node->type);
+			exit(-1);
+			break;
+	}
+	return err;
+}
+
+void TMPL_render_helper(struct TMPL_templates* t, struct TMPL_varlist* varlist){
+	struct TMPL_tagnode* cursor = t->roottag;
+	while(cursor != NULL){
+		render_any(t,cursor,varlist);
+		cursor = cursor->next;
+	}
+
+}
+
+char* TMPL_render(struct TMPL_templates* t, struct TMPL_varlist* varlist){
+	if(t->out != NULL){
+		free_tmpl_buf(t->out);
+	}
+	t->out = alloc_tmpl_buf();
+	TMPL_render_helper(t,varlist);
+	size_t dummy;
+	char* ret  = bstringify(t->out,&dummy);
+	return ret;
+}
+
+struct TMPL_templates* TMPL_alloc_template(char* tmplstr){
+	struct TMPL_templates* n = compile(tmplstr);
+	////printf("After returning from compile, rottag is %p\n",(void*)n->roottag);
+
+	if(n != NULL){
+		return n;
+	}else{
+		TMPL_free_template(n);
+		return NULL;
+	}
+}
+
+void TMPL_free_template(struct TMPL_templates* t){
+	free_tmpl_buf(t->out);
+	free_tmpl_buf(t->errout);
+	TMPL_free_tagnode(t->roottag);
+	free(t);
+	////printf("Freed tagnodes\n");
+}
+
+void TMPL_free_tagnode(struct TMPL_tagnode* tn){
+	//printf("Freeing tagnode:\n");
+	//print_ast(tn);
+	switch(tn->type){
+		case tag_text:
+			break;
+		case tag_var:
+			free(tn->TMPL_tag.var.varname);
+			if(tn->TMPL_tag.var.default_len > 0){
+				free(tn->TMPL_tag.var.defaultval);
+			}
+			break;
+		case tag_if:
+		case tag_elseif:
+		case tag_else:
+			free(tn->TMPL_tag.ifelse.varname);
+			free(tn->TMPL_tag.ifelse.testval);
+			TMPL_free_tagnode(tn->TMPL_tag.ifelse.tbranch);
+			if(tn->TMPL_tag.ifelse.fbranch){
+				TMPL_free_tagnode(tn->TMPL_tag.ifelse.fbranch);
+			}
+			break;
+		case tag_loop:
+			free(tn->TMPL_tag.loop.loopname);
+			TMPL_free_tagnode(tn->TMPL_tag.loop.body);
+			break;
+		case tag_null:
+		case tag_break:
+		case tag_continue:
+		case tag_end:
+			break;
+	}
+	if(tn->next != NULL)
+		TMPL_free_tagnode(tn->next);
+	free(tn);
+}
+
+char* TMPL_get_error(struct TMPL_templates* t){
+	size_t dummy;
+	return bstringify(t->errout,&dummy);
+}
diff --git a/ctemplate.h b/ctemplate.h
new file mode 100644
index 0000000..4479141
--- /dev/null
+++ b/ctemplate.h
@@ -0,0 +1,56 @@
+/*
+ * C TemplateS Library 0.1 -
+ * Forked from C Template Library 1.0 by Stephen C. Losen.
+ *
+ * Copyright 2017 Alexander M. Pickering  Distributed under the terms
+ * of the GNU General Public License (GPL)
+ */
+
+#ifndef _CTEMPLATE_H
+#define _CTEMPLATE_H
+
+/*
+ * TMPL_varlist is a variable list of simple variables and/or
+ * loop variables
+ */
+
+/* Holdes all the data needed for a template*/
+struct TMPL_templates;
+struct TMPL_varlist;
+struct TMPL_loop;
+
+
+
+/*Things to do with varlists*/
+extern struct TMPL_varlist* TMPL_alloc_varlist();
+extern struct TMPL_loop*    TMPL_alloc_loop();
+extern void                 TMPL_add_var_to_varlist(
+		                                    struct TMPL_varlist* t,
+		                                    char* varname,
+					            char* value
+			    );
+extern void                 TMPL_add_loop_to_varlist(
+		                                     struct TMPL_varlist* t,
+						     char* name,
+		                                     struct TMPL_loop* l
+			    );
+extern void                 TMPL_add_varlist_to_loop(
+		                                     struct TMPL_loop* l,
+						     struct TMPL_varlist* t
+			    );
+		                         
+extern void                 TMPL_free_varlist(struct TMPL_varlist* t);
+extern void                 TMPL_free_loop(struct TMPL_loop* l);
+
+
+
+
+extern struct TMPL_templates* TMPL_alloc_template(char* t);
+extern void                   TMPL_free_template(struct TMPL_templates* t);
+
+extern char* TMPL_render(struct TMPL_templates* t,struct TMPL_varlist* varlist);
+
+extern char* TMPL_get_error(struct TMPL_templates* t);
+
+
+#endif
diff --git a/ctemplate_i.h b/ctemplate_i.h
new file mode 100644
index 0000000..b485298
--- /dev/null
+++ b/ctemplate_i.h
@@ -0,0 +1,260 @@
+/*
+ * C TemplateS Library 0.1 -
+ * Forked from C Template Library 1.0 by Stephen C. Losen.
+ *
+ * Copyright 2017 Alexander M. Pickering  Distributed under the terms
+ * of the GNU General Public License (GPL)
+ */
+
+#ifndef _CTEMPLATE_H
+#define _CTEMPLATE_H
+
+
+
+#include "fbuf.h"
+#include "kmp.h"
+#include "hashmap.h"
+#include "ctemplate.h"
+
+#define MAX_TEMPLATE_LENGTH 2147384647
+
+/*
+typedef struct TMPL_varlist TMPL_varlist;
+typedef struct TMPL_loop  TMPL_loop;
+typedef struct TMPL_fmtlist TMPL_fmtlist;
+typedef struct TMPL_fmtlists TMPL_fmtlists;
+*/
+#define TAG_NULL_TEXT ""
+#define TAG_TEXT_TEXT ""
+#define TAG_VAR_TEXT "TMPL_VAR"
+#define TAG_IF_TEXT "TMPL_IF"
+#define TAG_ELSEIF_TEXT "TMPL_ELSEIF"
+#define TAG_ELSE_TEXT "TMPL_ELSE"
+#define TAG_LOOP_TEXT "TMPL_LOOP"
+#define TAG_BREAK_TEXT "TMPL_BREAK"
+#define TAG_CONTINUE_TEXT "TMPL_CONTINUE"
+#define TAG_END_TEXT "TMPL_END"
+
+#define ATTRIBUTE_VARNAME "name=\""
+#define ATTRIBUTE_DEFAULT "default=\""
+#define ATTRIBUTE_VALUE "value=\""
+
+#define ERRBUF_HINTLEN 50
+
+#define SIZEOF(x) (sizeof(x) / sizeof(x[0]))
+
+#define TAG_NULL_LENGTH 0
+#define TAG_TEXT_LENGTH 0
+#define TAG_VAR_LENGTH SIZEOF(TAG_VAR_TEXT)
+#define TAG_IF_LENGTH SIZEOF(TAG_IF_TEXT)
+#define TAG_ELSEIF_LENGTH SIZEOF(TAG_ELSEIF_TEXT)
+#define TAG_ELSE_LENGTH SIZEOF(TAG_ELSE_TEXT)
+#define TAG_LOOP_LENGTH SIZEOF(TAG_LOOP_TEXT)
+#define TAG_BREAK_LENGTH SIZEOF(TAG_BREAK_TEXT)
+#define TAG_CONTINUE_LENGTH SIZEOF(TAG_CONTINUE_TEXT)
+#define TAG_END_LENGTH SIZEOF(TAG_END_TEXT)
+
+//I guess it counts the backslash?
+#define ATTRIBUTE_VARNAME_LENGTH SIZEOF(ATTRIBUTE_VARNAME) - 1
+#define ATTRIBUTE_DEFAULT_LENGTH SIZEOF(ATTRIBUTE_DEFAULT) - 1
+#define ATTRIBUTE_VALUE_LENGTH SIZEOF(ATTRIBUTE_VALUE) - 1
+
+//Define to 0 for slight speedup improvements, no errors
+#define DEBUGGING 1
+//Length of error messages
+#define ERR_MSG_LEN 500
+
+/*The different kind of nodes we can have*/
+enum TMPL_tagtype{
+	tag_null 	=  0,/*Should never show up*/
+	tag_text 	=  1,/*A text sequence*/
+	tag_var 	=  2,/*A variable to replace*/
+	tag_if 		=  3,/*If*/
+	tag_elseif 	=  4,/*Else if*/
+	tag_else 	=  5,/*Else*/
+	tag_end 	=  6,/*end if, end loop*/
+	tag_loop 	=  7,/*Loop*/
+	tag_break 	=  9,/*Break*/
+	tag_continue 	= 10,/*Skip the rest of the loop and go again*/
+};
+
+struct TMPL_light_string{
+	const char* start;
+	size_t len;
+};
+
+enum TMPL_vartype{
+	vartype_loop,
+	vartype_var
+};
+
+
+struct TMPL_varlist{
+	map_t map;
+}TMPL_varlist;
+
+struct TMPL_loop{
+	struct TMPL_varlist* varlist;
+	size_t loop_len;
+	struct TMPL_loop* next;
+	struct TMPL_loop* tail;
+};
+
+struct TMPL_varitem{
+	enum TMPL_vartype type;
+	union {
+		struct TMPL_loop* l;
+		char* s;
+	}item;
+};
+
+/*Holds all the data needed for a single node in a template*/
+struct TMPL_tagnode{
+	enum TMPL_tagtype type;
+	struct TMPL_tagnode* next;
+	union{
+		/*Text*/
+		struct{
+			const char* start;
+			size_t len;
+		}text;
+		/*Var*/
+		struct{
+			char* varname;
+			size_t name_len;
+			char* defaultval;
+			size_t default_len;
+		}var;
+
+		/*If, elseif*/
+		struct{
+			char* varname;
+			char* testval;
+			struct TMPL_tagnode* tbranch;
+			struct TMPL_tagnode* fbranch;
+		}ifelse;
+
+		/*Loop*/
+		struct{
+			char* loopname;
+			struct TMPL_tagnode* body;
+		}loop;
+
+		/*Break and Continue*/
+		struct{
+			int level;
+		}breakcont;
+	}TMPL_tag;
+}TMPL_tagnode;
+
+//typedef void (*TMPL_fmtfuncs) (const char*, struct TMPL_buf*);
+/*
+ * TMPL_fmtlist is a list of format functions, which are passed to
+ * a template.  A TMPL_VAR tag can specify a format function for
+ * outputting the variable with the fmt="fmtname" attribute.
+ */
+struct TMPL_fmtlist{
+	struct TMPL_fmtlist* next;
+	void* fmtfunc;
+	char* name;
+} TMPL_fmtlist;
+
+struct TMPL_varlist;
+struct TMPL_loop;
+
+/*
+ * TMPL_varlist is a variable list of simple variables and/or
+ * loop variables
+ */
+//struct TMPL_varlist {
+    //struct TMPL_varlist *next;  [> next variable list on a list <]
+    //struct TMPL_var   *var;     [> list of my simple variables <]
+    //struct TMPL_loop  *loop;    [> list of my loop variables <]
+    //struct TMPL_loop  *parent;  [> my parent loop variable (if any) <]
+//};
+
+/* TMPL_loop is a loop variable, which is a list of variable lists */
+
+//struct TMPL_loop {
+    //struct TMPL_loop *next;       [> next loop variable on a list <]
+    //const char *name;      [> my name <]
+    //struct TMPL_varlist *varlist; [> list of my variable lists <]
+    //struct TMPL_varlist *tail;    [> tail of "varlist" <]
+    //struct TMPL_varlist *parent;  [> my parent variable list <]
+//};
+
+/* Holdes all the data needed for a template*/
+struct TMPL_templates{
+	struct TMPL_buf* out;
+	struct TMPL_buf* errout;
+	struct TMPL_tagnode* roottag;
+	int linenum;
+	int error;
+} TMPL_templates;
+
+
+struct TMPL_token{
+	char* start;//Start of token
+	char* end;//End of token
+	enum TMPL_tagtype type;//The type of token
+	size_t length;//Length of token, should always be end-start
+	struct TMPL_token* next;//The next token
+}TMPL_token;
+
+
+
+typedef void (*TMPL_fmtfunc) (const char *, FILE *);
+
+/*
+
+TMPL_varlist *TMPL_add_var(TMPL_varlist *varlist,
+    const char *varname1, const char *value1, ... , 0);
+*/
+
+//TMPL_varlist *TMPL_add_var(TMPL_varlist *varlist, ...);
+extern struct TMPL_varlist* TMPL_add_var(struct TMPL_varlist* varlist, ...);
+
+/*TMPL_varlist *TMPL_add_loop(TMPL_varlist *varlist,
+    const char *name, TMPL_loop *loop);
+    */
+extern struct TMPL_varlist* TMPL_add_loop(struct TMPL_varlist* varlist,
+	const char* name, struct TMPL_loop* loop);
+
+
+//TMPL_loop *TMPL_add_varlist(TMPL_loop *loop, TMPL_varlist *varlist);
+struct TMPL_loop* TMPL_add_varlist(struct TMPL_loop* loop, struct TMPL_varlist* varlist);
+
+//void TMPL_free_varlist(TMPL_varlist *varlist);
+void TMPL_free_varlist(struct TMPL_varlist* varlist);
+
+//TMPL_fmtlist *TMPL_add_fmt(TMPL_fmtlist *fmtlist,
+    //const char *name, TMPL_fmtfunc fmtfunc);
+struct TMPL_fmtlist* TMPL_add_fmt(struct TMPL_fmtlist* fmtlist,
+	const char* name, void* fmtfunc);
+
+void TMPL_free_fmtlist(struct TMPL_fmtlist* fmtlist);
+
+/*int TMPL_write(const char *filename, const char *tmplstr,
+    const TMPL_fmtlist *fmtlist, const TMPL_varlist *varlist,
+    FILE *out, FILE *errout);
+*/
+
+struct TMPL_varlist* TMPL_alloc_varlist();
+void                 TMPL_free_varlist(struct TMPL_varlist* t);
+
+struct TMPL_varitem* TMPL_alloc_varitem();
+void TMPL_free_varitem(struct TMPL_varitem* vi);
+
+struct TMPL_templates* TMPL_alloc_template(char* t);
+void                   TMPL_free_template(struct TMPL_templates* t);
+
+char* TMPL_render(struct TMPL_templates* t, struct TMPL_varlist* varlist);
+
+struct TMPL_tagnode* TMPL_alloc_tagnode(enum TMPL_tagtype);
+void TMPL_free_tagnode(struct TMPL_tagnode* tn);
+
+/* TODO: Remove this after testing is done */
+struct TMPL_token* TMPL_tokenize(char* tmplstr, size_t strlen);
+
+
+#endif
diff --git a/fbuf.c b/fbuf.c
new file mode 100644
index 0000000..9ce4163
--- /dev/null
+++ b/fbuf.c
@@ -0,0 +1,121 @@
+#include "fbuf.h"
+
+void bputc(struct TMPL_buf* b,char s){
+	if(b->head == NULL){
+		struct LLNode* new = (struct LLNode*)malloc(sizeof(struct LLNode));
+		new->length = 1;
+		new->data = (char*)malloc(sizeof(char));
+		new->data[0] = s;
+		new->next = NULL;
+		b->total_len = 1;
+		b->head = new;
+		b->tail = new;
+	}else{
+		struct LLNode* last = b->tail;
+		struct LLNode* new = (struct LLNode*)malloc(sizeof(struct LLNode));
+		new->length = 1;
+		new->data = (char*)malloc(sizeof(char));
+		new->data[0] = s;
+		new->next = NULL;
+		b->total_len += new->length;
+		last->next = new;
+		b->tail = new;
+	}
+}
+
+void bputsn(struct TMPL_buf* b, char* s, size_t size){
+	if(b->head == NULL){
+		struct LLNode* new = (struct LLNode*)malloc(sizeof(struct LLNode));
+		new->length = size;
+		new->data = (char*)malloc(sizeof(char)*size);
+		memcpy(new->data,s,size);
+		b->total_len = size;
+		b->head = new;
+		b->tail = new;
+		new->next = NULL;
+	}else{
+		struct LLNode* last = b->tail;
+		struct LLNode* new = (struct LLNode*)malloc(sizeof(struct LLNode));
+		new->length = size;
+		new->data = (char*)malloc(sizeof(char)*size);
+		memcpy(new->data,s,size);
+		last->next = new;
+		new->next = NULL;
+		b->tail = new;
+		b->total_len += size;
+	}
+}
+
+void bputs(struct TMPL_buf* b, char* s){
+	size_t len = strlen(s);
+	bputsn(b,s,len);
+}
+
+struct TMPL_buf* alloc_tmpl_buf(){
+	struct TMPL_buf* ret = (struct TMPL_buf*)malloc(sizeof(struct TMPL_buf));
+	ret->total_len = 0;
+	ret->head = NULL;
+	ret->tail = NULL;
+	return ret;
+}
+
+void free_llnodes(struct LLNode* l){
+	struct LLNode* cursor = l;
+	struct LLNode* next;
+	while(cursor != NULL){
+		next = cursor->next;
+		free(cursor->data);
+		free(cursor);
+		cursor = next;
+	}
+}
+
+void free_tmpl_buf(struct TMPL_buf* b){
+	free_llnodes(b->head);
+	free(b);
+}
+
+void bprint(struct TMPL_buf* b){
+	printf("-------------\n");
+	struct LLNode* cursor = b->head;
+	while(cursor != NULL){
+		printf("Cursor is %p\n",(void*)cursor);
+		printf("Length:%d\nData:",(int)cursor->length);
+		char* cb = cursor->data;
+		size_t cn;
+		for(cn = 0; cn < cursor->length; cn++){
+			printf("%c",*cb);
+			cb++;
+		}
+		cursor = cursor->next;
+		printf("\n-------------\n");
+	}
+	printf("Done printing\n");
+	printf("-----------------------\n");
+
+}
+
+char* bstringify(struct TMPL_buf* b, size_t* size){
+	struct LLNode* cursora = b->head;
+	size_t cursorb = 0;
+
+	struct LLNode* single = (struct LLNode*)malloc(sizeof(struct LLNode));
+	single->length = b->total_len;
+	single->data = (char*)malloc(sizeof(char)*(b->total_len + 1));
+	single->data[b->total_len] = '\0';
+	single->next = NULL;
+	
+	while(cursora != NULL){
+		memcpy(single->data + cursorb,cursora->data,cursora->length);
+		cursorb += cursora->length;
+		cursora = cursora->next;
+	}
+
+	free_llnodes(b->head);
+
+	b->head = single;
+	b->tail = single;
+	*size = b->total_len;
+
+	return single->data;
+}
diff --git a/fbuf.h b/fbuf.h
new file mode 100644
index 0000000..1d90493
--- /dev/null
+++ b/fbuf.h
@@ -0,0 +1,29 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+
+/*Oh boy, CS101 linked lists*/
+struct LLNode{
+	size_t length;
+	char* data;
+	struct LLNode* next;
+};
+
+struct TMPL_buf{
+	size_t total_len;
+	struct LLNode* head;
+	struct LLNode* tail;
+};
+
+void bputs(struct TMPL_buf* b, char* s);
+void bputsn(struct TMPL_buf* b, char* s, size_t size);
+
+void bputc(struct TMPL_buf* b, char s);
+
+struct TMPL_buf* alloc_tmpl_buf();
+
+void free_tmpl_buf(struct TMPL_buf* b);
+
+char* bstringify(struct TMPL_buf* b, size_t* size);
+
+void bprint(struct TMPL_buf* b);
diff --git a/hashmap.c b/hashmap.c
new file mode 100644
index 0000000..f91e743
--- /dev/null
+++ b/hashmap.c
@@ -0,0 +1,397 @@
+/*
+ * Generic map implementation.
+ */
+#include "hashmap.h"
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+
+#define INITIAL_SIZE (256)
+#define MAX_CHAIN_LENGTH (8)
+
+/* We need to keep keys and values */
+typedef struct _hashmap_element{
+	char* key;
+	int in_use;
+	any_t data;
+} hashmap_element;
+
+/* A hashmap has some maximum size and current size,
+ * as well as the data to hold. */
+typedef struct _hashmap_map{
+	int table_size;
+	int size;
+	hashmap_element *data;
+} hashmap_map;
+
+/*
+ * Return an empty hashmap, or NULL on failure.
+ */
+map_t hashmap_new() {
+	hashmap_map* m = (hashmap_map*) malloc(sizeof(hashmap_map));
+	if(!m) goto err;
+
+	m->data = (hashmap_element*) calloc(INITIAL_SIZE, sizeof(hashmap_element));
+	if(!m->data) goto err;
+
+	m->table_size = INITIAL_SIZE;
+	m->size = 0;
+
+	return m;
+	err:
+		if (m)
+			hashmap_free(m);
+		return NULL;
+}
+
+/* The implementation here was originally done by Gary S. Brown.  I have
+   borrowed the tables directly, and made some minor changes to the
+   crc32-function (including changing the interface). //ylo */
+
+  /* ============================================================= */
+  /*  COPYRIGHT (C) 1986 Gary S. Brown.  You may use this program, or       */
+  /*  code or tables extracted from it, as desired without restriction.     */
+  /*                                                                        */
+  /*  First, the polynomial itself and its table of feedback terms.  The    */
+  /*  polynomial is                                                         */
+  /*  X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0   */
+  /*                                                                        */
+  /*  Note that we take it "backwards" and put the highest-order term in    */
+  /*  the lowest-order bit.  The X^32 term is "implied"; the LSB is the     */
+  /*  X^31 term, etc.  The X^0 term (usually shown as "+1") results in      */
+  /*  the MSB being 1.                                                      */
+  /*                                                                        */
+  /*  Note that the usual hardware shift register implementation, which     */
+  /*  is what we're using (we're merely optimizing it by doing eight-bit    */
+  /*  chunks at a time) shifts bits into the lowest-order term.  In our     */
+  /*  implementation, that means shifting towards the right.  Why do we     */
+  /*  do it this way?  Because the calculated CRC must be transmitted in    */
+  /*  order from highest-order term to lowest-order term.  UARTs transmit   */
+  /*  characters in order from LSB to MSB.  By storing the CRC this way,    */
+  /*  we hand it to the UART in the order low-byte to high-byte; the UART   */
+  /*  sends each low-bit to hight-bit; and the result is transmission bit   */
+  /*  by bit from highest- to lowest-order term without requiring any bit   */
+  /*  shuffling on our part.  Reception works similarly.                    */
+  /*                                                                        */
+  /*  The feedback terms table consists of 256, 32-bit entries.  Notes:     */
+  /*                                                                        */
+  /*      The table can be generated at runtime if desired; code to do so   */
+  /*      is shown later.  It might not be obvious, but the feedback        */
+  /*      terms simply represent the results of eight shift/xor opera-      */
+  /*      tions for all combinations of data and CRC register values.       */
+  /*                                                                        */
+  /*      The values must be right-shifted by eight bits by the "updcrc"    */
+  /*      logic; the shift must be unsigned (bring in zeroes).  On some     */
+  /*      hardware you could probably optimize the shift in assembler by    */
+  /*      using byte-swap instructions.                                     */
+  /*      polynomial $edb88320                                              */
+  /*                                                                        */
+  /*  --------------------------------------------------------------------  */
+
+static unsigned long crc32_tab[] = {
+      0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
+      0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
+      0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
+      0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
+      0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
+      0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
+      0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
+      0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
+      0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
+      0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
+      0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
+      0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
+      0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
+      0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
+      0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
+      0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
+      0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
+      0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
+      0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
+      0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
+      0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
+      0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
+      0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
+      0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
+      0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
+      0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
+      0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
+      0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
+      0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
+      0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
+      0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
+      0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
+      0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
+      0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
+      0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
+      0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
+      0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
+      0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
+      0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
+      0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
+      0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
+      0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
+      0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
+      0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
+      0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
+      0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
+      0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
+      0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
+      0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
+      0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
+      0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
+      0x2d02ef8dL
+   };
+
+/* Return a 32-bit CRC of the contents of the buffer. */
+
+unsigned long crc32(const unsigned char *s, unsigned int len)
+{
+  unsigned int i;
+  unsigned long crc32val;
+
+  crc32val = 0;
+  for (i = 0;  i < len;  i ++)
+    {
+      crc32val =
+	crc32_tab[(crc32val ^ s[i]) & 0xff] ^
+	  (crc32val >> 8);
+    }
+  return crc32val;
+}
+
+/*
+ * Hashing function for a string
+ */
+unsigned int hashmap_hash_int(hashmap_map * m, char* keystring){
+
+    unsigned long key = crc32((unsigned char*)(keystring), strlen(keystring));
+
+	/* Robert Jenkins' 32 bit Mix Function */
+	key += (key << 12);
+	key ^= (key >> 22);
+	key += (key << 4);
+	key ^= (key >> 9);
+	key += (key << 10);
+	key ^= (key >> 2);
+	key += (key << 7);
+	key ^= (key >> 12);
+
+	/* Knuth's Multiplicative Method */
+	key = (key >> 3) * 2654435761;
+
+	return key % m->table_size;
+}
+
+/*
+ * Return the integer of the location in data
+ * to store the point to the item, or MAP_FULL.
+ */
+int hashmap_hash(map_t in, char* key){
+	int curr;
+	int i;
+
+	/* Cast the hashmap */
+	hashmap_map* m = (hashmap_map *) in;
+
+	/* If full, return immediately */
+	if(m->size >= (m->table_size/2)) return MAP_FULL;
+
+	/* Find the best index */
+	curr = hashmap_hash_int(m, key);
+
+	/* Linear probing */
+	for(i = 0; i< MAX_CHAIN_LENGTH; i++){
+		if(m->data[curr].in_use == 0)
+			return curr;
+
+		if(m->data[curr].in_use == 1 && (strcmp(m->data[curr].key,key)==0))
+			return curr;
+
+		curr = (curr + 1) % m->table_size;
+	}
+
+	return MAP_FULL;
+}
+
+/*
+ * Doubles the size of the hashmap, and rehashes all the elements
+ */
+int hashmap_rehash(map_t in){
+	int i;
+	int old_size;
+	hashmap_element* curr;
+
+	/* Setup the new elements */
+	hashmap_map *m = (hashmap_map *) in;
+	hashmap_element* temp = (hashmap_element *)
+		calloc(2 * m->table_size, sizeof(hashmap_element));
+	if(!temp) return MAP_OMEM;
+
+	/* Update the array */
+	curr = m->data;
+	m->data = temp;
+
+	/* Update the size */
+	old_size = m->table_size;
+	m->table_size = 2 * m->table_size;
+	m->size = 0;
+
+	/* Rehash the elements */
+	for(i = 0; i < old_size; i++){
+        int status;
+
+        if (curr[i].in_use == 0)
+            continue;
+
+		status = hashmap_put(m, curr[i].key, curr[i].data);
+		if (status != MAP_OK)
+			return status;
+	}
+
+	free(curr);
+
+	return MAP_OK;
+}
+
+/*
+ * Add a pointer to the hashmap with some key
+ */
+int hashmap_put(map_t in, char* key, any_t value){
+	int index;
+	hashmap_map* m;
+
+	/* Cast the hashmap */
+	m = (hashmap_map *) in;
+
+	/* Find a place to put our value */
+	index = hashmap_hash(in, key);
+	while(index == MAP_FULL){
+		if (hashmap_rehash(in) == MAP_OMEM) {
+			return MAP_OMEM;
+		}
+		index = hashmap_hash(in, key);
+	}
+
+	/* Set the data */
+	m->data[index].data = value;
+	m->data[index].key = key;
+	m->data[index].in_use = 1;
+	m->size++;
+
+	return MAP_OK;
+}
+
+/*
+ * Get your pointer out of the hashmap with a key
+ */
+int hashmap_get(map_t in, char* key, any_t *arg){
+	int curr;
+	int i;
+	hashmap_map* m;
+
+	/* Cast the hashmap */
+	m = (hashmap_map *) in;
+
+	/* Find data location */
+	curr = hashmap_hash_int(m, key);
+
+	/* Linear probing, if necessary */
+	for(i = 0; i<MAX_CHAIN_LENGTH; i++){
+
+        int in_use = m->data[curr].in_use;
+        if (in_use == 1){
+            if (strcmp(m->data[curr].key,key)==0){
+                *arg = (m->data[curr].data);
+                return MAP_OK;
+            }
+		}
+
+		curr = (curr + 1) % m->table_size;
+	}
+
+	*arg = NULL;
+
+	/* Not found */
+	return MAP_MISSING;
+}
+
+/*
+ * Iterate the function parameter over each element in the hashmap.  The
+ * additional any_t argument is passed to the function as its first
+ * argument and the hashmap element is the second.
+ */
+int hashmap_iterate(map_t in, PFany f, any_t item) {
+	int i;
+
+	/* Cast the hashmap */
+	hashmap_map* m = (hashmap_map*) in;
+
+	/* On empty hashmap, return immediately */
+	if (hashmap_length(m) <= 0)
+		return MAP_MISSING;
+
+	/* Linear probing */
+	for(i = 0; i< m->table_size; i++)
+		if(m->data[i].in_use != 0) {
+			any_t data = (any_t) (m->data[i].data);
+			int status = f(item, data);
+			if (status != MAP_OK) {
+				return status;
+			}
+		}
+
+    return MAP_OK;
+}
+
+/*
+ * Remove an element with that key from the map
+ */
+int hashmap_remove(map_t in, char* key){
+	int i;
+	int curr;
+	hashmap_map* m;
+
+	/* Cast the hashmap */
+	m = (hashmap_map *) in;
+
+	/* Find key */
+	curr = hashmap_hash_int(m, key);
+
+	/* Linear probing, if necessary */
+	for(i = 0; i<MAX_CHAIN_LENGTH; i++){
+
+        int in_use = m->data[curr].in_use;
+        if (in_use == 1){
+            if (strcmp(m->data[curr].key,key)==0){
+                /* Blank out the fields */
+                m->data[curr].in_use = 0;
+                m->data[curr].data = NULL;
+                m->data[curr].key = NULL;
+
+                /* Reduce the size */
+                m->size--;
+                return MAP_OK;
+            }
+		}
+		curr = (curr + 1) % m->table_size;
+	}
+
+	/* Data not found */
+	return MAP_MISSING;
+}
+
+/* Deallocate the hashmap */
+void hashmap_free(map_t in){
+	hashmap_map* m = (hashmap_map*) in;
+	free(m->data);
+	free(m);
+}
+
+/* Return the length of the hashmap */
+int hashmap_length(map_t in){
+	hashmap_map* m = (hashmap_map *) in;
+	if(m != NULL) return m->size;
+	else return 0;
+}
diff --git a/hashmap.h b/hashmap.h
new file mode 100644
index 0000000..16c76dd
--- /dev/null
+++ b/hashmap.h
@@ -0,0 +1,81 @@
+/*
+ * Generic hashmap manipulation functions
+ *
+ * Originally by Elliot C Back - http://elliottback.com/wp/hashmap-implementation-in-c/
+ *
+ * Modified by Pete Warden to fix a serious performance problem, support strings as keys
+ * and removed thread synchronization - http://petewarden.typepad.com
+ */
+#ifndef __HASHMAP_H__
+#define __HASHMAP_H__
+
+#define MAP_MISSING -3  /* No such element */
+#define MAP_FULL -2 	/* Hashmap is full */
+#define MAP_OMEM -1 	/* Out of Memory */
+#define MAP_OK 0 	/* OK */
+
+/*
+ * any_t is a pointer.  This allows you to put arbitrary structures in
+ * the hashmap.
+ */
+typedef void *any_t;
+
+/*
+ * PFany is a pointer to a function that can take two any_t arguments
+ * and return an integer. Returns status code..
+ */
+typedef int (*PFany)(any_t, any_t);
+
+/*
+ * map_t is a pointer to an internally maintained data structure.
+ * Clients of this package do not need to know how hashmaps are
+ * represented.  They see and manipulate only map_t's.
+ */
+typedef any_t map_t;
+
+/*
+ * Return an empty hashmap. Returns NULL if empty.
+*/
+extern map_t hashmap_new();
+
+/*
+ * Iteratively call f with argument (item, data) for
+ * each element data in the hashmap. The function must
+ * return a map status code. If it returns anything other
+ * than MAP_OK the traversal is terminated. f must
+ * not reenter any hashmap functions, or deadlock may arise.
+ */
+extern int hashmap_iterate(map_t in, PFany f, any_t item);
+
+/*
+ * Add an element to the hashmap. Return MAP_OK or MAP_OMEM.
+ */
+extern int hashmap_put(map_t in, char* key, any_t value);
+
+/*
+ * Get an element from the hashmap. Return MAP_OK or MAP_MISSING.
+ */
+extern int hashmap_get(map_t in, char* key, any_t *arg);
+
+/*
+ * Remove an element from the hashmap. Return MAP_OK or MAP_MISSING.
+ */
+extern int hashmap_remove(map_t in, char* key);
+
+/*
+ * Get any element. Return MAP_OK or MAP_MISSING.
+ * remove - should the element be removed from the hashmap
+ */
+extern int hashmap_get_one(map_t in, any_t *arg, int remove);
+
+/*
+ * Free the hashmap
+ */
+extern void hashmap_free(map_t in);
+
+/*
+ * Get the current size of a hashmap
+ */
+extern int hashmap_length(map_t in);
+
+#endif //__HASHMAP_H__
diff --git a/kmp.c b/kmp.c
new file mode 100644
index 0000000..d5923bf
--- /dev/null
+++ b/kmp.c
@@ -0,0 +1,70 @@
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include "kmp.h"
+
+/* KMP implementation stolen from Github user cagdass*/
+
+int* init_array(int size) {
+  int* arr = (int*)malloc(size * sizeof(int));
+  int i;
+  for(i = 0; i < size; i++) {
+    arr[i] = 0;
+  }
+
+  return arr;
+}
+
+int kmp(char* t,size_t tlen, char* p,size_t plen) {
+  int m = plen;
+  int n = tlen;
+
+  int* f = init_array(m); // Failure function values.
+  int i = 0;
+  int j = 0;
+
+  while (i < n) {
+    if (t[i] == p[j]) {
+      if (j == m - 1) {
+        return i - j;
+      }
+      else {
+        i += 1;
+        j += 1;
+      }
+    }
+    else {
+      if (j > 0) {
+        j = f[j-1];
+      }
+      else {
+        i += 1;
+      }
+    }
+  }
+
+  return -1;
+}
+
+void failure(char* p, int* f) {
+  f[0] = 0;
+  int i = 1;
+  int j = 0;
+
+  int m = strlen(p);
+
+  while (i < m) {
+    if (p[i] == p[j]) {
+      f[i] = j + 1; // j+1 matches up to the current character.
+      i += 1;
+      j += 1;
+    }
+    else if (j > 0) {
+      j = f[j - 1];
+    }
+    else {
+      f[i] = 0;
+      i += 1;
+    }
+  }
+}
diff --git a/kmp.h b/kmp.h
new file mode 100644
index 0000000..24c609e
--- /dev/null
+++ b/kmp.h
@@ -0,0 +1,3 @@
+
+void failure(char* pattern, int* f);
+int kmp(char* t,size_t tlen, char* p,size_t plen);