initial export from old svn

ia/COPYING

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

ia/Changelog

@@ -0,0 +1,12 @@
+Version 0.1
+	Written in Python
+	Quite working referee
+	
+Version 0.2
+	Rewritten in C
+	Working referee
+
+Version 0.3
+	Can finish a match and name the winner
+	Implementation des arguments
+

ia/Makefile

@@ -0,0 +1,49 @@
+OPTS = -g -Wall #-pedantic 
+
+default: all
+all: libs olono
+
+libs: libIA libDisplay libPlay libCases libIA-dumb
+
+olono:main.o
+	gcc -o olono main.o ../lib/libCases.so ../lib/libIA.so  ../lib/libDisplay.so ../lib/libPlay.so $(OPTS)
+	gcc -o olono-dumb main.o ../lib/libCases.so ../lib/libIA-dumb.so  ../lib/libDisplay.so ../lib/libPlay.so $(OPTS)
+
+libIA:
+	gcc -c ../lib/libIA.c -o ../lib/libIA.o $(OPTS)
+	gcc -o ../lib/libIA.so -shared ../lib/libIA.o $(OPTS)
+
+libIA-dumb:
+	gcc -c ../lib/libIA-dumb.c -o ../lib/libIA-dumb.o $(OPTS)
+	gcc -o ../lib/libIA-dumb.so -shared ../lib/libIA-dumb.o $(OPTS)
+
+libDisplay:
+	gcc -c ../lib/libDisplay.c -o ../lib/libDisplay.o $(OPTS)
+	gcc -o ../lib/libDisplay.so -shared ../lib/libDisplay.o $(OPTS)
+
+libPlay:
+	gcc -c ../lib/libPlay.c -o ../lib/libPlay.o $(OPTS)
+	gcc -o ../lib/libPlay.so -shared ../lib/libPlay.o $(OPTS)
+
+libCases:
+	gcc -c ../lib/libCases.c -o ../lib/libCases.o $(OPTS)
+	gcc -o ../lib/libCases.so -shared ../lib/libCases.o $(OPTS)
+
+main.o:
+	gcc -c main.c $(OPTS)
+
+doc:
+	doxygen ../doxygen/Doxyfile
+	$(MAKE) -C ../doxygen/latex -f Makefile
+
+clean:
+	rm -v *.o
+	rm -v ./olono
+
+mrproper:
+	rm -v ../lib/*.so
+	rm -v *.o
+	rm -v ./olono
+	rm -v ./olono-dumb
+	rm -vR ../doxygen/html ../doxygen/latex
+

ia/Makefile-dumb

@@ -0,0 +1,45 @@
+OPTS = -g
+
+default: all
+all: libs olono-dumb
+
+libs: libIA libDisplay libPlay libCases
+
+olono-dumb:main.o
+	gcc -o olono-dumb main.o ../lib/libCases.so ../lib/libIA-dumb.so  ../lib/libDisplay.so ../lib/libPlay.so $(OPTS)
+
+libIA:
+	gcc -c ../lib/libIA-dumb.c -o ../lib/libIA-dumb.o $(OPTS)
+	gcc -o ../lib/libIA-dumb.so -shared ../lib/libIA-dumb.o $(OPTS)
+
+libDisplay:
+	gcc -c ../lib/libDisplay.c -o ../lib/libDisplay.o $(OPTS)
+	gcc -o ../lib/libDisplay.so -shared ../lib/libDisplay.o $(OPTS)
+
+libPlay:
+	gcc -c ../lib/libPlay.c -o ../lib/libPlay.o $(OPTS)
+	gcc -o ../lib/libPlay.so -shared ../lib/libPlay.o $(OPTS)
+
+libCases:
+	gcc -c ../lib/libCases.c -o ../lib/libCases.o $(OPTS)
+	gcc -o ../lib/libCases.so -shared ../lib/libCases.o $(OPTS)
+
+main.o:
+	gcc -c main.c $(OPTS)
+
+doc:
+	doxygen ../doxygen/Doxyfile
+	$(MAKE) -C ../doxygen/latex -f Makefile
+
+clean:
+	rm -v *.o
+	rm -v ./olono-dumb
+
+mrproper:
+	rm -v ../lib/libPlay.so ../lib/libPlay.o
+	rm -v ../lib/libDisplay.so ../lib/libDisplay.o
+	rm -v ../lib/libIA-dumb.so ../lib/libIA-dumb.o
+	rm -v *.o
+	rm -v ./olono-dumb
+	rm -vR ../doxygen/html ../doxygen/latex
+

ia/bouchon.c

@@ -0,0 +1,523 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<string.h>
+#include<unistd.h>
+#include<sys/types.h>
+#include<sys/wait.h>
+#include<sys/select.h>
+#include<sys/time.h>
+#include<sys/resource.h>
+#include<signal.h>
+#include<errno.h>
+
+int joueHM(int taille, char * p2, char *log);
+int joueMH(int taille, char * p1, char *log);
+int joueMM(int taille, char * p1, char * p2, char *log);
+int dansGrille(char col ,int lig, int taille);
+void finMachineSimple(int from1, char *nom1, int status, int from2, int to2, int pid2, char *nom2, FILE *logFile);
+int safeWrite(int fd, char *s);
+
+int main(int argc, char *argv[]){
+
+  int taille;
+  char joueur1, joueur2, trace, rep;
+  char *path1 = NULL, *path2 = NULL;
+  char *logFile = NULL;
+  signal(SIGPIPE,SIG_IGN); /* on ignore les signaux de tube ferme */
+  printf("Bonjour\n");
+  printf("procedure simplifiee ? (O/N): ");
+  scanf(" %c",&rep);
+  if (rep == 'N') {
+    /* filtre de saisie: taille impaire, entre 5 et 25 */
+    do {
+      printf("Quelle est la taille (impaire) pour la grille ? ");
+      scanf("%d",&taille);
+    } while ((taille%2 ==0)||(taille>26)||(taille<4));
+    /* filtre de saisie: premier joueur humain ou programme */
+    do {
+      printf("Qui joue les blancs ? Humain ? Machine ? (H/M): ");
+      scanf(" %c",&joueur1);
+    } while ((joueur1 != 'H') && (joueur1 != 'M'));
+    /* filtre de saisie: second joueur humain ou programme */
+    do {
+      printf("Qui joue les noirs ? Humain ? Machine ? (H/M): ");
+      scanf(" %c",&joueur2);
+    } while ((joueur2 != 'H') && (joueur2 != 'M'));
+    
+    if (joueur1 == 'M'){
+      /* le chemin d'acces au programme joueur 1 */
+      path1 = malloc(513 * sizeof(char));
+      printf("Veuillez entrer le chemin du programme joueur 1: ");
+      scanf("%s",path1); 
+      while(access(path1,R_OK|X_OK|F_OK) != 0) {
+	printf("Ce fichier n'existe pas ou bien n'est pas executable\n");
+	printf("Veuillez entrer le chemin du programme joueur 1: ");
+	scanf("%s",path1);  
+      }
+    }
+    if (joueur2 == 'M'){
+      /* le chemin d'acces au programme joueur 2 */
+
+      path2 = malloc(513 * sizeof(char));
+      printf("Veuillez entrer le chemin du programme joueur 2: ");
+      scanf("%s",path2); 
+      while(access(path2,R_OK|X_OK|F_OK) != 0) {
+	printf("Ce fichier n'existe pas ou bien n'est pas executable\n");
+	printf("Veuillez entrer le chemin du programme joueur 2: ");
+	scanf("%s",path2);  
+      }
+    }
+    
+    /* si jamais on veut une trace: non implementee pour l'instant */
+    do {
+      printf("voulez-vous enregistrer la trace d'execution ? (O/N): ");
+      scanf(" %c",&trace);
+    } while (trace != 'O' && trace != 'N');
+    
+    if (trace == 'O'){
+      logFile = malloc(513 * sizeof(char));
+      printf("Veuillez entrer le chemin du fichier de log: ");
+      scanf("%s",logFile);  
+    }
+  } else { /* remplissage par defaut */
+    joueur1 = 'M';
+    joueur2 = 'M';
+    taille = 25;
+    path1 = malloc(30*sizeof(char));
+    strcpy(path1,"./olono");
+    path2 = malloc(30*sizeof(char));
+    strcpy(path2,"./olono-rand");
+    logFile = malloc(30*sizeof(char));
+    strcpy(logFile,"test");
+  }
+  /* maintenant on a toutes les informations qu'il faut */
+  /* pour l'instant, on n'implemente pas le fichier de log */
+  int retval;
+  if ((joueur1 == 'H') && (joueur2 == 'H')){
+    printf("Deux joueurs humains, ce n'est pas mon boulot\n");
+  } else if((joueur1 == 'H') && (joueur2 == 'M')) {
+    printf("Humain contre machine (%s), taille %d\n",path2,taille);
+    retval = joueHM(taille,path2,logFile);
+  } else if((joueur1 == 'M') && (joueur2 == 'H')) {
+    printf("Machine (%s) contre humain, taille %d\n",path1,taille);
+    retval = joueMH(taille,path1,logFile);
+  } else {
+    printf("Machine (%s) contre machine (%s)\n",path1,path2);
+    retval = joueMM(taille,path1,path2,logFile);
+  }
+
+
+  printf("\n\nLe jeu est termine ! \n\n");
+  free(path1);
+  free(path2);
+  free(logFile);
+  return retval;
+}
+
+int dansGrille(char col, int lig, int taille){
+return (((col -'A') >= 0) && ((col - 'A') < taille) && 
+	  (lig >= 0) && (lig < taille));
+}
+
+
+/* jeu d'un homme contre une machine */
+int joueHM(int taille, char *p2, char *log){
+  int versProgramme[2]; /* tube pour envoyer des infos VERS le programme */
+  int deProgramme[2]; /* tube pour recuperer des infos DEPUIS le programme */
+  FILE *logFile = NULL;
+  if (log != NULL){
+    printf("fichier d'enregistrement: %s\n",log);
+    logFile = fopen(log,"w");
+  }
+  pipe(versProgramme); 
+  pipe(deProgramme);
+  int pid = fork();
+  if (pid == -1){
+    perror("Fork n'a pas reussi\n");
+    return(-1);
+  } else if (pid == 0){
+    /* on est l'enfant: lancer le programme apres avoir
+     * redirige entree et sortie standard vers les tubes */
+    dup2(versProgramme[0],STDIN_FILENO);
+    dup2(deProgramme[1],STDOUT_FILENO);
+    close(versProgramme[1]); // pas besoin de lire ce qu'on ecrit
+    close(deProgramme[0]); // et inversement
+    char t[40];
+    sprintf(t,"%d",taille);
+    execlp(p2,p2,t,"grilleOn","ia","N",(char *) NULL);
+    perror("Pas reussi a executer le programme. Desole");
+    free(p2);
+    exit(-4);
+  } else {
+    /* on est le pere et pid est le pid du fils */
+    /* on recupere les infos du tube. On veut bien sur aussi 
+     * garder entree et sortie standard */
+    close(versProgramme[0]);
+    close(deProgramme[1]);
+    printf("Vous etes les blancs, vous commencez\n");
+    char *coupBlanc = malloc(513 * sizeof(char));
+    char *coupNoir = malloc(513 * sizeof(char));
+    coupNoir[512] = '\0';
+    char colonneB, colonneN;
+    int ligneB, ligneN;
+    int nbRead;
+    int status;
+    int changed;
+    do {
+      changed = waitpid(pid,&status,WNOHANG); // on regarde si le fils n'a pas termine
+      if (changed == 0) {
+	do {
+	  printf("Votre coup (blancs) : ");
+	  scanf("%s",coupBlanc);
+	  colonneB = coupBlanc[0];
+	  sscanf(coupBlanc+1,"%d",&ligneB);
+	} while (dansGrille(colonneB,ligneB,taille) == 0);
+	printf("Vous jouez le coup: %s\n",coupBlanc);
+	write(versProgramme[1],coupBlanc,strlen(coupBlanc));
+	if (logFile != NULL){
+	  fprintf(logFile,coupBlanc);
+	  fflush(logFile);
+	}
+	/* attente bloquante */
+	nbRead = read(deProgramme[0],coupNoir,512);
+	printf("Lu %d caracteres\n",nbRead);
+	if (nbRead >= 5){
+	  printf("Les noirs declarent %s\n",coupNoir);
+	} else { /* un coup legal */
+	  printf("Les noirs jouent %s\n",coupNoir);
+	}	  
+	if (logFile != NULL){
+	    fprintf(logFile,coupNoir);
+	    fflush(logFile);
+	  }
+      } else {
+	printf("Les noirs ont termine de jouer: %d\n",WEXITSTATUS(status));
+      }
+    } while (changed == 0); 
+    /* on continue tant que le fils n'a pas termine */
+    /* puis on libere tout */
+    free(coupNoir);
+    free(coupBlanc);
+    close(versProgramme[1]);
+    close(deProgramme[0]);
+    return 0;
+  }
+}
+
+
+/* jeu d'une machine contre un homme */
+int joueMH(int taille, char *p1, char *log){
+  int versProgramme[2]; /* tube pour envoyer des infos VERS le programme */
+  int deProgramme[2]; /* tube pour recuperer des infos DEPUIS le programme */
+  FILE *logFile = NULL;
+  if (log != NULL){
+    printf("fichier d'enregistrement: %s\n",log);
+    logFile = fopen(log,"w");
+  }
+  pipe(versProgramme); 
+  pipe(deProgramme);
+  int pid = fork();
+  if (pid == -1){
+    perror("Fork n'a pas reussi\n");
+    return(-1);
+  } else if (pid == 0){
+    /* on est l'enfant: lancer le programme apres avoir
+     * redirige entree et sortie standard vers les tubes */
+    dup2(versProgramme[0],STDIN_FILENO);
+    dup2(deProgramme[1],STDOUT_FILENO);
+    close(versProgramme[1]); // pas besoin d ecrire ce qu'on lit
+    close(deProgramme[0]); // et inversement
+    char t[40];
+    sprintf(t,"%d",taille);
+    execlp(p1,p1,t,"grilleOn","ia","B",(char *) NULL);
+    perror("Pas reussi a executer le programme. Desole");
+    free(p1);
+    exit(-4);
+  } else {
+    /* on est le pere et pid est le pid du fils */
+    /* on recupere les infos du tube. On veut bien sur aussi 
+     * garder entree et sortie standard */
+    close(versProgramme[0]);
+    close(deProgramme[1]);
+    printf("Vous etes les noirs, vous jouez en second\n");
+    char *coupBlanc = malloc(513 * sizeof(char));
+    char *coupNoir = malloc(513 * sizeof(char));
+    coupBlanc[512] = '\0';
+    char colonneB, colonneN;
+    int ligneB, ligneN;
+    int nbRead;
+    int status;
+    int changed;
+    do {
+      changed = waitpid(pid,&status,WNOHANG); // on regarde si le fils n'a pas termine
+      if (changed == 0) {
+	/* attente bloquante ??? */
+	nbRead = read(deProgramme[0],coupBlanc,512*sizeof(char));
+	if (nbRead >= 5){
+	  printf("Les blancs declarent: %s",coupBlanc);
+	} else { /* un coup legal */
+	  printf("Les blancs jouent: %s",coupBlanc);
+	}
+	if (logFile != NULL){
+	  fprintf(logFile,coupBlanc);
+	  fflush(logFile);
+	}
+	changed = waitpid(pid,&status,WNOHANG); // on teste encore une fois le fils
+	if (changed == 0) {
+	  do {
+	    printf("Votre coup (noirs) : ");
+	    scanf("%s",coupNoir);
+	    colonneN = coupNoir[0];
+	    sscanf(coupNoir+1,"%d",&ligneN);
+	  } while (dansGrille(colonneN,ligneN,taille) == 0);
+	  printf("Vous jouez le coup: %s\n",coupNoir);
+	  write(versProgramme[1],coupNoir,strlen(coupNoir));	  
+	  if (logFile != NULL){
+	    fprintf(logFile,coupNoir);
+	    fflush(logFile);
+	  }
+	}
+      } else {
+	printf("Les blancs ont termine de jouer: %d\n",WEXITSTATUS(status));
+      }
+    } while (changed == 0); 
+    /* on continue tant que les blancs n'ont pas termine */
+    /* puis on libere tout */
+    free(coupNoir);
+    free(coupBlanc);
+    close(versProgramme[1]);
+    close(deProgramme[0]);
+    return 0;
+  }
+}
+
+int joueMM(int taille, char *p1, char *p2, char *log){  
+  FILE *logFile = NULL;
+  if (log != NULL){
+    printf("fichier d'enregistrement: %s\n",log);
+    logFile = fopen(log,"w");
+  }
+  int versProgrammeA[2], versProgrammeB[2];
+  int deProgrammeA[2], deProgrammeB[2];
+  pipe(versProgrammeA); 
+  pipe(deProgrammeA);
+  int pidA = fork();
+  if (pidA == -1){
+    perror("Fork n'a pas reussi");
+    return(-1);
+  } else if (pidA == 0){
+    /* fils A: les blancs */
+    dup2(versProgrammeA[0],STDIN_FILENO);
+    dup2(deProgrammeA[1],STDOUT_FILENO);
+    close(versProgrammeA[1]);
+    close(deProgrammeA[0]);
+    fclose(logFile);
+    char t[40];
+    sprintf(t,"%d",taille);
+    execlp(p1,p1,t,"grilleOn","ia","B",(char *) NULL);
+    perror("Pas reussi a executer le programme A. Desole");
+    return -4;
+    
+  } else {
+    /* pere */
+    pipe(versProgrammeB); 
+    pipe(deProgrammeB);
+    close(versProgrammeA[0]);
+    close(deProgrammeA[1]);
+    int pidB = fork();
+    if (pidB == -1){
+      perror("Fork 2 n'a pas reussi");
+      return -1; /* le fils A est tue quand le pere meurt */
+    } else if (pidB == 0) {
+      
+      /* fils B: les noirs */
+      close(versProgrammeA[1]);
+      close(deProgrammeA[0]);
+      close(versProgrammeB[1]);
+      close(deProgrammeB[0]);
+      fclose(logFile);
+      dup2(versProgrammeB[0],STDIN_FILENO);
+      dup2(deProgrammeB[1],STDOUT_FILENO);
+      char t[40];
+      sprintf(t,"%d",taille);
+      execlp(p2,p2,t,"grilleOff","ia","N",(char *) NULL);
+      perror("Pas reussi a executer le programme B. Desole");
+      return -5;
+      
+    } else {
+      /* le pere */
+      close(versProgrammeB[0]);
+      close(deProgrammeB[1]);
+      char *coupBlanc = malloc(513 * sizeof(char));
+      char *coupNoir = malloc(513 * sizeof(char));
+      int nbRead;
+      int status;
+      int changed;
+      int i=0;
+      do {
+	changed = waitpid(pidA,&status,WNOHANG);
+	if (changed == 0) {
+	  nbRead = read(deProgrammeA[0],coupBlanc,512);
+	  coupBlanc[nbRead] = '\0';
+	  if (nbRead >= 5){
+	    printf("Les blancs declarent: %s",coupBlanc);
+	  } else { /* un coup legal: colonne, ligne, \n et \0 */
+	    printf("Les blancs jouent: %s",coupBlanc);
+	  }
+	  safeWrite(versProgrammeB[1],coupBlanc);
+	  if (logFile != NULL){
+	    fprintf(logFile,coupBlanc);
+	    fflush(logFile);
+	  }
+	  changed = waitpid(pidB,&status,WNOHANG);
+	  if (changed == 0){
+	    nbRead = read(deProgrammeB[0],coupNoir,512);
+	    coupNoir[nbRead] = '\0';
+	    if (nbRead >= 5){
+	      printf("Les noirs declarent: %s",coupNoir);
+	    } else { /* un coup legal: colonne, ligne, \n et \0 */
+	      printf("Les noirs jouent: %s",coupNoir);
+	    }
+	  /* tester si on peut ecrire avant de le faire ! Sinon ca plante */
+	    safeWrite(versProgrammeA[1],coupNoir);
+	    if (logFile != NULL){
+	    fprintf(logFile,coupNoir);
+	    fflush(logFile);
+	    }
+	  } else {
+	    finMachineSimple(deProgrammeB[0],"noirs",status,deProgrammeA[0],versProgrammeA[1],pidA,"blancs",logFile);
+	  }
+	} else {
+	  finMachineSimple(deProgrammeA[0],"blancs",status,deProgrammeB[0],versProgrammeB[1],pidB,"noirs",logFile);
+	}
+      } while (changed == 0); 
+      free(coupNoir);
+      free(coupBlanc);
+      if (logFile != NULL){
+	fprintf(logFile,"\n---- partie terminee ----\n ");
+	fflush(logFile);
+	fclose(logFile);
+      }
+      close(versProgrammeA[1]);
+      close(deProgrammeA[0]);
+      close(versProgrammeB[1]);
+      close(deProgrammeB[0]);
+      return 0;
+    } // fin second fork
+  } // fin premier fork
+  
+}
+
+
+void finMachineSimple(int from1, char *nom1, int status, int from2, int to2, int pid2, char *nom2, FILE *logFile){
+  int nbRead;
+  char *coup1 = malloc(513 * sizeof(char));
+  char *coup2 = malloc(513 * sizeof(char));
+  struct rusage infoFils;
+  double uFils1, sFils1, uFils2, sFils2;
+  printf("Les %s ont termine de jouer: %d!\n",nom1,WEXITSTATUS(status));
+  getrusage(RUSAGE_CHILDREN,&infoFils);
+  /* on recupere des secondes et des micro secondes pour le temps CPU passe
+   * en calculs utilisateurs et en appel de fonctions systeme du fils 1 */
+  sFils1 = ((double) infoFils.ru_stime.tv_sec) + ((double) infoFils.ru_stime.tv_usec)/1000000;
+  uFils1 = ((double) infoFils.ru_utime.tv_sec) + ((double) infoFils.ru_utime.tv_usec)/1000000;
+  printf("Les %s ont utilise %lf sec de systeme et %lf de temps utilisateur\n",
+	 nom1,sFils1,uFils1);
+  nbRead = read(from1,coup1,512);
+  if (nbRead > 0){
+    coup1[nbRead] = '\0';
+    printf("Les %s ont un dernier message: %s",nom1,coup1);
+    safeWrite(to2,coup1);
+    if (logFile != NULL){
+      fprintf(logFile,coup1);
+      fflush(logFile);
+    }
+  }
+  sleep(1); /* on attend une seconde que l'autre ait aussi termine ! */
+  if (waitpid(pid2,&status,WNOHANG) == 0){
+    printf("Cependant, les %s n'ont pas termine de jouer ... tant pis.\n",nom2);
+    /* on les tue */
+    kill(pid2,SIGKILL);
+    waitpid(pid2,&status,WNOHANG);
+  } else {
+    printf("Les %s on aussi termine: %d!\n",nom2,WEXITSTATUS(status));
+  }
+  getrusage(RUSAGE_CHILDREN,&infoFils);
+  /* idem, sauf qu'on recupere la somme du fils 1 et du fils 2 ... */
+  sFils2 = ((double) infoFils.ru_stime.tv_sec) + ((double) infoFils.ru_stime.tv_usec)/1000000;
+  uFils2 = ((double) infoFils.ru_utime.tv_sec) + ((double) infoFils.ru_utime.tv_usec)/1000000;
+  /* idem, sauf qu'on recupere la somme du fils 1 et du fils 2  */
+  sFils2 = sFils2 - sFils1;
+  uFils2 = uFils2 - uFils1;
+  printf("Les %s ont utilise %lf sec de systeme et %lf de temps utilisateur\n",
+	 nom2,sFils2,uFils2);
+  nbRead = read(from2,coup2,512);
+  if(nbRead > 0){
+    coup2[nbRead] = '\0';
+    printf("Les %s ont un dernier message: %s",nom2,coup2);
+    if (logFile != NULL){
+      fprintf(logFile,coup2);
+      fflush(logFile);
+    }
+  }
+}
+
+/* ecrit de facon "sure" dans un tube: si on essaie d'ecrire dans un tube * 
+ * ferme, on recoit un signal qui fait terminer le programme */
+/* retourne le nombre de caracteres ecrit et -1 si ca s'est mal passe */
+int safeWrite(int fd, char *s){
+  if (write(fd,s,strlen(s)) == -1)
+    printf("Impossible d'ecrire dans le tube: il est ferme en lecture\n");
+  return 0;
+}
+
+
+
+
+
+/* vieux machin complique et qui marche pas 
+
+void finMachine(int from1, char *nom1, int status, int from2, int to2, int pid2, char *nom2, FILE *logFile){
+  int nbRead;
+  fd_set set;
+  struct timeval timeout = {1,0};// timeout a 1 seconde
+  char *coup1 = malloc(513 * sizeof(char));
+  char *coup2 = malloc(513 * sizeof(char));
+  printf("Les %s ont termine de jouer: %d!\n",nom1,WEXITSTATUS(status));
+  FD_ZERO(&set);
+  FD_SET(from1,&set);
+  // s'il y a encore des choses a lire
+  if (select(from1+1,&set,NULL,NULL,&timeout) == 0){
+    printf("Les %s n'ont rien d'autre a ajouter\n",nom1);
+  } else {
+    nbRead = read(from1,coup1,512);
+    coup1[nbRead] = '\0';
+    printf("Les %s ont un dernier message: %s",nom1,coup1);
+    safeWrite(to2,coup1);
+    if (logFile != NULL){
+      fprintf(logFile,coup1);
+      fflush(logFile);
+    }
+  }
+  if (waitpid(pid2,&status,WNOHANG) == 0){
+    printf("Cependant, les %s n'ont pas termine de jouer ... tant pis.\n",nom2);
+  } else {
+    printf("Les %s on aussi termine: %d!\n",nom2,WEXITSTATUS(status));
+  }
+  FD_ZERO(&set);
+  FD_SET(from2,&set);
+  if (select(from2+1,&set,NULL,NULL,&timeout) == 0){
+    printf("Les %s n'ont rien a dire\n",nom2);
+  } else {
+    nbRead = read(from2,coup2,512);
+    coup2[nbRead] = '\0';
+    printf("Les %s ont un dernier message: %s",nom2,coup2);
+    if (logFile != NULL){
+      fprintf(logFile,coup2);
+      fflush(logFile);
+    }
+  }
+
+}
+*/
+

ia/fakeMachine.c

@@ -0,0 +1,110 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<unistd.h>
+#include<string.h>
+#include<errno.h>       
+#include <sys/time.h>
+#include <sys/resource.h>
+
+
+long ack(long n, long m);
+
+int main(int argc, char *argv[])
+{
+
+    /* des messages d'erreur si on a mal lance le programme */
+
+    char *errmsg = malloc(257 * sizeof(char));
+    if (argc < 5)
+    {
+        perror("Il faut 4 arguments:\n 1: taille de la grille\n2: affichage de la grille\n3: humain/ia\n4: B/N\n");
+        free(errmsg);
+        return -1;
+    }
+
+    char *hum = argv[3]; /* 3e argument: humain/ia */
+    char *bw = argv[4]; /* 4eme argument: Blancs/Noirs */
+    if ((strncmp(hum,"ia",2) != 0) || (bw[0] != 'N' && bw[0] != 'B'))
+    {
+        snprintf(errmsg,256,"Mauvais format de l'argument \"%s\" ou \"%s\"\n",hum,bw);
+        perror(errmsg);
+        return -2;
+    }
+
+    /* fin des messages d'erreurs */
+
+    /**********************/
+    /* CORPS DU PROGRAMME */
+    /**********************/
+
+    int i;
+    int nbOctetsLus;
+    char * input = malloc(256 * sizeof(char)); /* buffer d'entree */
+    char * output = malloc(256 * sizeof(char)); /* coup joue: maximum 4 caracteres */
+
+    if (bw[0] == 'B') {
+
+        /* joue les blancs: 10 fois le meme coup */
+        for (i=0;i<10;i++){
+            /* joue un coup: ecrit son coup, identique a printf("A1\n"); */
+            strcpy(output,"A1\n");
+            write(STDOUT_FILENO,output,strlen(output));
+            /* lit le coup joue, identique a scanf("%s",input) */
+            nbOctetsLus = read(STDIN_FILENO,input,255);
+            input[nbOctetsLus] = '\0';  // tableau de caracteres => chaine avec \0 a la fin
+            /* on recommence */
+        }
+        snprintf(output,255,"Les blancs (moi) ont gagne ! Score: 30(B) - 15(N)\n");
+        write(STDOUT_FILENO,output,strlen(output));
+
+        /***************************************************************************
+         * remarques sur l'utilisation de write: le 2nd argument est ce qu'on veut *
+         * ecrire et le 3eme est le nb d'octets ecrire. Pour plus d'informations   *
+         * man 2 write.Pour read: le 2d argument est l'adresse du buffer (alloue !)*
+         * et le 3eme est le bf d'octets maximum que l'on veut lire (en general:   *
+         * la taille en octets du buffer. Pour plus d'information, voir man read   *
+         * enfin, dans les deux cas, le premier argument est la source (ou la      *
+         * destination), en l'occurrence, l'entree et la sortie standard.          *
+        /***************************************************************************/
+
+    }
+    
+    else if (bw[0] == 'N')
+    {
+
+
+        /* joue les noirs: 10 fois le meme coup */
+        for (i=0;i<10;i++){
+            nbOctetsLus = read(STDIN_FILENO,input,255);
+            input[nbOctetsLus] = '\0';
+            strcpy(output,"B1\n");
+            write(STDOUT_FILENO,output,strlen(output));
+        }
+        snprintf(output,255,"Les noirs (moi) ont gagne ! Score: 15(B) - 35(N)\n");
+        write(STDOUT_FILENO,output,strlen(output));
+    }
+
+    /*****************************/
+    /* FIN DU CORPS DU PROGRAMME */
+    /*****************************/
+
+    free(errmsg);
+    free(input);
+    free(output);
+    return 0;
+}
+
+
+
+/* la celebre fonction d'Ackermann: impossible a calculer ne serait-ce que
+ * ack(5,5). Prend un temps hyperexponentiel */
+    long ack(long n, long m){
+        if (n == 0)
+            return m + 1;
+        if (m == 0)
+            return ack(n-1,1);
+        else {
+            return ack(n-1,ack(n,m-1));
+        }
+
+    }

ia/main.c

@@ -0,0 +1,191 @@
+/*  This file is part of OloNO
+    Copyright (C) 2008 Martin Potier (<mpotier@isep.fr>) and
+                       David Wagner  (<dwagner@isep.fr>)
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Library General Public
+    License as published by the Free Software Foundation; version 3
+    of the License.
+
+    This library 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
+    Library General Public License for more details.
+
+    You should have received a copy of the GNU Library General Public License
+    along with this library; see the file COPYING.LIB.  If not, write to
+    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+    Boston, MA 02110-1301, USA.
+*/
+
+/** \file
+ * main.c
+ * Contient la boucle principale du programme
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <argp.h>
+#include <string.h>
+
+// On inclu nos librairies personnelles :
+#include "../lib/libDefine.h"
+#include "../lib/libDisplay.h"
+#include "../lib/libPlay.h"
+#include "../lib/libCases.h"
+#include "../lib/libIA.h"
+
+int boucleDeJeu(CASE *plateau[]);
+
+// Certains compilos définissent _WIN32, d'autres __WIN32
+#ifdef  _WIN32
+#ifndef __WIN32
+#define __WIN32
+#endif
+#endif
+
+// Variables globales
+arguments args;
+int    taillePlateau;       // Taille du plateau par défaut;
+
+//! Lance le programme
+/**
+ * Cette fonction est la boucle principale du programme.
+ * Elle permet de rassembler toutes les autres fonctions dans un contenu reflétant
+ * le fonctionnement du programme. Pour comprendre le fonctionnement d'un programme,
+ * lire le main() devrait suffire.
+*/
+int main(int argc, char ** argv)
+{
+
+    if (argc < 5)
+        return 1;
+
+    /* On initialise les arguments à leur valeur par défaut */
+    args.taillePlateau = atoi(argv[1]);
+    args.verbose = (strcmp("grilleOn", argv[2]) == 0) ? 1 : 0;
+    strcpy(args.type, argv[3]);
+    args.couleur = (*argv[4] == 'B' ? 0 : 1);
+    args.Tore        = 0;
+
+    taillePlateau = args.taillePlateau;
+
+//    erreur("valeur d'un coin:%d\n", valeurLigne(0)+valeurLigne(0));
+//    erreur("valeur en diagonale d'un coin:%d\n", valeurLigne(1)+valeurLigne(1));
+//    erreur("idem, mais a la fin:%d\n", valeurLigne(taillePlateau-2)+valeurLigne(taillePlateau-2));
+//    erreur("valeur d'un pion a coté du joker:%d\n", valeurLigne(taillePlateau/2 - 1)*valeurLigne(taillePlateau/2 + 1));
+
+// ############################################################### //
+// ### On commence les choses sérieuses ici (cad le main) ######## //
+// ############################################################### //
+
+    int  i=0;             // Variables de boucle.
+    int  points[]={0, 0}; // Points obtenus pour les blancs et les noirs
+    char retour;
+
+// ######################################################################################### //
+// # ETAPE 2 : Initialiser le plateau ###################################################### //
+// ######################################################################################### //
+
+    // On créé un tableau à la taille demandée par le joueur
+    CASE ** plateau = createPlateau();
+    // On initialise ce tableau avec la consigne
+    initPlateau(plateau);
+
+// ######################################################################################### //
+// # ETAPE 3 : Boucle de jeux principale ################################################### //
+// ######################################################################################### //
+
+    retour = boucleDeJeu(plateau);
+
+    if (retour)
+        erreur("La boucle de jeu s'est arrêtée à cause d'une erreur\n");
+
+// ######################################################################################### //
+// # ETAPE 4 : Score ####################################################################### //
+// ######################################################################################### //
+
+    affichePlateau(plateau);
+    score(plateau, points);
+    afficherScore(points);
+
+    // On oublie pas de libérer l'espace mallocé
+    for (i=0; i<taillePlateau*taillePlateau; i++)
+        free( plateau[i] );
+    free(plateau);
+    return 0;
+}
+
+//! Boucle de jeu, pour jouer quoi ...
+/**
+ * Chaque IA joue son coup puis attend le coup de l'adversaire (ou l'inverse).
+ * Si c'est demandé, elle affiche aussi le platau entre les deux.
+ * En cas d'erreur, quelle qu'elle soit (interne(peu probable)) ou de la part
+ * de l'adversaire (peu probable sauf si l'adversaire est un humain), alors on
+ * s'arrête (boucleDeJeu interprêtera un retour de 1 comme une erreur.)
+ */
+int boucleDeJeu(CASE *plateau[])
+{
+    // On commence par les blancs (dans la règle du jeu).
+    char couleur = args.couleur;
+    char aPuJouer[] = {1, 1}; // aPuJouer[0]: blanc; aPuJouer[1]: noir
+
+
+    if (couleur == 0)
+    {
+        while (!testFinPartie(plateau) && !(aPuJouer[BLANC] == 0 && aPuJouer[NOIR] == 0) )
+        {
+            int retour;
+            aPuJouer[BLANC] = 1;
+            // On a les blancs, on commence à jouer
+            retour = jouerSonTour(couleur, plateau);
+            if (retour == -1)
+                return -1; // Une erreur s'est produite
+            else if (retour == 1) // On ne pouvait rien jouer
+                aPuJouer[BLANC] = 0;
+
+            if (args.verbose)
+                affichePlateau(plateau);
+
+            // Puis on lit le coup de l'adversaire
+            aPuJouer[NOIR] = 1;
+            retour = jouerTourAdverse(couleur, plateau);
+            if (retour == -1)
+                return -1; // L'adversaire a commis une faute
+            else if (retour == 1) // L'adversaire n'a rien joué
+                aPuJouer[NOIR] = 0;
+
+        }
+    }
+
+    else
+    {
+        while (!testFinPartie(plateau) && !(aPuJouer[BLANC