sink.h 4.5 KB
Newer Older
1
/*
Marcus Winter committed
2
 * Copyright (c) 2014-2016, Siemens AG. All rights reserved.
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifndef EMBB_DATAFLOW_INTERNAL_SINK_H_
#define EMBB_DATAFLOW_INTERNAL_SINK_H_

#include <embb/dataflow/internal/node.h>
#include <embb/dataflow/internal/inputs.h>
#include <embb/dataflow/internal/sink_executor.h>
#include <embb/dataflow/internal/action.h>

namespace embb {
namespace dataflow {
namespace internal {

39
template <class Inputs> class Sink;
40 41 42

template <
  typename I1, typename I2, typename I3, typename I4, typename I5>
43
class Sink< Inputs<I1, I2, I3, I4, I5> >
44 45 46
  : public Node
  , public ClockListener {
 public:
47
  typedef Inputs<I1, I2, I3, I4, I5> InputsType;
48 49 50
  typedef SinkExecutor< InputsType > ExecutorType;
  typedef typename ExecutorType::FunctionType FunctionType;

51
  Sink(Scheduler * sched, ClockListener * listener,
52
    FunctionType function)
53
    : inputs_()
54 55
    , executor_(function)
    , action_(NULL)
56
    , slices_(0) {
57
    next_clock_ = 0;
58 59
    queued_clock_ = 0;
    queue_id_ = GetNextProcessID();
60
    inputs_.SetListener(this);
61
    listener_ = listener;
62
    SetScheduler(sched);
63 64
  }

65 66 67 68 69 70
  ~Sink() {
    if (NULL != action_) {
      embb::base::Allocation::Free(action_);
    }
  }

71 72 73 74 75 76 77 78 79 80 81
  virtual bool HasInputs() const {
    return inputs_.Size() > 0;
  }

  virtual void Run(int clock) {
    if (inputs_.AreNoneBlank(clock)) {
      executor_.Execute(clock, inputs_);
    }
    listener_->OnClock(clock);
  }

82 83
  virtual bool IsFullyConnected() {
    return inputs_.IsFullyConnected();
84 85
  }

86 87 88 89 90 91 92 93 94 95
  InputsType & GetInputs() {
    return inputs_;
  }

  template <int Index>
  typename TypeAt<typename InputsType::Types, Index>::Result & GetInput() {
    return inputs_.template Get<Index>();
  }

  virtual void OnClock(int clock) {
96 97
    EMBB_UNUSED_IN_RELEASE(clock);
    assert(inputs_.AreAtClock(clock));
98 99 100 101

    bool retry = true;
    while (retry) {
      int clk = next_clock_;
102
      int clk_end = clk + slices_;
103 104 105 106 107 108 109 110 111
      int clk_res = clk;
      for (int ii = clk; ii < clk_end; ii++) {
        if (!inputs_.AreAtClock(ii)) {
          break;
        }
        clk_res++;
      }
      if (clk_res > clk) {
        if (next_clock_.CompareAndSwap(clk, clk_res)) {
112
          while (queued_clock_.Load() < clk) continue;
113
          for (int ii = clk; ii < clk_res; ii++) {
114
            const int idx = ii % slices_;
115
            action_[idx] = Action(this, ii);
116
            sched_->Enqueue(queue_id_, action_[idx], policy_);
117 118 119 120 121 122 123 124
          }
          queued_clock_.Store(clk_res);
          retry = false;
        }
      } else {
        retry = false;
      }
    }
125 126 127 128 129
  }

 private:
  InputsType inputs_;
  ExecutorType executor_;
130
  Action * action_;
131
  ClockListener * listener_;
132 133 134
  embb::base::Atomic<int> next_clock_;
  embb::base::Atomic<int> queued_clock_;
  int queue_id_;
135
  int slices_;
136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152

  virtual void SetSlices(int slices) {
    if (0 < slices_) {
      embb::base::Allocation::Free(action_);
      action_ = NULL;
    }
    slices_ = slices;
    inputs_.SetSlices(slices);
    if (0 < slices_) {
      action_ = reinterpret_cast<Action*>(
        embb::base::Allocation::Allocate(
          sizeof(Action)*slices_));
      for (int ii = 0; ii < slices_; ii++) {
        action_[ii] = Action();
      }
    }
  }
153 154 155 156 157 158 159
};

} // namespace internal
} // namespace dataflow
} // namespace embb

#endif // EMBB_DATAFLOW_INTERNAL_SINK_H_