# HG changeset patch
# User lost
# Date 1233035514 0
# Node ID 235bdd281e1e9ab250af97768550f697b5189db5
# Parent 6286b5ea82abd3ddcbe12875dabec0204ed17f7e
Branched for release 1.0
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/COPYING
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/COPYING Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ 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.
+
+
+ Copyright (C)
+
+ 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 .
+
+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:
+
+ Copyright (C)
+ 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
+.
+
+ 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
+.
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/INSTALL
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/INSTALL Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,237 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005,
+2006, 2007 Free Software Foundation, Inc.
+
+This file is free documentation; the Free Software Foundation gives
+unlimited permission to copy, distribute and modify it.
+
+Basic Installation
+==================
+
+Briefly, the shell commands `./configure; make; make install' should
+configure, build, and install this package. The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.
+
+ The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation. It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions. Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+ It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring. Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+ If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release. If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+ The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'. You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+The simplest way to compile this package is:
+
+ 1. `cd' to the directory containing the package's source code and type
+ `./configure' to configure the package for your system.
+
+ Running `configure' might take a while. While running, it prints
+ some messages telling which features it is checking for.
+
+ 2. Type `make' to compile the package.
+
+ 3. Optionally, type `make check' to run any self-tests that come with
+ the package.
+
+ 4. Type `make install' to install the programs and any data files and
+ documentation.
+
+ 5. You can remove the program binaries and object files from the
+ source code directory by typing `make clean'. To also remove the
+ files that `configure' created (so you can compile the package for
+ a different kind of computer), type `make distclean'. There is
+ also a `make maintainer-clean' target, but that is intended mainly
+ for the package's developers. If you use it, you may have to get
+ all sorts of other programs in order to regenerate files that came
+ with the distribution.
+
+ 6. Often, you can also type `make uninstall' to remove the installed
+ files again.
+
+Compilers and Options
+=====================
+
+Some systems require unusual options for compilation or linking that the
+`configure' script does not know about. Run `./configure --help' for
+details on some of the pertinent environment variables.
+
+ You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment. Here
+is an example:
+
+ ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+ *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory. To do this, you can use GNU `make'. `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script. `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.
+
+ With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory. After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+Installation Names
+==================
+
+By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc. You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX'.
+
+ You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files. If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+ In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files. Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.
+
+ If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+Optional Features
+=================
+
+Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System). The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+ For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+Specifying the System Type
+==========================
+
+There may be some features `configure' cannot figure out automatically,
+but needs to determine by the type of machine the package will run on.
+Usually, assuming the package is built to be run on the _same_
+architectures, `configure' can figure that out, but if it prints a
+message saying it cannot guess the machine type, give it the
+`--build=TYPE' option. TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+ CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+ OS KERNEL-OS
+
+ See the file `config.sub' for the possible values of each field. If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+ If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+ If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+If you want to set default values for `configure' scripts to share, you
+can create a site shell script called `config.site' that gives default
+values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists. Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+Variables not defined in a site shell script can be set in the
+environment passed to `configure'. However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost. In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'. For example:
+
+ ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf bug. Until the bug is fixed you can use this workaround:
+
+ CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+`configure' recognizes the following options to control how it operates.
+
+`--help'
+`-h'
+ Print a summary of the options to `configure', and exit.
+
+`--version'
+`-V'
+ Print the version of Autoconf used to generate the `configure'
+ script, and exit.
+
+`--cache-file=FILE'
+ Enable the cache: use and save the results of the tests in FILE,
+ traditionally `config.cache'. FILE defaults to `/dev/null' to
+ disable caching.
+
+`--config-cache'
+`-C'
+ Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+ Do not print messages saying which checks are being made. To
+ suppress all normal output, redirect it to `/dev/null' (any error
+ messages will still be shown).
+
+`--srcdir=DIR'
+ Look for the package's source code in directory DIR. Usually
+ `configure' can determine that directory automatically.
+
+`configure' also accepts some other, not widely useful, options. Run
+`configure --help' for more details.
+
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/Makefile.am
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/Makefile.am Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,2 @@
+SUBDIRS = src
+DIST_SUBDIRS = doc src
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/README
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/README Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,5 @@
+This distribution constitutes the LWLINK linker software. It is a companion
+to the LWASM cross-assembler.
+
+All files that form a part of this distribution use the UTF8 character
+encoding method unless otherwise noted.
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/README.MAINT
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/README.MAINT Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,39 @@
+This file is intended for source package maintainers/distributors.
+
+Before a release is made, a branch for that release must be made. Within
+that branch, all files that will be distributed with the particular release
+must be generated and added to the repository on that branch. Once the
+release is deemed stable and ready for release, the release tag should
+be generated from the head of that particular branch. Thus all release
+series will have the autotool generated files in the repository.
+
+Any branch not directly intended to be a release need not include the
+autotool generated files.
+
+The trunk development stream must not include the autotool generated files
+as these are likely to change rapidly and it can cause a great deal of
+confusion for little gain.
+
+By including the generated files in the release branches, it is possible
+to replicate any problems users of the package may have, including if it
+is due to problems with the autotools themselves.
+
+
+Naming of branches and tags should conform to the following guidlines.
+
+1. any branch leading to a release series must be named as the base revision
+of the series. Thus, for a 1.0 release, the branch is called 1.0 and will
+contain the results for a 1.0 release, a 1.0.1 release, and so on. If a
+sub-release will occur, say under 1.0.1, then a branch named "1.0.1" would
+be created and then releases such as 1.0.1.1 would be created. This should
+be avoided if at all possible.
+
+2. any tag for a specific release version will be named as the release. So
+for a 1.0 release, the name would be "1.0". For version 1.0.1.1, the name
+would be "1.0.1.1".
+
+3. branches not associated with a release stream - say for feature development
+or what have you should be named sensibly and should be removed when no longer
+needed. They must not appear to be version numbers.
+
+4. tags not specifying a release must not look like version numbers
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/configure.ac
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/configure.ac Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,10 @@
+AC_INIT([LWLINK], [1.0], [lost@l-w.ca])
+AM_INIT_AUTOMAKE([-Wall -Werror foreign])
+AC_PROG_CC
+AC_CONFIG_HEADERS([src/config.h])
+AC_CONFIG_FILES([
+ Makefile
+ src/Makefile
+ doc/Makefile
+])
+AC_OUTPUT
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/doc/Makefile.am
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/doc/Makefile.am Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,2 @@
+EXTRA_DIST = lwlink.txt scripts.txt
+
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/doc/lwlink.txt
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/doc/lwlink.txt Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,51 @@
+This is the companion linker to LWASM. It reads object files generated by
+LWASM and combines them into an actual binary.
+
+During linking, each file is read into memory. A list of externally
+referenced symbols is made along with where these symbols are referenced.
+Each external reference is checked against all previously loaded files (in
+order of loading) and if a match is found, a note of that fact is made and a
+link between the previously loaded file and the current reference.
+
+Once all files are loaded, the symbol table is checked for any symbols which
+are still unresolved. If any are found, the linking process complains and
+bails out.
+
+Once all the object files have been read, the linker follows a
+pre-determined script for the specified target or a script supplied by the
+user to lay out the binary. The instructions from the script are followed
+blindly as it is assumed the user knows what he is doing.
+
+For each defined section, the linker begins constructing the section data by
+resolving each instance of that section in the order it was encountered. All
+symbols defined by that section (local or exported) are assigned addresses.
+The exact offset into the final section data is recorded for any incomplete
+references in that section. All section base address references are resolved
+to actual addresses at this stage.
+
+Once all sections have been laid out and addresses assigned to all symbols,
+all incomplete references are resolved and the resulting value placed into
+the appropriate data stream. If any references cannot be resolved at this
+stage, the linker will complain and bail out.
+
+Once all sections, symbols, and incomplete references have been resolved,
+the binary will output as appropriate for the specified target.
+
+See the file "scripts.txt" for information about linker scripts and the
+restrictions based on the output target.
+
+The following output targets are supported:
+
+Raw: this is a raw binary with no header information, etc. Suitable for ROM
+images, etc. By default, the raw target starts the binary at address 0, puts
+any section named "init" first, then "code", then all other non-bss
+sections, then all bss sections. Note that any "bss" type section that
+exists anywhere but at the end of the binary (i.e. is between or before one
+or more non-bss sections) will be included as a series of NUL bytes.
+
+DECB: this creates a LOADM style binary according to the linker script. By
+default, this target places the sections in the same order as the raw target
+but implements a load address of $2000. bss sections will not be included in
+the actual output. If a bss section appears between two non-bss sections, a
+new output block will be created in the output file.
+
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/doc/scripts.txt
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/doc/scripts.txt Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,63 @@
+LWLINK linker scripts
+
+A linker script is used to instruct the linker about how to assemble the
+various sections into a completed binary. It consists of a series of
+directives which are considered in the order they are encountered. Any
+section not referenced by a directive is assumed to be loaded after the
+final section explicitly referenced.
+
+The sections will appear in the resulting binary in the order they are
+specified in the script file.
+
+If a referenced section is not found, the linker will behave as though the
+section did exist but had a zero size, no relocations, and no exports.
+
+A section may only be referenced once. Any subsequent references will have
+no effect.
+
+All numbers are hexadecimal.
+
+section load
+
+This causes the section to load at . For raw target, only one
+"load at" entry is allowed for non-bss sections and it must be the first
+one. For raw targets, it affects the addresses the linker assigns to symbols
+but has no other affect on the output. bss sections may all have separate
+load addresses but since they will not appear in the binary anyway, this is
+okay.
+
+For the DECB target, each "load" entry will cause a new "block" to be
+output to the binary which will contain the load address. It is legal for
+sections to overlap in this manner - the linker assumes the loader will sort
+everything out.
+
+section
+
+This will cause the section to load after the previously listed
+section.
+
+exec
+
+This will cause the execution address (entry point) to be the address
+specified (in hex) *or* the specified symbol name. The symbol name must
+match a symbol that is exported by one of the object files being linked.
+This has no effect for targets that do not encode the entry point into the
+resulting file. If not specified, the entry point is assumed to be address 0
+which is probably not what you want. The default link scripts for targets
+that support this directive automatically starts at the beginning of the
+first section (usually "init" or "code") that is emitted in the binary.
+
+pad
+
+This will cause the output file to be padded with NUL bytes to be exactly
+ bytes in length. This only makes sense for a raw target.
+
+
+If is "*", then any section not already matched by the script will be
+matched. For format *, can be used to select sections which have
+particular flags set (or not set). For instance:
+
+*,!bss This would match all sections that do not have the bss flag set
+*,bss this would match all sections that do have the bss flag set
+
+
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/Makefile.am
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/Makefile.am Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,4 @@
+bin_PROGRAMS = lwlink lwobjdump
+lwlink_SOURCES = main.c lwlink.c util.c readfiles.c expr.c script.c link.c output.c
+lwobjdump_SOURCES = objdump.c util.c
+EXTRA_DIST = lwlink.h util.h expr.h
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/expr.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/expr.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,356 @@
+/*
+expr.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+*/
+
+/*
+This file contains the actual expression evaluator
+*/
+
+#define __expr_c_seen__
+
+#include
+#include
+#include
+
+#include "expr.h"
+#include "util.h"
+
+lw_expr_stack_t *lw_expr_stack_create(void)
+{
+ lw_expr_stack_t *s;
+
+ s = lw_malloc(sizeof(lw_expr_stack_t));
+ s -> head = NULL;
+ s -> tail = NULL;
+ return s;
+}
+
+void lw_expr_stack_free(lw_expr_stack_t *s)
+{
+ while (s -> head)
+ {
+ s -> tail = s -> head;
+ s -> head = s -> head -> next;
+ lw_expr_term_free(s -> tail -> term);
+ lw_free(s -> tail);
+ }
+ lw_free(s);
+}
+
+void lw_expr_term_free(lw_expr_term_t *t)
+{
+ if (t)
+ {
+ if (t -> term_type == LW_TERM_SYM)
+ lw_free(t -> symbol);
+ lw_free(t);
+ }
+}
+
+lw_expr_term_t *lw_expr_term_create_oper(int oper)
+{
+ lw_expr_term_t *t;
+
+ t = lw_malloc(sizeof(lw_expr_term_t));
+ t -> term_type = LW_TERM_OPER;
+ t -> value = oper;
+ return t;
+}
+
+lw_expr_term_t *lw_expr_term_create_int(int val)
+{
+ lw_expr_term_t *t;
+
+ t = lw_malloc(sizeof(lw_expr_term_t));
+ t -> term_type = LW_TERM_INT;
+ t -> value = val;
+ return t;
+}
+
+lw_expr_term_t *lw_expr_term_create_sym(char *sym, int symtype)
+{
+ lw_expr_term_t *t;
+
+ t = lw_malloc(sizeof(lw_expr_term_t));
+ t -> term_type = LW_TERM_SYM;
+ t -> symbol = lw_strdup(sym);
+ t -> value = symtype;
+ return t;
+}
+
+lw_expr_term_t *lw_expr_term_dup(lw_expr_term_t *t)
+{
+ switch (t -> term_type)
+ {
+ case LW_TERM_INT:
+ return lw_expr_term_create_int(t -> value);
+
+ case LW_TERM_OPER:
+ return lw_expr_term_create_oper(t -> value);
+
+ case LW_TERM_SYM:
+ return lw_expr_term_create_sym(t -> symbol, t -> value);
+
+ default:
+ exit(1);
+ }
+// can't get here
+}
+
+void lw_expr_stack_push(lw_expr_stack_t *s, lw_expr_term_t *t)
+{
+ lw_expr_stack_node_t *n;
+
+ if (!s)
+ {
+ exit(1);
+ }
+
+ n = lw_malloc(sizeof(lw_expr_stack_node_t));
+ n -> next = NULL;
+ n -> prev = s -> tail;
+ n -> term = lw_expr_term_dup(t);
+
+ if (s -> head)
+ {
+ s -> tail -> next = n;
+ s -> tail = n;
+ }
+ else
+ {
+ s -> head = n;
+ s -> tail = n;
+ }
+}
+
+lw_expr_term_t *lw_expr_stack_pop(lw_expr_stack_t *s)
+{
+ lw_expr_term_t *t;
+ lw_expr_stack_node_t *n;
+
+ if (!(s -> tail))
+ return NULL;
+
+ n = s -> tail;
+ s -> tail = n -> prev;
+ if (!(n -> prev))
+ {
+ s -> head = NULL;
+ }
+
+ t = n -> term;
+ n -> term = NULL;
+
+ lw_free(n);
+
+ return t;
+}
+
+/*
+take an expression stack s and scan for operations that can be completed
+
+return -1 on error, 0 on no error
+
+possible errors are: division by zero or unknown operator
+
+theory of operation:
+
+scan the stack for an operator which has two constants preceding it (binary)
+or 1 constant preceding it (unary) and if found, perform the calculation
+and replace the operator and its operands with the result
+
+repeat the scan until no futher simplications are found or if there are no
+further operators or only a single term remains
+
+*/
+int lw_expr_reval(lw_expr_stack_t *s, lw_expr_stack_t *(*sfunc)(char *sym, int stype, void *state), void *state)
+{
+ lw_expr_stack_node_t *n, *n2;
+ lw_expr_stack_t *ss;
+ int c;
+
+next_iter_sym:
+ // resolve symbols
+ // symbols that do not resolve to an expression are left alone
+ for (c = 0, n = s -> head; n; n = n -> next)
+ {
+ if (n -> term -> term_type == LW_TERM_SYM)
+ {
+ ss = sfunc(n -> term -> symbol, n -> term -> value, state);
+ if (ss)
+ {
+ c++;
+ // splice in the result stack
+ if (n -> prev)
+ {
+ n -> prev -> next = ss -> head;
+ }
+ else
+ {
+ s -> head = ss -> head;
+ }
+ ss -> head -> prev = n -> prev;
+ ss -> tail -> next = n -> next;
+ if (n -> next)
+ {
+ n -> next -> prev = ss -> tail;
+ }
+ else
+ {
+ s -> tail = ss -> tail;
+ }
+ lw_expr_term_free(n -> term);
+ lw_free(n);
+ n = ss -> tail;
+
+ ss -> head = NULL;
+ ss -> tail = NULL;
+ lw_expr_stack_free(ss);
+ }
+ }
+ }
+ if (c)
+ goto next_iter_sym;
+
+next_iter:
+ // a single term
+ if (s -> head == s -> tail)
+ return 0;
+
+ // search for an operator
+ for (n = s -> head; n; n = n -> next)
+ {
+ if (n -> term -> term_type == LW_TERM_OPER)
+ {
+ if (n -> term -> value == LW_OPER_NEG
+ || n -> term -> value == LW_OPER_COM
+ )
+ {
+ // unary operator
+ if (n -> prev && n -> prev -> term -> term_type == LW_TERM_INT)
+ {
+ // a unary operator we can resolve
+ // we do the op then remove the term "n" is pointing at
+ if (n -> term -> value == LW_OPER_NEG)
+ {
+ n -> prev -> term -> value = -(n -> prev -> term -> value);
+ }
+ else if (n -> term -> value == LW_OPER_COM)
+ {
+ n -> prev -> term -> value = ~(n -> prev -> term -> value);
+ }
+ n -> prev -> next = n -> next;
+ if (n -> next)
+ n -> next -> prev = n -> prev;
+ else
+ s -> tail = n -> prev;
+
+ lw_expr_term_free(n -> term);
+ lw_free(n);
+ break;
+ }
+ }
+ else
+ {
+ // binary operator
+ if (n -> prev && n -> prev -> prev && n -> prev -> term -> term_type == LW_TERM_INT && n -> prev -> prev -> term -> term_type == LW_TERM_INT)
+ {
+ // a binary operator we can resolve
+ switch (n -> term -> value)
+ {
+ case LW_OPER_PLUS:
+ n -> prev -> prev -> term -> value += n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_MINUS:
+ n -> prev -> prev -> term -> value -= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_TIMES:
+ n -> prev -> prev -> term -> value *= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_DIVIDE:
+ if (n -> prev -> term -> value == 0)
+ return -1;
+ n -> prev -> prev -> term -> value /= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_MOD:
+ if (n -> prev -> term -> value == 0)
+ return -1;
+ n -> prev -> prev -> term -> value %= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_INTDIV:
+ if (n -> prev -> term -> value == 0)
+ return -1;
+ n -> prev -> prev -> term -> value /= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_BWAND:
+ n -> prev -> prev -> term -> value &= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_BWOR:
+ n -> prev -> prev -> term -> value |= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_BWXOR:
+ n -> prev -> prev -> term -> value ^= n -> prev -> term -> value;
+ break;
+
+ case LW_OPER_AND:
+ n -> prev -> prev -> term -> value = (n -> prev -> term -> value && n -> prev -> prev -> term -> value) ? 1 : 0;
+ break;
+
+ case LW_OPER_OR:
+ n -> prev -> prev -> term -> value = (n -> prev -> term -> value || n -> prev -> prev -> term -> value) ? 1 : 0;
+ break;
+
+ default:
+ // return error if unknown operator!
+ return -1;
+ }
+
+ // now remove the two unneeded entries from the stack
+ n -> prev -> prev -> next = n -> next;
+ if (n -> next)
+ n -> next -> prev = n -> prev -> prev;
+ else
+ s -> tail = n -> prev -> prev;
+
+ lw_expr_term_free(n -> term);
+ lw_expr_term_free(n -> prev -> term);
+ lw_free(n -> prev);
+ lw_free(n);
+ break;
+ }
+ }
+ }
+ }
+ // note for the terminally confused about dynamic memory and pointers:
+ // n will not be NULL even after the lw_free calls above so
+ // this test will still work (n will be a dangling pointer)
+ // (n will only be NULL if we didn't find any operators to simplify)
+ if (n)
+ goto next_iter;
+
+ return 0;
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/expr.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/expr.h Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,107 @@
+/*
+expr.h
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+*/
+
+/*
+Definitions for expression evaluator
+*/
+
+#ifndef __expr_h_seen__
+#define __expr_h_seen__
+
+#ifndef __expr_c_seen__
+#define __expr_E__ extern
+#else
+#define __expr_E__
+#endif
+
+// term types
+#define LW_TERM_NONE 0
+#define LW_TERM_OPER 1 // an operator
+#define LW_TERM_INT 2 // 32 bit signed integer
+#define LW_TERM_SYM 3 // symbol reference
+
+// operator types
+#define LW_OPER_NONE 0
+#define LW_OPER_PLUS 1 // +
+#define LW_OPER_MINUS 2 // -
+#define LW_OPER_TIMES 3 // *
+#define LW_OPER_DIVIDE 4 // /
+#define LW_OPER_MOD 5 // %
+#define LW_OPER_INTDIV 6 // \ (don't end line with \)
+#define LW_OPER_BWAND 7 // bitwise AND
+#define LW_OPER_BWOR 8 // bitwise OR
+#define LW_OPER_BWXOR 9 // bitwise XOR
+#define LW_OPER_AND 10 // boolean AND
+#define LW_OPER_OR 11 // boolean OR
+#define LW_OPER_NEG 12 // - unary negation (2's complement)
+#define LW_OPER_COM 13 // ^ unary 1's complement
+
+
+// term structure
+typedef struct lw_expr_term_s
+{
+ int term_type; // type of term (see above)
+ char *symbol; // name of a symbol
+ int value; // value of the term (int) or operator number (OPER)
+} lw_expr_term_t;
+
+// type for an expression evaluation stack
+typedef struct lw_expr_stack_node_s lw_expr_stack_node_t;
+struct lw_expr_stack_node_s
+{
+ lw_expr_term_t *term;
+ lw_expr_stack_node_t *prev;
+ lw_expr_stack_node_t *next;
+};
+
+typedef struct lw_expr_stack_s
+{
+ lw_expr_stack_node_t *head;
+ lw_expr_stack_node_t *tail;
+} lw_expr_stack_t;
+
+__expr_E__ void lw_expr_term_free(lw_expr_term_t *t);
+__expr_E__ lw_expr_term_t *lw_expr_term_create_oper(int oper);
+__expr_E__ lw_expr_term_t *lw_expr_term_create_sym(char *sym, int symtype);
+__expr_E__ lw_expr_term_t *lw_expr_term_create_int(int val);
+__expr_E__ lw_expr_term_t *lw_expr_term_dup(lw_expr_term_t *t);
+
+__expr_E__ void lw_expr_stack_free(lw_expr_stack_t *s);
+__expr_E__ lw_expr_stack_t *lw_expr_stack_create(void);
+
+__expr_E__ void lw_expr_stack_push(lw_expr_stack_t *s, lw_expr_term_t *t);
+__expr_E__ lw_expr_term_t *lw_expr_stack_pop(lw_expr_stack_t *s);
+
+// simplify expression
+__expr_E__ int lw_expr_reval(lw_expr_stack_t *s, lw_expr_stack_t *(*sfunc)(char *sym, int symtype, void *state), void *state);
+
+// useful macros
+// is the expression "simple" (one term)?
+#define lw_expr_is_simple(s) ((s) -> head == (s) -> tail)
+
+// is the expression constant?
+#define lw_expr_is_constant(s) (lw_expr_is_simple(s) && (!((s) -> head) || (s) -> head -> term -> term_type == LW_TERM_INT))
+
+// get the constant value of an expression or 0 if not constant
+#define lw_expr_get_value(s) (lw_expr_is_constant(s) ? ((s) -> head ? (s) -> head -> term -> value : 0) : 0)
+
+#undef __expr_E__
+
+#endif // __expr_h_seen__
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/link.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/link.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,265 @@
+/*
+link.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+Resolve section and symbol addresses; handle incomplete references
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include
+#include
+
+#include "expr.h"
+#include "lwlink.h"
+#include "util.h"
+
+struct section_list *sectlist = NULL;
+int nsects = 0;
+
+// work out section load order and resolve base addresses for each section
+// make a list of sections to load in order
+void resolve_sections(void)
+{
+ int laddr = 0;
+ int ln, sn, fn;
+
+ for (ln = 0; ln < linkscript.nlines; ln++)
+ {
+// printf("Linker script line %d: '%s', %04X, %d, %d\n", ln, linkscript.lines[ln].sectname, linkscript.lines[ln].loadat, linkscript.lines[ln].yesflags, linkscript.lines[ln].noflags);
+ if (linkscript.lines[ln].sectname)
+ {
+ int f = 0;
+ // named section
+ // look for all instances of a section by the specified name
+ // and resolve base addresses and add to the list
+ for (fn = 0; fn < ninputfiles; fn++)
+ {
+ for (sn = 0; sn < inputfiles[fn] -> nsections; sn++)
+ {
+// printf(" Considering %s:%s\n", inputfiles[fn]->filename, inputfiles[fn]->sections[sn].name);
+ if (!strcmp(linkscript.lines[ln].sectname, inputfiles[fn] -> sections[sn].name))
+ {
+ // we have a match
+ sectlist = lw_realloc(sectlist, sizeof(struct section_list) * (nsects + 1));
+ sectlist[nsects].ptr = &(inputfiles[fn] -> sections[sn]);
+
+ inputfiles[fn] -> sections[sn].processed = 1;
+ if (!f && linkscript.lines[ln].loadat >= 0)
+ {
+ f = 1;
+ sectlist[nsects].forceaddr = 1;
+ laddr = linkscript.lines[ln].loadat;
+ }
+ else
+ {
+ sectlist[nsects].forceaddr = 0;
+ }
+ inputfiles[fn] -> sections[sn].loadaddress = laddr;
+ laddr += inputfiles[fn] -> sections[sn].codesize;
+ nsects++;
+ }
+ }
+ }
+ }
+ else
+ {
+ // wildcard section
+ // look for all sections not yet processed that match flags
+
+ int f = 0;
+ int fn0, sn0;
+ char *sname;
+
+ // named section
+ // look for all instances of a section by the specified name
+ // and resolve base addresses and add to the list
+ for (fn0 = 0; fn0 < ninputfiles; fn0++)
+ {
+ for (sn0 = 0; sn0 < inputfiles[fn0] -> nsections; sn0++)
+ {
+ // ignore if the "no flags" bit says to
+ if (linkscript.lines[ln].noflags && (inputfiles[fn0] -> sections[sn0].flags & linkscript.lines[ln].noflags))
+ continue;
+ // ignore unless the yes flags tell us not to
+ if (linkscript.lines[ln].yesflags && (inputfiles[fn0] -> sections[sn0].flags & linkscript.lines[ln].yesflags == 0))
+ continue;
+ if (inputfiles[fn0] -> sections[sn0].processed == 0)
+ {
+ sname = inputfiles[fn0] -> sections[sn0].name;
+ for (fn = 0; fn < ninputfiles; fn++)
+ {
+ for (sn = 0; sn < inputfiles[fn] -> nsections; sn++)
+ {
+ if (!strcmp(sname, inputfiles[fn] -> sections[sn].name))
+ {
+ // we have a match
+ sectlist = lw_realloc(sectlist, sizeof(struct section_list) * (nsects + 1));
+ sectlist[nsects].ptr = &(inputfiles[fn] -> sections[sn]);
+
+ inputfiles[fn] -> sections[sn].processed = 1;
+ if (!f && linkscript.lines[ln].loadat >= 0)
+ {
+ f = 1;
+ sectlist[nsects].forceaddr = 1;
+ laddr = linkscript.lines[ln].loadat;
+ }
+ else
+ {
+ sectlist[nsects].forceaddr = 0;
+ }
+ inputfiles[fn] -> sections[sn].loadaddress = laddr;
+ laddr += inputfiles[fn] -> sections[sn].codesize;
+ nsects++;
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+ // theoretically, all the base addresses are set now
+}
+
+// resolve all incomplete references now
+// anything that is unresolvable at this stage will throw an error
+// because we know the load address of every section now
+lw_expr_stack_t *resolve_sym(char *sym, int symtype, void *state)
+{
+ section_t *sect = state;
+ lw_expr_term_t *term;
+ int val = 0, i, fn;
+ lw_expr_stack_t *s;
+ symtab_t *se;
+
+ if (symtype == 1)
+ {
+ // local symbol
+ if (!sym)
+ {
+ val = sect -> loadaddress;
+ goto out;
+ }
+
+ // start with this section
+ for (se = sect -> localsyms; se; se = se -> next)
+ {
+ if (!strcmp(se -> sym, sym))
+ {
+ val = se -> offset + sect -> loadaddress;
+ goto out;
+ }
+ }
+ // not in this section - check all sections in this file
+ for (i = 0; i < sect -> file -> nsections; i++)
+ {
+ for (se = sect -> file -> sections[i].localsyms; se; se = se -> next)
+ {
+ if (!strcmp(se -> sym, sym))
+ {
+ val = se -> offset + sect -> file -> sections[i].loadaddress;
+ goto out;
+ }
+ }
+ }
+ // not found
+ fprintf(stderr, "Local symbol %s not found in %s:%s\n", sym, sect -> file -> filename, sect -> name);
+ exit(1);
+ }
+ else
+ {
+ // external symbol
+ // read all files in order until found (or not found)
+ for (fn = 0; fn < ninputfiles; fn++)
+ {
+ for (i = 0; i < inputfiles[fn] -> nsections; i++)
+ {
+ for (se = inputfiles[fn] -> sections[i].exportedsyms; se; se = se -> next)
+ {
+ if (!strcmp(sym, se -> sym))
+ {
+ val = se -> offset + inputfiles[fn] -> sections[i].loadaddress;
+ goto out;
+ }
+ }
+ }
+ }
+ if (sect)
+ {
+ fprintf(stderr, "External symbol %s not found in %s:%s\n", sym, sect -> file -> filename, sect -> name);
+ }
+ else
+ {
+ fprintf(stderr, "External symbol %s not found\n", sym);
+ }
+ exit(1);
+ }
+ fprintf(stderr, "Shouldn't ever get here!!!\n");
+ exit(88);
+out:
+ s = lw_expr_stack_create();
+ term = lw_expr_term_create_int(val & 0xffff);
+ lw_expr_stack_push(s, term);
+ lw_expr_term_free(term);
+ return s;
+}
+
+void resolve_references(void)
+{
+ int sn;
+ reloc_t *rl;
+ int rval;
+
+ // resolve entry point if required
+ // this must resolve to an *exported* symbol and will resolve to the
+ // first instance of that symbol
+ if (linkscript.execsym)
+ {
+ lw_expr_stack_t *s;
+
+ s = resolve_sym(linkscript.execsym, 0, NULL);
+ linkscript.execaddr = lw_expr_get_value(s);
+ lw_expr_stack_free(s);
+ }
+
+ for (sn = 0; sn < nsects; sn++)
+ {
+ for (rl = sectlist[sn].ptr -> incompletes; rl; rl = rl -> next)
+ {
+ // do a "simplify" on the expression
+ rval = lw_expr_reval(rl -> expr, resolve_sym, sectlist[sn].ptr);
+
+ // is it constant? error out if not
+ if (rval != 0 || !lw_expr_is_constant(rl -> expr))
+ {
+ fprintf(stderr, "Incomplete reference at %s:%s:%02X\n", sectlist[sn].ptr -> file -> filename, sectlist[sn].ptr -> name, rl -> offset);
+ exit(1);
+ }
+
+ // put the value into the relocation address
+ rval = lw_expr_get_value(rl -> expr);
+ sectlist[sn].ptr -> code[rl -> offset] = (rval >> 8) & 0xff;
+ sectlist[sn].ptr -> code[rl -> offset + 1] = rval & 0xff;
+ }
+ }
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/lwlink.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/lwlink.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,52 @@
+/*
+lwlink.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#define __lwlink_c_seen__
+
+#include
+#include
+#include
+#include
+
+#include "lwlink.h"
+#include "util.h"
+
+int debug_level = 0;
+int outformat = OUTPUT_DECB;
+char *outfile = NULL;
+char *scriptfile = NULL;
+
+fileinfo_t **inputfiles = NULL;
+int ninputfiles = 0;
+
+void add_input_file(char *fn)
+{
+ inputfiles = lw_realloc(inputfiles, sizeof(fileinfo_t *) * (ninputfiles + 1));
+ inputfiles[ninputfiles] = lw_malloc(sizeof(fileinfo_t));
+ inputfiles[ninputfiles++] -> filename = lw_strdup(fn);
+}
+
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/lwlink.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/lwlink.h Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,130 @@
+/*
+lwlink.h
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+Contains the main defs used by the linker
+*/
+
+
+#ifndef __lwlink_h_seen__
+#define __lwlink_h_seen__
+
+#include "expr.h"
+
+#define OUTPUT_DECB 0 // DECB multirecord format
+#define OUTPUT_RAW 1 // raw sequence of bytes
+
+typedef struct symtab_s symtab_t;
+struct symtab_s
+{
+ unsigned char *sym; // symbol name
+ int offset; // local offset
+// int realval; // resolved value
+ symtab_t *next; // next symbol
+};
+
+typedef struct reloc_s reloc_t;
+struct reloc_s
+{
+ int offset; // where in the section
+ lw_expr_stack_t *expr; // the expression to calculate it
+ reloc_t *next; // ptr to next relocation
+};
+
+typedef struct fileinfo_s fileinfo_t;
+
+#define SECTION_BSS 1
+typedef struct
+{
+ unsigned char *name; // name of the section
+ int flags; // section flags
+ int codesize; // size of the code
+ unsigned char *code; // pointer to the code
+ int loadaddress; // the actual load address of the section
+ int processed; // was the section processed yet?
+
+ symtab_t *localsyms; // local symbol table
+ symtab_t *exportedsyms; // exported symbols table
+
+ reloc_t *incompletes; // table of incomplete references
+
+ fileinfo_t *file; // the file we are in
+} section_t;
+
+struct fileinfo_s
+{
+ char *filename;
+ unsigned char *filedata;
+ long filesize;
+ section_t *sections;
+ int nsections;
+
+};
+
+struct section_list
+{
+ section_t *ptr; // ptr to section structure
+ int forceaddr; // was this force to an address by the link script?
+};
+
+#ifndef __link_c_seen__
+extern struct section_list *sectlist;
+extern int nsects;
+#endif
+
+
+#ifndef __lwlink_c_seen__
+
+extern int debug_level;
+extern int outformat;
+extern char *outfile;
+extern int ninputfiles;
+extern fileinfo_t **inputfiles;
+extern char *scriptfile;
+
+#define __lwlink_E__ extern
+#else
+#define __lwlink_E__
+#endif // __lwlink_c_seen__
+
+__lwlink_E__ void add_input_file(char *fn);
+
+#undef __lwlink_E__
+
+struct scriptline_s
+{
+ char *sectname; // name of section, NULL for wildcard
+ int loadat; // address to load at (or -1)
+ int noflags; // flags to NOT have
+ int yesflags; // flags to HAVE
+};
+
+typedef struct
+{
+ int nlines; // number of lines in the script
+ struct scriptline_s *lines; // the parsed script lines (section)
+ int padsize; // the size to pad to, -1 for none
+ char *execsym; // entry point symbol
+ int execaddr; // execution address (entry point)
+} linkscript_t;
+
+#ifndef __script_c_seen__
+extern linkscript_t linkscript;
+#endif
+
+#endif //__lwlink_h_seen__
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/main.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/main.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,155 @@
+/*
+main.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+Implements the program startup code
+
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include
+#include
+#include
+#include
+
+#include "lwlink.h"
+
+// command line option handling
+const char *argp_program_version = PACKAGE_STRING;
+const char *argp_program_bug_address = PACKAGE_BUGREPORT;
+
+static error_t parse_opts(int key, char *arg, struct argp_state *state)
+{
+ switch (key)
+ {
+ case 'o':
+ // output
+ outfile = arg;
+ break;
+
+ case 's':
+ // script file
+ scriptfile = arg;
+ break;
+
+ case 'd':
+ // debug
+ debug_level++;
+ break;
+
+ case 'b':
+ // decb output
+ outformat = OUTPUT_DECB;
+ break;
+
+ case 'r':
+ // raw binary output
+ outformat = OUTPUT_RAW;
+ break;
+
+ case 'f':
+ // output format
+ if (!strcasecmp(arg, "decb"))
+ outformat = OUTPUT_DECB;
+ else if (!strcasecmp(arg, "raw"))
+ outformat = OUTPUT_RAW;
+ else
+ {
+ fprintf(stderr, "Invalid output format: %s\n", arg);
+ exit(1);
+ }
+ break;
+ case ARGP_KEY_END:
+ // done; sanity check
+ if (!outfile)
+ outfile = "a.out";
+ break;
+
+ case ARGP_KEY_ARG:
+ add_input_file(arg);
+ break;
+
+ default:
+ return ARGP_ERR_UNKNOWN;
+ }
+ return 0;
+}
+
+static struct argp_option options[] =
+{
+ { "output", 'o', "FILE", 0,
+ "Output to FILE"},
+ { "debug", 'd', 0, 0,
+ "Set debug mode"},
+ { "format", 'f', "TYPE", 0,
+ "Select output format: decb, raw, obj"},
+ { "decb", 'b', 0, 0,
+ "Generate DECB .bin format output, equivalent of --format=decb"},
+ { "raw", 'r', 0, 0,
+ "Generate raw binary format output, equivalent of --format=raw"},
+ { "script", 's', "FILE", 0,
+ "Specify the linking script (overrides the build in defaults)"},
+ { 0 }
+};
+
+static struct argp argp =
+{
+ options,
+ parse_opts,
+ " ...",
+ "LWLINK, a HD6309 and MC6809 cross-linker"
+};
+
+extern void read_files(void);
+extern void setup_script(void);
+extern void resolve_sections(void);
+extern void resolve_references(void);
+extern void do_output(void);
+
+// main function; parse command line, set up assembler state, and run the
+// assembler on the first file
+int main(int argc, char **argv)
+{
+ argp_parse(&argp, argc, argv, 0, 0, NULL);
+ if (ninputfiles == 0)
+ {
+ fprintf(stderr, "No input files\n");
+ exit(1);
+ }
+
+ // handle the linker script
+ setup_script();
+
+ // read the input files
+ read_files();
+
+ // resolve section bases and section order
+ resolve_sections();
+
+ // resolve incomplete references
+ resolve_references();
+
+ // do the actual output
+ do_output();
+
+ exit(0);
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/objdump.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/objdump.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,303 @@
+/*
+objdump.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK
+
+LWLINK 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 .
+
+
+A standalone program to dump an object file in a text form to stdout
+
+*/
+
+#include
+#include
+
+#include "util.h"
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+void read_lwobj16v0(unsigned char *filedata, long filesize);
+
+/*
+The logic of reading the entire file into memory is simple. All the symbol
+names in the file are NUL terminated strings and can be used directly without
+making additional copies.
+*/
+int main(int argc, char **argv)
+{
+ int i;
+ long size;
+ FILE *f;
+ long bread;
+ unsigned char *filedata;
+
+ if (argc != 2)
+ {
+ fprintf(stderr, "Must specify exactly one input file.\n");
+ exit(1);
+ }
+
+ f = fopen(argv[1], "rb");
+ if (!f)
+ {
+ fprintf(stderr, "Can't open file %s:", argv[1]);
+ perror("");
+ exit(1);
+ }
+ fseek(f, 0, SEEK_END);
+ size = ftell(f);
+ rewind(f);
+
+ filedata = lw_malloc(size);
+
+ bread = fread(filedata, 1, size, f);
+ if (bread < size)
+ {
+ fprintf(stderr, "Short read on file %s (%ld/%ld):", argv[1], bread, size);
+ perror("");
+ exit(1);
+ }
+
+ fclose(f);
+
+ if (!memcmp(filedata, "LWOBJ16", 8))
+ {
+ // read v0 LWOBJ16 file
+ read_lwobj16v0(filedata, size);
+ }
+ else
+ {
+ fprintf(stderr, "%s: unknown file format\n", argv[1]);
+ exit(1);
+ }
+ exit(0);
+}
+
+// this macro is used to bail out if we run off the end of the file data
+// while parsing - it keeps the code below cleaner
+#define NEXTBYTE() do { cc++; if (cc > filesize) { fprintf(stderr, "***invalid file format\n"); exit(1); } } while (0)
+// this macro is used to refer to the current byte in the stream
+#define CURBYTE() (filedata[cc < filesize ? cc : filesize - 1])
+// this one will leave the input pointer past the trailing NUL
+#define CURSTR() read_lwobj16v0_str(&cc, &filedata, filesize)
+unsigned char *read_lwobj16v0_str(long *cc1, unsigned char **filedata1, long filesize)
+{
+ int cc = *cc1;
+ unsigned char *filedata = *filedata1;
+ unsigned char *fp;
+ fp = &CURBYTE();
+ while (CURBYTE())
+ NEXTBYTE();
+ NEXTBYTE();
+ *cc1 = cc;
+ *filedata1 = filedata;
+ return fp;
+}
+// the function below can be switched to dealing with data coming from a
+// source other than an in-memory byte pool by adjusting the input data
+// in "fn" and the above two macros
+void read_lwobj16v0(unsigned char *filedata, long filesize)
+{
+ unsigned char *fp;
+ long cc;
+ int val;
+ int bss;
+
+ static char *opernames[] = {
+ "?",
+ "PLUS",
+ "MINUS",
+ "TIMES",
+ "DIVIDE",
+ "MOD",
+ "INTDIV",
+ "BWAND",
+ "BWOR",
+ "BWXOR",
+ "AND",
+ "OR",
+ "NEG",
+ "COM"
+ };
+ static const int numopers = 13;
+
+ // start reading *after* the magic number
+ cc = 8;
+
+ while (1)
+ {
+ bss = 0;
+
+ // bail out if no more sections
+ if (!(CURBYTE()))
+ break;
+
+ fp = CURSTR();
+
+ printf("SECTION %s\n", fp);
+
+ // read flags
+ while (CURBYTE())
+ {
+ switch (CURBYTE())
+ {
+ case 0x01:
+ printf(" FLAG: BSS\n");
+ bss = 1;
+ break;
+
+ default:
+ printf(" FLAG: %02X (unknown)\n", CURBYTE());
+ break;
+ }
+ NEXTBYTE();
+ }
+ // skip NUL terminating flags
+ NEXTBYTE();
+
+ printf(" Local symbols:\n");
+ // now parse the local symbol table
+ while (CURBYTE())
+ {
+ fp = CURSTR();
+
+ // fp is the symbol name
+ val = (CURBYTE()) << 8;
+ NEXTBYTE();
+ val |= (CURBYTE());
+ NEXTBYTE();
+ // val is now the symbol value
+
+ printf(" %s=%04X\n", fp, val);
+
+ }
+ // skip terminating NUL
+ NEXTBYTE();
+
+ printf(" Exported symbols\n");
+
+ // now parse the exported symbol table
+ while (CURBYTE())
+ {
+ fp = CURSTR();
+
+ // fp is the symbol name
+ val = (CURBYTE()) << 8;
+ NEXTBYTE();
+ val |= (CURBYTE());
+ NEXTBYTE();
+ // val is now the symbol value
+
+ printf(" %s=%04X\n", fp, val);
+ }
+ // skip terminating NUL
+ NEXTBYTE();
+
+ // now parse the incomplete references and make a list of
+ // external references that need resolution
+ printf(" Incomplete references\n");
+ while (CURBYTE())
+ {
+ printf(" (");
+ // parse the expression
+ while (CURBYTE())
+ {
+ int tt = CURBYTE();
+ NEXTBYTE();
+ switch (tt)
+ {
+ case 0x01:
+ // 16 bit integer
+ tt = CURBYTE() << 8;
+ NEXTBYTE();
+ tt |= CURBYTE();
+ NEXTBYTE();
+ // normalize for negatives...
+ if (tt > 0x7fff)
+ tt -= 0x10000;
+ printf(" I16=%d", tt);
+ break;
+
+ case 0x02:
+ // external symbol reference
+ printf(" ES=%s", CURSTR());
+ break;
+
+ case 0x03:
+ // internal symbol reference
+ printf(" IS=%s", CURSTR());
+ break;
+
+ case 0x04:
+ // operator
+ if (CURBYTE() > 0 && CURBYTE() <= numopers)
+ printf(" OP=%s", opernames[CURBYTE()]);
+ else
+ printf(" OP=?");
+ NEXTBYTE();
+ break;
+
+ case 0x05:
+ // section base reference (NULL internal reference is
+ // the section base address
+ printf(" SB");
+ break;
+
+ default:
+ printf(" ERR");
+ }
+ }
+ // skip the NUL
+ NEXTBYTE();
+
+ // fetch the offset
+ val = CURBYTE() << 8;
+ NEXTBYTE();
+ val |= CURBYTE() & 0xff;
+ NEXTBYTE();
+ printf(" ) @ %04X\n", val);
+ }
+ // skip the NUL terminating the relocations
+ NEXTBYTE();
+
+ // now set code location and size and verify that the file
+ // contains data going to the end of the code (if !SECTION_BSS)
+ val = CURBYTE() << 8;
+ NEXTBYTE();
+ val |= CURBYTE();
+ NEXTBYTE();
+
+ printf(" CODE %04X bytes", val);
+
+ // skip the code if we're not in a BSS section
+ if (!bss)
+ {
+ int i;
+ for (i = 0; i < val; i++)
+ {
+ if (! (i % 16))
+ {
+ printf("\n %04X ", i);
+ }
+ printf("%02X", CURBYTE());
+ NEXTBYTE();
+ }
+ }
+ printf("\n");
+ }
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/output.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/output.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,127 @@
+/*
+output.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+Actually output the binary
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include
+#include
+
+#include "lwlink.h"
+
+// this prevents warnings about not using the return value of fwrite()
+// and, theoretically, can be replaced with a function that handles things
+// better in the future
+#define writebytes(s, l, c, f) do { int r; r = fwrite((s), (l), (c), (f)); } while (0)
+
+void do_output_decb(FILE *of);
+void do_output_raw(FILE *of);
+
+void do_output(void)
+{
+ FILE *of;
+
+ of = fopen(outfile, "wb");
+ if (!of)
+ {
+ fprintf(stderr, "Cannot open output file %s: ", outfile);
+ perror("");
+ exit(1);
+ }
+
+ switch (outformat)
+ {
+ case OUTPUT_DECB:
+ do_output_decb(of);
+ break;
+
+ case OUTPUT_RAW:
+ do_output_raw(of);
+ break;
+
+ default:
+ fprintf(stderr, "Unknown output format doing output!\n");
+ exit(111);
+ }
+
+ fclose(of);
+}
+
+void do_output_decb(FILE *of)
+{
+ int sn;
+ unsigned char buf[5];
+
+ for (sn = 0; sn < nsects; sn++)
+ {
+ if (sectlist[sn].ptr -> flags & SECTION_BSS)
+ {
+ // no output for a BSS section
+ continue;
+ }
+ if (sectlist[sn].ptr -> codesize == 0)
+ {
+ // don't generate output for a zero size section
+ continue;
+ }
+ // write a preamble
+ buf[0] = 0x00;
+ buf[1] = sectlist[sn].ptr -> codesize >> 8;
+ buf[2] = sectlist[sn].ptr -> codesize & 0xff;
+ buf[3] = sectlist[sn].ptr -> loadaddress >> 8;
+ buf[4] = sectlist[sn].ptr -> loadaddress & 0xff;
+ writebytes(buf, 1, 5, of);
+ writebytes(sectlist[sn].ptr -> code, 1, sectlist[sn].ptr -> codesize, of);
+ }
+ // write a postamble
+ buf[0] = 0xff;
+ buf[1] = 0x00;
+ buf[2] = 0x00;
+ buf[3] = linkscript.execaddr >> 8;
+ buf[4] = linkscript.execaddr & 0xff;
+ writebytes(buf, 1, 5, of);
+}
+
+void do_output_raw(FILE *of)
+{
+ int nskips = 0; // used to output blanks for BSS inline
+ int sn;
+
+ for (sn = 0; sn < nsects; sn++)
+ {
+ if (sectlist[sn].ptr -> flags & SECTION_BSS)
+ {
+ // no output for a BSS section
+ nskips += sectlist[sn].ptr -> codesize;
+ continue;
+ }
+ while (nskips > 0)
+ {
+ // the "" is not an error - it turns into a single NUL byte!
+ writebytes("", 1, 1, of);
+ nskips--;
+ }
+ writebytes(sectlist[sn].ptr -> code, 1, sectlist[sn].ptr -> codesize, of);
+ }
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/readfiles.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/readfiles.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,304 @@
+/*
+readfiles.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+Reads input files
+
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include
+#include
+#include
+#include
+
+#include "lwlink.h"
+#include "util.h"
+
+void read_lwobj16v0(fileinfo_t *fn);
+
+/*
+The logic of reading the entire file into memory is simple. All the symbol
+names in the file are NUL terminated strings and can be used directly without
+making additional copies.
+*/
+void read_files(void)
+{
+ int i;
+ long size;
+ FILE *f;
+ long bread;
+ for (i = 0; i < ninputfiles; i++)
+ {
+ f = fopen(inputfiles[i] -> filename, "rb");
+ if (!f)
+ {
+ fprintf(stderr, "Can't open file %s:", inputfiles[i] -> filename);
+ perror("");
+ exit(1);
+ }
+ fseek(f, 0, SEEK_END);
+ size = ftell(f);
+ rewind(f);
+
+ inputfiles[i] -> filedata = lw_malloc(size);
+ inputfiles[i] -> filesize = size;
+
+ bread = fread(inputfiles[i] -> filedata, 1, size, f);
+ if (bread < size)
+ {
+ fprintf(stderr, "Short read on file %s (%ld/%ld):", inputfiles[i] -> filename, bread, size);
+ perror("");
+ exit(1);
+ }
+
+ fclose(f);
+
+ if (!memcmp(inputfiles[i] -> filedata, "LWOBJ16", 8))
+ {
+ // read v0 LWOBJ16 file
+ read_lwobj16v0(inputfiles[i]);
+ }
+ else
+ {
+ fprintf(stderr, "%s: unknown file format\n", inputfiles[i] -> filename);
+ exit(1);
+ }
+ }
+}
+
+// this macro is used to bail out if we run off the end of the file data
+// while parsing - it keeps the code below cleaner
+#define NEXTBYTE() do { cc++; if (cc > fn -> filesize) { fprintf(stderr, "%s: invalid file format\n", fn -> filename); exit(1); } } while (0)
+// this macro is used to refer to the current byte in the stream
+#define CURBYTE() (fn -> filedata[cc < fn -> filesize ? cc : fn -> filesize - 1])
+// this one will leave the input pointer past the trailing NUL
+#define CURSTR() read_lwobj16v0_str(&cc, fn)
+unsigned char *read_lwobj16v0_str(long *cc1, fileinfo_t *fn)
+{
+ int cc = *cc1;
+ unsigned char *fp;
+ fp = &CURBYTE();
+ while (CURBYTE())
+ NEXTBYTE();
+ NEXTBYTE();
+ *cc1 = cc;
+ return fp;
+}
+// the function below can be switched to dealing with data coming from a
+// source other than an in-memory byte pool by adjusting the input data
+// in "fn" and the above two macros
+void read_lwobj16v0(fileinfo_t *fn)
+{
+ unsigned char *fp;
+ long cc;
+ section_t *s;
+ int val;
+ symtab_t *se;
+
+ // start reading *after* the magic number
+ cc = 8;
+
+ // init data
+ fn -> sections = NULL;
+ fn -> nsections = 0;
+
+ while (1)
+ {
+// NEXTBYTE();
+ // bail out if no more sections
+ if (!(CURBYTE()))
+ break;
+
+ fp = CURSTR();
+
+ // we now have a section name in fp
+ // create new section entry
+ fn -> sections = lw_realloc(fn -> sections, sizeof(section_t) * (fn -> nsections + 1));
+ s = &(fn -> sections[fn -> nsections]);
+ fn -> nsections += 1;
+
+ s -> localsyms = NULL;
+ s -> flags = 0;
+ s -> codesize = 0;
+ s -> name = fp;
+ s -> loadaddress = 0;
+ s -> localsyms = NULL;
+ s -> exportedsyms = NULL;
+ s -> incompletes = NULL;
+ s -> processed = 0;
+ s -> file = fn;
+
+ // read flags
+ while (CURBYTE())
+ {
+ switch (CURBYTE())
+ {
+ case 0x01:
+ s -> flags |= SECTION_BSS;
+ break;
+
+ default:
+ fprintf(stderr, "%s (%s): unrecognized section flag %02X\n", fn -> filename, s -> name, (int)(CURBYTE()));
+ exit(1);
+ }
+ NEXTBYTE();
+ }
+ // skip NUL terminating flags
+ NEXTBYTE();
+
+ // now parse the local symbol table
+ while (CURBYTE())
+ {
+ fp = CURSTR();
+
+ // fp is the symbol name
+ val = (CURBYTE()) << 8;
+ NEXTBYTE();
+ val |= (CURBYTE());
+ NEXTBYTE();
+ // val is now the symbol value
+
+ // create symbol table entry
+ se = lw_malloc(sizeof(symtab_t));
+ se -> next = s -> localsyms;
+ s -> localsyms = se;
+ se -> sym = fp;
+ se -> offset = val;
+ }
+ // skip terminating NUL
+ NEXTBYTE();
+
+ // now parse the exported symbol table
+ while (CURBYTE())
+ {
+ fp = CURSTR();
+
+ // fp is the symbol name
+ val = (CURBYTE()) << 8;
+ NEXTBYTE();
+ val |= (CURBYTE());
+ NEXTBYTE();
+ // val is now the symbol value
+
+ // create symbol table entry
+ se = lw_malloc(sizeof(symtab_t));
+ se -> next = s -> exportedsyms;
+ s -> exportedsyms = se;
+ se -> sym = fp;
+ se -> offset = val;
+ }
+ // skip terminating NUL
+ NEXTBYTE();
+
+ // now parse the incomplete references and make a list of
+ // external references that need resolution
+ while (CURBYTE())
+ {
+ reloc_t *rp;
+ lw_expr_term_t *term;
+
+ // we have a reference
+ rp = lw_malloc(sizeof(reloc_t));
+ rp -> next = s -> incompletes;
+ s -> incompletes = rp;
+ rp -> offset = 0;
+ rp -> expr = lw_expr_stack_create();
+
+ // parse the expression
+ while (CURBYTE())
+ {
+ int tt = CURBYTE();
+ NEXTBYTE();
+ switch (tt)
+ {
+ case 0x01:
+ // 16 bit integer
+ tt = CURBYTE() << 8;
+ NEXTBYTE();
+ tt |= CURBYTE();
+ NEXTBYTE();
+ // normalize for negatives...
+ if (tt > 0x7fff)
+ tt -= 0x10000;
+ term = lw_expr_term_create_int(tt);
+ break;
+
+ case 0x02:
+ // external symbol reference
+ term = lw_expr_term_create_sym(CURSTR(), 0);
+ break;
+
+ case 0x03:
+ // internal symbol reference
+ term = lw_expr_term_create_sym(CURSTR(), 1);
+ break;
+
+ case 0x04:
+ // operator
+ term = lw_expr_term_create_oper(CURBYTE());
+ NEXTBYTE();
+ break;
+
+ case 0x05:
+ // section base reference (NULL internal reference is
+ // the section base address
+ term = lw_expr_term_create_sym(NULL, 1);
+ break;
+
+ default:
+ fprintf(stderr, "%s (%s): bad relocation expression\n", fn -> filename, s -> name);
+ exit(1);
+ }
+ lw_expr_stack_push(rp -> expr, term);
+ lw_expr_term_free(term);
+ }
+ // skip the NUL
+ NEXTBYTE();
+
+ // fetch the offset
+ rp -> offset = CURBYTE() << 8;
+ NEXTBYTE();
+ rp -> offset |= CURBYTE() & 0xff;
+ NEXTBYTE();
+ }
+ // skip the NUL terminating the relocations
+ NEXTBYTE();
+
+ // now set code location and size and verify that the file
+ // contains data going to the end of the code (if !SECTION_BSS)
+ s -> codesize = CURBYTE() << 8;
+ NEXTBYTE();
+ s -> codesize |= CURBYTE();
+ NEXTBYTE();
+
+ s -> code = &(CURBYTE());
+
+ // skip the code if we're not in a BSS section
+ if (!(s -> flags & SECTION_BSS))
+ {
+ int i;
+ for (i = 0; i < s -> codesize; i++)
+ NEXTBYTE();
+ }
+ }
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/script.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/script.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,257 @@
+/*
+script.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+
+
+Read and parse linker scripts
+*/
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include
+#include
+#include
+#include
+
+#include "lwlink.h"
+#include "util.h"
+
+// the built-in DECB target linker script
+static char *decb_script =
+ "section init load 2000\n"
+ "section code\n"
+ "section *,!bss\n"
+ "section *,bss\n"
+ "entry 2000\n"
+ ;
+
+// the built-in RAW target linker script
+static char *raw_script =
+ "section init load 0000\n"
+ "section code\n"
+ "section *,!bss\n"
+ "section *,bss\n"
+ ;
+
+// the "simple" script
+static char *simple_script =
+ "section *,!bss\n"
+ "section *,bss\n"
+ ;
+
+linkscript_t linkscript = { 0, NULL, -1 };
+
+void setup_script()
+{
+ char *script, *oscript;
+ long size;
+
+ // read the file if needed
+ if (scriptfile)
+ {
+ FILE *f;
+ long bread;
+
+ f = fopen(scriptfile, "rb");
+ if (!f)
+ {
+ fprintf(stderr, "Can't open file %s:", scriptfile);
+ perror("");
+ exit(1);
+ }
+ fseek(f, 0, SEEK_END);
+ size = ftell(f);
+ rewind(f);
+
+ script = lw_malloc(size + 2);
+
+ bread = fread(script, 1, size, f);
+ if (bread < size)
+ {
+ fprintf(stderr, "Short read on file %s (%ld/%ld):", scriptfile, bread, size);
+ perror("");
+ exit(1);
+ }
+ fclose(f);
+
+ script[size] = '\n';
+ script[size + 1] = '\0';
+ }
+ else
+ {
+ // fetch defaults based on output mode
+ switch (outformat)
+ {
+ case OUTPUT_RAW:
+ script = raw_script;
+ break;
+
+ case OUTPUT_DECB:
+ script = decb_script;
+ break;
+
+ default:
+ script = simple_script;
+ break;
+ }
+
+ size = strlen(script);
+ }
+
+ oscript = script;
+ // now parse the script file
+ while (*script)
+ {
+ char *ptr, *ptr2, *line;
+
+ for (ptr = script; *ptr && *ptr != '\n' && *ptr != '\r'; ptr++)
+ /* do nothing */ ;
+
+ line = lw_malloc(ptr - script + 1);
+ memcpy(line, script, ptr - script);
+ line[ptr - script] = '\0';
+
+ // skip line terms
+ for (script = ptr + 1; *script == '\n' || *script == '\r'; script++)
+ /* do nothing */ ;
+
+ // ignore leading whitespace
+ for (ptr = line; *ptr && isspace(*ptr); ptr++)
+ /* do nothing */ ;
+
+ // ignore blank lines
+ if (!*ptr)
+ continue;
+
+ for (ptr = line; *ptr && !isspace(*ptr); ptr++)
+ /* do nothing */ ;
+
+ // now ptr points to the char past the first word
+ // NUL it out
+ if (*ptr)
+ *ptr++ = '\0';
+
+ // skip spaces after the first word
+ for ( ; *ptr && isspace(*ptr); ptr++)
+ /* do nothing */ ;
+
+ if (!strcmp(line, "pad"))
+ {
+ // padding
+ // parse the hex number and stow it
+ linkscript.padsize = strtol(ptr, NULL, 16);
+ if (linkscript.padsize < 0)
+ linkscript.padsize = 0;
+ }
+ else if (!strcmp(line, "entry"))
+ {
+ int eaddr;
+
+ eaddr = strtol(ptr, &ptr2, 16);
+ if (*ptr2)
+ {
+ linkscript.execaddr = -1;
+ linkscript.execsym = lw_strdup(ptr);
+ }
+ else
+ {
+ linkscript.execaddr = eaddr;
+ linkscript.execsym = NULL;
+ }
+ }
+ else if (!strcmp(line, "section"))
+ {
+ // section
+ // parse out the section name and flags
+ for (ptr2 = ptr; *ptr2 && !isspace(*ptr2); ptr2++)
+ /* do nothing */ ;
+
+ if (*ptr2)
+ *ptr2++ = '\0';
+
+ while (*ptr2 && isspace(*ptr2))
+ ptr2++;
+
+ // ptr now points to the section name and flags and ptr2
+ // to the first non-space character following
+
+ // then look for "load " clause
+ if (*ptr2)
+ {
+ if (!strncmp(ptr2, "load", 4))
+ {
+ ptr2 += 4;
+ while (*ptr2 && isspace(*ptr2))
+ ptr2++;
+
+ }
+ else
+ {
+ fprintf(stderr, "%s: bad script\n", scriptfile);
+ exit(1);
+ }
+ }
+
+ // now ptr2 points to the load address if there is one
+ // or NUL if not
+ linkscript.lines = lw_realloc(linkscript.lines, sizeof(struct scriptline_s) * (linkscript.nlines + 1));
+
+ linkscript.lines[linkscript.nlines].noflags = 0;
+ linkscript.lines[linkscript.nlines].yesflags = 0;
+ if (*ptr2)
+ linkscript.lines[linkscript.nlines].loadat = strtol(ptr2, NULL, 16);
+ else
+ linkscript.lines[linkscript.nlines].loadat = -1;
+ for (ptr2 = ptr; *ptr2 && *ptr2 != ','; ptr2++)
+ /* do nothing */ ;
+ if (*ptr2)
+ {
+ *ptr2++ = '\0';
+ if (!strcmp(ptr2, "!bss"))
+ {
+ linkscript.lines[linkscript.nlines].noflags = SECTION_BSS;
+ }
+ else if (!strcmp(ptr2, "bss"))
+ {
+ linkscript.lines[linkscript.nlines].yesflags = SECTION_BSS;
+ }
+ else
+ {
+ fprintf(stderr, "%s: bad script\n", scriptfile);
+ exit(1);
+ }
+ }
+ if (ptr[0] == '*' && ptr[1] == '\0')
+ linkscript.lines[linkscript.nlines].sectname = NULL;
+ else
+ linkscript.lines[linkscript.nlines].sectname = lw_strdup(ptr);
+ linkscript.nlines++;
+ }
+ else
+ {
+ fprintf(stderr, "%s: bad script\n", scriptfile);
+ exit(1);
+ }
+ lw_free(line);
+ }
+
+ if (scriptfile)
+ lw_free(oscript);
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/util.c
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/util.c Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,87 @@
+/*
+util.c
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+*/
+
+/*
+Utility functions
+*/
+
+#define __util_c_seen__
+
+#include
+#include
+#include
+#include
+
+#include "util.h"
+
+void *lw_malloc(int size)
+{
+ void *ptr;
+
+ ptr = malloc(size);
+ if (!ptr)
+ {
+ // bail out; memory allocation error
+ fprintf(stderr, "lw_malloc(): Memory allocation error\n");
+ exit(1);
+ }
+ return ptr;
+}
+
+void *lw_realloc(void *optr, int size)
+{
+ void *ptr;
+
+ if (size == 0)
+ {
+ lw_free(optr);
+ return;
+ }
+
+ ptr = realloc(optr, size);
+ if (!ptr)
+ {
+ fprintf(stderr, "lw_realloc(): memory allocation error\n");
+ exit(1);
+ }
+}
+
+void lw_free(void *ptr)
+{
+ if (ptr)
+ free(ptr);
+}
+
+char *lw_strdup(const char *s)
+{
+ char *d;
+
+ if (!s)
+ return NULL;
+
+ d = strdup(s);
+ if (!d)
+ {
+ fprintf(stderr, "lw_strdup(): memory allocation error\n");
+ exit(1);
+ }
+
+ return d;
+}
diff -r 6286b5ea82ab -r 235bdd281e1e lwlink/branches/1.0/src/util.h
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/lwlink/branches/1.0/src/util.h Tue Jan 27 05:51:54 2009 +0000
@@ -0,0 +1,44 @@
+/*
+util.h
+Copyright © 2009 William Astle
+
+This file is part of LWLINK.
+
+LWLINK 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 .
+*/
+
+/*
+Utility functions
+*/
+
+#ifndef __util_h_seen__
+#define __util_h_seen__
+
+#ifndef __util_c_seen__
+#define __util_E__ extern
+#else
+#define __util_E__
+#endif
+
+// allocate memory
+__util_E__ void *lw_malloc(int size);
+__util_E__ void lw_free(void *ptr);
+__util_E__ void *lw_realloc(void *optr, int size);
+
+// string stuff
+__util_E__ char *lw_strdup(const char *s);
+
+#undef __util_E__
+
+#endif // __util_h_seen__