update README for 0.5

This fixes a bug where the last pieces of console output were lost. In that
case, the event loop scheduled the ended child process's SIGCHLD handler
before the handler to read the last of the process's output. We work around
that by doing an additional (non-blocking) read in the SIGCHLD handler

CMakeLists.txt

@@ -1,5 +1,5 @@
 ###
-### Copyright 2016 Oliver Giles
+### Copyright 2015-2017 Oliver Giles
 ###
 ### This file is part of Laminar
 ###
@@ -18,6 +18,7 @@
 ###
 project(laminar)
 cmake_minimum_required(VERSION 2.8)
+cmake_policy(SET CMP0058 NEW)
 
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
@@ -57,7 +58,7 @@ add_custom_command(OUTPUT laminar.capnp.c++ laminar.capnp.h
 
 # Zip and compile statically served resources
 generate_compressed_bins(${CMAKE_SOURCE_DIR}/src/resources index.html js/app.js
-    favicon.ico favicon-152.png icon.png progress.gif)
+    favicon.ico favicon-152.png icon.png tick.gif cross.gif spin.gif)
 
 # Download 3rd-party frontend JS libs...
 file(DOWNLOAD https://cdnjs.cloudflare.com/ajax/libs/vue/2.3.4/vue.min.js

COPYING

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

README.md

@@ -1,6 +1,6 @@
 # Laminar CI
 
-[Laminar](https://laminar.ohwg.net) is a lightweight and modular Continuous Integration service for Linux. It is self-hosted and developer-friendly, eschewing a configuration web UI in favor of simple version-controllable configuration files and scripts.
+[Laminar](http://laminar.ohwg.net) is a lightweight and modular Continuous Integration service for Linux. It is self-hosted and developer-friendly, eschewing a configuration web UI in favor of simple version-controllable configuration files and scripts.
 
 Laminar encourages the use of existing GNU/Linux tools such as `bash` and `cron` instead of reinventing them.
 
@@ -10,7 +10,7 @@ Although the status and progress front-end is very user-friendly, administering
 
 ### Building from source
 
-First install development packages for `capnproto`, `websocketpp`, `sqlite` and `boost-filesystem` from your distribution's repository or other source. Then:
+First install development packages for `capnproto (git)`, `rapidjson`, `websocketpp`, `sqlite` and `boost-filesystem` from your distribution's repository or other source. Then:
 
 ```bash
 git clone https://github.com/ohwgiles/laminar.git
@@ -24,20 +24,20 @@ sudo make install
 
 ### Installation from binaries
 
-Alternatively to the source-based approach shown above, precompiled packages are supplied for x86_64 Debian Stable and CentOS 7.
+Alternatively to the source-based approach shown above, precompiled packages are supplied for x86_64 Debian Stretch and CentOS 7.
 
 Under Debian:
 
 ```bash
-wget https://github.com/ohwgiles/laminar/releases/download/0.4/laminar-0.4-1-amd64.deb
-sudo dpkg -i laminar-0.4-1-amd64.deb
+wget https://github.com/ohwgiles/laminar/releases/download/0.5/laminar-0.5-1-amd64.deb
+sudo apt install laminar-0.5-1-amd64.deb
 ```
 
 Under CentOS:
 
 ```bash
-wget https://github.com/ohwgiles/laminar/releases/download/0.4/laminar-0.4-1.x86_64.rpm
-sudo rpm -i laminar-0.4-1.x86_64.rpm
+wget https://github.com/ohwgiles/laminar/releases/download/0.5/laminar-0.5-1.x86_64.rpm
+sudo yum install laminar-0.5-1.x86_64.rpm
 ```
 
 Both install packages will create a new `laminar` user and install (but not activate) a systemd service for launching the laminar daemon.
@@ -48,17 +48,25 @@ Use `systemctl start laminar` to start the laminar system service and `systemctl
 
 After starting the service, an empty laminar dashboard should be available at http://localhost:8080
 
-Laminar`s configuration file may be found at `/etc/laminar.conf`. Laminar will start with reasonable defaults if no configuration can be found.
+Laminar's configuration file may be found at `/etc/laminar.conf`. Laminar will start with reasonable defaults if no configuration can be found.
 
 #### Running on a different HTTP port or Unix socket
 
 Edit `/etc/laminar.conf` and change `LAMINAR_BIND_HTTP` to `IPADDR:PORT`, `unix:PATH/TO/SOCKET` or `unix-abstract:SOCKETNAME`. `IPADDR` may be `*` to bind on all interfaces. The default is `*:8080`.
 
-Do not attempt to run laminar on port 80. This requires running as `root`, and Laminar will not drop privileges when executing job scripts! For a more complete integrated solution (including SSL), simply run laminar as a reverse proxy behind a regular webserver. For instructions, see for example [NGINX Reverse Proxy](https://www.nginx.com/resources/admin-guide/reverse-proxy/) or [Apache Reverse Proxy](https://httpd.apache.org/docs/2.4/howto/reverse_proxy.html).
+Do not attempt to run laminar on port 80. This requires running as `root`, and Laminar will not drop privileges when executing job scripts! For a more complete integrated solution (including SSL), simply run laminar as a reverse proxy behind a regular webserver.
+
+#### Running behind a reverse proxy
+
+Laminar relies on WebSockets to provide a responsive, auto-updating display without polling. This may require extra support from your frontend webserver.
+
+For nginx, see [NGINX Reverse Proxy](https://www.nginx.com/resources/admin-guide/reverse-proxy/) and [WebSocket proxying](http://nginx.org/en/docs/http/websocket.html).
+
+For Apache, see [Apache Reverse Proxy](https://httpd.apache.org/docs/2.4/howto/reverse_proxy.html) and [mod_proxy_wstunnel](https://httpd.apache.org/docs/2.4/mod/mod_proxy_wstunnel.html).
 
 #### Set the page title
 
-Change `LAMINAR_TITLE` to your preferred page title.
+Change `LAMINAR_TITLE` in `/etc/laminar.conf` to your preferred page title.
 
 #### More configuration options
 
@@ -86,7 +94,9 @@ cd hello-2.10
 make
 ```
 
-Don't forget to mark it executable:
+Laminar uses your script's exit code to determine whether to mark the run as successful or failed. If your script is written in bash, the [`-e` option](http://tldp.org/LDP/abs/html/options.html) is helpful for this. See also [Exit and Exit Status](http://tldp.org/LDP/abs/html/exit-status.html).
+
+Don't forget to mark the script executable:
 
 ```bash
 chmod +x /var/lib/laminar/cfg/hello.run
@@ -102,7 +112,11 @@ laminarc trigger hello
 
 This causes the `/var/lib/laminar/cfg/hello.run` script to be executed, with a working directory of `/var/lib/laminar/run/hello/1`
 
-The results and log output should be visible in the Web UI at http://localhost:8080
+The result and log output should be visible in the Web UI at http://localhost:8080/jobs/hello/1
+
+#### Isn't there a "Build Now" button I can click?
+
+This is against the design principles of Laminar and was deliberately excluded. Laminar's web UI is strictly read-only, making it simple to deploy in mixed-permission or public environments without an authentication layer. Furthermore, Laminar tries to encourage ideal continuous integration, where manual triggering is an anti-pattern. Want to make a release? Push a git tag and implement a post-receive hook. Want to re-run a build due to sporadic failure/flaky tests? Fix the tests locally and push a patch. Experience shows that a manual trigger such as a "Build Now" button is often used as a crutch to avoid doing the correct thing, negatively impacting traceability and quality.
 
 #### Triggering a job at a certain time
 
@@ -137,7 +151,7 @@ On a trusted network, you might want `laminard` to listen for commands on a TCP
 LAMINAR_BIND_RPC=*:9997
 ```
 
-or any interface/port combination you like. This option uses the same syntax as [that for the web UI](#running-on-a-different-http-port-or-unix-socket)
+or any interface/port combination you like. This option uses the same syntax as `LAMINAR_BIND_HTTP`.
 
 Then, point `laminarc` to the new location using an environment variable:
 
@@ -215,14 +229,13 @@ See also [script execution order](#script-execution-order)
 #### Passing variables between run scripts
 
 Any script can set environment variables that will stay exposed for subsequent scripts of the same run using `laminarc set`. In `example.before`:
-
 ```bash
 #!/bin/bash
 laminarc set foo=bar
 ```
 
 Then in `example.run`
-```
+```bash
 #!/bin/bash
 echo $foo            # prints "bar"
 ```
@@ -231,9 +244,9 @@ This works because laminarc reads `$JOB` and `$NUM` and passes them to the lamin
 
 ### Post-build actions
 
-Analagously to [Pre-build actions](#pre-build-actions), if the script `/var/lib/laminar/cfg/jobs/example.after` exists, it will be executed after the primary `/var/lib/laminar/cfg/jobs/example.run` script. The `$RESULT` environment variable will contain the run result.
+Analagously to [Pre-build actions](#pre-build-actions), if the script `example.after` exists, it will be executed after the primary `example.run` script.
 
-See also [Environment variables](#environment-variables).
+The `$RESULT` environment variable will contain the run result. See also [Environment variables](#environment-variables).
 
 #### Archiving artefacts
 
@@ -299,17 +312,17 @@ The directory `/var/lib/laminar/cfg/scripts` is automatically prepended to the `
 ```bash
 #!/bin/bash -e
 if [ "$RESULT" == "success" ]; then
-  laminarc trigger $@
+  laminarc trigger "$@"
 fi
 ```
 
-With this in place, the example shown above in [Conditionally trigger a downstream job](#conditionally-trigger-a-downstream-job) can be simplified to
+With this in place, any `.after` script can conditionally trigger a downstream job more succinctly:
 
 ```bash
 success_trigger example-test
 ```
 
-Another excellent candidate for helper scripts is automatically [sending notifications](#email-and-im-notifications) on job status change. See [Example scripts](#appendix--example-scripts) for more useful starting points.
+Another excellent candidate for helper scripts is automatically sending notifications on job status change. See [Example scripts](#appendix-example-scripts) for more useful starting points.
 
 ### Data sharing and Workspaces
 
@@ -348,7 +361,7 @@ Laminar will automatically create the workspace for a job if it doesn't exist wh
 
 In Laminar, a *node* is an abstract concept allowing more fine-grained control over job execution scheduling. Each node can be defined to support an integer number of *executors*, which defines how many runs can be executed simultaneously.
 
-A typical example would be to allow only a few concurrent CPU-intensive jobs (such as compilation), while simultaneously allowing many more less-intensive jobs (such as monitoring or remote jobs). To create a node named `build` with 3 executors, create the file `/var/lib/laminar/cfg/nodes/build.config` with the following content:
+A typical example would be to allow only a few concurrent CPU-intensive jobs (such as compilation), while simultaneously allowing many more less-intensive jobs (such as monitoring or remote jobs). To create a node named `build` with 3 executors, create the file `/var/lib/laminar/cfg/nodes/build.conf` with the following content:
 
 ```
 EXECUTORS=3
@@ -383,7 +396,7 @@ If `/var/lib/laminar/cfg/nodes/NODENAME.env` exists and can be parsed as a list
 
 ### Remote jobs
 
-Laminar provides no specific support, `bash`, `ssh` and possibly NFS are all you need. For example, consider two identical target devices on which test jobs can be run in parallel. You might create a [node](#nodes and tags) for each, `/var/lib/laminar/cfg/nodes/target{1,2}.conf` with a common tag:
+Laminar provides no specific support, `bash`, `ssh` and possibly NFS are all you need. For example, consider two identical target devices on which test jobs can be run in parallel. You might create a [node](#nodes-and-tags) for each, `/var/lib/laminar/cfg/nodes/target{1,2}.conf` with a common tag:
 
 ```
 EXECUTORS=1
@@ -411,20 +424,11 @@ ssh root@$TARGET_IP /bin/bash -xe <<"EOF"
   uname -a
   ...
 EOF
-scp root@$TARGET_IP:result.xml $ARCHIVE/
+scp root@$TARGET_IP:result.xml "$ARCHIVE/"
 ```
 
 Don't forget to add the `laminar` user's public ssh key to the remote's `authorized_keys`.
 
-The call to ssh can itself be hidden with a [helper script](#helper-scripts) `/var/lib/laminar/cfg/scripts/remotebuild`:
-
-```bash
-#!/bin/bash -e
-ssh -E root@$TARGET_IP /bin/bash -xe < $1
-```
-
-Then simply use `#!/usr/bin/env remotebuild` instead of the `#!/bin/bash` hashbang.
-
 ### Docker container jobs
 
 Laminar provides no specific support, but just like [remote jobs](#remote-jobs) these are easily implementable in plain bash:
@@ -432,7 +436,7 @@ Laminar provides no specific support, but just like [remote jobs](#remote-jobs)
 ```bash
 #!/bin/bash
 
-docker run --rm -ti -v $PWD:/root -v $WORKSPACE:/ws ubuntu /bin/bash -xe <<EOF
+docker run --rm -ti -v $PWD:/root ubuntu /bin/bash -xe <<EOF
   git clone http://...
   ...
 EOF
@@ -464,7 +468,7 @@ laminarc lock $JOB-workspace
 git fetch
 git checkout $rev
 cd -
-# Fast (hard-link) copy the specific checkout to the build dir
+# Fast copy (hard-link) the specific checkout to the build dir
 cp -al $WORKSPACE/src src
 # Release the lock to allow other jobs to do the same
 laminarc release $JOB-workspace
@@ -486,7 +490,7 @@ make
 - `LAMINAR_BIND_HTTP`: The interface/port or unix socket on which `laminard` should listen for incoming connections to the web frontend. Default `*:8080`
 - `LAMINAR_BIND_RPC`: The interface/port or unix socket on which `laminard` should listen for incoming commands such as build triggers. Default `unix-abstract:laminar`
 - `LAMINAR_TITLE`: The page title to show in the web frontend.
-- `LAMINAR_KEEP_WORKDIR`: If set, do not delete run directories after completion
+- `LAMINAR_KEEP_RUNDIRS`: Set to an integer defining how many rundirs to keep per job. The lowest-numbered ones will be deleted. The default is 0, meaning all run dirs will be immediately deleted.
 - `LAMINAR_ARCHIVE_URL`: If set, the web frontend served by `laminard` will use this URL to form links to artefacts archived jobs. Must be synchronized with web server configuration.
 
 ### Script execution order
@@ -506,12 +510,12 @@ When `$JOB` is triggered on `$NODE`, the following scripts (relative to `$LAMINA
 
 The following variables are available in run scripts:
 
-- `RUN`
-- `JOB`
-- `RESULT`
-- `LAST_RESULT`
-- `WORKSPACE`
-- `ARCHIVE`
+- `RUN` integer number of this *run*
+- `JOB` string name of this *job*
+- `RESULT` string run status: "success", "failed", etc.
+- `LAST_RESULT` string previous run status
+- `WORKSPACE` path to this job's workspace
+- `ARCHIVE` path to this run's archive
 
 In addition, `$LAMINAR_HOME/cfg/scripts` is prepended to `$PATH`. See [helper scripts](#helper-scripts).
 

docker-build-centos.sh

@@ -48,7 +48,7 @@ Version: $VERSION
 Release: 1
 License: GPL
 BuildRequires: systemd-units
-Requires: boost-filesystem zlib
+Requires: sqlite boost-filesystem zlib
 
 %description
 Lightweight Continuous Integration Service

docker-build-debian.sh

@@ -54,7 +54,7 @@ Section:
 Priority: optional
 Architecture: amd64
 Maintainer: Oliver Giles <web ohwg net>
-Depends: libboost-filesystem1.62.0, zlib1g
+Depends: libsqlite3-0, libboost-filesystem1.62.0, zlib1g
 Description: Lightweight Continuous Integration Service
 EOF
 cat <<EOF > laminar/DEBIAN/postinst

laminar.conf

@@ -33,12 +33,15 @@
 #LAMINAR_TITLE=
 
 ###
-### LAMINAR_KEEP_WORKDIR
+### LAMINAR_KEEP_RUNDIRS
 ###
-### If set (to anything), the job workdir $LAMINAR_HOME/run/$JOB/$NUM
-### will not be deleted after the run has completed
+### Setting this prevents the immediate deletion of job rundirs
+### $LAMINAR_HOME/run/$JOB/$RUN. Value should be an integer represeting
+### the number of rundirs to keep.
 ###
-#LAMINAR_KEEP_WORKDIR=1
+### Default: 0
+###
+#LAMINAR_KEEP_RUNDIRS=0
 
 ###
 ### LAMINAR_ARCHIVE_URL

src/client.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -158,7 +158,7 @@ int main(int argc, char** argv) {
         req.setLockName(argv[2]);
         req.send().wait(waitScope);
     } else {
-        fprintf(stderr, "Unknown comand %s\n", argv[1]);
+        fprintf(stderr, "Unknown command %s\n", argv[1]);
         return EINVAL;
     }
 

src/conf.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/conf.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/database.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2016 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/database.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2016 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/laminar.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -73,7 +73,7 @@ Laminar::Laminar() {
     archiveUrl = ARCHIVE_URL_DEFAULT;
     if(char* envArchive = getenv("LAMINAR_ARCHIVE_URL"))
         archiveUrl = envArchive;
-    eraseWorkdir = true;
+    numKeepRunDirs = 0;
     homeDir = getenv("LAMINAR_HOME") ?: "/var/lib/laminar";
 
     db = new Database((fs::path(homeDir)/"laminar.sqlite").string().c_str());
@@ -177,7 +177,6 @@ void Laminar::sendStatus(LaminarClient* client) {
             j.set("queued", started-queued);
             j.set("started", started);
             j.set("completed", completed);
-            j.set("duration", completed-started);
             j.set("result", to_string(RunState(result)));
             j.set("reason", reason);
         });
@@ -203,7 +202,7 @@ void Laminar::sendStatus(LaminarClient* client) {
         .fetch<int,time_t,time_t,int,str>([&](int build,time_t started,time_t completed,int result,str reason){
             j.StartObject();
             j.set("number", build)
-             .set("duration", completed - started)
+             .set("completed", completed)
              .set("started", started)
              .set("result", to_string(RunState(result)))
              .set("reason", reason)
@@ -247,11 +246,14 @@ void Laminar::sendStatus(LaminarClient* client) {
 
     } else if(client->scope.type == MonitorScope::ALL) {
         j.startArray("jobs");
-        db->stmt("SELECT name,number,startedAt,result FROM builds GROUP BY name ORDER BY number DESC")
-        .fetch<str,int,time_t,int>([&](str name,int number, time_t started, int result){
+        db->stmt("SELECT name,number,startedAt,completedAt,result FROM builds GROUP BY name ORDER BY number DESC")
+        .fetch<str,int,time_t,time_t,int>([&](str name,int number, time_t started, time_t completed, int result){
             j.StartObject();
             j.set("name", name);
-            j.set("number", number).set("result", to_string(RunState(result))).set("started", started);
+            j.set("number", number);
+            j.set("result", to_string(RunState(result)));
+            j.set("started", started);
+            j.set("completed", completed);
             j.startArray("tags");
             for(const str& t: jobTags[name]) {
                 j.String(t.c_str());
@@ -260,6 +262,21 @@ void Laminar::sendStatus(LaminarClient* client) {
             j.EndObject();
         });
         j.EndArray();
+        j.startArray("running");
+        for(const std::shared_ptr<Run> run : activeJobs.get<3>()) {
+            j.StartObject();
+            j.set("name", run->name);
+            j.set("number", run->build);
+            j.set("node", run->node->name);
+            j.set("started", run->startedAt);
+            j.startArray("tags");
+            for(const str& t: jobTags[run->name]) {
+                j.String(t.c_str());
+            }
+            j.EndArray();
+            j.EndObject();
+        }
+        j.EndArray();
     } else { // Home page
         j.startArray("recent");
         db->stmt("SELECT * FROM builds ORDER BY completedAt DESC LIMIT 15")
@@ -268,8 +285,8 @@ void Laminar::sendStatus(LaminarClient* client) {
             j.set("name", name)
              .set("number", build)
              .set("node", node)
-             .set("duration", completed - started)
              .set("started", started)
+             .set("completed", completed)
              .set("result", to_string(RunState(result)))
              .EndObject();
         });
@@ -353,12 +370,18 @@ void Laminar::run() {
     sigemptyset(&mask);
     sigaddset(&mask, SIGCHLD);
     sigprocmask(SIG_BLOCK, &mask, NULL);
-    int sigchld = signalfd(-1, &mask, 0);
-    srv->addDescriptor(sigchld, [this](char* buf, size_t sz){
+    int sigchld = signalfd(-1, &mask, SFD_NONBLOCK|SFD_CLOEXEC);
+    srv->addDescriptor(sigchld, [this](const char* buf, size_t sz){
         struct signalfd_siginfo* siginfo = (struct signalfd_siginfo*) buf;
-        KJ_ASSERT(siginfo->ssi_signo == SIGCHLD);
-        reapAdvance();
-        assignNewJobs();
+        // TODO: re-enable assertion when the cause for its triggering
+        // is discovered and solved
+        //KJ_ASSERT(siginfo->ssi_signo == SIGCHLD);
+        if(siginfo->ssi_signo == SIGCHLD) {
+            reapAdvance();
+            assignNewJobs();
+        } else {
+            LLOG(ERROR, "Unexpected signo", siginfo->ssi_signo);
+        }
     });
 
     srv->start();
@@ -370,8 +393,8 @@ void Laminar::stop() {
 }
 
 bool Laminar::loadConfiguration() {
-    if(getenv("LAMINAR_KEEP_WORKDIR"))
-        eraseWorkdir = false;
+    if(const char* ndirs = getenv("LAMINAR_KEEP_RUNDIRS"))
+        numKeepRunDirs = atoi(ndirs);
 
     NodeMap nm;
 
@@ -482,27 +505,39 @@ std::shared_ptr<Run> Laminar::queueJob(std::string name, ParamMap params) {
 bool Laminar::stepRun(std::shared_ptr<Run> run) {
     bool complete = run->step();
     if(!complete) {
-        srv->addDescriptor(run->fd, [=](char* b,size_t n){
-            std::string s(b,n);
-            run->log += s;
-            for(LaminarClient* c : clients) {
-                if(c->scope.wantsLog(run->name, run->build))
-                    c->sendMessage(s);
-            }
+        srv->addDescriptor(run->fd, [this, run](const char* b,size_t n){
+            handleRunLog(run, std::string(b,n));
         });
     }
     return complete;
 }
 
+void Laminar::handleRunLog(std::shared_ptr<Run> run, std::string s) {
+    run->log += s;
+    for(LaminarClient* c : clients) {
+        if(c->scope.wantsLog(run->name, run->build))
+            c->sendMessage(s);
+    }
+}
+
 // Reaps a zombie and steps the corresponding Run to its next state.
 // Should be called on SIGCHLD
 void Laminar::reapAdvance() {
     int ret = 0;
     pid_t pid;
+    static thread_local char buf[1024];
     while((pid = waitpid(-1, &ret, WNOHANG)) > 0) {
         LLOG(INFO, "Reaping", pid);
         auto it = activeJobs.get<0>().find(pid);
         std::shared_ptr<Run> run = *it;
+        // The main event loop might schedule this SIGCHLD handler before the final
+        // output handler (from addDescriptor). In that case, because it keeps a
+        // shared_ptr to the run it would successfully add to the log output buffer,
+        // but by then reapAdvance would have stored the log and ensured no-one cares.
+        // Preempt this case by forcing a final (non-blocking) read here.
+        for(ssize_t n = read(run->fd, buf, 1024); n > 0; n = read(run->fd, buf, 1024)) {
+            handleRunLog(run, std::string(buf, n));
+        }
         bool completed = true;
         activeJobs.get<0>().modify(it, [&](std::shared_ptr<Run> run){
             run->reaped(ret);
@@ -545,11 +580,12 @@ void Laminar::assignNewJobs() {
             std::shared_ptr<Run> run = *it;
             if(nodeCanQueue(node, *run)) {
                 fs::path cfgDir = fs::path(homeDir)/"cfg";
+                boost::system::error_code err;
 
                 // create a workspace for this job if it doesn't exist
                 fs::path ws = fs::path(homeDir)/"run"/run->name/"workspace";
                 if(!fs::exists(ws)) {
-                    if(!fs::create_directories(ws)) {
+                    if(!fs::create_directories(ws, err)) {
                         LLOG(ERROR, "Could not create job workspace", run->name);
                         break;
                     }
@@ -561,7 +597,16 @@ void Laminar::assignNewJobs() {
                 int buildNum = buildNums[run->name] + 1;
                 // create the run directory
                 fs::path rd = fs::path(homeDir)/"run"/run->name/std::to_string(buildNum);
-                if(!fs::create_directory(rd)) {
+                bool createWorkdir = true;
+                if(fs::is_directory(rd)) {
+                    LLOG(WARNING, "Working directory already exists, removing", rd.string());
+                    fs::remove_all(rd, err);
+                    if(err) {
+                        LLOG(WARNING, "Failed to remove working directory", err.message());
+                        createWorkdir = false;
+                    }
+                }
+                if(createWorkdir && !fs::create_directory(rd, err)) {
                     LLOG(ERROR, "Could not create working directory", rd.string());
                     break;
                 }
@@ -684,7 +729,7 @@ void Laminar::runFinished(Run * r) {
     size_t logsize = r->log.length();
     if(r->log.length() >= COMPRESS_LOG_MIN_SIZE) {
         std::string zipped(r->log.size(), '\0');
-        size_t zippedSize = zipped.size();
+        unsigned long zippedSize = zipped.size();
         if(::compress((unsigned char*)&zipped[0], &zippedSize,
             (unsigned char*)&r->log[0], logsize) == Z_OK) {
             zipped.resize(zippedSize);
@@ -706,7 +751,6 @@ void Laminar::runFinished(Run * r) {
             .set("number", r->build)
             .set("queued", r->startedAt - r->queuedAt)
             .set("completed", completedAt)
-            .set("duration", completedAt - r->startedAt)
             .set("started", r->startedAt)
             .set("result", to_string(r->result))
             .set("reason", r->reason());
@@ -725,11 +769,28 @@ void Laminar::runFinished(Run * r) {
         w->complete(r);
     }
 
-    // remove the rundir
-    fs::remove_all(r->runDir);
-
-    // will delete the job
+    // erase reference to run from activeJobs
     activeJobs.get<2>().erase(r);
+
+    // remove old run directories
+    // We cannot count back the number of directories to keep from the currently
+    // finishing job because there may well be older, still-running instances of
+    // this job and we don't want to delete their rundirs. So instead, check
+    // whether there are any more active runs of this job, and if so, count back
+    // from the oldest among them. If there are none, count back from the latest
+    // known build number of this job, which may not be that of the run that
+    // finished here.
+    auto it = activeJobs.get<4>().equal_range(r->name);
+    uint oldestActive = (it.first == it.second)? buildNums[r->name] : (*it.first)->build - 1;
+    for(int i = oldestActive - numKeepRunDirs; i > 0; i--) {
+        fs::path d = fs::path(homeDir)/"run"/r->name/std::to_string(i);
+        // Once the directory does not exist, it's probably not worth checking
+        // any further. 99% of the time this loop should only ever have 1 iteration
+        // anyway so hence this (admittedly debatable) optimization.
+        if(!fs::exists(d))
+            break;
+        fs::remove_all(d);
+    }
 }
 
 bool Laminar::getArtefact(std::string path, std::string& result) {

src/laminar.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -62,6 +62,7 @@ private:
     void reapAdvance();
     void assignNewJobs();
     bool stepRun(std::shared_ptr<Run> run);
+    void handleRunLog(std::shared_ptr<Run> run, std::string log);
     void runFinished(Run*);
     bool nodeCanQueue(const Node&, const Run&) const;
     // expects that Json has started an array
@@ -85,7 +86,7 @@ private:
     std::string homeDir;
     std::set<LaminarClient*> clients;
     std::set<LaminarWaiter*> waiters;
-    bool eraseWorkdir;
+    uint numKeepRunDirs;
     std::string archiveUrl;
 };
 

src/main.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2016 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/resources.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -19,35 +19,43 @@
 #include "resources.h"
 #include <string.h>
 
-#define INIT_RESOURCE(route, name) \
+#define INIT_RESOURCE(route, name, content_type) \
     extern const char _binary_##name##_z_start[];\
     extern const char _binary_##name##_z_end[]; \
-    resources[route] = std::make_pair(_binary_ ## name ## _z_start, _binary_ ## name ## _z_end)
+    resources.emplace(route, Resource{_binary_ ## name ## _z_start, _binary_ ## name ## _z_end, content_type})
+
+#define CONTENT_TYPE_HTML "text/html; charset=utf-8"
+#define CONTENT_TYPE_ICO  "image/x-icon"
+#define CONTENT_TYPE_PNG  "image/png"
+#define CONTENT_TYPE_GIF  "image/gif"
+#define CONTENT_TYPE_JS   "application/javascript; charset=utf-8"
+#define CONTENT_TYPE_CSS  "text/css; charset=utf-8"
 
 Resources::Resources()
 {
-    // TODO: Content-type
-    INIT_RESOURCE("/", index_html);
-    INIT_RESOURCE("/favicon.ico", favicon_ico);
-    INIT_RESOURCE("/favicon-152.png", favicon_152_png);
-    INIT_RESOURCE("/progress.gif", progress_gif);
-    INIT_RESOURCE("/icon.png", icon_png);
-    INIT_RESOURCE("/js/app.js", js_app_js);
-    INIT_RESOURCE("/js/Chart.HorizontalBar.js", js_Chart_HorizontalBar_js);
-    INIT_RESOURCE("/js/ansi_up.js", js_ansi_up_js);
-    INIT_RESOURCE("/js/vue.min.js", js_vue_min_js);
-    INIT_RESOURCE("/js/vue-router.min.js", js_vue_router_min_js);
-    INIT_RESOURCE("/js/ansi_up.js", js_ansi_up_js);
-    INIT_RESOURCE("/js/Chart.min.js", js_Chart_min_js);
-    INIT_RESOURCE("/js/Chart.HorizontalBar.js", js_Chart_HorizontalBar_js);
-    INIT_RESOURCE("/css/bootstrap.min.css", css_bootstrap_min_css);
+    INIT_RESOURCE("/", index_html, CONTENT_TYPE_HTML);
+    INIT_RESOURCE("/favicon.ico", favicon_ico, CONTENT_TYPE_ICO);
+    INIT_RESOURCE("/favicon-152.png", favicon_152_png, CONTENT_TYPE_PNG);
+    INIT_RESOURCE("/icon.png", icon_png, CONTENT_TYPE_PNG);
+    INIT_RESOURCE("/tick.gif", tick_gif, CONTENT_TYPE_GIF);
+    INIT_RESOURCE("/cross.gif", cross_gif, CONTENT_TYPE_GIF);
+    INIT_RESOURCE("/spin.gif", spin_gif, CONTENT_TYPE_GIF);
+    INIT_RESOURCE("/js/app.js", js_app_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/Chart.HorizontalBar.js", js_Chart_HorizontalBar_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/ansi_up.js", js_ansi_up_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/vue.min.js", js_vue_min_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/vue-router.min.js", js_vue_router_min_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/ansi_up.js", js_ansi_up_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/Chart.min.js", js_Chart_min_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/js/Chart.HorizontalBar.js", js_Chart_HorizontalBar_js, CONTENT_TYPE_JS);
+    INIT_RESOURCE("/css/bootstrap.min.css", css_bootstrap_min_css, CONTENT_TYPE_CSS);
 }
 
 inline bool beginsWith(std::string haystack, const char* needle) {
     return strncmp(haystack.c_str(), needle, strlen(needle)) == 0;
 }
 
-bool Resources::handleRequest(std::string path, const char **start, const char **end) {
+bool Resources::handleRequest(std::string path, const char** start, const char** end, const char** content_type) {
     // need to keep the list of "application links" synchronised with the angular
     // application. We cannot return a 404 for any of these
     auto it = beginsWith(path,"/jobs")
@@ -55,8 +63,9 @@ bool Resources::handleRequest(std::string path, const char **start, const char *
             : resources.find(path);
 
     if(it != resources.end()) {
-        *start = it->second.first;
-        *end = it->second.second;
+        *start = it->second.start;
+        *end = it->second.end;
+        *content_type = it->second.content_type;
         return true;
     }
 

src/resources.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -30,12 +30,17 @@ public:
     Resources();
 
     // If a resource is known for the given path, set start and end to the
-    // binary data to send to the client. Function returns false if no resource
-    // for the given path is known (404)
-    bool handleRequest(std::string path, const char** start, const char** end);
+    // binary data to send to the client, and content_type to its MIME
+    // type. Function returns false if no resource for the given path exists
+    bool handleRequest(std::string path, const char** start, const char** end, const char** content_type);
 
 private:
-    std::unordered_map<std::string, std::pair<const char*, const char*>> resources;
+    struct Resource {
+        const char* start;
+        const char* end;
+        const char* content_type;
+    };
+    std::unordered_map<std::string, const Resource> resources;
 };
 
 #endif // _LAMINAR_RESOURCES_H_

src/resources/index.html

@@ -17,7 +17,7 @@
  <script src="/js/app.js" defer></script>
  <style>
   body, html { height: 100%; }
-  .navbar { margin-bottom: 0; }
+  .navbar { margin-bottom: 0; border-radius: 0; }
   .navbar-brand { margin: 0 -15px; padding: 7px 15px }
   .navbar-brand>img { display: inline; }
   a.navbar-btn { color: #9d9d9d; }
@@ -48,13 +48,15 @@
       <td><router-link :to="'/jobs/'+job.name">{{job.name}}</router-link> <i>queued</i></td>
      </tr>
      <tr v-for="job in jobsRunning">
-      <td><img class="spin small" src="/progress.gif"> <router-link :to="'/jobs/'+job.name">{{job.name}}</router-link> <router-link :to="'/jobs/'+job.name+'/'+job.number">#{{job.number}}</router-link> <div class="progress">
-       <div class="progress-bar progress-bar-striped" :class="'progress-bar-'+(job.overtime?'warning':'info')" :class="job.etc?'':'active'" :style="'width:'+(!job.etc?'100':job.progress)+'%'"></div>
+      <td><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+job.name">{{job.name}}</router-link> <router-link :to="'/jobs/'+job.name+'/'+job.number">#{{job.number}}</router-link>
+       <small class="pull-right">{{formatDuration(job.started, job.completed)}}</small>
+       <div class="progress">
+         <div class="progress-bar progress-bar-striped" :class="'progress-bar-'+(job.overtime?'warning':'info')" :class="job.etc?'':'active'" :style="'width:'+(!job.etc?'100':job.progress)+'%'"></div>
        </div>
       </td>
      </tr>
      <tr v-for="job in jobsRecent">
-      <td><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+job.name">{{job.name}}</router-link> <router-link :to="'/jobs/'+job.name+'/'+job.number">#{{job.number}}</router-link><br><small>Took {{job.duration}}s at {{formatDate(job.started)}}</small></td>
+      <td><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+job.name">{{job.name}}</router-link> <router-link :to="'/jobs/'+job.name+'/'+job.number">#{{job.number}}</router-link><br><small>Took {{formatDuration(job.started, job.completed)}} at {{formatDate(job.started)}}</small></td>
      </tr>
     </table>
    </div>
@@ -111,6 +113,7 @@
       <td><router-link :to="'/jobs/'+job.name">{{job.name}}</router-link></td>
       <td class="text-center"><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+job.name+'/'+job.number">#{{job.number}}</router-link></td>
       <td class="text-center">{{formatDate(job.started)}}</td>
+      <td class="text-center">{{formatDuration(job.started,job.completed)}}</td>
      </tr>
     </table>
    </div>
@@ -146,15 +149,15 @@
       <td colspan="4"><i>{{nQueued}} run(s) queued</i></td>
      </tr>
      <tr v-for="job in jobsRunning" track-by="$index">
-      <td><img class="spin small" src="/progress.gif"> <router-link :to="'/jobs/'+$route.params.name+'/'+job.number">#{{job.number}}</router-link></td>
+      <td><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+$route.params.name+'/'+job.number">#{{job.number}}</router-link></td>
       <td class="text-center">{{formatDate(job.started)}}</td>
-      <td class="text-center">--</td>
+      <td class="text-center">{{formatDuration(job.started, job.completed)}}</td>
       <td class="text-center hidden-xs">{{job.reason}}</td>
      </tr>
      <tr v-for="job in jobsRecent" track-by="$index">
       <td><span v-html="runIcon(job.result)"></span> <router-link :to="'/jobs/'+$route.params.name+'/'+job.number">#{{job.number}}</router-link></td>
       <td class="text-center">{{formatDate(job.started)}}</td>
-      <td class="text-center">{{job.duration + " seconds"}}</td>
+      <td class="text-center">{{formatDuration(job.started, job.completed)}}</td>
       <td class="text-center hidden-xs">{{job.reason}}</td>
      </tr>
     </table>
@@ -167,7 +170,7 @@
   <div class="container-fluid">
    <div class="row">
     <div class="col-sm-5 col-md-6 col-lg-7">
-     <h3 style="float:left"><img class="spin" src="/progress.gif" v-show="job.result === 'running'"><span v-html="runIcon(job.result)"></span> {{$route.params.name}} #{{$route.params.number}}</h3>
+     <h3 style="float:left"><span v-html="runIcon(job.result)"></span> {{$route.params.name}} #{{$route.params.number}}</h3>
      <nav class="pull-left">
       <ul class="pagination" style="margin:15px 20px">
        <li v-show="$route.params.number > 1"><router-link :to="'/jobs/'+$route.params.name+'/'+($route.params.number-1)">&laquo;</router-link></li>
@@ -180,7 +183,7 @@
       <dt>Queued for</dt><dd>{{job.queued}}s</dd>
       <dt>Started</dt><dd>{{formatDate(job.started)}}</dd>
       <dt v-show="runComplete(job)">Completed</dt><dd v-show="job.completed">{{formatDate(job.completed)}}</dd>
-      <dt v-show="runComplete(job)">Duration</dt><dd v-show="runComplete(job)">{{job.duration}}s</dd>
+      <dt>Duration</dt><dd>{{formatDuration(job.started, job.completed)}}</dd>
      </dl>
     </div>
     <div class="col-sm-7 col-md-6 col-lg-5">
@@ -191,7 +194,7 @@
       <div class="panel-heading">Artifacts</div>
       <div class="panel-body">
        <ul class="list-unstyled" style="margin-bottom: 0">
-        <li v-for="art in job.artifacts"><router-link :to="art.url" target="_self">{{art.filename}}</router-link></li>
+        <li v-for="art in job.artifacts"><a :href="art.url" target="_self">{{art.filename}}</a></li>
        </ul>
       </div>
      </div>

src/resources/js/app.js

@@ -2,9 +2,13 @@
  * frontend application for Laminar Continuous Integration
  * https://laminar.ohwg.net
  */
+const wsp = function(path) {
+  return new WebSocket((location.protocol === 'https:'?'wss://':'ws://')
+                          + location.host + path);
+}
 const WebsocketHandler = function() {
   function setupWebsocket(path, next) {
-    var ws = new WebSocket("ws://" + window.location.host + path);
+    var ws = wsp(path);
     ws.onmessage = function(msg) {
       msg = JSON.parse(msg.data);
       // "status" is the first message the websocket always delivers.
@@ -50,7 +54,7 @@ const WebsocketHandler = function() {
 const Utils = {
   methods: {
     runIcon(result) {
-      return result === "success" ? '<span style="color:forestgreen;font-family:\'Zapf Dingbats\';">✔</span>' : result === "failed" || result === "aborted" ? '<span style="color:crimson;">✘</span>' : '';
+      return result === "success" ? '<img src="/tick.gif">' : result === "failed" || result === "aborted" ? '<img src="/cross.gif">' : '<img src="/spin.gif">';
     },
     formatDate: function(unix) {
       // TODO: reimplement when toLocaleDateString() accepts formatting options on most browsers
@@ -63,6 +67,16 @@ const Utils = {
         ][d.getMonth()] + ' ' +
         d.getFullYear();
     },
+    formatDuration: function(start, end) {
+      if(!end)
+        end = Math.floor(Date.now()/1000);
+      if(end - start > 3600)
+        return Math.floor((end-start)/3600) + ' hours, ' + Math.floor(((end-start)%3600)/60) + ' minutes';
+      else if(end - start > 60)
+        return Math.floor((end-start)/60) + ' minutes, ' + ((end-start)%60) + ' seconds';
+      else
+        return (end-start) + ' seconds';
+    }
   }
 };
 
@@ -138,7 +152,7 @@ const Home = function() {
               label: "Busy"
             },
             {
-              value: msg.executorsTotal,
+              value: msg.executorsTotal - msg.executorsBusy,
               color: "darkseagreen",
               label: "Idle"
             }
@@ -158,14 +172,14 @@ const Home = function() {
           }(),
           datasets: [{
             label: "Successful Builds",
-            fillColor: "darkseagreen",
+            fillColor: "rgba(143,188,143,0.65)", //darkseagreen at 0.65
             strokeColor: "forestgreen",
             data: msg.buildsPerDay.map(function(e) {
               return e.success || 0;
             })
           }, {
             label: "Failed Bulids",
-            fillColor: "darksalmon",
+            fillColor: "rgba(233,150,122,0.65)", //darksalmon at 0.65
             strokeColor: "crimson",
             data: msg.buildsPerDay.map(function(e) {
               return e.failed || 0;
@@ -243,7 +257,7 @@ const Jobs = function() {
   };
   return {
     template: '#jobs',
-    mixins: [WebsocketHandler, Utils],
+    mixins: [WebsocketHandler, Utils, ProgressUpdater],
     data: function() { return state; },
     computed: {
       filteredJobs() {
@@ -266,6 +280,18 @@ const Jobs = function() {
     methods: {
       status: function(msg) {
         state.jobs = msg.jobs;
+        state.jobsRunning = msg.running;
+        // mix running and completed jobs
+        for (var i in msg.running) {
+          var idx = state.jobs.findIndex(job => job.name === msg.running[i].name);
+          if (idx > -1)
+            state.jobs[idx] = msg.running[i];
+          else {
+            // special case: first run of a job.
+            state.jobs.unshift(msg.running[i]);
+            state.jobs.sort(function(a, b){return a.name < b.name ? -1 : a.name > b.name ? 1 : 0;});
+          }
+        }
         var tags = {};
         for (var i in state.jobs) {
           for (var j in state.jobs[i].tags) {
@@ -274,10 +300,46 @@ const Jobs = function() {
         }
         state.tags = Object.keys(tags);
       },
+      job_started: function(data) {
+        var updAt = null;
+        for (var i in state.jobsRunning) {
+          if (state.jobsRunning[i].name === data.name) {
+            updAt = i;
+            break;
+          }
+        }
+        if (updAt === null) {
+          state.jobsRunning.unshift(data);
+        } else {
+          state.jobsRunning[updAt] = data;
+        }
+        updAt = null;
+        for (var i in state.jobs) {
+          if (state.jobs[i].name === data.name) {
+            updAt = i;
+            break;
+          }
+        }
+        if (updAt === null) {
+          // first execution of new job. TODO insert without resort
+          state.jobs.unshift(data);
+          state.jobs.sort(function(a, b){return a.name < b.name ? -1 : a.name > b.name ? 1 : 0;});
+        } else {
+          state.jobs[updAt] = data;
+        }
+        this.$forceUpdate();
+      },
       job_completed: function(data) {
         for (var i in state.jobs) {
           if (state.jobs[i].name === data.name) {
             state.jobs[i] = data;
+            // forceUpdate in second loop
+            break;
+          }
+        }
+        for (var i in state.jobsRunning) {
+          if (state.jobsRunning[i].name === data.name) {
+            state.jobsRunning.splice(i, 1);
             this.$forceUpdate();
             break;
           }
@@ -297,7 +359,7 @@ var Job = function() {
   };
   return Vue.extend({
     template: '#job',
-    mixins: [WebsocketHandler, Utils],
+    mixins: [WebsocketHandler, Utils, ProgressUpdater],
     data: function() {
       return state;
     },
@@ -307,6 +369,7 @@ var Job = function() {
         state.jobsRecent = msg.recent;
         state.lastSuccess = msg.lastSuccess;
         state.lastFailed = msg.lastFailed;
+        state.nQueued = msg.nQueued;
 
         var chtBt = new Chart(document.getElementById("chartBt").getContext("2d")).Bar({
           labels: msg.recent.map(function(e) {
@@ -316,7 +379,7 @@ var Job = function() {
             fillColor: "darkseagreen",
             strokeColor: "forestgreen",
             data: msg.recent.map(function(e) {
-              return e.duration;
+              return e.completed - e.started;
             }).reverse()
           }]
         }, {
@@ -388,8 +451,7 @@ const Run = function() {
         state.log = '';
         state.job = data;
         state.latestNum = data.latestNum;
-        if (!!state.job.etc)
-          state.jobsRunning = [data];
+        state.jobsRunning = [data];
       },
       job_started: function(data) {
         state.latestNum++;
@@ -406,7 +468,7 @@ const Run = function() {
     },
     beforeRouteEnter(to, from, next) {
       next(vm => {
-        vm.logws = new WebSocket("ws://" + location.host + to.path + '/log');
+        vm.logws = wsp(to.path + '/log');
         vm.logws.onmessage = function(msg) {
           logHandler(vm, msg.data);
         }
@@ -415,7 +477,7 @@ const Run = function() {
     beforeRouteUpdate(to, from, next) {
       var vm = this;
       vm.logws.close();
-      vm.logws = new WebSocket("ws://" + location.host + to.path + '/log');
+      vm.logws = wsp(to.path + '/log');
       vm.logws.onmessage = function(msg) {
         logHandler(vm, msg.data);
       }

src/run.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/run.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///

src/server.cpp

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -199,7 +199,7 @@ public:
         // Handle plain HTTP requests by delivering the binary resource
         wss.set_http_handler([this](websocketpp::connection_hdl hdl){
             websocket::connection_ptr c = wss.get_con_from_hdl(hdl);
-            const char* start, *end;
+            const char* start, *end, *content_type;
             std::string resource = c->get_resource();
             if(resource.compare(0, strlen("/archive/"), "/archive/") == 0) {
                 std::string file(resource.substr(strlen("/archive/")));
@@ -211,8 +211,9 @@ public:
                 } else {
                     c->set_status(websocketpp::http::status_code::not_found);
                 }
-            } else if(resources.handleRequest(resource, &start, &end)) {
+            } else if(resources.handleRequest(resource, &start, &end, &content_type)) {
                 c->set_status(websocketpp::http::status_code::ok);
+                c->append_header("Content-Type", content_type);
                 c->append_header("Content-Encoding", "gzip");
                 c->append_header("Content-Transfer-Encoding", "binary");
                 std::string response(start,end);
@@ -406,7 +407,7 @@ void Server::start() {
     // this eventfd is just to allow us to quit the server at some point
     // in the future by adding this event to the async loop. I couldn't see
     // a simpler way...
-    efd_quit = eventfd(0,0);
+    efd_quit = eventfd(0, EFD_CLOEXEC|EFD_NONBLOCK);
     kj::Promise<void> quit = kj::evalLater([this](){
         static uint64_t _;
         auto wakeEvent = ioContext.lowLevelProvider->wrapInputFd(efd_quit);
@@ -419,9 +420,10 @@ void Server::stop() {
     eventfd_write(efd_quit, 1);
 }
 
-void Server::addDescriptor(int fd, std::function<void(char*,size_t)> cb) {
+void Server::addDescriptor(int fd, std::function<void(const char*,size_t)> cb) {
     auto event = this->ioContext.lowLevelProvider->wrapInputFd(fd, kj::LowLevelAsyncIoProvider::TAKE_OWNERSHIP);
-    tasks.add(handleFdRead(event, cb).attach(std::move(event)));
+    auto buffer = kj::heapArrayBuilder<char>(PROC_IO_BUFSIZE);
+    tasks.add(handleFdRead(event, buffer.asPtr().begin(), cb).attach(std::move(event)).attach(std::move(buffer)));
 }
 
 void Server::acceptHttpClient(kj::Own<kj::ConnectionReceiver>&& listener) {
@@ -454,12 +456,11 @@ void Server::acceptRpcClient(kj::Own<kj::ConnectionReceiver>&& listener) {
 // returns a promise which will read a chunk of data from the file descriptor
 // wrapped by stream and invoke the provided callback with the read data.
 // Repeats until ::read returns <= 0
-kj::Promise<void> Server::handleFdRead(kj::AsyncInputStream* stream, std::function<void(char*,size_t)> cb) {
-    static char* buffer = new char[PROC_IO_BUFSIZE];
-    return stream->tryRead(buffer, 1, PROC_IO_BUFSIZE).then([this,stream,cb](size_t sz) {
+kj::Promise<void> Server::handleFdRead(kj::AsyncInputStream* stream, char* buffer, std::function<void(const char*,size_t)> cb) {
+    return stream->tryRead(buffer, 1, PROC_IO_BUFSIZE).then([this,stream,buffer,cb](size_t sz) {
         if(sz > 0) {
             cb(buffer, sz);
-            return handleFdRead(stream, cb);
+            return handleFdRead(stream, kj::mv(buffer), cb);
         }
         return kj::Promise<void>(kj::READY_NOW);
     });

src/server.h

@@ -1,5 +1,5 @@
 ///
-/// Copyright 2016 Oliver Giles
+/// Copyright 2015-2017 Oliver Giles
 ///
 /// This file is part of Laminar
 ///
@@ -41,12 +41,12 @@ public:
 
     // add a file descriptor to be monitored for output. The callback will be
     // invoked with the read data
-    void addDescriptor(int fd, std::function<void(char*,size_t)> cb);
+    void addDescriptor(int fd, std::function<void(const char*,size_t)> cb);
 
 private:
     void acceptHttpClient(kj::Own<kj::ConnectionReceiver>&& listener);
     void acceptRpcClient(kj::Own<kj::ConnectionReceiver>&& listener);
-    kj::Promise<void> handleFdRead(kj::AsyncInputStream* stream, std::function<void(char*,size_t)> cb);
+    kj::Promise<void> handleFdRead(kj::AsyncInputStream* stream, char* buffer, std::function<void(const char*,size_t)> cb);
 
     void taskFailed(kj::Exception&& exception) override {
         kj::throwFatalException(kj::mv(exception));