/// /// Copyright 2016 Oliver Giles /// /// This file is part of Laminar /// /// Laminar 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. /// /// Laminar 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 Laminar. If not, see /// #ifndef _LAMINAR_LAMINAR_H_ #define _LAMINAR_LAMINAR_H_ #include "interface.h" #include "run.h" #include "node.h" #include "database.h" #include // Node name to node object map typedef std::unordered_map NodeMap; struct Server; class Json; // The main class implementing the application's business logic. // It owns a Server to manage the HTTP/websocket and Cap'n Proto RPC // interfaces and communicates via the LaminarInterface methods and // the LaminarClient objects (see interface.h) class Laminar final : public LaminarInterface { public: Laminar(); ~Laminar(); // Runs the application forever void run(); // Call this in a signal handler to make run() return void stop(); // Implementations of LaminarInterface std::shared_ptr queueJob(std::string name, ParamMap params = ParamMap()) override; kj::Promise waitForRun(std::string name, int buildNum) override; kj::Promise waitForRun(const Run* run) override; void registerClient(LaminarClient* client) override; void deregisterClient(LaminarClient* client) override; void sendStatus(LaminarClient* client) override; bool setParam(std::string job, int buildNum, std::string param, std::string value) override; bool getArtefact(std::string path, std::string& result) override; private: bool loadConfiguration(); void reapAdvance(); void assignNewJobs(); bool stepRun(std::shared_ptr run); void runFinished(Run*); bool nodeCanQueue(const Node&, const Run&) const; // expects that Json has started an array void populateArtifacts(Json& out, std::string job, int num) const; Run* activeRun(std::string name, int num) { auto it = activeJobs.get<1>().find(boost::make_tuple(name, num)); return it == activeJobs.get<1>().end() ? nullptr : it->get(); } std::list> queuedJobs; // Implements the waitForRun API. // TODO: refactor struct Waiter { Waiter() : paf(kj::newPromiseAndFulfiller()) {} void release(RunState state) { paf.fulfiller->fulfill(RunState(state)); } kj::Promise takePromise() { return std::move(paf.promise); } private: kj::PromiseFulfillerPair paf; }; std::unordered_map> waiters; std::unordered_map buildNums; std::unordered_map> jobTags; RunSet activeJobs; Database* db; Server* srv; NodeMap nodes; std::string homeDir; std::set clients; bool eraseWorkdir; std::string archiveUrl; }; #endif // _LAMINAR_LAMINAR_H_