edge.h

Go to the documentation of this file.

#ifndef TTG_EDGE_H
#define TTG_EDGE_H
 
#include <iostream>
#include <memory>
#include <vector>
 
#include "ttg/base/terminal.h"
#include "ttg/terminal.h"
#include "ttg/util/diagnose.h"
#include "ttg/util/print.h"
#include "ttg/util/trace.h"
 
namespace ttg {
 
  template <typename keyT, typename valueT>
  class Edge {
   private:
    // An EdgeImpl represents a single edge that most usually will
    // connect a single output terminal with a single
    // input terminal.  However, we had to relax this constraint in
    // order to easily accommodate connecting an input/output edge to
    // an operation that to the outside looked like a single op but
    // internally was implemented as multiple operations.  Thus, the
    // input/output edge has to connect to multiple terminals.
    // Permitting multiple end points makes this much easier to
    // compose, easier to implement, and likely more efficient at
    // runtime.  This is why outs/ins are vectors rather than pointers
    // to a single terminal.
    struct EdgeImpl {
      std::string name;
      bool is_pull_edge = false;
      std::vector<TerminalBase *> outs;  // In<keyT, valueT> or In<keyT, const valueT>
      std::vector<Out<keyT, valueT> *> ins;
 
      ttg::detail::ContainerWrapper<keyT, valueT> container;
 
      EdgeImpl() : name(""), outs(), ins() {}
 
      EdgeImpl(const std::string &name) : name(name), outs(), ins() {}
 
      EdgeImpl(const std::string &name, bool is_pull, ttg::detail::ContainerWrapper<keyT, valueT> &c)
          : name(name), is_pull_edge(is_pull), container(c), outs(), ins() {
        static_assert(!meta::is_void_v<keyT>, "Void keys are not supported with pull terminals.");
      }
 
      void set_in(Out<keyT, valueT> *in) {
        if (ins.size()) {
          trace("Edge: ", name, " : has multiple inputs");
        }
        in->is_pull_terminal = is_pull_edge;
        ins.push_back(in);
        try_to_connect_new_in(in);
      }
 
      void set_out(TerminalBase *out) {
        if (outs.size()) {
          trace("Edge: ", name, " : has multiple outputs");
        }
        out->is_pull_terminal = is_pull_edge;
        static_cast<In<keyT, valueT> *>(out)->container = container;
        outs.push_back(out);
        try_to_connect_new_out(out);
      }
 
      void try_to_connect_new_in(Out<keyT, valueT> *in) const {
        for (auto out : outs)
          if (in && out) in->connect(out);
      }
 
      void try_to_connect_new_out(TerminalBase *out) const {
        assert(out->get_type() != TerminalBase::Type::Write);  // out must be an In<>
        if (out->is_pull_terminal) {
          out->connect_pull_nopred(out);
        } else {
          for (auto in : ins)
            if (in && out) in->connect(out);
        }
      }
 
      ~EdgeImpl() {
        if (diagnose() && ((ins.size() == 0 && outs.size() != 0) || (ins.size() != 0 && outs.size() == 0)) &&
            !is_pull_edge) {
          print_error("Edge: destroying edge pimpl ('", name,
                      "') with either in or out not assigned --- graph may be incomplete");
        }
      }
    };
 
    // We have a vector here to accommodate fusing multiple edges together
    // when connecting them all to a single terminal.
    mutable std::vector<std::shared_ptr<EdgeImpl>> p;  // Need shallow copy semantics
 
   public:
    typedef Out<keyT, valueT> output_terminal_type;
    typedef keyT key_type;
    typedef valueT value_type;
    static_assert(std::is_same_v<keyT, std::decay_t<keyT>>, "Edge<keyT,valueT> assumes keyT is a non-decayable type");
    static_assert(std::is_same_v<valueT, std::decay_t<valueT>>,
                  "Edge<keyT,valueT> assumes valueT is a non-decayable type");
 
    Edge(const std::string name = "anonymous edge") : p(1) { p[0] = std::make_shared<EdgeImpl>(name); }
 
    Edge(const std::string name, bool is_pull, ttg::detail::ContainerWrapper<keyT, valueT> c) : p(1) {
      p[0] = std::make_shared<EdgeImpl>(name, is_pull, c);
    }
 
    template <typename... valuesT, typename = std::enable_if_t<(std::is_same_v<valuesT, valueT> && ...)>>
    Edge(const Edge<keyT, valuesT> &...edges) : p(0) {
      std::vector<Edge<keyT, valueT>> v = {edges...};
      // Do not allow fusing of push and pull terminals
      if (!std::all_of(v.begin(), v.end(), [](Edge<keyT, valueT> e) { return !e.is_pull_edge(); }))
        throw std::runtime_error("Edge: fusing push and pull terminals is not supported.");
 
      for (auto &edge : v) {
        p.insert(p.end(), edge.p.begin(), edge.p.end());
      }
    }
 
    Edge<keyT, valueT> edge() const { return *this; }
 
    bool live() const {
      bool result = false;
      for (const auto &edge : p) {
        if (!edge->ins.empty()) return true;
      }
      return result;
    }
 
    bool is_pull_edge() const { return p.at(0)->is_pull_edge; }
 
    void set_in(Out<keyT, valueT> *in) const {
      for (auto &edge : p) edge->set_in(in);
    }
 
    void set_out(TerminalBase *out) const {
      for (auto &edge : p) edge->set_out(out);
    }
 
    template <typename Key = keyT, typename Value = valueT>
    std::enable_if_t<ttg::meta::is_all_void_v<Key, Value>> fire() const {
      for (auto &&e : p)
        for (auto &&out : e->outs) {
          out->get_tt()->invoke();
        }
    }
  };
 
  // Make type of tuple of edges from type of tuple of terminals
  template <typename termsT>
  struct terminals_to_edges;
  template <typename... termsT>
  struct terminals_to_edges<std::tuple<termsT...>> {
    typedef std::tuple<typename termsT::edge_type...> type;
  };
 
  // Make type of tuple of output terminals from type of tuple of edges
  template <typename edgesT>
  struct edges_to_output_terminals;
  template <typename... edgesT>
  struct edges_to_output_terminals<std::tuple<edgesT...>> {
    typedef std::tuple<typename edgesT::output_terminal_type...> type;
  };
 
  namespace detail {
    template <typename keyT, typename valuesT>
    struct edges_tuple;
 
    template <typename keyT, typename... valuesT>
    struct edges_tuple<keyT, std::tuple<valuesT...>> {
      using type = std::tuple<ttg::Edge<keyT, valuesT>...>;
    };
 
    template <typename keyT, typename valuesT>
    using edges_tuple_t = typename edges_tuple<keyT, valuesT>::type;
  }  // namespace detail
 
}  // namespace ttg
 
#endif  // TTG_EDGE_H