CompilerAsync.hpp

Go to the documentation of this file.

#ifndef PROTEUS_ASYNC_COMPILER_HPP
#define PROTEUS_ASYNC_COMPILER_HPP
 
#include <condition_variable>
#include <deque>
#include <thread>
 
#include "proteus/CompilationTask.hpp"
#include "proteus/Debug.h"
#include "proteus/Hashing.hpp"
 
namespace proteus {
 
using namespace llvm;
 
class CompilationResult {
public:
  explicit CompilationResult() : IsReadyFlag{false} {}
 
  CompilationResult(const CompilationResult &) = delete;
  CompilationResult &operator=(const CompilationResult &) = delete;
 
  CompilationResult(CompilationResult &&) noexcept = delete;
  CompilationResult &operator=(CompilationResult &&) noexcept = delete;
 
  bool isReady() { return IsReadyFlag; }
 
  void set(std::unique_ptr<MemoryBuffer> ObjBuf) {
    ResultObjBuf = std::move(ObjBuf);
    IsReadyFlag = true;
  }
 
  void wait() {
    // Busy wait until it's ready.
    while (!IsReadyFlag) {
      std::this_thread::yield();
    }
  }
 
  std::unique_ptr<MemoryBuffer> take() { return std::move(ResultObjBuf); }
 
private:
  std::atomic<bool> IsReadyFlag;
  std::unique_ptr<MemoryBuffer> ResultObjBuf;
};
 
class CompilerAsync {
public:
  static CompilerAsync &instance(int NumThreads) {
    static CompilerAsync Singleton{NumThreads};
    return Singleton;
  }
 
  void compile(CompilationTask &&CT) {
    std::unique_lock Lock{Mutex};
    Worklist.emplace_back(std::move(CT));
    CompilationResultMap.emplace(CT.getHashValue(),
                                 std::make_unique<CompilationResult>());
    CondVar.notify_one();
  }
 
  void run() {
    [[maybe_unused]] int Count = 0;
    while (Active) {
      std::unique_lock Lock(Mutex);
      CondVar.wait(Lock, [this] { return !Worklist.empty() || !Active; });
      if (!Active)
        break;
      if (Worklist.empty())
        PROTEUS_FATAL_ERROR("Expected non-empty Worklist");
      CompilationTask CT = std::move(Worklist.front());
      Worklist.pop_front();
      Lock.unlock();
 
      Count++;
      std::unique_ptr<MemoryBuffer> ObjBuf = CT.compile();
      Lock.lock();
      CompilationResultMap.at(CT.getHashValue())->set(std::move(ObjBuf));
      Lock.unlock();
    }
 
    PROTEUS_DBG(Logger::logs("proteus")
                << "Thread exiting! Compiled " + std::to_string(Count) + "\n");
  }
 
  void joinAllThreads() {
    Active = false;
    CondVar.notify_all();
 
    for (auto &Thread : Threads)
      Thread.join();
 
    Threads.clear();
  }
 
  bool isCompilationPending(HashT HashValue) {
    std::unique_lock Lock{Mutex};
    return !(CompilationResultMap.find(HashValue) ==
             CompilationResultMap.end());
  }
 
  std::unique_ptr<MemoryBuffer> takeCompilationResult(HashT HashValue,
                                                      bool BlockingWait) {
    std::unique_lock Lock{Mutex};
    auto It = CompilationResultMap.find(HashValue);
    if (It == CompilationResultMap.end())
      return nullptr;
 
    std::unique_ptr<CompilationResult> &CRes = It->second;
    Lock.unlock();
 
    if (BlockingWait)
      CRes->wait();
    else {
      if (!CRes->isReady())
        return nullptr;
    }
 
    // If compilation result is ready, take ownership of the buffer, erase it
    // from the compilation results map and move the buffer to the caller.
    std::unique_ptr<MemoryBuffer> ObjBuf = CRes->take();
    Lock.lock();
    // Use the HashValue key as the iterator may have been invalidated by
    // insert/emplace from another thread.
    CompilationResultMap.erase(HashValue);
    Lock.unlock();
    return ObjBuf;
  }
 
private:
  std::atomic<bool> Active;
  std::mutex Mutex;
  std::condition_variable CondVar;
  std::unordered_map<HashT, std::unique_ptr<CompilationResult>>
      CompilationResultMap;
  std::deque<CompilationTask> Worklist;
  std::vector<std::thread> Threads;
 
  CompilerAsync(int NumThreads) {
    Active = true;
    for (int I = 0; I < NumThreads; ++I)
      Threads.emplace_back(&CompilerAsync::run, this);
  }
 
  ~CompilerAsync() {
    if (Threads.size() > 0)
      joinAllThreads();
  }
};
 
} // namespace proteus
 
#endif